mirror of
https://github.com/capstone-engine/llvm-capstone.git
synced 2024-12-28 18:54:55 +00:00
d8d32bb3d1
Add optimization-remarks-missed for when mapping targets have been skipped and add regression tests for them. llvm-svn: 295953
46 lines
982 B
LLVM
46 lines
982 B
LLVM
; RUN: opt %loadPolly -polly-delicm -analyze -pass-remarks-missed=polly-delicm < %s 2>&1 | FileCheck %s
|
|
;
|
|
; void func(double *A) {
|
|
; double phi = 0.0;
|
|
; for (int i = 0; i < 4; i += 1) /* reduction */
|
|
; phi += 4.2;
|
|
; A[0] = phi;
|
|
; }
|
|
;
|
|
define void @func(double* noalias nonnull %A) {
|
|
entry:
|
|
br label %reduction.preheader
|
|
|
|
reduction.preheader:
|
|
br label %reduction.for
|
|
|
|
reduction.for:
|
|
%i = phi i32 [0, %reduction.preheader], [%i.inc, %reduction.inc]
|
|
%phi = phi double [0.0, %reduction.preheader], [%add, %reduction.inc]
|
|
%i.cmp = icmp slt i32 %i, 4
|
|
br i1 %i.cmp, label %body, label %reduction.exit
|
|
|
|
|
|
|
|
body:
|
|
%add = fadd double %phi, 4.2
|
|
br label %reduction.inc
|
|
|
|
|
|
|
|
reduction.inc:
|
|
%i.inc = add nuw nsw i32 %i, 1
|
|
br label %reduction.for
|
|
|
|
reduction.exit:
|
|
store double %phi, double* %A
|
|
br label %return
|
|
|
|
|
|
return:
|
|
ret void
|
|
}
|
|
|
|
|
|
; CHECK: skipped possible mapping target because it is not in a loop
|