+ GOTO(out, rc = 0);
+ }
+
+ lfsck_ibits_unlock(lh, LCK_EX);
+ /* Create the lost parent as an orphan. */
+ rc = lfsck_namespace_create_orphan(env, com, parent);
+ if (rc >= 0)
+ /* Add the missing name entry to the parent. */
+ rc = lfsck_namespace_insert_normal(env, com, parent,
+ child, cname->ln_name);
+
+ GOTO(out, rc);
+ }
+
+ /* The unique linkEA entry with bad parent will be handled as orphan. */
+ if (unlikely(!dt_try_as_dir(env, parent))) {
+ if (!lustre_handle_is_used(lh) && retry != NULL)
+ *retry = true;
+ else
+ rc = lfsck_namespace_dsd_orphan(env, com, child,
+ pfid, lh);
+
+ GOTO(out, rc);
+ }
+
+ rc = dt_lookup(env, parent, (struct dt_rec *)tfid,
+ (const struct dt_key *)cname->ln_name, BYPASS_CAPA);
+ if (rc == -ENOENT) {
+ if (!lustre_handle_is_used(lh) && retry != NULL) {
+ *retry = true;
+
+ GOTO(out, rc = 0);
+ }
+
+ lfsck_ibits_unlock(lh, LCK_EX);
+ /* Add the missing name entry back to the namespace. */
+ rc = lfsck_namespace_insert_normal(env, com, parent, child,
+ cname->ln_name);
+
+ GOTO(out, rc);
+ }
+
+ if (rc != 0)
+ GOTO(out, rc);
+
+ /* XXX: The name entry references another MDT-object that may be
+ * created by the LFSCK for repairing dangling name entry.
+ * There will be another patch for further processing. */
+ if (!lu_fid_eq(tfid, cfid)) {
+ if (!lustre_handle_is_used(lh) && retry != NULL)
+ *retry = true;
+ else
+ rc = lfsck_namespace_dsd_orphan(env, com, child,
+ pfid, lh);
+
+ GOTO(out, rc);
+ }
+
+ /* The ".." name entry is wrong, update it. */
+ if (!lu_fid_eq(pfid, lfsck_dto2fid(parent))) {
+ if (!lustre_handle_is_used(lh) && retry != NULL) {
+ *retry = true;
+
+ GOTO(out, rc = 0);
+ }
+
+ *type = LNIT_UNMATCHED_PAIRS;
+ rc = lfsck_namespace_repair_unmatched_pairs(env, com, child,
+ lfsck_dto2fid(parent), cname);
+ }
+
+ GOTO(out, rc);
+
+out:
+ if (parent != NULL && !IS_ERR(parent))
+ lfsck_object_put(env, parent);
+
+ return rc;
+}
+
+/**
+ * Double Scan Directory object for single linkEA entry case.
+ *
+ * The given @child has multiple linkEA entries. There is at most one linkEA
+ * entry will be valid, all the others will be removed. Firstly, the function
+ * will try to find out the linkEA entry for which the name entry exists under
+ * the given parent (@pfid). If there is no linkEA entry that matches the given
+ * ".." name entry, then tries to find out the first linkEA entry that both the
+ * parent and the name entry exist to rebuild a new ".." name entry.
+ *
+ * \param[in] env pointer to the thread context
+ * \param[in] com pointer to the lfsck component
+ * \param[in] child pointer to the directory to be double scanned
+ * \param[in] pfid the FID corresponding to the ".." entry
+ * \param[in] ldata pointer to the linkEA data for the given @child
+ * \param[in,out] lh ldlm lock handler for the given @child
+ * \param[out] type to tell the caller what the inconsistency is
+ * \param[in] lpf true if the ".." entry is under lost+found/MDTxxxx/
+ *
+ * \retval positive number for repaired cases
+ * \retval 0 if nothing to be repaired
+ * \retval negative error number on failure
+ */
+static int
+lfsck_namespace_dsd_multiple(const struct lu_env *env,
+ struct lfsck_component *com,
+ struct dt_object *child,
+ const struct lu_fid *pfid,
+ struct linkea_data *ldata,
+ struct lustre_handle *lh,
+ enum lfsck_namespace_inconsistency_type *type,
+ bool lpf)
+{
+ struct lfsck_thread_info *info = lfsck_env_info(env);
+ struct lu_name *cname = &info->lti_name;
+ const struct lu_fid *cfid = lfsck_dto2fid(child);
+ struct lu_fid *tfid = &info->lti_fid3;
+ struct lu_fid *pfid2 = &info->lti_fid4;
+ struct lfsck_instance *lfsck = com->lc_lfsck;
+ struct dt_object *parent = NULL;
+ struct linkea_data ldata_new = { 0 };
+ int rc = 0;
+ bool once = true;
+ ENTRY;
+
+again:
+ while (ldata->ld_lee != NULL) {
+ lfsck_namespace_unpack_linkea_entry(ldata, cname, tfid,
+ info->lti_key);
+ /* Drop repeated linkEA entries. */
+ lfsck_namespace_filter_linkea_entry(ldata, cname, tfid, true);
+ /* Drop invalid linkEA entry. */
+ if (!fid_is_sane(tfid)) {
+ linkea_del_buf(ldata, cname);
+ continue;
+ }
+
+ /* If current dotdot is the .lustre/lost+found/MDTxxxx/,
+ * then it is possible that: the directry object has ever
+ * been lost, but its name entry was there. In the former
+ * LFSCK run, during the first-stage scanning, the LFSCK
+ * found the dangling name entry, but it did not recreate
+ * the lost object, and when moved to the second-stage
+ * scanning, some children objects of the lost directory
+ * object were found, then the LFSCK recreated such lost
+ * directory object as an orphan.
+ *
+ * When the LFSCK runs again, if the dangling name is still
+ * there, the LFSCK should move the orphan directory object
+ * back to the normal namespace. */
+ if (!lpf && !lu_fid_eq(pfid, tfid) && once) {
+ linkea_next_entry(ldata);
+ continue;
+ }
+
+ parent = lfsck_object_find_bottom(env, lfsck, tfid);
+ if (IS_ERR(parent))
+ RETURN(PTR_ERR(parent));
+
+ if (!dt_object_exists(parent)) {
+ lfsck_object_put(env, parent);
+ if (ldata->ld_leh->leh_reccount > 1) {
+ /* If it is NOT the last linkEA entry, then
+ * there is still other chance to make the
+ * child to be visible via other parent, then
+ * remove this linkEA entry. */
+ linkea_del_buf(ldata, cname);
+ continue;
+ }
+
+ break;
+ }
+
+ /* The linkEA entry with bad parent will be removed. */
+ if (unlikely(!dt_try_as_dir(env, parent))) {
+ lfsck_object_put(env, parent);
+ linkea_del_buf(ldata, cname);
+ continue;
+ }
+
+ rc = dt_lookup(env, parent, (struct dt_rec *)tfid,
+ (const struct dt_key *)cname->ln_name,
+ BYPASS_CAPA);
+ *pfid2 = *lfsck_dto2fid(parent);
+ lfsck_object_put(env, parent);
+ if (rc == -ENOENT) {
+ linkea_next_entry(ldata);
+ continue;
+ }
+
+ if (rc != 0)
+ RETURN(rc);
+
+ if (lu_fid_eq(tfid, cfid)) {
+ if (!lu_fid_eq(pfid, pfid2)) {
+ *type = LNIT_UNMATCHED_PAIRS;
+ rc = lfsck_namespace_repair_unmatched_pairs(env,
+ com, child, pfid2, cname);
+
+ RETURN(rc);
+ }
+
+ /* It is the most common case that we find the
+ * name entry corresponding to the linkEA entry
+ * that matches the ".." name entry. */
+ rc = linkea_data_new(&ldata_new, &info->lti_big_buf);
+ if (rc != 0)
+ RETURN(rc);
+
+ rc = linkea_add_buf(&ldata_new, cname, pfid2);
+ if (rc != 0)
+ RETURN(rc);
+
+ rc = lfsck_namespace_rebuild_linkea(env, com, child,
+ &ldata_new);
+
+ /* XXX: there will be other patch. */
+
+ RETURN(rc);
+ }
+
+ /* XXX: The name entry references another MDT-object that
+ * may be created by the LFSCK for repairing dangling
+ * name entry. There will be another patch for further
+ * processing. */
+ linkea_del_buf(ldata, cname);
+ }
+
+ if (ldata->ld_leh->leh_reccount == 1) {
+ rc = lfsck_namespace_dsd_single(env, com, child, pfid, ldata,
+ lh, type, NULL);
+
+ RETURN(rc);
+ }
+
+ /* All linkEA entries are invalid and removed, then handle the @child
+ * as an orphan.*/
+ if (ldata->ld_leh->leh_reccount == 0) {
+ rc = lfsck_namespace_dsd_orphan(env, com, child, pfid, lh);
+
+ RETURN(rc);
+ }
+
+ linkea_first_entry(ldata);
+ /* If the dangling name entry for the orphan directory object has
+ * been remvoed, then just check whether the directory object is
+ * still under the .lustre/lost+found/MDTxxxx/ or not. */
+ if (lpf) {
+ lpf = false;
+ goto again;
+ }
+
+ /* There is no linkEA entry that matches the ".." name entry. Find
+ * the first linkEA entry that both parent and name entry exist to
+ * rebuild a new ".." name entry. */
+ if (once) {
+ once = false;
+ goto again;
+ }
+
+ RETURN(rc);
+}
+
+/**
+ * Double scan the directory object for namespace LFSCK.
+ *
+ * This function will verify the <parent, child> pairs in the namespace tree:
+ * the parent references the child via some name entry that should be in the
+ * child's linkEA entry, the child should back references the parent via its
+ * ".." name entry.
+ *
+ * The LFSCK will scan every linkEA entry in turn until find out the first
+ * matched pairs. If found, then all other linkEA entries will be dropped.
+ * If all the linkEA entries cannot match the ".." name entry, then there
+ * are serveral possible cases:
+ *
+ * 1) If there is only one linkEA entry, then trust it as long as the PFID
+ * in the linkEA entry is valid.
+ *
+ * 2) If there are multiple linkEA entries, then try to find the linkEA
+ * that matches the ".." name entry. If found, then all other entries
+ * are invalid; otherwise, it is quite possible that the ".." name entry
+ * is corrupted. Under such case, the LFSCK will rebuild the ".." name
+ * entry according to the first valid linkEA entry (both the parent and
+ * the name entry should exist).
+ *
+ * 3) If the directory object has no (valid) linkEA entry, then the
+ * directory object will be handled as pure orphan and inserted
+ * in the .lustre/lost+found/MDTxxxx/ with the name:
+ * ${self_FID}-${PFID}-D-${conflict_version}
+ *
+ * \param[in] env pointer to the thread context
+ * \param[in] com pointer to the lfsck component
+ * \param[in] child pointer to the directory object to be handled
+ * \param[in] flags to indicate the specical checking on the @child
+ *
+ * \retval positive number for repaired cases
+ * \retval 0 if nothing to be repaired
+ * \retval negative error number on failure
+ */
+static int lfsck_namespace_double_scan_dir(const struct lu_env *env,
+ struct lfsck_component *com,
+ struct dt_object *child, __u8 flags)
+{
+ struct lfsck_thread_info *info = lfsck_env_info(env);
+ const struct lu_fid *cfid = lfsck_dto2fid(child);
+ struct lu_fid *pfid = &info->lti_fid2;
+ struct lfsck_namespace *ns = com->lc_file_ram;
+ struct lfsck_instance *lfsck = com->lc_lfsck;
+ struct lustre_handle lh = { 0 };
+ struct linkea_data ldata = { 0 };
+ bool unknown = false;
+ bool lpf = false;
+ bool retry = false;
+ enum lfsck_namespace_inconsistency_type type = LNIT_BAD_LINKEA;
+ int rc = 0;
+ ENTRY;
+
+ LASSERT(!dt_object_remote(child));
+
+ if (!(lfsck->li_bookmark_ram.lb_param & LPF_ALL_TGT)) {
+ CDEBUG(D_LFSCK, "%s: some MDT(s) maybe NOT take part in the"
+ "the namespace LFSCK, then the LFSCK cannot guarantee"
+ "all the name entries have been verified in first-stage"
+ "scanning. So have to skip orphan related handling for"
+ "the directory object "DFID" with remote name entry\n",
+ lfsck_lfsck2name(lfsck), PFID(cfid));
+
+ RETURN(0);
+ }
+
+ if (unlikely(!dt_try_as_dir(env, child)))
+ GOTO(out, rc = -ENOTDIR);
+
+ /* We only take ldlm lock on the @child when required. When the
+ * logic comes here for the first time, it is always false. */
+ if (0) {
+
+lock:
+ rc = lfsck_ibits_lock(env, lfsck, child, &lh,
+ MDS_INODELOCK_UPDATE |
+ MDS_INODELOCK_XATTR, LCK_EX);
+ if (rc != 0)
+ GOTO(out, rc);
+ }
+
+ dt_read_lock(env, child, 0);
+ if (unlikely(lfsck_is_dead_obj(child))) {
+ dt_read_unlock(env, child);
+
+ GOTO(out, rc = 0);
+ }
+
+ rc = dt_lookup(env, child, (struct dt_rec *)pfid,
+ (const struct dt_key *)dotdot, BYPASS_CAPA);
+ if (rc != 0) {
+ if (rc != -ENOENT && rc != -ENODATA && rc != -EINVAL) {
+ dt_read_unlock(env, child);
+
+ GOTO(out, rc);
+ }
+
+ if (!lustre_handle_is_used(&lh)) {
+ dt_read_unlock(env, child);
+ goto lock;
+ }
+
+ fid_zero(pfid);
+ } else if (lfsck->li_lpf_obj != NULL &&
+ lu_fid_eq(pfid, lfsck_dto2fid(lfsck->li_lpf_obj))) {
+ lpf = true;
+ }
+
+ rc = lfsck_links_read(env, child, &ldata);
+ dt_read_unlock(env, child);
+ if (rc != 0) {
+ if (rc != -ENODATA && rc != -EINVAL)
+ GOTO(out, rc);
+
+ if (!lustre_handle_is_used(&lh))
+ goto lock;
+
+ if (rc == -EINVAL && !fid_is_zero(pfid)) {
+ /* Remove the corrupted linkEA. */
+ rc = lfsck_namespace_links_remove(env, com, child);
+ if (rc == 0)
+ /* Here, because of the crashed linkEA, we
+ * cannot know whether there is some parent
+ * that references the child directory via
+ * some name entry or not. So keep it there,
+ * when the LFSCK run next time, if there is
+ * some parent that references this object,
+ * then the LFSCK can rebuild the linkEA;
+ * otherwise, this object will be handled
+ * as orphan as above. */
+ unknown = true;
+ } else {
+ /* 1. If we have neither ".." nor linkEA,
+ * then it is an orphan.
+ *
+ * 2. If we only have the ".." name entry,
+ * but no parent references this child
+ * directory, then handle it as orphan. */
+ lfsck_ibits_unlock(&lh, LCK_EX);
+ snprintf(info->lti_tmpbuf, sizeof(info->lti_tmpbuf),
+ "-"DFID, PFID(pfid));
+ rc = lfsck_namespace_insert_orphan(env, com, child,
+ info->lti_tmpbuf, "D", NULL);
+ }
+
+ GOTO(out, rc);
+ }
+
+ linkea_first_entry(&ldata);
+ /* This is the most common case: the object has unique linkEA entry. */
+ if (ldata.ld_leh->leh_reccount == 1) {
+ rc = lfsck_namespace_dsd_single(env, com, child, pfid, &ldata,
+ &lh, &type, &retry);
+ if (retry) {
+ LASSERT(!lustre_handle_is_used(&lh));
+
+ retry = false;
+ goto lock;
+ }
+
+ GOTO(out, rc);
+ }
+
+ if (!lustre_handle_is_used(&lh))
+ goto lock;
+
+ if (unlikely(ldata.ld_leh->leh_reccount == 0)) {
+ rc = lfsck_namespace_dsd_orphan(env, com, child, pfid, &lh);
+
+ GOTO(out, rc);
+ }
+
+ /* When we come here, the cases usually like that:
+ * 1) The directory object has a corrupted linkEA entry. During the
+ * first-stage scanning, the LFSCK cannot know such corruption,
+ * then it appends the right linkEA entry according to the found
+ * name entry after the bad one.
+ *
+ * 2) The directory object has a right linkEA entry. During the
+ * first-stage scanning, the LFSCK finds some bad name entry,
+ * but the LFSCK cannot aware that at that time, then it adds
+ * the bad linkEA entry for further processing. */
+ rc = lfsck_namespace_dsd_multiple(env, com, child, pfid, &ldata,
+ &lh, &type, lpf);
+
+ GOTO(out, rc);
+
+out:
+ lfsck_ibits_unlock(&lh, LCK_EX);
+ if (rc > 0) {
+ switch (type) {
+ case LNIT_BAD_LINKEA:
+ ns->ln_linkea_repaired++;
+ break;
+ case LNIT_UNMATCHED_PAIRS:
+ ns->ln_unmatched_pairs_repaired++;
+ break;
+ default:
+ break;
+ }
+ }
+
+ if (unknown)
+ ns->ln_unknown_inconsistency++;
+
+ return rc;
+}
+
+/**
+ * Double scan the MDT-object for namespace LFSCK.
+ *
+ * If the MDT-object contains invalid or repeated linkEA entries, then drop
+ * those entries from the linkEA; if the linkEA becomes empty or the object
+ * has no linkEA, then it is an orphan and will be added into the directory
+ * .lustre/lost+found/MDTxxxx/; if the remote parent is lost, then recreate
+ * the remote parent; if the name entry corresponding to some linkEA entry
+ * is lost, then add the name entry back to the namespace.
+ *
+ * \param[in] env pointer to the thread context
+ * \param[in] com pointer to the lfsck component
+ * \param[in] child pointer to the dt_object to be handled
+ * \param[in] flags some hints to indicate how the @child should be handled
+ *
+ * \retval positive number for repaired cases
+ * \retval 0 if nothing to be repaired
+ * \retval negative error number on failure
+ */
+static int lfsck_namespace_double_scan_one(const struct lu_env *env,
+ struct lfsck_component *com,
+ struct dt_object *child, __u8 flags)
+{
+ struct lfsck_thread_info *info = lfsck_env_info(env);
+ struct lu_attr *la = &info->lti_la;
+ struct lu_name *cname = &info->lti_name;
+ struct lu_fid *pfid = &info->lti_fid;
+ struct lu_fid *cfid = &info->lti_fid2;
+ struct lfsck_instance *lfsck = com->lc_lfsck;
+ struct lfsck_namespace *ns = com->lc_file_ram;
+ struct dt_object *parent = NULL;
+ struct linkea_data ldata = { 0 };
+ bool repaired = false;
+ int count = 0;
+ int rc;
+ ENTRY;
+
+ dt_read_lock(env, child, 0);
+ if (unlikely(lfsck_is_dead_obj(child))) {
+ dt_read_unlock(env, child);
+
+ RETURN(0);
+ }
+
+ if (S_ISDIR(lfsck_object_type(child))) {
+ dt_read_unlock(env, child);
+ rc = lfsck_namespace_double_scan_dir(env, com, child, flags);
+
+ RETURN(rc);
+ }
+
+ rc = lfsck_links_read(env, child, &ldata);
+ dt_read_unlock(env, child);
+ if (rc != 0)
+ GOTO(out, rc);
+
+ linkea_first_entry(&ldata);
+ while (ldata.ld_lee != NULL) {
+ lfsck_namespace_unpack_linkea_entry(&ldata, cname, pfid,
+ info->lti_key);
+ rc = lfsck_namespace_filter_linkea_entry(&ldata, cname, pfid,
+ false);
+ /* Found repeated linkEA entries */
+ if (rc > 0) {
+ rc = lfsck_namespace_shrink_linkea(env, com, child,
+ &ldata, cname, pfid, false);
+ if (rc < 0)
+ GOTO(out, rc);
+
+ if (rc == 0)
+ continue;
+
+ repaired = true;
+
+ /* fall through */
+ }
+
+ /* Invalid PFID in the linkEA entry. */
+ if (!fid_is_sane(pfid)) {
+ rc = lfsck_namespace_shrink_linkea(env, com, child,
+ &ldata, cname, pfid, true);
+ if (rc < 0)
+ GOTO(out, rc);
+
+ if (rc > 0)
+ repaired = true;
+
+ continue;
+ }
+
+ parent = lfsck_object_find_bottom(env, lfsck, pfid);
+ if (IS_ERR(parent))
+ GOTO(out, rc = PTR_ERR(parent));
+
+ if (!dt_object_exists(parent)) {
+ if (ldata.ld_leh->leh_reccount > 1) {
+ /* If it is NOT the last linkEA entry, then
+ * there is still other chance to make the
+ * child to be visible via other parent, then
+ * remove this linkEA entry. */
+ rc = lfsck_namespace_shrink_linkea(env, com,
+ child, &ldata, cname, pfid, true);
+ } else {
+ /* Create the lost parent as an orphan. */
+ rc = lfsck_namespace_create_orphan(env, com,
+ parent);
+ if (rc < 0) {
+ lfsck_object_put(env, parent);
+
+ GOTO(out, rc);
+ }
+
+ if (rc > 0)
+ repaired = true;
+
+ /* Add the missing name entry to the parent. */
+ rc = lfsck_namespace_insert_normal(env, com,
+ parent, child, cname->ln_name);
+ linkea_next_entry(&ldata);
+ }
+
+ lfsck_object_put(env, parent);
+ if (rc < 0)
+ GOTO(out, rc);
+
+ if (rc > 0)
+ repaired = true;
+
+ continue;
+ }
+
+ /* The linkEA entry with bad parent will be removed. */
+ if (unlikely(!dt_try_as_dir(env, parent))) {
+ lfsck_object_put(env, parent);
+ rc = lfsck_namespace_shrink_linkea(env, com, child,
+ &ldata, cname, pfid, true);
+ if (rc < 0)
+ GOTO(out, rc);
+
+ if (rc > 0)
+ repaired = true;
+
+ continue;
+ }
+
+ rc = dt_lookup(env, parent, (struct dt_rec *)cfid,
+ (const struct dt_key *)cname->ln_name,
+ BYPASS_CAPA);
+ if (rc != 0 && rc != -ENOENT) {
+ lfsck_object_put(env, parent);
+
+ GOTO(out, rc);
+ }
+
+ if (rc == 0) {
+ lfsck_object_put(env, parent);
+ if (lu_fid_eq(cfid, lfsck_dto2fid(child))) {
+ /* It is the most common case that we
+ * find the name entry corresponding
+ * to the linkEA entry. */
+ linkea_next_entry(&ldata);
+ } else {
+ /* XXX: The name entry references another
+ * MDT-object that may be created by
+ * the LFSCK for repairing dangling
+ * name entry. There will be another
+ * patch for further processing. */
+ rc = lfsck_namespace_shrink_linkea(env, com,
+ child, &ldata, cname, pfid, true);
+ if (rc < 0)
+ GOTO(out, rc);
+
+ if (rc > 0)
+ repaired = true;
+ }
+
+ continue;
+ }
+
+ rc = dt_attr_get(env, child, la, BYPASS_CAPA);
+ if (rc != 0)
+ GOTO(out, rc);
+
+ /* If there is no name entry in the parent dir and the object
+ * link count is less than the linkea entries count, then the
+ * linkea entry should be removed. */
+ if (ldata.ld_leh->leh_reccount > la->la_nlink) {
+ rc = lfsck_namespace_shrink_linkea_cond(env, com,
+ parent, child, &ldata, cname, pfid);
+ lfsck_object_put(env, parent);
+ if (rc < 0)
+ GOTO(out, rc);
+
+ if (rc > 0)
+ repaired = true;
+
+ continue;
+ }
+
+ /* Add the missing name entry back to the namespace. */
+ rc = lfsck_namespace_insert_normal(env, com, parent, child,
+ cname->ln_name);
+ lfsck_object_put(env, parent);
+ if (rc < 0)
+ GOTO(out, rc);
+
+ if (rc > 0)
+ repaired = true;
+
+ linkea_next_entry(&ldata);
+ }
+
+ GOTO(out, rc = 0);
+
+out:
+ if (rc < 0 && rc != -ENODATA)
+ return rc;
+
+ if (rc == 0) {
+ LASSERT(ldata.ld_leh != NULL);
+
+ count = ldata.ld_leh->leh_reccount;
+ }
+
+ if (count == 0) {
+ /* If the child becomes orphan, then insert it into
+ * the global .lustre/lost+found/MDTxxxx directory. */
+ rc = lfsck_namespace_insert_orphan(env, com, child, "", "O",
+ &count);
+ if (rc < 0)
+ return rc;
+
+ if (rc > 0)
+ repaired = true;
+ }
+
+ rc = dt_attr_get(env, child, la, BYPASS_CAPA);
+ if (rc != 0)
+ return rc;
+
+ if (la->la_nlink != count) {
+ /* XXX: there will be other patch(es) for MDT-object
+ * hard links verification. */
+ }
+
+ if (repaired) {
+ if (la->la_nlink > 1)
+ ns->ln_mul_linked_repaired++;
+
+ if (rc == 0)
+ rc = 1;
+ }
+
+ return rc;
+}
+
+static void lfsck_namespace_dump_statistics(struct seq_file *m,
+ struct lfsck_namespace *ns,
+ __u64 checked_phase1,
+ __u64 checked_phase2,
+ __u32 time_phase1,
+ __u32 time_phase2)
+{
+ seq_printf(m, "checked_phase1: "LPU64"\n"
+ "checked_phase2: "LPU64"\n"
+ "updated_phase1: "LPU64"\n"
+ "updated_phase2: "LPU64"\n"
+ "failed_phase1: "LPU64"\n"
+ "failed_phase2: "LPU64"\n"
+ "directories: "LPU64"\n"
+ "dirent_repaired: "LPU64"\n"
+ "linkea_repaired: "LPU64"\n"
+ "nlinks_repaired: "LPU64"\n"
+ "lost_found: "LPU64"\n"
+ "multiple_linked_checked: "LPU64"\n"
+ "multiple_linked_repaired: "LPU64"\n"
+ "unknown_inconsistency: "LPU64"\n"
+ "unmatched_pairs_repaired: "LPU64"\n"
+ "success_count: %u\n"
+ "run_time_phase1: %u seconds\n"
+ "run_time_phase2: %u seconds\n",
+ checked_phase1,
+ checked_phase2,
+ ns->ln_items_repaired,
+ ns->ln_objs_repaired_phase2,
+ ns->ln_items_failed,
+ ns->ln_objs_failed_phase2,
+ ns->ln_dirs_checked,
+ ns->ln_dirent_repaired,
+ ns->ln_linkea_repaired,
+ ns->ln_objs_nlink_repaired,
+ ns->ln_objs_lost_found,
+ ns->ln_mul_linked_checked,
+ ns->ln_mul_linked_repaired,
+ ns->ln_unknown_inconsistency,
+ ns->ln_unmatched_pairs_repaired,
+ ns->ln_success_count,
+ time_phase1,
+ time_phase2);
+}
+
+/* namespace APIs */
+
+static int lfsck_namespace_reset(const struct lu_env *env,
+ struct lfsck_component *com, bool init)
+{
+ struct lfsck_instance *lfsck = com->lc_lfsck;
+ struct lfsck_namespace *ns = com->lc_file_ram;
+ struct dt_object *root;
+ struct dt_object *dto;
+ int rc;
+ ENTRY;
+
+ root = dt_locate(env, lfsck->li_bottom, &lfsck->li_local_root_fid);
+ if (IS_ERR(root))
+ GOTO(log, rc = PTR_ERR(root));
+
+ if (unlikely(!dt_try_as_dir(env, root)))
+ GOTO(put, rc = -ENOTDIR);
+
+ down_write(&com->lc_sem);
+ if (init) {
+ memset(ns, 0, sizeof(*ns));
+ } else {
+ __u32 count = ns->ln_success_count;
+ __u64 last_time = ns->ln_time_last_complete;
+
+ memset(ns, 0, sizeof(*ns));
+ ns->ln_success_count = count;
+ ns->ln_time_last_complete = last_time;
+ }
+ ns->ln_magic = LFSCK_NAMESPACE_MAGIC;
+ ns->ln_status = LS_INIT;
+
+ rc = local_object_unlink(env, lfsck->li_bottom, root,
+ lfsck_namespace_name);
+ if (rc != 0)
+ GOTO(out, rc);
+
+ lfsck_object_put(env, com->lc_obj);
+ com->lc_obj = NULL;
+ dto = local_index_find_or_create(env, lfsck->li_los, root,
+ lfsck_namespace_name,
+ S_IFREG | S_IRUGO | S_IWUSR,
+ &dt_lfsck_features);
+ if (IS_ERR(dto))
+ GOTO(out, rc = PTR_ERR(dto));
+
+ com->lc_obj = dto;
+ rc = dto->do_ops->do_index_try(env, dto, &dt_lfsck_features);
+ if (rc != 0)
+ GOTO(out, rc);
+
+ rc = lfsck_namespace_store(env, com, true);
+
+ GOTO(out, rc);
+
+out:
+ up_write(&com->lc_sem);
+
+put:
+ lu_object_put(env, &root->do_lu);
+log:
+ CDEBUG(D_LFSCK, "%s: namespace LFSCK reset: rc = %d\n",
+ lfsck_lfsck2name(lfsck), rc);
+ return rc;
+}
+
+static void
+lfsck_namespace_fail(const struct lu_env *env, struct lfsck_component *com,
+ bool new_checked)
+{
+ struct lfsck_namespace *ns = com->lc_file_ram;
+
+ down_write(&com->lc_sem);
+ if (new_checked)
+ com->lc_new_checked++;
+ lfsck_namespace_record_failure(env, com->lc_lfsck, ns);
+ up_write(&com->lc_sem);
+}
+
+static int lfsck_namespace_checkpoint(const struct lu_env *env,
+ struct lfsck_component *com, bool init)
+{
+ struct lfsck_instance *lfsck = com->lc_lfsck;
+ struct lfsck_namespace *ns = com->lc_file_ram;
+ int rc;
+
+ if (!init) {
+ rc = lfsck_checkpoint_generic(env, com);
+ if (rc != 0)
+ goto log;
+ }
+
+ down_write(&com->lc_sem);
+ if (init) {
+ ns->ln_pos_latest_start = lfsck->li_pos_checkpoint;
+ } else {
+ ns->ln_pos_last_checkpoint = lfsck->li_pos_checkpoint;
+ ns->ln_run_time_phase1 += cfs_duration_sec(cfs_time_current() +
+ HALF_SEC - lfsck->li_time_last_checkpoint);
+ ns->ln_time_last_checkpoint = cfs_time_current_sec();
+ ns->ln_items_checked += com->lc_new_checked;
+ com->lc_new_checked = 0;
+ }
+
+ rc = lfsck_namespace_store(env, com, false);
+ up_write(&com->lc_sem);
+
+log:
+ CDEBUG(D_LFSCK, "%s: namespace LFSCK checkpoint at the pos ["LPU64
+ ", "DFID", "LPX64"]: rc = %d\n", lfsck_lfsck2name(lfsck),
+ lfsck->li_pos_current.lp_oit_cookie,
+ PFID(&lfsck->li_pos_current.lp_dir_parent),
+ lfsck->li_pos_current.lp_dir_cookie, rc);
+
+ return rc > 0 ? 0 : rc;
+}
+
+static int lfsck_namespace_prep(const struct lu_env *env,
+ struct lfsck_component *com,
+ struct lfsck_start_param *lsp)
+{
+ struct lfsck_instance *lfsck = com->lc_lfsck;
+ struct lfsck_namespace *ns = com->lc_file_ram;
+ struct lfsck_position *pos = &com->lc_pos_start;
+ int rc;
+
+ if (ns->ln_status == LS_COMPLETED) {
+ rc = lfsck_namespace_reset(env, com, false);
+ if (rc == 0)
+ rc = lfsck_set_param(env, lfsck, lsp->lsp_start, true);
+
+ if (rc != 0) {
+ CDEBUG(D_LFSCK, "%s: namespace LFSCK prep failed: "
+ "rc = %d\n", lfsck_lfsck2name(lfsck), rc);
+
+ return rc;
+ }
+ }
+
+ down_write(&com->lc_sem);
+ ns->ln_time_latest_start = cfs_time_current_sec();
+ spin_lock(&lfsck->li_lock);
+
+ if (ns->ln_flags & LF_SCANNED_ONCE) {
+ if (!lfsck->li_drop_dryrun ||
+ lfsck_pos_is_zero(&ns->ln_pos_first_inconsistent)) {
+ ns->ln_status = LS_SCANNING_PHASE2;
+ list_move_tail(&com->lc_link,
+ &lfsck->li_list_double_scan);
+ if (!list_empty(&com->lc_link_dir))
+ list_del_init(&com->lc_link_dir);
+ lfsck_pos_set_zero(pos);
+ } else {
+ ns->ln_status = LS_SCANNING_PHASE1;
+ ns->ln_run_time_phase1 = 0;
+ ns->ln_run_time_phase2 = 0;
+ ns->ln_items_checked = 0;
+ ns->ln_items_repaired = 0;
+ ns->ln_items_failed = 0;
+ ns->ln_dirs_checked = 0;
+ ns->ln_objs_checked_phase2 = 0;
+ ns->ln_objs_repaired_phase2 = 0;
+ ns->ln_objs_failed_phase2 = 0;
+ ns->ln_objs_nlink_repaired = 0;
+ ns->ln_objs_lost_found = 0;
+ ns->ln_dirent_repaired = 0;
+ ns->ln_linkea_repaired = 0;
+ ns->ln_mul_linked_checked = 0;
+ ns->ln_mul_linked_repaired = 0;
+ ns->ln_unknown_inconsistency = 0;
+ ns->ln_unmatched_pairs_repaired = 0;
+ fid_zero(&ns->ln_fid_latest_scanned_phase2);
+ if (list_empty(&com->lc_link_dir))
+ list_add_tail(&com->lc_link_dir,
+ &lfsck->li_list_dir);
+ *pos = ns->ln_pos_first_inconsistent;
+ }
+ } else {
+ ns->ln_status = LS_SCANNING_PHASE1;
+ if (list_empty(&com->lc_link_dir))
+ list_add_tail(&com->lc_link_dir,
+ &lfsck->li_list_dir);
+ if (!lfsck->li_drop_dryrun ||
+ lfsck_pos_is_zero(&ns->ln_pos_first_inconsistent)) {
+ *pos = ns->ln_pos_last_checkpoint;
+ pos->lp_oit_cookie++;
+ } else {
+ *pos = ns->ln_pos_first_inconsistent;
+ }
+ }
+
+ spin_unlock(&lfsck->li_lock);
+ up_write(&com->lc_sem);
+
+ rc = lfsck_start_assistant(env, com, lsp);
+
+ CDEBUG(D_LFSCK, "%s: namespace LFSCK prep done, start pos ["LPU64", "
+ DFID", "LPX64"]: rc = %d\n",
+ lfsck_lfsck2name(lfsck), pos->lp_oit_cookie,
+ PFID(&pos->lp_dir_parent), pos->lp_dir_cookie, rc);
+
+ return rc;
+}
+
+static int lfsck_namespace_exec_oit(const struct lu_env *env,
+ struct lfsck_component *com,
+ struct dt_object *obj)
+{
+ struct lfsck_thread_info *info = lfsck_env_info(env);
+ struct lfsck_namespace *ns = com->lc_file_ram;
+ struct lfsck_instance *lfsck = com->lc_lfsck;
+ const struct lu_fid *fid = lfsck_dto2fid(obj);
+ struct lu_attr *la = &info->lti_la;
+ struct lu_fid *pfid = &info->lti_fid2;
+ struct lu_name *cname = &info->lti_name;
+ struct lu_seq_range *range = &info->lti_range;
+ struct dt_device *dev = lfsck->li_bottom;
+ struct seq_server_site *ss =
+ lu_site2seq(dev->dd_lu_dev.ld_site);
+ struct linkea_data ldata = { 0 };
+ __u32 idx = lfsck_dev_idx(dev);
+ int rc;
+ ENTRY;
+
+ rc = lfsck_links_read(env, obj, &ldata);
+ if (rc == -ENOENT)
+ GOTO(out, rc = 0);
+
+ /* -EINVAL means crashed linkEA, should be verified. */
+ if (rc == -EINVAL) {
+ rc = lfsck_namespace_trace_update(env, com, fid,
+ LNTF_CHECK_LINKEA, true);
+ if (rc == 0) {
+ struct lustre_handle lh = { 0 };
+
+ rc = lfsck_ibits_lock(env, lfsck, obj, &lh,
+ MDS_INODELOCK_UPDATE |
+ MDS_INODELOCK_XATTR, LCK_EX);
+ if (rc == 0) {
+ rc = lfsck_namespace_links_remove(env, com,
+ obj);
+ lfsck_ibits_unlock(&lh, LCK_EX);
+ }
+ }
+
+ GOTO(out, rc = (rc == -ENOENT ? 0 : rc));
+ }
+
+ /* zero-linkEA object may be orphan, but it also maybe because
+ * of upgrading. Currently, we cannot record it for double scan.
+ * Because it may cause the LFSCK tracing file to be too large. */
+ if (rc == -ENODATA) {
+ if (S_ISDIR(lfsck_object_type(obj)))
+ GOTO(out, rc = 0);
+
+ rc = dt_attr_get(env, obj, la, BYPASS_CAPA);
+ if (rc != 0)
+ GOTO(out, rc);
+
+ if (la->la_nlink > 1)
+ rc = lfsck_namespace_trace_update(env, com, fid,
+ LNTF_CHECK_LINKEA, true);
+
+ GOTO(out, rc);
+ }
+
+ if (rc != 0)
+ GOTO(out, rc);
+
+ /* Record multiple-linked object. */
+ if (ldata.ld_leh->leh_reccount > 1) {
+ rc = lfsck_namespace_trace_update(env, com, fid,
+ LNTF_CHECK_LINKEA, true);
+
+ GOTO(out, rc);
+ }
+
+ linkea_first_entry(&ldata);
+ linkea_entry_unpack(ldata.ld_lee, &ldata.ld_reclen, cname, pfid);
+ if (!fid_is_sane(pfid)) {
+ rc = lfsck_namespace_trace_update(env, com, fid,
+ LNTF_CHECK_PARENT, true);
+ } else {
+ fld_range_set_mdt(range);
+ rc = fld_local_lookup(env, ss->ss_server_fld,
+ fid_seq(pfid), range);
+ if ((rc == -ENOENT) ||
+ (rc == 0 && range->lsr_index != idx)) {
+ rc = lfsck_namespace_trace_update(env, com, fid,
+ LNTF_CHECK_LINKEA, true);
+ } else {
+ if (S_ISDIR(lfsck_object_type(obj)))
+ GOTO(out, rc = 0);
+
+ rc = dt_attr_get(env, obj, la, BYPASS_CAPA);
+ if (rc != 0)
+ GOTO(out, rc);
+
+ if (la->la_nlink > 1)
+ rc = lfsck_namespace_trace_update(env, com,
+ fid, LNTF_CHECK_LINKEA, true);
+ }
+ }
+
+ GOTO(out, rc);
+
+out:
+ down_write(&com->lc_sem);
+ com->lc_new_checked++;
+ if (S_ISDIR(lfsck_object_type(obj)))
+ ns->ln_dirs_checked++;
+ if (rc != 0)
+ lfsck_namespace_record_failure(env, com->lc_lfsck, ns);
+ up_write(&com->lc_sem);
+
+ return rc;
+}
+
+static int lfsck_namespace_exec_dir(const struct lu_env *env,
+ struct lfsck_component *com,
+ struct lu_dirent *ent, __u16 type)
+{
+ struct lfsck_assistant_data *lad = com->lc_data;
+ struct lfsck_namespace_req *lnr;
+ bool wakeup = false;
+
+ lnr = lfsck_namespace_assistant_req_init(com->lc_lfsck, ent, type);
+ if (IS_ERR(lnr)) {
+ struct lfsck_namespace *ns = com->lc_file_ram;
+
+ lfsck_namespace_record_failure(env, com->lc_lfsck, ns);
+ return PTR_ERR(lnr);
+ }
+
+ spin_lock(&lad->lad_lock);
+ if (lad->lad_assistant_status < 0) {
+ spin_unlock(&lad->lad_lock);
+ lfsck_namespace_assistant_req_fini(env, &lnr->lnr_lar);
+ return lad->lad_assistant_status;
+ }
+
+ list_add_tail(&lnr->lnr_lar.lar_list, &lad->lad_req_list);
+ if (lad->lad_prefetched == 0)
+ wakeup = true;
+
+ lad->lad_prefetched++;
+ spin_unlock(&lad->lad_lock);
+ if (wakeup)
+ wake_up_all(&lad->lad_thread.t_ctl_waitq);
+
+ down_write(&com->lc_sem);
+ com->lc_new_checked++;
+ up_write(&com->lc_sem);
+
+ return 0;
+}
+
+static int lfsck_namespace_post(const struct lu_env *env,
+ struct lfsck_component *com,
+ int result, bool init)
+{
+ struct lfsck_instance *lfsck = com->lc_lfsck;
+ struct lfsck_namespace *ns = com->lc_file_ram;
+ int rc;
+ ENTRY;
+
+ lfsck_post_generic(env, com, &result);
+
+ down_write(&com->lc_sem);
+ spin_lock(&lfsck->li_lock);
+ if (!init)
+ ns->ln_pos_last_checkpoint = lfsck->li_pos_checkpoint;
+ if (result > 0) {
+ ns->ln_status = LS_SCANNING_PHASE2;
+ ns->ln_flags |= LF_SCANNED_ONCE;
+ ns->ln_flags &= ~LF_UPGRADE;
+ list_del_init(&com->lc_link_dir);
+ list_move_tail(&com->lc_link, &lfsck->li_list_double_scan);
+ } else if (result == 0) {
+ ns->ln_status = lfsck->li_status;
+ if (ns->ln_status == 0)
+ ns->ln_status = LS_STOPPED;
+ if (ns->ln_status != LS_PAUSED) {
+ list_del_init(&com->lc_link_dir);
+ list_move_tail(&com->lc_link, &lfsck->li_list_idle);
+ }
+ } else {
+ ns->ln_status = LS_FAILED;
+ list_del_init(&com->lc_link_dir);
+ list_move_tail(&com->lc_link, &lfsck->li_list_idle);
+ }
+ spin_unlock(&lfsck->li_lock);
+
+ if (!init) {
+ ns->ln_run_time_phase1 += cfs_duration_sec(cfs_time_current() +
+ HALF_SEC - lfsck->li_time_last_checkpoint);
+ ns->ln_time_last_checkpoint = cfs_time_current_sec();
+ ns->ln_items_checked += com->lc_new_checked;
+ com->lc_new_checked = 0;
+ }
+
+ rc = lfsck_namespace_store(env, com, false);
+ up_write(&com->lc_sem);
+
+ CDEBUG(D_LFSCK, "%s: namespace LFSCK post done: rc = %d\n",
+ lfsck_lfsck2name(lfsck), rc);
+
+ RETURN(rc);
+}
+
+static int
+lfsck_namespace_dump(const struct lu_env *env, struct lfsck_component *com,
+ struct seq_file *m)
+{
+ struct lfsck_instance *lfsck = com->lc_lfsck;
+ struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
+ struct lfsck_namespace *ns = com->lc_file_ram;
+ int rc;
+
+ down_read(&com->lc_sem);
+ seq_printf(m, "name: lfsck_namespace\n"
+ "magic: %#x\n"
+ "version: %d\n"
+ "status: %s\n",
+ ns->ln_magic,
+ bk->lb_version,
+ lfsck_status2names(ns->ln_status));
+
+ rc = lfsck_bits_dump(m, ns->ln_flags, lfsck_flags_names, "flags");
+ if (rc < 0)
+ goto out;
+
+ rc = lfsck_bits_dump(m, bk->lb_param, lfsck_param_names, "param");
+ if (rc < 0)
+ goto out;
+
+ rc = lfsck_time_dump(m, ns->ln_time_last_complete,
+ "time_since_last_completed");
+ if (rc < 0)
+ goto out;
+
+ rc = lfsck_time_dump(m, ns->ln_time_latest_start,
+ "time_since_latest_start");
+ if (rc < 0)
+ goto out;
+
+ rc = lfsck_time_dump(m, ns->ln_time_last_checkpoint,
+ "time_since_last_checkpoint");
+ if (rc < 0)
+ goto out;
+
+ rc = lfsck_pos_dump(m, &ns->ln_pos_latest_start,
+ "latest_start_position");
+ if (rc < 0)
+ goto out;
+
+ rc = lfsck_pos_dump(m, &ns->ln_pos_last_checkpoint,
+ "last_checkpoint_position");
+ if (rc < 0)
+ goto out;
+
+ rc = lfsck_pos_dump(m, &ns->ln_pos_first_inconsistent,
+ "first_failure_position");
+ if (rc < 0)
+ goto out;
+
+ if (ns->ln_status == LS_SCANNING_PHASE1) {
+ struct lfsck_position pos;
+ const struct dt_it_ops *iops;
+ cfs_duration_t duration = cfs_time_current() -
+ lfsck->li_time_last_checkpoint;
+ __u64 checked = ns->ln_items_checked + com->lc_new_checked;
+ __u64 speed = checked;
+ __u64 new_checked = com->lc_new_checked * HZ;
+ __u32 rtime = ns->ln_run_time_phase1 +
+ cfs_duration_sec(duration + HALF_SEC);
+
+ if (duration != 0)
+ do_div(new_checked, duration);
+ if (rtime != 0)
+ do_div(speed, rtime);
+ lfsck_namespace_dump_statistics(m, ns, checked,
+ ns->ln_objs_checked_phase2,
+ rtime, ns->ln_run_time_phase2);
+
+ seq_printf(m, "average_speed_phase1: "LPU64" items/sec\n"
+ "average_speed_phase2: N/A\n"
+ "real_time_speed_phase1: "LPU64" items/sec\n"
+ "real_time_speed_phase2: N/A\n",
+ speed,
+ new_checked);
+
+ LASSERT(lfsck->li_di_oit != NULL);
+
+ iops = &lfsck->li_obj_oit->do_index_ops->dio_it;
+
+ /* The low layer otable-based iteration position may NOT
+ * exactly match the namespace-based directory traversal
+ * cookie. Generally, it is not a serious issue. But the
+ * caller should NOT make assumption on that. */
+ pos.lp_oit_cookie = iops->store(env, lfsck->li_di_oit);
+ if (!lfsck->li_current_oit_processed)
+ pos.lp_oit_cookie--;
+
+ spin_lock(&lfsck->li_lock);
+ if (lfsck->li_di_dir != NULL) {
+ pos.lp_dir_cookie = lfsck->li_cookie_dir;
+ if (pos.lp_dir_cookie >= MDS_DIR_END_OFF) {
+ fid_zero(&pos.lp_dir_parent);
+ pos.lp_dir_cookie = 0;
+ } else {
+ pos.lp_dir_parent =
+ *lfsck_dto2fid(lfsck->li_obj_dir);
+ }
+ } else {
+ fid_zero(&pos.lp_dir_parent);
+ pos.lp_dir_cookie = 0;
+ }
+ spin_unlock(&lfsck->li_lock);
+ lfsck_pos_dump(m, &pos, "current_position");
+ } else if (ns->ln_status == LS_SCANNING_PHASE2) {
+ cfs_duration_t duration = cfs_time_current() -
+ lfsck->li_time_last_checkpoint;
+ __u64 checked = ns->ln_objs_checked_phase2 +
+ com->lc_new_checked;
+ __u64 speed1 = ns->ln_items_checked;
+ __u64 speed2 = checked;
+ __u64 new_checked = com->lc_new_checked * HZ;
+ __u32 rtime = ns->ln_run_time_phase2 +
+ cfs_duration_sec(duration + HALF_SEC);
+
+ if (duration != 0)
+ do_div(new_checked, duration);
+ if (ns->ln_run_time_phase1 != 0)
+ do_div(speed1, ns->ln_run_time_phase1);
+ if (rtime != 0)
+ do_div(speed2, rtime);
+ lfsck_namespace_dump_statistics(m, ns, ns->ln_items_checked,
+ checked,
+ ns->ln_run_time_phase1, rtime);
+
+ seq_printf(m, "average_speed_phase1: "LPU64" items/sec\n"
+ "average_speed_phase2: "LPU64" objs/sec\n"
+ "real_time_speed_phase1: N/A\n"
+ "real_time_speed_phase2: "LPU64" objs/sec\n"
+ "current_position: "DFID"\n",
+ speed1,
+ speed2,
+ new_checked,
+ PFID(&ns->ln_fid_latest_scanned_phase2));
+ } else {
+ __u64 speed1 = ns->ln_items_checked;
+ __u64 speed2 = ns->ln_objs_checked_phase2;
+
+ if (ns->ln_run_time_phase1 != 0)
+ do_div(speed1, ns->ln_run_time_phase1);
+ if (ns->ln_run_time_phase2 != 0)
+ do_div(speed2, ns->ln_run_time_phase2);
+ lfsck_namespace_dump_statistics(m, ns, ns->ln_items_checked,
+ ns->ln_objs_checked_phase2,
+ ns->ln_run_time_phase1,
+ ns->ln_run_time_phase2);
+
+ seq_printf(m, "average_speed_phase1: "LPU64" items/sec\n"
+ "average_speed_phase2: "LPU64" objs/sec\n"
+ "real_time_speed_phase1: N/A\n"
+ "real_time_speed_phase2: N/A\n"
+ "current_position: N/A\n",
+ speed1,
+ speed2);
+ }
+out:
+ up_read(&com->lc_sem);
+ return 0;
+}
+
+static int lfsck_namespace_double_scan(const struct lu_env *env,
+ struct lfsck_component *com)
+{
+ struct lfsck_namespace *ns = com->lc_file_ram;
+
+ return lfsck_double_scan_generic(env, com, ns->ln_status);
+}
+
+static void lfsck_namespace_data_release(const struct lu_env *env,
+ struct lfsck_component *com)
+{
+ struct lfsck_assistant_data *lad = com->lc_data;
+ struct lfsck_tgt_descs *ltds = &com->lc_lfsck->li_mdt_descs;
+ struct lfsck_tgt_desc *ltd;
+ struct lfsck_tgt_desc *next;
+
+ LASSERT(lad != NULL);
+ LASSERT(thread_is_init(&lad->lad_thread) ||
+ thread_is_stopped(&lad->lad_thread));
+ LASSERT(list_empty(&lad->lad_req_list));
+
+ com->lc_data = NULL;
+
+ spin_lock(<ds->ltd_lock);
+ list_for_each_entry_safe(ltd, next, &lad->lad_mdt_phase1_list,
+ ltd_namespace_phase_list) {
+ list_del_init(<d->ltd_namespace_phase_list);
+ }
+ list_for_each_entry_safe(ltd, next, &lad->lad_mdt_phase2_list,
+ ltd_namespace_phase_list) {
+ list_del_init(<d->ltd_namespace_phase_list);
+ }
+ list_for_each_entry_safe(ltd, next, &lad->lad_mdt_list,
+ ltd_namespace_list) {
+ list_del_init(<d->ltd_namespace_list);
+ }
+ spin_unlock(<ds->ltd_lock);
+
+ CFS_FREE_BITMAP(lad->lad_bitmap);
+
+ OBD_FREE_PTR(lad);