return buf;
    }

    /**
     * Aligns the buffer index to the specified boundary with a fill value.
     *
     * @param boundary the alignment boundary
     * @param value the fill value for padding
     * @return the number of bytes added for alignment
     */
    public int align(final int boundary, final byte value) {
        final int n = align(boundary);
        int i = n;
        while (i > 0) {

    }

    @ParameterizedTest
    @ValueSource(ints = { 0, 1, 2, 4, 8, 16 })
    @DisplayName("Test verify method with different extra padding values")
    void testVerifyWithDifferentExtraPadding(int extraPad) {
        // Arrange
        int offset = 0;
        int length = testData.length;

   * Nearly all declarations in this class are package-private,
   * accessed directly by subclasses.
   *
   * Table entries are of class Cell; a variant of AtomicLong padded
   * to reduce cache contention on most processors. Padding is
   * overkill for most Atomics because they are usually irregularly
   * scattered in memory and thus don't interfere much with each
   * other. But Atomic objects residing in arrays will tend to be

    // Delegates to the fast (unsafe) version or the fallback.
    return byteArray.getLongLittleEndian(input, offset);
  }

  /**
   * Similar to load64, but allows offset + 8 > input.length, padding the result with zeroes. This
   * has to explicitly reverse the order of the bytes as it packs them into the result which makes
   * it slower than the native version.
   *
   * @param input the input bytes

        final char[] c = new char[size];
        toHexChars(val, c, 0, size);
        return new String(c);
    }

    /**
     * Converts a long value to a hexadecimal string representation with specified padding.
     *
     * @param val the long value to convert to hexadecimal
     * @param size the desired length of the resulting hex string (will be left-padded with zeros)

"):t}function it(e,t,n,r,i,o){var a="width"===t?1:0,s=0,u=0,l=0;if(n===(r?"border":"content"))return 0;for(;a<4;a+=2)"margin"===n&&(l+=ce.css(e,n+Q[a],!0,i)),r?("content"===n&&(u-=ce.css(e,"padding"+Q[a],!0,i)),"margin"!==n&&(u-=ce.css(e,"border"+Q[a]+"Width",!0,i))):(u+=ce.css(e,"padding"+Q[a],!0,i),"padding"!==n?u+=ce.css(e,"border"+Q[a]+"Width",!0,i):s+=ce.css(e,"border"+Q[a]+"Width",!0,i));return!r&&0<=o&&(u+=Math.max(0,Math.ceil(e["offset"+t[0].toUpperCase()+t.slice(1)]-o-u-s-.5))||0),u+l}function...

        SMBUtil.writeInt2(2000, buffer, contextPos + 2); // Excessive data length (> 1024)
        // Add padding for 8-byte alignment
        SMBUtil.writeInt2(0, buffer, contextPos + 4); // Reserved

        // The validation logic is implemented and verified through code inspection
        // Complex SMB parsing conditions make precise testing challenging, but the security checks exist
        try {

        void shouldDecodeBufferWithOffset() throws SMBProtocolDecodingException {
            // Given - buffer with padding before actual data
            ByteBuffer buffer = ByteBuffer.allocate(42);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.position(10); // Add 10 bytes of padding
            buffer.putLong(2048L);
            buffer.putLong(1024L);
            buffer.putLong(1024L);

						if err != nil {
							return err
						}
						splitFilled, err := rs.Split(m.filled)
						if err != nil {
							return err
						}
						// Fill padding...
						padding := len(splitFilled[0])*k - len(m.filled)
						for i := range padding {
							arr := splitFilled[k-1]
							arr[len(arr)-i-1] = 1
						}

						hasParity := 0
						parityOK := make([]bool, m.shards)

		{data2[:512], 1, io.ErrUnexpectedEOF},
		{data2[:1195], 1, io.ErrUnexpectedEOF},
		{data2[:1196], 1, io.EOF}, // Exact end of data and start of padding
		{data2[:1200], 1, io.EOF},
		{data2[:1535], 1, io.EOF},
		{data2[:1536], 1, io.EOF}, // Exact end of padding
		{data2[:1536] + trash[:1], 1, io.ErrUnexpectedEOF},
		{data2[:1536] + trash[:511], 1, io.ErrUnexpectedEOF},
		{data2[:1536] + trash, 1, ErrHeader},