sync.Pool: Per-P Caches, a Victim Generation and Why Items Vanish
sync.Pool is a per-P cache of per-P lock-free rings plus a private slot, with a victim generation that lets objects survive one GC cycle before being dropped.
Go
unique.Make and the Weak Pointer Map: Canonicalizing Strings Without Leaking
unique.Make hashes a value into a lock-free hash trie whose leaves hold weak pointers and cleanup callbacks, so interned strings die with the last handle that references them.
unsafe.Pointer and //go:linkname: The Escape Hatches That Break Abstraction
unsafe.Pointer reinterprets memory and //go:linkname reaches into other packages’ unexported symbols; the linker enforces an allowlist of linkname pulls and prunes unreachable …
Weak Pointers in Go: The Runtime's Special Span for Non-Tracked Objects
weak.Pointer is backed by a per-object special record holding a uintptr handle, which the GC scans as a root but never treats as a strong reference, so the target can still be …
Why Go Randomizes Map Iteration: The Attack It Prevents
Map iteration picks two random offsets at start-up - one in the table directory, one in the slot space - and every map gets a random hash seed, which together defeat hash-flooding …