features {
        freeDiskSpace {
            // Lower the limit such that the agent work directories aren't cleaned during the AMI baking process
            requiredSpace = "100mb"
        }
    }

    params {
        param("defaultBranchName", "master")
        param("env.JAVA_HOME", javaHome(BuildToolBuildJvm, Os.LINUX))
    }

    steps {
        gradleWrapper {

        }

        // Check total memory allocation
        long totalSize = (long) size * (long) elementSize;
        long maxAllocation = 100 * 1024 * 1024; // 100MB max

        if (totalSize > maxAllocation) {
            failedValidations.incrementAndGet();
            log.warn("Array allocation too large: {} bytes", totalSize);

}

// BenchmarkPutObjectPart10MbFS - Benchmark FS.PutObjectPart() for object size of 10MB.
func BenchmarkPutObjectPart10MbFS(b *testing.B) {
	benchmarkPutObjectPart(b, "FS", 10*humanize.MiByte)
}

// BenchmarkPutObjectPart10MbErasure - Benchmark Erasure.PutObjectPart() for object size of 10MB.
func BenchmarkPutObjectPart10MbErasure(b *testing.B) {
	benchmarkPutObjectPart(b, "Erasure", 10*humanize.MiByte)

        void shouldHandleTypicalNTFSConfiguration() throws SMBProtocolDecodingException {
            // Given - typical NTFS: 4KB clusters (8 sectors * 512 bytes)
            long totalClusters = 26214400L; // 100GB / 4KB
            long freeClusters = 13107200L; // 50GB / 4KB

            ByteBuffer buffer = ByteBuffer.allocate(32);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.putLong(totalClusters);

        final long start = System.nanoTime();
        controller.delayAfterProcessing();
        final long elapsed = (System.nanoTime() - start) / 1000000;

        assertTrue("Expected at least 100ms delay", elapsed >= 90); // Allow some tolerance
    }

    /**
     * Test delayBeforeProcessing with zero delay
     */
    public void test_delayBeforeProcessing_zeroDelay() {

        void shouldHandleTypicalNTFSConfiguration() throws SMBProtocolDecodingException {
            // Given - typical NTFS: 4KB clusters (8 sectors * 512 bytes)
            long totalClusters = 26214400L; // 100GB / 4KB
            long freeClusters = 13107200L; // 50GB / 4KB

            ByteBuffer buffer = ByteBuffer.allocate(24);
            buffer.order(ByteOrder.LITTLE_ENDIAN);
            buffer.putLong(totalClusters);

labels.facet_contentLength_10k=  - 10KB
labels.facet_contentLength_10kto100k=10KB - 100KB
labels.facet_contentLength_100kto500k=100KB - 500KB
labels.facet_contentLength_500kto1m=500KB - 1MB
labels.facet_contentLength_1m=1MB -  
labels.facet_contentLength_10kto50k=10KB - 50KB
labels.facet_contentLength_50kto100k=50KB - 100KB
labels.facet_contentLength_100kto250k=100KB - 250KB
labels.facet_contentLength_250kto500k=250KB - 500KB

    }

    @Test
    public void testHandleInfoExpiration() {
        // Test durable handle expiration
        HandleInfo durableInfo = new HandleInfo("/test/file.txt", testGuid, testFileId, HandleType.DURABLE_V2, 100, // 100ms timeout
                null);

        assertFalse(durableInfo.isExpired());

        // Wait for expiration
        try {
            Thread.sleep(150);
        } catch (InterruptedException e) {

labels.facet_contentLength_10k=  - 10KB
labels.facet_contentLength_10kto100k=10KB - 100KB
labels.facet_contentLength_100kto500k=100KB - 500KB
labels.facet_contentLength_500kto1m=500KB - 1MB
labels.facet_contentLength_1m=1MB -  
labels.facet_contentLength_10kto50k=10KB - 50KB
labels.facet_contentLength_50kto100k=50KB - 100KB
labels.facet_contentLength_100kto250k=100KB - 250KB
labels.facet_contentLength_250kto500k=250KB - 500KB

   * QPS=5 (5 tokens per second), if we ensure that a request isn't granted earlier than 200ms after
   * the last one, then we achieve the intended rate. If a request comes and the last request was
   * granted only 100ms ago, then we wait for another 100ms. At this rate, serving 15 fresh permits
   * (i.e. for an acquire(15) request) naturally takes 3 seconds.
   *
   * It is important to realize that such a RateLimiter has a very superficial memory of the past: