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_mkwrite(io) ||
230 cl_io_is_fallocate(io) || cl_io_is_trunc(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 cl_io_is_fallocate(io)) &&
336 (io->ci_layout_version != obj->lo_lsm->lsm_layout_gen)) {
338 * For resync I/O, the ci_layout_version was the layout
339 * version when resync starts. If it doesn't match the
340 * current object layout version, it means the layout
346 io->ci_layout_version |= LU_LAYOUT_RESYNC;
349 lio->lis_mirror_index = -1;
350 lov_foreach_mirror_entry(obj, entry) {
351 if (entry->lre_mirror_id ==
352 io->ci_designated_mirror) {
353 lio->lis_mirror_index = index;
360 RETURN(lio->lis_mirror_index < 0 ? -EINVAL : 0);
363 result = lov_io_mirror_write_intent(lio, obj, io);
367 if (io->ci_need_write_intent) {
368 CDEBUG(D_VFSTRACE, DFID " need write intent for [%llu, %llu)\n",
369 PFID(lu_object_fid(lov2lu(obj))),
370 lio->lis_pos, lio->lis_endpos);
372 if (cl_io_is_trunc(io)) {
374 * for truncate, we uses [size, EOF) to judge whether
375 * a write intent needs to be send, but we need to
376 * restore the write extent to [0, size], in truncate,
377 * the byte in the size position is accessed.
379 io->ci_write_intent.e_start = 0;
380 io->ci_write_intent.e_end =
381 io->u.ci_setattr.sa_attr.lvb_size + 1;
383 /* stop cl_io_init() loop */
387 if (io->ci_ndelay_tried == 0 || /* first time to try */
388 /* reset the mirror index if layout has changed */
389 lio->lis_mirror_layout_gen != obj->lo_lsm->lsm_layout_gen) {
390 lio->lis_mirror_layout_gen = obj->lo_lsm->lsm_layout_gen;
391 index = lio->lis_mirror_index = comp->lo_preferred_mirror;
393 index = lio->lis_mirror_index;
396 /* move mirror index to the next one */
397 index = (index + 1) % comp->lo_mirror_count;
400 for (i = 0; i < comp->lo_mirror_count; i++) {
401 struct lu_extent ext = { .e_start = lio->lis_pos,
402 .e_end = lio->lis_pos + 1 };
403 struct lov_mirror_entry *lre;
404 struct lov_layout_entry *lle;
407 lre = &comp->lo_mirrors[(index + i) % comp->lo_mirror_count];
411 if (lre->lre_foreign)
414 lov_foreach_mirror_layout_entry(obj, lle, lre) {
418 if (lu_extent_is_overlapped(&ext, lle->lle_extent)) {
422 } /* each component of the mirror */
424 index = (index + i) % comp->lo_mirror_count;
429 if (i == comp->lo_mirror_count) {
430 CERROR(DFID": failed to find a component covering "
431 "I/O region at %llu\n",
432 PFID(lu_object_fid(lov2lu(obj))), lio->lis_pos);
434 dump_lsm(D_ERROR, obj->lo_lsm);
439 CDEBUG(D_VFSTRACE, DFID ": flr state: %d, move mirror from %d to %d, "
440 "have retried: %d, mirror count: %d\n",
441 PFID(lu_object_fid(lov2lu(obj))), lov_flr_state(obj),
442 lio->lis_mirror_index, index, io->ci_ndelay_tried,
443 comp->lo_mirror_count);
445 lio->lis_mirror_index = index;
448 * FLR: if all mirrors have been tried once, most likely the network
449 * of this client has been partitioned. We should relinquish CPU for
450 * a while before trying again.
452 if (io->ci_ndelay && io->ci_ndelay_tried > 0 &&
453 (io->ci_ndelay_tried % comp->lo_mirror_count == 0)) {
454 schedule_timeout_interruptible(cfs_time_seconds(1) / 100);
455 if (signal_pending(current))
459 * we'd set ci_tried_all_mirrors to turn off fast mirror
460 * switching for read after we've tried all mirrors several
463 io->ci_tried_all_mirrors = io->ci_ndelay_tried %
464 (comp->lo_mirror_count * 4) == 0;
466 ++io->ci_ndelay_tried;
468 CDEBUG(D_VFSTRACE, "use %sdelayed RPC state for this IO\n",
469 io->ci_ndelay ? "non-" : "");
474 static int lov_io_slice_init(struct lov_io *lio,
475 struct lov_object *obj, struct cl_io *io)
482 lio->lis_object = obj;
483 lio->lis_cached_entry = LIS_CACHE_ENTRY_NONE;
485 switch (io->ci_type) {
488 lio->lis_pos = io->u.ci_rw.crw_pos;
489 lio->lis_endpos = io->u.ci_rw.crw_pos + io->u.ci_rw.crw_count;
490 lio->lis_io_endpos = lio->lis_endpos;
491 if (cl_io_is_append(io)) {
492 LASSERT(io->ci_type == CIT_WRITE);
495 * If there is LOV EA hole, then we may cannot locate
496 * the current file-tail exactly.
498 if (unlikely(obj->lo_lsm->lsm_entries[0]->lsme_pattern &
500 GOTO(out, result = -EIO);
503 lio->lis_endpos = OBD_OBJECT_EOF;
508 if (cl_io_is_fallocate(io)) {
509 lio->lis_pos = io->u.ci_setattr.sa_falloc_offset;
510 lio->lis_endpos = io->u.ci_setattr.sa_falloc_end;
511 } else if (cl_io_is_trunc(io)) {
512 lio->lis_pos = io->u.ci_setattr.sa_attr.lvb_size;
513 lio->lis_endpos = OBD_OBJECT_EOF;
516 lio->lis_endpos = OBD_OBJECT_EOF;
520 case CIT_DATA_VERSION:
522 lio->lis_endpos = OBD_OBJECT_EOF;
526 pgoff_t index = io->u.ci_fault.ft_index;
528 lio->lis_pos = cl_offset(io->ci_obj, index);
529 lio->lis_endpos = cl_offset(io->ci_obj, index + 1);
534 lio->lis_pos = io->u.ci_fsync.fi_start;
535 lio->lis_endpos = io->u.ci_fsync.fi_end;
540 lio->lis_pos = io->u.ci_ladvise.li_start;
541 lio->lis_endpos = io->u.ci_ladvise.li_end;
546 lio->lis_pos = io->u.ci_lseek.ls_start;
547 lio->lis_endpos = OBD_OBJECT_EOF;
553 lio->lis_endpos = OBD_OBJECT_EOF;
558 lio->lis_endpos = OBD_OBJECT_EOF;
566 * CIT_MISC + ci_ignore_layout can identify the I/O from the OSC layer,
567 * it won't care/access lov layout related info.
569 if (io->ci_ignore_layout && io->ci_type == CIT_MISC)
570 GOTO(out, result = 0);
572 LASSERT(obj->lo_lsm != NULL);
574 result = lov_io_mirror_init(lio, obj, io);
578 /* check if it needs to instantiate layout */
579 if (!(io->ci_type == CIT_WRITE || cl_io_is_mkwrite(io) ||
580 cl_io_is_fallocate(io) ||
581 (cl_io_is_trunc(io) && io->u.ci_setattr.sa_attr.lvb_size > 0)))
582 GOTO(out, result = 0);
585 * for truncate, it only needs to instantiate the components
586 * before the truncated size.
588 if (cl_io_is_trunc(io)) {
589 io->ci_write_intent.e_start = 0;
590 /* for writes, e_end is endpos, the location of the file
591 * pointer after the write is completed, so it is not accessed.
592 * For truncate, 'end' is the size, and *is* acccessed.
593 * In other words, writes are [start, end), but truncate is
594 * [start, size], where both are included. So add 1 to the
595 * size when creating the write intent to account for this.
597 io->ci_write_intent.e_end =
598 io->u.ci_setattr.sa_attr.lvb_size + 1;
600 io->ci_write_intent.e_start = lio->lis_pos;
601 io->ci_write_intent.e_end = lio->lis_endpos;
605 lov_foreach_io_layout(index, lio, &io->ci_write_intent) {
606 if (!lsm_entry_inited(obj->lo_lsm, index)) {
607 io->ci_need_write_intent = 1;
612 if (io->ci_need_write_intent && io->ci_designated_mirror > 0) {
614 * REINT_SYNC RPC has already tried to instantiate all of the
615 * components involved, obviously it didn't succeed. Skip this
616 * mirror for now. The server won't be able to figure out
617 * which mirror it should instantiate components
619 CERROR(DFID": trying to instantiate components for designated "
620 "I/O, file state: %d\n",
621 PFID(lu_object_fid(lov2lu(obj))), lov_flr_state(obj));
623 io->ci_need_write_intent = 0;
624 GOTO(out, result = -EIO);
627 if (io->ci_need_write_intent)
628 GOTO(out, result = 1);
636 static void lov_io_fini(const struct lu_env *env, const struct cl_io_slice *ios)
638 struct lov_io *lio = cl2lov_io(env, ios);
639 struct lov_object *lov = cl2lov(ios->cis_obj);
640 struct lov_io_sub *sub;
643 LASSERT(list_empty(&lio->lis_active));
645 while ((sub = list_first_entry_or_null(&lio->lis_subios,
647 sub_list)) != NULL) {
648 list_del_init(&sub->sub_list);
649 lio->lis_nr_subios--;
651 lov_io_sub_fini(env, lio, sub);
652 lov_sub_free(lio, sub);
654 LASSERT(lio->lis_nr_subios == 0);
656 LASSERT(atomic_read(&lov->lo_active_ios) > 0);
657 if (atomic_dec_and_test(&lov->lo_active_ios))
658 wake_up(&lov->lo_waitq);
662 static void lov_io_sub_inherit(struct lov_io_sub *sub, struct lov_io *lio,
663 loff_t start, loff_t end)
665 struct cl_io *io = &sub->sub_io;
666 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
667 struct cl_io *parent = lio->lis_cl.cis_io;
668 int index = lov_comp_entry(sub->sub_subio_index);
669 int stripe = lov_comp_stripe(sub->sub_subio_index);
671 switch (io->ci_type) {
673 io->u.ci_setattr.sa_attr = parent->u.ci_setattr.sa_attr;
674 io->u.ci_setattr.sa_attr_flags =
675 parent->u.ci_setattr.sa_attr_flags;
676 io->u.ci_setattr.sa_avalid = parent->u.ci_setattr.sa_avalid;
677 io->u.ci_setattr.sa_xvalid = parent->u.ci_setattr.sa_xvalid;
678 io->u.ci_setattr.sa_falloc_mode =
679 parent->u.ci_setattr.sa_falloc_mode;
680 io->u.ci_setattr.sa_stripe_index = stripe;
681 io->u.ci_setattr.sa_parent_fid =
682 parent->u.ci_setattr.sa_parent_fid;
683 /* For SETATTR(fallocate) pass the subtype to lower IO */
684 io->u.ci_setattr.sa_subtype = parent->u.ci_setattr.sa_subtype;
685 if (cl_io_is_fallocate(io)) {
686 io->u.ci_setattr.sa_falloc_offset = start;
687 io->u.ci_setattr.sa_falloc_end = end;
688 io->u.ci_setattr.sa_falloc_uid =
689 parent->u.ci_setattr.sa_falloc_uid;
690 io->u.ci_setattr.sa_falloc_gid =
691 parent->u.ci_setattr.sa_falloc_gid;
692 io->u.ci_setattr.sa_falloc_projid =
693 parent->u.ci_setattr.sa_falloc_projid;
695 if (cl_io_is_trunc(io)) {
696 loff_t new_size = parent->u.ci_setattr.sa_attr.lvb_size;
698 new_size = lov_size_to_stripe(lsm, index, new_size,
700 io->u.ci_setattr.sa_attr.lvb_size = new_size;
702 lov_lsm2layout(lsm, lsm->lsm_entries[index],
703 &io->u.ci_setattr.sa_layout);
706 case CIT_DATA_VERSION: {
707 io->u.ci_data_version.dv_data_version = 0;
708 io->u.ci_data_version.dv_flags =
709 parent->u.ci_data_version.dv_flags;
713 struct cl_object *obj = parent->ci_obj;
714 loff_t off = cl_offset(obj, parent->u.ci_fault.ft_index);
716 io->u.ci_fault = parent->u.ci_fault;
717 off = lov_size_to_stripe(lsm, index, off, stripe);
718 io->u.ci_fault.ft_index = cl_index(obj, off);
722 io->u.ci_fsync.fi_start = start;
723 io->u.ci_fsync.fi_end = end;
724 io->u.ci_fsync.fi_fid = parent->u.ci_fsync.fi_fid;
725 io->u.ci_fsync.fi_mode = parent->u.ci_fsync.fi_mode;
730 io->u.ci_wr.wr_sync = cl_io_is_sync_write(parent);
731 io->ci_tried_all_mirrors = parent->ci_tried_all_mirrors;
732 if (cl_io_is_append(parent)) {
733 io->u.ci_wr.wr_append = 1;
735 io->u.ci_rw.crw_pos = start;
736 io->u.ci_rw.crw_count = end - start;
741 io->u.ci_ladvise.li_start = start;
742 io->u.ci_ladvise.li_end = end;
743 io->u.ci_ladvise.li_fid = parent->u.ci_ladvise.li_fid;
744 io->u.ci_ladvise.li_advice = parent->u.ci_ladvise.li_advice;
745 io->u.ci_ladvise.li_flags = parent->u.ci_ladvise.li_flags;
749 io->u.ci_lseek.ls_start = start;
750 io->u.ci_lseek.ls_whence = parent->u.ci_lseek.ls_whence;
751 io->u.ci_lseek.ls_result = parent->u.ci_lseek.ls_result;
761 static loff_t lov_offset_mod(loff_t val, int delta)
763 if (val != OBD_OBJECT_EOF)
768 static int lov_io_add_sub(const struct lu_env *env, struct lov_io *lio,
769 struct lov_io_sub *sub, u64 start, u64 end)
773 end = lov_offset_mod(end, 1);
774 lov_io_sub_inherit(sub, lio, start, end);
775 rc = cl_io_iter_init(sub->sub_env, &sub->sub_io);
777 cl_io_iter_fini(sub->sub_env, &sub->sub_io);
781 list_add_tail(&sub->sub_linkage, &lio->lis_active);
785 static int lov_io_iter_init(const struct lu_env *env,
786 const struct cl_io_slice *ios)
788 struct lov_io *lio = cl2lov_io(env, ios);
789 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
790 bool is_trunc = cl_io_is_trunc(ios->cis_io);
791 struct lov_io_sub *sub;
792 struct lu_extent ext;
798 ext.e_start = lio->lis_pos;
799 ext.e_end = lio->lis_endpos;
802 OBD_ALLOC_PTR_ARRAY(lio->lis_trunc_stripe_index,
803 lio->lis_object->u.composite.lo_entry_count);
804 if (lio->lis_trunc_stripe_index == NULL)
808 lov_foreach_io_layout(index, lio, &ext) {
809 struct lov_layout_entry *le = lov_entry(lio->lis_object, index);
810 struct lov_layout_raid0 *r0 = &le->lle_raid0;
814 bool tested_trunc_stripe = false;
817 lio->lis_trunc_stripe_index[index] = -1;
819 CDEBUG(D_VFSTRACE, "component[%d] flags %#x\n",
820 index, lsm->lsm_entries[index]->lsme_flags);
821 if (!lsm_entry_inited(lsm, index)) {
823 * Read from uninitialized components should return
829 if (lsm_entry_is_foreign(lsm, index))
832 if (!le->lle_valid && !ios->cis_io->ci_designated_mirror) {
833 CERROR("I/O to invalid component: %d, mirror: %d\n",
834 index, lio->lis_mirror_index);
838 for (stripe = 0; stripe < r0->lo_nr; stripe++) {
839 if (!lov_stripe_intersects(lsm, index, stripe,
843 if (unlikely(!r0->lo_sub[stripe])) {
844 if (ios->cis_io->ci_type == CIT_READ ||
845 ios->cis_io->ci_type == CIT_WRITE ||
846 ios->cis_io->ci_type == CIT_FAULT)
852 if (is_trunc && !tested_trunc_stripe) {
856 prev = (stripe == 0) ? r0->lo_nr - 1 :
859 * Only involving previous stripe if the
860 * truncate in this component is at the
861 * beginning of this stripe.
863 tested_trunc_stripe = true;
864 if (ext.e_start < lsm->lsm_entries[index]->
865 lsme_extent.e_start) {
866 /* need previous stripe involvement */
867 lio->lis_trunc_stripe_index[index] = prev;
869 tr_start = ext.e_start;
870 tr_start = lov_do_div64(tr_start,
871 stripe_width(lsm, index));
872 /* tr_start %= stripe_swidth */
873 if (tr_start == stripe * lsm->
876 lio->lis_trunc_stripe_index[index] = prev;
880 /* if the last stripe is the trunc stripeno */
881 if (is_trunc && lio->lis_trunc_stripe_index[index] == stripe)
882 lio->lis_trunc_stripe_index[index] = -1;
884 sub = lov_sub_get(env, lio,
885 lov_comp_index(index, stripe));
889 rc = lov_io_add_sub(env, lio, sub, start, end);
896 if (is_trunc && lio->lis_trunc_stripe_index[index] != -1) {
897 stripe = lio->lis_trunc_stripe_index[index];
898 if (unlikely(!r0->lo_sub[stripe])) {
899 lio->lis_trunc_stripe_index[index] = -1;
902 sub = lov_sub_get(env, lio,
903 lov_comp_index(index, stripe));
908 * the prev sub could be used by another truncate, we'd
909 * skip it. LU-14128 happends when expand truncate +
910 * read get wrong kms.
912 if (!list_empty(&sub->sub_linkage)) {
913 lio->lis_trunc_stripe_index[index] = -1;
917 (void)lov_stripe_intersects(lsm, index, stripe, &ext,
919 rc = lov_io_add_sub(env, lio, sub, start, end);
928 static int lov_io_rw_iter_init(const struct lu_env *env,
929 const struct cl_io_slice *ios)
931 struct lov_io *lio = cl2lov_io(env, ios);
932 struct cl_io *io = ios->cis_io;
933 struct lov_stripe_md_entry *lse;
934 loff_t start = io->u.ci_rw.crw_pos;
938 LASSERT(io->ci_type == CIT_READ || io->ci_type == CIT_WRITE);
941 if (cl_io_is_append(io))
942 RETURN(lov_io_iter_init(env, ios));
944 index = lov_io_layout_at(lio, io->u.ci_rw.crw_pos);
945 if (index < 0) { /* non-existing layout component */
946 if (io->ci_type == CIT_READ) {
948 * TODO: it needs to detect the next component and
949 * then set the next pos
953 RETURN(lov_io_iter_init(env, ios));
959 if (!lov_entry(lio->lis_object, index)->lle_valid &&
960 !io->ci_designated_mirror)
961 RETURN(io->ci_type == CIT_READ ? -EAGAIN : -EIO);
963 lse = lov_lse(lio->lis_object, index);
965 if (lsme_is_foreign(lse))
968 next = MAX_LFS_FILESIZE;
969 if (lse->lsme_stripe_count > 1) {
970 unsigned long ssize = lse->lsme_stripe_size;
972 lov_do_div64(start, ssize);
973 next = (start + 1) * ssize;
974 if (next <= start * ssize)
975 next = MAX_LFS_FILESIZE;
978 LASSERTF(io->u.ci_rw.crw_pos >= lse->lsme_extent.e_start,
979 "pos %lld, [%lld, %lld)\n", io->u.ci_rw.crw_pos,
980 lse->lsme_extent.e_start, lse->lsme_extent.e_end);
981 next = min_t(__u64, next, lse->lsme_extent.e_end);
982 next = min_t(loff_t, next, lio->lis_io_endpos);
984 io->ci_continue = next < lio->lis_io_endpos;
985 io->u.ci_rw.crw_count = next - io->u.ci_rw.crw_pos;
986 lio->lis_pos = io->u.ci_rw.crw_pos;
987 lio->lis_endpos = io->u.ci_rw.crw_pos + io->u.ci_rw.crw_count;
989 "stripe: %llu chunk: [%llu, %llu) %llu, %zd\n",
990 (__u64)start, lio->lis_pos, lio->lis_endpos,
991 (__u64)lio->lis_io_endpos, io->u.ci_rw.crw_count);
994 * XXX The following call should be optimized: we know, that
995 * [lio->lis_pos, lio->lis_endpos) intersects with exactly one stripe.
997 RETURN(lov_io_iter_init(env, ios));
1000 static int lov_io_setattr_iter_init(const struct lu_env *env,
1001 const struct cl_io_slice *ios)
1003 struct lov_io *lio = cl2lov_io(env, ios);
1004 struct cl_io *io = ios->cis_io;
1008 if (cl_io_is_trunc(io) && lio->lis_pos > 0) {
1009 index = lov_io_layout_at(lio, lio->lis_pos - 1);
1010 /* no entry found for such offset */
1012 RETURN(io->ci_result = -ENODATA);
1015 RETURN(lov_io_iter_init(env, ios));
1018 static int lov_io_call(const struct lu_env *env, struct lov_io *lio,
1019 int (*iofunc)(const struct lu_env *, struct cl_io *))
1021 struct cl_io *parent = lio->lis_cl.cis_io;
1022 struct lov_io_sub *sub;
1026 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1027 rc = iofunc(sub->sub_env, &sub->sub_io);
1031 if (parent->ci_result == 0)
1032 parent->ci_result = sub->sub_io.ci_result;
1037 static int lov_io_lock(const struct lu_env *env, const struct cl_io_slice *ios)
1040 RETURN(lov_io_call(env, cl2lov_io(env, ios), cl_io_lock));
1043 static int lov_io_start(const struct lu_env *env, const struct cl_io_slice *ios)
1046 RETURN(lov_io_call(env, cl2lov_io(env, ios), cl_io_start));
1049 static int lov_io_end_wrapper(const struct lu_env *env, struct cl_io *io)
1053 * It's possible that lov_io_start() wasn't called against this
1054 * sub-io, either because previous sub-io failed, or upper layer
1057 if (io->ci_state == CIS_IO_GOING)
1060 io->ci_state = CIS_IO_FINISHED;
1064 static int lov_io_iter_fini_wrapper(const struct lu_env *env, struct cl_io *io)
1066 cl_io_iter_fini(env, io);
1070 static int lov_io_unlock_wrapper(const struct lu_env *env, struct cl_io *io)
1072 cl_io_unlock(env, io);
1076 static void lov_io_end(const struct lu_env *env, const struct cl_io_slice *ios)
1080 /* Before ending each i/o, we must set lis_cached_entry to tell the
1081 * next i/o not to use stale cached lis information.
1083 cl2lov_io(env, ios)->lis_cached_entry = LIS_CACHE_ENTRY_NONE;
1085 rc = lov_io_call(env, cl2lov_io(env, ios), lov_io_end_wrapper);
1090 lov_io_data_version_end(const struct lu_env *env, const struct cl_io_slice *ios)
1092 struct lov_io *lio = cl2lov_io(env, ios);
1093 struct cl_io *parent = lio->lis_cl.cis_io;
1094 struct cl_data_version_io *pdv = &parent->u.ci_data_version;
1095 struct lov_io_sub *sub;
1098 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1099 struct cl_data_version_io *sdv = &sub->sub_io.u.ci_data_version;
1101 lov_io_end_wrapper(sub->sub_env, &sub->sub_io);
1103 pdv->dv_data_version += sdv->dv_data_version;
1104 if (pdv->dv_layout_version > sdv->dv_layout_version)
1105 pdv->dv_layout_version = sdv->dv_layout_version;
1107 if (parent->ci_result == 0)
1108 parent->ci_result = sub->sub_io.ci_result;
1114 static void lov_io_iter_fini(const struct lu_env *env,
1115 const struct cl_io_slice *ios)
1117 struct lov_io *lio = cl2lov_io(env, ios);
1122 if (lio->lis_trunc_stripe_index != NULL)
1123 OBD_FREE_PTR_ARRAY(lio->lis_trunc_stripe_index,
1124 lio->lis_object->u.composite.lo_entry_count);
1125 lio->lis_trunc_stripe_index = NULL;
1127 rc = lov_io_call(env, lio, lov_io_iter_fini_wrapper);
1129 while (!list_empty(&lio->lis_active))
1130 list_del_init(lio->lis_active.next);
1134 static void lov_io_unlock(const struct lu_env *env,
1135 const struct cl_io_slice *ios)
1140 rc = lov_io_call(env, cl2lov_io(env, ios), lov_io_unlock_wrapper);
1145 static int lov_io_read_ahead(const struct lu_env *env,
1146 const struct cl_io_slice *ios,
1147 pgoff_t start, struct cl_read_ahead *ra)
1149 struct lov_io *lio = cl2lov_io(env, ios);
1150 struct lov_object *loo = lio->lis_object;
1151 struct cl_object *obj = lov2cl(loo);
1152 struct lov_layout_raid0 *r0;
1153 struct lov_io_sub *sub;
1157 unsigned int pps; /* pages per stripe */
1163 offset = cl_offset(obj, start);
1164 index = lov_io_layout_at(lio, offset);
1165 if (index < 0 || !lsm_entry_inited(loo->lo_lsm, index) ||
1166 lsm_entry_is_foreign(loo->lo_lsm, index))
1169 /* avoid readahead to expand to stale components */
1170 if (!lov_entry(loo, index)->lle_valid)
1173 stripe = lov_stripe_number(loo->lo_lsm, index, offset);
1175 r0 = lov_r0(loo, index);
1176 if (unlikely(!r0->lo_sub[stripe]))
1179 sub = lov_sub_get(env, lio, lov_comp_index(index, stripe));
1181 RETURN(PTR_ERR(sub));
1183 lov_stripe_offset(loo->lo_lsm, index, offset, stripe, &suboff);
1184 rc = cl_io_read_ahead(sub->sub_env, &sub->sub_io,
1185 cl_index(lovsub2cl(r0->lo_sub[stripe]), suboff),
1188 CDEBUG(D_READA, DFID " cra_end = %lu, stripes = %d, rc = %d\n",
1189 PFID(lu_object_fid(lov2lu(loo))), ra->cra_end_idx,
1195 * Adjust the stripe index by layout of comp. ra->cra_end is the
1196 * maximum page index covered by an underlying DLM lock.
1197 * This function converts cra_end from stripe level to file level, and
1198 * make sure it's not beyond stripe and component boundary.
1201 /* cra_end is stripe level, convert it into file level */
1202 ra_end = ra->cra_end_idx;
1203 if (ra_end != CL_PAGE_EOF)
1204 ra->cra_end_idx = lov_stripe_pgoff(loo->lo_lsm, index,
1207 /* boundary of current component */
1208 ra_end = cl_index(obj, (loff_t)lov_io_extent(lio, index)->e_end);
1209 if (ra_end != CL_PAGE_EOF && ra->cra_end_idx >= ra_end)
1210 ra->cra_end_idx = ra_end - 1;
1212 if (r0->lo_nr == 1) /* single stripe file */
1215 pps = lov_lse(loo, index)->lsme_stripe_size >> PAGE_SHIFT;
1217 CDEBUG(D_READA, DFID " max_index = %lu, pps = %u, index = %d, "
1218 "stripe_size = %u, stripe no = %u, start index = %lu\n",
1219 PFID(lu_object_fid(lov2lu(loo))), ra->cra_end_idx, pps, index,
1220 lov_lse(loo, index)->lsme_stripe_size, stripe, start);
1222 /* never exceed the end of the stripe */
1223 ra->cra_end_idx = min_t(pgoff_t, ra->cra_end_idx,
1224 start + pps - start % pps - 1);
1228 int lov_io_lru_reserve(const struct lu_env *env,
1229 const struct cl_io_slice *ios, loff_t pos, size_t bytes)
1231 struct lov_io *lio = cl2lov_io(env, ios);
1232 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
1233 struct lov_io_sub *sub;
1234 struct lu_extent ext;
1241 ext.e_end = pos + bytes;
1242 lov_foreach_io_layout(index, lio, &ext) {
1243 struct lov_layout_entry *le = lov_entry(lio->lis_object, index);
1244 struct lov_layout_raid0 *r0 = &le->lle_raid0;
1249 if (!lsm_entry_inited(lsm, index))
1252 if (!le->lle_valid && !ios->cis_io->ci_designated_mirror) {
1253 CERROR(DFID": I/O to invalid component: %d, mirror: %d\n",
1254 PFID(lu_object_fid(lov2lu(lio->lis_object))),
1255 index, lio->lis_mirror_index);
1259 for (stripe = 0; stripe < r0->lo_nr; stripe++) {
1260 if (!lov_stripe_intersects(lsm, index, stripe,
1261 &ext, &start, &end))
1264 if (unlikely(!r0->lo_sub[stripe]))
1267 sub = lov_sub_get(env, lio,
1268 lov_comp_index(index, stripe));
1270 return PTR_ERR(sub);
1272 rc = cl_io_lru_reserve(sub->sub_env, &sub->sub_io, start,
1283 * lov implementation of cl_operations::cio_submit() method. It takes a list
1284 * of pages in \a queue, splits it into per-stripe sub-lists, invokes
1285 * cl_io_submit() on underlying devices to submit sub-lists, and then splices
1288 * Major complication of this function is a need to handle memory cleansing:
1289 * cl_io_submit() is called to write out pages as a part of VM memory
1290 * reclamation, and hence it may not fail due to memory shortages (system
1291 * dead-locks otherwise). To deal with this, some resources (sub-lists,
1292 * sub-environment, etc.) are allocated per-device on "startup" (i.e., in a
1293 * not-memory cleansing context), and in case of memory shortage, these
1294 * pre-allocated resources are used by lov_io_submit() under
1295 * lov_device::ld_mutex mutex.
1297 static int lov_io_submit(const struct lu_env *env,
1298 const struct cl_io_slice *ios,
1299 enum cl_req_type crt, struct cl_2queue *queue)
1301 struct cl_page_list *qin = &queue->c2_qin;
1302 struct lov_io *lio = cl2lov_io(env, ios);
1303 struct lov_io_sub *sub;
1304 struct cl_page_list *plist = &lov_env_info(env)->lti_plist;
1305 struct cl_page *page = cl_page_list_first(qin);
1306 struct cl_page *tmp;
1312 if (page->cp_type == CPT_TRANSIENT)
1315 cl_page_list_init(plist);
1316 while (qin->pl_nr > 0) {
1317 struct cl_2queue *cl2q = &lov_env_info(env)->lti_cl2q;
1319 page = cl_page_list_first(qin);
1320 if (lov_page_is_empty(page)) {
1321 cl_page_list_move(&queue->c2_qout, qin, page);
1324 * it could only be mirror read to get here therefore
1325 * the pages will be transient. We don't care about
1326 * the return code of cl_page_prep() at all.
1328 (void) cl_page_prep(env, ios->cis_io, page, crt);
1329 cl_page_completion(env, page, crt, 0);
1333 cl_2queue_init(cl2q);
1334 cl_page_list_move(&cl2q->c2_qin, qin, page);
1336 index = page->cp_lov_index;
1337 /* DIO is already split by stripe */
1339 cl_page_list_for_each_safe(page, tmp, qin) {
1340 /* this page is not on this stripe */
1341 if (index != page->cp_lov_index)
1344 cl_page_list_move(&cl2q->c2_qin, qin, page);
1347 cl_page_list_splice(qin, &cl2q->c2_qin);
1350 sub = lov_sub_get(env, lio, index);
1352 rc = cl_io_submit_rw(sub->sub_env, &sub->sub_io,
1358 cl_page_list_splice(&cl2q->c2_qin, plist);
1359 cl_page_list_splice(&cl2q->c2_qout, &queue->c2_qout);
1360 cl_2queue_fini(env, cl2q);
1366 cl_page_list_splice(plist, qin);
1367 cl_page_list_fini(env, plist);
1372 static int lov_io_commit_async(const struct lu_env *env,
1373 const struct cl_io_slice *ios,
1374 struct cl_page_list *queue, int from, int to,
1377 struct cl_page_list *plist = &lov_env_info(env)->lti_plist;
1378 struct lov_io *lio = cl2lov_io(env, ios);
1379 struct lov_io_sub *sub;
1380 struct cl_page *page;
1384 if (lio->lis_nr_subios == 1) {
1385 int idx = lio->lis_single_subio_index;
1387 LASSERT(!lov_page_is_empty(cl_page_list_first(queue)));
1389 sub = lov_sub_get(env, lio, idx);
1390 LASSERT(!IS_ERR(sub));
1391 LASSERT(sub == &lio->lis_single_subio);
1392 rc = cl_io_commit_async(sub->sub_env, &sub->sub_io, queue,
1397 cl_page_list_init(plist);
1398 while (queue->pl_nr > 0) {
1402 LASSERT(plist->pl_nr == 0);
1403 page = cl_page_list_first(queue);
1404 LASSERT(!lov_page_is_empty(page));
1406 cl_page_list_move(plist, queue, page);
1408 index = page->cp_lov_index;
1409 while (queue->pl_nr > 0) {
1410 page = cl_page_list_first(queue);
1411 if (index != page->cp_lov_index)
1414 cl_page_list_move(plist, queue, page);
1417 if (queue->pl_nr > 0) /* still has more pages */
1418 stripe_to = PAGE_SIZE;
1420 sub = lov_sub_get(env, lio, index);
1422 rc = cl_io_commit_async(sub->sub_env, &sub->sub_io,
1423 plist, from, stripe_to, cb);
1429 if (plist->pl_nr > 0) /* short write */
1434 if (lov_comp_entry(index) !=
1435 lov_comp_entry(page->cp_lov_index))
1436 cl_io_extent_release(sub->sub_env, &sub->sub_io);
1439 /* for error case, add the page back into the qin list */
1440 LASSERT(ergo(rc == 0, plist->pl_nr == 0));
1441 while (plist->pl_nr > 0) {
1442 /* error occurred, add the uncommitted pages back into queue */
1443 page = cl_page_list_last(plist);
1444 cl_page_list_move_head(queue, plist, page);
1450 static int lov_io_fault_start(const struct lu_env *env,
1451 const struct cl_io_slice *ios)
1453 struct cl_fault_io *fio;
1455 struct lov_io_sub *sub;
1462 fio = &ios->cis_io->u.ci_fault;
1463 lio = cl2lov_io(env, ios);
1466 * LU-14502: ft_page could be an existing cl_page associated with
1467 * the vmpage covering the fault index, and the page may still
1468 * refer to another mirror of an old IO.
1470 if (lov_is_flr(lio->lis_object)) {
1471 offset = cl_offset(ios->cis_obj, fio->ft_index);
1472 entry = lov_io_layout_at(lio, offset);
1474 CERROR(DFID": page fault index %lu invalid component: "
1476 PFID(lu_object_fid(&ios->cis_obj->co_lu)),
1477 fio->ft_index, entry,
1478 lio->lis_mirror_index);
1481 stripe = lov_stripe_number(lio->lis_object->lo_lsm,
1484 if (fio->ft_page->cp_lov_index !=
1485 lov_comp_index(entry, stripe)) {
1486 CDEBUG(D_INFO, DFID": page fault at index %lu, "
1487 "at mirror %u comp entry %u stripe %u, "
1488 "been used with comp entry %u stripe %u\n",
1489 PFID(lu_object_fid(&ios->cis_obj->co_lu)),
1490 fio->ft_index, lio->lis_mirror_index,
1492 lov_comp_entry(fio->ft_page->cp_lov_index),
1493 lov_comp_stripe(fio->ft_page->cp_lov_index));
1495 fio->ft_page->cp_lov_index =
1496 lov_comp_index(entry, stripe);
1500 sub = lov_sub_get(env, lio, fio->ft_page->cp_lov_index);
1501 sub->sub_io.u.ci_fault.ft_nob = fio->ft_nob;
1503 RETURN(lov_io_start(env, ios));
1506 static int lov_io_setattr_start(const struct lu_env *env,
1507 const struct cl_io_slice *ios)
1509 struct lov_io *lio = cl2lov_io(env, ios);
1510 struct cl_io *parent = ios->cis_io;
1511 struct lov_io_sub *sub;
1512 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
1516 if (cl_io_is_fallocate(parent)) {
1517 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1518 loff_t size = parent->u.ci_setattr.sa_attr.lvb_size;
1519 int index = lov_comp_entry(sub->sub_subio_index);
1520 int stripe = lov_comp_stripe(sub->sub_subio_index);
1522 size = lov_size_to_stripe(lsm, index, size, stripe);
1523 sub->sub_io.u.ci_setattr.sa_attr.lvb_size = size;
1524 sub->sub_io.u.ci_setattr.sa_avalid =
1525 parent->u.ci_setattr.sa_avalid;
1529 RETURN(lov_io_start(env, ios));
1532 static void lov_io_fsync_end(const struct lu_env *env,
1533 const struct cl_io_slice *ios)
1535 struct lov_io *lio = cl2lov_io(env, ios);
1536 struct lov_io_sub *sub;
1537 unsigned int *written = &ios->cis_io->u.ci_fsync.fi_nr_written;
1541 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1542 struct cl_io *subio = &sub->sub_io;
1544 lov_io_end_wrapper(sub->sub_env, subio);
1546 if (subio->ci_result == 0)
1547 *written += subio->u.ci_fsync.fi_nr_written;
1552 static void lov_io_lseek_end(const struct lu_env *env,
1553 const struct cl_io_slice *ios)
1555 struct lov_io *lio = cl2lov_io(env, ios);
1556 struct cl_io *io = lio->lis_cl.cis_io;
1557 struct lov_stripe_md *lsm = lio->lis_object->lo_lsm;
1558 struct lov_io_sub *sub;
1559 loff_t offset = -ENXIO;
1561 bool seek_hole = io->u.ci_lseek.ls_whence == SEEK_HOLE;
1565 list_for_each_entry(sub, &lio->lis_active, sub_linkage) {
1566 struct cl_io *subio = &sub->sub_io;
1567 int index = lov_comp_entry(sub->sub_subio_index);
1568 int stripe = lov_comp_stripe(sub->sub_subio_index);
1569 loff_t sub_off, lov_off;
1570 __u64 comp_end = lsm->lsm_entries[index]->lsme_extent.e_end;
1572 lov_io_end_wrapper(sub->sub_env, subio);
1574 if (io->ci_result == 0)
1575 io->ci_result = sub->sub_io.ci_result;
1580 CDEBUG(D_INFO, DFID": entry %x stripe %u: SEEK_%s from %lld\n",
1581 PFID(lu_object_fid(lov2lu(lio->lis_object))),
1582 index, stripe, seek_hole ? "HOLE" : "DATA",
1583 subio->u.ci_lseek.ls_start);
1585 /* first subio with positive result is what we need */
1586 sub_off = subio->u.ci_lseek.ls_result;
1587 /* Expected error, offset is out of stripe file size */
1588 if (sub_off == -ENXIO)
1590 /* Any other errors are not expected with ci_result == 0 */
1592 CDEBUG(D_INFO, "unexpected error: rc = %lld\n",
1594 io->ci_result = sub_off;
1597 lov_off = lov_stripe_size(lsm, index, sub_off + 1, stripe) - 1;
1599 /* the only way to get negatove lov_off here is too big
1600 * result. Return -EOVERFLOW then.
1602 io->ci_result = -EOVERFLOW;
1603 CDEBUG(D_INFO, "offset %llu is too big: rc = %d\n",
1604 (u64)lov_off, io->ci_result);
1607 if (lov_off < io->u.ci_lseek.ls_start) {
1608 io->ci_result = -EINVAL;
1609 CDEBUG(D_INFO, "offset %lld < start %lld: rc = %d\n",
1610 sub_off, io->u.ci_lseek.ls_start, io->ci_result);
1613 /* resulting offset can be out of component range if stripe
1614 * object is full and its file size was returned as virtual
1615 * hole start. Skip this result, the next component will give
1616 * us correct lseek result but keep possible hole offset in
1617 * case there is no more components ahead
1619 if (lov_off >= comp_end) {
1620 /* must be SEEK_HOLE case */
1621 if (likely(seek_hole)) {
1622 /* save comp end as potential hole offset */
1623 hole_off = max_t(__u64, comp_end, hole_off);
1625 io->ci_result = -EINVAL;
1627 "off %lld >= comp_end %llu: rc = %d\n",
1628 lov_off, comp_end, io->ci_result);
1633 CDEBUG(D_INFO, "SEEK_%s: %lld->%lld/%lld: rc = %d\n",
1634 seek_hole ? "HOLE" : "DATA",
1635 subio->u.ci_lseek.ls_start, sub_off, lov_off,
1636 sub->sub_io.ci_result);
1637 offset = min_t(__u64, offset, lov_off);
1639 /* no result but some component returns hole as component end */
1640 if (seek_hole && offset == -ENXIO && hole_off > 0)
1643 io->u.ci_lseek.ls_result = offset;
1647 static const struct cl_io_operations lov_io_ops = {
1650 .cio_fini = lov_io_fini,
1651 .cio_iter_init = lov_io_rw_iter_init,
1652 .cio_iter_fini = lov_io_iter_fini,
1653 .cio_lock = lov_io_lock,
1654 .cio_unlock = lov_io_unlock,
1655 .cio_start = lov_io_start,
1656 .cio_end = lov_io_end
1659 .cio_fini = lov_io_fini,
1660 .cio_iter_init = lov_io_rw_iter_init,
1661 .cio_iter_fini = lov_io_iter_fini,
1662 .cio_lock = lov_io_lock,
1663 .cio_unlock = lov_io_unlock,
1664 .cio_start = lov_io_start,
1665 .cio_end = lov_io_end
1668 .cio_fini = lov_io_fini,
1669 .cio_iter_init = lov_io_setattr_iter_init,
1670 .cio_iter_fini = lov_io_iter_fini,
1671 .cio_lock = lov_io_lock,
1672 .cio_unlock = lov_io_unlock,
1673 .cio_start = lov_io_setattr_start,
1674 .cio_end = lov_io_end
1676 [CIT_DATA_VERSION] = {
1677 .cio_fini = lov_io_fini,
1678 .cio_iter_init = lov_io_iter_init,
1679 .cio_iter_fini = lov_io_iter_fini,
1680 .cio_lock = lov_io_lock,
1681 .cio_unlock = lov_io_unlock,
1682 .cio_start = lov_io_start,
1683 .cio_end = lov_io_data_version_end,
1686 .cio_fini = lov_io_fini,
1687 .cio_iter_init = lov_io_iter_init,
1688 .cio_iter_fini = lov_io_iter_fini,
1689 .cio_lock = lov_io_lock,
1690 .cio_unlock = lov_io_unlock,
1691 .cio_start = lov_io_fault_start,
1692 .cio_end = lov_io_end
1695 .cio_fini = lov_io_fini,
1696 .cio_iter_init = lov_io_iter_init,
1697 .cio_iter_fini = lov_io_iter_fini,
1698 .cio_lock = lov_io_lock,
1699 .cio_unlock = lov_io_unlock,
1700 .cio_start = lov_io_start,
1701 .cio_end = lov_io_fsync_end
1704 .cio_fini = lov_io_fini,
1705 .cio_iter_init = lov_io_iter_init,
1706 .cio_iter_fini = lov_io_iter_fini,
1707 .cio_lock = lov_io_lock,
1708 .cio_unlock = lov_io_unlock,
1709 .cio_start = lov_io_start,
1710 .cio_end = lov_io_end
1713 .cio_fini = lov_io_fini,
1714 .cio_iter_init = lov_io_iter_init,
1715 .cio_iter_fini = lov_io_iter_fini,
1716 .cio_lock = lov_io_lock,
1717 .cio_unlock = lov_io_unlock,
1718 .cio_start = lov_io_start,
1719 .cio_end = lov_io_lseek_end
1722 .cio_fini = lov_io_fini,
1725 .cio_fini = lov_io_fini
1728 .cio_read_ahead = lov_io_read_ahead,
1729 .cio_lru_reserve = lov_io_lru_reserve,
1730 .cio_submit = lov_io_submit,
1731 .cio_commit_async = lov_io_commit_async,
1734 /*****************************************************************************
1736 * Empty lov io operations.
1740 static void lov_empty_io_fini(const struct lu_env *env,
1741 const struct cl_io_slice *ios)
1743 struct lov_object *lov = cl2lov(ios->cis_obj);
1746 if (atomic_dec_and_test(&lov->lo_active_ios))
1747 wake_up(&lov->lo_waitq);
1751 static int lov_empty_io_submit(const struct lu_env *env,
1752 const struct cl_io_slice *ios,
1753 enum cl_req_type crt, struct cl_2queue *queue)
1758 static void lov_empty_impossible(const struct lu_env *env,
1759 struct cl_io_slice *ios)
1764 #define LOV_EMPTY_IMPOSSIBLE ((void *)lov_empty_impossible)
1767 * An io operation vector for files without stripes.
1769 static const struct cl_io_operations lov_empty_io_ops = {
1772 .cio_fini = lov_empty_io_fini,
1774 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1775 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1776 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1777 .cio_end = LOV_EMPTY_IMPOSSIBLE
1781 .cio_fini = lov_empty_io_fini,
1782 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1783 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1784 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1785 .cio_end = LOV_EMPTY_IMPOSSIBLE
1788 .cio_fini = lov_empty_io_fini,
1789 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1790 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1791 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1792 .cio_end = LOV_EMPTY_IMPOSSIBLE
1795 .cio_fini = lov_empty_io_fini,
1796 .cio_iter_init = LOV_EMPTY_IMPOSSIBLE,
1797 .cio_lock = LOV_EMPTY_IMPOSSIBLE,
1798 .cio_start = LOV_EMPTY_IMPOSSIBLE,
1799 .cio_end = LOV_EMPTY_IMPOSSIBLE
1802 .cio_fini = lov_empty_io_fini
1805 .cio_fini = lov_empty_io_fini
1808 .cio_fini = lov_empty_io_fini
1811 .cio_fini = lov_empty_io_fini
1814 .cio_submit = lov_empty_io_submit,
1815 .cio_commit_async = LOV_EMPTY_IMPOSSIBLE
1818 int lov_io_init_composite(const struct lu_env *env, struct cl_object *obj,
1821 struct lov_io *lio = lov_env_io(env);
1822 struct lov_object *lov = cl2lov(obj);
1827 INIT_LIST_HEAD(&lio->lis_active);
1828 result = lov_io_slice_init(lio, lov, io);
1832 result = lov_io_subio_init(env, lio, io);
1834 cl_io_slice_add(io, &lio->lis_cl, obj, &lov_io_ops);
1835 atomic_inc(&lov->lo_active_ios);
1839 io->ci_result = result < 0 ? result : 0;
1843 int lov_io_init_empty(const struct lu_env *env, struct cl_object *obj,
1846 struct lov_object *lov = cl2lov(obj);
1847 struct lov_io *lio = lov_env_io(env);
1851 lio->lis_object = lov;
1852 switch (io->ci_type) {
1864 case CIT_DATA_VERSION:
1872 CERROR("Page fault on a file without stripes: "DFID"\n",
1873 PFID(lu_object_fid(&obj->co_lu)));
1877 cl_io_slice_add(io, &lio->lis_cl, obj, &lov_empty_io_ops);
1878 atomic_inc(&lov->lo_active_ios);
1881 io->ci_result = result < 0 ? result : 0;
1885 int lov_io_init_released(const struct lu_env *env, struct cl_object *obj,
1888 struct lov_object *lov = cl2lov(obj);
1889 struct lov_io *lio = lov_env_io(env);
1893 LASSERT(lov->lo_lsm != NULL);
1894 lio->lis_object = lov;
1896 switch (io->ci_type) {
1898 LASSERTF(0, "invalid type %d\n", io->ci_type);
1899 result = -EOPNOTSUPP;
1905 case CIT_DATA_VERSION:
1910 * the truncate to 0 is managed by MDT:
1911 * - in open, for open O_TRUNC
1912 * - in setattr, for truncate
1915 * the truncate is for size > 0 so triggers a restore,
1916 * also trigger a restore for prealloc/punch
1918 if (cl_io_is_trunc(io) || cl_io_is_fallocate(io)) {
1919 io->ci_restore_needed = 1;
1928 io->ci_restore_needed = 1;
1934 cl_io_slice_add(io, &lio->lis_cl, obj, &lov_empty_io_ops);
1935 atomic_inc(&lov->lo_active_ios);
1938 io->ci_result = result < 0 ? result : 0;
1943 * Return the index in composite:lo_entries by the file offset
1945 int lov_io_layout_at(struct lov_io *lio, __u64 offset)
1947 struct lov_object *lov = lio->lis_object;
1948 struct lov_layout_composite *comp = &lov->u.composite;
1949 int start_index = 0;
1950 int end_index = comp->lo_entry_count - 1;
1953 LASSERT(lov->lo_type == LLT_COMP);
1955 /* This is actual file offset so nothing can cover eof. */
1956 if (offset == LUSTRE_EOF)
1959 if (lov_is_flr(lov)) {
1960 struct lov_mirror_entry *lre;
1962 LASSERT(lio->lis_mirror_index >= 0);
1964 lre = &comp->lo_mirrors[lio->lis_mirror_index];
1965 start_index = lre->lre_start;
1966 end_index = lre->lre_end;
1969 for (i = start_index; i <= end_index; i++) {
1970 struct lov_layout_entry *lle = lov_entry(lov, i);
1972 LASSERT(!lsme_is_foreign(lle->lle_lsme));
1974 if ((offset >= lle->lle_extent->e_start &&
1975 offset < lle->lle_extent->e_end) ||
1976 (offset == OBD_OBJECT_EOF &&
1977 lle->lle_extent->e_end == OBD_OBJECT_EOF))