Preliminary.ll 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699
  1. ; RUN: opt < %s -analyze -basicaa -da | FileCheck %s
  2. ; ModuleID = 'Preliminary.bc'
  3. 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"
  4. target triple = "x86_64-apple-macosx10.6.0"
  5. ;;int p0(int n, int *A, int *B) {
  6. ;; A[0] = n;
  7. ;; return B[1];
  8. define i32 @p0(i32 %n, i32* %A, i32* %B) nounwind uwtable ssp {
  9. entry:
  10. store i32 %n, i32* %A, align 4
  11. ; CHECK: da analyze - none!
  12. ; CHECK: da analyze - confused!
  13. ; CHECK: da analyze - none!
  14. %arrayidx1 = getelementptr inbounds i32, i32* %B, i64 1
  15. %0 = load i32, i32* %arrayidx1, align 4
  16. ret i32 %0
  17. }
  18. ;;int p1(int n, int *restrict A, int *restrict B) {
  19. ;; A[0] = n;
  20. ;; return B[1];
  21. define i32 @p1(i32 %n, i32* noalias %A, i32* noalias %B) nounwind uwtable ssp {
  22. entry:
  23. store i32 %n, i32* %A, align 4
  24. ; CHECK: da analyze - none!
  25. ; CHECK: da analyze - none!
  26. ; CHECK: da analyze - none!
  27. %arrayidx1 = getelementptr inbounds i32, i32* %B, i64 1
  28. %0 = load i32, i32* %arrayidx1, align 4
  29. ret i32 %0
  30. }
  31. ;; for (long int i = 0; i < n; i++) {
  32. ;; for (long int j = 0; j < n; j++) {
  33. ;; for (long int k = 0; k < n; k++) {
  34. ;; A[i][j][k] = i;
  35. ;; }
  36. ;; for (long int k = 0; k < n; k++) {
  37. ;; *B++ = A[i + 3][j + 2][k + 1];
  38. define void @p2(i64 %n, [100 x [100 x i64]]* %A, i64* %B) nounwind uwtable ssp {
  39. entry:
  40. %cmp10 = icmp sgt i64 %n, 0
  41. br i1 %cmp10, label %for.cond1.preheader.preheader, label %for.end26
  42. ; CHECK: da analyze - none!
  43. ; CHECK: da analyze - flow [-3 -2]!
  44. ; CHECK: da analyze - confused!
  45. ; CHECK: da analyze - none!
  46. ; CHECK: da analyze - confused!
  47. ; CHECK: da analyze - output [* * *]!
  48. for.cond1.preheader.preheader: ; preds = %entry
  49. br label %for.cond1.preheader
  50. for.cond1.preheader: ; preds = %for.cond1.preheader.preheader, %for.inc24
  51. %B.addr.012 = phi i64* [ %B.addr.1.lcssa, %for.inc24 ], [ %B, %for.cond1.preheader.preheader ]
  52. %i.011 = phi i64 [ %inc25, %for.inc24 ], [ 0, %for.cond1.preheader.preheader ]
  53. %cmp26 = icmp sgt i64 %n, 0
  54. br i1 %cmp26, label %for.cond4.preheader.preheader, label %for.inc24
  55. for.cond4.preheader.preheader: ; preds = %for.cond1.preheader
  56. br label %for.cond4.preheader
  57. for.cond4.preheader: ; preds = %for.cond4.preheader.preheader, %for.inc21
  58. %B.addr.18 = phi i64* [ %B.addr.2.lcssa, %for.inc21 ], [ %B.addr.012, %for.cond4.preheader.preheader ]
  59. %j.07 = phi i64 [ %inc22, %for.inc21 ], [ 0, %for.cond4.preheader.preheader ]
  60. %cmp51 = icmp sgt i64 %n, 0
  61. br i1 %cmp51, label %for.body6.preheader, label %for.cond10.loopexit
  62. for.body6.preheader: ; preds = %for.cond4.preheader
  63. br label %for.body6
  64. for.body6: ; preds = %for.body6.preheader, %for.body6
  65. %k.02 = phi i64 [ %inc, %for.body6 ], [ 0, %for.body6.preheader ]
  66. %arrayidx8 = getelementptr inbounds [100 x [100 x i64]], [100 x [100 x i64]]* %A, i64 %i.011, i64 %j.07, i64 %k.02
  67. store i64 %i.011, i64* %arrayidx8, align 8
  68. %inc = add nsw i64 %k.02, 1
  69. %exitcond13 = icmp ne i64 %inc, %n
  70. br i1 %exitcond13, label %for.body6, label %for.cond10.loopexit.loopexit
  71. for.cond10.loopexit.loopexit: ; preds = %for.body6
  72. br label %for.cond10.loopexit
  73. for.cond10.loopexit: ; preds = %for.cond10.loopexit.loopexit, %for.cond4.preheader
  74. %cmp113 = icmp sgt i64 %n, 0
  75. br i1 %cmp113, label %for.body12.preheader, label %for.inc21
  76. for.body12.preheader: ; preds = %for.cond10.loopexit
  77. br label %for.body12
  78. for.body12: ; preds = %for.body12.preheader, %for.body12
  79. %k9.05 = phi i64 [ %inc19, %for.body12 ], [ 0, %for.body12.preheader ]
  80. %B.addr.24 = phi i64* [ %incdec.ptr, %for.body12 ], [ %B.addr.18, %for.body12.preheader ]
  81. %add = add nsw i64 %k9.05, 1
  82. %add13 = add nsw i64 %j.07, 2
  83. %add14 = add nsw i64 %i.011, 3
  84. %arrayidx17 = getelementptr inbounds [100 x [100 x i64]], [100 x [100 x i64]]* %A, i64 %add14, i64 %add13, i64 %add
  85. %0 = load i64, i64* %arrayidx17, align 8
  86. %incdec.ptr = getelementptr inbounds i64, i64* %B.addr.24, i64 1
  87. store i64 %0, i64* %B.addr.24, align 8
  88. %inc19 = add nsw i64 %k9.05, 1
  89. %exitcond = icmp ne i64 %inc19, %n
  90. br i1 %exitcond, label %for.body12, label %for.inc21.loopexit
  91. for.inc21.loopexit: ; preds = %for.body12
  92. %scevgep = getelementptr i64, i64* %B.addr.18, i64 %n
  93. br label %for.inc21
  94. for.inc21: ; preds = %for.inc21.loopexit, %for.cond10.loopexit
  95. %B.addr.2.lcssa = phi i64* [ %B.addr.18, %for.cond10.loopexit ], [ %scevgep, %for.inc21.loopexit ]
  96. %inc22 = add nsw i64 %j.07, 1
  97. %exitcond14 = icmp ne i64 %inc22, %n
  98. br i1 %exitcond14, label %for.cond4.preheader, label %for.inc24.loopexit
  99. for.inc24.loopexit: ; preds = %for.inc21
  100. %B.addr.2.lcssa.lcssa = phi i64* [ %B.addr.2.lcssa, %for.inc21 ]
  101. br label %for.inc24
  102. for.inc24: ; preds = %for.inc24.loopexit, %for.cond1.preheader
  103. %B.addr.1.lcssa = phi i64* [ %B.addr.012, %for.cond1.preheader ], [ %B.addr.2.lcssa.lcssa, %for.inc24.loopexit ]
  104. %inc25 = add nsw i64 %i.011, 1
  105. %exitcond15 = icmp ne i64 %inc25, %n
  106. br i1 %exitcond15, label %for.cond1.preheader, label %for.end26.loopexit
  107. for.end26.loopexit: ; preds = %for.inc24
  108. br label %for.end26
  109. for.end26: ; preds = %for.end26.loopexit, %entry
  110. ret void
  111. }
  112. ;; for (long int i = 0; i < n; i++)
  113. ;; for (long int j = 0; j < n; j++)
  114. ;; for (long int k = 0; k < n; k++)
  115. ;; for (long int l = 0; l < n; l++)
  116. ;; for (long int m = 0; m < n; m++)
  117. ;; for (long int o = 0; o < n; o++)
  118. ;; for (long int p = 0; p < n; p++)
  119. ;; for (long int q = 0; q < n; q++)
  120. ;; for (long int r = 0; r < n; r++)
  121. ;; for (long int s = 0; s < n; s++)
  122. ;; for (long int u = 0; u < n; u++)
  123. ;; for (long int t = 0; t < n; t++) {
  124. ;; A[i - 3] [j] [2] [k-1] [2*l + 1] [m] [p + q] [r + s] = i;
  125. ;; *B++ = A[i + 3] [2] [u] [1-k] [3*l - 1] [o] [1 + n] [t + 2];
  126. define void @p3(i64 %n, [100 x [100 x [100 x [100 x [100 x [100 x [100 x i64]]]]]]]* %A, i64* %B) nounwind uwtable ssp {
  127. entry:
  128. %cmp44 = icmp sgt i64 %n, 0
  129. br i1 %cmp44, label %for.cond1.preheader.preheader, label %for.end90
  130. ; CHECK: da analyze - output [0 0 0 0 0 S * * * * S S]!
  131. ; CHECK: da analyze - flow [-6 * * => * * * * * * * *] splitable!
  132. ; CHECK: da analyze - split level = 3, iteration = 1!
  133. ; CHECK: da analyze - confused!
  134. ; CHECK: da analyze - consistent input [0 S 0 0 S 0 S S S S 0 0]!
  135. ; CHECK: da analyze - confused!
  136. ; CHECK: da analyze - output [* * * * * * * * * * * *]!
  137. for.cond1.preheader.preheader: ; preds = %entry
  138. br label %for.cond1.preheader
  139. for.cond1.preheader: ; preds = %for.cond1.preheader.preheader, %for.inc88
  140. %B.addr.046 = phi i64* [ %B.addr.1.lcssa, %for.inc88 ], [ %B, %for.cond1.preheader.preheader ]
  141. %i.045 = phi i64 [ %inc89, %for.inc88 ], [ 0, %for.cond1.preheader.preheader ]
  142. %cmp240 = icmp sgt i64 %n, 0
  143. br i1 %cmp240, label %for.cond4.preheader.preheader, label %for.inc88
  144. for.cond4.preheader.preheader: ; preds = %for.cond1.preheader
  145. br label %for.cond4.preheader
  146. for.cond4.preheader: ; preds = %for.cond4.preheader.preheader, %for.inc85
  147. %B.addr.142 = phi i64* [ %B.addr.2.lcssa, %for.inc85 ], [ %B.addr.046, %for.cond4.preheader.preheader ]
  148. %j.041 = phi i64 [ %inc86, %for.inc85 ], [ 0, %for.cond4.preheader.preheader ]
  149. %cmp536 = icmp sgt i64 %n, 0
  150. br i1 %cmp536, label %for.cond7.preheader.preheader, label %for.inc85
  151. for.cond7.preheader.preheader: ; preds = %for.cond4.preheader
  152. br label %for.cond7.preheader
  153. for.cond7.preheader: ; preds = %for.cond7.preheader.preheader, %for.inc82
  154. %B.addr.238 = phi i64* [ %B.addr.3.lcssa, %for.inc82 ], [ %B.addr.142, %for.cond7.preheader.preheader ]
  155. %k.037 = phi i64 [ %inc83, %for.inc82 ], [ 0, %for.cond7.preheader.preheader ]
  156. %cmp832 = icmp sgt i64 %n, 0
  157. br i1 %cmp832, label %for.cond10.preheader.preheader, label %for.inc82
  158. for.cond10.preheader.preheader: ; preds = %for.cond7.preheader
  159. br label %for.cond10.preheader
  160. for.cond10.preheader: ; preds = %for.cond10.preheader.preheader, %for.inc79
  161. %B.addr.334 = phi i64* [ %B.addr.4.lcssa, %for.inc79 ], [ %B.addr.238, %for.cond10.preheader.preheader ]
  162. %l.033 = phi i64 [ %inc80, %for.inc79 ], [ 0, %for.cond10.preheader.preheader ]
  163. %cmp1128 = icmp sgt i64 %n, 0
  164. br i1 %cmp1128, label %for.cond13.preheader.preheader, label %for.inc79
  165. for.cond13.preheader.preheader: ; preds = %for.cond10.preheader
  166. br label %for.cond13.preheader
  167. for.cond13.preheader: ; preds = %for.cond13.preheader.preheader, %for.inc76
  168. %B.addr.430 = phi i64* [ %B.addr.5.lcssa, %for.inc76 ], [ %B.addr.334, %for.cond13.preheader.preheader ]
  169. %m.029 = phi i64 [ %inc77, %for.inc76 ], [ 0, %for.cond13.preheader.preheader ]
  170. %cmp1424 = icmp sgt i64 %n, 0
  171. br i1 %cmp1424, label %for.cond16.preheader.preheader, label %for.inc76
  172. for.cond16.preheader.preheader: ; preds = %for.cond13.preheader
  173. br label %for.cond16.preheader
  174. for.cond16.preheader: ; preds = %for.cond16.preheader.preheader, %for.inc73
  175. %B.addr.526 = phi i64* [ %B.addr.6.lcssa, %for.inc73 ], [ %B.addr.430, %for.cond16.preheader.preheader ]
  176. %o.025 = phi i64 [ %inc74, %for.inc73 ], [ 0, %for.cond16.preheader.preheader ]
  177. %cmp1720 = icmp sgt i64 %n, 0
  178. br i1 %cmp1720, label %for.cond19.preheader.preheader, label %for.inc73
  179. for.cond19.preheader.preheader: ; preds = %for.cond16.preheader
  180. br label %for.cond19.preheader
  181. for.cond19.preheader: ; preds = %for.cond19.preheader.preheader, %for.inc70
  182. %B.addr.622 = phi i64* [ %B.addr.7.lcssa, %for.inc70 ], [ %B.addr.526, %for.cond19.preheader.preheader ]
  183. %p.021 = phi i64 [ %inc71, %for.inc70 ], [ 0, %for.cond19.preheader.preheader ]
  184. %cmp2016 = icmp sgt i64 %n, 0
  185. br i1 %cmp2016, label %for.cond22.preheader.preheader, label %for.inc70
  186. for.cond22.preheader.preheader: ; preds = %for.cond19.preheader
  187. br label %for.cond22.preheader
  188. for.cond22.preheader: ; preds = %for.cond22.preheader.preheader, %for.inc67
  189. %B.addr.718 = phi i64* [ %B.addr.8.lcssa, %for.inc67 ], [ %B.addr.622, %for.cond22.preheader.preheader ]
  190. %q.017 = phi i64 [ %inc68, %for.inc67 ], [ 0, %for.cond22.preheader.preheader ]
  191. %cmp2312 = icmp sgt i64 %n, 0
  192. br i1 %cmp2312, label %for.cond25.preheader.preheader, label %for.inc67
  193. for.cond25.preheader.preheader: ; preds = %for.cond22.preheader
  194. br label %for.cond25.preheader
  195. for.cond25.preheader: ; preds = %for.cond25.preheader.preheader, %for.inc64
  196. %B.addr.814 = phi i64* [ %B.addr.9.lcssa, %for.inc64 ], [ %B.addr.718, %for.cond25.preheader.preheader ]
  197. %r.013 = phi i64 [ %inc65, %for.inc64 ], [ 0, %for.cond25.preheader.preheader ]
  198. %cmp268 = icmp sgt i64 %n, 0
  199. br i1 %cmp268, label %for.cond28.preheader.preheader, label %for.inc64
  200. for.cond28.preheader.preheader: ; preds = %for.cond25.preheader
  201. br label %for.cond28.preheader
  202. for.cond28.preheader: ; preds = %for.cond28.preheader.preheader, %for.inc61
  203. %B.addr.910 = phi i64* [ %B.addr.10.lcssa, %for.inc61 ], [ %B.addr.814, %for.cond28.preheader.preheader ]
  204. %s.09 = phi i64 [ %inc62, %for.inc61 ], [ 0, %for.cond28.preheader.preheader ]
  205. %cmp294 = icmp sgt i64 %n, 0
  206. br i1 %cmp294, label %for.cond31.preheader.preheader, label %for.inc61
  207. for.cond31.preheader.preheader: ; preds = %for.cond28.preheader
  208. br label %for.cond31.preheader
  209. for.cond31.preheader: ; preds = %for.cond31.preheader.preheader, %for.inc58
  210. %u.06 = phi i64 [ %inc59, %for.inc58 ], [ 0, %for.cond31.preheader.preheader ]
  211. %B.addr.105 = phi i64* [ %B.addr.11.lcssa, %for.inc58 ], [ %B.addr.910, %for.cond31.preheader.preheader ]
  212. %cmp321 = icmp sgt i64 %n, 0
  213. br i1 %cmp321, label %for.body33.preheader, label %for.inc58
  214. for.body33.preheader: ; preds = %for.cond31.preheader
  215. br label %for.body33
  216. for.body33: ; preds = %for.body33.preheader, %for.body33
  217. %t.03 = phi i64 [ %inc, %for.body33 ], [ 0, %for.body33.preheader ]
  218. %B.addr.112 = phi i64* [ %incdec.ptr, %for.body33 ], [ %B.addr.105, %for.body33.preheader ]
  219. %add = add nsw i64 %r.013, %s.09
  220. %add34 = add nsw i64 %p.021, %q.017
  221. %mul = shl nsw i64 %l.033, 1
  222. %add3547 = or i64 %mul, 1
  223. %sub = add nsw i64 %k.037, -1
  224. %sub36 = add nsw i64 %i.045, -3
  225. %arrayidx43 = getelementptr inbounds [100 x [100 x [100 x [100 x [100 x [100 x [100 x i64]]]]]]], [100 x [100 x [100 x [100 x [100 x [100 x [100 x i64]]]]]]]* %A, i64 %sub36, i64 %j.041, i64 2, i64 %sub, i64 %add3547, i64 %m.029, i64 %add34, i64 %add
  226. store i64 %i.045, i64* %arrayidx43, align 8
  227. %add44 = add nsw i64 %t.03, 2
  228. %add45 = add nsw i64 %n, 1
  229. %mul46 = mul nsw i64 %l.033, 3
  230. %sub47 = add nsw i64 %mul46, -1
  231. %sub48 = sub nsw i64 1, %k.037
  232. %add49 = add nsw i64 %i.045, 3
  233. %arrayidx57 = getelementptr inbounds [100 x [100 x [100 x [100 x [100 x [100 x [100 x i64]]]]]]], [100 x [100 x [100 x [100 x [100 x [100 x [100 x i64]]]]]]]* %A, i64 %add49, i64 2, i64 %u.06, i64 %sub48, i64 %sub47, i64 %o.025, i64 %add45, i64 %add44
  234. %0 = load i64, i64* %arrayidx57, align 8
  235. %incdec.ptr = getelementptr inbounds i64, i64* %B.addr.112, i64 1
  236. store i64 %0, i64* %B.addr.112, align 8
  237. %inc = add nsw i64 %t.03, 1
  238. %exitcond = icmp ne i64 %inc, %n
  239. br i1 %exitcond, label %for.body33, label %for.inc58.loopexit
  240. for.inc58.loopexit: ; preds = %for.body33
  241. %scevgep = getelementptr i64, i64* %B.addr.105, i64 %n
  242. br label %for.inc58
  243. for.inc58: ; preds = %for.inc58.loopexit, %for.cond31.preheader
  244. %B.addr.11.lcssa = phi i64* [ %B.addr.105, %for.cond31.preheader ], [ %scevgep, %for.inc58.loopexit ]
  245. %inc59 = add nsw i64 %u.06, 1
  246. %exitcond48 = icmp ne i64 %inc59, %n
  247. br i1 %exitcond48, label %for.cond31.preheader, label %for.inc61.loopexit
  248. for.inc61.loopexit: ; preds = %for.inc58
  249. %B.addr.11.lcssa.lcssa = phi i64* [ %B.addr.11.lcssa, %for.inc58 ]
  250. br label %for.inc61
  251. for.inc61: ; preds = %for.inc61.loopexit, %for.cond28.preheader
  252. %B.addr.10.lcssa = phi i64* [ %B.addr.910, %for.cond28.preheader ], [ %B.addr.11.lcssa.lcssa, %for.inc61.loopexit ]
  253. %inc62 = add nsw i64 %s.09, 1
  254. %exitcond49 = icmp ne i64 %inc62, %n
  255. br i1 %exitcond49, label %for.cond28.preheader, label %for.inc64.loopexit
  256. for.inc64.loopexit: ; preds = %for.inc61
  257. %B.addr.10.lcssa.lcssa = phi i64* [ %B.addr.10.lcssa, %for.inc61 ]
  258. br label %for.inc64
  259. for.inc64: ; preds = %for.inc64.loopexit, %for.cond25.preheader
  260. %B.addr.9.lcssa = phi i64* [ %B.addr.814, %for.cond25.preheader ], [ %B.addr.10.lcssa.lcssa, %for.inc64.loopexit ]
  261. %inc65 = add nsw i64 %r.013, 1
  262. %exitcond50 = icmp ne i64 %inc65, %n
  263. br i1 %exitcond50, label %for.cond25.preheader, label %for.inc67.loopexit
  264. for.inc67.loopexit: ; preds = %for.inc64
  265. %B.addr.9.lcssa.lcssa = phi i64* [ %B.addr.9.lcssa, %for.inc64 ]
  266. br label %for.inc67
  267. for.inc67: ; preds = %for.inc67.loopexit, %for.cond22.preheader
  268. %B.addr.8.lcssa = phi i64* [ %B.addr.718, %for.cond22.preheader ], [ %B.addr.9.lcssa.lcssa, %for.inc67.loopexit ]
  269. %inc68 = add nsw i64 %q.017, 1
  270. %exitcond51 = icmp ne i64 %inc68, %n
  271. br i1 %exitcond51, label %for.cond22.preheader, label %for.inc70.loopexit
  272. for.inc70.loopexit: ; preds = %for.inc67
  273. %B.addr.8.lcssa.lcssa = phi i64* [ %B.addr.8.lcssa, %for.inc67 ]
  274. br label %for.inc70
  275. for.inc70: ; preds = %for.inc70.loopexit, %for.cond19.preheader
  276. %B.addr.7.lcssa = phi i64* [ %B.addr.622, %for.cond19.preheader ], [ %B.addr.8.lcssa.lcssa, %for.inc70.loopexit ]
  277. %inc71 = add nsw i64 %p.021, 1
  278. %exitcond52 = icmp ne i64 %inc71, %n
  279. br i1 %exitcond52, label %for.cond19.preheader, label %for.inc73.loopexit
  280. for.inc73.loopexit: ; preds = %for.inc70
  281. %B.addr.7.lcssa.lcssa = phi i64* [ %B.addr.7.lcssa, %for.inc70 ]
  282. br label %for.inc73
  283. for.inc73: ; preds = %for.inc73.loopexit, %for.cond16.preheader
  284. %B.addr.6.lcssa = phi i64* [ %B.addr.526, %for.cond16.preheader ], [ %B.addr.7.lcssa.lcssa, %for.inc73.loopexit ]
  285. %inc74 = add nsw i64 %o.025, 1
  286. %exitcond53 = icmp ne i64 %inc74, %n
  287. br i1 %exitcond53, label %for.cond16.preheader, label %for.inc76.loopexit
  288. for.inc76.loopexit: ; preds = %for.inc73
  289. %B.addr.6.lcssa.lcssa = phi i64* [ %B.addr.6.lcssa, %for.inc73 ]
  290. br label %for.inc76
  291. for.inc76: ; preds = %for.inc76.loopexit, %for.cond13.preheader
  292. %B.addr.5.lcssa = phi i64* [ %B.addr.430, %for.cond13.preheader ], [ %B.addr.6.lcssa.lcssa, %for.inc76.loopexit ]
  293. %inc77 = add nsw i64 %m.029, 1
  294. %exitcond54 = icmp ne i64 %inc77, %n
  295. br i1 %exitcond54, label %for.cond13.preheader, label %for.inc79.loopexit
  296. for.inc79.loopexit: ; preds = %for.inc76
  297. %B.addr.5.lcssa.lcssa = phi i64* [ %B.addr.5.lcssa, %for.inc76 ]
  298. br label %for.inc79
  299. for.inc79: ; preds = %for.inc79.loopexit, %for.cond10.preheader
  300. %B.addr.4.lcssa = phi i64* [ %B.addr.334, %for.cond10.preheader ], [ %B.addr.5.lcssa.lcssa, %for.inc79.loopexit ]
  301. %inc80 = add nsw i64 %l.033, 1
  302. %exitcond55 = icmp ne i64 %inc80, %n
  303. br i1 %exitcond55, label %for.cond10.preheader, label %for.inc82.loopexit
  304. for.inc82.loopexit: ; preds = %for.inc79
  305. %B.addr.4.lcssa.lcssa = phi i64* [ %B.addr.4.lcssa, %for.inc79 ]
  306. br label %for.inc82
  307. for.inc82: ; preds = %for.inc82.loopexit, %for.cond7.preheader
  308. %B.addr.3.lcssa = phi i64* [ %B.addr.238, %for.cond7.preheader ], [ %B.addr.4.lcssa.lcssa, %for.inc82.loopexit ]
  309. %inc83 = add nsw i64 %k.037, 1
  310. %exitcond56 = icmp ne i64 %inc83, %n
  311. br i1 %exitcond56, label %for.cond7.preheader, label %for.inc85.loopexit
  312. for.inc85.loopexit: ; preds = %for.inc82
  313. %B.addr.3.lcssa.lcssa = phi i64* [ %B.addr.3.lcssa, %for.inc82 ]
  314. br label %for.inc85
  315. for.inc85: ; preds = %for.inc85.loopexit, %for.cond4.preheader
  316. %B.addr.2.lcssa = phi i64* [ %B.addr.142, %for.cond4.preheader ], [ %B.addr.3.lcssa.lcssa, %for.inc85.loopexit ]
  317. %inc86 = add nsw i64 %j.041, 1
  318. %exitcond57 = icmp ne i64 %inc86, %n
  319. br i1 %exitcond57, label %for.cond4.preheader, label %for.inc88.loopexit
  320. for.inc88.loopexit: ; preds = %for.inc85
  321. %B.addr.2.lcssa.lcssa = phi i64* [ %B.addr.2.lcssa, %for.inc85 ]
  322. br label %for.inc88
  323. for.inc88: ; preds = %for.inc88.loopexit, %for.cond1.preheader
  324. %B.addr.1.lcssa = phi i64* [ %B.addr.046, %for.cond1.preheader ], [ %B.addr.2.lcssa.lcssa, %for.inc88.loopexit ]
  325. %inc89 = add nsw i64 %i.045, 1
  326. %exitcond58 = icmp ne i64 %inc89, %n
  327. br i1 %exitcond58, label %for.cond1.preheader, label %for.end90.loopexit
  328. for.end90.loopexit: ; preds = %for.inc88
  329. br label %for.end90
  330. for.end90: ; preds = %for.end90.loopexit, %entry
  331. ret void
  332. }
  333. ;;void p4(int *A, int *B, long int n) {
  334. ;; for (char i = 0; i < n; i++) {
  335. ;; A[i + 2] = i;
  336. ;; *B++ = A[i];
  337. define void @p4(i32* %A, i32* %B, i64 %n) nounwind uwtable ssp {
  338. entry:
  339. %cmp1 = icmp sgt i64 %n, 0
  340. br i1 %cmp1, label %for.body.preheader, label %for.end
  341. ; CHECK: da analyze - output [*]!
  342. ; CHECK: da analyze - flow [*|<]!
  343. ; CHECK: da analyze - confused!
  344. ; CHECK: da analyze - none!
  345. ; CHECK: da analyze - confused!
  346. ; CHECK: da analyze - none!
  347. for.body.preheader: ; preds = %entry
  348. br label %for.body
  349. for.body: ; preds = %for.body.preheader, %for.body
  350. %i.03 = phi i8 [ %inc, %for.body ], [ 0, %for.body.preheader ]
  351. %B.addr.02 = phi i32* [ %incdec.ptr, %for.body ], [ %B, %for.body.preheader ]
  352. %conv2 = sext i8 %i.03 to i32
  353. %conv3 = sext i8 %i.03 to i64
  354. %add = add i64 %conv3, 2
  355. %arrayidx = getelementptr inbounds i32, i32* %A, i64 %add
  356. store i32 %conv2, i32* %arrayidx, align 4
  357. %idxprom4 = sext i8 %i.03 to i64
  358. %arrayidx5 = getelementptr inbounds i32, i32* %A, i64 %idxprom4
  359. %0 = load i32, i32* %arrayidx5, align 4
  360. %incdec.ptr = getelementptr inbounds i32, i32* %B.addr.02, i64 1
  361. store i32 %0, i32* %B.addr.02, align 4
  362. %inc = add i8 %i.03, 1
  363. %conv = sext i8 %inc to i64
  364. %cmp = icmp slt i64 %conv, %n
  365. br i1 %cmp, label %for.body, label %for.end.loopexit
  366. for.end.loopexit: ; preds = %for.body
  367. br label %for.end
  368. for.end: ; preds = %for.end.loopexit, %entry
  369. ret void
  370. }
  371. ;;void p5(int *A, int *B, long int n) {
  372. ;; for (short i = 0; i < n; i++) {
  373. ;; A[i + 2] = i;
  374. ;; *B++ = A[i];
  375. define void @p5(i32* %A, i32* %B, i64 %n) nounwind uwtable ssp {
  376. entry:
  377. %cmp1 = icmp sgt i64 %n, 0
  378. br i1 %cmp1, label %for.body.preheader, label %for.end
  379. ; CHECK: da analyze - output [*]!
  380. ; CHECK: da analyze - flow [*|<]!
  381. ; CHECK: da analyze - confused!
  382. ; CHECK: da analyze - none!
  383. ; CHECK: da analyze - confused!
  384. ; CHECK: da analyze - none!
  385. for.body.preheader: ; preds = %entry
  386. br label %for.body
  387. for.body: ; preds = %for.body.preheader, %for.body
  388. %i.03 = phi i16 [ %inc, %for.body ], [ 0, %for.body.preheader ]
  389. %B.addr.02 = phi i32* [ %incdec.ptr, %for.body ], [ %B, %for.body.preheader ]
  390. %conv2 = sext i16 %i.03 to i32
  391. %conv3 = sext i16 %i.03 to i64
  392. %add = add i64 %conv3, 2
  393. %arrayidx = getelementptr inbounds i32, i32* %A, i64 %add
  394. store i32 %conv2, i32* %arrayidx, align 4
  395. %idxprom4 = sext i16 %i.03 to i64
  396. %arrayidx5 = getelementptr inbounds i32, i32* %A, i64 %idxprom4
  397. %0 = load i32, i32* %arrayidx5, align 4
  398. %incdec.ptr = getelementptr inbounds i32, i32* %B.addr.02, i64 1
  399. store i32 %0, i32* %B.addr.02, align 4
  400. %inc = add i16 %i.03, 1
  401. %conv = sext i16 %inc to i64
  402. %cmp = icmp slt i64 %conv, %n
  403. br i1 %cmp, label %for.body, label %for.end.loopexit
  404. for.end.loopexit: ; preds = %for.body
  405. br label %for.end
  406. for.end: ; preds = %for.end.loopexit, %entry
  407. ret void
  408. }
  409. ;;void p6(int *A, int *B, long int n) {
  410. ;; for (int i = 0; i < n; i++) {
  411. ;; A[i + 2] = i;
  412. ;; *B++ = A[i];
  413. define void @p6(i32* %A, i32* %B, i64 %n) nounwind uwtable ssp {
  414. entry:
  415. %cmp1 = icmp sgt i64 %n, 0
  416. br i1 %cmp1, label %for.body.preheader, label %for.end
  417. ; CHECK: da analyze - none!
  418. ; CHECK: da analyze - consistent flow [2]!
  419. ; CHECK: da analyze - confused!
  420. ; CHECK: da analyze - none!
  421. ; CHECK: da analyze - confused!
  422. ; CHECK: da analyze - none!
  423. for.body.preheader: ; preds = %entry
  424. br label %for.body
  425. for.body: ; preds = %for.body.preheader, %for.body
  426. %indvars.iv = phi i64 [ 0, %for.body.preheader ], [ %indvars.iv.next, %for.body ]
  427. %B.addr.02 = phi i32* [ %incdec.ptr, %for.body ], [ %B, %for.body.preheader ]
  428. %0 = add nsw i64 %indvars.iv, 2
  429. %arrayidx = getelementptr inbounds i32, i32* %A, i64 %0
  430. %1 = trunc i64 %indvars.iv to i32
  431. store i32 %1, i32* %arrayidx, align 4
  432. %arrayidx3 = getelementptr inbounds i32, i32* %A, i64 %indvars.iv
  433. %2 = load i32, i32* %arrayidx3, align 4
  434. %incdec.ptr = getelementptr inbounds i32, i32* %B.addr.02, i64 1
  435. store i32 %2, i32* %B.addr.02, align 4
  436. %indvars.iv.next = add i64 %indvars.iv, 1
  437. %exitcond = icmp ne i64 %indvars.iv.next, %n
  438. br i1 %exitcond, label %for.body, label %for.end.loopexit
  439. for.end.loopexit: ; preds = %for.body
  440. br label %for.end
  441. for.end: ; preds = %for.end.loopexit, %entry
  442. ret void
  443. }
  444. ;;void p7(unsigned *A, unsigned *B, char n) {
  445. ;; A[n] = 0;
  446. ;; *B = A[n + 1];
  447. define void @p7(i32* %A, i32* %B, i8 signext %n) nounwind uwtable ssp {
  448. entry:
  449. %idxprom = sext i8 %n to i64
  450. %arrayidx = getelementptr inbounds i32, i32* %A, i64 %idxprom
  451. ; CHECK: da analyze - none!
  452. ; CHECK: da analyze - none!
  453. ; CHECK: da analyze - confused!
  454. ; CHECK: da analyze - none!
  455. ; CHECK: da analyze - confused!
  456. ; CHECK: da analyze - none!
  457. store i32 0, i32* %arrayidx, align 4
  458. %conv = sext i8 %n to i64
  459. %add = add i64 %conv, 1
  460. %arrayidx2 = getelementptr inbounds i32, i32* %A, i64 %add
  461. %0 = load i32, i32* %arrayidx2, align 4
  462. store i32 %0, i32* %B, align 4
  463. ret void
  464. }
  465. ;;void p8(unsigned *A, unsigned *B, short n) {
  466. ;; A[n] = 0;
  467. ;; *B = A[n + 1];
  468. define void @p8(i32* %A, i32* %B, i16 signext %n) nounwind uwtable ssp {
  469. entry:
  470. %idxprom = sext i16 %n to i64
  471. %arrayidx = getelementptr inbounds i32, i32* %A, i64 %idxprom
  472. store i32 0, i32* %arrayidx, align 4
  473. ; CHECK: da analyze - none!
  474. ; CHECK: da analyze - none!
  475. ; CHECK: da analyze - confused!
  476. ; CHECK: da analyze - none!
  477. ; CHECK: da analyze - confused!
  478. ; CHECK: da analyze - none!
  479. %conv = sext i16 %n to i64
  480. %add = add i64 %conv, 1
  481. %arrayidx2 = getelementptr inbounds i32, i32* %A, i64 %add
  482. %0 = load i32, i32* %arrayidx2, align 4
  483. store i32 %0, i32* %B, align 4
  484. ret void
  485. }
  486. ;;void p9(unsigned *A, unsigned *B, int n) {
  487. ;; A[n] = 0;
  488. ;; *B = A[n + 1];
  489. define void @p9(i32* %A, i32* %B, i32 %n) nounwind uwtable ssp {
  490. entry:
  491. %idxprom = sext i32 %n to i64
  492. %arrayidx = getelementptr inbounds i32, i32* %A, i64 %idxprom
  493. store i32 0, i32* %arrayidx, align 4
  494. ; CHECK: da analyze - none!
  495. ; CHECK: da analyze - none!
  496. ; CHECK: da analyze - confused!
  497. ; CHECK: da analyze - none!
  498. ; CHECK: da analyze - confused!
  499. ; CHECK: da analyze - none!
  500. %add = add nsw i32 %n, 1
  501. %idxprom1 = sext i32 %add to i64
  502. %arrayidx2 = getelementptr inbounds i32, i32* %A, i64 %idxprom1
  503. %0 = load i32, i32* %arrayidx2, align 4
  504. store i32 %0, i32* %B, align 4
  505. ret void
  506. }
  507. ;;void p10(unsigned *A, unsigned *B, unsigned n) {
  508. ;; A[n] = 0;
  509. ;; *B = A[n + 1];
  510. define void @p10(i32* %A, i32* %B, i32 %n) nounwind uwtable ssp {
  511. entry:
  512. %idxprom = zext i32 %n to i64
  513. %arrayidx = getelementptr inbounds i32, i32* %A, i64 %idxprom
  514. store i32 0, i32* %arrayidx, align 4
  515. ; CHECK: da analyze - none!
  516. ; CHECK: da analyze - none!
  517. ; CHECK: da analyze - confused!
  518. ; CHECK: da analyze - none!
  519. ; CHECK: da analyze - confused!
  520. ; CHECK: da analyze - none!
  521. %add = add i32 %n, 1
  522. %idxprom1 = zext i32 %add to i64
  523. %arrayidx2 = getelementptr inbounds i32, i32* %A, i64 %idxprom1
  524. %0 = load i32, i32* %arrayidx2, align 4
  525. store i32 %0, i32* %B, align 4
  526. ret void
  527. }
  528. ;;typedef struct { int v; } S;
  529. ;;
  530. ;;void f(S *s, unsigned size) {
  531. ;; S *i = s, *e = s + size - 1;
  532. ;; while (i != e) {
  533. ;; *i = *(i + 1);
  534. ;; ++i;
  535. %struct.S = type { i32 }
  536. define void @f(%struct.S* %s, i32 %size) nounwind uwtable ssp {
  537. entry:
  538. %idx.ext = zext i32 %size to i64
  539. %add.ptr.sum = add i64 %idx.ext, -1
  540. %add.ptr1 = getelementptr inbounds %struct.S, %struct.S* %s, i64 %add.ptr.sum
  541. %cmp1 = icmp eq i64 %add.ptr.sum, 0
  542. br i1 %cmp1, label %while.end, label %while.body.preheader
  543. ; CHECK: da analyze - none!
  544. ; CHECK: da analyze - consistent anti [1]!
  545. ; CHECK: da analyze - none!
  546. while.body.preheader: ; preds = %entry
  547. br label %while.body
  548. while.body: ; preds = %while.body.preheader, %while.body
  549. %i.02 = phi %struct.S* [ %incdec.ptr, %while.body ], [ %s, %while.body.preheader ]
  550. %0 = getelementptr inbounds %struct.S, %struct.S* %i.02, i64 1, i32 0
  551. %1 = load i32, i32* %0, align 4
  552. %2 = getelementptr inbounds %struct.S, %struct.S* %i.02, i64 0, i32 0
  553. store i32 %1, i32* %2, align 4
  554. %incdec.ptr = getelementptr inbounds %struct.S, %struct.S* %i.02, i64 1
  555. %cmp = icmp eq %struct.S* %incdec.ptr, %add.ptr1
  556. br i1 %cmp, label %while.end.loopexit, label %while.body
  557. while.end.loopexit: ; preds = %while.body
  558. br label %while.end
  559. while.end: ; preds = %while.end.loopexit, %entry
  560. ret void
  561. }
  562. declare void @llvm.memcpy.p0i8.p0i8.i64(i8* nocapture, i8* nocapture, i64, i32, i1) nounwind