Lines Matching defs:row
116 * We can get away with a single array (holding one row's worth of errors)
117 * by using it to store the current row's errors at pixel columns not yet
118 * processed, but the next row's errors at columns already processed. We
160 int row_index; /* cur row's vertical index in dither matrix */
165 boolean on_odd_row; /* flag to remember which row we are on */
296 /* The colors are ordered in the map in standard row-major order, */
471 int row;
476 for (row = 0; row < num_rows; row++) {
477 ptrin = input_buf[row];
478 ptrout = output_buf[row];
501 int row;
505 for (row = 0; row < num_rows; row++) {
506 ptrin = input_buf[row];
507 ptrout = output_buf[row];
527 int *dither; /* points to active row of dither matrix */
531 int row;
535 for (row = 0; row < num_rows; row++) {
537 jzero_far((void *)output_buf[row], (size_t)(width * sizeof(JSAMPLE)));
540 input_ptr = input_buf[row] + ci;
541 output_ptr = output_buf[row];
561 /* Advance row index for next row */
580 int *dither0; /* points to active row of dither matrix */
584 int row;
588 for (row = 0; row < num_rows; row++) {
590 input_ptr = input_buf[row];
591 output_ptr = output_buf[row];
631 int row;
637 for (row = 0; row < num_rows; row++) {
639 jzero_far((void *)output_buf[row], (size_t)(width * sizeof(JSAMPLE)));
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 */