Lines Matching full:accumulator
20 // accumulator variable, thus compiling the typical naive factorial or
274 // will be available to initialize the accumulator.
329 /// transformed using accumulator recursion elimination, return the constant
330 /// which is the start of the accumulator value. Otherwise return null.
415 // If we are introducing accumulator recursion to eliminate operations after
417 // value for the accumulator is placed in this variable. If this value is set
418 // then we actually perform accumulator recursion elimination instead of
424 // special case of accumulator recursion, the operation being "return C".
438 // using accumulator recursion elimination. Check to see if this is the
439 // case, and if so, remember the initial accumulator value for later.
442 // Yes, this is accumulator recursion. Remember which instruction
453 // accumulator recursion variable eliminated.
523 // If we are introducing an accumulator variable to eliminate the recursion,
526 // accumulator recursion predicate is set up.
530 // Start by inserting a new PHI node for the accumulator.
535 "accumulator.tr", OldEntry->begin());
540 // other tail recursions eliminated) the accumulator is not modified.
553 // our associative and commutative accumulator instruction.
556 // Next, rewrite the accumulator recursion instruction so that it does not
