Lines Matching full:row
24 // by calling AdvanceRow. It will keep track of which row in the buffer it
28 // The number of pixels in each row is given in |sourceRowPixelWidth|.
44 // Moves to the next row in the buffer, returning a pointer to the beginning
47 unsigned char* row = &fBuffer[fNextRow * fRowByteWidth];
50 // Set the pointer to the next row to use, wrapping around if necessary.
55 return row;
66 // Row 0 Coord 8
67 // Row 1 Coord 9
68 // Row 2 Coord 6 <- fNextRow = 2, fNextRowCoordinate = 10.
69 // Row 3 Coord 7
71 // The "next" row is also the first (lowest) coordinate. This computation
81 // Advance to the next row, wrapping if necessary.
94 // Number of bytes per row in the |buffer|.
100 // The next row index we should write into. This wraps around as the
105 // new row is appended and does not wrap.
112 // Convolves horizontally along a single row. The row data is given in
118 // Loop over each pixel on this row in the output image.
126 // Compute the first pixel in this row that the filter affects. It will
130 // Apply the filter to the row to get the destination pixel in |accum|.
161 // Does vertical convolution to produce one output row. The filter values and
163 // of the rows pointed to in the |sourceDataRows| array, with each row
176 // Compute the number of bytes over in each row that the current column
214 // We only need to do this when generating the final output row (here).
345 // The next row in the input that we will generate a horizontally
346 // convolved row for. If the filter doesn't start at the beginning of the
349 // row for convolution as the first pixel for the first vertical filter.
355 // We loop over each row in the input doing a horizontal convolution. This
361 // simultaneously. We also pad each row in row buffer to be aligned-up to
363 // TODO(jiesun): We do not use aligned load from row buffer in vertical
372 // Loop over every possible output row, processing just enough horizontal
384 // we fall back to the C++ implementation for the last row.
385 // If the last row is less than 3 pixels wide, we may have to fall
414 // Check if we need to avoid SSE2 for this row.
436 // Compute where in the output image this row of final data will go.
