brintos

brintos / llvm-project-archived public Read only

0
0
Text · 1.2 KiB · 83cfd91 Raw
45 lines · plain
1; RUN: opt < %s -passes=loop-interchange -pass-remarks-output=%t \2; RUN:     -disable-output3; RUN: FileCheck -input-file %t %s4 5; Check that loop interchange bails out early when finding a direction vector6; with all '*' elements.7;8; for (int i = 0; i < 4; i++)9;   for (int j = 0; j < 4; j++)10;     A[i & val][j & val] = 0;11 12; CHECK:      --- !Missed13; CHECK-NEXT: Pass:            loop-interchange14; CHECK-NEXT: Name:            Dependence15; CHECK-NEXT: Function:        f16; CHECK-NEXT: Args:17; CHECK-NEXT:   - String:          All loops have dependencies in all directions.18; CHECK-NEXT: ...19define void @f(ptr %A, i64 %val) {20entry:21  br label %for.i.header22 23for.i.header:24  %i = phi i64 [ 0, %entry ], [ %i.next, %for.i.latch ]25  br label %for.j26 27for.j:28  %j = phi i64 [ 0, %for.i.header ], [ %j.next, %for.j ]29  %subscript.0 = and i64 %i, %val30  %subscript.1 = and i64 %j, %val31  %idx = getelementptr inbounds [4 x i8], ptr %A, i64 %subscript.0, i64 %subscript.132  store i8 0, ptr %idx33  %j.next = add nuw nsw i64 %j, 134  %exit.j = icmp eq i64 %j.next, 435  br i1 %exit.j, label %for.i.latch, label %for.j36 37for.i.latch:38  %i.next = add nuw nsw i64 %i, 139  %exit.i = icmp eq i64 %i.next, 440  br i1 %exit.i, label %exit, label %for.i.header41 42exit:43  ret void44}45