nested-inline.ll 3.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111
  1. ; RUN: opt < %s -inline -S | FileCheck %s
  2. ; Test that bar and bar2 are both inlined throughout and removed.
  3. @A = weak global i32 0 ; <i32*> [#uses=1]
  4. @B = weak global i32 0 ; <i32*> [#uses=1]
  5. @C = weak global i32 0 ; <i32*> [#uses=1]
  6. define fastcc void @foo(i32 %X) {
  7. entry:
  8. ; CHECK-LABEL: @foo(
  9. %ALL = alloca i32, align 4 ; <i32*> [#uses=1]
  10. %tmp1 = and i32 %X, 1 ; <i32> [#uses=1]
  11. %tmp1.upgrd.1 = icmp eq i32 %tmp1, 0 ; <i1> [#uses=1]
  12. br i1 %tmp1.upgrd.1, label %cond_next, label %cond_true
  13. cond_true: ; preds = %entry
  14. store i32 1, i32* @A
  15. br label %cond_next
  16. cond_next: ; preds = %cond_true, %entry
  17. %tmp4 = and i32 %X, 2 ; <i32> [#uses=1]
  18. %tmp4.upgrd.2 = icmp eq i32 %tmp4, 0 ; <i1> [#uses=1]
  19. br i1 %tmp4.upgrd.2, label %cond_next7, label %cond_true5
  20. cond_true5: ; preds = %cond_next
  21. store i32 1, i32* @B
  22. br label %cond_next7
  23. cond_next7: ; preds = %cond_true5, %cond_next
  24. %tmp10 = and i32 %X, 4 ; <i32> [#uses=1]
  25. %tmp10.upgrd.3 = icmp eq i32 %tmp10, 0 ; <i1> [#uses=1]
  26. br i1 %tmp10.upgrd.3, label %cond_next13, label %cond_true11
  27. cond_true11: ; preds = %cond_next7
  28. store i32 1, i32* @C
  29. br label %cond_next13
  30. cond_next13: ; preds = %cond_true11, %cond_next7
  31. %tmp16 = and i32 %X, 8 ; <i32> [#uses=1]
  32. %tmp16.upgrd.4 = icmp eq i32 %tmp16, 0 ; <i1> [#uses=1]
  33. br i1 %tmp16.upgrd.4, label %UnifiedReturnBlock, label %cond_true17
  34. cond_true17: ; preds = %cond_next13
  35. call void @ext( i32* %ALL )
  36. ret void
  37. UnifiedReturnBlock: ; preds = %cond_next13
  38. ret void
  39. }
  40. ; CHECK-NOT: @bar(
  41. define internal fastcc void @bar(i32 %X) {
  42. entry:
  43. %ALL = alloca i32, align 4 ; <i32*> [#uses=1]
  44. %tmp1 = and i32 %X, 1 ; <i32> [#uses=1]
  45. %tmp1.upgrd.1 = icmp eq i32 %tmp1, 0 ; <i1> [#uses=1]
  46. br i1 %tmp1.upgrd.1, label %cond_next, label %cond_true
  47. cond_true: ; preds = %entry
  48. store i32 1, i32* @A
  49. br label %cond_next
  50. cond_next: ; preds = %cond_true, %entry
  51. %tmp4 = and i32 %X, 2 ; <i32> [#uses=1]
  52. %tmp4.upgrd.2 = icmp eq i32 %tmp4, 0 ; <i1> [#uses=1]
  53. br i1 %tmp4.upgrd.2, label %cond_next7, label %cond_true5
  54. cond_true5: ; preds = %cond_next
  55. store i32 1, i32* @B
  56. br label %cond_next7
  57. cond_next7: ; preds = %cond_true5, %cond_next
  58. %tmp10 = and i32 %X, 4 ; <i32> [#uses=1]
  59. %tmp10.upgrd.3 = icmp eq i32 %tmp10, 0 ; <i1> [#uses=1]
  60. br i1 %tmp10.upgrd.3, label %cond_next13, label %cond_true11
  61. cond_true11: ; preds = %cond_next7
  62. store i32 1, i32* @C
  63. br label %cond_next13
  64. cond_next13: ; preds = %cond_true11, %cond_next7
  65. %tmp16 = and i32 %X, 8 ; <i32> [#uses=1]
  66. %tmp16.upgrd.4 = icmp eq i32 %tmp16, 0 ; <i1> [#uses=1]
  67. br i1 %tmp16.upgrd.4, label %UnifiedReturnBlock, label %cond_true17
  68. cond_true17: ; preds = %cond_next13
  69. call void @foo( i32 %X )
  70. ret void
  71. UnifiedReturnBlock: ; preds = %cond_next13
  72. ret void
  73. }
  74. define internal fastcc void @bar2(i32 %X) {
  75. entry:
  76. call void @foo( i32 %X )
  77. ret void
  78. }
  79. declare void @ext(i32*)
  80. define void @test(i32 %X) {
  81. entry:
  82. ; CHECK: test
  83. ; CHECK-NOT: @bar(
  84. tail call fastcc void @bar( i32 %X )
  85. tail call fastcc void @bar( i32 %X )
  86. tail call fastcc void @bar2( i32 %X )
  87. tail call fastcc void @bar2( i32 %X )
  88. ret void
  89. ; CHECK: ret
  90. }