Fix this test. It was testing broken behavior in that it required ADCE to eliminate

a potentially infinite loop, which is undesirable.  Instead, test the LICM behavior
that we're really interested in.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@51177 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/test/Analysis/BasicAA/licmtest.ll b/test/Analysis/BasicAA/licmtest.ll
index e65a453d0f327c977db0049dfea7153b358b30db..cfef63b1fd49a0e2910dfd40d3fca503f5bc5c11 100644 (file)
--- a/test/Analysis/BasicAA/licmtest.ll
+++ b/test/Analysis/BasicAA/licmtest.ll
@@ -1,9 +1,8 @@
 ; Test that LICM uses basicaa to do alias analysis, which is capable of 
 ; disambiguating some obvious cases.  If LICM is able to disambiguate the
-; two pointers, then the load should be hoisted, and the store sunk.  Thus
-; the loop becomes empty and can be deleted by ADCE. 
+; two pointers, then the load should be hoisted, and the store sunk.
 
-; RUN: llvm-as < %s | opt -basicaa -licm --adce | llvm-dis | not grep Loop
+; RUN: llvm-as < %s | opt -basicaa -licm | llvm-dis | %prcontext @A 1 | not grep Loop
 
 @A = global i32 7               ; <i32*> [#uses=3]
 @B = global i32 8               ; <i32*> [#uses=2]