- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 166 for Locks (0.13 sec)
-
internal/lsync/lrwmutex.go
// A LRWMutex is a mutual exclusion lock with timeouts. type LRWMutex struct { id string source string isWriteLock bool ref int mu sync.Mutex // Mutex to prevent multiple simultaneous locks } // NewLRWMutex - initializes a new lsync RW mutex. func NewLRWMutex() *LRWMutex { return &LRWMutex{} } // Lock holds a write lock on lm. // // If the lock is already in use, the calling go routineRegistered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Sun Jan 02 17:15:06 UTC 2022 - 4.8K bytes - Viewed (0) -
doc/godebug.md
distribution that disables transparent huge pages altogether. Go 1.22 added contention on runtime-internal locks to the [`mutex` profile](/pkg/runtime/pprof#Profile). Contention on these locks is always reported at `runtime._LostContendedRuntimeLock`. Complete stack traces of runtime locks can be enabled with the [`runtimecontentionstacks` setting](/pkg/runtime#hdr-Environment_Variables). These stack traces have
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Wed Dec 03 00:18:09 UTC 2025 - 24.7K bytes - Viewed (0) -
cmd/metacache-manager.go
"github.com/minio/minio/internal/logger" ) // localMetacacheMgr is the *local* manager for this peer. // It should never be used directly since buckets are // distributed deterministically. // Therefore no cluster locks are required. var localMetacacheMgr = &metacacheManager{ buckets: make(map[string]*bucketMetacache), trash: make(map[string]metacache), } type metacacheManager struct { mu sync.RWMutex init sync.OnceRegistered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Tue Oct 25 00:44:15 UTC 2022 - 5.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Queues.java
int added = 0; while (added < numElements) { // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple // elements already available (e.g. LinkedBlockingQueue#drainTo locks only once) added += q.drainTo(buffer, numElements - added); if (added < numElements) { // not enough elements immediately available; will have to poll E e = q.poll(deadline - System.nanoTime(), NANOSECONDS);Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Nov 04 17:24:58 UTC 2025 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Uninterruptibles.java
import java.util.concurrent.Future; import java.util.concurrent.Semaphore; import java.util.concurrent.TimeUnit; import java.util.concurrent.TimeoutException; import java.util.concurrent.locks.Condition; import java.util.concurrent.locks.Lock; import org.jspecify.annotations.Nullable; /** * Utilities for treating interruptible operations as uninterruptible. In all cases, if a thread is
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 19.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/InterruptibleTaskTest.java
import java.nio.channels.spi.AbstractInterruptibleChannel; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ExecutionException; import java.util.concurrent.locks.LockSupport; import junit.framework.TestCase; import org.jspecify.annotations.NullUnmarked; import org.jspecify.annotations.Nullable; @NullUnmarked public final class InterruptibleTaskTest extends TestCase {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 7.1K bytes - Viewed (0) -
cmd/metacache.go
} // keepAlive will continuously update lastHandout until ctx is canceled. func (m metacache) keepAlive(ctx context.Context, rpc *peerRESTClient) { // we intentionally operate on a copy of m, so we can update without locks. t := time.NewTicker(metacacheMaxClientWait / 10) defer t.Stop() for { select { case <-ctx.Done(): // Request is done, stop updating. return case <-t.C: m.lastHandout = time.Now()
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Jul 12 16:23:16 UTC 2024 - 6K bytes - Viewed (0) -
docs/smb3-features/01-smb3-lease-design.md
} } ``` ### 4.3 Lease Manager ```java package jcifs.internal.smb2.lease; import java.util.concurrent.ConcurrentHashMap; import java.util.concurrent.locks.ReadWriteLock; import java.util.concurrent.locks.ReentrantReadWriteLock; import jcifs.CIFSContext; public class LeaseManager { private final ConcurrentHashMap<Smb2LeaseKey, LeaseEntry> leases;Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 02:53:50 UTC 2025 - 22K bytes - Viewed (0) -
guava/src/com/google/common/collect/Queues.java
int added = 0; while (added < numElements) { // we could rely solely on #poll, but #drainTo might be more efficient when there are multiple // elements already available (e.g. LinkedBlockingQueue#drainTo locks only once) added += q.drainTo(buffer, numElements - added); if (added < numElements) { // not enough elements immediately available; will have to poll E e = q.poll(deadline - System.nanoTime(), NANOSECONDS);Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Nov 04 17:24:58 UTC 2025 - 18K bytes - Viewed (0) -
docs/smb3-features/04-directory-leasing-design.md
} } ``` ### 4.2 Directory Cache Entry ```java package jcifs.internal.smb2.lease; import java.util.concurrent.ConcurrentHashMap; import java.util.concurrent.locks.ReadWriteLock; import java.util.concurrent.locks.ReentrantReadWriteLock; public class DirectoryCacheEntry { private final String directoryPath; private final Smb2LeaseKey leaseKey; private final long createTime;Registered: Sat Dec 20 13:44:44 UTC 2025 - Last Modified: Sat Aug 16 02:53:50 UTC 2025 - 36.2K bytes - Viewed (0)