projects / oota-llvm.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: b395e4a) | patch
Teach InstructionSimplify how to look through PHI nodes. Since PHI
authorDuncan Sands <baldrick@free.fr>
Wed, 10 Nov 2010 18:23:01 +0000 (18:23 +0000)
committerDuncan Sands <baldrick@free.fr>
Wed, 10 Nov 2010 18:23:01 +0000 (18:23 +0000)
commita74a58c83be492b7d5b7383656f049909394cff4
treeab6a3c9367543fa15c84383d47e295341559537ftree | snapshot
parentb395e4a0262c36b17b18aa33514b2daf2a85e9a3commit | diff
Teach InstructionSimplify how to look through PHI nodes.  Since PHI
nodes can be used in loops, this could result in infinite looping
if there is no recursion limit, so add such a limit.  It is also
used for the SelectInst case because in theory there could be an
infinite loop there too if the basic block is unreachable.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@118694 91177308-0d34-0410-b5e6-96231b3b80d8
lib/Analysis/InstructionSimplify.cpp diff | blob | history
test/Transforms/InstCombine/select.ll diff | blob | history
C/C++ LLVM-based compilers that forbids OOTA behaviors