brintos

brintos / llvm-project-archived public Read only

0
0
Text · 2.7 KiB · 20cb137 Raw
66 lines · plain
1; RUN: opt %loadNPMPolly '-passes=polly-custom<scops>' -polly-print-scops -disable-output -polly-detect-full-functions < %s 2>&1 | FileCheck %s -check-prefix=FULL2; RUN: opt %loadNPMPolly '-passes=polly-custom<scops>' -polly-print-scops -disable-output < %s 2>&1 | FileCheck %s -check-prefix=WITHOUT-FULL3 4; FULL:      Region: %bb---FunctionExit5; FULL:      Statements {6; FULL-NEXT: 	Stmt_loop_17; FULL-NEXT:         Domain :=8; FULL-NEXT:             [p] -> { Stmt_loop_1[i0] : p = 42 and 0 <= i0 <= 1025 };9; FULL-NEXT:         Schedule :=10; FULL-NEXT:             [p] -> { Stmt_loop_1[i0] -> [1, i0] };11; FULL-NEXT:         MustWriteAccess :=	[Reduction Type: NONE] [Scalar: 0]12; FULL-NEXT:             [p] -> { Stmt_loop_1[i0] -> MemRef_A[0] };13; FULL-NEXT: 	Stmt_loop_214; FULL-NEXT:         Domain :=15; FULL-NEXT:             [p] -> { Stmt_loop_2[i0] : 0 <= i0 <= 1025 and (p >= 43 or p <= 41) };16; FULL-NEXT:         Schedule :=17; FULL-NEXT:             [p] -> { Stmt_loop_2[i0] -> [0, i0] : p >= 43 or p <= 41 };18; FULL-NEXT:         MustWriteAccess :=	[Reduction Type: NONE] [Scalar: 0]19; FULL-NEXT:             [p] -> { Stmt_loop_2[i0] -> MemRef_A[0] };20; FULL-NEXT: }21 22; WITHOUT-FULL:        Region: %loop.2---%merge23; WITHOUT-FULL:        Statements {24; WITHOUT-FULL-NEXT:    	Stmt_loop_225; WITHOUT-FULL-NEXT:            Domain :=26; WITHOUT-FULL-NEXT:                { Stmt_loop_2[i0] : 0 <= i0 <= 1025 };27; WITHOUT-FULL-NEXT:            Schedule :=28; WITHOUT-FULL-NEXT:                { Stmt_loop_2[i0] -> [i0] };29; WITHOUT-FULL-NEXT:            MustWriteAccess :=	[Reduction Type: NONE] [Scalar: 0]30; WITHOUT-FULL-NEXT:                { Stmt_loop_2[i0] -> MemRef_A[0] };31; WITHOUT-FULL-NEXT:    }32 33; WITHOUT-FULL:         Region: %loop.1---%merge34; WITHOUT-FULL:         Statements {35; WITHOUT-FULL-NEXT:    	Stmt_loop_136; WITHOUT-FULL-NEXT:            Domain :=37; WITHOUT-FULL-NEXT:                { Stmt_loop_1[i0] : 0 <= i0 <= 1025 };38; WITHOUT-FULL-NEXT:            Schedule :=39; WITHOUT-FULL-NEXT:                { Stmt_loop_1[i0] -> [i0] };40; WITHOUT-FULL-NEXT:            MustWriteAccess :=	[Reduction Type: NONE] [Scalar: 0]41; WITHOUT-FULL-NEXT:                { Stmt_loop_1[i0] -> MemRef_A[0] };42; WITHOUT-FULL-NEXT:    }43 44define void @foo(ptr %A, i32 %p) {45bb:46  %cmp = icmp eq i32 %p, 4247  br i1 %cmp, label %loop.1, label %loop.248 49loop.1:50  %indvar.1 = phi i64 [0, %bb], [%indvar.next.1, %loop.1]51  %indvar.next.1 = add i64 %indvar.1, 152  store float 42.0, ptr %A53  %cmp.1 = icmp sle i64 %indvar.1, 102454  br i1 %cmp.1, label %loop.1, label %merge55 56loop.2:57  %indvar.2 = phi i64 [0, %bb], [%indvar.next.2, %loop.2]58  %indvar.next.2 = add i64 %indvar.2, 159  store float 42.0, ptr %A60  %cmp.2 = icmp sle i64 %indvar.2, 102461  br i1 %cmp.2, label %loop.2, label %merge62 63merge:64  ret void65}66