Lines Matching refs:pass
167 * length, and does not need to be null terminated. To be safe, pass the
199 /* This is used below to find the size of an image to pass to png_deflate_claim,
221 int pass;
223 for (cb_base=0, pass=0; pass<=6; ++pass)
225 png_uint_32 pw = PNG_PASS_COLS(w, pass);
228 cb_base += (PNG_ROWBYTES(pd, pw)+1) * PNG_PASS_ROWS(h, pass);
365 * happening just pass 32768 as the data_size parameter. Notice that zlib
494 * input. The result is buffered rather than using the two-pass algorithm
1893 /* Arrays to facilitate easy interlacing - use pass (0 - 6) as index */
1976 /* If interlaced, we need to set up width and height of pass */
2008 /* Arrays to facilitate easy interlacing - use pass (0 - 6) as index */
2033 /* If interlaced, go to next pass */
2039 png_ptr->pass++;
2044 /* Loop until we find a non-zero width or height pass */
2047 png_ptr->pass++;
2049 if (png_ptr->pass >= 7)
2053 png_pass_inc[png_ptr->pass] - 1 -
2054 png_pass_start[png_ptr->pass]) /
2055 png_pass_inc[png_ptr->pass];
2058 png_pass_yinc[png_ptr->pass] - 1 -
2059 png_pass_ystart[png_ptr->pass]) /
2060 png_pass_yinc[png_ptr->pass];
2069 /* Reset the row above the image for the next pass */
2070 if (png_ptr->pass < 7)
2088 /* Pick out the correct pixels for the interlace pass.
2091 * correct pixels for the pass. As the row gets compacted,
2096 png_do_write_interlace(png_row_infop row_info, png_bytep row, int pass)
2098 /* Arrays to facilitate easy interlacing - use pass (0 - 6) as index */
2108 /* We don't have to do anything on the last pass (6) */
2109 if (pass < 6)
2128 for (i = png_pass_start[pass]; i < row_width;
2129 i += png_pass_inc[pass])
2166 for (i = png_pass_start[pass]; i < row_width;
2167 i += png_pass_inc[pass])
2202 for (i = png_pass_start[pass]; i < row_width;
2203 i += png_pass_inc[pass])
2240 for (i = png_pass_start[pass]; i < row_width;
2241 i += png_pass_inc[pass])
2258 png_pass_inc[pass] - 1 -
2259 png_pass_start[pass]) /
2260 png_pass_inc[pass];