tail-dup-merge-loop-headers.ll 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324
  1. ; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py
  2. ; RUN: llc < %s -mtriple=x86_64-unknown-linux-gnu | FileCheck %s
  3. ; Function Attrs: nounwind uwtable
  4. define void @tail_dup_merge_loops(i32 %a, i8* %b, i8* %c) local_unnamed_addr #0 {
  5. ; CHECK-LABEL: tail_dup_merge_loops:
  6. ; CHECK: # %bb.0: # %entry
  7. ; CHECK-NEXT: testl %edi, %edi
  8. ; CHECK-NEXT: jne .LBB0_2
  9. ; CHECK-NEXT: jmp .LBB0_5
  10. ; CHECK-NEXT: .LBB0_3: # %inner_loop_exit
  11. ; CHECK-NEXT: # in Loop: Header=BB0_2 Depth=1
  12. ; CHECK-NEXT: incq %rsi
  13. ; CHECK-NEXT: testl %edi, %edi
  14. ; CHECK-NEXT: je .LBB0_5
  15. ; CHECK-NEXT: .p2align 4, 0x90
  16. ; CHECK-NEXT: .LBB0_2: # %inner_loop_top
  17. ; CHECK-NEXT: # =>This Loop Header: Depth=1
  18. ; CHECK-NEXT: # Child Loop BB0_4 Depth 2
  19. ; CHECK-NEXT: cmpb $0, (%rsi)
  20. ; CHECK-NEXT: js .LBB0_3
  21. ; CHECK-NEXT: .LBB0_4: # %inner_loop_latch
  22. ; CHECK-NEXT: # Parent Loop BB0_2 Depth=1
  23. ; CHECK-NEXT: # => This Inner Loop Header: Depth=2
  24. ; CHECK-NEXT: addq $2, %rsi
  25. ; CHECK-NEXT: cmpb $0, (%rsi)
  26. ; CHECK-NEXT: jns .LBB0_4
  27. ; CHECK-NEXT: jmp .LBB0_3
  28. ; CHECK-NEXT: .LBB0_5: # %exit
  29. ; CHECK-NEXT: retq
  30. entry:
  31. %notlhs674.i = icmp eq i32 %a, 0
  32. br label %outer_loop_top
  33. outer_loop_top: ; preds = %inner_loop_exit, %entry
  34. %dst.0.ph.i = phi i8* [ %b, %entry ], [ %scevgep679.i, %inner_loop_exit ]
  35. br i1 %notlhs674.i, label %exit, label %inner_loop_preheader
  36. inner_loop_preheader: ; preds = %outer_loop_top
  37. br label %inner_loop_top
  38. inner_loop_top: ; preds = %inner_loop_latch, %inner_loop_preheader
  39. %dst.0.i = phi i8* [ %inc, %inner_loop_latch ], [ %dst.0.ph.i, %inner_loop_preheader ]
  40. %var = load i8, i8* %dst.0.i
  41. %tobool1.i = icmp slt i8 %var, 0
  42. br label %inner_loop_test
  43. inner_loop_test: ; preds = %inner_loop_top
  44. br i1 %tobool1.i, label %inner_loop_exit, label %inner_loop_latch
  45. inner_loop_exit: ; preds = %inner_loop_test
  46. %scevgep.i = getelementptr i8, i8* %dst.0.i, i64 1
  47. %scevgep679.i = getelementptr i8, i8* %scevgep.i, i64 0
  48. br label %outer_loop_top
  49. inner_loop_latch: ; preds = %inner_loop_test
  50. %cmp75.i = icmp ult i8* %dst.0.i, %c
  51. %inc = getelementptr i8, i8* %dst.0.i, i64 2
  52. br label %inner_loop_top
  53. exit: ; preds = %outer_loop_top
  54. ret void
  55. }
  56. @.str.6 = external unnamed_addr constant [23 x i8], align 1
  57. ; There is an erroneus check in LoopBase::addBasicBlockToLoop(), where it
  58. ; assumes that the header block for a loop is unique.
  59. ; For most of compilation this assumption is true, but during layout we allow
  60. ; this assumption to be violated. The following code will trigger the bug:
  61. ; The loops in question is eventually headed by the block shared_loop_header
  62. ;
  63. ; During layout The block labeled outer_loop_header gets tail-duplicated into
  64. ; outer_loop_latch, and into shared_preheader, and then removed. This leaves
  65. ; shared_loop_header as the header of both loops. The end result
  66. ; is that there are 2 valid loops, and that they share a header. If we re-ran
  67. ; the loop analysis, it would classify this as a single loop.
  68. ; So far this is fine as far as layout is concerned.
  69. ; After layout we tail merge blocks merge_other and merge_predecessor_split.
  70. ; We do this even though they share only a single instruction, because
  71. ; merge_predecessor_split falls through to their shared successor:
  72. ; outer_loop_latch.
  73. ; The rest of the blocks in the function are noise unfortunately. Bugpoint
  74. ; couldn't shrink the test any further.
  75. define i32 @loop_shared_header(i8* %exe, i32 %exesz, i32 %headsize, i32 %min, i32 %wwprva, i32 %e_lfanew, i8* readonly %wwp, i32 %wwpsz, i16 zeroext %sects) local_unnamed_addr #0 {
  76. ; CHECK-LABEL: loop_shared_header:
  77. ; CHECK: # %bb.0: # %entry
  78. ; CHECK-NEXT: pushq %rbp
  79. ; CHECK-NEXT: pushq %r15
  80. ; CHECK-NEXT: pushq %r14
  81. ; CHECK-NEXT: pushq %r13
  82. ; CHECK-NEXT: pushq %r12
  83. ; CHECK-NEXT: pushq %rbx
  84. ; CHECK-NEXT: pushq %rax
  85. ; CHECK-NEXT: movl $1, %ebx
  86. ; CHECK-NEXT: xorl %eax, %eax
  87. ; CHECK-NEXT: testb %al, %al
  88. ; CHECK-NEXT: jne .LBB1_26
  89. ; CHECK-NEXT: # %bb.1: # %if.end19
  90. ; CHECK-NEXT: movl %esi, %r13d
  91. ; CHECK-NEXT: movq %rdi, %r12
  92. ; CHECK-NEXT: movl (%rax), %ebp
  93. ; CHECK-NEXT: leal (,%rbp,4), %r14d
  94. ; CHECK-NEXT: movl %r14d, %r15d
  95. ; CHECK-NEXT: movl $1, %esi
  96. ; CHECK-NEXT: movq %r15, %rdi
  97. ; CHECK-NEXT: callq cli_calloc
  98. ; CHECK-NEXT: testl %r13d, %r13d
  99. ; CHECK-NEXT: je .LBB1_25
  100. ; CHECK-NEXT: # %bb.2: # %if.end19
  101. ; CHECK-NEXT: testl %ebp, %ebp
  102. ; CHECK-NEXT: je .LBB1_25
  103. ; CHECK-NEXT: # %bb.3: # %if.end19
  104. ; CHECK-NEXT: movq %rax, %rbx
  105. ; CHECK-NEXT: xorl %eax, %eax
  106. ; CHECK-NEXT: testb %al, %al
  107. ; CHECK-NEXT: jne .LBB1_25
  108. ; CHECK-NEXT: # %bb.4: # %if.end19
  109. ; CHECK-NEXT: cmpq %r12, %rbx
  110. ; CHECK-NEXT: jb .LBB1_25
  111. ; CHECK-NEXT: # %bb.5: # %if.end50
  112. ; CHECK-NEXT: movq %rbx, %rdi
  113. ; CHECK-NEXT: movq %r15, %rdx
  114. ; CHECK-NEXT: callq memcpy
  115. ; CHECK-NEXT: cmpl $4, %r14d
  116. ; CHECK-NEXT: jb .LBB1_28
  117. ; CHECK-NEXT: # %bb.6: # %shared_preheader
  118. ; CHECK-NEXT: movb $32, %dl
  119. ; CHECK-NEXT: xorl %eax, %eax
  120. ; CHECK-NEXT: # implicit-def: $rcx
  121. ; CHECK-NEXT: testl %ebp, %ebp
  122. ; CHECK-NEXT: je .LBB1_18
  123. ; CHECK-NEXT: .p2align 4, 0x90
  124. ; CHECK-NEXT: .LBB1_9: # %shared_loop_header
  125. ; CHECK-NEXT: # =>This Inner Loop Header: Depth=1
  126. ; CHECK-NEXT: testq %rbx, %rbx
  127. ; CHECK-NEXT: jne .LBB1_27
  128. ; CHECK-NEXT: # %bb.10: # %inner_loop_body
  129. ; CHECK-NEXT: # in Loop: Header=BB1_9 Depth=1
  130. ; CHECK-NEXT: testl %eax, %eax
  131. ; CHECK-NEXT: jns .LBB1_9
  132. ; CHECK-NEXT: # %bb.11: # %if.end96.i
  133. ; CHECK-NEXT: # in Loop: Header=BB1_9 Depth=1
  134. ; CHECK-NEXT: cmpl $3, %ebp
  135. ; CHECK-NEXT: jae .LBB1_22
  136. ; CHECK-NEXT: # %bb.12: # %if.end287.i
  137. ; CHECK-NEXT: # in Loop: Header=BB1_9 Depth=1
  138. ; CHECK-NEXT: xorl %esi, %esi
  139. ; CHECK-NEXT: cmpl $1, %ebp
  140. ; CHECK-NEXT: setne %dl
  141. ; CHECK-NEXT: testb %al, %al
  142. ; CHECK-NEXT: jne .LBB1_16
  143. ; CHECK-NEXT: # %bb.13: # %if.end308.i
  144. ; CHECK-NEXT: # in Loop: Header=BB1_9 Depth=1
  145. ; CHECK-NEXT: testb %al, %al
  146. ; CHECK-NEXT: je .LBB1_7
  147. ; CHECK-NEXT: # %bb.14: # %if.end335.i
  148. ; CHECK-NEXT: # in Loop: Header=BB1_9 Depth=1
  149. ; CHECK-NEXT: xorl %edx, %edx
  150. ; CHECK-NEXT: testb %dl, %dl
  151. ; CHECK-NEXT: movl $0, %esi
  152. ; CHECK-NEXT: jne .LBB1_8
  153. ; CHECK-NEXT: # %bb.15: # %merge_other
  154. ; CHECK-NEXT: # in Loop: Header=BB1_9 Depth=1
  155. ; CHECK-NEXT: xorl %esi, %esi
  156. ; CHECK-NEXT: jmp .LBB1_17
  157. ; CHECK-NEXT: .LBB1_16: # in Loop: Header=BB1_9 Depth=1
  158. ; CHECK-NEXT: movb %dl, %sil
  159. ; CHECK-NEXT: addl $3, %esi
  160. ; CHECK-NEXT: .LBB1_17: # %outer_loop_latch
  161. ; CHECK-NEXT: # in Loop: Header=BB1_9 Depth=1
  162. ; CHECK-NEXT: # implicit-def: $dl
  163. ; CHECK-NEXT: jmp .LBB1_8
  164. ; CHECK-NEXT: .LBB1_7: # %merge_predecessor_split
  165. ; CHECK-NEXT: # in Loop: Header=BB1_9 Depth=1
  166. ; CHECK-NEXT: movb $32, %dl
  167. ; CHECK-NEXT: xorl %esi, %esi
  168. ; CHECK-NEXT: .LBB1_8: # %outer_loop_latch
  169. ; CHECK-NEXT: # in Loop: Header=BB1_9 Depth=1
  170. ; CHECK-NEXT: movzwl %si, %esi
  171. ; CHECK-NEXT: decl %esi
  172. ; CHECK-NEXT: movzwl %si, %esi
  173. ; CHECK-NEXT: leaq 1(%rcx,%rsi), %rcx
  174. ; CHECK-NEXT: testl %ebp, %ebp
  175. ; CHECK-NEXT: jne .LBB1_9
  176. ; CHECK-NEXT: .LBB1_18: # %while.cond.us1412.i
  177. ; CHECK-NEXT: xorl %eax, %eax
  178. ; CHECK-NEXT: testb %al, %al
  179. ; CHECK-NEXT: movl $1, %ebx
  180. ; CHECK-NEXT: jne .LBB1_20
  181. ; CHECK-NEXT: # %bb.19: # %while.cond.us1412.i
  182. ; CHECK-NEXT: decb %dl
  183. ; CHECK-NEXT: jne .LBB1_26
  184. ; CHECK-NEXT: .LBB1_20: # %if.end41.us1436.i
  185. ; CHECK-NEXT: .LBB1_25:
  186. ; CHECK-NEXT: movl $1, %ebx
  187. ; CHECK-NEXT: jmp .LBB1_26
  188. ; CHECK-NEXT: .LBB1_22: # %if.then99.i
  189. ; CHECK-NEXT: xorl %ebx, %ebx
  190. ; CHECK-NEXT: movl $.str.6, %edi
  191. ; CHECK-NEXT: xorl %eax, %eax
  192. ; CHECK-NEXT: callq cli_dbgmsg
  193. ; CHECK-NEXT: .LBB1_26: # %cleanup
  194. ; CHECK-NEXT: movl %ebx, %eax
  195. ; CHECK-NEXT: addq $8, %rsp
  196. ; CHECK-NEXT: popq %rbx
  197. ; CHECK-NEXT: popq %r12
  198. ; CHECK-NEXT: popq %r13
  199. ; CHECK-NEXT: popq %r14
  200. ; CHECK-NEXT: popq %r15
  201. ; CHECK-NEXT: popq %rbp
  202. ; CHECK-NEXT: retq
  203. ; CHECK-NEXT: .LBB1_27: # %wunpsect.exit.thread.loopexit389
  204. ; CHECK-NEXT: .LBB1_28: # %wunpsect.exit.thread.loopexit391
  205. entry:
  206. %0 = load i32, i32* undef, align 4
  207. %mul = shl nsw i32 %0, 2
  208. br i1 undef, label %if.end19, label %cleanup
  209. if.end19: ; preds = %entry
  210. %conv = zext i32 %mul to i64
  211. %call = tail call i8* @cli_calloc(i64 %conv, i64 1)
  212. %1 = icmp eq i32 %exesz, 0
  213. %notrhs = icmp eq i32 %0, 0
  214. %or.cond117.not = or i1 %1, %notrhs
  215. %or.cond202 = or i1 %or.cond117.not, undef
  216. %cmp35 = icmp ult i8* %call, %exe
  217. %or.cond203 = or i1 %or.cond202, %cmp35
  218. br i1 %or.cond203, label %cleanup, label %if.end50
  219. if.end50: ; preds = %if.end19
  220. tail call void @llvm.memcpy.p0i8.p0i8.i64(i8* nonnull %call, i8* undef, i64 %conv, i1 false)
  221. %cmp1.i.i = icmp ugt i32 %mul, 3
  222. br i1 %cmp1.i.i, label %shared_preheader, label %wunpsect.exit.thread.loopexit391
  223. shared_preheader: ; preds = %if.end50
  224. br label %outer_loop_header
  225. outer_loop_header: ; preds = %outer_loop_latch, %shared_preheader
  226. %bits.1.i = phi i8 [ 32, %shared_preheader ], [ %bits.43.i, %outer_loop_latch ]
  227. %dst.0.ph.i = phi i8* [ undef, %shared_preheader ], [ %scevgep679.i, %outer_loop_latch ]
  228. %2 = icmp eq i32 %0, 0
  229. br i1 %2, label %while.cond.us1412.i, label %shared_loop_header
  230. while.cond.us1412.i: ; preds = %outer_loop_header
  231. %.pre.i = add i8 %bits.1.i, -1
  232. %tobool2.us1420.i = icmp eq i8 %.pre.i, 0
  233. %or.cond.us1421.i = or i1 undef, %tobool2.us1420.i
  234. br i1 %or.cond.us1421.i, label %if.end41.us1436.i, label %cleanup
  235. if.end41.us1436.i: ; preds = %while.cond.us1412.i
  236. unreachable
  237. shared_loop_header: ; preds = %dup_early2, %dup_early1
  238. %dst.0.i = phi i8* [ undef, %inner_loop_body ], [ %dst.0.ph.i, %outer_loop_header ], [ undef, %dead_block ]
  239. %cmp3.i1172.i = icmp ult i8* null, %call
  240. br i1 %cmp3.i1172.i, label %wunpsect.exit.thread.loopexit389, label %inner_loop_body
  241. inner_loop_body: ; preds = %shared_loop_header
  242. %3 = icmp slt i32 undef, 0
  243. br i1 %3, label %if.end96.i, label %shared_loop_header
  244. dead_block: ; preds = %inner_loop_body
  245. %cmp75.i = icmp ult i8* %dst.0.i, null
  246. br label %shared_loop_header
  247. if.end96.i: ; preds = %inner_loop_body
  248. %cmp97.i = icmp ugt i32 %0, 2
  249. br i1 %cmp97.i, label %if.then99.i, label %if.end287.i
  250. if.then99.i: ; preds = %if.end96.i
  251. tail call void (i8*, ...) @cli_dbgmsg(i8* getelementptr inbounds ([23 x i8], [23 x i8]* @.str.6, i64 0, i64 0), i32 undef)
  252. br label %cleanup
  253. if.end287.i: ; preds = %if.end96.i
  254. %cmp291.i = icmp ne i32 %0, 1
  255. %conv294.i = select i1 %cmp291.i, i16 4, i16 3
  256. br i1 undef, label %if.end308.i, label %outer_loop_latch
  257. if.end308.i: ; preds = %if.end287.i
  258. br i1 undef, label %if.end335.i, label %merge_predecessor_split
  259. merge_predecessor_split: ; preds = %if.end308.i
  260. %4 = bitcast i8* undef to i32*
  261. br label %outer_loop_latch
  262. if.end335.i: ; preds = %if.end308.i
  263. br i1 undef, label %outer_loop_latch, label %merge_other
  264. merge_other: ; preds = %if.end335.i
  265. br label %outer_loop_latch
  266. outer_loop_latch: ; preds = %merge_other, %if.end335.i, %merge_predecessor_split, %if.end287.i
  267. %bits.43.i = phi i8 [ undef, %if.end287.i ], [ undef, %merge_other ], [ 32, %merge_predecessor_split ], [ 0, %if.end335.i ]
  268. %backsize.0.i = phi i16 [ %conv294.i, %if.end287.i ], [ 0, %merge_other ], [ 0, %merge_predecessor_split ], [ 0, %if.end335.i ]
  269. %5 = add i16 %backsize.0.i, -1
  270. %6 = zext i16 %5 to i64
  271. %scevgep.i = getelementptr i8, i8* %dst.0.ph.i, i64 1
  272. %scevgep679.i = getelementptr i8, i8* %scevgep.i, i64 %6
  273. br label %outer_loop_header
  274. wunpsect.exit.thread.loopexit389: ; preds = %shared_loop_header
  275. unreachable
  276. wunpsect.exit.thread.loopexit391: ; preds = %if.end50
  277. unreachable
  278. cleanup: ; preds = %if.then99.i, %while.cond.us1412.i, %if.end19, %entry
  279. %retval.0 = phi i32 [ 0, %if.then99.i ], [ 1, %entry ], [ 1, %if.end19 ], [ 1, %while.cond.us1412.i ]
  280. ret i32 %retval.0
  281. }
  282. ; Function Attrs: nounwind
  283. declare void @cli_dbgmsg(i8*, ...) local_unnamed_addr #0
  284. ; Function Attrs: nounwind
  285. declare i8* @cli_calloc(i64, i64) local_unnamed_addr #0
  286. ; Function Attrs: argmemonly nounwind
  287. declare void @llvm.memcpy.p0i8.p0i8.i64(i8* nocapture writeonly, i8* nocapture readonly, i64, i1) #1
  288. attributes #0 = { nounwind }
  289. attributes #1 = { argmemonly nounwind }