llvm-mirror/test/Analysis/ScalarEvolution/2008-02-11-ReversedCondition.ll

; RUN: opt < %s -scalar-evolution -analyze | grep "Loop %header: backedge-taken count is (0 smax %n)"

define void @foo(i32 %n) {
entry:
	br label %header
header:
	%i = phi i32 [ 0, %entry ], [ %i.inc, %next ]
	%cond = icmp sgt i32 %n, %i
	br i1 %cond, label %next, label %return
next:
        %i.inc = add i32 %i, 1
	br label %header
return:
	ret void
}
Convert all tests using TCL-style quoting to use shell-style quoting. This was done through the aid of a terrible Perl creation. I will not paste any of the horrors here. Suffice to say, it require multiple staged rounds of replacements, state carried between, and a few nested-construct-parsing hacks that I'm not proud of. It happens, by luck, to be able to deal with all the TCL-quoting patterns in evidence in the LLVM test suite. If anyone is maintaining large out-of-tree test trees, feel free to poke me and I'll send you the steps I used to convert things, as well as answer any painful questions etc. IRC works best for this type of thing I find. Once converted, switch the LLVM lit config to use ShTests the same as Clang. In addition to being able to delete large amounts of Python code from 'lit', this will also simplify the entire test suite and some of lit's architecture. Finally, the test suite runs 33% faster on Linux now. ;] For my 16-hardware-thread (2x 4-core xeon e5520): 36s -> 24s llvm-svn: 159525 2012-07-02 14:47:22 +02:00			`; RUN: opt < %s -scalar-evolution -analyze \| grep "Loop %header: backedge-taken count is (0 smax %n)"`
If the LHS of the comparison is a loop-invariant we also want to move it to the RHS. This simple change allows to compute loop iteration count for loops with condition similar to the one in the testcase (which seems to be quite common). llvm-svn: 46959 2008-02-11 19:37:34 +01:00
			`define void @foo(i32 %n) {`
			`entry:`
			`br label %header`
			`header:`
			`%i = phi i32 [ 0, %entry ], [ %i.inc, %next ]`
			`%cond = icmp sgt i32 %n, %i`
			`br i1 %cond, label %next, label %return`
			`next:`
			`%i.inc = add i32 %i, 1`
			`br label %header`
			`return:`
			`ret void`
			`}`