const internal/abi.MapBucketCount
130 uses
internal/abi (current package)
map.go#L12: MapBucketCount = 1 << MapBucketCountBits
reflect
type.go#L2125: size := abi.MapBucketCount*(1+ktyp.Size_+etyp.Size_) + goarch.PtrSize
type.go#L2131: nptr := (abi.MapBucketCount*(1+ktyp.Size_+etyp.Size_) + goarch.PtrSize) / goarch.PtrSize
type.go#L2137: base := uintptr(abi.MapBucketCount / goarch.PtrSize)
type.go#L2140: emitGCMask(mask, base, ktyp, abi.MapBucketCount)
type.go#L2142: base += abi.MapBucketCount * ktyp.Size_ / goarch.PtrSize
type.go#L2145: emitGCMask(mask, base, etyp, abi.MapBucketCount)
type.go#L2147: base += abi.MapBucketCount * etyp.Size_ / goarch.PtrSize
runtime
map.go#L72: loadFactorNum = loadFactorDen * abi.MapBucketCount * 13 / 16
map.go#L147: tophash [abi.MapBucketCount]uint8
map.go#L447: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map.go#L459: e := add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
map.go#L517: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map.go#L529: e := add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
map.go#L561: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map.go#L573: e := add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
map.go#L657: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map.go#L662: elem = add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
map.go#L680: elem = add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
map.go#L704: elem = add(insertk, abi.MapBucketCount*uintptr(t.KeySize))
map.go#L779: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map.go#L800: e := add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
map.go#L813: if i == abi.MapBucketCount-1 {
map.go#L832: i = abi.MapBucketCount - 1
map.go#L909: it.offset = uint8(r >> h.B & (abi.MapBucketCount - 1))
map.go#L984: for ; i < abi.MapBucketCount; i++ {
map.go#L985: offi := (i + it.offset) & (abi.MapBucketCount - 1)
map.go#L995: e := add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+uintptr(offi)*uintptr(t.ValueSize))
map.go#L1097: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map.go#L1184: return count > abi.MapBucketCount && uintptr(count) > loadFactorNum*(bucketShift(B)/loadFactorDen)
map.go#L1267: x.e = add(x.k, abi.MapBucketCount*uintptr(t.KeySize))
map.go#L1275: y.e = add(y.k, abi.MapBucketCount*uintptr(t.KeySize))
map.go#L1280: e := add(k, abi.MapBucketCount*uintptr(t.KeySize))
map.go#L1281: for i := 0; i < abi.MapBucketCount; i, k, e = i+1, add(k, uintptr(t.KeySize)), add(e, uintptr(t.ValueSize)) {
map.go#L1327: if dst.i == abi.MapBucketCount {
map.go#L1331: dst.e = add(dst.k, abi.MapBucketCount*uintptr(t.KeySize))
map.go#L1333: dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
map.go#L1422: if t.Key.Align_ > abi.MapBucketCount {
map.go#L1425: if t.Elem.Align_ > abi.MapBucketCount {
map.go#L1434: if abi.MapBucketCount < 8 {
map.go#L1625: for i := 0; i < abi.MapBucketCount; i++ {
map.go#L1630: for ; pos < abi.MapBucketCount; pos++ {
map.go#L1636: if pos == abi.MapBucketCount {
map.go#L1642: srcEle := add(unsafe.Pointer(src), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+uintptr(i)*uintptr(t.ValueSize))
map.go#L1644: dstEle := add(unsafe.Pointer(dst), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+uintptr(pos)*uintptr(t.ValueSize))
map.go#L1757: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map.go#L1771: srcEle := add(unsafe.Pointer(srcBmap), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
map.go#L1797: offset := uint8(r >> h.B & (abi.MapBucketCount - 1))
map.go#L1826: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map.go#L1827: offi := (i + uintptr(offset)) & (abi.MapBucketCount - 1)
map.go#L1860: offset := uint8(r >> h.B & (abi.MapBucketCount - 1))
map.go#L1889: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map.go#L1890: offi := (i + uintptr(offset)) & (abi.MapBucketCount - 1)
map.go#L1899: ele := add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*uintptr(t.KeySize)+offi*uintptr(t.ValueSize))
map_fast32.go#L44: for i, k := uintptr(0), b.keys(); i < abi.MapBucketCount; i, k = i+1, add(k, 4) {
map_fast32.go#L46: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*4+i*uintptr(t.ValueSize))
map_fast32.go#L93: for i, k := uintptr(0), b.keys(); i < abi.MapBucketCount; i, k = i+1, add(k, 4) {
map_fast32.go#L95: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*4+i*uintptr(t.ValueSize)), true
map_fast32.go#L146: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map_fast32.go#L186: insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks
map_fast32.go#L195: elem := add(unsafe.Pointer(insertb), dataOffset+abi.MapBucketCount*4+inserti*uintptr(t.ValueSize))
map_fast32.go#L245: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map_fast32.go#L285: insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks
map_fast32.go#L294: elem := add(unsafe.Pointer(insertb), dataOffset+abi.MapBucketCount*4+inserti*uintptr(t.ValueSize))
map_fast32.go#L327: for i, k := uintptr(0), b.keys(); i < abi.MapBucketCount; i, k = i+1, add(k, 4) {
map_fast32.go#L339: e := add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*4+i*uintptr(t.ValueSize))
map_fast32.go#L348: if i == abi.MapBucketCount-1 {
map_fast32.go#L367: i = abi.MapBucketCount - 1
map_fast32.go#L415: x.e = add(x.k, abi.MapBucketCount*4)
map_fast32.go#L423: y.e = add(y.k, abi.MapBucketCount*4)
map_fast32.go#L428: e := add(k, abi.MapBucketCount*4)
map_fast32.go#L429: for i := 0; i < abi.MapBucketCount; i, k, e = i+1, add(k, 4), add(e, uintptr(t.ValueSize)) {
map_fast32.go#L451: if dst.i == abi.MapBucketCount {
map_fast32.go#L455: dst.e = add(dst.k, abi.MapBucketCount*4)
map_fast32.go#L457: dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
map_fast64.go#L44: for i, k := uintptr(0), b.keys(); i < abi.MapBucketCount; i, k = i+1, add(k, 8) {
map_fast64.go#L46: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*8+i*uintptr(t.ValueSize))
map_fast64.go#L93: for i, k := uintptr(0), b.keys(); i < abi.MapBucketCount; i, k = i+1, add(k, 8) {
map_fast64.go#L95: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*8+i*uintptr(t.ValueSize)), true
map_fast64.go#L146: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map_fast64.go#L186: insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks
map_fast64.go#L195: elem := add(unsafe.Pointer(insertb), dataOffset+abi.MapBucketCount*8+inserti*uintptr(t.ValueSize))
map_fast64.go#L247: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map_fast64.go#L287: insertb.tophash[inserti&(abi.MapBucketCount-1)] = tophash(hash) // mask inserti to avoid bounds checks
map_fast64.go#L296: elem := add(unsafe.Pointer(insertb), dataOffset+abi.MapBucketCount*8+inserti*uintptr(t.ValueSize))
map_fast64.go#L329: for i, k := uintptr(0), b.keys(); i < abi.MapBucketCount; i, k = i+1, add(k, 8) {
map_fast64.go#L343: e := add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*8+i*uintptr(t.ValueSize))
map_fast64.go#L352: if i == abi.MapBucketCount-1 {
map_fast64.go#L371: i = abi.MapBucketCount - 1
map_fast64.go#L419: x.e = add(x.k, abi.MapBucketCount*8)
map_fast64.go#L427: y.e = add(y.k, abi.MapBucketCount*8)
map_fast64.go#L432: e := add(k, abi.MapBucketCount*8)
map_fast64.go#L433: for i := 0; i < abi.MapBucketCount; i, k, e = i+1, add(k, 8), add(e, uintptr(t.ValueSize)) {
map_fast64.go#L455: if dst.i == abi.MapBucketCount {
map_fast64.go#L459: dst.e = add(dst.k, abi.MapBucketCount*8)
map_fast64.go#L461: dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
map_faststr.go#L30: for i, kptr := uintptr(0), b.keys(); i < abi.MapBucketCount; i, kptr = i+1, add(kptr, 2*goarch.PtrSize) {
map_faststr.go#L39: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+i*uintptr(t.ValueSize))
map_faststr.go#L45: keymaybe := uintptr(abi.MapBucketCount)
map_faststr.go#L46: for i, kptr := uintptr(0), b.keys(); i < abi.MapBucketCount; i, kptr = i+1, add(kptr, 2*goarch.PtrSize) {
map_faststr.go#L55: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+i*uintptr(t.ValueSize))
map_faststr.go#L65: if keymaybe != abi.MapBucketCount {
map_faststr.go#L71: if keymaybe != abi.MapBucketCount {
map_faststr.go#L74: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+keymaybe*uintptr(t.ValueSize))
map_faststr.go#L95: for i, kptr := uintptr(0), b.keys(); i < abi.MapBucketCount; i, kptr = i+1, add(kptr, 2*goarch.PtrSize) {
map_faststr.go#L101: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+i*uintptr(t.ValueSize))
map_faststr.go#L134: for i, kptr := uintptr(0), b.keys(); i < abi.MapBucketCount; i, kptr = i+1, add(kptr, 2*goarch.PtrSize) {
map_faststr.go#L143: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+i*uintptr(t.ValueSize)), true
map_faststr.go#L149: keymaybe := uintptr(abi.MapBucketCount)
map_faststr.go#L150: for i, kptr := uintptr(0), b.keys(); i < abi.MapBucketCount; i, kptr = i+1, add(kptr, 2*goarch.PtrSize) {
map_faststr.go#L159: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+i*uintptr(t.ValueSize)), true
map_faststr.go#L169: if keymaybe != abi.MapBucketCount {
map_faststr.go#L175: if keymaybe != abi.MapBucketCount {
map_faststr.go#L178: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+keymaybe*uintptr(t.ValueSize)), true
map_faststr.go#L199: for i, kptr := uintptr(0), b.keys(); i < abi.MapBucketCount; i, kptr = i+1, add(kptr, 2*goarch.PtrSize) {
map_faststr.go#L205: return add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+i*uintptr(t.ValueSize)), true
map_faststr.go#L258: for i := uintptr(0); i < abi.MapBucketCount; i++ {
map_faststr.go#L305: insertb.tophash[inserti&(abi.MapBucketCount-1)] = top // mask inserti to avoid bounds checks
map_faststr.go#L313: elem := add(unsafe.Pointer(insertb), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+inserti*uintptr(t.ValueSize))
map_faststr.go#L348: for i, kptr := uintptr(0), b.keys(); i < abi.MapBucketCount; i, kptr = i+1, add(kptr, 2*goarch.PtrSize) {
map_faststr.go#L358: e := add(unsafe.Pointer(b), dataOffset+abi.MapBucketCount*2*goarch.PtrSize+i*uintptr(t.ValueSize))
map_faststr.go#L367: if i == abi.MapBucketCount-1 {
map_faststr.go#L386: i = abi.MapBucketCount - 1
map_faststr.go#L434: x.e = add(x.k, abi.MapBucketCount*2*goarch.PtrSize)
map_faststr.go#L442: y.e = add(y.k, abi.MapBucketCount*2*goarch.PtrSize)
map_faststr.go#L447: e := add(k, abi.MapBucketCount*2*goarch.PtrSize)
map_faststr.go#L448: for i := 0; i < abi.MapBucketCount; i, k, e = i+1, add(k, 2*goarch.PtrSize), add(e, uintptr(t.ValueSize)) {
map_faststr.go#L470: if dst.i == abi.MapBucketCount {
map_faststr.go#L474: dst.e = add(dst.k, abi.MapBucketCount*2*goarch.PtrSize)
map_faststr.go#L476: dst.b.tophash[dst.i&(abi.MapBucketCount-1)] = top // mask dst.i as an optimization, to avoid a bounds check
 |
The pages are generated with Golds v0.7.6. (GOOS=linux 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 @zigo_101 (reachable from the left QR code) to get the latest news of Golds. |