- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 34 for nextGen (0.14 sec)
-
src/runtime/mgcscavenge_test.go
if wantOffset != gotOffset { t.Errorf("find: wanted page offset %d, got %d", wantOffset, gotOffset) } if t.Failed() { t.FailNow() } si.SetEmpty(got) } nextGen = func() { t.Helper() si.NextGen() } return } // Each of these test cases calls mark and then find once. type testCase struct { name string mark func(markFunc) find func(findFunc) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 25.2K bytes - Viewed (0) -
src/runtime/export_test.go
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 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/server/filters/goaway_test.go
name string chance float64 nextFn func(chance float64) func() float64 expectGOAWAY bool }{ { name: "always not GOAWAY", chance: 0, nextFn: func(chance float64) func() float64 { return rand.Float64 }, expectGOAWAY: false, }, { name: "always GOAWAY", chance: 1, nextFn: func(chance float64) func() float64 { return rand.Float64 },
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Nov 17 12:58:54 UTC 2021 - 13.9K bytes - Viewed (0) -
src/runtime/traceruntime.go
// is during a syscall. tl.eventWriter(traceGoSyscall, traceProcIdle).commit(traceEvProcStart, traceArg(pp.id), pp.trace.nextSeq(tl.gen)) } // ProcStop traces a ProcStop event. func (tl traceLocker) ProcStop(pp *p) { // The only time a goroutine is allowed to have its Proc moved around // from under it is during a syscall.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 25.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
// "priority" for a value score := f.Cache.allocInt8Slice(f.NumValues()) defer f.Cache.freeInt8Slice(score) // maps mem values to the next live memory value nextMem := f.Cache.allocValueSlice(f.NumValues()) defer f.Cache.freeValueSlice(nextMem) // inBlockUses records whether a value is used in the block // in which it lives. (block control values don't count as uses.)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 15:53:17 UTC 2024 - 16.4K bytes - Viewed (0) -
src/main/java/jcifs/dcerpc/DcerpcHandle.java
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Sun Jun 30 10:11:57 UTC 2019 - 12.9K bytes - Viewed (0) -
src/main/java/jcifs/smb/DfsImpl.java
break; } // walk up trying to find a match, do not go up to the root int nextSep = link.lastIndexOf('\\'); if ( nextSep > 0 ) { link = link.substring(0, nextSep); } else { if ( log.isTraceEnabled() ) { log.trace("Not found " + link);
Registered: Wed Jun 12 15:45:55 UTC 2024 - Last Modified: Thu Jan 05 13:07:29 UTC 2023 - 29.1K bytes - Viewed (0) -
src/testing/benchmark.go
extLen: len(benchmarkName("", maxprocs)), } var bs []InternalBenchmark for _, Benchmark := range benchmarks { if _, matched, _ := ctx.match.fullName(nil, Benchmark.Name); matched { bs = append(bs, Benchmark) benchName := benchmarkName(Benchmark.Name, maxprocs) if l := len(benchName) + ctx.extLen + 1; l > ctx.maxLen { ctx.maxLen = l } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 23.9K bytes - Viewed (0) -
src/cmd/asm/internal/asm/parse.go
firstReg = int(reg) nextReg = firstReg arrangement = curArrangement } else if curArrangement != arrangement { p.errorf("inconsistent arrangement in ARM64 register list") } else if nextReg != int(reg) { p.errorf("incontiguous register in ARM64 register list: %s", name) } regCnt++ nextReg = (nextReg + 1) % 32 case sys.ARM:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 14:34:57 UTC 2024 - 36.9K bytes - Viewed (0) -
src/runtime/time.go
// We read minWhen after reading minNextWhen so that // if we see a cleared minNextWhen, we are guaranteed to see // the updated minWhen. nextWhen := ts.minWhenModified.Load() when := ts.minWhenHeap.Load() if when == 0 || (nextWhen != 0 && nextWhen < when) { when = nextWhen } return when } // check runs any timers in ts that are ready. // If now is not 0 it is the current time.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 29 14:36:24 UTC 2024 - 37.5K bytes - Viewed (0)