2017-08-08 02:40:29 +08:00
|
|
|
; RUN: opt %loadPolly -polly-optree -analyze < %s | FileCheck %s -match-full-lines
|
2021-02-10 11:19:47 +08:00
|
|
|
; RUN: opt %loadPolly "-passes=scop(print<polly-optree>)" -disable-output < %s | FileCheck %s -match-full-lines
|
2017-08-08 02:40:29 +08:00
|
|
|
;
|
|
|
|
|
; Rematerialize a load.
|
|
|
|
|
;
|
2017-08-09 01:26:19 +08:00
|
|
|
; for (int j = 0; j < n; j += 1) {
|
|
|
|
|
; bodyA:
|
|
|
|
|
; double val = B[j];
|
|
|
|
|
;
|
|
|
|
|
; bodyB:
|
|
|
|
|
; A[j] = val;
|
|
|
|
|
; }
|
|
|
|
|
;
|
2017-08-08 02:40:29 +08:00
|
|
|
define void @func(i32 %n, double* noalias nonnull %A, double* noalias nonnull %B) {
|
|
|
|
|
entry:
|
|
|
|
|
br label %for
|
|
|
|
|
|
|
|
|
|
for:
|
|
|
|
|
%j = phi i32 [0, %entry], [%j.inc, %inc]
|
|
|
|
|
%j.cmp = icmp slt i32 %j, %n
|
|
|
|
|
br i1 %j.cmp, label %bodyA, label %exit
|
|
|
|
|
|
|
|
|
|
bodyA:
|
|
|
|
|
%B_idx = getelementptr inbounds double, double* %B, i32 %j
|
|
|
|
|
%val = load double, double* %B_idx
|
|
|
|
|
br label %bodyB
|
|
|
|
|
|
|
|
|
|
bodyB:
|
|
|
|
|
%A_idx = getelementptr inbounds double, double* %A, i32 %j
|
|
|
|
|
store double %val, double* %A_idx
|
|
|
|
|
br label %inc
|
|
|
|
|
|
|
|
|
|
inc:
|
|
|
|
|
%j.inc = add nuw nsw i32 %j, 1
|
|
|
|
|
br label %for
|
|
|
|
|
|
|
|
|
|
exit:
|
|
|
|
|
br label %return
|
|
|
|
|
|
|
|
|
|
return:
|
|
|
|
|
ret void
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
; CHECK: Statistics {
|
|
|
|
|
; CHECK: Known loads forwarded: 1
|
|
|
|
|
; CHECK: Operand trees forwarded: 1
|
|
|
|
|
; CHECK: Statements with forwarded operand trees: 1
|
|
|
|
|
; CHECK: }
|
|
|
|
|
|
|
|
|
|
; CHECK: Stmt_bodyB
|
|
|
|
|
; CHECK-NEXT: ReadAccess := [Reduction Type: NONE] [Scalar: 0]
|
2017-11-20 06:13:34 +08:00
|
|
|
; CHECK-NEXT: ;
|
2017-08-08 02:40:29 +08:00
|
|
|
; CHECK-NEXT: new: [n] -> { Stmt_bodyB[i0] -> MemRef_B[i0] };
|
|
|
|
|
; CHECK-NEXT: MustWriteAccess := [Reduction Type: NONE] [Scalar: 0]
|
|
|
|
|
; CHECK-NEXT: [n] -> { Stmt_bodyB[i0] -> MemRef_A[i0] };
|
|
|
|
|
; CHECK-NEXT: Instructions {
|
Infer alignment of unmarked loads in IR/bitcode parsing.
For IR generated by a compiler, this is really simple: you just take the
datalayout from the beginning of the file, and apply it to all the IR
later in the file. For optimization testcases that don't care about the
datalayout, this is also really simple: we just use the default
datalayout.
The complexity here comes from the fact that some LLVM tools allow
overriding the datalayout: some tools have an explicit flag for this,
some tools will infer a datalayout based on the code generation target.
Supporting this properly required plumbing through a bunch of new
machinery: we want to allow overriding the datalayout after the
datalayout is parsed from the file, but before we use any information
from it. Therefore, IR/bitcode parsing now has a callback to allow tools
to compute the datalayout at the appropriate time.
Not sure if I covered all the LLVM tools that want to use the callback.
(clang? lli? Misc IR manipulation tools like llvm-link?). But this is at
least enough for all the LLVM regression tests, and IR without a
datalayout is not something frontends should generate.
This change had some sort of weird effects for certain CodeGen
regression tests: if the datalayout is overridden with a datalayout with
a different program or stack address space, we now parse IR based on the
overridden datalayout, instead of the one written in the file (or the
default one, if none is specified). This broke a few AVR tests, and one
AMDGPU test.
Outside the CodeGen tests I mentioned, the test changes are all just
fixing CHECK lines and moving around datalayout lines in weird places.
Differential Revision: https://reviews.llvm.org/D78403
2020-05-15 03:59:45 +08:00
|
|
|
; CHECK-NEXT: %val = load double, double* %B_idx, align 8
|
2020-05-16 06:15:09 +08:00
|
|
|
; CHECK-NEXT: store double %val, double* %A_idx, align 8
|
2017-08-08 02:40:29 +08:00
|
|
|
; CHECK-NEXT: }
|