- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 520 for cbits (0.04 sec)
-
src/hash/crc32/gen_const_ppc64le.go
} } func genCrc32ConstTable(w *bytes.Buffer, poly uint32, polyid string) { ref_poly := reflect_bits(uint64(poly), 32) fmt.Fprintf(w, "\n\t/* Reduce %d kbits to 1024 bits */\n", blocking*8) j := 0 for i := (blocking * 8) - 1024; i > 0; i -= 1024 { a := reflect_bits(get_remainder(ref_poly, 32, uint(i)), 32) << 1 b := reflect_bits(get_remainder(ref_poly, 32, uint(i+64)), 32) << 1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 19 20:44:20 UTC 2024 - 4.5K bytes - Viewed (0) -
src/runtime/pinner.go
atomic.And8(v.bytep, ^mask) } } // pinnerBits is the same type as gcBits but has different methods. type pinnerBits gcBits // ofObject returns the pinState of the n'th object. // nosplit, because it's called by isPinned, which is nosplit // //go:nosplit func (p *pinnerBits) ofObject(n uintptr) pinState { bytep, mask := (*gcBits)(p).bitp(n * 2) byteVal := atomic.Load8(bytep) return pinState{bytep, byteVal, mask}
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 11K bytes - Viewed (0) -
src/cmd/internal/obj/riscv/obj.go
// Bit order - [8|4:3|7:6|2:1|5] bits := extractBitAndShift(imm, 8, 7) bits |= extractBitAndShift(imm, 4, 6) bits |= extractBitAndShift(imm, 3, 5) bits |= extractBitAndShift(imm, 7, 4) bits |= extractBitAndShift(imm, 6, 3) bits |= extractBitAndShift(imm, 2, 2) bits |= extractBitAndShift(imm, 1, 1) bits |= extractBitAndShift(imm, 5, 0) return (bits>>5)<<10 | (bits&0x1f)<<2 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Apr 07 03:32:27 UTC 2024 - 77K bytes - Viewed (0) -
src/runtime/mheap.go
} // newAllocBits returns a pointer to 8 byte aligned bytes // to be used for this span's alloc bits. // newAllocBits is used to provide newly initialized spans // allocation bits. For spans not being initialized the // mark bits are repurposed as allocation bits when // the span is swept. func newAllocBits(nelems uintptr) *gcBits { return newMarkBits(nelems) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
src/runtime/mwbbuf.go
obj, span, objIndex := findObject(ptr, 0, 0) if obj == 0 { continue } // TODO: Consider making two passes where the first // just prefetches the mark bits. mbits := span.markBitsForIndex(objIndex) if mbits.isMarked() { continue } mbits.setMarked() // Mark span. arena, pageIdx, pageMask := pageIndexOf(span.base()) if arena.pageMarks[pageIdx]&pageMask == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 8.1K bytes - Viewed (0) -
src/math/big/nat.go
// That is, we can throw away all but the bottom logM-1 bits of y. // Instead of allocating a new y, we start reading y at the right word // and truncate it appropriately at the start of the loop. i := len(y) - 1 mtop := int((logM - 2) / _W) // -2 because the top word of N bits is the (N-1)/W'th word. mmask := ^Word(0) if mbits := (logM - 1) & (_W - 1); mbits != 0 { mmask = (1 << mbits) - 1 } if i > mtop { i = mtop
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:31:58 UTC 2024 - 31.7K bytes - Viewed (0) -
src/runtime/mgcmark.go
// base and extent. b := b0 n := n0 for i := uintptr(0); i < n; { // Find bits for the next word. bits := uint32(*addb(ptrmask, i/(goarch.PtrSize*8))) if bits == 0 { i += goarch.PtrSize * 8 continue } for j := 0; j < 8 && i < n; j++ { if bits&1 != 0 { // Same work as in scanobject; see comments there. p := *(*uintptr)(unsafe.Pointer(b + i))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/keccakf.go
bc4 = bits.RotateLeft64(t, 18) t = a[1] ^ d1 bc0 = bits.RotateLeft64(t, 1) t = a[7] ^ d2 bc1 = bits.RotateLeft64(t, 6) t = a[13] ^ d3 bc2 = bits.RotateLeft64(t, 25) t = a[19] ^ d4 bc3 = bits.RotateLeft64(t, 8) a[20] = bc0 ^ (bc2 &^ bc1) a[1] = bc1 ^ (bc3 &^ bc2) a[7] = bc2 ^ (bc4 &^ bc3) a[13] = bc3 ^ (bc0 &^ bc4) a[19] = bc4 ^ (bc1 &^ bc0) t = a[5] ^ d0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 10 16:37:53 UTC 2024 - 10.3K bytes - Viewed (0) -
test/codegen/mathbits.go
// ppc64x: -"ADDC", "ADDE", -"ADDZE" r[2], c = bits.Add64(p[2], p[2], c) } func Add64MSaveC(p, q, r, c *[2]uint64) { // ppc64x: "ADDC\tR", "ADDZE" r[0], c[0] = bits.Add64(p[0], q[0], 0) // ppc64x: "ADDC\t[$]-1", "ADDE", "ADDZE" r[1], c[1] = bits.Add64(p[1], q[1], c[0]) } func Add64PanicOnOverflowEQ(a, b uint64) uint64 { r, c := bits.Add64(a, b, 0) // s390x:"BRC\t[$]3,",-"ADDE"
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:51:17 UTC 2024 - 19.6K bytes - Viewed (0) -
src/image/jpeg/huffman.go
} return err } d.bits.a = d.bits.a<<8 | uint32(c) d.bits.n += 8 if d.bits.m == 0 { d.bits.m = 1 << 7 } else { d.bits.m <<= 8 } if d.bits.n >= n { break } } return nil } // receiveExtend is the composition of RECEIVE and EXTEND, specified in section // F.2.2.1. func (d *decoder) receiveExtend(t uint8) (int32, error) { if d.bits.n < int32(t) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 11 17:08:05 UTC 2024 - 6.3K bytes - Viewed (0)