- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for FindSucc (0.33 sec)
-
src/runtime/mranges.go
a.sysStat = sysStat a.totalBytes = 0 } // findSucc returns the first index in a such that addr is // less than the base of the addrRange at that index. func (a *addrRanges) findSucc(addr uintptr) int { base := offAddr{addr} // Narrow down the search space via a binary search // for large addrRanges until we have at most iterMax
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 14.5K bytes - Viewed (0) -
src/runtime/mranges_test.go
base: 250, expect: 50, ranges: large, }, } for _, test := range tests { t.Run(test.name, func(t *testing.T) { a := MakeAddrRanges(test.ranges...) i := a.FindSucc(test.base) if i != test.expect { t.Fatalf("expected %d, got %d", test.expect, i) } }) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Oct 23 23:01:52 UTC 2020 - 5.7K bytes - Viewed (0) -
src/runtime/mpagealloc_64bit.go
// any existing range. // // This will be used to look at what memory in the summary array is already // mapped before and after this new range. inUseIndex := p.inUse.findSucc(base) // Walk up the radix tree and map summaries in as needed. for l := range p.summary { // Figure out what part of the summary array this new address space needs.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jan 03 11:00:10 UTC 2024 - 9.3K bytes - Viewed (0) -
src/runtime/export_test.go
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),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0)