aboutsummaryrefslogtreecommitdiffstats
path: root/test/Transforms/ADCE/2003-06-24-BasicFunctionality.ll
diff options
context:
space:
mode:
authorDan Gohman <djg@cray.com>2007-07-18 16:29:46 +0000
committerDan Gohman <djg@cray.com>2007-07-18 16:29:46 +0000
commitf17a25c88b892d30c2b41ba7ecdfbdfb2b4be9cc (patch)
treeebb79ea1ee5e3bc1fdf38541a811a8b804f0679a /test/Transforms/ADCE/2003-06-24-BasicFunctionality.ll
downloadexternal_llvm-f17a25c88b892d30c2b41ba7ecdfbdfb2b4be9cc.zip
external_llvm-f17a25c88b892d30c2b41ba7ecdfbdfb2b4be9cc.tar.gz
external_llvm-f17a25c88b892d30c2b41ba7ecdfbdfb2b4be9cc.tar.bz2
It's not necessary to do rounding for alloca operations when the requested
alignment is equal to the stack alignment. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@40004 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'test/Transforms/ADCE/2003-06-24-BasicFunctionality.ll')
-rw-r--r--test/Transforms/ADCE/2003-06-24-BasicFunctionality.ll40
1 files changed, 40 insertions, 0 deletions
diff --git a/test/Transforms/ADCE/2003-06-24-BasicFunctionality.ll b/test/Transforms/ADCE/2003-06-24-BasicFunctionality.ll
new file mode 100644
index 0000000..ac62699
--- /dev/null
+++ b/test/Transforms/ADCE/2003-06-24-BasicFunctionality.ll
@@ -0,0 +1,40 @@
+; RUN: llvm-upgrade < %s | llvm-as | opt -adce -simplifycfg | llvm-dis | not grep then:
+
+void %dead_test8(int* %data.1, int %idx.1) {
+entry: ; No predecessors!
+ %tmp.1 = load int* %data.1 ; <int> [#uses=2]
+ %tmp.41 = setgt int %tmp.1, 0 ; <bool> [#uses=1]
+ br bool %tmp.41, label %no_exit.preheader, label %return
+
+no_exit.preheader: ; preds = %entry
+ %tmp.11 = getelementptr int* %data.1, long 1 ; <int*> [#uses=1]
+ %tmp.22-idxcast = cast int %idx.1 to long ; <long> [#uses=1]
+ %tmp.28 = getelementptr int* %data.1, long %tmp.22-idxcast ; <int*> [#uses=1]
+ br label %no_exit
+
+no_exit: ; preds = %no_exit.preheader, %endif
+ %k.1 = phi int [ %k.0, %endif ], [ 0, %no_exit.preheader ] ; <int> [#uses=3]
+ %i.0 = phi int [ %inc.1, %endif ], [ 0, %no_exit.preheader ] ; <int> [#uses=1]
+ %tmp.12 = load int* %tmp.11 ; <int> [#uses=1]
+ %tmp.14 = sub int 0, %tmp.12 ; <int> [#uses=1]
+ %tmp.161 = setne int %k.1, %tmp.14 ; <bool> [#uses=1]
+ br bool %tmp.161, label %then, label %else
+
+then: ; preds = %no_exit
+ %inc.0 = add int %k.1, 1 ; <int> [#uses=1]
+ br label %endif
+
+else: ; preds = %no_exit
+ %dec = add int %k.1, -1 ; <int> [#uses=1]
+ br label %endif
+
+endif: ; preds = %else, %then
+ %k.0 = phi int [ %dec, %else ], [ %inc.0, %then ] ; <int> [#uses=1]
+ store int 2, int* %tmp.28
+ %inc.1 = add int %i.0, 1 ; <int> [#uses=2]
+ %tmp.4 = setlt int %inc.1, %tmp.1 ; <bool> [#uses=1]
+ br bool %tmp.4, label %no_exit, label %return
+
+return: ; preds = %entry, %endif
+ ret void
+}