### Lookup-Bind

A low-privilege read-only LDAP service account is configured in the MinIO server by providing the account's Distinguished Name (DN) and password. This service account is used to perform directory lookups as needed.

```
MINIO_IDENTITY_LDAP_LOOKUP_BIND_DN*          (string)    DN for LDAP read-only service account used to perform DN and group lookups

        if (this.treeHandle != null && this.treeHandle.isConnected()) {
            // Connection is still valid - reuse it
            return this.treeHandle.acquire();
        }

        // Clean up old handle if needed
        final SmbTreeHandleImpl oldHandle = this.treeHandle;
        if (oldHandle != null) {
            if (this.transportContext.getConfig().isStrictResourceLifecycle()) {
                oldHandle.release();

     * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
     * spent a lot of time benchmarking your specific needs, use one of those instead. (However, we
     * do not currently offer a {@link Multimap} implementation based on {@link
     * java.util.ArrayDeque}.)
     */

     * outperform {@code LinkedList} except in certain rare and specific situations. Unless you have
     * spent a lot of time benchmarking your specific needs, use one of those instead. (However, we
     * do not currently offer a {@link Multimap} implementation based on {@link
     * java.util.ArrayDeque}.)
     */

   * at {@code node} and ending at {@code v}. This implementation includes {@code node} as the first
   * element in the result.
   *
   * <p>If needed, the {@link Traverser} class provides more flexible and lighter-weight ways to
   * list the nodes reachable from a given node or nodes. See the <a

   * bulkGet(keys)} with a relative large number of keys can cause an excessive number of shared
   * stripes (much like the birthday paradox, where much fewer than anticipated birthdays are needed
   * for a pair of them to match). Please consider carefully the implications of the number of
   * stripes, the intended concurrency level, and the typical number of keys used in a {@code

   * at {@code node} and ending at {@code v}. This implementation includes {@code node} as the first
   * element in the result.
   *
   * <p>If needed, the {@link Traverser} class provides more flexible and lighter-weight ways to
   * list the nodes reachable from a given node or nodes. See the <a

    Smb2CreateRequest request = new Smb2CreateRequest();
    request.setPath(handle.path);
    request.addReconnectContext(handle.fileId);
    
    // Add lease context if needed
    if (handle.leaseKey != null) {
        request.addLeaseContext(handle.leaseKey, Smb2LeaseState.SMB2_LEASE_NONE, false);
    }
    
    Smb2CreateResponse response = (Smb2CreateResponse) tree.send(request);
    

		nsUnlocker = func() { lock.RUnlock(lkctx) }
		unlockOnDefer = true
	}

	checkPrecondFn := opts.CheckPrecondFn
	opts.CheckPrecondFn = nil // do not need to apply pre-conditions at lower layer.
	opts.NoLock = true        // no locks needed at lower levels for getObjectInfo()
	objInfo, zIdx, err := z.getLatestObjectInfoWithIdx(ctx, bucket, object, opts)
	if err != nil {
		if objInfo.DeleteMarker {

     *
     * @param accessResultList the list of access results to clean up
     * @return the time taken for the cleanup operation in milliseconds, or -1 if no cleanup was needed
     */
    private long cleanupAccessResults(final List<OpenSearchAccessResult> accessResultList) {
        if (!accessResultList.isEmpty()) {
            final long execTime = systemHelper.getCurrentTimeAsLong();