- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for dequeue0 (0.13 sec)
-
src/runtime/lock_sema.go
if v == locked { if atomic.Casuintptr(&l.key, locked, 0) { break } } else { // Other M's are waiting for the lock. // Dequeue an M. mp = muintptr(v &^ locked).ptr() if atomic.Casuintptr(&l.key, v, uintptr(mp.nextwaitm)) { // Dequeued an M. Wake it. semawakeup(mp) break } } } gp.m.mLockProfile.recordUnlock(l) gp.m.locks-- if gp.m.locks < 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:57:37 UTC 2024 - 6.8K bytes - Viewed (0) -
src/sync/poolqueue.go
// // This is implemented as a doubly-linked list queue of poolDequeues // where each dequeue is double the size of the previous one. Once a // dequeue fills up, this allocates a new one and only ever pushes to // the latest dequeue. Pops happen from the other end of the list and // once a dequeue is exhausted, it gets removed from the list. type poolChain struct {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 18:12:29 UTC 2024 - 8.3K bytes - Viewed (0) -
pilot/pkg/xds/pushqueue_test.go
done := make(chan *Connection, 1) go func() { con, _, _ := p.Dequeue() done <- con }() select { case ret := <-done: return ret case <-time.After(time.Millisecond * 500): return nil } } func ExpectTimeout(t *testing.T, p *PushQueue) { t.Helper() done := make(chan struct{}, 1) go func() { p.Dequeue() done <- struct{}{} }() select { case <-done:
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Apr 30 00:26:45 UTC 2024 - 8.8K bytes - Viewed (0) -
.github/workflows/team-triage-stale.yml
name: 'Requeue stale team-triage items' on: schedule: # Execute every day at 00:05 to avoid conflicts with other workflows - cron: '5 0 * * *' permissions: {} jobs: requeue: permissions: issues: write pull-requests: write runs-on: ubuntu-latest steps: - uses: actions/stale@v9 with: operations-per-run: 50 remove-stale-when-updated: false
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu May 02 09:13:16 UTC 2024 - 835 bytes - Viewed (0) -
pkg/controlplane/controller/crdregistration/crdregistration_controller.go
syncHandler func(groupVersion schema.GroupVersion) error syncedInitialSet chan struct{} // queue is where incoming work is placed to de-dup and to allow "easy" rate limited requeues on errors // this is actually keyed by a groupVersion queue workqueue.TypedRateLimitingInterface[schema.GroupVersion] }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 8.3K bytes - Viewed (0) -
pkg/controller/certificates/certificate_controller.go
return } for i := 0; i < workers; i++ { go wait.UntilWithContext(ctx, cc.worker, time.Second) } <-ctx.Done() } // worker runs a thread that dequeues CSRs, handles them, and marks them done. func (cc *CertificateController) worker(ctx context.Context) { for cc.processNextWorkItem(ctx) { } }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 6.4K bytes - Viewed (0) -
pilot/pkg/xds/monitoring.go
[]float64{.01, .1, 1, 3, 5, 10, 20, 30}, ) proxiesQueueTime = monitoring.NewDistribution( "pilot_proxy_queue_time", "Time in seconds, a proxy is in the push queue before being dequeued.", []float64{.1, .5, 1, 3, 5, 10, 20, 30}, ) pushTriggers = monitoring.NewSum( "pilot_push_triggers", "Total number of times a push was triggered, labeled by reason for the push.", )
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Apr 30 00:26:45 UTC 2024 - 6.7K bytes - Viewed (0) -
pkg/controller/bootstrap/tokencleaner.go
key, err := controller.KeyFunc(obj) if err != nil { utilruntime.HandleError(err) return } tc.queue.Add(key) } // worker runs a thread that dequeues secrets, handles them, and marks them done. func (tc *TokenCleaner) worker(ctx context.Context) { for tc.processNextWorkItem(ctx) { } }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 6.3K bytes - Viewed (0) -
src/runtime/tracebuf.go
func (q *traceBufQueue) push(buf *traceBuf) { buf.link = nil if q.head == nil { q.head = buf } else { q.tail.link = buf } q.tail = buf } // pop dequeues from the queue of buffers. func (q *traceBufQueue) pop() *traceBuf { buf := q.head if buf == nil { return nil } q.head = buf.link if q.head == nil { q.tail = nil } buf.link = nil
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:47:01 UTC 2024 - 6.8K bytes - Viewed (0) -
pkg/controller/storageversionmigrator/resourceversion.go
_, name, err := cache.SplitMetaNamespaceKey(key) if err != nil { return err } svm, err := rv.svmListers.Get(name) if apierrors.IsNotFound(err) { // no work to do, don't fail and requeue return nil } if err != nil { return err } // working with copy to avoid race condition between this and migration controller toBeProcessedSVM := svm.DeepCopy()
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 8.5K bytes - Viewed (0)