internal/abi.Type.Hash (field)

39 uses

	internal/abi (current package)
		type.go#L23: 	Hash        uint32  // hash of type; avoids computation in hash tables

	reflect
		type.go#L1218: 	pp.Hash = fnv1(t.t.Hash, '*')
		type.go#L1636: 	ch.Hash = fnv1(typ.Hash, 'c', byte(dir))
		type.go#L1680: 	mt.Hash = fnv1(etyp.Hash, 'm', byte(ktyp.Hash>>24), byte(ktyp.Hash>>16), byte(ktyp.Hash>>8), byte(ktyp.Hash))
		type.go#L1775: 		hash = fnv1(hash, byte(t.t.Hash>>24), byte(t.t.Hash>>16), byte(t.t.Hash>>8), byte(t.t.Hash))
		type.go#L1784: 		hash = fnv1(hash, byte(t.t.Hash>>24), byte(t.t.Hash>>16), byte(t.t.Hash>>8), byte(t.t.Hash))
		type.go#L1788: 	ft.Hash = hash
		type.go#L2097: 	slice.Hash = fnv1(typ.Hash, '[')
		type.go#L2341: 		hash = fnv1(hash, byte(ft.Hash>>24), byte(ft.Hash>>16), byte(ft.Hash>>8), byte(ft.Hash))
		type.go#L2484: 	typ.Hash = hash
		type.go#L2653: 	array.Hash = fnv1(typ.Hash, '[')
		type.go#L2655: 		array.Hash = fnv1(array.Hash, byte(n))
		type.go#L2657: 	array.Hash = fnv1(array.Hash, ']')

	runtime
		heapdump.go#L171: 	b := &typecache[t.Hash&(typeCacheBuckets-1)]
		iface.go#L31: 	return uintptr(inter.Type.Hash ^ typ.Hash)
		type.go#L273: 			tlist := typehash[t.Hash]
		type.go#L279: 			typehash[t.Hash] = append(tlist, t)
		type.go#L291: 				for _, candidate := range typehash[t.Hash] {