Searched refs:cost (Results 1 - 4 of 4) sorted by relevance

/ast/src/lib/libbz/
H A Dcompress.c260 UInt16 cost[BZ_N_GROUPS]; local
343 Calculate the cost of this group as coded
346 for (t = 0; t < nGroups; t++) cost[t] = 0;
360 cost[0] = cost0; cost[1] = cost1; cost[2] = cost2;
361 cost[3] = cost3; cost[4] = cost4; cost[5] = cost5;
365 for (t = 0; t < nGroups; t++) cost[
[all...]
/ast/src/lib/libvcodex/Vchuff/
H A Dvchuffpart.c35 size_t ctab; /* est. cost to encode a Huffman table */
39 /* compute the byte frequencies and encoding cost of a string */
120 double le, lc, rc, cost; local
124 /* cost of coding the entire data set */
125 cost = pt->ctab + size*vclog(size) - re;
149 if((lc + rc) < cost)
185 /* estimate the cost of emitting a Huffman table */
H A Dvchuffgroup.c39 ssize_t cost; /* cost of encoding */ member in struct:_table_s
149 grp->cmpsz = (dtsz < VCH_SIZE ? VCH_SIZE : dtsz)*VC_BITSIZE; /* starting cost */
266 tbl[t].cost = 0;
275 { if(tbl[i].cost <= z)
277 z = tbl[p = i].cost;
279 if(p < 0) /* if p >= 0, it's the highest cost table */
296 tbl[p].cost = tbl[q].cost = 0;
315 tbl[k].cost
[all...]
/ast/src/cmd/pzip/
H A Dpin.c126 " [+0x0020?Enable reorder skip/cost trace.]"
992 sfprintf(sfstderr, "reorder cost %6u %u\n", state.map[tp->member[j]], cst[tp->member[j]]);
1137 Tsp_cost_t** cost; local
1141 if (!(cost = newof(0, Tsp_cost_t*, row, row * row * sizeof(Tsp_cost_t))))
1142 error(ERROR_SYSTEM|3, "out of space [%d X %d cost matrix]", row, row);
1143 v = (Tsp_cost_t*)(cost + row);
1146 cost[i] = v;
1158 sfprintf(sfstderr, "compute the tsp cost matrix\n");
1167 cost[i][j] = minof(together[i][j], apart[i][j]);
1179 if (!(tsp = tspopen(&disc, cost, ro
[all...]

Completed in 49 milliseconds