*
     * @param a first operand
     * @param b second operand
     * @return sum of a and b
     * @throws ArithmeticException if overflow occurs
     */
    public static int safeAdd(int a, int b) {
        validateIntegerAddition(a, b, "Addition");
        return a + b;
    }

    /**
     * Safe integer multiplication with overflow check
     *
     * @param a first operand

            integerOverflowsPrevented.incrementAndGet();
            log.warn("Integer overflow in addition: {} + {} = {}", a, b, result);
            throw new SmbException("Integer overflow detected");
        }
        return (int) result;
    }

    /**
     * Safely multiply integers checking for overflow
     *
     * @param a first value
     * @param b second value
     * @return product

      // overflow, return.
      return naiveSum;
    }
    // we did over/under flow, if the sign is negative we should return MAX otherwise MIN
    return Long.MAX_VALUE + ((naiveSum >>> (Long.SIZE - 1)) ^ 1);
  }

  /**
   * Returns the difference of {@code a} and {@code b} unless it would overflow or underflow in

import jcifs.internal.util.SMBUtil;

/**
 * Security-focused test cases for Smb2NegotiateResponse input validation.
 * Tests various malformed input scenarios to ensure proper validation and
 * protection against buffer overflow, integer overflow, and other attacks.
 */
public class Smb2NegotiateResponseInputValidationTest {

    private Configuration mockConfig;
    private Smb2NegotiateResponse response;

    @BeforeEach

  }

  public void testOrderedPermutationSetSizeOverflow() {
    // 12 elements won't overflow
    assertEquals(
        479001600 /*12!*/,
        Collections2.orderedPermutations(newArrayList(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12))
            .size());
    // 13 elements overflow an int
    assertEquals(
        Integer.MAX_VALUE,

            try {
                // Exponential backoff with overflow protection - ensure safe calculation
                if (retryDelayMs > 0) {
                    // Safe calculation preventing overflow: use Math.max(0, retryCount - 1) and limit shift
                    int safeShift = Math.min(MAX_BACKOFF_SHIFT, Math.max(0, retryCount - 1));

            verifyNoMoreInteractions(mockBuffer);
        }

        @Test
        @DisplayName("Should encode masked overflow value correctly")
        void testEncodeMaskedValue() throws NdrException {
            // Given: NdrShort with overflow value that gets masked
            int inputValue = 300; // 300 & 0xFF = 44
            NdrShort ndrShort = new NdrShort(inputValue);

import java.util.concurrent.atomic.AtomicInteger;

import org.junit.jupiter.api.Test;

/**
 * Security-focused test cases for BufferCache to verify buffer overflow protection.
 */
public class BufferCacheSecurityTest {

    /**
     * Test that buffer allocation validates size to prevent overflow.
     */
    @Test
    public void testBufferSizeValidation() {
        // When - Get a buffer
        byte[] buffer = BufferCache.getBuffer();

    }

    @Test
    @DisplayName("encode() throws when dstIndex causes overflow")
    void encodeThrowsWhenDstIndexCausesOverflow() {
        byte[] src = makeSeq(5);
        Encodable enc = new ByteEncodable(src, 0, 5);
        byte[] dst = new byte[6]; // size is 6, but index 2 + len 5 -> overflow

        assertThrows(ArrayIndexOutOfBoundsException.class, () -> enc.encode(dst, 2),

        @Override
        public BigInteger apply(BigInteger x) {
          return x.negate();
        }
      };

  /*
   * This list contains values that attempt to provoke overflow in integer operations. It contains
   * positive values on or near 2^N for N near multiples of 8 (near byte boundaries).
   */
  static final ImmutableSet<Integer> POSITIVE_INTEGER_CANDIDATES;