summaryrefslogtreecommitdiff
path: root/test/Verifier
diff options
context:
space:
mode:
authorRafael Espindola <rafael.espindola@gmail.com>2012-08-17 18:21:28 +0000
committerRafael Espindola <rafael.espindola@gmail.com>2012-08-17 18:21:28 +0000
commitd5118c8f78a05ad0b426b6032138d1d934b77c8d (patch)
tree4b2ceef73af9e25167fb81abcdb1993df439c622 /test/Verifier
parent1f1ab3e9c4dbef6a2d610b29903592986be09a10 (diff)
downloadllvm-d5118c8f78a05ad0b426b6032138d1d934b77c8d.tar.gz
llvm-d5118c8f78a05ad0b426b6032138d1d934b77c8d.tar.bz2
llvm-d5118c8f78a05ad0b426b6032138d1d934b77c8d.tar.xz
Assert that dominates is not given a multiple edge. Finding out if we have
multiple edges between two blocks is linear. If the caller is iterating all edges leaving a BB that would be a square time algorithm. It is more efficient to have the callers handle that case. Currently the only callers are: * GVN: already avoids the multiple edge case. * Verifier: could only hit this assert when looking at an invalid invoke. Since it already rejects the invoke, just avoid computing the dominance for it. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@162113 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test/Verifier')
-rw-r--r--test/Verifier/invoke.ll1
1 files changed, 0 insertions, 1 deletions
diff --git a/test/Verifier/invoke.ll b/test/Verifier/invoke.ll
index a48f9b60fe..c2750bb121 100644
--- a/test/Verifier/invoke.ll
+++ b/test/Verifier/invoke.ll
@@ -19,7 +19,6 @@ L2: ; preds = %0
br label %L
L: ; preds = %L2, %L1, %L1
; CHECK: The unwind destination does not have a landingpad instruction
-; CHECK: Instruction does not dominate all uses
ret i32 %A
}