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.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2008, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2011, 2017, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * Implementation of cl_io for LOV layer.
34 * Author: Nikita Danilov <nikita.danilov@sun.com>
35 * Author: Jinshan Xiong <jinshan.xiong@whamcloud.com>
38 #define DEBUG_SUBSYSTEM S_LOV
40 #include "lov_cl_internal.h"
46 static inline struct lov_io_sub *lov_sub_alloc(struct lov_io *lio, int index)
48 struct lov_io_sub *sub;
50 if (lio->lis_nr_subios == 0) {
51 LASSERT(lio->lis_single_subio_index == -1);
52 sub = &lio->lis_single_subio;
53 lio->lis_single_subio_index = index;
54 memset(sub, 0, sizeof(*sub));
60 INIT_LIST_HEAD(&sub->sub_list);
61 INIT_LIST_HEAD(&sub->sub_linkage);
62 sub->sub_subio_index = index;
68 static inline void lov_sub_free(struct lov_io *lio, struct lov_io_sub *sub)
70 if (sub->sub_subio_index == lio->lis_single_subio_index) {
71 LASSERT(sub == &lio->lis_single_subio);
72 lio->lis_single_subio_index = -1;
78 static void lov_io_sub_fini(const struct lu_env *env, struct lov_io *lio,
79 struct lov_io_sub *sub)
83 cl_io_fini(sub->sub_env, &sub->sub_io);
85 if (sub->sub_env && !IS_ERR(sub->sub_env)) {
86 cl_env_put(sub->sub_env, &sub->sub_refcheck);
93 is_index_within_mirror(struct lov_object *lov, int index, int mirror_index)
95 struct lov_layout_composite *comp = &lov->u.composite;
96 struct lov_mirror_entry *lre = &comp->lo_mirrors[mirror_index];
98 return (index >= lre->lre_start && index <= lre->lre_end);
101 static int lov_io_sub_init(const struct lu_env *env, struct lov_io *lio,
102 struct lov_io_sub *sub)
104 struct lov_object *lov = lio->lis_object;
105 struct cl_io *sub_io;
106 struct cl_object *sub_obj;
107 struct cl_io *io = lio->lis_cl.cis_io;
108 int index = lov_comp_entry(sub->sub_subio_index);
109 int stripe = lov_comp_stripe(sub->sub_subio_index);
111 LASSERT(sub->sub_env == NULL);
114 if (unlikely(!lov_r0(lov, index)->lo_sub ||
115 !lov_r0(lov, index)->lo_sub[stripe]))
118 LASSERTF(ergo(lov_is_flr(lov),
119 is_index_within_mirror(lov, index,
120 lio->lis_mirror_index)),
121 DFID "iot = %d, index = %d, mirror = %d\n",
122 PFID(lu_object_fid(lov2lu(lov))), io->ci_type, index,
123 lio->lis_mirror_index);
125 /* obtain new environment */
126 sub->sub_env = cl_env_get(&sub->sub_refcheck);
127 if (IS_ERR(sub->sub_env)) {
128 result = PTR_ERR(sub->sub_env);
132 sub_obj = lovsub2cl(lov_r0(lov, index)->lo_sub[stripe]);
133 sub_io = &sub->sub_io;
135 sub_io->ci_obj = sub_obj;
136 sub_io->ci_result = 0;
138 sub_io->ci_parent = io;
139 sub_io->ci_lockreq = io->ci_lockreq;
140 sub_io->ci_type = io->ci_type;
141 sub_io->ci_no_srvlock = io->ci_no_srvlock;
142 sub_io->ci_noatime = io->ci_noatime;
143 sub_io->ci_async_readahead = io->ci_async_readahead;
144 sub_io->ci_lock_no_expand = io->ci_lock_no_expand;
145 sub_io->ci_ndelay = io->ci_ndelay;
146 sub_io->ci_layout_version = io->ci_layout_version;
147 sub_io->ci_tried_all_mirrors = io->ci_tried_all_mirrors;
149 result = cl_io_sub_init(sub->sub_env, sub_io, io->ci_type, sub_obj);
152 lov_io_sub_fini(env, lio, sub);
157 struct lov_io_sub *lov_sub_get(const struct lu_env *env,
158 struct lov_io *lio, int index)
160 struct lov_io_sub *sub;
165 list_for_each_entry(sub, &lio->lis_subios, sub_list) {
166 if (sub->sub_subio_index == index) {
173 sub = lov_sub_alloc(lio, index);
175 GOTO(out, rc = -ENOMEM);
177 rc = lov_io_sub_init(env, lio, sub);
179 lov_sub_free(lio, sub);
183 list_add_tail(&sub->sub_list, &lio->lis_subios);
184 lio->lis_nr_subios++;
190 sub->sub_io.ci_noquota = lio->lis_cl.cis_io->ci_noquota;
194 /*****************************************************************************
199 static int lov_io_subio_init(const struct lu_env *env, struct lov_io *lio,
204 LASSERT(lio->lis_object != NULL);
206 INIT_LIST_HEAD(&lio->lis_subios);
207 lio->lis_single_subio_index = -1;
208 lio->lis_nr_subios = 0;
214 * Decide if it will need write intent RPC
216 static int lov_io_mirror_write_intent(struct lov_io *lio,
217 struct lov_object *obj, struct cl_io *io)
219 struct lov_layout_composite *comp = &obj->u.composite;
220 struct lu_extent *ext = &io->ci_write_intent;
221 struct lov_mirror_entry *lre;
222 struct lov_mirror_entry *primary;
223 struct lov_layout_entry *lle;
227 *ext = (typeof(*ext)) { lio->lis_pos, lio->lis_endpos };
228 io->ci_need_write_intent = 0;
230 if (!(io->ci_type == CIT_WRITE || cl_io_is_trunc(io) ||
231 cl_io_is_mkwrite(io)))
235 * FLR: check if it needs to send a write intent RPC to server.
236 * Writing to sync_pending file needs write intent RPC to change
237 * the file state back to write_pending, so that the layout version
238 * can be increased when the state changes to sync_pending at a later
239 * time. Otherwise there exists a chance that an evicted client may
240 * dirty the file data while resync client is working on it.
241 * Designated I/O is allowed for resync workload.
243 if (lov_flr_state(obj) == LCM_FL_RDONLY ||
244 (lov_flr_state(obj) == LCM_FL_SYNC_PENDING &&
245 io->ci_designated_mirror == 0)) {
246 io->ci_need_write_intent = 1;
250 LASSERT((lov_flr_state(obj) == LCM_FL_WRITE_PENDING));
251 LASSERT(comp->lo_preferred_mirror >= 0);
254 * need to iterate all components to see if there are
255 * multiple components covering the writing component
257 primary = &comp->lo_mirrors[comp->lo_preferred_mirror];
258 LASSERT(!primary->lre_stale);
259 lov_foreach_mirror_layout_entry(obj, lle, primary) {
260 LASSERT(lle->lle_valid);
261 if (!lu_extent_is_overlapped(ext, lle->lle_extent))
264 ext->e_start = min(ext->e_start, lle->lle_extent->e_start);
265 ext->e_end = max(ext->e_end, lle->lle_extent->e_end);
269 CERROR(DFID ": cannot find any valid components covering "
270 "file extent "DEXT", mirror: %d\n",
271 PFID(lu_object_fid(lov2lu(obj))), PEXT(ext),
272 primary->lre_mirror_id);
277 lov_foreach_mirror_entry(obj, lre) {
281 lov_foreach_mirror_layout_entry(obj, lle, lre) {
285 if (lu_extent_is_overlapped(ext, lle->lle_extent)) {
292 CDEBUG(D_VFSTRACE, DFID "there are %zd components to be staled to "
293 "modify file extent "DEXT", iot: %d\n",
294 PFID(lu_object_fid(lov2lu(obj))), count, PEXT(ext), io->ci_type);
296 io->ci_need_write_intent = count > 0;
301 static int lov_io_mirror_init(struct lov_io *lio, struct lov_object *obj,
304 struct lov_layout_composite *comp = &obj->u.composite;
310 if (!lov_is_flr(obj)) {
311 LASSERT(comp->lo_preferred_mirror == 0);
312 lio->lis_mirror_index = comp->lo_preferred_mirror;
317 /* transfer the layout version for verification */
318 if (io->ci_layout_version == 0)
319 io->ci_layout_version = obj->lo_lsm->lsm_layout_gen;
321 /* find the corresponding mirror for designated mirror IO */
322 if (io->ci_designated_mirror > 0) {
323 struct lov_mirror_entry *entry;
325 LASSERT(!io->ci_ndelay);
327 CDEBUG(D_LAYOUT, "designated I/O mirror state: %d\n",
330 if ((cl_io_is_trunc(io) || io->ci_type == CIT_WRITE) &&
331 (io->ci_layout_version != obj->lo_lsm->lsm_layout_gen)) {
333 * For resync I/O, the ci_layout_version was the layout
334 * version when resync starts. If it doesn't match the
335 * current object layout version, it means the layout
341 io->ci_layout_version |= LU_LAYOUT_RESYNC;
344 lio->lis_mirror_index = -1;
345 lov_foreach_mirror_entry(obj, entry) {
346 if (entry->lre_mirror_id ==
347 io->ci_designated_mirror) {
348 lio->lis_mirror_index = index;
355 RETURN(lio->lis_mirror_index < 0 ? -EINVAL : 0);
358 result = lov_io_mirror_write_intent(lio, obj, io);
362 if (io->ci_need_write_intent) {
363 CDEBUG(D_VFSTRACE, DFID " need write intent for [%llu, %llu)\n",
364 PFID(lu_object_fid(lov2lu(obj))),
365 lio->lis_pos, lio->lis_endpos);
367 if (cl_io_is_trunc(io)) {
369 * for truncate, we uses [size, EOF) to judge whether
370 * a write intent needs to be send, but we need to
371 * restore the write extent to [0, size).
373 io->ci_write_intent.e_start = 0;
374 io->ci_write_intent.e_end =
375 io->u.ci_setattr.sa_attr.lvb_size;
377 /* stop cl_io_init() loop */
381 if (io->ci_ndelay_tried == 0 || /* first time to try */
382 /* reset the mirror index if layout has changed */
383 lio->lis_mirror_layout_gen != obj->lo_lsm->lsm_layout_gen) {
384 lio->lis_mirror_layout_gen = obj->lo_lsm->lsm_layout_gen;
385 index = lio->lis_mirror_index = comp->lo_preferred_mirror;
387 index = lio->lis_mirror_index;
390 /* move mirror index to the next one */
391 index = (index + 1) % comp->lo_mirror_count;
394 for (i = 0; i < comp->lo_mirror_count; i++) {
395 struct lu_extent ext = { .e_start = lio->lis_pos,
396 .e_end = lio->lis_pos + 1 };
397 struct lov_mirror_entry *lre;
398 struct lov_layout_entry *lle;
401 lre = &comp->lo_mirrors[(index + i) % comp->lo_mirror_count];
405 lov_foreach_mirror_layout_entry(obj, lle, lre) {
409 if (lu_extent_is_overlapped(&ext, lle->lle_extent)) {
413 } /* each component of the mirror */
415 index = (index + i) % comp->lo_mirror_count;
420 if (i == comp->lo_mirror_count) {
421 CERROR(DFID": failed to find a component covering "
422 "I/O region at %llu\n",
423 PFID(lu_object_fid(lov2lu(obj))), lio->lis_pos);
425 dump_lsm(D_ERROR, obj->lo_lsm);
430 CDEBUG(D_VFSTRACE, DFID ": flr state: %d, move mirror from %d to %d, "
431 "have retried: %d, mirror count: %d\n",
432 PFID(lu_object_fid(lov2lu(obj))), lov_flr_state(obj),
433 lio->lis_mirror_index, index, io->ci_ndelay_tried,
434 comp->lo_mirror_count);
436 lio->lis_mirror_index = index;
439 * FLR: if all mirrors have been tried once, most likely the network
440 * of this client has been partitioned. We should relinquish CPU for
441 * a while before trying again.
443 if (io->ci_ndelay && io->ci_ndelay_tried > 0 &&
444 (io->ci_ndelay_tried % comp->lo_mirror_count == 0)) {
445 schedule_timeout_interruptible(cfs_time_seconds(1) / 100);
446 if (signal_pending(current))
450 * we'd set ci_tried_all_mirrors to turn off fast mirror
451 * switching for read after we've tried all mirrors several
454 io->ci_tried_all_mirrors = io->ci_ndelay_tried %
455 (comp->lo_mirror_count * 4) == 0;
457 ++io->ci_ndelay_tried;
459 CDEBUG(D_VFSTRACE, "use %sdelayed RPC state for this IO\n",
460 io->ci_ndelay ? "non-" : "");
465 static int lov_io_slice_init(struct lov_io *lio,
466 struct lov_object *obj, struct cl_io *io)
473 lio->lis_object = obj;
475 LASSERT(obj->lo_lsm != NULL);
477 switch (io->ci_type) {
480 lio->lis_pos = io->u.ci_rw.crw_pos;
481 lio->lis_endpos = io->u.ci_rw.crw_pos + io->u.ci_rw.crw_count;
482 lio->lis_io_endpos = lio->lis_endpos;
483 if (cl_io_is_append(io)) {
484 LASSERT(io->ci_type == CIT_WRITE);
487 * If there is LOV EA hole, then we may cannot locate
488 * the current file-tail exactly.
490 if (unlikely(obj->lo_lsm->lsm_entries[0]->lsme_pattern &
492 GOTO(out, result = -EIO);
495 lio->lis_endpos = OBD_OBJECT_EOF;
500 if (cl_io_is_trunc(io))
501 lio->lis_pos = io->u.ci_setattr.sa_attr.lvb_size;
504 lio->lis_endpos = OBD_OBJECT_EOF;
507 case CIT_DATA_VERSION:
509 lio->lis_endpos = OBD_OBJECT_EOF;
513 pgoff_t index = io->u.ci_fault.ft_index;
515 lio->lis_pos = cl_offset(io->ci_obj, index);
516 lio->lis_endpos = cl_offset(io->ci_obj, index + 1);
521 lio->lis_pos = io->u.ci_fsync.fi_start;
522 lio->lis_endpos = io->u.ci_fsync.fi_end;
527 lio->lis_pos = io->u.ci_ladvise.li_start;
528 lio->lis_endpos = io->u.ci_ladvise.li_end;
534 lio->lis_endpos = OBD_OBJECT_EOF;
536 if (lov_flr_state(obj) == LCM_FL_RDONLY &&
537 !OBD_FAIL_CHECK(OBD_FAIL_FLR_GLIMPSE_IMMUTABLE))
538 /* SoM is accurate, no need glimpse */
539 GOTO(out, result = 1);
544 lio->lis_endpos = OBD_OBJECT_EOF;
551 result = lov_io_mirror_init(lio, obj, io);
555 /* check if it needs to instantiate layout */
556 if (!(io->ci_type == CIT_WRITE || cl_io_is_mkwrite(io) ||
557 (cl_io_is_trunc(io) && io->u.ci_setattr.sa_attr.lvb_size > 0)))
558 GOTO(out, result = 0);
561 * for truncate, it only needs to instantiate the components
562 * before the truncated size.
564 if (cl_io_is_trunc(io)) {
565 io->ci_write_intent.e_start = 0;
566 /* for writes, e_end is endpos, the location of the file
567 * pointer after the write is completed, so it is not accessed.
568 * For truncate, 'end' is the size, and *is* acccessed.
569 * In other words, writes are [start, end), but truncate is
570 * [start, size], where both are included. So add 1 to the
571 * size when creating the write intent to account for this.
573 io->ci_write_intent.e_end =
574 io->u.ci_setattr.sa_attr.lvb_size + 1;
576 io->ci_write_intent.e_start = lio->lis_pos;
577 io->ci_write_intent.e_end = lio->lis_endpos;
581 lov_foreach_io_layout(index, lio, &io->ci_write_intent) {
582 if (!lsm_entry_inited(obj->lo_lsm, index)) {
583 io->ci_need_write_intent = 1;
588 if (io->ci_need_write_intent && io->ci_designated_mirror > 0) {
590 * REINT_SYNC RPC has already tried to instantiate all of the
591 * components involved, obviously it didn't succeed. Skip this
592 * mirror for now. The server won't be able to figure out
593 * which mirror it should instantiate components
595 CERROR(DFID": trying to instantiate components for designated "
596 "I/O, file state: %d\n",
597 PFID(lu_object_fid(lov2lu(obj))), lov_flr_state(obj));
599 io->ci_need_write_intent = 0;
600 GOTO(out, result = -EIO);
603 if (io->ci_need_write_intent)
604 GOTO(out, result = 1);
612 static void lov_io_fini(const struct lu_env *env, const struct cl_io_slice *ios)
614 struct lov_io *lio = cl2lov_io(env, ios);
615 struct lov_object *lov = cl2lov(ios->cis_obj);
619 LASSERT(list_empty(&lio->lis_active));
621 while (!list_empty(&lio->lis_subios)) {
622 struct lov_io_sub *sub = list_entry(lio->lis_subios.next,
626 list_del_init(&sub->sub_list);
627 lio->lis_nr_subios--;
629 lov_io_sub_fini(env, lio, sub);
630 lov_sub_free(lio, sub);
632 LASSERT(lio->lis_nr_subios == 0);
634 LASSERT(atomic_read(&lov->lo_active_ios) > 0);
635 if (atomic_dec_and_test(&lov->lo_active_ios))
636 wake_up_all(&lov->lo_waitq);
640 static void lov_io_sub_inherit(struct lov_io_sub *sub, struct lov_io *lio,
641 loff_t start, loff_t end)
643 struct cl_io *io = &sub->sub_io;
644 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
645 struct cl_io *parent = lio->lis_cl.cis_io;
646 int index = lov_comp_entry(sub->sub_subio_index);
647 int stripe = lov_comp_stripe(sub->sub_subio_index);
649 switch (io->ci_type) {
651 io->u.ci_setattr.sa_attr = parent->u.ci_setattr.sa_attr;
652 io->u.ci_setattr.sa_attr_flags =
653 parent->u.ci_setattr.sa_attr_flags;
654 io->u.ci_setattr.sa_avalid = parent->u.ci_setattr.sa_avalid;
655 io->u.ci_setattr.sa_xvalid = parent->u.ci_setattr.sa_xvalid;
656 io->u.ci_setattr.sa_stripe_index = stripe;
657 io->u.ci_setattr.sa_parent_fid =
658 parent->u.ci_setattr.sa_parent_fid;
659 if (cl_io_is_trunc(io)) {
660 loff_t new_size = parent->u.ci_setattr.sa_attr.lvb_size;
662 new_size = lov_size_to_stripe(lsm, index, new_size,
664 io->u.ci_setattr.sa_attr.lvb_size = new_size;
666 lov_lsm2layout(lsm, lsm->lsm_entries[index],
667 &io->u.ci_setattr.sa_layout);
670 case CIT_DATA_VERSION: {
671 io->u.ci_data_version.dv_data_version = 0;
672 io->u.ci_data_version.dv_flags =
673 parent->u.ci_data_version.dv_flags;
677 struct cl_object *obj = parent->ci_obj;
678 loff_t off = cl_offset(obj, parent->u.ci_fault.ft_index);
680 io->u.ci_fault = parent->u.ci_fault;
681 off = lov_size_to_stripe(lsm, index, off, stripe);
682 io->u.ci_fault.ft_index = cl_index(obj, off);
686 io->u.ci_fsync.fi_start = start;
687 io->u.ci_fsync.fi_end = end;
688 io->u.ci_fsync.fi_fid = parent->u.ci_fsync.fi_fid;
689 io->u.ci_fsync.fi_mode = parent->u.ci_fsync.fi_mode;
694 io->u.ci_wr.wr_sync = cl_io_is_sync_write(parent);
695 io->ci_tried_all_mirrors = parent->ci_tried_all_mirrors;
696 if (cl_io_is_append(parent)) {
697 io->u.ci_wr.wr_append = 1;
699 io->u.ci_rw.crw_pos = start;
700 io->u.ci_rw.crw_count = end - start;
705 io->u.ci_ladvise.li_start = start;
706 io->u.ci_ladvise.li_end = end;
707 io->u.ci_ladvise.li_fid = parent->u.ci_ladvise.li_fid;
708 io->u.ci_ladvise.li_advice = parent->u.ci_ladvise.li_advice;
709 io->u.ci_ladvise.li_flags = parent->u.ci_ladvise.li_flags;
719 static loff_t lov_offset_mod(loff_t val, int delta)
721 if (val != OBD_OBJECT_EOF)
726 static int lov_io_iter_init(const struct lu_env *env,
727 const struct cl_io_slice *ios)
729 struct lov_io *lio = cl2lov_io(env, ios);
730 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
731 struct lov_io_sub *sub;
732 struct lu_extent ext;
738 ext.e_start = lio->lis_pos;
739 ext.e_end = lio->lis_endpos;
741 lov_foreach_io_layout(index, lio, &ext) {
742 struct lov_layout_entry *le = lov_entry(lio->lis_object, index);
743 struct lov_layout_raid0 *r0 = &le->lle_raid0;
748 CDEBUG(D_VFSTRACE, "component[%d] flags %#x\n",
749 index, lsm->lsm_entries[index]->lsme_flags);
750 if (!lsm_entry_inited(lsm, index)) {
752 * Read from uninitialized components should return
758 if (!le->lle_valid && !ios->cis_io->ci_designated_mirror) {
759 CERROR("I/O to invalid component: %d, mirror: %d\n",
760 index, lio->lis_mirror_index);
764 for (stripe = 0; stripe < r0->lo_nr; stripe++) {
765 if (!lov_stripe_intersects(lsm, index, stripe,
769 if (unlikely(!r0->lo_sub[stripe])) {
770 if (ios->cis_io->ci_type == CIT_READ ||
771 ios->cis_io->ci_type == CIT_WRITE ||
772 ios->cis_io->ci_type == CIT_FAULT)
778 end = lov_offset_mod(end, 1);
779 sub = lov_sub_get(env, lio,
780 lov_comp_index(index, stripe));
786 lov_io_sub_inherit(sub, lio, start, end);
787 rc = cl_io_iter_init(sub->sub_env, &sub->sub_io);
789 cl_io_iter_fini(sub->sub_env, &sub->sub_io);
793 CDEBUG(D_VFSTRACE, "shrink: %d [%llu, %llu)\n",
796 list_add_tail(&sub->sub_linkage, &lio->lis_active);
804 static int lov_io_rw_iter_init(const struct lu_env *env,
805 const struct cl_io_slice *ios)
807 struct lov_io *lio = cl2lov_io(env, ios);
808 struct cl_io *io = ios->cis_io;
809 struct lov_stripe_md_entry *lse;
810 loff_t start = io->u.ci_rw.crw_pos;
814 LASSERT(io->ci_type == CIT_READ || io->ci_type == CIT_WRITE);
817 if (cl_io_is_append(io))
818 RETURN(lov_io_iter_init(env, ios));
820 index = lov_io_layout_at(lio, io->u.ci_rw.crw_pos);
821 if (index < 0) { /* non-existing layout component */
822 if (io->ci_type == CIT_READ) {
824 * TODO: it needs to detect the next component and
825 * then set the next pos
829 RETURN(lov_io_iter_init(env, ios));
835 if (!lov_entry(lio->lis_object, index)->lle_valid &&
836 !io->ci_designated_mirror)
837 RETURN(io->ci_type == CIT_READ ? -EAGAIN : -EIO);
839 lse = lov_lse(lio->lis_object, index);
841 next = MAX_LFS_FILESIZE;
842 if (lse->lsme_stripe_count > 1) {
843 unsigned long ssize = lse->lsme_stripe_size;
845 lov_do_div64(start, ssize);
846 next = (start + 1) * ssize;
847 if (next <= start * ssize)
848 next = MAX_LFS_FILESIZE;
851 LASSERTF(io->u.ci_rw.crw_pos >= lse->lsme_extent.e_start,
852 "pos %lld, [%lld, %lld)\n", io->u.ci_rw.crw_pos,
853 lse->lsme_extent.e_start, lse->lsme_extent.e_end);
854 next = min_t(__u64, next, lse->lsme_extent.e_end);
855 next = min_t(loff_t, next, lio->lis_io_endpos);
857 io->ci_continue = next < lio->lis_io_endpos;
858 io->u.ci_rw.crw_count = next - io->u.ci_rw.crw_pos;
859 lio->lis_pos = io->u.ci_rw.crw_pos;
860 lio->lis_endpos = io->u.ci_rw.crw_pos + io->u.ci_rw.crw_count;
862 "stripe: %llu chunk: [%llu, %llu) %llu, %zd\n",
863 (__u64)start, lio->lis_pos, lio->lis_endpos,
864 (__u64)lio->lis_io_endpos, io->u.ci_rw.crw_count);
867 * XXX The following call should be optimized: we know, that
868 * [lio->lis_pos, lio->lis_endpos) intersects with exactly one stripe.
870 RETURN(lov_io_iter_init(env, ios));
873 static int lov_io_setattr_iter_init(const struct lu_env *env,
874 const struct cl_io_slice *ios)
876 struct lov_io *lio = cl2lov_io(env, ios);
877 struct cl_io *io = ios->cis_io;
881 if (cl_io_is_trunc(io) && lio->lis_pos > 0) {
882 index = lov_io_layout_at(lio, lio->lis_pos - 1);
883 /* no entry found for such offset */
885 RETURN(io->ci_result = -ENODATA);
888 RETURN(lov_io_iter_init(env, ios));
891 static int lov_io_call(const struct lu_env *env, struct lov_io *lio,
892 int (*iofunc)(const struct lu_env *, struct cl_io *))
894 struct cl_io *parent = lio->lis_cl.cis_io;
895 struct lov_io_sub *sub;
899 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
900 rc = iofunc(sub->sub_env, &sub->sub_io);
904 if (parent->ci_result == 0)
905 parent->ci_result = sub->sub_io.ci_result;
910 static int lov_io_lock(const struct lu_env *env, const struct cl_io_slice *ios)
913 RETURN(lov_io_call(env, cl2lov_io(env, ios), cl_io_lock));
916 static int lov_io_start(const struct lu_env *env, const struct cl_io_slice *ios)
919 RETURN(lov_io_call(env, cl2lov_io(env, ios), cl_io_start));
922 static int lov_io_end_wrapper(const struct lu_env *env, struct cl_io *io)
926 * It's possible that lov_io_start() wasn't called against this
927 * sub-io, either because previous sub-io failed, or upper layer
930 if (io->ci_state == CIS_IO_GOING)
933 io->ci_state = CIS_IO_FINISHED;
937 static int lov_io_iter_fini_wrapper(const struct lu_env *env, struct cl_io *io)
939 cl_io_iter_fini(env, io);
943 static int lov_io_unlock_wrapper(const struct lu_env *env, struct cl_io *io)
945 cl_io_unlock(env, io);
949 static void lov_io_end(const struct lu_env *env, const struct cl_io_slice *ios)
953 rc = lov_io_call(env, cl2lov_io(env, ios), lov_io_end_wrapper);
958 lov_io_data_version_end(const struct lu_env *env, const struct cl_io_slice *ios)
960 struct lov_io *lio = cl2lov_io(env, ios);
961 struct cl_io *parent = lio->lis_cl.cis_io;
962 struct cl_data_version_io *pdv = &parent->u.ci_data_version;
963 struct lov_io_sub *sub;
966 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
967 struct cl_data_version_io *sdv = &sub->sub_io.u.ci_data_version;
969 lov_io_end_wrapper(sub->sub_env, &sub->sub_io);
971 pdv->dv_data_version += sdv->dv_data_version;
972 if (pdv->dv_layout_version > sdv->dv_layout_version)
973 pdv->dv_layout_version = sdv->dv_layout_version;
975 if (parent->ci_result == 0)
976 parent->ci_result = sub->sub_io.ci_result;
982 static void lov_io_iter_fini(const struct lu_env *env,
983 const struct cl_io_slice *ios)
985 struct lov_io *lio = cl2lov_io(env, ios);
989 rc = lov_io_call(env, lio, lov_io_iter_fini_wrapper);
991 while (!list_empty(&lio->lis_active))
992 list_del_init(lio->lis_active.next);
996 static void lov_io_unlock(const struct lu_env *env,
997 const struct cl_io_slice *ios)
1002 rc = lov_io_call(env, cl2lov_io(env, ios), lov_io_unlock_wrapper);
1007 static int lov_io_read_ahead(const struct lu_env *env,
1008 const struct cl_io_slice *ios,
1009 pgoff_t start, struct cl_read_ahead *ra)
1011 struct lov_io *lio = cl2lov_io(env, ios);
1012 struct lov_object *loo = lio->lis_object;
1013 struct cl_object *obj = lov2cl(loo);
1014 struct lov_layout_raid0 *r0;
1015 struct lov_io_sub *sub;
1019 unsigned int pps; /* pages per stripe */
1025 offset = cl_offset(obj, start);
1026 index = lov_io_layout_at(lio, offset);
1027 if (index < 0 || !lsm_entry_inited(loo->lo_lsm, index))
1030 /* avoid readahead to expand to stale components */
1031 if (!lov_entry(loo, index)->lle_valid)
1034 stripe = lov_stripe_number(loo->lo_lsm, index, offset);
1036 r0 = lov_r0(loo, index);
1037 if (unlikely(!r0->lo_sub[stripe]))
1040 sub = lov_sub_get(env, lio, lov_comp_index(index, stripe));
1042 RETURN(PTR_ERR(sub));
1044 lov_stripe_offset(loo->lo_lsm, index, offset, stripe, &suboff);
1045 rc = cl_io_read_ahead(sub->sub_env, &sub->sub_io,
1046 cl_index(lovsub2cl(r0->lo_sub[stripe]), suboff),
1049 CDEBUG(D_READA, DFID " cra_end = %lu, stripes = %d, rc = %d\n",
1050 PFID(lu_object_fid(lov2lu(loo))), ra->cra_end_idx,
1056 * Adjust the stripe index by layout of comp. ra->cra_end is the
1057 * maximum page index covered by an underlying DLM lock.
1058 * This function converts cra_end from stripe level to file level, and
1059 * make sure it's not beyond stripe and component boundary.
1062 /* cra_end is stripe level, convert it into file level */
1063 ra_end = ra->cra_end_idx;
1064 if (ra_end != CL_PAGE_EOF)
1065 ra->cra_end_idx = lov_stripe_pgoff(loo->lo_lsm, index,
1068 /* boundary of current component */
1069 ra_end = cl_index(obj, (loff_t)lov_io_extent(lio, index)->e_end);
1070 if (ra_end != CL_PAGE_EOF && ra->cra_end_idx >= ra_end)
1071 ra->cra_end_idx = ra_end - 1;
1073 if (r0->lo_nr == 1) /* single stripe file */
1076 pps = lov_lse(loo, index)->lsme_stripe_size >> PAGE_SHIFT;
1078 CDEBUG(D_READA, DFID " max_index = %lu, pps = %u, index = %d, "
1079 "stripe_size = %u, stripe no = %u, start index = %lu\n",
1080 PFID(lu_object_fid(lov2lu(loo))), ra->cra_end_idx, pps, index,
1081 lov_lse(loo, index)->lsme_stripe_size, stripe, start);
1083 /* never exceed the end of the stripe */
1084 ra->cra_end_idx = min_t(pgoff_t, ra->cra_end_idx,
1085 start + pps - start % pps - 1);
1090 * lov implementation of cl_operations::cio_submit() method. It takes a list
1091 * of pages in \a queue, splits it into per-stripe sub-lists, invokes
1092 * cl_io_submit() on underlying devices to submit sub-lists, and then splices
1095 * Major complication of this function is a need to handle memory cleansing:
1096 * cl_io_submit() is called to write out pages as a part of VM memory
1097 * reclamation, and hence it may not fail due to memory shortages (system
1098 * dead-locks otherwise). To deal with this, some resources (sub-lists,
1099 * sub-environment, etc.) are allocated per-device on "startup" (i.e., in a
1100 * not-memory cleansing context), and in case of memory shortage, these
1101 * pre-allocated resources are used by lov_io_submit() under
1102 * lov_device::ld_mutex mutex.
1104 static int lov_io_submit(const struct lu_env *env,
1105 const struct cl_io_slice *ios,
1106 enum cl_req_type crt, struct cl_2queue *queue)
1108 struct cl_page_list *qin = &queue->c2_qin;
1109 struct lov_io *lio = cl2lov_io(env, ios);
1110 struct lov_io_sub *sub;
1111 struct cl_page_list *plist = &lov_env_info(env)->lti_plist;
1112 struct cl_page *page;
1113 struct cl_page *tmp;
1118 cl_page_list_init(plist);
1119 while (qin->pl_nr > 0) {
1120 struct cl_2queue *cl2q = &lov_env_info(env)->lti_cl2q;
1122 page = cl_page_list_first(qin);
1123 if (lov_page_is_empty(page)) {
1124 cl_page_list_move(&queue->c2_qout, qin, page);
1127 * it could only be mirror read to get here therefore
1128 * the pages will be transient. We don't care about
1129 * the return code of cl_page_prep() at all.
1131 (void) cl_page_prep(env, ios->cis_io, page, crt);
1132 cl_page_completion(env, page, crt, 0);
1136 cl_2queue_init(cl2q);
1137 cl_page_list_move(&cl2q->c2_qin, qin, page);
1139 index = page->cp_lov_index;
1140 cl_page_list_for_each_safe(page, tmp, qin) {
1141 /* this page is not on this stripe */
1142 if (index != page->cp_lov_index)
1145 cl_page_list_move(&cl2q->c2_qin, qin, page);
1148 sub = lov_sub_get(env, lio, index);
1150 rc = cl_io_submit_rw(sub->sub_env, &sub->sub_io,
1156 cl_page_list_splice(&cl2q->c2_qin, plist);
1157 cl_page_list_splice(&cl2q->c2_qout, &queue->c2_qout);
1158 cl_2queue_fini(env, cl2q);
1164 cl_page_list_splice(plist, qin);
1165 cl_page_list_fini(env, plist);
1170 static int lov_io_commit_async(const struct lu_env *env,
1171 const struct cl_io_slice *ios,
1172 struct cl_page_list *queue, int from, int to,
1175 struct cl_page_list *plist = &lov_env_info(env)->lti_plist;
1176 struct lov_io *lio = cl2lov_io(env, ios);
1177 struct lov_io_sub *sub;
1178 struct cl_page *page;
1182 if (lio->lis_nr_subios == 1) {
1183 int idx = lio->lis_single_subio_index;
1185 LASSERT(!lov_page_is_empty(cl_page_list_first(queue)));
1187 sub = lov_sub_get(env, lio, idx);
1188 LASSERT(!IS_ERR(sub));
1189 LASSERT(sub == &lio->lis_single_subio);
1190 rc = cl_io_commit_async(sub->sub_env, &sub->sub_io, queue,
1195 cl_page_list_init(plist);
1196 while (queue->pl_nr > 0) {
1200 LASSERT(plist->pl_nr == 0);
1201 page = cl_page_list_first(queue);
1202 LASSERT(!lov_page_is_empty(page));
1204 cl_page_list_move(plist, queue, page);
1206 index = page->cp_lov_index;
1207 while (queue->pl_nr > 0) {
1208 page = cl_page_list_first(queue);
1209 if (index != page->cp_lov_index)
1212 cl_page_list_move(plist, queue, page);
1215 if (queue->pl_nr > 0) /* still has more pages */
1216 stripe_to = PAGE_SIZE;
1218 sub = lov_sub_get(env, lio, index);
1220 rc = cl_io_commit_async(sub->sub_env, &sub->sub_io,
1221 plist, from, stripe_to, cb);
1227 if (plist->pl_nr > 0) /* short write */
1233 /* for error case, add the page back into the qin list */
1234 LASSERT(ergo(rc == 0, plist->pl_nr == 0));
1235 while (plist->pl_nr > 0) {
1236 /* error occurred, add the uncommitted pages back into queue */
1237 page = cl_page_list_last(plist);
1238 cl_page_list_move_head(queue, plist, page);
1244 static int lov_io_fault_start(const struct lu_env *env,
1245 const struct cl_io_slice *ios)
1247 struct cl_fault_io *fio;
1249 struct lov_io_sub *sub;
1253 fio = &ios->cis_io->u.ci_fault;
1254 lio = cl2lov_io(env, ios);
1255 sub = lov_sub_get(env, lio, fio->ft_page->cp_lov_index);
1256 sub->sub_io.u.ci_fault.ft_nob = fio->ft_nob;
1258 RETURN(lov_io_start(env, ios));
1261 static void lov_io_fsync_end(const struct lu_env *env,
1262 const struct cl_io_slice *ios)
1264 struct lov_io *lio = cl2lov_io(env, ios);
1265 struct lov_io_sub *sub;
1266 unsigned int *written = &ios->cis_io->u.ci_fsync.fi_nr_written;
1270 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1271 struct cl_io *subio = &sub->sub_io;
1273 lov_io_end_wrapper(sub->sub_env, subio);
1275 if (subio->ci_result == 0)
1276 *written += subio->u.ci_fsync.fi_nr_written;
1281 static const struct cl_io_operations lov_io_ops = {
1284 .cio_fini = lov_io_fini,
1285 .cio_iter_init = lov_io_rw_iter_init,
1286 .cio_iter_fini = lov_io_iter_fini,
1287 .cio_lock = lov_io_lock,
1288 .cio_unlock = lov_io_unlock,
1289 .cio_start = lov_io_start,
1290 .cio_end = lov_io_end
1293 .cio_fini = lov_io_fini,
1294 .cio_iter_init = lov_io_rw_iter_init,
1295 .cio_iter_fini = lov_io_iter_fini,
1296 .cio_lock = lov_io_lock,
1297 .cio_unlock = lov_io_unlock,
1298 .cio_start = lov_io_start,
1299 .cio_end = lov_io_end
1302 .cio_fini = lov_io_fini,
1303 .cio_iter_init = lov_io_setattr_iter_init,
1304 .cio_iter_fini = lov_io_iter_fini,
1305 .cio_lock = lov_io_lock,
1306 .cio_unlock = lov_io_unlock,
1307 .cio_start = lov_io_start,
1308 .cio_end = lov_io_end
1310 [CIT_DATA_VERSION] = {
1311 .cio_fini = lov_io_fini,
1312 .cio_iter_init = lov_io_iter_init,
1313 .cio_iter_fini = lov_io_iter_fini,
1314 .cio_lock = lov_io_lock,
1315 .cio_unlock = lov_io_unlock,
1316 .cio_start = lov_io_start,
1317 .cio_end = lov_io_data_version_end,
1320 .cio_fini = lov_io_fini,
1321 .cio_iter_init = lov_io_iter_init,
1322 .cio_iter_fini = lov_io_iter_fini,
1323 .cio_lock = lov_io_lock,
1324 .cio_unlock = lov_io_unlock,
1325 .cio_start = lov_io_fault_start,
1326 .cio_end = lov_io_end
1329 .cio_fini = lov_io_fini,
1330 .cio_iter_init = lov_io_iter_init,
1331 .cio_iter_fini = lov_io_iter_fini,
1332 .cio_lock = lov_io_lock,
1333 .cio_unlock = lov_io_unlock,
1334 .cio_start = lov_io_start,
1335 .cio_end = lov_io_fsync_end
1338 .cio_fini = lov_io_fini,
1339 .cio_iter_init = lov_io_iter_init,
1340 .cio_iter_fini = lov_io_iter_fini,
1341 .cio_lock = lov_io_lock,
1342 .cio_unlock = lov_io_unlock,
1343 .cio_start = lov_io_start,
1344 .cio_end = lov_io_end
1347 .cio_fini = lov_io_fini,
1350 .cio_fini = lov_io_fini
1353 .cio_read_ahead = lov_io_read_ahead,
1354 .cio_submit = lov_io_submit,
1355 .cio_commit_async = lov_io_commit_async,
1358 /*****************************************************************************
1360 * Empty lov io operations.
1364 static void lov_empty_io_fini(const struct lu_env *env,
1365 const struct cl_io_slice *ios)
1367 struct lov_object *lov = cl2lov(ios->cis_obj);
1370 if (atomic_dec_and_test(&lov->lo_active_ios))
1371 wake_up_all(&lov->lo_waitq);
1375 static int lov_empty_io_submit(const struct lu_env *env,
1376 const struct cl_io_slice *ios,
1377 enum cl_req_type crt, struct cl_2queue *queue)
1382 static void lov_empty_impossible(const struct lu_env *env,
1383 struct cl_io_slice *ios)
1388 #define LOV_EMPTY_IMPOSSIBLE ((void *)lov_empty_impossible)
1391 * An io operation vector for files without stripes.
1393 static const struct cl_io_operations lov_empty_io_ops = {
1396 .cio_fini = lov_empty_io_fini,
1398 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1399 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1400 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1401 .cio_end = LOV_EMPTY_IMPOSSIBLE
1405 .cio_fini = lov_empty_io_fini,
1406 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1407 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1408 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1409 .cio_end = LOV_EMPTY_IMPOSSIBLE
1412 .cio_fini = lov_empty_io_fini,
1413 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1414 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1415 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1416 .cio_end = LOV_EMPTY_IMPOSSIBLE
1419 .cio_fini = lov_empty_io_fini,
1420 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1421 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1422 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1423 .cio_end = LOV_EMPTY_IMPOSSIBLE
1426 .cio_fini = lov_empty_io_fini
1429 .cio_fini = lov_empty_io_fini
1432 .cio_fini = lov_empty_io_fini
1435 .cio_fini = lov_empty_io_fini
1438 .cio_submit = lov_empty_io_submit,
1439 .cio_commit_async = LOV_EMPTY_IMPOSSIBLE
1442 int lov_io_init_composite(const struct lu_env *env, struct cl_object *obj,
1445 struct lov_io *lio = lov_env_io(env);
1446 struct lov_object *lov = cl2lov(obj);
1451 INIT_LIST_HEAD(&lio->lis_active);
1452 result = lov_io_slice_init(lio, lov, io);
1456 result = lov_io_subio_init(env, lio, io);
1458 cl_io_slice_add(io, &lio->lis_cl, obj, &lov_io_ops);
1459 atomic_inc(&lov->lo_active_ios);
1463 io->ci_result = result < 0 ? result : 0;
1467 int lov_io_init_empty(const struct lu_env *env, struct cl_object *obj,
1470 struct lov_object *lov = cl2lov(obj);
1471 struct lov_io *lio = lov_env_io(env);
1475 lio->lis_object = lov;
1476 switch (io->ci_type) {
1487 case CIT_DATA_VERSION:
1495 CERROR("Page fault on a file without stripes: "DFID"\n",
1496 PFID(lu_object_fid(&obj->co_lu)));
1500 cl_io_slice_add(io, &lio->lis_cl, obj, &lov_empty_io_ops);
1501 atomic_inc(&lov->lo_active_ios);
1504 io->ci_result = result < 0 ? result : 0;
1508 int lov_io_init_released(const struct lu_env *env, struct cl_object *obj,
1511 struct lov_object *lov = cl2lov(obj);
1512 struct lov_io *lio = lov_env_io(env);
1516 LASSERT(lov->lo_lsm != NULL);
1517 lio->lis_object = lov;
1519 switch (io->ci_type) {
1521 LASSERTF(0, "invalid type %d\n", io->ci_type);
1522 result = -EOPNOTSUPP;
1528 case CIT_DATA_VERSION:
1533 * the truncate to 0 is managed by MDT:
1534 * - in open, for open O_TRUNC
1535 * - in setattr, for truncate
1537 /* the truncate is for size > 0 so triggers a restore */
1538 if (cl_io_is_trunc(io)) {
1539 io->ci_restore_needed = 1;
1547 io->ci_restore_needed = 1;
1553 cl_io_slice_add(io, &lio->lis_cl, obj, &lov_empty_io_ops);
1554 atomic_inc(&lov->lo_active_ios);
1557 io->ci_result = result < 0 ? result : 0;
1562 * Return the index in composite:lo_entries by the file offset
1564 int lov_io_layout_at(struct lov_io *lio, __u64 offset)
1566 struct lov_object *lov = lio->lis_object;
1567 struct lov_layout_composite *comp = &lov->u.composite;
1568 int start_index = 0;
1569 int end_index = comp->lo_entry_count - 1;
1572 LASSERT(lov->lo_type == LLT_COMP);
1574 /* This is actual file offset so nothing can cover eof. */
1575 if (offset == LUSTRE_EOF)
1578 if (lov_is_flr(lov)) {
1579 struct lov_mirror_entry *lre;
1581 LASSERT(lio->lis_mirror_index >= 0);
1583 lre = &comp->lo_mirrors[lio->lis_mirror_index];
1584 start_index = lre->lre_start;
1585 end_index = lre->lre_end;
1588 for (i = start_index; i <= end_index; i++) {
1589 struct lov_layout_entry *lle = lov_entry(lov, i);
1591 if ((offset >= lle->lle_extent->e_start &&
1592 offset < lle->lle_extent->e_end) ||
1593 (offset == OBD_OBJECT_EOF &&
1594 lle->lle_extent->e_end == OBD_OBJECT_EOF))