| /src/external/bsd/tre/dist/lib/ |
| tre-match-approx.c | 59 the `costs' array. */
61 /* Costs and counter values for different parameter nesting depths. */
62 int costs[TRE_M_MAX_DEPTH + 1][TRE_M_LAST]; member in struct:__anon8195
81 DPRINT((" %03d, costs ", id));
87 DPRINT(("%2d", reach[id].costs[i][j]));
118 /* If depth is increased reset costs and counters to zero for the
127 reach->costs[i][j] = 0;
221 /* Costs of the match. */
360 /* Set the parameters, depth, and costs. */
364 reach_next[stateid].costs[0][i] = 0
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| AArch64PBQPRegAlloc.cpp | 184 // costs.
190 PBQPRAGraph::RawMatrix costs(vRdAllowed->size() + 1,
197 costs[i + 1][j + 1] = std::numeric_limits<PBQP::PBQPNum>::infinity();
199 costs[i + 1][j + 1] = haveSameParity(pRd, pRa) ? 0.0 : 1.0;
202 G.addEdge(node1, node2, std::move(costs));
212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge));
222 if (costs[i + 1][j + 1] !=
224 costs[i + 1][j + 1] > sameParityMax)
225 sameParityMax = costs[i + 1][j + 1];
233 if (sameParityMax > costs[i + 1][j + 1]
[all...] |
| /src/external/gpl3/gcc/dist/gcc/config/riscv/ |
| riscv-vector-costs.h | 44 /* rvv-specific vector costs. */
45 class costs : public vector_costs class in namespace:riscv_vector
50 costs (vec_info *, bool);
|
| riscv-vector-costs.cc | 48 #include "riscv-vector-costs.h"
862 costs::costs (vec_info *vinfo, bool costing_for_scalar) function in class:riscv_vector::costs
873 /* Do one-time initialization of the costs given that we're
876 costs::analyze_loop_vinfo (loop_vec_info loop_vinfo)
889 costs::record_potential_unexpected_spills (loop_vec_info loop_vinfo)
911 costs::record_potential_vls_unrolling (loop_vec_info loop_vinfo)
949 costs::prefer_unrolled_loop () const
972 costs::better_main_loop_than_p (const vector_costs *uncast_other) const
974 auto other = static_cast<const costs *> (uncast_other)
1058 const cpu_vector_cost *costs = get_vector_costs (); local
[all...] |
| /src/external/zlib/pigz/dist/zopfli/ |
| squeeze.c | 215 float* costs; local
229 costs = (float*)malloc(sizeof(float) * (blocksize + 1));
230 if (!costs) exit(-1); /* Allocation failed. */
238 for (i = 1; i < blocksize + 1; i++) costs[i] = ZOPFLI_LARGE_FLOAT;
239 costs[0] = 0; /* Because it's the start. */
243 size_t j = i - instart; /* Index in the costs array and length_array. */
259 costs[j + ZOPFLI_MAX_MATCH] = costs[j] + symbolcost;
273 double newCost = costs[j] + costmodel(in[i], 0, costcontext);
275 if (newCost < costs[j + 1])
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| ira-costs.cc | 47 /* Number of elements in array `costs'. */
50 /* The `costs' struct records the cost of using hard registers of each
53 struct costs struct
56 /* Costs for register classes start here. We process only some
72 /* Costs of each class for each allocno or pseudo. */
73 static struct costs *costs; variable in typeref:struct:costs
75 /* Accumulated costs of each class for each allocno. */
76 static struct costs *total_allocno_costs;
78 /* It is the current size of struct costs. *
[all...] |
| tree-vectorizer.h | 1576 /* Contains the scalar or vector costs for a vec_info. */
1583 /* Update the costs in response to adding COUNT copies of a statement.
1610 If the costs describe vector code, SCALAR_COSTS gives the costs
1614 /* The costs in THIS and OTHER both describe ways of vectorizing
1615 a main loop. Return true if the costs described by THIS are
1616 cheaper than the costs described by OTHER. Return false if any
1621 - we can't be sure about the relative costs of THIS and OTHER. */
1624 /* Likewise, but the costs in THIS and OTHER both describe ways of
1651 /* The costs of the three regions, indexed by vect_cost_model_location. *
[all...] |
| ira-color.cc | 93 /* Info about changing hard reg costs of an allocno. */
145 /* Records about updating allocno hard reg costs from copies. If
147 used to restore original hard reg costs of allocnos connected to
1118 int *costs;
1125 if ((costs = ALLOCNO_UPDATED_HARD_REG_COSTS (a)) != NULL
1126 || (costs = ALLOCNO_HARD_REG_COSTS (a)) != NULL)
1135 if (ALLOCNO_UPDATED_MEMORY_COST (a) < costs[j]
1141 else if (min_cost > costs[j])
1142 min_cost = costs[j];
1205 /* Describes one element in a queue of allocnos whose costs need to b
[all...] |
| expmed.h | 1 /* Target-dependent costs for expmed.cc.
178 /* Conversion costs are only defined between two scalar integer modes
254 /* Return a pointer to a cost contained in COSTS when a particular
258 expmed_op_cost_ptr (struct expmed_op_costs *costs, bool speed,
262 return &costs->cost[speed][idx];
|
| ira-int.h | 347 /* Minimal accumulated and updated costs of usage register of the
350 /* Minimal accumulated, and updated costs of memory for the allocno.
351 At the allocation start, the original and updated costs are
402 /* Array of usage costs (accumulated and the one updated during
404 member value can be NULL if all costs are the same and equal to
405 CLASS_COST. For example, the costs of two different hard
411 the allocno class (GENERAL_REGS for x86). We have updated costs
417 /* Array of decreasing costs (accumulated and the one updated during
420 costs are the same. These costs are used to reflect preference
[all...] |
| tree-ssa-loop-ivopts.cc | 47 -- The group/use costs. Each of the interesting groups/uses chooses
52 -- The variable costs. Each of the variables has a cost assigned that
53 reflects the costs associated with incrementing the value of the
58 All the costs are defined in a machine-specific way, using the target
66 to decide costs more precisely, but getting all the interactions right
84 provided to add on extra costs for generic type and address type IV use.
218 /* Adds costs COST1 and COST2. */
236 /* Subtracts costs COST1 and COST2. */
430 /* The costs wrto the iv candidates. */
671 /* Candidate assigned to a use, together with the related costs. *
4619 int64_t costs[AINC_NONE]; member in struct:ainc_cost_data
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| ira-costs.cc | 46 /* Number of elements in array `costs'. */
49 /* The `costs' struct records the cost of using hard registers of each
52 struct costs struct
55 /* Costs for register classes start here. We process only some
71 /* Costs of each class for each allocno or pseudo. */
72 static struct costs *costs; variable in typeref:struct:costs
74 /* Accumulated costs of each class for each allocno. */
75 static struct costs *total_allocno_costs;
77 /* It is the current size of struct costs. *
[all...] |
| tree-vectorizer.h | 1454 /* Contains the scalar or vector costs for a vec_info. */
1461 /* Update the costs in response to adding COUNT copies of a statement.
1488 If the costs describe vector code, SCALAR_COSTS gives the costs
1492 /* The costs in THIS and OTHER both describe ways of vectorizing
1493 a main loop. Return true if the costs described by THIS are
1494 cheaper than the costs described by OTHER. Return false if any
1499 - we can't be sure about the relative costs of THIS and OTHER. */
1502 /* Likewise, but the costs in THIS and OTHER both describe ways of
1529 /* The costs of the three regions, indexed by vect_cost_model_location. *
[all...] |
| ira-color.cc | 93 /* Info about changing hard reg costs of an allocno. */
145 /* Records about updating allocno hard reg costs from copies. If
147 used to restore original hard reg costs of allocnos connected to
1111 int *costs;
1118 if ((costs = ALLOCNO_UPDATED_HARD_REG_COSTS (a)) != NULL
1119 || (costs = ALLOCNO_HARD_REG_COSTS (a)) != NULL)
1128 if (ALLOCNO_UPDATED_MEMORY_COST (a) < costs[j]
1134 else if (min_cost > costs[j])
1135 min_cost = costs[j];
1198 /* Describes one element in a queue of allocnos whose costs need to b
[all...] |
| expmed.h | 1 /* Target-dependent costs for expmed.cc.
179 /* Conversion costs are only defined between two scalar integer modes
255 /* Return a pointer to a cost contained in COSTS when a particular
259 expmed_op_cost_ptr (struct expmed_op_costs *costs, bool speed,
263 return &costs->cost[speed][idx];
|
| ira-int.h | 349 /* Minimal accumulated and updated costs of usage register of the
352 /* Minimal accumulated, and updated costs of memory for the allocno.
353 At the allocation start, the original and updated costs are
395 /* Array of usage costs (accumulated and the one updated during
397 member value can be NULL if all costs are the same and equal to
398 CLASS_COST. For example, the costs of two different hard
404 the allocno class (GENERAL_REGS for x86). We have updated costs
410 /* Array of decreasing costs (accumulated and the one updated during
413 costs are the same. These costs are used to reflect preference
[all...] |
| tree-ssa-loop-ivopts.cc | 47 -- The group/use costs. Each of the interesting groups/uses chooses
52 -- The variable costs. Each of the variables has a cost assigned that
53 reflects the costs associated with incrementing the value of the
58 All the costs are defined in a machine-specific way, using the target
66 to decide costs more precisely, but getting all the interactions right
84 provided to add on extra costs for generic type and address type IV use.
218 /* Adds costs COST1 and COST2. */
236 /* Subtracts costs COST1 and COST2. */
430 /* The costs wrto the iv candidates. */
671 /* Candidate assigned to a use, together with the related costs. *
4578 int64_t costs[AINC_NONE]; member in struct:ainc_cost_data
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/x86_64/ |
| lshsub_n.asm | 35 C AMD K8,K9 3.15 (mpn_sub_n + mpn_lshift costs about 4 c/l)
36 C AMD K10 3.15 (mpn_sub_n + mpn_lshift costs about 4 c/l)
|
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googletest/src/ |
| gtest.cc | 1037 std::vector<std::vector<double> > costs(
1043 for (size_t l_i = 0; l_i < costs.size(); ++l_i) {
1044 costs[l_i][0] = static_cast<double>(l_i);
1048 for (size_t r_i = 1; r_i < costs[0].size(); ++r_i) {
1049 costs[0][r_i] = static_cast<double>(r_i);
1057 costs[l_i + 1][r_i + 1] = costs[l_i][r_i];
1062 const double add = costs[l_i + 1][r_i];
1063 const double remove = costs[l_i][r_i + 1];
1064 const double replace = costs[l_i][r_i]
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/x86/k6/ |
| mod_34lsub1.asm | 52 C for the claimed speed, anywhere else costs an extra cycle per loop.
|
| /src/external/lgpl3/gmp/dist/mpn/x86/pentium/ |
| hamdist.asm | 111 C doesn't and costs an extra 2 cycles.
|
| bdiv_q_1.asm | 45 C mpn/x86/pentium/README) costs 1 cycle, but it's not clear why there's a
|
| dive_1.asm | 51 C mpn/x86/pentium/README) costs 1 cycle, but it's not clear why there's a
|
| /src/external/lgpl3/gmp/dist/mpn/x86/pentium4/mmx/ |
| popham.asm | 47 C Loading with unaligned movq's costs an extra 1 c/l and hence is avoided.
|
| /src/external/lgpl3/gmp/dist/mpn/x86/k6/mmx/ |
| dive_1.asm | 213 C been found. Maybe the fact every second movq is unaligned costs the extra
|
