Lines Matching full:accumulator

19 //     accumulator variable, thus compiling the typical naive factorial or
423   // The below are shared state needed when performing accumulator recursion.
425   // find an elimination that requires an accumulator.
565   // Start by inserting a new PHI node for the accumulator.  in insertAccumulator()
568                           "accumulator.tr");  in insertAccumulator()
574   // (due to other tail recursions eliminated) the accumulator is not modified.  in insertAccumulator()
654     // using accumulator recursion elimination.  Check to see if this is the  in eliminateCall()
659     // Yes, this is accumulator recursion.  Remember which instruction  in eliminateCall()
703     // Rewrite the accumulator recursion instruction so that it does not use  in eliminateCall()
769         // We need to insert a copy of our accumulator instruction before any  in cleanupAndFinalize()
778           AccRecInstrNew->setName("accumulator.ret.tr");  in cleanupAndFinalize()
802         // We need to insert a copy of our accumulator instruction before any  in cleanupAndFinalize()
807           AccRecInstrNew->setName("accumulator.ret.tr");  in cleanupAndFinalize()