Duncan Sands d0d3ccc827 Handle the case of a tail recursion in which the tail call is followed ...

by a return that returns a constant, while elsewhere in the function
another return instruction returns a different constant.  This is a
special case of accumulator recursion, so just generalize the existing
logic a bit.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@108241 91177308-0d34-0410-b5e6-96231b3b80d8

2010-07-13 15:41:41 +00:00

..

2010-06-26-MultipleReturnValues.ll

Handle the case of a tail recursion in which the tail call is followed

2010-07-13 15:41:41 +00:00

accum_recursion_constant_arg.ll

…

accum_recursion.ll

…

ackermann.ll

…

dg.exp

…

dont_reorder_load.ll

Delete useless trailing semicolons.

2010-01-05 17:55:26 +00:00

dont-tce-tail-marked-call.ll

…

inf-recursion.ll

Refine the detection of seemingly infinitely recursive calls where the

2010-04-16 15:57:50 +00:00

intervening-inst.ll

…

move_alloca_for_tail_call.ll

…

nocapture.ll

…

reorder_load.ll

…

return_constant.ll

…

switch.ll

Improve tail call elimination to handle the switch statement.

2009-11-07 21:10:15 +00:00

trivial_codegen_tailcall.ll

…