brintos

brintos / llvm-project-archived public Read only

0
0
Text · 996 B · b59eeea Raw
32 lines · plain
1; RUN: llc -mtriple=i686-- < %s | FileCheck %s2 3; The comparison happens after the relevant use, so the stride can easily4; be changed. The comparison can be done in a narrower mode than the5; induction variable.6; TODO: By making the first store post-increment as well, the loop setup7; could be made simpler.8 9define void @foo() nounwind {10; CHECK-LABEL: foo:11; CHECK-NOT: ret12; CHECK: cmpl $1013; CHECK: ret14 15entry:16	br label %loop17 18loop:19	%indvar = phi i32 [ 0, %entry ], [ %i.2.0.us1534, %loop ]		; <i32> [#uses=1]20	%i.2.0.us1534 = add i32 %indvar, 1		; <i32> [#uses=3]21	%tmp628.us1540 = shl i32 %i.2.0.us1534, 1		; <i32> [#uses=1]22	%tmp645646647.us1547 = sext i32 %tmp628.us1540 to i64		; <i64> [#uses=1]23	store i64 %tmp645646647.us1547, ptr null24	%tmp611.us1535 = icmp eq i32 %i.2.0.us1534, 4		; <i1> [#uses=2]25	%tmp623.us1538 = select i1 %tmp611.us1535, i32 6, i32 0		; <i32> [#uses=1]26	store i32 %tmp623.us1538, ptr null27	br i1 %tmp611.us1535, label %exit, label %loop28 29exit:30	ret void31}32