Search Options

Results per page
Sort
Preferred Languages
Advance

Results 31 - 40 of 1,081 for cbits (0.31 sec)

  1. 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)
  2. 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)
  3. 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)
  4. 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)
  5. src/crypto/internal/nistec/fiat/p384_fiat64.go

    	var x72 uint64
    	x72, x71 = bits.Mul64(x1, arg2[4])
    	var x73 uint64
    	var x74 uint64
    	x74, x73 = bits.Mul64(x1, arg2[3])
    	var x75 uint64
    	var x76 uint64
    	x76, x75 = bits.Mul64(x1, arg2[2])
    	var x77 uint64
    	var x78 uint64
    	x78, x77 = bits.Mul64(x1, arg2[1])
    	var x79 uint64
    	var x80 uint64
    	x80, x79 = bits.Mul64(x1, arg2[0])
    	var x81 uint64
    	var x82 uint64
    	x81, x82 = bits.Add64(x80, x77, uint64(0x0))
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 05 21:53:03 UTC 2022
    - 90.8K bytes
    - Viewed (0)
  6. src/crypto/internal/nistec/fiat/p224_fiat64.go

    	var x39 uint64
    	var x40 uint64
    	x39, x40 = bits.Add64(x17, x30, uint64(p224Uint1(x38)))
    	var x41 uint64
    	var x42 uint64
    	x41, x42 = bits.Add64(x19, x32, uint64(p224Uint1(x40)))
    	var x43 uint64
    	var x44 uint64
    	x44, x43 = bits.Mul64(x1, arg2[3])
    	var x45 uint64
    	var x46 uint64
    	x46, x45 = bits.Mul64(x1, arg2[2])
    	var x47 uint64
    	var x48 uint64
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 05 21:53:03 UTC 2022
    - 43.2K bytes
    - Viewed (0)
  7. src/crypto/internal/nistec/fiat/p521_fiat64.go

    	x105, x104 = bits.Mul64(x1, arg2[6])
    	var x106 uint64
    	var x107 uint64
    	x107, x106 = bits.Mul64(x1, arg2[5])
    	var x108 uint64
    	var x109 uint64
    	x109, x108 = bits.Mul64(x1, arg2[4])
    	var x110 uint64
    	var x111 uint64
    	x111, x110 = bits.Mul64(x1, arg2[3])
    	var x112 uint64
    	var x113 uint64
    	x113, x112 = bits.Mul64(x1, arg2[2])
    	var x114 uint64
    	var x115 uint64
    	x115, x114 = bits.Mul64(x1, arg2[1])
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 05 21:53:03 UTC 2022
    - 167K bytes
    - Viewed (0)
  8. src/math/bits/make_examples.go

    			name: "RotateLeft",
    			in:   15,
    			out:  [4]any{bits.RotateLeft8(15, 2), bits.RotateLeft16(15, 2), bits.RotateLeft32(15, 2), bits.RotateLeft64(15, 2)},
    			out2: [4]any{bits.RotateLeft8(15, -2), bits.RotateLeft16(15, -2), bits.RotateLeft32(15, -2), bits.RotateLeft64(15, -2)},
    		},
    		{
    			name: "Reverse",
    			in:   19,
    			out:  [4]any{bits.Reverse8(19), bits.Reverse16(19), bits.Reverse32(19), bits.Reverse64(19)},
    		},
    		{
    			name: "ReverseBytes",
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Oct 19 23:33:27 UTC 2023
    - 3K bytes
    - Viewed (0)
  9. src/crypto/internal/nistec/fiat/p256_fiat64.go

    	x37, x38 = bits.Add64(x19, x21, uint64(p256Uint1(x36)))
    	var x39 uint64
    	var x40 uint64
    	x40, x39 = bits.Mul64(x1, arg2[3])
    	var x41 uint64
    	var x42 uint64
    	x42, x41 = bits.Mul64(x1, arg2[2])
    	var x43 uint64
    	var x44 uint64
    	x44, x43 = bits.Mul64(x1, arg2[1])
    	var x45 uint64
    	var x46 uint64
    	x46, x45 = bits.Mul64(x1, arg2[0])
    	var x47 uint64
    	var x48 uint64
    	x47, x48 = bits.Add64(x46, x43, uint64(0x0))
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 05 21:53:03 UTC 2022
    - 41.2K bytes
    - Viewed (0)
  10. 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)
Back to top