Lines Matching defs:rows

158   JDIMENSION maxaccess;         /* max rows accessed by access_virt_sarray */
174 JDIMENSION maxaccess; /* max rows accessed by access_virt_barray */
342 * deliberately bunch rows together to ensure a large request size.
390 * blocks, we allocate the sample rows in groups of as many rows as possible
393 * this chunking of rows. The rowsperchunk value is left in the mem manager
409 /* Calculate max # of rows allowed in one allocation chunk */
424 /* Get the rows themselves (large objects) */
457 /* Calculate max # of rows allowed in one allocation chunk */
472 /* Get the rows themselves (large objects) */
493 * (as wide as the image, but just a few rows high). Full-image-sized buffers
501 * the maximum number of rows that will be accessed at once. The in-memory
514 * any newly accessed rows, if pre-zeroing was requested.
596 /* Compute the minimum space needed (maxaccess rows in each buffer)
697 long bytesperrow, file_offset, byte_count, rows, thisrow, i;
704 rows = MIN((long) ptr->rowsperchunk, (long) ptr->rows_in_mem - i);
707 rows = MIN(rows, (long) ptr->first_undef_row - thisrow);
709 rows = MIN(rows, (long) ptr->rows_in_array - thisrow);
710 if (rows <= 0) /* this chunk might be past end of file! */
712 byte_count = rows * bytesperrow;
730 long bytesperrow, file_offset, byte_count, rows, thisrow, i;
737 rows = MIN((long) ptr->rowsperchunk, (long) ptr->rows_in_mem - i);
740 rows = MIN(rows, (long) ptr->first_undef_row - thisrow);
742 rows = MIN(rows, (long) ptr->rows_in_array - thisrow);
743 if (rows <= 0) /* this chunk might be past end of file! */
745 byte_count = rows * bytesperrow;
764 /* and extending for num_rows rows. writable is true if */
849 /* and extending for num_rows rows. writable is true if */