projects / platform / upstream / llvm.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: fb3d5d1) | patch
[Refactor] Remove containsLoop to find innermost loops
authorJohannes Doerfert <jdoerfert@codeaurora.org>
Thu, 24 Jul 2014 15:59:06 +0000 (15:59 +0000)
committerJohannes Doerfert <jdoerfert@codeaurora.org>
Thu, 24 Jul 2014 15:59:06 +0000 (15:59 +0000)
commitaf9b1e2d80f1756237815b0cf0b556fb3a105cec
tree5f12de27ddce558f07838b6ee89f0162b1c61f49tree | snapshot
parentfb3d5d175066604e3fa2ab026d99008e0904f933commit | diff
[Refactor] Remove containsLoop to find innermost loops

  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
polly/lib/CodeGen/IslAst.cpp diff | blob | history
polly/test/Isl/CodeGen/loop_with_condition_2.ll diff | blob | history
Domain: System / Toolchain;