Imported Upstream version 6.10.0.49

Former-commit-id: 1d6753294b2993e1fbf92de9366bb9544db4189b
This commit is contained in:
Xamarin Public Jenkins (auto-signing)
2020-01-16 16:38:04 +00:00
parent d94e79959b
commit 468663ddbb
48518 changed files with 2789335 additions and 61176 deletions

View File

@@ -0,0 +1,57 @@
; RUN: opt %loadPolly -polly-ast -polly-parallel -polly-parallel-force -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polyhedral-info -polly-check-parallel -analyze < %s | FileCheck %s -check-prefix=PINFO
;
; void jd(int *A) {
; CHECK: #pragma omp parallel for
; PINFO: for.cond2: Loop is parallel.
; for (int i = 0; i < 1024; i++)
; A[i] = 1;
; CHECK: #pragma omp parallel for
; PINFO: for.cond: Loop is parallel.
; for (int i = 0; i < 1024; i++)
; A[i] = A[i] * 2;
; }
;
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
define void @jd(i32* %A) {
entry:
br label %for.cond
for.cond: ; preds = %for.inc, %entry
%indvars.iv1 = phi i64 [ %indvars.iv.next2, %for.inc ], [ 0, %entry ]
%exitcond3 = icmp ne i64 %indvars.iv1, 1024
br i1 %exitcond3, label %for.body, label %for.end
for.body: ; preds = %for.cond
%arrayidx = getelementptr inbounds i32, i32* %A, i64 %indvars.iv1
store i32 1, i32* %arrayidx, align 4
br label %for.inc
for.inc: ; preds = %for.body
%indvars.iv.next2 = add nuw nsw i64 %indvars.iv1, 1
br label %for.cond
for.end: ; preds = %for.cond
br label %for.cond2
for.cond2: ; preds = %for.inc9, %for.end
%indvars.iv = phi i64 [ %indvars.iv.next, %for.inc9 ], [ 0, %for.end ]
%exitcond = icmp ne i64 %indvars.iv, 1024
br i1 %exitcond, label %for.body4, label %for.end11
for.body4: ; preds = %for.cond2
%arrayidx6 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
%tmp = load i32, i32* %arrayidx6, align 4
%mul = shl nsw i32 %tmp, 1
%arrayidx8 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
store i32 %mul, i32* %arrayidx8, align 4
br label %for.inc9
for.inc9: ; preds = %for.body4
%indvars.iv.next = add nuw nsw i64 %indvars.iv, 1
br label %for.cond2
for.end11: ; preds = %for.cond2
ret void
}

View File

@@ -0,0 +1,55 @@
; RUN: opt %loadPolly -polly-ast -polly-parallel -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polyhedral-info -polly-check-parallel -analyze < %s | FileCheck %s -check-prefix=PINFO
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"
; for (i = 0; i < 1024; i++)
; for (j = 0; j < 1024; j++)
; A[i][j] = 1;
@A = common global [1024 x [1024 x i32]] zeroinitializer
define void @bar() {
start:
fence seq_cst
br label %loop.i
loop.i:
%i = phi i64 [ 0, %start ], [ %i.next, %loop.i.backedge ]
%exitcond.i = icmp ne i64 %i, 1024
br i1 %exitcond.i, label %loop.j, label %ret
loop.j:
%j = phi i64 [ 0, %loop.i], [ %j.next, %loop.j.backedge ]
%exitcond.j = icmp ne i64 %j, 1024
br i1 %exitcond.j, label %loop.body, label %loop.i.backedge
loop.body:
%scevgep = getelementptr [1024 x [1024 x i32] ], [1024 x [1024 x i32] ]* @A, i64 0, i64 %j, i64 %i
store i32 1, i32* %scevgep
br label %loop.j.backedge
loop.j.backedge:
%j.next = add nsw i64 %j, 1
br label %loop.j
loop.i.backedge:
%i.next = add nsw i64 %i, 1
br label %loop.i
ret:
fence seq_cst
ret void
}
; Make sure we do not accidentally generate nested openmp parallel for
; annotations.
; CHECK: #pragma omp parallel for
; CHECK: for (int c0 = 0; c0 <= 1023; c0 += 1)
; CHECK-NOT: #pragma omp parallel for
; CHECK: #pragma simd
; CHECK-NOT: #pragma omp parallel for
; CHECK: for (int c1 = 0; c1 <= 1023; c1 += 1)
; CHECK: Stmt_loop_body(c0, c1);
;
; PINFO: loop.i: Loop is parallel.
; PINFO-NEXT: loop.j: Loop is parallel.

View File

@@ -0,0 +1,52 @@
; RUN: opt %loadPolly -polly-ast -polly-parallel -polly-parallel-force -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polyhedral-info -polly-check-parallel -analyze < %s | FileCheck %s -check-prefix=PINFO
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"
; int A[1024][1024];
; void bar(int n) {
; for (i = 0; i < n; i++)
; for (j = 0; j < n; j++)
; A[i][j] = 1;
; }
@A = common global [1024 x [1024 x i32]] zeroinitializer
define void @bar(i64 %n) {
start:
fence seq_cst
br label %loop.i
loop.i:
%i = phi i64 [ 0, %start ], [ %i.next, %loop.i.backedge ]
%exitcond.i = icmp ne i64 %i, %n
br i1 %exitcond.i, label %loop.j, label %ret
loop.j:
%j = phi i64 [ 0, %loop.i], [ %j.next, %loop.j.backedge ]
%exitcond.j = icmp ne i64 %j, %n
br i1 %exitcond.j, label %loop.body, label %loop.i.backedge
loop.body:
%scevgep = getelementptr [1024 x [1024 x i32] ], [1024 x [1024 x i32] ]* @A, i64 0, i64 %j, i64 %i
store i32 1, i32* %scevgep
br label %loop.j.backedge
loop.j.backedge:
%j.next = add nsw i64 %j, 1
br label %loop.j
loop.i.backedge:
%i.next = add nsw i64 %i, 1
br label %loop.i
ret:
fence seq_cst
ret void
}
; CHECK: if (n <= 1024)
; CHECK: #pragma omp parallel for
; CHECK: for (int c0 = 0; c0 < n; c0 += 1)
; CHECK: #pragma simd
; CHECK: for (int c1 = 0; c1 < n; c1 += 1)
; CHECK: Stmt_loop_body(c0, c1);
; PINFO: loop.i: Loop is parallel.
; PINFO-NEXT: loop.j: Loop is parallel.

View File

@@ -0,0 +1,50 @@
; RUN: opt %loadPolly -polly-ast -polly-parallel -polly-parallel-force -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polyhedral-info -polly-check-parallel -analyze < %s | FileCheck %s -check-prefix=PINFO
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"
; for (i = 0; i < n; i++)
; for (j = 0; j < n; j++)
; A[j] = 1;
@A = common global [1024 x i32] zeroinitializer
define void @bar(i64 %n) {
start:
fence seq_cst
br label %loop.i
loop.i:
%i = phi i64 [ 0, %start ], [ %i.next, %loop.i.backedge ]
%exitcond.i = icmp ne i64 %i, %n
br i1 %exitcond.i, label %loop.j, label %ret
loop.j:
%j = phi i64 [ 0, %loop.i], [ %j.next, %loop.j.backedge ]
%exitcond.j = icmp ne i64 %j, %n
br i1 %exitcond.j, label %loop.body, label %loop.i.backedge
loop.body:
%scevgep = getelementptr [1024 x i32], [1024 x i32]* @A, i64 0, i64 %j
store i32 1, i32* %scevgep
br label %loop.j.backedge
loop.j.backedge:
%j.next = add nsw i64 %j, 1
br label %loop.j
loop.i.backedge:
%i.next = add nsw i64 %i, 1
br label %loop.i
ret:
fence seq_cst
ret void
}
; CHECK: for (int c0 = 0; c0 < n; c0 += 1)
; CHECK: #pragma simd
; CHECK: #pragma omp parallel for
; CHECK: for (int c1 = 0; c1 < n; c1 += 1)
; CHECK: Stmt_loop_body(c0, c1);
; PINFO: loop.i: Loop is not parallel.
; PINFO-NEXT: loop.j: Loop is parallel.

View File

@@ -0,0 +1,49 @@
; RUN: opt %loadPolly -polly-ast -polly-parallel -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polyhedral-info -polly-check-parallel -analyze < %s | FileCheck %s -check-prefix=PINFO
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"
; for (i = 0; i < n; i++)
; for (j = 0; j < n; j++)
; A[i] = 1;
@A = common global [1024 x i32] zeroinitializer
define void @bar(i64 %n) {
start:
fence seq_cst
br label %loop.i
loop.i:
%i = phi i64 [ 0, %start ], [ %i.next, %loop.i.backedge ]
%exitcond.i = icmp ne i64 %i, %n
br i1 %exitcond.i, label %loop.j, label %ret
loop.j:
%j = phi i64 [ 0, %loop.i], [ %j.next, %loop.j.backedge ]
%exitcond.j = icmp ne i64 %j, %n
br i1 %exitcond.j, label %loop.body, label %loop.i.backedge
loop.body:
%scevgep = getelementptr [1024 x i32], [1024 x i32]* @A, i64 0, i64 %i
store i32 1, i32* %scevgep
br label %loop.j.backedge
loop.j.backedge:
%j.next = add nsw i64 %j, 1
br label %loop.j
loop.i.backedge:
%i.next = add nsw i64 %i, 1
br label %loop.i
ret:
fence seq_cst
ret void
}
; CHECK: #pragma omp parallel for
; CHECK: for (int c0 = 0; c0 < n; c0 += 1)
; CHECK: for (int c1 = 0; c1 < n; c1 += 1)
; CHECK: Stmt_loop_body(c0, c1);
; PINFO: loop.i: Loop is parallel.
; PINFO-NEXT: loop.j: Loop is not parallel.

View File

@@ -0,0 +1,35 @@
; RUN: opt %loadPolly -polly-ast -polly-parallel -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polyhedral-info -polly-check-parallel -analyze < %s | FileCheck %s -check-prefix=PINFO
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"
; for (i = 0; i < n; i++)
; A[0] = i;
@A = common global [1024 x i32] zeroinitializer
define void @bar(i64 %n) {
start:
fence seq_cst
br label %loop.header
loop.header:
%i = phi i64 [ 0, %start ], [ %i.next, %loop.backedge ]
%scevgep = getelementptr [1024 x i32], [1024 x i32]* @A, i64 0, i64 0
%exitcond = icmp ne i64 %i, %n
br i1 %exitcond, label %loop.body, label %ret
loop.body:
store i32 1, i32* %scevgep
br label %loop.backedge
loop.backedge:
%i.next = add nsw i64 %i, 1
br label %loop.header
ret:
fence seq_cst
ret void
}
; CHECK: for (int c0 = 0; c0 < n; c0 += 1)
; CHECK: Stmt_loop_body(c0)
; PINFO: loop.header: Loop is not parallel.

View File

@@ -0,0 +1,37 @@
; RUN: opt %loadPolly -polly-ast -polly-parallel -polly-parallel-force -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polyhedral-info -polly-check-parallel -analyze < %s | FileCheck %s -check-prefix=PINFO
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"
; for (i = 0; i < n; i++)
; A[i] = 1;
@A = common global [1024 x i32] zeroinitializer
define void @bar(i64 %n) {
start:
fence seq_cst
br label %loop.header
loop.header:
%i = phi i64 [ 0, %start ], [ %i.next, %loop.backedge ]
%scevgep = getelementptr [1024 x i32], [1024 x i32]* @A, i64 0, i64 %i
%exitcond = icmp ne i64 %i, %n
br i1 %exitcond, label %loop.body, label %ret
loop.body:
store i32 1, i32* %scevgep
br label %loop.backedge
loop.backedge:
%i.next = add nsw i64 %i, 1
br label %loop.header
ret:
fence seq_cst
ret void
}
; CHECK: #pragma simd
; CHECK: #pragma omp parallel for
; CHECK: for (int c0 = 0; c0 < n; c0 += 1)
; CHECK: Stmt_loop_body(c0)
; PINFO: loop.header: Loop is parallel.

View File

@@ -0,0 +1,37 @@
; RUN: opt %loadPolly -polly-ast -polly-parallel -polly-dependences-computeout=1 -analyze < %s | FileCheck %s
; RUN: opt %loadPolly -polyhedral-info -polly-check-parallel -analyze < %s | FileCheck %s -check-prefix=PINFO
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"
; for (i = 0; i < n; i++)
; A[i] = 1;
@A = common global [1024 x i32] zeroinitializer
define void @bar(i64 %n) {
start:
fence seq_cst
br label %loop.header
loop.header:
%i = phi i64 [ 0, %start ], [ %i.next, %loop.backedge ]
%scevgep = getelementptr [1024 x i32], [1024 x i32]* @A, i64 0, i64 %i
%exitcond = icmp ne i64 %i, %n
br i1 %exitcond, label %loop.body, label %ret
loop.body:
store i32 1, i32* %scevgep
br label %loop.backedge
loop.backedge:
%i.next = add nsw i64 %i, 1
br label %loop.header
ret:
fence seq_cst
ret void
}
; CHECK-NOT: #pragma simd
; CHECK-NOT: #pragma omp parallel for
; CHECK: for (int c0 = 0; c0 < n; c0 += 1)
; CHECK: Stmt_loop_body(c0)
; PINFO: loop.header: Loop is parallel.