- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 450 for cbits (0.34 sec)
-
src/internal/fuzz/encoding.go
} return strconv.ParseFloat(val, 64) case "float32-bits": if kind != token.INT { return nil, fmt.Errorf("integer literal required for math.Float32frombits type") } bits, err := parseUint(val, "uint32") if err != nil { return nil, err } return math.Float32frombits(bits.(uint32)), nil case "float64-bits": if kind != token.FLOAT && kind != token.INT {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 30 16:39:12 UTC 2022 - 11K bytes - Viewed (0) -
src/runtime/mgcscavenge_test.go
// Check hugepage preserving behavior. bits := uint(PhysHugePageSize / uintptr(PageSize)) if bits < PallocChunkPages { tests["PreserveHugePageBottom"] = test{ alloc: []BitRange{{bits + 2, PallocChunkPages - (bits + 2)}}, min: 1, max: 3, // Make it so that max would have us try to break the huge page. want: BitRange{0, bits + 2}, } if 3*bits < PallocChunkPages {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 25.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/BigIntegerMath.java
long numeratorAccum = n; long denominatorAccum = 1; int bits = LongMath.log2(n, CEILING); int numeratorBits = bits; for (int i = 1; i < k; i++) { int p = n - i; int q = i + 1; // log2(p) >= bits - 1, because p >= n/2 if (numeratorBits + bits >= Long.SIZE - 1) { // The numerator is as big as it can get without risking overflow.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Feb 07 17:50:39 UTC 2024 - 18.9K bytes - Viewed (0) -
src/crypto/rsa/rsa.go
func GenerateMultiPrimeKey(random io.Reader, nprimes int, bits int) (*PrivateKey, error) { randutil.MaybeReadByte(random) if boring.Enabled && random == boring.RandReader && nprimes == 2 && (bits == 2048 || bits == 3072 || bits == 4096) { bN, bE, bD, bP, bQ, bDp, bDq, bQinv, err := boring.GenerateKeyRSA(bits) if err != nil { return nil, err } N := bbig.Dec(bN) E := bbig.Dec(bE)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:11:18 UTC 2024 - 23.4K bytes - Viewed (0) -
src/runtime/arena.go
if h.valid+valid <= ptrBits { // Fast path - just accumulate the bits. h.mask |= bits << h.valid h.valid += valid return h } // Too many bits to fit in this word. Write the current word // out and move on to the next word. data := h.mask | bits<<h.valid // mask for this word h.mask = bits >> (ptrBits - h.valid) // leftover for next word
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:44:56 UTC 2024 - 37.9K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/arch/x86/x86asm/inst.go
Op Op // Opcode mnemonic Opcode uint32 // Encoded opcode bits, left aligned (first byte is Opcode>>24, etc) Args Args // Instruction arguments, in Intel order Mode int // processor mode in bits: 16, 32, or 64 AddrSize int // address size in bits: 16, 32, or 64 DataSize int // operand size in bits: 16, 32, or 64 MemBytes int // size of memory argument in bytes: 1, 2, 4, 8, 16, and so on.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 10.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/arch/arm/armasm/decode.go
// or if x>>28 != 0xF and value>>28 == 0. // If x matches the format, then the rest of the fields describe how to interpret x. // The opBits describe bits that should be extracted from x and added to the opcode. // For example opBits = 0x1234 means that the value // // (2 bits at offset 1) followed by (4 bits at offset 3) // // should be added to op. // Finally the args describe how to decode the instruction arguments.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 22 17:16:14 UTC 2022 - 12.6K bytes - Viewed (0) -
src/crypto/internal/edwards25519/field/fe_test.go
} // isInBounds returns whether the element is within the expected bit size bounds // after a light reduction. func isInBounds(x *Element) bool { return bits.Len64(x.l0) <= 52 && bits.Len64(x.l1) <= 52 && bits.Len64(x.l2) <= 52 && bits.Len64(x.l3) <= 52 && bits.Len64(x.l4) <= 52 } func TestMultiplyDistributesOverAdd(t *testing.T) { multiplyDistributesOverAdd := func(x, y, z Element) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 28 17:26:17 UTC 2023 - 13.9K bytes - Viewed (0) -
ci/official/containers/linux_arm64/builder.devtoolset/stringop_trunc.patch
goto no_more_room; diff --git a/string/bits/string2.h b/string/bits/string2.h index c9bf593..f461fc1 100644 --- a/string/bits/string2.h +++ b/string/bits/string2.h @@ -47,29 +47,7 @@ #endif #if _STRING_ARCH_unaligned -/* If we can do unaligned memory accesses we must know the endianess. */ -# include <endian.h> # include <bits/types.h> - -# if __BYTE_ORDER == __LITTLE_ENDIAN
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Sep 18 14:52:45 UTC 2023 - 42.9K bytes - Viewed (0) -
src/crypto/internal/nistec/p256_asm.go
var b uint64 _, b = bits.Sub64(x[0], p256P[0], b) _, b = bits.Sub64(x[1], p256P[1], b) _, b = bits.Sub64(x[2], p256P[2], b) _, b = bits.Sub64(x[3], p256P[3], b) return int(b) } // p256Add sets res = x + y. func p256Add(res, x, y *p256Element) { var c, b uint64 t1 := make([]uint64, 4) t1[0], c = bits.Add64(x[0], y[0], 0) t1[1], c = bits.Add64(x[1], y[1], c)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 21.4K bytes - Viewed (0)