reverse_induction.ll 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148
  1. ; RUN: opt < %s -loop-vectorize -force-vector-interleave=2 -force-vector-width=4 -S | FileCheck %s
  2. target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128"
  3. ; Make sure consecutive vector generates correct negative indices.
  4. ; PR15882
  5. ; CHECK-LABEL: @reverse_induction_i64(
  6. ; CHECK: add <4 x i64> %[[SPLAT:.*]], <i64 0, i64 -1, i64 -2, i64 -3>
  7. ; CHECK: add <4 x i64> %[[SPLAT]], <i64 -4, i64 -5, i64 -6, i64 -7>
  8. define i32 @reverse_induction_i64(i64 %startval, i32 * %ptr) {
  9. entry:
  10. br label %for.body
  11. for.body:
  12. %add.i7 = phi i64 [ %startval, %entry ], [ %add.i, %for.body ]
  13. %i.06 = phi i32 [ 0, %entry ], [ %inc4, %for.body ]
  14. %redux5 = phi i32 [ 0, %entry ], [ %inc.redux, %for.body ]
  15. %add.i = add i64 %add.i7, -1
  16. %kind_.i = getelementptr inbounds i32, i32* %ptr, i64 %add.i
  17. %tmp.i1 = load i32, i32* %kind_.i, align 4
  18. %inc.redux = add i32 %tmp.i1, %redux5
  19. %inc4 = add i32 %i.06, 1
  20. %exitcond = icmp ne i32 %inc4, 1024
  21. br i1 %exitcond, label %for.body, label %loopend
  22. loopend:
  23. ret i32 %inc.redux
  24. }
  25. ; CHECK-LABEL: @reverse_induction_i128(
  26. ; CHECK: add <4 x i128> %[[SPLAT:.*]], <i128 0, i128 -1, i128 -2, i128 -3>
  27. ; CHECK: add <4 x i128> %[[SPLAT]], <i128 -4, i128 -5, i128 -6, i128 -7>
  28. define i32 @reverse_induction_i128(i128 %startval, i32 * %ptr) {
  29. entry:
  30. br label %for.body
  31. for.body:
  32. %add.i7 = phi i128 [ %startval, %entry ], [ %add.i, %for.body ]
  33. %i.06 = phi i32 [ 0, %entry ], [ %inc4, %for.body ]
  34. %redux5 = phi i32 [ 0, %entry ], [ %inc.redux, %for.body ]
  35. %add.i = add i128 %add.i7, -1
  36. %kind_.i = getelementptr inbounds i32, i32* %ptr, i128 %add.i
  37. %tmp.i1 = load i32, i32* %kind_.i, align 4
  38. %inc.redux = add i32 %tmp.i1, %redux5
  39. %inc4 = add i32 %i.06, 1
  40. %exitcond = icmp ne i32 %inc4, 1024
  41. br i1 %exitcond, label %for.body, label %loopend
  42. loopend:
  43. ret i32 %inc.redux
  44. }
  45. ; CHECK-LABEL: @reverse_induction_i16(
  46. ; CHECK: add <4 x i16> %[[SPLAT:.*]], <i16 0, i16 -1, i16 -2, i16 -3>
  47. ; CHECK: add <4 x i16> %[[SPLAT]], <i16 -4, i16 -5, i16 -6, i16 -7>
  48. define i32 @reverse_induction_i16(i16 %startval, i32 * %ptr) {
  49. entry:
  50. br label %for.body
  51. for.body:
  52. %add.i7 = phi i16 [ %startval, %entry ], [ %add.i, %for.body ]
  53. %i.06 = phi i32 [ 0, %entry ], [ %inc4, %for.body ]
  54. %redux5 = phi i32 [ 0, %entry ], [ %inc.redux, %for.body ]
  55. %add.i = add i16 %add.i7, -1
  56. %kind_.i = getelementptr inbounds i32, i32* %ptr, i16 %add.i
  57. %tmp.i1 = load i32, i32* %kind_.i, align 4
  58. %inc.redux = add i32 %tmp.i1, %redux5
  59. %inc4 = add i32 %i.06, 1
  60. %exitcond = icmp ne i32 %inc4, 1024
  61. br i1 %exitcond, label %for.body, label %loopend
  62. loopend:
  63. ret i32 %inc.redux
  64. }
  65. @a = common global [1024 x i32] zeroinitializer, align 16
  66. ; We incorrectly transformed this loop into an empty one because we left the
  67. ; induction variable in i8 type and truncated the exit value 1024 to 0.
  68. ; int a[1024];
  69. ;
  70. ; void fail() {
  71. ; int reverse_induction = 1023;
  72. ; unsigned char forward_induction = 0;
  73. ; while ((reverse_induction) >= 0) {
  74. ; forward_induction++;
  75. ; a[reverse_induction] = forward_induction;
  76. ; --reverse_induction;
  77. ; }
  78. ; }
  79. ; CHECK-LABEL: @reverse_forward_induction_i64_i8(
  80. ; CHECK: vector.body
  81. ; CHECK: %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body ]
  82. ; CHECK: %normalized.idx = sub i64 %index, 0
  83. ; CHECK: %offset.idx = sub i64 1023, %normalized.idx
  84. ; CHECK: trunc i64 %index to i8
  85. define void @reverse_forward_induction_i64_i8() {
  86. entry:
  87. br label %while.body
  88. while.body:
  89. %indvars.iv = phi i64 [ 1023, %entry ], [ %indvars.iv.next, %while.body ]
  90. %forward_induction.05 = phi i8 [ 0, %entry ], [ %inc, %while.body ]
  91. %inc = add i8 %forward_induction.05, 1
  92. %conv = zext i8 %inc to i32
  93. %arrayidx = getelementptr inbounds [1024 x i32], [1024 x i32]* @a, i64 0, i64 %indvars.iv
  94. store i32 %conv, i32* %arrayidx, align 4
  95. %indvars.iv.next = add i64 %indvars.iv, -1
  96. %0 = trunc i64 %indvars.iv to i32
  97. %cmp = icmp sgt i32 %0, 0
  98. br i1 %cmp, label %while.body, label %while.end
  99. while.end:
  100. ret void
  101. }
  102. ; CHECK-LABEL: @reverse_forward_induction_i64_i8_signed(
  103. ; CHECK: vector.body:
  104. ; CHECK: %index = phi i64 [ 129, %vector.ph ], [ %index.next, %vector.body ]
  105. ; CHECK: %normalized.idx = sub i64 %index, 129
  106. ; CHECK: %offset.idx = sub i64 1023, %normalized.idx
  107. ; CHECK: trunc i64 %index to i8
  108. define void @reverse_forward_induction_i64_i8_signed() {
  109. entry:
  110. br label %while.body
  111. while.body:
  112. %indvars.iv = phi i64 [ 1023, %entry ], [ %indvars.iv.next, %while.body ]
  113. %forward_induction.05 = phi i8 [ -127, %entry ], [ %inc, %while.body ]
  114. %inc = add i8 %forward_induction.05, 1
  115. %conv = sext i8 %inc to i32
  116. %arrayidx = getelementptr inbounds [1024 x i32], [1024 x i32]* @a, i64 0, i64 %indvars.iv
  117. store i32 %conv, i32* %arrayidx, align 4
  118. %indvars.iv.next = add i64 %indvars.iv, -1
  119. %0 = trunc i64 %indvars.iv to i32
  120. %cmp = icmp sgt i32 %0, 0
  121. br i1 %cmp, label %while.body, label %while.end
  122. while.end:
  123. ret void
  124. }