{"id":40,"date":"2020-11-25T19:14:23","date_gmt":"2020-11-26T00:14:23","guid":{"rendered":"https:\/\/www.alpharithms.com\/?post_type=term&p=40"},"modified":"2021-07-27T10:51:13","modified_gmt":"2021-07-27T14:51:13","slug":"integer-overflow","status":"publish","type":"post","link":"https:\/\/www.alpharithms.com\/integer-overflow-231419\/","title":{"rendered":"Integer Overflow"},"content":{"rendered":"

Integer overflow occurs when an arithmetic operation results in a value that can’t be represented by a finite number of digits. This includes values higher than the maximum and lower than the minimum. A common example is the mileage gauge on a car – after mile 999,999 it carries over<\/em> to 000,000 representing an incorrect value.<\/p>\n

In computer science, this phenomenon is often referred to as binary overflow<\/em> because it commonly occurs when adding binary numbers. Depending on which language one is programming in, integer overflow may be handled in different ways.<\/p>\n

Wrap Around<\/h2>\n

The C17 ISO\/IEC 9899:2018<\/a> for C dictates that, for unsigned integer values, overflow is ignored and the value is returned as the value modulus the maximum. For example, in a 4-bit unsigned range 0-15, a value of 16 would be “wrapped around” by calculating 16 % 15 = 1<\/code>.<\/p>\n

Generally speaking, the maximum values for computing are restricted by the bit size of CPU registers (a.k.a. register width<\/em>). For example, a 4-bit CPU would provide a range of 0-15 integers reflective of the above example. However, an 8-bit CPU would provide a maximum value of 65,535\u2014considerably more. Below is a table summarizing the number of available values given a specific CPU registry size :<\/p>\n\n\n\n\n\n\n\n\n\n
max_size<\/th>\nmax_value<\/th>\n<\/tr>\n<\/thead>\n
4 bits<\/td>\n24<\/sup> – 1 = 15<\/td>\n<\/tr>\n
8 bits<\/td>\n28<\/sup> – 1 = 255<\/td>\n<\/tr>\n
16 bits<\/td>\n216<\/sup> – 1 = 65535<\/td>\n<\/tr>\n
32 bits<\/td>\n232<\/sup> – 1 = 4,294,967,295<\/td>\n<\/tr>\n
64 bits<\/td>\n264<\/sup> – 1 = 18,446,744,073,709,551,615<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

Detecting Overflow<\/h2>\n

Overflow can be predicted given knowledge of certain conditions such as arithmetic operation, operand sign, and register size. For example, knowing that adding two numbers that are >= the maximum size \/ 2 can predict overflow.<\/p>\n

What if you were to start adding negatives? What about subtracting operands of the same sign? A series of conditions can be generalized such that overflow can be predicted given ceratin relationships of operands, the operation being performed, and the resulting value. These conditions (for addition and subtraction) are as follows:<\/p>\n\n\n\n\n\n\n\n\n
Operation<\/th>\nA<\/th>\nB<\/th>\nOverflow Condition<\/th>\n<\/tr>\n<\/thead>\n
A + B<\/td>\nA >= 0<\/td>\nB >= 0<\/td>\nresult < 0<\/td>\n<\/tr>\n
A + B<\/td>\nA < 0<\/td>\nB < 0<\/td>\nresult >= 0<\/td>\n<\/tr>\n
A – B<\/td>\nA >= 0<\/td>\nB < 0<\/td>\nresult < 0<\/td>\n<\/tr>\n
A – B<\/td>\nA < 0<\/td>\nB >= 0<\/td>\nresult >= 0<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

In the C language, it’s up to the programmer whether or not to check for overflow. In other languages, such as ADA, it’s a requirement for application logic to handle overflow (R<\/a>).<\/p>\n

Note<\/strong>: This article is about integer overflow that can occur in the binary representation of numbers. For information on the CSS property overflow-integer<\/code> reference the Mozilla MDN article here<\/a>.<\/p>\n","protected":false},"excerpt":{"rendered":"

Integer overflow occurs when an arithmetic operation results in a value that can’t be represented by a finite number of digits. This includes values higher than the maximum and lower than the minimum. A common example is the mileage gauge on a car – after mile 999,999 it carries over to 000,000 representing an incorrect […]<\/p>\n","protected":false},"author":2,"featured_media":2472,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"inline_featured_image":false,"footnotes":""},"categories":[1,260],"tags":[461,33],"acf":[],"_links":{"self":[{"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/posts\/40"}],"collection":[{"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/comments?post=40"}],"version-history":[{"count":1,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/posts\/40\/revisions"}],"predecessor-version":[{"id":41,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/posts\/40\/revisions\/41"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/media\/2472"}],"wp:attachment":[{"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/media?parent=40"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/categories?post=40"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.alpharithms.com\/wp-json\/wp\/v2\/tags?post=40"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}