Add a priority queue class, which is a wrapper around std::priority_queue

[oota-llvm.git] / test / Transforms / InstCombine / and-compare.ll

diff --git a/test/Transforms/InstCombine/and-compare.ll b/test/Transforms/InstCombine/and-compare.ll
index 864b8c25e21bdfe0de941f9f3af8b87b491dfc93..d2f2753f887ede4dca97a75e508e001eff64f560 100644 (file)
--- a/test/Transforms/InstCombine/and-compare.ll
+++ b/test/Transforms/InstCombine/and-compare.ll
@@ -1,10 +1,11 @@
-; RUN: llvm-upgrade < %s | llvm-as | opt -instcombine | llvm-dis | grep and | wc -l | grep 1
+; RUN: llvm-as < %s | opt -instcombine | llvm-dis | \
+; RUN:    grep and | count 1
 
 ; Should be optimized to one and.
-bool %test1(uint %a, uint %b) {
-        %tmp1 = and uint %a, 65280
-        %tmp3 = and uint %b, 65280
-        %tmp = setne uint %tmp1, %tmp3
-        ret bool %tmp
+define i1 @test1(i32 %a, i32 %b) {
+        %tmp1 = and i32 %a, 65280               ; <i32> [#uses=1]
+        %tmp3 = and i32 %b, 65280               ; <i32> [#uses=1]
+        %tmp = icmp ne i32 %tmp1, %tmp3         ; <i1> [#uses=1]
+        ret i1 %tmp
 }