From d5118c8f78a05ad0b426b6032138d1d934b77c8d Mon Sep 17 00:00:00 2001 From: Rafael Espindola Date: Fri, 17 Aug 2012 18:21:28 +0000 Subject: 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 --- test/Verifier/invoke.ll | 1 - 1 file changed, 1 deletion(-) (limited to 'test/Verifier') 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 } -- cgit v1.2.3