runtime.evacDst.b (field)

33 uses

	runtime (current package)
		map.go#L1131: 	b *bmap          // current destination bucket
		map.go#L1147: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.bucketsize)))
		map.go#L1148: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map.go#L1155: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.bucketsize)))
		map.go#L1156: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map.go#L1210: 					dst.b = h.newoverflow(t, dst.b)
		map.go#L1212: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map.go#L1215: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_fast32.go#L383: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.bucketsize)))
		map_fast32.go#L384: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map_fast32.go#L391: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.bucketsize)))
		map_fast32.go#L392: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map_fast32.go#L422: 					dst.b = h.newoverflow(t, dst.b)
		map_fast32.go#L424: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map_fast32.go#L427: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_fast64.go#L385: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.bucketsize)))
		map_fast64.go#L386: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map_fast64.go#L393: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.bucketsize)))
		map_fast64.go#L394: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map_fast64.go#L424: 					dst.b = h.newoverflow(t, dst.b)
		map_fast64.go#L426: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map_fast64.go#L429: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
		map_faststr.go#L408: 		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.bucketsize)))
		map_faststr.go#L409: 		x.k = add(unsafe.Pointer(x.b), dataOffset)
		map_faststr.go#L416: 			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.bucketsize)))
		map_faststr.go#L417: 			y.k = add(unsafe.Pointer(y.b), dataOffset)
		map_faststr.go#L447: 					dst.b = h.newoverflow(t, dst.b)
		map_faststr.go#L449: 					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
		map_faststr.go#L452: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check