results = new ServerInfo1[numEntries];
        for (int i = 0; i < numEntries; i++) {
            results[i] = e = new ServerInfo1();
            e.name = readString(buffer, bufferIndex, 16, false);
            bufferIndex += 16;
            e.versionMajor = buffer[bufferIndex] & 0xFF;
            bufferIndex++;
            e.versionMinor = buffer[bufferIndex++] & 0xFF;
            e.type = readInt4(buffer, bufferIndex);

        SMBUtil.writeInt2(this.closeFlags, dst, dstIndex + 2);
        dstIndex += 4;
        dstIndex += 4; // Reserved
        System.arraycopy(this.fileId, 0, dst, dstIndex, 16);
        dstIndex += 16;

        if (log.isDebugEnabled()) {
            log.debug(String.format("Closing %s (%s)", Hexdump.toHexString(this.fileId), this.fileName));
        }
        return dstIndex - start;
    }

	nDisks := 32
	fsDirs, err := getRandomDisks(nDisks)
	if err != nil {
		return nil, nil, err
	}

	pools := mustGetPoolEndpoints(0, fsDirs[:16]...)
	pools = append(pools, mustGetPoolEndpoints(1, fsDirs[16:]...)...)

	objLayer, _, err := initObjectLayer(context.Background(), pools)
	if err != nil {
		removeRoots(fsDirs)
		return nil, nil, err
	}
	return objLayer, fsDirs, nil
}

        byte[] buffer = new byte[byteCountValue];
        byte[] guid = new byte[16];
        for (int i = 0; i < 16; i++) {
            guid[i] = (byte) i;
        }
        System.arraycopy(guid, 0, buffer, 0, 16);
        byte[] token = new byte[10];
        for (int i = 0; i < 10; i++) {
            token[i] = (byte) (i + 16);
        }
        System.arraycopy(token, 0, buffer, 16, 10);

        currentIndex += 2;

        // Verify serverTypes
        assertEquals(testServerTypes, (dst[currentIndex] & 0xFF) | ((dst[currentIndex + 1] & 0xFF) << 8)
                | ((dst[currentIndex + 2] & 0xFF) << 16) | ((dst[currentIndex + 3] & 0xFF) << 24));
        currentIndex += 4;

        // Verify domain
        String writtenDomain = new String(dst, currentIndex, testDomain.length(), StandardCharsets.US_ASCII);

            buffer[4] = 0x08; // sectPerAlloc = 8
            buffer[8] = 0x00;
            buffer[9] = 0x10; // alloc = 4096
            buffer[12] = 0x00;
            buffer[13] = 0x08; // free = 2048
            buffer[16] = 0x00;
            buffer[17] = 0x02; // bytesPerSect = 512

            int bytesDecoded = smbInfoAllocation.decode(buffer, 0, buffer.length);

            assertEquals(20, bytesDecoded);

        SMBUtil.writeInt2(100000, buffer, 58); // This becomes 34464 due to 16-bit truncation

        // Since 34464 is within the 16-bit range but could still be considered excessive for security buffer,
        // let's test the actual validation logic instead
        byte[] buffer2 = createBasicNegotiateResponseBuffer();
        // Set maximum 16-bit value
        SMBUtil.writeInt2(65535, buffer2, 58);

func TestFormatErasureEmpty(t *testing.T) {
	format := newFormatErasureV3(1, 16)
	format.Erasure.DistributionAlgo = formatErasureVersionV2DistributionAlgoV1
	formats := make([]*formatErasureV3, 16)

	for j := range 16 {
		newFormat := format.Clone()
		newFormat.Erasure.This = format.Erasure.Sets[0][j]
		formats[j] = newFormat
	}

	// empty format to indicate disk not found, but this
	// empty should return false.

	}

	commonSuccModTime := time.Date(2023, time.August, 25, 0, 0, 0, 0, time.UTC)
	succModTimesInQuorum := make([]time.Time, 16)
	succModTimesNoQuorum := make([]time.Time, 16)
	commonNumVersions := 2
	numVersionsInQuorum := make([]int, 16)
	numVersionsNoQuorum := make([]int, 16)
	for i := range 16 {
		if i < 4 {
			continue
		}
		succModTimesInQuorum[i] = commonSuccModTime
		numVersionsInQuorum[i] = commonNumVersions

        // Prepare data
        ByteArrayOutputStream baos = new ByteArrayOutputStream();
        writeLittleEndianInt(baos, PacSignature.KERB_CHECKSUM_HMAC_MD5);
        byte[] checksum = new byte[16];
        for (int i = 0; i < checksum.length; i++) {
            checksum[i] = (byte) i;
        }
        baos.write(checksum);
        byte[] data = baos.toByteArray();

        // Create PacSignature