runtime.mheap.arenas (field)

26 uses

	runtime (current package)
		heapdump.go#L514: 	for i1 := range mheap_.arenas {
		heapdump.go#L515: 		if mheap_.arenas[i1] == nil {
		heapdump.go#L518: 		for i, ha := range mheap_.arenas[i1] {
		malloc.go#L734: 		l2 := h.arenas[ri.l1()]
		malloc.go#L741: 			atomic.StorepNoWB(unsafe.Pointer(&h.arenas[ri.l1()]), unsafe.Pointer(l2))
		mbitmap.go#L311: 	ha := mheap_.arenas[arena.l1()][arena.l2()]
		mbitmap.go#L442: 	l2 := mheap_.arenas[ai.l1()]
		mbitmap.go#L477: 	if l2 := mheap_.arenas[ai.l1()]; l2 != nil && l2[ai.l2()] != nil {
		mcheckmark.go#L41: 		arena := mheap_.arenas[ai.l1()][ai.l2()]
		mcheckmark.go#L90: 	arena := mheap_.arenas[ai.l1()][ai.l2()]
		mgc.go#L2245: 		ha := mheap_.arenas[ai.l1()][ai.l2()]
		mgcmark.go#L320: 	ha := mheap_.arenas[ai.l1()][ai.l2()]
		mheap.go#L156: 	arenas [1 << arenaL1Bits]*[1 << arenaL2Bits]*heapArena
		mheap.go#L640: 		if ri.l2() >= uint(len(mheap_.arenas[0])) {
		mheap.go#L645: 		if ri.l1() >= uint(len(mheap_.arenas)) {
		mheap.go#L649: 	l2 := mheap_.arenas[ri.l1()]
		mheap.go#L668: 	return mheap_.arenas[ai.l1()][ai.l2()].spans[(p/pageSize)%pagesPerArena]
		mheap.go#L694: 	arena = mheap_.arenas[ai.l1()][ai.l2()]
		mheap.go#L824: 		ha := h.arenas[ai.l1()][ai.l2()]
		mheap.go#L951: 	ha := h.arenas[ai.l1()][ai.l2()]
		mheap.go#L956: 			ha = h.arenas[ai.l1()][ai.l2()]
		mheap.go#L975: 		ha := h.arenas[ai.l1()][ai.l2()]
		mheap.go#L1660: 	ha := mheap_.arenas[ai.l1()][ai.l2()]
		mheap.go#L1668: 	ha := mheap_.arenas[ai.l1()][ai.l2()]
		mpagealloc.go#L548: 	if p.test || mheap_.arenas[ai.l1()] == nil || mheap_.arenas[ai.l1()][ai.l2()] == nil {