- Sort Score
- Result 10 results
- Languages All
Results 131 - 140 of 1,081 for cbits (0.42 sec)
-
src/cmd/compile/internal/test/testdata/loadstore_test.go
} } //go:noinline func loadHitStore8(x int8, p *int8) int32 { x *= x // try to trash high bits (arch-dependent) *p = x // store return int32(*p) // load and cast } //go:noinline func loadHitStoreU8(x uint8, p *uint8) uint32 { x *= x // try to trash high bits (arch-dependent) *p = x // store return uint32(*p) // load and cast } //go:noinline
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 05 17:54:15 UTC 2022 - 4.8K bytes - Viewed (0) -
src/cmd/internal/objabi/reloctype.go
// R_ARM64_LDST8 sets a LD/ST immediate value to bits [11:0] of a local address. R_ARM64_LDST8 // R_ARM64_LDST16 sets a LD/ST immediate value to bits [11:1] of a local address. R_ARM64_LDST16 // R_ARM64_LDST32 sets a LD/ST immediate value to bits [11:2] of a local address. R_ARM64_LDST32 // R_ARM64_LDST64 sets a LD/ST immediate value to bits [11:3] of a local address. R_ARM64_LDST64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 17:26:07 UTC 2024 - 17.3K bytes - Viewed (0) -
okhttp/src/main/kotlin/okhttp3/internal/idn/IdnaMappingTable.kt
* * ``` * 0..63 : Length of the UTF-16 sequence that this range maps to. The offset is b2b3. * 64..79 : Offset by a fixed negative offset. The bottom 4 bits of b1 are the top 4 bits of the offset. * 80..95 : Offset by a fixed positive offset. The bottom 4 bits of b1 are the top 4 bits of the offset. * 119 : Ignored. * 120 : Valid. * 121 : Disallowed * 122 : Mapped inline to the sequence: [b2].
Registered: Sun Jun 16 04:42:17 UTC 2024 - Last Modified: Tue Apr 02 11:39:58 UTC 2024 - 9K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe.go
return nil, errors.New("edwards25519: invalid field element input size") } // Bits 0:51 (bytes 0:8, bits 0:64, shift 0, mask 51). v.l0 = byteorder.LeUint64(x[0:8]) v.l0 &= maskLow51Bits // Bits 51:102 (bytes 6:14, bits 48:112, shift 3, mask 51). v.l1 = byteorder.LeUint64(x[6:14]) >> 3 v.l1 &= maskLow51Bits // Bits 102:153 (bytes 12:20, bits 96:160, shift 6, mask 51). v.l2 = byteorder.LeUint64(x[12:20]) >> 6
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 11.8K bytes - Viewed (0) -
src/main/java/jcifs/internal/dtyp/ACE.java
* the operation and the desired access bits are compared to the SID * and access mask of each ACE. If the SID matches, the allow/deny flags * and access mask are considered. If the ACE is a "deny" * ACE and <i>any</i> of the desired access bits match bits in the access * mask of the ACE, the whole access check fails. If the ACE is an "allow" * ACE and <i>all</i> of the bits in the desired access bits match bits in
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 5.4K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/text/unicode/norm/forminfo.go
// trailing CCC shifted left 2 bits. The two least-significant bits of tccc // are the number of trailing non-starters. const ( qcInfoMask = 0x3F // to clear all but the relevant bits in a qcInfo headerLenMask = 0x3F // extract the length value from the header byte headerFlagsMask = 0xC0 // extract the qcInfo bits from the header byte )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 24 13:01:26 UTC 2024 - 8.7K bytes - Viewed (0) -
src/vendor/golang.org/x/text/unicode/norm/forminfo.go
// trailing CCC shifted left 2 bits. The two least-significant bits of tccc // are the number of trailing non-starters. const ( qcInfoMask = 0x3F // to clear all but the relevant bits in a qcInfo headerLenMask = 0x3F // extract the length value from the header byte headerFlagsMask = 0xC0 // extract the qcInfo bits from the header byte )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 10 18:59:52 UTC 2023 - 8.7K bytes - Viewed (0) -
src/net/netip/uint128.go
package netip import "math/bits" // uint128 represents a uint128 using two uint64s. // // When the methods below mention a bit number, bit 0 is the most // significant bit (in hi) and bit 127 is the lowest (lo&1). type uint128 struct { hi uint64 lo uint64 } // mask6 returns a uint128 bitmask with the topmost n bits of a // 128-bit number. func mask6(n int) uint128 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 07 21:28:44 UTC 2022 - 2.2K bytes - Viewed (1) -
src/main/java/jcifs/ACE.java
* the operation and the desired access bits are compared to the SID * and access mask of each ACE. If the SID matches, the allow/deny flags * and access mask are considered. If the ACE is a "deny" * ACE and <i>any</i> of the desired access bits match bits in the access * mask of the ACE, the whole access check fails. If the ACE is an "allow" * ACE and <i>all</i> of the bits in the desired access bits match bits in
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Sun Jul 01 13:12:10 UTC 2018 - 6.5K bytes - Viewed (0) -
src/crypto/x509/oid.go
} func parseBase128Int(bytes []byte, initOffset int) (ret, offset int, failed bool) { offset = initOffset var ret64 int64 for shifted := 0; offset < len(bytes); shifted++ { // 5 * 7 bits per byte == 35 bits of data // Thus the representation is either non-minimal or too large for an int32 if shifted == 5 { failed = true return } ret64 <<= 7 b := bytes[offset]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 19:10:38 UTC 2024 - 8.3K bytes - Viewed (0)