4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2011, 2014, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
38 * Lustre Lite I/O page cache routines shared by different kernel revs
41 #include <linux/kernel.h>
43 #include <linux/string.h>
44 #include <linux/stat.h>
45 #include <linux/errno.h>
46 #include <linux/unistd.h>
47 #include <linux/writeback.h>
48 #include <asm/uaccess.h>
51 #include <linux/stat.h>
52 #include <asm/uaccess.h>
54 #include <linux/pagemap.h>
55 /* current_is_kswapd() */
56 #include <linux/swap.h>
58 #define DEBUG_SUBSYSTEM S_LLITE
60 #include <obd_cksum.h>
61 #include "llite_internal.h"
62 #include <lustre_compat.h>
64 static void ll_ra_stats_inc_sbi(struct ll_sb_info *sbi, enum ra_stat which);
67 * Get readahead pages from the filesystem readahead pool of the client for a
70 * /param sbi superblock for filesystem readahead state ll_ra_info
71 * /param ria per-thread readahead state
72 * /param pages number of pages requested for readahead for the thread.
74 * WARNING: This algorithm is used to reduce contention on sbi->ll_lock.
75 * It should work well if the ra_max_pages is much greater than the single
76 * file's read-ahead window, and not too many threads contending for
77 * these readahead pages.
79 * TODO: There may be a 'global sync problem' if many threads are trying
80 * to get an ra budget that is larger than the remaining readahead pages
81 * and reach here at exactly the same time. They will compute /a ret to
82 * consume the remaining pages, but will fail at atomic_add_return() and
83 * get a zero ra window, although there is still ra space remaining. - Jay */
85 static unsigned long ll_ra_count_get(struct ll_sb_info *sbi,
86 struct ra_io_arg *ria,
87 unsigned long pages, unsigned long min)
89 struct ll_ra_info *ra = &sbi->ll_ra_info;
93 /* If read-ahead pages left are less than 1M, do not do read-ahead,
94 * otherwise it will form small read RPC(< 1M), which hurt server
95 * performance a lot. */
96 ret = min(ra->ra_max_pages - atomic_read(&ra->ra_cur_pages),
98 if (ret < 0 || ret < min_t(long, PTLRPC_MAX_BRW_PAGES, pages))
101 /* If the non-strided (ria_pages == 0) readahead window
102 * (ria_start + ret) has grown across an RPC boundary, then trim
103 * readahead size by the amount beyond the RPC so it ends on an
104 * RPC boundary. If the readahead window is already ending on
105 * an RPC boundary (beyond_rpc == 0), or smaller than a full
106 * RPC (beyond_rpc < ret) the readahead size is unchanged.
107 * The (beyond_rpc != 0) check is skipped since the conditional
108 * branch is more expensive than subtracting zero from the result.
110 * Strided read is left unaligned to avoid small fragments beyond
111 * the RPC boundary from needing an extra read RPC. */
112 if (ria->ria_pages == 0) {
113 long beyond_rpc = (ria->ria_start + ret) % PTLRPC_MAX_BRW_PAGES;
114 if (/* beyond_rpc != 0 && */ beyond_rpc < ret)
118 if (atomic_add_return(ret, &ra->ra_cur_pages) > ra->ra_max_pages) {
119 atomic_sub(ret, &ra->ra_cur_pages);
125 /* override ra limit for maximum performance */
126 atomic_add(min - ret, &ra->ra_cur_pages);
132 void ll_ra_count_put(struct ll_sb_info *sbi, unsigned long len)
134 struct ll_ra_info *ra = &sbi->ll_ra_info;
135 atomic_sub(len, &ra->ra_cur_pages);
138 static void ll_ra_stats_inc_sbi(struct ll_sb_info *sbi, enum ra_stat which)
140 LASSERTF(which >= 0 && which < _NR_RA_STAT, "which: %u\n", which);
141 lprocfs_counter_incr(sbi->ll_ra_stats, which);
144 void ll_ra_stats_inc(struct inode *inode, enum ra_stat which)
146 struct ll_sb_info *sbi = ll_i2sbi(inode);
147 ll_ra_stats_inc_sbi(sbi, which);
150 #define RAS_CDEBUG(ras) \
152 "lrp %lu cr %lu cp %lu ws %lu wl %lu nra %lu r %lu ri %lu" \
153 "csr %lu sf %lu sp %lu sl %lu \n", \
154 ras->ras_last_readpage, ras->ras_consecutive_requests, \
155 ras->ras_consecutive_pages, ras->ras_window_start, \
156 ras->ras_window_len, ras->ras_next_readahead, \
157 ras->ras_requests, ras->ras_request_index, \
158 ras->ras_consecutive_stride_requests, ras->ras_stride_offset, \
159 ras->ras_stride_pages, ras->ras_stride_length)
161 static int index_in_window(unsigned long index, unsigned long point,
162 unsigned long before, unsigned long after)
164 unsigned long start = point - before, end = point + after;
171 return start <= index && index <= end;
174 void ll_ras_enter(struct file *f)
176 struct ll_file_data *fd = LUSTRE_FPRIVATE(f);
177 struct ll_readahead_state *ras = &fd->fd_ras;
179 spin_lock(&ras->ras_lock);
181 ras->ras_request_index = 0;
182 ras->ras_consecutive_requests++;
183 spin_unlock(&ras->ras_lock);
187 * Initiates read-ahead of a page with given index.
189 * \retval +ve: page was already uptodate so it will be skipped
191 * \retval -ve: page wasn't added to \a queue for error;
192 * \retval 0: page was added into \a queue for read ahead.
194 static int ll_read_ahead_page(const struct lu_env *env, struct cl_io *io,
195 struct cl_page_list *queue, pgoff_t index)
197 struct cl_object *clob = io->ci_obj;
198 struct inode *inode = vvp_object_inode(clob);
200 struct cl_page *page;
201 struct vvp_page *vpg;
202 enum ra_stat which = _NR_RA_STAT; /* keep gcc happy */
204 const char *msg = NULL;
207 vmpage = grab_cache_page_nowait(inode->i_mapping, index);
208 if (vmpage == NULL) {
209 which = RA_STAT_FAILED_GRAB_PAGE;
210 msg = "g_c_p_n failed";
211 GOTO(out, rc = -EBUSY);
214 /* Check if vmpage was truncated or reclaimed */
215 if (vmpage->mapping != inode->i_mapping) {
216 which = RA_STAT_WRONG_GRAB_PAGE;
217 msg = "g_c_p_n returned invalid page";
218 GOTO(out, rc = -EBUSY);
221 page = cl_page_find(env, clob, vmpage->index, vmpage, CPT_CACHEABLE);
223 which = RA_STAT_FAILED_GRAB_PAGE;
224 msg = "cl_page_find failed";
225 GOTO(out, rc = PTR_ERR(page));
228 lu_ref_add(&page->cp_reference, "ra", current);
229 cl_page_assume(env, io, page);
230 vpg = cl2vvp_page(cl_object_page_slice(clob, page));
231 if (!vpg->vpg_defer_uptodate && !PageUptodate(vmpage)) {
232 vpg->vpg_defer_uptodate = 1;
233 vpg->vpg_ra_used = 0;
234 cl_page_list_add(queue, page);
236 /* skip completed pages */
237 cl_page_unassume(env, io, page);
238 /* This page is already uptodate, returning a positive number
239 * to tell the callers about this */
243 lu_ref_del(&page->cp_reference, "ra", current);
244 cl_page_put(env, page);
247 if (vmpage != NULL) {
250 page_cache_release(vmpage);
253 ll_ra_stats_inc(inode, which);
254 CDEBUG(D_READA, "%s\n", msg);
261 #define RIA_DEBUG(ria) \
262 CDEBUG(D_READA, "rs %lu re %lu ro %lu rl %lu rp %lu\n", \
263 ria->ria_start, ria->ria_end, ria->ria_stoff, ria->ria_length,\
266 /* Limit this to the blocksize instead of PTLRPC_BRW_MAX_SIZE, since we don't
267 * know what the actual RPC size is. If this needs to change, it makes more
268 * sense to tune the i_blkbits value for the file based on the OSTs it is
269 * striped over, rather than having a constant value for all files here. */
271 /* RAS_INCREASE_STEP should be (1UL << (inode->i_blkbits - PAGE_CACHE_SHIFT)).
272 * Temprarily set RAS_INCREASE_STEP to 1MB. After 4MB RPC is enabled
273 * by default, this should be adjusted corresponding with max_read_ahead_mb
274 * and max_read_ahead_per_file_mb otherwise the readahead budget can be used
275 * up quickly which will affect read performance siginificantly. See LU-2816 */
276 #define RAS_INCREASE_STEP(inode) (ONE_MB_BRW_SIZE >> PAGE_CACHE_SHIFT)
278 static inline int stride_io_mode(struct ll_readahead_state *ras)
280 return ras->ras_consecutive_stride_requests > 1;
282 /* The function calculates how much pages will be read in
283 * [off, off + length], in such stride IO area,
284 * stride_offset = st_off, stride_lengh = st_len,
285 * stride_pages = st_pgs
287 * |------------------|*****|------------------|*****|------------|*****|....
290 * |----- st_len -----|
292 * How many pages it should read in such pattern
293 * |-------------------------------------------------------------|
295 * |<------ length ------->|
297 * = |<----->| + |-------------------------------------| + |---|
298 * start_left st_pgs * i end_left
301 stride_pg_count(pgoff_t st_off, unsigned long st_len, unsigned long st_pgs,
302 unsigned long off, unsigned long length)
304 __u64 start = off > st_off ? off - st_off : 0;
305 __u64 end = off + length > st_off ? off + length - st_off : 0;
306 unsigned long start_left = 0;
307 unsigned long end_left = 0;
308 unsigned long pg_count;
310 if (st_len == 0 || length == 0 || end == 0)
313 start_left = do_div(start, st_len);
314 if (start_left < st_pgs)
315 start_left = st_pgs - start_left;
319 end_left = do_div(end, st_len);
320 if (end_left > st_pgs)
323 CDEBUG(D_READA, "start "LPU64", end "LPU64" start_left %lu end_left %lu \n",
324 start, end, start_left, end_left);
327 pg_count = end_left - (st_pgs - start_left);
329 pg_count = start_left + st_pgs * (end - start - 1) + end_left;
331 CDEBUG(D_READA, "st_off %lu, st_len %lu st_pgs %lu off %lu length %lu"
332 "pgcount %lu\n", st_off, st_len, st_pgs, off, length, pg_count);
337 static int ria_page_count(struct ra_io_arg *ria)
339 __u64 length = ria->ria_end >= ria->ria_start ?
340 ria->ria_end - ria->ria_start + 1 : 0;
342 return stride_pg_count(ria->ria_stoff, ria->ria_length,
343 ria->ria_pages, ria->ria_start,
347 /*Check whether the index is in the defined ra-window */
348 static int ras_inside_ra_window(unsigned long idx, struct ra_io_arg *ria)
350 /* If ria_length == ria_pages, it means non-stride I/O mode,
351 * idx should always inside read-ahead window in this case
352 * For stride I/O mode, just check whether the idx is inside
354 return ria->ria_length == 0 || ria->ria_length == ria->ria_pages ||
355 (idx >= ria->ria_stoff && (idx - ria->ria_stoff) %
356 ria->ria_length < ria->ria_pages);
359 static int ll_read_ahead_pages(const struct lu_env *env,
360 struct cl_io *io, struct cl_page_list *queue,
361 struct ra_io_arg *ria,
362 unsigned long *reserved_pages,
365 struct cl_read_ahead ra = { 0 };
370 LASSERT(ria != NULL);
373 stride_ria = ria->ria_length > ria->ria_pages && ria->ria_pages > 0;
374 for (page_idx = ria->ria_start;
375 page_idx <= ria->ria_end && *reserved_pages > 0; page_idx++) {
376 if (ras_inside_ra_window(page_idx, ria)) {
377 if (ra.cra_end == 0 || ra.cra_end < page_idx) {
378 cl_read_ahead_release(env, &ra);
380 rc = cl_io_read_ahead(env, io, page_idx, &ra);
384 LASSERTF(ra.cra_end >= page_idx,
385 "object: %p, indcies %lu / %lu\n",
386 io->ci_obj, ra.cra_end, page_idx);
389 /* If the page is inside the read-ahead window*/
390 rc = ll_read_ahead_page(env, io, queue, page_idx);
395 } else if (stride_ria) {
396 /* If it is not in the read-ahead window, and it is
397 * read-ahead mode, then check whether it should skip
400 /* FIXME: This assertion only is valid when it is for
401 * forward read-ahead, it will be fixed when backward
402 * read-ahead is implemented */
403 LASSERTF(page_idx >= ria->ria_stoff,
404 "Invalid page_idx %lu rs %lu re %lu ro %lu "
405 "rl %lu rp %lu\n", page_idx,
406 ria->ria_start, ria->ria_end, ria->ria_stoff,
407 ria->ria_length, ria->ria_pages);
408 offset = page_idx - ria->ria_stoff;
409 offset = offset % (ria->ria_length);
410 if (offset > ria->ria_pages) {
411 page_idx += ria->ria_length - offset;
412 CDEBUG(D_READA, "i %lu skip %lu \n", page_idx,
413 ria->ria_length - offset);
419 cl_read_ahead_release(env, &ra);
425 static int ll_readahead(const struct lu_env *env, struct cl_io *io,
426 struct cl_page_list *queue,
427 struct ll_readahead_state *ras, bool hit)
429 struct vvp_io *vio = vvp_env_io(env);
430 struct ll_thread_info *lti = ll_env_info(env);
431 struct cl_attr *attr = vvp_env_thread_attr(env);
432 unsigned long len, mlen = 0, reserved;
433 pgoff_t ra_end, start = 0, end = 0;
435 struct ra_io_arg *ria = <i->lti_ria;
436 struct cl_object *clob;
442 inode = vvp_object_inode(clob);
444 memset(ria, 0, sizeof *ria);
446 cl_object_attr_lock(clob);
447 ret = cl_object_attr_get(env, clob, attr);
448 cl_object_attr_unlock(clob);
454 ll_ra_stats_inc(inode, RA_STAT_ZERO_LEN);
458 spin_lock(&ras->ras_lock);
460 /* Enlarge the RA window to encompass the full read */
461 if (vio->vui_ra_valid &&
462 ras->ras_window_start + ras->ras_window_len <
463 vio->vui_ra_start + vio->vui_ra_count) {
464 ras->ras_window_len = vio->vui_ra_start + vio->vui_ra_count -
465 ras->ras_window_start;
468 /* Reserve a part of the read-ahead window that we'll be issuing */
469 if (ras->ras_window_len > 0) {
471 * Note: other thread might rollback the ras_next_readahead,
472 * if it can not get the full size of prepared pages, see the
473 * end of this function. For stride read ahead, it needs to
474 * make sure the offset is no less than ras_stride_offset,
475 * so that stride read ahead can work correctly.
477 if (stride_io_mode(ras))
478 start = max(ras->ras_next_readahead,
479 ras->ras_stride_offset);
481 start = ras->ras_next_readahead;
482 end = ras->ras_window_start + ras->ras_window_len - 1;
486 unsigned long rpc_boundary;
488 * Align RA window to an optimal boundary.
490 * XXX This would be better to align to cl_max_pages_per_rpc
491 * instead of PTLRPC_MAX_BRW_PAGES, because the RPC size may
492 * be aligned to the RAID stripe size in the future and that
493 * is more important than the RPC size.
495 /* Note: we only trim the RPC, instead of extending the RPC
496 * to the boundary, so to avoid reading too much pages during
498 rpc_boundary = ((end + 1) & (~(PTLRPC_MAX_BRW_PAGES - 1)));
499 if (rpc_boundary > 0)
502 if (rpc_boundary > start)
505 /* Truncate RA window to end of file */
506 end = min(end, (unsigned long)((kms - 1) >> PAGE_CACHE_SHIFT));
508 ras->ras_next_readahead = max(end, end + 1);
511 ria->ria_start = start;
513 /* If stride I/O mode is detected, get stride window*/
514 if (stride_io_mode(ras)) {
515 ria->ria_stoff = ras->ras_stride_offset;
516 ria->ria_length = ras->ras_stride_length;
517 ria->ria_pages = ras->ras_stride_pages;
519 spin_unlock(&ras->ras_lock);
522 ll_ra_stats_inc(inode, RA_STAT_ZERO_WINDOW);
525 len = ria_page_count(ria);
527 ll_ra_stats_inc(inode, RA_STAT_ZERO_WINDOW);
531 CDEBUG(D_READA, DFID": ria: %lu/%lu, bead: %lu/%lu, hit: %d\n",
532 PFID(lu_object_fid(&clob->co_lu)),
533 ria->ria_start, ria->ria_end,
534 vio->vui_ra_valid ? vio->vui_ra_start : 0,
535 vio->vui_ra_valid ? vio->vui_ra_count : 0,
538 /* at least to extend the readahead window to cover current read */
539 if (!hit && vio->vui_ra_valid &&
540 vio->vui_ra_start + vio->vui_ra_count > ria->ria_start) {
541 /* to the end of current read window. */
542 mlen = vio->vui_ra_start + vio->vui_ra_count - ria->ria_start;
543 /* trim to RPC boundary */
544 start = ria->ria_start & (PTLRPC_MAX_BRW_PAGES - 1);
545 mlen = min(mlen, PTLRPC_MAX_BRW_PAGES - start);
548 reserved = ll_ra_count_get(ll_i2sbi(inode), ria, len, mlen);
550 ll_ra_stats_inc(inode, RA_STAT_MAX_IN_FLIGHT);
552 CDEBUG(D_READA, "reserved pages: %lu/%lu/%lu, ra_cur %d, ra_max %lu\n",
554 atomic_read(&ll_i2sbi(inode)->ll_ra_info.ra_cur_pages),
555 ll_i2sbi(inode)->ll_ra_info.ra_max_pages);
557 ret = ll_read_ahead_pages(env, io, queue, ria, &reserved, &ra_end);
560 ll_ra_count_put(ll_i2sbi(inode), reserved);
562 if (ra_end == end + 1 && ra_end == (kms >> PAGE_CACHE_SHIFT))
563 ll_ra_stats_inc(inode, RA_STAT_EOF);
565 /* if we didn't get to the end of the region we reserved from
566 * the ras we need to go back and update the ras so that the
567 * next read-ahead tries from where we left off. we only do so
568 * if the region we failed to issue read-ahead on is still ahead
569 * of the app and behind the next index to start read-ahead from */
570 CDEBUG(D_READA, "ra_end = %lu end = %lu stride end = %lu pages = %d\n",
571 ra_end, end, ria->ria_end, ret);
573 if (ra_end != end + 1) {
574 ll_ra_stats_inc(inode, RA_STAT_FAILED_REACH_END);
575 spin_lock(&ras->ras_lock);
576 if (ra_end < ras->ras_next_readahead &&
577 index_in_window(ra_end, ras->ras_window_start, 0,
578 ras->ras_window_len)) {
579 ras->ras_next_readahead = ra_end;
582 spin_unlock(&ras->ras_lock);
588 static void ras_set_start(struct inode *inode, struct ll_readahead_state *ras,
591 ras->ras_window_start = index & (~(RAS_INCREASE_STEP(inode) - 1));
594 /* called with the ras_lock held or from places where it doesn't matter */
595 static void ras_reset(struct inode *inode, struct ll_readahead_state *ras,
598 ras->ras_last_readpage = index;
599 ras->ras_consecutive_requests = 0;
600 ras->ras_consecutive_pages = 0;
601 ras->ras_window_len = 0;
602 ras_set_start(inode, ras, index);
603 ras->ras_next_readahead = max(ras->ras_window_start, index);
608 /* called with the ras_lock held or from places where it doesn't matter */
609 static void ras_stride_reset(struct ll_readahead_state *ras)
611 ras->ras_consecutive_stride_requests = 0;
612 ras->ras_stride_length = 0;
613 ras->ras_stride_pages = 0;
617 void ll_readahead_init(struct inode *inode, struct ll_readahead_state *ras)
619 spin_lock_init(&ras->ras_lock);
620 ras_reset(inode, ras, 0);
621 ras->ras_requests = 0;
625 * Check whether the read request is in the stride window.
626 * If it is in the stride window, return 1, otherwise return 0.
628 static int index_in_stride_window(struct ll_readahead_state *ras,
631 unsigned long stride_gap;
633 if (ras->ras_stride_length == 0 || ras->ras_stride_pages == 0 ||
634 ras->ras_stride_pages == ras->ras_stride_length)
637 stride_gap = index - ras->ras_last_readpage - 1;
639 /* If it is contiguous read */
641 return ras->ras_consecutive_pages + 1 <= ras->ras_stride_pages;
643 /* Otherwise check the stride by itself */
644 return (ras->ras_stride_length - ras->ras_stride_pages) == stride_gap &&
645 ras->ras_consecutive_pages == ras->ras_stride_pages;
648 static void ras_update_stride_detector(struct ll_readahead_state *ras,
651 unsigned long stride_gap = index - ras->ras_last_readpage - 1;
653 if (!stride_io_mode(ras) && (stride_gap != 0 ||
654 ras->ras_consecutive_stride_requests == 0)) {
655 ras->ras_stride_pages = ras->ras_consecutive_pages;
656 ras->ras_stride_length = stride_gap +ras->ras_consecutive_pages;
658 LASSERT(ras->ras_request_index == 0);
659 LASSERT(ras->ras_consecutive_stride_requests == 0);
661 if (index <= ras->ras_last_readpage) {
662 /*Reset stride window for forward read*/
663 ras_stride_reset(ras);
667 ras->ras_stride_pages = ras->ras_consecutive_pages;
668 ras->ras_stride_length = stride_gap +ras->ras_consecutive_pages;
675 stride_page_count(struct ll_readahead_state *ras, unsigned long len)
677 return stride_pg_count(ras->ras_stride_offset, ras->ras_stride_length,
678 ras->ras_stride_pages, ras->ras_stride_offset,
682 /* Stride Read-ahead window will be increased inc_len according to
683 * stride I/O pattern */
684 static void ras_stride_increase_window(struct ll_readahead_state *ras,
685 struct ll_ra_info *ra,
686 unsigned long inc_len)
688 unsigned long left, step, window_len;
689 unsigned long stride_len;
691 LASSERT(ras->ras_stride_length > 0);
692 LASSERTF(ras->ras_window_start + ras->ras_window_len
693 >= ras->ras_stride_offset, "window_start %lu, window_len %lu"
694 " stride_offset %lu\n", ras->ras_window_start,
695 ras->ras_window_len, ras->ras_stride_offset);
697 stride_len = ras->ras_window_start + ras->ras_window_len -
698 ras->ras_stride_offset;
700 left = stride_len % ras->ras_stride_length;
701 window_len = ras->ras_window_len - left;
703 if (left < ras->ras_stride_pages)
706 left = ras->ras_stride_pages + inc_len;
708 LASSERT(ras->ras_stride_pages != 0);
710 step = left / ras->ras_stride_pages;
711 left %= ras->ras_stride_pages;
713 window_len += step * ras->ras_stride_length + left;
715 if (stride_page_count(ras, window_len) <= ra->ra_max_pages_per_file)
716 ras->ras_window_len = window_len;
721 static void ras_increase_window(struct inode *inode,
722 struct ll_readahead_state *ras,
723 struct ll_ra_info *ra)
725 /* The stretch of ra-window should be aligned with max rpc_size
726 * but current clio architecture does not support retrieve such
727 * information from lower layer. FIXME later
729 if (stride_io_mode(ras))
730 ras_stride_increase_window(ras, ra, RAS_INCREASE_STEP(inode));
732 ras->ras_window_len = min(ras->ras_window_len +
733 RAS_INCREASE_STEP(inode),
734 ra->ra_max_pages_per_file);
737 static void ras_update(struct ll_sb_info *sbi, struct inode *inode,
738 struct ll_readahead_state *ras, unsigned long index,
741 struct ll_ra_info *ra = &sbi->ll_ra_info;
742 int zero = 0, stride_detect = 0, ra_miss = 0;
745 spin_lock(&ras->ras_lock);
747 ll_ra_stats_inc_sbi(sbi, hit ? RA_STAT_HIT : RA_STAT_MISS);
749 /* reset the read-ahead window in two cases. First when the app seeks
750 * or reads to some other part of the file. Secondly if we get a
751 * read-ahead miss that we think we've previously issued. This can
752 * be a symptom of there being so many read-ahead pages that the VM is
753 * reclaiming it before we get to it. */
754 if (!index_in_window(index, ras->ras_last_readpage, 8, 8)) {
756 ll_ra_stats_inc_sbi(sbi, RA_STAT_DISTANT_READPAGE);
757 } else if (!hit && ras->ras_window_len &&
758 index < ras->ras_next_readahead &&
759 index_in_window(index, ras->ras_window_start, 0,
760 ras->ras_window_len)) {
762 ll_ra_stats_inc_sbi(sbi, RA_STAT_MISS_IN_WINDOW);
765 /* On the second access to a file smaller than the tunable
766 * ra_max_read_ahead_whole_pages trigger RA on all pages in the
767 * file up to ra_max_pages_per_file. This is simply a best effort
768 * and only occurs once per open file. Normal RA behavior is reverted
769 * to for subsequent IO. The mmap case does not increment
770 * ras_requests and thus can never trigger this behavior. */
771 if (ras->ras_requests == 2 && !ras->ras_request_index) {
774 kms_pages = (i_size_read(inode) + PAGE_CACHE_SIZE - 1) >>
777 CDEBUG(D_READA, "kmsp "LPU64" mwp %lu mp %lu\n", kms_pages,
778 ra->ra_max_read_ahead_whole_pages, ra->ra_max_pages_per_file);
781 kms_pages <= ra->ra_max_read_ahead_whole_pages) {
782 ras->ras_window_start = 0;
783 ras->ras_last_readpage = 0;
784 ras->ras_next_readahead = 0;
785 ras->ras_window_len = min(ra->ra_max_pages_per_file,
786 ra->ra_max_read_ahead_whole_pages);
791 /* check whether it is in stride I/O mode*/
792 if (!index_in_stride_window(ras, index)) {
793 if (ras->ras_consecutive_stride_requests == 0 &&
794 ras->ras_request_index == 0) {
795 ras_update_stride_detector(ras, index);
796 ras->ras_consecutive_stride_requests++;
798 ras_stride_reset(ras);
800 ras_reset(inode, ras, index);
801 ras->ras_consecutive_pages++;
804 ras->ras_consecutive_pages = 0;
805 ras->ras_consecutive_requests = 0;
806 if (++ras->ras_consecutive_stride_requests > 1)
812 if (index_in_stride_window(ras, index) &&
813 stride_io_mode(ras)) {
814 /*If stride-RA hit cache miss, the stride dector
815 *will not be reset to avoid the overhead of
816 *redetecting read-ahead mode */
817 if (index != ras->ras_last_readpage + 1)
818 ras->ras_consecutive_pages = 0;
819 ras_reset(inode, ras, index);
822 /* Reset both stride window and normal RA
824 ras_reset(inode, ras, index);
825 ras->ras_consecutive_pages++;
826 ras_stride_reset(ras);
829 } else if (stride_io_mode(ras)) {
830 /* If this is contiguous read but in stride I/O mode
831 * currently, check whether stride step still is valid,
832 * if invalid, it will reset the stride ra window*/
833 if (!index_in_stride_window(ras, index)) {
834 /* Shrink stride read-ahead window to be zero */
835 ras_stride_reset(ras);
836 ras->ras_window_len = 0;
837 ras->ras_next_readahead = index;
841 ras->ras_consecutive_pages++;
842 ras->ras_last_readpage = index;
843 ras_set_start(inode, ras, index);
845 if (stride_io_mode(ras)) {
846 /* Since stride readahead is sentivite to the offset
847 * of read-ahead, so we use original offset here,
848 * instead of ras_window_start, which is RPC aligned */
849 ras->ras_next_readahead = max(index, ras->ras_next_readahead);
851 if (ras->ras_next_readahead < ras->ras_window_start)
852 ras->ras_next_readahead = ras->ras_window_start;
854 ras->ras_next_readahead = index + 1;
858 /* Trigger RA in the mmap case where ras_consecutive_requests
859 * is not incremented and thus can't be used to trigger RA */
860 if (!ras->ras_window_len && ras->ras_consecutive_pages == 4) {
861 ras->ras_window_len = RAS_INCREASE_STEP(inode);
865 /* Initially reset the stride window offset to next_readahead*/
866 if (ras->ras_consecutive_stride_requests == 2 && stride_detect) {
868 * Once stride IO mode is detected, next_readahead should be
869 * reset to make sure next_readahead > stride offset
871 ras->ras_next_readahead = max(index, ras->ras_next_readahead);
872 ras->ras_stride_offset = index;
873 ras->ras_window_len = RAS_INCREASE_STEP(inode);
876 /* The initial ras_window_len is set to the request size. To avoid
877 * uselessly reading and discarding pages for random IO the window is
878 * only increased once per consecutive request received. */
879 if ((ras->ras_consecutive_requests > 1 || stride_detect) &&
880 !ras->ras_request_index)
881 ras_increase_window(inode, ras, ra);
885 ras->ras_request_index++;
886 spin_unlock(&ras->ras_lock);
890 int ll_writepage(struct page *vmpage, struct writeback_control *wbc)
892 struct inode *inode = vmpage->mapping->host;
893 struct ll_inode_info *lli = ll_i2info(inode);
896 struct cl_page *page;
897 struct cl_object *clob;
898 struct cl_env_nest nest;
899 bool redirtied = false;
900 bool unlocked = false;
904 LASSERT(PageLocked(vmpage));
905 LASSERT(!PageWriteback(vmpage));
907 LASSERT(ll_i2dtexp(inode) != NULL);
909 env = cl_env_nested_get(&nest);
911 GOTO(out, result = PTR_ERR(env));
913 clob = ll_i2info(inode)->lli_clob;
914 LASSERT(clob != NULL);
916 io = vvp_env_thread_io(env);
918 io->ci_ignore_layout = 1;
919 result = cl_io_init(env, io, CIT_MISC, clob);
921 page = cl_page_find(env, clob, vmpage->index,
922 vmpage, CPT_CACHEABLE);
924 lu_ref_add(&page->cp_reference, "writepage",
926 cl_page_assume(env, io, page);
927 result = cl_page_flush(env, io, page);
930 * Re-dirty page on error so it retries write,
931 * but not in case when IO has actually
932 * occurred and completed with an error.
934 if (!PageError(vmpage)) {
935 redirty_page_for_writepage(wbc, vmpage);
940 cl_page_disown(env, io, page);
942 lu_ref_del(&page->cp_reference,
943 "writepage", current);
944 cl_page_put(env, page);
946 result = PTR_ERR(page);
951 if (redirtied && wbc->sync_mode == WB_SYNC_ALL) {
952 loff_t offset = cl_offset(clob, vmpage->index);
954 /* Flush page failed because the extent is being written out.
955 * Wait for the write of extent to be finished to avoid
956 * breaking kernel which assumes ->writepage should mark
957 * PageWriteback or clean the page. */
958 result = cl_sync_file_range(inode, offset,
959 offset + PAGE_CACHE_SIZE - 1,
962 /* actually we may have written more than one page.
963 * decreasing this page because the caller will count
965 wbc->nr_to_write -= result - 1;
970 cl_env_nested_put(&nest, env);
975 if (!lli->lli_async_rc)
976 lli->lli_async_rc = result;
977 SetPageError(vmpage);
984 int ll_writepages(struct address_space *mapping, struct writeback_control *wbc)
986 struct inode *inode = mapping->host;
987 struct ll_sb_info *sbi = ll_i2sbi(inode);
990 enum cl_fsync_mode mode;
993 int ignore_layout = 0;
996 if (wbc->range_cyclic) {
997 start = mapping->writeback_index << PAGE_CACHE_SHIFT;
998 end = OBD_OBJECT_EOF;
1000 start = wbc->range_start;
1001 end = wbc->range_end;
1002 if (end == LLONG_MAX) {
1003 end = OBD_OBJECT_EOF;
1004 range_whole = start == 0;
1008 mode = CL_FSYNC_NONE;
1009 if (wbc->sync_mode == WB_SYNC_ALL)
1010 mode = CL_FSYNC_LOCAL;
1012 if (sbi->ll_umounting)
1013 /* if the mountpoint is being umounted, all pages have to be
1014 * evicted to avoid hitting LBUG when truncate_inode_pages()
1015 * is called later on. */
1018 if (ll_i2info(inode)->lli_clob == NULL)
1021 result = cl_sync_file_range(inode, start, end, mode, ignore_layout);
1023 wbc->nr_to_write -= result;
1027 if (wbc->range_cyclic || (range_whole && wbc->nr_to_write > 0)) {
1028 if (end == OBD_OBJECT_EOF)
1029 mapping->writeback_index = 0;
1031 mapping->writeback_index = (end >> PAGE_CACHE_SHIFT) +1;
1036 struct ll_cl_context *ll_cl_find(struct file *file)
1038 struct ll_file_data *fd = LUSTRE_FPRIVATE(file);
1039 struct ll_cl_context *lcc;
1040 struct ll_cl_context *found = NULL;
1042 read_lock(&fd->fd_lock);
1043 list_for_each_entry(lcc, &fd->fd_lccs, lcc_list) {
1044 if (lcc->lcc_cookie == current) {
1049 read_unlock(&fd->fd_lock);
1054 void ll_cl_add(struct file *file, const struct lu_env *env, struct cl_io *io)
1056 struct ll_file_data *fd = LUSTRE_FPRIVATE(file);
1057 struct ll_cl_context *lcc = &ll_env_info(env)->lti_io_ctx;
1059 memset(lcc, 0, sizeof(*lcc));
1060 INIT_LIST_HEAD(&lcc->lcc_list);
1061 lcc->lcc_cookie = current;
1065 write_lock(&fd->fd_lock);
1066 list_add(&lcc->lcc_list, &fd->fd_lccs);
1067 write_unlock(&fd->fd_lock);
1070 void ll_cl_remove(struct file *file, const struct lu_env *env)
1072 struct ll_file_data *fd = LUSTRE_FPRIVATE(file);
1073 struct ll_cl_context *lcc = &ll_env_info(env)->lti_io_ctx;
1075 write_lock(&fd->fd_lock);
1076 list_del_init(&lcc->lcc_list);
1077 write_unlock(&fd->fd_lock);
1080 static int ll_io_read_page(const struct lu_env *env, struct cl_io *io,
1081 struct cl_page *page)
1083 struct inode *inode = vvp_object_inode(page->cp_obj);
1084 struct ll_sb_info *sbi = ll_i2sbi(inode);
1085 struct ll_file_data *fd = vvp_env_io(env)->vui_fd;
1086 struct ll_readahead_state *ras = &fd->fd_ras;
1087 struct cl_2queue *queue = &io->ci_queue;
1088 struct vvp_page *vpg;
1092 vpg = cl2vvp_page(cl_object_page_slice(page->cp_obj, page));
1093 if (sbi->ll_ra_info.ra_max_pages_per_file > 0 &&
1094 sbi->ll_ra_info.ra_max_pages > 0)
1095 ras_update(sbi, inode, ras, vvp_index(vpg),
1096 vpg->vpg_defer_uptodate);
1098 if (vpg->vpg_defer_uptodate) {
1099 vpg->vpg_ra_used = 1;
1100 cl_page_export(env, page, 1);
1103 cl_2queue_init(queue);
1105 * Add page into the queue even when it is marked uptodate above.
1106 * this will unlock it automatically as part of cl_page_list_disown().
1108 cl_2queue_add(queue, page);
1109 if (sbi->ll_ra_info.ra_max_pages_per_file > 0 &&
1110 sbi->ll_ra_info.ra_max_pages > 0) {
1113 rc2 = ll_readahead(env, io, &queue->c2_qin, ras,
1114 vpg->vpg_defer_uptodate);
1115 CDEBUG(D_READA, DFID "%d pages read ahead at %lu\n",
1116 PFID(ll_inode2fid(inode)), rc2, vvp_index(vpg));
1119 if (queue->c2_qin.pl_nr > 0)
1120 rc = cl_io_submit_rw(env, io, CRT_READ, queue);
1123 * Unlock unsent pages in case of error.
1125 cl_page_list_disown(env, io, &queue->c2_qin);
1126 cl_2queue_fini(env, queue);
1131 int ll_readpage(struct file *file, struct page *vmpage)
1133 struct inode *inode = file->f_path.dentry->d_inode;
1134 struct cl_object *clob = ll_i2info(inode)->lli_clob;
1135 struct ll_cl_context *lcc;
1136 const struct lu_env *env;
1138 struct cl_page *page;
1142 lcc = ll_cl_find(file);
1144 unlock_page(vmpage);
1150 LASSERT(io != NULL);
1151 LASSERT(io->ci_state == CIS_IO_GOING);
1152 page = cl_page_find(env, clob, vmpage->index, vmpage, CPT_CACHEABLE);
1153 if (!IS_ERR(page)) {
1154 LASSERT(page->cp_type == CPT_CACHEABLE);
1155 if (likely(!PageUptodate(vmpage))) {
1156 cl_page_assume(env, io, page);
1157 result = ll_io_read_page(env, io, page);
1159 /* Page from a non-object file. */
1160 unlock_page(vmpage);
1163 cl_page_put(env, page);
1165 unlock_page(vmpage);
1166 result = PTR_ERR(page);
1171 int ll_page_sync_io(const struct lu_env *env, struct cl_io *io,
1172 struct cl_page *page, enum cl_req_type crt)
1174 struct cl_2queue *queue;
1177 LASSERT(io->ci_type == CIT_READ || io->ci_type == CIT_WRITE);
1179 queue = &io->ci_queue;
1180 cl_2queue_init_page(queue, page);
1182 result = cl_io_submit_sync(env, io, crt, queue, 0);
1183 LASSERT(cl_page_is_owned(page, io));
1185 if (crt == CRT_READ)
1187 * in CRT_WRITE case page is left locked even in case of
1190 cl_page_list_disown(env, io, &queue->c2_qin);
1191 cl_2queue_fini(env, queue);