File Manager

✏️ /

// Copyright 2010 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

// Export guts for testing.

package runtime

import (
	"internal/abi"
	"internal/goarch"
	"internal/goexperiment"
	"internal/goos"
	"runtime/internal/atomic"
	"runtime/internal/sys"
	"unsafe"
)

var Fadd64 = fadd64
var Fsub64 = fsub64
var Fmul64 = fmul64
var Fdiv64 = fdiv64
var F64to32 = f64to32
var F32to64 = f32to64
var Fcmp64 = fcmp64
var Fintto64 = fintto64
var F64toint = f64toint

var Entersyscall = entersyscall
var Exitsyscall = exitsyscall
var LockedOSThread = lockedOSThread
var Xadduintptr = atomic.Xadduintptr

var ReadRandomFailed = &readRandomFailed

var Fastlog2 = fastlog2

var Atoi = atoi
var Atoi32 = atoi32
var ParseByteCount = parseByteCount

var Nanotime = nanotime
var NetpollBreak = netpollBreak
var Usleep = usleep

var PhysPageSize = physPageSize
var PhysHugePageSize = physHugePageSize

var NetpollGenericInit = netpollGenericInit

var Memmove = memmove
var MemclrNoHeapPointers = memclrNoHeapPointers

var CgoCheckPointer = cgoCheckPointer

const CrashStackImplemented = crashStackImplemented

const TracebackInnerFrames = tracebackInnerFrames
const TracebackOuterFrames = tracebackOuterFrames

var MapKeys = keys
var MapValues = values

var LockPartialOrder = lockPartialOrder

type LockRank lockRank

func (l LockRank) String() string {
	return lockRank(l).String()
}

const PreemptMSupported = preemptMSupported

type LFNode struct {
	Next    uint64
	Pushcnt uintptr
}

func LFStackPush(head *uint64, node *LFNode) {
	(*lfstack)(head).push((*lfnode)(unsafe.Pointer(node)))
}

func LFStackPop(head *uint64) *LFNode {
	return (*LFNode)((*lfstack)(head).pop())
}
func LFNodeValidate(node *LFNode) {
	lfnodeValidate((*lfnode)(unsafe.Pointer(node)))
}

func Netpoll(delta int64) {
	systemstack(func() {
		netpoll(delta)
	})
}

func GCMask(x any) (ret []byte) {
	systemstack(func() {
		ret = getgcmask(x)
	})
	return
}

func RunSchedLocalQueueTest() {
	pp := new(p)
	gs := make([]g, len(pp.runq))
	Escape(gs) // Ensure gs doesn't move, since we use guintptrs
	for i := 0; i < len(pp.runq); i++ {
		if g, _ := runqget(pp); g != nil {
			throw("runq is not empty initially")
		}
		for j := 0; j < i; j++ {
			runqput(pp, &gs[i], false)
		}
		for j := 0; j < i; j++ {
			if g, _ := runqget(pp); g != &gs[i] {
				print("bad element at iter ", i, "/", j, "\n")
				throw("bad element")
			}
		}
		if g, _ := runqget(pp); g != nil {
			throw("runq is not empty afterwards")
		}
	}
}

func RunSchedLocalQueueStealTest() {
	p1 := new(p)
	p2 := new(p)
	gs := make([]g, len(p1.runq))
	Escape(gs) // Ensure gs doesn't move, since we use guintptrs
	for i := 0; i < len(p1.runq); i++ {
		for j := 0; j < i; j++ {
			gs[j].sig = 0
			runqput(p1, &gs[j], false)
		}
		gp := runqsteal(p2, p1, true)
		s := 0
		if gp != nil {
			s++
			gp.sig++
		}
		for {
			gp, _ = runqget(p2)
			if gp == nil {
				break
			}
			s++
			gp.sig++
		}
		for {
			gp, _ = runqget(p1)
			if gp == nil {
				break
			}
			gp.sig++
		}
		for j := 0; j < i; j++ {
			if gs[j].sig != 1 {
				print("bad element ", j, "(", gs[j].sig, ") at iter ", i, "\n")
				throw("bad element")
			}
		}
		if s != i/2 && s != i/2+1 {
			print("bad steal ", s, ", want ", i/2, " or ", i/2+1, ", iter ", i, "\n")
			throw("bad steal")
		}
	}
}

func RunSchedLocalQueueEmptyTest(iters int) {
	// Test that runq is not spuriously reported as empty.
	// Runq emptiness affects scheduling decisions and spurious emptiness
	// can lead to underutilization (both runnable Gs and idle Ps coexist
	// for arbitrary long time).
	done := make(chan bool, 1)
	p := new(p)
	gs := make([]g, 2)
	Escape(gs) // Ensure gs doesn't move, since we use guintptrs
	ready := new(uint32)
	for i := 0; i < iters; i++ {
		*ready = 0
		next0 := (i & 1) == 0
		next1 := (i & 2) == 0
		runqput(p, &gs[0], next0)
		go func() {
			for atomic.Xadd(ready, 1); atomic.Load(ready) != 2; {
			}
			if runqempty(p) {
				println("next:", next0, next1)
				throw("queue is empty")
			}
			done <- true
		}()
		for atomic.Xadd(ready, 1); atomic.Load(ready) != 2; {
		}
		runqput(p, &gs[1], next1)
		runqget(p)
		<-done
		runqget(p)
	}
}

var (
	StringHash = stringHash
	BytesHash  = bytesHash
	Int32Hash  = int32Hash
	Int64Hash  = int64Hash
	MemHash    = memhash
	MemHash32  = memhash32
	MemHash64  = memhash64
	EfaceHash  = efaceHash
	IfaceHash  = ifaceHash
)

var UseAeshash = &useAeshash

func MemclrBytes(b []byte) {
	s := (*slice)(unsafe.Pointer(&b))
	memclrNoHeapPointers(s.array, uintptr(s.len))
}

const HashLoad = hashLoad

// entry point for testing
func GostringW(w []uint16) (s string) {
	systemstack(func() {
		s = gostringw(&w[0])
	})
	return
}

var Open = open
var Close = closefd
var Read = read
var Write = write

func Envs() []string     { return envs }
func SetEnvs(e []string) { envs = e }

// For benchmarking.

// blockWrapper is a wrapper type that ensures a T is placed within a
// large object. This is necessary for safely benchmarking things
// that manipulate the heap bitmap, like heapBitsSetType.
//
// More specifically, allocating threads assume they're the sole writers
// to their span's heap bits, which allows those writes to be non-atomic.
// The heap bitmap is written byte-wise, so if one tried to call heapBitsSetType
// on an existing object in a small object span, we might corrupt that
// span's bitmap with a concurrent byte write to the heap bitmap. Large
// object spans contain exactly one object, so we can be sure no other P
// is going to be allocating from it concurrently, hence this wrapper type
// which ensures we have a T in a large object span.
type blockWrapper[T any] struct {
	value T
	_     [_MaxSmallSize]byte // Ensure we're a large object.
}

func BenchSetType[T any](n int, resetTimer func()) {
	x := new(blockWrapper[T])

// Escape x to ensure it is allocated on the heap, as we are
	// working on the heap bits here.
	Escape(x)

// Grab the type.
	var i any = *new(T)
	e := *efaceOf(&i)
	t := e._type

// Benchmark setting the type bits for just the internal T of the block.
	benchSetType(n, resetTimer, 1, unsafe.Pointer(&x.value), t)
}

const maxArrayBlockWrapperLen = 32

// arrayBlockWrapper is like blockWrapper, but the interior value is intended
// to be used as a backing store for a slice.
type arrayBlockWrapper[T any] struct {
	value [maxArrayBlockWrapperLen]T
	_     [_MaxSmallSize]byte // Ensure we're a large object.
}

// arrayLargeBlockWrapper is like arrayBlockWrapper, but the interior array
// accommodates many more elements.
type arrayLargeBlockWrapper[T any] struct {
	value [1024]T
	_     [_MaxSmallSize]byte // Ensure we're a large object.
}

func BenchSetTypeSlice[T any](n int, resetTimer func(), len int) {
	// We have two separate cases here because we want to avoid
	// tests on big types but relatively small slices to avoid generating
	// an allocation that's really big. This will likely force a GC which will
	// skew the test results.
	var y unsafe.Pointer
	if len <= maxArrayBlockWrapperLen {
		x := new(arrayBlockWrapper[T])
		// Escape x to ensure it is allocated on the heap, as we are
		// working on the heap bits here.
		Escape(x)
		y = unsafe.Pointer(&x.value[0])
	} else {
		x := new(arrayLargeBlockWrapper[T])
		Escape(x)
		y = unsafe.Pointer(&x.value[0])
	}

// Grab the type.
	var i any = *new(T)
	e := *efaceOf(&i)
	t := e._type

// Benchmark setting the type for a slice created from the array
	// of T within the arrayBlock.
	benchSetType(n, resetTimer, len, y, t)
}

// benchSetType is the implementation of the BenchSetType* functions.
// x must be len consecutive Ts allocated within a large object span (to
// avoid a race on the heap bitmap).
//
// Note: this function cannot be generic. It would get its type from one of
// its callers (BenchSetType or BenchSetTypeSlice) whose type parameters are
// set by a call in the runtime_test package. That means this function and its
// callers will get instantiated in the package that provides the type argument,
// i.e. runtime_test. However, we call a function on the system stack. In race
// mode the runtime package is usually left uninstrumented because e.g. g0 has
// no valid racectx, but if we're instantiated in the runtime_test package,
// we might accidentally cause runtime code to be incorrectly instrumented.
func benchSetType(n int, resetTimer func(), len int, x unsafe.Pointer, t *_type) {
	// This benchmark doesn't work with the allocheaders experiment. It sets up
	// an elaborate scenario to be able to benchmark the function safely, but doing
	// this work for the allocheaders' version of the function would be complex.
	// Just fail instead and rely on the test code making sure we never get here.
	if goexperiment.AllocHeaders {
		panic("called benchSetType with allocheaders experiment enabled")
	}

// Compute the input sizes.
	size := t.Size() * uintptr(len)

// Validate this function's invariant.
	s := spanOfHeap(uintptr(x))
	if s == nil {
		panic("no heap span for input")
	}
	if s.spanclass.sizeclass() != 0 {
		panic("span is not a large object span")
	}

// Round up the size to the size class to make the benchmark a little more
	// realistic. However, validate it, to make sure this is safe.
	allocSize := roundupsize(size, t.PtrBytes == 0)
	if s.npages*pageSize < allocSize {
		panic("backing span not large enough for benchmark")
	}

// Benchmark heapBitsSetType by calling it in a loop. This is safe because
	// x is in a large object span.
	resetTimer()
	systemstack(func() {
		for i := 0; i < n; i++ {
			heapBitsSetType(uintptr(x), allocSize, size, t)
		}
	})

// Make sure x doesn't get freed, since we're taking a uintptr.
	KeepAlive(x)
}

const PtrSize = goarch.PtrSize

var ForceGCPeriod = &forcegcperiod

// SetTracebackEnv is like runtime/debug.SetTraceback, but it raises
// the "environment" traceback level, so later calls to
// debug.SetTraceback (e.g., from testing timeouts) can't lower it.
func SetTracebackEnv(level string) {
	setTraceback(level)
	traceback_env = traceback_cache
}

var ReadUnaligned32 = readUnaligned32
var ReadUnaligned64 = readUnaligned64

func CountPagesInUse() (pagesInUse, counted uintptr) {
	stw := stopTheWorld(stwForTestCountPagesInUse)

pagesInUse = mheap_.pagesInUse.Load()

for _, s := range mheap_.allspans {
		if s.state.get() == mSpanInUse {
			counted += s.npages
		}
	}

startTheWorld(stw)

return
}

func Fastrand() uint32          { return uint32(rand()) }
func Fastrand64() uint64        { return rand() }
func Fastrandn(n uint32) uint32 { return randn(n) }

type ProfBuf profBuf

func NewProfBuf(hdrsize, bufwords, tags int) *ProfBuf {
	return (*ProfBuf)(newProfBuf(hdrsize, bufwords, tags))
}

func (p *ProfBuf) Write(tag *unsafe.Pointer, now int64, hdr []uint64, stk []uintptr) {
	(*profBuf)(p).write(tag, now, hdr, stk)
}

const (
	ProfBufBlocking    = profBufBlocking
	ProfBufNonBlocking = profBufNonBlocking
)

func (p *ProfBuf) Read(mode profBufReadMode) ([]uint64, []unsafe.Pointer, bool) {
	return (*profBuf)(p).read(mode)
}

func (p *ProfBuf) Close() {
	(*profBuf)(p).close()
}

func ReadMetricsSlow(memStats *MemStats, samplesp unsafe.Pointer, len, cap int) {
	stw := stopTheWorld(stwForTestReadMetricsSlow)

// Initialize the metrics beforehand because this could
	// allocate and skew the stats.
	metricsLock()
	initMetrics()

systemstack(func() {
		// Donate the racectx to g0. readMetricsLocked calls into the race detector
		// via map access.
		getg().racectx = getg().m.curg.racectx

// Read the metrics once before in case it allocates and skews the metrics.
		// readMetricsLocked is designed to only allocate the first time it is called
		// with a given slice of samples. In effect, this extra read tests that this
		// remains true, since otherwise the second readMetricsLocked below could
		// allocate before it returns.
		readMetricsLocked(samplesp, len, cap)

// Read memstats first. It's going to flush
		// the mcaches which readMetrics does not do, so
		// going the other way around may result in
		// inconsistent statistics.
		readmemstats_m(memStats)

// Read metrics again. We need to be sure we're on the
		// system stack with readmemstats_m so that we don't call into
		// the stack allocator and adjust metrics between there and here.
		readMetricsLocked(samplesp, len, cap)

// Undo the donation.
		getg().racectx = 0
	})
	metricsUnlock()

startTheWorld(stw)
}

var DoubleCheckReadMemStats = &doubleCheckReadMemStats

// ReadMemStatsSlow returns both the runtime-computed MemStats and
// MemStats accumulated by scanning the heap.
func ReadMemStatsSlow() (base, slow MemStats) {
	stw := stopTheWorld(stwForTestReadMemStatsSlow)

// Run on the system stack to avoid stack growth allocation.
	systemstack(func() {
		// Make sure stats don't change.
		getg().m.mallocing++

readmemstats_m(&base)

// Initialize slow from base and zero the fields we're
		// recomputing.
		slow = base
		slow.Alloc = 0
		slow.TotalAlloc = 0
		slow.Mallocs = 0
		slow.Frees = 0
		slow.HeapReleased = 0
		var bySize [_NumSizeClasses]struct {
			Mallocs, Frees uint64
		}

// Add up current allocations in spans.
		for _, s := range mheap_.allspans {
			if s.state.get() != mSpanInUse {
				continue
			}
			if s.isUnusedUserArenaChunk() {
				continue
			}
			if sizeclass := s.spanclass.sizeclass(); sizeclass == 0 {
				slow.Mallocs++
				slow.Alloc += uint64(s.elemsize)
			} else {
				slow.Mallocs += uint64(s.allocCount)
				slow.Alloc += uint64(s.allocCount) * uint64(s.elemsize)
				bySize[sizeclass].Mallocs += uint64(s.allocCount)
			}
		}

// Add in frees by just reading the stats for those directly.
		var m heapStatsDelta
		memstats.heapStats.unsafeRead(&m)

// Collect per-sizeclass free stats.
		var smallFree uint64
		for i := 0; i < _NumSizeClasses; i++ {
			slow.Frees += m.smallFreeCount[i]
			bySize[i].Frees += m.smallFreeCount[i]
			bySize[i].Mallocs += m.smallFreeCount[i]
			smallFree += m.smallFreeCount[i] * uint64(class_to_size[i])
		}
		slow.Frees += m.tinyAllocCount + m.largeFreeCount
		slow.Mallocs += slow.Frees

slow.TotalAlloc = slow.Alloc + m.largeFree + smallFree

for i := range slow.BySize {
			slow.BySize[i].Mallocs = bySize[i].Mallocs
			slow.BySize[i].Frees = bySize[i].Frees
		}

for i := mheap_.pages.start; i < mheap_.pages.end; i++ {
			chunk := mheap_.pages.tryChunkOf(i)
			if chunk == nil {
				continue
			}
			pg := chunk.scavenged.popcntRange(0, pallocChunkPages)
			slow.HeapReleased += uint64(pg) * pageSize
		}
		for _, p := range allp {
			pg := sys.OnesCount64(p.pcache.scav)
			slow.HeapReleased += uint64(pg) * pageSize
		}

getg().m.mallocing--
	})

startTheWorld(stw)
	return
}

// ShrinkStackAndVerifyFramePointers attempts to shrink the stack of the current goroutine
// and verifies that unwinding the new stack doesn't crash, even if the old
// stack has been freed or reused (simulated via poisoning).
func ShrinkStackAndVerifyFramePointers() {
	before := stackPoisonCopy
	defer func() { stackPoisonCopy = before }()
	stackPoisonCopy = 1

gp := getg()
	systemstack(func() {
		shrinkstack(gp)
	})
	// If our new stack contains frame pointers into the old stack, this will
	// crash because the old stack has been poisoned.
	FPCallers(make([]uintptr, 1024))
}

// BlockOnSystemStack switches to the system stack, prints "x\n" to
// stderr, and blocks in a stack containing
// "runtime.blockOnSystemStackInternal".
func BlockOnSystemStack() {
	systemstack(blockOnSystemStackInternal)
}

func blockOnSystemStackInternal() {
	print("x\n")
	lock(&deadlock)
	lock(&deadlock)
}

type RWMutex struct {
	rw rwmutex
}

func (rw *RWMutex) Init() {
	rw.rw.init(lockRankTestR, lockRankTestRInternal, lockRankTestW)
}

func (rw *RWMutex) RLock() {
	rw.rw.rlock()
}

func (rw *RWMutex) RUnlock() {
	rw.rw.runlock()
}

func (rw *RWMutex) Lock() {
	rw.rw.lock()
}

func (rw *RWMutex) Unlock() {
	rw.rw.unlock()
}

const RuntimeHmapSize = unsafe.Sizeof(hmap{})

func MapBucketsCount(m map[int]int) int {
	h := *(**hmap)(unsafe.Pointer(&m))
	return 1 << h.B
}

func MapBucketsPointerIsNil(m map[int]int) bool {
	h := *(**hmap)(unsafe.Pointer(&m))
	return h.buckets == nil
}

func OverLoadFactor(count int, B uint8) bool {
	return overLoadFactor(count, B)
}

func LockOSCounts() (external, internal uint32) {
	gp := getg()
	if gp.m.lockedExt+gp.m.lockedInt == 0 {
		if gp.lockedm != 0 {
			panic("lockedm on non-locked goroutine")
		}
	} else {
		if gp.lockedm == 0 {
			panic("nil lockedm on locked goroutine")
		}
	}
	return gp.m.lockedExt, gp.m.lockedInt
}

//go:noinline
func TracebackSystemstack(stk []uintptr, i int) int {
	if i == 0 {
		pc, sp := getcallerpc(), getcallersp()
		var u unwinder
		u.initAt(pc, sp, 0, getg(), unwindJumpStack) // Don't ignore errors, for testing
		return tracebackPCs(&u, 0, stk)
	}
	n := 0
	systemstack(func() {
		n = TracebackSystemstack(stk, i-1)
	})
	return n
}

func KeepNArenaHints(n int) {
	hint := mheap_.arenaHints
	for i := 1; i < n; i++ {
		hint = hint.next
		if hint == nil {
			return
		}
	}
	hint.next = nil
}

// MapNextArenaHint reserves a page at the next arena growth hint,
// preventing the arena from growing there, and returns the range of
// addresses that are no longer viable.
//
// This may fail to reserve memory. If it fails, it still returns the
// address range it attempted to reserve.
func MapNextArenaHint() (start, end uintptr, ok bool) {
	hint := mheap_.arenaHints
	addr := hint.addr
	if hint.down {
		start, end = addr-heapArenaBytes, addr
		addr -= physPageSize
	} else {
		start, end = addr, addr+heapArenaBytes
	}
	got := sysReserve(unsafe.Pointer(addr), physPageSize)
	ok = (addr == uintptr(got))
	if !ok {
		// We were unable to get the requested reservation.
		// Release what we did get and fail.
		sysFreeOS(got, physPageSize)
	}
	return
}

func GetNextArenaHint() uintptr {
	return mheap_.arenaHints.addr
}

type G = g

type Sudog = sudog

func Getg() *G {
	return getg()
}

func Goid() uint64 {
	return getg().goid
}

func GIsWaitingOnMutex(gp *G) bool {
	return readgstatus(gp) == _Gwaiting && gp.waitreason.isMutexWait()
}

var CasGStatusAlwaysTrack = &casgstatusAlwaysTrack

//go:noinline
func PanicForTesting(b []byte, i int) byte {
	return unexportedPanicForTesting(b, i)
}

//go:noinline
func unexportedPanicForTesting(b []byte, i int) byte {
	return b[i]
}

func G0StackOverflow() {
	systemstack(func() {
		g0 := getg()
		sp := getcallersp()
		// The stack bounds for g0 stack is not always precise.
		// Use an artificially small stack, to trigger a stack overflow
		// without actually run out of the system stack (which may seg fault).
		g0.stack.lo = sp - 4096 - stackSystem
		g0.stackguard0 = g0.stack.lo + stackGuard
		g0.stackguard1 = g0.stackguard0

stackOverflow(nil)
	})
}

func stackOverflow(x *byte) {
	var buf [256]byte
	stackOverflow(&buf[0])
}

func MapTombstoneCheck(m map[int]int) {
	// Make sure emptyOne and emptyRest are distributed correctly.
	// We should have a series of filled and emptyOne cells, followed by
	// a series of emptyRest cells.
	h := *(**hmap)(unsafe.Pointer(&m))
	i := any(m)
	t := *(**maptype)(unsafe.Pointer(&i))

for x := 0; x < 1<<h.B; x++ {
		b0 := (*bmap)(add(h.buckets, uintptr(x)*uintptr(t.BucketSize)))
		n := 0
		for b := b0; b != nil; b = b.overflow(t) {
			for i := 0; i < bucketCnt; i++ {
				if b.tophash[i] != emptyRest {
					n++
				}
			}
		}
		k := 0
		for b := b0; b != nil; b = b.overflow(t) {
			for i := 0; i < bucketCnt; i++ {
				if k < n && b.tophash[i] == emptyRest {
					panic("early emptyRest")
				}
				if k >= n && b.tophash[i] != emptyRest {
					panic("late non-emptyRest")
				}
				if k == n-1 && b.tophash[i] == emptyOne {
					panic("last non-emptyRest entry is emptyOne")
				}
				k++
			}
		}
	}
}

func RunGetgThreadSwitchTest() {
	// Test that getg works correctly with thread switch.
	// With gccgo, if we generate getg inlined, the backend
	// may cache the address of the TLS variable, which
	// will become invalid after a thread switch. This test
	// checks that the bad caching doesn't happen.

ch := make(chan int)
	go func(ch chan int) {
		ch <- 5
		LockOSThread()
	}(ch)

g1 := getg()

// Block on a receive. This is likely to get us a thread
	// switch. If we yield to the sender goroutine, it will
	// lock the thread, forcing us to resume on a different
	// thread.
	<-ch

g2 := getg()
	if g1 != g2 {
		panic("g1 != g2")
	}

// Also test getg after some control flow, as the
	// backend is sensitive to control flow.
	g3 := getg()
	if g1 != g3 {
		panic("g1 != g3")
	}
}

const (
	PageSize         = pageSize
	PallocChunkPages = pallocChunkPages
	PageAlloc64Bit   = pageAlloc64Bit
	PallocSumBytes   = pallocSumBytes
)

// Expose pallocSum for testing.
type PallocSum pallocSum

func PackPallocSum(start, max, end uint) PallocSum { return PallocSum(packPallocSum(start, max, end)) }
func (m PallocSum) Start() uint                    { return pallocSum(m).start() }
func (m PallocSum) Max() uint                      { return pallocSum(m).max() }
func (m PallocSum) End() uint                      { return pallocSum(m).end() }

// Expose pallocBits for testing.
type PallocBits pallocBits

func (b *PallocBits) Find(npages uintptr, searchIdx uint) (uint, uint) {
	return (*pallocBits)(b).find(npages, searchIdx)
}
func (b *PallocBits) AllocRange(i, n uint)       { (*pallocBits)(b).allocRange(i, n) }
func (b *PallocBits) Free(i, n uint)             { (*pallocBits)(b).free(i, n) }
func (b *PallocBits) Summarize() PallocSum       { return PallocSum((*pallocBits)(b).summarize()) }
func (b *PallocBits) PopcntRange(i, n uint) uint { return (*pageBits)(b).popcntRange(i, n) }

// SummarizeSlow is a slow but more obviously correct implementation
// of (*pallocBits).summarize. Used for testing.
func SummarizeSlow(b *PallocBits) PallocSum {
	var start, most, end uint

const N = uint(len(b)) * 64
	for start < N && (*pageBits)(b).get(start) == 0 {
		start++
	}
	for end < N && (*pageBits)(b).get(N-end-1) == 0 {
		end++
	}
	run := uint(0)
	for i := uint(0); i < N; i++ {
		if (*pageBits)(b).get(i) == 0 {
			run++
		} else {
			run = 0
		}
		most = max(most, run)
	}
	return PackPallocSum(start, most, end)
}

// Expose non-trivial helpers for testing.
func FindBitRange64(c uint64, n uint) uint { return findBitRange64(c, n) }

// Given two PallocBits, returns a set of bit ranges where
// they differ.
func DiffPallocBits(a, b *PallocBits) []BitRange {
	ba := (*pageBits)(a)
	bb := (*pageBits)(b)

var d []BitRange
	base, size := uint(0), uint(0)
	for i := uint(0); i < uint(len(ba))*64; i++ {
		if ba.get(i) != bb.get(i) {
			if size == 0 {
				base = i
			}
			size++
		} else {
			if size != 0 {
				d = append(d, BitRange{base, size})
			}
			size = 0
		}
	}
	if size != 0 {
		d = append(d, BitRange{base, size})
	}
	return d
}

// StringifyPallocBits gets the bits in the bit range r from b,
// and returns a string containing the bits as ASCII 0 and 1
// characters.
func StringifyPallocBits(b *PallocBits, r BitRange) string {
	str := ""
	for j := r.I; j < r.I+r.N; j++ {
		if (*pageBits)(b).get(j) != 0 {
			str += "1"
		} else {
			str += "0"
		}
	}
	return str
}

// Expose pallocData for testing.
type PallocData pallocData

func (d *PallocData) FindScavengeCandidate(searchIdx uint, min, max uintptr) (uint, uint) {
	return (*pallocData)(d).findScavengeCandidate(searchIdx, min, max)
}
func (d *PallocData) AllocRange(i, n uint) { (*pallocData)(d).allocRange(i, n) }
func (d *PallocData) ScavengedSetRange(i, n uint) {
	(*pallocData)(d).scavenged.setRange(i, n)
}
func (d *PallocData) PallocBits() *PallocBits {
	return (*PallocBits)(&(*pallocData)(d).pallocBits)
}
func (d *PallocData) Scavenged() *PallocBits {
	return (*PallocBits)(&(*pallocData)(d).scavenged)
}

// Expose fillAligned for testing.
func FillAligned(x uint64, m uint) uint64 { return fillAligned(x, m) }

// Expose pageCache for testing.
type PageCache pageCache

const PageCachePages = pageCachePages

func NewPageCache(base uintptr, cache, scav uint64) PageCache {
	return PageCache(pageCache{base: base, cache: cache, scav: scav})
}
func (c *PageCache) Empty() bool   { return (*pageCache)(c).empty() }
func (c *PageCache) Base() uintptr { return (*pageCache)(c).base }
func (c *PageCache) Cache() uint64 { return (*pageCache)(c).cache }
func (c *PageCache) Scav() uint64  { return (*pageCache)(c).scav }
func (c *PageCache) Alloc(npages uintptr) (uintptr, uintptr) {
	return (*pageCache)(c).alloc(npages)
}
func (c *PageCache) Flush(s *PageAlloc) {
	cp := (*pageCache)(c)
	sp := (*pageAlloc)(s)

systemstack(func() {
		// None of the tests need any higher-level locking, so we just
		// take the lock internally.
		lock(sp.mheapLock)
		cp.flush(sp)
		unlock(sp.mheapLock)
	})
}

// Expose chunk index type.
type ChunkIdx chunkIdx

// Expose pageAlloc for testing. Note that because pageAlloc is
// not in the heap, so is PageAlloc.
type PageAlloc pageAlloc

func (p *PageAlloc) Alloc(npages uintptr) (uintptr, uintptr) {
	pp := (*pageAlloc)(p)

var addr, scav uintptr
	systemstack(func() {
		// None of the tests need any higher-level locking, so we just
		// take the lock internally.
		lock(pp.mheapLock)
		addr, scav = pp.alloc(npages)
		unlock(pp.mheapLock)
	})
	return addr, scav
}
func (p *PageAlloc) AllocToCache() PageCache {
	pp := (*pageAlloc)(p)

var c PageCache
	systemstack(func() {
		// None of the tests need any higher-level locking, so we just
		// take the lock internally.
		lock(pp.mheapLock)
		c = PageCache(pp.allocToCache())
		unlock(pp.mheapLock)
	})
	return c
}
func (p *PageAlloc) Free(base, npages uintptr) {
	pp := (*pageAlloc)(p)

systemstack(func() {
		// None of the tests need any higher-level locking, so we just
		// take the lock internally.
		lock(pp.mheapLock)
		pp.free(base, npages)
		unlock(pp.mheapLock)
	})
}
func (p *PageAlloc) Bounds() (ChunkIdx, ChunkIdx) {
	return ChunkIdx((*pageAlloc)(p).start), ChunkIdx((*pageAlloc)(p).end)
}
func (p *PageAlloc) Scavenge(nbytes uintptr) (r uintptr) {
	pp := (*pageAlloc)(p)
	systemstack(func() {
		r = pp.scavenge(nbytes, nil, true)
	})
	return
}
func (p *PageAlloc) InUse() []AddrRange {
	ranges := make([]AddrRange, 0, len(p.inUse.ranges))
	for _, r := range p.inUse.ranges {
		ranges = append(ranges, AddrRange{r})
	}
	return ranges
}

// Returns nil if the PallocData's L2 is missing.
func (p *PageAlloc) PallocData(i ChunkIdx) *PallocData {
	ci := chunkIdx(i)
	return (*PallocData)((*pageAlloc)(p).tryChunkOf(ci))
}

// AddrRange is a wrapper around addrRange for testing.
type AddrRange struct {
	addrRange
}

// MakeAddrRange creates a new address range.
func MakeAddrRange(base, limit uintptr) AddrRange {
	return AddrRange{makeAddrRange(base, limit)}
}

// Base returns the virtual base address of the address range.
func (a AddrRange) Base() uintptr {
	return a.addrRange.base.addr()
}

// Base returns the virtual address of the limit of the address range.
func (a AddrRange) Limit() uintptr {
	return a.addrRange.limit.addr()
}

// Equals returns true if the two address ranges are exactly equal.
func (a AddrRange) Equals(b AddrRange) bool {
	return a == b
}

// Size returns the size in bytes of the address range.
func (a AddrRange) Size() uintptr {
	return a.addrRange.size()
}

// testSysStat is the sysStat passed to test versions of various
// runtime structures. We do actually have to keep track of this
// because otherwise memstats.mappedReady won't actually line up
// with other stats in the runtime during tests.
var testSysStat = &memstats.other_sys

// AddrRanges is a wrapper around addrRanges for testing.
type AddrRanges struct {
	addrRanges
	mutable bool
}

// NewAddrRanges creates a new empty addrRanges.
//
// Note that this initializes addrRanges just like in the
// runtime, so its memory is persistentalloc'd. Call this
// function sparingly since the memory it allocates is
// leaked.
//
// This AddrRanges is mutable, so we can test methods like
// Add.
func NewAddrRanges() AddrRanges {
	r := addrRanges{}
	r.init(testSysStat)
	return AddrRanges{r, true}
}

// MakeAddrRanges creates a new addrRanges populated with
// the ranges in a.
//
// The returned AddrRanges is immutable, so methods like
// Add will fail.
func MakeAddrRanges(a ...AddrRange) AddrRanges {
	// Methods that manipulate the backing store of addrRanges.ranges should
	// not be used on the result from this function (e.g. add) since they may
	// trigger reallocation. That would normally be fine, except the new
	// backing store won't come from the heap, but from persistentalloc, so
	// we'll leak some memory implicitly.
	ranges := make([]addrRange, 0, len(a))
	total := uintptr(0)
	for _, r := range a {
		ranges = append(ranges, r.addrRange)
		total += r.Size()
	}
	return AddrRanges{addrRanges{
		ranges:     ranges,
		totalBytes: total,
		sysStat:    testSysStat,
	}, false}
}

// Ranges returns a copy of the ranges described by the
// addrRanges.
func (a *AddrRanges) Ranges() []AddrRange {
	result := make([]AddrRange, 0, len(a.addrRanges.ranges))
	for _, r := range a.addrRanges.ranges {
		result = append(result, AddrRange{r})
	}
	return result
}

// FindSucc returns the successor to base. See addrRanges.findSucc
// for more details.
func (a *AddrRanges) FindSucc(base uintptr) int {
	return a.findSucc(base)
}

// Add adds a new AddrRange to the AddrRanges.
//
// The AddrRange must be mutable (i.e. created by NewAddrRanges),
// otherwise this method will throw.
func (a *AddrRanges) Add(r AddrRange) {
	if !a.mutable {
		throw("attempt to mutate immutable AddrRanges")
	}
	a.add(r.addrRange)
}

// TotalBytes returns the totalBytes field of the addrRanges.
func (a *AddrRanges) TotalBytes() uintptr {
	return a.addrRanges.totalBytes
}

// BitRange represents a range over a bitmap.
type BitRange struct {
	I, N uint // bit index and length in bits
}

// NewPageAlloc creates a new page allocator for testing and
// initializes it with the scav and chunks maps. Each key in these maps
// represents a chunk index and each value is a series of bit ranges to
// set within each bitmap's chunk.
//
// The initialization of the pageAlloc preserves the invariant that if a
// scavenged bit is set the alloc bit is necessarily unset, so some
// of the bits described by scav may be cleared in the final bitmap if
// ranges in chunks overlap with them.
//
// scav is optional, and if nil, the scavenged bitmap will be cleared
// (as opposed to all 1s, which it usually is). Furthermore, every
// chunk index in scav must appear in chunks; ones that do not are
// ignored.
func NewPageAlloc(chunks, scav map[ChunkIdx][]BitRange) *PageAlloc {
	p := new(pageAlloc)

// We've got an entry, so initialize the pageAlloc.
	p.init(new(mutex), testSysStat, true)
	lockInit(p.mheapLock, lockRankMheap)
	for i, init := range chunks {
		addr := chunkBase(chunkIdx(i))

// Mark the chunk's existence in the pageAlloc.
		systemstack(func() {
			lock(p.mheapLock)
			p.grow(addr, pallocChunkBytes)
			unlock(p.mheapLock)
		})

// Initialize the bitmap and update pageAlloc metadata.
		ci := chunkIndex(addr)
		chunk := p.chunkOf(ci)

// Clear all the scavenged bits which grow set.
		chunk.scavenged.clearRange(0, pallocChunkPages)

// Simulate the allocation and subsequent free of all pages in
		// the chunk for the scavenge index. This sets the state equivalent
		// with all pages within the index being free.
		p.scav.index.alloc(ci, pallocChunkPages)
		p.scav.index.free(ci, 0, pallocChunkPages)

// Apply scavenge state if applicable.
		if scav != nil {
			if scvg, ok := scav[i]; ok {
				for _, s := range scvg {
					// Ignore the case of s.N == 0. setRange doesn't handle
					// it and it's a no-op anyway.
					if s.N != 0 {
						chunk.scavenged.setRange(s.I, s.N)
					}
				}
			}
		}

// Apply alloc state.
		for _, s := range init {
			// Ignore the case of s.N == 0. allocRange doesn't handle
			// it and it's a no-op anyway.
			if s.N != 0 {
				chunk.allocRange(s.I, s.N)

// Make sure the scavenge index is updated.
				p.scav.index.alloc(ci, s.N)
			}
		}

// Update heap metadata for the allocRange calls above.
		systemstack(func() {
			lock(p.mheapLock)
			p.update(addr, pallocChunkPages, false, false)
			unlock(p.mheapLock)
		})
	}

return (*PageAlloc)(p)
}

// FreePageAlloc releases hard OS resources owned by the pageAlloc. Once this
// is called the pageAlloc may no longer be used. The object itself will be
// collected by the garbage collector once it is no longer live.
func FreePageAlloc(pp *PageAlloc) {
	p := (*pageAlloc)(pp)

// Free all the mapped space for the summary levels.
	if pageAlloc64Bit != 0 {
		for l := 0; l < summaryLevels; l++ {
			sysFreeOS(unsafe.Pointer(&p.summary[l][0]), uintptr(cap(p.summary[l]))*pallocSumBytes)
		}
	} else {
		resSize := uintptr(0)
		for _, s := range p.summary {
			resSize += uintptr(cap(s)) * pallocSumBytes
		}
		sysFreeOS(unsafe.Pointer(&p.summary[0][0]), alignUp(resSize, physPageSize))
	}

// Free extra data structures.
	sysFreeOS(unsafe.Pointer(&p.scav.index.chunks[0]), uintptr(cap(p.scav.index.chunks))*unsafe.Sizeof(atomicScavChunkData{}))

// Subtract back out whatever we mapped for the summaries.
	// sysUsed adds to p.sysStat and memstats.mappedReady no matter what
	// (and in anger should actually be accounted for), and there's no other
	// way to figure out how much we actually mapped.
	gcController.mappedReady.Add(-int64(p.summaryMappedReady))
	testSysStat.add(-int64(p.summaryMappedReady))

// Free the mapped space for chunks.
	for i := range p.chunks {
		if x := p.chunks[i]; x != nil {
			p.chunks[i] = nil
			// This memory comes from sysAlloc and will always be page-aligned.
			sysFree(unsafe.Pointer(x), unsafe.Sizeof(*p.chunks[0]), testSysStat)
		}
	}
}

// BaseChunkIdx is a convenient chunkIdx value which works on both
// 64 bit and 32 bit platforms, allowing the tests to share code
// between the two.
//
// This should not be higher than 0x100*pallocChunkBytes to support
// mips and mipsle, which only have 31-bit address spaces.
var BaseChunkIdx = func() ChunkIdx {
	var prefix uintptr
	if pageAlloc64Bit != 0 {
		prefix = 0xc000
	} else {
		prefix = 0x100
	}
	baseAddr := prefix * pallocChunkBytes
	if goos.IsAix != 0 {
		baseAddr += arenaBaseOffset
	}
	return ChunkIdx(chunkIndex(baseAddr))
}()

// PageBase returns an address given a chunk index and a page index
// relative to that chunk.
func PageBase(c ChunkIdx, pageIdx uint) uintptr {
	return chunkBase(chunkIdx(c)) + uintptr(pageIdx)*pageSize
}

type BitsMismatch struct {
	Base      uintptr
	Got, Want uint64
}

func CheckScavengedBitsCleared(mismatches []BitsMismatch) (n int, ok bool) {
	ok = true

// Run on the system stack to avoid stack growth allocation.
	systemstack(func() {
		getg().m.mallocing++

// Lock so that we can safely access the bitmap.
		lock(&mheap_.lock)
	chunkLoop:
		for i := mheap_.pages.start; i < mheap_.pages.end; i++ {
			chunk := mheap_.pages.tryChunkOf(i)
			if chunk == nil {
				continue
			}
			for j := 0; j < pallocChunkPages/64; j++ {
				// Run over each 64-bit bitmap section and ensure
				// scavenged is being cleared properly on allocation.
				// If a used bit and scavenged bit are both set, that's
				// an error, and could indicate a larger problem, or
				// an accounting problem.
				want := chunk.scavenged[j] &^ chunk.pallocBits[j]
				got := chunk.scavenged[j]
				if want != got {
					ok = false
					if n >= len(mismatches) {
						break chunkLoop
					}
					mismatches[n] = BitsMismatch{
						Base: chunkBase(i) + uintptr(j)*64*pageSize,
						Got:  got,
						Want: want,
					}
					n++
				}
			}
		}
		unlock(&mheap_.lock)

getg().m.mallocing--
	})
	return
}

func PageCachePagesLeaked() (leaked uintptr) {
	stw := stopTheWorld(stwForTestPageCachePagesLeaked)

// Walk over destroyed Ps and look for unflushed caches.
	deadp := allp[len(allp):cap(allp)]
	for _, p := range deadp {
		// Since we're going past len(allp) we may see nil Ps.
		// Just ignore them.
		if p != nil {
			leaked += uintptr(sys.OnesCount64(p.pcache.cache))
		}
	}

startTheWorld(stw)
	return
}

type Mutex = mutex

var Lock = lock
var Unlock = unlock

var MutexContended = mutexContended

func SemRootLock(addr *uint32) *mutex {
	root := semtable.rootFor(addr)
	return &root.lock
}

var Semacquire = semacquire
var Semrelease1 = semrelease1

func SemNwait(addr *uint32) uint32 {
	root := semtable.rootFor(addr)
	return root.nwait.Load()
}

const SemTableSize = semTabSize

// SemTable is a wrapper around semTable exported for testing.
type SemTable struct {
	semTable
}

// Enqueue simulates enqueuing a waiter for a semaphore (or lock) at addr.
func (t *SemTable) Enqueue(addr *uint32) {
	s := acquireSudog()
	s.releasetime = 0
	s.acquiretime = 0
	s.ticket = 0
	t.semTable.rootFor(addr).queue(addr, s, false)
}

// Dequeue simulates dequeuing a waiter for a semaphore (or lock) at addr.
//
// Returns true if there actually was a waiter to be dequeued.
func (t *SemTable) Dequeue(addr *uint32) bool {
	s, _, _ := t.semTable.rootFor(addr).dequeue(addr)
	if s != nil {
		releaseSudog(s)
		return true
	}
	return false
}

// mspan wrapper for testing.
type MSpan mspan

// Allocate an mspan for testing.
func AllocMSpan() *MSpan {
	var s *mspan
	systemstack(func() {
		lock(&mheap_.lock)
		s = (*mspan)(mheap_.spanalloc.alloc())
		unlock(&mheap_.lock)
	})
	return (*MSpan)(s)
}

// Free an allocated mspan.
func FreeMSpan(s *MSpan) {
	systemstack(func() {
		lock(&mheap_.lock)
		mheap_.spanalloc.free(unsafe.Pointer(s))
		unlock(&mheap_.lock)
	})
}

func MSpanCountAlloc(ms *MSpan, bits []byte) int {
	s := (*mspan)(ms)
	s.nelems = uint16(len(bits) * 8)
	s.gcmarkBits = (*gcBits)(unsafe.Pointer(&bits[0]))
	result := s.countAlloc()
	s.gcmarkBits = nil
	return result
}

const (
	TimeHistSubBucketBits = timeHistSubBucketBits
	TimeHistNumSubBuckets = timeHistNumSubBuckets
	TimeHistNumBuckets    = timeHistNumBuckets
	TimeHistMinBucketBits = timeHistMinBucketBits
	TimeHistMaxBucketBits = timeHistMaxBucketBits
)

type TimeHistogram timeHistogram

// Counts returns the counts for the given bucket, subBucket indices.
// Returns true if the bucket was valid, otherwise returns the counts
// for the overflow bucket if bucket > 0 or the underflow bucket if
// bucket < 0, and false.
func (th *TimeHistogram) Count(bucket, subBucket int) (uint64, bool) {
	t := (*timeHistogram)(th)
	if bucket < 0 {
		return t.underflow.Load(), false
	}
	i := bucket*TimeHistNumSubBuckets + subBucket
	if i >= len(t.counts) {
		return t.overflow.Load(), false
	}
	return t.counts[i].Load(), true
}

func (th *TimeHistogram) Record(duration int64) {
	(*timeHistogram)(th).record(duration)
}

var TimeHistogramMetricsBuckets = timeHistogramMetricsBuckets

func SetIntArgRegs(a int) int {
	lock(&finlock)
	old := intArgRegs
	if a >= 0 {
		intArgRegs = a
	}
	unlock(&finlock)
	return old
}

func FinalizerGAsleep() bool {
	return fingStatus.Load()&fingWait != 0
}

// For GCTestMoveStackOnNextCall, it's important not to introduce an
// extra layer of call, since then there's a return before the "real"
// next call.
var GCTestMoveStackOnNextCall = gcTestMoveStackOnNextCall

// For GCTestIsReachable, it's important that we do this as a call so
// escape analysis can see through it.
func GCTestIsReachable(ptrs ...unsafe.Pointer) (mask uint64) {
	return gcTestIsReachable(ptrs...)
}

// For GCTestPointerClass, it's important that we do this as a call so
// escape analysis can see through it.
//
// This is nosplit because gcTestPointerClass is.
//
//go:nosplit
func GCTestPointerClass(p unsafe.Pointer) string {
	return gcTestPointerClass(p)
}

const Raceenabled = raceenabled

const (
	GCBackgroundUtilization            = gcBackgroundUtilization
	GCGoalUtilization                  = gcGoalUtilization
	DefaultHeapMinimum                 = defaultHeapMinimum
	MemoryLimitHeapGoalHeadroomPercent = memoryLimitHeapGoalHeadroomPercent
	MemoryLimitMinHeapGoalHeadroom     = memoryLimitMinHeapGoalHeadroom
)

type GCController struct {
	gcControllerState
}

func NewGCController(gcPercent int, memoryLimit int64) *GCController {
	// Force the controller to escape. We're going to
	// do 64-bit atomics on it, and if it gets stack-allocated
	// on a 32-bit architecture, it may get allocated unaligned
	// space.
	g := Escape(new(GCController))
	g.gcControllerState.test = true // Mark it as a test copy.
	g.init(int32(gcPercent), memoryLimit)
	return g
}

func (c *GCController) StartCycle(stackSize, globalsSize uint64, scannableFrac float64, gomaxprocs int) {
	trigger, _ := c.trigger()
	if c.heapMarked > trigger {
		trigger = c.heapMarked
	}
	c.maxStackScan.Store(stackSize)
	c.globalsScan.Store(globalsSize)
	c.heapLive.Store(trigger)
	c.heapScan.Add(int64(float64(trigger-c.heapMarked) * scannableFrac))
	c.startCycle(0, gomaxprocs, gcTrigger{kind: gcTriggerHeap})
}

func (c *GCController) AssistWorkPerByte() float64 {
	return c.assistWorkPerByte.Load()
}

func (c *GCController) HeapGoal() uint64 {
	return c.heapGoal()
}

func (c *GCController) HeapLive() uint64 {
	return c.heapLive.Load()
}

func (c *GCController) HeapMarked() uint64 {
	return c.heapMarked
}

func (c *GCController) Triggered() uint64 {
	return c.triggered
}

type GCControllerReviseDelta struct {
	HeapLive        int64
	HeapScan        int64
	HeapScanWork    int64
	StackScanWork   int64
	GlobalsScanWork int64
}

func (c *GCController) Revise(d GCControllerReviseDelta) {
	c.heapLive.Add(d.HeapLive)
	c.heapScan.Add(d.HeapScan)
	c.heapScanWork.Add(d.HeapScanWork)
	c.stackScanWork.Add(d.StackScanWork)
	c.globalsScanWork.Add(d.GlobalsScanWork)
	c.revise()
}

func (c *GCController) EndCycle(bytesMarked uint64, assistTime, elapsed int64, gomaxprocs int) {
	c.assistTime.Store(assistTime)
	c.endCycle(elapsed, gomaxprocs, false)
	c.resetLive(bytesMarked)
	c.commit(false)
}

func (c *GCController) AddIdleMarkWorker() bool {
	return c.addIdleMarkWorker()
}

func (c *GCController) NeedIdleMarkWorker() bool {
	return c.needIdleMarkWorker()
}

func (c *GCController) RemoveIdleMarkWorker() {
	c.removeIdleMarkWorker()
}

func (c *GCController) SetMaxIdleMarkWorkers(max int32) {
	c.setMaxIdleMarkWorkers(max)
}

var alwaysFalse bool
var escapeSink any

func Escape[T any](x T) T {
	if alwaysFalse {
		escapeSink = x
	}
	return x
}

// Acquirem blocks preemption.
func Acquirem() {
	acquirem()
}

func Releasem() {
	releasem(getg().m)
}

var Timediv = timediv

type PIController struct {
	piController
}

func NewPIController(kp, ti, tt, min, max float64) *PIController {
	return &PIController{piController{
		kp:  kp,
		ti:  ti,
		tt:  tt,
		min: min,
		max: max,
	}}
}

func (c *PIController) Next(input, setpoint, period float64) (float64, bool) {
	return c.piController.next(input, setpoint, period)
}

const (
	CapacityPerProc          = capacityPerProc
	GCCPULimiterUpdatePeriod = gcCPULimiterUpdatePeriod
)

type GCCPULimiter struct {
	limiter gcCPULimiterState
}

func NewGCCPULimiter(now int64, gomaxprocs int32) *GCCPULimiter {
	// Force the controller to escape. We're going to
	// do 64-bit atomics on it, and if it gets stack-allocated
	// on a 32-bit architecture, it may get allocated unaligned
	// space.
	l := Escape(new(GCCPULimiter))
	l.limiter.test = true
	l.limiter.resetCapacity(now, gomaxprocs)
	return l
}

func (l *GCCPULimiter) Fill() uint64 {
	return l.limiter.bucket.fill
}

func (l *GCCPULimiter) Capacity() uint64 {
	return l.limiter.bucket.capacity
}

func (l *GCCPULimiter) Overflow() uint64 {
	return l.limiter.overflow
}

func (l *GCCPULimiter) Limiting() bool {
	return l.limiter.limiting()
}

func (l *GCCPULimiter) NeedUpdate(now int64) bool {
	return l.limiter.needUpdate(now)
}

func (l *GCCPULimiter) StartGCTransition(enableGC bool, now int64) {
	l.limiter.startGCTransition(enableGC, now)
}

func (l *GCCPULimiter) FinishGCTransition(now int64) {
	l.limiter.finishGCTransition(now)
}

func (l *GCCPULimiter) Update(now int64) {
	l.limiter.update(now)
}

func (l *GCCPULimiter) AddAssistTime(t int64) {
	l.limiter.addAssistTime(t)
}

func (l *GCCPULimiter) ResetCapacity(now int64, nprocs int32) {
	l.limiter.resetCapacity(now, nprocs)
}

const ScavengePercent = scavengePercent

type Scavenger struct {
	Sleep      func(int64) int64
	Scavenge   func(uintptr) (uintptr, int64)
	ShouldStop func() bool
	GoMaxProcs func() int32

released  atomic.Uintptr
	scavenger scavengerState
	stop      chan<- struct{}
	done      <-chan struct{}
}

func (s *Scavenger) Start() {
	if s.Sleep == nil || s.Scavenge == nil || s.ShouldStop == nil || s.GoMaxProcs == nil {
		panic("must populate all stubs")
	}

// Install hooks.
	s.scavenger.sleepStub = s.Sleep
	s.scavenger.scavenge = s.Scavenge
	s.scavenger.shouldStop = s.ShouldStop
	s.scavenger.gomaxprocs = s.GoMaxProcs

// Start up scavenger goroutine, and wait for it to be ready.
	stop := make(chan struct{})
	s.stop = stop
	done := make(chan struct{})
	s.done = done
	go func() {
		// This should match bgscavenge, loosely.
		s.scavenger.init()
		s.scavenger.park()
		for {
			select {
			case <-stop:
				close(done)
				return
			default:
			}
			released, workTime := s.scavenger.run()
			if released == 0 {
				s.scavenger.park()
				continue
			}
			s.released.Add(released)
			s.scavenger.sleep(workTime)
		}
	}()
	if !s.BlockUntilParked(1e9 /* 1 second */) {
		panic("timed out waiting for scavenger to get ready")
	}
}

// BlockUntilParked blocks until the scavenger parks, or until
// timeout is exceeded. Returns true if the scavenger parked.
//
// Note that in testing, parked means something slightly different.
// In anger, the scavenger parks to sleep, too, but in testing,
// it only parks when it actually has no work to do.
func (s *Scavenger) BlockUntilParked(timeout int64) bool {
	// Just spin, waiting for it to park.
	//
	// The actual parking process is racy with respect to
	// wakeups, which is fine, but for testing we need something
	// a bit more robust.
	start := nanotime()
	for nanotime()-start < timeout {
		lock(&s.scavenger.lock)
		parked := s.scavenger.parked
		unlock(&s.scavenger.lock)
		if parked {
			return true
		}
		Gosched()
	}
	return false
}

// Released returns how many bytes the scavenger released.
func (s *Scavenger) Released() uintptr {
	return s.released.Load()
}

// Wake wakes up a parked scavenger to keep running.
func (s *Scavenger) Wake() {
	s.scavenger.wake()
}

// Stop cleans up the scavenger's resources. The scavenger
// must be parked for this to work.
func (s *Scavenger) Stop() {
	lock(&s.scavenger.lock)
	parked := s.scavenger.parked
	unlock(&s.scavenger.lock)
	if !parked {
		panic("tried to clean up scavenger that is not parked")
	}
	close(s.stop)
	s.Wake()
	<-s.done
}

type ScavengeIndex struct {
	i scavengeIndex
}

func NewScavengeIndex(min, max ChunkIdx) *ScavengeIndex {
	s := new(ScavengeIndex)
	// This is a bit lazy but we easily guarantee we'll be able
	// to reference all the relevant chunks. The worst-case
	// memory usage here is 512 MiB, but tests generally use
	// small offsets from BaseChunkIdx, which results in ~100s
	// of KiB in memory use.
	//
	// This may still be worth making better, at least by sharing
	// this fairly large array across calls with a sync.Pool or
	// something. Currently, when the tests are run serially,
	// it takes around 0.5s. Not all that much, but if we have
	// a lot of tests like this it could add up.
	s.i.chunks = make([]atomicScavChunkData, max)
	s.i.min.Store(uintptr(min))
	s.i.max.Store(uintptr(max))
	s.i.minHeapIdx.Store(uintptr(min))
	s.i.test = true
	return s
}

func (s *ScavengeIndex) Find(force bool) (ChunkIdx, uint) {
	ci, off := s.i.find(force)
	return ChunkIdx(ci), off
}

func (s *ScavengeIndex) AllocRange(base, limit uintptr) {
	sc, ec := chunkIndex(base), chunkIndex(limit-1)
	si, ei := chunkPageIndex(base), chunkPageIndex(limit-1)

if sc == ec {
		// The range doesn't cross any chunk boundaries.
		s.i.alloc(sc, ei+1-si)
	} else {
		// The range crosses at least one chunk boundary.
		s.i.alloc(sc, pallocChunkPages-si)
		for c := sc + 1; c < ec; c++ {
			s.i.alloc(c, pallocChunkPages)
		}
		s.i.alloc(ec, ei+1)
	}
}

func (s *ScavengeIndex) FreeRange(base, limit uintptr) {
	sc, ec := chunkIndex(base), chunkIndex(limit-1)
	si, ei := chunkPageIndex(base), chunkPageIndex(limit-1)

if sc == ec {
		// The range doesn't cross any chunk boundaries.
		s.i.free(sc, si, ei+1-si)
	} else {
		// The range crosses at least one chunk boundary.
		s.i.free(sc, si, pallocChunkPages-si)
		for c := sc + 1; c < ec; c++ {
			s.i.free(c, 0, pallocChunkPages)
		}
		s.i.free(ec, 0, ei+1)
	}
}

func (s *ScavengeIndex) ResetSearchAddrs() {
	for _, a := range []*atomicOffAddr{&s.i.searchAddrBg, &s.i.searchAddrForce} {
		addr, marked := a.Load()
		if marked {
			a.StoreUnmark(addr, addr)
		}
		a.Clear()
	}
	s.i.freeHWM = minOffAddr
}

func (s *ScavengeIndex) NextGen() {
	s.i.nextGen()
}

func (s *ScavengeIndex) SetEmpty(ci ChunkIdx) {
	s.i.setEmpty(chunkIdx(ci))
}

func CheckPackScavChunkData(gen uint32, inUse, lastInUse uint16, flags uint8) bool {
	sc0 := scavChunkData{
		gen:            gen,
		inUse:          inUse,
		lastInUse:      lastInUse,
		scavChunkFlags: scavChunkFlags(flags),
	}
	scp := sc0.pack()
	sc1 := unpackScavChunkData(scp)
	return sc0 == sc1
}

const GTrackingPeriod = gTrackingPeriod

var ZeroBase = unsafe.Pointer(&zerobase)

const UserArenaChunkBytes = userArenaChunkBytes

type UserArena struct {
	arena *userArena
}

func NewUserArena() *UserArena {
	return &UserArena{newUserArena()}
}

func (a *UserArena) New(out *any) {
	i := efaceOf(out)
	typ := i._type
	if typ.Kind_&kindMask != kindPtr {
		panic("new result of non-ptr type")
	}
	typ = (*ptrtype)(unsafe.Pointer(typ)).Elem
	i.data = a.arena.new(typ)
}

func (a *UserArena) Slice(sl any, cap int) {
	a.arena.slice(sl, cap)
}

func (a *UserArena) Free() {
	a.arena.free()
}

func GlobalWaitingArenaChunks() int {
	n := 0
	systemstack(func() {
		lock(&mheap_.lock)
		for s := mheap_.userArena.quarantineList.first; s != nil; s = s.next {
			n++
		}
		unlock(&mheap_.lock)
	})
	return n
}

func UserArenaClone[T any](s T) T {
	return arena_heapify(s).(T)
}

var AlignUp = alignUp

func BlockUntilEmptyFinalizerQueue(timeout int64) bool {
	return blockUntilEmptyFinalizerQueue(timeout)
}

func FrameStartLine(f *Frame) int {
	return f.startLine
}

// PersistentAlloc allocates some memory that lives outside the Go heap.
// This memory will never be freed; use sparingly.
func PersistentAlloc(n uintptr) unsafe.Pointer {
	return persistentalloc(n, 0, &memstats.other_sys)
}

// FPCallers works like Callers and uses frame pointer unwinding to populate
// pcBuf with the return addresses of the physical frames on the stack.
func FPCallers(pcBuf []uintptr) int {
	return fpTracebackPCs(unsafe.Pointer(getfp()), pcBuf)
}

const FramePointerEnabled = framepointer_enabled

var (
	IsPinned      = isPinned
	GetPinCounter = pinnerGetPinCounter
)

func SetPinnerLeakPanic(f func()) {
	pinnerLeakPanic = f
}
func GetPinnerLeakPanic() func() {
	return pinnerLeakPanic
}

var testUintptr uintptr

func MyGenericFunc[T any]() {
	systemstack(func() {
		testUintptr = 4
	})
}

func UnsafePoint(pc uintptr) bool {
	fi := findfunc(pc)
	v := pcdatavalue(fi, abi.PCDATA_UnsafePoint, pc)
	switch v {
	case abi.UnsafePointUnsafe:
		return true
	case abi.UnsafePointSafe:
		return false
	case abi.UnsafePointRestart1, abi.UnsafePointRestart2, abi.UnsafePointRestartAtEntry:
		// These are all interruptible, they just encode a nonstandard
		// way of recovering when interrupted.
		return false
	default:
		var buf [20]byte
		panic("invalid unsafe point code " + string(itoa(buf[:], uint64(v))))
	}
}

Batal

⬅ src 738 item

Nama	Tipe	Ukuran	Diubah	Aksi
📁asan	dir	—	2024-02-02 18:09	📂 Buka
📁cgo	dir	—	2024-02-02 18:09	📂 Buka
📁coverage	dir	—	2024-02-02 18:09	📂 Buka
📁debug	dir	—	2024-02-02 18:09	📂 Buka
📁internal	dir	—	2024-02-02 18:09	📂 Buka
📁metrics	dir	—	2024-02-02 18:09	📂 Buka
📁msan	dir	—	2024-02-02 18:09	📂 Buka
📁pprof	dir	—	2024-02-02 18:09	📂 Buka
📁race	dir	—	2024-02-02 18:09	📂 Buka
📁testdata	dir	—	2024-02-02 18:09	📂 Buka
📁trace	dir	—	2024-02-02 18:09	📂 Buka
📝HACKING.md	md	13.9 KB	2024-02-02 18:09	✏️ 👁️
📄Makefile	file	178 B	2024-02-02 18:09	✏️ 👁️
🔵abi_test.go	go	2.8 KB	2024-02-02 18:09	✏️ 👁️
🔵alg.go	go	11 KB	2024-02-02 18:09	✏️ 👁️
🔵align_runtime_test.go	go	1.8 KB	2024-02-02 18:09	✏️ 👁️
🔵align_test.go	go	5.4 KB	2024-02-02 18:09	✏️ 👁️
🔵arena.go	go	31.7 KB	2024-02-02 18:09	✏️ 👁️
🔵arena_test.go	go	13.4 KB	2024-02-02 18:09	✏️ 👁️
🔵asan.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵asan0.go	go	760 B	2024-02-02 18:09	✏️ 👁️
📄asan_amd64.s	s	2.4 KB	2024-02-02 18:09	✏️ 👁️
📄asan_arm64.s	s	2.1 KB	2024-02-02 18:09	✏️ 👁️
📄asan_loong64.s	s	2.1 KB	2024-02-02 18:09	✏️ 👁️
📄asan_ppc64le.s	s	2.8 KB	2024-02-02 18:09	✏️ 👁️
📄asan_riscv64.s	s	1.9 KB	2024-02-02 18:09	✏️ 👁️
📄asm.s	s	719 B	2024-02-02 18:09	✏️ 👁️
📄asm_386.s	s	42.5 KB	2024-02-02 18:09	✏️ 👁️
📄asm_amd64.h	h	631 B	2024-02-02 18:09	✏️ 👁️
📄asm_amd64.s	s	60.1 KB	2024-02-02 18:09	✏️ 👁️
📄asm_arm.s	s	31.6 KB	2024-02-02 18:09	✏️ 👁️
📄asm_arm64.s	s	43.3 KB	2024-02-02 18:09	✏️ 👁️
📄asm_loong64.s	s	27.6 KB	2024-02-02 18:09	✏️ 👁️
📄asm_mips64x.s	s	24.3 KB	2024-02-02 18:09	✏️ 👁️
📄asm_mipsx.s	s	25.8 KB	2024-02-02 18:09	✏️ 👁️
📄asm_ppc64x.h	h	1.9 KB	2024-02-02 18:09	✏️ 👁️
📄asm_ppc64x.s	s	45.2 KB	2024-02-02 18:09	✏️ 👁️
📄asm_riscv64.s	s	27 KB	2024-02-02 18:09	✏️ 👁️
📄asm_s390x.s	s	27.5 KB	2024-02-02 18:09	✏️ 👁️
📄asm_wasm.s	s	11.8 KB	2024-02-02 18:09	✏️ 👁️
📄atomic_arm64.s	s	259 B	2024-02-02 18:09	✏️ 👁️
📄atomic_loong64.s	s	245 B	2024-02-02 18:09	✏️ 👁️
📄atomic_mips64x.s	s	300 B	2024-02-02 18:09	✏️ 👁️
📄atomic_mipsx.s	s	262 B	2024-02-02 18:09	✏️ 👁️
🔵atomic_pointer.go	go	3.7 KB	2024-02-02 18:09	✏️ 👁️
📄atomic_ppc64x.s	s	437 B	2024-02-02 18:09	✏️ 👁️
📄atomic_riscv64.s	s	275 B	2024-02-02 18:09	✏️ 👁️
🔵auxv_none.go	go	298 B	2024-02-02 18:09	✏️ 👁️
🔵callers_test.go	go	12.1 KB	2024-02-02 18:09	✏️ 👁️
🔵cgo.go	go	2.5 KB	2024-02-02 18:09	✏️ 👁️
🔵cgo_mmap.go	go	2.4 KB	2024-02-02 18:09	✏️ 👁️
🔵cgo_ppc64x.go	go	418 B	2024-02-02 18:09	✏️ 👁️
🔵cgo_sigaction.go	go	3.3 KB	2024-02-02 18:09	✏️ 👁️
🔵cgocall.go	go	23.2 KB	2024-02-02 18:09	✏️ 👁️
🔵cgocallback.go	go	317 B	2024-02-02 18:09	✏️ 👁️
🔵cgocheck.go	go	8 KB	2024-02-02 18:09	✏️ 👁️
🔵chan.go	go	23.7 KB	2024-02-02 18:09	✏️ 👁️
🔵chan_test.go	go	23.4 KB	2024-02-02 18:09	✏️ 👁️
🔵chanbarrier_test.go	go	1.4 KB	2024-02-02 18:09	✏️ 👁️
🔵checkptr.go	go	3.3 KB	2024-02-02 18:09	✏️ 👁️
🔵checkptr_test.go	go	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵closure_test.go	go	937 B	2024-02-02 18:09	✏️ 👁️
🔵compiler.go	go	410 B	2024-02-02 18:09	✏️ 👁️
🔵complex.go	go	1.6 KB	2024-02-02 18:09	✏️ 👁️
🔵complex_test.go	go	1.1 KB	2024-02-02 18:09	✏️ 👁️
🔵conv_wasm_test.go	go	3 KB	2024-02-02 18:09	✏️ 👁️
🔵coro.go	go	4.9 KB	2024-02-02 18:09	✏️ 👁️
🔵covercounter.go	go	749 B	2024-02-02 18:09	✏️ 👁️
🔵covermeta.go	go	2.4 KB	2024-02-02 18:09	✏️ 👁️
🔵cpuflags.go	go	810 B	2024-02-02 18:09	✏️ 👁️
🔵cpuflags_amd64.go	go	533 B	2024-02-02 18:09	✏️ 👁️
🔵cpuflags_arm64.go	go	312 B	2024-02-02 18:09	✏️ 👁️
🔵cpuprof.go	go	7.9 KB	2024-02-02 18:09	✏️ 👁️
🔵cputicks.go	go	437 B	2024-02-02 18:09	✏️ 👁️
🔵crash_cgo_test.go	go	23.4 KB	2024-02-02 18:09	✏️ 👁️
🔵crash_test.go	go	23.1 KB	2024-02-02 18:09	✏️ 👁️
🔵crash_unix_test.go	go	9.2 KB	2024-02-02 18:09	✏️ 👁️
🔵create_file_nounix.go	go	305 B	2024-02-02 18:09	✏️ 👁️
🔵create_file_unix.go	go	368 B	2024-02-02 18:09	✏️ 👁️
🔵debug.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵debug_test.go	go	8 KB	2024-02-02 18:09	✏️ 👁️
🔵debugcall.go	go	6.7 KB	2024-02-02 18:09	✏️ 👁️
🔵debuglog.go	go	18.2 KB	2024-02-02 18:09	✏️ 👁️
🔵debuglog_off.go	go	357 B	2024-02-02 18:09	✏️ 👁️
🔵debuglog_on.go	go	1.1 KB	2024-02-02 18:09	✏️ 👁️
🔵debuglog_test.go	go	4.9 KB	2024-02-02 18:09	✏️ 👁️
🔵defer_test.go	go	11.4 KB	2024-02-02 18:09	✏️ 👁️
🔵defs1_linux.go	go	845 B	2024-02-02 18:09	✏️ 👁️
🔵defs1_netbsd_386.go	go	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵defs1_netbsd_amd64.go	go	3.1 KB	2024-02-02 18:09	✏️ 👁️
🔵defs1_netbsd_arm.go	go	3 KB	2024-02-02 18:09	✏️ 👁️
🔵defs1_netbsd_arm64.go	go	3.3 KB	2024-02-02 18:09	✏️ 👁️
🔵defs1_solaris_amd64.go	go	4 KB	2024-02-02 18:09	✏️ 👁️
🔵defs2_linux.go	go	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵defs3_linux.go	go	1.1 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_aix.go	go	4.2 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_aix_ppc64.go	go	3.6 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_arm_linux.go	go	2.7 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_darwin.go	go	4.2 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_darwin_amd64.go	go	6.3 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_darwin_arm64.go	go	4.2 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_dragonfly.go	go	2.7 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_dragonfly_amd64.go	go	3.4 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_freebsd.go	go	4 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_freebsd_386.go	go	4.5 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_freebsd_amd64.go	go	4.8 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_freebsd_arm.go	go	3.9 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_freebsd_arm64.go	go	4.2 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_freebsd_riscv64.go	go	4.2 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_illumos_amd64.go	go	285 B	2024-02-02 18:09	✏️ 👁️
🔵defs_linux.go	go	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_386.go	go	4.2 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_amd64.go	go	4.7 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_arm.go	go	3.9 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_arm64.go	go	3.6 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_loong64.go	go	3.4 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_mips64x.go	go	3.6 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_mipsx.go	go	3.6 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_ppc64.go	go	3.7 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_ppc64le.go	go	3.7 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_riscv64.go	go	3.8 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_linux_s390x.go	go	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_netbsd.go	go	2.8 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_netbsd_386.go	go	855 B	2024-02-02 18:09	✏️ 👁️
🔵defs_netbsd_amd64.go	go	1 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_netbsd_arm.go	go	764 B	2024-02-02 18:09	✏️ 👁️
🔵defs_openbsd.go	go	3.1 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_openbsd_386.go	go	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_openbsd_amd64.go	go	3.1 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_openbsd_arm.go	go	3 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_openbsd_arm64.go	go	2.8 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_openbsd_mips64.go	go	2.8 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_openbsd_ppc64.go	go	3 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_openbsd_riscv64.go	go	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_plan9_386.go	go	1.6 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_plan9_amd64.go	go	1.8 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_plan9_arm.go	go	1.7 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_solaris.go	go	3.3 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_solaris_amd64.go	go	1004 B	2024-02-02 18:09	✏️ 👁️
🔵defs_windows.go	go	2.3 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_windows_386.go	go	2.3 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_windows_amd64.go	go	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_windows_arm.go	go	2.6 KB	2024-02-02 18:09	✏️ 👁️
🔵defs_windows_arm64.go	go	3.1 KB	2024-02-02 18:09	✏️ 👁️
📄duff_386.s	s	8.2 KB	2024-02-02 18:09	✏️ 👁️
📄duff_amd64.s	s	5.6 KB	2024-02-02 18:09	✏️ 👁️
📄duff_arm.s	s	7.1 KB	2024-02-02 18:09	✏️ 👁️
📄duff_arm64.s	s	5.3 KB	2024-02-02 18:09	✏️ 👁️
📄duff_loong64.s	s	11.9 KB	2024-02-02 18:09	✏️ 👁️
📄duff_mips64x.s	s	11.3 KB	2024-02-02 18:09	✏️ 👁️
📄duff_ppc64x.s	s	7.1 KB	2024-02-02 18:09	✏️ 👁️
📄duff_riscv64.s	s	11.4 KB	2024-02-02 18:09	✏️ 👁️
📄duff_s390x.s	s	507 B	2024-02-02 18:09	✏️ 👁️
🔵ehooks_test.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵env_plan9.go	go	3 KB	2024-02-02 18:09	✏️ 👁️
🔵env_posix.go	go	1.6 KB	2024-02-02 18:09	✏️ 👁️
🔵env_test.go	go	1.2 KB	2024-02-02 18:09	✏️ 👁️
🔵error.go	go	9.3 KB	2024-02-02 18:09	✏️ 👁️
🔵example_test.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵exithook.go	go	2.3 KB	2024-02-02 18:09	✏️ 👁️
🔵export_aix_test.go	go	207 B	2024-02-02 18:09	✏️ 👁️
🔵export_arm_test.go	go	226 B	2024-02-02 18:09	✏️ 👁️
🔵export_darwin_test.go	go	207 B	2024-02-02 18:09	✏️ 👁️
🔵export_debug_amd64_test.go	go	3.6 KB	2024-02-02 18:09	✏️ 👁️
🔵export_debug_arm64_test.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵export_debug_ppc64le_test.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵export_debug_test.go	go	5.1 KB	2024-02-02 18:09	✏️ 👁️
🔵export_debuglog_test.go	go	1.3 KB	2024-02-02 18:09	✏️ 👁️
🔵export_linux_test.go	go	378 B	2024-02-02 18:09	✏️ 👁️
🔵export_mmap_test.go	go	429 B	2024-02-02 18:09	✏️ 👁️
🔵export_pipe2_test.go	go	310 B	2024-02-02 18:09	✏️ 👁️
🔵export_pipe_test.go	go	219 B	2024-02-02 18:09	✏️ 👁️
🔵export_test.go	go	50.5 KB	2024-02-02 18:09	✏️ 👁️
🔵export_unix_test.go	go	2.3 KB	2024-02-02 18:09	✏️ 👁️
🔵export_windows_test.go	go	903 B	2024-02-02 18:09	✏️ 👁️
🔵extern.go	go	18.6 KB	2024-02-02 18:09	✏️ 👁️
🔵fastlog2.go	go	1.2 KB	2024-02-02 18:09	✏️ 👁️
🔵fastlog2_test.go	go	784 B	2024-02-02 18:09	✏️ 👁️
🔵fastlog2table.go	go	904 B	2024-02-02 18:09	✏️ 👁️
🔵fds_nonunix.go	go	256 B	2024-02-02 18:09	✏️ 👁️
🔵fds_test.go	go	1.4 KB	2024-02-02 18:09	✏️ 👁️
🔵fds_unix.go	go	1.3 KB	2024-02-02 18:09	✏️ 👁️
🔵float.go	go	1.4 KB	2024-02-02 18:09	✏️ 👁️
🔵float_test.go	go	699 B	2024-02-02 18:09	✏️ 👁️
📄funcdata.h	h	2.5 KB	2024-02-02 18:09	✏️ 👁️
🔵gc_test.go	go	20.3 KB	2024-02-02 18:09	✏️ 👁️
🔵gcinfo_test.go	go	6 KB	2024-02-02 18:09	✏️ 👁️
📄go_tls.h	h	366 B	2024-02-02 18:09	✏️ 👁️
🔵hash32.go	go	1.6 KB	2024-02-02 18:09	✏️ 👁️
🔵hash64.go	go	1.9 KB	2024-02-02 18:09	✏️ 👁️
🔵hash_test.go	go	17.2 KB	2024-02-02 18:09	✏️ 👁️
🔵heap_test.go	go	529 B	2024-02-02 18:09	✏️ 👁️
🔵heapdump.go	go	17.9 KB	2024-02-02 18:09	✏️ 👁️
🔵histogram.go	go	7.3 KB	2024-02-02 18:09	✏️ 👁️
🔵histogram_test.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵iface.go	go	20.9 KB	2024-02-02 18:09	✏️ 👁️
🔵iface_test.go	go	7.5 KB	2024-02-02 18:09	✏️ 👁️
🔵import_test.go	go	1.4 KB	2024-02-02 18:09	✏️ 👁️
🔵importx_test.go	go	763 B	2024-02-02 18:09	✏️ 👁️
🔵lfstack.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵lfstack_test.go	go	2.7 KB	2024-02-02 18:09	✏️ 👁️
🔵libfuzzer.go	go	6.3 KB	2024-02-02 18:09	✏️ 👁️
📄libfuzzer_amd64.s	s	5 KB	2024-02-02 18:09	✏️ 👁️
📄libfuzzer_arm64.s	s	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵lock_futex.go	go	5.4 KB	2024-02-02 18:09	✏️ 👁️
🔵lock_js.go	go	7.3 KB	2024-02-02 18:09	✏️ 👁️
🔵lock_sema.go	go	6.8 KB	2024-02-02 18:09	✏️ 👁️
🔵lock_wasip1.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵lockrank.go	go	18.2 KB	2024-02-02 18:09	✏️ 👁️
🔵lockrank_off.go	go	1.2 KB	2024-02-02 18:09	✏️ 👁️
🔵lockrank_on.go	go	10.3 KB	2024-02-02 18:09	✏️ 👁️
🔵lockrank_test.go	go	856 B	2024-02-02 18:09	✏️ 👁️
🔵malloc.go	go	58.5 KB	2024-02-02 18:09	✏️ 👁️
🔵malloc_test.go	go	10.6 KB	2024-02-02 18:09	✏️ 👁️
🔵map.go	go	52.2 KB	2024-02-02 18:09	✏️ 👁️
🔵map_benchmark_test.go	go	10.6 KB	2024-02-02 18:09	✏️ 👁️
🔵map_fast32.go	go	12.7 KB	2024-02-02 18:09	✏️ 👁️
🔵map_fast64.go	go	12.9 KB	2024-02-02 18:09	✏️ 👁️
🔵map_faststr.go	go	14.3 KB	2024-02-02 18:09	✏️ 👁️
🔵map_test.go	go	31.7 KB	2024-02-02 18:09	✏️ 👁️
🔵mbarrier.go	go	13.8 KB	2024-02-02 18:09	✏️ 👁️
🔵mbitmap.go	go	22.5 KB	2024-02-02 18:09	✏️ 👁️
🔵mbitmap_allocheaders.go	go	44.7 KB	2024-02-02 18:09	✏️ 👁️
🔵mbitmap_noallocheaders.go	go	29 KB	2024-02-02 18:09	✏️ 👁️
🔵mcache.go	go	10 KB	2024-02-02 18:09	✏️ 👁️
🔵mcentral.go	go	8.1 KB	2024-02-02 18:09	✏️ 👁️
🔵mcheckmark.go	go	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵mem.go	go	6.7 KB	2024-02-02 18:09	✏️ 👁️
🔵mem_aix.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵mem_bsd.go	go	2.2 KB	2024-02-02 18:09	✏️ 👁️
🔵mem_darwin.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵mem_js.go	go	457 B	2024-02-02 18:09	✏️ 👁️
🔵mem_linux.go	go	5 KB	2024-02-02 18:09	✏️ 👁️
🔵mem_plan9.go	go	447 B	2024-02-02 18:09	✏️ 👁️
🔵mem_sbrk.go	go	4.2 KB	2024-02-02 18:09	✏️ 👁️
🔵mem_wasip1.go	go	392 B	2024-02-02 18:09	✏️ 👁️
🔵mem_wasm.go	go	488 B	2024-02-02 18:09	✏️ 👁️
🔵mem_windows.go	go	3.9 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_386.s	s	2.4 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_amd64.s	s	4.9 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_arm.s	s	2.6 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_arm64.s	s	3.6 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_loong64.s	s	843 B	2024-02-02 18:09	✏️ 👁️
📄memclr_mips64x.s	s	1.7 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_mipsx.s	s	1.3 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_plan9_386.s	s	983 B	2024-02-02 18:09	✏️ 👁️
📄memclr_plan9_amd64.s	s	511 B	2024-02-02 18:09	✏️ 👁️
📄memclr_ppc64x.s	s	4.4 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_riscv64.s	s	1.7 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_s390x.s	s	2 KB	2024-02-02 18:09	✏️ 👁️
📄memclr_wasm.s	s	485 B	2024-02-02 18:09	✏️ 👁️
📄memmove_386.s	s	4.4 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_amd64.s	s	12.5 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_arm.s	s	5.9 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_arm64.s	s	6 KB	2024-02-02 18:09	✏️ 👁️
🔵memmove_linux_amd64_test.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_loong64.s	s	1.9 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_mips64x.s	s	1.8 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_mipsx.s	s	4.4 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_plan9_386.s	s	3.1 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_plan9_amd64.s	s	3 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_ppc64x.s	s	4.9 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_riscv64.s	s	5.5 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_s390x.s	s	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵memmove_test.go	go	21.2 KB	2024-02-02 18:09	✏️ 👁️
📄memmove_wasm.s	s	479 B	2024-02-02 18:09	✏️ 👁️
🔵metrics.go	go	26 KB	2024-02-02 18:09	✏️ 👁️
🔵metrics_test.go	go	42.5 KB	2024-02-02 18:09	✏️ 👁️
🔵mfinal.go	go	18.9 KB	2024-02-02 18:09	✏️ 👁️
🔵mfinal_test.go	go	5.6 KB	2024-02-02 18:09	✏️ 👁️
🔵mfixalloc.go	go	3.1 KB	2024-02-02 18:09	✏️ 👁️
🔵mgc.go	go	59.3 KB	2024-02-02 18:09	✏️ 👁️
🔵mgclimit.go	go	17.3 KB	2024-02-02 18:09	✏️ 👁️
🔵mgclimit_test.go	go	9 KB	2024-02-02 18:09	✏️ 👁️
🔵mgcmark.go	go	53.1 KB	2024-02-02 18:09	✏️ 👁️
🔵mgcpacer.go	go	55.4 KB	2024-02-02 18:09	✏️ 👁️
🔵mgcpacer_test.go	go	39.3 KB	2024-02-02 18:09	✏️ 👁️
🔵mgcscavenge.go	go	52.3 KB	2024-02-02 18:09	✏️ 👁️
🔵mgcscavenge_test.go	go	25.2 KB	2024-02-02 18:09	✏️ 👁️
🔵mgcstack.go	go	10.6 KB	2024-02-02 18:09	✏️ 👁️
🔵mgcsweep.go	go	32.3 KB	2024-02-02 18:09	✏️ 👁️
🔵mgcwork.go	go	12.9 KB	2024-02-02 18:09	✏️ 👁️
🔵mheap.go	go	72.6 KB	2024-02-02 18:09	✏️ 👁️
🔵minmax.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵minmax_test.go	go	3.3 KB	2024-02-02 18:09	✏️ 👁️
🔵mkduff.go	go	8 KB	2024-02-02 18:09	✏️ 👁️
🔵mkfastlog2table.go	go	3.1 KB	2024-02-02 18:09	✏️ 👁️
🔵mklockrank.go	go	9 KB	2024-02-02 18:09	✏️ 👁️
🔵mkpreempt.go	go	15.3 KB	2024-02-02 18:09	✏️ 👁️
🔵mksizeclasses.go	go	9.5 KB	2024-02-02 18:09	✏️ 👁️
🔵mmap.go	go	844 B	2024-02-02 18:09	✏️ 👁️
🔵mpagealloc.go	go	39.2 KB	2024-02-02 18:09	✏️ 👁️
🔵mpagealloc_32bit.go	go	4.6 KB	2024-02-02 18:09	✏️ 👁️
🔵mpagealloc_64bit.go	go	9.3 KB	2024-02-02 18:09	✏️ 👁️
🔵mpagealloc_test.go	go	32.6 KB	2024-02-02 18:09	✏️ 👁️
🔵mpagecache.go	go	5.6 KB	2024-02-02 18:09	✏️ 👁️
🔵mpagecache_test.go	go	10.8 KB	2024-02-02 18:09	✏️ 👁️
🔵mpallocbits.go	go	12.6 KB	2024-02-02 18:09	✏️ 👁️
🔵mpallocbits_test.go	go	13.7 KB	2024-02-02 18:09	✏️ 👁️
🔵mprof.go	go	47.4 KB	2024-02-02 18:09	✏️ 👁️
🔵mranges.go	go	14.5 KB	2024-02-02 18:09	✏️ 👁️
🔵mranges_test.go	go	5.7 KB	2024-02-02 18:09	✏️ 👁️
🔵msan.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵msan0.go	go	725 B	2024-02-02 18:09	✏️ 👁️
📄msan_amd64.s	s	2.3 KB	2024-02-02 18:09	✏️ 👁️
📄msan_arm64.s	s	2 KB	2024-02-02 18:09	✏️ 👁️
📄msan_loong64.s	s	2 KB	2024-02-02 18:09	✏️ 👁️
🔵msize_allocheaders.go	go	1.3 KB	2024-02-02 18:09	✏️ 👁️
🔵msize_noallocheaders.go	go	915 B	2024-02-02 18:09	✏️ 👁️
🔵mspanset.go	go	13.1 KB	2024-02-02 18:09	✏️ 👁️
🔵mstats.go	go	33.8 KB	2024-02-02 18:09	✏️ 👁️
🔵mwbbuf.go	go	8.1 KB	2024-02-02 18:09	✏️ 👁️
🔵nbpipe_pipe.go	go	405 B	2024-02-02 18:09	✏️ 👁️
🔵nbpipe_pipe2.go	go	344 B	2024-02-02 18:09	✏️ 👁️
🔵nbpipe_pipe_test.go	go	706 B	2024-02-02 18:09	✏️ 👁️
🔵nbpipe_test.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵net_plan9.go	go	645 B	2024-02-02 18:09	✏️ 👁️
🔵netpoll.go	go	20.5 KB	2024-02-02 18:09	✏️ 👁️
🔵netpoll_aix.go	go	5.1 KB	2024-02-02 18:09	✏️ 👁️
🔵netpoll_epoll.go	go	4.4 KB	2024-02-02 18:09	✏️ 👁️
🔵netpoll_fake.go	go	664 B	2024-02-02 18:09	✏️ 👁️
🔵netpoll_kqueue.go	go	5.6 KB	2024-02-02 18:09	✏️ 👁️
🔵netpoll_os_test.go	go	520 B	2024-02-02 18:09	✏️ 👁️
🔵netpoll_solaris.go	go	11.2 KB	2024-02-02 18:09	✏️ 👁️
🔵netpoll_stub.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵netpoll_wasip1.go	go	6.1 KB	2024-02-02 18:09	✏️ 👁️
🔵netpoll_windows.go	go	4 KB	2024-02-02 18:09	✏️ 👁️
🔵nonwindows_stub.go	go	729 B	2024-02-02 18:09	✏️ 👁️
🔵norace_linux_test.go	go	915 B	2024-02-02 18:09	✏️ 👁️
🔵norace_test.go	go	983 B	2024-02-02 18:09	✏️ 👁️
🔵numcpu_freebsd_test.go	go	381 B	2024-02-02 18:09	✏️ 👁️
🔵os2_aix.go	go	20.9 KB	2024-02-02 18:09	✏️ 👁️
🔵os2_freebsd.go	go	302 B	2024-02-02 18:09	✏️ 👁️
🔵os2_openbsd.go	go	296 B	2024-02-02 18:09	✏️ 👁️
🔵os2_plan9.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵os2_solaris.go	go	320 B	2024-02-02 18:09	✏️ 👁️
🔵os3_plan9.go	go	3.9 KB	2024-02-02 18:09	✏️ 👁️
🔵os3_solaris.go	go	17.6 KB	2024-02-02 18:09	✏️ 👁️
🔵os_aix.go	go	8.9 KB	2024-02-02 18:09	✏️ 👁️
🔵os_android.go	go	463 B	2024-02-02 18:09	✏️ 👁️
🔵os_darwin.go	go	11.9 KB	2024-02-02 18:09	✏️ 👁️
🔵os_darwin_arm64.go	go	329 B	2024-02-02 18:09	✏️ 👁️
🔵os_dragonfly.go	go	7.1 KB	2024-02-02 18:09	✏️ 👁️
🔵os_freebsd.go	go	11.6 KB	2024-02-02 18:09	✏️ 👁️
🔵os_freebsd2.go	go	603 B	2024-02-02 18:09	✏️ 👁️
🔵os_freebsd_amd64.go	go	658 B	2024-02-02 18:09	✏️ 👁️
🔵os_freebsd_arm.go	go	1.4 KB	2024-02-02 18:09	✏️ 👁️
🔵os_freebsd_arm64.go	go	320 B	2024-02-02 18:09	✏️ 👁️
🔵os_freebsd_noauxv.go	go	241 B	2024-02-02 18:09	✏️ 👁️
🔵os_freebsd_riscv64.go	go	198 B	2024-02-02 18:09	✏️ 👁️
🔵os_illumos.go	go	3.9 KB	2024-02-02 18:09	✏️ 👁️
🔵os_js.go	go	767 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux.go	go	25.7 KB	2024-02-02 18:09	✏️ 👁️
🔵os_linux_arm.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵os_linux_arm64.go	go	478 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_be64.go	go	806 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_generic.go	go	870 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_loong64.go	go	263 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_mips64x.go	go	996 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_mipsx.go	go	987 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_noauxv.go	go	337 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_novdso.go	go	347 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_ppc64x.go	go	526 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_riscv64.go	go	198 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_s390x.go	go	825 B	2024-02-02 18:09	✏️ 👁️
🔵os_linux_x86.go	go	234 B	2024-02-02 18:09	✏️ 👁️
🔵os_netbsd.go	go	10.1 KB	2024-02-02 18:09	✏️ 👁️
🔵os_netbsd_386.go	go	617 B	2024-02-02 18:09	✏️ 👁️
🔵os_netbsd_amd64.go	go	614 B	2024-02-02 18:09	✏️ 👁️
🔵os_netbsd_arm.go	go	1.1 KB	2024-02-02 18:09	✏️ 👁️
🔵os_netbsd_arm64.go	go	769 B	2024-02-02 18:09	✏️ 👁️
🔵os_nonopenbsd.go	go	437 B	2024-02-02 18:09	✏️ 👁️
🔵os_only_solaris.go	go	357 B	2024-02-02 18:09	✏️ 👁️
🔵os_openbsd.go	go	6.2 KB	2024-02-02 18:09	✏️ 👁️
🔵os_openbsd_arm.go	go	662 B	2024-02-02 18:09	✏️ 👁️
🔵os_openbsd_arm64.go	go	329 B	2024-02-02 18:09	✏️ 👁️
🔵os_openbsd_libc.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵os_openbsd_mips64.go	go	329 B	2024-02-02 18:09	✏️ 👁️
🔵os_openbsd_syscall.go	go	1.4 KB	2024-02-02 18:09	✏️ 👁️
🔵os_openbsd_syscall1.go	go	441 B	2024-02-02 18:09	✏️ 👁️
🔵os_openbsd_syscall2.go	go	2.5 KB	2024-02-02 18:09	✏️ 👁️
🔵os_plan9.go	go	10.2 KB	2024-02-02 18:09	✏️ 👁️
🔵os_plan9_arm.go	go	375 B	2024-02-02 18:09	✏️ 👁️
🔵os_solaris.go	go	6.6 KB	2024-02-02 18:09	✏️ 👁️
🔵os_unix.go	go	436 B	2024-02-02 18:09	✏️ 👁️
🔵os_unix_nonlinux.go	go	374 B	2024-02-02 18:09	✏️ 👁️
🔵os_wasip1.go	go	7 KB	2024-02-02 18:09	✏️ 👁️
🔵os_wasm.go	go	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵os_windows.go	go	41.4 KB	2024-02-02 18:09	✏️ 👁️
🔵os_windows_arm.go	go	511 B	2024-02-02 18:09	✏️ 👁️
🔵os_windows_arm64.go	go	339 B	2024-02-02 18:09	✏️ 👁️
🔵pagetrace_off.go	go	550 B	2024-02-02 18:09	✏️ 👁️
🔵pagetrace_on.go	go	10.4 KB	2024-02-02 18:09	✏️ 👁️
🔵panic.go	go	41.8 KB	2024-02-02 18:09	✏️ 👁️
🔵panic32.go	go	4.8 KB	2024-02-02 18:09	✏️ 👁️
🔵panic_test.go	go	1.7 KB	2024-02-02 18:09	✏️ 👁️
🔵panicnil_test.go	go	1.3 KB	2024-02-02 18:09	✏️ 👁️
🔵pinner.go	go	11 KB	2024-02-02 18:09	✏️ 👁️
🔵pinner_test.go	go	11 KB	2024-02-02 18:09	✏️ 👁️
🔵plugin.go	go	4.4 KB	2024-02-02 18:09	✏️ 👁️
🔵preempt.go	go	15 KB	2024-02-02 18:09	✏️ 👁️
📄preempt_386.s	s	824 B	2024-02-02 18:09	✏️ 👁️
📄preempt_amd64.s	s	1.7 KB	2024-02-02 18:09	✏️ 👁️
📄preempt_arm.s	s	1.5 KB	2024-02-02 18:09	✏️ 👁️
📄preempt_arm64.s	s	2 KB	2024-02-02 18:09	✏️ 👁️
📄preempt_loong64.s	s	2.4 KB	2024-02-02 18:09	✏️ 👁️
📄preempt_mips64x.s	s	2.7 KB	2024-02-02 18:09	✏️ 👁️
📄preempt_mipsx.s	s	2.7 KB	2024-02-02 18:09	✏️ 👁️
🔵preempt_nonwindows.go	go	290 B	2024-02-02 18:09	✏️ 👁️
📄preempt_ppc64x.s	s	2.7 KB	2024-02-02 18:09	✏️ 👁️
📄preempt_riscv64.s	s	2.3 KB	2024-02-02 18:09	✏️ 👁️
📄preempt_s390x.s	s	1 KB	2024-02-02 18:09	✏️ 👁️
📄preempt_wasm.s	s	176 B	2024-02-02 18:09	✏️ 👁️
🔵print.go	go	5.9 KB	2024-02-02 18:09	✏️ 👁️
🔵proc.go	go	204.3 KB	2024-02-02 18:09	✏️ 👁️
🔵proc_runtime_test.go	go	1.4 KB	2024-02-02 18:09	✏️ 👁️
🔵proc_test.go	go	25.8 KB	2024-02-02 18:09	✏️ 👁️
🔵profbuf.go	go	18.3 KB	2024-02-02 18:09	✏️ 👁️
🔵profbuf_test.go	go	8.5 KB	2024-02-02 18:09	✏️ 👁️
🔵proflabel.go	go	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵race.go	go	18.8 KB	2024-02-02 18:09	✏️ 👁️
🔵race0.go	go	2.8 KB	2024-02-02 18:09	✏️ 👁️
📄race_amd64.s	s	13.9 KB	2024-02-02 18:09	✏️ 👁️
📄race_arm64.s	s	14.2 KB	2024-02-02 18:09	✏️ 👁️
📄race_ppc64le.s	s	15.9 KB	2024-02-02 18:09	✏️ 👁️
📄race_s390x.s	s	12 KB	2024-02-02 18:09	✏️ 👁️
🔵rand.go	go	7.1 KB	2024-02-02 18:09	✏️ 👁️
🔵rand_test.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵rdebug.go	go	550 B	2024-02-02 18:09	✏️ 👁️
🔵retry.go	go	760 B	2024-02-02 18:09	✏️ 👁️
📄rt0_aix_ppc64.s	s	4.1 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_android_386.s	s	822 B	2024-02-02 18:09	✏️ 👁️
📄rt0_android_amd64.s	s	754 B	2024-02-02 18:09	✏️ 👁️
📄rt0_android_arm.s	s	843 B	2024-02-02 18:09	✏️ 👁️
📄rt0_android_arm64.s	s	941 B	2024-02-02 18:09	✏️ 👁️
📄rt0_darwin_amd64.s	s	399 B	2024-02-02 18:09	✏️ 👁️
📄rt0_darwin_arm64.s	s	1.7 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_dragonfly_amd64.s	s	448 B	2024-02-02 18:09	✏️ 👁️
📄rt0_freebsd_386.s	s	454 B	2024-02-02 18:09	✏️ 👁️
📄rt0_freebsd_amd64.s	s	442 B	2024-02-02 18:09	✏️ 👁️
📄rt0_freebsd_arm.s	s	298 B	2024-02-02 18:09	✏️ 👁️
📄rt0_freebsd_arm64.s	s	1.9 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_freebsd_riscv64.s	s	2.7 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_illumos_amd64.s	s	311 B	2024-02-02 18:09	✏️ 👁️
📄rt0_ios_amd64.s	s	425 B	2024-02-02 18:09	✏️ 👁️
📄rt0_ios_arm64.s	s	425 B	2024-02-02 18:09	✏️ 👁️
📄rt0_js_wasm.s	s	1.5 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_386.s	s	450 B	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_amd64.s	s	307 B	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_arm.s	s	1007 B	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_arm64.s	s	1.8 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_loong64.s	s	2 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_mips64x.s	s	1014 B	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_mipsx.s	s	797 B	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_ppc64.s	s	847 B	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_ppc64le.s	s	2.9 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_riscv64.s	s	2.6 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_linux_s390x.s	s	676 B	2024-02-02 18:09	✏️ 👁️
📄rt0_netbsd_386.s	s	452 B	2024-02-02 18:09	✏️ 👁️
📄rt0_netbsd_amd64.s	s	309 B	2024-02-02 18:09	✏️ 👁️
📄rt0_netbsd_arm.s	s	296 B	2024-02-02 18:09	✏️ 👁️
📄rt0_netbsd_arm64.s	s	1.8 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_openbsd_386.s	s	454 B	2024-02-02 18:09	✏️ 👁️
📄rt0_openbsd_amd64.s	s	311 B	2024-02-02 18:09	✏️ 👁️
📄rt0_openbsd_arm.s	s	298 B	2024-02-02 18:09	✏️ 👁️
📄rt0_openbsd_arm64.s	s	2 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_openbsd_mips64.s	s	976 B	2024-02-02 18:09	✏️ 👁️
📄rt0_openbsd_ppc64.s	s	370 B	2024-02-02 18:09	✏️ 👁️
📄rt0_openbsd_riscv64.s	s	372 B	2024-02-02 18:09	✏️ 👁️
📄rt0_plan9_386.s	s	523 B	2024-02-02 18:09	✏️ 👁️
📄rt0_plan9_amd64.s	s	481 B	2024-02-02 18:09	✏️ 👁️
📄rt0_plan9_arm.s	s	397 B	2024-02-02 18:09	✏️ 👁️
📄rt0_solaris_amd64.s	s	311 B	2024-02-02 18:09	✏️ 👁️
📄rt0_wasip1_wasm.s	s	387 B	2024-02-02 18:09	✏️ 👁️
📄rt0_windows_386.s	s	1.3 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_windows_amd64.s	s	1.1 KB	2024-02-02 18:09	✏️ 👁️
📄rt0_windows_arm.s	s	386 B	2024-02-02 18:09	✏️ 👁️
📄rt0_windows_arm64.s	s	733 B	2024-02-02 18:09	✏️ 👁️
🐍runtime-gdb.py	py	15.4 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime-gdb_test.go	go	24 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime-gdb_unix_test.go	go	9.4 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime-lldb_test.go	go	5 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime-seh_windows_test.go	go	4.7 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime.go	go	7.1 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime1.go	go	16.7 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime2.go	go	46.2 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime_boring.go	go	606 B	2024-02-02 18:09	✏️ 👁️
🔵runtime_linux_test.go	go	1.8 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime_mmap_test.go	go	1.8 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime_test.go	go	11.8 KB	2024-02-02 18:09	✏️ 👁️
🔵runtime_unix_test.go	go	1.2 KB	2024-02-02 18:09	✏️ 👁️
🔵rwmutex.go	go	5 KB	2024-02-02 18:09	✏️ 👁️
🔵rwmutex_test.go	go	4.2 KB	2024-02-02 18:09	✏️ 👁️
🔵security_aix.go	go	449 B	2024-02-02 18:09	✏️ 👁️
🔵security_issetugid.go	go	502 B	2024-02-02 18:09	✏️ 👁️
🔵security_linux.go	go	335 B	2024-02-02 18:09	✏️ 👁️
🔵security_nonunix.go	go	256 B	2024-02-02 18:09	✏️ 👁️
🔵security_test.go	go	4.1 KB	2024-02-02 18:09	✏️ 👁️
🔵security_unix.go	go	818 B	2024-02-02 18:09	✏️ 👁️
🔵select.go	go	14.8 KB	2024-02-02 18:09	✏️ 👁️
🔵sema.go	go	18.4 KB	2024-02-02 18:09	✏️ 👁️
🔵sema_test.go	go	4.2 KB	2024-02-02 18:09	✏️ 👁️
🔵semasleep_test.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵sigaction.go	go	489 B	2024-02-02 18:09	✏️ 👁️
🔵signal_386.go	go	1.7 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_aix_ppc64.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_amd64.go	go	2.7 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_arm.go	go	2.5 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_arm64.go	go	3.8 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_darwin.go	go	2.1 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_darwin_amd64.go	go	4 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_darwin_arm64.go	go	3.6 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_dragonfly.go	go	2.2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_dragonfly_amd64.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_freebsd.go	go	2.2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_freebsd_386.go	go	1.6 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_freebsd_amd64.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_freebsd_arm.go	go	2.2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_freebsd_arm64.go	go	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_freebsd_riscv64.go	go	3.1 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_386.go	go	1.6 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_amd64.go	go	2.1 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_arm.go	go	2.1 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_arm64.go	go	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_loong64.go	go	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_mips64x.go	go	3.3 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_mipsx.go	go	3.7 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_ppc64x.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_riscv64.go	go	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_linux_s390x.go	go	4.5 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_loong64.go	go	3 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_mips64x.go	go	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_mipsx.go	go	3.1 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_netbsd.go	go	2.2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_netbsd_386.go	go	1.8 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_netbsd_amd64.go	go	2.3 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_netbsd_arm.go	go	2.3 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_netbsd_arm64.go	go	3.4 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_openbsd.go	go	2.2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_openbsd_386.go	go	1.6 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_openbsd_amd64.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_openbsd_arm.go	go	2.1 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_openbsd_arm64.go	go	3.4 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_openbsd_mips64.go	go	3.3 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_openbsd_ppc64.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_openbsd_riscv64.go	go	3.1 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_plan9.go	go	1.9 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_ppc64x.go	go	3.7 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_riscv64.go	go	2.9 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_solaris.go	go	4.5 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_solaris_amd64.go	go	2.5 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_unix.go	go	44.1 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_windows.go	go	14.5 KB	2024-02-02 18:09	✏️ 👁️
🔵signal_windows_test.go	go	9 KB	2024-02-02 18:09	✏️ 👁️
🔵sigqueue.go	go	7.6 KB	2024-02-02 18:09	✏️ 👁️
🔵sigqueue_note.go	go	648 B	2024-02-02 18:09	✏️ 👁️
🔵sigqueue_plan9.go	go	3.3 KB	2024-02-02 18:09	✏️ 👁️
🔵sigtab_aix.go	go	11.3 KB	2024-02-02 18:09	✏️ 👁️
🔵sigtab_linux_generic.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵sigtab_linux_mipsx.go	go	6 KB	2024-02-02 18:09	✏️ 👁️
🔵sizeclasses.go	go	9.2 KB	2024-02-02 18:09	✏️ 👁️
🔵sizeof_test.go	go	1003 B	2024-02-02 18:09	✏️ 👁️
🔵slice.go	go	11.2 KB	2024-02-02 18:09	✏️ 👁️
🔵slice_test.go	go	10.3 KB	2024-02-02 18:09	✏️ 👁️
🔵softfloat64.go	go	11.5 KB	2024-02-02 18:09	✏️ 👁️
🔵softfloat64_test.go	go	4 KB	2024-02-02 18:09	✏️ 👁️
🔵stack.go	go	40 KB	2024-02-02 18:09	✏️ 👁️
🔵stack_test.go	go	23.1 KB	2024-02-02 18:09	✏️ 👁️
🔵start_line_amd64_test.go	go	647 B	2024-02-02 18:09	✏️ 👁️
🔵start_line_test.go	go	2.6 KB	2024-02-02 18:09	✏️ 👁️
🔵stkframe.go	go	9.9 KB	2024-02-02 18:09	✏️ 👁️
🔵string.go	go	13.4 KB	2024-02-02 18:09	✏️ 👁️
🔵string_test.go	go	13.3 KB	2024-02-02 18:09	✏️ 👁️
🔵stubs.go	go	17.4 KB	2024-02-02 18:09	✏️ 👁️
🔵stubs2.go	go	1.1 KB	2024-02-02 18:09	✏️ 👁️
🔵stubs3.go	go	324 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_386.go	go	708 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_amd64.go	go	1.4 KB	2024-02-02 18:09	✏️ 👁️
🔵stubs_arm.go	go	689 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_arm64.go	go	700 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_linux.go	go	650 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_loong64.go	go	638 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_mips64x.go	go	522 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_mipsx.go	go	441 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_nonlinux.go	go	298 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_ppc64.go	go	302 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_ppc64x.go	go	688 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_riscv64.go	go	695 B	2024-02-02 18:09	✏️ 👁️
🔵stubs_s390x.go	go	414 B	2024-02-02 18:09	✏️ 👁️
🔵symtab.go	go	34.8 KB	2024-02-02 18:09	✏️ 👁️
🔵symtab_test.go	go	7.5 KB	2024-02-02 18:09	✏️ 👁️
🔵symtabinl.go	go	3.8 KB	2024-02-02 18:09	✏️ 👁️
🔵symtabinl_test.go	go	3 KB	2024-02-02 18:09	✏️ 👁️
📄sys_aix_ppc64.s	s	7.4 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_arm.go	go	521 B	2024-02-02 18:09	✏️ 👁️
🔵sys_arm64.go	go	469 B	2024-02-02 18:09	✏️ 👁️
🔵sys_darwin.go	go	22.6 KB	2024-02-02 18:09	✏️ 👁️
📄sys_darwin_amd64.s	s	19.7 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_darwin_arm64.go	go	1.7 KB	2024-02-02 18:09	✏️ 👁️
📄sys_darwin_arm64.s	s	18.3 KB	2024-02-02 18:09	✏️ 👁️
📄sys_dragonfly_amd64.s	s	8.3 KB	2024-02-02 18:09	✏️ 👁️
📄sys_freebsd_386.s	s	9.4 KB	2024-02-02 18:09	✏️ 👁️
📄sys_freebsd_amd64.s	s	12.7 KB	2024-02-02 18:09	✏️ 👁️
📄sys_freebsd_arm.s	s	10.4 KB	2024-02-02 18:09	✏️ 👁️
📄sys_freebsd_arm64.s	s	9.5 KB	2024-02-02 18:09	✏️ 👁️
📄sys_freebsd_riscv64.s	s	8.9 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_libc.go	go	1.8 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_386.s	s	17.9 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_amd64.s	s	15.7 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_arm.s	s	13.5 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_arm64.s	s	16.7 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_loong64.s	s	14.2 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_mips64x.s	s	12 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_mipsx.s	s	9.7 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_ppc64x.s	s	18.1 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_riscv64.s	s	11.5 KB	2024-02-02 18:09	✏️ 👁️
📄sys_linux_s390x.s	s	12.5 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_loong64.go	go	489 B	2024-02-02 18:09	✏️ 👁️
🔵sys_mips64x.go	go	500 B	2024-02-02 18:09	✏️ 👁️
🔵sys_mipsx.go	go	496 B	2024-02-02 18:09	✏️ 👁️
📄sys_netbsd_386.s	s	9.6 KB	2024-02-02 18:09	✏️ 👁️
📄sys_netbsd_amd64.s	s	9.8 KB	2024-02-02 18:09	✏️ 👁️
📄sys_netbsd_arm.s	s	10.6 KB	2024-02-02 18:09	✏️ 👁️
📄sys_netbsd_arm64.s	s	9.5 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_nonppc64x.go	go	245 B	2024-02-02 18:09	✏️ 👁️
🔵sys_openbsd.go	go	2.6 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_openbsd1.go	go	1.2 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_openbsd2.go	go	8.7 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_openbsd3.go	go	3.4 KB	2024-02-02 18:09	✏️ 👁️
📄sys_openbsd_386.s	s	20.4 KB	2024-02-02 18:09	✏️ 👁️
📄sys_openbsd_amd64.s	s	15.5 KB	2024-02-02 18:09	✏️ 👁️
📄sys_openbsd_arm.s	s	18.5 KB	2024-02-02 18:09	✏️ 👁️
📄sys_openbsd_arm64.s	s	15.1 KB	2024-02-02 18:09	✏️ 👁️
📄sys_openbsd_mips64.s	s	8.8 KB	2024-02-02 18:09	✏️ 👁️
📄sys_openbsd_ppc64.s	s	15.3 KB	2024-02-02 18:09	✏️ 👁️
📄sys_openbsd_riscv64.s	s	16.8 KB	2024-02-02 18:09	✏️ 👁️
📄sys_plan9_386.s	s	4.5 KB	2024-02-02 18:09	✏️ 👁️
📄sys_plan9_amd64.s	s	4.6 KB	2024-02-02 18:09	✏️ 👁️
📄sys_plan9_arm.s	s	7 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_ppc64x.go	go	532 B	2024-02-02 18:09	✏️ 👁️
🔵sys_riscv64.go	go	469 B	2024-02-02 18:09	✏️ 👁️
🔵sys_s390x.go	go	469 B	2024-02-02 18:09	✏️ 👁️
📄sys_solaris_amd64.s	s	6.4 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_wasm.go	go	758 B	2024-02-02 18:09	✏️ 👁️
📄sys_wasm.s	s	1.4 KB	2024-02-02 18:09	✏️ 👁️
📄sys_windows_386.s	s	6.5 KB	2024-02-02 18:09	✏️ 👁️
📄sys_windows_amd64.s	s	8.4 KB	2024-02-02 18:09	✏️ 👁️
📄sys_windows_arm.s	s	7.7 KB	2024-02-02 18:09	✏️ 👁️
📄sys_windows_arm64.s	s	6.8 KB	2024-02-02 18:09	✏️ 👁️
🔵sys_x86.go	go	552 B	2024-02-02 18:09	✏️ 👁️
🔵syscall2_solaris.go	go	1.8 KB	2024-02-02 18:09	✏️ 👁️
🔵syscall_aix.go	go	6.3 KB	2024-02-02 18:09	✏️ 👁️
🔵syscall_solaris.go	go	8.4 KB	2024-02-02 18:09	✏️ 👁️
🔵syscall_unix_test.go	go	635 B	2024-02-02 18:09	✏️ 👁️
🔵syscall_windows.go	go	16.6 KB	2024-02-02 18:09	✏️ 👁️
🔵syscall_windows_test.go	go	32.5 KB	2024-02-02 18:09	✏️ 👁️
🔵tagptr.go	go	496 B	2024-02-02 18:09	✏️ 👁️
🔵tagptr_32bit.go	go	927 B	2024-02-02 18:09	✏️ 👁️
🔵tagptr_64bit.go	go	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵test_amd64.go	go	196 B	2024-02-02 18:09	✏️ 👁️
📄test_amd64.s	s	316 B	2024-02-02 18:09	✏️ 👁️
🔵test_stubs.go	go	218 B	2024-02-02 18:09	✏️ 👁️
📄textflag.h	h	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵time.go	go	30.6 KB	2024-02-02 18:09	✏️ 👁️
🔵time_fake.go	go	2.5 KB	2024-02-02 18:09	✏️ 👁️
📄time_linux_amd64.s	s	2 KB	2024-02-02 18:09	✏️ 👁️
🔵time_nofake.go	go	709 B	2024-02-02 18:09	✏️ 👁️
🔵time_test.go	go	2 KB	2024-02-02 18:09	✏️ 👁️
📄time_windows.h	h	753 B	2024-02-02 18:09	✏️ 👁️
📄time_windows_386.s	s	1.7 KB	2024-02-02 18:09	✏️ 👁️
📄time_windows_amd64.s	s	786 B	2024-02-02 18:09	✏️ 👁️
📄time_windows_arm.s	s	2 KB	2024-02-02 18:09	✏️ 👁️
📄time_windows_arm64.s	s	906 B	2024-02-02 18:09	✏️ 👁️
🔵timeasm.go	go	418 B	2024-02-02 18:09	✏️ 👁️
🔵timestub.go	go	532 B	2024-02-02 18:09	✏️ 👁️
🔵timestub2.go	go	363 B	2024-02-02 18:09	✏️ 👁️
📄tls_arm.s	s	3.5 KB	2024-02-02 18:09	✏️ 👁️
📄tls_arm64.h	h	1.1 KB	2024-02-02 18:09	✏️ 👁️
📄tls_arm64.s	s	1.2 KB	2024-02-02 18:09	✏️ 👁️
📄tls_loong64.s	s	589 B	2024-02-02 18:09	✏️ 👁️
📄tls_mips64x.s	s	733 B	2024-02-02 18:09	✏️ 👁️
📄tls_mipsx.s	s	710 B	2024-02-02 18:09	✏️ 👁️
📄tls_ppc64x.s	s	1.5 KB	2024-02-02 18:09	✏️ 👁️
📄tls_riscv64.s	s	615 B	2024-02-02 18:09	✏️ 👁️
📄tls_s390x.s	s	1.5 KB	2024-02-02 18:09	✏️ 👁️
🔵tls_stub.go	go	260 B	2024-02-02 18:09	✏️ 👁️
🔵tls_windows_amd64.go	go	294 B	2024-02-02 18:09	✏️ 👁️
🔵trace.go	go	62.8 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2.go	go	33.8 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2buf.go	go	6.6 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2cpu.go	go	8.9 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2event.go	go	8.4 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2map.go	go	4.4 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2region.go	go	1.7 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2runtime.go	go	24.2 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2stack.go	go	9.5 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2status.go	go	7.2 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2string.go	go	2.6 KB	2024-02-02 18:09	✏️ 👁️
🔵trace2time.go	go	3.2 KB	2024-02-02 18:09	✏️ 👁️
🔵trace_cgo_test.go	go	4.5 KB	2024-02-02 18:09	✏️ 👁️
🔵traceback.go	go	54.6 KB	2024-02-02 18:09	✏️ 👁️
🔵traceback_test.go	go	22.9 KB	2024-02-02 18:09	✏️ 👁️
🔵tracebackx_test.go	go	509 B	2024-02-02 18:09	✏️ 👁️
🔵type.go	go	12.1 KB	2024-02-02 18:09	✏️ 👁️
🔵typekind.go	go	743 B	2024-02-02 18:09	✏️ 👁️
🔵unsafe.go	go	3 KB	2024-02-02 18:09	✏️ 👁️
🔵unsafepoint_test.go	go	3.3 KB	2024-02-02 18:09	✏️ 👁️
🔵utf8.go	go	3.4 KB	2024-02-02 18:09	✏️ 👁️
🔵vdso_elf32.go	go	2.8 KB	2024-02-02 18:09	✏️ 👁️
🔵vdso_elf64.go	go	2.8 KB	2024-02-02 18:09	✏️ 👁️
🔵vdso_freebsd.go	go	2.4 KB	2024-02-02 18:09	✏️ 👁️
🔵vdso_freebsd_arm.go	go	454 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_freebsd_arm64.go	go	454 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_freebsd_riscv64.go	go	429 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_freebsd_x86.go	go	1.9 KB	2024-02-02 18:09	✏️ 👁️
🔵vdso_in_none.go	go	443 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux.go	go	7.8 KB	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux_386.go	go	669 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux_amd64.go	go	685 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux_arm.go	go	669 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux_arm64.go	go	670 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux_loong64.go	go	793 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux_mips64x.go	go	850 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux_ppc64x.go	go	672 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux_riscv64.go	go	666 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_linux_s390x.go	go	659 B	2024-02-02 18:09	✏️ 👁️
🔵vdso_test.go	go	3.7 KB	2024-02-02 18:09	✏️ 👁️
📄vlop_386.s	s	2 KB	2024-02-02 18:09	✏️ 👁️
📄vlop_arm.s	s	7.1 KB	2024-02-02 18:09	✏️ 👁️
🔵vlop_arm_test.go	go	3.7 KB	2024-02-02 18:09	✏️ 👁️
🔵vlrt.go	go	6.7 KB	2024-02-02 18:09	✏️ 👁️
🔵wincallback.go	go	3.5 KB	2024-02-02 18:09	✏️ 👁️
🔵write_err.go	go	291 B	2024-02-02 18:09	✏️ 👁️
🔵write_err_android.go	go	4.6 KB	2024-02-02 18:09	✏️ 👁️
🔵zcallback_windows.go	go	155 B	2024-02-02 18:09	✏️ 👁️
📄zcallback_windows.s	s	63.1 KB	2024-02-02 18:09	✏️ 👁️
📄zcallback_windows_arm.s	s	89.3 KB	2024-02-02 18:09	✏️ 👁️
📄zcallback_windows_arm64.s	s	89.3 KB	2024-02-02 18:09	✏️ 👁️

✏️ Rename