session.release();
                        } else {
                            session.acquire();
                            // Hold for a bit
                            Thread.sleep(1);
                            session.release();
                        }
                    }
                } catch (Exception e) {

      return array.length;
    }
  }

  /**
   * Implementation of Striped where up to 2^k stripes can be represented, using an
   * AtomicReferenceArray of size 2^k. To map a user key into a stripe, we take a k-bit slice of the
   * user key's (smeared) hashCode(). The stripes are lazily initialized and are weakly referenced.
   */
  @VisibleForTesting
  static final class SmallLazyStriped<L> extends PowerOfTwoStriped<L> {

        // sid (2 bytes)
        buffer[0] = 0x01;
        buffer[1] = 0x00;
        // numEntries (2 bytes)
        buffer[2] = 0x05;
        buffer[3] = 0x00;
        // isEndOfSearch (2 bytes, bit 0 of first byte)
        buffer[4] = 0x01; // end of search = true
        buffer[5] = 0x00;
        // eaErrorOffset (2 bytes)
        buffer[6] = 0x00;
        buffer[7] = 0x00;
        // lastNameOffset (2 bytes)

            requiresNotEc2Agent()
            requiresNotSharedHost()
        }

    /*
     To avoid unnecessary rerun, what we do here is a bit complicated:

     1. Build a Gradle distribution with a fixed timestamp and hash it, but never use this distribution.
     2. Build a Gradle distribution with this hash as a version + fixed timestamp -> dogfood-first

        assertTrue(s.contains(",informationLevel=0x104"), "toString should include information level 0x104");
        assertTrue(s.contains(",resumeKey=0x0304"), "toString should include lower 16-bit resumeKey hex");
        assertTrue(s.contains(",flags=0x00"), "toString should include flags in hex");
        assertTrue(s.endsWith("]"), "toString should end with closing bracket");
    }

  // array. The top bits of this value are the remaining bits of the hash value that were not used
  // in the short hash. We saw that a mask of 0x7f would keep the 7-bit value 0x6f from a full
  // hashcode of 0x89abcdef. The imaginary `hash` value would then be the remaining top 25 bits,
  // 0x89abcd80. To this is added (or'd) the `next` value, which is an index within `entries`

   * Evaluates whether the argument is an ISATAP address.
   *
   * <p>From RFC 5214: "ISATAP interface identifiers are constructed in Modified EUI-64 format [...]
   * by concatenating the 24-bit IANA OUI (00-00-5E), the 8-bit hexadecimal value 0xFE, and a 32-bit
   * IPv4 address in network byte order [...]"
   *
   * <p>For more on ISATAP addresses see section 6.1 of <a target="_parent"

        assertThrows(IllegalArgumentException.class, () -> new PercentEscaper(" ", true));
    assertThat(expected).hasMessageThat().isEqualTo(msg);
  }

  /** Helper to manually escape a 7-bit ascii character */
  private String escapeAscii(char c) {
    Preconditions.checkArgument(c < 128);
    String hex = "0123456789ABCDEF";
    return "%" + hex.charAt((c >> 4) & 0xf) + hex.charAt(c & 0xf);
  }

/**
 * DCE/RPC handle implementation for named pipe communications.
 * This class provides DCE/RPC communication over SMB named pipes.
 */
public class DcerpcPipeHandle extends DcerpcHandle {

    /* This 0x20000 bit is going to get chopped! */
    final static int pipeFlags = 0x2019F << 16 | SmbPipeResource.PIPE_TYPE_RDWR | SmbPipeResource.PIPE_TYPE_DCE_TRANSACT;

    private final SmbNamedPipe pipe;

		return false
	case cache.finished() && time.Since(cache.lastHandout) > 5*metacacheMaxClientWait:
		// Keep for 15 minutes after we last saw the client.
		// Since the cache is finished keeping it a bit longer doesn't hurt us.
		return false
	case cache.status == scanStateError || cache.status == scanStateNone:
		// Remove failed listings after 5 minutes.
		return time.Since(cache.lastUpdate) > 5*time.Minute
	}