Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 113 for unlocks (0.74 sec)

  1. src/main/java/jcifs/internal/smb1/com/SmbComLockingAndX.java

            bufferIndex += 4;
    
            final int nunlocks = SMBUtil.readInt2(buffer, bufferIndex);
            this.unlocks = new LockingAndXRange[nunlocks];
            bufferIndex += 2;
    
            final int nlocks = SMBUtil.readInt2(buffer, bufferIndex);
            this.locks = new LockingAndXRange[nlocks];
            bufferIndex += 2;
            return start - bufferIndex;
        }
    
        /**
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Sat Aug 16 01:32:48 UTC 2025
    - 5.2K bytes
    - Viewed (0)
  2. src/test/java/jcifs/internal/smb1/com/SmbComLockingAndXTest.java

            setField(unlock, "byteOffset", 300L);
            setField(unlock, "lengthInBytes", 400L);
            setField(cmd, "locks", new LockingAndXRange[] { lock });
            setField(cmd, "unlocks", new LockingAndXRange[] { unlock });
            setField(cmd, "largeFile", false);
    
            byte[] buffer = new byte[20];
            int len = cmd.writeParameterWordsWireFormat(buffer, 0);
    Registered: Sat Dec 20 13:44:44 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 7.1K bytes
    - Viewed (0)
  3. internal/lsync/lrwmutex.go

    		}
    	}
    }
    
    // Unlock unlocks the write lock.
    //
    // It is a run-time error if lm is not locked on entry to Unlock.
    func (lm *LRWMutex) Unlock() {
    	isWriteLock := true
    	success := lm.unlock(isWriteLock)
    	if !success {
    		panic("Trying to Unlock() while no Lock() is active")
    	}
    }
    
    // RUnlock releases a read lock held on lm.
    //
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Jan 02 17:15:06 UTC 2022
    - 4.8K bytes
    - Viewed (0)
  4. internal/lsync/lrwmutex_test.go

    		if recover() == nil {
    			t.Fatalf("unlock of unlocked RWMutex did not panic")
    		}
    	}()
    	mu := NewLRWMutex()
    	mu.Unlock()
    }
    
    // Borrowed from rwmutex_test.go
    func TestUnlockPanic2(t *testing.T) {
    	defer func() {
    		if recover() == nil {
    			t.Fatalf("unlock of unlocked RWMutex did not panic")
    		}
    	}()
    	mu := NewLRWMutex()
    	mu.RLock()
    	mu.Unlock()
    }
    
    // Borrowed from rwmutex_test.go
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 7.8K bytes
    - Viewed (0)
  5. internal/dsync/drwmutex_test.go

    	defer func() {
    		if recover() == nil {
    			t.Fatalf("unlock of unlocked RWMutex did not panic")
    		}
    	}()
    	mu := NewDRWMutex(ds, "test")
    	mu.Unlock(t.Context())
    }
    
    // Borrowed from rwmutex_test.go
    func TestUnlockPanic2(t *testing.T) {
    	mu := NewDRWMutex(ds, "test-unlock-panic-2")
    	defer func() {
    		if recover() == nil {
    			t.Fatalf("unlock of unlocked RWMutex did not panic")
    		}
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Sun Sep 28 20:59:21 UTC 2025
    - 9.4K bytes
    - Viewed (0)
  6. internal/dsync/dsync-server_test.go

    		return false, fmt.Errorf("Unlock attempted on an unlocked entity: %s", args.Resources[0])
    	}
    	if reply = locksHeld == WriteLock; !reply { // Unless it is a write lock
    		return false, fmt.Errorf("Unlock attempted on a read locked entity: %s (%d read locks active)", args.Resources[0], locksHeld)
    	}
    	delete(l.lockMap, args.Resources[0]) // Remove the write lock
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 8.3K bytes
    - Viewed (0)
  7. internal/dsync/locker.go

    	// Do read unlock for given LockArgs. It should return
    	// * a boolean to indicate success/failure of the operation
    	// * an error on failure of unlock request operation.
    	// Canceling the context will abort the remote call.
    	// In that case, the resource may or may not be unlocked.
    	RUnlock(ctx context.Context, args LockArgs) (bool, error)
    
    	// Do write unlock for given LockArgs. It should return
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Jan 18 20:44:38 UTC 2022
    - 2.7K bytes
    - Viewed (0)
  8. cmd/metacache-manager.go

    	m.init.Do(m.initManager)
    	m.mu.Lock()
    	b, ok := m.buckets[bucket]
    	if !ok {
    		m.mu.Unlock()
    		return
    	}
    	delete(m.buckets, bucket)
    	m.mu.Unlock()
    
    	// Since deletes may take some time we try to do it without
    	// holding lock to m all the time.
    	b.mu.Lock()
    	defer b.mu.Unlock()
    	for k, v := range b.caches {
    		if time.Since(v.lastUpdate) > metacacheMaxRunningAge {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Tue Oct 25 00:44:15 UTC 2022
    - 5.2K bytes
    - Viewed (0)
  9. cmd/namespace-lock_test.go

    		}()
    		time.Sleep(1 * time.Millisecond) // wait for goroutine to advance; ref=2
    
    		// Unlock the 1st lock; ref=1 after this line
    		nsLk.unlock("volume", "path", false)
    
    		// Taking another lockMapMutex here allows queuing up additional lockers. This should
    		// not be required but makes reproduction much easier.
    		nsLk.lockMapMutex.Lock()
    
    		// lk3 blocks.
    		lk3ch := make(chan bool)
    		go func() {
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Aug 29 02:39:48 UTC 2025
    - 3K bytes
    - Viewed (0)
  10. cmd/lock-rest-server.go

    // UnlockHandler - releases the acquired lock.
    func (l *lockRESTServer) UnlockHandler(args *dsync.LockArgs) (*dsync.LockResp, *grid.RemoteErr) {
    	resp := lockRPCUnlock.NewResponse()
    	_, err := l.ll.Unlock(context.Background(), *args)
    	// Ignore the Unlock() "reply" return value because if err == nil, "reply" is always true
    	// Consequently, if err != nil, reply is always false
    	return l.makeResp(resp, err)
    }
    
    // RLockHandler - Acquires an RLock.
    Registered: Sun Dec 28 19:28:13 UTC 2025
    - Last Modified: Fri Jan 31 19:54:34 UTC 2025
    - 6.3K bytes
    - Viewed (0)
Back to top