| /xsrc/external/mit/brotli/dist/c/enc/ |
| literal_cost.h | 7 /* Literal cost model to allow backward reference replacement to be efficient.
22 to the cost[0..len) array. */
24 size_t pos, size_t len, size_t mask, const uint8_t* data, float* cost);
|
| backward_references_hq.c | 48 stub.u.cost = kInfinity;
76 /* Histogram based cost model for zopflification. */
104 BROTLI_BOOL literal_histogram, float* cost) {
123 cost[i] = missing_symbol_cost;
128 cost[i] = log2sum - (float)FastLog2(histogram[i]);
131 if (cost[i] < 1) cost[i] = 1;
246 /* REQUIRES: cost < kInfinity, nodes[start_pos].cost < kInfinity */
250 size_t short_code, float cost) {
263 float cost; member in struct:PosData
488 const float cost = (cmdcode < 128 ? base_cost : dist_cost) + local
541 const float cost = dist_cost + (float)GetCopyExtra(copycode) + local
[all...] |
| block_splitter_inc.h | 71 double* cost,
97 memset(cost, 0, sizeof(cost[0]) * num_histograms);
99 /* After each iteration of this loop, cost[k] will contain the difference
100 between the minimum cost of arriving at the current byte position using
101 entropy code k, and the minimum cost of arriving at the current byte
102 position. This difference is capped at the block switch cost, and if it
103 reaches block switch cost, it means that when we trace back from the last
114 cost[k] += insert_cost[insert_cost_ix + k];
115 if (cost[k] < min_cost)
[all...] |
| literal_cost.c | 7 /* Literal cost model to allow backward reference replacement to be efficient.
57 const uint8_t* data, float* cost) {
122 cost[i] = (float)lit_cost;
128 const uint8_t* data, float* cost) {
130 EstimateBitCostsForLiteralsUTF8(pos, len, mask, data, cost);
167 cost[i] = (float)lit_cost;
|
| backward_references_hq.h | 51 pass |cost| it used to store the goal function. When node is processed its
52 |cost| is invalidated in favor of |shortcut|. On path back-tracing pass
55 /* Smallest cost to get to this byte from the beginning, as found so far. */
56 float cost; member in union:ZopfliNode::__anon5332
76 For each i in [1..num_bytes], if nodes[i].cost < kInfinity, then
79 (3) nodes[i - nodes[i].command_length()].cost < kInfinity */
|
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r600/sb/ |
| sb_shader.h | 59 unsigned cost; member in struct:r600_sb::ra_edge
61 ra_edge(value *a, value *b, unsigned cost) : a(a), b(b), cost(cost) {}
104 unsigned cost; member in struct:r600_sb::ra_chunk
107 ra_chunk() : values(), flags(), cost(), pin() {}
126 ra_constraint(constraint_kind kind) : kind(kind), cost(0) {}
130 unsigned cost; member in class:r600_sb::ra_constraint
145 return t1->cost > t2->cost;
[all...] |
| sb_ra_coalesce.cpp | 44 void coalescer::add_edge(value* a, value* b, unsigned cost) {
46 edges.insert(new ra_edge(a,b, cost));
107 c1->cost += c2->cost + e->cost;
154 c1->cost += e->cost;
176 sblog << " cost = " << e->cost << "\n";
202 sblog << " ra_chunk cost = " << c->cost << " : "
255 unsigned cost = 0; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r600/sb/ |
| sb_shader.h | 59 unsigned cost; member in struct:r600_sb::ra_edge
61 ra_edge(value *a, value *b, unsigned cost) : a(a), b(b), cost(cost) {}
104 unsigned cost; member in struct:r600_sb::ra_chunk
107 ra_chunk() : values(), flags(), cost(), pin() {}
126 ra_constraint(constraint_kind kind) : kind(kind), cost(0) {}
130 unsigned cost; member in class:r600_sb::ra_constraint
145 return t1->cost > t2->cost;
[all...] |
| sb_ra_coalesce.cpp | 44 void coalescer::add_edge(value* a, value* b, unsigned cost) {
46 edges.insert(new ra_edge(a,b, cost));
107 c1->cost += c2->cost + e->cost;
154 c1->cost += e->cost;
176 sblog << " cost = " << e->cost << "\n";
202 sblog << " ra_chunk cost = " << c->cost << " : "
255 unsigned cost = 0; local
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/freedreno/ |
| freedreno_autotune.h | 42 * then the GMEM path will at least not cost more memory bandwidth than
45 * (2) If there is no clear, GMEM could potentially cost *more* bandwidth
167 uint32_t cost; member in struct:fd_batch_result
|
| freedreno_autotune.c | 203 batch->autotune_result->cost = batch->cost;
229 /* Cost-per-sample is an estimate for the average number of reads+
232 float sample_cost = batch->cost;
|
| freedreno_batch.h | 117 /* A calculated "draw cost" value for the batch, which tries to
122 * cost += num_mrt;
124 * cost += num_mrt;
126 * cost++;
128 * cost++;
142 unsigned cost; member in struct:fd_batch
|
| /xsrc/external/mit/MesaLib/dist/src/panfrost/util/ |
| lcra.h | 103 lcra_set_node_spill_cost(struct lcra_state *l, unsigned node, signed cost);
|
| lcra.c | 200 /* Register spilling is implemented with a cost-benefit system. Costs are set
204 lcra_set_node_spill_cost(struct lcra_state *l, unsigned node, signed cost)
207 l->spill_cost[node] = cost;
237 float cost = (l->spill_cost[i] + 1); local
238 float benefit = constraints / cost;
|
| /xsrc/external/mit/MesaLib.old/dist/src/util/ |
| register_allocate.h | 92 void ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost);
|
| register_allocate.c | 68 * up front and stored in a 2-dimensional array, so that the cost of
155 * approximate cost of spilling this node.
735 * Returns a node number to be spilled according to the cost/benefit using
751 float cost = g->nodes[n].spill_cost; local
754 if (cost <= 0.0f)
762 if (benefit / cost > best_benefit) {
763 best_benefit = benefit / cost;
772 * Only nodes with a spill cost set (cost != 0.0) will be considered
776 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost)
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/util/ |
| register_allocate.h | 132 void ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost);
|
| register_allocate.c | 68 * up front and stored in a 2-dimensional array, so that the cost of
1012 * Returns a node number to be spilled according to the cost/benefit using
1028 float cost = g->nodes[n].spill_cost; local
1031 if (cost <= 0.0f)
1039 if (benefit / cost > best_benefit) {
1040 best_benefit = benefit / cost;
1049 * Only nodes with a spill cost set (cost != 0.0) will be considered
1053 ra_set_node_spill_cost(struct ra_graph *g, unsigned int n, float cost)
1055 g->nodes[n].spill_cost = cost;
[all...] |
| /xsrc/external/mit/xorg-server/dist/exa/ |
| exa_offscreen.c | 26 * cost is found and evicted in order to make room for the new allocation.
94 unsigned cost, best_cost; local
100 cost = 0;
118 cost = 0;
124 cost += end->eviction_cost;
128 /* Check the cost, update best */
129 if (avail >= real_size && cost < best_cost) {
131 best_cost = cost;
135 cost -= begin->eviction_cost;
|
| /xsrc/external/mit/xorg-server.old/dist/exa/ |
| exa_offscreen.c | 26 * cost is found and evicted in order to make room for the new allocation.
95 unsigned cost, best_cost; local
101 cost = 0;
121 cost = 0;
127 cost += end->eviction_cost;
131 /* Check the cost, update best */
132 if (avail >= real_size && cost < best_cost) {
134 best_cost = cost;
138 cost -= begin->eviction_cost;
|
| /xsrc/external/mit/MesaLib/dist/src/amd/compiler/ |
| aco_statistics.cpp | 203 int32_t cost = 0; local
205 cost = MAX2(cost, res_available[(int)perf.rsrc0] - cur_cycle);
207 cost = MAX2(cost, res_available[(int)perf.rsrc1] - cur_cycle);
209 return cost;
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_loop_analyze.c | 135 /** Calculate an estimated cost in number of instructions
154 unsigned cost = 1; local
160 cost *= 3;
170 return cost;
184 cost *= 20;
188 cost *= 100;
190 return cost;
198 return cost * 100;
201 return cost * 5;
204 return cost;
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/vc4/ |
| vc4_qir_schedule.c | 409 int cost = 0; local
413 cost--;
429 cost++;
432 return cost;
536 fprintf(stderr, " (%d cost)\n",
634 fprintf(stderr, " (%d cost)\n",
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/vc4/ |
| vc4_qir_schedule.c | 409 int cost = 0; local
413 cost--;
429 cost++;
432 return cost;
536 fprintf(stderr, " (%d cost)\n",
634 fprintf(stderr, " (%d cost)\n",
|
| /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/ |
| bi_schedule.c | 971 * we seek to maximize a cost function on a subset of the worklist satisfying a
974 * whitepaper. The cost function is a heuristic. */
1086 signed cost = 0; local
1091 cost++;
1096 * cost) */
1098 cost--;
1102 cost -= 2;
1104 return cost;
1123 signed cost = bi_instr_cost(instr, tuple); local
1130 if (cost <= best_cost)
[all...] |
