pre-no-cost-phi.ll 710 B

12345678910111213141516171819202122232425262728293031
  1. ; RUN: opt < %s -gvn -S | FileCheck %s
  2. ; This testcase tests insertion of no-cost phis. That is,
  3. ; when the value is already available in every predecessor,
  4. ; and we just need to insert a phi node to merge the available values.
  5. @c = global i32 0, align 4
  6. @d = global i32 0, align 4
  7. define i32 @mai(i32 %foo, i32 %a, i32 %b) {
  8. %1 = icmp ne i32 %foo, 0
  9. br i1 %1, label %bb1, label %bb2
  10. bb1:
  11. %2 = add nsw i32 %a, %b
  12. store i32 %2, i32* @c, align 4
  13. br label %mergeblock
  14. bb2:
  15. %3 = add nsw i32 %a, %b
  16. store i32 %3, i32* @d, align 4
  17. br label %mergeblock
  18. mergeblock:
  19. ; CHECK: pre-phi = phi i32 [ %3, %bb2 ], [ %2, %bb1 ]
  20. ; CHECK-NEXT: ret i32 %.pre-phi
  21. %4 = add nsw i32 %a, %b
  22. ret i32 %4
  23. }