HomeSort by: relevance | last modified time | path
    Searched defs:costs (Results 1 - 10 of 10) sorted by relevancy

  /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/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/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...]
ira-build.cc 1097 /* Free updated register costs of allocno A. */
2018 auto costs = ALLOCNO_HARD_REG_COSTS (a);
2021 else if (!costs)
2031 else if (costs)
2034 parent_costs[i] += MIN (costs[i], spill_cost);
2654 their costs and allocno class evaluation because only after that
3389 /* Restore updated costs for assignments from reload. */
2009 auto costs = ALLOCNO_HARD_REG_COSTS (a); local
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...]
ira-build.cc 1095 /* Free updated register costs of allocno A. */
2016 auto costs = ALLOCNO_HARD_REG_COSTS (a);
2019 else if (!costs)
2029 else if (costs)
2032 parent_costs[i] += MIN (costs[i], spill_cost);
2646 their costs and allocno class evaluation because only after that
3381 /* Restore updated costs for assignments from reload. */
2007 auto costs = ALLOCNO_HARD_REG_COSTS (a); local
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...]

Completed in 27 milliseconds