Separability.ll 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303
  1. ; RUN: opt < %s -analyze -basicaa -da | FileCheck %s
  2. ; ModuleID = 'Separability.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. ;; for (long int i = 0; i < 50; i++)
  6. ;; for (long int j = 0; j < 50; j++)
  7. ;; for (long int k = 0; k < 50; k++)
  8. ;; for (long int l = 0; l < 50; l++) {
  9. ;; A[n][i][j + k] = i;
  10. ;; *B++ = A[10][i + 10][2*j - l];
  11. define void @sep0([100 x [100 x i32]]* %A, i32* %B, i32 %n) nounwind uwtable ssp {
  12. entry:
  13. br label %for.cond1.preheader
  14. ; CHECK: da analyze - output [0 * * S]!
  15. ; CHECK: da analyze - flow [-10 * * *]!
  16. ; CHECK: da analyze - confused!
  17. ; CHECK: da analyze - input [0 * S *]!
  18. ; CHECK: da analyze - confused!
  19. ; CHECK: da analyze - none!
  20. for.cond1.preheader: ; preds = %entry, %for.inc22
  21. %B.addr.08 = phi i32* [ %B, %entry ], [ %scevgep11, %for.inc22 ]
  22. %i.07 = phi i64 [ 0, %entry ], [ %inc23, %for.inc22 ]
  23. br label %for.cond4.preheader
  24. for.cond4.preheader: ; preds = %for.cond1.preheader, %for.inc19
  25. %B.addr.16 = phi i32* [ %B.addr.08, %for.cond1.preheader ], [ %scevgep9, %for.inc19 ]
  26. %j.05 = phi i64 [ 0, %for.cond1.preheader ], [ %inc20, %for.inc19 ]
  27. br label %for.cond7.preheader
  28. for.cond7.preheader: ; preds = %for.cond4.preheader, %for.inc16
  29. %B.addr.24 = phi i32* [ %B.addr.16, %for.cond4.preheader ], [ %scevgep, %for.inc16 ]
  30. %k.03 = phi i64 [ 0, %for.cond4.preheader ], [ %inc17, %for.inc16 ]
  31. br label %for.body9
  32. for.body9: ; preds = %for.cond7.preheader, %for.body9
  33. %l.02 = phi i64 [ 0, %for.cond7.preheader ], [ %inc, %for.body9 ]
  34. %B.addr.31 = phi i32* [ %B.addr.24, %for.cond7.preheader ], [ %incdec.ptr, %for.body9 ]
  35. %conv = trunc i64 %i.07 to i32
  36. %add = add nsw i64 %j.05, %k.03
  37. %idxprom = sext i32 %n to i64
  38. %arrayidx11 = getelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* %A, i64 %idxprom, i64 %i.07, i64 %add
  39. store i32 %conv, i32* %arrayidx11, align 4
  40. %mul = shl nsw i64 %j.05, 1
  41. %sub = sub nsw i64 %mul, %l.02
  42. %add12 = add nsw i64 %i.07, 10
  43. %arrayidx15 = getelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* %A, i64 10, i64 %add12, i64 %sub
  44. %0 = load i32, i32* %arrayidx15, align 4
  45. %incdec.ptr = getelementptr inbounds i32, i32* %B.addr.31, i64 1
  46. store i32 %0, i32* %B.addr.31, align 4
  47. %inc = add nsw i64 %l.02, 1
  48. %exitcond = icmp ne i64 %inc, 50
  49. br i1 %exitcond, label %for.body9, label %for.inc16
  50. for.inc16: ; preds = %for.body9
  51. %scevgep = getelementptr i32, i32* %B.addr.24, i64 50
  52. %inc17 = add nsw i64 %k.03, 1
  53. %exitcond10 = icmp ne i64 %inc17, 50
  54. br i1 %exitcond10, label %for.cond7.preheader, label %for.inc19
  55. for.inc19: ; preds = %for.inc16
  56. %scevgep9 = getelementptr i32, i32* %B.addr.16, i64 2500
  57. %inc20 = add nsw i64 %j.05, 1
  58. %exitcond12 = icmp ne i64 %inc20, 50
  59. br i1 %exitcond12, label %for.cond4.preheader, label %for.inc22
  60. for.inc22: ; preds = %for.inc19
  61. %scevgep11 = getelementptr i32, i32* %B.addr.08, i64 125000
  62. %inc23 = add nsw i64 %i.07, 1
  63. %exitcond13 = icmp ne i64 %inc23, 50
  64. br i1 %exitcond13, label %for.cond1.preheader, label %for.end24
  65. for.end24: ; preds = %for.inc22
  66. ret void
  67. }
  68. ;; for (long int i = 0; i < 50; i++)
  69. ;; for (long int j = 0; j < 50; j++)
  70. ;; for (long int k = 0; k < 50; k++)
  71. ;; for (long int l = 0; l < 50; l++) {
  72. ;; A[i][i][j + k] = i;
  73. ;; *B++ = A[10][i + 10][2*j - l];
  74. define void @sep1([100 x [100 x i32]]* %A, i32* %B, i32 %n) nounwind uwtable ssp {
  75. entry:
  76. br label %for.cond1.preheader
  77. ; CHECK: da analyze - output [0 * * S]!
  78. ; CHECK: da analyze - flow [> * * *]!
  79. ; CHECK: da analyze - confused!
  80. ; CHECK: da analyze - input [0 * S *]!
  81. ; CHECK: da analyze - confused!
  82. ; CHECK: da analyze - none!
  83. for.cond1.preheader: ; preds = %entry, %for.inc22
  84. %B.addr.08 = phi i32* [ %B, %entry ], [ %scevgep11, %for.inc22 ]
  85. %i.07 = phi i64 [ 0, %entry ], [ %inc23, %for.inc22 ]
  86. br label %for.cond4.preheader
  87. for.cond4.preheader: ; preds = %for.cond1.preheader, %for.inc19
  88. %B.addr.16 = phi i32* [ %B.addr.08, %for.cond1.preheader ], [ %scevgep9, %for.inc19 ]
  89. %j.05 = phi i64 [ 0, %for.cond1.preheader ], [ %inc20, %for.inc19 ]
  90. br label %for.cond7.preheader
  91. for.cond7.preheader: ; preds = %for.cond4.preheader, %for.inc16
  92. %B.addr.24 = phi i32* [ %B.addr.16, %for.cond4.preheader ], [ %scevgep, %for.inc16 ]
  93. %k.03 = phi i64 [ 0, %for.cond4.preheader ], [ %inc17, %for.inc16 ]
  94. br label %for.body9
  95. for.body9: ; preds = %for.cond7.preheader, %for.body9
  96. %l.02 = phi i64 [ 0, %for.cond7.preheader ], [ %inc, %for.body9 ]
  97. %B.addr.31 = phi i32* [ %B.addr.24, %for.cond7.preheader ], [ %incdec.ptr, %for.body9 ]
  98. %conv = trunc i64 %i.07 to i32
  99. %add = add nsw i64 %j.05, %k.03
  100. %arrayidx11 = getelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* %A, i64 %i.07, i64 %i.07, i64 %add
  101. store i32 %conv, i32* %arrayidx11, align 4
  102. %mul = shl nsw i64 %j.05, 1
  103. %sub = sub nsw i64 %mul, %l.02
  104. %add12 = add nsw i64 %i.07, 10
  105. %arrayidx15 = getelementptr inbounds [100 x [100 x i32]], [100 x [100 x i32]]* %A, i64 10, i64 %add12, i64 %sub
  106. %0 = load i32, i32* %arrayidx15, align 4
  107. %incdec.ptr = getelementptr inbounds i32, i32* %B.addr.31, i64 1
  108. store i32 %0, i32* %B.addr.31, align 4
  109. %inc = add nsw i64 %l.02, 1
  110. %exitcond = icmp ne i64 %inc, 50
  111. br i1 %exitcond, label %for.body9, label %for.inc16
  112. for.inc16: ; preds = %for.body9
  113. %scevgep = getelementptr i32, i32* %B.addr.24, i64 50
  114. %inc17 = add nsw i64 %k.03, 1
  115. %exitcond10 = icmp ne i64 %inc17, 50
  116. br i1 %exitcond10, label %for.cond7.preheader, label %for.inc19
  117. for.inc19: ; preds = %for.inc16
  118. %scevgep9 = getelementptr i32, i32* %B.addr.16, i64 2500
  119. %inc20 = add nsw i64 %j.05, 1
  120. %exitcond12 = icmp ne i64 %inc20, 50
  121. br i1 %exitcond12, label %for.cond4.preheader, label %for.inc22
  122. for.inc22: ; preds = %for.inc19
  123. %scevgep11 = getelementptr i32, i32* %B.addr.08, i64 125000
  124. %inc23 = add nsw i64 %i.07, 1
  125. %exitcond13 = icmp ne i64 %inc23, 50
  126. br i1 %exitcond13, label %for.cond1.preheader, label %for.end24
  127. for.end24: ; preds = %for.inc22
  128. ret void
  129. }
  130. ;; for (long int i = 0; i < 50; i++)
  131. ;; for (long int j = 0; j < 50; j++)
  132. ;; for (long int k = 0; k < 50; k++)
  133. ;; for (long int l = 0; l < 50; l++) {
  134. ;; A[i][i][i + k][l] = i;
  135. ;; *B++ = A[10][i + 10][j + k][l + 10];
  136. define void @sep2([100 x [100 x [100 x i32]]]* %A, i32* %B, i32 %n) nounwind uwtable ssp {
  137. entry:
  138. br label %for.cond1.preheader
  139. ; CHECK: da analyze - consistent output [0 S 0 0]!
  140. ; CHECK: da analyze - flow [> * * -10]!
  141. ; CHECK: da analyze - confused!
  142. ; CHECK: da analyze - input [0 * * 0]!
  143. ; CHECK: da analyze - confused!
  144. ; CHECK: da analyze - none!
  145. for.cond1.preheader: ; preds = %entry, %for.inc26
  146. %B.addr.08 = phi i32* [ %B, %entry ], [ %scevgep11, %for.inc26 ]
  147. %i.07 = phi i64 [ 0, %entry ], [ %inc27, %for.inc26 ]
  148. br label %for.cond4.preheader
  149. for.cond4.preheader: ; preds = %for.cond1.preheader, %for.inc23
  150. %B.addr.16 = phi i32* [ %B.addr.08, %for.cond1.preheader ], [ %scevgep9, %for.inc23 ]
  151. %j.05 = phi i64 [ 0, %for.cond1.preheader ], [ %inc24, %for.inc23 ]
  152. br label %for.cond7.preheader
  153. for.cond7.preheader: ; preds = %for.cond4.preheader, %for.inc20
  154. %B.addr.24 = phi i32* [ %B.addr.16, %for.cond4.preheader ], [ %scevgep, %for.inc20 ]
  155. %k.03 = phi i64 [ 0, %for.cond4.preheader ], [ %inc21, %for.inc20 ]
  156. br label %for.body9
  157. for.body9: ; preds = %for.cond7.preheader, %for.body9
  158. %l.02 = phi i64 [ 0, %for.cond7.preheader ], [ %inc, %for.body9 ]
  159. %B.addr.31 = phi i32* [ %B.addr.24, %for.cond7.preheader ], [ %incdec.ptr, %for.body9 ]
  160. %conv = trunc i64 %i.07 to i32
  161. %add = add nsw i64 %i.07, %k.03
  162. %arrayidx12 = getelementptr inbounds [100 x [100 x [100 x i32]]], [100 x [100 x [100 x i32]]]* %A, i64 %i.07, i64 %i.07, i64 %add, i64 %l.02
  163. store i32 %conv, i32* %arrayidx12, align 4
  164. %add13 = add nsw i64 %l.02, 10
  165. %add14 = add nsw i64 %j.05, %k.03
  166. %add15 = add nsw i64 %i.07, 10
  167. %arrayidx19 = getelementptr inbounds [100 x [100 x [100 x i32]]], [100 x [100 x [100 x i32]]]* %A, i64 10, i64 %add15, i64 %add14, i64 %add13
  168. %0 = load i32, i32* %arrayidx19, align 4
  169. %incdec.ptr = getelementptr inbounds i32, i32* %B.addr.31, i64 1
  170. store i32 %0, i32* %B.addr.31, align 4
  171. %inc = add nsw i64 %l.02, 1
  172. %exitcond = icmp ne i64 %inc, 50
  173. br i1 %exitcond, label %for.body9, label %for.inc20
  174. for.inc20: ; preds = %for.body9
  175. %scevgep = getelementptr i32, i32* %B.addr.24, i64 50
  176. %inc21 = add nsw i64 %k.03, 1
  177. %exitcond10 = icmp ne i64 %inc21, 50
  178. br i1 %exitcond10, label %for.cond7.preheader, label %for.inc23
  179. for.inc23: ; preds = %for.inc20
  180. %scevgep9 = getelementptr i32, i32* %B.addr.16, i64 2500
  181. %inc24 = add nsw i64 %j.05, 1
  182. %exitcond12 = icmp ne i64 %inc24, 50
  183. br i1 %exitcond12, label %for.cond4.preheader, label %for.inc26
  184. for.inc26: ; preds = %for.inc23
  185. %scevgep11 = getelementptr i32, i32* %B.addr.08, i64 125000
  186. %inc27 = add nsw i64 %i.07, 1
  187. %exitcond13 = icmp ne i64 %inc27, 50
  188. br i1 %exitcond13, label %for.cond1.preheader, label %for.end28
  189. for.end28: ; preds = %for.inc26
  190. ret void
  191. }
  192. ;; for (long int i = 0; i < 50; i++)
  193. ;; for (long int j = 0; j < 50; j++)
  194. ;; for (long int k = 0; k < 50; k++)
  195. ;; for (long int l = 0; l < 50; l++) {
  196. ;; A[i][i][i + k][l + k] = i;
  197. ;; *B++ = A[10][i + 10][j + k][l + 10];
  198. define void @sep3([100 x [100 x [100 x i32]]]* %A, i32* %B, i32 %n) nounwind uwtable ssp {
  199. entry:
  200. br label %for.cond1.preheader
  201. ; CHECK: da analyze - consistent output [0 S 0 0]!
  202. ; CHECK: da analyze - flow [> * * *]!
  203. ; CHECK: da analyze - confused!
  204. ; CHECK: da analyze - input [0 * * 0]!
  205. ; CHECK: da analyze - confused!
  206. ; CHECK: da analyze - none!
  207. for.cond1.preheader: ; preds = %entry, %for.inc27
  208. %B.addr.08 = phi i32* [ %B, %entry ], [ %scevgep11, %for.inc27 ]
  209. %i.07 = phi i64 [ 0, %entry ], [ %inc28, %for.inc27 ]
  210. br label %for.cond4.preheader
  211. for.cond4.preheader: ; preds = %for.cond1.preheader, %for.inc24
  212. %B.addr.16 = phi i32* [ %B.addr.08, %for.cond1.preheader ], [ %scevgep9, %for.inc24 ]
  213. %j.05 = phi i64 [ 0, %for.cond1.preheader ], [ %inc25, %for.inc24 ]
  214. br label %for.cond7.preheader
  215. for.cond7.preheader: ; preds = %for.cond4.preheader, %for.inc21
  216. %B.addr.24 = phi i32* [ %B.addr.16, %for.cond4.preheader ], [ %scevgep, %for.inc21 ]
  217. %k.03 = phi i64 [ 0, %for.cond4.preheader ], [ %inc22, %for.inc21 ]
  218. br label %for.body9
  219. for.body9: ; preds = %for.cond7.preheader, %for.body9
  220. %l.02 = phi i64 [ 0, %for.cond7.preheader ], [ %inc, %for.body9 ]
  221. %B.addr.31 = phi i32* [ %B.addr.24, %for.cond7.preheader ], [ %incdec.ptr, %for.body9 ]
  222. %conv = trunc i64 %i.07 to i32
  223. %add = add nsw i64 %l.02, %k.03
  224. %add10 = add nsw i64 %i.07, %k.03
  225. %arrayidx13 = getelementptr inbounds [100 x [100 x [100 x i32]]], [100 x [100 x [100 x i32]]]* %A, i64 %i.07, i64 %i.07, i64 %add10, i64 %add
  226. store i32 %conv, i32* %arrayidx13, align 4
  227. %add14 = add nsw i64 %l.02, 10
  228. %add15 = add nsw i64 %j.05, %k.03
  229. %add16 = add nsw i64 %i.07, 10
  230. %arrayidx20 = getelementptr inbounds [100 x [100 x [100 x i32]]], [100 x [100 x [100 x i32]]]* %A, i64 10, i64 %add16, i64 %add15, i64 %add14
  231. %0 = load i32, i32* %arrayidx20, align 4
  232. %incdec.ptr = getelementptr inbounds i32, i32* %B.addr.31, i64 1
  233. store i32 %0, i32* %B.addr.31, align 4
  234. %inc = add nsw i64 %l.02, 1
  235. %exitcond = icmp ne i64 %inc, 50
  236. br i1 %exitcond, label %for.body9, label %for.inc21
  237. for.inc21: ; preds = %for.body9
  238. %scevgep = getelementptr i32, i32* %B.addr.24, i64 50
  239. %inc22 = add nsw i64 %k.03, 1
  240. %exitcond10 = icmp ne i64 %inc22, 50
  241. br i1 %exitcond10, label %for.cond7.preheader, label %for.inc24
  242. for.inc24: ; preds = %for.inc21
  243. %scevgep9 = getelementptr i32, i32* %B.addr.16, i64 2500
  244. %inc25 = add nsw i64 %j.05, 1
  245. %exitcond12 = icmp ne i64 %inc25, 50
  246. br i1 %exitcond12, label %for.cond4.preheader, label %for.inc27
  247. for.inc27: ; preds = %for.inc24
  248. %scevgep11 = getelementptr i32, i32* %B.addr.08, i64 125000
  249. %inc28 = add nsw i64 %i.07, 1
  250. %exitcond13 = icmp ne i64 %inc28, 50
  251. br i1 %exitcond13, label %for.cond1.preheader, label %for.end29
  252. for.end29: ; preds = %for.inc27
  253. ret void
  254. }