- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 30 for dequeue1 (0.17 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/runtime/chan.go
// The value ep sent by the sender is copied to the receiver sg. // The receiver is then woken up to go on its merry way. // Channel c must be empty and locked. send unlocks c with unlockf. // sg must already be dequeued from c. // ep must be non-nil and point to the heap or the caller's stack. func send(c *hchan, sg *sudog, ep unsafe.Pointer, unlockf func(), skip int) { if raceenabled { if c.dataqsiz == 0 { racesync(c, sg)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:16:50 UTC 2024 - 25.9K bytes - Viewed (0) -
src/runtime/sema.go
panic("semaRoot queue") } root.rotateLeft(s.parent) } } } // dequeue searches for and finds the first goroutine // in semaRoot blocked on addr. // If the sudog was being profiled, dequeue returns the time // at which it was woken up as now. Otherwise now is 0. // If there are additional entries in the wait list, dequeue // returns tailtime set to the last entry's acquiretime.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 19K bytes - Viewed (0) -
pkg/scheduler/framework/interface.go
// and Pods rejected by these plugins are requeued based on this extension point. // Failures from other extension points are regarded as temporal errors (e.g., network failure), // and the scheduler requeue Pods without this extension point - always requeue Pods to activeQ after backoff. // This is because such temporal errors cannot be resolved by specific cluster events,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 15:52:16 UTC 2024 - 35.4K bytes - Viewed (0) -
pkg/controller/cronjob/utils.go
return earliestTime, nil, missedSchedules, nil } return earliestTime, &mostRecentTime, missedSchedules, nil } // nextScheduleTimeDuration returns the time duration to requeue based on // the schedule and last schedule time. It adds a 100ms padding to the next requeue to account // for Network Time Protocol(NTP) time skews. If the time drifts the adjustment, which in most
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 09 03:34:25 UTC 2024 - 10.7K bytes - Viewed (0) -
pkg/controller/statefulset/stateful_set.go
if err != nil { utilruntime.HandleError(fmt.Errorf("couldn't get key for object %#v: %v", ss, err)) return } ssc.queue.AddAfter(key, duration) } // processNextWorkItem dequeues items, processes them, and marks them done. It enforces that the syncHandler is never // invoked concurrently with the same key. func (ssc *StatefulSetController) processNextWorkItem(ctx context.Context) bool {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 05 19:06:41 UTC 2024 - 18.5K bytes - Viewed (0) -
pkg/controller/cronjob/cronjob_controllerv2.go
switch { case errors.IsNotFound(err): // may be cronjob is deleted, don't need to requeue this key logger.V(4).Info("CronJob not found, may be it is deleted", "cronjob", klog.KObj(cronJob), "err", err) return nil, nil case err != nil: // for other transient apiserver error requeue with exponential backoff return nil, err } jobsToBeReconciled, err := jm.getJobsToBeReconciled(cronJob)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 09 03:34:25 UTC 2024 - 29.2K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 58.9K bytes - Viewed (0) -
src/runtime/export_test.go
s.acquiretime = 0 s.ticket = 0 t.semTable.rootFor(addr).queue(addr, s, false) } // Dequeue simulates dequeuing a waiter for a semaphore (or lock) at addr. // // Returns true if there actually was a waiter to be dequeued. func (t *SemTable) Dequeue(addr *uint32) bool { s, _, _ := t.semTable.rootFor(addr).dequeue(addr) if s != nil { releaseSudog(s) return true } return false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
pkg/controller/job/job_controller_test.go
type fakeRateLimitingQueue struct { workqueue.TypedInterface[string] requeues int item string duration time.Duration } func (f *fakeRateLimitingQueue) AddRateLimited(item string) {} func (f *fakeRateLimitingQueue) Forget(item string) { f.requeues = 0 } func (f *fakeRateLimitingQueue) NumRequeues(item string) int { return f.requeues }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Jun 11 15:36:36 UTC 2024 - 229.2K bytes - Viewed (0)