internal/abi.Type.Hash (field)
41 uses
internal/abi (current package)
type.go#L23: Hash uint32 // hash of type; avoids computation in hash tables
reflect
map_swiss.go#L69: mt.Hash = fnv1(etyp.Hash, 'm', byte(ktyp.Hash>>24), byte(ktyp.Hash>>16), byte(ktyp.Hash>>8), byte(ktyp.Hash))
type.go#L1365: pp.Hash = fnv1(t.t.Hash, '*')
type.go#L1803: ch.Hash = fnv1(typ.Hash, 'c', byte(dir))
type.go#L1869: hash = fnv1(hash, byte(t.t.Hash>>24), byte(t.t.Hash>>16), byte(t.t.Hash>>8), byte(t.t.Hash))
type.go#L1878: hash = fnv1(hash, byte(t.t.Hash>>24), byte(t.t.Hash>>16), byte(t.t.Hash>>8), byte(t.t.Hash))
type.go#L1882: ft.Hash = hash
type.go#L2085: slice.Hash = fnv1(typ.Hash, '[')
type.go#L2326: hash = fnv1(hash, byte(ft.Hash>>24), byte(ft.Hash>>16), byte(ft.Hash>>8), byte(ft.Hash))
type.go#L2473: typ.Hash = hash
type.go#L2611: array.Hash = fnv1(typ.Hash, '[')
type.go#L2613: array.Hash = fnv1(array.Hash, byte(n))
type.go#L2615: array.Hash = fnv1(array.Hash, ']')
runtime
heapdump.go#L171: b := &typecache[t.Hash&(typeCacheBuckets-1)]
iface.go#L32: return uintptr(inter.Type.Hash ^ typ.Hash)
iface.go#L532: h := int(typ.Hash) & (newN - 1)
iface.go#L638: h := int(typ.Hash) & (newN - 1)
type.go#L452: tlist := typehash[t.Hash]
type.go#L458: typehash[t.Hash] = append(tlist, t)
type.go#L470: for _, candidate := range typehash[t.Hash] {