Division and modulo remainder operations performed on integers are susceptible to divide-by-zero errors. Consequently, the divisor in a division or modulo remainder operation on integer types must be checked for zero prior to the operation. Division and remainder operations performed on floating-point numbers are not subject to this rule.
Noncompliant Code Example (Division)
The result of the /
operator is the quotient from the division of the first arithmetic operand by the second arithmetic operand. Division operations are susceptible to divide-by-zero errors. Overflow can also occur during two's-complement signed integer division when the dividend is equal to the minimum (negative) value for the signed integer type and the divisor is equal to —1. (See rule "−1 (see NUM00-J. Detect or prevent integer overflow".)
Noncompliant Code Example
This code for more information). This noncompliant code example can result in a divide-by-zero error during the division of the signed operands sl1
num1
and sl2
. num2
:
Code Block | ||
---|---|---|
| ||
signed long sl1num1, sl2num2, result; /* Initialize sl1num1 and sl2num2 */ result = sl1num1 / sl2num2; |
Compliant Solution (Division)
This compliant solution tests the suspect division operation divisor to guarantee there is no possibility of divide-by-zero errors.:
Code Block | ||
---|---|---|
| ||
signed long sl1num1, sl2num2, result; /* Initialize sl1num1 and sl2num2 */ if (num2 (sl2 == 0) ) { //* handleHandle error condition */ } else { result = sl1num1 / sl2num2; } |
...
Noncompliant Code Example (Remainder)
The %
operator provides the remainder when two operands of integer type are divided.
Noncompliant Code Example
This noncompliant code example can result in a divide-by-zero error during the remainder operation on the signed operands sl1
num1
and sl2
. num2
:
Code Block | ||
---|---|---|
| ||
signed long sl1num1, sl2num2, result; /* Initialize sl1num1 and sl2num2 */ result = sl1num1 % sl2num2; |
Compliant Solution (Remainder)
This compliant solution tests the suspect remainder operation divisor to guarantee there is no possibility of a divide-by-zero error.:
Code Block | ||
---|---|---|
| ||
signed long sl1num1, sl2num2, result; /* Initialize sl1num1 and sl2num2 */ if (num2 (sl2 == 0 ) ) { /*/ handleHandle error condition */ } else { result = sl1num1 % sl2num2; } |
Risk Assessment
A divide-division or remainder by - zero can result in abnormal program termination and denial-of-service (DoS).
Rule | Severity | Likelihood | Remediation Cost | Priority | Level |
---|---|---|---|---|---|
NUM02-J |
Low |
Likely |
Medium | P6 | L2 |
Automated Detection
...
Tool | Version | Checker | Description | ||||||
---|---|---|---|---|---|---|---|---|---|
Coverity | 7.5 | DIVIDE_BY_ZERO | Implemented | ||||||
Parasoft Jtest |
| CERT.NUM02.ZERO | Avoid division by zero | ||||||
PVS-Studio |
| V6020 | |||||||
SonarQube |
| S3518 | Zero should not be a possible denominator |
Related Guidelines
Automated detection exists for C and C++, but not for Java yet.
Related Guidelines
INT33-C. Ensure that division and modulo operations do not result in divide-by-zero errors
-369, |
Divide |
by Zero |
Bibliography
...
[ |
] |
Subclause 6.5.5, "Multiplicative |
]]></ac:plain-text-body></ac:structured-macro>
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="77b0b113-c6a3-474b-9caa-9a3be9509b20"><ac:plain-text-body><![CDATA[
[[Seacord 05
Operators" |
] | Chapter 5, "Integers" |
]]></ac:plain-text-body></ac:structured-macro>
<ac:structured-macro ac:name="unmigrated-wiki-markup" ac:schema-version="1" ac:macro-id="4b46b6cb-4db3-4d7f-8930-32b17f82c049"><ac:plain-text-body><![CDATA[
[[Warren 02
[Seacord 2015] | |
Chapter 2, "Basics" |
]]></ac:plain-text-body></ac:structured-macro>
...
NUM13-J. Beware of precision loss when converting primitive integers to floating-point 03. Numeric Types and Operations (NUM)