Home
last modified time | relevance | path

Searched full:cost (Results 1 – 25 of 953) sorted by relevance

12345678910>>...39

/freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64PerfectShuffle.h21 // 31 entries have cost 0
22 // 756 entries have cost 1
23 // 3690 entries have cost 2
24 // 2084 entries have cost 3
28 135053414U, // <0,0,0,0>: Cost 1 vdup0 LHS
29 2080972802U, // <0,0,0,1>: Cost 2 ins <0,0,u,1>, lane 2
30 1679065190U, // <0,0,0,2>: Cost 2 vuzpl <0,2,0,2>, LHS
31 2085707777U, // <0,0,0,3>: Cost 2 ins <0,u,0,3>, lane 1
32 1476398390U, // <0,0,0,4>: Cost 2 vext1 <0,0,0,0>, RHS
33 2080440323U, // <0,0,0,5>: Cost 2 ins <0,0,0,u>, lane 3
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMPerfectShuffle.h17 // 31 entries have cost 0
18 // 242 entries have cost 1
19 // 1447 entries have cost 2
20 // 3602 entries have cost 3
21 // 1237 entries have cost 4
22 // 2 entries have cost 5
26 135053414U, // <0,0,0,0>: Cost 1 vdup0 LHS
27 1543503974U, // <0,0,0,1>: Cost 2 vext2 <0,0,0,0>, LHS
28 2618572962U, // <0,0,0,2>: Cost 3 vext2 <0,2,0,0>, <0,2,0,0>
29 2568054923U, // <0,0,0,3>: Cost 3 vext1 <3,0,0,0>, <3,0,0,0>
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCPerfectShuffle.h17 // 31 entries have cost 0
18 // 292 entries have cost 1
19 // 1384 entries have cost 2
20 // 3061 entries have cost 3
21 // 1733 entries have cost 4
22 // 60 entries have cost 5
26 202162278U, // <0,0,0,0>: Cost 1 vspltisw0 LHS
27 1140850790U, // <0,0,0,1>: Cost 2 vmrghw <0,0,0,0>, LHS
28 2617247181U, // <0,0,0,2>: Cost 3 vsldoi4 <0,0,0,0>, <2,0,3,0>
29 2635163787U, // <0,0,0,3>: Cost 3 vsldoi4 <3,0,0,0>, <3,0,0,0>
[all …]
H A DPPCTargetTransformInfo.cpp29 static cl::opt<bool> VecMaskCost("ppc-vec-mask-cost",
30 cl::desc("add masking cost for i1 vectors"), cl::init(true), cl::Hidden);
41 LsrNoInsnsCost("ppc-lsr-no-insns-cost", cl::Hidden, cl::init(false),
42 cl::desc("Do not add instruction count to lsr cost model"));
53 // PPC cost model.
332 // Instructions that need to be split should cost more. in getInstructionCost()
409 // often outweigh the cost of a division to compute the trip count. in getUnrollingPreferences()
549 // Returns a cost adjustment factor to adjust the cost of vector instructions
552 // An invalid instruction cost is returned if the type is an MMA vector type.
556 // instruction cost is returned. This is to signify to other cost computing in vectorCostAdjustmentFactor()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DInlineCost.h1 //===- InlineCost.h - Cost analysis for inliner -----------------*- C++ -*-===//
36 // Various thresholds used by inline cost analysis.
60 "function-inline-cost-multiplier";
65 // The cost-benefit pair computed by cost-benefit analysis.
68 CostBenefitPair(APInt Cost, APInt Benefit) in CostBenefitPair() argument
69 : Cost(std::move(Cost)), Benefit(std::move(Benefit)) {} in CostBenefitPair()
71 const APInt &getCost() const { return Cost; } in getCost()
76 APInt Cost;
80 /// Represents the cost of inlining a function.
83 /// "never" be inlined. Otherwise, the cost represents a unitless amount;
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCostModel.cpp1 //===- CostModel.cpp ------ Cost Model Analysis ---------------------------===//
9 // This file defines the cost model analysis. It provides a very basic cost
11 // to approximate the cost of any IR instruction when lowered to machine
12 // instructions. The cost results are unit-less and the cost number represents
14 // branches are predicted, etc. The cost numbers can be added in order to
32 "cost-kind", cl::desc("Target cost kind"),
43 static cl::opt<bool> TypeBasedIntrinsicCost("type-based-intrinsic-cost",
102 InstructionCost Cost; print() local
131 InstructionCost Cost; run() local
[all...]
H A DInlineOrder.cpp25 enum class InlinePriorityMode : int { Size, Cost, CostBenefit, ML }; enumerator
32 clEnumValN(InlinePriorityMode::Cost, "cost",
33 "Use inline cost priority."),
34 clEnumValN(InlinePriorityMode::CostBenefit, "cost-benefit",
35 "Use cost-benefit ratio."),
40 cl::desc("The cost threshold for call sites that get inlined without the "
41 "cost-benefit analysis"));
98 Cost = IC.getCost(); in CostPriority()
100 Cost = IC.isNever() ? INT_MAX : INT_MIN; in CostPriority()
104 return P1.Cost < P2.Cost; in isMoreDesirable()
[all …]
H A DTargetTransformInfo.cpp270 InstructionCost Cost = TTIImpl->getInstructionCost(U, Operands, CostKind); in getInstructionCost() local
271 assert((CostKind == TTI::TCK_RecipThroughput || Cost >= 0) && in getInstructionCost()
273 return Cost; in getInstructionCost()
549 InstructionCost Cost = TTIImpl->getScalingFactorCost( in getScalingFactorCost() local
551 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getScalingFactorCost()
552 return Cost; in getScalingFactorCost()
679 InstructionCost Cost = TTIImpl->getFPOpCost(Ty); in getFPOpCost() local
680 assert(Cost >= 0 && "TTI should not produce negative costs!"); in getFPOpCost()
681 return Cost; in getFPOpCost()
688 InstructionCost Cost = TTIImpl->getIntImmCodeSizeCost(Opcode, Idx, Imm, Ty); in getIntImmCodeSizeCost() local
[all …]
H A DInlineCost.cpp1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===//
9 // This file implements inline cost analysis.
52 #define DEBUG_TYPE "inline-cost"
68 "during inline cost calculation"));
72 cl::desc("Prints comments for instruction based on inline cost analysis"));
88 "inline-enable-cost-benefit-analysis", cl::Hidden, cl::init(false),
89 cl::desc("Enable the cost-benefit analysis for the inliner"));
104 "savings won't justify the cost"));
139 InstrCost("inline-instr-cost", cl::Hidden, cl::init(5),
140 cl::desc("Cost of a single instruction when inlining"));
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DBasicTTIImpl.h89 /// Estimate a cost of Broadcast as an extract and sequence of insert
93 InstructionCost Cost = 0; in getBroadcastShuffleOverhead() local
94 // Broadcast cost is equal to the cost of extracting the zero'th element in getBroadcastShuffleOverhead()
95 // plus the cost of inserting it into every element of the result vector. in getBroadcastShuffleOverhead()
96 Cost += thisT()->getVectorInstrCost(Instruction::ExtractElement, VTy, in getBroadcastShuffleOverhead()
100 Cost += thisT()->getVectorInstrCost(Instruction::InsertElement, VTy, in getBroadcastShuffleOverhead()
103 return Cost; in getBroadcastShuffleOverhead()
106 /// Estimate a cost of shuffle as a sequence of extract and insert
110 InstructionCost Cost = 0; in getPermuteShuffleOverhead() local
111 // Shuffle cost is equal to the cost of extracting element from its argument in getPermuteShuffleOverhead()
[all …]
H A DCostTable.h1 //===-- CostTable.h - Instruction Cost Table handling -----------*- C++ -*-===//
10 /// Cost tables and simple lookup functions
23 /// Cost Table Entry
28 CostType Cost; member
32 /// Find in cost table.
53 /// Type Conversion Cost Table
59 CostType Cost; member
63 /// Find in type conversion cost table.
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DRegBankSelect.h23 /// used for each operand of the instruction and what is the cost. Then,
24 /// it chooses the solution which minimize the cost of the instruction plus
25 /// the cost of any move that may be needed to the values into the right
27 /// In other words, the cost for an instruction on a register bank RegBank
28 /// is: Cost of I on RegBank plus the sum of the cost for bringing the
31 /// cost(I, RegBank) = cost(I.Opcode, RegBank) +
41 /// with a cost of respectively 5 and 1.
42 /// Then, let say the cost o
[all...]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DRegBankSelect.cpp279 unsigned Cost = RBI->copyCost(*DesiredRegBank, *CurRegBank, in getRepairCost() local
282 if (Cost != std::numeric_limits<unsigned>::max()) in getRepairCost()
283 return Cost; in getRepairCost()
284 // Return the legalization cost of that repairing. in getRepairCost()
296 MappingCost Cost = MappingCost::ImpossibleCost(); in findBestMapping() local
301 computeMapping(MI, *CurMapping, LocalRepairPts, &Cost); in findBestMapping()
302 if (CurCost < Cost) { in findBestMapping()
304 Cost = CurCost; in findBestMapping()
384 // account for a repairing cost for each phi we silently change. in tryAvoidingSplit()
396 // in the repairing cost all the phi we changed. in tryAvoidingSplit()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DInstructionCost.h10 /// the cost of an instruction, or a group of instructions. In addition to a
11 /// numeric value representing the cost the class also contains a state that
12 /// can be used to encode particular properties, such as a cost being invalid.
14 /// accumulating costs on large cost-values don't overflow.
33 /// CostState describes the state of a cost.
35 Valid, /// < The cost value represents a valid cost, even when the
36 /// cost-value is large.
37 Invalid /// < Invalid indicates there is no way to represent the cost as a
39 /// e.g. if the cost-model knows the operation cannot be expanded
41 /// passes may assert that the calculated cost must be valid, it is
[all …]
/freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.cpp165 OS << " - COST: " << DE.Cost << '\n'; in dumpDependencyEdge()
209 // Each node of the graph starts with an initial default cost of zero. The in propagateThroughEdges()
210 // cost of a node is a measure of criticality: the higher the cost, the bigger in propagateThroughEdges()
212 // For register and memory dependencies, the cost is a function of the write in propagateThroughEdges()
214 // For processor resource dependencies, the cost is a function of the resource in propagateThroughEdges()
219 // nodes`, and then propagates the cost of N to all its neighbors. in propagateThroughEdges()
241 uint64_t Cost = N.Cost + DepEdge.Dep.Cost; in propagateThroughEdges() local
243 // case, update the total cost of the destination node (ToIID), as well in propagateThroughEdges()
245 if (Cost > To.Cost) { in propagateThroughEdges()
247 To.Cost = Cost; in propagateThroughEdges()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZTargetTransformInfo.cpp33 // SystemZ cost model.
78 // There is no cost model for constants with a bit size of 0. Return TCC_Free in getIntImmCost()
82 // No cost model for operations on integers larger than 128 bit implemented yet. in getIntImmCost()
114 // There is no cost model for constants with a bit size of 0. Return TCC_Free in getIntImmCostInst()
118 // No cost model for operations on integers larger than 64 bit implemented yet. in getIntImmCostInst()
234 // There is no cost model for constants with a bit size of 0. Return TCC_Free in getIntImmCostIntrin()
238 // No cost model for operations on integers larger than 64 bit implemented yet. in getIntImmCostIntrin()
431 // TODO: Handle more cost kinds. in getArithmeticInstrCost()
558 // FP128, the scalar cost is 1, and there is no overhead since the values in getArithmeticInstrCost()
567 // Return the cost of multiple scalar invocation plus the cost of in getArithmeticInstrCost()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/
H A DRISCVTargetTransformInfo.cpp51 InstructionCost Cost = 0; in getRISCVInstructionCost() local
55 Cost += TLI->getVRGatherVICost(VT); in getRISCVInstructionCost()
58 Cost += TLI->getVRGatherVVCost(VT); in getRISCVInstructionCost()
62 Cost += TLI->getVSlideVICost(VT); in getRISCVInstructionCost()
66 Cost += TLI->getVSlideVXCost(VT); in getRISCVInstructionCost()
82 Cost += Log2_32_Ceil(VL); in getRISCVInstructionCost()
89 Cost += VL; in getRISCVInstructionCost()
103 Cost += 1; in getRISCVInstructionCost()
106 Cost += LMULCost; in getRISCVInstructionCost()
109 return Cost; in getRISCVInstructionCost()
[all …]
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DDAGISelEmitter.cpp49 unsigned Cost = 0; in getResultPatternCost() local
52 Cost++; in getResultPatternCost()
55 Cost += 10; in getResultPatternCost()
58 Cost += getResultPatternCost(P.getChild(i), CGP); in getResultPatternCost()
59 return Cost; in getResultPatternCost()
69 unsigned Cost = 0; in getResultPatternSize() local
72 Cost += Op->getValueAsInt("CodeSize"); in getResultPatternSize()
75 Cost += getResultPatternSize(P.getChild(i), CGP); in getResultPatternSize()
76 return Cost; in getResultPatternSize()
81 // In particular, we want to match maximal patterns first and lowest cost within
[all …]
/freebsd/sys/dev/isp/
H A DHardware.txt26 Approx cost: 1K$ for a 2200
32 Approx cost: ??????
41 Approx cost: 850$ for a P-0036
56 Approx cost: 1.5K$ for Vixel 1000, 2.5K$ for 2000
63 (cost: I have no idea... certainly less than a switch)
83 Approx cost of a Brocade 2400 with no GBICs is about 8K$ when
96 (cost: no idea)
103 (cost: very very expensive, 40K$ plus)
119 Approx cost: I don't know what optical is- you can expect to pay maybe
126 Approx Cost: Copper GBICs are 70$ each. Opticals are twice that or more.
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationPlanner.h234 /// Vector width with best cost.
237 /// Cost of the loop with that width.
238 InstructionCost Cost; member
240 /// Cost of the scalar loop.
247 VectorizationFactor(ElementCount Width, InstructionCost Cost, in VectorizationFactor()
249 : Width(Width), Cost(Cost), ScalarCost(ScalarCost) {} in VectorizationFactor()
251 /// Width 1 means no vectorization, cost 0 means uncomputed cost.
257 return Width == rhs.Width && Cost == rhs.Cost;
268 /// fixed and/or scalable VFs in order to find the most cost-effective VF to
337 /// Computes the cost of \p Plan for vectorization factor \p VF.
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h372 /// @param Costs Cost vector for the new node.
376 // Get cost vector from the problem domain in addNode()
384 /// Add a node bypassing the cost allocator.
385 /// @param Costs Cost vector ptr for the new node (must be convertible to
390 /// to be passed through the cost allocator. The most common use case for
406 /// @param Costs Cost matrix for new edge.
413 // Get cost matrix from the problem domain. in addEdge()
421 /// Add an edge bypassing the cost allocator.
424 /// @param Costs Cost matrix for new edge.
428 /// to be passed through the cost allocator. The most common use case for
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/IPO/
H A DFunctionSpecialization.h27 // Cost Model:
29 // The cost model facilitates a utility for estimating the specialization bonus
61 // a direct way to steer function specialization, avoiding the cost-model,
95 using Cost = InstructionCost; in hash_value()
149 Bonus(Cost CodeSize, Cost Latency) {
155 // cannot be negative and Cost is of type int64_t.
216 Cost estimateBasicBlocks(SmallVectorImpl<BasicBlock *> &WorkList);
217 Cost estimateSwitchInst(SwitchInst &I);
218 Cost estimateBranchIns
71 using Cost = InstructionCost; global() variable
[all...]
/freebsd/contrib/ncurses/ncurses/tty/
H A Dlib_mvcur.c56 ** old ncurses optimizer: less accurate cost computations (in fact,
72 ** cost swamps the computation overhead (and as machines get faster, this
128 * int _char_padding; // cost of character put
129 * int _cr_cost; // cost of (carriage_return)
130 * int _cup_cost; // cost of (cursor_address)
131 * int _home_cost; // cost of (cursor_home)
132 * int _ll_cost; // cost of (cursor_to_ll)
134 * int _ht_cost; // cost of (tab)
135 * int _cbt_cost; // cost of (back_tab)
137 * int _cub1_cost; // cost of (cursor_left)
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonTargetTransformInfo.cpp45 // Constant "cost factor" to make floating point operations more expensive
46 // in terms of vectorization cost. This isn't the best way, but it should
47 // do. Ultimately, the cost should use cycles.
171 // TODO: Handle other cost kinds. in getMemoryOpCost()
187 // Cost of HVX loads. in getMemoryOpCost()
190 // Cost of constructing HVX vector from scalar loads in getMemoryOpCost()
201 // Add extra cost for floating point types. in getMemoryOpCost()
202 unsigned Cost = in getMemoryOpCost() local
210 return Cost * NumLoads; in getMemoryOpCost()
214 return (3 - LogA) * Cost * NumLoads; in getMemoryOpCost()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUSplitModule.cpp74 "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()
[all …]

12345678910>>...39