mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 11:42:57 +01:00
ab043ff680
Essentially the same as the GEP change in r230786.
A similar migration script can be used to update test cases, though a few more
test case improvements/changes were required this time around: (r229269-r229278)
import fileinput
import sys
import re
pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)")
for line in sys.stdin:
sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line))
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7649
llvm-svn: 230794
104 lines
4.9 KiB
LLVM
104 lines
4.9 KiB
LLVM
; RUN: llc < %s -mtriple=thumbv7-apple-ios -relocation-model=pic -disable-fp-elim -mcpu=cortex-a8 | FileCheck %s
|
|
; rdar://10676853
|
|
|
|
%struct.Dict_node_struct = type { i8*, %struct.Word_file_struct*, %struct.Exp_struct*, %struct.Dict_node_struct*, %struct.Dict_node_struct* }
|
|
%struct.Word_file_struct = type { [60 x i8], i32, %struct.Word_file_struct* }
|
|
%struct.Exp_struct = type { i8, i8, i8, i8, %union.anon }
|
|
%union.anon = type { %struct.E_list_struct* }
|
|
%struct.E_list_struct = type { %struct.E_list_struct*, %struct.Exp_struct* }
|
|
|
|
@lookup_list = external hidden unnamed_addr global %struct.Dict_node_struct*, align 4
|
|
|
|
declare void @llvm.memcpy.p0i8.p0i8.i32(i8* nocapture, i8* nocapture, i32, i32, i1) nounwind
|
|
|
|
define hidden fastcc void @rdictionary_lookup(%struct.Dict_node_struct* %dn, i8* nocapture %s) nounwind ssp {
|
|
; CHECK-LABEL: rdictionary_lookup:
|
|
entry:
|
|
br label %tailrecurse
|
|
|
|
tailrecurse: ; preds = %if.then10, %entry
|
|
%dn.tr = phi %struct.Dict_node_struct* [ %dn, %entry ], [ %9, %if.then10 ]
|
|
%cmp = icmp eq %struct.Dict_node_struct* %dn.tr, null
|
|
br i1 %cmp, label %if.end11, label %if.end
|
|
|
|
if.end: ; preds = %tailrecurse
|
|
%string = getelementptr inbounds %struct.Dict_node_struct, %struct.Dict_node_struct* %dn.tr, i32 0, i32 0
|
|
%0 = load i8*, i8** %string, align 4
|
|
br label %while.cond.i
|
|
|
|
while.cond.i: ; preds = %while.body.i, %if.end
|
|
%1 = phi i8* [ %s, %if.end ], [ %incdec.ptr.i, %while.body.i ]
|
|
%storemerge.i = phi i8* [ %0, %if.end ], [ %incdec.ptr6.i, %while.body.i ]
|
|
%2 = load i8, i8* %1, align 1
|
|
%cmp.i = icmp eq i8 %2, 0
|
|
%.pre.i = load i8, i8* %storemerge.i, align 1
|
|
br i1 %cmp.i, label %lor.lhs.false.i, label %land.end.i
|
|
|
|
land.end.i: ; preds = %while.cond.i
|
|
%cmp4.i = icmp eq i8 %2, %.pre.i
|
|
br i1 %cmp4.i, label %while.body.i, label %while.end.i
|
|
|
|
while.body.i: ; preds = %land.end.i
|
|
%incdec.ptr.i = getelementptr inbounds i8, i8* %1, i32 1
|
|
%incdec.ptr6.i = getelementptr inbounds i8, i8* %storemerge.i, i32 1
|
|
br label %while.cond.i
|
|
|
|
while.end.i: ; preds = %land.end.i
|
|
%cmp8.i = icmp eq i8 %2, 42
|
|
br i1 %cmp8.i, label %if.end3, label %lor.lhs.false.i
|
|
|
|
lor.lhs.false.i: ; preds = %while.end.i, %while.cond.i
|
|
%3 = phi i8 [ %2, %while.end.i ], [ 0, %while.cond.i ]
|
|
%cmp11.i = icmp eq i8 %.pre.i, 42
|
|
br i1 %cmp11.i, label %if.end3, label %dict_match.exit
|
|
|
|
dict_match.exit: ; preds = %lor.lhs.false.i
|
|
%cmp14.i = icmp eq i8 %3, 46
|
|
%conv16.i = sext i8 %3 to i32
|
|
%.conv16.i = select i1 %cmp14.i, i32 0, i32 %conv16.i
|
|
%cmp18.i = icmp eq i8 %.pre.i, 46
|
|
%conv22.i = sext i8 %.pre.i to i32
|
|
%cond24.i = select i1 %cmp18.i, i32 0, i32 %conv22.i
|
|
%sub.i = sub nsw i32 %.conv16.i, %cond24.i
|
|
%cmp1 = icmp sgt i32 %sub.i, -1
|
|
br i1 %cmp1, label %if.end3, label %if.then10
|
|
|
|
if.end3: ; preds = %dict_match.exit, %lor.lhs.false.i, %while.end.i
|
|
; CHECK: %if.end3
|
|
; CHECK: cmp
|
|
; CHECK-NOT: cbnz
|
|
%storemerge1.i3 = phi i32 [ %sub.i, %dict_match.exit ], [ 0, %lor.lhs.false.i ], [ 0, %while.end.i ]
|
|
%right = getelementptr inbounds %struct.Dict_node_struct, %struct.Dict_node_struct* %dn.tr, i32 0, i32 4
|
|
%4 = load %struct.Dict_node_struct*, %struct.Dict_node_struct** %right, align 4
|
|
tail call fastcc void @rdictionary_lookup(%struct.Dict_node_struct* %4, i8* %s)
|
|
%cmp4 = icmp eq i32 %storemerge1.i3, 0
|
|
br i1 %cmp4, label %if.then5, label %if.end8
|
|
|
|
if.then5: ; preds = %if.end3
|
|
%call6 = tail call fastcc i8* @xalloc(i32 20)
|
|
%5 = bitcast i8* %call6 to %struct.Dict_node_struct*
|
|
%6 = bitcast %struct.Dict_node_struct* %dn.tr to i8*
|
|
tail call void @llvm.memcpy.p0i8.p0i8.i32(i8* %call6, i8* %6, i32 16, i32 4, i1 false)
|
|
%7 = load %struct.Dict_node_struct*, %struct.Dict_node_struct** @lookup_list, align 4
|
|
%right7 = getelementptr inbounds i8, i8* %call6, i32 16
|
|
%8 = bitcast i8* %right7 to %struct.Dict_node_struct**
|
|
store %struct.Dict_node_struct* %7, %struct.Dict_node_struct** %8, align 4
|
|
store %struct.Dict_node_struct* %5, %struct.Dict_node_struct** @lookup_list, align 4
|
|
br label %if.then10
|
|
|
|
if.end8: ; preds = %if.end3
|
|
%cmp9 = icmp slt i32 %storemerge1.i3, 1
|
|
br i1 %cmp9, label %if.then10, label %if.end11
|
|
|
|
if.then10: ; preds = %if.end8, %if.then5, %dict_match.exit
|
|
%left = getelementptr inbounds %struct.Dict_node_struct, %struct.Dict_node_struct* %dn.tr, i32 0, i32 3
|
|
%9 = load %struct.Dict_node_struct*, %struct.Dict_node_struct** %left, align 4
|
|
br label %tailrecurse
|
|
|
|
if.end11: ; preds = %if.end8, %tailrecurse
|
|
ret void
|
|
}
|
|
|
|
; Materializable
|
|
declare hidden fastcc i8* @xalloc(i32) nounwind ssp
|