Lines Matching defs:size
287 * be up to the optimal hardware IO size
306 * Set the initial window size, round to next power of 2 and square
307 * for small size, x 4 for medium, and x 2 for large
311 static unsigned long get_init_ra_size(unsigned long size, unsigned long max)
313 unsigned long newsize = roundup_pow_of_two(size);
326 * Get the previous window size, ramp it up, and
327 * return it as the new window size.
332 unsigned long cur = ra->size;
348 * |------------------- size -------------------->|
357 * will be equal to size, for maximum pipelining.
361 * page at (start+size-async_size) with PG_readahead, and use it as readahead
373 * read is about to happen and the window is immediately set to the initial size
374 * based on I/O request size and the max_readahead.
376 * The code ramps up the readahead size aggressively at first, but slow down as
407 pgoff_t size;
409 size = count_history_pages(mapping, index, max);
415 if (size <= req_size)
422 if (size >= index)
423 size *= 2;
426 ra->size = min(size + req_size, max);
447 * be up to the optimal hardware IO size
462 if ((index == (ra->start + ra->size - ra->async_size) ||
463 index == (ra->start + ra->size))) {
464 ra->start += ra->size;
465 ra->size = get_next_ra_size(ra, max_pages);
466 ra->async_size = ra->size;
474 * readahead size. Ramp it up and use it as the new readahead size.
488 ra->size = start - index; /* old async_size */
489 ra->size += req_size;
490 ra->size = get_next_ra_size(ra, max_pages);
491 ra->async_size = ra->size;
527 ra->size = get_init_ra_size(req_size, max_pages);
528 ra->async_size = ra->size > req_size ? ra->size - req_size : ra->size;
537 if (index == ra->start && ra->size == ra->async_size) {
539 if (ra->size + add_pages <= max_pages) {
541 ra->size += add_pages;
543 ra->size = max_pages;
549 do_page_cache_ra(ractl, ra->size, ra->async_size);