forked from OSchip/llvm-project
af9b1e2d80
Use the fact that if we visit a for node first in pre and next in post order we know we did not visit any children, thus we found an innermost loop. + Test case for an innermost loop with a conditional inside llvm-svn: 213870 |
||
---|---|---|
.. | ||
Ast | ||
CodeGen | ||
single_loop_param_less_equal.ll | ||
single_loop_param_less_than.ll | ||
single_loop_uint_max_iterations.ll | ||
single_loop_ull_max_iterations.ll |