/*
 * Copyright 2012-2025 CodeLibs Project and the Others.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,

/*
 * Copyright (C) 2011 The Guava Authors
 *
 * Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
 * in compliance with the License. You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software distributed under the License

            final ASN1ObjectIdentifier[] rm = tinit.getMechanisms();
            this.remoteMechs = rm;
            final ASN1ObjectIdentifier prefMech = rm[0];
            // only use token if the optimistic mechanism is supported
            if (this.mechContext.isSupported(prefMech)) {
                inputToken = tinit.getMechanismToken();
            } else {

/*
 * Copyright 2012-2025 CodeLibs Project and the Others.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,

     * Buffer for deferred data processing.
     */
    public NdrBuffer deferred;

    /**
     * Constructs an NdrBuffer with the specified byte array and starting position.
     *
     * @param buf the byte array to use as the buffer
     * @param start the starting position in the buffer
     */
    public NdrBuffer(final byte[] buf, final int start) {
        this.buf = buf;
        this.start = this.index = start;

        offset += 4;
        SMBUtil.writeInt2(bytesPerSect, buffer, offset);

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

        // Verify calculations use long arithmetic to avoid overflow
        long expectedCapacity = (long) alloc * sectPerAlloc * bytesPerSect;
        assertEquals(expectedCapacity, smbInfoAllocation.getCapacity());

        assertEquals(expectedLength, ndrBuffer.getIndex());

        // Test null string (should encode as 0 length)
        ndrBuffer.reset();
        ndrBuffer.enc_ndr_referent(null, 2); // Use referent to encode null
        assertEquals(4, ndrBuffer.getIndex());
        assertEquals(4, ndrBuffer.getLength());
        assertEquals(0, Encdec.dec_uint32le(buffer, 0)); // Should be 0 for null referent
    }

/*
 * Copyright 2012-2025 CodeLibs Project and the Others.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,

/*
 * Copyright 2012-2025 CodeLibs Project and the Others.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,

/*
 * Copyright 2012-2025 CodeLibs Project and the Others.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,