Integer values used in the following manner must be guranteed correct:

• As an array index
• In any pointer arithmetic
• As a length or size of an object
• As the bound of an array (for example, a loop counter)

Most integer operations can result in overflow if the resulting value cannot be represented by the underlying representation of the integer. The following table indicates which operators can result in overflow:

The following sections examine specific operations that are susceptible to integer overflow.

Addition

Addition in C is between two operands of arithmetic type, or between a pointer to an object type and an integer type. (Incrementing is equivalent to adding one.)

Non-compliant Code Example

The following code can result in an unsigned integer overflow during the addition of the unsigned operands ui1 and ui2. If this behavior is unanticipated, the resulting value may be used to allocate insufficient memory for a subsequent operation or in some other manner which could lead to an exploitable vulnerability.

unsigned int ui1, ui2, sum;

sum = ui1 + ui2;

Compliant Solution

The following compliant solution tests the suspect addition operation to guarantee there is no possibility of unsigned overflow.

unsigned int ui1, ui2, sum;

if (~ui1 < ui2) {
  /* handle error condition */
}
sum = ui1 + ui2;

Subtraction

Subtraction in C is between two operands of arithmetic type, two pointers to qualified or unqualified versions of compatible object types, or between a pointer to an object type and an integer type. (Decrementing is equivalent to subtracting one.)

Non-compliant Code Example

The following code can result in a signed integer overflow during the subtraction of the signed operands si1 and si2. If this behavior is unanticipated, the resulting value may be used to allocate insufficient memory for a subsequent operation or in some other manner which could lead to an exploitable vulnerability.

signed int si1, si2, result;

result = si1 - si2;

Compliant Solution

The following compliant solution tests the suspect subtraction operation to guarantee there is no possibility of signed overflow.

signed int si1, si2, result;

if ( ((si1^si2)&((si1-si2)^si1)) >> (sizeof(int)*CHAR_BIT-1) ) {
  /* handle error condition */
}
result = si1 - si2;

Multiplication

Multiplication in C is between two operands of arithmetic type.

Non-compliant Code Example

The following code can result in a signed integer overflow during the multiplication of the signed operands si1 and si2. If this behavior is unanticipated, the resulting value may be used to allocate insufficient memory for a subsequent operation or in some other manner which could lead to an exploitable vulnerability.

signed int si1, si2, result;

result = si1 * si2;

Compliant Solution

The following compliant solution tests the suspect multiplication operation to guarantee there is no possibility of signed overflow.

signed int si1, si2, result;

signed long long tmp = (signed long long)si1 * (signed long long)si2;

/*
 * If the product cannot be repesented as a 32-bit integer handle as an error condition
 */
if ( (tmp > INT_MAX) || (tmp < INT_MIN) ) {
  /* handle error condition */
}
result = (int)tmp;

The preceeding code is only compliant on systems where long long is at least twice the size of int. On systems where this does not hold the following compliant solution may be used to ensure signed overflow does not occur.

signed int si1, si2, result;

if (si1 > 0){  /* si1 is positive */
  if (si2 > 0) {  /* si1 and si2 are positive */
    if (si1 > (INT_MAX / si2)) {
      /* handle error condition */
    }
  } /* end if si1 and si2 are positive */
  else { /* si1 positive, si2 non-positive */
    if (si2 < (INT_MIN / si1)) {
        /* handle error condition */
    }
  } /* si1 positive, si2 non-positive */
} /* end if si1 is positive */
else { /* si1 is non-positive */
  if (si2 > 0) { /* si1 is non-positive, si2 is positive */
    if (si1 < (INT_MIN / si2)) {
      /* handle error condition */
    }
  } /* end if si1 is non-positive, si2 is positive */
  else { /* si1 and si2 are non-positive */
    if( (si1 != 0) && (si2 < (INT_MAX / si1))) {
      /* handle error condition */
    }
  } /* end if si1 and si2 are non-positive */
} /* end if si1 is non-positive */

result = si1 * si2;

Division

Division in C is between two operands of arithmetic type.

Non-compliant Code Example

The following code can result in a signed integer overflow during the division of the signed operands sl1 and sl2. If this behavior is unanticipated, the resulting value may be used to allocate insufficient memory for a subsequent operation or in some other manner which could lead to an exploitable vulnerability.

signed long sl1, sl2, result;

result = sl1 / sl2;

Compliant Solution

The following compliant solution tests the suspect division operation to guarantee there is no possibility of signed overflow.

signed long sl1, sl2, result;

if ( (sl2 == 0) || ( (sl1 == LONG_MIN) && (sl2 == -1) ) ) {
  /* handle error condition */
}
result = sl1 / sl2;

Modulo

Modulo in C is between two operands of integer type.

Non-compliant Code Example

The following code can result in a signed integer overflow during the modulo operation on the signed operands sl1 and sl2. If this behavior is unanticipated, the resulting value may be used to allocate insufficient memory for a subsequent operation or in some other manner which could lead to an exploitable vulnerability.

signed long sl1, sl2, result;

result = sl1 % sl2;

Compliant Solution

The following compliant solution tests the suspect modulo operation to guarantee there is no possibility of signed overflow.

signed long sl1, sl2, result;

if (sl2 == 0) {
  /* handle error condition */
}
result = sl1 % sl2;

Unary Negation

The unary negation operator in C takes an operand of arithmetic type.

Non-compliant Code Example

The following code can result in a signed integer overflow during the unary negation of the signed operand si1. If this behavior is unanticipated, the resulting value may be used to allocate insufficient memory for a subsequent operation or in some other manner which could lead to an exploitable vulnerability.

signed int si1, result;

result = -si1;

Compliant Solution

The following compliant solution tests the suspect negation operation to guarantee there is no possibility of signed overflow.

signed int si1, result;

if (si1 == INT_MIN) {
  /* handle error condition */
}
result = -si1;

Left Shift Operator

The shift operator in C is between two operands of integer type.

Non-compliant Code Example

The following code can result in an unsigned overflow during the shift operation of the unsigned operands ui1 and ui2. If this behavior is unanticipated, the resulting value may be used to allocate insufficient memory for a subsequent operation or in some other manner which could lead to an exploitable vulnerability.

unsigned int ui1, ui2, result;

result = ui1 << ui2;

Compliant Solution

The following compliant solution tests the suspect shift operation to guarantee there is no possibility of unsigned overflow.

unsigned int ui1, ui2, result;

if ( (ui2 < 0) || (ui2 >= sizeof(int)*8) ) {
  /* handle error condition */
}
result = ui1 << ui2;

Right Shift Operator

The shift operator in C is between two operands of integer type.

Non-compliant Code Example

The following code can result in an unsigned overflow during the shift operation of the unsigned operands ui1 and ui2. If this behavior is unanticipated, the resulting value may be used to allocate insufficient memory for a subsequent operation or in some other manner which could lead to an exploitable vulnerability.

unsigned int ui1, ui2, result;

result = ui1 >> ui2;

Compliant Solution

The following compliant solution tests the suspect shift operation to guarantee there is no possibility of unsigned overflow.

unsigned int ui1, ui2, result;

if ( (ui2 < 0) || (ui2 >= sizeof(int)*8) ) {
  /* handle error condition */
}
result = ui1 >> ui2;

Exceptions

Unsigned integers can be allowed to exhibit modulo behavior if and only if

1. the variable declaration is clearly commented as supporting modulo behavior
2. each operation on that integer is also clearly commented as supporting modulo behavior
3. if the integer exhibiting modulo behavior contributes to the value of an integer not marked as exhibiting modulo behavior, the resulting integer must obey this rule.

Consequences

Integer overflow can lead to buffer overflows and the execution of arbitary code by an attacker.

References

• Seacord 05 Chapter 5 Integers
• Warren 02 Chapter 2 Basics