| /external/llvm/include/llvm/Analysis/ |
| InlineCost.h | 1 //===- InlineCost.h - Cost analysis for inliner -----------------*- C++ -*-===//
41 /// \brief Represents the cost of inlining a function.
44 /// "never" be inlined. Otherwise, the cost represents a unitless amount;
49 /// directly tested to determine if inlining should occur given the cost and
50 /// threshold for this cost metric.
57 /// \brief The estimated cost of inlining this callsite.
58 const int Cost;
60 /// \brief The adjusted threshold against which this cost was computed.
64 InlineCost(int Cost, int Threshold)
65 : Cost(Cost), Threshold(Threshold) {
[all...] |
| /external/llvm/utils/PerfectShuffle/ |
| PerfectShuffle.cpp | 88 unsigned Cost; // Number of instrs used to generate this value.
92 ShuffleVal() : Cost(1000000) {}
108 unsigned Cost;
111 unsigned cost = 1)
112 : ShuffleMask(shufflemask), OpNum(opnum), Name(name), Cost(cost) {
125 unsigned getCost() const { return Cost; }
153 assert(0 && "bad zero cost operation");
164 if (ShufTab[ShufTab[ThisOp].Arg0].Cost == 0) {
178 if (ShufTab[ShufTab[ThisOp].Arg1].Cost == 0)
[all...] |
| /external/llvm/utils/TableGen/ |
| DAGISelEmitter.cpp | 31 unsigned Cost = 0;
34 Cost++;
37 Cost += 10;
40 Cost += getResultPatternCost(P->getChild(i), CGP);
41 return Cost;
50 unsigned Cost = 0;
53 Cost += Op->getValueAsInt("CodeSize");
56 Cost += getResultPatternSize(P->getChild(i), CGP);
57 return Cost;
62 // In particular, we want to match maximal patterns first and lowest cost withi
[all...] |
| /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| omxVCM4P10_MotionEstimationMB.c | 453 * Intra 4x4 Mode decision by calculating cost for all possible modes and
471 * [in] pBestCost - Cost for the Best Intra 4x4 mode
489 OMX_S32 Cost, BestCost;
531 Cost = BestCost = ARM_VCM4P10_MAX_COST;
533 /* Go through each mode for minim cost */
553 &Cost,
557 if (Cost < BestCost)
559 BestCost = Cost;
761 * [in] nLamda - For calculating the cost
762 * [out] pBestCost - Minimum cost for encoding current block
[all...] |
| /external/llvm/lib/Analysis/ |
| InlineCost.cpp | 1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===//
10 // This file implements inline cost analysis.
14 #define DEBUG_TYPE "inline-cost"
51 int Cost;
67 // can cause dramatic shifts in the cost of inlining a function.
74 // The mapping of caller Alloca values to their accumulated cost savings. If
76 // cost must be added.
127 : TD(TD), F(Callee), Threshold(Threshold), Cost(0),
140 int getCost() { return Cost; }
142 // Keep a bunch of stats about the cost savings found so we can print the
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 157 /// Cost of evicting interference.
477 unsigned Cost = TRI->getCostPerUse(PhysReg);
479 // Most registers have 0 additional cost.
480 if (!Cost)
483 DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost
485 unsigned CheapReg = tryEvict(VirtReg, Order, NewVRegs, Cost);
525 /// @param MaxCost Only look for cheaper candidates and update with new cost
541 EvictionCost Cost;
567 Cost.BrokenHints += 10
[all...] |
| MachineLICM.cpp | 206 /// check if hoisting an instruction of the given cost matrix can cause high
208 bool CanCauseHighRegPressure(DenseMap<unsigned, int> &Cost, bool Cheap);
244 /// index, return the ID and cost of its representative register class by
777 /// index, return the ID and cost of its representative register class.
[all...] |
| RegAllocFast.cpp | 430 // calcSpillCost - Return the cost of spilling clearing out PhysReg and
456 // This is a disabled register, add up cost of aliases.
458 unsigned Cost = 0;
467 ++Cost;
474 Cost += I->Dirty ? spillDirty : spillClean;
479 return Cost;
522 unsigned Cost = calcSpillCost(Hint);
523 if (Cost < spillDirty) {
524 if (Cost)
548 unsigned Cost = calcSpillCost(*I)
[all...] |
| /external/llvm/tools/llvm-diff/ |
| DifferenceEngine.cpp | 480 DiffEntry() : Cost(0) {}
482 unsigned Cost;
512 Cur[I].Cost = I * LeftCost;
520 Next[0].Cost += RightCost;
527 Next[Index].Cost += MatchCost;
530 } else if (Next[Index-1].Cost <= Cur[Index].Cost) {
532 Next[Index].Cost += LeftCost;
536 Next[Index].Cost += RightCost;
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGRRList.cpp | 261 /// GetCostForDef - Looks up the register class and cost for a given definition.
269 unsigned &RegClass, unsigned &Cost) {
282 Cost = 1;
290 // FIXME: Cost arbitrarily set to 1 because there doesn't seem to be a
292 Cost = 1;
295 Cost = TLI->getRepRegClassCostFor(VT);
[all...] |
| ScheduleDAGSDNodes.cpp | 109 /// register and the cost of copying the register.
113 unsigned &PhysReg, int &Cost) {
129 Cost = RC->getCopyCost();
437 int Cost = 1;
439 CheckForPhysRegDependency(OpN, N, i, TRI, TII, PhysReg, Cost);
444 // it requires a cross class copy (cost < 0). That means we are only
447 if (Cost >= 0 && !StressSched)
|
| TargetLowering.cpp | 727 /// of the register class for the specified type and its associated "cost".
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopStrengthReduce.cpp | 661 /// Check if expanding this expression is likely to incur significant cost. This
729 // Fow now, consider any other type of expression (div/mul/min/max) high cost.
762 /// Cost - This class is used to measure and compare candidate formulae.
763 class Cost {
774 Cost()
778 bool operator<(const Cost &Other) const;
793 assert(isValid() && "invalid cost");
823 void Cost::RateRegister(const SCEV *Reg,
871 void Cost::RatePrimaryRegister(const SCEV *Reg,
887 void Cost::RateFormula(const Formula &F
2389 int cost = 1; local
[all...] |
| /external/llvm/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | [all...] |
| X86ISelLowering.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyCFG.cpp | 211 /// ComputeSpeculuationCost - Compute an abstract "cost" of speculating the
254 /// that do not dominate BB have a combined cost lower than CostRemaining and
258 /// The cost for most non-trapping instructions is defined as 1 except for
259 /// Select whose cost is 2.
261 /// After this function returns, CostRemaining is decreased by the cost of
262 /// V plus its non-dominating operands. If that cost is greater than
302 unsigned Cost = ComputeSpeculationCost(I);
304 if (Cost > CostRemaining)
307 CostRemaining -= Cost;
310 // not take us over the cost threshold
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMISelLowering.cpp | [all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCISelLowering.cpp | [all...] |
