1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
; RUN: opt -passes="loop-vectorize" -mtriple=x86_64-unknown-linux -S -debug %s 2>&1 | FileCheck %s
; REQUIRES: asserts
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"
target triple = "x86_64-unknown-linux"
declare double @llvm.pow.f64(double, double)
; Test case where the memory runtime checks and vector body is more expensive
; than running the scalar loop.
define void @test(ptr nocapture %A, ptr nocapture %B, ptr nocapture %C, ptr nocapture %D, ptr nocapture %E) {
; CHECK: Calculating cost of runtime checks:
; CHECK-NEXT: 0 for {{.+}} = getelementptr i8, ptr %A, i64 128
; CHECK-NEXT: 0 for {{.+}} = getelementptr i8, ptr %B, i64 128
; CHECK-NEXT: 0 for {{.+}} = getelementptr i8, ptr %E, i64 128
; CHECK-NEXT: 0 for {{.+}} = getelementptr i8, ptr %C, i64 128
; CHECK-NEXT: 0 for {{.+}} = getelementptr i8, ptr %D, i64 128
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = and i1
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = and i1
; CHECK-NEXT: 1 for {{.+}} = or i1
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = and i1
; CHECK-NEXT: 1 for {{.+}} = or i1
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = and i1
; CHECK-NEXT: 1 for {{.+}} = or i1
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = and i1
; CHECK-NEXT: 1 for {{.+}} = or i1
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = and i1
; CHECK-NEXT: 1 for {{.+}} = or i1
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = and i1
; CHECK-NEXT: 1 for {{.+}} = or i1
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = and i1
; CHECK-NEXT: 1 for {{.+}} = or i1
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = icmp ult ptr
; CHECK-NEXT: 1 for {{.+}} = and i1
; CHECK-NEXT: 1 for {{.+}} = or i1
; CHECK-NEXT: Total cost of runtime checks: 35
; CHECK: LV: Vectorization is not beneficial: expected trip count < minimum profitable VF (16 < 24)
;
; CHECK-LABEL: @test(
; CHECK-NEXT: entry:
; CHECK-NEXT: br label %for.body
; CHECK-NOT: vector.memcheck
; CHECK-NOT: vector.body
;
entry:
br label %for.body
for.body:
%iv = phi i64 [ 0, %entry ], [ %iv.next, %for.body ]
%gep.A = getelementptr inbounds double, ptr %A, i64 %iv
%l.A = load double, ptr %gep.A, align 4
store double 0.0, ptr %gep.A, align 4
%p.1 = call double @llvm.pow.f64(double %l.A, double 2.0)
%gep.B = getelementptr inbounds double, ptr %B, i64 %iv
%l.B = load double, ptr %gep.B, align 4
%p.2 = call double @llvm.pow.f64(double %l.B, double %p.1)
store double 0.0, ptr %gep.B, align 4
%gep.C = getelementptr inbounds double, ptr %C, i64 %iv
%l.C = load double, ptr %gep.C, align 4
%p.3 = call double @llvm.pow.f64(double %p.1, double %l.C)
%gep.D = getelementptr inbounds double, ptr %D, i64 %iv
%l.D = load double, ptr %gep.D
%p.4 = call double @llvm.pow.f64(double %p.2, double %l.D)
%p.5 = call double @llvm.pow.f64(double %p.4, double %p.3)
%mul = fmul double 2.0, %p.5
%mul.2 = fmul double %mul, 2.0
%mul.3 = fmul double %mul, %mul.2
%gep.E = getelementptr inbounds double, ptr %E, i64 %iv
store double %mul.3, ptr %gep.E, align 4
%iv.next = add i64 %iv, 1
%exitcond = icmp eq i64 %iv.next, 16
br i1 %exitcond, label %for.end, label %for.body
for.end:
ret void
}
|
