Lines Matching refs:row
40 // by calling AdvanceRow. It will keep track of which row in the buffer it
44 // The number of pixels in each row is given in |source_row_pixel_width|.
60 // Moves to the next row in the buffer, returning a pointer to the beginning
63 unsigned char* row = &buffer_[next_row_ * row_byte_width_];
66 // Set the pointer to the next row to use, wrapping around if necessary.
70 return row;
81 // Row 0 Coord 8
82 // Row 1 Coord 9
83 // Row 2 Coord 6 <- next_row_ = 2, next_row_coordinate_ = 10.
84 // Row 3 Coord 7
86 // The "next" row is also the first (lowest) coordinate. This computation
96 // Advance to the next row, wrapping if necessary.
108 // Number of bytes per row in the |buffer_|.
114 // The next row index we should write into. This wraps around as the
119 // new row is appended and does not wrap.
126 // Convolves horizontally along a single row. The row data is given in
132 // Loop over each pixel on this row in the output image.
140 // Compute the first pixel in this row that the filter affects. It will
144 // Apply the filter to the row to get the destination pixel in |accum|.
172 // Does vertical convolution to produce one output row. The filter values and
174 // of the rows pointed to in the |source_data_rows| array, with each row
187 // Compute the number of bytes over in each row that the current column
223 // We only need to do this when generating the final output row (here).
398 // The next row in the input that we will generate a horizontally
399 // convolved row for. If the filter doesn't start at the beginning of the
402 // row for convolution as the first pixel for the first vertical filter.
408 // We loop over each row in the input doing a horizontal convolution. This
414 // simultaneously. We also padding each row in row buffer to be aligned-up to
416 // TODO(jiesun): We do not use aligned load from row buffer in vertical
425 // Loop over every possible output row, processing just enough horizontal
437 // we fall back to the C++ implementation for the last row.
438 // If the last row is less than 3 pixels wide, we may have to fall
467 // Check if we need to avoid SSE2 for this row.
489 // Compute where in the output image this row of final data will go.
