runtime.heapBits.bitp (field)
52 uses
runtime (current package)
mbitmap.go#L113: bitp *uint8
mbitmap.go#L320: h.bitp = &ha.bitmap[(addr/(sys.PtrSize*4))%heapArenaBitmapBytes]
mbitmap.go#L421: } else if h.bitp != h.last {
mbitmap.go#L422: h.bitp, h.shift = add1(h.bitp), 0
mbitmap.go#L453: h.bitp, h.shift = &ha.bitmap[0], 0
mbitmap.go#L466: nbitp := uintptr(unsafe.Pointer(h.bitp)) + n/4
mbitmap.go#L469: h.bitp = (*uint8)(unsafe.Pointer(nbitp))
mbitmap.go#L479: h.bitp = &a.bitmap[past%heapArenaBitmapBytes]
mbitmap.go#L482: h.bitp, h.last = nil, nil
mbitmap.go#L491: maxn := 4 * ((uintptr(unsafe.Pointer(h.last)) + 1) - uintptr(unsafe.Pointer(h.bitp)))
mbitmap.go#L507: return uint32(*h.bitp) >> (h.shift & 31)
mbitmap.go#L759: bitp := h.bitp
mbitmap.go#L765: memclrNoHeapPointers(unsafe.Pointer(h.bitp), nbyte)
mbitmap.go#L871: *h.bitp &^= (bitPointer | bitScan | (bitPointer|bitScan)<mbitmap.go#L872: *h.bitp |= (bitPointer | bitScan) << h.shift
mbitmap.go#L875: *h.bitp |= (bitPointer | bitScan | (bitPointer|bitScan)<mbitmap.go#L892: *h.bitp &^= (bitPointer | bitScan | ((bitPointer | bitScan) << heapBitsShift)) << h.shift
mbitmap.go#L893: *h.bitp |= uint8(hb << h.shift)
mbitmap.go#L936: *h.bitp &^= mask3 << 0
mbitmap.go#L937: *h.bitp |= hb << 0
mbitmap.go#L939: *h.bitp &^= mask3 << 1
mbitmap.go#L940: *h.bitp |= hb << 1
mbitmap.go#L942: *h.bitp &^= mask2 << 2
mbitmap.go#L943: *h.bitp |= (hb & mask2) << 2
mbitmap.go#L947: *h.bitp &^= mask1
mbitmap.go#L948: *h.bitp |= (hb >> 2) & mask1
mbitmap.go#L950: *h.bitp &^= mask1 << 3
mbitmap.go#L951: *h.bitp |= (hb & mask1) << 3
mbitmap.go#L955: *h.bitp &^= mask2
mbitmap.go#L956: *h.bitp |= (hb >> 1) & mask2
mbitmap.go#L977: h.bitp = (*uint8)(unsafe.Pointer(x))
mbitmap.go#L997: hbitp = h.bitp
mbitmap.go#L1337: *h.bitp = *h.bitp&^((bitPointer|bitScan|(bitPointer|bitScan)<mbitmap.go#L1352: memmove(unsafe.Pointer(h.bitp), unsafe.Pointer(src), n)
mbitmap.go#L1363: *h.bitp = *h.bitp&^(bitPointer|bitScan|(bitPointer|bitScan)<mbitmap.go#L1376: hbitp = h.bitp
mbitmap.go#L1397: end.bitp, end.shift = add1(end.bitp), 0
mbitmap.go#L1400: if typ.kind&kindGCProg == 0 && (hbitp != end.bitp || (w == nw+2) != (end.shift == 2)) {
mbitmap.go#L1405: print("initial bits h0.bitp=", h0.bitp, " h0.shift=", h0.shift, "\n")
mbitmap.go#L1406: print("ended at hbitp=", hbitp, " but next starts at bitp=", end.bitp, " shift=", end.shift, "\n")
mbitmap.go#L1420: have = (*h.bitp >> h.shift) & (bitPointer | bitScan)
mbitmap.go#L1439: print("initial bits h0.bitp=", h0.bitp, " h0.shift=", h0.shift, "\n")
mbitmap.go#L1440: print("current bits h.bitp=", h.bitp, " h.shift=", h.shift, " *h.bitp=", hex(*h.bitp), "\n")
mbitmap.go#L1479: totalBits = runGCProg(prog, nil, h.bitp, 2)
mbitmap.go#L1534: runGCProg(prog, &trailer[0], h.bitp, 2)
mbitmap.go#L1543: endProg := unsafe.Pointer(addb(h.bitp, (totalBits+3)/4))
mbitmap.go#L1544: endAlloc := unsafe.Pointer(addb(h.bitp, allocSize/sys.PtrSize/wordsPerBitmapByte))
 |
The pages are generated with Golds v0.3.2-preview. (GOOS=darwin GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |