- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 523 for Qword6 (0.17 sec)
-
src/crypto/internal/boring/doc.go
// When enabled is false, all functions in this package panic. // // BoringCrypto is only available on linux/amd64 and linux/arm64 systems. const Enabled = available // A BigInt is the raw words from a BigInt. // This definition allows us to avoid importing math/big. // Conversion between BigInt and *big.Int is in crypto/internal/boring/bbig.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 07 05:28:51 UTC 2023 - 826 bytes - Viewed (0) -
src/math/big/arith_ppc64x.s
MOVD 8(R8), R11 MOVD 8(R9), R16 SUBE R16, R11, R20 MOVD R20, 8(R10) final: ADDZE R4 XOR $1, R4 done: MOVD R4, c+72(FP) RET // func addVW(z, x []Word, y Word) (c Word) TEXT ·addVW(SB), NOSPLIT, $0 MOVD z+0(FP), R10 // R10 = z[] MOVD x+24(FP), R8 // R8 = x[] MOVD y+48(FP), R4 // R4 = y = c MOVD z_len+8(FP), R11 // R11 = z_len
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 18:17:17 UTC 2024 - 16.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/arch/ppc64/ppc64asm/field.go
"strings" ) // A BitField is a bit-field in a 32-bit word. // Bits are counted from 0 from the MSB to 31 as the LSB. type BitField struct { Offs uint8 // the offset of the left-most bit. Bits uint8 // length in bits. // This instruction word holding this field. // It is always 0 for ISA < 3.1 instructions. It is // in decoding order. (0 == prefix, 1 == suffix on ISA 3.1) Word uint8 } func (b BitField) String() string {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 10 18:59:52 UTC 2023 - 2.8K bytes - Viewed (0) -
src/internal/runtime/atomic/atomic_arm.go
word := uint32(v) << ((uaddr & 3) * 8) // little endian for { old := *addr32 if Cas(addr32, old, old|word) { return } } } //go:nosplit func And8(addr *uint8, v uint8) { // Align down to 4 bytes and use 32-bit CAS. uaddr := uintptr(unsafe.Pointer(addr)) addr32 := (*uint32)(unsafe.Pointer(uaddr &^ 3)) word := uint32(v) << ((uaddr & 3) * 8) // little endian
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 19:57:43 UTC 2024 - 4.8K bytes - Viewed (0) -
test/fibo.go
short = flag.Bool("short", false, "only print first 10 digits of result") ) // A large natural number is represented by a nat, each "digit" is // a big.Word; the value zero corresponds to the empty nat slice. type nat []big.Word const W = 1 << (5 + ^big.Word(0)>>63) // big.Word size in bits // The following methods are extracted from math/big to make this a // stand-alone program that can easily be run without dependencies
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 08 22:22:58 UTC 2014 - 6.3K bytes - Viewed (0) -
src/regexp/syntax/perl_groups.go
`[:punct:]`: {+1, code13}, `[:^punct:]`: {-1, code13}, `[:space:]`: {+1, code14}, `[:^space:]`: {-1, code14}, `[:upper:]`: {+1, code15}, `[:^upper:]`: {-1, code15}, `[:word:]`: {+1, code16}, `[:^word:]`: {-1, code16}, `[:xdigit:]`: {+1, code17}, `[:^xdigit:]`: {-1, code17},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 13:59:01 UTC 2024 - 2.3K bytes - Viewed (0) -
src/main/webapp/js/help.js
$("#numSearchOption").prop("selectedIndex", 0); return false; }); if (typeof $.fn.suggestor === "function") { $("#query").suggestor({ ajaxinfo: { url: contextPath + "/api/v1/suggest-words", fn: ["_default", "content", "title"], num: 10, lang: $("#langSearchOption").val() }, boxCssInfo: { border: "1px solid rgba(82, 168, 236, 0.5)",
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Mar 30 05:45:24 UTC 2023 - 2K bytes - Viewed (0) -
src/math/big/natconv_test.go
// If x == 0, the result is -1. func log2(x Word) int { return bits.Len(uint(x)) - 1 } func itoa(x nat, base int) []byte { // special cases switch { case base < 2: panic("illegal base") case len(x) == 0: return []byte("0") } // allocate buffer for conversion i := x.bitLen()/log2(Word(base)) + 1 // +1: round up s := make([]byte, i) // don't destroy x
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 12:54:00 UTC 2019 - 16.8K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/helper/PopularWordHelper.java
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Feb 22 01:37:57 UTC 2024 - 5.6K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat_asm.go
import "internal/cpu" // amd64 assembly uses ADCX/ADOX/MULX if ADX is available to run two carry // chains in the flags in parallel across the whole operation, and aggressively // unrolls loops. arm64 processes four words at a time. // // It's unclear why the assembly for all other architectures, as well as for // amd64 without ADX, perform better than the compiler output. // TODO(filippo): file cmd/compile performance issue.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Aug 15 07:52:41 UTC 2023 - 942 bytes - Viewed (0)