- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 14 for Grown (0.05 sec)
-
src/runtime/mgcscavenge.go
sc.value.Store(ssc.pack()) } // scavChunkData tracks information about a palloc chunk for // scavenging. It packs well into 64 bits. // // The zero value always represents a valid newly-grown chunk. type scavChunkData struct { // inUse indicates how many pages in this chunk are currently // allocated. // // Only the first 10 bits are used. inUse uint16
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0) -
src/runtime/mheap.go
heapArenaAlloc linearAlloc // arenaHints is a list of addresses at which to attempt to // add more heap arenas. This is initially populated with a // set of general hint addresses, and grown with the bounds of // actual heap arena ranges. arenaHints *arenaHint // arena is a pre-reserved space for allocating heap arenas // (the actual arenas). This is only used on 32-bit. arena linearAlloc
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
src/runtime/mgcpacer.go
// give the sweeper some runway if it doesn't have enough. c.sweepDistMinTrigger.Store(c.heapLive.Load() + sweepMinHeapDistance) } // Compute the next GC goal, which is when the allocated heap // has grown by GOGC/100 over where it started the last cycle, // plus additional runway for non-heap sources of GC work. gcPercentHeapGoal := ^uint64(0) if gcPercent := c.gcPercent.Load(); gcPercent >= 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
src/runtime/mgc.go
if debug.gccheckmark > 0 { // This is expensive when there's a large number of // Gs, so only do it if checkmark is also enabled. gcMarkRootCheck() } // Drop allg snapshot. allgs may have grown, in which case // this is the only reference to the old backing store and // there's no need to keep it around. work.stackRoots = nil // Clear out buffers and double-check that all gcWork caches
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
src/runtime/map.go
it.key = k if t.IndirectElem() { e = *((*unsafe.Pointer)(e)) } it.elem = e } else { // The hash table has grown since the iterator was started. // The golden data for this key is now somewhere else. // Check the current hash table for the data. // This code handles the case where the key
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 57.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/MapMakerInternalMap.java
* cause a concurrent read operation to see inconsistent data. This is made easier by the * nature of the read operations in Map. For example, no operation can reveal that the table * has grown but the threshold has not yet been updated, so there are no atomicity requirements * for this with respect to reads. * * As a guide, all critical volatile reads and writes to the count field are marked in code
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
src/runtime/traceback.go
// have other uintptr-typed stack references as well. // If during one of the calls that got us here or during one of the // callbacks below the stack must be grown, all these uintptr references // to the stack will not be updated, and traceback will continue // to inspect the old stack memory, which may no longer be valid.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 55.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* cause a concurrent read operation to see inconsistent data. This is made easier by the * nature of the read operations in Map. For example, no operation can reveal that the table * has grown but the threshold has not yet been updated, so there are no atomicity requirements * for this with respect to reads. * * As a guide, all critical volatile reads and writes to the count field are marked in code
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
src/main/webapp/css/admin/font-awesome.min.css
mbee:before{content:"\f211"}.fa-forward:before{content:"\f04e"}.fa-foursquare:before{content:"\f180"}.fa-free-code-camp:before{content:"\f2c5"}.fa-freebsd:before{content:"\f3a4"}.fa-frog:before{content:"\f52e"}.fa-frown:before{content:"\f119"}.fa-frown-open:before{content:"\f57a"}.fa-fulcrum:before{content:"\f50b"}.fa-funnel-dollar:before{content:"\f662"}.fa-futbol:before{content:"\f1e3"}.fa-galactic-republic:before{content:"\f50c"}.fa-galactic-senate:before{content:"\f50d"}.fa-gamepad:before{co...
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Sat Dec 14 21:22:25 UTC 2019 - 55.8K bytes - Viewed (0) -
src/strings/strings_test.go
x := Repeat(cs[:j], k) // Always matches set for i := 0; i < b.N; i++ { Trim(x[:k], cs[:j]) } }) } } } func BenchmarkTrimByte(b *testing.B) { x := " the quick brown fox " for i := 0; i < b.N; i++ { Trim(x, " ") } } func BenchmarkIndexPeriodic(b *testing.B) { key := "aa" for _, skip := range [...]int{2, 4, 8, 16, 32, 64} {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 12:58:37 UTC 2024 - 53K bytes - Viewed (0)