when(response.getHeaderStart()).thenReturn(0);

        // Write FileFsSizeInformation data (24 bytes)
        SMBUtil.writeInt8(1000000, buffer, 20); // Total allocation units
        SMBUtil.writeInt8(500000, buffer, 28); // Available allocation units
        SMBUtil.writeInt4(512, buffer, 36); // Sectors per unit
        SMBUtil.writeInt4(4096, buffer, 40); // Bytes per sector

            // Change Time (8 bytes)
            long changeTime = creationTime + 3000000L;
            SMBUtil.writeInt8(changeTime, buffer, bufferIndex + 32);
            // Allocation Size (8 bytes)
            SMBUtil.writeInt8(4096, buffer, bufferIndex + 40);
            // End of File (8 bytes)
            SMBUtil.writeInt8(1024, buffer, bufferIndex + 48);
            // File Attributes (4 bytes)

        assertTrue(result.contains("sectPerAlloc=" + sectPerAlloc));
        assertTrue(result.contains("bytesPerSect=" + bytesPerSect));
    }

    @Test
    @DisplayName("Test decode with single sector per allocation")
    void testDecodeWithSingleSectorPerAllocation() throws SMBProtocolDecodingException {
        // Prepare test data with sectPerAlloc = 1
        byte[] buffer = new byte[22];
        int idFileSystem = 0x11111111;

        RdmaProvider provider = RdmaProviderFactory.selectBestProvider();

        try (RdmaBufferManager bufferManager = new RdmaBufferManager(provider)) {
            // Test basic buffer allocation
            RdmaMemoryRegion sendRegion = bufferManager.getSendRegion(4096);
            assertNotNull(sendRegion, "Send region should not be null");

 * traditional {@code LinkedHashMap} implementation which stores keys and count values as map
 * entries, {@code ObjectCountLinkedHashMap} minimizes object allocation and reduces memory
 * footprint.
 */
@GwtCompatible
@NullMarked
final class ObjectCountLinkedHashMap<K extends @Nullable Object> extends ObjectCountHashMap<K> {

     * The total length of this DCERPC message
     */
    protected int length = 0;
    /**
     * The call ID for matching requests and responses
     */
    protected int call_id = 0;
    /**
     * The allocation hint for buffer sizing
     */
    protected int alloc_hint = 0;
    /**
     * The result code of the DCERPC operation
     */
    protected int result = 0;

    /**
     * Checks if a specific flag is set

    }

    /**
     * @return the lastWriteTime
     */
    @Override
    public final long getLastWriteTime() {
        return this.lastWriteTime;
    }

    /**
     * Gets the allocation size.
     *
     * @return the allocationSize
     */
    public final long getAllocationSize() {
        return this.allocationSize;
    }

    /**
     * Gets the end of file position.

be inefficient for allocating only small amounts of small Go values. They're
best used in bulk, on the order of MiB of memory allocated on each use.

Note that by allowing for this limited form of manual memory allocation
that use-after-free bugs are possible with regular Go values. This package
limits the impact of these use-after-free bugs by preventing reuse of freed
memory regions until the garbage collector is able to determine that it is

 * order. Any removal invalidates any ordering guarantees.
 *
 * <p>This class should not be assumed to be universally superior to {@code java.util.HashSet}.
 * Generally speaking, this class reduces object allocation and memory consumption at the price of
 * moderately increased constant factors of CPU. Only use this class when there is a specific reason
 * to prioritize memory over CPU.
 *
 * @author Dimitris Andreou

 * guarantees.
 *
 * <p>This class should not be assumed to be universally superior to {@code java.util.HashMap}.
 * Generally speaking, this class reduces object allocation and memory consumption at the price of
 * moderately increased constant factors of CPU. Only use this class when there is a specific reason
 * to prioritize memory over CPU.
 *
 * @author Louis Wasserman