* Test that buffer cache handles allocation when cache is full.
     */
    @Test
    public void testBufferAllocationWhenCacheFull() {
        // Given - Allocate many buffers to potentially fill the cache
        List<byte[]> buffers = new ArrayList<>();

        // Allocate more buffers than cache can hold
        for (int i = 0; i < 20; i++) {
            byte[] buffer = BufferCache.getBuffer();

    return CharBuffer.allocate(generateInt());
  }

  @Generates
  ByteBuffer generateByteBuffer() {
    return ByteBuffer.allocate(generateInt());
  }

  @Generates
  ShortBuffer generateShortBuffer() {
    return ShortBuffer.allocate(generateInt());
  }

  @Generates
  IntBuffer generateIntBuffer() {
    return IntBuffer.allocate(generateInt());
  }

  @Generates

    }

    @Test
    public void testStatistics() throws Exception {
        long initialAllocated = bufferManager.getTotalAllocated();

        // Allocate regions larger than pool buffer size to force new allocations
        RdmaMemoryRegion region1 = bufferManager.getSendRegion(131072); // 128KB > 64KB pool size

 *
 * <p>{@link CharStreams#copy} has type specific optimizations for various common Appendable and
 * Reader implementations, this compares the performance of the different options.
 */
// These benchmarks allocate a lot of data so use a large heap
@VmOptions({"-Xms12g", "-Xmx12g", "-d64"})
@NullUnmarked
public class CharStreamsCopyBenchmark {
  enum CopyStrategy {
    OLD {
      @Override

    }

    @Test
    void testWriteULong() {
        // Test writeULong
        byte[] data = new byte[4];
        ByteBuffer expectedBuffer = ByteBuffer.allocate(4).order(ByteOrder.LITTLE_ENDIAN);

        // Test with a positive value
        int value = 0x12345678;
        NtlmMessage.writeULong(data, 0, value);
        expectedBuffer.putInt(0, value);

     * {@link NtTransQuerySecurityDesc#writeParametersWireFormat(byte[], int)}.
     */
    private static byte[] expectedParameters(int fid, int securityInformation) {
        ByteBuffer bb = ByteBuffer.allocate(8).order(ByteOrder.LITTLE_ENDIAN);
        bb.putShort((short) fid);
        bb.put((byte) 0x00); // Reserved
        bb.put((byte) 0x00); // Reserved
        bb.putInt(securityInformation);
        return bb.array();

class PacSignatureTest {

    /**
     * Helper method to write integer in little-endian format.
     */
    private void writeLittleEndianInt(ByteArrayOutputStream baos, int value) {
        ByteBuffer buffer = ByteBuffer.allocate(4);
        buffer.order(ByteOrder.LITTLE_ENDIAN);
        buffer.putInt(value);
        baos.write(buffer.array(), 0, 4);
    }

    /**
     * Test constructor with KERB_CHECKSUM_HMAC_MD5 type.
     *

    assertThat(requestedHosts).containsExactly(*expectedHosts)
    requestedHosts.clear()
  }

  /** Allocates and returns `count` fake IPv4 addresses like [255.0.0.100, 255.0.0.101].  */
  fun allocate(count: Int): List<InetAddress> {
    val from = nextAddress
    nextAddress += count
    return (from until nextAddress)
      .map {
        return@map InetAddress.getByAddress(

	// Since the number of directory records is not validated, it is not
	// safe to preallocate r.File without first checking that the specified
	// number of files is reasonable, since a malformed archive may
	// indicate it contains up to 1 << 128 - 1 files. Since each file has a
	// header which will be _at least_ 30 bytes we can safely preallocate
	// if (data size / 30) >= end.directoryRecords.

            bufferManager.releaseSendRegion(sendRegion);
            bufferManager.releaseReceiveRegion(recvRegion);

            // Allocate again to test pooling
            RdmaMemoryRegion newSendRegion = bufferManager.getSendRegion(4096);
            assertNotNull(newSendRegion, "Should be able to allocate new send region");

            // Release the new region
            bufferManager.releaseSendRegion(newSendRegion);