[llvm-commits] CVS: llvm/test/Regression/Transforms/SimplifyCFG/2003-08-17-BranchFoldOrdering.ll

[Chris Lattner]

Changes in directory llvm/test/Regression/Transforms/SimplifyCFG:

2003-08-17-BranchFoldOrdering.ll added (r1.1)

---
Log message:

New testcase


---
Diffs of the changes:

Index: llvm/test/Regression/Transforms/SimplifyCFG/2003-08-17-BranchFoldOrdering.ll
diff -c /dev/null llvm/test/Regression/Transforms/SimplifyCFG/2003-08-17-BranchFoldOrdering.ll:1.1
*** /dev/null	Sun Aug 17 14:38:07 2003
--- llvm/test/Regression/Transforms/SimplifyCFG/2003-08-17-BranchFoldOrdering.ll	Sun Aug 17 14:37:57 2003
***************
*** 0 ****
--- 1,24 ----
+ ; This test checks to make sure that 'br X, Dest, Dest' is folded into 
+ ; 'br Dest'.  This can only happen after the 'Z' block is eliminated.  This is
+ ; due to the fact that the SimplifyCFG function does not use 
+ ; the ConstantFoldTerminator function.
+ 
+ ; RUN: as < %s | opt -simplifycfg | dis | not grep 'br bool %c2'
+ 
+ declare void %noop()
+ 
+ int %test(bool %c1, bool %c2) {
+ 	call void %noop()
+ 	br bool %c1, label %A, label %Y
+ A:
+ 	call void %noop()
+  	br bool %c2, label %Z, label %X   ; Can be converted to unconditional br
+ Z:
+ 	br label %X
+ X:
+ 	call void %noop()
+ 	ret int 0
+ Y:
+ 	call void %noop()
+ 	br label %X
+ }