for (int i = 8; i < 16; i++) {
            buffer[i] = (byte) (i * 2);
        }

        // Mock number of links (4 bytes)
        buffer[16] = 0x01;
        buffer[17] = 0x00;
        buffer[18] = 0x00;
        buffer[19] = 0x00;

        // Mock delete pending and directory flags
        buffer[20] = 0x00;
        buffer[21] = 0x00;

        return buffer;
    }

        assertEquals((byte) 0xEF, buffer[0]); // Little-endian
        assertEquals((byte) 0xCD, buffer[1]);
        assertEquals((byte) 0xAB, buffer[2]);
        assertEquals((byte) 0x89, buffer[3]);
        assertEquals((byte) 0x67, buffer[4]);
        assertEquals((byte) 0x45, buffer[5]);
        assertEquals((byte) 0x23, buffer[6]);
        assertEquals((byte) 0x01, buffer[7]);

        ndrBuffer.setIndex(0);

      to.append(buf);
      total += buf.remaining();
      Java8Compatibility.clear(buf);
    }
    return total;
  }

  // TODO(lukes): consider allowing callers to pass in a buffer to use, some callers would be able
  // to reuse buffers, others would be able to size them more appropriately than the constant
  // defaults

  /**
   * Copies all characters between the {@link Reader} and {@link StringBuilder} objects. Does not

            byte[] buffer = new byte[24];
            buffer[4] = 0x04; // sectPerAlloc = 4
            buffer[8] = 0x00;
            buffer[9] = 0x20; // alloc = 8192
            buffer[16] = 0x00;
            buffer[17] = 0x04; // bytesPerSect = 1024

            smbInfoAllocation.decode(buffer, 0, buffer.length);

        // For GCM, last 4 bytes should contain incrementing counter
        ByteBuffer buffer1 = ByteBuffer.wrap(nonce1, 12, 4).order(java.nio.ByteOrder.LITTLE_ENDIAN);
        ByteBuffer buffer2 = ByteBuffer.wrap(nonce2, 12, 4).order(java.nio.ByteOrder.LITTLE_ENDIAN);
        int counter1 = buffer1.getInt();
        int counter2 = buffer2.getInt();

        assertEquals(counter1 + 1, counter2, "Counter should increment between nonces");

        buffer[offset + 2] = 0x00;
        buffer[offset + 3] = 0x00;
        buffer[offset + 4] = 0x00;
        buffer[offset + 5] = 0x00;
        buffer[offset + 6] = 0x00;
        buffer[offset + 7] = 0x01;
        // Sub-authority
        SMBUtil.writeInt4(0, buffer, offset + 8);
    }

    private void prepareDaclHeader(byte[] buffer, int offset, int aceCount) {
        buffer[offset] = 0x02; // revision

			if p.buf[bufIdx] == nil {
				// Reading first time on this disk, hence the buffer needs to be allocated.
				// Subsequent reads will reuse this buffer.
				p.buf[bufIdx] = make([]byte, p.shardSize)
			}
			// For the last shard, the shardsize might be less than previous shard sizes.
			// Hence the following statement ensures that the buffer size is reset to the right size.
			p.buf[bufIdx] = p.buf[bufIdx][:p.shardSize]

    }

    /**
     * Data transfer object representing JVM buffer pool statistics.
     */
    public static class JvmPoolObj {
        /**
         * Default constructor.
         */
        public JvmPoolObj() {
            // Default constructor
        }

        /** Buffer pool name */
        public String key;
        /** Number of buffers */
        public long count;

                    return buf;
                }, StringIndexOutOfBoundsException.class));
    }

    @ParameterizedTest(name = "{0}")
    @MethodSource("invalidBuffers")
    @DisplayName("Invalid buffers throw appropriate exceptions")
    void invalidInputsThrow(String name, Object bufferSupplierOrBytes, Class<? extends Throwable> expected) {
        // Arrange
        byte[] buf;

                    }
                }
            }
        } catch (IOException e) {
            throw new PACDecodingException("Malformed PAC", e);
        }

        if (this.serverSignature == null || this.kdcSignature == null || this.logonInfo == null) {
            throw new PACDecodingException("Missing required buffers");
        }