2014-09-11 01:58:16 +08:00
|
|
|
; RUN: opt < %s -loop-vectorize -force-vector-interleave=1 -force-vector-width=2 -S | FileCheck %s
|
2016-06-02 01:16:46 +08:00
|
|
|
; RUN: opt < %s -loop-vectorize -force-vector-interleave=1 -force-vector-width=2 -instcombine -S | FileCheck %s --check-prefix=IND
|
|
|
|
|
; RUN: opt < %s -loop-vectorize -force-vector-interleave=2 -force-vector-width=2 -instcombine -S | FileCheck %s --check-prefix=UNROLL
|
2013-05-14 08:21:18 +08:00
|
|
|
|
|
|
|
|
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
|
|
|
|
|
|
|
|
|
|
; Make sure that we can handle multiple integer induction variables.
|
2013-10-03 04:29:00 +08:00
|
|
|
; CHECK-LABEL: @multi_int_induction(
|
2013-05-14 08:21:18 +08:00
|
|
|
; CHECK: vector.body:
|
|
|
|
|
; CHECK: %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body ]
|
2015-09-02 18:14:54 +08:00
|
|
|
; CHECK: %[[VAR:.*]] = trunc i64 %index to i32
|
2013-05-14 08:21:18 +08:00
|
|
|
; CHECK: %offset.idx = add i32 190, %[[VAR]]
|
|
|
|
|
define void @multi_int_induction(i32* %A, i32 %N) {
|
|
|
|
|
for.body.lr.ph:
|
|
|
|
|
br label %for.body
|
|
|
|
|
|
|
|
|
|
for.body:
|
|
|
|
|
%indvars.iv = phi i64 [ 0, %for.body.lr.ph ], [ %indvars.iv.next, %for.body ]
|
|
|
|
|
%count.09 = phi i32 [ 190, %for.body.lr.ph ], [ %inc, %for.body ]
|
[opaque pointer type] Add textual IR support for explicit type parameter to getelementptr instruction
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(line)
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arrayidx2 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
|
2013-05-14 08:21:18 +08:00
|
|
|
store i32 %count.09, i32* %arrayidx2, align 4
|
|
|
|
|
%inc = add nsw i32 %count.09, 1
|
|
|
|
|
%indvars.iv.next = add i64 %indvars.iv, 1
|
|
|
|
|
%lftr.wideiv = trunc i64 %indvars.iv.next to i32
|
|
|
|
|
%exitcond = icmp ne i32 %lftr.wideiv, %N
|
|
|
|
|
br i1 %exitcond, label %for.body, label %for.end
|
|
|
|
|
|
|
|
|
|
for.end:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
2013-11-02 06:18:19 +08:00
|
|
|
; Make sure we remove unneeded vectorization of induction variables.
|
|
|
|
|
; In order for instcombine to cleanup the vectorized induction variables that we
|
|
|
|
|
; create in the loop vectorizer we need to perform some form of redundancy
|
|
|
|
|
; elimination to get rid of multiple uses.
|
|
|
|
|
|
|
|
|
|
; IND-LABEL: scalar_use
|
|
|
|
|
|
|
|
|
|
; IND: br label %vector.body
|
|
|
|
|
; IND: vector.body:
|
|
|
|
|
; Vectorized induction variable.
|
|
|
|
|
; IND-NOT: insertelement <2 x i64>
|
|
|
|
|
; IND-NOT: shufflevector <2 x i64>
|
|
|
|
|
; IND: br {{.*}}, label %vector.body
|
|
|
|
|
|
|
|
|
|
define void @scalar_use(float* %a, float %b, i64 %offset, i64 %offset2, i64 %n) {
|
|
|
|
|
entry:
|
|
|
|
|
br label %for.body
|
|
|
|
|
|
|
|
|
|
for.body:
|
|
|
|
|
%iv = phi i64 [ 0, %entry ], [ %iv.next, %for.body ]
|
|
|
|
|
%ind.sum = add i64 %iv, %offset
|
[opaque pointer type] Add textual IR support for explicit type parameter to getelementptr instruction
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(line)
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arr.idx = getelementptr inbounds float, float* %a, i64 %ind.sum
|
2015-02-28 05:17:42 +08:00
|
|
|
%l1 = load float, float* %arr.idx, align 4
|
2013-11-02 06:18:19 +08:00
|
|
|
%ind.sum2 = add i64 %iv, %offset2
|
[opaque pointer type] Add textual IR support for explicit type parameter to getelementptr instruction
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(line)
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%arr.idx2 = getelementptr inbounds float, float* %a, i64 %ind.sum2
|
2015-02-28 05:17:42 +08:00
|
|
|
%l2 = load float, float* %arr.idx2, align 4
|
2013-11-02 06:18:19 +08:00
|
|
|
%m = fmul fast float %b, %l2
|
|
|
|
|
%ad = fadd fast float %l1, %m
|
|
|
|
|
store float %ad, float* %arr.idx, align 4
|
|
|
|
|
%iv.next = add nuw nsw i64 %iv, 1
|
|
|
|
|
%exitcond = icmp eq i64 %iv.next, %n
|
|
|
|
|
br i1 %exitcond, label %loopexit, label %for.body
|
|
|
|
|
|
|
|
|
|
loopexit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
2013-11-18 21:14:32 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
; Make sure that the loop exit count computation does not overflow for i8 and
|
|
|
|
|
; i16. The exit count of these loops is i8/i16 max + 1. If we don't cast the
|
|
|
|
|
; induction variable to a bigger type the exit count computation will overflow
|
|
|
|
|
; to 0.
|
|
|
|
|
; PR17532
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: i8_loop
|
2014-01-12 05:06:00 +08:00
|
|
|
; CHECK: icmp eq i32 {{.*}}, 256
|
2013-11-18 21:14:32 +08:00
|
|
|
define i32 @i8_loop() nounwind readnone ssp uwtable {
|
|
|
|
|
br label %1
|
|
|
|
|
|
|
|
|
|
; <label>:1 ; preds = %1, %0
|
|
|
|
|
%a.0 = phi i32 [ 1, %0 ], [ %2, %1 ]
|
|
|
|
|
%b.0 = phi i8 [ 0, %0 ], [ %3, %1 ]
|
|
|
|
|
%2 = and i32 %a.0, 4
|
|
|
|
|
%3 = add i8 %b.0, -1
|
|
|
|
|
%4 = icmp eq i8 %3, 0
|
|
|
|
|
br i1 %4, label %5, label %1
|
|
|
|
|
|
|
|
|
|
; <label>:5 ; preds = %1
|
|
|
|
|
ret i32 %2
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: i16_loop
|
2014-01-12 05:06:00 +08:00
|
|
|
; CHECK: icmp eq i32 {{.*}}, 65536
|
2013-11-18 21:14:32 +08:00
|
|
|
|
|
|
|
|
define i32 @i16_loop() nounwind readnone ssp uwtable {
|
|
|
|
|
br label %1
|
|
|
|
|
|
|
|
|
|
; <label>:1 ; preds = %1, %0
|
|
|
|
|
%a.0 = phi i32 [ 1, %0 ], [ %2, %1 ]
|
|
|
|
|
%b.0 = phi i16 [ 0, %0 ], [ %3, %1 ]
|
|
|
|
|
%2 = and i32 %a.0, 4
|
|
|
|
|
%3 = add i16 %b.0, -1
|
|
|
|
|
%4 = icmp eq i16 %3, 0
|
|
|
|
|
br i1 %4, label %5, label %1
|
|
|
|
|
|
|
|
|
|
; <label>:5 ; preds = %1
|
|
|
|
|
ret i32 %2
|
|
|
|
|
}
|
2014-05-30 06:10:01 +08:00
|
|
|
|
|
|
|
|
; This loop has a backedge taken count of i32_max. We need to check for this
|
|
|
|
|
; condition and branch directly to the scalar loop.
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: max_i32_backedgetaken
|
2015-09-02 18:15:22 +08:00
|
|
|
; CHECK: br i1 true, label %scalar.ph, label %min.iters.checked
|
2014-05-30 06:10:01 +08:00
|
|
|
|
|
|
|
|
; CHECK: scalar.ph:
|
2015-09-02 18:15:39 +08:00
|
|
|
; CHECK: %bc.resume.val = phi i32 [ 0, %middle.block ], [ 0, %0 ]
|
|
|
|
|
; CHECK: %bc.merge.rdx = phi i32 [ 1, %0 ], [ 1, %min.iters.checked ], [ %5, %middle.block ]
|
2014-05-30 06:10:01 +08:00
|
|
|
|
|
|
|
|
define i32 @max_i32_backedgetaken() nounwind readnone ssp uwtable {
|
|
|
|
|
|
|
|
|
|
br label %1
|
|
|
|
|
|
|
|
|
|
; <label>:1 ; preds = %1, %0
|
|
|
|
|
%a.0 = phi i32 [ 1, %0 ], [ %2, %1 ]
|
|
|
|
|
%b.0 = phi i32 [ 0, %0 ], [ %3, %1 ]
|
|
|
|
|
%2 = and i32 %a.0, 4
|
|
|
|
|
%3 = add i32 %b.0, -1
|
|
|
|
|
%4 = icmp eq i32 %3, 0
|
|
|
|
|
br i1 %4, label %5, label %1
|
|
|
|
|
|
|
|
|
|
; <label>:5 ; preds = %1
|
|
|
|
|
ret i32 %2
|
|
|
|
|
}
|
2014-06-22 11:38:59 +08:00
|
|
|
|
|
|
|
|
; When generating the overflow check we must sure that the induction start value
|
|
|
|
|
; is defined before the branch to the scalar preheader.
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: testoverflowcheck
|
|
|
|
|
; CHECK: entry
|
|
|
|
|
; CHECK: %[[LOAD:.*]] = load i8
|
|
|
|
|
; CHECK: br
|
|
|
|
|
|
|
|
|
|
; CHECK: scalar.ph
|
2015-09-02 18:14:54 +08:00
|
|
|
; CHECK: phi i8 [ %{{.*}}, %middle.block ], [ %[[LOAD]], %entry ]
|
2014-06-22 11:38:59 +08:00
|
|
|
|
|
|
|
|
@e = global i8 1, align 1
|
|
|
|
|
@d = common global i32 0, align 4
|
|
|
|
|
@c = common global i32 0, align 4
|
|
|
|
|
define i32 @testoverflowcheck() {
|
|
|
|
|
entry:
|
2015-02-28 05:17:42 +08:00
|
|
|
%.pr.i = load i8, i8* @e, align 1
|
|
|
|
|
%0 = load i32, i32* @d, align 4
|
|
|
|
|
%c.promoted.i = load i32, i32* @c, align 4
|
2014-06-22 11:38:59 +08:00
|
|
|
br label %cond.end.i
|
|
|
|
|
|
|
|
|
|
cond.end.i:
|
|
|
|
|
%inc4.i = phi i8 [ %.pr.i, %entry ], [ %inc.i, %cond.end.i ]
|
|
|
|
|
%and3.i = phi i32 [ %c.promoted.i, %entry ], [ %and.i, %cond.end.i ]
|
|
|
|
|
%and.i = and i32 %0, %and3.i
|
|
|
|
|
%inc.i = add i8 %inc4.i, 1
|
|
|
|
|
%tobool.i = icmp eq i8 %inc.i, 0
|
|
|
|
|
br i1 %tobool.i, label %loopexit, label %cond.end.i
|
|
|
|
|
|
|
|
|
|
loopexit:
|
|
|
|
|
ret i32 %and.i
|
|
|
|
|
}
|
2016-05-05 23:20:39 +08:00
|
|
|
|
|
|
|
|
; The SCEV expression of %sphi is (zext i8 {%t,+,1}<%loop> to i32)
|
|
|
|
|
; In order to recognize %sphi as an induction PHI and vectorize this loop,
|
|
|
|
|
; we need to convert the SCEV expression into an AddRecExpr.
|
|
|
|
|
; The expression gets converted to {zext i8 %t to i32,+,1}.
|
|
|
|
|
|
|
|
|
|
; CHECK-LABEL: wrappingindvars1
|
|
|
|
|
; CHECK-LABEL: vector.scevcheck
|
|
|
|
|
; CHECK-LABEL: vector.body
|
|
|
|
|
; CHECK: add <2 x i32> {{%[^ ]*}}, <i32 0, i32 1>
|
|
|
|
|
define void @wrappingindvars1(i8 %t, i32 %len, i32 *%A) {
|
|
|
|
|
entry:
|
|
|
|
|
%st = zext i8 %t to i16
|
|
|
|
|
%ext = zext i8 %t to i32
|
|
|
|
|
%ecmp = icmp ult i16 %st, 42
|
|
|
|
|
br i1 %ecmp, label %loop, label %exit
|
|
|
|
|
|
|
|
|
|
loop:
|
|
|
|
|
|
|
|
|
|
%idx = phi i8 [ %t, %entry ], [ %idx.inc, %loop ]
|
|
|
|
|
%idx.b = phi i32 [ 0, %entry ], [ %idx.b.inc, %loop ]
|
|
|
|
|
%sphi = phi i32 [ %ext, %entry ], [%idx.inc.ext, %loop]
|
|
|
|
|
|
|
|
|
|
%ptr = getelementptr inbounds i32, i32* %A, i8 %idx
|
|
|
|
|
store i32 %sphi, i32* %ptr
|
|
|
|
|
|
|
|
|
|
%idx.inc = add i8 %idx, 1
|
|
|
|
|
%idx.inc.ext = zext i8 %idx.inc to i32
|
|
|
|
|
%idx.b.inc = add nuw nsw i32 %idx.b, 1
|
|
|
|
|
|
|
|
|
|
%c = icmp ult i32 %idx.b, %len
|
|
|
|
|
br i1 %c, label %loop, label %exit
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; The SCEV expression of %sphi is (4 * (zext i8 {%t,+,1}<%loop> to i32))
|
|
|
|
|
; In order to recognize %sphi as an induction PHI and vectorize this loop,
|
|
|
|
|
; we need to convert the SCEV expression into an AddRecExpr.
|
|
|
|
|
; The expression gets converted to ({4 * (zext %t to i32),+,4}).
|
|
|
|
|
; CHECK-LABEL: wrappingindvars2
|
|
|
|
|
; CHECK-LABEL: vector.scevcheck
|
|
|
|
|
; CHECK-LABEL: vector.body
|
|
|
|
|
; CHECK: add <2 x i32> {{%[^ ]*}}, <i32 0, i32 4>
|
|
|
|
|
define void @wrappingindvars2(i8 %t, i32 %len, i32 *%A) {
|
|
|
|
|
|
|
|
|
|
entry:
|
|
|
|
|
%st = zext i8 %t to i16
|
|
|
|
|
%ext = zext i8 %t to i32
|
|
|
|
|
%ext.mul = mul i32 %ext, 4
|
|
|
|
|
|
|
|
|
|
%ecmp = icmp ult i16 %st, 42
|
|
|
|
|
br i1 %ecmp, label %loop, label %exit
|
|
|
|
|
|
|
|
|
|
loop:
|
|
|
|
|
|
|
|
|
|
%idx = phi i8 [ %t, %entry ], [ %idx.inc, %loop ]
|
|
|
|
|
%sphi = phi i32 [ %ext.mul, %entry ], [%mul, %loop]
|
|
|
|
|
%idx.b = phi i32 [ 0, %entry ], [ %idx.b.inc, %loop ]
|
|
|
|
|
|
|
|
|
|
%ptr = getelementptr inbounds i32, i32* %A, i8 %idx
|
|
|
|
|
store i32 %sphi, i32* %ptr
|
|
|
|
|
|
|
|
|
|
%idx.inc = add i8 %idx, 1
|
|
|
|
|
%idx.inc.ext = zext i8 %idx.inc to i32
|
|
|
|
|
%mul = mul i32 %idx.inc.ext, 4
|
|
|
|
|
%idx.b.inc = add nuw nsw i32 %idx.b, 1
|
|
|
|
|
|
|
|
|
|
%c = icmp ult i32 %idx.b, %len
|
|
|
|
|
br i1 %c, label %loop, label %exit
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
2016-06-02 01:16:46 +08:00
|
|
|
|
|
|
|
|
; Check that we generate vectorized IVs in the pre-header
|
|
|
|
|
; instead of widening the scalar IV inside the loop, when
|
|
|
|
|
; we know how to do that.
|
|
|
|
|
; IND-LABEL: veciv
|
|
|
|
|
; IND: vector.body:
|
|
|
|
|
; IND: %index = phi i32 [ 0, %vector.ph ], [ %index.next, %vector.body ]
|
|
|
|
|
; IND: %vec.ind = phi <2 x i32> [ <i32 0, i32 1>, %vector.ph ], [ %step.add, %vector.body ]
|
|
|
|
|
; IND: %step.add = add <2 x i32> %vec.ind, <i32 2, i32 2>
|
|
|
|
|
; IND: %index.next = add i32 %index, 2
|
|
|
|
|
; IND: %[[CMP:.*]] = icmp eq i32 %index.next
|
|
|
|
|
; IND: br i1 %[[CMP]]
|
|
|
|
|
; UNROLL-LABEL: veciv
|
|
|
|
|
; UNROLL: vector.body:
|
|
|
|
|
; UNROLL: %index = phi i32 [ 0, %vector.ph ], [ %index.next, %vector.body ]
|
|
|
|
|
; UNROLL: %vec.ind = phi <2 x i32> [ <i32 0, i32 1>, %vector.ph ], [ %step.add1, %vector.body ]
|
|
|
|
|
; UNROLL: %step.add = add <2 x i32> %vec.ind, <i32 2, i32 2>
|
|
|
|
|
; UNROLL: %step.add1 = add <2 x i32> %vec.ind, <i32 4, i32 4>
|
|
|
|
|
; UNROLL: %index.next = add i32 %index, 4
|
|
|
|
|
; UNROLL: %[[CMP:.*]] = icmp eq i32 %index.next
|
|
|
|
|
; UNROLL: br i1 %[[CMP]]
|
|
|
|
|
define void @veciv(i32* nocapture %a, i32 %start, i32 %k) {
|
|
|
|
|
for.body.preheader:
|
|
|
|
|
br label %for.body
|
|
|
|
|
|
|
|
|
|
for.body:
|
|
|
|
|
%indvars.iv = phi i32 [ %indvars.iv.next, %for.body ], [ 0, %for.body.preheader ]
|
|
|
|
|
%arrayidx = getelementptr inbounds i32, i32* %a, i32 %indvars.iv
|
|
|
|
|
store i32 %indvars.iv, i32* %arrayidx, align 4
|
|
|
|
|
%indvars.iv.next = add nuw nsw i32 %indvars.iv, 1
|
|
|
|
|
%exitcond = icmp eq i32 %indvars.iv.next, %k
|
|
|
|
|
br i1 %exitcond, label %exit, label %for.body
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
; IND-LABEL: trunciv
|
|
|
|
|
; IND: vector.body:
|
|
|
|
|
; IND: %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body ]
|
|
|
|
|
; IND: %[[VECIND:.*]] = phi <2 x i32> [ <i32 0, i32 1>, %vector.ph ], [ %[[STEPADD:.*]], %vector.body ]
|
|
|
|
|
; IND: %[[STEPADD]] = add <2 x i32> %[[VECIND]], <i32 2, i32 2>
|
|
|
|
|
; IND: %index.next = add i64 %index, 2
|
|
|
|
|
; IND: %[[CMP:.*]] = icmp eq i64 %index.next
|
|
|
|
|
; IND: br i1 %[[CMP]]
|
|
|
|
|
define void @trunciv(i32* nocapture %a, i32 %start, i64 %k) {
|
|
|
|
|
for.body.preheader:
|
|
|
|
|
br label %for.body
|
|
|
|
|
|
|
|
|
|
for.body:
|
|
|
|
|
%indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %for.body.preheader ]
|
|
|
|
|
%trunc.iv = trunc i64 %indvars.iv to i32
|
|
|
|
|
%arrayidx = getelementptr inbounds i32, i32* %a, i32 %trunc.iv
|
|
|
|
|
store i32 %trunc.iv, i32* %arrayidx, align 4
|
|
|
|
|
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
|
|
|
|
|
%exitcond = icmp eq i64 %indvars.iv.next, %k
|
|
|
|
|
br i1 %exitcond, label %exit, label %for.body
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
ret void
|
|
|
|
|
}
|