15ffd83dbSDimitry Andric //===- InlineModelFeatureMaps.h - common model runner defs ------*- C++ -*-===// 25ffd83dbSDimitry Andric // 35ffd83dbSDimitry Andric // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. 45ffd83dbSDimitry Andric // See https://llvm.org/LICENSE.txt for license information. 55ffd83dbSDimitry Andric // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 65ffd83dbSDimitry Andric // 75ffd83dbSDimitry Andric //===----------------------------------------------------------------------===// 85ffd83dbSDimitry Andric // 95ffd83dbSDimitry Andric 105ffd83dbSDimitry Andric #ifndef LLVM_ANALYSIS_INLINEMODELFEATUREMAPS_H 115ffd83dbSDimitry Andric #define LLVM_ANALYSIS_INLINEMODELFEATUREMAPS_H 125ffd83dbSDimitry Andric 135ffd83dbSDimitry Andric #include <array> 145ffd83dbSDimitry Andric #include <string> 155ffd83dbSDimitry Andric #include <vector> 165ffd83dbSDimitry Andric 175ffd83dbSDimitry Andric namespace llvm { 185ffd83dbSDimitry Andric 19*fe6060f1SDimitry Andric // List of cost features. A "cost" feature is a summand of the heuristic-based 20*fe6060f1SDimitry Andric // inline cost, and we define them separately to preserve the original heuristic 21*fe6060f1SDimitry Andric // behavior. 22*fe6060f1SDimitry Andric #define INLINE_COST_FEATURE_ITERATOR(M) \ 23*fe6060f1SDimitry Andric M(SROASavings, "sroa_savings") \ 24*fe6060f1SDimitry Andric M(SROALosses, "sroa_losses") \ 25*fe6060f1SDimitry Andric M(LoadElimination, "load_elimination") \ 26*fe6060f1SDimitry Andric M(CallPenalty, "call_penalty") \ 27*fe6060f1SDimitry Andric M(CallArgumentSetup, "call_argument_setup") \ 28*fe6060f1SDimitry Andric M(LoadRelativeIntrinsic, "load_relative_intrinsic") \ 29*fe6060f1SDimitry Andric M(LoweredCallArgSetup, "lowered_call_arg_setup") \ 30*fe6060f1SDimitry Andric M(IndirectCallPenalty, "indirect_call_penalty") \ 31*fe6060f1SDimitry Andric M(JumpTablePenalty, "jump_table_penalty") \ 32*fe6060f1SDimitry Andric M(CaseClusterPenalty, "case_cluster_penalty") \ 33*fe6060f1SDimitry Andric M(SwitchPenalty, "switch_penalty") \ 34*fe6060f1SDimitry Andric M(UnsimplifiedCommonInstructions, "unsimplified_common_instructions") \ 35*fe6060f1SDimitry Andric M(NumLoops, "num_loops") \ 36*fe6060f1SDimitry Andric M(DeadBlocks, "dead_blocks") \ 37*fe6060f1SDimitry Andric M(SimplifiedInstructions, "simplified_instructions") \ 38*fe6060f1SDimitry Andric M(ConstantArgs, "constant_args") \ 39*fe6060f1SDimitry Andric M(ConstantOffsetPtrArgs, "constant_offset_ptr_args") \ 40*fe6060f1SDimitry Andric M(CallSiteCost, "callsite_cost") \ 41*fe6060f1SDimitry Andric M(ColdCcPenalty, "cold_cc_penalty") \ 42*fe6060f1SDimitry Andric M(LastCallToStaticBonus, "last_call_to_static_bonus") \ 43*fe6060f1SDimitry Andric M(IsMultipleBlocks, "is_multiple_blocks") \ 44*fe6060f1SDimitry Andric M(NestedInlines, "nested_inlines") \ 45*fe6060f1SDimitry Andric M(NestedInlineCostEstimate, "nested_inline_cost_estimate") \ 46*fe6060f1SDimitry Andric M(Threshold, "threshold") 47*fe6060f1SDimitry Andric 48*fe6060f1SDimitry Andric // clang-format off 49*fe6060f1SDimitry Andric enum class InlineCostFeatureIndex : size_t { 50*fe6060f1SDimitry Andric #define POPULATE_INDICES(INDEX_NAME, NAME) INDEX_NAME, 51*fe6060f1SDimitry Andric INLINE_COST_FEATURE_ITERATOR(POPULATE_INDICES) 52*fe6060f1SDimitry Andric #undef POPULATE_INDICES 53*fe6060f1SDimitry Andric 54*fe6060f1SDimitry Andric NumberOfFeatures 55*fe6060f1SDimitry Andric }; 56*fe6060f1SDimitry Andric // clang-format on 57*fe6060f1SDimitry Andric 58*fe6060f1SDimitry Andric using InlineCostFeatures = 59*fe6060f1SDimitry Andric std::array<int, 60*fe6060f1SDimitry Andric static_cast<size_t>(InlineCostFeatureIndex::NumberOfFeatures)>; 61*fe6060f1SDimitry Andric 62*fe6060f1SDimitry Andric constexpr bool isHeuristicInlineCostFeature(InlineCostFeatureIndex Feature) { 63*fe6060f1SDimitry Andric return Feature != InlineCostFeatureIndex::SROASavings && 64*fe6060f1SDimitry Andric Feature != InlineCostFeatureIndex::IsMultipleBlocks && 65*fe6060f1SDimitry Andric Feature != InlineCostFeatureIndex::DeadBlocks && 66*fe6060f1SDimitry Andric Feature != InlineCostFeatureIndex::SimplifiedInstructions && 67*fe6060f1SDimitry Andric Feature != InlineCostFeatureIndex::ConstantArgs && 68*fe6060f1SDimitry Andric Feature != InlineCostFeatureIndex::ConstantOffsetPtrArgs && 69*fe6060f1SDimitry Andric Feature != InlineCostFeatureIndex::NestedInlines && 70*fe6060f1SDimitry Andric Feature != InlineCostFeatureIndex::NestedInlineCostEstimate && 71*fe6060f1SDimitry Andric Feature != InlineCostFeatureIndex::Threshold; 72*fe6060f1SDimitry Andric } 73*fe6060f1SDimitry Andric 745ffd83dbSDimitry Andric // List of features. Each feature is defined through a triple: 755ffd83dbSDimitry Andric // - the name of an enum member, which will be the feature index 765ffd83dbSDimitry Andric // - a textual name, used for Tensorflow model binding (so it needs to match the 775ffd83dbSDimitry Andric // names used by the Tensorflow model) 785ffd83dbSDimitry Andric // - a documentation description. Currently, that is not used anywhere 795ffd83dbSDimitry Andric // programmatically, and serves as workaround to inability of inserting comments 805ffd83dbSDimitry Andric // in macros. 815ffd83dbSDimitry Andric #define INLINE_FEATURE_ITERATOR(M) \ 825ffd83dbSDimitry Andric M(CalleeBasicBlockCount, "callee_basic_block_count", \ 835ffd83dbSDimitry Andric "number of basic blocks of the callee") \ 845ffd83dbSDimitry Andric M(CallSiteHeight, "callsite_height", \ 855ffd83dbSDimitry Andric "position of the call site in the original call graph - measured from " \ 865ffd83dbSDimitry Andric "the farthest SCC") \ 875ffd83dbSDimitry Andric M(NodeCount, "node_count", \ 885ffd83dbSDimitry Andric "total current number of defined functions in the module") \ 895ffd83dbSDimitry Andric M(NrCtantParams, "nr_ctant_params", \ 905ffd83dbSDimitry Andric "number of parameters in the call site that are constants") \ 915ffd83dbSDimitry Andric M(CostEstimate, "cost_estimate", "total cost estimate (threshold - free)") \ 92*fe6060f1SDimitry Andric M(EdgeCount, "edge_count", "total number of calls in the module") \ 93*fe6060f1SDimitry Andric M(CallerUsers, "caller_users", \ 945ffd83dbSDimitry Andric "number of module-internal users of the caller, +1 if the caller is " \ 955ffd83dbSDimitry Andric "exposed externally") \ 965ffd83dbSDimitry Andric M(CallerConditionallyExecutedBlocks, "caller_conditionally_executed_blocks", \ 975ffd83dbSDimitry Andric "number of blocks reached from a conditional instruction, in the caller") \ 985ffd83dbSDimitry Andric M(CallerBasicBlockCount, "caller_basic_block_count", \ 995ffd83dbSDimitry Andric "number of basic blocks in the caller") \ 1005ffd83dbSDimitry Andric M(CalleeConditionallyExecutedBlocks, "callee_conditionally_executed_blocks", \ 1015ffd83dbSDimitry Andric "number of blocks reached from a conditional instruction, in the callee") \ 1025ffd83dbSDimitry Andric M(CalleeUsers, "callee_users", \ 103*fe6060f1SDimitry Andric "number of module-internal users of the callee, +1 if the callee is " \ 104*fe6060f1SDimitry Andric "exposed externally") 1055ffd83dbSDimitry Andric 106*fe6060f1SDimitry Andric // clang-format off 1075ffd83dbSDimitry Andric enum class FeatureIndex : size_t { 108*fe6060f1SDimitry Andric // InlineCost features - these must come first 109*fe6060f1SDimitry Andric #define POPULATE_INDICES(INDEX_NAME, NAME) INDEX_NAME, 110*fe6060f1SDimitry Andric INLINE_COST_FEATURE_ITERATOR(POPULATE_INDICES) 111*fe6060f1SDimitry Andric #undef POPULATE_INDICES 112*fe6060f1SDimitry Andric 113*fe6060f1SDimitry Andric // Non-cost features 1145ffd83dbSDimitry Andric #define POPULATE_INDICES(INDEX_NAME, NAME, COMMENT) INDEX_NAME, 1155ffd83dbSDimitry Andric INLINE_FEATURE_ITERATOR(POPULATE_INDICES) 1165ffd83dbSDimitry Andric #undef POPULATE_INDICES 117*fe6060f1SDimitry Andric 1185ffd83dbSDimitry Andric NumberOfFeatures 1195ffd83dbSDimitry Andric }; 120*fe6060f1SDimitry Andric // clang-format on 121*fe6060f1SDimitry Andric 122*fe6060f1SDimitry Andric constexpr FeatureIndex 123*fe6060f1SDimitry Andric inlineCostFeatureToMlFeature(InlineCostFeatureIndex Feature) { 124*fe6060f1SDimitry Andric return static_cast<FeatureIndex>(static_cast<size_t>(Feature)); 125*fe6060f1SDimitry Andric } 1265ffd83dbSDimitry Andric 1275ffd83dbSDimitry Andric constexpr size_t NumberOfFeatures = 1285ffd83dbSDimitry Andric static_cast<size_t>(FeatureIndex::NumberOfFeatures); 1295ffd83dbSDimitry Andric 1305ffd83dbSDimitry Andric extern const std::array<std::string, NumberOfFeatures> FeatureNameMap; 1315ffd83dbSDimitry Andric 1325ffd83dbSDimitry Andric extern const char *const DecisionName; 1335ffd83dbSDimitry Andric extern const char *const DefaultDecisionName; 1345ffd83dbSDimitry Andric extern const char *const RewardName; 1355ffd83dbSDimitry Andric 1365ffd83dbSDimitry Andric using InlineFeatures = std::vector<int64_t>; 1375ffd83dbSDimitry Andric 1385ffd83dbSDimitry Andric } // namespace llvm 1395ffd83dbSDimitry Andric #endif // LLVM_ANALYSIS_INLINEMODELFEATUREMAPS_H 140