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/
31 * Implementation of cl_io for LOV layer.
33 * Author: Nikita Danilov <nikita.danilov@sun.com>
34 * Author: Jinshan Xiong <jinshan.xiong@whamcloud.com>
37 #define DEBUG_SUBSYSTEM S_LOV
39 #include "lov_cl_internal.h"
45 static inline struct lov_io_sub *lov_sub_alloc(struct lov_io *lio, int index)
47 struct lov_io_sub *sub;
49 if (lio->lis_nr_subios == 0) {
50 LASSERT(lio->lis_single_subio_index == -1);
51 sub = &lio->lis_single_subio;
52 lio->lis_single_subio_index = index;
53 memset(sub, 0, sizeof(*sub));
59 INIT_LIST_HEAD(&sub->sub_list);
60 INIT_LIST_HEAD(&sub->sub_linkage);
61 sub->sub_subio_index = index;
67 static inline void lov_sub_free(struct lov_io *lio, struct lov_io_sub *sub)
69 if (sub->sub_subio_index == lio->lis_single_subio_index) {
70 LASSERT(sub == &lio->lis_single_subio);
71 lio->lis_single_subio_index = -1;
77 static void lov_io_sub_fini(const struct lu_env *env, struct lov_io *lio,
78 struct lov_io_sub *sub)
82 cl_io_fini(sub->sub_env, &sub->sub_io);
84 if (sub->sub_env && !IS_ERR(sub->sub_env)) {
85 cl_env_put(sub->sub_env, &sub->sub_refcheck);
92 is_index_within_mirror(struct lov_object *lov, int index, int mirror_index)
94 struct lov_layout_composite *comp = &lov->u.composite;
95 struct lov_mirror_entry *lre = &comp->lo_mirrors[mirror_index];
97 return (index >= lre->lre_start && index <= lre->lre_end);
100 static int lov_io_sub_init(const struct lu_env *env, struct lov_io *lio,
101 struct lov_io_sub *sub)
103 struct lov_object *lov = lio->lis_object;
104 struct cl_io *sub_io;
105 struct cl_object *sub_obj;
106 struct cl_io *io = lio->lis_cl.cis_io;
107 int index = lov_comp_entry(sub->sub_subio_index);
108 int stripe = lov_comp_stripe(sub->sub_subio_index);
110 LASSERT(sub->sub_env == NULL);
113 if (unlikely(!lov_r0(lov, index)->lo_sub ||
114 !lov_r0(lov, index)->lo_sub[stripe]))
117 LASSERTF(ergo(lov_is_flr(lov),
118 is_index_within_mirror(lov, index,
119 lio->lis_mirror_index)),
120 DFID "iot = %d, index = %d, mirror = %d\n",
121 PFID(lu_object_fid(lov2lu(lov))), io->ci_type, index,
122 lio->lis_mirror_index);
124 /* obtain new environment */
125 sub->sub_env = cl_env_get(&sub->sub_refcheck);
126 if (IS_ERR(sub->sub_env)) {
127 result = PTR_ERR(sub->sub_env);
131 sub_obj = lovsub2cl(lov_r0(lov, index)->lo_sub[stripe]);
132 sub_io = &sub->sub_io;
134 sub_io->ci_obj = sub_obj;
135 sub_io->ci_result = 0;
137 sub_io->ci_parent = io;
138 sub_io->ci_lockreq = io->ci_lockreq;
139 sub_io->ci_type = io->ci_type;
140 sub_io->ci_no_srvlock = io->ci_no_srvlock;
141 sub_io->ci_noatime = io->ci_noatime;
142 sub_io->ci_async_readahead = io->ci_async_readahead;
143 sub_io->ci_lock_no_expand = io->ci_lock_no_expand;
144 sub_io->ci_ndelay = io->ci_ndelay;
145 sub_io->ci_layout_version = io->ci_layout_version;
146 sub_io->ci_tried_all_mirrors = io->ci_tried_all_mirrors;
148 result = cl_io_sub_init(sub->sub_env, sub_io, io->ci_type, sub_obj);
151 lov_io_sub_fini(env, lio, sub);
156 struct lov_io_sub *lov_sub_get(const struct lu_env *env,
157 struct lov_io *lio, int index)
159 struct lov_io_sub *sub;
164 list_for_each_entry(sub, &lio->lis_subios, sub_list) {
165 if (sub->sub_subio_index == index) {
172 sub = lov_sub_alloc(lio, index);
174 GOTO(out, rc = -ENOMEM);
176 rc = lov_io_sub_init(env, lio, sub);
178 lov_sub_free(lio, sub);
182 list_add_tail(&sub->sub_list, &lio->lis_subios);
183 lio->lis_nr_subios++;
189 sub->sub_io.ci_noquota = lio->lis_cl.cis_io->ci_noquota;
193 /*****************************************************************************
198 static int lov_io_subio_init(const struct lu_env *env, struct lov_io *lio,
203 LASSERT(lio->lis_object != NULL);
205 INIT_LIST_HEAD(&lio->lis_subios);
206 lio->lis_single_subio_index = -1;
207 lio->lis_nr_subios = 0;
213 * Decide if it will need write intent RPC
215 static int lov_io_mirror_write_intent(struct lov_io *lio,
216 struct lov_object *obj, struct cl_io *io)
218 struct lov_layout_composite *comp = &obj->u.composite;
219 struct lu_extent *ext = &io->ci_write_intent;
220 struct lov_mirror_entry *lre;
221 struct lov_mirror_entry *primary;
222 struct lov_layout_entry *lle;
226 *ext = (typeof(*ext)) { lio->lis_pos, lio->lis_endpos };
227 io->ci_need_write_intent = 0;
229 if (!(io->ci_type == CIT_WRITE || cl_io_is_trunc(io) ||
230 cl_io_is_mkwrite(io)))
234 * FLR: check if it needs to send a write intent RPC to server.
235 * Writing to sync_pending file needs write intent RPC to change
236 * the file state back to write_pending, so that the layout version
237 * can be increased when the state changes to sync_pending at a later
238 * time. Otherwise there exists a chance that an evicted client may
239 * dirty the file data while resync client is working on it.
240 * Designated I/O is allowed for resync workload.
242 if (lov_flr_state(obj) == LCM_FL_RDONLY ||
243 (lov_flr_state(obj) == LCM_FL_SYNC_PENDING &&
244 io->ci_designated_mirror == 0)) {
245 io->ci_need_write_intent = 1;
249 LASSERT((lov_flr_state(obj) == LCM_FL_WRITE_PENDING));
250 LASSERT(comp->lo_preferred_mirror >= 0);
253 * need to iterate all components to see if there are
254 * multiple components covering the writing component
256 primary = &comp->lo_mirrors[comp->lo_preferred_mirror];
257 LASSERT(!primary->lre_stale);
258 lov_foreach_mirror_layout_entry(obj, lle, primary) {
259 LASSERT(lle->lle_valid);
260 if (!lu_extent_is_overlapped(ext, lle->lle_extent))
263 ext->e_start = min(ext->e_start, lle->lle_extent->e_start);
264 ext->e_end = max(ext->e_end, lle->lle_extent->e_end);
268 CERROR(DFID ": cannot find any valid components covering "
269 "file extent "DEXT", mirror: %d\n",
270 PFID(lu_object_fid(lov2lu(obj))), PEXT(ext),
271 primary->lre_mirror_id);
276 lov_foreach_mirror_entry(obj, lre) {
280 lov_foreach_mirror_layout_entry(obj, lle, lre) {
284 if (lu_extent_is_overlapped(ext, lle->lle_extent)) {
291 CDEBUG(D_VFSTRACE, DFID "there are %zd components to be staled to "
292 "modify file extent "DEXT", iot: %d\n",
293 PFID(lu_object_fid(lov2lu(obj))), count, PEXT(ext), io->ci_type);
295 io->ci_need_write_intent = count > 0;
300 static int lov_io_mirror_init(struct lov_io *lio, struct lov_object *obj,
303 struct lov_layout_composite *comp = &obj->u.composite;
309 if (!lov_is_flr(obj)) {
310 /* only locks/pages are manipulated for CIT_MISC op, no
311 * cl_io_loop() will be called, don't check/set mirror info.
313 if (io->ci_type != CIT_MISC) {
314 LASSERT(comp->lo_preferred_mirror == 0);
315 lio->lis_mirror_index = comp->lo_preferred_mirror;
321 /* transfer the layout version for verification */
322 if (io->ci_layout_version == 0)
323 io->ci_layout_version = obj->lo_lsm->lsm_layout_gen;
325 /* find the corresponding mirror for designated mirror IO */
326 if (io->ci_designated_mirror > 0) {
327 struct lov_mirror_entry *entry;
329 LASSERT(!io->ci_ndelay);
331 CDEBUG(D_LAYOUT, "designated I/O mirror state: %d\n",
334 if ((cl_io_is_trunc(io) || io->ci_type == CIT_WRITE) &&
335 (io->ci_layout_version != obj->lo_lsm->lsm_layout_gen)) {
337 * For resync I/O, the ci_layout_version was the layout
338 * version when resync starts. If it doesn't match the
339 * current object layout version, it means the layout
345 io->ci_layout_version |= LU_LAYOUT_RESYNC;
348 lio->lis_mirror_index = -1;
349 lov_foreach_mirror_entry(obj, entry) {
350 if (entry->lre_mirror_id ==
351 io->ci_designated_mirror) {
352 lio->lis_mirror_index = index;
359 RETURN(lio->lis_mirror_index < 0 ? -EINVAL : 0);
362 result = lov_io_mirror_write_intent(lio, obj, io);
366 if (io->ci_need_write_intent) {
367 CDEBUG(D_VFSTRACE, DFID " need write intent for [%llu, %llu)\n",
368 PFID(lu_object_fid(lov2lu(obj))),
369 lio->lis_pos, lio->lis_endpos);
371 if (cl_io_is_trunc(io)) {
373 * for truncate, we uses [size, EOF) to judge whether
374 * a write intent needs to be send, but we need to
375 * restore the write extent to [0, size], in truncate,
376 * the byte in the size position is accessed.
378 io->ci_write_intent.e_start = 0;
379 io->ci_write_intent.e_end =
380 io->u.ci_setattr.sa_attr.lvb_size + 1;
382 /* stop cl_io_init() loop */
386 if (io->ci_ndelay_tried == 0 || /* first time to try */
387 /* reset the mirror index if layout has changed */
388 lio->lis_mirror_layout_gen != obj->lo_lsm->lsm_layout_gen) {
389 lio->lis_mirror_layout_gen = obj->lo_lsm->lsm_layout_gen;
390 index = lio->lis_mirror_index = comp->lo_preferred_mirror;
392 index = lio->lis_mirror_index;
395 /* move mirror index to the next one */
396 index = (index + 1) % comp->lo_mirror_count;
399 for (i = 0; i < comp->lo_mirror_count; i++) {
400 struct lu_extent ext = { .e_start = lio->lis_pos,
401 .e_end = lio->lis_pos + 1 };
402 struct lov_mirror_entry *lre;
403 struct lov_layout_entry *lle;
406 lre = &comp->lo_mirrors[(index + i) % comp->lo_mirror_count];
410 if (lre->lre_foreign)
413 lov_foreach_mirror_layout_entry(obj, lle, lre) {
417 if (lu_extent_is_overlapped(&ext, lle->lle_extent)) {
421 } /* each component of the mirror */
423 index = (index + i) % comp->lo_mirror_count;
428 if (i == comp->lo_mirror_count) {
429 CERROR(DFID": failed to find a component covering "
430 "I/O region at %llu\n",
431 PFID(lu_object_fid(lov2lu(obj))), lio->lis_pos);
433 dump_lsm(D_ERROR, obj->lo_lsm);
438 CDEBUG(D_VFSTRACE, DFID ": flr state: %d, move mirror from %d to %d, "
439 "have retried: %d, mirror count: %d\n",
440 PFID(lu_object_fid(lov2lu(obj))), lov_flr_state(obj),
441 lio->lis_mirror_index, index, io->ci_ndelay_tried,
442 comp->lo_mirror_count);
444 lio->lis_mirror_index = index;
447 * FLR: if all mirrors have been tried once, most likely the network
448 * of this client has been partitioned. We should relinquish CPU for
449 * a while before trying again.
451 if (io->ci_ndelay && io->ci_ndelay_tried > 0 &&
452 (io->ci_ndelay_tried % comp->lo_mirror_count == 0)) {
453 schedule_timeout_interruptible(cfs_time_seconds(1) / 100);
454 if (signal_pending(current))
458 * we'd set ci_tried_all_mirrors to turn off fast mirror
459 * switching for read after we've tried all mirrors several
462 io->ci_tried_all_mirrors = io->ci_ndelay_tried %
463 (comp->lo_mirror_count * 4) == 0;
465 ++io->ci_ndelay_tried;
467 CDEBUG(D_VFSTRACE, "use %sdelayed RPC state for this IO\n",
468 io->ci_ndelay ? "non-" : "");
473 static int lov_io_slice_init(struct lov_io *lio,
474 struct lov_object *obj, struct cl_io *io)
481 lio->lis_object = obj;
483 switch (io->ci_type) {
486 lio->lis_pos = io->u.ci_rw.crw_pos;
487 lio->lis_endpos = io->u.ci_rw.crw_pos + io->u.ci_rw.crw_count;
488 lio->lis_io_endpos = lio->lis_endpos;
489 if (cl_io_is_append(io)) {
490 LASSERT(io->ci_type == CIT_WRITE);
493 * If there is LOV EA hole, then we may cannot locate
494 * the current file-tail exactly.
496 if (unlikely(obj->lo_lsm->lsm_entries[0]->lsme_pattern &
498 GOTO(out, result = -EIO);
501 lio->lis_endpos = OBD_OBJECT_EOF;
506 if (cl_io_is_fallocate(io)) {
507 lio->lis_pos = io->u.ci_setattr.sa_falloc_offset;
508 lio->lis_endpos = io->u.ci_setattr.sa_falloc_end;
509 } else if (cl_io_is_trunc(io)) {
510 lio->lis_pos = io->u.ci_setattr.sa_attr.lvb_size;
511 lio->lis_endpos = OBD_OBJECT_EOF;
514 lio->lis_endpos = OBD_OBJECT_EOF;
518 case CIT_DATA_VERSION:
520 lio->lis_endpos = OBD_OBJECT_EOF;
524 pgoff_t index = io->u.ci_fault.ft_index;
526 lio->lis_pos = cl_offset(io->ci_obj, index);
527 lio->lis_endpos = cl_offset(io->ci_obj, index + 1);
532 lio->lis_pos = io->u.ci_fsync.fi_start;
533 lio->lis_endpos = io->u.ci_fsync.fi_end;
538 lio->lis_pos = io->u.ci_ladvise.li_start;
539 lio->lis_endpos = io->u.ci_ladvise.li_end;
544 lio->lis_pos = io->u.ci_lseek.ls_start;
545 lio->lis_endpos = OBD_OBJECT_EOF;
551 lio->lis_endpos = OBD_OBJECT_EOF;
553 if (lov_flr_state(obj) == LCM_FL_RDONLY &&
554 !OBD_FAIL_CHECK(OBD_FAIL_FLR_GLIMPSE_IMMUTABLE))
555 /* SoM is accurate, no need glimpse */
556 GOTO(out, result = 1);
561 lio->lis_endpos = OBD_OBJECT_EOF;
569 * CIT_MISC + ci_ignore_layout can identify the I/O from the OSC layer,
570 * it won't care/access lov layout related info.
572 if (io->ci_ignore_layout && io->ci_type == CIT_MISC)
573 GOTO(out, result = 0);
575 LASSERT(obj->lo_lsm != NULL);
577 result = lov_io_mirror_init(lio, obj, io);
581 /* check if it needs to instantiate layout */
582 if (!(io->ci_type == CIT_WRITE || cl_io_is_mkwrite(io) ||
583 cl_io_is_fallocate(io) ||
584 (cl_io_is_trunc(io) && io->u.ci_setattr.sa_attr.lvb_size > 0)))
585 GOTO(out, result = 0);
588 * for truncate, it only needs to instantiate the components
589 * before the truncated size.
591 if (cl_io_is_trunc(io)) {
592 io->ci_write_intent.e_start = 0;
593 /* for writes, e_end is endpos, the location of the file
594 * pointer after the write is completed, so it is not accessed.
595 * For truncate, 'end' is the size, and *is* acccessed.
596 * In other words, writes are [start, end), but truncate is
597 * [start, size], where both are included. So add 1 to the
598 * size when creating the write intent to account for this.
600 io->ci_write_intent.e_end =
601 io->u.ci_setattr.sa_attr.lvb_size + 1;
603 io->ci_write_intent.e_start = lio->lis_pos;
604 io->ci_write_intent.e_end = lio->lis_endpos;
608 lov_foreach_io_layout(index, lio, &io->ci_write_intent) {
609 if (!lsm_entry_inited(obj->lo_lsm, index)) {
610 io->ci_need_write_intent = 1;
615 if (io->ci_need_write_intent && io->ci_designated_mirror > 0) {
617 * REINT_SYNC RPC has already tried to instantiate all of the
618 * components involved, obviously it didn't succeed. Skip this
619 * mirror for now. The server won't be able to figure out
620 * which mirror it should instantiate components
622 CERROR(DFID": trying to instantiate components for designated "
623 "I/O, file state: %d\n",
624 PFID(lu_object_fid(lov2lu(obj))), lov_flr_state(obj));
626 io->ci_need_write_intent = 0;
627 GOTO(out, result = -EIO);
630 if (io->ci_need_write_intent)
631 GOTO(out, result = 1);
639 static void lov_io_fini(const struct lu_env *env, const struct cl_io_slice *ios)
641 struct lov_io *lio = cl2lov_io(env, ios);
642 struct lov_object *lov = cl2lov(ios->cis_obj);
646 LASSERT(list_empty(&lio->lis_active));
648 while (!list_empty(&lio->lis_subios)) {
649 struct lov_io_sub *sub = list_entry(lio->lis_subios.next,
653 list_del_init(&sub->sub_list);
654 lio->lis_nr_subios--;
656 lov_io_sub_fini(env, lio, sub);
657 lov_sub_free(lio, sub);
659 LASSERT(lio->lis_nr_subios == 0);
661 LASSERT(atomic_read(&lov->lo_active_ios) > 0);
662 if (atomic_dec_and_test(&lov->lo_active_ios))
663 wake_up(&lov->lo_waitq);
667 static void lov_io_sub_inherit(struct lov_io_sub *sub, struct lov_io *lio,
668 loff_t start, loff_t end)
670 struct cl_io *io = &sub->sub_io;
671 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
672 struct cl_io *parent = lio->lis_cl.cis_io;
673 int index = lov_comp_entry(sub->sub_subio_index);
674 int stripe = lov_comp_stripe(sub->sub_subio_index);
676 switch (io->ci_type) {
678 io->u.ci_setattr.sa_attr = parent->u.ci_setattr.sa_attr;
679 io->u.ci_setattr.sa_attr_flags =
680 parent->u.ci_setattr.sa_attr_flags;
681 io->u.ci_setattr.sa_avalid = parent->u.ci_setattr.sa_avalid;
682 io->u.ci_setattr.sa_xvalid = parent->u.ci_setattr.sa_xvalid;
683 io->u.ci_setattr.sa_falloc_mode =
684 parent->u.ci_setattr.sa_falloc_mode;
685 io->u.ci_setattr.sa_stripe_index = stripe;
686 io->u.ci_setattr.sa_parent_fid =
687 parent->u.ci_setattr.sa_parent_fid;
688 /* For SETATTR(fallocate) pass the subtype to lower IO */
689 io->u.ci_setattr.sa_subtype = parent->u.ci_setattr.sa_subtype;
690 if (cl_io_is_fallocate(io)) {
691 io->u.ci_setattr.sa_falloc_offset = start;
692 io->u.ci_setattr.sa_falloc_end = end;
694 if (cl_io_is_trunc(io)) {
695 loff_t new_size = parent->u.ci_setattr.sa_attr.lvb_size;
697 new_size = lov_size_to_stripe(lsm, index, new_size,
699 io->u.ci_setattr.sa_attr.lvb_size = new_size;
701 lov_lsm2layout(lsm, lsm->lsm_entries[index],
702 &io->u.ci_setattr.sa_layout);
705 case CIT_DATA_VERSION: {
706 io->u.ci_data_version.dv_data_version = 0;
707 io->u.ci_data_version.dv_flags =
708 parent->u.ci_data_version.dv_flags;
712 struct cl_object *obj = parent->ci_obj;
713 loff_t off = cl_offset(obj, parent->u.ci_fault.ft_index);
715 io->u.ci_fault = parent->u.ci_fault;
716 off = lov_size_to_stripe(lsm, index, off, stripe);
717 io->u.ci_fault.ft_index = cl_index(obj, off);
721 io->u.ci_fsync.fi_start = start;
722 io->u.ci_fsync.fi_end = end;
723 io->u.ci_fsync.fi_fid = parent->u.ci_fsync.fi_fid;
724 io->u.ci_fsync.fi_mode = parent->u.ci_fsync.fi_mode;
729 io->u.ci_wr.wr_sync = cl_io_is_sync_write(parent);
730 io->ci_tried_all_mirrors = parent->ci_tried_all_mirrors;
731 if (cl_io_is_append(parent)) {
732 io->u.ci_wr.wr_append = 1;
734 io->u.ci_rw.crw_pos = start;
735 io->u.ci_rw.crw_count = end - start;
740 io->u.ci_ladvise.li_start = start;
741 io->u.ci_ladvise.li_end = end;
742 io->u.ci_ladvise.li_fid = parent->u.ci_ladvise.li_fid;
743 io->u.ci_ladvise.li_advice = parent->u.ci_ladvise.li_advice;
744 io->u.ci_ladvise.li_flags = parent->u.ci_ladvise.li_flags;
748 io->u.ci_lseek.ls_start = start;
749 io->u.ci_lseek.ls_whence = parent->u.ci_lseek.ls_whence;
750 io->u.ci_lseek.ls_result = parent->u.ci_lseek.ls_result;
760 static loff_t lov_offset_mod(loff_t val, int delta)
762 if (val != OBD_OBJECT_EOF)
767 static int lov_io_add_sub(const struct lu_env *env, struct lov_io *lio,
768 struct lov_io_sub *sub, u64 start, u64 end)
772 end = lov_offset_mod(end, 1);
773 lov_io_sub_inherit(sub, lio, start, end);
774 rc = cl_io_iter_init(sub->sub_env, &sub->sub_io);
776 cl_io_iter_fini(sub->sub_env, &sub->sub_io);
780 list_add_tail(&sub->sub_linkage, &lio->lis_active);
784 static int lov_io_iter_init(const struct lu_env *env,
785 const struct cl_io_slice *ios)
787 struct lov_io *lio = cl2lov_io(env, ios);
788 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
789 struct lov_io_sub *sub;
790 struct lu_extent ext;
796 ext.e_start = lio->lis_pos;
797 ext.e_end = lio->lis_endpos;
799 lov_foreach_io_layout(index, lio, &ext) {
800 struct lov_layout_entry *le = lov_entry(lio->lis_object, index);
801 struct lov_layout_raid0 *r0 = &le->lle_raid0;
805 bool tested_trunc_stripe = false;
807 r0->lo_trunc_stripeno = -1;
809 CDEBUG(D_VFSTRACE, "component[%d] flags %#x\n",
810 index, lsm->lsm_entries[index]->lsme_flags);
811 if (!lsm_entry_inited(lsm, index)) {
813 * Read from uninitialized components should return
819 if (lsm_entry_is_foreign(lsm, index))
822 if (!le->lle_valid && !ios->cis_io->ci_designated_mirror) {
823 CERROR("I/O to invalid component: %d, mirror: %d\n",
824 index, lio->lis_mirror_index);
828 for (stripe = 0; stripe < r0->lo_nr; stripe++) {
829 if (!lov_stripe_intersects(lsm, index, stripe,
833 if (unlikely(!r0->lo_sub[stripe])) {
834 if (ios->cis_io->ci_type == CIT_READ ||
835 ios->cis_io->ci_type == CIT_WRITE ||
836 ios->cis_io->ci_type == CIT_FAULT)
842 if (cl_io_is_trunc(ios->cis_io) &&
843 !tested_trunc_stripe) {
847 prev = (stripe == 0) ? r0->lo_nr - 1 :
850 * Only involving previous stripe if the
851 * truncate in this component is at the
852 * beginning of this stripe.
854 tested_trunc_stripe = true;
855 if (ext.e_start < lsm->lsm_entries[index]->
856 lsme_extent.e_start) {
857 /* need previous stripe involvement */
858 r0->lo_trunc_stripeno = prev;
860 tr_start = ext.e_start;
861 tr_start = lov_do_div64(tr_start,
862 stripe_width(lsm, index));
863 /* tr_start %= stripe_swidth */
864 if (tr_start == stripe * lsm->
867 r0->lo_trunc_stripeno = prev;
871 /* if the last stripe is the trunc stripeno */
872 if (r0->lo_trunc_stripeno == stripe)
873 r0->lo_trunc_stripeno = -1;
875 sub = lov_sub_get(env, lio,
876 lov_comp_index(index, stripe));
880 rc = lov_io_add_sub(env, lio, sub, start, end);
887 if (r0->lo_trunc_stripeno != -1) {
888 stripe = r0->lo_trunc_stripeno;
889 if (unlikely(!r0->lo_sub[stripe])) {
890 r0->lo_trunc_stripeno = -1;
893 sub = lov_sub_get(env, lio,
894 lov_comp_index(index, stripe));
899 * the prev sub could be used by another truncate, we'd
900 * skip it. LU-14128 happends when expand truncate +
901 * read get wrong kms.
903 if (!list_empty(&sub->sub_linkage)) {
904 r0->lo_trunc_stripeno = -1;
908 (void)lov_stripe_intersects(lsm, index, stripe, &ext,
910 rc = lov_io_add_sub(env, lio, sub, start, end);
919 static int lov_io_rw_iter_init(const struct lu_env *env,
920 const struct cl_io_slice *ios)
922 struct lov_io *lio = cl2lov_io(env, ios);
923 struct cl_io *io = ios->cis_io;
924 struct lov_stripe_md_entry *lse;
925 loff_t start = io->u.ci_rw.crw_pos;
929 LASSERT(io->ci_type == CIT_READ || io->ci_type == CIT_WRITE);
932 if (cl_io_is_append(io))
933 RETURN(lov_io_iter_init(env, ios));
935 index = lov_io_layout_at(lio, io->u.ci_rw.crw_pos);
936 if (index < 0) { /* non-existing layout component */
937 if (io->ci_type == CIT_READ) {
939 * TODO: it needs to detect the next component and
940 * then set the next pos
944 RETURN(lov_io_iter_init(env, ios));
950 if (!lov_entry(lio->lis_object, index)->lle_valid &&
951 !io->ci_designated_mirror)
952 RETURN(io->ci_type == CIT_READ ? -EAGAIN : -EIO);
954 lse = lov_lse(lio->lis_object, index);
956 if (lsme_is_foreign(lse))
959 next = MAX_LFS_FILESIZE;
960 if (lse->lsme_stripe_count > 1) {
961 unsigned long ssize = lse->lsme_stripe_size;
963 lov_do_div64(start, ssize);
964 next = (start + 1) * ssize;
965 if (next <= start * ssize)
966 next = MAX_LFS_FILESIZE;
969 LASSERTF(io->u.ci_rw.crw_pos >= lse->lsme_extent.e_start,
970 "pos %lld, [%lld, %lld)\n", io->u.ci_rw.crw_pos,
971 lse->lsme_extent.e_start, lse->lsme_extent.e_end);
972 next = min_t(__u64, next, lse->lsme_extent.e_end);
973 next = min_t(loff_t, next, lio->lis_io_endpos);
975 io->ci_continue = next < lio->lis_io_endpos;
976 io->u.ci_rw.crw_count = next - io->u.ci_rw.crw_pos;
977 lio->lis_pos = io->u.ci_rw.crw_pos;
978 lio->lis_endpos = io->u.ci_rw.crw_pos + io->u.ci_rw.crw_count;
980 "stripe: %llu chunk: [%llu, %llu) %llu, %zd\n",
981 (__u64)start, lio->lis_pos, lio->lis_endpos,
982 (__u64)lio->lis_io_endpos, io->u.ci_rw.crw_count);
985 * XXX The following call should be optimized: we know, that
986 * [lio->lis_pos, lio->lis_endpos) intersects with exactly one stripe.
988 RETURN(lov_io_iter_init(env, ios));
991 static int lov_io_setattr_iter_init(const struct lu_env *env,
992 const struct cl_io_slice *ios)
994 struct lov_io *lio = cl2lov_io(env, ios);
995 struct cl_io *io = ios->cis_io;
999 if (cl_io_is_trunc(io) && lio->lis_pos > 0) {
1000 index = lov_io_layout_at(lio, lio->lis_pos - 1);
1001 /* no entry found for such offset */
1003 RETURN(io->ci_result = -ENODATA);
1006 RETURN(lov_io_iter_init(env, ios));
1009 static int lov_io_call(const struct lu_env *env, struct lov_io *lio,
1010 int (*iofunc)(const struct lu_env *, struct cl_io *))
1012 struct cl_io *parent = lio->lis_cl.cis_io;
1013 struct lov_io_sub *sub;
1017 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1018 rc = iofunc(sub->sub_env, &sub->sub_io);
1022 if (parent->ci_result == 0)
1023 parent->ci_result = sub->sub_io.ci_result;
1028 static int lov_io_lock(const struct lu_env *env, const struct cl_io_slice *ios)
1031 RETURN(lov_io_call(env, cl2lov_io(env, ios), cl_io_lock));
1034 static int lov_io_start(const struct lu_env *env, const struct cl_io_slice *ios)
1037 RETURN(lov_io_call(env, cl2lov_io(env, ios), cl_io_start));
1040 static int lov_io_end_wrapper(const struct lu_env *env, struct cl_io *io)
1044 * It's possible that lov_io_start() wasn't called against this
1045 * sub-io, either because previous sub-io failed, or upper layer
1048 if (io->ci_state == CIS_IO_GOING)
1051 io->ci_state = CIS_IO_FINISHED;
1055 static int lov_io_iter_fini_wrapper(const struct lu_env *env, struct cl_io *io)
1057 cl_io_iter_fini(env, io);
1061 static int lov_io_unlock_wrapper(const struct lu_env *env, struct cl_io *io)
1063 cl_io_unlock(env, io);
1067 static void lov_io_end(const struct lu_env *env, const struct cl_io_slice *ios)
1071 rc = lov_io_call(env, cl2lov_io(env, ios), lov_io_end_wrapper);
1076 lov_io_data_version_end(const struct lu_env *env, const struct cl_io_slice *ios)
1078 struct lov_io *lio = cl2lov_io(env, ios);
1079 struct cl_io *parent = lio->lis_cl.cis_io;
1080 struct cl_data_version_io *pdv = &parent->u.ci_data_version;
1081 struct lov_io_sub *sub;
1084 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1085 struct cl_data_version_io *sdv = &sub->sub_io.u.ci_data_version;
1087 lov_io_end_wrapper(sub->sub_env, &sub->sub_io);
1089 pdv->dv_data_version += sdv->dv_data_version;
1090 if (pdv->dv_layout_version > sdv->dv_layout_version)
1091 pdv->dv_layout_version = sdv->dv_layout_version;
1093 if (parent->ci_result == 0)
1094 parent->ci_result = sub->sub_io.ci_result;
1100 static void lov_io_iter_fini(const struct lu_env *env,
1101 const struct cl_io_slice *ios)
1103 struct lov_io *lio = cl2lov_io(env, ios);
1107 rc = lov_io_call(env, lio, lov_io_iter_fini_wrapper);
1109 while (!list_empty(&lio->lis_active))
1110 list_del_init(lio->lis_active.next);
1114 static void lov_io_unlock(const struct lu_env *env,
1115 const struct cl_io_slice *ios)
1120 rc = lov_io_call(env, cl2lov_io(env, ios), lov_io_unlock_wrapper);
1125 static int lov_io_read_ahead(const struct lu_env *env,
1126 const struct cl_io_slice *ios,
1127 pgoff_t start, struct cl_read_ahead *ra)
1129 struct lov_io *lio = cl2lov_io(env, ios);
1130 struct lov_object *loo = lio->lis_object;
1131 struct cl_object *obj = lov2cl(loo);
1132 struct lov_layout_raid0 *r0;
1133 struct lov_io_sub *sub;
1137 unsigned int pps; /* pages per stripe */
1143 offset = cl_offset(obj, start);
1144 index = lov_io_layout_at(lio, offset);
1145 if (index < 0 || !lsm_entry_inited(loo->lo_lsm, index) ||
1146 lsm_entry_is_foreign(loo->lo_lsm, index))
1149 /* avoid readahead to expand to stale components */
1150 if (!lov_entry(loo, index)->lle_valid)
1153 stripe = lov_stripe_number(loo->lo_lsm, index, offset);
1155 r0 = lov_r0(loo, index);
1156 if (unlikely(!r0->lo_sub[stripe]))
1159 sub = lov_sub_get(env, lio, lov_comp_index(index, stripe));
1161 RETURN(PTR_ERR(sub));
1163 lov_stripe_offset(loo->lo_lsm, index, offset, stripe, &suboff);
1164 rc = cl_io_read_ahead(sub->sub_env, &sub->sub_io,
1165 cl_index(lovsub2cl(r0->lo_sub[stripe]), suboff),
1168 CDEBUG(D_READA, DFID " cra_end = %lu, stripes = %d, rc = %d\n",
1169 PFID(lu_object_fid(lov2lu(loo))), ra->cra_end_idx,
1175 * Adjust the stripe index by layout of comp. ra->cra_end is the
1176 * maximum page index covered by an underlying DLM lock.
1177 * This function converts cra_end from stripe level to file level, and
1178 * make sure it's not beyond stripe and component boundary.
1181 /* cra_end is stripe level, convert it into file level */
1182 ra_end = ra->cra_end_idx;
1183 if (ra_end != CL_PAGE_EOF)
1184 ra->cra_end_idx = lov_stripe_pgoff(loo->lo_lsm, index,
1187 /* boundary of current component */
1188 ra_end = cl_index(obj, (loff_t)lov_io_extent(lio, index)->e_end);
1189 if (ra_end != CL_PAGE_EOF && ra->cra_end_idx >= ra_end)
1190 ra->cra_end_idx = ra_end - 1;
1192 if (r0->lo_nr == 1) /* single stripe file */
1195 pps = lov_lse(loo, index)->lsme_stripe_size >> PAGE_SHIFT;
1197 CDEBUG(D_READA, DFID " max_index = %lu, pps = %u, index = %d, "
1198 "stripe_size = %u, stripe no = %u, start index = %lu\n",
1199 PFID(lu_object_fid(lov2lu(loo))), ra->cra_end_idx, pps, index,
1200 lov_lse(loo, index)->lsme_stripe_size, stripe, start);
1202 /* never exceed the end of the stripe */
1203 ra->cra_end_idx = min_t(pgoff_t, ra->cra_end_idx,
1204 start + pps - start % pps - 1);
1208 int lov_io_lru_reserve(const struct lu_env *env,
1209 const struct cl_io_slice *ios, loff_t pos, size_t bytes)
1211 struct lov_io *lio = cl2lov_io(env, ios);
1212 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
1213 struct lov_io_sub *sub;
1214 struct lu_extent ext;
1221 ext.e_end = pos + bytes;
1222 lov_foreach_io_layout(index, lio, &ext) {
1223 struct lov_layout_entry *le = lov_entry(lio->lis_object, index);
1224 struct lov_layout_raid0 *r0 = &le->lle_raid0;
1229 if (!lsm_entry_inited(lsm, index))
1232 if (!le->lle_valid && !ios->cis_io->ci_designated_mirror) {
1233 CERROR(DFID": I/O to invalid component: %d, mirror: %d\n",
1234 PFID(lu_object_fid(lov2lu(lio->lis_object))),
1235 index, lio->lis_mirror_index);
1239 for (stripe = 0; stripe < r0->lo_nr; stripe++) {
1240 if (!lov_stripe_intersects(lsm, index, stripe,
1241 &ext, &start, &end))
1244 if (unlikely(!r0->lo_sub[stripe]))
1247 sub = lov_sub_get(env, lio,
1248 lov_comp_index(index, stripe));
1250 return PTR_ERR(sub);
1252 rc = cl_io_lru_reserve(sub->sub_env, &sub->sub_io, start,
1263 * lov implementation of cl_operations::cio_submit() method. It takes a list
1264 * of pages in \a queue, splits it into per-stripe sub-lists, invokes
1265 * cl_io_submit() on underlying devices to submit sub-lists, and then splices
1268 * Major complication of this function is a need to handle memory cleansing:
1269 * cl_io_submit() is called to write out pages as a part of VM memory
1270 * reclamation, and hence it may not fail due to memory shortages (system
1271 * dead-locks otherwise). To deal with this, some resources (sub-lists,
1272 * sub-environment, etc.) are allocated per-device on "startup" (i.e., in a
1273 * not-memory cleansing context), and in case of memory shortage, these
1274 * pre-allocated resources are used by lov_io_submit() under
1275 * lov_device::ld_mutex mutex.
1277 static int lov_io_submit(const struct lu_env *env,
1278 const struct cl_io_slice *ios,
1279 enum cl_req_type crt, struct cl_2queue *queue)
1281 struct cl_page_list *qin = &queue->c2_qin;
1282 struct lov_io *lio = cl2lov_io(env, ios);
1283 struct lov_io_sub *sub;
1284 struct cl_page_list *plist = &lov_env_info(env)->lti_plist;
1285 struct cl_page *page;
1286 struct cl_page *tmp;
1291 cl_page_list_init(plist);
1292 while (qin->pl_nr > 0) {
1293 struct cl_2queue *cl2q = &lov_env_info(env)->lti_cl2q;
1295 page = cl_page_list_first(qin);
1296 if (lov_page_is_empty(page)) {
1297 cl_page_list_move(&queue->c2_qout, qin, page);
1300 * it could only be mirror read to get here therefore
1301 * the pages will be transient. We don't care about
1302 * the return code of cl_page_prep() at all.
1304 (void) cl_page_prep(env, ios->cis_io, page, crt);
1305 cl_page_completion(env, page, crt, 0);
1309 cl_2queue_init(cl2q);
1310 cl_page_list_move(&cl2q->c2_qin, qin, page);
1312 index = page->cp_lov_index;
1313 cl_page_list_for_each_safe(page, tmp, qin) {
1314 /* this page is not on this stripe */
1315 if (index != page->cp_lov_index)
1318 cl_page_list_move(&cl2q->c2_qin, qin, page);
1321 sub = lov_sub_get(env, lio, index);
1323 rc = cl_io_submit_rw(sub->sub_env, &sub->sub_io,
1329 cl_page_list_splice(&cl2q->c2_qin, plist);
1330 cl_page_list_splice(&cl2q->c2_qout, &queue->c2_qout);
1331 cl_2queue_fini(env, cl2q);
1337 cl_page_list_splice(plist, qin);
1338 cl_page_list_fini(env, plist);
1343 static int lov_io_commit_async(const struct lu_env *env,
1344 const struct cl_io_slice *ios,
1345 struct cl_page_list *queue, int from, int to,
1348 struct cl_page_list *plist = &lov_env_info(env)->lti_plist;
1349 struct lov_io *lio = cl2lov_io(env, ios);
1350 struct lov_io_sub *sub;
1351 struct cl_page *page;
1355 if (lio->lis_nr_subios == 1) {
1356 int idx = lio->lis_single_subio_index;
1358 LASSERT(!lov_page_is_empty(cl_page_list_first(queue)));
1360 sub = lov_sub_get(env, lio, idx);
1361 LASSERT(!IS_ERR(sub));
1362 LASSERT(sub == &lio->lis_single_subio);
1363 rc = cl_io_commit_async(sub->sub_env, &sub->sub_io, queue,
1368 cl_page_list_init(plist);
1369 while (queue->pl_nr > 0) {
1373 LASSERT(plist->pl_nr == 0);
1374 page = cl_page_list_first(queue);
1375 LASSERT(!lov_page_is_empty(page));
1377 cl_page_list_move(plist, queue, page);
1379 index = page->cp_lov_index;
1380 while (queue->pl_nr > 0) {
1381 page = cl_page_list_first(queue);
1382 if (index != page->cp_lov_index)
1385 cl_page_list_move(plist, queue, page);
1388 if (queue->pl_nr > 0) /* still has more pages */
1389 stripe_to = PAGE_SIZE;
1391 sub = lov_sub_get(env, lio, index);
1393 rc = cl_io_commit_async(sub->sub_env, &sub->sub_io,
1394 plist, from, stripe_to, cb);
1400 if (plist->pl_nr > 0) /* short write */
1405 if (lov_comp_entry(index) !=
1406 lov_comp_entry(page->cp_lov_index))
1407 cl_io_extent_release(sub->sub_env, &sub->sub_io);
1410 /* for error case, add the page back into the qin list */
1411 LASSERT(ergo(rc == 0, plist->pl_nr == 0));
1412 while (plist->pl_nr > 0) {
1413 /* error occurred, add the uncommitted pages back into queue */
1414 page = cl_page_list_last(plist);
1415 cl_page_list_move_head(queue, plist, page);
1421 static int lov_io_fault_start(const struct lu_env *env,
1422 const struct cl_io_slice *ios)
1424 struct cl_fault_io *fio;
1426 struct lov_io_sub *sub;
1433 fio = &ios->cis_io->u.ci_fault;
1434 lio = cl2lov_io(env, ios);
1437 * LU-14502: ft_page could be an existing cl_page associated with
1438 * the vmpage covering the fault index, and the page may still
1439 * refer to another mirror of an old IO.
1441 if (lov_is_flr(lio->lis_object)) {
1442 offset = cl_offset(ios->cis_obj, fio->ft_index);
1443 entry = lov_io_layout_at(lio, offset);
1445 CERROR(DFID": page fault index %lu invalid component: "
1447 PFID(lu_object_fid(&ios->cis_obj->co_lu)),
1448 fio->ft_index, entry,
1449 lio->lis_mirror_index);
1452 stripe = lov_stripe_number(lio->lis_object->lo_lsm,
1455 if (fio->ft_page->cp_lov_index !=
1456 lov_comp_index(entry, stripe)) {
1457 CDEBUG(D_INFO, DFID": page fault at index %lu, "
1458 "at mirror %u comp entry %u stripe %u, "
1459 "been used with comp entry %u stripe %u\n",
1460 PFID(lu_object_fid(&ios->cis_obj->co_lu)),
1461 fio->ft_index, lio->lis_mirror_index,
1463 lov_comp_entry(fio->ft_page->cp_lov_index),
1464 lov_comp_stripe(fio->ft_page->cp_lov_index));
1466 fio->ft_page->cp_lov_index =
1467 lov_comp_index(entry, stripe);
1471 sub = lov_sub_get(env, lio, fio->ft_page->cp_lov_index);
1472 sub->sub_io.u.ci_fault.ft_nob = fio->ft_nob;
1474 RETURN(lov_io_start(env, ios));
1477 static int lov_io_setattr_start(const struct lu_env *env,
1478 const struct cl_io_slice *ios)
1480 struct lov_io *lio = cl2lov_io(env, ios);
1481 struct cl_io *parent = ios->cis_io;
1482 struct lov_io_sub *sub;
1483 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
1487 if (cl_io_is_fallocate(parent)) {
1488 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1489 loff_t size = parent->u.ci_setattr.sa_attr.lvb_size;
1490 int index = lov_comp_entry(sub->sub_subio_index);
1491 int stripe = lov_comp_stripe(sub->sub_subio_index);
1493 size = lov_size_to_stripe(lsm, index, size, stripe);
1494 sub->sub_io.u.ci_setattr.sa_attr.lvb_size = size;
1495 sub->sub_io.u.ci_setattr.sa_avalid =
1496 parent->u.ci_setattr.sa_avalid;
1500 RETURN(lov_io_start(env, ios));
1503 static void lov_io_fsync_end(const struct lu_env *env,
1504 const struct cl_io_slice *ios)
1506 struct lov_io *lio = cl2lov_io(env, ios);
1507 struct lov_io_sub *sub;
1508 unsigned int *written = &ios->cis_io->u.ci_fsync.fi_nr_written;
1512 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1513 struct cl_io *subio = &sub->sub_io;
1515 lov_io_end_wrapper(sub->sub_env, subio);
1517 if (subio->ci_result == 0)
1518 *written += subio->u.ci_fsync.fi_nr_written;
1523 static void lov_io_lseek_end(const struct lu_env *env,
1524 const struct cl_io_slice *ios)
1526 struct lov_io *lio = cl2lov_io(env, ios);
1527 struct cl_io *io = lio->lis_cl.cis_io;
1528 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
1529 struct lov_io_sub *sub;
1530 loff_t offset = -ENXIO;
1532 bool seek_hole = io->u.ci_lseek.ls_whence == SEEK_HOLE;
1536 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1537 struct cl_io *subio = &sub->sub_io;
1538 int index = lov_comp_entry(sub->sub_subio_index);
1539 int stripe = lov_comp_stripe(sub->sub_subio_index);
1540 loff_t sub_off, lov_off;
1541 __u64 comp_end = lsm->lsm_entries[index]->lsme_extent.e_end;
1543 lov_io_end_wrapper(sub->sub_env, subio);
1545 if (io->ci_result == 0)
1546 io->ci_result = sub->sub_io.ci_result;
1551 CDEBUG(D_INFO, DFID": entry %x stripe %u: SEEK_%s from %lld\n",
1552 PFID(lu_object_fid(lov2lu(lio->lis_object))),
1553 index, stripe, seek_hole ? "HOLE" : "DATA",
1554 subio->u.ci_lseek.ls_start);
1556 /* first subio with positive result is what we need */
1557 sub_off = subio->u.ci_lseek.ls_result;
1558 /* Expected error, offset is out of stripe file size */
1559 if (sub_off == -ENXIO)
1561 /* Any other errors are not expected with ci_result == 0 */
1563 CDEBUG(D_INFO, "unexpected error: rc = %lld\n",
1565 io->ci_result = sub_off;
1568 lov_off = lov_stripe_size(lsm, index, sub_off + 1, stripe) - 1;
1570 /* the only way to get negatove lov_off here is too big
1571 * result. Return -EOVERFLOW then.
1573 io->ci_result = -EOVERFLOW;
1574 CDEBUG(D_INFO, "offset %llu is too big: rc = %d\n",
1575 (u64)lov_off, io->ci_result);
1578 if (lov_off < io->u.ci_lseek.ls_start) {
1579 io->ci_result = -EINVAL;
1580 CDEBUG(D_INFO, "offset %lld < start %lld: rc = %d\n",
1581 sub_off, io->u.ci_lseek.ls_start, io->ci_result);
1584 /* resulting offset can be out of component range if stripe
1585 * object is full and its file size was returned as virtual
1586 * hole start. Skip this result, the next component will give
1587 * us correct lseek result but keep possible hole offset in
1588 * case there is no more components ahead
1590 if (lov_off >= comp_end) {
1591 /* must be SEEK_HOLE case */
1592 if (likely(seek_hole)) {
1593 /* save comp end as potential hole offset */
1594 hole_off = max_t(__u64, comp_end, hole_off);
1596 io->ci_result = -EINVAL;
1598 "off %lld >= comp_end %llu: rc = %d\n",
1599 lov_off, comp_end, io->ci_result);
1604 CDEBUG(D_INFO, "SEEK_%s: %lld->%lld/%lld: rc = %d\n",
1605 seek_hole ? "HOLE" : "DATA",
1606 subio->u.ci_lseek.ls_start, sub_off, lov_off,
1607 sub->sub_io.ci_result);
1608 offset = min_t(__u64, offset, lov_off);
1610 /* no result but some component returns hole as component end */
1611 if (seek_hole && offset == -ENXIO && hole_off > 0)
1614 io->u.ci_lseek.ls_result = offset;
1618 static const struct cl_io_operations lov_io_ops = {
1621 .cio_fini = lov_io_fini,
1622 .cio_iter_init = lov_io_rw_iter_init,
1623 .cio_iter_fini = lov_io_iter_fini,
1624 .cio_lock = lov_io_lock,
1625 .cio_unlock = lov_io_unlock,
1626 .cio_start = lov_io_start,
1627 .cio_end = lov_io_end
1630 .cio_fini = lov_io_fini,
1631 .cio_iter_init = lov_io_rw_iter_init,
1632 .cio_iter_fini = lov_io_iter_fini,
1633 .cio_lock = lov_io_lock,
1634 .cio_unlock = lov_io_unlock,
1635 .cio_start = lov_io_start,
1636 .cio_end = lov_io_end
1639 .cio_fini = lov_io_fini,
1640 .cio_iter_init = lov_io_setattr_iter_init,
1641 .cio_iter_fini = lov_io_iter_fini,
1642 .cio_lock = lov_io_lock,
1643 .cio_unlock = lov_io_unlock,
1644 .cio_start = lov_io_setattr_start,
1645 .cio_end = lov_io_end
1647 [CIT_DATA_VERSION] = {
1648 .cio_fini = lov_io_fini,
1649 .cio_iter_init = lov_io_iter_init,
1650 .cio_iter_fini = lov_io_iter_fini,
1651 .cio_lock = lov_io_lock,
1652 .cio_unlock = lov_io_unlock,
1653 .cio_start = lov_io_start,
1654 .cio_end = lov_io_data_version_end,
1657 .cio_fini = lov_io_fini,
1658 .cio_iter_init = lov_io_iter_init,
1659 .cio_iter_fini = lov_io_iter_fini,
1660 .cio_lock = lov_io_lock,
1661 .cio_unlock = lov_io_unlock,
1662 .cio_start = lov_io_fault_start,
1663 .cio_end = lov_io_end
1666 .cio_fini = lov_io_fini,
1667 .cio_iter_init = lov_io_iter_init,
1668 .cio_iter_fini = lov_io_iter_fini,
1669 .cio_lock = lov_io_lock,
1670 .cio_unlock = lov_io_unlock,
1671 .cio_start = lov_io_start,
1672 .cio_end = lov_io_fsync_end
1675 .cio_fini = lov_io_fini,
1676 .cio_iter_init = lov_io_iter_init,
1677 .cio_iter_fini = lov_io_iter_fini,
1678 .cio_lock = lov_io_lock,
1679 .cio_unlock = lov_io_unlock,
1680 .cio_start = lov_io_start,
1681 .cio_end = lov_io_end
1684 .cio_fini = lov_io_fini,
1685 .cio_iter_init = lov_io_iter_init,
1686 .cio_iter_fini = lov_io_iter_fini,
1687 .cio_lock = lov_io_lock,
1688 .cio_unlock = lov_io_unlock,
1689 .cio_start = lov_io_start,
1690 .cio_end = lov_io_lseek_end
1693 .cio_fini = lov_io_fini,
1696 .cio_fini = lov_io_fini
1699 .cio_read_ahead = lov_io_read_ahead,
1700 .cio_lru_reserve = lov_io_lru_reserve,
1701 .cio_submit = lov_io_submit,
1702 .cio_commit_async = lov_io_commit_async,
1705 /*****************************************************************************
1707 * Empty lov io operations.
1711 static void lov_empty_io_fini(const struct lu_env *env,
1712 const struct cl_io_slice *ios)
1714 struct lov_object *lov = cl2lov(ios->cis_obj);
1717 if (atomic_dec_and_test(&lov->lo_active_ios))
1718 wake_up(&lov->lo_waitq);
1722 static int lov_empty_io_submit(const struct lu_env *env,
1723 const struct cl_io_slice *ios,
1724 enum cl_req_type crt, struct cl_2queue *queue)
1729 static void lov_empty_impossible(const struct lu_env *env,
1730 struct cl_io_slice *ios)
1735 #define LOV_EMPTY_IMPOSSIBLE ((void *)lov_empty_impossible)
1738 * An io operation vector for files without stripes.
1740 static const struct cl_io_operations lov_empty_io_ops = {
1743 .cio_fini = lov_empty_io_fini,
1745 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1746 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1747 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1748 .cio_end = LOV_EMPTY_IMPOSSIBLE
1752 .cio_fini = lov_empty_io_fini,
1753 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1754 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1755 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1756 .cio_end = LOV_EMPTY_IMPOSSIBLE
1759 .cio_fini = lov_empty_io_fini,
1760 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1761 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1762 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1763 .cio_end = LOV_EMPTY_IMPOSSIBLE
1766 .cio_fini = lov_empty_io_fini,
1767 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1768 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1769 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1770 .cio_end = LOV_EMPTY_IMPOSSIBLE
1773 .cio_fini = lov_empty_io_fini
1776 .cio_fini = lov_empty_io_fini
1779 .cio_fini = lov_empty_io_fini
1782 .cio_fini = lov_empty_io_fini
1785 .cio_submit = lov_empty_io_submit,
1786 .cio_commit_async = LOV_EMPTY_IMPOSSIBLE
1789 int lov_io_init_composite(const struct lu_env *env, struct cl_object *obj,
1792 struct lov_io *lio = lov_env_io(env);
1793 struct lov_object *lov = cl2lov(obj);
1798 INIT_LIST_HEAD(&lio->lis_active);
1799 result = lov_io_slice_init(lio, lov, io);
1803 result = lov_io_subio_init(env, lio, io);
1805 cl_io_slice_add(io, &lio->lis_cl, obj, &lov_io_ops);
1806 atomic_inc(&lov->lo_active_ios);
1810 io->ci_result = result < 0 ? result : 0;
1814 int lov_io_init_empty(const struct lu_env *env, struct cl_object *obj,
1817 struct lov_object *lov = cl2lov(obj);
1818 struct lov_io *lio = lov_env_io(env);
1822 lio->lis_object = lov;
1823 switch (io->ci_type) {
1835 case CIT_DATA_VERSION:
1843 CERROR("Page fault on a file without stripes: "DFID"\n",
1844 PFID(lu_object_fid(&obj->co_lu)));
1848 cl_io_slice_add(io, &lio->lis_cl, obj, &lov_empty_io_ops);
1849 atomic_inc(&lov->lo_active_ios);
1852 io->ci_result = result < 0 ? result : 0;
1856 int lov_io_init_released(const struct lu_env *env, struct cl_object *obj,
1859 struct lov_object *lov = cl2lov(obj);
1860 struct lov_io *lio = lov_env_io(env);
1864 LASSERT(lov->lo_lsm != NULL);
1865 lio->lis_object = lov;
1867 switch (io->ci_type) {
1869 LASSERTF(0, "invalid type %d\n", io->ci_type);
1870 result = -EOPNOTSUPP;
1876 case CIT_DATA_VERSION:
1881 * the truncate to 0 is managed by MDT:
1882 * - in open, for open O_TRUNC
1883 * - in setattr, for truncate
1886 * the truncate is for size > 0 so triggers a restore,
1887 * also trigger a restore for prealloc/punch
1889 if (cl_io_is_trunc(io) || cl_io_is_fallocate(io)) {
1890 io->ci_restore_needed = 1;
1899 io->ci_restore_needed = 1;
1905 cl_io_slice_add(io, &lio->lis_cl, obj, &lov_empty_io_ops);
1906 atomic_inc(&lov->lo_active_ios);
1909 io->ci_result = result < 0 ? result : 0;
1914 * Return the index in composite:lo_entries by the file offset
1916 int lov_io_layout_at(struct lov_io *lio, __u64 offset)
1918 struct lov_object *lov = lio->lis_object;
1919 struct lov_layout_composite *comp = &lov->u.composite;
1920 int start_index = 0;
1921 int end_index = comp->lo_entry_count - 1;
1924 LASSERT(lov->lo_type == LLT_COMP);
1926 /* This is actual file offset so nothing can cover eof. */
1927 if (offset == LUSTRE_EOF)
1930 if (lov_is_flr(lov)) {
1931 struct lov_mirror_entry *lre;
1933 LASSERT(lio->lis_mirror_index >= 0);
1935 lre = &comp->lo_mirrors[lio->lis_mirror_index];
1936 start_index = lre->lre_start;
1937 end_index = lre->lre_end;
1940 for (i = start_index; i <= end_index; i++) {
1941 struct lov_layout_entry *lle = lov_entry(lov, i);
1943 LASSERT(!lsme_is_foreign(lle->lle_lsme));
1945 if ((offset >= lle->lle_extent->e_start &&
1946 offset < lle->lle_extent->e_end) ||
1947 (offset == OBD_OBJECT_EOF &&
1948 lle->lle_extent->e_end == OBD_OBJECT_EOF))