- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 67 for Shift3 (0.2 sec)
-
src/crypto/cipher/gcm.go
// gcmDouble returns the result of doubling an element of GF(2¹²⁸). func gcmDouble(x *gcmFieldElement) (double gcmFieldElement) { msbSet := x.high&1 == 1 // Because of the bit-ordering, doubling is actually a right shift. double.high = x.high >> 1 double.high |= x.low << 63 double.low = x.low >> 1 // If the most-significant bit was set before shifting then it, // conceptually, becomes a term of x^128. This is greater than the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 13.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
* little-endian. Long.numberOfTrailingZeros(diff) tells us the least significant * nonzero bit, and zeroing out the first three bits of L.nTZ gives us the shift to get * that least significant nonzero byte. */ int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 18.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/PPC64Ops.go
{name: "ROTLW", argLength: 2, reg: gp21, asm: "ROTLW"}, // uint32(arg0) rotate left by arg1 mod 32 // The following are ops to implement the extended mnemonics for shifts as described in section C.8 of the ISA. // The constant shift values are packed into the aux int32. {name: "CLRLSLWI", argLength: 1, reg: gp11, asm: "CLRLSLWI", aux: "Int32"}, // {name: "CLRLSLDI", argLength: 1, reg: gp11, asm: "CLRLSLDI", aux: "Int32"}, //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 19:59:38 UTC 2024 - 43.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/value.go
// Unused portions of AuxInt are filled by sign-extending the used portion, // even if the represented value is unsigned. // Users of AuxInt which interpret AuxInt as unsigned (e.g. shifts) must be careful. // Use Value.AuxUnsigned to get the zero-extended value of AuxInt. AuxInt int64 Aux Aux // Arguments of this value Args []*Value // Containing basic block Block *Block
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 16:40:22 UTC 2024 - 16.7K bytes - Viewed (0) -
src/slices/slices.go
// s: aaaaaaaavvvvbbbbcccccccc // ^ ^ ^ ^ // i i+m n n+m // That's the result we want. return s } // The hard case - v overlaps c or d. We can't just shift up // the data because we'd move or clobber the values we're trying // to insert. // So instead, write v on top of d, then rotate. copy(s[n:], v) // Now we have // s: aaaaaaaabbbbccccccccvvvv
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 29 14:01:59 UTC 2024 - 13.6K bytes - Viewed (0) -
src/image/jpeg/scan.go
case 3: dst, stride = d.blackPix[8*(by*d.blackStride+bx):], d.blackStride default: return UnsupportedError("too many components") } } // Level shift by +128, clip to [0, 255], and write to dst. for y := 0; y < 8; y++ { y8 := y * 8 yStride := y * stride for x := 0; x < 8; x++ { c := b[y8+x] if c < -128 { c = 0 } else if c > 127 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 00:46:29 UTC 2024 - 15.7K bytes - Viewed (0) -
src/internal/types/testdata/check/stmt0.go
} g := func(int, bool){} var m map[int]int g(m[0]) /* ERROR "not enough arguments" */ // assignments to _ _ = nil /* ERROR "use of untyped nil" */ _ = 1 << /* ERROR "constant shift overflow" */ 1000 (_) = 0 } func assignments2() { type mybool bool var m map[string][]bool var s []bool var b bool var d mybool _ = s _ = b _ = d
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 19K bytes - Viewed (0) -
src/crypto/ecdsa/ecdsa.go
// an integer modulo N. This is the absolute worst of all worlds: we still // have to reduce, because the result might still overflow N, but to take // the left-most bits for P-521 we have to do a right shift. if size := c.N.Size(); len(hash) >= size { hash = hash[:size] if excess := len(hash)*8 - c.N.BitLen(); excess > 0 { hash = bytes.Clone(hash) for i := len(hash) - 1; i >= 0; i-- { hash[i] >>= excess
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:18 UTC 2024 - 20.4K bytes - Viewed (0) -
src/compress/flate/deflate.go
hashMatch [maxMatchLength - 1]uint32 } func (d *compressor) fillDeflate(b []byte) int { if d.index >= 2*windowSize-(minMatchLength+maxMatchLength) { // shift the window by windowSize copy(d.window, d.window[windowSize:2*windowSize]) d.index -= windowSize d.windowEnd -= windowSize if d.blockStart >= windowSize { d.blockStart -= windowSize } else {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 26 13:32:40 UTC 2024 - 20.3K bytes - Viewed (0) -
src/runtime/sys_linux_ppc64x.s
MOVW flags+0(FP), R4 SYSCALL $SYS_pipe2 MOVW R3, errno+16(FP) RET // func usleep(usec uint32) TEXT runtime·usleep(SB),NOSPLIT,$16-4 MOVW usec+0(FP), R3 // Use magic constant 0x8637bd06 and shift right 51 // to perform usec/1000000. MOVD $0x8637bd06, R4 MULLD R3, R4, R4 // Convert usec to S. SRD $51, R4, R4 MOVD R4, 8(R1) // Store to tv_sec MOVD $1000000, R5
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 18:17:17 UTC 2024 - 18.1K bytes - Viewed (0)