- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 135 for Dequeue (0.37 sec)
-
pilot/pkg/xds/pushqueue_test.go
t.Parallel() p := NewPushQueue() defer p.ShutDown() p.Enqueue(proxies[0], &model.PushRequest{}) p.Enqueue(proxies[1], &model.PushRequest{}) ExpectDequeue(t, p, proxies[0]) ExpectDequeue(t, p, proxies[1]) }) t.Run("remove too many", func(t *testing.T) { t.Parallel() p := NewPushQueue() defer p.ShutDown() p.Enqueue(proxies[0], &model.PushRequest{}) ExpectDequeue(t, p, proxies[0])
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Apr 30 00:26:45 UTC 2024 - 8.8K bytes - Viewed (0) -
src/runtime/sema.go
if s.parent.next != s { 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) -
src/runtime/chan.go
// its item at the tail of the queue. Since the // queue is full, those are both the same slot. qp := chanbuf(c, c.recvx) if raceenabled { racenotify(c, c.recvx, nil) racenotify(c, c.recvx, sg) } // copy data from queue to receiver if ep != nil { typedmemmove(c.elemtype, ep, qp) } // copy data from sender to queue typedmemmove(c.elemtype, qp, sg.elem) c.recvx++
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/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) -
tensorflow/c/c_api_experimental.cc
if (dequeue_op == nullptr) { status->status = tensorflow::errors::Internal( "Unable to find the dequeue node in the TF graph."); return nullptr; } VLOG(1) << "Running the dequeue op"; TF_Output output{dequeue_op, 0}; TF_Tensor* ret; TF_SessionRun(session, /*run_options*/ nullptr, // input related parameters
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Apr 15 03:35:10 UTC 2024 - 29.4K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/ResolveState.java
return selectorState; } @Nullable public NodeState peek() { return queue.isEmpty() ? null : queue.getFirst(); } public NodeState pop() { NodeState next = queue.removeFirst(); return next.dequeue(); } /**
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri Jun 07 14:19:34 UTC 2024 - 16.7K bytes - Viewed (0) -
platforms/software/dependency-management/src/main/java/org/gradle/api/internal/artifacts/ivyservice/resolveengine/graph/builder/NodeState.java
} // the enqueue and dequeue methods are used for performance reasons // in order to avoid tracking the set of enqueued nodes boolean enqueue() { if (queued) { return false; } queued = true; return true; } NodeState dequeue() { queued = false; return this; }
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
type SemTable struct { semTable } // Enqueue simulates enqueuing a waiter for a semaphore (or lock) at addr. func (t *SemTable) Enqueue(addr *uint32) { s := acquireSudog() s.releasetime = 0 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. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
pilot/pkg/xds/discovery.go
// Get the next proxy to push. This will block if there are no updates required. client, push, shuttingdown := queue.Dequeue() if shuttingdown { return } recordPushTriggers(push.Reason) // Signals that a push is done by reading from the semaphore, allowing another send on it. doneFunc := func() { queue.MarkDone(client) <-semaphore } proxiesQueueTime.Record(time.Since(push.Start).Seconds())
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed May 15 20:21:09 UTC 2024 - 19K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/internal/passes/tpu_cluster_formation.cc
// device. Device attribute is used to infer the appropriate sharding // within TPUs for this op. // TODO(b/183598857): Use explicit sharding ops from the front-end. // For example, dequeue ops generated by // tensorflow/python/tpu/tpu_feed.py if (!tensorflow::IsTPUReplicatedCore(attr.getValue())) { inner_op->removeAttr(kDeviceAttr); } } }); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu May 02 22:03:30 UTC 2024 - 39.3K bytes - Viewed (0)