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

/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dmvcur.c58 * Make_seq_best() swaps the values of the pointers if s1->cost > s2->cost.
61 if (s1->cost > s2->cost) { \
67 #define zero_seq(seq) ((seq)->end = (seq)->vec, (seq)->cost = 0)
72 int cost; /* cost of vector */ member in struct:Sequence
83 if (seq1->cost >= __MOVE_INFINITY || seq2->cost >= __MOVE_INFINITY)
84 seq1->cost
438 cost(char *cap, int index, int p1, int p2) function
[all...]
H A Ddoupdate.c73 short cost; member in struct:cost_op
96 static int cost(int, int);
780 * This is a modified Gosling cost algorithm that takes into account
792 cost(int fr, int lr) function
803 * Prepare initial row and column of cost matrix.
811 LC(fr, fr).cost = MOVE_COST;
814 LC(fr, nr).cost = cc * INSERT_COST;
818 LC(nr, fr).cost = cc * DELETE_COST;
827 lcp->cost = LC(or, nr).cost;
[all...]
/illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dmvcur.c54 * Make_seq_best() swaps the values of the pointers if s1->cost > s2->cost.
57 if (s1->cost > s2->cost) { \
63 #define zero_seq(seq) ((seq)->end = (seq)->vec, (seq)->cost = 0)
68 int cost; /* cost of vector */ member in struct:Sequence
80 if (seq1->cost >= __MOVE_INFINITY || seq2->cost >= __MOVE_INFINITY)
81 seq1->cost
451 cost(cap, index, p1, p2) function
[all...]
H A Ddoupdate.c75 short cost; member in struct:cost_op
95 STATIC int cost(int, int);
295 * along the line and jump only when the cost of redrawing
299 /* First time addressing this row or cost of
649 * This is a modified Gosling cost algorithm that takes into account
656 cost(fr, lr) function
666 /* Prepare initial row and column of cost matrix.
674 LC(fr,fr).cost = 0;
677 LC(fr,nr).cost = cc * 3;
681 LC(nr,fr).cost
[all...]
/illumos-gate/usr/src/cmd/sh/
H A Dhash.h62 unsigned char cost; member in struct:entry
H A Dhashserv.c42 static unsigned char cost; variable
107 h->cost = 0;
127 hentry.cost = 0;
146 h->cost += cost;
203 prn_buff(h->cost);
213 prs_buff(_gettext("hits cost command\n"));
261 hentry.cost = 0;
406 cost = 0;
419 cost
[all...]
/illumos-gate/usr/src/cmd/vi/port/
H A Dex_tty.c238 costCM = cost(tparm(cursor_address, 10, 8));
239 costSR = cost(scroll_reverse);
240 costAL = cost(insert_line);
241 costDP = cost(tparm(parm_down_cursor, 10));
242 costLP = cost(tparm(parm_left_cursor, 10));
243 costRP = cost(tparm(parm_right_cursor, 10));
244 costCE = cost(clr_eol);
245 costCD = cost(clr_eos);
335 * cost figures out how much (in characters) it costs to send the string
356 cost(unsigne function
[all...]
/illumos-gate/usr/src/common/bzip2/
H A Dcompress.c257 UInt16 cost[BZ_N_GROUPS]; local
354 Calculate the cost of this group as coded
357 for (t = 0; t < nGroups; t++) cost[t] = 0;
384 cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
385 cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
386 cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
392 for (t = 0; t < nGroups; t++) cost[
[all...]
/illumos-gate/usr/src/lib/libcurses/screen/
H A Dmvcur.c91 int hu, /* cost home + relative */
92 hd, /* cost home-down + relative */
93 rl, /* cost relative */
94 cm; /* cost direct cursor motion */
112 /* cost of using cm */
145 /* cost using relative movements */
150 /* cost of homing to upper-left corner first */
154 /* cost of homing to lower-left corner first */
189 int cy, cost; local
193 cost
[all...]
H A Dwrefresh.c803 int x1, x2, blnk, idch, cost, cost_ich1, match; local
809 cost = _COST(dcfixed) + (parm_dch ? _COST(Parm_dch) :
812 cost = _INFINITY;
814 if (match >= cost) {
872 cost = SP->phys_irm ? 0 : _COST(icfixed);
874 cost += _COST(Parm_ich);
877 cost += cost_ich1;
880 cost = _COST(Parm_ich);
882 cost = cost_ich1;
884 if ((cost
[all...]

Completed in 295 milliseconds