| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | Graph.h | 68 NodeEntry(VectorPtr Costs) : Costs(std::move(Costs)) {} in NodeEntry() argument
94 VectorPtr Costs; variable
103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry() argument
104 : Costs(std::move(Costs)) { in EdgeEntry()
152 MatrixPtr Costs; variable
371 /// Add a node with the given costs.
372 /// @param Costs Cost vector for the new node.
375 NodeId addNode(OtherVectorT Costs) { in addNode() argument
377 VectorPtr AllocatedCosts = CostAlloc.getVector(std::move(Costs)); in addNode()
385 /// @param Costs Cost vector ptr for the new node (must be convertible to
[all …]
|
| H A D | ReductionRules.h | 27 /// Propagate costs from the given node, which must be of degree one, to its
159 // costs, then ... there is no available register. in hasRegisterOptions()
171 // order and greedily compute a minimum solution based on the node costs, and
172 // the dependent costs due to previously solved nodes.
176 // costs. Given that, the backpropagate function doesn't attempt to
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64PBQPRegAlloc.cpp | 179 // costs. in addIntraChainConstraint()
185 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1, in addIntraChainConstraint() local
192 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity(); in addIntraChainConstraint()
194 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0; in addIntraChainConstraint()
197 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
207 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); in addIntraChainConstraint() local
217 if (costs[i + 1][j + 1] != in addIntraChainConstraint()
219 costs[i + 1][j + 1] > sameParityMax) in addIntraChainConstraint()
220 sameParityMax = costs[i + 1][j + 1]; in addIntraChainConstraint()
228 if (sameParityMax > costs[i + 1][j + 1]) in addIntraChainConstraint()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/ |
| H A D | InlineModelFeatureMaps.h | 32 "Accumulation of call argument setup costs") \
34 "Accumulation of costs of loading relative intrinsics") \
38 "Accumulation of costs for indirect calls") \
39 M(int64_t, {1}, jump_table_penalty, "Accumulation of costs for jump tables") \
41 "Accumulation of costs for case clusters") \
43 "Accumulation of costs for switch default destination") \
45 "Accumulation of costs for switch statements") \
47 "Costs from unsimplified common instructions") \
|
| H A D | LoopCacheAnalysis.h | 177 /// the cache costs of all of its reference groups when the loop is considered
222 /// Return the estimated ordered loop costs.
268 /// Cache costs for the loops in the loop nest associated with this object.
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | TargetTransformInfo.cpp | 272 "TTI should not produce negative costs!"); in getInstructionCost()
551 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getScalingFactorCost()
680 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getFPOpCost()
689 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getIntImmCodeSizeCost()
697 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getIntImmCost()
706 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getIntImmCostInst()
716 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getIntImmCostIntrin()
920 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getArithmeticInstrCost()
929 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getAltInstrCost()
939 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getShuffleCost()
[all …]
|
| H A D | InlineOrder.cpp | 138 // 3. Remaining call sites are prioritized according to their costs. in isMoreDesirable()
172 // Remaining call sites are ordered according to their costs. in isMoreDesirable()
|
| /freebsd/contrib/cortex-strings/scripts/ |
| H A D | libplot.py | 56 costs = {}
59 costs[(record.bytes, record.loops)] = record.elapsed
68 cost = costs.get((record.bytes, record.loops), None)
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocPBQP.cpp | 189 /// Set spill costs for each node in the PBQP reg-alloc graph.
195 // A minimum spill costs, so that register constraints can be set in apply()
404 // Try looking the edge costs up in the IMatrixCache first. in createInterferenceEdge()
483 PBQPRAGraph::RawMatrix Costs(Allowed1->size() + 1, in apply() local
485 addVirtRegCoalesce(Costs, *Allowed1, *Allowed2, CBenefit); in apply()
486 G.addEdge(N1Id, N2Id, std::move(Costs)); in apply()
492 PBQPRAGraph::RawMatrix Costs(G.getEdgeCosts(EId)); in apply() local
493 addVirtRegCoalesce(Costs, *Allowed1, *Allowed2, CBenefit); in apply()
494 G.updateEdgeCosts(EId, std::move(Costs)); in apply()
903 const Vector &Costs = getNodeCosts(NId); in dump() local
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | InstructionCost.h | 14 /// accumulating costs on large cost-values don't overflow.
46 /// recommended to use Invalid costs to model 'Unknown'.
191 /// ordering where valid costs are always considered to be less than invalid
192 /// costs. This avoids having to add asserts to the comparison operators that
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Passes/ |
| H A D | OptimizationLevel.h | 88 /// costs though.
102 /// costs.
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SampleProfileInference.cpp | 83 /// The input is a set of edges with specified costs and capacities, and a pair
250 // Although the residual network contains edges with negative costs in findAugmentingPath()
1090 // Assign costs for increasing/decreasing the block counts in initializeNetwork()
1110 // Assign costs for increasing/decreasing the jump counts in initializeNetwork()
1126 /// Assign costs for increasing/decreasing the block counts.
1133 // Assign default values for the costs in assignBlockCosts()
1136 // Update the costs depending on the block metadata in assignBlockCosts()
1154 /// Assign costs for increasing/decreasing the jump counts.
1161 // Assign default values for the costs in assignJumpCosts()
1164 // Update the costs depending on the block metadata in assignJumpCosts()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | RegBankSelect.cpp | 447 assert((MBFI || !BestCost) && "Costs comparison require MBFI"); in computeMapping()
1028 // At this point we know both costs hold sensible values. in operator <()
1038 // At this point, we know the local costs are comparable. in operator <()
1041 // Since the non-local costs do not discriminate on the result, in operator <()
1042 // just compare the local costs. in operator <()
1045 // The base costs are comparable so we may only keep the relative in operator <()
1058 // The non-local costs are comparable, just keep the relative value. in operator <()
1075 // Add the non-local costs. in operator <()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Target/ |
| H A D | TargetSchedule.td | 484 // renamed at the cost of a single physical register. Note that register costs
485 // are defined at register class granularity (see field `Costs`).
548 list<int> Costs = [], list<bit> AllowMoveElim = [],
551 list<int> RegCosts = Costs;
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RegAllocPBQP.h | 211 void setup(const Vector& Costs) { in setup() argument
212 NumOpts = Costs.getLength() - 1; in setup()
457 // register costs first (since early nodes are the most in reduce()
|
| H A D | PBQPRAConstraint.h | 36 /// constraints (e.g. Spill-costs, interference, coalescing).
|
| /freebsd/share/doc/psd/18.gprof/ |
| H A D | intro.me | 68 The profile can be used to compare and assess the costs of
|
| /freebsd/lib/msun/src/ |
| H A D | k_tanf.c | 42 * micro-optimized for Athlons (XP, X64). It costs 2 multiplications in __kernel_tandf()
|
| /freebsd/contrib/ncurses/ncurses/base/ |
| H A D | lib_newterm.c | 322 /* compute movement costs so we can do better move optimization */ in NCURSES_SP_NAME()
342 /* compute movement costs so we can do better move optimization */ in NCURSES_SP_NAME()
|
| /freebsd/lib/libc/riscv/softfloat/ |
| H A D | milieu.h | 22 AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
|
| /freebsd/share/man/man4/ |
| H A D | numa.4 | 36 involves unequal costs between processors, memory and IO devices
|
| /freebsd/lib/libc/softfloat/templates/ |
| H A D | milieu.h | 22 AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.h | 74 /// At the end of simulation, costs are propagated to nodes through the edges of
269 // costs through the edges of the graph, and compute a critical path.
|
| /freebsd/lib/libc/arm/softfloat/ |
| H A D | milieu.h | 23 AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
|
| /freebsd/lib/libc/powerpc64/softfloat/ |
| H A D | milieu.h | 23 AND ALL LOSSES, COSTS, OR OTHER PROBLEMS ARISING FROM ITS USE.
|