- Sort Score
- Result 10 results
- Languages All
Results 1 - 6 of 6 for Rsh (0.03 sec)
-
src/cmd/asm/internal/lex/tokenizer.go
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Thu Aug 04 20:35:21 UTC 2022 - 3K bytes - Viewed (0) -
misc/cgo/gmp/gmp.go
} // Lsh sets z = x << s and returns z. func (z *Int) Lsh(x *Int, s uint) *Int { x.doinit() z.doinit() C._mpz_mul_2exp(&z.i[0], &x.i[0], C.ulong(s)) return z } // Rsh sets z = x >> s and returns z. func (z *Int) Rsh(x *Int, s uint) *Int { x.doinit() z.doinit() C._mpz_div_2exp(&z.i[0], &x.i[0], C.ulong(s)) return z } // Exp sets z = x^y % m and returns z. // If m == nil, Exp sets z = x^y.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 9.5K bytes - Viewed (0) -
src/cmd/asm/internal/lex/lex.go
type ScanToken rune const ( // Asm defines some two-character lexemes. We make up // a rune/ScanToken value for them - ugly but simple. LSH ScanToken = -1000 - iota // << Left shift. RSH // >> Logical right shift. ARR // -> Used on ARM for shift type 3, arithmetic right shift.
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Tue Aug 29 18:31:05 UTC 2023 - 4.1K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
// ">>" == 1 // "->" == 2 // "@>" == 3 r1, ok := p.registerReference(name) if !ok { return 0 } var op int16 switch p.next().ScanToken { case lex.LSH: op = 0 case lex.RSH: op = 1 case lex.ARR: op = 2 case lex.ROT: // following instructions on ARM64 support rotate right // AND, ANDS, TST, BIC, BICS, EON, EOR, ORR, MVN, ORN op = 3 } tok := p.next()
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Fri Feb 14 15:13:11 UTC 2025 - 37.3K bytes - Viewed (0) -
lib/fips140/v1.0.0.zip
[32]byte byteorder.BEPutUint64(out[24:], s[0]) byteorder.BEPutUint64(out[16:], s[1]) byteorder.BEPutUint64(out[8:], s[2]) byteorder.BEPutUint64(out[:], s[3]) return out[:] } // Rsh returns the 64 least significant bits of x >> n. n must be lower // than 256. The value of n leaks through timing side-channels. func (s *p256OrdElement) Rsh(n int) uint64 { i := n / 64 n = n % 64 res := s[i] >> n // Shift in the more significant limb, if present. if i := i + 1; i < len(s) { res |= s[i] << (64 - n) } return res...
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Jan 29 15:10:35 UTC 2025 - 635K bytes - Viewed (0) -
api/go1.txt
pkg math/big, method (*Int) QuoRem(*Int, *Int, *Int) (*Int, *Int) pkg math/big, method (*Int) Rand(*rand.Rand, *Int) *Int pkg math/big, method (*Int) Rem(*Int, *Int) *Int pkg math/big, method (*Int) Rsh(*Int, uint) *Int pkg math/big, method (*Int) Scan(fmt.ScanState, int32) error pkg math/big, method (*Int) Set(*Int) *Int pkg math/big, method (*Int) SetBit(*Int, int, uint) *Int
Registered: Tue Sep 09 11:13:09 UTC 2025 - Last Modified: Wed Aug 14 18:58:28 UTC 2013 - 1.7M bytes - Viewed (0)