llvm-6502/test/Transforms/LoopIndexSplit/2008-02-13-LoopLatchPHI.ll
Dan Gohman f2f6ce65b7 Change tests from "opt %s" to "opt < %s" so that opt doesn't see the
input filename so that opt doesn't print the input filename in the
output so that grep lines in the tests don't unintentionally match
strings in the input filename.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@81537 91177308-0d34-0410-b5e6-96231b3b80d8
2009-09-11 18:01:28 +00:00

75 lines
2.7 KiB
LLVM

; RUN: opt < %s -loop-index-split -disable-output
; PR 2011
%struct.CLAUSE_HELP = type { i32, i32, i32, i32, i32*, i32, %struct.LIST_NODE*, %struct.LIST_NODE*, i32, i32, %struct.LITERAL_HELP**, i32, i32, i32, i32 }
%struct.LIST_NODE = type { %struct.LIST_NODE*, i8* }
%struct.LITERAL_HELP = type { i32, i32, i32, %struct.CLAUSE_HELP*, %struct.term* }
%struct.anon = type { %struct.LIST_NODE* }
%struct.st = type { %struct.subst*, %struct.LIST_NODE*, %struct.LIST_NODE*, i16, i16 }
%struct.subst = type { %struct.subst*, i32, %struct.term* }
%struct.term = type { i32, %struct.anon, %struct.LIST_NODE*, i32, i32 }
define fastcc %struct.LIST_NODE* @inf_HyperResolvents(%struct.CLAUSE_HELP* %Clause, %struct.subst* %Subst, %struct.LIST_NODE* %Restlits, i32 %GlobalMaxVar, %struct.LIST_NODE* %FoundMap, i32 %StrictlyMaximal, { %struct.st*, [3001 x %struct.term*], [4000 x %struct.term*], i32 }* %Index, i32* %Flags, i32* %Precedence) nounwind {
entry:
br i1 false, label %bb960, label %bb885
bb885: ; preds = %entry
ret %struct.LIST_NODE* null
bb960: ; preds = %entry
br i1 false, label %bb1097, label %bb1005.preheader
bb1005.preheader: ; preds = %bb960
ret %struct.LIST_NODE* null
bb1097: ; preds = %bb960
br i1 false, label %bb1269.preheader, label %bb1141.preheader
bb1141.preheader: ; preds = %bb1097
ret %struct.LIST_NODE* null
bb1269.preheader: ; preds = %bb1097
br i1 false, label %bb1318, label %bb1281
bb1281: ; preds = %bb1269.preheader
ret %struct.LIST_NODE* null
bb1318: ; preds = %bb1269.preheader
br i1 false, label %bb1459, label %bb.nph52
bb.nph52: ; preds = %bb1318
ret %struct.LIST_NODE* null
bb1459: ; preds = %bb1318
br i1 false, label %bb1553, label %bb.nph62
bb.nph62: ; preds = %bb1459
ret %struct.LIST_NODE* null
bb1553: ; preds = %bb1669, %bb1459
%j295.0.reg2mem.0 = phi i32 [ %storemerge110, %bb1669 ], [ 0, %bb1459 ] ; <i32> [#uses=2]
%Constraint403.2.reg2mem.0 = phi %struct.LIST_NODE* [ %Constraint403.1.reg2mem.0, %bb1669 ], [ null, %bb1459 ] ; <%struct.LIST_NODE*> [#uses=1]
br i1 false, label %bb1588, label %bb1616
bb1588: ; preds = %bb1553
br label %bb1616
bb1616: ; preds = %bb1588, %bb1553
%tmp1629 = icmp sgt i32 %j295.0.reg2mem.0, 0 ; <i1> [#uses=1]
br i1 %tmp1629, label %bb1649, label %bb1632
bb1632: ; preds = %bb1616
br label %bb1669
bb1649: ; preds = %bb1616
br label %bb1669
bb1669: ; preds = %bb1649, %bb1632
%Constraint403.1.reg2mem.0 = phi %struct.LIST_NODE* [ null, %bb1632 ], [ %Constraint403.2.reg2mem.0, %bb1649 ] ; <%struct.LIST_NODE*> [#uses=1]
%storemerge110 = add i32 %j295.0.reg2mem.0, 1 ; <i32> [#uses=2]
%tmp1672 = icmp sgt i32 %storemerge110, 0 ; <i1> [#uses=1]
br i1 %tmp1672, label %bb1678, label %bb1553
bb1678: ; preds = %bb1669
ret %struct.LIST_NODE* null
}