Lines Matching refs:row
112 * We can get away with a single array (holding one row's worth of errors)
113 * by using it to store the current row's errors at pixel columns not yet
114 * processed, but the next row's errors at columns already processed. We
159 int row_index; /* cur row's vertical index in dither matrix */
164 boolean on_odd_row; /* flag to remember which row we are on */
292 /* The colors are ordered in the map in standard row-major order, */
467 int row;
472 for (row = 0; row < num_rows; row++) {
473 ptrin = input_buf[row];
474 ptrout = output_buf[row];
497 int row;
501 for (row = 0; row < num_rows; row++) {
502 ptrin = input_buf[row];
503 ptrout = output_buf[row];
523 int * dither; /* points to active row of dither matrix */
527 int row;
531 for (row = 0; row < num_rows; row++) {
533 jzero_far((void FAR *) output_buf[row],
537 input_ptr = input_buf[row] + ci;
538 output_ptr = output_buf[row];
557 /* Advance row index for next row */
576 int * dither0; /* points to active row of dither matrix */
580 int row;
584 for (row = 0; row < num_rows; row++) {
586 input_ptr = input_buf[row];
587 output_ptr = output_buf[row];
630 int row;
636 for (row = 0; row < num_rows; row++) {
638 jzero_far((void FAR *) output_buf[row],
641 input_ptr = input_buf[row] + ci;
642 output_ptr = output_buf[row];
644 /* work right to left in this row */
651 /* work left to right in this row */
660 /* and no error propagated to row below yet */
