- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 152 for allg (0.24 sec)
-
src/runtime/mklockrank.go
testR, wakeableSleep # Above SCHED are things that can call into the scheduler. < SCHED # Below SCHED is the scheduler implementation. < allocmR, execR; allocmR, execR, hchan < sched; sched < allg, allp; # Channels NONE < notifyList; hchan, notifyList < sudog; hchan, pollDesc, wakeableSleep < timers; timers, timerSend < timer < netpollInit; # Semaphores NONE < root; # Itabs NONE
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 9.1K bytes - Viewed (0) -
src/runtime/lockrank.go
lockRankHchan: "hchan", lockRankAllocmR: "allocmR", lockRankExecR: "execR", lockRankSched: "sched", lockRankAllg: "allg", lockRankAllp: "allp", lockRankNotifyList: "notifyList", lockRankSudog: "sudog", lockRankTimers: "timers", lockRankTimer: "timer", lockRankNetpollInit: "netpollInit",
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 19.9K bytes - Viewed (0) -
src/runtime/runtime2.go
waitReasonFlushProcCaches: true, } var ( allm *m gomaxprocs int32 ncpu int32 forcegc forcegcstate sched schedt newprocs int32 ) var ( // allpLock protects P-less reads and size changes of allp, idlepMask, // and timerpMask, and all writes to allp. allpLock mutex // len(allp) == gomaxprocs; may change at safe points, otherwise // immutable.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 47.9K bytes - Viewed (0) -
src/runtime/proc.go
// cannot happen concurrently with this. allgs grows // monotonically and existing entries never change, so we can // simply return a copy of the slice header. For added safety, // we trim everything past len because that can still change. return allgs[:len(allgs):len(allgs)] } // atomicAllG returns &allgs[0] and len(allgs) for use with atomicAllGIndex. func atomicAllG() (**g, uintptr) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 207.5K bytes - Viewed (0) -
src/runtime/mgc.go
mheap_.sweepPagesPerByte = 0 unlock(&mheap_.lock) // Flush all mcaches. for _, pp := range allp { pp.mcache.prepareForSweep() } // Sweep all spans eagerly. for sweepone() != ^uintptr(0) { } // Free workbufs eagerly. prepareFreeWorkbufs() for freeSomeWbufs(false) { } // All "free" events for this mark/sweep cycle have
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0) -
src/main/resources/fess_indices/fess/it/stopwords.txt
# https://github.com/apache/lucene-solr/blob/master/lucene/analysis/common/src/resources/org/apache/lucene/analysis/snowball/italian_stop.txt ad al allo ai agli all agl alla alle con col coi da dal dallo dai dagli dall dagl dalla dalle di del dello dei degli dell degl della delle in nel nello nei negli nell negl nella nelle su sul
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Mon Nov 27 12:59:36 UTC 2023 - 1.8K bytes - Viewed (0) -
src/cmd/compile/internal/types/alg.go
// priority to the current algorithm type. func (t *Type) setAlg(a AlgKind) { if t.alg == AUNK { base.Fatalf("setAlg(%v,%s) starting with unknown priority", t, a) } if algPriority[a] > algPriority[t.alg] { t.alg = a } else if a != t.alg && algPriority[a] == algPriority[t.alg] { base.Fatalf("ambiguous priority %s and %s", a, t.alg) } } // AlgType returns the AlgKind used for comparing and hashing Type t.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 18 15:30:00 UTC 2024 - 2.4K bytes - Viewed (0) -
src/main/resources/fess_indices/fess/sv/stopwords.txt
honom skulle hennes där min man ej vid kunde något från ut när efter upp vi dem vara vad över än dig kan sina här ha mot alla under någon eller allt mycket sedan ju denna själv detta åt utan varit hur ingen mitt ni bli blev oss din dessa några deras blir mina samma vilken er
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Mon Nov 27 12:59:36 UTC 2023 - 700 bytes - Viewed (0) -
src/runtime/trace.go
// // Preventing preemption is sufficient to access allp safely. allp is only // mutated by GOMAXPROCS calls, which require a STW. // // TODO(mknyszek): Consider explicitly emitting ProcCreate and ProcDestroy // events to indicate whether a P exists, rather than just making its // existence implicit. mp = acquirem() for _, pp := range allp[len(allp):cap(allp)] { pp.trace.readyNextGen(traceNextGen(gen)) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 21:17:41 UTC 2024 - 37.1K bytes - Viewed (0) -
src/internal/dag/alg.go
// Copyright 2022 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package dag // Transpose reverses all edges in g. func (g *Graph) Transpose() { old := g.edges g.edges = make(map[string]map[string]bool) for _, n := range g.Nodes { g.edges[n] = make(map[string]bool) } for from, tos := range old { for to := range tos {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Aug 04 15:31:44 UTC 2022 - 1.3K bytes - Viewed (0)