runtime.bmap.tophash (field)

89 uses

	runtime (current package)
		map.go#L153: 	tophash [bucketCnt]uint8
		map.go#L203: 	h := b.tophash[0]
		map.go#L430: 			if b.tophash[i] != top {
		map.go#L431: 				if b.tophash[i] == emptyRest {
		map.go#L488: 			if b.tophash[i] != top {
		map.go#L489: 				if b.tophash[i] == emptyRest {
		map.go#L532: 			if b.tophash[i] != top {
		map.go#L533: 				if b.tophash[i] == emptyRest {
		map.go#L611: 			if b.tophash[i] != top {
		map.go#L612: 				if isEmpty(b.tophash[i]) && inserti == nil {
		map.go#L613: 					inserti = &b.tophash[i]
		map.go#L617: 				if b.tophash[i] == emptyRest {
		map.go#L655: 		inserti = &newb.tophash[0]
		map.go#L721: 			if b.tophash[i] != top {
		map.go#L722: 				if b.tophash[i] == emptyRest {
		map.go#L749: 			b.tophash[i] = emptyOne
		map.go#L755: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map.go#L759: 				if b.tophash[i+1] != emptyRest {
		map.go#L764: 				b.tophash[i] = emptyRest
		map.go#L777: 				if b.tophash[i] != emptyOne {
		map.go#L900: 		if isEmpty(b.tophash[offi]) || b.tophash[offi] == evacuatedEmpty {
		map.go#L933: 				if checkBucket>>(it.B-1) != uintptr(b.tophash[offi]&1) {
		map.go#L938: 		if (b.tophash[offi] != evacuatedX && b.tophash[offi] != evacuatedY) ||
		map.go#L1164: 				top := b.tophash[i]
		map.go#L1166: 					b.tophash[i] = evacuatedEmpty
		map.go#L1206: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY
		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#L44: 			if *(*uint32)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast32.go#L84: 			if *(*uint32)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast32.go#L126: 			if isEmpty(b.tophash[i]) {
		map_fast32.go#L131: 				if b.tophash[i] == emptyRest {
		map_fast32.go#L165: 	insertb.tophash[inserti&(bucketCnt-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast32.go#L216: 			if isEmpty(b.tophash[i]) {
		map_fast32.go#L221: 				if b.tophash[i] == emptyRest {
		map_fast32.go#L255: 	insertb.tophash[inserti&(bucketCnt-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast32.go#L298: 			if key != *(*uint32)(k) || isEmpty(b.tophash[i]) {
		map_fast32.go#L315: 			b.tophash[i] = emptyOne
		map_fast32.go#L319: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map_fast32.go#L323: 				if b.tophash[i+1] != emptyRest {
		map_fast32.go#L328: 				b.tophash[i] = emptyRest
		map_fast32.go#L341: 				if b.tophash[i] != emptyOne {
		map_fast32.go#L400: 				top := b.tophash[i]
		map_fast32.go#L402: 					b.tophash[i] = evacuatedEmpty
		map_fast32.go#L418: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY, enforced in makemap
		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#L44: 			if *(*uint64)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast64.go#L84: 			if *(*uint64)(k) == key && !isEmpty(b.tophash[i]) {
		map_fast64.go#L126: 			if isEmpty(b.tophash[i]) {
		map_fast64.go#L131: 				if b.tophash[i] == emptyRest {
		map_fast64.go#L165: 	insertb.tophash[inserti&(bucketCnt-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast64.go#L216: 			if isEmpty(b.tophash[i]) {
		map_fast64.go#L221: 				if b.tophash[i] == emptyRest {
		map_fast64.go#L255: 	insertb.tophash[inserti&(bucketCnt-1)] = tophash(hash) // mask inserti to avoid bounds checks
		map_fast64.go#L298: 			if key != *(*uint64)(k) || isEmpty(b.tophash[i]) {
		map_fast64.go#L317: 			b.tophash[i] = emptyOne
		map_fast64.go#L321: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map_fast64.go#L325: 				if b.tophash[i+1] != emptyRest {
		map_fast64.go#L330: 				b.tophash[i] = emptyRest
		map_fast64.go#L343: 				if b.tophash[i] != emptyOne {
		map_fast64.go#L402: 				top := b.tophash[i]
		map_fast64.go#L404: 					b.tophash[i] = evacuatedEmpty
		map_fast64.go#L420: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY, enforced in makemap
		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#L31: 				if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L32: 					if b.tophash[i] == emptyRest {
		map_faststr.go#L47: 			if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L48: 				if b.tophash[i] == emptyRest {
		map_faststr.go#L96: 			if k.len != key.len || b.tophash[i] != top {
		map_faststr.go#L126: 				if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L127: 					if b.tophash[i] == emptyRest {
		map_faststr.go#L142: 			if k.len != key.len || isEmpty(b.tophash[i]) {
		map_faststr.go#L143: 				if b.tophash[i] == emptyRest {
		map_faststr.go#L191: 			if k.len != key.len || b.tophash[i] != top {
		map_faststr.go#L238: 			if b.tophash[i] != top {
		map_faststr.go#L239: 				if isEmpty(b.tophash[i]) && insertb == nil {
		map_faststr.go#L243: 				if b.tophash[i] == emptyRest {
		map_faststr.go#L281: 	insertb.tophash[inserti&(bucketCnt-1)] = top // mask inserti to avoid bounds checks
		map_faststr.go#L326: 			if k.len != key.len || b.tophash[i] != top {
		map_faststr.go#L340: 			b.tophash[i] = emptyOne
		map_faststr.go#L344: 				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
		map_faststr.go#L348: 				if b.tophash[i+1] != emptyRest {
		map_faststr.go#L353: 				b.tophash[i] = emptyRest
		map_faststr.go#L366: 				if b.tophash[i] != emptyOne {
		map_faststr.go#L425: 				top := b.tophash[i]
		map_faststr.go#L427: 					b.tophash[i] = evacuatedEmpty
		map_faststr.go#L443: 				b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY, enforced in makemap
		map_faststr.go#L452: 				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check