- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 54 for bitMasks (0.17 sec)
-
src/cmd/compile/internal/walk/walk.go
n = walkExpr(n, init) } else { n = walkStmt(n) } init.Append(n) } // The max number of defers in a function using open-coded defers. We enforce this // limit because the deferBits bitmask is currently a single byte (to minimize code size) const maxOpenDefers = 8 // backingArrayPtrLen extracts the pointer and length from a slice or string. // This constructs two nodes referring to n, so n must be a cheapExpr.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 20:56:00 UTC 2024 - 10.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
// But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax long delta = a - b; // can't overflow, since a and b are nonnegative long minDeltaOrZero = delta & (delta >> (Long.SIZE - 1)); // equivalent to Math.min(delta, 0)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
guava/src/com/google/common/math/LongMath.java
// But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax long delta = a - b; // can't overflow, since a and b are nonnegative long minDeltaOrZero = delta & (delta >> (Long.SIZE - 1)); // equivalent to Math.min(delta, 0)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 44.6K bytes - Viewed (0) -
src/runtime/mbitmap.go
dst = add1(dst) bits >>= 8 } return totalBits } // materializeGCProg allocates space for the (1-bit) pointer bitmask // for an object of size ptrdata. Then it fills that space with the // pointer bitmask specified by the program prog. // The bitmask starts at s.startAddr. // The result must be deallocated with dematerializeGCProg. func materializeGCProg(ptrdata uintptr, prog *byte) *mspan {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 60K bytes - Viewed (0) -
src/runtime/panic.go
// bit in a bitmask. At each function exit, we add inline code to directly make // the appropriate defer calls based on the bitmask and fn/arg information stored // on the stack. During panic/Goexit processing, the appropriate defer calls are // made using extra funcdata info that indicates the exact stack slots that // contain the bitmask and defer fn/args.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 43.8K bytes - Viewed (0) -
pkg/kubelet/cm/memorymanager/policy_static_test.go
} s := state.NewMemoryState() s.SetMachineState(testCase.machineState) s.SetMemoryAssignments(testCase.assignments) return p, s, nil } func newNUMAAffinity(bits ...int) bitmask.BitMask { affinity, err := bitmask.NewBitMask(bits...) if err != nil { panic(err) } return affinity } func TestStaticPolicyNew(t *testing.T) { testCases := []testStaticPolicy{ {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sun Sep 17 05:49:15 UTC 2023 - 100.4K bytes - Viewed (0) -
src/net/ip.go
// IP address as an IPv4 address or an IPv6 address // is a semantic property of the address, not just the // length of the byte slice: a 16-byte slice can still // be an IPv4 address. type IP []byte // An IPMask is a bitmask that can be used to manipulate // IP addresses for IP addressing and routing. // // See type [IPNet] and func [ParseCIDR] for details. type IPMask []byte // An IPNet represents an IP network. type IPNet struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat May 18 03:13:26 UTC 2024 - 13.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/rewrite.go
mask_3 := (mask_1 & mask_2) << uint(GetPPC64Shiftsh(int64(sld))) r_2 := GetPPC64Shiftsh(int64(sld)) r_3 := (r_1 + r_2) & 31 // This can wrap. // Verify the result is still a valid bitmask of <= 32 bits. if !isPPC64WordRotateMask(int64(mask_3)) || uint64(uint32(mask_3)) != mask_3 { return 0 } return encodePPC64RotateMask(r_3, int64(mask_3), 32) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 64.2K bytes - Viewed (0) -
guava/src/com/google/common/math/IntMath.java
// But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two. // We bend over backwards to avoid branching, adapting a technique from // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax int delta = a - b; // can't overflow, since a and b are nonnegative int minDeltaOrZero = delta & (delta >> (Integer.SIZE - 1)); // equivalent to Math.min(delta, 0)
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 23.5K bytes - Viewed (0) -
src/crypto/tls/cipher_suites.go
type cipherSuite struct { id uint16 // the lengths, in bytes, of the key material needed for each component. keyLen int macLen int ivLen int ka func(version uint16) keyAgreement // flags is a bitmask of the suite* values, above. flags int cipher func(key, iv []byte, isRead bool) any mac func(key []byte) hash.Hash aead func(key, fixedNonce []byte) aead }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 25.5K bytes - Viewed (0)