| Xinliang David Li | 66bdfca | 2017-05-12 23:41:43 +0000 | [diff] [blame] | 1 | ; RUN: opt < %s -partial-inliner -skip-partial-inlining-cost-analysis -S | FileCheck %s |
| Sean Silva | f801575 | 2016-08-02 02:15:45 +0000 | [diff] [blame] | 2 | |
| 3 | ; This test checks to make sure that the CodeExtractor |
| 4 | ; properly sets the entry count for the function that is |
| 5 | ; extracted based on the root block being extracted and also |
| 6 | ; takes into consideration if the block has edges coming from |
| 7 | ; a block that is also being extracted. |
| 8 | |
| 9 | define i32 @inlinedFunc(i1 %cond) !prof !1 { |
| 10 | entry: |
| 11 | br i1 %cond, label %if.then, label %return, !prof !2 |
| 12 | if.then: |
| 13 | br i1 %cond, label %if.then, label %return, !prof !3 |
| 14 | return: ; preds = %entry |
| 15 | ret i32 0 |
| 16 | } |
| 17 | |
| 18 | |
| 19 | define internal i32 @dummyCaller(i1 %cond) !prof !1 { |
| 20 | entry: |
| 21 | %val = call i32 @inlinedFunc(i1 %cond) |
| 22 | ret i32 %val |
| 23 | } |
| 24 | |
| 25 | ; CHECK: @inlinedFunc.1_if.then(i1 %cond) !prof [[COUNT1:![0-9]+]] |
| 26 | |
| 27 | |
| 28 | !llvm.module.flags = !{!0} |
| 29 | ; CHECK: [[COUNT1]] = !{!"function_entry_count", i64 250} |
| 30 | !0 = !{i32 1, !"MaxFunctionCount", i32 1000} |
| 31 | !1 = !{!"function_entry_count", i64 1000} |
| 32 | !2 = !{!"branch_weights", i32 250, i32 750} |
| 33 | !3 = !{!"branch_weights", i32 125, i32 125} |