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,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License version 2 for more details. A copy is
14 * included in the COPYING file that accompanied this code.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 * Copyright (c) 2013, 2016, Intel Corporation.
26 * lustre/lfsck/lfsck_lib.c
28 * Author: Fan, Yong <fan.yong@intel.com>
31 #define DEBUG_SUBSYSTEM S_LFSCK
33 #include <linux/kthread.h>
34 #include <linux/sched.h>
35 #include <linux/list.h>
36 #include <lu_object.h>
37 #include <dt_object.h>
38 #include <md_object.h>
39 #include <lustre_fld.h>
40 #include <lustre_lib.h>
41 #include <lustre_net.h>
42 #include <lustre_lfsck.h>
43 #include <lustre/lustre_lfsck_user.h>
45 #include "lfsck_internal.h"
47 #define LFSCK_CHECKPOINT_SKIP 1
49 /* define lfsck thread key */
50 LU_KEY_INIT(lfsck, struct lfsck_thread_info);
52 static void lfsck_key_fini(const struct lu_context *ctx,
53 struct lu_context_key *key, void *data)
55 struct lfsck_thread_info *info = data;
57 lu_buf_free(&info->lti_linkea_buf);
58 lu_buf_free(&info->lti_linkea_buf2);
59 lu_buf_free(&info->lti_big_buf);
63 LU_CONTEXT_KEY_DEFINE(lfsck, LCT_MD_THREAD | LCT_DT_THREAD);
64 LU_KEY_INIT_GENERIC(lfsck);
66 static struct list_head lfsck_instance_list;
67 static struct list_head lfsck_ost_orphan_list;
68 static struct list_head lfsck_mdt_orphan_list;
69 static DEFINE_SPINLOCK(lfsck_instance_lock);
71 const char *lfsck_flags_names[] = {
80 const char *lfsck_param_names[] = {
90 "delay_create_ostobj",
94 enum lfsck_verify_lpf_types {
96 LVLT_BY_NAMEENTRY = 1,
100 lfsck_reset_ltd_status(struct lfsck_tgt_desc *ltd, enum lfsck_type type)
102 if (type == LFSCK_TYPE_LAYOUT) {
103 ltd->ltd_layout_status = LS_MAX;
104 ltd->ltd_layout_repaired = 0;
106 ltd->ltd_namespace_status = LS_MAX;
107 ltd->ltd_namespace_repaired = 0;
111 static int lfsck_tgt_descs_init(struct lfsck_tgt_descs *ltds)
113 spin_lock_init(<ds->ltd_lock);
114 init_rwsem(<ds->ltd_rw_sem);
115 INIT_LIST_HEAD(<ds->ltd_orphan);
116 ltds->ltd_tgts_bitmap = CFS_ALLOCATE_BITMAP(BITS_PER_LONG);
117 if (ltds->ltd_tgts_bitmap == NULL)
123 static void lfsck_tgt_descs_fini(struct lfsck_tgt_descs *ltds)
125 struct lfsck_tgt_desc *ltd;
126 struct lfsck_tgt_desc *next;
129 down_write(<ds->ltd_rw_sem);
131 list_for_each_entry_safe(ltd, next, <ds->ltd_orphan,
133 list_del_init(<d->ltd_orphan_list);
137 if (unlikely(ltds->ltd_tgts_bitmap == NULL)) {
138 up_write(<ds->ltd_rw_sem);
143 cfs_foreach_bit(ltds->ltd_tgts_bitmap, idx) {
144 ltd = lfsck_ltd2tgt(ltds, idx);
145 if (likely(ltd != NULL)) {
146 LASSERT(list_empty(<d->ltd_layout_list));
147 LASSERT(list_empty(<d->ltd_layout_phase_list));
148 LASSERT(list_empty(<d->ltd_namespace_list));
149 LASSERT(list_empty(<d->ltd_namespace_phase_list));
152 cfs_bitmap_clear(ltds->ltd_tgts_bitmap, idx);
153 lfsck_assign_tgt(ltds, NULL, idx);
158 LASSERTF(ltds->ltd_tgtnr == 0, "tgt count unmatched: %d\n",
161 for (idx = 0; idx < TGT_PTRS; idx++) {
162 if (ltds->ltd_tgts_idx[idx] != NULL) {
163 OBD_FREE_PTR(ltds->ltd_tgts_idx[idx]);
164 ltds->ltd_tgts_idx[idx] = NULL;
168 CFS_FREE_BITMAP(ltds->ltd_tgts_bitmap);
169 ltds->ltd_tgts_bitmap = NULL;
170 up_write(<ds->ltd_rw_sem);
173 static int __lfsck_add_target(const struct lu_env *env,
174 struct lfsck_instance *lfsck,
175 struct lfsck_tgt_desc *ltd,
176 bool for_ost, bool locked)
178 struct lfsck_tgt_descs *ltds;
179 __u32 index = ltd->ltd_index;
184 ltds = &lfsck->li_ost_descs;
186 ltds = &lfsck->li_mdt_descs;
189 down_write(<ds->ltd_rw_sem);
191 LASSERT(ltds->ltd_tgts_bitmap != NULL);
193 if (index >= ltds->ltd_tgts_bitmap->size) {
194 __u32 newsize = max((__u32)ltds->ltd_tgts_bitmap->size,
195 (__u32)BITS_PER_LONG);
196 struct cfs_bitmap *old_bitmap = ltds->ltd_tgts_bitmap;
197 struct cfs_bitmap *new_bitmap;
199 while (newsize < index + 1)
202 new_bitmap = CFS_ALLOCATE_BITMAP(newsize);
203 if (new_bitmap == NULL)
204 GOTO(unlock, rc = -ENOMEM);
206 if (ltds->ltd_tgtnr > 0)
207 cfs_bitmap_copy(new_bitmap, old_bitmap);
208 ltds->ltd_tgts_bitmap = new_bitmap;
209 CFS_FREE_BITMAP(old_bitmap);
212 if (cfs_bitmap_check(ltds->ltd_tgts_bitmap, index)) {
213 CERROR("%s: the device %s (%u) is registered already\n",
214 lfsck_lfsck2name(lfsck),
215 ltd->ltd_tgt->dd_lu_dev.ld_obd->obd_name, index);
216 GOTO(unlock, rc = -EEXIST);
219 if (ltds->ltd_tgts_idx[index / TGT_PTRS_PER_BLOCK] == NULL) {
220 OBD_ALLOC_PTR(ltds->ltd_tgts_idx[index / TGT_PTRS_PER_BLOCK]);
221 if (ltds->ltd_tgts_idx[index / TGT_PTRS_PER_BLOCK] == NULL)
222 GOTO(unlock, rc = -ENOMEM);
225 lfsck_assign_tgt(ltds, ltd, index);
226 cfs_bitmap_set(ltds->ltd_tgts_bitmap, index);
229 GOTO(unlock, rc = 0);
233 up_write(<ds->ltd_rw_sem);
238 static int lfsck_add_target_from_orphan(const struct lu_env *env,
239 struct lfsck_instance *lfsck)
241 struct lfsck_tgt_descs *ltds = &lfsck->li_ost_descs;
242 struct lfsck_tgt_desc *ltd;
243 struct lfsck_tgt_desc *next;
244 struct list_head *head = &lfsck_ost_orphan_list;
249 spin_lock(&lfsck_instance_lock);
250 list_for_each_entry_safe(ltd, next, head, ltd_orphan_list) {
251 if (ltd->ltd_key == lfsck->li_bottom)
252 list_move_tail(<d->ltd_orphan_list,
255 spin_unlock(&lfsck_instance_lock);
257 down_write(<ds->ltd_rw_sem);
258 while (!list_empty(<ds->ltd_orphan)) {
259 ltd = list_entry(ltds->ltd_orphan.next,
260 struct lfsck_tgt_desc,
262 list_del_init(<d->ltd_orphan_list);
263 rc = __lfsck_add_target(env, lfsck, ltd, for_ost, true);
264 /* Do not hold the semaphore for too long time. */
265 up_write(<ds->ltd_rw_sem);
269 down_write(<ds->ltd_rw_sem);
271 up_write(<ds->ltd_rw_sem);
274 ltds = &lfsck->li_mdt_descs;
275 head = &lfsck_mdt_orphan_list;
283 static inline struct lfsck_component *
284 __lfsck_component_find(struct lfsck_instance *lfsck, __u16 type,
285 struct list_head *list)
287 struct lfsck_component *com;
289 list_for_each_entry(com, list, lc_link) {
290 if (com->lc_type == type)
296 struct lfsck_component *
297 lfsck_component_find(struct lfsck_instance *lfsck, __u16 type)
299 struct lfsck_component *com;
301 spin_lock(&lfsck->li_lock);
302 com = __lfsck_component_find(lfsck, type, &lfsck->li_list_scan);
306 com = __lfsck_component_find(lfsck, type,
307 &lfsck->li_list_double_scan);
311 com = __lfsck_component_find(lfsck, type, &lfsck->li_list_idle);
315 lfsck_component_get(com);
316 spin_unlock(&lfsck->li_lock);
320 void lfsck_component_cleanup(const struct lu_env *env,
321 struct lfsck_component *com)
323 if (!list_empty(&com->lc_link))
324 list_del_init(&com->lc_link);
325 if (!list_empty(&com->lc_link_dir))
326 list_del_init(&com->lc_link_dir);
328 lfsck_component_put(env, com);
331 int lfsck_fid_alloc(const struct lu_env *env, struct lfsck_instance *lfsck,
332 struct lu_fid *fid, bool locked)
334 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
339 mutex_lock(&lfsck->li_mutex);
341 rc = seq_client_alloc_fid(env, lfsck->li_seq, fid);
343 bk->lb_last_fid = *fid;
344 /* We do not care about whether the subsequent sub-operations
345 * failed or not. The worst case is that one FID is lost that
346 * is not a big issue for the LFSCK since it is relative rare
347 * for LFSCK create. */
348 rc = lfsck_bookmark_store(env, lfsck);
352 mutex_unlock(&lfsck->li_mutex);
357 static int __lfsck_ibits_lock(const struct lu_env *env,
358 struct lfsck_instance *lfsck,
359 struct dt_object *obj, struct ldlm_res_id *resid,
360 struct lustre_handle *lh, __u64 bits,
363 struct lfsck_thread_info *info = lfsck_env_info(env);
364 union ldlm_policy_data *policy = &info->lti_policy;
365 __u64 flags = LDLM_FL_ATOMIC_CB;
368 LASSERT(lfsck->li_namespace != NULL);
370 memset(policy, 0, sizeof(*policy));
371 policy->l_inodebits.bits = bits;
372 if (dt_object_remote(obj)) {
373 struct ldlm_enqueue_info *einfo = &info->lti_einfo;
375 memset(einfo, 0, sizeof(*einfo));
376 einfo->ei_type = LDLM_IBITS;
377 einfo->ei_mode = mode;
378 einfo->ei_cb_bl = ldlm_blocking_ast;
379 einfo->ei_cb_cp = ldlm_completion_ast;
380 einfo->ei_res_id = resid;
382 rc = dt_object_lock(env, obj, lh, einfo, policy);
384 rc = ldlm_cli_enqueue_local(lfsck->li_namespace, resid,
385 LDLM_IBITS, policy, mode,
386 &flags, ldlm_blocking_ast,
387 ldlm_completion_ast, NULL, NULL,
388 0, LVB_T_NONE, NULL, lh);
391 if (rc == ELDLM_OK) {
394 memset(lh, 0, sizeof(*lh));
402 * Request the specified ibits lock for the given object.
404 * Before the LFSCK modifying on the namespace visible object,
405 * it needs to acquire related ibits ldlm lock.
407 * \param[in] env pointer to the thread context
408 * \param[in] lfsck pointer to the lfsck instance
409 * \param[in] obj pointer to the dt_object to be locked
410 * \param[out] lh pointer to the lock handle
411 * \param[in] bits the bits for the ldlm lock to be acquired
412 * \param[in] mode the mode for the ldlm lock to be acquired
414 * \retval 0 for success
415 * \retval negative error number on failure
417 int lfsck_ibits_lock(const struct lu_env *env, struct lfsck_instance *lfsck,
418 struct dt_object *obj, struct lustre_handle *lh,
419 __u64 bits, enum ldlm_mode mode)
421 struct ldlm_res_id *resid = &lfsck_env_info(env)->lti_resid;
423 LASSERT(!lustre_handle_is_used(lh));
425 fid_build_reg_res_name(lfsck_dto2fid(obj), resid);
426 return __lfsck_ibits_lock(env, lfsck, obj, resid, lh, bits, mode);
430 * Release the the specified ibits lock.
432 * If the lock has been acquired before, release it
433 * and cleanup the handle. Otherwise, do nothing.
435 * \param[in] lh pointer to the lock handle
436 * \param[in] mode the mode for the ldlm lock to be released
438 void lfsck_ibits_unlock(struct lustre_handle *lh, enum ldlm_mode mode)
440 if (lustre_handle_is_used(lh)) {
441 ldlm_lock_decref(lh, mode);
442 memset(lh, 0, sizeof(*lh));
447 * Request compound ibits locks for the given <obj, name> pairs.
449 * Before the LFSCK modifying on the namespace visible object, it needs to
450 * acquire related ibits ldlm lock. Usually, we can use lfsck_ibits_lock for
451 * the lock purpose. But the simple lfsck_ibits_lock for directory-based
452 * modificationis (such as insert name entry to the directory) may be too
453 * coarse-grained and not efficient.
455 * The lfsck_lock() will request compound ibits locks on the specified
456 * <obj, name> pairs: the PDO (Parallel Directory Operations) ibits (UPDATE)
457 * lock on the directory object, and the regular ibits lock on the name hash.
459 * \param[in] env pointer to the thread context
460 * \param[in] lfsck pointer to the lfsck instance
461 * \param[in] obj pointer to the dt_object to be locked
462 * \param[in] name used for building the PDO lock resource
463 * \param[out] llh pointer to the lfsck_lock_handle
464 * \param[in] bits the bits for the ldlm lock to be acquired
465 * \param[in] mode the mode for the ldlm lock to be acquired
467 * \retval 0 for success
468 * \retval negative error number on failure
470 int lfsck_lock(const struct lu_env *env, struct lfsck_instance *lfsck,
471 struct dt_object *obj, const char *name,
472 struct lfsck_lock_handle *llh, __u64 bits, enum ldlm_mode mode)
474 struct ldlm_res_id *resid = &lfsck_env_info(env)->lti_resid;
477 LASSERT(S_ISDIR(lfsck_object_type(obj)));
478 LASSERT(name != NULL);
479 LASSERT(name[0] != 0);
480 LASSERT(!lustre_handle_is_used(&llh->llh_pdo_lh));
481 LASSERT(!lustre_handle_is_used(&llh->llh_reg_lh));
485 llh->llh_pdo_mode = LCK_EX;
488 llh->llh_pdo_mode = LCK_CW;
491 llh->llh_pdo_mode = LCK_CR;
494 CDEBUG(D_LFSCK, "%s: unexpected PDO lock mode %u on the obj "
495 DFID"\n", lfsck_lfsck2name(lfsck), mode,
496 PFID(lfsck_dto2fid(obj)));
500 fid_build_reg_res_name(lfsck_dto2fid(obj), resid);
501 rc = __lfsck_ibits_lock(env, lfsck, obj, resid, &llh->llh_pdo_lh,
502 MDS_INODELOCK_UPDATE, llh->llh_pdo_mode);
506 llh->llh_reg_mode = mode;
507 resid->name[LUSTRE_RES_ID_HSH_OFF] = ll_full_name_hash(NULL, name,
509 LASSERT(resid->name[LUSTRE_RES_ID_HSH_OFF] != 0);
510 rc = __lfsck_ibits_lock(env, lfsck, obj, resid, &llh->llh_reg_lh,
511 bits, llh->llh_reg_mode);
513 lfsck_ibits_unlock(&llh->llh_pdo_lh, llh->llh_pdo_mode);
519 * Release the the compound ibits locks.
521 * \param[in] llh pointer to the lfsck_lock_handle to be released
523 void lfsck_unlock(struct lfsck_lock_handle *llh)
525 lfsck_ibits_unlock(&llh->llh_reg_lh, llh->llh_reg_mode);
526 lfsck_ibits_unlock(&llh->llh_pdo_lh, llh->llh_pdo_mode);
529 int lfsck_find_mdt_idx_by_fid(const struct lu_env *env,
530 struct lfsck_instance *lfsck,
531 const struct lu_fid *fid)
533 struct seq_server_site *ss = lfsck_dev_site(lfsck);
534 struct lu_seq_range *range = &lfsck_env_info(env)->lti_range;
537 if (unlikely(fid_seq(fid) == FID_SEQ_LOCAL_FILE)) {
538 /* "ROOT" is always on the MDT0. */
539 if (lu_fid_eq(fid, &lfsck->li_global_root_fid))
542 return lfsck_dev_idx(lfsck);
545 fld_range_set_mdt(range);
546 rc = fld_server_lookup(env, ss->ss_server_fld, fid_seq(fid), range);
548 rc = range->lsr_index;
553 const char dot[] = ".";
554 const char dotdot[] = "..";
555 static const char dotlustre[] = ".lustre";
556 static const char lostfound[] = "lost+found";
559 * Remove the name entry from the .lustre/lost+found directory.
561 * No need to care about the object referenced by the name entry,
562 * either the name entry is invalid or redundant, or the referenced
563 * object has been processed or will be handled by others.
565 * \param[in] env pointer to the thread context
566 * \param[in] lfsck pointer to the lfsck instance
567 * \param[in] name the name for the name entry to be removed
569 * \retval 0 for success
570 * \retval negative error number on failure
572 static int lfsck_lpf_remove_name_entry(const struct lu_env *env,
573 struct lfsck_instance *lfsck,
576 struct dt_object *parent = lfsck->li_lpf_root_obj;
577 struct dt_device *dev = lfsck_obj2dev(parent);
579 struct lfsck_lock_handle *llh = &lfsck_env_info(env)->lti_llh;
583 rc = lfsck_lock(env, lfsck, parent, name, llh,
584 MDS_INODELOCK_UPDATE, LCK_PW);
588 th = dt_trans_create(env, dev);
590 GOTO(unlock, rc = PTR_ERR(th));
592 rc = dt_declare_delete(env, parent, (const struct dt_key *)name, th);
596 rc = dt_declare_ref_del(env, parent, th);
600 rc = dt_trans_start_local(env, dev, th);
604 rc = dt_delete(env, parent, (const struct dt_key *)name, th);
608 dt_write_lock(env, parent, 0);
609 rc = dt_ref_del(env, parent, th);
610 dt_write_unlock(env, parent);
615 dt_trans_stop(env, dev, th);
620 CDEBUG(D_LFSCK, "%s: remove name entry "DFID"/%s: rc = %d\n",
621 lfsck_lfsck2name(lfsck), PFID(lfsck_dto2fid(parent)), name, rc);
626 static int lfsck_create_lpf_local(const struct lu_env *env,
627 struct lfsck_instance *lfsck,
628 struct dt_object *child,
630 struct dt_object_format *dof,
633 struct dt_insert_rec *rec = &lfsck_env_info(env)->lti_dt_rec;
634 struct dt_object *parent = lfsck->li_lpf_root_obj;
635 struct dt_device *dev = lfsck_obj2dev(child);
636 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
637 struct dt_object *bk_obj = lfsck->li_bookmark_obj;
638 const struct lu_fid *cfid = lfsck_dto2fid(child);
639 struct thandle *th = NULL;
640 struct linkea_data ldata = { NULL };
641 struct lu_buf linkea_buf;
642 const struct lu_name *cname;
644 int len = sizeof(struct lfsck_bookmark);
648 cname = lfsck_name_get_const(env, name, strlen(name));
649 rc = linkea_links_new(&ldata, &lfsck_env_info(env)->lti_linkea_buf2,
650 cname, lfsck_dto2fid(parent));
654 th = dt_trans_create(env, dev);
658 /* 1a. create child */
659 rc = dt_declare_create(env, child, la, NULL, dof, th);
663 if (!dt_try_as_dir(env, child))
664 GOTO(stop, rc = -ENOTDIR);
666 /* 2a. increase child nlink */
667 rc = dt_declare_ref_add(env, child, th);
671 /* 3a. insert dot into child dir */
672 rec->rec_type = S_IFDIR;
674 rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
675 (const struct dt_key *)dot, th);
679 /* 4a. insert dotdot into child dir */
680 rec->rec_fid = &LU_LPF_FID;
681 rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
682 (const struct dt_key *)dotdot, th);
686 /* 5a. insert linkEA for child */
687 lfsck_buf_init(&linkea_buf, ldata.ld_buf->lb_buf,
688 ldata.ld_leh->leh_len);
689 rc = dt_declare_xattr_set(env, child, &linkea_buf,
690 XATTR_NAME_LINK, 0, th);
694 /* 6a. insert name into parent dir */
695 rec->rec_type = S_IFDIR;
697 rc = dt_declare_insert(env, parent, (const struct dt_rec *)rec,
698 (const struct dt_key *)name, th);
702 /* 7a. increase parent nlink */
703 rc = dt_declare_ref_add(env, parent, th);
707 /* 8a. update bookmark */
708 rc = dt_declare_record_write(env, bk_obj,
709 lfsck_buf_get(env, bk, len), 0, th);
713 rc = dt_trans_start_local(env, dev, th);
717 dt_write_lock(env, child, 0);
718 /* 1b. create child */
719 rc = dt_create(env, child, la, NULL, dof, th);
723 /* 2b. increase child nlink */
724 rc = dt_ref_add(env, child, th);
728 /* 3b. insert dot into child dir */
730 rc = dt_insert(env, child, (const struct dt_rec *)rec,
731 (const struct dt_key *)dot, th, 1);
735 /* 4b. insert dotdot into child dir */
736 rec->rec_fid = &LU_LPF_FID;
737 rc = dt_insert(env, child, (const struct dt_rec *)rec,
738 (const struct dt_key *)dotdot, th, 1);
742 /* 5b. insert linkEA for child. */
743 rc = dt_xattr_set(env, child, &linkea_buf,
744 XATTR_NAME_LINK, 0, th);
745 dt_write_unlock(env, child);
749 /* 6b. insert name into parent dir */
751 rc = dt_insert(env, parent, (const struct dt_rec *)rec,
752 (const struct dt_key *)name, th, 1);
756 dt_write_lock(env, parent, 0);
757 /* 7b. increase parent nlink */
758 rc = dt_ref_add(env, parent, th);
759 dt_write_unlock(env, parent);
763 bk->lb_lpf_fid = *cfid;
764 lfsck_bookmark_cpu_to_le(&lfsck->li_bookmark_disk, bk);
766 /* 8b. update bookmark */
767 rc = dt_record_write(env, bk_obj,
768 lfsck_buf_get(env, bk, len), &pos, th);
773 dt_write_unlock(env, child);
776 dt_trans_stop(env, dev, th);
781 static int lfsck_create_lpf_remote(const struct lu_env *env,
782 struct lfsck_instance *lfsck,
783 struct dt_object *child,
785 struct dt_object_format *dof,
788 struct dt_insert_rec *rec = &lfsck_env_info(env)->lti_dt_rec;
789 struct dt_object *parent = lfsck->li_lpf_root_obj;
790 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
791 struct dt_object *bk_obj = lfsck->li_bookmark_obj;
792 const struct lu_fid *cfid = lfsck_dto2fid(child);
793 struct thandle *th = NULL;
794 struct linkea_data ldata = { NULL };
795 struct lu_buf linkea_buf;
796 const struct lu_name *cname;
797 struct dt_device *dev;
799 int len = sizeof(struct lfsck_bookmark);
803 cname = lfsck_name_get_const(env, name, strlen(name));
804 rc = linkea_links_new(&ldata, &lfsck_env_info(env)->lti_linkea_buf2,
805 cname, lfsck_dto2fid(parent));
809 /* Create .lustre/lost+found/MDTxxxx. */
811 /* XXX: Currently, cross-MDT create operation needs to create the child
812 * object firstly, then insert name into the parent directory. For
813 * this case, the child object resides on current MDT (local), but
814 * the parent ".lustre/lost+found" may be on remote MDT. It is not
815 * easy to contain all the sub-modifications orderly within single
818 * To avoid more inconsistency, we split the create operation into
821 * 1) create the child and update the lfsck_bookmark::lb_lpf_fid
823 * 2) insert the name "MDTXXXX" in the parent ".lustre/lost+found"
826 * If 1) done, but 2) failed, then go ahead, the LFSCK will try to
827 * repair such inconsistency when LFSCK run next time. */
829 /* Transaction I: locally */
831 dev = lfsck_obj2dev(child);
832 th = dt_trans_create(env, dev);
836 /* 1a. create child */
837 rc = dt_declare_create(env, child, la, NULL, dof, th);
841 if (!dt_try_as_dir(env, child))
842 GOTO(stop, rc = -ENOTDIR);
844 /* 2a. increase child nlink */
845 rc = dt_declare_ref_add(env, child, th);
849 /* 3a. insert dot into child dir */
850 rec->rec_type = S_IFDIR;
852 rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
853 (const struct dt_key *)dot, th);
857 /* 4a. insert dotdot into child dir */
858 rec->rec_fid = &LU_LPF_FID;
859 rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
860 (const struct dt_key *)dotdot, th);
864 /* 5a. insert linkEA for child */
865 lfsck_buf_init(&linkea_buf, ldata.ld_buf->lb_buf,
866 ldata.ld_leh->leh_len);
867 rc = dt_declare_xattr_set(env, child, &linkea_buf,
868 XATTR_NAME_LINK, 0, th);
872 /* 6a. update bookmark */
873 rc = dt_declare_record_write(env, bk_obj,
874 lfsck_buf_get(env, bk, len), 0, th);
878 rc = dt_trans_start_local(env, dev, th);
882 dt_write_lock(env, child, 0);
883 /* 1b. create child */
884 rc = dt_create(env, child, la, NULL, dof, th);
888 /* 2b. increase child nlink */
889 rc = dt_ref_add(env, child, th);
893 /* 3b. insert dot into child dir */
894 rec->rec_type = S_IFDIR;
896 rc = dt_insert(env, child, (const struct dt_rec *)rec,
897 (const struct dt_key *)dot, th, 1);
901 /* 4b. insert dotdot into child dir */
902 rec->rec_fid = &LU_LPF_FID;
903 rc = dt_insert(env, child, (const struct dt_rec *)rec,
904 (const struct dt_key *)dotdot, th, 1);
908 /* 5b. insert linkEA for child */
909 rc = dt_xattr_set(env, child, &linkea_buf,
910 XATTR_NAME_LINK, 0, th);
914 bk->lb_lpf_fid = *cfid;
915 lfsck_bookmark_cpu_to_le(&lfsck->li_bookmark_disk, bk);
917 /* 6b. update bookmark */
918 rc = dt_record_write(env, bk_obj,
919 lfsck_buf_get(env, bk, len), &pos, th);
921 dt_write_unlock(env, child);
922 dt_trans_stop(env, dev, th);
926 /* Transaction II: remotely */
928 dev = lfsck_obj2dev(parent);
929 th = dt_trans_create(env, dev);
934 /* 5a. insert name into parent dir */
936 rc = dt_declare_insert(env, parent, (const struct dt_rec *)rec,
937 (const struct dt_key *)name, th);
941 /* 6a. increase parent nlink */
942 rc = dt_declare_ref_add(env, parent, th);
946 rc = dt_trans_start_local(env, dev, th);
950 /* 5b. insert name into parent dir */
951 rc = dt_insert(env, parent, (const struct dt_rec *)rec,
952 (const struct dt_key *)name, th, 1);
956 dt_write_lock(env, parent, 0);
957 /* 6b. increase parent nlink */
958 rc = dt_ref_add(env, parent, th);
959 dt_write_unlock(env, parent);
964 dt_write_unlock(env, child);
966 dt_trans_stop(env, dev, th);
968 if (rc != 0 && dev == lfsck_obj2dev(parent))
969 CDEBUG(D_LFSCK, "%s: partially created the object "DFID
970 "for orphans, but failed to insert the name %s "
971 "to the .lustre/lost+found/. Such inconsistency "
972 "will be repaired when LFSCK run next time: rc = %d\n",
973 lfsck_lfsck2name(lfsck), PFID(cfid), name, rc);
979 * Create the MDTxxxx directory under /ROOT/.lustre/lost+found/
981 * The /ROOT/.lustre/lost+found/MDTxxxx/ directory is used for holding
982 * orphans and other uncertain inconsistent objects found during the
983 * LFSCK. Such directory will be created by the LFSCK engine on the
984 * local MDT before the LFSCK scanning.
986 * \param[in] env pointer to the thread context
987 * \param[in] lfsck pointer to the lfsck instance
989 * \retval 0 for success
990 * \retval negative error number on failure
992 static int lfsck_create_lpf(const struct lu_env *env,
993 struct lfsck_instance *lfsck)
995 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
996 struct lfsck_thread_info *info = lfsck_env_info(env);
997 struct lu_fid *cfid = &info->lti_fid2;
998 struct lu_attr *la = &info->lti_la;
999 struct dt_object_format *dof = &info->lti_dof;
1000 struct dt_object *parent = lfsck->li_lpf_root_obj;
1001 struct dt_object *child = NULL;
1002 struct lfsck_lock_handle *llh = &info->lti_llh;
1004 int node = lfsck_dev_idx(lfsck);
1008 LASSERT(lfsck->li_master);
1009 LASSERT(parent != NULL);
1010 LASSERT(lfsck->li_lpf_obj == NULL);
1012 snprintf(name, 8, "MDT%04x", node);
1013 rc = lfsck_lock(env, lfsck, parent, name, llh,
1014 MDS_INODELOCK_UPDATE, LCK_PW);
1018 if (fid_is_zero(&bk->lb_lpf_fid)) {
1019 /* There is corner case that: in former LFSCK scanning we have
1020 * created the .lustre/lost+found/MDTxxxx but failed to update
1021 * the lfsck_bookmark::lb_lpf_fid successfully. So need lookup
1022 * it from MDT0 firstly. */
1023 rc = dt_lookup(env, parent, (struct dt_rec *)cfid,
1024 (const struct dt_key *)name);
1025 if (rc != 0 && rc != -ENOENT)
1029 bk->lb_lpf_fid = *cfid;
1030 rc = lfsck_bookmark_store(env, lfsck);
1032 rc = lfsck_fid_alloc(env, lfsck, cfid, true);
1037 *cfid = bk->lb_lpf_fid;
1040 child = lfsck_object_find_bottom_new(env, lfsck, cfid);
1042 GOTO(unlock, rc = PTR_ERR(child));
1044 if (dt_object_exists(child) != 0) {
1045 if (unlikely(!dt_try_as_dir(env, child)))
1048 lfsck->li_lpf_obj = child;
1053 memset(la, 0, sizeof(*la));
1054 la->la_atime = la->la_mtime = la->la_ctime = cfs_time_current_sec();
1055 la->la_mode = S_IFDIR | S_IRWXU;
1056 la->la_valid = LA_ATIME | LA_MTIME | LA_CTIME | LA_MODE |
1058 memset(dof, 0, sizeof(*dof));
1059 dof->dof_type = dt_mode_to_dft(S_IFDIR);
1062 rc = lfsck_create_lpf_local(env, lfsck, child, la, dof, name);
1064 rc = lfsck_create_lpf_remote(env, lfsck, child, la, dof, name);
1066 lfsck->li_lpf_obj = child;
1072 if (rc != 0 && child != NULL && !IS_ERR(child))
1073 lfsck_object_put(env, child);
1079 * Scan .lustre/lost+found for bad name entries and remove them.
1081 * The valid name entry should be "MDTxxxx", the "xxxx" is the MDT device
1082 * index in the system. Any other formatted name is invalid and should be
1085 * \param[in] env pointer to the thread context
1086 * \param[in] lfsck pointer to the lfsck instance
1088 * \retval 0 for success
1089 * \retval negative error number on failure
1091 static int lfsck_scan_lpf_bad_entries(const struct lu_env *env,
1092 struct lfsck_instance *lfsck)
1094 struct dt_object *parent = lfsck->li_lpf_root_obj;
1095 struct lu_dirent *ent =
1096 (struct lu_dirent *)lfsck_env_info(env)->lti_key;
1097 const struct dt_it_ops *iops = &parent->do_index_ops->dio_it;
1102 it = iops->init(env, parent, LUDA_64BITHASH);
1104 RETURN(PTR_ERR(it));
1106 rc = iops->load(env, it, 0);
1108 rc = iops->next(env, it);
1115 rc = iops->rec(env, it, (struct dt_rec *)ent, LUDA_64BITHASH);
1119 ent->lde_namelen = le16_to_cpu(ent->lde_namelen);
1120 if (name_is_dot_or_dotdot(ent->lde_name, ent->lde_namelen))
1123 /* name length must be strlen("MDTxxxx") */
1124 if (ent->lde_namelen != 7)
1127 if (memcmp(ent->lde_name, "MDT", off) != 0)
1130 while (off < 7 && isxdigit(ent->lde_name[off]))
1136 rc = lfsck_lpf_remove_name_entry(env, lfsck,
1143 rc = iops->next(env, it);
1147 iops->fini(env, it);
1149 RETURN(rc > 0 ? 0 : rc);
1152 static int lfsck_update_lpf_entry(const struct lu_env *env,
1153 struct lfsck_instance *lfsck,
1154 struct dt_object *parent,
1155 struct dt_object *child,
1157 enum lfsck_verify_lpf_types type)
1161 if (type == LVLT_BY_BOOKMARK) {
1162 rc = lfsck_update_name_entry(env, lfsck, parent, name,
1163 lfsck_dto2fid(child), S_IFDIR);
1164 } else /* if (type == LVLT_BY_NAMEENTRY) */ {
1165 lfsck->li_bookmark_ram.lb_lpf_fid = *lfsck_dto2fid(child);
1166 rc = lfsck_bookmark_store(env, lfsck);
1168 CDEBUG(D_LFSCK, "%s: update LPF fid "DFID
1169 " in the bookmark file: rc = %d\n",
1170 lfsck_lfsck2name(lfsck),
1171 PFID(lfsck_dto2fid(child)), rc);
1178 * Check whether the @child back references the @parent.
1181 * 1) The child's FID is stored in the bookmark file. If the child back
1182 * references the parent (LU_LPF_FID object) via its ".." entry, then
1183 * insert the name (MDTxxxx) to the .lustre/lost+found; otherwise, if
1184 * the child back references another parent2, then:
1185 * 1.1) If the parent2 recognizes the child, then update the bookmark file;
1186 * 1.2) Otherwise, the LFSCK cannot know whether there will be parent3 that
1187 * references the child. So keep them there. As the LFSCK processing,
1188 * the parent3 may be found, then when the LFSCK run next time, the
1189 * inconsistency can be repaired.
1191 * 2) The child's FID is stored in the .lustre/lost+found/ sub-directory name
1192 * entry (MDTxxxx). If the child back references the parent (LU_LPF_FID obj)
1193 * via its ".." entry, then update the bookmark file, otherwise, if the child
1194 * back references another parent2, then:
1195 * 2.1) If the parent2 recognizes the child, then remove the sub-directory
1196 * from .lustre/lost+found/;
1197 * 2.2) Otherwise, if the parent2 does not recognizes the child, trust the
1198 * sub-directory name entry and update the child;
1199 * 2.3) Otherwise, if we do not know whether the parent2 recognizes the child
1200 * or not, then keep them there.
1202 * \param[in] env pointer to the thread context
1203 * \param[in] lfsck pointer to the lfsck instance
1204 * \param[in] child pointer to the lost+found sub-directory object
1205 * \param[in] name the name for lost+found sub-directory object
1206 * \param[out] fid pointer to the buffer to hold the FID of the object
1207 * (called it as parent2) that is referenced via the
1208 * child's dotdot entry; it also can be the FID that
1209 * is referenced by the name entry under the parent2.
1210 * \param[in] type to indicate where the child's FID is stored in
1212 * \retval positive number for uncertain inconsistency
1213 * \retval 0 for success
1214 * \retval negative error number on failure
1216 static int lfsck_verify_lpf_pairs(const struct lu_env *env,
1217 struct lfsck_instance *lfsck,
1218 struct dt_object *child, const char *name,
1220 enum lfsck_verify_lpf_types type)
1222 struct dt_object *parent = lfsck->li_lpf_root_obj;
1223 struct lfsck_thread_info *info = lfsck_env_info(env);
1224 char *name2 = info->lti_key;
1225 struct lu_fid *fid2 = &info->lti_fid3;
1226 struct dt_object *parent2 = NULL;
1227 struct lustre_handle lh = { 0 };
1232 rc = dt_lookup(env, child, (struct dt_rec *)fid,
1233 (const struct dt_key *)dotdot);
1237 if (!fid_is_sane(fid))
1238 GOTO(linkea, rc = -EINVAL);
1240 if (lu_fid_eq(fid, &LU_LPF_FID)) {
1241 const struct lu_name *cname;
1243 if (lfsck->li_lpf_obj == NULL) {
1244 lu_object_get(&child->do_lu);
1245 lfsck->li_lpf_obj = child;
1248 cname = lfsck_name_get_const(env, name, strlen(name));
1249 rc = lfsck_verify_linkea(env, child, cname, &LU_LPF_FID);
1251 rc = lfsck_update_lpf_entry(env, lfsck, parent, child,
1257 parent2 = lfsck_object_find_bottom(env, lfsck, fid);
1258 if (IS_ERR(parent2))
1259 GOTO(linkea, parent2);
1261 if (!dt_object_exists(parent2)) {
1262 lfsck_object_put(env, parent2);
1264 GOTO(linkea, parent2 = ERR_PTR(-ENOENT));
1267 if (!dt_try_as_dir(env, parent2)) {
1268 lfsck_object_put(env, parent2);
1270 GOTO(linkea, parent2 = ERR_PTR(-ENOTDIR));
1274 /* To prevent rename/unlink race */
1275 rc = lfsck_ibits_lock(env, lfsck, child, &lh,
1276 MDS_INODELOCK_UPDATE, LCK_PR);
1280 dt_read_lock(env, child, 0);
1281 rc = lfsck_links_get_first(env, child, name2, fid2);
1283 dt_read_unlock(env, child);
1284 lfsck_ibits_unlock(&lh, LCK_PR);
1286 GOTO(out_put, rc = 1);
1289 /* It is almost impossible that the bookmark file (or the name entry)
1290 * and the linkEA hit the same data corruption. Trust the linkEA. */
1291 if (lu_fid_eq(fid2, &LU_LPF_FID) && strcmp(name, name2) == 0) {
1292 dt_read_unlock(env, child);
1293 lfsck_ibits_unlock(&lh, LCK_PR);
1296 if (lfsck->li_lpf_obj == NULL) {
1297 lu_object_get(&child->do_lu);
1298 lfsck->li_lpf_obj = child;
1301 /* Update the child's dotdot entry */
1302 rc = lfsck_update_name_entry(env, lfsck, child, dotdot,
1303 &LU_LPF_FID, S_IFDIR);
1305 rc = lfsck_update_lpf_entry(env, lfsck, parent, child,
1311 if (parent2 == NULL || IS_ERR(parent2)) {
1312 dt_read_unlock(env, child);
1313 lfsck_ibits_unlock(&lh, LCK_PR);
1315 GOTO(out_done, rc = 1);
1318 rc = dt_lookup(env, parent2, (struct dt_rec *)fid,
1319 (const struct dt_key *)name2);
1320 dt_read_unlock(env, child);
1321 lfsck_ibits_unlock(&lh, LCK_PR);
1322 if (rc != 0 && rc != -ENOENT)
1325 if (rc == -ENOENT || !lu_fid_eq(fid, lfsck_dto2fid(child))) {
1326 if (type == LVLT_BY_BOOKMARK)
1327 GOTO(out_put, rc = 1);
1329 /* Trust the name entry, update the child's dotdot entry. */
1330 rc = lfsck_update_name_entry(env, lfsck, child, dotdot,
1331 &LU_LPF_FID, S_IFDIR);
1336 if (type == LVLT_BY_BOOKMARK) {
1337 /* Invalid FID record in the bookmark file, reset it. */
1338 fid_zero(&lfsck->li_bookmark_ram.lb_lpf_fid);
1339 rc = lfsck_bookmark_store(env, lfsck);
1341 CDEBUG(D_LFSCK, "%s: reset invalid LPF fid "DFID
1342 " in the bookmark file: rc = %d\n",
1343 lfsck_lfsck2name(lfsck), PFID(lfsck_dto2fid(child)), rc);
1344 } else /* if (type == LVLT_BY_NAMEENTRY) */ {
1345 /* The name entry is wrong, remove it. */
1346 rc = lfsck_lpf_remove_name_entry(env, lfsck, name);
1352 if (parent2 != NULL && !IS_ERR(parent2))
1353 lfsck_object_put(env, parent2);
1360 * Verify the /ROOT/.lustre/lost+found/ directory.
1362 * /ROOT/.lustre/lost+found/ is a special directory to hold the objects that
1363 * the LFSCK does not exactly know how to handle, such as orphans. So before
1364 * the LFSCK scanning the system, the consistency of such directory needs to
1365 * be verified firstly to allow the users to use it during the LFSCK.
1367 * \param[in] env pointer to the thread context
1368 * \param[in] lfsck pointer to the lfsck instance
1370 * \retval positive number for uncertain inconsistency
1371 * \retval 0 for success
1372 * \retval negative error number on failure
1374 int lfsck_verify_lpf(const struct lu_env *env, struct lfsck_instance *lfsck)
1376 struct lfsck_thread_info *info = lfsck_env_info(env);
1377 struct lu_fid *pfid = &info->lti_fid;
1378 struct lu_fid *cfid = &info->lti_fid2;
1379 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
1380 struct dt_object *parent;
1381 /* child1's FID is in the bookmark file. */
1382 struct dt_object *child1 = NULL;
1383 /* child2's FID is in the name entry MDTxxxx. */
1384 struct dt_object *child2 = NULL;
1385 const struct lu_name *cname;
1387 int node = lfsck_dev_idx(lfsck);
1391 LASSERT(lfsck->li_master);
1393 if (lfsck->li_lpf_root_obj != NULL)
1397 parent = lfsck_object_find_by_dev(env, lfsck->li_bottom,
1400 struct lfsck_tgt_desc *ltd;
1402 ltd = lfsck_tgt_get(&lfsck->li_mdt_descs, 0);
1403 if (unlikely(ltd == NULL))
1406 parent = lfsck_object_find_by_dev(env, ltd->ltd_tgt,
1412 RETURN(PTR_ERR(parent));
1414 LASSERT(dt_object_exists(parent));
1416 if (unlikely(!dt_try_as_dir(env, parent))) {
1417 lfsck_object_put(env, parent);
1419 GOTO(put, rc = -ENOTDIR);
1422 lfsck->li_lpf_root_obj = parent;
1424 rc = lfsck_scan_lpf_bad_entries(env, lfsck);
1426 CDEBUG(D_LFSCK, "%s: scan .lustre/lost+found/ "
1427 "for bad sub-directories: rc = %d\n",
1428 lfsck_lfsck2name(lfsck), rc);
1432 snprintf(name, 8, "MDT%04x", node);
1433 rc = dt_lookup(env, parent, (struct dt_rec *)cfid,
1434 (const struct dt_key *)name);
1435 if (rc == -ENOENT) {
1443 /* Invalid FID in the name entry, remove the name entry. */
1444 if (!fid_is_norm(cfid)) {
1445 rc = lfsck_lpf_remove_name_entry(env, lfsck, name);
1452 child2 = lfsck_object_find_bottom(env, lfsck, cfid);
1454 GOTO(put, rc = PTR_ERR(child2));
1456 if (unlikely(!dt_object_exists(child2) ||
1457 dt_object_remote(child2)) ||
1458 !S_ISDIR(lfsck_object_type(child2))) {
1459 rc = lfsck_lpf_remove_name_entry(env, lfsck, name);
1466 if (unlikely(!dt_try_as_dir(env, child2))) {
1467 lfsck_object_put(env, child2);
1473 if (fid_is_zero(&bk->lb_lpf_fid))
1476 if (likely(lu_fid_eq(cfid, &bk->lb_lpf_fid))) {
1477 if (lfsck->li_lpf_obj == NULL) {
1478 lu_object_get(&child2->do_lu);
1479 lfsck->li_lpf_obj = child2;
1482 cname = lfsck_name_get_const(env, name, strlen(name));
1483 rc = lfsck_verify_linkea(env, child2, cname, &LU_LPF_FID);
1488 if (unlikely(!fid_is_norm(&bk->lb_lpf_fid))) {
1489 struct lu_fid tfid = bk->lb_lpf_fid;
1491 /* Invalid FID record in the bookmark file, reset it. */
1492 fid_zero(&bk->lb_lpf_fid);
1493 rc = lfsck_bookmark_store(env, lfsck);
1495 CDEBUG(D_LFSCK, "%s: reset invalid LPF fid "DFID
1496 " in the bookmark file: rc = %d\n",
1497 lfsck_lfsck2name(lfsck), PFID(&tfid), rc);
1505 child1 = lfsck_object_find_bottom(env, lfsck, &bk->lb_lpf_fid);
1506 if (IS_ERR(child1)) {
1511 if (unlikely(!dt_object_exists(child1) ||
1512 dt_object_remote(child1)) ||
1513 !S_ISDIR(lfsck_object_type(child1))) {
1514 /* Invalid FID record in the bookmark file, reset it. */
1515 fid_zero(&bk->lb_lpf_fid);
1516 rc = lfsck_bookmark_store(env, lfsck);
1518 CDEBUG(D_LFSCK, "%s: reset invalid LPF fid "DFID
1519 " in the bookmark file: rc = %d\n",
1520 lfsck_lfsck2name(lfsck),
1521 PFID(lfsck_dto2fid(child1)), rc);
1526 lfsck_object_put(env, child1);
1531 if (unlikely(!dt_try_as_dir(env, child1))) {
1532 lfsck_object_put(env, child1);
1538 rc = lfsck_verify_lpf_pairs(env, lfsck, child1, name, pfid,
1540 if (lu_fid_eq(pfid, &LU_LPF_FID))
1545 rc = lfsck_verify_lpf_pairs(env, lfsck, child2, name,
1546 pfid, LVLT_BY_NAMEENTRY);
1551 if (lfsck->li_lpf_obj != NULL) {
1552 if (unlikely(!dt_try_as_dir(env, lfsck->li_lpf_obj))) {
1553 lfsck_object_put(env, lfsck->li_lpf_obj);
1554 lfsck->li_lpf_obj = NULL;
1557 } else if (rc == 0) {
1558 rc = lfsck_create_lpf(env, lfsck);
1561 if (child2 != NULL && !IS_ERR(child2))
1562 lfsck_object_put(env, child2);
1563 if (child1 != NULL && !IS_ERR(child1))
1564 lfsck_object_put(env, child1);
1569 static int lfsck_fid_init(struct lfsck_instance *lfsck)
1571 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
1572 struct seq_server_site *ss = lfsck_dev_site(lfsck);
1577 if (unlikely(ss == NULL))
1580 OBD_ALLOC_PTR(lfsck->li_seq);
1581 if (lfsck->li_seq == NULL)
1584 OBD_ALLOC(prefix, MAX_OBD_NAME + 7);
1586 GOTO(out, rc = -ENOMEM);
1588 snprintf(prefix, MAX_OBD_NAME + 7, "lfsck-%s", lfsck_lfsck2name(lfsck));
1589 rc = seq_client_init(lfsck->li_seq, NULL, LUSTRE_SEQ_METADATA, prefix,
1591 OBD_FREE(prefix, MAX_OBD_NAME + 7);
1595 if (fid_is_sane(&bk->lb_last_fid))
1596 lfsck->li_seq->lcs_fid = bk->lb_last_fid;
1601 OBD_FREE_PTR(lfsck->li_seq);
1602 lfsck->li_seq = NULL;
1607 static void lfsck_fid_fini(struct lfsck_instance *lfsck)
1609 if (lfsck->li_seq != NULL) {
1610 seq_client_fini(lfsck->li_seq);
1611 OBD_FREE_PTR(lfsck->li_seq);
1612 lfsck->li_seq = NULL;
1616 void lfsck_instance_cleanup(const struct lu_env *env,
1617 struct lfsck_instance *lfsck)
1619 struct ptlrpc_thread *thread = &lfsck->li_thread;
1620 struct lfsck_component *com;
1621 struct lfsck_component *next;
1622 struct lfsck_lmv_unit *llu;
1623 struct lfsck_lmv_unit *llu_next;
1624 struct lfsck_lmv *llmv;
1627 LASSERT(list_empty(&lfsck->li_link));
1628 LASSERT(thread_is_init(thread) || thread_is_stopped(thread));
1630 if (lfsck->li_obj_oit != NULL) {
1631 lfsck_object_put(env, lfsck->li_obj_oit);
1632 lfsck->li_obj_oit = NULL;
1635 LASSERT(lfsck->li_obj_dir == NULL);
1636 LASSERT(lfsck->li_lmv == NULL);
1638 list_for_each_entry_safe(llu, llu_next, &lfsck->li_list_lmv, llu_link) {
1639 llmv = &llu->llu_lmv;
1641 LASSERTF(atomic_read(&llmv->ll_ref) == 1,
1642 "still in using: %u\n",
1643 atomic_read(&llmv->ll_ref));
1645 lfsck_lmv_put(env, llmv);
1648 list_for_each_entry_safe(com, next, &lfsck->li_list_scan, lc_link) {
1649 lfsck_component_cleanup(env, com);
1652 LASSERT(list_empty(&lfsck->li_list_dir));
1654 list_for_each_entry_safe(com, next, &lfsck->li_list_double_scan,
1656 lfsck_component_cleanup(env, com);
1659 list_for_each_entry_safe(com, next, &lfsck->li_list_idle, lc_link) {
1660 lfsck_component_cleanup(env, com);
1663 lfsck_tgt_descs_fini(&lfsck->li_ost_descs);
1664 lfsck_tgt_descs_fini(&lfsck->li_mdt_descs);
1666 if (lfsck->li_lfsck_dir != NULL) {
1667 lfsck_object_put(env, lfsck->li_lfsck_dir);
1668 lfsck->li_lfsck_dir = NULL;
1671 if (lfsck->li_bookmark_obj != NULL) {
1672 lfsck_object_put(env, lfsck->li_bookmark_obj);
1673 lfsck->li_bookmark_obj = NULL;
1676 if (lfsck->li_lpf_obj != NULL) {
1677 lfsck_object_put(env, lfsck->li_lpf_obj);
1678 lfsck->li_lpf_obj = NULL;
1681 if (lfsck->li_lpf_root_obj != NULL) {
1682 lfsck_object_put(env, lfsck->li_lpf_root_obj);
1683 lfsck->li_lpf_root_obj = NULL;
1686 if (lfsck->li_los != NULL) {
1687 local_oid_storage_fini(env, lfsck->li_los);
1688 lfsck->li_los = NULL;
1691 lfsck_fid_fini(lfsck);
1693 OBD_FREE_PTR(lfsck);
1696 static inline struct lfsck_instance *
1697 __lfsck_instance_find(struct dt_device *key, bool ref, bool unlink)
1699 struct lfsck_instance *lfsck;
1701 list_for_each_entry(lfsck, &lfsck_instance_list, li_link) {
1702 if (lfsck->li_bottom == key) {
1704 lfsck_instance_get(lfsck);
1706 list_del_init(&lfsck->li_link);
1715 struct lfsck_instance *lfsck_instance_find(struct dt_device *key, bool ref,
1718 struct lfsck_instance *lfsck;
1720 spin_lock(&lfsck_instance_lock);
1721 lfsck = __lfsck_instance_find(key, ref, unlink);
1722 spin_unlock(&lfsck_instance_lock);
1727 static inline int lfsck_instance_add(struct lfsck_instance *lfsck)
1729 struct lfsck_instance *tmp;
1731 spin_lock(&lfsck_instance_lock);
1732 list_for_each_entry(tmp, &lfsck_instance_list, li_link) {
1733 if (lfsck->li_bottom == tmp->li_bottom) {
1734 spin_unlock(&lfsck_instance_lock);
1739 list_add_tail(&lfsck->li_link, &lfsck_instance_list);
1740 spin_unlock(&lfsck_instance_lock);
1744 void lfsck_bits_dump(struct seq_file *m, int bits, const char *names[],
1749 bool newline = (bits != 0 ? false : true);
1751 seq_printf(m, "%s:%c", prefix, bits != 0 ? ' ' : '\n');
1753 for (i = 0, flag = 1; bits != 0; i++, flag = 1 << i) {
1756 if (names[i] != NULL) {
1760 seq_printf(m, "%s%c", names[i],
1761 newline ? '\n' : ',');
1770 void lfsck_time_dump(struct seq_file *m, __u64 time, const char *name)
1773 seq_printf(m, "%s_time: N/A\n", name);
1774 seq_printf(m, "time_since_%s: N/A\n", name);
1776 seq_printf(m, "%s_time: %llu\n", name, time);
1777 seq_printf(m, "time_since_%s: %llu seconds\n",
1778 name, cfs_time_current_sec() - time);
1782 void lfsck_pos_dump(struct seq_file *m, struct lfsck_position *pos,
1785 if (fid_is_zero(&pos->lp_dir_parent)) {
1786 if (pos->lp_oit_cookie == 0) {
1787 seq_printf(m, "%s: N/A, N/A, N/A\n", prefix);
1790 seq_printf(m, "%s: %llu, N/A, N/A\n",
1791 prefix, pos->lp_oit_cookie);
1793 seq_printf(m, "%s: %llu, "DFID", %#llx\n",
1794 prefix, pos->lp_oit_cookie,
1795 PFID(&pos->lp_dir_parent), pos->lp_dir_cookie);
1799 void lfsck_pos_fill(const struct lu_env *env, struct lfsck_instance *lfsck,
1800 struct lfsck_position *pos, bool init)
1802 const struct dt_it_ops *iops = &lfsck->li_obj_oit->do_index_ops->dio_it;
1804 if (unlikely(lfsck->li_di_oit == NULL)) {
1805 memset(pos, 0, sizeof(*pos));
1809 pos->lp_oit_cookie = iops->store(env, lfsck->li_di_oit);
1810 if (!lfsck->li_current_oit_processed && !init)
1811 pos->lp_oit_cookie--;
1813 LASSERT(pos->lp_oit_cookie > 0);
1815 if (lfsck->li_di_dir != NULL) {
1816 struct dt_object *dto = lfsck->li_obj_dir;
1818 pos->lp_dir_cookie = dto->do_index_ops->dio_it.store(env,
1821 if (pos->lp_dir_cookie >= MDS_DIR_END_OFF) {
1822 fid_zero(&pos->lp_dir_parent);
1823 pos->lp_dir_cookie = 0;
1825 pos->lp_dir_parent = *lfsck_dto2fid(dto);
1828 fid_zero(&pos->lp_dir_parent);
1829 pos->lp_dir_cookie = 0;
1833 bool __lfsck_set_speed(struct lfsck_instance *lfsck, __u32 limit)
1837 if (limit != LFSCK_SPEED_NO_LIMIT) {
1838 if (limit > msecs_to_jiffies(MSEC_PER_SEC)) {
1839 lfsck->li_sleep_rate = limit /
1840 msecs_to_jiffies(MSEC_PER_SEC);
1841 lfsck->li_sleep_jif = 1;
1843 lfsck->li_sleep_rate = 1;
1844 lfsck->li_sleep_jif = msecs_to_jiffies(MSEC_PER_SEC) /
1848 lfsck->li_sleep_jif = 0;
1849 lfsck->li_sleep_rate = 0;
1852 if (lfsck->li_bookmark_ram.lb_speed_limit != limit) {
1853 lfsck->li_bookmark_ram.lb_speed_limit = limit;
1860 void lfsck_control_speed(struct lfsck_instance *lfsck)
1862 struct ptlrpc_thread *thread = &lfsck->li_thread;
1863 struct l_wait_info lwi;
1865 if (lfsck->li_sleep_jif > 0 &&
1866 lfsck->li_new_scanned >= lfsck->li_sleep_rate) {
1867 lwi = LWI_TIMEOUT_INTR(lfsck->li_sleep_jif, NULL,
1868 LWI_ON_SIGNAL_NOOP, NULL);
1870 l_wait_event(thread->t_ctl_waitq,
1871 !thread_is_running(thread),
1873 lfsck->li_new_scanned = 0;
1877 void lfsck_control_speed_by_self(struct lfsck_component *com)
1879 struct lfsck_instance *lfsck = com->lc_lfsck;
1880 struct ptlrpc_thread *thread = &lfsck->li_thread;
1881 struct l_wait_info lwi;
1883 if (lfsck->li_sleep_jif > 0 &&
1884 com->lc_new_scanned >= lfsck->li_sleep_rate) {
1885 lwi = LWI_TIMEOUT_INTR(lfsck->li_sleep_jif, NULL,
1886 LWI_ON_SIGNAL_NOOP, NULL);
1888 l_wait_event(thread->t_ctl_waitq,
1889 !thread_is_running(thread),
1891 com->lc_new_scanned = 0;
1895 static struct lfsck_thread_args *
1896 lfsck_thread_args_init(struct lfsck_instance *lfsck,
1897 struct lfsck_component *com,
1898 struct lfsck_start_param *lsp)
1900 struct lfsck_thread_args *lta;
1905 return ERR_PTR(-ENOMEM);
1907 rc = lu_env_init(<a->lta_env, LCT_MD_THREAD | LCT_DT_THREAD);
1913 lta->lta_lfsck = lfsck_instance_get(lfsck);
1915 lta->lta_com = lfsck_component_get(com);
1922 void lfsck_thread_args_fini(struct lfsck_thread_args *lta)
1924 if (lta->lta_com != NULL)
1925 lfsck_component_put(<a->lta_env, lta->lta_com);
1926 lfsck_instance_put(<a->lta_env, lta->lta_lfsck);
1927 lu_env_fini(<a->lta_env);
1931 struct lfsck_assistant_data *
1932 lfsck_assistant_data_init(struct lfsck_assistant_operations *lao,
1935 struct lfsck_assistant_data *lad;
1939 lad->lad_bitmap = CFS_ALLOCATE_BITMAP(BITS_PER_LONG);
1940 if (lad->lad_bitmap == NULL) {
1945 INIT_LIST_HEAD(&lad->lad_req_list);
1946 spin_lock_init(&lad->lad_lock);
1947 INIT_LIST_HEAD(&lad->lad_ost_list);
1948 INIT_LIST_HEAD(&lad->lad_ost_phase1_list);
1949 INIT_LIST_HEAD(&lad->lad_ost_phase2_list);
1950 INIT_LIST_HEAD(&lad->lad_mdt_list);
1951 INIT_LIST_HEAD(&lad->lad_mdt_phase1_list);
1952 INIT_LIST_HEAD(&lad->lad_mdt_phase2_list);
1953 init_waitqueue_head(&lad->lad_thread.t_ctl_waitq);
1955 lad->lad_name = name;
1961 struct lfsck_assistant_object *
1962 lfsck_assistant_object_init(const struct lu_env *env, const struct lu_fid *fid,
1963 const struct lu_attr *attr, __u64 cookie,
1966 struct lfsck_assistant_object *lso;
1970 return ERR_PTR(-ENOMEM);
1972 lso->lso_fid = *fid;
1974 lso->lso_attr = *attr;
1976 atomic_set(&lso->lso_ref, 1);
1977 lso->lso_oit_cookie = cookie;
1979 lso->lso_is_dir = 1;
1985 lfsck_assistant_object_load(const struct lu_env *env,
1986 struct lfsck_instance *lfsck,
1987 struct lfsck_assistant_object *lso)
1989 struct dt_object *obj;
1991 obj = lfsck_object_find_bottom(env, lfsck, &lso->lso_fid);
1995 if (unlikely(!dt_object_exists(obj) || lfsck_is_dead_obj(obj))) {
1997 lfsck_object_put(env, obj);
1999 return ERR_PTR(-ENOENT);
2002 if (lso->lso_is_dir && unlikely(!dt_try_as_dir(env, obj))) {
2003 lfsck_object_put(env, obj);
2005 return ERR_PTR(-ENOTDIR);
2012 * Generic LFSCK asynchronous communication interpretor function.
2013 * The LFSCK RPC reply for both the event notification and status
2014 * querying will be handled here.
2016 * \param[in] env pointer to the thread context
2017 * \param[in] req pointer to the LFSCK request
2018 * \param[in] args pointer to the lfsck_async_interpret_args
2019 * \param[in] rc the result for handling the LFSCK request
2021 * \retval 0 for success
2022 * \retval negative error number on failure
2024 int lfsck_async_interpret_common(const struct lu_env *env,
2025 struct ptlrpc_request *req,
2028 struct lfsck_async_interpret_args *laia = args;
2029 struct lfsck_component *com = laia->laia_com;
2030 struct lfsck_assistant_data *lad = com->lc_data;
2031 struct lfsck_tgt_descs *ltds = laia->laia_ltds;
2032 struct lfsck_tgt_desc *ltd = laia->laia_ltd;
2033 struct lfsck_request *lr = laia->laia_lr;
2035 LASSERT(com->lc_lfsck->li_master);
2037 switch (lr->lr_event) {
2040 CDEBUG(D_LFSCK, "%s: fail to notify %s %x for %s "
2042 lfsck_lfsck2name(com->lc_lfsck),
2043 (lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
2044 ltd->ltd_index, lad->lad_name, rc);
2046 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2047 struct lfsck_layout *lo = com->lc_file_ram;
2049 if (lr->lr_flags & LEF_TO_OST)
2050 lfsck_lad_set_bitmap(env, com,
2053 lo->ll_flags |= LF_INCOMPLETE;
2055 struct lfsck_namespace *ns = com->lc_file_ram;
2057 /* If some MDT does not join the namespace
2058 * LFSCK, then we cannot know whether there
2059 * is some name entry on such MDT that with
2060 * the referenced MDT-object on this MDT or
2061 * not. So the namespace LFSCK on this MDT
2062 * cannot handle orphan MDT-objects properly.
2063 * So we mark the LFSCK as LF_INCOMPLETE and
2064 * skip orphan MDT-objects handling. */
2065 ns->ln_flags |= LF_INCOMPLETE;
2070 spin_lock(<ds->ltd_lock);
2071 if (ltd->ltd_dead) {
2072 spin_unlock(<ds->ltd_lock);
2076 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2077 struct list_head *list;
2078 struct list_head *phase_list;
2080 if (ltd->ltd_layout_done) {
2081 spin_unlock(<ds->ltd_lock);
2085 if (lr->lr_flags & LEF_TO_OST) {
2086 list = &lad->lad_ost_list;
2087 phase_list = &lad->lad_ost_phase1_list;
2089 list = &lad->lad_mdt_list;
2090 phase_list = &lad->lad_mdt_phase1_list;
2093 if (list_empty(<d->ltd_layout_list))
2094 list_add_tail(<d->ltd_layout_list, list);
2095 if (list_empty(<d->ltd_layout_phase_list))
2096 list_add_tail(<d->ltd_layout_phase_list,
2099 if (ltd->ltd_namespace_done) {
2100 spin_unlock(<ds->ltd_lock);
2104 if (list_empty(<d->ltd_namespace_list))
2105 list_add_tail(<d->ltd_namespace_list,
2106 &lad->lad_mdt_list);
2107 if (list_empty(<d->ltd_namespace_phase_list))
2108 list_add_tail(<d->ltd_namespace_phase_list,
2109 &lad->lad_mdt_phase1_list);
2111 spin_unlock(<ds->ltd_lock);
2114 case LE_PHASE1_DONE:
2115 case LE_PHASE2_DONE:
2117 if (rc != 0 && rc != -EALREADY)
2118 CDEBUG(D_LFSCK, "%s: fail to notify %s %x for %s: "
2119 "event = %d, rc = %d\n",
2120 lfsck_lfsck2name(com->lc_lfsck),
2121 (lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
2122 ltd->ltd_index, lad->lad_name, lr->lr_event, rc);
2125 struct lfsck_reply *reply;
2126 struct list_head *list;
2127 struct list_head *phase_list;
2129 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2130 list = <d->ltd_layout_list;
2131 phase_list = <d->ltd_layout_phase_list;
2133 list = <d->ltd_namespace_list;
2134 phase_list = <d->ltd_namespace_phase_list;
2138 if (lr->lr_flags & LEF_QUERY_ALL) {
2139 lfsck_reset_ltd_status(ltd, com->lc_type);
2143 spin_lock(<ds->ltd_lock);
2144 list_del_init(phase_list);
2145 list_del_init(list);
2146 spin_unlock(<ds->ltd_lock);
2150 reply = req_capsule_server_get(&req->rq_pill,
2152 if (reply == NULL) {
2154 CDEBUG(D_LFSCK, "%s: invalid query reply for %s: "
2155 "rc = %d\n", lfsck_lfsck2name(com->lc_lfsck),
2158 if (lr->lr_flags & LEF_QUERY_ALL) {
2159 lfsck_reset_ltd_status(ltd, com->lc_type);
2163 spin_lock(<ds->ltd_lock);
2164 list_del_init(phase_list);
2165 list_del_init(list);
2166 spin_unlock(<ds->ltd_lock);
2170 if (lr->lr_flags & LEF_QUERY_ALL) {
2171 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2172 ltd->ltd_layout_status = reply->lr_status;
2173 ltd->ltd_layout_repaired = reply->lr_repaired;
2175 ltd->ltd_namespace_status = reply->lr_status;
2176 ltd->ltd_namespace_repaired =
2182 switch (reply->lr_status) {
2183 case LS_SCANNING_PHASE1:
2185 case LS_SCANNING_PHASE2:
2186 spin_lock(<ds->ltd_lock);
2187 list_del_init(phase_list);
2188 if (ltd->ltd_dead) {
2189 spin_unlock(<ds->ltd_lock);
2193 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2194 if (ltd->ltd_layout_done) {
2195 spin_unlock(<ds->ltd_lock);
2199 if (lr->lr_flags & LEF_TO_OST)
2200 list_add_tail(phase_list,
2201 &lad->lad_ost_phase2_list);
2203 list_add_tail(phase_list,
2204 &lad->lad_mdt_phase2_list);
2206 if (ltd->ltd_namespace_done) {
2207 spin_unlock(<ds->ltd_lock);
2211 list_add_tail(phase_list,
2212 &lad->lad_mdt_phase2_list);
2214 spin_unlock(<ds->ltd_lock);
2217 spin_lock(<ds->ltd_lock);
2218 list_del_init(phase_list);
2219 list_del_init(list);
2220 spin_unlock(<ds->ltd_lock);
2226 CDEBUG(D_LFSCK, "%s: unexpected event: rc = %d\n",
2227 lfsck_lfsck2name(com->lc_lfsck), lr->lr_event);
2231 if (!laia->laia_shared) {
2233 lfsck_component_put(env, com);
2239 static void lfsck_interpret(const struct lu_env *env,
2240 struct lfsck_instance *lfsck,
2241 struct ptlrpc_request *req, void *args, int result)
2243 struct lfsck_async_interpret_args *laia = args;
2244 struct lfsck_component *com;
2246 LASSERT(laia->laia_com == NULL);
2247 LASSERT(laia->laia_shared);
2249 spin_lock(&lfsck->li_lock);
2250 list_for_each_entry(com, &lfsck->li_list_scan, lc_link) {
2251 laia->laia_com = com;
2252 lfsck_async_interpret_common(env, req, laia, result);
2255 list_for_each_entry(com, &lfsck->li_list_double_scan, lc_link) {
2256 laia->laia_com = com;
2257 lfsck_async_interpret_common(env, req, laia, result);
2259 spin_unlock(&lfsck->li_lock);
2262 static int lfsck_stop_notify(const struct lu_env *env,
2263 struct lfsck_instance *lfsck,
2264 struct lfsck_tgt_descs *ltds,
2265 struct lfsck_tgt_desc *ltd, __u16 type)
2267 struct lfsck_component *com;
2271 LASSERT(lfsck->li_master);
2273 spin_lock(&lfsck->li_lock);
2274 com = __lfsck_component_find(lfsck, type, &lfsck->li_list_scan);
2276 com = __lfsck_component_find(lfsck, type,
2277 &lfsck->li_list_double_scan);
2279 lfsck_component_get(com);
2280 spin_unlock(&lfsck->li_lock);
2283 struct lfsck_thread_info *info = lfsck_env_info(env);
2284 struct lfsck_async_interpret_args *laia = &info->lti_laia;
2285 struct lfsck_request *lr = &info->lti_lr;
2286 struct lfsck_assistant_data *lad = com->lc_data;
2287 struct list_head *list;
2288 struct list_head *phase_list;
2289 struct ptlrpc_request_set *set;
2291 set = ptlrpc_prep_set();
2293 lfsck_component_put(env, com);
2298 if (type == LFSCK_TYPE_LAYOUT) {
2299 list = <d->ltd_layout_list;
2300 phase_list = <d->ltd_layout_phase_list;
2302 list = <d->ltd_namespace_list;
2303 phase_list = <d->ltd_namespace_phase_list;
2306 spin_lock(<ds->ltd_lock);
2307 if (list_empty(list)) {
2308 LASSERT(list_empty(phase_list));
2309 spin_unlock(<ds->ltd_lock);
2310 ptlrpc_set_destroy(set);
2315 list_del_init(phase_list);
2316 list_del_init(list);
2317 spin_unlock(<ds->ltd_lock);
2319 memset(lr, 0, sizeof(*lr));
2320 lr->lr_index = lfsck_dev_idx(lfsck);
2321 lr->lr_event = LE_PEER_EXIT;
2322 lr->lr_active = type;
2323 lr->lr_status = LS_CO_PAUSED;
2324 if (ltds == &lfsck->li_ost_descs)
2325 lr->lr_flags = LEF_TO_OST;
2327 memset(laia, 0, sizeof(*laia));
2328 laia->laia_com = com;
2329 laia->laia_ltds = ltds;
2330 atomic_inc(<d->ltd_ref);
2331 laia->laia_ltd = ltd;
2334 rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
2335 lfsck_async_interpret_common,
2336 laia, LFSCK_NOTIFY);
2338 CDEBUG(D_LFSCK, "%s: fail to notify %s %x for "
2339 "co-stop for %s: rc = %d\n",
2340 lfsck_lfsck2name(lfsck),
2341 (lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
2342 ltd->ltd_index, lad->lad_name, rc);
2345 rc = ptlrpc_set_wait(set);
2348 ptlrpc_set_destroy(set);
2349 lfsck_component_put(env, com);
2355 static int lfsck_async_interpret(const struct lu_env *env,
2356 struct ptlrpc_request *req,
2359 struct lfsck_async_interpret_args *laia = args;
2360 struct lfsck_instance *lfsck;
2362 lfsck = container_of0(laia->laia_ltds, struct lfsck_instance,
2364 lfsck_interpret(env, lfsck, req, laia, rc);
2365 lfsck_tgt_put(laia->laia_ltd);
2366 if (rc != 0 && laia->laia_result != -EALREADY)
2367 laia->laia_result = rc;
2372 int lfsck_async_request(const struct lu_env *env, struct obd_export *exp,
2373 struct lfsck_request *lr,
2374 struct ptlrpc_request_set *set,
2375 ptlrpc_interpterer_t interpreter,
2376 void *args, int request)
2378 struct lfsck_async_interpret_args *laia;
2379 struct ptlrpc_request *req;
2380 struct lfsck_request *tmp;
2381 struct req_format *format;
2386 format = &RQF_LFSCK_NOTIFY;
2389 format = &RQF_LFSCK_QUERY;
2392 CDEBUG(D_LFSCK, "%s: unknown async request %d: rc = %d\n",
2393 exp->exp_obd->obd_name, request, -EINVAL);
2397 req = ptlrpc_request_alloc(class_exp2cliimp(exp), format);
2401 rc = ptlrpc_request_pack(req, LUSTRE_OBD_VERSION, request);
2403 ptlrpc_request_free(req);
2408 tmp = req_capsule_client_get(&req->rq_pill, &RMF_LFSCK_REQUEST);
2410 ptlrpc_request_set_replen(req);
2412 laia = ptlrpc_req_async_args(req);
2413 *laia = *(struct lfsck_async_interpret_args *)args;
2414 if (laia->laia_com != NULL)
2415 lfsck_component_get(laia->laia_com);
2416 req->rq_interpret_reply = interpreter;
2417 req->rq_allow_intr = 1;
2418 ptlrpc_set_add_req(set, req);
2423 int lfsck_query_all(const struct lu_env *env, struct lfsck_component *com)
2425 struct lfsck_thread_info *info = lfsck_env_info(env);
2426 struct lfsck_request *lr = &info->lti_lr;
2427 struct lfsck_async_interpret_args *laia = &info->lti_laia;
2428 struct lfsck_instance *lfsck = com->lc_lfsck;
2429 struct lfsck_tgt_descs *ltds = &lfsck->li_mdt_descs;
2430 struct lfsck_tgt_desc *ltd;
2431 struct ptlrpc_request_set *set;
2436 memset(lr, 0, sizeof(*lr));
2437 lr->lr_event = LE_QUERY;
2438 lr->lr_active = com->lc_type;
2439 lr->lr_flags = LEF_QUERY_ALL;
2441 memset(laia, 0, sizeof(*laia));
2442 laia->laia_com = com;
2445 set = ptlrpc_prep_set();
2450 laia->laia_ltds = ltds;
2451 down_read(<ds->ltd_rw_sem);
2452 cfs_foreach_bit(ltds->ltd_tgts_bitmap, idx) {
2453 ltd = lfsck_tgt_get(ltds, idx);
2454 LASSERT(ltd != NULL);
2456 laia->laia_ltd = ltd;
2457 up_read(<ds->ltd_rw_sem);
2458 rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
2459 lfsck_async_interpret_common,
2462 struct lfsck_assistant_data *lad = com->lc_data;
2464 CDEBUG(D_LFSCK, "%s: Fail to query %s %x for stat %s: "
2465 "rc = %d\n", lfsck_lfsck2name(lfsck),
2466 (lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
2467 ltd->ltd_index, lad->lad_name, rc);
2468 lfsck_reset_ltd_status(ltd, com->lc_type);
2471 down_read(<ds->ltd_rw_sem);
2473 up_read(<ds->ltd_rw_sem);
2475 if (com->lc_type == LFSCK_TYPE_LAYOUT && !(lr->lr_flags & LEF_TO_OST)) {
2476 ltds = &lfsck->li_ost_descs;
2477 lr->lr_flags |= LEF_TO_OST;
2481 rc = ptlrpc_set_wait(set);
2482 ptlrpc_set_destroy(set);
2487 int lfsck_start_assistant(const struct lu_env *env, struct lfsck_component *com,
2488 struct lfsck_start_param *lsp)
2490 struct lfsck_instance *lfsck = com->lc_lfsck;
2491 struct lfsck_assistant_data *lad = com->lc_data;
2492 struct ptlrpc_thread *mthread = &lfsck->li_thread;
2493 struct ptlrpc_thread *athread = &lad->lad_thread;
2494 struct lfsck_thread_args *lta;
2495 struct task_struct *task;
2499 lad->lad_assistant_status = 0;
2500 lad->lad_post_result = 0;
2501 lad->lad_to_post = 0;
2502 lad->lad_to_double_scan = 0;
2503 lad->lad_in_double_scan = 0;
2505 lad->lad_advance_lock = false;
2506 thread_set_flags(athread, 0);
2508 lta = lfsck_thread_args_init(lfsck, com, lsp);
2510 RETURN(PTR_ERR(lta));
2512 task = kthread_run(lfsck_assistant_engine, lta, lad->lad_name);
2515 CERROR("%s: cannot start LFSCK assistant thread for %s: "
2516 "rc = %d\n", lfsck_lfsck2name(lfsck), lad->lad_name, rc);
2517 lfsck_thread_args_fini(lta);
2519 struct l_wait_info lwi = { 0 };
2521 l_wait_event(mthread->t_ctl_waitq,
2522 thread_is_running(athread) ||
2523 thread_is_stopped(athread),
2525 if (unlikely(!thread_is_running(athread)))
2526 rc = lad->lad_assistant_status;
2534 int lfsck_checkpoint_generic(const struct lu_env *env,
2535 struct lfsck_component *com)
2537 struct lfsck_assistant_data *lad = com->lc_data;
2538 struct ptlrpc_thread *mthread = &com->lc_lfsck->li_thread;
2539 struct ptlrpc_thread *athread = &lad->lad_thread;
2540 struct l_wait_info lwi = { 0 };
2542 l_wait_event(mthread->t_ctl_waitq,
2543 list_empty(&lad->lad_req_list) ||
2544 !thread_is_running(mthread) ||
2545 thread_is_stopped(athread),
2548 if (!thread_is_running(mthread) || thread_is_stopped(athread))
2549 return LFSCK_CHECKPOINT_SKIP;
2554 void lfsck_post_generic(const struct lu_env *env,
2555 struct lfsck_component *com, int *result)
2557 struct lfsck_assistant_data *lad = com->lc_data;
2558 struct ptlrpc_thread *athread = &lad->lad_thread;
2559 struct ptlrpc_thread *mthread = &com->lc_lfsck->li_thread;
2560 struct l_wait_info lwi = { 0 };
2562 lad->lad_post_result = *result;
2565 lad->lad_to_post = 1;
2567 CDEBUG(D_LFSCK, "%s: waiting for assistant to do %s post, rc = %d\n",
2568 lfsck_lfsck2name(com->lc_lfsck), lad->lad_name, *result);
2570 wake_up_all(&athread->t_ctl_waitq);
2571 l_wait_event(mthread->t_ctl_waitq,
2572 (*result > 0 && list_empty(&lad->lad_req_list)) ||
2573 thread_is_stopped(athread),
2576 if (lad->lad_assistant_status < 0)
2577 *result = lad->lad_assistant_status;
2579 CDEBUG(D_LFSCK, "%s: the assistant has done %s post, rc = %d\n",
2580 lfsck_lfsck2name(com->lc_lfsck), lad->lad_name, *result);
2583 int lfsck_double_scan_generic(const struct lu_env *env,
2584 struct lfsck_component *com, int status)
2586 struct lfsck_assistant_data *lad = com->lc_data;
2587 struct ptlrpc_thread *mthread = &com->lc_lfsck->li_thread;
2588 struct ptlrpc_thread *athread = &lad->lad_thread;
2589 struct l_wait_info lwi = { 0 };
2591 if (status != LS_SCANNING_PHASE2)
2594 lad->lad_to_double_scan = 1;
2596 CDEBUG(D_LFSCK, "%s: waiting for assistant to do %s double_scan, "
2598 lfsck_lfsck2name(com->lc_lfsck), lad->lad_name, status);
2600 wake_up_all(&athread->t_ctl_waitq);
2601 l_wait_event(mthread->t_ctl_waitq,
2602 lad->lad_in_double_scan ||
2603 thread_is_stopped(athread),
2606 CDEBUG(D_LFSCK, "%s: the assistant has done %s double_scan, "
2607 "status %d\n", lfsck_lfsck2name(com->lc_lfsck), lad->lad_name,
2608 lad->lad_assistant_status);
2610 if (lad->lad_assistant_status < 0)
2611 return lad->lad_assistant_status;
2616 void lfsck_quit_generic(const struct lu_env *env,
2617 struct lfsck_component *com)
2619 struct lfsck_assistant_data *lad = com->lc_data;
2620 struct ptlrpc_thread *mthread = &com->lc_lfsck->li_thread;
2621 struct ptlrpc_thread *athread = &lad->lad_thread;
2622 struct l_wait_info lwi = { 0 };
2625 wake_up_all(&athread->t_ctl_waitq);
2626 l_wait_event(mthread->t_ctl_waitq,
2627 thread_is_init(athread) ||
2628 thread_is_stopped(athread),
2632 int lfsck_load_one_trace_file(const struct lu_env *env,
2633 struct lfsck_component *com,
2634 struct dt_object *parent,
2635 struct dt_object **child,
2636 const struct dt_index_features *ft,
2637 const char *name, bool reset)
2639 struct lfsck_instance *lfsck = com->lc_lfsck;
2640 struct dt_object *obj;
2644 if (*child != NULL) {
2646 const struct dt_it_ops *iops;
2647 struct lu_fid *fid = &lfsck_env_info(env)->lti_fid3;
2653 rc = obj->do_ops->do_index_try(env, obj, ft);
2655 /* unlink by force */
2658 iops = &obj->do_index_ops->dio_it;
2659 it = iops->init(env, obj, 0);
2661 /* unlink by force */
2665 rc = iops->get(env, it, (const struct dt_key *)fid);
2667 rc = iops->next(env, it);
2670 iops->fini(env, it);
2672 /* "rc > 0" means the index file is empty. */
2676 /* The old index is not empty, remove it firstly. */
2677 rc = local_object_unlink(env, lfsck->li_bottom, parent, name);
2678 CDEBUG_LIMIT(rc ? D_ERROR : D_LFSCK,
2679 "%s: unlink lfsck sub trace file %s: rc = %d\n",
2680 lfsck_lfsck2name(com->lc_lfsck), name, rc);
2685 lfsck_object_put(env, *child);
2692 obj = local_index_find_or_create(env, lfsck->li_los, parent, name,
2693 S_IFREG | S_IRUGO | S_IWUSR, ft);
2695 RETURN(PTR_ERR(obj));
2697 rc = obj->do_ops->do_index_try(env, obj, ft);
2699 lfsck_object_put(env, obj);
2706 int lfsck_load_sub_trace_files(const struct lu_env *env,
2707 struct lfsck_component *com,
2708 const struct dt_index_features *ft,
2709 const char *prefix, bool reset)
2711 char *name = lfsck_env_info(env)->lti_key;
2712 struct lfsck_sub_trace_obj *lsto;
2716 for (i = 0, rc = 0, lsto = &com->lc_sub_trace_objs[0];
2717 i < LFSCK_STF_COUNT && rc == 0; i++, lsto++) {
2718 snprintf(name, NAME_MAX, "%s_%02d", prefix, i);
2719 rc = lfsck_load_one_trace_file(env, com,
2720 com->lc_lfsck->li_lfsck_dir,
2721 &lsto->lsto_obj, ft, name, reset);
2727 /* external interfaces */
2729 int lfsck_get_speed(struct seq_file *m, struct dt_device *key)
2732 struct lfsck_instance *lfsck;
2736 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2740 lfsck = lfsck_instance_find(key, true, false);
2741 if (likely(lfsck != NULL)) {
2742 seq_printf(m, "%u\n", lfsck->li_bookmark_ram.lb_speed_limit);
2743 lfsck_instance_put(&env, lfsck);
2752 EXPORT_SYMBOL(lfsck_get_speed);
2754 int lfsck_set_speed(struct dt_device *key, __u32 val)
2757 struct lfsck_instance *lfsck;
2761 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2765 lfsck = lfsck_instance_find(key, true, false);
2766 if (likely(lfsck != NULL)) {
2767 mutex_lock(&lfsck->li_mutex);
2768 if (__lfsck_set_speed(lfsck, val))
2769 rc = lfsck_bookmark_store(&env, lfsck);
2770 mutex_unlock(&lfsck->li_mutex);
2771 lfsck_instance_put(&env, lfsck);
2780 EXPORT_SYMBOL(lfsck_set_speed);
2782 int lfsck_get_windows(struct seq_file *m, struct dt_device *key)
2785 struct lfsck_instance *lfsck;
2789 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2793 lfsck = lfsck_instance_find(key, true, false);
2794 if (likely(lfsck != NULL)) {
2795 seq_printf(m, "%u\n", lfsck->li_bookmark_ram.lb_async_windows);
2796 lfsck_instance_put(&env, lfsck);
2805 EXPORT_SYMBOL(lfsck_get_windows);
2807 int lfsck_set_windows(struct dt_device *key, int val)
2810 struct lfsck_instance *lfsck;
2814 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2818 lfsck = lfsck_instance_find(key, true, false);
2819 if (likely(lfsck != NULL)) {
2820 if (val < 1 || val > LFSCK_ASYNC_WIN_MAX) {
2821 CWARN("%s: invalid async windows size that may "
2822 "cause memory issues. The valid range is "
2824 lfsck_lfsck2name(lfsck), LFSCK_ASYNC_WIN_MAX);
2826 } else if (lfsck->li_bookmark_ram.lb_async_windows != val) {
2827 mutex_lock(&lfsck->li_mutex);
2828 lfsck->li_bookmark_ram.lb_async_windows = val;
2829 rc = lfsck_bookmark_store(&env, lfsck);
2830 mutex_unlock(&lfsck->li_mutex);
2832 lfsck_instance_put(&env, lfsck);
2841 EXPORT_SYMBOL(lfsck_set_windows);
2843 int lfsck_dump(struct seq_file *m, struct dt_device *key, enum lfsck_type type)
2846 struct lfsck_instance *lfsck;
2847 struct lfsck_component *com;
2851 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2855 lfsck = lfsck_instance_find(key, true, false);
2856 if (likely(lfsck != NULL)) {
2857 com = lfsck_component_find(lfsck, type);
2858 if (likely(com != NULL)) {
2859 com->lc_ops->lfsck_dump(&env, com, m);
2860 lfsck_component_put(&env, com);
2865 lfsck_instance_put(&env, lfsck);
2874 EXPORT_SYMBOL(lfsck_dump);
2876 static int lfsck_stop_all(const struct lu_env *env,
2877 struct lfsck_instance *lfsck,
2878 struct lfsck_stop *stop)
2880 struct lfsck_thread_info *info = lfsck_env_info(env);
2881 struct lfsck_request *lr = &info->lti_lr;
2882 struct lfsck_async_interpret_args *laia = &info->lti_laia;
2883 struct ptlrpc_request_set *set;
2884 struct lfsck_tgt_descs *ltds = &lfsck->li_mdt_descs;
2885 struct lfsck_tgt_desc *ltd;
2886 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
2892 LASSERT(stop->ls_flags & LPF_BROADCAST);
2894 set = ptlrpc_prep_set();
2895 if (unlikely(set == NULL))
2898 memset(lr, 0, sizeof(*lr));
2899 lr->lr_event = LE_STOP;
2900 lr->lr_index = lfsck_dev_idx(lfsck);
2901 lr->lr_status = stop->ls_status;
2902 lr->lr_version = bk->lb_version;
2903 lr->lr_active = LFSCK_TYPES_ALL;
2904 lr->lr_param = stop->ls_flags;
2906 memset(laia, 0, sizeof(*laia));
2907 laia->laia_ltds = ltds;
2909 laia->laia_shared = 1;
2911 down_read(<ds->ltd_rw_sem);
2912 cfs_foreach_bit(ltds->ltd_tgts_bitmap, idx) {
2913 ltd = lfsck_tgt_get(ltds, idx);
2914 LASSERT(ltd != NULL);
2916 laia->laia_ltd = ltd;
2917 rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
2918 lfsck_async_interpret, laia,
2921 lfsck_interpret(env, lfsck, NULL, laia, rc);
2923 CERROR("%s: cannot notify MDT %x for LFSCK stop: "
2924 "rc = %d\n", lfsck_lfsck2name(lfsck), idx, rc);
2928 up_read(<ds->ltd_rw_sem);
2930 rc = ptlrpc_set_wait(set);
2931 ptlrpc_set_destroy(set);
2934 rc = laia->laia_result;
2936 if (rc == -EALREADY)
2940 CERROR("%s: fail to stop LFSCK on some MDTs: rc = %d\n",
2941 lfsck_lfsck2name(lfsck), rc);
2943 RETURN(rc != 0 ? rc : rc1);
2946 static int lfsck_start_all(const struct lu_env *env,
2947 struct lfsck_instance *lfsck,
2948 struct lfsck_start *start)
2950 struct lfsck_thread_info *info = lfsck_env_info(env);
2951 struct lfsck_request *lr = &info->lti_lr;
2952 struct lfsck_async_interpret_args *laia = &info->lti_laia;
2953 struct ptlrpc_request_set *set;
2954 struct lfsck_tgt_descs *ltds = &lfsck->li_mdt_descs;
2955 struct lfsck_tgt_desc *ltd;
2956 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
2961 LASSERT(start->ls_flags & LPF_BROADCAST);
2963 set = ptlrpc_prep_set();
2964 if (unlikely(set == NULL))
2967 memset(lr, 0, sizeof(*lr));
2968 lr->lr_event = LE_START;
2969 lr->lr_index = lfsck_dev_idx(lfsck);
2970 lr->lr_speed = bk->lb_speed_limit;
2971 lr->lr_version = bk->lb_version;
2972 lr->lr_active = start->ls_active;
2973 lr->lr_param = start->ls_flags;
2974 lr->lr_async_windows = bk->lb_async_windows;
2975 lr->lr_valid = LSV_SPEED_LIMIT | LSV_ERROR_HANDLE | LSV_DRYRUN |
2976 LSV_ASYNC_WINDOWS | LSV_CREATE_OSTOBJ |
2979 memset(laia, 0, sizeof(*laia));
2980 laia->laia_ltds = ltds;
2982 laia->laia_shared = 1;
2984 down_read(<ds->ltd_rw_sem);
2985 cfs_foreach_bit(ltds->ltd_tgts_bitmap, idx) {
2986 ltd = lfsck_tgt_get(ltds, idx);
2987 LASSERT(ltd != NULL);
2989 laia->laia_ltd = ltd;
2990 ltd->ltd_layout_done = 0;
2991 ltd->ltd_namespace_done = 0;
2992 ltd->ltd_synced_failures = 0;
2993 rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
2994 lfsck_async_interpret, laia,
2997 lfsck_interpret(env, lfsck, NULL, laia, rc);
2999 CERROR("%s: cannot notify MDT %x for LFSCK "
3000 "start, failout: rc = %d\n",
3001 lfsck_lfsck2name(lfsck), idx, rc);
3005 up_read(<ds->ltd_rw_sem);
3008 ptlrpc_set_destroy(set);
3013 rc = ptlrpc_set_wait(set);
3014 ptlrpc_set_destroy(set);
3017 rc = laia->laia_result;
3020 struct lfsck_stop *stop = &info->lti_stop;
3022 CERROR("%s: cannot start LFSCK on some MDTs, "
3023 "stop all: rc = %d\n",
3024 lfsck_lfsck2name(lfsck), rc);
3025 if (rc != -EALREADY) {
3026 stop->ls_status = LS_FAILED;
3027 stop->ls_flags = LPF_ALL_TGT | LPF_BROADCAST;
3028 lfsck_stop_all(env, lfsck, stop);
3035 int lfsck_start(const struct lu_env *env, struct dt_device *key,
3036 struct lfsck_start_param *lsp)
3038 struct lfsck_start *start = lsp->lsp_start;
3039 struct lfsck_instance *lfsck;
3040 struct lfsck_bookmark *bk;
3041 struct ptlrpc_thread *thread;
3042 struct lfsck_component *com;
3043 struct l_wait_info lwi = { 0 };
3044 struct lfsck_thread_args *lta;
3045 struct task_struct *task;
3046 struct lfsck_tgt_descs *ltds;
3047 struct lfsck_tgt_desc *ltd;
3058 lfsck = lfsck_instance_find(key, true, false);
3059 if (unlikely(lfsck == NULL))
3062 /* System is not ready, try again later. */
3063 if (unlikely(lfsck->li_namespace == NULL))
3064 GOTO(put, rc = -EAGAIN);
3066 /* start == NULL means auto trigger paused LFSCK. */
3067 if ((start == NULL) &&
3068 (list_empty(&lfsck->li_list_scan) ||
3069 OBD_FAIL_CHECK(OBD_FAIL_LFSCK_NO_AUTO)))
3072 bk = &lfsck->li_bookmark_ram;
3073 thread = &lfsck->li_thread;
3074 mutex_lock(&lfsck->li_mutex);
3075 spin_lock(&lfsck->li_lock);
3076 if (!thread_is_init(thread) && !thread_is_stopped(thread)) {
3078 if (unlikely(start == NULL)) {
3079 spin_unlock(&lfsck->li_lock);
3083 while (start->ls_active != 0) {
3084 if (!(type & start->ls_active)) {
3089 com = __lfsck_component_find(lfsck, type,
3090 &lfsck->li_list_scan);
3092 com = __lfsck_component_find(lfsck, type,
3093 &lfsck->li_list_double_scan);
3099 if (com->lc_ops->lfsck_join != NULL) {
3100 rc = com->lc_ops->lfsck_join( env, com, lsp);
3101 if (rc != 0 && rc != -EALREADY)
3104 start->ls_active &= ~type;
3107 spin_unlock(&lfsck->li_lock);
3110 spin_unlock(&lfsck->li_lock);
3112 lfsck->li_status = 0;
3113 lfsck->li_oit_over = 0;
3114 lfsck->li_start_unplug = 0;
3115 lfsck->li_drop_dryrun = 0;
3116 lfsck->li_new_scanned = 0;
3118 /* For auto trigger. */
3122 if (start->ls_flags & LPF_BROADCAST && !lfsck->li_master) {
3123 CERROR("%s: only allow to specify '-A | -o' via MDS\n",
3124 lfsck_lfsck2name(lfsck));
3126 GOTO(out, rc = -EPERM);
3129 start->ls_version = bk->lb_version;
3131 if (start->ls_active != 0) {
3132 struct lfsck_component *next;
3134 if (start->ls_active == LFSCK_TYPES_ALL)
3135 start->ls_active = LFSCK_TYPES_SUPPORTED;
3137 if (start->ls_active & ~LFSCK_TYPES_SUPPORTED) {
3138 start->ls_active &= ~LFSCK_TYPES_SUPPORTED;
3139 GOTO(out, rc = -ENOTSUPP);
3142 list_for_each_entry_safe(com, next,
3143 &lfsck->li_list_scan, lc_link) {
3144 if (!(com->lc_type & start->ls_active)) {
3145 rc = com->lc_ops->lfsck_post(env, com, 0,
3152 while (start->ls_active != 0) {
3153 if (type & start->ls_active) {
3154 com = __lfsck_component_find(lfsck, type,
3155 &lfsck->li_list_idle);
3157 /* The component status will be updated
3158 * when its prep() is called later by
3159 * the LFSCK main engine. */
3160 list_move_tail(&com->lc_link,
3161 &lfsck->li_list_scan);
3162 start->ls_active &= ~type;
3168 if (list_empty(&lfsck->li_list_scan)) {
3169 /* The speed limit will be used to control both the LFSCK and
3170 * low layer scrub (if applied), need to be handled firstly. */
3171 if (start->ls_valid & LSV_SPEED_LIMIT) {
3172 if (__lfsck_set_speed(lfsck, start->ls_speed_limit)) {
3173 rc = lfsck_bookmark_store(env, lfsck);
3182 if (start->ls_flags & LPF_RESET)
3183 flags |= DOIF_RESET;
3185 rc = lfsck_set_param(env, lfsck, start, !!(flags & DOIF_RESET));
3189 list_for_each_entry(com, &lfsck->li_list_scan, lc_link) {
3190 start->ls_active |= com->lc_type;
3191 if (flags & DOIF_RESET) {
3192 rc = com->lc_ops->lfsck_reset(env, com, false);
3198 ltds = &lfsck->li_mdt_descs;
3199 down_read(<ds->ltd_rw_sem);
3200 cfs_foreach_bit(ltds->ltd_tgts_bitmap, idx) {
3201 ltd = lfsck_ltd2tgt(ltds, idx);
3202 LASSERT(ltd != NULL);
3204 ltd->ltd_layout_done = 0;
3205 ltd->ltd_namespace_done = 0;
3206 ltd->ltd_synced_failures = 0;
3207 lfsck_reset_ltd_status(ltd, LFSCK_TYPE_NAMESPACE);
3208 lfsck_reset_ltd_status(ltd, LFSCK_TYPE_LAYOUT);
3209 list_del_init(<d->ltd_layout_phase_list);
3210 list_del_init(<d->ltd_layout_list);
3211 list_del_init(<d->ltd_namespace_phase_list);
3212 list_del_init(<d->ltd_namespace_list);
3214 up_read(<ds->ltd_rw_sem);
3216 ltds = &lfsck->li_ost_descs;
3217 down_read(<ds->ltd_rw_sem);
3218 cfs_foreach_bit(ltds->ltd_tgts_bitmap, idx) {
3219 ltd = lfsck_ltd2tgt(ltds, idx);
3220 LASSERT(ltd != NULL);
3222 ltd->ltd_layout_done = 0;
3223 ltd->ltd_synced_failures = 0;
3224 lfsck_reset_ltd_status(ltd, LFSCK_TYPE_LAYOUT);
3225 list_del_init(<d->ltd_layout_phase_list);
3226 list_del_init(<d->ltd_layout_list);
3228 up_read(<ds->ltd_rw_sem);
3231 lfsck->li_args_dir = LUDA_64BITHASH | LUDA_VERIFY | LUDA_TYPE;
3232 if (bk->lb_param & LPF_DRYRUN)
3233 lfsck->li_args_dir |= LUDA_VERIFY_DRYRUN;
3235 if (start != NULL && start->ls_valid & LSV_ERROR_HANDLE) {
3236 valid |= DOIV_ERROR_HANDLE;
3237 if (start->ls_flags & LPF_FAILOUT)
3238 flags |= DOIF_FAILOUT;
3241 if (start != NULL && start->ls_valid & LSV_DRYRUN) {
3242 valid |= DOIV_DRYRUN;
3243 if (start->ls_flags & LPF_DRYRUN)
3244 flags |= DOIF_DRYRUN;
3247 if (!list_empty(&lfsck->li_list_scan))
3248 flags |= DOIF_OUTUSED;
3250 lfsck->li_args_oit = (flags << DT_OTABLE_IT_FLAGS_SHIFT) | valid;
3251 thread_set_flags(thread, 0);
3252 lta = lfsck_thread_args_init(lfsck, NULL, lsp);
3254 GOTO(out, rc = PTR_ERR(lta));
3256 __lfsck_set_speed(lfsck, bk->lb_speed_limit);
3257 task = kthread_run(lfsck_master_engine, lta, "lfsck");
3260 CERROR("%s: cannot start LFSCK thread: rc = %d\n",
3261 lfsck_lfsck2name(lfsck), rc);
3262 lfsck_thread_args_fini(lta);
3267 l_wait_event(thread->t_ctl_waitq,
3268 thread_is_running(thread) ||
3269 thread_is_stopped(thread),
3271 if (start == NULL || !(start->ls_flags & LPF_BROADCAST)) {
3272 lfsck->li_start_unplug = 1;
3273 wake_up_all(&thread->t_ctl_waitq);
3278 /* release lfsck::li_mutex to avoid deadlock. */
3279 mutex_unlock(&lfsck->li_mutex);
3280 rc = lfsck_start_all(env, lfsck, start);
3282 spin_lock(&lfsck->li_lock);
3283 if (thread_is_stopped(thread)) {
3284 spin_unlock(&lfsck->li_lock);
3286 lfsck->li_status = LS_FAILED;
3287 lfsck->li_flags = 0;
3288 thread_set_flags(thread, SVC_STOPPING);
3289 spin_unlock(&lfsck->li_lock);
3291 lfsck->li_start_unplug = 1;
3292 wake_up_all(&thread->t_ctl_waitq);
3293 l_wait_event(thread->t_ctl_waitq,
3294 thread_is_stopped(thread),
3298 lfsck->li_start_unplug = 1;
3299 wake_up_all(&thread->t_ctl_waitq);
3305 mutex_unlock(&lfsck->li_mutex);
3308 lfsck_instance_put(env, lfsck);
3310 return rc < 0 ? rc : 0;
3312 EXPORT_SYMBOL(lfsck_start);
3314 int lfsck_stop(const struct lu_env *env, struct dt_device *key,
3315 struct lfsck_stop *stop)
3317 struct lfsck_instance *lfsck;
3318 struct ptlrpc_thread *thread;
3319 struct l_wait_info lwi = { 0 };
3324 lfsck = lfsck_instance_find(key, true, false);
3325 if (unlikely(lfsck == NULL))
3328 thread = &lfsck->li_thread;
3329 /* release lfsck::li_mutex to avoid deadlock. */
3330 if (stop != NULL && stop->ls_flags & LPF_BROADCAST) {
3331 if (!lfsck->li_master) {
3332 CERROR("%s: only allow to specify '-A' via MDS\n",
3333 lfsck_lfsck2name(lfsck));
3335 GOTO(out, rc = -EPERM);
3338 rc1 = lfsck_stop_all(env, lfsck, stop);
3341 mutex_lock(&lfsck->li_mutex);
3342 spin_lock(&lfsck->li_lock);
3343 /* no error if LFSCK is already stopped, or was never started */
3344 if (thread_is_init(thread) || thread_is_stopped(thread)) {
3345 spin_unlock(&lfsck->li_lock);
3350 lfsck->li_status = stop->ls_status;
3351 lfsck->li_flags = stop->ls_flags;
3353 lfsck->li_status = LS_STOPPED;
3354 lfsck->li_flags = 0;
3357 thread_set_flags(thread, SVC_STOPPING);
3359 if (lfsck->li_master) {
3360 struct lfsck_component *com;
3361 struct lfsck_assistant_data *lad;
3363 list_for_each_entry(com, &lfsck->li_list_scan, lc_link) {
3365 spin_lock(&lad->lad_lock);
3366 if (lad->lad_task != NULL)
3367 force_sig(SIGINT, lad->lad_task);
3368 spin_unlock(&lad->lad_lock);
3371 list_for_each_entry(com, &lfsck->li_list_double_scan, lc_link) {
3373 spin_lock(&lad->lad_lock);
3374 if (lad->lad_task != NULL)
3375 force_sig(SIGINT, lad->lad_task);
3376 spin_unlock(&lad->lad_lock);
3380 spin_unlock(&lfsck->li_lock);
3382 wake_up_all(&thread->t_ctl_waitq);
3383 l_wait_event(thread->t_ctl_waitq,
3384 thread_is_stopped(thread),
3390 mutex_unlock(&lfsck->li_mutex);
3391 lfsck_instance_put(env, lfsck);
3393 return rc != 0 ? rc : rc1;
3395 EXPORT_SYMBOL(lfsck_stop);
3397 int lfsck_in_notify_local(const struct lu_env *env, struct dt_device *key,
3398 struct lfsck_req_local *lrl, struct thandle *th)
3400 struct lfsck_instance *lfsck;
3401 struct lfsck_component *com;
3402 int rc = -EOPNOTSUPP;
3405 lfsck = lfsck_instance_find(key, true, false);
3406 if (unlikely(!lfsck))
3409 com = lfsck_component_find(lfsck, lrl->lrl_active);
3410 if (likely(com && com->lc_ops->lfsck_in_notify_local)) {
3411 rc = com->lc_ops->lfsck_in_notify_local(env, com, lrl, th);
3412 lfsck_component_put(env, com);
3415 lfsck_instance_put(env, lfsck);
3419 EXPORT_SYMBOL(lfsck_in_notify_local);
3421 int lfsck_in_notify(const struct lu_env *env, struct dt_device *key,
3422 struct lfsck_request *lr)
3424 int rc = -EOPNOTSUPP;
3427 switch (lr->lr_event) {
3429 struct lfsck_start *start = &lfsck_env_info(env)->lti_start;
3430 struct lfsck_start_param lsp;
3432 memset(start, 0, sizeof(*start));
3433 start->ls_valid = lr->lr_valid;
3434 start->ls_speed_limit = lr->lr_speed;
3435 start->ls_version = lr->lr_version;
3436 start->ls_active = lr->lr_active;
3437 start->ls_flags = lr->lr_param & ~LPF_BROADCAST;
3438 start->ls_async_windows = lr->lr_async_windows;
3440 lsp.lsp_start = start;
3441 lsp.lsp_index = lr->lr_index;
3442 lsp.lsp_index_valid = 1;
3443 rc = lfsck_start(env, key, &lsp);
3447 struct lfsck_stop *stop = &lfsck_env_info(env)->lti_stop;
3449 memset(stop, 0, sizeof(*stop));
3450 stop->ls_status = lr->lr_status;
3451 stop->ls_flags = lr->lr_param & ~LPF_BROADCAST;
3452 rc = lfsck_stop(env, key, stop);
3455 case LE_PHASE1_DONE:
3456 case LE_PHASE2_DONE:
3458 case LE_CONDITIONAL_DESTROY:
3459 case LE_SET_LMV_MASTER:
3460 case LE_SET_LMV_SLAVE:
3461 case LE_PAIRS_VERIFY: {
3462 struct lfsck_instance *lfsck;
3463 struct lfsck_component *com;
3465 lfsck = lfsck_instance_find(key, true, false);
3466 if (unlikely(lfsck == NULL))
3469 com = lfsck_component_find(lfsck, lr->lr_active);
3471 rc = com->lc_ops->lfsck_in_notify(env, com, lr);
3472 lfsck_component_put(env, com);
3475 lfsck_instance_put(env, lfsck);
3484 EXPORT_SYMBOL(lfsck_in_notify);
3486 int lfsck_query(const struct lu_env *env, struct dt_device *key,
3487 struct lfsck_request *req, struct lfsck_reply *rep,
3488 struct lfsck_query *que)
3490 struct lfsck_instance *lfsck;
3491 struct lfsck_component *com;
3497 lfsck = lfsck_instance_find(key, true, false);
3498 if (unlikely(lfsck == NULL))
3502 if (que->lu_types == LFSCK_TYPES_ALL)
3504 LFSCK_TYPES_SUPPORTED & ~LFSCK_TYPE_SCRUB;
3506 if (que->lu_types & ~LFSCK_TYPES_SUPPORTED) {
3507 que->lu_types &= ~LFSCK_TYPES_SUPPORTED;
3509 GOTO(out, rc = -ENOTSUPP);
3512 for (i = 0, type = 1 << i; i < LFSCK_TYPE_BITS;
3513 i++, type = 1 << i) {
3514 if (!(que->lu_types & type))
3518 com = lfsck_component_find(lfsck, type);
3519 if (unlikely(com == NULL))
3520 GOTO(out, rc = -ENOTSUPP);
3522 memset(que->lu_mdts_count[i], 0,
3523 sizeof(__u32) * (LS_MAX + 1));
3524 memset(que->lu_osts_count[i], 0,
3525 sizeof(__u32) * (LS_MAX + 1));
3526 que->lu_repaired[i] = 0;
3527 rc = com->lc_ops->lfsck_query(env, com, req, rep,
3529 lfsck_component_put(env, com);
3534 if (!(que->lu_flags & LPF_WAIT))
3537 for (i = 0, type = 1 << i; i < LFSCK_TYPE_BITS;
3538 i++, type = 1 << i) {
3539 if (!(que->lu_types & type))
3542 if (que->lu_mdts_count[i][LS_SCANNING_PHASE1] != 0 ||
3543 que->lu_mdts_count[i][LS_SCANNING_PHASE2] != 0 ||
3544 que->lu_osts_count[i][LS_SCANNING_PHASE1] != 0 ||
3545 que->lu_osts_count[i][LS_SCANNING_PHASE2] != 0) {
3546 struct l_wait_info lwi;
3548 /* If it is required to wait, then sleep
3549 * 3 seconds and try to query again. */
3550 lwi = LWI_TIMEOUT_INTR(cfs_time_seconds(3),
3554 rc = l_wait_event(lfsck->li_thread.t_ctl_waitq,
3556 if (rc == -ETIMEDOUT)
3561 com = lfsck_component_find(lfsck, req->lr_active);
3562 if (likely(com != NULL)) {
3563 rc = com->lc_ops->lfsck_query(env, com, req, rep,
3565 lfsck_component_put(env, com);
3574 lfsck_instance_put(env, lfsck);
3577 EXPORT_SYMBOL(lfsck_query);
3579 int lfsck_register_namespace(const struct lu_env *env, struct dt_device *key,
3580 struct ldlm_namespace *ns)
3582 struct lfsck_instance *lfsck;
3585 lfsck = lfsck_instance_find(key, true, false);
3586 if (likely(lfsck != NULL)) {
3587 lfsck->li_namespace = ns;
3588 lfsck_instance_put(env, lfsck);
3594 EXPORT_SYMBOL(lfsck_register_namespace);
3596 int lfsck_register(const struct lu_env *env, struct dt_device *key,
3597 struct dt_device *next, struct obd_device *obd,
3598 lfsck_out_notify notify, void *notify_data, bool master)
3600 struct lfsck_instance *lfsck;
3601 struct dt_object *root = NULL;
3602 struct dt_object *obj = NULL;
3603 struct lu_fid *fid = &lfsck_env_info(env)->lti_fid;
3607 lfsck = lfsck_instance_find(key, false, false);
3608 if (unlikely(lfsck != NULL))
3611 OBD_ALLOC_PTR(lfsck);
3615 mutex_init(&lfsck->li_mutex);
3616 spin_lock_init(&lfsck->li_lock);
3617 INIT_LIST_HEAD(&lfsck->li_link);
3618 INIT_LIST_HEAD(&lfsck->li_list_scan);
3619 INIT_LIST_HEAD(&lfsck->li_list_dir);
3620 INIT_LIST_HEAD(&lfsck->li_list_double_scan);
3621 INIT_LIST_HEAD(&lfsck->li_list_idle);
3622 INIT_LIST_HEAD(&lfsck->li_list_lmv);
3623 atomic_set(&lfsck->li_ref, 1);
3624 atomic_set(&lfsck->li_double_scan_count, 0);
3625 init_waitqueue_head(&lfsck->li_thread.t_ctl_waitq);
3626 lfsck->li_out_notify = notify;
3627 lfsck->li_out_notify_data = notify_data;
3628 lfsck->li_next = next;
3629 lfsck->li_bottom = key;
3630 lfsck->li_obd = obd;
3632 rc = lfsck_tgt_descs_init(&lfsck->li_ost_descs);
3636 rc = lfsck_tgt_descs_init(&lfsck->li_mdt_descs);
3640 fid->f_seq = FID_SEQ_LOCAL_NAME;
3643 rc = local_oid_storage_init(env, key, fid, &lfsck->li_los);
3647 rc = dt_root_get(env, key, fid);
3651 root = dt_locate(env, key, fid);
3653 GOTO(out, rc = PTR_ERR(root));
3655 if (unlikely(!dt_try_as_dir(env, root)))
3656 GOTO(out, rc = -ENOTDIR);
3658 lfsck->li_local_root_fid = *fid;
3660 lfsck->li_master = 1;
3661 if (lfsck_dev_idx(lfsck) == 0) {
3662 struct lu_fid *pfid = &lfsck_env_info(env)->lti_fid2;
3663 const struct lu_name *cname;
3665 rc = dt_lookup(env, root,
3666 (struct dt_rec *)(&lfsck->li_global_root_fid),
3667 (const struct dt_key *)"ROOT");
3671 obj = dt_locate(env, key, &lfsck->li_global_root_fid);
3673 GOTO(out, rc = PTR_ERR(obj));
3675 if (unlikely(!dt_try_as_dir(env, obj)))
3676 GOTO(out, rc = -ENOTDIR);
3678 rc = dt_lookup(env, obj, (struct dt_rec *)fid,
3679 (const struct dt_key *)dotlustre);
3683 lfsck_object_put(env, obj);
3684 obj = dt_locate(env, key, fid);
3686 GOTO(out, rc = PTR_ERR(obj));
3688 cname = lfsck_name_get_const(env, dotlustre,
3690 rc = lfsck_verify_linkea(env, obj, cname,
3691 &lfsck->li_global_root_fid);
3695 if (unlikely(!dt_try_as_dir(env, obj)))
3696 GOTO(out, rc = -ENOTDIR);
3699 rc = dt_lookup(env, obj, (struct dt_rec *)fid,
3700 (const struct dt_key *)lostfound);
3704 lfsck_object_put(env, obj);
3705 obj = dt_locate(env, key, fid);
3707 GOTO(out, rc = PTR_ERR(obj));
3709 cname = lfsck_name_get_const(env, lostfound,
3711 rc = lfsck_verify_linkea(env, obj, cname, pfid);
3715 lfsck_object_put(env, obj);
3720 fid->f_seq = FID_SEQ_LOCAL_FILE;
3721 fid->f_oid = OTABLE_IT_OID;
3723 obj = dt_locate(env, key, fid);
3725 GOTO(out, rc = PTR_ERR(obj));
3727 rc = obj->do_ops->do_index_try(env, obj, &dt_otable_features);
3731 lfsck->li_obj_oit = obj;
3732 obj = local_file_find_or_create(env, lfsck->li_los, root, LFSCK_DIR,
3733 S_IFDIR | S_IRUGO | S_IWUSR);
3735 GOTO(out, rc = PTR_ERR(obj));
3737 lu_object_get(&obj->do_lu);
3738 lfsck->li_lfsck_dir = obj;
3739 rc = lfsck_bookmark_setup(env, lfsck);
3744 rc = lfsck_fid_init(lfsck);
3748 rc = lfsck_namespace_setup(env, lfsck);
3753 rc = lfsck_layout_setup(env, lfsck);
3757 /* XXX: more LFSCK components initialization to be added here. */
3759 rc = lfsck_instance_add(lfsck);
3761 rc = lfsck_add_target_from_orphan(env, lfsck);
3763 if (obj != NULL && !IS_ERR(obj))
3764 lfsck_object_put(env, obj);
3765 if (root != NULL && !IS_ERR(root))
3766 lfsck_object_put(env, root);
3768 lfsck_instance_cleanup(env, lfsck);
3771 EXPORT_SYMBOL(lfsck_register);
3773 void lfsck_degister(const struct lu_env *env, struct dt_device *key)
3775 struct lfsck_instance *lfsck;
3777 lfsck = lfsck_instance_find(key, false, true);
3779 lfsck_instance_put(env, lfsck);
3781 EXPORT_SYMBOL(lfsck_degister);
3783 int lfsck_add_target(const struct lu_env *env, struct dt_device *key,
3784 struct dt_device *tgt, struct obd_export *exp,
3785 __u32 index, bool for_ost)
3787 struct lfsck_instance *lfsck;
3788 struct lfsck_tgt_desc *ltd;
3799 INIT_LIST_HEAD(<d->ltd_orphan_list);
3800 INIT_LIST_HEAD(<d->ltd_layout_list);
3801 INIT_LIST_HEAD(<d->ltd_layout_phase_list);
3802 INIT_LIST_HEAD(<d->ltd_namespace_list);
3803 INIT_LIST_HEAD(<d->ltd_namespace_phase_list);
3804 atomic_set(<d->ltd_ref, 1);
3805 ltd->ltd_index = index;
3807 spin_lock(&lfsck_instance_lock);
3808 lfsck = __lfsck_instance_find(key, true, false);
3809 if (lfsck == NULL) {
3811 list_add_tail(<d->ltd_orphan_list,
3812 &lfsck_ost_orphan_list);
3814 list_add_tail(<d->ltd_orphan_list,
3815 &lfsck_mdt_orphan_list);
3816 spin_unlock(&lfsck_instance_lock);
3820 spin_unlock(&lfsck_instance_lock);
3822 rc = __lfsck_add_target(env, lfsck, ltd, for_ost, false);
3826 lfsck_instance_put(env, lfsck);
3830 EXPORT_SYMBOL(lfsck_add_target);
3832 void lfsck_del_target(const struct lu_env *env, struct dt_device *key,
3833 struct dt_device *tgt, __u32 index, bool for_ost)
3835 struct lfsck_instance *lfsck;
3836 struct lfsck_tgt_descs *ltds;
3837 struct lfsck_tgt_desc *ltd;
3838 struct list_head *head;
3841 head = &lfsck_ost_orphan_list;
3843 head = &lfsck_mdt_orphan_list;
3845 spin_lock(&lfsck_instance_lock);
3846 list_for_each_entry(ltd, head, ltd_orphan_list) {
3847 if (ltd->ltd_tgt == tgt) {
3848 list_del_init(<d->ltd_orphan_list);
3849 spin_unlock(&lfsck_instance_lock);
3857 lfsck = __lfsck_instance_find(key, true, false);
3858 spin_unlock(&lfsck_instance_lock);
3859 if (unlikely(lfsck == NULL))
3863 ltds = &lfsck->li_ost_descs;
3865 ltds = &lfsck->li_mdt_descs;
3867 down_write(<ds->ltd_rw_sem);
3868 LASSERT(ltds->ltd_tgts_bitmap != NULL);
3870 if (unlikely(index >= ltds->ltd_tgts_bitmap->size))
3873 ltd = lfsck_ltd2tgt(ltds, index);
3874 if (unlikely(ltd == NULL))
3877 LASSERT(ltds->ltd_tgtnr > 0);
3880 cfs_bitmap_clear(ltds->ltd_tgts_bitmap, index);
3881 lfsck_assign_tgt(ltds, NULL, index);
3886 head = &lfsck->li_ost_descs.ltd_orphan;
3888 head = &lfsck->li_mdt_descs.ltd_orphan;
3890 list_for_each_entry(ltd, head, ltd_orphan_list) {
3891 if (ltd->ltd_tgt == tgt) {
3892 list_del_init(<d->ltd_orphan_list);
3898 up_write(<ds->ltd_rw_sem);
3900 spin_lock(<ds->ltd_lock);
3902 spin_unlock(<ds->ltd_lock);
3903 lfsck_stop_notify(env, lfsck, ltds, ltd, LFSCK_TYPE_NAMESPACE);
3904 lfsck_stop_notify(env, lfsck, ltds, ltd, LFSCK_TYPE_LAYOUT);
3908 lfsck_instance_put(env, lfsck);
3910 EXPORT_SYMBOL(lfsck_del_target);
3912 static int __init lfsck_init(void)
3916 INIT_LIST_HEAD(&lfsck_instance_list);
3917 INIT_LIST_HEAD(&lfsck_ost_orphan_list);
3918 INIT_LIST_HEAD(&lfsck_mdt_orphan_list);
3919 lfsck_key_init_generic(&lfsck_thread_key, NULL);
3920 rc = lu_context_key_register(&lfsck_thread_key);
3922 tgt_register_lfsck_in_notify_local(lfsck_in_notify_local);
3923 tgt_register_lfsck_in_notify(lfsck_in_notify);
3924 tgt_register_lfsck_query(lfsck_query);
3930 static void __exit lfsck_exit(void)
3932 struct lfsck_tgt_desc *ltd;
3933 struct lfsck_tgt_desc *next;
3935 LASSERT(list_empty(&lfsck_instance_list));
3937 list_for_each_entry_safe(ltd, next, &lfsck_ost_orphan_list,
3939 list_del_init(<d->ltd_orphan_list);
3943 list_for_each_entry_safe(ltd, next, &lfsck_mdt_orphan_list,
3945 list_del_init(<d->ltd_orphan_list);
3949 lu_context_key_degister(&lfsck_thread_key);
3952 MODULE_AUTHOR("OpenSFS, Inc. <http://www.lustre.org/>");
3953 MODULE_DESCRIPTION("Lustre File System Checker");
3954 MODULE_VERSION(LUSTRE_VERSION_STRING);
3955 MODULE_LICENSE("GPL");
3957 module_init(lfsck_init);
3958 module_exit(lfsck_exit);