// Check for leaks
        resourceManager.checkForLeaks();

        Map<String, Object> stats = resourceManager.getStatistics();
        // The leak counter may or may not increment depending on GC timing
        assertNotNull(stats.get("totalLeaks"));
    }

    private void createLeakyResource() {
        TestResource resource = new TestResource("leaky");

	"sort"
	"strings"
	"time"
)

const (
	// deadline (in seconds) up to which the go routine leak detection has to be retried.
	leakDetectDeadline = 5
	// pause time (in milliseconds) between each snapshot at the end of the go routine leak detection.
	leakDetectPauseTimeMs = 50
)

// LeakDetect - type with  methods for go routine leak detection.
type LeakDetect struct {
	relevantRoutines map[string]bool
}

        }
    }

    /**
     * Check for and report resource leaks
     */
    public void checkForLeaks() {
        if (!leakDetectionEnabled) {
            return;
        }

        // Process phantom references to detect leaks
        Reference<?> ref;
        while ((ref = referenceQueue.poll()) != null) {
            handlePhantomReference(ref);

     */
    @Override
    public void releaseBuffer(final byte[] buf) {
        if (buf == null) {
            return;
        }
        // better safe than sorry: prevent leaks if there is some out of bound access
        Arrays.fill(buf, (byte) 0);
        synchronized (this.cache) {
            if (this.freeBuffers < this.cache.length) {
                for (int i = 0; i < this.cache.length; i++) {

 */

package jcifs;

/**
 * Exception for resource-related SMB errors
 *
 * This exception is thrown when resource issues occur such as:
 * - File handle leaks
 * - Connection pool exhaustion
 * - Memory allocation failures
 * - Quota exceeded
 */
public class SmbResourceException extends SmbException {

    private static final long serialVersionUID = 1L;

    /**

	if duration < 0 {
		return
	}
	entries := int(atomic.AddInt64(&dt.entries, 1))
	index := entries - 1
	if index < dynamicTimeoutLogSize {
		dt.mutex.Lock()
		dt.log[index] = duration

		// We leak entries while we copy
		if entries == dynamicTimeoutLogSize {
			// Make copy on stack in order to call adjust()
			logCopy := [dynamicTimeoutLogSize]time.Duration{}
			copy(logCopy[:], dt.log[:])

            // Force release the handle with null checks
            if (this.usageCount != null) {
                this.usageCount.set(0);
            }

            // Clear references to prevent memory leaks
            try {
                if (this.treeConnection != null) {
                    // Release the tree connection if possible
                    log.debug("Releasing tree connection during emergency cleanup");

        // Fill with non-zero to verify zeroing on release
        for (int i = 0; i < b.length; i++) {
            b[i] = (byte) (i + 1);
        }

        // Act: release should zero immediately to avoid leaks
        impl.releaseBuffer(b);

        // Assert: original array is zeroed in-place
        for (byte value : b) {
            assertEquals(0, value, "Released buffer must be zeroed");
        }

            log.error("Error during file handle finalization", e);
        } finally {
            super.finalize();
        }
    }

    /**
     * Emergency cleanup method to prevent resource leaks during finalization
     */
    private void emergencyCloseHandle() {
        try {
            synchronized (this) {
                // Force close the handle
                this.open = false;

            log.error("Error during tree finalization", e);
        } finally {
            super.finalize();
        }
    }

    /**
     * Emergency cleanup method to prevent memory leaks during finalization
     */
    private void emergencyCleanup() {
        try {
            // Force usage count to zero
            this.usageCount.set(0);

            synchronized (this) {