197 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 42; RUN: opt -passes='print<access-info><allow-partial>' -disable-output %s 2>&1 | FileCheck %s3 4target datalayout = "e-m:o-i64:64-i128:128-n32:64-S128"5 6; Test case for https://github.com/llvm/llvm-project/issues/82665.7define void @indirect_ptr_recurrences_read_write(ptr %A, ptr %B) {8; CHECK-LABEL: 'indirect_ptr_recurrences_read_write'9; CHECK-NEXT: loop:10; CHECK-NEXT: Report: unsafe dependent memory operations in loop. Use #pragma clang loop distribute(enable) to allow loop distribution to attempt to isolate the offending operations into a separate loop11; CHECK-NEXT: Unsafe indirect dependence.12; CHECK-NEXT: Dependences:13; CHECK-NEXT: IndirectUnsafe:14; CHECK-NEXT: %l = load i32, ptr %ptr.recur, align 4, !tbaa !4 ->15; CHECK-NEXT: store i32 %xor, ptr %ptr.recur, align 4, !tbaa !416; CHECK-EMPTY:17; CHECK-NEXT: Run-time memory checks:18; CHECK-NEXT: Grouped accesses:19; CHECK-EMPTY:20; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.21; CHECK-NEXT: SCEV assumptions:22; CHECK-EMPTY:23; CHECK-NEXT: Expressions re-written:24;25entry:26 br label %loop27 28loop:29 %iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]30 %ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]31 %gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv32 %ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !633 %l = load i32, ptr %ptr.recur, align 4, !tbaa !1034 %xor = xor i32 %l, 135 store i32 %xor, ptr %ptr.recur, align 4, !tbaa !1036 %iv.next = add nuw nsw i64 %iv, 137 %ec = icmp eq i64 %iv.next, 538 br i1 %ec, label %exit, label %loop39 40exit:41 ret void42}43 44define i32 @indirect_ptr_recurrences_read_only_loop(ptr %A, ptr %B) {45; CHECK-LABEL: 'indirect_ptr_recurrences_read_only_loop'46; CHECK-NEXT: loop:47; CHECK-NEXT: Memory dependences are safe48; CHECK-NEXT: Dependences:49; CHECK-NEXT: Run-time memory checks:50; CHECK-NEXT: Grouped accesses:51; CHECK-EMPTY:52; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.53; CHECK-NEXT: SCEV assumptions:54; CHECK-EMPTY:55; CHECK-NEXT: Expressions re-written:56;57entry:58 br label %loop59 60loop:61 %iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]62 %ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]63 %red = phi i32 [ 0, %entry ], [ %xor, %loop ]64 %gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv65 %ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !666 %l = load i32, ptr %ptr.recur, align 4, !tbaa !1067 %xor = xor i32 %l, 168 %iv.next = add nuw nsw i64 %iv, 169 %ec = icmp eq i64 %iv.next, 570 br i1 %ec, label %exit, label %loop71 72exit:73 ret i32 %xor74}75 76define void @indirect_ptr_recurrences_read_write_may_alias_no_tbaa(ptr %A, ptr %B) {77; CHECK-LABEL: 'indirect_ptr_recurrences_read_write_may_alias_no_tbaa'78; CHECK-NEXT: loop:79; CHECK-NEXT: Report: cannot identify array bounds80; CHECK-NEXT: Dependences:81; CHECK-NEXT: Run-time memory checks:82; CHECK-NEXT: Grouped accesses:83; CHECK-NEXT: Group GRP0:84; CHECK-NEXT: (Low: (8 + %B)<nuw> High: (40 + %B))85; CHECK-NEXT: Member: {(8 + %B)<nuw>,+,8}<nuw><%loop>86; CHECK-NEXT: Generated run-time checks are incomplete87; CHECK-EMPTY:88; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.89; CHECK-NEXT: SCEV assumptions:90; CHECK-EMPTY:91; CHECK-NEXT: Expressions re-written:92;93entry:94 br label %loop95 96loop:97 %iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]98 %ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]99 %gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv100 %ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !6101 %l = load i32, ptr %ptr.recur, align 4102 %xor = xor i32 %l, 1103 store i32 %xor, ptr %ptr.recur, align 4104 %iv.next = add nuw nsw i64 %iv, 1105 %ec = icmp eq i64 %iv.next, 5106 br i1 %ec, label %exit, label %loop107 108exit:109 ret void110}111 112define void @indirect_ptr_recurrences_read_write_may_alias_different_obj(ptr %A, ptr %B, ptr %C) {113; CHECK-LABEL: 'indirect_ptr_recurrences_read_write_may_alias_different_obj'114; CHECK-NEXT: loop:115; CHECK-NEXT: Report: cannot identify array bounds116; CHECK-NEXT: Dependences:117; CHECK-NEXT: Run-time memory checks:118; CHECK-NEXT: Check 0:119; CHECK-NEXT: Comparing group GRP0:120; CHECK-NEXT: %gep.C = getelementptr inbounds ptr, ptr %C, i64 %iv121; CHECK-NEXT: Against group GRP1:122; CHECK-NEXT: %gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv123; CHECK-NEXT: Grouped accesses:124; CHECK-NEXT: Group GRP0:125; CHECK-NEXT: (Low: (8 + %C)<nuw> High: (36 + %C))126; CHECK-NEXT: Member: {(8 + %C)<nuw>,+,8}<nuw><%loop>127; CHECK-NEXT: Group GRP1:128; CHECK-NEXT: (Low: (8 + %B)<nuw> High: (40 + %B))129; CHECK-NEXT: Member: {(8 + %B)<nuw>,+,8}<nuw><%loop>130; CHECK-NEXT: Generated run-time checks are incomplete131; CHECK-EMPTY:132; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.133; CHECK-NEXT: SCEV assumptions:134; CHECK-EMPTY:135; CHECK-NEXT: Expressions re-written:136;137entry:138 br label %loop139 140loop:141 %iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]142 %ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]143 %gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv144 %ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !6145 %l = load i32, ptr %ptr.recur, align 4146 %xor = xor i32 %l, 1147 %gep.C = getelementptr inbounds ptr, ptr %C, i64 %iv148 store i32 %xor, ptr %gep.C, align 4149 %iv.next = add nuw nsw i64 %iv, 1150 %ec = icmp eq i64 %iv.next, 5151 br i1 %ec, label %exit, label %loop152 153exit:154 ret void155}156 157define void @indirect_ptr_recurrences_read_write_may_noalias_different_obj(ptr %A, ptr %B, ptr noalias %C) {158; CHECK-LABEL: 'indirect_ptr_recurrences_read_write_may_noalias_different_obj'159; CHECK-NEXT: loop:160; CHECK-NEXT: Memory dependences are safe161; CHECK-NEXT: Dependences:162; CHECK-NEXT: Run-time memory checks:163; CHECK-NEXT: Grouped accesses:164; CHECK-EMPTY:165; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.166; CHECK-NEXT: SCEV assumptions:167; CHECK-EMPTY:168; CHECK-NEXT: Expressions re-written:169;170entry:171 br label %loop172 173loop:174 %iv = phi i64 [ 1, %entry ], [ %iv.next, %loop ]175 %ptr.recur = phi ptr [ %A, %entry ], [ %ptr.next, %loop ]176 %gep.B = getelementptr inbounds ptr, ptr %B, i64 %iv177 %ptr.next = load ptr, ptr %gep.B, align 8, !tbaa !6178 %l = load i32, ptr %ptr.recur, align 4179 %xor = xor i32 %l, 1180 %gep.C = getelementptr inbounds ptr, ptr %C, i64 %iv181 store i32 %xor, ptr %gep.C, align 4182 %iv.next = add nuw nsw i64 %iv, 1183 %ec = icmp eq i64 %iv.next, 5184 br i1 %ec, label %exit, label %loop185 186exit:187 ret void188}189 190 191!6 = !{!7, !7, i64 0}192!7 = !{!"any pointer", !8, i64 0}193!8 = !{!"omnipotent char", !9, i64 0}194!9 = !{!"Simple C/C++ TBAA"}195!10 = !{!11, !11, i64 0}196!11 = !{!"int", !8, i64 0}197