| ; RUN: opt -passes=loop-simplify,loop-distribute -enable-loop-distribute -S < %s 2>&1 \ | |
| ; RUN: | FileCheck %s --check-prefix=ALWAYS --check-prefix=NO_REMARKS | |
| ; RUN: opt -passes=loop-simplify,loop-distribute -enable-loop-distribute -S \ | |
| ; RUN: -pass-remarks-missed=loop-distribute < %s 2>&1 \ | |
| ; RUN: | FileCheck %s --check-prefix=ALWAYS --check-prefix=MISSED_REMARKS | |
| ; RUN: opt -passes=loop-simplify,loop-distribute -enable-loop-distribute -S \ | |
| ; RUN: -pass-remarks-analysis=loop-distribute < %s 2>&1 \ | |
| ; RUN: | FileCheck %s --check-prefix=ALWAYS --check-prefix=ANALYSIS_REMARKS | |
| ; RUN: opt -passes=loop-simplify,loop-distribute -enable-loop-distribute -S \ | |
| ; RUN: -pass-remarks=loop-distribute < %s 2>&1 \ | |
| ; RUN: | FileCheck %s --check-prefix=ALWAYS --check-prefix=REMARKS | |
| ; This is the input program: | |
| ; | |
| ; 1 void forced (char *A, char *B, char *C, int N) { | |
| ; 2 #pragma clang loop distribute(enable) | |
| ; 3 for(int i = 0; i < N; i++) { | |
| ; 4 A[i] = B[i] * C[i]; | |
| ; 5 } | |
| ; 6 } | |
| ; 7 | |
| ; 8 void not_forced (char *A, char *B, char *C, int N) { | |
| ; 9 for(int i = 0; i < N; i++) { | |
| ; 10 A[i] = B[i] * C[i]; | |
| ; 11 } | |
| ; 12 } | |
| ; 13 | |
| ; 14 void success (char *A, char *B, char *C, char *D, char *E, int N) { | |
| ; 15 for(int i = 0; i < N; i++) { | |
| ; 16 A[i + 1] = A[i] + B[i]; | |
| ; 17 C[i] = D[i] * E[i]; | |
| ; 18 } | |
| ; 19 } | |
| ; MISSED_REMARKS: remark: /tmp/t.c:3:3: loop not distributed: use -Rpass-analysis=loop-distribute for more info | |
| ; ALWAYS: remark: /tmp/t.c:3:3: loop not distributed: memory operations are safe for vectorization | |
| ; ALWAYS: warning: /tmp/t.c:3:3: loop not distributed: failed explicitly specified loop distribution | |
| define void @forced(ptr %A, ptr %B, ptr %C, i32 %N) !dbg !7 { | |
| entry: | |
| %cmp12 = icmp sgt i32 %N, 0, !dbg !9 | |
| br i1 %cmp12, label %ph, label %for.cond.cleanup, !dbg !10 | |
| ph: | |
| br label %for.body | |
| for.body: | |
| %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %ph ] | |
| %arrayidx = getelementptr inbounds i8, ptr %B, i64 %indvars.iv, !dbg !12 | |
| %0 = load i8, ptr %arrayidx, align 1, !dbg !12, !tbaa !13 | |
| %arrayidx2 = getelementptr inbounds i8, ptr %C, i64 %indvars.iv, !dbg !16 | |
| %1 = load i8, ptr %arrayidx2, align 1, !dbg !16, !tbaa !13 | |
| %mul = mul i8 %1, %0, !dbg !17 | |
| %arrayidx6 = getelementptr inbounds i8, ptr %A, i64 %indvars.iv, !dbg !18 | |
| store i8 %mul, ptr %arrayidx6, align 1, !dbg !19, !tbaa !13 | |
| %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1, !dbg !10 | |
| %lftr.wideiv = trunc i64 %indvars.iv.next to i32, !dbg !10 | |
| %exitcond = icmp eq i32 %lftr.wideiv, %N, !dbg !10 | |
| br i1 %exitcond, label %for.cond.cleanup, label %for.body, !dbg !10, !llvm.loop !20 | |
| for.cond.cleanup: | |
| ret void, !dbg !11 | |
| } | |
| ; NO_REMARKS-NOT: remark: /tmp/t.c:9:3: loop not distributed: memory operations are safe for vectorization | |
| ; MISSED_REMARKS: remark: /tmp/t.c:9:3: loop not distributed: use -Rpass-analysis=loop-distribute for more info | |
| ; ANALYSIS_REMARKS: remark: /tmp/t.c:9:3: loop not distributed: memory operations are safe for vectorization | |
| ; ALWAYS-NOT: warning: /tmp/t.c:9:3: loop not distributed: failed explicitly specified loop distribution | |
| define void @not_forced(ptr %A, ptr %B, ptr %C, i32 %N) !dbg !22 { | |
| entry: | |
| %cmp12 = icmp sgt i32 %N, 0, !dbg !23 | |
| br i1 %cmp12, label %ph, label %for.cond.cleanup, !dbg !24 | |
| ph: | |
| br label %for.body | |
| for.body: | |
| %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %ph ] | |
| %arrayidx = getelementptr inbounds i8, ptr %B, i64 %indvars.iv, !dbg !26 | |
| %0 = load i8, ptr %arrayidx, align 1, !dbg !26, !tbaa !13 | |
| %arrayidx2 = getelementptr inbounds i8, ptr %C, i64 %indvars.iv, !dbg !27 | |
| %1 = load i8, ptr %arrayidx2, align 1, !dbg !27, !tbaa !13 | |
| %mul = mul i8 %1, %0, !dbg !28 | |
| %arrayidx6 = getelementptr inbounds i8, ptr %A, i64 %indvars.iv, !dbg !29 | |
| store i8 %mul, ptr %arrayidx6, align 1, !dbg !30, !tbaa !13 | |
| %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1, !dbg !24 | |
| %lftr.wideiv = trunc i64 %indvars.iv.next to i32, !dbg !24 | |
| %exitcond = icmp eq i32 %lftr.wideiv, %N, !dbg !24 | |
| br i1 %exitcond, label %for.cond.cleanup, label %for.body, !dbg !24 | |
| for.cond.cleanup: | |
| ret void, !dbg !25 | |
| } | |
| ; REMARKS: remark: /tmp/t.c:15:3: distributed loop | |
| define void @success(ptr %A, ptr %B, ptr %C, ptr %D, ptr %E, i32 %N) !dbg !31 { | |
| entry: | |
| %cmp28 = icmp sgt i32 %N, 0, !dbg !32 | |
| br i1 %cmp28, label %ph, label %for.cond.cleanup, !dbg !33 | |
| ph: | |
| br label %for.body | |
| for.body: | |
| %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %ph ] | |
| %arrayidx = getelementptr inbounds i8, ptr %A, i64 %indvars.iv, !dbg !35 | |
| %0 = load i8, ptr %arrayidx, align 1, !dbg !35, !tbaa !13 | |
| %arrayidx2 = getelementptr inbounds i8, ptr %B, i64 %indvars.iv, !dbg !36 | |
| %1 = load i8, ptr %arrayidx2, align 1, !dbg !36, !tbaa !13 | |
| %add = add i8 %1, %0, !dbg !37 | |
| %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1, !dbg !33 | |
| %arrayidx7 = getelementptr inbounds i8, ptr %A, i64 %indvars.iv.next, !dbg !38 | |
| store i8 %add, ptr %arrayidx7, align 1, !dbg !39, !tbaa !13 | |
| %arrayidx9 = getelementptr inbounds i8, ptr %D, i64 %indvars.iv, !dbg !40 | |
| %2 = load i8, ptr %arrayidx9, align 1, !dbg !40, !tbaa !13 | |
| %arrayidx12 = getelementptr inbounds i8, ptr %E, i64 %indvars.iv, !dbg !41 | |
| %3 = load i8, ptr %arrayidx12, align 1, !dbg !41, !tbaa !13 | |
| %mul = mul i8 %3, %2, !dbg !42 | |
| %arrayidx16 = getelementptr inbounds i8, ptr %C, i64 %indvars.iv, !dbg !43 | |
| store i8 %mul, ptr %arrayidx16, align 1, !dbg !44, !tbaa !13 | |
| %lftr.wideiv = trunc i64 %indvars.iv.next to i32, !dbg !33 | |
| %exitcond = icmp eq i32 %lftr.wideiv, %N, !dbg !33 | |
| br i1 %exitcond, label %for.cond.cleanup, label %for.body, !dbg !33 | |
| for.cond.cleanup: | |
| ret void, !dbg !34 | |
| } | |
| ; MISSED_REMARKS: /tmp/t.c:27:5: loop not distributed: use -Rpass-analysis=loop-distribute for more info | |
| ; ANALYSIS_REMARKS: /tmp/t.c:27:5: loop not distributed: may not insert runtime check with convergent operation | |
| ; ALWAYS: warning: /tmp/t.c:27:5: loop not distributed: failed explicitly specified loop distribution | |
| define void @convergent(ptr %A, ptr %B, ptr %C, ptr %D, ptr %E, i32 %N) #1 !dbg !45 { | |
| entry: | |
| %cmp28 = icmp sgt i32 %N, 0, !dbg !46 | |
| br i1 %cmp28, label %ph, label %for.cond.cleanup, !dbg !47 | |
| ph: | |
| br label %for.body | |
| for.body: | |
| %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %ph ] | |
| %arrayidx = getelementptr inbounds i8, ptr %A, i64 %indvars.iv, !dbg !49 | |
| %0 = load i8, ptr %arrayidx, align 1, !dbg !49, !tbaa !13 | |
| %arrayidx2 = getelementptr inbounds i8, ptr %B, i64 %indvars.iv, !dbg !50 | |
| %1 = load i8, ptr %arrayidx2, align 1, !dbg !50, !tbaa !13 | |
| %add = add i8 %1, %0, !dbg !51 | |
| %indvars.iv.next = add nuw nsw i64 %indvars.iv, 1, !dbg !57 | |
| %arrayidx7 = getelementptr inbounds i8, ptr %A, i64 %indvars.iv.next, !dbg !52 | |
| store i8 %add, ptr %arrayidx7, align 1, !dbg !53, !tbaa !13 | |
| %arrayidx9 = getelementptr inbounds i8, ptr %D, i64 %indvars.iv, !dbg !54 | |
| %2 = load i8, ptr %arrayidx9, align 1, !dbg !54, !tbaa !13 | |
| %arrayidx12 = getelementptr inbounds i8, ptr %E, i64 %indvars.iv, !dbg !55 | |
| %3 = load i8, ptr %arrayidx12, align 1, !dbg !55, !tbaa !13 | |
| %mul = mul i8 %3, %2, !dbg !56 | |
| %arrayidx16 = getelementptr inbounds i8, ptr %C, i64 %indvars.iv, !dbg !57 | |
| store i8 %mul, ptr %arrayidx16, align 1, !dbg !58, !tbaa !13 | |
| call void @llvm.convergent() | |
| %lftr.wideiv = trunc i64 %indvars.iv.next to i32, !dbg !57 | |
| %exitcond = icmp eq i32 %lftr.wideiv, %N, !dbg !57 | |
| br i1 %exitcond, label %for.cond.cleanup, label %for.body, !llvm.loop !20, !dbg !57 | |
| for.cond.cleanup: | |
| ret void, !dbg !58 | |
| } | |
| declare void @llvm.convergent() #0 | |
| attributes #0 = { nounwind readnone convergent } | |
| attributes #1 = { nounwind convergent } | |
| !llvm.dbg.cu = !{!0} | |
| !llvm.module.flags = !{!3, !4} | |
| !0 = distinct !DICompileUnit(language: DW_LANG_C99, file: !1, producer: "clang version 3.9.0 (trunk 267633) (llvm/trunk 267675)", isOptimized: true, runtimeVersion: 0, emissionKind: LineTablesOnly, enums: !2) | |
| !1 = !DIFile(filename: "/tmp/t.c", directory: "/tmp") | |
| !2 = !{} | |
| !3 = !{i32 2, !"Dwarf Version", i32 2} | |
| !4 = !{i32 2, !"Debug Info Version", i32 3} | |
| !7 = distinct !DISubprogram(name: "forced", scope: !1, file: !1, line: 1, type: !8, isLocal: false, isDefinition: true, scopeLine: 1, flags: DIFlagPrototyped, isOptimized: true, unit: !0, retainedNodes: !2) | |
| !8 = !DISubroutineType(types: !2) | |
| !9 = !DILocation(line: 3, column: 20, scope: !7) | |
| !10 = !DILocation(line: 3, column: 3, scope: !7) | |
| !11 = !DILocation(line: 6, column: 1, scope: !7) | |
| !12 = !DILocation(line: 4, column: 12, scope: !7) | |
| !13 = !{!14, !14, i64 0} | |
| !14 = !{!"omnipotent char", !15, i64 0} | |
| !15 = !{!"Simple C/C++ TBAA"} | |
| !16 = !DILocation(line: 4, column: 19, scope: !7) | |
| !17 = !DILocation(line: 4, column: 17, scope: !7) | |
| !18 = !DILocation(line: 4, column: 5, scope: !7) | |
| !19 = !DILocation(line: 4, column: 10, scope: !7) | |
| !20 = distinct !{!20, !21} | |
| !21 = !{!"llvm.loop.distribute.enable"} | |
| !22 = distinct !DISubprogram(name: "not_forced", scope: !1, file: !1, line: 8, type: !8, isLocal: false, isDefinition: true, scopeLine: 8, flags: DIFlagPrototyped, isOptimized: true, unit: !0, retainedNodes: !2) | |
| !23 = !DILocation(line: 9, column: 20, scope: !22) | |
| !24 = !DILocation(line: 9, column: 3, scope: !22) | |
| !25 = !DILocation(line: 12, column: 1, scope: !22) | |
| !26 = !DILocation(line: 10, column: 12, scope: !22) | |
| !27 = !DILocation(line: 10, column: 19, scope: !22) | |
| !28 = !DILocation(line: 10, column: 17, scope: !22) | |
| !29 = !DILocation(line: 10, column: 5, scope: !22) | |
| !30 = !DILocation(line: 10, column: 10, scope: !22) | |
| !31 = distinct !DISubprogram(name: "success", scope: !1, file: !1, line: 14, type: !8, isLocal: false, isDefinition: true, scopeLine: 14, flags: DIFlagPrototyped, isOptimized: true, unit: !0, retainedNodes: !2) | |
| !32 = !DILocation(line: 15, column: 20, scope: !31) | |
| !33 = !DILocation(line: 15, column: 3, scope: !31) | |
| !34 = !DILocation(line: 19, column: 1, scope: !31) | |
| !35 = !DILocation(line: 16, column: 16, scope: !31) | |
| !36 = !DILocation(line: 16, column: 23, scope: !31) | |
| !37 = !DILocation(line: 16, column: 21, scope: !31) | |
| !38 = !DILocation(line: 16, column: 5, scope: !31) | |
| !39 = !DILocation(line: 16, column: 14, scope: !31) | |
| !40 = !DILocation(line: 17, column: 12, scope: !31) | |
| !41 = !DILocation(line: 17, column: 19, scope: !31) | |
| !42 = !DILocation(line: 17, column: 17, scope: !31) | |
| !43 = !DILocation(line: 17, column: 5, scope: !31) | |
| !44 = !DILocation(line: 17, column: 10, scope: !31) | |
| !45 = distinct !DISubprogram(name: "convergent", scope: !1, file: !1, line: 24, type: !8, isLocal: false, isDefinition: true, scopeLine: 24, flags: DIFlagPrototyped, isOptimized: true, unit: !0, retainedNodes: !2) | |
| !46 = !DILocation(line: 25, column: 20, scope: !45) | |
| !47 = !DILocation(line: 25, column: 3, scope: !45) | |
| !48 = !DILocation(line: 29, column: 1, scope: !45) | |
| !49 = !DILocation(line: 26, column: 16, scope: !45) | |
| !50 = !DILocation(line: 26, column: 23, scope: !45) | |
| !51 = !DILocation(line: 26, column: 21, scope: !45) | |
| !52 = !DILocation(line: 26, column: 5, scope: !45) | |
| !53 = !DILocation(line: 26, column: 14, scope: !45) | |
| !54 = !DILocation(line: 27, column: 12, scope: !45) | |
| !55 = !DILocation(line: 27, column: 19, scope: !45) | |
| !56 = !DILocation(line: 27, column: 17, scope: !45) | |
| !57 = !DILocation(line: 27, column: 5, scope: !45) | |
| !58 = !DILocation(line: 27, column: 10, scope: !45) |