mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-23 11:13:28 +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
39 lines
1.1 KiB
LLVM
39 lines
1.1 KiB
LLVM
; RUN: llc < %s -mcpu=atom -mtriple=i686-linux | FileCheck %s
|
|
; CHECK: addl
|
|
; CHECK-NEXT:leal
|
|
; CHECK-NEXT:decl
|
|
; CHECK-NEXT:jne
|
|
|
|
; Test for the FixupLEAs pre-emit pass. An LEA should be substituted for the ADD
|
|
; that increments the array pointer because it is within 5 instructions of the
|
|
; corresponding load. The ADD precedes the load by following the loop back edge.
|
|
|
|
; Original C code
|
|
;int test(int n, int * array)
|
|
;{
|
|
; int sum = 0;
|
|
; for(int i = 0; i < n; i++)
|
|
; sum += array[i];
|
|
; return sum;
|
|
;}
|
|
|
|
define i32 @test(i32 %n, i32* nocapture %array) {
|
|
entry:
|
|
%cmp4 = icmp sgt i32 %n, 0
|
|
br i1 %cmp4, label %for.body, label %for.end
|
|
|
|
for.body:
|
|
%i.06 = phi i32 [ %inc, %for.body ], [ 0, %entry ]
|
|
%sum.05 = phi i32 [ %add, %for.body ], [ 0, %entry ]
|
|
%arrayidx = getelementptr inbounds i32, i32* %array, i32 %i.06
|
|
%0 = load i32, i32* %arrayidx, align 4
|
|
%add = add nsw i32 %0, %sum.05
|
|
%inc = add nsw i32 %i.06, 1
|
|
%exitcond = icmp eq i32 %inc, %n
|
|
br i1 %exitcond, label %for.end, label %for.body
|
|
|
|
for.end:
|
|
%sum.0.lcssa = phi i32 [ 0, %entry ], [ %add, %for.body ]
|
|
ret i32 %sum.0.lcssa
|
|
}
|