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();
    }
    
    private void initializeBufferPool() {
        // Allocate send buffers
        for (int i = 0; i < initialSendBuffers; i++) {
            try {

            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

      // it. To preserve FIFO order and failure atomicity of rejected execution when the same
      // Runnable is executed more than once, allocate a wrapper that we know is safe to remove by
      // object identity.
      // A data structure that returned a removal handle from add() would allow eliminating this
      // allocation.
      submittedTask =

    Builder(int estimatedDistinct) {
      this.contents = ObjectCountHashMap.createWithExpectedSize(estimatedDistinct);
    }

    Builder(boolean forSubtype) {
      // for ImmutableSortedMultiset not to allocate data structures not used there
      this.contents = null;
    }

    /**
     * Adds {@code element} to the {@code ImmutableMultiset}.
     *
     * @param element the element to add

	if err != nil {
		return pi, toObjectErr(err, bucket, object)
	}

	// Fetch buffer for I/O, returns from the pool if not allocates a new one and returns.
	var buffer []byte
	switch size := data.Size(); {
	case size == 0:
		buffer = make([]byte, 1) // Allocate at least a byte to reach EOF
	case size >= fi.Erasure.BlockSize || size == -1:
		if int64(globalBytePoolCap.Load().Width()) < fi.Erasure.BlockSize {

            throw new SmbException("Invalid command code: " + command);
        }
    }

    /**
     * Validate array size before allocation
     *
     * @param size array size to allocate
     * @param elementSize size of each element
     * @param maxElements maximum allowed elements
     * @throws SmbException if allocation would be too large
     */

     * copied in a single call.
     */
    @Test
    public void readBytesWireFormat_succeedsWithSingleRead() {
        DummyResponse d = new DummyResponse();
        // Allocate a transaction buffer large enough for the copy
        byte[] tx = new byte[100];
        d.txn_buf = tx;

        // Set up a scenario where the full transaction is read in one call
        d.bufParameterStart = 0;

      throws IOException {
    // Roughly size to match what has been read already. Some file systems, such as procfs, return 0
    // as their length. These files are very small, so it's wasteful to allocate an 8KB buffer.
    int initialBufferSize = min(BUFFER_SIZE, max(128, Integer.highestOneBit(totalLen) * 2));
    // Starting with an 8k buffer, double the size of each successive buffer. Smaller buffers

        // Test Error with abort flag
        String url = "http://example.com/critical-resource";
        String message = "Critical memory error during crawling";
        OutOfMemoryError error = new OutOfMemoryError("Cannot allocate memory");

        DataStoreCrawlingException exception = new DataStoreCrawlingException(url, message, error, true);

        assertEquals(url, exception.getUrl());
        assertEquals(message, exception.getMessage());