Lines Matching defs:cost
58 * 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 */
83 if (seq1->cost >= __MOVE_INFINITY || seq2->cost >= __MOVE_INFINITY)
84 seq1->cost = __MOVE_INFINITY;
89 seq1->cost += seq2->cost;
96 * cost appropriately.
108 seq->cost = __MOVE_INFINITY;
110 /* No parameters, total is cost * p1. */
111 seq->cost += cur_term->_move[op]._cost * p1;
113 /* Cursor motion using parameters have fixed cost. */
114 seq->cost = cur_term->_move[op]._cost;
336 if (__MOVE_INFINITY <= seq->cost)
400 if (col0seq.cost < __MOVE_INFINITY) {
438 cost(char *cap, int index, int p1, int p2)
461 cost(cursor_up, __MOVE_UP, 0, 0);
462 cost(cursor_down, __MOVE_DOWN, 0, 0);
463 cost(cursor_left, __MOVE_LEFT, 0, 0);
464 cost(cursor_right, __MOVE_RIGHT, 0, 0);
465 cost(dest_tabs_magic_smso ? NULL : tab, __MOVE_TAB, 0, 0);
466 cost(dest_tabs_magic_smso ? NULL : back_tab,
469 /* Absolute cursor motion with fixed cost. */
470 cost(cursor_home, __MOVE_HOME, 0, 0);
471 cost(cursor_to_ll, __MOVE_LAST_LINE, 0, 0);
472 cost(carriage_return, __MOVE_RETURN, 0, 0);
474 /* Parameter cursor motion with worst case cost. */
475 cost(row_address, __MOVE_ROW, lines-1, 0);
476 cost(parm_up_cursor, __MOVE_N_UP, lines-1, 0);
477 cost(parm_down_cursor, __MOVE_N_DOWN, lines-1, 0);
478 cost(column_address, __MOVE_COLUMN, columns-1, 0);
479 cost(parm_left_cursor, __MOVE_N_LEFT, columns-1, 0);
480 cost(parm_right_cursor, __MOVE_N_RIGHT, columns-1, 0);
481 cost(cursor_address, __MOVE_ROW_COLUMN, lines-1, columns-1);