- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 111 for tophash (0.36 sec)
-
src/runtime/map_faststr.go
top := tophash(hash) var insertb *bmap var inserti uintptr var insertk unsafe.Pointer bucketloop: for { for i := uintptr(0); i < abi.MapBucketCount; i++ { if b.tophash[i] != top { if isEmpty(b.tophash[i]) && insertb == nil { insertb = b inserti = i } if b.tophash[i] == emptyRest { break bucketloop }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 15.3K bytes - Viewed (0) -
src/runtime/map_fast64.go
} else { memclrNoHeapPointers(e, t.Elem.Size_) } b.tophash[i] = emptyOne // If the bucket now ends in a bunch of emptyOne states, // change those to emptyRest states. if i == abi.MapBucketCount-1 { if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest { goto notLast } } else { if b.tophash[i+1] != emptyRest { goto notLast } } for {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 14.1K bytes - Viewed (0) -
src/runtime/map_fast32.go
} else { memclrNoHeapPointers(e, t.Elem.Size_) } b.tophash[i] = emptyOne // If the bucket now ends in a bunch of emptyOne states, // change those to emptyRest states. if i == abi.MapBucketCount-1 { if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest { goto notLast } } else { if b.tophash[i+1] != emptyRest { goto notLast } } for {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:17:26 UTC 2024 - 13.9K bytes - Viewed (0) -
src/cmd/compile/internal/test/inl_test.go
"pcvalueCacheKey", "rand32", "readUnaligned32", "readUnaligned64", "releasem", "roundupsize", "stackmapdata", "stringStructOf", "subtract1", "subtractb", "tophash", "(*bmap).keys", "(*bmap).overflow", "(*waitq).enqueue", "funcInfo.entry", // GC-related ones "cgoInRange", "gclinkptr.ptr", "guintptr.ptr", "heapBitsSlice",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 04:07:57 UTC 2024 - 10.7K bytes - Viewed (0) -
src/runtime/export_test.go
for i := 0; i < abi.MapBucketCount; i++ { if b.tophash[i] != emptyRest { n++ } } } k := 0 for b := b0; b != nil; b = b.overflow(t) { for i := 0; i < abi.MapBucketCount; i++ { if k < n && b.tophash[i] == emptyRest { panic("early emptyRest") } if k >= n && b.tophash[i] != emptyRest { panic("late non-emptyRest") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
src/runtime/runtime-gdb.py
if bucket >= 2 ** (B - 1): continue # already did old bucket bp = oldbp while bp: b = bp.dereference() for i in xrange(MapBucketCount): if b['tophash'][i] != 0: k = b['keys'][i] v = b['values'][i] if flags & 1: k = k.dereference() if flags & 2: v = v.dereference() yield str(cnt), k yield str(cnt + 1), v
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 10 12:59:20 UTC 2023 - 15.4K bytes - Viewed (0) -
src/cmd/internal/obj/objfile.go
w.tmpHash64 = contentHash64(s) w.Bytes(w.tmpHash64[:]) } func (w *writer) Hash(s *LSym) { if !s.ContentAddressable() { panic("Hash of non-content-addressable symbol") } w.tmpHash = w.contentHash(s) w.Bytes(w.tmpHash[:]) } // contentHashSection returns a mnemonic for s's section. // The goal is to prevent content-addressability from moving symbols between sections.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 19:57:43 UTC 2024 - 24K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/project/artifact/DefaultMavenMetadataCache.java
this.artifact = ArtifactUtils.copyArtifact(artifact); if ("pom".equals(artifact.getType()) && file != null) { pomHash = file.getPath().hashCode() + file.lastModified(); } else { pomHash = 0; } this.resolveManagedVersions = resolveManagedVersions; this.repositories.add(localRepository);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu Jun 15 14:24:56 UTC 2023 - 11.8K bytes - Viewed (0) -
cmd/bucket-lifecycle.go
return e.workers.Load() } type expiryOp interface { OpHash() uint64 } type freeVersionTask struct { ObjectInfo } func (f freeVersionTask) OpHash() uint64 { return xxh3.HashString(f.TransitionedObject.Tier + f.TransitionedObject.Name) } func (n newerNoncurrentTask) OpHash() uint64 { return xxh3.HashString(n.bucket + n.versions[0].ObjectV.ObjectName) }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:31:51 UTC 2024 - 33.3K bytes - Viewed (0) -
src/runtime/alg.go
// typehash, but we want to report the topmost type in // the error text (e.g. in a struct with a field of slice type // we want to report the struct, not the slice). panic(errorString("hash of unhashable type " + toRType(t).string())) } if isDirectIface(t) { return c1 * typehash(t, unsafe.Pointer(&a.data), h^c0) } else { return c1 * typehash(t, a.data, h^c0) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 13.6K bytes - Viewed (0)