Searched refs:cost (Results 26 - 37 of 37) sorted by relevance

12

/freebsd-11-stable/contrib/gcc/config/arm/
H A Darm.c1693 them in-line, regardless of the cost. This is only likely to
2028 word. We only look for the simplest cases, to do more would cost
3229 routine gets called as part of the rtx cost estimation
3243 if we are being called as part of the cost-estimation
3256 if we are being called as part of the cost-estimation
4733 /* It's just the cost of the two operands. */
4762 /* It's just the cost of the two operands. */
4902 int cost, const_ok = const_ok_for_arm (i);
4906 cost = const_ok ? 4 : 8;
4911 cost
4892 int cost, const_ok = const_ok_for_arm (i); local
4958 int cost, const_ok = const_ok_for_arm (i); local
5024 int cost, const_ok = const_ok_for_arm (i); local
5073 int cost; local
5180 arm_adjust_cost(rtx insn, rtx link, rtx dep, int cost) argument
[all...]
/freebsd-11-stable/contrib/less/
H A Dscreen.c1389 * Return the cost of displaying a termcap string.
1407 cost(t) function
1418 * cost (see cost() function).
1434 if (cost(t1) < cost(t2))
/freebsd-11-stable/contrib/gcc/config/mips/
H A Dmips.c2267 unsigned int cost, alt_cost;
2269 cost = mips_build_shift (codes, value);
2271 if (alt_cost < cost)
2274 cost = alt_cost;
2276 return cost;
2288 unsigned int i, cost;
2292 cost = mips_build_integer (codes, value);
2297 for (i = 1; i < cost; i++)
2758 If ADDR is not a valid address, its cost is irrelevant. */
4785 /* Set cost structur
2261 unsigned int cost, alt_cost; local
2282 unsigned int i, cost; local
9955 mips_adjust_cost(rtx insn ATTRIBUTE_UNUSED, rtx link, rtx dep ATTRIBUTE_UNUSED, int cost) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopStrengthReduce.cpp141 // The flag adds instruction count to solutions cost comparision.
143 "lsr-insns-cost", cl::Hidden, cl::init(true),
144 cl::desc("Add instruction count to a LSR cost model"));
170 cl::desc("The limit on recursion depth for LSRs setup cost"));
895 /// Check if expanding this expression is likely to incur significant cost. This
961 // Fow now, consider any other type of expression (div/mul/min/max) high cost.
1006 /// accurate cost model.
1010 // Get the cost of the scaling factor used in F for LU.
1053 assert(isValid() && "invalid cost");
1382 // If we don't count instruction cost exi
2851 int cost = 1; local
[all...]
/freebsd-11-stable/share/mk/
H A Dbsd.cpu.mk357 # cost outweighs the advantages of SIMD instructions.
/freebsd-11-stable/contrib/gcc/
H A Dgenattrtab.c2231 /* Compute approximate cost of the expression. Used to decide whether
2236 int cost = 0; local
2269 cost += attr_rtx_cost (XVECEXP (x, i, j));
2272 cost += attr_rtx_cost (XEXP (x, i));
2279 return cost;
H A Drtlanal.c3250 /* Return an estimate of the cost of computing rtx X.
3309 /* Sum the costs of the sub-rtx's, plus cost of this operation,
3324 /* Return cost of address expression X.
3330 /* We may be asked for cost of various unusual addresses, such as operands
3340 /* If the target doesn't override, compute the cost as with arithmetic. */
4296 zero indicates an instruction pattern without a known cost. */
4301 int i, cost;
4327 cost = rtx_cost (SET_SRC (set), SET);
4328 return cost > 0 ? cost
4275 int i, cost; local
[all...]
H A Difcvt.c139 false if the cost of any instruction could not be estimated. */
151 int cost = insn_rtx_cost (PATTERN (insn));
152 if (cost == 0)
156 such as a floating point register on x87, then the cost of
158 the additional cost of popping its result off of the
170 count += cost;
1326 /* Total insn_rtx_cost should be smaller than branch cost. Exit
150 int cost = insn_rtx_cost (PATTERN (insn)); local
H A Dreload.c667 int cost;
687 cost = REGISTER_MOVE_COST (outer, class, dest_class);
690 && (best_cost < 0 || best_cost >= cost))
691 || best_cost > cost)
3618 it must be reloaded, so request this and count the cost. */
663 int cost; local
/freebsd-11-stable/contrib/gcc/config/rs6000/
H A Drs6000.c275 const int mulsi; /* cost of SImode multiplication. */
276 const int mulsi_const; /* cost of SImode multiplication by constant. */
277 const int mulsi_const9; /* cost of SImode mult by short constant. */
278 const int muldi; /* cost of DImode multiplication. */
279 const int divsi; /* cost of SImode division. */
280 const int divdi; /* cost of DImode division. */
281 const int fp; /* cost of simple SFmode and DFmode insns. */
282 const int dmul; /* cost of DFmode multiplication (and fmadd). */
283 const int sdiv; /* cost of SFmode division (fdivs). */
284 const int ddiv; /* cost o
16597 rs6000_adjust_cost(rtx insn, rtx link, rtx dep_insn, int cost) argument
16996 rs6000_is_costly_dependence(rtx insn, rtx next, rtx link, int cost, int distance) argument
17111 int cost; local
[all...]
/freebsd-11-stable/crypto/heimdal/lib/sqlite/
H A Dsqlite3.c5405 ** ^The estimatedCost value is an estimate of the cost of doing the
5407 ** a cost of N. A binary search of a table of N entries should have a
5408 ** cost of approximately log(N).
5433 double estimatedCost; /* Estimated cost of using this index */
103279 double cost; /* Cost of using pProbe */ local
[all...]
/freebsd-11-stable/contrib/amd/doc/
H A Dtexinfo.tex7463 % twice the \macarg.BLAH macros does not cost too much processing power.

Completed in 677 milliseconds

12