A SCEVWrapPredicate A implies B, if * they have the same flag, * both steps are positive and * B's start and step are ULE/SLE (for NSUW/NSSW) than A's. See https://alive2.llvm.org/ce/z/n2T4ss (first pair with known constants as strides, second pair with variable strides). Note that this is limited to steps of the same size, due to NSUW having slightly different semantics than regular NUW. We should be able to remove this restriction for NSSW (which matches NSW) in the future. PR: https://github.com/llvm/llvm-project/pull/118184
336 lines
15 KiB
LLVM
336 lines
15 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
|
|
; RUN: opt -passes='print<access-info>' %s -disable-output 2>&1 | FileCheck %s
|
|
|
|
target datalayout = "e-m:o-p270:32:32-p271:32:32-p272:64:64-i64:64-i128:128-n32:64-S128-Fn32"
|
|
|
|
; {0,+,3} [nssw] implies {0,+,2} [nssw]
|
|
define void @wrap_check_iv.3_implies_iv.2(i32 noundef %N, ptr %dst, ptr %src) {
|
|
; CHECK-LABEL: 'wrap_check_iv.3_implies_iv.2'
|
|
; CHECK-NEXT: loop:
|
|
; CHECK-NEXT: Memory dependences are safe with run-time checks
|
|
; CHECK-NEXT: Dependences:
|
|
; CHECK-NEXT: Run-time memory checks:
|
|
; CHECK-NEXT: Check 0:
|
|
; CHECK-NEXT: Comparing group ([[GRP1:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
; CHECK-NEXT: Against group ([[GRP2:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
; CHECK-NEXT: Grouped accesses:
|
|
; CHECK-NEXT: Group [[GRP1]]:
|
|
; CHECK-NEXT: (Low: %dst High: (4 + (12 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %dst))
|
|
; CHECK-NEXT: Member: {%dst,+,12}<%loop>
|
|
; CHECK-NEXT: Group [[GRP2]]:
|
|
; CHECK-NEXT: (Low: %src High: (4 + (8 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %src))
|
|
; CHECK-NEXT: Member: {%src,+,8}<%loop>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
|
|
; CHECK-NEXT: SCEV assumptions:
|
|
; CHECK-NEXT: {0,+,3}<%loop> Added Flags: <nssw>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Expressions re-written:
|
|
; CHECK-NEXT: [PSE] %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2:
|
|
; CHECK-NEXT: ((4 * (sext i32 {0,+,2}<%loop> to i64))<nsw> + %src)
|
|
; CHECK-NEXT: --> {%src,+,8}<%loop>
|
|
; CHECK-NEXT: [PSE] %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3:
|
|
; CHECK-NEXT: ((4 * (sext i32 {0,+,3}<%loop> to i64))<nsw> + %dst)
|
|
; CHECK-NEXT: --> {%dst,+,12}<%loop>
|
|
;
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv.1 = phi i32 [ 0, %entry ], [ %iv.1.next, %loop ]
|
|
%iv.2 = phi i32 [ 0, %entry ], [ %iv.2.next, %loop ]
|
|
%iv.3 = phi i32 [ 0, %entry ], [ %iv.3.next, %loop ]
|
|
%ext.iv.2 = sext i32 %iv.2 to i64
|
|
%gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
%l = load i32, ptr %gep.iv.2, align 4
|
|
%ext.iv.3 = sext i32 %iv.3 to i64
|
|
%gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
store i32 %l, ptr %gep.iv.3, align 4
|
|
%iv.1.next = add nuw nsw i32 %iv.1, 1
|
|
%iv.2.next = add i32 %iv.2, 2
|
|
%iv.3.next = add i32 %iv.3, 3
|
|
%ec = icmp eq i32 %iv.1.next, %N
|
|
br i1 %ec, label %exit, label %loop
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
; {2,+,2} [nssw] implies {0,+,2} [nssw].
|
|
define void @wrap_check_iv.3_implies_iv.2_different_start(i32 noundef %N, ptr %dst, ptr %src) {
|
|
; CHECK-LABEL: 'wrap_check_iv.3_implies_iv.2_different_start'
|
|
; CHECK-NEXT: loop:
|
|
; CHECK-NEXT: Memory dependences are safe with run-time checks
|
|
; CHECK-NEXT: Dependences:
|
|
; CHECK-NEXT: Run-time memory checks:
|
|
; CHECK-NEXT: Check 0:
|
|
; CHECK-NEXT: Comparing group ([[GRP3:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
; CHECK-NEXT: Against group ([[GRP4:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
; CHECK-NEXT: Grouped accesses:
|
|
; CHECK-NEXT: Group [[GRP3]]:
|
|
; CHECK-NEXT: (Low: (12 + %dst) High: (16 + (8 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %dst))
|
|
; CHECK-NEXT: Member: {(12 + %dst),+,8}<%loop>
|
|
; CHECK-NEXT: Group [[GRP4]]:
|
|
; CHECK-NEXT: (Low: %src High: (4 + (8 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %src))
|
|
; CHECK-NEXT: Member: {%src,+,8}<%loop>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
|
|
; CHECK-NEXT: SCEV assumptions:
|
|
; CHECK-NEXT: {2,+,2}<%loop> Added Flags: <nssw>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Expressions re-written:
|
|
; CHECK-NEXT: [PSE] %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2:
|
|
; CHECK-NEXT: ((4 * (sext i32 {0,+,2}<%loop> to i64))<nsw> + %src)
|
|
; CHECK-NEXT: --> {%src,+,8}<%loop>
|
|
; CHECK-NEXT: [PSE] %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3:
|
|
; CHECK-NEXT: (4 + (4 * (sext i32 {2,+,2}<%loop> to i64))<nsw> + %dst)
|
|
; CHECK-NEXT: --> {(12 + %dst),+,8}<%loop>
|
|
;
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv.1 = phi i32 [ 0, %entry ], [ %iv.1.next, %loop ]
|
|
%iv.2 = phi i32 [ 0, %entry ], [ %iv.2.next, %loop ]
|
|
%iv.3 = phi i32 [ 3, %entry ], [ %iv.3.next, %loop ]
|
|
%ext.iv.2 = sext i32 %iv.2 to i64
|
|
%gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
%l = load i32, ptr %gep.iv.2, align 4
|
|
%ext.iv.3 = sext i32 %iv.3 to i64
|
|
%gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
store i32 %l, ptr %gep.iv.3, align 4
|
|
%iv.1.next = add nuw nsw i32 %iv.1, 1
|
|
%iv.2.next = add i32 %iv.2, 2
|
|
%iv.3.next = add i32 %iv.3, 2
|
|
%ec = icmp eq i32 %iv.1.next, %N
|
|
br i1 %ec, label %exit, label %loop
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
; FIXME: {0,+,3} implies {0,+,2}.
|
|
define void @wrap_check_iv.3_implies_iv.2_predicates_added_in_different_order(i32 noundef %N, ptr %dst, ptr %src) {
|
|
; CHECK-LABEL: 'wrap_check_iv.3_implies_iv.2_predicates_added_in_different_order'
|
|
; CHECK-NEXT: loop:
|
|
; CHECK-NEXT: Memory dependences are safe with run-time checks
|
|
; CHECK-NEXT: Dependences:
|
|
; CHECK-NEXT: Run-time memory checks:
|
|
; CHECK-NEXT: Check 0:
|
|
; CHECK-NEXT: Comparing group ([[GRP5:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.2 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.2
|
|
; CHECK-NEXT: Against group ([[GRP6:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.3 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.3
|
|
; CHECK-NEXT: Grouped accesses:
|
|
; CHECK-NEXT: Group [[GRP5]]:
|
|
; CHECK-NEXT: (Low: %dst High: (4 + (8 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %dst))
|
|
; CHECK-NEXT: Member: {%dst,+,8}<%loop>
|
|
; CHECK-NEXT: Group [[GRP6]]:
|
|
; CHECK-NEXT: (Low: %src High: (4 + (12 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %src))
|
|
; CHECK-NEXT: Member: {%src,+,12}<%loop>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
|
|
; CHECK-NEXT: SCEV assumptions:
|
|
; CHECK-NEXT: {0,+,2}<%loop> Added Flags: <nssw>
|
|
; CHECK-NEXT: {0,+,3}<%loop> Added Flags: <nssw>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Expressions re-written:
|
|
; CHECK-NEXT: [PSE] %gep.iv.3 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.3:
|
|
; CHECK-NEXT: ((4 * (sext i32 {0,+,3}<%loop> to i64))<nsw> + %src)
|
|
; CHECK-NEXT: --> {%src,+,12}<%loop>
|
|
; CHECK-NEXT: [PSE] %gep.iv.2 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.2:
|
|
; CHECK-NEXT: ((4 * (sext i32 {0,+,2}<%loop> to i64))<nsw> + %dst)
|
|
; CHECK-NEXT: --> {%dst,+,8}<%loop>
|
|
;
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv.1 = phi i32 [ 0, %entry ], [ %iv.1.next, %loop ]
|
|
%iv.2 = phi i32 [ 0, %entry ], [ %iv.2.next, %loop ]
|
|
%iv.3 = phi i32 [ 0, %entry ], [ %iv.3.next, %loop ]
|
|
%ext.iv.3 = sext i32 %iv.3 to i64
|
|
%gep.iv.3 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.3
|
|
%l = load i32, ptr %gep.iv.3, align 4
|
|
%ext.iv.2 = sext i32 %iv.2 to i64
|
|
%gep.iv.2 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.2
|
|
store i32 %l, ptr %gep.iv.2, align 4
|
|
%iv.1.next = add nuw nsw i32 %iv.1, 1
|
|
%iv.2.next = add i32 %iv.2, 2
|
|
%iv.3.next = add i32 %iv.3, 3
|
|
%ec = icmp eq i32 %iv.1.next, %N
|
|
br i1 %ec, label %exit, label %loop
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
define void @wrap_check_iv.3_does_not_implies_iv.2_due_to_start(i32 noundef %N, ptr %dst, ptr %src) {
|
|
; CHECK-LABEL: 'wrap_check_iv.3_does_not_implies_iv.2_due_to_start'
|
|
; CHECK-NEXT: loop:
|
|
; CHECK-NEXT: Memory dependences are safe with run-time checks
|
|
; CHECK-NEXT: Dependences:
|
|
; CHECK-NEXT: Run-time memory checks:
|
|
; CHECK-NEXT: Check 0:
|
|
; CHECK-NEXT: Comparing group ([[GRP7:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
; CHECK-NEXT: Against group ([[GRP8:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
; CHECK-NEXT: Grouped accesses:
|
|
; CHECK-NEXT: Group [[GRP7]]:
|
|
; CHECK-NEXT: (Low: %dst High: (4 + (12 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %dst))
|
|
; CHECK-NEXT: Member: {%dst,+,12}<%loop>
|
|
; CHECK-NEXT: Group [[GRP8]]:
|
|
; CHECK-NEXT: (Low: (40 + %src) High: (44 + (8 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %src))
|
|
; CHECK-NEXT: Member: {(40 + %src),+,8}<%loop>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
|
|
; CHECK-NEXT: SCEV assumptions:
|
|
; CHECK-NEXT: {0,+,3}<%loop> Added Flags: <nssw>
|
|
; CHECK-NEXT: {10,+,2}<%loop> Added Flags: <nssw>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Expressions re-written:
|
|
; CHECK-NEXT: [PSE] %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2:
|
|
; CHECK-NEXT: ((4 * (sext i32 {10,+,2}<%loop> to i64))<nsw> + %src)
|
|
; CHECK-NEXT: --> {(40 + %src),+,8}<%loop>
|
|
; CHECK-NEXT: [PSE] %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3:
|
|
; CHECK-NEXT: ((4 * (sext i32 {0,+,3}<%loop> to i64))<nsw> + %dst)
|
|
; CHECK-NEXT: --> {%dst,+,12}<%loop>
|
|
;
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv.1 = phi i32 [ 0, %entry ], [ %iv.1.next, %loop ]
|
|
%iv.2 = phi i32 [ 10, %entry ], [ %iv.2.next, %loop ]
|
|
%iv.3 = phi i32 [ 0, %entry ], [ %iv.3.next, %loop ]
|
|
%ext.iv.2 = sext i32 %iv.2 to i64
|
|
%gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
%l = load i32, ptr %gep.iv.2, align 4
|
|
%ext.iv.3 = sext i32 %iv.3 to i64
|
|
%gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
store i32 %l, ptr %gep.iv.3, align 4
|
|
%iv.1.next = add nuw nsw i32 %iv.1, 1
|
|
%iv.2.next = add i32 %iv.2, 2
|
|
%iv.3.next = add i32 %iv.3, 3
|
|
%ec = icmp eq i32 %iv.1.next, %N
|
|
br i1 %ec, label %exit, label %loop
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
define void @wrap_check_iv.3_does_not_imply_iv.2_due_to_start_negative(i32 noundef %N, ptr %dst, ptr %src) {
|
|
; CHECK-LABEL: 'wrap_check_iv.3_does_not_imply_iv.2_due_to_start_negative'
|
|
; CHECK-NEXT: loop:
|
|
; CHECK-NEXT: Memory dependences are safe with run-time checks
|
|
; CHECK-NEXT: Dependences:
|
|
; CHECK-NEXT: Run-time memory checks:
|
|
; CHECK-NEXT: Check 0:
|
|
; CHECK-NEXT: Comparing group ([[GRP9:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
; CHECK-NEXT: Against group ([[GRP10:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
; CHECK-NEXT: Grouped accesses:
|
|
; CHECK-NEXT: Group [[GRP9]]:
|
|
; CHECK-NEXT: (Low: (-4 + %dst) High: ((12 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %dst))
|
|
; CHECK-NEXT: Member: {(-4 + %dst),+,12}<%loop>
|
|
; CHECK-NEXT: Group [[GRP10]]:
|
|
; CHECK-NEXT: (Low: %src High: (4 + (8 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %src))
|
|
; CHECK-NEXT: Member: {%src,+,8}<%loop>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
|
|
; CHECK-NEXT: SCEV assumptions:
|
|
; CHECK-NEXT: {-1,+,3}<%loop> Added Flags: <nssw>
|
|
; CHECK-NEXT: {0,+,2}<%loop> Added Flags: <nssw>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Expressions re-written:
|
|
; CHECK-NEXT: [PSE] %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2:
|
|
; CHECK-NEXT: ((4 * (sext i32 {0,+,2}<%loop> to i64))<nsw> + %src)
|
|
; CHECK-NEXT: --> {%src,+,8}<%loop>
|
|
; CHECK-NEXT: [PSE] %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3:
|
|
; CHECK-NEXT: ((4 * (sext i32 {-1,+,3}<%loop> to i64))<nsw> + %dst)
|
|
; CHECK-NEXT: --> {(-4 + %dst),+,12}<%loop>
|
|
;
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv.1 = phi i32 [ 0, %entry ], [ %iv.1.next, %loop ]
|
|
%iv.2 = phi i32 [ 0, %entry ], [ %iv.2.next, %loop ]
|
|
%iv.3 = phi i32 [ -1, %entry ], [ %iv.3.next, %loop ]
|
|
%ext.iv.2 = sext i32 %iv.2 to i64
|
|
%gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
%l = load i32, ptr %gep.iv.2, align 4
|
|
%ext.iv.3 = sext i32 %iv.3 to i64
|
|
%gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
store i32 %l, ptr %gep.iv.3, align 4
|
|
%iv.1.next = add nuw nsw i32 %iv.1, 1
|
|
%iv.2.next = add i32 %iv.2, 2
|
|
%iv.3.next = add i32 %iv.3, 3
|
|
%ec = icmp eq i32 %iv.1.next, %N
|
|
br i1 %ec, label %exit, label %loop
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
define void @wrap_check_iv.3_does_not_imply_iv.2_due_to_negative_step(i32 noundef %N, ptr %dst, ptr %src) {
|
|
; CHECK-LABEL: 'wrap_check_iv.3_does_not_imply_iv.2_due_to_negative_step'
|
|
; CHECK-NEXT: loop:
|
|
; CHECK-NEXT: Memory dependences are safe with run-time checks
|
|
; CHECK-NEXT: Dependences:
|
|
; CHECK-NEXT: Run-time memory checks:
|
|
; CHECK-NEXT: Check 0:
|
|
; CHECK-NEXT: Comparing group ([[GRP11:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
; CHECK-NEXT: Against group ([[GRP12:0x[0-9a-f]+]]):
|
|
; CHECK-NEXT: %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
; CHECK-NEXT: Grouped accesses:
|
|
; CHECK-NEXT: Group [[GRP11]]:
|
|
; CHECK-NEXT: (Low: ((-4 * (zext i32 (-1 + %N) to i64))<nsw> + %dst) High: (4 + %dst))
|
|
; CHECK-NEXT: Member: {%dst,+,-4}<%loop>
|
|
; CHECK-NEXT: Group [[GRP12]]:
|
|
; CHECK-NEXT: (Low: %src High: (4 + (8 * (zext i32 (-1 + %N) to i64))<nuw><nsw> + %src))
|
|
; CHECK-NEXT: Member: {%src,+,8}<%loop>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Non vectorizable stores to invariant address were not found in loop.
|
|
; CHECK-NEXT: SCEV assumptions:
|
|
; CHECK-NEXT: {0,+,-1}<%loop> Added Flags: <nssw>
|
|
; CHECK-NEXT: {0,+,2}<%loop> Added Flags: <nssw>
|
|
; CHECK-EMPTY:
|
|
; CHECK-NEXT: Expressions re-written:
|
|
; CHECK-NEXT: [PSE] %gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2:
|
|
; CHECK-NEXT: ((4 * (sext i32 {0,+,2}<%loop> to i64))<nsw> + %src)
|
|
; CHECK-NEXT: --> {%src,+,8}<%loop>
|
|
; CHECK-NEXT: [PSE] %gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3:
|
|
; CHECK-NEXT: ((4 * (sext i32 {0,+,-1}<%loop> to i64))<nsw> + %dst)
|
|
; CHECK-NEXT: --> {%dst,+,-4}<%loop>
|
|
;
|
|
entry:
|
|
br label %loop
|
|
|
|
loop:
|
|
%iv.1 = phi i32 [ 0, %entry ], [ %iv.1.next, %loop ]
|
|
%iv.2 = phi i32 [ 0, %entry ], [ %iv.2.next, %loop ]
|
|
%iv.3 = phi i32 [ 0, %entry ], [ %iv.3.next, %loop ]
|
|
%ext.iv.2 = sext i32 %iv.2 to i64
|
|
%gep.iv.2 = getelementptr inbounds i32, ptr %src, i64 %ext.iv.2
|
|
%l = load i32, ptr %gep.iv.2, align 4
|
|
%ext.iv.3 = sext i32 %iv.3 to i64
|
|
%gep.iv.3 = getelementptr inbounds i32, ptr %dst, i64 %ext.iv.3
|
|
store i32 %l, ptr %gep.iv.3, align 4
|
|
%iv.1.next = add nuw nsw i32 %iv.1, 1
|
|
%iv.2.next = add i32 %iv.2, 2
|
|
%iv.3.next = add i32 %iv.3, -1
|
|
%ec = icmp eq i32 %iv.1.next, %N
|
|
br i1 %ec, label %exit, label %loop
|
|
|
|
exit:
|
|
ret void
|
|
}
|