const runtime.heapBitsShift

29 uses

	runtime (current package)
		mbitmap.go#L58: 	heapBitsShift      = 1     // shift offset between successive bitPointer or bitScan entries
		mbitmap.go#L62: 	bitScanAll    = bitScan | bitScan<<heapBitsShift | bitScan<<(2*heapBitsShift) | bitScan<<(3*heapBitsShift)
		mbitmap.go#L63: 	bitPointerAll = bitPointer | bitPointer<<heapBitsShift | bitPointer<<(2*heapBitsShift) | bitPointer<<(3*heapBitsShift)
		mbitmap.go#L419: 	if h.shift < 3*heapBitsShift {
		mbitmap.go#L420: 		h.shift += heapBitsShift
		mbitmap.go#L465: 	n += uintptr(h.shift) / heapBitsShift
		mbitmap.go#L467: 	h.shift = uint32(n%4) * heapBitsShift
		mbitmap.go#L820: 		mask2 = bitPointer | bitScan | mask1<<heapBitsShift // 00110011
		mbitmap.go#L821: 		mask3 = bitPointer | bitScan | mask2<<heapBitsShift // 01110111
		mbitmap.go#L871: 				*h.bitp &^= (bitPointer | bitScan | (bitPointer|bitScan)<<heapBitsShift) << h.shift
		mbitmap.go#L875: 				*h.bitp |= (bitPointer | bitScan | (bitPointer|bitScan)<<heapBitsShift) << h.shift
		mbitmap.go#L892: 		*h.bitp &^= (bitPointer | bitScan | ((bitPointer | bitScan) << heapBitsShift)) << h.shift
		mbitmap.go#L930: 		hb |= hb & (bitScan << (2 * heapBitsShift)) >> 1
		mbitmap.go#L1185: 		hb = (b & (bitPointer | bitPointer<<heapBitsShift)) << (2 * heapBitsShift)
		mbitmap.go#L1186: 		hb |= bitScan << (2 * heapBitsShift)
		mbitmap.go#L1188: 			hb |= bitScan << (3 * heapBitsShift)
		mbitmap.go#L1192: 		*hbitp &^= uint8((bitPointer | bitScan | ((bitPointer | bitScan) << heapBitsShift)) << (2 * heapBitsShift))
		mbitmap.go#L1310: 		*hbitp = *hbitp&^(bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift) | uint8(hb)
		mbitmap.go#L1337: 			*h.bitp = *h.bitp&^((bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift)<<(2*heapBitsShift)) | *src
		mbitmap.go#L1363: 			*h.bitp = *h.bitp&^(bitPointer|bitScan|(bitPointer|bitScan)<<heapBitsShift) | *src
		mbitmap.go#L1395: 			end.shift += heapBitsShift
		mbitmap.go#L1396: 			if end.shift == 4*heapBitsShift {