Lines Matching refs:cost
54 * 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 */
80 if (seq1->cost >= __MOVE_INFINITY || seq2->cost >= __MOVE_INFINITY)
81 seq1->cost = __MOVE_INFINITY;
86 seq1->cost += seq2->cost;
93 * cost appropriately.
107 seq->cost = __MOVE_INFINITY;
109 /* No parameters, total is cost * p1. */
110 seq->cost += cur_term->_move[op]._cost * p1;
112 /* Cursor motion using parameters have fixed cost. */
113 seq->cost = cur_term->_move[op]._cost;
340 if (__MOVE_INFINITY <= seq->cost)
412 if (col0seq.cost < __MOVE_INFINITY) {
451 cost(cap, index, p1, p2)
476 cost(cursor_up, __MOVE_UP, 0, 0);
477 cost(cursor_down, __MOVE_DOWN, 0, 0);
478 cost(cursor_left, __MOVE_LEFT, 0, 0);
479 cost(cursor_right, __MOVE_RIGHT, 0, 0);
480 cost(dest_tabs_magic_smso ? (char *) 0 : tab, __MOVE_TAB, 0, 0);
481 cost(
486 /* Absolute cursor motion with fixed cost. */
487 cost(cursor_home, __MOVE_HOME, 0, 0);
488 cost(cursor_to_ll, __MOVE_LAST_LINE, 0, 0);
489 cost(carriage_return, __MOVE_RETURN, 0, 0);
491 /* Parameter cursor motion with worst case cost. */
492 cost(row_address, __MOVE_ROW, lines-1, 0);
493 cost(parm_up_cursor, __MOVE_N_UP, lines-1, 0);
494 cost(parm_down_cursor, __MOVE_N_DOWN, lines-1, 0);
495 cost(column_address, __MOVE_COLUMN, columns-1, 0);
496 cost(parm_left_cursor, __MOVE_N_LEFT, columns-1, 0);
497 cost(parm_right_cursor, __MOVE_N_RIGHT, columns-1, 0);
498 cost(cursor_address, __MOVE_ROW_COLUMN, lines-1, columns-1);