1; RUN: opt < %s -partial-inliner -skip-partial-inlining-cost-analysis -S | FileCheck %s 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 9define i32 @inlinedFunc(i1 %cond) !prof !1 { 10entry: 11 br i1 %cond, label %if.then, label %return, !prof !2 12if.then: 13 br i1 %cond, label %if.then, label %return, !prof !3 14return: ; preds = %entry 15 ret i32 0 16} 17 18 19define internal i32 @dummyCaller(i1 %cond) !prof !1 { 20entry: 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} 34