runtime.addrRange.limit (field)

33 uses

	runtime (current package)
		mgcscavenge.go#L613: 	maxAddr := work.limit.addr() - 1
		mgcscavenge.go#L622: 			work.limit = offAddr{p.scavengeRangeLocked(maxChunk, base, npages)}
		mgcscavenge.go#L629: 	work.limit = offAddr{chunkBase(maxChunk)}
		mgcscavenge.go#L638: 		for i := chunkIndex(work.limit.addr() - 1); i >= chunkIndex(work.base.addr()); i-- {
		mgcscavenge.go#L680: 			work.limit = work.base
		mgcscavenge.go#L688: 			work.limit = offAddr{p.scavengeRangeLocked(candidateChunkIdx, base, npages)}
		mgcscavenge.go#L695: 		work.limit = offAddr{chunkBase(candidateChunkIdx)}
		mpagealloc_64bit.go#L109: 		sumIdxBase, sumIdxLimit := addrsToSummaryRange(level, r.base.addr(), r.limit.addr())
		mranges.go#L26: 	base, limit offAddr
		mranges.go#L42: 	if !a.base.lessThan(a.limit) {
		mranges.go#L47: 	return a.limit.diff(a.base)
		mranges.go#L52: 	return a.base.lessEqual(offAddr{addr}) && (offAddr{addr}).lessThan(a.limit)
		mranges.go#L60: 	if b.base.lessEqual(a.base) && a.limit.lessEqual(b.limit) {
		mranges.go#L62: 	} else if a.base.lessThan(b.base) && b.limit.lessThan(a.limit) {
		mranges.go#L64: 	} else if b.limit.lessThan(a.limit) && a.base.lessThan(b.limit) {
		mranges.go#L65: 		a.base = b.limit
		mranges.go#L66: 	} else if a.base.lessThan(b.base) && b.base.lessThan(a.limit) {
		mranges.go#L67: 		a.limit = b.base
		mranges.go#L78: 	if a.limit.lessEqual(offAddr{addr}) {
		mranges.go#L261: 		print("runtime: range = {", hex(r.base.addr()), ", ", hex(r.limit.addr()), "}\n")
		mranges.go#L267: 	coalescesDown := i > 0 && a.ranges[i-1].limit.equal(r.base)
		mranges.go#L268: 	coalescesUp := i < len(a.ranges) && r.limit.equal(a.ranges[i].base)
		mranges.go#L272: 		a.ranges[i-1].limit = a.ranges[i].limit
		mranges.go#L280: 		a.ranges[i-1].limit = r.limit
		mranges.go#L321: 		newEnd := r.limit.sub(nBytes)
		mranges.go#L322: 		a.ranges[len(a.ranges)-1].limit = newEnd
		mranges.go#L324: 		return addrRange{newEnd, r.limit}