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, 2017, 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 <linux/delay.h>
37 #include <lu_object.h>
38 #include <dt_object.h>
39 #include <md_object.h>
40 #include <lustre_fld.h>
41 #include <lustre_lib.h>
42 #include <lustre_net.h>
43 #include <lustre_lfsck.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 LIST_HEAD(lfsck_instance_list);
67 static LIST_HEAD(lfsck_ost_orphan_list);
68 static LIST_HEAD(lfsck_mdt_orphan_list);
69 static DEFINE_SPINLOCK(lfsck_instance_lock);
71 const char *const lfsck_flags_names[] = {
80 const char *const 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 < ARRAY_SIZE(ltds->ltd_tgts_idx); 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;
381 einfo->ei_req_slot = 1;
383 rc = dt_object_lock(env, obj, lh, einfo, policy);
384 /* for regular checks LFSCK doesn't use LDLM locking,
385 * so the state isn't coherent. here we just took LDLM
386 * lock for coherency and it's time to invalidate
389 dt_invalidate(env, obj);
391 rc = ldlm_cli_enqueue_local(env, lfsck->li_namespace, resid,
392 LDLM_IBITS, policy, mode,
393 &flags, ldlm_blocking_ast,
394 ldlm_completion_ast, NULL, NULL,
395 0, LVB_T_NONE, NULL, lh);
398 if (rc == ELDLM_OK) {
401 memset(lh, 0, sizeof(*lh));
409 * Request the specified ibits lock for the given object.
411 * Before the LFSCK modifying on the namespace visible object,
412 * it needs to acquire related ibits ldlm lock.
414 * \param[in] env pointer to the thread context
415 * \param[in] lfsck pointer to the lfsck instance
416 * \param[in] obj pointer to the dt_object to be locked
417 * \param[out] lh pointer to the lock handle
418 * \param[in] bits the bits for the ldlm lock to be acquired
419 * \param[in] mode the mode for the ldlm lock to be acquired
421 * \retval 0 for success
422 * \retval negative error number on failure
424 int lfsck_ibits_lock(const struct lu_env *env, struct lfsck_instance *lfsck,
425 struct dt_object *obj, struct lustre_handle *lh,
426 __u64 bits, enum ldlm_mode mode)
428 struct ldlm_res_id *resid = &lfsck_env_info(env)->lti_resid;
430 LASSERT(!lustre_handle_is_used(lh));
432 fid_build_reg_res_name(lfsck_dto2fid(obj), resid);
433 return __lfsck_ibits_lock(env, lfsck, obj, resid, lh, bits, mode);
437 * Request the remote LOOKUP lock for the given object.
439 * If \a pobj is remote, the LOOKUP lock of \a obj is on the MDT where
440 * \a pobj is, acquire LOOKUP lock there.
442 * \param[in] env pointer to the thread context
443 * \param[in] lfsck pointer to the lfsck instance
444 * \param[in] pobj pointer to parent dt_object
445 * \param[in] obj pointer to the dt_object to be locked
446 * \param[out] lh pointer to the lock handle
447 * \param[in] mode the mode for the ldlm lock to be acquired
449 * \retval 0 for success
450 * \retval negative error number on failure
452 int lfsck_remote_lookup_lock(const struct lu_env *env,
453 struct lfsck_instance *lfsck,
454 struct dt_object *pobj, struct dt_object *obj,
455 struct lustre_handle *lh, enum ldlm_mode mode)
457 struct ldlm_res_id *resid = &lfsck_env_info(env)->lti_resid;
459 LASSERT(!lustre_handle_is_used(lh));
461 fid_build_reg_res_name(lfsck_dto2fid(obj), resid);
462 return __lfsck_ibits_lock(env, lfsck, pobj, resid, lh,
463 MDS_INODELOCK_LOOKUP, mode);
467 * Release the the specified ibits lock.
469 * If the lock has been acquired before, release it
470 * and cleanup the handle. Otherwise, do nothing.
472 * \param[in] lh pointer to the lock handle
473 * \param[in] mode the mode for the ldlm lock to be released
475 void lfsck_ibits_unlock(struct lustre_handle *lh, enum ldlm_mode mode)
477 if (lustre_handle_is_used(lh)) {
478 ldlm_lock_decref(lh, mode);
479 memset(lh, 0, sizeof(*lh));
484 * Request compound ibits locks for the given <obj, name> pairs.
486 * Before the LFSCK modifying on the namespace visible object, it needs to
487 * acquire related ibits ldlm lock. Usually, we can use lfsck_ibits_lock for
488 * the lock purpose. But the simple lfsck_ibits_lock for directory-based
489 * modificationis (such as insert name entry to the directory) may be too
490 * coarse-grained and not efficient.
492 * The lfsck_lock() will request compound ibits locks on the specified
493 * <obj, name> pairs: the PDO (Parallel Directory Operations) ibits (UPDATE)
494 * lock on the directory object, and the regular ibits lock on the name hash.
496 * \param[in] env pointer to the thread context
497 * \param[in] lfsck pointer to the lfsck instance
498 * \param[in] obj pointer to the dt_object to be locked
499 * \param[in] name used for building the PDO lock resource
500 * \param[out] llh pointer to the lfsck_lock_handle
501 * \param[in] bits the bits for the ldlm lock to be acquired
502 * \param[in] mode the mode for the ldlm lock to be acquired
504 * \retval 0 for success
505 * \retval negative error number on failure
507 int lfsck_lock(const struct lu_env *env, struct lfsck_instance *lfsck,
508 struct dt_object *obj, const char *name,
509 struct lfsck_lock_handle *llh, __u64 bits, enum ldlm_mode mode)
511 struct ldlm_res_id *resid = &lfsck_env_info(env)->lti_resid;
514 LASSERT(S_ISDIR(lfsck_object_type(obj)));
515 LASSERT(name != NULL);
516 LASSERT(name[0] != 0);
517 LASSERT(!lustre_handle_is_used(&llh->llh_pdo_lh));
518 LASSERT(!lustre_handle_is_used(&llh->llh_reg_lh));
522 llh->llh_pdo_mode = LCK_EX;
525 llh->llh_pdo_mode = LCK_CW;
528 llh->llh_pdo_mode = LCK_CR;
531 CDEBUG(D_LFSCK, "%s: unexpected PDO lock mode %u on the obj "
532 DFID"\n", lfsck_lfsck2name(lfsck), mode,
533 PFID(lfsck_dto2fid(obj)));
537 fid_build_reg_res_name(lfsck_dto2fid(obj), resid);
538 rc = __lfsck_ibits_lock(env, lfsck, obj, resid, &llh->llh_pdo_lh,
539 MDS_INODELOCK_UPDATE, llh->llh_pdo_mode);
543 llh->llh_reg_mode = mode;
544 resid->name[LUSTRE_RES_ID_HSH_OFF] = ll_full_name_hash(NULL, name,
546 LASSERT(resid->name[LUSTRE_RES_ID_HSH_OFF] != 0);
547 rc = __lfsck_ibits_lock(env, lfsck, obj, resid, &llh->llh_reg_lh,
548 bits, llh->llh_reg_mode);
550 lfsck_ibits_unlock(&llh->llh_pdo_lh, llh->llh_pdo_mode);
556 * Release the the compound ibits locks.
558 * \param[in] llh pointer to the lfsck_lock_handle to be released
560 void lfsck_unlock(struct lfsck_lock_handle *llh)
562 lfsck_ibits_unlock(&llh->llh_reg_lh, llh->llh_reg_mode);
563 lfsck_ibits_unlock(&llh->llh_pdo_lh, llh->llh_pdo_mode);
566 int lfsck_find_mdt_idx_by_fid(const struct lu_env *env,
567 struct lfsck_instance *lfsck,
568 const struct lu_fid *fid)
570 struct seq_server_site *ss = lfsck_dev_site(lfsck);
571 struct lu_seq_range *range = &lfsck_env_info(env)->lti_range;
574 if (unlikely(fid_seq(fid) == FID_SEQ_LOCAL_FILE)) {
575 /* "ROOT" is always on the MDT0. */
576 if (lu_fid_eq(fid, &lfsck->li_global_root_fid))
579 return lfsck_dev_idx(lfsck);
582 fld_range_set_mdt(range);
583 rc = fld_server_lookup(env, ss->ss_server_fld, fid_seq(fid), range);
585 rc = range->lsr_index;
590 const char dot[] = ".";
591 const char dotdot[] = "..";
592 static const char dotlustre[] = ".lustre";
593 static const char lostfound[] = "lost+found";
596 * Remove the name entry from the .lustre/lost+found directory.
598 * No need to care about the object referenced by the name entry,
599 * either the name entry is invalid or redundant, or the referenced
600 * object has been processed or will be handled by others.
602 * \param[in] env pointer to the thread context
603 * \param[in] lfsck pointer to the lfsck instance
604 * \param[in] name the name for the name entry to be removed
606 * \retval 0 for success
607 * \retval negative error number on failure
609 static int lfsck_lpf_remove_name_entry(const struct lu_env *env,
610 struct lfsck_instance *lfsck,
613 struct dt_object *parent = lfsck->li_lpf_root_obj;
614 struct dt_device *dev = lfsck_obj2dev(parent);
616 struct lfsck_lock_handle *llh = &lfsck_env_info(env)->lti_llh;
620 rc = lfsck_lock(env, lfsck, parent, name, llh,
621 MDS_INODELOCK_UPDATE, LCK_PW);
625 th = lfsck_trans_create(env, dev, lfsck);
627 GOTO(unlock, rc = PTR_ERR(th));
629 rc = dt_declare_delete(env, parent, (const struct dt_key *)name, th);
633 rc = dt_declare_ref_del(env, parent, th);
637 rc = dt_trans_start_local(env, dev, th);
641 rc = dt_delete(env, parent, (const struct dt_key *)name, th);
645 dt_write_lock(env, parent, 0);
646 rc = dt_ref_del(env, parent, th);
647 dt_write_unlock(env, parent);
652 dt_trans_stop(env, dev, th);
657 CDEBUG(D_LFSCK, "%s: remove name entry "DFID"/%s: rc = %d\n",
658 lfsck_lfsck2name(lfsck), PFID(lfsck_dto2fid(parent)), name, rc);
663 static int lfsck_create_lpf_local(const struct lu_env *env,
664 struct lfsck_instance *lfsck,
665 struct dt_object *child,
667 struct dt_object_format *dof,
670 struct dt_insert_rec *rec = &lfsck_env_info(env)->lti_dt_rec;
671 struct dt_object *parent = lfsck->li_lpf_root_obj;
672 struct dt_device *dev = lfsck_obj2dev(child);
673 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
674 struct dt_object *bk_obj = lfsck->li_bookmark_obj;
675 const struct lu_fid *cfid = lfsck_dto2fid(child);
676 struct thandle *th = NULL;
677 struct linkea_data ldata = { NULL };
678 struct lu_buf linkea_buf;
679 const struct lu_name *cname;
681 int len = sizeof(struct lfsck_bookmark);
685 cname = lfsck_name_get_const(env, name, strlen(name));
686 rc = linkea_links_new(&ldata, &lfsck_env_info(env)->lti_linkea_buf2,
687 cname, lfsck_dto2fid(parent));
691 th = lfsck_trans_create(env, dev, lfsck);
695 /* 1a. create child */
696 rc = dt_declare_create(env, child, la, NULL, dof, th);
700 if (!dt_try_as_dir(env, child))
701 GOTO(stop, rc = -ENOTDIR);
703 /* 2a. increase child nlink */
704 rc = dt_declare_ref_add(env, child, th);
708 /* 3a. insert dot into child dir */
709 rec->rec_type = S_IFDIR;
711 rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
712 (const struct dt_key *)dot, th);
716 /* 4a. insert dotdot into child dir */
717 rec->rec_fid = &LU_LPF_FID;
718 rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
719 (const struct dt_key *)dotdot, th);
723 /* 5a. insert linkEA for child */
724 lfsck_buf_init(&linkea_buf, ldata.ld_buf->lb_buf,
725 ldata.ld_leh->leh_len);
726 rc = dt_declare_xattr_set(env, child, &linkea_buf,
727 XATTR_NAME_LINK, 0, th);
731 /* 6a. insert name into parent dir */
732 rec->rec_type = S_IFDIR;
734 rc = dt_declare_insert(env, parent, (const struct dt_rec *)rec,
735 (const struct dt_key *)name, th);
739 /* 7a. increase parent nlink */
740 rc = dt_declare_ref_add(env, parent, th);
744 /* 8a. update bookmark */
745 rc = dt_declare_record_write(env, bk_obj,
746 lfsck_buf_get(env, bk, len), 0, th);
750 rc = dt_trans_start_local(env, dev, th);
754 dt_write_lock(env, child, 0);
755 /* 1b. create child */
756 rc = dt_create(env, child, la, NULL, dof, th);
760 /* 2b. increase child nlink */
761 rc = dt_ref_add(env, child, th);
765 /* 3b. insert dot into child dir */
767 rc = dt_insert(env, child, (const struct dt_rec *)rec,
768 (const struct dt_key *)dot, th);
772 /* 4b. insert dotdot into child dir */
773 rec->rec_fid = &LU_LPF_FID;
774 rc = dt_insert(env, child, (const struct dt_rec *)rec,
775 (const struct dt_key *)dotdot, th);
779 /* 5b. insert linkEA for child. */
780 rc = dt_xattr_set(env, child, &linkea_buf,
781 XATTR_NAME_LINK, 0, th);
782 dt_write_unlock(env, child);
786 /* 6b. insert name into parent dir */
788 rc = dt_insert(env, parent, (const struct dt_rec *)rec,
789 (const struct dt_key *)name, th);
793 dt_write_lock(env, parent, 0);
794 /* 7b. increase parent nlink */
795 rc = dt_ref_add(env, parent, th);
796 dt_write_unlock(env, parent);
800 bk->lb_lpf_fid = *cfid;
801 lfsck_bookmark_cpu_to_le(&lfsck->li_bookmark_disk, bk);
803 /* 8b. update bookmark */
804 rc = dt_record_write(env, bk_obj,
805 lfsck_buf_get(env, bk, len), &pos, th);
810 dt_write_unlock(env, child);
813 dt_trans_stop(env, dev, th);
818 static int lfsck_create_lpf_remote(const struct lu_env *env,
819 struct lfsck_instance *lfsck,
820 struct dt_object *child,
822 struct dt_object_format *dof,
825 struct dt_insert_rec *rec = &lfsck_env_info(env)->lti_dt_rec;
826 struct dt_object *parent = lfsck->li_lpf_root_obj;
827 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
828 struct dt_object *bk_obj = lfsck->li_bookmark_obj;
829 const struct lu_fid *cfid = lfsck_dto2fid(child);
830 struct thandle *th = NULL;
831 struct linkea_data ldata = { NULL };
832 struct lu_buf linkea_buf;
833 const struct lu_name *cname;
834 struct dt_device *dev;
836 int len = sizeof(struct lfsck_bookmark);
840 cname = lfsck_name_get_const(env, name, strlen(name));
841 rc = linkea_links_new(&ldata, &lfsck_env_info(env)->lti_linkea_buf2,
842 cname, lfsck_dto2fid(parent));
846 /* Create .lustre/lost+found/MDTxxxx. */
848 /* XXX: Currently, cross-MDT create operation needs to create the child
849 * object firstly, then insert name into the parent directory. For
850 * this case, the child object resides on current MDT (local), but
851 * the parent ".lustre/lost+found" may be on remote MDT. It is not
852 * easy to contain all the sub-modifications orderly within single
855 * To avoid more inconsistency, we split the create operation into
858 * 1) create the child and update the lfsck_bookmark::lb_lpf_fid
860 * 2) insert the name "MDTXXXX" in the parent ".lustre/lost+found"
863 * If 1) done, but 2) failed, then go ahead, the LFSCK will try to
864 * repair such inconsistency when LFSCK run next time. */
866 /* Transaction I: locally */
868 dev = lfsck_obj2dev(child);
869 th = lfsck_trans_create(env, dev, lfsck);
873 /* 1a. create child */
874 rc = dt_declare_create(env, child, la, NULL, dof, th);
878 if (!dt_try_as_dir(env, child))
879 GOTO(stop, rc = -ENOTDIR);
881 /* 2a. increase child nlink */
882 rc = dt_declare_ref_add(env, child, th);
886 /* 3a. insert dot into child dir */
887 rec->rec_type = S_IFDIR;
889 rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
890 (const struct dt_key *)dot, th);
894 /* 4a. insert dotdot into child dir */
895 rec->rec_fid = &LU_LPF_FID;
896 rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
897 (const struct dt_key *)dotdot, th);
901 /* 5a. insert linkEA for child */
902 lfsck_buf_init(&linkea_buf, ldata.ld_buf->lb_buf,
903 ldata.ld_leh->leh_len);
904 rc = dt_declare_xattr_set(env, child, &linkea_buf,
905 XATTR_NAME_LINK, 0, th);
909 /* 6a. update bookmark */
910 rc = dt_declare_record_write(env, bk_obj,
911 lfsck_buf_get(env, bk, len), 0, th);
915 rc = dt_trans_start_local(env, dev, th);
919 dt_write_lock(env, child, 0);
920 /* 1b. create child */
921 rc = dt_create(env, child, la, NULL, dof, th);
925 /* 2b. increase child nlink */
926 rc = dt_ref_add(env, child, th);
930 /* 3b. insert dot into child dir */
931 rec->rec_type = S_IFDIR;
933 rc = dt_insert(env, child, (const struct dt_rec *)rec,
934 (const struct dt_key *)dot, th);
938 /* 4b. insert dotdot into child dir */
939 rec->rec_fid = &LU_LPF_FID;
940 rc = dt_insert(env, child, (const struct dt_rec *)rec,
941 (const struct dt_key *)dotdot, th);
945 /* 5b. insert linkEA for child */
946 rc = dt_xattr_set(env, child, &linkea_buf,
947 XATTR_NAME_LINK, 0, th);
951 bk->lb_lpf_fid = *cfid;
952 lfsck_bookmark_cpu_to_le(&lfsck->li_bookmark_disk, bk);
954 /* 6b. update bookmark */
955 rc = dt_record_write(env, bk_obj,
956 lfsck_buf_get(env, bk, len), &pos, th);
958 dt_write_unlock(env, child);
959 dt_trans_stop(env, dev, th);
963 /* Transaction II: remotely */
965 dev = lfsck_obj2dev(parent);
966 th = lfsck_trans_create(env, dev, lfsck);
971 /* 5a. insert name into parent dir */
973 rc = dt_declare_insert(env, parent, (const struct dt_rec *)rec,
974 (const struct dt_key *)name, th);
978 /* 6a. increase parent nlink */
979 rc = dt_declare_ref_add(env, parent, th);
983 rc = dt_trans_start_local(env, dev, th);
987 /* 5b. insert name into parent dir */
988 rc = dt_insert(env, parent, (const struct dt_rec *)rec,
989 (const struct dt_key *)name, th);
993 dt_write_lock(env, parent, 0);
994 /* 6b. increase parent nlink */
995 rc = dt_ref_add(env, parent, th);
996 dt_write_unlock(env, parent);
1001 dt_write_unlock(env, child);
1003 dt_trans_stop(env, dev, th);
1005 if (rc != 0 && dev == lfsck_obj2dev(parent))
1006 CDEBUG(D_LFSCK, "%s: partially created the object "DFID
1007 "for orphans, but failed to insert the name %s "
1008 "to the .lustre/lost+found/. Such inconsistency "
1009 "will be repaired when LFSCK run next time: rc = %d\n",
1010 lfsck_lfsck2name(lfsck), PFID(cfid), name, rc);
1016 * Create the MDTxxxx directory under /ROOT/.lustre/lost+found/
1018 * The /ROOT/.lustre/lost+found/MDTxxxx/ directory is used for holding
1019 * orphans and other uncertain inconsistent objects found during the
1020 * LFSCK. Such directory will be created by the LFSCK engine on the
1021 * local MDT before the LFSCK scanning.
1023 * \param[in] env pointer to the thread context
1024 * \param[in] lfsck pointer to the lfsck instance
1026 * \retval 0 for success
1027 * \retval negative error number on failure
1029 static int lfsck_create_lpf(const struct lu_env *env,
1030 struct lfsck_instance *lfsck)
1032 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
1033 struct lfsck_thread_info *info = lfsck_env_info(env);
1034 struct lu_fid *cfid = &info->lti_fid2;
1035 struct lu_attr *la = &info->lti_la;
1036 struct dt_object_format *dof = &info->lti_dof;
1037 struct dt_object *parent = lfsck->li_lpf_root_obj;
1038 struct dt_object *child = NULL;
1039 struct lfsck_lock_handle *llh = &info->lti_llh;
1041 int node = lfsck_dev_idx(lfsck);
1045 LASSERT(lfsck->li_master);
1046 LASSERT(parent != NULL);
1047 LASSERT(lfsck->li_lpf_obj == NULL);
1049 snprintf(name, 8, "MDT%04x", node);
1050 rc = lfsck_lock(env, lfsck, parent, name, llh,
1051 MDS_INODELOCK_UPDATE, LCK_PW);
1055 if (fid_is_zero(&bk->lb_lpf_fid)) {
1056 /* There is corner case that: in former LFSCK scanning we have
1057 * created the .lustre/lost+found/MDTxxxx but failed to update
1058 * the lfsck_bookmark::lb_lpf_fid successfully. So need lookup
1059 * it from MDT0 firstly. */
1060 rc = dt_lookup_dir(env, parent, name, cfid);
1061 if (rc != 0 && rc != -ENOENT)
1065 bk->lb_lpf_fid = *cfid;
1066 rc = lfsck_bookmark_store(env, lfsck);
1068 rc = lfsck_fid_alloc(env, lfsck, cfid, true);
1073 *cfid = bk->lb_lpf_fid;
1076 child = lfsck_object_find_bottom_new(env, lfsck, cfid);
1078 GOTO(unlock, rc = PTR_ERR(child));
1080 if (dt_object_exists(child) != 0) {
1081 if (unlikely(!dt_try_as_dir(env, child)))
1084 lfsck->li_lpf_obj = child;
1089 memset(la, 0, sizeof(*la));
1090 la->la_atime = la->la_mtime = la->la_ctime = ktime_get_real_seconds();
1091 la->la_mode = S_IFDIR | S_IRWXU;
1092 la->la_valid = LA_ATIME | LA_MTIME | LA_CTIME | LA_MODE |
1093 LA_UID | LA_GID | LA_TYPE;
1094 memset(dof, 0, sizeof(*dof));
1095 dof->dof_type = dt_mode_to_dft(S_IFDIR);
1098 rc = lfsck_create_lpf_local(env, lfsck, child, la, dof, name);
1100 rc = lfsck_create_lpf_remote(env, lfsck, child, la, dof, name);
1102 lfsck->li_lpf_obj = child;
1108 if (rc != 0 && child != NULL && !IS_ERR(child))
1109 lfsck_object_put(env, child);
1115 * Scan .lustre/lost+found for bad name entries and remove them.
1117 * The valid name entry should be "MDTxxxx", the "xxxx" is the MDT device
1118 * index in the system. Any other formatted name is invalid and should be
1121 * \param[in] env pointer to the thread context
1122 * \param[in] lfsck pointer to the lfsck instance
1124 * \retval 0 for success
1125 * \retval negative error number on failure
1127 static int lfsck_scan_lpf_bad_entries(const struct lu_env *env,
1128 struct lfsck_instance *lfsck)
1130 struct dt_object *parent = lfsck->li_lpf_root_obj;
1131 struct lu_dirent *ent =
1132 (struct lu_dirent *)lfsck_env_info(env)->lti_key;
1133 const struct dt_it_ops *iops = &parent->do_index_ops->dio_it;
1138 it = iops->init(env, parent, LUDA_64BITHASH);
1140 RETURN(PTR_ERR(it));
1142 rc = iops->load(env, it, 0);
1144 rc = iops->next(env, it);
1151 rc = iops->rec(env, it, (struct dt_rec *)ent, LUDA_64BITHASH);
1155 ent->lde_namelen = le16_to_cpu(ent->lde_namelen);
1156 if (name_is_dot_or_dotdot(ent->lde_name, ent->lde_namelen))
1159 /* name length must be strlen("MDTxxxx") */
1160 if (ent->lde_namelen != 7)
1163 if (memcmp(ent->lde_name, "MDT", off) != 0)
1166 while (off < 7 && isxdigit(ent->lde_name[off]))
1172 rc = lfsck_lpf_remove_name_entry(env, lfsck,
1179 rc = iops->next(env, it);
1183 iops->fini(env, it);
1185 RETURN(rc > 0 ? 0 : rc);
1188 static int lfsck_update_lpf_entry(const struct lu_env *env,
1189 struct lfsck_instance *lfsck,
1190 struct dt_object *parent,
1191 struct dt_object *child,
1193 enum lfsck_verify_lpf_types type)
1197 if (type == LVLT_BY_BOOKMARK) {
1198 rc = lfsck_update_name_entry(env, lfsck, parent, name,
1199 lfsck_dto2fid(child), S_IFDIR);
1200 } else /* if (type == LVLT_BY_NAMEENTRY) */ {
1201 lfsck->li_bookmark_ram.lb_lpf_fid = *lfsck_dto2fid(child);
1202 rc = lfsck_bookmark_store(env, lfsck);
1204 CDEBUG(D_LFSCK, "%s: update LPF fid "DFID
1205 " in the bookmark file: rc = %d\n",
1206 lfsck_lfsck2name(lfsck),
1207 PFID(lfsck_dto2fid(child)), rc);
1214 * Check whether the @child back references the @parent.
1217 * 1) The child's FID is stored in the bookmark file. If the child back
1218 * references the parent (LU_LPF_FID object) via its ".." entry, then
1219 * insert the name (MDTxxxx) to the .lustre/lost+found; otherwise, if
1220 * the child back references another parent2, then:
1221 * 1.1) If the parent2 recognizes the child, then update the bookmark file;
1222 * 1.2) Otherwise, the LFSCK cannot know whether there will be parent3 that
1223 * references the child. So keep them there. As the LFSCK processing,
1224 * the parent3 may be found, then when the LFSCK run next time, the
1225 * inconsistency can be repaired.
1227 * 2) The child's FID is stored in the .lustre/lost+found/ sub-directory name
1228 * entry (MDTxxxx). If the child back references the parent (LU_LPF_FID obj)
1229 * via its ".." entry, then update the bookmark file, otherwise, if the child
1230 * back references another parent2, then:
1231 * 2.1) If the parent2 recognizes the child, then remove the sub-directory
1232 * from .lustre/lost+found/;
1233 * 2.2) Otherwise, if the parent2 does not recognizes the child, trust the
1234 * sub-directory name entry and update the child;
1235 * 2.3) Otherwise, if we do not know whether the parent2 recognizes the child
1236 * or not, then keep them there.
1238 * \param[in] env pointer to the thread context
1239 * \param[in] lfsck pointer to the lfsck instance
1240 * \param[in] child pointer to the lost+found sub-directory object
1241 * \param[in] name the name for lost+found sub-directory object
1242 * \param[out] fid pointer to the buffer to hold the FID of the object
1243 * (called it as parent2) that is referenced via the
1244 * child's dotdot entry; it also can be the FID that
1245 * is referenced by the name entry under the parent2.
1246 * \param[in] type to indicate where the child's FID is stored in
1248 * \retval positive number for uncertain inconsistency
1249 * \retval 0 for success
1250 * \retval negative error number on failure
1252 static int lfsck_verify_lpf_pairs(const struct lu_env *env,
1253 struct lfsck_instance *lfsck,
1254 struct dt_object *child, const char *name,
1256 enum lfsck_verify_lpf_types type)
1258 struct dt_object *parent = lfsck->li_lpf_root_obj;
1259 struct lfsck_thread_info *info = lfsck_env_info(env);
1260 char *name2 = info->lti_key;
1261 struct lu_fid *fid2 = &info->lti_fid3;
1262 struct dt_object *parent2 = NULL;
1263 struct lustre_handle lh = { 0 };
1268 rc = dt_lookup_dir(env, child, dotdot, fid);
1272 if (!fid_is_sane(fid))
1273 GOTO(linkea, rc = -EINVAL);
1275 if (lu_fid_eq(fid, &LU_LPF_FID)) {
1276 const struct lu_name *cname;
1278 if (lfsck->li_lpf_obj == NULL) {
1279 lu_object_get(&child->do_lu);
1280 lfsck->li_lpf_obj = child;
1283 cname = lfsck_name_get_const(env, name, strlen(name));
1284 rc = lfsck_verify_linkea(env, lfsck, child, cname, &LU_LPF_FID);
1286 rc = lfsck_update_lpf_entry(env, lfsck, parent, child,
1292 parent2 = lfsck_object_find_bottom(env, lfsck, fid);
1293 if (IS_ERR(parent2))
1294 GOTO(linkea, parent2);
1296 if (!dt_object_exists(parent2)) {
1297 lfsck_object_put(env, parent2);
1299 GOTO(linkea, parent2 = ERR_PTR(-ENOENT));
1302 if (!dt_try_as_dir(env, parent2)) {
1303 lfsck_object_put(env, parent2);
1305 GOTO(linkea, parent2 = ERR_PTR(-ENOTDIR));
1309 /* To prevent rename/unlink race */
1310 rc = lfsck_ibits_lock(env, lfsck, child, &lh,
1311 MDS_INODELOCK_UPDATE, LCK_PR);
1315 dt_read_lock(env, child, 0);
1316 rc = lfsck_links_get_first(env, child, name2, fid2);
1318 dt_read_unlock(env, child);
1319 lfsck_ibits_unlock(&lh, LCK_PR);
1321 GOTO(out_put, rc = 1);
1324 /* It is almost impossible that the bookmark file (or the name entry)
1325 * and the linkEA hit the same data corruption. Trust the linkEA. */
1326 if (lu_fid_eq(fid2, &LU_LPF_FID) && strcmp(name, name2) == 0) {
1327 dt_read_unlock(env, child);
1328 lfsck_ibits_unlock(&lh, LCK_PR);
1331 if (lfsck->li_lpf_obj == NULL) {
1332 lu_object_get(&child->do_lu);
1333 lfsck->li_lpf_obj = child;
1336 /* Update the child's dotdot entry */
1337 rc = lfsck_update_name_entry(env, lfsck, child, dotdot,
1338 &LU_LPF_FID, S_IFDIR);
1340 rc = lfsck_update_lpf_entry(env, lfsck, parent, child,
1346 if (parent2 == NULL || IS_ERR(parent2)) {
1347 dt_read_unlock(env, child);
1348 lfsck_ibits_unlock(&lh, LCK_PR);
1350 GOTO(out_done, rc = 1);
1353 rc = dt_lookup_dir(env, parent2, name2, fid);
1354 dt_read_unlock(env, child);
1355 lfsck_ibits_unlock(&lh, LCK_PR);
1356 if (rc != 0 && rc != -ENOENT)
1359 if (rc == -ENOENT || !lu_fid_eq(fid, lfsck_dto2fid(child))) {
1360 if (type == LVLT_BY_BOOKMARK)
1361 GOTO(out_put, rc = 1);
1363 /* Trust the name entry, update the child's dotdot entry. */
1364 rc = lfsck_update_name_entry(env, lfsck, child, dotdot,
1365 &LU_LPF_FID, S_IFDIR);
1370 if (type == LVLT_BY_BOOKMARK) {
1371 /* Invalid FID record in the bookmark file, reset it. */
1372 fid_zero(&lfsck->li_bookmark_ram.lb_lpf_fid);
1373 rc = lfsck_bookmark_store(env, lfsck);
1375 CDEBUG(D_LFSCK, "%s: reset invalid LPF fid "DFID
1376 " in the bookmark file: rc = %d\n",
1377 lfsck_lfsck2name(lfsck), PFID(lfsck_dto2fid(child)), rc);
1378 } else /* if (type == LVLT_BY_NAMEENTRY) */ {
1379 /* The name entry is wrong, remove it. */
1380 rc = lfsck_lpf_remove_name_entry(env, lfsck, name);
1386 if (parent2 != NULL && !IS_ERR(parent2))
1387 lfsck_object_put(env, parent2);
1394 * Verify the /ROOT/.lustre/lost+found/ directory.
1396 * /ROOT/.lustre/lost+found/ is a special directory to hold the objects that
1397 * the LFSCK does not exactly know how to handle, such as orphans. So before
1398 * the LFSCK scanning the system, the consistency of such directory needs to
1399 * be verified firstly to allow the users to use it during the LFSCK.
1401 * \param[in] env pointer to the thread context
1402 * \param[in] lfsck pointer to the lfsck instance
1404 * \retval positive number for uncertain inconsistency
1405 * \retval 0 for success
1406 * \retval negative error number on failure
1408 int lfsck_verify_lpf(const struct lu_env *env, struct lfsck_instance *lfsck)
1410 struct lfsck_thread_info *info = lfsck_env_info(env);
1411 struct lu_fid *pfid = &info->lti_fid;
1412 struct lu_fid *cfid = &info->lti_fid2;
1413 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
1414 struct dt_object *parent;
1415 /* child1's FID is in the bookmark file. */
1416 struct dt_object *child1 = NULL;
1417 /* child2's FID is in the name entry MDTxxxx. */
1418 struct dt_object *child2 = NULL;
1419 const struct lu_name *cname;
1421 int node = lfsck_dev_idx(lfsck);
1425 LASSERT(lfsck->li_master);
1427 if (lfsck_is_dryrun(lfsck))
1430 if (lfsck->li_lpf_root_obj != NULL)
1434 parent = lfsck_object_find_by_dev(env, lfsck->li_bottom,
1437 struct lfsck_tgt_desc *ltd;
1439 ltd = lfsck_tgt_get(&lfsck->li_mdt_descs, 0);
1440 if (unlikely(ltd == NULL))
1443 parent = lfsck_object_find_by_dev(env, ltd->ltd_tgt,
1449 RETURN(PTR_ERR(parent));
1451 LASSERT(dt_object_exists(parent));
1453 if (unlikely(!dt_try_as_dir(env, parent))) {
1454 lfsck_object_put(env, parent);
1456 GOTO(put, rc = -ENOTDIR);
1459 lfsck->li_lpf_root_obj = parent;
1461 rc = lfsck_scan_lpf_bad_entries(env, lfsck);
1463 CDEBUG(D_LFSCK, "%s: scan .lustre/lost+found/ "
1464 "for bad sub-directories: rc = %d\n",
1465 lfsck_lfsck2name(lfsck), rc);
1469 snprintf(name, 8, "MDT%04x", node);
1470 rc = dt_lookup_dir(env, parent, name, cfid);
1471 if (rc == -ENOENT) {
1479 /* Invalid FID in the name entry, remove the name entry. */
1480 if (!fid_is_norm(cfid)) {
1481 rc = lfsck_lpf_remove_name_entry(env, lfsck, name);
1488 child2 = lfsck_object_find_bottom(env, lfsck, cfid);
1490 GOTO(put, rc = PTR_ERR(child2));
1492 if (unlikely(!dt_object_exists(child2) ||
1493 dt_object_remote(child2)) ||
1494 !S_ISDIR(lfsck_object_type(child2))) {
1495 rc = lfsck_lpf_remove_name_entry(env, lfsck, name);
1502 if (unlikely(!dt_try_as_dir(env, child2)))
1503 GOTO(put, rc = -ENOTDIR);
1506 if (fid_is_zero(&bk->lb_lpf_fid))
1509 if (likely(lu_fid_eq(cfid, &bk->lb_lpf_fid))) {
1510 if (lfsck->li_lpf_obj == NULL) {
1511 lu_object_get(&child2->do_lu);
1512 lfsck->li_lpf_obj = child2;
1515 cname = lfsck_name_get_const(env, name, strlen(name));
1516 rc = lfsck_verify_linkea(env, lfsck, child2, cname,
1522 if (unlikely(!fid_is_norm(&bk->lb_lpf_fid))) {
1523 struct lu_fid tfid = bk->lb_lpf_fid;
1525 /* Invalid FID record in the bookmark file, reset it. */
1526 fid_zero(&bk->lb_lpf_fid);
1527 rc = lfsck_bookmark_store(env, lfsck);
1529 CDEBUG(D_LFSCK, "%s: reset invalid LPF fid "DFID
1530 " in the bookmark file: rc = %d\n",
1531 lfsck_lfsck2name(lfsck), PFID(&tfid), rc);
1539 child1 = lfsck_object_find_bottom(env, lfsck, &bk->lb_lpf_fid);
1540 if (IS_ERR(child1)) {
1545 if (unlikely(!dt_object_exists(child1) ||
1546 dt_object_remote(child1)) ||
1547 !S_ISDIR(lfsck_object_type(child1))) {
1548 /* Invalid FID record in the bookmark file, reset it. */
1549 fid_zero(&bk->lb_lpf_fid);
1550 rc = lfsck_bookmark_store(env, lfsck);
1552 CDEBUG(D_LFSCK, "%s: reset invalid LPF fid "DFID
1553 " in the bookmark file: rc = %d\n",
1554 lfsck_lfsck2name(lfsck),
1555 PFID(lfsck_dto2fid(child1)), rc);
1560 lfsck_object_put(env, child1);
1565 if (unlikely(!dt_try_as_dir(env, child1))) {
1566 lfsck_object_put(env, child1);
1572 rc = lfsck_verify_lpf_pairs(env, lfsck, child1, name, pfid,
1574 if (lu_fid_eq(pfid, &LU_LPF_FID))
1579 rc = lfsck_verify_lpf_pairs(env, lfsck, child2, name,
1580 pfid, LVLT_BY_NAMEENTRY);
1585 if (lfsck->li_lpf_obj != NULL) {
1586 if (unlikely(!dt_try_as_dir(env, lfsck->li_lpf_obj))) {
1587 lfsck_object_put(env, lfsck->li_lpf_obj);
1588 lfsck->li_lpf_obj = NULL;
1591 } else if (rc == 0) {
1592 rc = lfsck_create_lpf(env, lfsck);
1595 if (child2 != NULL && !IS_ERR(child2))
1596 lfsck_object_put(env, child2);
1597 if (child1 != NULL && !IS_ERR(child1))
1598 lfsck_object_put(env, child1);
1603 static int lfsck_fid_init(struct lfsck_instance *lfsck)
1605 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
1606 struct seq_server_site *ss = lfsck_dev_site(lfsck);
1611 if (unlikely(ss == NULL))
1614 OBD_ALLOC_PTR(lfsck->li_seq);
1615 if (lfsck->li_seq == NULL)
1618 OBD_ALLOC(prefix, MAX_OBD_NAME + 7);
1620 GOTO(out, rc = -ENOMEM);
1622 snprintf(prefix, MAX_OBD_NAME + 7, "lfsck-%s", lfsck_lfsck2name(lfsck));
1623 seq_client_init(lfsck->li_seq, NULL, LUSTRE_SEQ_METADATA, prefix,
1625 OBD_FREE(prefix, MAX_OBD_NAME + 7);
1627 if (fid_is_sane(&bk->lb_last_fid))
1628 lfsck->li_seq->lcs_fid = bk->lb_last_fid;
1633 OBD_FREE_PTR(lfsck->li_seq);
1634 lfsck->li_seq = NULL;
1639 static void lfsck_fid_fini(struct lfsck_instance *lfsck)
1641 if (lfsck->li_seq != NULL) {
1642 seq_client_fini(lfsck->li_seq);
1643 OBD_FREE_PTR(lfsck->li_seq);
1644 lfsck->li_seq = NULL;
1648 void lfsck_instance_cleanup(const struct lu_env *env,
1649 struct lfsck_instance *lfsck)
1651 struct ptlrpc_thread *thread = &lfsck->li_thread;
1652 struct lfsck_component *com;
1653 struct lfsck_component *next;
1654 struct lfsck_lmv_unit *llu;
1655 struct lfsck_lmv_unit *llu_next;
1656 struct lfsck_lmv *llmv;
1659 LASSERT(list_empty(&lfsck->li_link));
1660 LASSERT(thread_is_init(thread) || thread_is_stopped(thread));
1662 if (lfsck->li_obj_oit != NULL) {
1663 lfsck_object_put(env, lfsck->li_obj_oit);
1664 lfsck->li_obj_oit = NULL;
1667 list_for_each_entry_safe(llu, llu_next, &lfsck->li_list_lmv, llu_link) {
1668 llmv = &llu->llu_lmv;
1670 LASSERTF(atomic_read(&llmv->ll_ref) == 1,
1671 "still in using: %u\n",
1672 atomic_read(&llmv->ll_ref));
1674 lfsck_lmv_put(env, llmv);
1677 list_for_each_entry_safe(com, next, &lfsck->li_list_scan, lc_link) {
1678 lfsck_component_cleanup(env, com);
1681 LASSERT(list_empty(&lfsck->li_list_dir));
1683 list_for_each_entry_safe(com, next, &lfsck->li_list_double_scan,
1685 lfsck_component_cleanup(env, com);
1688 list_for_each_entry_safe(com, next, &lfsck->li_list_idle, lc_link) {
1689 lfsck_component_cleanup(env, com);
1692 lfsck_tgt_descs_fini(&lfsck->li_ost_descs);
1693 lfsck_tgt_descs_fini(&lfsck->li_mdt_descs);
1695 if (lfsck->li_lfsck_dir != NULL) {
1696 lfsck_object_put(env, lfsck->li_lfsck_dir);
1697 lfsck->li_lfsck_dir = NULL;
1700 if (lfsck->li_bookmark_obj != NULL) {
1701 lfsck_object_put(env, lfsck->li_bookmark_obj);
1702 lfsck->li_bookmark_obj = NULL;
1705 if (lfsck->li_lpf_obj != NULL) {
1706 lfsck_object_put(env, lfsck->li_lpf_obj);
1707 lfsck->li_lpf_obj = NULL;
1710 if (lfsck->li_lpf_root_obj != NULL) {
1711 lfsck_object_put(env, lfsck->li_lpf_root_obj);
1712 lfsck->li_lpf_root_obj = NULL;
1715 if (lfsck->li_los != NULL) {
1716 local_oid_storage_fini(env, lfsck->li_los);
1717 lfsck->li_los = NULL;
1720 lfsck_fid_fini(lfsck);
1722 OBD_FREE_PTR(lfsck);
1725 static inline struct lfsck_instance *
1726 __lfsck_instance_find(struct dt_device *key, bool ref, bool unlink)
1728 struct lfsck_instance *lfsck;
1730 list_for_each_entry(lfsck, &lfsck_instance_list, li_link) {
1731 if (lfsck->li_bottom == key) {
1733 lfsck_instance_get(lfsck);
1735 list_del_init(&lfsck->li_link);
1744 struct lfsck_instance *lfsck_instance_find(struct dt_device *key, bool ref,
1747 struct lfsck_instance *lfsck;
1749 spin_lock(&lfsck_instance_lock);
1750 lfsck = __lfsck_instance_find(key, ref, unlink);
1751 spin_unlock(&lfsck_instance_lock);
1756 static inline int lfsck_instance_add(struct lfsck_instance *lfsck)
1758 struct lfsck_instance *tmp;
1760 spin_lock(&lfsck_instance_lock);
1761 list_for_each_entry(tmp, &lfsck_instance_list, li_link) {
1762 if (lfsck->li_bottom == tmp->li_bottom) {
1763 spin_unlock(&lfsck_instance_lock);
1768 list_add_tail(&lfsck->li_link, &lfsck_instance_list);
1769 spin_unlock(&lfsck_instance_lock);
1773 void lfsck_bits_dump(struct seq_file *m, int bits, const char *const names[],
1778 bool newline = (bits != 0 ? false : true);
1780 seq_printf(m, "%s:%c", prefix, bits != 0 ? ' ' : '\n');
1782 for (i = 0, flag = 1; bits != 0; i++, flag = BIT(i)) {
1785 if (names[i] != NULL) {
1789 seq_printf(m, "%s%c", names[i],
1790 newline ? '\n' : ',');
1799 void lfsck_time_dump(struct seq_file *m, time64_t time, const char *name)
1802 seq_printf(m, "%s_time: N/A\n", name);
1803 seq_printf(m, "time_since_%s: N/A\n", name);
1805 seq_printf(m, "%s_time: %lld\n", name, time);
1806 seq_printf(m, "time_since_%s: %lld seconds\n",
1807 name, ktime_get_real_seconds() - time);
1811 void lfsck_pos_dump(struct seq_file *m, struct lfsck_position *pos,
1814 if (fid_is_zero(&pos->lp_dir_parent)) {
1815 if (pos->lp_oit_cookie == 0) {
1816 seq_printf(m, "%s: N/A, N/A, N/A\n", prefix);
1819 seq_printf(m, "%s: %llu, N/A, N/A\n",
1820 prefix, pos->lp_oit_cookie);
1822 seq_printf(m, "%s: %llu, "DFID", %#llx\n",
1823 prefix, pos->lp_oit_cookie,
1824 PFID(&pos->lp_dir_parent), pos->lp_dir_cookie);
1828 void lfsck_pos_fill(const struct lu_env *env, struct lfsck_instance *lfsck,
1829 struct lfsck_position *pos, bool init)
1831 const struct dt_it_ops *iops = &lfsck->li_obj_oit->do_index_ops->dio_it;
1833 if (unlikely(lfsck->li_di_oit == NULL)) {
1834 memset(pos, 0, sizeof(*pos));
1838 pos->lp_oit_cookie = iops->store(env, lfsck->li_di_oit);
1839 if (!lfsck->li_current_oit_processed && !init)
1840 pos->lp_oit_cookie--;
1842 if (unlikely(pos->lp_oit_cookie == 0))
1843 pos->lp_oit_cookie = 1;
1845 spin_lock(&lfsck->li_lock);
1846 if (lfsck->li_di_dir != NULL) {
1847 struct dt_object *dto = lfsck->li_obj_dir;
1849 pos->lp_dir_cookie = dto->do_index_ops->dio_it.store(env,
1852 if (pos->lp_dir_cookie >= MDS_DIR_END_OFF) {
1853 fid_zero(&pos->lp_dir_parent);
1854 pos->lp_dir_cookie = 0;
1856 pos->lp_dir_parent = *lfsck_dto2fid(dto);
1859 fid_zero(&pos->lp_dir_parent);
1860 pos->lp_dir_cookie = 0;
1862 spin_unlock(&lfsck->li_lock);
1865 bool __lfsck_set_speed(struct lfsck_instance *lfsck, __u32 limit)
1869 if (limit != LFSCK_SPEED_NO_LIMIT) {
1870 if (limit > cfs_time_seconds(1)) {
1871 lfsck->li_sleep_rate = limit / cfs_time_seconds(1);
1872 lfsck->li_sleep_jif = 1;
1874 lfsck->li_sleep_rate = 1;
1875 lfsck->li_sleep_jif = cfs_time_seconds(1) / limit;
1878 lfsck->li_sleep_jif = 0;
1879 lfsck->li_sleep_rate = 0;
1882 if (lfsck->li_bookmark_ram.lb_speed_limit != limit) {
1883 lfsck->li_bookmark_ram.lb_speed_limit = limit;
1890 void lfsck_control_speed(struct lfsck_instance *lfsck)
1892 struct ptlrpc_thread *thread = &lfsck->li_thread;
1894 if (lfsck->li_sleep_jif > 0 &&
1895 lfsck->li_new_scanned >= lfsck->li_sleep_rate) {
1896 wait_event_idle_timeout(thread->t_ctl_waitq,
1897 !thread_is_running(thread),
1898 lfsck->li_sleep_jif);
1899 lfsck->li_new_scanned = 0;
1903 void lfsck_control_speed_by_self(struct lfsck_component *com)
1905 struct lfsck_instance *lfsck = com->lc_lfsck;
1906 struct ptlrpc_thread *thread = &lfsck->li_thread;
1908 if (lfsck->li_sleep_jif > 0 &&
1909 com->lc_new_scanned >= lfsck->li_sleep_rate) {
1910 wait_event_idle_timeout(thread->t_ctl_waitq,
1911 !thread_is_running(thread),
1912 lfsck->li_sleep_jif);
1913 com->lc_new_scanned = 0;
1917 static struct lfsck_thread_args *
1918 lfsck_thread_args_init(struct lfsck_instance *lfsck,
1919 struct lfsck_component *com,
1920 struct lfsck_start_param *lsp)
1922 struct lfsck_thread_args *lta;
1927 return ERR_PTR(-ENOMEM);
1929 rc = lu_env_init(<a->lta_env, LCT_MD_THREAD | LCT_DT_THREAD);
1935 lta->lta_lfsck = lfsck_instance_get(lfsck);
1937 lta->lta_com = lfsck_component_get(com);
1944 void lfsck_thread_args_fini(struct lfsck_thread_args *lta)
1946 if (lta->lta_com != NULL)
1947 lfsck_component_put(<a->lta_env, lta->lta_com);
1948 lfsck_instance_put(<a->lta_env, lta->lta_lfsck);
1949 lu_env_fini(<a->lta_env);
1953 struct lfsck_assistant_data *
1954 lfsck_assistant_data_init(const struct lfsck_assistant_operations *lao,
1957 struct lfsck_assistant_data *lad;
1961 lad->lad_bitmap = CFS_ALLOCATE_BITMAP(BITS_PER_LONG);
1962 if (lad->lad_bitmap == NULL) {
1967 INIT_LIST_HEAD(&lad->lad_req_list);
1968 spin_lock_init(&lad->lad_lock);
1969 INIT_LIST_HEAD(&lad->lad_ost_list);
1970 INIT_LIST_HEAD(&lad->lad_ost_phase1_list);
1971 INIT_LIST_HEAD(&lad->lad_ost_phase2_list);
1972 INIT_LIST_HEAD(&lad->lad_mdt_list);
1973 INIT_LIST_HEAD(&lad->lad_mdt_phase1_list);
1974 INIT_LIST_HEAD(&lad->lad_mdt_phase2_list);
1975 init_waitqueue_head(&lad->lad_thread.t_ctl_waitq);
1977 lad->lad_name = name;
1983 struct lfsck_assistant_object *
1984 lfsck_assistant_object_init(const struct lu_env *env, const struct lu_fid *fid,
1985 const struct lu_attr *attr, __u64 cookie,
1988 struct lfsck_assistant_object *lso;
1992 return ERR_PTR(-ENOMEM);
1994 lso->lso_fid = *fid;
1996 lso->lso_attr = *attr;
1998 atomic_set(&lso->lso_ref, 1);
1999 lso->lso_oit_cookie = cookie;
2001 lso->lso_is_dir = 1;
2007 lfsck_assistant_object_load(const struct lu_env *env,
2008 struct lfsck_instance *lfsck,
2009 struct lfsck_assistant_object *lso)
2011 struct dt_object *obj;
2013 obj = lfsck_object_find_bottom(env, lfsck, &lso->lso_fid);
2017 if (unlikely(!dt_object_exists(obj) || lfsck_is_dead_obj(obj))) {
2019 lfsck_object_put(env, obj);
2021 return ERR_PTR(-ENOENT);
2024 if (lso->lso_is_dir && unlikely(!dt_try_as_dir(env, obj))) {
2025 lfsck_object_put(env, obj);
2027 return ERR_PTR(-ENOTDIR);
2034 * Generic LFSCK asynchronous communication interpretor function.
2035 * The LFSCK RPC reply for both the event notification and status
2036 * querying will be handled here.
2038 * \param[in] env pointer to the thread context
2039 * \param[in] req pointer to the LFSCK request
2040 * \param[in] args pointer to the lfsck_async_interpret_args
2041 * \param[in] rc the result for handling the LFSCK request
2043 * \retval 0 for success
2044 * \retval negative error number on failure
2046 int lfsck_async_interpret_common(const struct lu_env *env,
2047 struct ptlrpc_request *req,
2050 struct lfsck_async_interpret_args *laia = args;
2051 struct lfsck_component *com = laia->laia_com;
2052 struct lfsck_assistant_data *lad = com->lc_data;
2053 struct lfsck_tgt_descs *ltds = laia->laia_ltds;
2054 struct lfsck_tgt_desc *ltd = laia->laia_ltd;
2055 struct lfsck_request *lr = laia->laia_lr;
2057 LASSERT(com->lc_lfsck->li_master);
2059 switch (lr->lr_event) {
2061 if (unlikely(rc == -EINPROGRESS)) {
2062 ltd->ltd_retry_start = 1;
2067 CDEBUG(D_LFSCK, "%s: fail to notify %s %x for %s "
2069 lfsck_lfsck2name(com->lc_lfsck),
2070 (lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
2071 ltd->ltd_index, lad->lad_name, rc);
2073 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2074 struct lfsck_layout *lo = com->lc_file_ram;
2076 if (lr->lr_flags & LEF_TO_OST)
2077 lfsck_lad_set_bitmap(env, com,
2080 lo->ll_flags |= LF_INCOMPLETE;
2082 struct lfsck_namespace *ns = com->lc_file_ram;
2084 /* If some MDT does not join the namespace
2085 * LFSCK, then we cannot know whether there
2086 * is some name entry on such MDT that with
2087 * the referenced MDT-object on this MDT or
2088 * not. So the namespace LFSCK on this MDT
2089 * cannot handle orphan MDT-objects properly.
2090 * So we mark the LFSCK as LF_INCOMPLETE and
2091 * skip orphan MDT-objects handling. */
2092 ns->ln_flags |= LF_INCOMPLETE;
2097 spin_lock(<ds->ltd_lock);
2098 if (ltd->ltd_dead) {
2099 spin_unlock(<ds->ltd_lock);
2103 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2104 struct list_head *list;
2105 struct list_head *phase_list;
2107 if (ltd->ltd_layout_done) {
2108 spin_unlock(<ds->ltd_lock);
2112 if (lr->lr_flags & LEF_TO_OST) {
2113 list = &lad->lad_ost_list;
2114 phase_list = &lad->lad_ost_phase1_list;
2116 list = &lad->lad_mdt_list;
2117 phase_list = &lad->lad_mdt_phase1_list;
2120 if (list_empty(<d->ltd_layout_list))
2121 list_add_tail(<d->ltd_layout_list, list);
2122 if (list_empty(<d->ltd_layout_phase_list))
2123 list_add_tail(<d->ltd_layout_phase_list,
2126 if (ltd->ltd_namespace_done) {
2127 spin_unlock(<ds->ltd_lock);
2131 if (list_empty(<d->ltd_namespace_list))
2132 list_add_tail(<d->ltd_namespace_list,
2133 &lad->lad_mdt_list);
2134 if (list_empty(<d->ltd_namespace_phase_list))
2135 list_add_tail(<d->ltd_namespace_phase_list,
2136 &lad->lad_mdt_phase1_list);
2138 spin_unlock(<ds->ltd_lock);
2141 case LE_PHASE1_DONE:
2142 case LE_PHASE2_DONE:
2144 if (rc != 0 && rc != -EALREADY)
2145 CDEBUG(D_LFSCK, "%s: fail to notify %s %x for %s: "
2146 "event = %d, rc = %d\n",
2147 lfsck_lfsck2name(com->lc_lfsck),
2148 (lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
2149 ltd->ltd_index, lad->lad_name, lr->lr_event, rc);
2152 struct lfsck_reply *reply;
2153 struct list_head *list;
2154 struct list_head *phase_list;
2156 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2157 list = <d->ltd_layout_list;
2158 phase_list = <d->ltd_layout_phase_list;
2160 list = <d->ltd_namespace_list;
2161 phase_list = <d->ltd_namespace_phase_list;
2165 if (lr->lr_flags & LEF_QUERY_ALL) {
2166 lfsck_reset_ltd_status(ltd, com->lc_type);
2170 spin_lock(<ds->ltd_lock);
2171 list_del_init(phase_list);
2172 list_del_init(list);
2173 spin_unlock(<ds->ltd_lock);
2177 reply = req_capsule_server_get(&req->rq_pill,
2179 if (reply == NULL) {
2181 CDEBUG(D_LFSCK, "%s: invalid query reply for %s: "
2182 "rc = %d\n", lfsck_lfsck2name(com->lc_lfsck),
2185 if (lr->lr_flags & LEF_QUERY_ALL) {
2186 lfsck_reset_ltd_status(ltd, com->lc_type);
2190 spin_lock(<ds->ltd_lock);
2191 list_del_init(phase_list);
2192 list_del_init(list);
2193 spin_unlock(<ds->ltd_lock);
2197 if (lr->lr_flags & LEF_QUERY_ALL) {
2198 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2199 ltd->ltd_layout_status = reply->lr_status;
2200 ltd->ltd_layout_repaired = reply->lr_repaired;
2202 ltd->ltd_namespace_status = reply->lr_status;
2203 ltd->ltd_namespace_repaired =
2209 switch (reply->lr_status) {
2210 case LS_SCANNING_PHASE1:
2212 case LS_SCANNING_PHASE2:
2213 spin_lock(<ds->ltd_lock);
2214 list_del_init(phase_list);
2215 if (ltd->ltd_dead) {
2216 spin_unlock(<ds->ltd_lock);
2220 if (com->lc_type == LFSCK_TYPE_LAYOUT) {
2221 if (ltd->ltd_layout_done) {
2222 spin_unlock(<ds->ltd_lock);
2226 if (lr->lr_flags & LEF_TO_OST)
2227 list_add_tail(phase_list,
2228 &lad->lad_ost_phase2_list);
2230 list_add_tail(phase_list,
2231 &lad->lad_mdt_phase2_list);
2233 if (ltd->ltd_namespace_done) {
2234 spin_unlock(<ds->ltd_lock);
2238 list_add_tail(phase_list,
2239 &lad->lad_mdt_phase2_list);
2241 spin_unlock(<ds->ltd_lock);
2244 spin_lock(<ds->ltd_lock);
2245 list_del_init(phase_list);
2246 list_del_init(list);
2247 spin_unlock(<ds->ltd_lock);
2253 CDEBUG(D_LFSCK, "%s: unexpected event: rc = %d\n",
2254 lfsck_lfsck2name(com->lc_lfsck), lr->lr_event);
2258 if (!laia->laia_shared) {
2260 lfsck_component_put(env, com);
2266 static void lfsck_interpret(const struct lu_env *env,
2267 struct lfsck_instance *lfsck,
2268 struct ptlrpc_request *req, void *args, int result)
2270 struct lfsck_async_interpret_args *laia = args;
2271 struct lfsck_component *com;
2273 LASSERT(laia->laia_com == NULL);
2274 LASSERT(laia->laia_shared);
2276 spin_lock(&lfsck->li_lock);
2277 list_for_each_entry(com, &lfsck->li_list_scan, lc_link) {
2278 laia->laia_com = com;
2279 lfsck_async_interpret_common(env, req, laia, result);
2282 list_for_each_entry(com, &lfsck->li_list_double_scan, lc_link) {
2283 laia->laia_com = com;
2284 lfsck_async_interpret_common(env, req, laia, result);
2286 spin_unlock(&lfsck->li_lock);
2289 static int lfsck_stop_notify(const struct lu_env *env,
2290 struct lfsck_instance *lfsck,
2291 struct lfsck_tgt_descs *ltds,
2292 struct lfsck_tgt_desc *ltd, __u16 type)
2294 struct lfsck_component *com;
2298 LASSERT(lfsck->li_master);
2300 spin_lock(&lfsck->li_lock);
2301 com = __lfsck_component_find(lfsck, type, &lfsck->li_list_scan);
2303 com = __lfsck_component_find(lfsck, type,
2304 &lfsck->li_list_double_scan);
2306 lfsck_component_get(com);
2307 spin_unlock(&lfsck->li_lock);
2310 struct lfsck_thread_info *info = lfsck_env_info(env);
2311 struct lfsck_async_interpret_args *laia = &info->lti_laia;
2312 struct lfsck_request *lr = &info->lti_lr;
2313 struct lfsck_assistant_data *lad = com->lc_data;
2314 struct list_head *list;
2315 struct list_head *phase_list;
2316 struct ptlrpc_request_set *set;
2318 set = ptlrpc_prep_set();
2320 lfsck_component_put(env, com);
2325 if (type == LFSCK_TYPE_LAYOUT) {
2326 list = <d->ltd_layout_list;
2327 phase_list = <d->ltd_layout_phase_list;
2329 list = <d->ltd_namespace_list;
2330 phase_list = <d->ltd_namespace_phase_list;
2333 spin_lock(<ds->ltd_lock);
2334 if (list_empty(list)) {
2335 LASSERT(list_empty(phase_list));
2336 spin_unlock(<ds->ltd_lock);
2337 ptlrpc_set_destroy(set);
2342 list_del_init(phase_list);
2343 list_del_init(list);
2344 spin_unlock(<ds->ltd_lock);
2346 memset(lr, 0, sizeof(*lr));
2347 lr->lr_index = lfsck_dev_idx(lfsck);
2348 lr->lr_event = LE_PEER_EXIT;
2349 lr->lr_active = type;
2350 lr->lr_status = LS_CO_PAUSED;
2351 if (ltds == &lfsck->li_ost_descs)
2352 lr->lr_flags = LEF_TO_OST;
2354 memset(laia, 0, sizeof(*laia));
2355 laia->laia_com = com;
2356 laia->laia_ltds = ltds;
2357 atomic_inc(<d->ltd_ref);
2358 laia->laia_ltd = ltd;
2361 rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
2362 lfsck_async_interpret_common,
2363 laia, LFSCK_NOTIFY);
2365 CDEBUG(D_LFSCK, "%s: fail to notify %s %x for "
2366 "co-stop for %s: rc = %d\n",
2367 lfsck_lfsck2name(lfsck),
2368 (lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
2369 ltd->ltd_index, lad->lad_name, rc);
2372 rc = ptlrpc_set_wait(env, set);
2375 ptlrpc_set_destroy(set);
2376 lfsck_component_put(env, com);
2382 static int lfsck_async_interpret(const struct lu_env *env,
2383 struct ptlrpc_request *req,
2386 struct lfsck_async_interpret_args *laia = args;
2387 struct lfsck_instance *lfsck;
2389 lfsck = container_of(laia->laia_ltds, struct lfsck_instance,
2391 lfsck_interpret(env, lfsck, req, laia, rc);
2392 lfsck_tgt_put(laia->laia_ltd);
2393 if (rc != 0 && laia->laia_result != -EALREADY)
2394 laia->laia_result = rc;
2399 int lfsck_async_request(const struct lu_env *env, struct obd_export *exp,
2400 struct lfsck_request *lr,
2401 struct ptlrpc_request_set *set,
2402 ptlrpc_interpterer_t interpreter,
2403 void *args, int request)
2405 struct lfsck_async_interpret_args *laia;
2406 struct ptlrpc_request *req;
2407 struct lfsck_request *tmp;
2408 struct req_format *format;
2413 format = &RQF_LFSCK_NOTIFY;
2416 format = &RQF_LFSCK_QUERY;
2419 CDEBUG(D_LFSCK, "%s: unknown async request %d: rc = %d\n",
2420 exp->exp_obd->obd_name, request, -EINVAL);
2424 req = ptlrpc_request_alloc(class_exp2cliimp(exp), format);
2428 rc = ptlrpc_request_pack(req, LUSTRE_OBD_VERSION, request);
2430 ptlrpc_request_free(req);
2435 tmp = req_capsule_client_get(&req->rq_pill, &RMF_LFSCK_REQUEST);
2437 ptlrpc_request_set_replen(req);
2439 laia = ptlrpc_req_async_args(laia, req);
2440 *laia = *(struct lfsck_async_interpret_args *)args;
2441 if (laia->laia_com != NULL)
2442 lfsck_component_get(laia->laia_com);
2443 req->rq_interpret_reply = interpreter;
2444 req->rq_allow_intr = 1;
2445 req->rq_no_delay = 1;
2446 ptlrpc_set_add_req(set, req);
2451 int lfsck_query_all(const struct lu_env *env, struct lfsck_component *com)
2453 struct lfsck_thread_info *info = lfsck_env_info(env);
2454 struct lfsck_request *lr = &info->lti_lr;
2455 struct lfsck_async_interpret_args *laia = &info->lti_laia;
2456 struct lfsck_instance *lfsck = com->lc_lfsck;
2457 struct lfsck_tgt_descs *ltds = &lfsck->li_mdt_descs;
2458 struct lfsck_tgt_desc *ltd;
2459 struct ptlrpc_request_set *set;
2464 memset(lr, 0, sizeof(*lr));
2465 lr->lr_event = LE_QUERY;
2466 lr->lr_active = com->lc_type;
2467 lr->lr_flags = LEF_QUERY_ALL;
2469 memset(laia, 0, sizeof(*laia));
2470 laia->laia_com = com;
2473 set = ptlrpc_prep_set();
2478 laia->laia_ltds = ltds;
2479 down_read(<ds->ltd_rw_sem);
2480 cfs_foreach_bit(ltds->ltd_tgts_bitmap, idx) {
2481 ltd = lfsck_tgt_get(ltds, idx);
2482 LASSERT(ltd != NULL);
2484 laia->laia_ltd = ltd;
2485 up_read(<ds->ltd_rw_sem);
2486 rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
2487 lfsck_async_interpret_common,
2490 struct lfsck_assistant_data *lad = com->lc_data;
2492 CDEBUG(D_LFSCK, "%s: Fail to query %s %x for stat %s: "
2493 "rc = %d\n", lfsck_lfsck2name(lfsck),
2494 (lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
2495 ltd->ltd_index, lad->lad_name, rc);
2496 lfsck_reset_ltd_status(ltd, com->lc_type);
2499 down_read(<ds->ltd_rw_sem);
2501 up_read(<ds->ltd_rw_sem);
2503 if (com->lc_type == LFSCK_TYPE_LAYOUT && !(lr->lr_flags & LEF_TO_OST)) {
2504 ltds = &lfsck->li_ost_descs;
2505 lr->lr_flags |= LEF_TO_OST;
2509 rc = ptlrpc_set_wait(env, set);
2510 ptlrpc_set_destroy(set);
2515 int lfsck_start_assistant(const struct lu_env *env, struct lfsck_component *com,
2516 struct lfsck_start_param *lsp)
2518 struct lfsck_instance *lfsck = com->lc_lfsck;
2519 struct lfsck_assistant_data *lad = com->lc_data;
2520 struct ptlrpc_thread *mthread = &lfsck->li_thread;
2521 struct ptlrpc_thread *athread = &lad->lad_thread;
2522 struct lfsck_thread_args *lta;
2523 struct task_struct *task;
2527 lad->lad_assistant_status = 0;
2528 lad->lad_post_result = 0;
2530 lad->lad_advance_lock = false;
2531 thread_set_flags(athread, 0);
2533 lta = lfsck_thread_args_init(lfsck, com, lsp);
2535 RETURN(PTR_ERR(lta));
2537 task = kthread_run(lfsck_assistant_engine, lta, lad->lad_name);
2540 CERROR("%s: cannot start LFSCK assistant thread for %s: "
2541 "rc = %d\n", lfsck_lfsck2name(lfsck), lad->lad_name, rc);
2542 lfsck_thread_args_fini(lta);
2544 wait_event_idle(mthread->t_ctl_waitq,
2545 thread_is_running(athread) ||
2546 thread_is_stopped(athread) ||
2547 !thread_is_starting(mthread));
2548 if (unlikely(!thread_is_starting(mthread)))
2549 /* stopped by race */
2551 else if (unlikely(!thread_is_running(athread)))
2552 rc = lad->lad_assistant_status;
2560 int lfsck_checkpoint_generic(const struct lu_env *env,
2561 struct lfsck_component *com)
2563 struct lfsck_assistant_data *lad = com->lc_data;
2564 struct ptlrpc_thread *mthread = &com->lc_lfsck->li_thread;
2565 struct ptlrpc_thread *athread = &lad->lad_thread;
2567 wait_event_idle(mthread->t_ctl_waitq,
2568 list_empty(&lad->lad_req_list) ||
2569 !thread_is_running(mthread) ||
2570 thread_is_stopped(athread));
2572 if (!thread_is_running(mthread) || thread_is_stopped(athread))
2573 return LFSCK_CHECKPOINT_SKIP;
2578 void lfsck_post_generic(const struct lu_env *env,
2579 struct lfsck_component *com, int *result)
2581 struct lfsck_assistant_data *lad = com->lc_data;
2582 struct ptlrpc_thread *athread = &lad->lad_thread;
2583 struct ptlrpc_thread *mthread = &com->lc_lfsck->li_thread;
2585 lad->lad_post_result = *result;
2587 set_bit(LAD_EXIT, &lad->lad_flags);
2588 set_bit(LAD_TO_POST, &lad->lad_flags);
2590 CDEBUG(D_LFSCK, "%s: waiting for assistant to do %s post, rc = %d\n",
2591 lfsck_lfsck2name(com->lc_lfsck), lad->lad_name, *result);
2593 wake_up(&athread->t_ctl_waitq);
2594 wait_event_idle(mthread->t_ctl_waitq,
2595 (*result > 0 && list_empty(&lad->lad_req_list)) ||
2596 thread_is_stopped(athread));
2598 if (lad->lad_assistant_status < 0)
2599 *result = lad->lad_assistant_status;
2601 CDEBUG(D_LFSCK, "%s: the assistant has done %s post, rc = %d\n",
2602 lfsck_lfsck2name(com->lc_lfsck), lad->lad_name, *result);
2605 int lfsck_double_scan_generic(const struct lu_env *env,
2606 struct lfsck_component *com, int status)
2608 struct lfsck_assistant_data *lad = com->lc_data;
2609 struct ptlrpc_thread *mthread = &com->lc_lfsck->li_thread;
2610 struct ptlrpc_thread *athread = &lad->lad_thread;
2612 if (status != LS_SCANNING_PHASE2)
2613 set_bit(LAD_EXIT, &lad->lad_flags);
2615 set_bit(LAD_TO_DOUBLE_SCAN, &lad->lad_flags);
2617 CDEBUG(D_LFSCK, "%s: waiting for assistant to do %s double_scan, "
2619 lfsck_lfsck2name(com->lc_lfsck), lad->lad_name, status);
2621 wake_up(&athread->t_ctl_waitq);
2622 wait_event_idle(mthread->t_ctl_waitq,
2623 test_bit(LAD_IN_DOUBLE_SCAN, &lad->lad_flags) ||
2624 thread_is_stopped(athread));
2626 CDEBUG(D_LFSCK, "%s: the assistant has done %s double_scan, "
2627 "status %d\n", lfsck_lfsck2name(com->lc_lfsck), lad->lad_name,
2628 lad->lad_assistant_status);
2630 if (lad->lad_assistant_status < 0)
2631 return lad->lad_assistant_status;
2636 void lfsck_quit_generic(const struct lu_env *env,
2637 struct lfsck_component *com)
2639 struct lfsck_assistant_data *lad = com->lc_data;
2640 struct ptlrpc_thread *mthread = &com->lc_lfsck->li_thread;
2641 struct ptlrpc_thread *athread = &lad->lad_thread;
2643 set_bit(LAD_EXIT, &lad->lad_flags);
2644 wake_up(&athread->t_ctl_waitq);
2645 wait_event_idle(mthread->t_ctl_waitq,
2646 thread_is_init(athread) ||
2647 thread_is_stopped(athread));
2650 int lfsck_load_one_trace_file(const struct lu_env *env,
2651 struct lfsck_component *com,
2652 struct dt_object *parent,
2653 struct dt_object **child,
2654 const struct dt_index_features *ft,
2655 const char *name, bool reset)
2657 struct lfsck_instance *lfsck = com->lc_lfsck;
2658 struct dt_object *obj;
2662 if (*child != NULL) {
2664 const struct dt_it_ops *iops;
2665 struct lu_fid *fid = &lfsck_env_info(env)->lti_fid3;
2671 rc = obj->do_ops->do_index_try(env, obj, ft);
2673 /* unlink by force */
2676 iops = &obj->do_index_ops->dio_it;
2677 it = iops->init(env, obj, 0);
2679 /* unlink by force */
2683 rc = iops->get(env, it, (const struct dt_key *)fid);
2685 rc = iops->next(env, it);
2688 iops->fini(env, it);
2690 /* "rc > 0" means the index file is empty. */
2694 /* The old index is not empty, remove it firstly. */
2695 rc = local_object_unlink(env, lfsck->li_bottom, parent, name);
2696 CDEBUG_LIMIT(rc ? D_ERROR : D_LFSCK,
2697 "%s: unlink lfsck sub trace file %s: rc = %d\n",
2698 lfsck_lfsck2name(com->lc_lfsck), name, rc);
2703 lfsck_object_put(env, *child);
2710 obj = local_index_find_or_create(env, lfsck->li_los, parent, name,
2711 S_IFREG | S_IRUGO | S_IWUSR, ft);
2713 RETURN(PTR_ERR(obj));
2715 rc = obj->do_ops->do_index_try(env, obj, ft);
2717 lfsck_object_put(env, obj);
2718 CDEBUG(D_LFSCK, "%s: LFSCK fail to load "
2719 "sub trace file %s: rc = %d\n",
2720 lfsck_lfsck2name(com->lc_lfsck), name, rc);
2728 int lfsck_load_sub_trace_files(const struct lu_env *env,
2729 struct lfsck_component *com,
2730 const struct dt_index_features *ft,
2731 const char *prefix, bool reset)
2733 char *name = lfsck_env_info(env)->lti_key;
2734 struct lfsck_sub_trace_obj *lsto;
2738 for (i = 0, rc = 0, lsto = &com->lc_sub_trace_objs[0];
2739 i < LFSCK_STF_COUNT && rc == 0; i++, lsto++) {
2740 snprintf(name, NAME_MAX, "%s_%02d", prefix, i);
2741 rc = lfsck_load_one_trace_file(env, com,
2742 com->lc_lfsck->li_lfsck_dir,
2743 &lsto->lsto_obj, ft, name, reset);
2749 /* external interfaces */
2750 int lfsck_get_speed(char *buf, struct dt_device *key)
2753 struct lfsck_instance *lfsck;
2757 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2761 lfsck = lfsck_instance_find(key, true, false);
2763 rc = sprintf(buf, "%u\n",
2764 lfsck->li_bookmark_ram.lb_speed_limit);
2765 lfsck_instance_put(&env, lfsck);
2774 EXPORT_SYMBOL(lfsck_get_speed);
2776 int lfsck_set_speed(struct dt_device *key, __u32 val)
2779 struct lfsck_instance *lfsck;
2783 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2787 lfsck = lfsck_instance_find(key, true, false);
2788 if (likely(lfsck != NULL)) {
2789 mutex_lock(&lfsck->li_mutex);
2790 if (__lfsck_set_speed(lfsck, val))
2791 rc = lfsck_bookmark_store(&env, lfsck);
2792 mutex_unlock(&lfsck->li_mutex);
2793 lfsck_instance_put(&env, lfsck);
2802 EXPORT_SYMBOL(lfsck_set_speed);
2804 int lfsck_get_windows(char *buf, struct dt_device *key)
2807 struct lfsck_instance *lfsck;
2811 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2815 lfsck = lfsck_instance_find(key, true, false);
2816 if (likely(lfsck != NULL)) {
2817 rc = sprintf(buf, "%u\n",
2818 lfsck->li_bookmark_ram.lb_async_windows);
2819 lfsck_instance_put(&env, lfsck);
2828 EXPORT_SYMBOL(lfsck_get_windows);
2830 int lfsck_set_windows(struct dt_device *key, unsigned int val)
2833 struct lfsck_instance *lfsck;
2837 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2841 lfsck = lfsck_instance_find(key, true, false);
2842 if (likely(lfsck != NULL)) {
2843 if (val < 1 || val > LFSCK_ASYNC_WIN_MAX) {
2844 CWARN("%s: invalid async windows size that may "
2845 "cause memory issues. The valid range is "
2847 lfsck_lfsck2name(lfsck), LFSCK_ASYNC_WIN_MAX);
2849 } else if (lfsck->li_bookmark_ram.lb_async_windows != val) {
2850 mutex_lock(&lfsck->li_mutex);
2851 lfsck->li_bookmark_ram.lb_async_windows = val;
2852 rc = lfsck_bookmark_store(&env, lfsck);
2853 mutex_unlock(&lfsck->li_mutex);
2855 lfsck_instance_put(&env, lfsck);
2864 EXPORT_SYMBOL(lfsck_set_windows);
2866 int lfsck_dump(struct seq_file *m, struct dt_device *key, enum lfsck_type type)
2869 struct lfsck_instance *lfsck;
2870 struct lfsck_component *com;
2874 rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
2878 lfsck = lfsck_instance_find(key, true, false);
2879 if (likely(lfsck != NULL)) {
2880 com = lfsck_component_find(lfsck, type);
2881 if (likely(com != NULL)) {
2882 com->lc_ops->lfsck_dump(&env, com, m);
2883 lfsck_component_put(&env, com);
2888 lfsck_instance_put(&env, lfsck);
2897 EXPORT_SYMBOL(lfsck_dump);
2899 static int lfsck_stop_all(const struct lu_env *env,
2900 struct lfsck_instance *lfsck,
2901 struct lfsck_stop *stop)
2903 struct lfsck_thread_info *info = lfsck_env_info(env);
2904 struct lfsck_request *lr = &info->lti_lr;
2905 struct lfsck_async_interpret_args *laia = &info->lti_laia;
2906 struct ptlrpc_request_set *set;
2907 struct lfsck_tgt_descs *ltds = &lfsck->li_mdt_descs;
2908 struct lfsck_tgt_desc *ltd;
2909 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
2915 LASSERT(stop->ls_flags & LPF_BROADCAST);
2917 set = ptlrpc_prep_set();
2918 if (unlikely(set == NULL))
2921 memset(lr, 0, sizeof(*lr));
2922 lr->lr_event = LE_STOP;
2923 lr->lr_index = lfsck_dev_idx(lfsck);
2924 lr->lr_status = stop->ls_status;
2925 lr->lr_version = bk->lb_version;
2926 lr->lr_active = LFSCK_TYPES_ALL;
2927 lr->lr_param = stop->ls_flags;
2929 memset(laia, 0, sizeof(*laia));
2930 laia->laia_ltds = ltds;
2932 laia->laia_shared = 1;
2934 down_read(<ds->ltd_rw_sem);
2935 cfs_foreach_bit(ltds->ltd_tgts_bitmap, idx) {
2936 ltd = lfsck_tgt_get(ltds, idx);
2937 LASSERT(ltd != NULL);
2939 laia->laia_ltd = ltd;
2940 rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
2941 lfsck_async_interpret, laia,
2944 lfsck_interpret(env, lfsck, NULL, laia, rc);
2946 CERROR("%s: cannot notify MDT %x for LFSCK stop: "
2947 "rc = %d\n", lfsck_lfsck2name(lfsck), idx, rc);
2951 up_read(<ds->ltd_rw_sem);
2953 rc = ptlrpc_set_wait(env, set);
2954 ptlrpc_set_destroy(set);
2957 rc = laia->laia_result;
2959 if (rc == -EALREADY)
2963 CERROR("%s: fail to stop LFSCK on some MDTs: rc = %d\n",
2964 lfsck_lfsck2name(lfsck), rc);
2966 RETURN(rc != 0 ? rc : rc1);
2969 static int lfsck_start_all(const struct lu_env *env,
2970 struct lfsck_instance *lfsck,
2971 struct lfsck_start *start)
2973 struct lfsck_thread_info *info = lfsck_env_info(env);
2974 struct lfsck_request *lr = &info->lti_lr;
2975 struct lfsck_async_interpret_args *laia = &info->lti_laia;
2976 struct ptlrpc_request_set *set;
2977 struct lfsck_tgt_descs *ltds = &lfsck->li_mdt_descs;
2978 struct lfsck_tgt_desc *ltd;
2979 struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
2985 LASSERT(start->ls_flags & LPF_BROADCAST);
2987 memset(lr, 0, sizeof(*lr));
2988 lr->lr_event = LE_START;
2989 lr->lr_index = lfsck_dev_idx(lfsck);
2990 lr->lr_speed = bk->lb_speed_limit;
2991 lr->lr_version = bk->lb_version;
2992 lr->lr_active = start->ls_active;
2993 lr->lr_param = start->ls_flags;
2994 lr->lr_async_windows = bk->lb_async_windows;
2995 lr->lr_valid = LSV_SPEED_LIMIT | LSV_ERROR_HANDLE | LSV_DRYRUN |
2996 LSV_ASYNC_WINDOWS | LSV_CREATE_OSTOBJ |
2999 memset(laia, 0, sizeof(*laia));
3000 laia->laia_ltds = ltds;
3002 laia->laia_shared = 1;
3005 set = ptlrpc_prep_set();
3009 down_read(<ds->ltd_rw_sem);
3010 cfs_foreach_bit(ltds->ltd_tgts_bitmap, idx) {
3011 ltd = lfsck_tgt_get(ltds, idx);
3012 LASSERT(ltd != NULL);
3014 if (retry && !ltd->ltd_retry_start) {
3019 laia->laia_ltd = ltd;
3020 ltd->ltd_retry_start = 0;
3021 ltd->ltd_layout_done = 0;
3022 ltd->ltd_namespace_done = 0;
3023 ltd->ltd_synced_failures = 0;
3024 rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
3025 lfsck_async_interpret, laia,
3028 lfsck_interpret(env, lfsck, NULL, laia, rc);
3030 CERROR("%s: cannot notify MDT %x for LFSCK "
3031 "start, failout: rc = %d\n",
3032 lfsck_lfsck2name(lfsck), idx, rc);
3036 up_read(<ds->ltd_rw_sem);
3039 ptlrpc_set_destroy(set);
3044 rc = ptlrpc_set_wait(env, set);
3045 ptlrpc_set_destroy(set);
3048 rc = laia->laia_result;
3050 if (unlikely(rc == -EINPROGRESS)) {
3052 schedule_timeout_interruptible(cfs_time_seconds(1));
3053 set_current_state(TASK_RUNNING);
3054 if (!signal_pending(current) &&
3055 thread_is_running(&lfsck->li_thread))
3062 struct lfsck_stop *stop = &info->lti_stop;
3064 CERROR("%s: cannot start LFSCK on some MDTs, "
3065 "stop all: rc = %d\n",
3066 lfsck_lfsck2name(lfsck), rc);
3067 if (rc != -EALREADY) {
3068 stop->ls_status = LS_FAILED;
3069 stop->ls_flags = LPF_ALL_TGT | LPF_BROADCAST;
3070 lfsck_stop_all(env, lfsck, stop);
3077 int lfsck_start(const struct lu_env *env, struct dt_device *key,
3078 struct lfsck_start_param *lsp)
3080 struct lfsck_start *start = lsp->lsp_start;
3081 struct lfsck_instance *lfsck;
3082 struct lfsck_bookmark *bk;
3083 struct ptlrpc_thread *thread;
3084 struct lfsck_component *com;
3085 struct lfsck_thread_args *lta;
3086 struct task_struct *task;
3087 struct lfsck_tgt_descs *ltds;
3088 struct lfsck_tgt_desc *ltd;
3099 lfsck = lfsck_instance_find(key, true, false);
3100 if (unlikely(lfsck == NULL))
3103 if (unlikely(lfsck->li_stopping))
3104 GOTO(put, rc = -ENXIO);
3106 /* System is not ready, try again later. */
3107 if (unlikely(lfsck->li_namespace == NULL ||
3108 lfsck_dev_site(lfsck)->ss_server_fld == NULL))
3109 GOTO(put, rc = -EINPROGRESS);
3111 /* start == NULL means auto trigger paused LFSCK. */
3113 if (list_empty(&lfsck->li_list_scan) ||
3114 OBD_FAIL_CHECK(OBD_FAIL_LFSCK_NO_AUTO))
3116 } else if (start->ls_flags & LPF_BROADCAST && !lfsck->li_master) {
3117 CERROR("%s: only allow to specify '-A | -o' via MDS\n",
3118 lfsck_lfsck2name(lfsck));
3120 GOTO(put, rc = -EPERM);
3123 bk = &lfsck->li_bookmark_ram;
3124 thread = &lfsck->li_thread;
3125 mutex_lock(&lfsck->li_mutex);
3126 spin_lock(&lfsck->li_lock);
3127 if (unlikely(thread_is_stopping(thread))) {
3128 /* Someone is stopping the LFSCK. */
3129 spin_unlock(&lfsck->li_lock);
3130 GOTO(out, rc = -EBUSY);
3133 if (!thread_is_init(thread) && !thread_is_stopped(thread)) {
3135 if (unlikely(start == NULL)) {
3136 spin_unlock(&lfsck->li_lock);
3140 while (start->ls_active != 0) {
3141 if (!(type & start->ls_active)) {
3146 com = __lfsck_component_find(lfsck, type,
3147 &lfsck->li_list_scan);
3149 com = __lfsck_component_find(lfsck, type,
3150 &lfsck->li_list_double_scan);
3156 if (com->lc_ops->lfsck_join != NULL) {
3157 rc = com->lc_ops->lfsck_join( env, com, lsp);
3158 if (rc != 0 && rc != -EALREADY)
3161 start->ls_active &= ~type;
3164 spin_unlock(&lfsck->li_lock);
3167 spin_unlock(&lfsck->li_lock);
3169 lfsck->li_status = 0;
3170 lfsck->li_oit_over = 0;
3171 lfsck->li_start_unplug = 0;
3172 lfsck->li_drop_dryrun = 0;
3173 lfsck->li_new_scanned = 0;
3175 /* For auto trigger. */
3179 start->ls_version = bk->lb_version;
3181 if (start->ls_active != 0) {
3182 struct lfsck_component *next;
3184 if (start->ls_active == LFSCK_TYPES_ALL)
3185 start->ls_active = LFSCK_TYPES_SUPPORTED;
3187 if (start->ls_active & ~LFSCK_TYPES_SUPPORTED) {
3188 start->ls_active &= ~LFSCK_TYPES_SUPPORTED;
3189 GOTO(out, rc = -ENOTSUPP);
3192 list_for_each_entry_safe(com, next,
3193 &lfsck->li_list_scan, lc_link) {
3194 if (!(com->lc_type & start->ls_active)) {
3195 rc = com->lc_ops->lfsck_post(env, com, 0,
3202 while (start->ls_active != 0) {
3203 if (type & start->ls_active) {
3204 com = __lfsck_component_find(lfsck, type,
3205 &lfsck->li_list_idle);