Lines Matching full:addition
172 /// Return the number of instructions needed to emit the N-ary addition.
688 // The addition is folded to 0.0.
707 // step 2: Emit the N-ary addition.
709 // addition in question, and at most two neighboring instructions.
710 // The resulting optimized addition should have at least one less instruction
711 // than the original addition expression tree. This implies that the resulting
712 // N-ary addition has at most two instructions, and we don't need to worry
713 // about tree-height when constructing the N-ary addition.
804 // Return the number of instruction needed to emit the N-ary addition.
902 // If LHS and RHS each have at least two sign bits, the addition will look
909 // be 1 and therefore the carry out of the addition is also 0.
912 // be 0 and therefore the carry out of the addition is also 1.
915 // the carry out of the addition, there is no signed overflow.
929 // Addition of two 2's compliment numbers having opposite signs will never
935 // Check if carry bit of addition will not cause overflow.
