Lines Matching full:cost
74 "cost of importing it into a partition"
75 "exceeds the average cost of a partition by this factor; e;g. 2.0 "
144 /// has a small performance cost because if some computation/formatting is
217 /// Calculate the cost of each function in \p M
221 /// \param CostMap[out] Resulting Function -> Cost map.
222 /// \return The module's total cost.
237 auto Cost = in calculateFunctionCosts() local
239 assert(Cost != InstructionCost::getMax()); in calculateFunctionCosts()
240 // Assume expensive if we can't tell the cost of an instruction. in calculateFunctionCosts()
242 Cost.getValue().value_or(TargetTransformInfo::TCC_Expensive); in calculateFunctionCosts()
260 SML << "=> Total Module Cost: " << ModuleCost << '\n' in calculateFunctionCosts()
432 /// \param ModuleCost Total cost of all functions in \p M.
433 /// \param FnCosts Map of Function -> Cost
445 // import cost exceeds this value, we will try to assign it to an existing in doPartitioning()
448 // e.g. let two functions X and Y have a import cost of ~10% of the module, we in doPartitioning()
469 // When two partitions have the same cost, assign to the one with the in doPartitioning()
500 for (auto &[QueuePID, Cost] : reverse(BalancingQueue)) { in doPartitioning()
506 SML << "[Updating P" << PID << " Cost]:" << Cost << " -> " << NewCost; in doPartitioning()
507 if (Cost) { in doPartitioning()
508 SML << " (" << unsigned(((float(NewCost) / Cost) - 1) * 100) in doPartitioning()
513 Cost = NewCost; in doPartitioning()
572 CostType Cost = 0; in doPartitioning() local
574 Cost += FnCosts.at(Fn); in doPartitioning()
575 SML << "P" << Idx << " has a total cost of " << Cost << " (" in doPartitioning()
576 << format("%0.2f", (float(Cost) / ModuleCost) * 100) in doPartitioning()
658 // Start by calculating the cost of every function in the module, as well as in splitAMDGPUModule()
659 // the module's overall cost. in splitAMDGPUModule()
692 // Sort by total cost, and if the total cost is identical, sort in splitAMDGPUModule()