- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 26 for lock1 (0.07 sec)
-
src/runtime/mheap.go
// allocate a new arena. lock(&gcBitsArenas.lock) // Try the head arena again, since it may have changed. Now // that we hold the lock, the list head can't change, but its // free position still can. if p := gcBitsArenas.next.tryAlloc(bytesNeeded); p != nil { unlock(&gcBitsArenas.lock) return p } // Allocate a new arena. This may temporarily drop the lock. fresh := newArenaMayUnlock()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:31:00 UTC 2024 - 78K bytes - Viewed (0) -
pkg/scheduler/internal/queue/scheduling_queue.go
func (p *PriorityQueue) Close() { p.lock.Lock() defer p.lock.Unlock() close(p.stop) p.closed = true p.cond.Broadcast() } // DeleteNominatedPodIfExists deletes <pod> from nominatedPods. func (npm *nominator) DeleteNominatedPodIfExists(pod *v1.Pod) { npm.lock.Lock() npm.deleteNominatedPodIfExistsUnlocked(pod) npm.lock.Unlock() }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 13:26:09 UTC 2024 - 61.4K bytes - Viewed (0) -
pkg/volume/testing/testing.go
func (plugin *FakeVolumePlugin) NewMounter(spec *volume.Spec, pod *v1.Pod, opts volume.VolumeOptions) (volume.Mounter, error) { plugin.Lock() defer plugin.Unlock() if spec.Name() == FailNewMounter { return nil, fmt.Errorf("AlwaysFailNewMounter") } fakeVolume := plugin.getFakeVolume(&plugin.Mounters) fakeVolume.Lock() defer fakeVolume.Unlock() fakeVolume.PodUID = pod.UID fakeVolume.VolName = spec.Name() fakeVolume.Plugin = plugin
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 12:32:15 UTC 2024 - 53.3K bytes - Viewed (0) -
guava/src/com/google/common/util/concurrent/AbstractFuture.java
* cancelled without a call to {@code cancel}, such as by calling {@code * setFuture(cancelledFuture)}. * * <p>Beware of completing a future while holding a lock. Its listeners may do slow work or * acquire other locks, risking deadlocks. */ @CanIgnoreReturnValue @Override public boolean cancel(boolean mayInterruptIfRunning) { Object localValue = value; boolean rValue = false;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 62.8K bytes - Viewed (1) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
* cancelled without a call to {@code cancel}, such as by calling {@code * setFuture(cancelledFuture)}. * * <p>Beware of completing a future while holding a lock. Its listeners may do slow work or * acquire other locks, risking deadlocks. */ @CanIgnoreReturnValue @Override public boolean cancel(boolean mayInterruptIfRunning) { Object localValue = value; boolean rValue = false;
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 63.1K bytes - Viewed (1) -
staging/src/k8s.io/apiserver/pkg/storage/cacher/cacher.go
} func (c *Cacher) startCaching(stopChannel <-chan struct{}) { // The 'usable' lock is always 'RLock'able when it is safe to use the cache. // It is safe to use the cache after a successful list until a disconnection. // We start with usable (write) locked. The below OnReplace function will // unlock it after a successful list. The below defer will then re-lock // it when this function exits (always due to disconnection), only if
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 12 10:12:02 UTC 2024 - 51.8K bytes - Viewed (0) -
src/runtime/malloc.go
// huge pages. We'll set all the old entries after we release the lock. lock(&h.lock) if h.arenasHugePages { unlock(&h.lock) return } h.arenasHugePages = true unlock(&h.lock) // N.B. The arenas L1 map is quite small on all platforms, so it's fine to // just iterate over the whole thing. for i := range h.arenas {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 59.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
* of reads may not be immediately reflected on the algorithm's data structures. These structures * are guarded by a lock and operations are applied in batches to avoid lock contention. The * penalty of applying the batches is spread across threads so that the amortized cost is slightly * higher than performing just the operation without enforcing the capacity constraint.
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sat May 18 03:24:34 UTC 2024 - 90.8K bytes - Viewed (0) -
pkg/controller/nodelifecycle/node_lifecycle_controller.go
// It prevents data being changed after retrieving it from the map. func (n *nodeHealthMap) getDeepCopy(name string) *nodeHealthData { n.lock.RLock() defer n.lock.RUnlock() return n.nodeHealths[name].deepCopy() } func (n *nodeHealthMap) set(name string, data *nodeHealthData) { n.lock.Lock() defer n.lock.Unlock() n.nodeHealths[name] = data } type podUpdateItem struct { namespace string name string }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 04 18:33:12 UTC 2024 - 51.6K bytes - Viewed (0) -
src/runtime/mgc.go
mheap_.reclaimIndex.Store(0) mheap_.reclaimCredit.Store(0) unlock(&mheap_.lock) sweep.centralIndex.clear() if !concurrentSweep || mode == gcForceBlockMode { // Special case synchronous sweep. // Record that no proportional sweeping has to happen. lock(&mheap_.lock) mheap_.sweepPagesPerByte = 0 unlock(&mheap_.lock) // Flush all mcaches. for _, pp := range allp {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 62K bytes - Viewed (0)