| 摘要 |
Logic for calculating a sum of numbers using an overflow counter in an environment exceeded by the numbers in bit-size accesses a least significant portion of a first number, accesses a least significant portion of a second number, and adds the least significant portion of the first number to the least significant portion of the second number. The resulting sum includes a first intermediate number. If a carry is generated by the addition of the least significant portion of the first number to the least significant portion of the second number, the logic increments an overflow counter to record the generated carry. The logic accesses least significant portions of the remaining numbers, adds the least significant portions to the first intermediate number, and increments the overflow counter each time a carry is generated to record the generated carry. After each of the least significant portions has been added to the first intermediate number, the logic stores the first intermediate number. The first intermediate number includes a least significant portion of the sum of the multiple numbers. The logic accesses a most significant portion of the first number and adds the overflow counter to the most significant portion of the first number. The resulting sum includes a second intermediate number. The logic accesses most significant portions of the remaining numbers and adds each of the most significant portions to the second intermediate number. After each of the most significant portions has been added to the second intermediate number, the logic stores the second intermediate number. The second intermediate number includes a most significant portion of the sum of the multiple numbers.
|
