| /external/llvm/lib/Transforms/Scalar/ |
| LoopInterchange.cpp | 882 // This is rough cost estimation algorithm. It counts the good and bad order
885 int Cost = 0;
886 Cost += getInstrOrderCost();
887 DEBUG(dbgs() << "Cost = " << Cost << "\n");
888 if (Cost < 0)
[all...] |
| LoopStrengthReduce.cpp | 736 /// Check if expanding this expression is likely to incur significant cost. This
803 // Fow now, consider any other type of expression (div/mul/min/max) high cost.
847 /// accurate cost model.
850 // Get the cost of the scaling factor used in F for LU.
856 /// Cost - This class is used to measure and compare candidate formulae.
857 class Cost {
869 Cost()
873 bool operator<(const Cost &Other) const;
888 assert(isValid() && "invalid cost");
2573 int cost = 1; local
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_MotionEstimationMB.c | 468 * Intra 4x4 Mode decision by calculating cost for all possible modes and
486 * [in] pBestCost - Cost for the Best Intra 4x4 mode
504 OMX_S32 Cost, BestCost;
546 Cost = BestCost = ARM_VCM4P10_MAX_COST;
548 /* Go through each mode for minim cost */
568 &Cost,
572 if (Cost < BestCost)
574 BestCost = Cost;
776 * [in] nLamda - For calculating the cost
777 * [out] pBestCost - Minimum cost for encoding current block
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 91 CSRFirstTimeCost("regalloc-csr-first-time-cost",
92 cl::desc("Cost for first time use of callee-saved register."),
216 /// Cost of evicting interference.
292 /// Callee-save register cost, calculated once per machine function.
357 /// Calculate cost of region splitting.
620 unsigned Cost = TRI->getCostPerUse(PhysReg);
622 // Most registers have 0 additional cost.
623 if (!Cost)
626 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost
[all...] |
| /external/llvm/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | [all...] |
| X86ISelLowering.cpp | 429 // LLVM/Clang supports zero-cost DWARF exception handling.
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 222 /// ComputeSpeculationCost - Compute an abstract "cost" of speculating the
239 /// that do not dominate BB have a combined cost lower than CostRemaining and
243 /// The cost for most non-trapping instructions is defined as 1 except for
244 /// Select whose cost is 2.
246 /// After this function returns, CostRemaining is decreased by the cost of
247 /// V plus its non-dominating operands. If that cost is greater than
288 unsigned Cost = ComputeSpeculationCost(I, TTI);
290 if (Cost > CostRemaining)
293 CostRemaining -= Cost;
296 // not take us over the cost threshold
[all...] |
| /external/llvm/lib/Transforms/Vectorize/ |
| SLPVectorizer.cpp | 92 /// avoids spending time checking the cost model and realizing that they will
358 /// \returns the cost incurred by unwanted spills and fills, caused by
362 /// \returns the vectorization cost of the subtree that starts at \p VL.
399 /// \returns the cost of the vectorizable entry.
423 /// \returns the scalarization cost for this type. Scalarization in this
427 /// \returns the scalarization cost for this list of values. Assuming that
429 /// roots. This method calculates the cost of extracting the values.
[all...] |
| LoopVectorize.cpp | 162 "force-target-instruction-cost", cl::init(0), cl::Hidden,
163 cl::desc("A flag that overrides the target's expected cost for "
168 "small-loop-cost", cl::init(20), cl::Hidden,
169 cl::desc("The cost of a loop that is considered 'small' by the unroller."));
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | 512 /// the same cost as the expression itself, or 2 if we can compute the negated
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64ISelLowering.cpp | [all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMISelLowering.cpp | [all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCISelLowering.cpp | 272 // LLVM/Clang supports zero-cost DWARF exception handling.
[all...] |
