decrementing-loop.ll 1.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243
  1. ; RUN: opt -irce -S < %s | FileCheck %s
  2. define void @decrementing_loop(i32 *%arr, i32 *%a_len_ptr, i32 %n) {
  3. entry:
  4. %len = load i32, i32* %a_len_ptr, !range !0
  5. %first.itr.check = icmp sgt i32 %n, 0
  6. %start = sub i32 %n, 1
  7. br i1 %first.itr.check, label %loop, label %exit
  8. loop:
  9. %idx = phi i32 [ %start, %entry ] , [ %idx.dec, %in.bounds ]
  10. %idx.dec = sub i32 %idx, 1
  11. %abc.high = icmp slt i32 %idx, %len
  12. %abc.low = icmp sge i32 %idx, 0
  13. %abc = and i1 %abc.low, %abc.high
  14. br i1 %abc, label %in.bounds, label %out.of.bounds, !prof !1
  15. in.bounds:
  16. %addr = getelementptr i32, i32* %arr, i32 %idx
  17. store i32 0, i32* %addr
  18. %next = icmp sgt i32 %idx.dec, -1
  19. br i1 %next, label %loop, label %exit
  20. out.of.bounds:
  21. ret void
  22. exit:
  23. ret void
  24. ; CHECK: loop.preheader:
  25. ; CHECK: [[indvar_start:[^ ]+]] = add i32 %n, -1
  26. ; CHECK: [[not_len:[^ ]+]] = sub i32 -1, %len
  27. ; CHECK: [[not_n:[^ ]+]] = sub i32 -1, %n
  28. ; CHECK: [[not_len_hiclamp_cmp:[^ ]+]] = icmp sgt i32 [[not_len]], [[not_n]]
  29. ; CHECK: [[not_len_hiclamp:[^ ]+]] = select i1 [[not_len_hiclamp_cmp]], i32 [[not_len]], i32 [[not_n]]
  30. ; CHECK: [[len_hiclamp:[^ ]+]] = sub i32 -1, [[not_len_hiclamp]]
  31. ; CHECK: [[not_exit_preloop_at_cmp:[^ ]+]] = icmp sgt i32 [[len_hiclamp]], 0
  32. ; CHECK: [[not_exit_preloop_at:[^ ]+]] = select i1 [[not_exit_preloop_at_cmp]], i32 [[len_hiclamp]], i32 0
  33. ; CHECK: %exit.preloop.at = add i32 [[not_exit_preloop_at]], -1
  34. }
  35. !0 = !{i32 0, i32 2147483647}
  36. !1 = !{!"branch_weights", i32 64, i32 4}