@Test fun nonBasicCodePointInInsertionCoding() {
    assertNull(Punycode.decode("xn--cat-ñ3h"))
  }

  @Test fun unterminatedCodePoint() {
    assertNull(Punycode.decode("xn--cat-n"))
  }

  @Test fun overflowI() {
    assertNull(Punycode.decode("xn--99999999"))
  }

  @Test fun overflowMaxCodePoint() {
    assertNull(Punycode.decode("xn--a-b.net"))
    assertNull(Punycode.decode("xn--a-9b.net"))

     * might not run some of its listeners. The likely result is that the app will hang. (And of
     * course stack overflows are bad news in general. For example, we may have overflowed in the
     * middle of defining a class. If so, that class will never be loadable in this process.) The
     * best we can do (since logging may overflow the stack) is to let the error propagate. Because

     * might not run some of its listeners. The likely result is that the app will hang. (And of
     * course stack overflows are bad news in general. For example, we may have overflowed in the
     * middle of defining a class. If so, that class will never be loadable in this process.) The
     * best we can do (since logging may overflow the stack) is to let the error propagate. Because

   * Math#addExact(long, long)}. Also note that adding two {@code int} values can <b>never</b>
   * overflow a {@code long}, so you can just write {@code (long) a + b}.
   *
   * @throws ArithmeticException if {@code a + b} overflows in signed {@code long} arithmetic
   */
  @InlineMe(replacement = "Math.addExact(a, b)")
  public static long checkedAdd(long a, long b) {

     *
     * @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

      long result = origin + distance;
      if (result < 0) {
        checkArgument(origin < 0, "overflow");
      }
      return result;
    }

    @Override
    public long distance(Long start, Long end) {
      long result = end - start;
      if (end > start && result < 0) { // overflow
        return Long.MAX_VALUE;
      }
      if (end < start && result > 0) { // underflow

        long expectedSize = (int) fileSize;
        assertEquals(expectedSize, response.getSize());
    }

    @Test
    void testFileSizeOverflow() {
        // Test file size that overflows signed int
        response = new SmbComQueryInformationResponse(mockConfig, 0L);
        setFieldValue(response, "wordCount", 10);

        byte[] buffer = new byte[256];

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

      val increment = (m - n) * (h + 1)
      if (delta > Int.MAX_VALUE - increment) return false // Prevent overflow.
      delta += increment

      n = m

      for (c in input) {
        if (c < n) {
          if (delta == Int.MAX_VALUE) return false // Prevent overflow.
          delta++
        } else if (c == n) {
          var q = delta

  }

  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,