return current;
    }

    public void setCurrent(int current) {
        this.current = current;
    }

    /**
     * Allocate an available port
     *
     * @return the port that was allocated
     */
    int allocate() {
        try {
            lock.lock();
            return getAvailablePort();
        } finally {
            lock.unlock();
        }
    }

    /**

        netdfs.DfsInfo1 info1 = new netdfs.DfsInfo1();
        info1.entry_path = "test_path";

        ByteArrayOutputStream bos = new ByteArrayOutputStream();
        // Create buffer for encoding - initially allocate some space
        byte[] encodeBuffer = new byte[1024];
        NdrBuffer dst = new NdrBuffer(encodeBuffer, 0);
        info1.encode(dst);

        ByteArrayInputStream bis = new ByteArrayInputStream(bos.toByteArray());

        this.totalAllocated = new AtomicLong();
        this.totalReleased = new AtomicLong();

        // Pre-allocate buffer pool
        initializeBufferPool();
    }

    /**
     * Initialize the buffer pool with pre-allocated regions
     */
    private void initializeBufferPool() {
        // Allocate send buffers
        for (int i = 0; i < initialSendBuffers; i++) {
            try {

// until any memory allocated from it is no longer needed.
//
// An Arena must never be used concurrently by multiple goroutines.
type Arena struct {
	a unsafe.Pointer
}

// NewArena allocates a new arena.
func NewArena() *Arena {
	return &Arena{a: runtime_arena_newArena()}
}

// Free frees the arena (and all objects allocated from the arena) so that

        this.totalAllocated = new AtomicLong();
        this.totalReleased = new AtomicLong();
        
        // Pre-allocate buffer pool
        initializeBufferPool();
    }
    
    private void initializeBufferPool() {
        // Allocate send buffers
        for (int i = 0; i < initialSendBuffers; i++) {
            try {

     * 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();

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

        assertTrue(bufferManager.getTotalAllocated() > initialAllocated, "Total allocated should increase");

  }

  fun assertRequests(vararg expectedHosts: String?) {
    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 {

 *
 * <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

            assertTrue(initialAllocated >= 2, "Should have allocated at least 2 regions");
            assertTrue(initialActive >= 2, "Should have at least 2 active regions");

            // Test buffer release and reuse
            bufferManager.releaseSendRegion(sendRegion);
            bufferManager.releaseReceiveRegion(recvRegion);

            // Allocate again to test pooling