Viewing: lfsck_lib.c
// SPDX-License-Identifier: GPL-2.0
/*
* Copyright (c) 2013, 2017, Intel Corporation.
*/
/*
* This file is part of Lustre, http://www.lustre.org/
*
* Author: Fan, Yong <fan.yong@intel.com>
*/
#define DEBUG_SUBSYSTEM S_LFSCK
#include <linux/kthread.h>
#include <linux/sched.h>
#include <linux/list.h>
#include <linux/delay.h>
#include <lu_object.h>
#include <dt_object.h>
#include <md_object.h>
#include <lustre_fld.h>
#include <lustre_lib.h>
#include <lustre_net.h>
#include <lustre_lfsck.h>
#include <lu_target.h>
#include "lfsck_internal.h"
#define LFSCK_CHECKPOINT_SKIP 1
/* define lfsck thread key */
LU_KEY_INIT(lfsck, struct lfsck_thread_info);
static void lfsck_key_fini(const struct lu_context *ctx,
struct lu_context_key *key, void *data)
{
struct lfsck_thread_info *info = data;
lu_buf_free(&info->lti_linkea_buf);
lu_buf_free(&info->lti_linkea_buf2);
lu_buf_free(&info->lti_big_buf);
OBD_FREE_PTR(info);
}
LU_CONTEXT_KEY_DEFINE(lfsck, LCT_MD_THREAD | LCT_DT_THREAD);
LU_KEY_INIT_GENERIC(lfsck);
static LIST_HEAD(lfsck_instance_list);
static LIST_HEAD(lfsck_ost_orphan_list);
static LIST_HEAD(lfsck_mdt_orphan_list);
static DEFINE_SPINLOCK(lfsck_instance_lock);
const char *const lfsck_flags_names[] = {
"scanned-once",
"inconsistent",
"upgrade",
"incomplete",
"crashed_lastid",
NULL
};
const char *const lfsck_param_names[] = {
NULL,
"failout",
"dryrun",
"all_targets",
"broadcast",
"orphan",
"create_ostobj",
"create_mdtobj",
NULL,
"delay_create_ostobj",
NULL
};
enum lfsck_verify_lpf_types {
LVLT_BY_BOOKMARK = 0,
LVLT_BY_NAMEENTRY = 1,
};
static inline void
lfsck_reset_ltd_status(struct lfsck_tgt_desc *ltd, enum lfsck_type type)
{
if (type == LFSCK_TYPE_LAYOUT) {
ltd->ltd_layout_status = LS_MAX;
ltd->ltd_layout_repaired = 0;
} else {
ltd->ltd_namespace_status = LS_MAX;
ltd->ltd_namespace_repaired = 0;
}
}
static int lfsck_tgt_descs_init(struct lfsck_tgt_descs *ltds)
{
spin_lock_init(<ds->ltd_lock);
init_rwsem(<ds->ltd_rw_sem);
INIT_LIST_HEAD(<ds->ltd_orphan);
ltds->ltd_tgts_bitmap = bitmap_zalloc(BITS_PER_LONG, GFP_KERNEL);
if (!ltds->ltd_tgts_bitmap)
return -ENOMEM;
return 0;
}
static void lfsck_tgt_descs_fini(struct lfsck_tgt_descs *ltds)
{
struct lfsck_tgt_desc *ltd;
struct lfsck_tgt_desc *next;
int idx;
down_write(<ds->ltd_rw_sem);
list_for_each_entry_safe(ltd, next, <ds->ltd_orphan,
ltd_orphan_list) {
list_del_init(<d->ltd_orphan_list);
kref_put(<d->ltd_ref, lfsck_tgt_free);
}
if (unlikely(!ltds->ltd_tgts_bitmap)) {
up_write(<ds->ltd_rw_sem);
return;
}
for_each_set_bit(idx, ltds->ltd_tgts_bitmap, ltds->ltd_tgts_mask_len) {
ltd = lfsck_ltd2tgt(ltds, idx);
if (likely(ltd != NULL)) {
LASSERT(list_empty(<d->ltd_layout_list));
LASSERT(list_empty(<d->ltd_layout_phase_list));
LASSERT(list_empty(<d->ltd_namespace_list));
LASSERT(list_empty(<d->ltd_namespace_phase_list));
ltds->ltd_tgtnr--;
clear_bit(idx, ltds->ltd_tgts_bitmap);
lfsck_assign_tgt(ltds, NULL, idx);
kref_put(<d->ltd_ref, lfsck_tgt_free);
}
}
LASSERTF(ltds->ltd_tgtnr == 0, "tgt count unmatched: %d\n",
ltds->ltd_tgtnr);
for (idx = 0; idx < ARRAY_SIZE(ltds->ltd_tgts_idx); idx++) {
if (ltds->ltd_tgts_idx[idx] != NULL) {
OBD_FREE_PTR(ltds->ltd_tgts_idx[idx]);
ltds->ltd_tgts_idx[idx] = NULL;
}
}
bitmap_free(ltds->ltd_tgts_bitmap);
ltds->ltd_tgts_bitmap = NULL;
up_write(<ds->ltd_rw_sem);
}
static int __lfsck_add_target(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct lfsck_tgt_desc *ltd,
bool for_ost, bool locked)
{
struct lfsck_tgt_descs *ltds;
__u32 index = ltd->ltd_index;
int rc = 0;
ENTRY;
if (for_ost)
ltds = &lfsck->li_ost_descs;
else
ltds = &lfsck->li_mdt_descs;
if (!locked)
down_write(<ds->ltd_rw_sem);
LASSERT(ltds->ltd_tgts_bitmap);
if (index >= ltds->ltd_tgts_mask_len) {
u32 newsize = max_t(u32, ltds->ltd_tgts_mask_len,
BITS_PER_LONG);
unsigned long *old_bitmap = ltds->ltd_tgts_bitmap;
unsigned long *new_bitmap;
while (newsize < index + 1)
newsize <<= 1;
new_bitmap = bitmap_zalloc(newsize, GFP_KERNEL);
if (!new_bitmap)
GOTO(unlock, rc = -ENOMEM);
if (ltds->ltd_tgtnr > 0) {
bitmap_copy(new_bitmap, old_bitmap,
ltds->ltd_tgts_mask_len);
}
ltds->ltd_tgts_bitmap = new_bitmap;
ltds->ltd_tgts_mask_len = newsize;
bitmap_free(old_bitmap);
}
if (test_bit(index, ltds->ltd_tgts_bitmap)) {
CERROR("%s: the device %s (%u) is registered already\n",
lfsck_lfsck2name(lfsck),
ltd->ltd_tgt->dd_lu_dev.ld_obd->obd_name, index);
GOTO(unlock, rc = -EEXIST);
}
if (ltds->ltd_tgts_idx[index / TGT_PTRS_PER_BLOCK] == NULL) {
OBD_ALLOC_PTR(ltds->ltd_tgts_idx[index / TGT_PTRS_PER_BLOCK]);
if (ltds->ltd_tgts_idx[index / TGT_PTRS_PER_BLOCK] == NULL)
GOTO(unlock, rc = -ENOMEM);
}
lfsck_assign_tgt(ltds, ltd, index);
set_bit(index, ltds->ltd_tgts_bitmap);
ltds->ltd_tgtnr++;
GOTO(unlock, rc = 0);
unlock:
if (!locked)
up_write(<ds->ltd_rw_sem);
return rc;
}
static int lfsck_add_target_from_orphan(const struct lu_env *env,
struct lfsck_instance *lfsck)
{
struct lfsck_tgt_descs *ltds = &lfsck->li_ost_descs;
struct lfsck_tgt_desc *ltd;
struct lfsck_tgt_desc *next;
struct list_head *head = &lfsck_ost_orphan_list;
int rc;
bool for_ost = true;
again:
spin_lock(&lfsck_instance_lock);
list_for_each_entry_safe(ltd, next, head, ltd_orphan_list) {
if (ltd->ltd_key == lfsck->li_bottom)
list_move_tail(<d->ltd_orphan_list,
<ds->ltd_orphan);
}
spin_unlock(&lfsck_instance_lock);
down_write(<ds->ltd_rw_sem);
while (!list_empty(<ds->ltd_orphan)) {
ltd = list_first_entry(<ds->ltd_orphan,
struct lfsck_tgt_desc,
ltd_orphan_list);
list_del_init(<d->ltd_orphan_list);
rc = __lfsck_add_target(env, lfsck, ltd, for_ost, true);
/* Do not hold the semaphore for too long time. */
up_write(<ds->ltd_rw_sem);
if (rc != 0)
return rc;
down_write(<ds->ltd_rw_sem);
}
up_write(<ds->ltd_rw_sem);
if (for_ost) {
ltds = &lfsck->li_mdt_descs;
head = &lfsck_mdt_orphan_list;
for_ost = false;
goto again;
}
return 0;
}
static inline struct lfsck_component *
__lfsck_component_find(struct lfsck_instance *lfsck, __u16 type,
struct list_head *list)
{
struct lfsck_component *com;
list_for_each_entry(com, list, lc_link) {
if (com->lc_type == type)
return com;
}
return NULL;
}
struct lfsck_component *
lfsck_component_find(struct lfsck_instance *lfsck, __u16 type)
{
struct lfsck_component *com;
spin_lock(&lfsck->li_lock);
com = __lfsck_component_find(lfsck, type, &lfsck->li_list_scan);
if (com != NULL)
goto unlock;
com = __lfsck_component_find(lfsck, type,
&lfsck->li_list_double_scan);
if (com != NULL)
goto unlock;
com = __lfsck_component_find(lfsck, type, &lfsck->li_list_idle);
unlock:
if (com != NULL)
lfsck_component_get(com);
spin_unlock(&lfsck->li_lock);
return com;
}
void lfsck_component_cleanup(const struct lu_env *env,
struct lfsck_component *com)
{
if (!list_empty(&com->lc_link))
list_del_init(&com->lc_link);
if (!list_empty(&com->lc_link_dir))
list_del_init(&com->lc_link_dir);
lfsck_component_put(env, com);
}
int lfsck_fid_alloc(const struct lu_env *env, struct lfsck_instance *lfsck,
struct lu_fid *fid, bool locked)
{
struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
int rc = 0;
ENTRY;
if (!locked)
mutex_lock(&lfsck->li_mutex);
rc = seq_client_alloc_fid(env, lfsck->li_seq, fid);
if (rc >= 0) {
bk->lb_last_fid = *fid;
/* We do not care about whether the subsequent sub-operations
* failed or not. The worst case is that one FID is lost that
* is not a big issue for the LFSCK since it is relative rare
* for LFSCK create.
*/
rc = lfsck_bookmark_store(env, lfsck);
}
if (!locked)
mutex_unlock(&lfsck->li_mutex);
RETURN(rc);
}
static int __lfsck_ibits_lock(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct dt_object *obj, struct ldlm_res_id *resid,
struct lustre_handle *lh,
enum mds_ibits_locks bits, enum ldlm_mode mode)
{
struct lfsck_thread_info *info = lfsck_env_info(env);
union ldlm_policy_data *policy = &info->lti_policy;
__u64 flags = LDLM_FL_ATOMIC_CB;
int rc;
LASSERT(lfsck->li_namespace != NULL);
memset(policy, 0, sizeof(*policy));
policy->l_inodebits.bits = bits;
policy->l_inodebits.li_initiator_id = lfsck_dev_idx(lfsck);
if (dt_object_remote(obj)) {
struct ldlm_enqueue_info *einfo = &info->lti_einfo;
memset(einfo, 0, sizeof(*einfo));
einfo->ei_type = LDLM_IBITS;
einfo->ei_mode = mode;
einfo->ei_cb_bl = ldlm_blocking_ast;
einfo->ei_cb_cp = ldlm_completion_ast;
einfo->ei_res_id = resid;
einfo->ei_req_slot = 1;
rc = dt_object_lock(env, obj, lh, einfo, policy);
/* for regular checks LFSCK doesn't use LDLM locking,
* so the state isn't coherent. here we just took LDLM
* lock for coherency and it's time to invalidate
* previous state
*/
if (rc == ELDLM_OK)
dt_invalidate(env, obj);
} else {
rc = ldlm_cli_enqueue_local(env, lfsck->li_namespace, resid,
LDLM_IBITS, policy, mode,
&flags, ldlm_blocking_ast,
ldlm_completion_ast, NULL, NULL,
0, LVB_T_NONE, NULL, lh);
}
if (rc == ELDLM_OK) {
rc = 0;
} else {
memset(lh, 0, sizeof(*lh));
rc = -EIO;
}
return rc;
}
/**
* lfsck_ibits_lock() - Request the specified ibits lock for the given object.
* @env: pointer to the thread context
* @lfsck: pointer to the lfsck instance
* @obj: pointer to the dt_object to be locked
* @lh: pointer to the lock handle [out]
* @bits: the bits for the ldlm lock to be acquired
* @mode: the mode for the ldlm lock to be acquired
*
* Before the LFSCK modifying on the namespace visible object,
* it needs to acquire related ibits ldlm lock.
*
* Return:
* * %0 for success
* * %negative error number on failure
*/
int lfsck_ibits_lock(const struct lu_env *env, struct lfsck_instance *lfsck,
struct dt_object *obj, struct lustre_handle *lh,
enum mds_ibits_locks bits, enum ldlm_mode mode)
{
struct ldlm_res_id *resid = &lfsck_env_info(env)->lti_resid;
LASSERT(!lustre_handle_is_used(lh));
fid_build_reg_res_name(lfsck_dto2fid(obj), resid);
return __lfsck_ibits_lock(env, lfsck, obj, resid, lh, bits, mode);
}
/**
* lfsck_remote_lookup_lock() - Request remote LOOKUP lock for the given object.
* @env: pointer to the thread context
* @lfsck: pointer to the lfsck instance
* @pobj: pointer to parent dt_object
* @obj: pointer to the dt_object to be locked
* @lh: pointer to the lock handle [out]
* @mode: the mode for the ldlm lock to be acquired
*
* If @pobj is remote, the LOOKUP lock of @obj is on the MDT where
* @pobj is, acquire LOOKUP lock there.
*
* Return:
* * %0 for success
* * %negative error number on failure
*/
int lfsck_remote_lookup_lock(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct dt_object *pobj, struct dt_object *obj,
struct lustre_handle *lh, enum ldlm_mode mode)
{
struct ldlm_res_id *resid = &lfsck_env_info(env)->lti_resid;
LASSERT(!lustre_handle_is_used(lh));
fid_build_reg_res_name(lfsck_dto2fid(obj), resid);
return __lfsck_ibits_lock(env, lfsck, pobj, resid, lh,
MDS_INODELOCK_LOOKUP, mode);
}
/**
* lfsck_ibits_unlock() - Release the specified ibits lock.
* @lh: pointer to the lock handle
* @mode: the mode for the ldlm lock to be released
*
* If the lock has been acquired before, release it
* and cleanup the handle. Otherwise, do nothing.
*/
void lfsck_ibits_unlock(struct lustre_handle *lh, enum ldlm_mode mode)
{
if (lustre_handle_is_used(lh)) {
ldlm_lock_decref(lh, mode);
memset(lh, 0, sizeof(*lh));
}
}
/**
* lfsck_lock() - Request compound ibits locks for the given <obj, name> pairs.
* @env: pointer to the thread context
* @lfsck: pointer to the lfsck instance
* @obj: pointer to the dt_object to be locked
* @name: used for building the PDO lock resource
* @llh: pointer to the lfsck_lock_handle [out]
* @bits: the bits for the ldlm lock to be acquired
* @mode: the mode for the ldlm lock to be acquired
*
* Before the LFSCK modifying on the namespace visible object, it needs to
* acquire related ibits ldlm lock. Usually, we can use lfsck_ibits_lock for
* the lock purpose. But the simple lfsck_ibits_lock for directory-based
* modificationis (such as insert name entry to the directory) may be too
* coarse-grained and not efficient.
*
* The lfsck_lock() will request compound ibits locks on the specified
* <obj, name> pairs: the PDO (Parallel Directory Operations) ibits (UPDATE)
* lock on the directory object, and the regular ibits lock on the name hash.
*
* Return:
* * %0 for success
* * %negative error number on failure
*/
int lfsck_lock(const struct lu_env *env, struct lfsck_instance *lfsck,
struct dt_object *obj, const char *name,
struct lfsck_lock_handle *llh, enum mds_ibits_locks bits,
enum ldlm_mode mode)
{
struct ldlm_res_id *resid = &lfsck_env_info(env)->lti_resid;
int rc;
LASSERT(S_ISDIR(lfsck_object_type(obj)));
LASSERT(name != NULL);
LASSERT(name[0] != 0);
LASSERT(!lustre_handle_is_used(&llh->llh_pdo_lh));
LASSERT(!lustre_handle_is_used(&llh->llh_reg_lh));
switch (mode) {
case LCK_EX:
llh->llh_pdo_mode = LCK_EX;
break;
case LCK_PW:
llh->llh_pdo_mode = LCK_CW;
break;
case LCK_PR:
llh->llh_pdo_mode = LCK_CR;
break;
default:
CDEBUG(D_LFSCK, "%s: unexpected PDO lock mode %u on the obj "
DFID"\n", lfsck_lfsck2name(lfsck), mode,
PFID(lfsck_dto2fid(obj)));
LBUG();
}
fid_build_reg_res_name(lfsck_dto2fid(obj), resid);
rc = __lfsck_ibits_lock(env, lfsck, obj, resid, &llh->llh_pdo_lh,
MDS_INODELOCK_UPDATE, llh->llh_pdo_mode);
if (rc != 0)
return rc;
llh->llh_reg_mode = mode;
resid->name[LUSTRE_RES_ID_HSH_OFF] = full_name_hash(NULL, name,
strlen(name));
LASSERT(resid->name[LUSTRE_RES_ID_HSH_OFF] != 0);
rc = __lfsck_ibits_lock(env, lfsck, obj, resid, &llh->llh_reg_lh,
bits, llh->llh_reg_mode);
if (rc != 0)
lfsck_ibits_unlock(&llh->llh_pdo_lh, llh->llh_pdo_mode);
return rc;
}
/**
* lfsck_unlock() - Release the compound ibits locks.
*
* @llh: pointer to the lfsck_lock_handle to be released
*/
void lfsck_unlock(struct lfsck_lock_handle *llh)
{
lfsck_ibits_unlock(&llh->llh_reg_lh, llh->llh_reg_mode);
lfsck_ibits_unlock(&llh->llh_pdo_lh, llh->llh_pdo_mode);
}
int lfsck_find_mdt_idx_by_fid(const struct lu_env *env,
struct lfsck_instance *lfsck,
const struct lu_fid *fid)
{
struct seq_server_site *ss = lfsck_dev_site(lfsck);
struct lu_seq_range *range = &lfsck_env_info(env)->lti_range;
int rc;
if (unlikely(fid_seq(fid) == FID_SEQ_LOCAL_FILE)) {
/* "ROOT" is always on the MDT0. */
if (lu_fid_eq(fid, &lfsck->li_global_root_fid))
return 0;
return lfsck_dev_idx(lfsck);
}
fld_range_set_mdt(range);
rc = fld_server_lookup(env, ss->ss_server_fld, fid_seq(fid), range);
if (rc == 0)
rc = range->lsr_index;
return rc;
}
const char dot[] = ".";
const char dotdot[] = "..";
static const char dotlustre[] = ".lustre";
static const char lostfound[] = "lost+found";
/**
* lfsck_lpf_remove_name_entry() - Remove the name entry from the
* .lustre/lost+found directory.
* @env: pointer to the thread context
* @lfsck: pointer to the lfsck instance
* @name: the name for the name entry to be removed
*
* No need to care about the object referenced by the name entry,
* either the name entry is invalid or redundant, or the referenced
* object has been processed or will be handled by others.
*
* Return:
* * %0 for success
* * %negative error number on failure
*/
static int lfsck_lpf_remove_name_entry(const struct lu_env *env,
struct lfsck_instance *lfsck,
const char *name)
{
struct dt_object *parent = lfsck->li_lpf_root_obj;
struct dt_device *dev = lfsck_obj2dev(parent);
struct thandle *th;
struct lfsck_lock_handle *llh = &lfsck_env_info(env)->lti_llh;
int rc;
ENTRY;
if (lfsck->li_bookmark_ram.lb_param & LPF_DRYRUN)
RETURN(0);
rc = lfsck_lock(env, lfsck, parent, name, llh,
MDS_INODELOCK_UPDATE, LCK_PW);
if (rc != 0)
RETURN(rc);
th = lfsck_trans_create(env, dev, lfsck);
if (IS_ERR(th))
GOTO(unlock, rc = PTR_ERR(th));
rc = dt_declare_delete(env, parent, (const struct dt_key *)name, th);
if (rc != 0)
GOTO(stop, rc);
rc = dt_declare_ref_del(env, parent, th);
if (rc != 0)
GOTO(stop, rc);
rc = dt_trans_start_local(env, dev, th);
if (rc != 0)
GOTO(stop, rc);
rc = dt_delete(env, parent, (const struct dt_key *)name, th);
if (rc != 0)
GOTO(stop, rc);
dt_write_lock(env, parent, 0);
rc = dt_ref_del(env, parent, th);
dt_write_unlock(env, parent);
GOTO(stop, rc);
stop:
dt_trans_stop(env, dev, th);
unlock:
lfsck_unlock(llh);
CDEBUG(D_LFSCK, "%s: remove name entry "DFID"/%s: rc = %d\n",
lfsck_lfsck2name(lfsck), PFID(lfsck_dto2fid(parent)), name, rc);
return rc;
}
static int lfsck_create_lpf_local(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct dt_object *child,
struct lu_attr *la,
struct dt_object_format *dof,
const char *name)
{
struct dt_insert_rec *rec = &lfsck_env_info(env)->lti_dt_rec;
struct dt_object *parent = lfsck->li_lpf_root_obj;
struct dt_device *dev = lfsck_obj2dev(child);
struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
struct dt_object *bk_obj = lfsck->li_bookmark_obj;
const struct lu_fid *cfid = lfsck_dto2fid(child);
struct thandle *th = NULL;
struct linkea_data ldata = { NULL };
struct lu_buf linkea_buf;
const struct lu_name *cname;
loff_t pos = 0;
int len = sizeof(struct lfsck_bookmark);
int rc;
ENTRY;
if (lfsck->li_bookmark_ram.lb_param & LPF_DRYRUN)
RETURN(0);
cname = lfsck_name_get_const(env, name, strlen(name));
rc = linkea_links_new(&ldata, &lfsck_env_info(env)->lti_linkea_buf2,
cname, lfsck_dto2fid(parent));
if (rc != 0)
RETURN(rc);
th = lfsck_trans_create(env, dev, lfsck);
if (IS_ERR(th))
RETURN(PTR_ERR(th));
/* 1a. create child */
rc = dt_declare_create(env, child, la, NULL, dof, th);
if (rc != 0)
GOTO(stop, rc);
if (!dt_try_as_dir(env, child, false))
GOTO(stop, rc = -ENOTDIR);
/* 2a. increase child nlink */
rc = dt_declare_ref_add(env, child, th);
if (rc != 0)
GOTO(stop, rc);
/* 3a. insert dot into child dir */
rec->rec_type = S_IFDIR;
rec->rec_fid = cfid;
rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
(const struct dt_key *)dot, th);
if (rc != 0)
GOTO(stop, rc);
/* 4a. insert dotdot into child dir */
rec->rec_fid = &LU_LPF_FID;
rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
(const struct dt_key *)dotdot, th);
if (rc != 0)
GOTO(stop, rc);
/* 5a. insert linkEA for child */
lfsck_buf_init(&linkea_buf, ldata.ld_buf->lb_buf,
ldata.ld_leh->leh_len);
rc = dt_declare_xattr_set(env, child, NULL, &linkea_buf,
XATTR_NAME_LINK, 0, th);
if (rc != 0)
GOTO(stop, rc);
/* 6a. insert name into parent dir */
rec->rec_type = S_IFDIR;
rec->rec_fid = cfid;
rc = dt_declare_insert(env, parent, (const struct dt_rec *)rec,
(const struct dt_key *)name, th);
if (rc != 0)
GOTO(stop, rc);
/* 7a. increase parent nlink */
rc = dt_declare_ref_add(env, parent, th);
if (rc != 0)
GOTO(stop, rc);
/* 8a. update bookmark */
rc = dt_declare_record_write(env, bk_obj,
lfsck_buf_get(env, bk, len), 0, th);
if (rc != 0)
GOTO(stop, rc);
rc = dt_trans_start_local(env, dev, th);
if (rc != 0)
GOTO(stop, rc);
dt_write_lock(env, child, 0);
/* 1b. create child */
rc = dt_create(env, child, la, NULL, dof, th);
if (rc != 0)
GOTO(unlock, rc);
/* 2b. increase child nlink */
rc = dt_ref_add(env, child, th);
if (rc != 0)
GOTO(unlock, rc);
/* 3b. insert dot into child dir */
rec->rec_fid = cfid;
rc = dt_insert(env, child, (const struct dt_rec *)rec,
(const struct dt_key *)dot, th);
if (rc != 0)
GOTO(unlock, rc);
/* 4b. insert dotdot into child dir */
rec->rec_fid = &LU_LPF_FID;
rc = dt_insert(env, child, (const struct dt_rec *)rec,
(const struct dt_key *)dotdot, th);
if (rc != 0)
GOTO(unlock, rc);
/* 5b. insert linkEA for child. */
rc = dt_xattr_set(env, child, &linkea_buf,
XATTR_NAME_LINK, 0, th);
dt_write_unlock(env, child);
if (rc != 0)
GOTO(stop, rc);
/* 6b. insert name into parent dir */
rec->rec_fid = cfid;
rc = dt_insert(env, parent, (const struct dt_rec *)rec,
(const struct dt_key *)name, th);
if (rc != 0)
GOTO(stop, rc);
dt_write_lock(env, parent, 0);
/* 7b. increase parent nlink */
rc = dt_ref_add(env, parent, th);
dt_write_unlock(env, parent);
if (rc != 0)
GOTO(stop, rc);
bk->lb_lpf_fid = *cfid;
lfsck_bookmark_cpu_to_le(&lfsck->li_bookmark_disk, bk);
/* 8b. update bookmark */
rc = dt_record_write(env, bk_obj,
lfsck_buf_get(env, bk, len), &pos, th);
GOTO(stop, rc);
unlock:
dt_write_unlock(env, child);
stop:
dt_trans_stop(env, dev, th);
return rc;
}
static int lfsck_create_lpf_remote(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct dt_object *child,
struct lu_attr *la,
struct dt_object_format *dof,
const char *name)
{
struct dt_insert_rec *rec = &lfsck_env_info(env)->lti_dt_rec;
struct dt_object *parent = lfsck->li_lpf_root_obj;
struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
struct dt_object *bk_obj = lfsck->li_bookmark_obj;
const struct lu_fid *cfid = lfsck_dto2fid(child);
struct thandle *th = NULL;
struct linkea_data ldata = { NULL };
struct lu_buf linkea_buf;
const struct lu_name *cname;
struct dt_device *dev;
loff_t pos = 0;
int len = sizeof(struct lfsck_bookmark);
int rc;
ENTRY;
if (lfsck->li_bookmark_ram.lb_param & LPF_DRYRUN)
RETURN(0);
cname = lfsck_name_get_const(env, name, strlen(name));
rc = linkea_links_new(&ldata, &lfsck_env_info(env)->lti_linkea_buf2,
cname, lfsck_dto2fid(parent));
if (rc != 0)
RETURN(rc);
/* Create .lustre/lost+found/MDTxxxx. */
/* XXX: Currently, cross-MDT create operation needs to create the child
* object firstly, then insert name into the parent directory. For
* this case, the child object resides on current MDT (local), but
* the parent ".lustre/lost+found" may be on remote MDT. It is not
* easy to contain all the sub-modifications orderly within single
* transaction.
*
* To avoid more inconsistency, we split the create operation into
* two transactions:
*
* 1) create the child and update the lfsck_bookmark::lb_lpf_fid
* locally.
* 2) insert the name "MDTXXXX" in the parent ".lustre/lost+found"
* remotely.
*
* If 1) done, but 2) failed, then go ahead, the LFSCK will try to
* repair such inconsistency when LFSCK run next time.
*/
/* Transaction I: locally */
dev = lfsck_obj2dev(child);
th = lfsck_trans_create(env, dev, lfsck);
if (IS_ERR(th))
RETURN(PTR_ERR(th));
/* 1a. create child */
rc = dt_declare_create(env, child, la, NULL, dof, th);
if (rc != 0)
GOTO(stop, rc);
if (!dt_try_as_dir(env, child, false))
GOTO(stop, rc = -ENOTDIR);
/* 2a. increase child nlink */
rc = dt_declare_ref_add(env, child, th);
if (rc != 0)
GOTO(stop, rc);
/* 3a. insert dot into child dir */
rec->rec_type = S_IFDIR;
rec->rec_fid = cfid;
rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
(const struct dt_key *)dot, th);
if (rc != 0)
GOTO(stop, rc);
/* 4a. insert dotdot into child dir */
rec->rec_fid = &LU_LPF_FID;
rc = dt_declare_insert(env, child, (const struct dt_rec *)rec,
(const struct dt_key *)dotdot, th);
if (rc != 0)
GOTO(stop, rc);
/* 5a. insert linkEA for child */
lfsck_buf_init(&linkea_buf, ldata.ld_buf->lb_buf,
ldata.ld_leh->leh_len);
rc = dt_declare_xattr_set(env, child, NULL, &linkea_buf,
XATTR_NAME_LINK, 0, th);
if (rc != 0)
GOTO(stop, rc);
/* 6a. update bookmark */
rc = dt_declare_record_write(env, bk_obj,
lfsck_buf_get(env, bk, len), 0, th);
if (rc != 0)
GOTO(stop, rc);
rc = dt_trans_start_local(env, dev, th);
if (rc != 0)
GOTO(stop, rc);
dt_write_lock(env, child, 0);
/* 1b. create child */
rc = dt_create(env, child, la, NULL, dof, th);
if (rc != 0)
GOTO(unlock, rc);
/* 2b. increase child nlink */
rc = dt_ref_add(env, child, th);
if (rc != 0)
GOTO(unlock, rc);
/* 3b. insert dot into child dir */
rec->rec_type = S_IFDIR;
rec->rec_fid = cfid;
rc = dt_insert(env, child, (const struct dt_rec *)rec,
(const struct dt_key *)dot, th);
if (rc != 0)
GOTO(unlock, rc);
/* 4b. insert dotdot into child dir */
rec->rec_fid = &LU_LPF_FID;
rc = dt_insert(env, child, (const struct dt_rec *)rec,
(const struct dt_key *)dotdot, th);
if (rc != 0)
GOTO(unlock, rc);
/* 5b. insert linkEA for child */
rc = dt_xattr_set(env, child, &linkea_buf,
XATTR_NAME_LINK, 0, th);
if (rc != 0)
GOTO(unlock, rc);
bk->lb_lpf_fid = *cfid;
lfsck_bookmark_cpu_to_le(&lfsck->li_bookmark_disk, bk);
/* 6b. update bookmark */
rc = dt_record_write(env, bk_obj,
lfsck_buf_get(env, bk, len), &pos, th);
dt_write_unlock(env, child);
dt_trans_stop(env, dev, th);
if (rc != 0)
RETURN(rc);
/* Transaction II: remotely */
dev = lfsck_obj2dev(parent);
th = lfsck_trans_create(env, dev, lfsck);
if (IS_ERR(th))
RETURN(PTR_ERR(th));
th->th_sync = 1;
/* 5a. insert name into parent dir */
rec->rec_fid = cfid;
rc = dt_declare_insert(env, parent, (const struct dt_rec *)rec,
(const struct dt_key *)name, th);
if (rc != 0)
GOTO(stop, rc);
/* 6a. increase parent nlink */
rc = dt_declare_ref_add(env, parent, th);
if (rc != 0)
GOTO(stop, rc);
rc = dt_trans_start_local(env, dev, th);
if (rc != 0)
GOTO(stop, rc);
/* 5b. insert name into parent dir */
rc = dt_insert(env, parent, (const struct dt_rec *)rec,
(const struct dt_key *)name, th);
if (rc != 0)
GOTO(stop, rc);
dt_write_lock(env, parent, 0);
/* 6b. increase parent nlink */
rc = dt_ref_add(env, parent, th);
dt_write_unlock(env, parent);
GOTO(stop, rc);
unlock:
dt_write_unlock(env, child);
stop:
dt_trans_stop(env, dev, th);
if (rc != 0 && dev == lfsck_obj2dev(parent))
CDEBUG(D_LFSCK,
"%s: partially created the object "DFID"for orphans, but failed to insert the name %s to the .lustre/lost+found/. Such inconsistency will be repaired when LFSCK run next time: rc = %d\n",
lfsck_lfsck2name(lfsck), PFID(cfid), name, rc);
return rc;
}
/**
* lfsck_create_lpf() - Create the MDTxxxx directory under
* /ROOT/.lustre/lost+found/
* @env: pointer to the thread context
* @lfsck: pointer to the lfsck instance
*
* The /ROOT/.lustre/lost+found/MDTxxxx/ directory is used for holding
* orphans and other uncertain inconsistent objects found during the
* LFSCK. Such directory will be created by the LFSCK engine on the
* local MDT before the LFSCK scanning.
*
* Return:
* * %0 for success
* * %negative error number on failure
*/
static int lfsck_create_lpf(const struct lu_env *env,
struct lfsck_instance *lfsck)
{
struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
struct lfsck_thread_info *info = lfsck_env_info(env);
struct lu_fid *cfid = &info->lti_fid2;
struct lu_attr *la = &info->lti_la;
struct dt_object_format *dof = &info->lti_dof;
struct dt_object *parent = lfsck->li_lpf_root_obj;
struct dt_object *child = NULL;
struct lfsck_lock_handle *llh = &info->lti_llh;
char name[8];
int node = lfsck_dev_idx(lfsck);
int rc = 0;
ENTRY;
LASSERT(lfsck->li_master);
LASSERT(parent != NULL);
LASSERT(lfsck->li_lpf_obj == NULL);
snprintf(name, 8, "MDT%04x", node);
rc = lfsck_lock(env, lfsck, parent, name, llh,
MDS_INODELOCK_UPDATE, LCK_PW);
if (rc != 0)
RETURN(rc);
if (fid_is_zero(&bk->lb_lpf_fid)) {
/* There is corner case that: in former LFSCK scanning we have
* created the .lustre/lost+found/MDTxxxx but failed to update
* the lfsck_bookmark::lb_lpf_fid successfully. So need lookup
* it from MDT0 firstly.
*/
rc = dt_lookup_dir(env, parent, name, cfid);
if (rc != 0 && rc != -ENOENT)
GOTO(unlock, rc);
if (rc == 0) {
bk->lb_lpf_fid = *cfid;
rc = lfsck_bookmark_store(env, lfsck);
} else {
rc = lfsck_fid_alloc(env, lfsck, cfid, true);
}
if (rc != 0)
GOTO(unlock, rc);
} else {
*cfid = bk->lb_lpf_fid;
}
child = lfsck_object_find_bottom_new(env, lfsck, cfid);
if (IS_ERR(child))
GOTO(unlock, rc = PTR_ERR(child));
if (dt_object_exists(child)) {
if (unlikely(!dt_try_as_dir(env, child, true)))
rc = -ENOTDIR;
else
lfsck->li_lpf_obj = child;
GOTO(unlock, rc);
}
memset(la, 0, sizeof(*la));
la->la_atime = la->la_mtime = la->la_ctime = ktime_get_real_seconds();
la->la_mode = S_IFDIR | 0700;
la->la_valid = LA_ATIME | LA_MTIME | LA_CTIME | LA_MODE |
LA_UID | LA_GID | LA_TYPE;
memset(dof, 0, sizeof(*dof));
dof->dof_type = dt_mode_to_dft(S_IFDIR);
if (node == 0)
rc = lfsck_create_lpf_local(env, lfsck, child, la, dof, name);
else
rc = lfsck_create_lpf_remote(env, lfsck, child, la, dof, name);
if (rc == 0)
lfsck->li_lpf_obj = child;
GOTO(unlock, rc);
unlock:
lfsck_unlock(llh);
if (rc != 0 && child != NULL && !IS_ERR(child))
lfsck_object_put(env, child);
return rc;
}
/**
* lfsck_scan_lpf_bad_entries() - Scan .lustre/lost+found for bad name entries
* and remove them.
* @env: pointer to the thread context
* @lfsck: pointer to the lfsck instance
*
* The valid name entry should be "MDTxxxx", the "xxxx" is the MDT device
* index in the system. Any other formatted name is invalid and should be
* removed.
*
* Return:
* * %0 for success
* * %negative error number on failure
*/
static int lfsck_scan_lpf_bad_entries(const struct lu_env *env,
struct lfsck_instance *lfsck)
{
struct dt_object *parent = lfsck->li_lpf_root_obj;
struct lu_dirent *ent =
(struct lu_dirent *)lfsck_env_info(env)->lti_key;
const struct dt_it_ops *iops = &parent->do_index_ops->dio_it;
struct dt_it *it;
int rc;
ENTRY;
it = iops->init(env, parent, LUDA_64BITHASH);
if (IS_ERR(it))
RETURN(PTR_ERR(it));
rc = iops->load(env, it, 0);
if (rc == 0)
rc = iops->next(env, it);
else if (rc > 0)
rc = 0;
while (rc == 0) {
int off = 3;
rc = iops->rec(env, it, (struct dt_rec *)ent, LUDA_64BITHASH);
if (rc != 0)
break;
ent->lde_namelen = le16_to_cpu(ent->lde_namelen);
if (name_is_dot_or_dotdot(ent->lde_name, ent->lde_namelen))
goto next;
/* name length must be strlen("MDTxxxx") */
if (ent->lde_namelen != 7)
goto remove;
if (memcmp(ent->lde_name, "MDT", off) != 0)
goto remove;
while (off < 7 && isxdigit(ent->lde_name[off]))
off++;
if (off != 7) {
remove:
rc = lfsck_lpf_remove_name_entry(env, lfsck,
ent->lde_name);
if (rc != 0)
break;
}
next:
rc = iops->next(env, it);
}
iops->put(env, it);
iops->fini(env, it);
RETURN(rc > 0 ? 0 : rc);
}
static int lfsck_update_lpf_entry(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct dt_object *parent,
struct dt_object *child,
const char *name,
enum lfsck_verify_lpf_types type)
{
int rc;
if (type == LVLT_BY_BOOKMARK) {
rc = lfsck_update_name_entry(env, lfsck, parent, name,
lfsck_dto2fid(child), S_IFDIR);
} else /* if (type == LVLT_BY_NAMEENTRY) */ {
lfsck->li_bookmark_ram.lb_lpf_fid = *lfsck_dto2fid(child);
rc = lfsck_bookmark_store(env, lfsck);
CDEBUG(D_LFSCK, "%s: update LPF fid "DFID
" in the bookmark file: rc = %d\n",
lfsck_lfsck2name(lfsck),
PFID(lfsck_dto2fid(child)), rc);
}
return rc;
}
/**
* lfsck_verify_lpf_pairs() - Check whether the @child back references the
* @parent.
* @env: pointer to the thread context
* @lfsck: pointer to the lfsck instance
* @child: pointer to the lost+found sub-directory object
* @name: the name for lost+found sub-directory object
* @fid: pointer to the buffer to hold the FID of the object
* (called it as parent2) that is referenced via the child's dotdot entry;
* it also can be the FID that is referenced by the name entry under the
* parent2. [out]
* @type: to indicate where the child's FID is stored in
*
* Two cases:
* 1) The child's FID is stored in the bookmark file. If the child back
* references the parent (LU_LPF_FID object) via its ".." entry, then
* insert the name (MDTxxxx) to the .lustre/lost+found; otherwise, if
* the child back references another parent2, then:
* 1.1) If the parent2 recognizes the child, then update the bookmark file;
* 1.2) Otherwise, the LFSCK cannot know whether there will be parent3 that
* references the child. So keep them there. As the LFSCK processing,
* the parent3 may be found, then when the LFSCK run next time, the
* inconsistency can be repaired.
*
* 2) The child's FID is stored in the .lustre/lost+found/ sub-directory name
* entry (MDTxxxx). If the child back references the parent (LU_LPF_FID obj)
* via its ".." entry, then update the bookmark file, otherwise, if the child
* back references another parent2, then:
* 2.1) If the parent2 recognizes the child, then remove the sub-directory
* from .lustre/lost+found/;
* 2.2) Otherwise, if the parent2 does not recognizes the child, trust the
* sub-directory name entry and update the child;
* 2.3) Otherwise, if we do not know whether the parent2 recognizes the child
* or not, then keep them there.
*
* Return:
* * %positive number for uncertain inconsistency
* * %0 for success
* * %negative error number on failure
*/
static int lfsck_verify_lpf_pairs(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct dt_object *child, const char *name,
struct lu_fid *fid,
enum lfsck_verify_lpf_types type)
{
struct dt_object *parent = lfsck->li_lpf_root_obj;
struct lfsck_thread_info *info = lfsck_env_info(env);
char *name2 = info->lti_key;
struct lu_fid *fid2 = &info->lti_fid3;
struct dt_object *parent2 = NULL;
struct lustre_handle lh = { 0 };
int rc;
ENTRY;
fid_zero(fid);
rc = dt_lookup_dir(env, child, dotdot, fid);
if (rc != 0)
GOTO(linkea, rc);
if (!fid_is_sane(fid))
GOTO(linkea, rc = -EINVAL);
if (lu_fid_eq(fid, &LU_LPF_FID)) {
const struct lu_name *cname;
if (lfsck->li_lpf_obj == NULL) {
lu_object_get(&child->do_lu);
lfsck->li_lpf_obj = child;
}
cname = lfsck_name_get_const(env, name, strlen(name));
rc = lfsck_verify_linkea(env, lfsck, child, cname, &LU_LPF_FID);
if (rc == 0)
rc = lfsck_update_lpf_entry(env, lfsck, parent, child,
name, type);
GOTO(out_done, rc);
}
parent2 = lfsck_object_find_bottom(env, lfsck, fid);
if (IS_ERR(parent2))
GOTO(linkea, parent2);
if (!dt_try_as_dir(env, parent2, true)) {
lfsck_object_put(env, parent2);
GOTO(linkea, parent2 = ERR_PTR(-ENOTDIR));
}
linkea:
/* To prevent rename/unlink race */
rc = lfsck_ibits_lock(env, lfsck, child, &lh,
MDS_INODELOCK_UPDATE, LCK_PR);
if (rc != 0)
GOTO(out_put, rc);
dt_read_lock(env, child, 0);
rc = lfsck_links_get_first(env, child, name2, fid2);
if (rc != 0) {
dt_read_unlock(env, child);
lfsck_ibits_unlock(&lh, LCK_PR);
GOTO(out_put, rc = 1);
}
/* It is almost impossible that the bookmark file (or the name entry)
* and the linkEA hit the same data corruption. Trust the linkEA.
*/
if (lu_fid_eq(fid2, &LU_LPF_FID) && strcmp(name, name2) == 0) {
dt_read_unlock(env, child);
lfsck_ibits_unlock(&lh, LCK_PR);
*fid = *fid2;
if (lfsck->li_lpf_obj == NULL) {
lu_object_get(&child->do_lu);
lfsck->li_lpf_obj = child;
}
/* Update the child's dotdot entry */
rc = lfsck_update_name_entry(env, lfsck, child, dotdot,
&LU_LPF_FID, S_IFDIR);
if (rc == 0)
rc = lfsck_update_lpf_entry(env, lfsck, parent, child,
name, type);
GOTO(out_put, rc);
}
if (parent2 == NULL || IS_ERR(parent2)) {
dt_read_unlock(env, child);
lfsck_ibits_unlock(&lh, LCK_PR);
GOTO(out_done, rc = 1);
}
rc = dt_lookup_dir(env, parent2, name2, fid);
dt_read_unlock(env, child);
lfsck_ibits_unlock(&lh, LCK_PR);
if (rc != 0 && rc != -ENOENT)
GOTO(out_put, rc);
if (rc == -ENOENT || !lu_fid_eq(fid, lfsck_dto2fid(child))) {
if (type == LVLT_BY_BOOKMARK)
GOTO(out_put, rc = 1);
/* Trust the name entry, update the child's dotdot entry. */
rc = lfsck_update_name_entry(env, lfsck, child, dotdot,
&LU_LPF_FID, S_IFDIR);
GOTO(out_put, rc);
}
if (type == LVLT_BY_BOOKMARK) {
/* Invalid FID record in the bookmark file, reset it. */
fid_zero(&lfsck->li_bookmark_ram.lb_lpf_fid);
rc = lfsck_bookmark_store(env, lfsck);
CDEBUG(D_LFSCK, "%s: reset invalid LPF fid "DFID
" in the bookmark file: rc = %d\n",
lfsck_lfsck2name(lfsck), PFID(lfsck_dto2fid(child)), rc);
} else /* if (type == LVLT_BY_NAMEENTRY) */ {
/* The name entry is wrong, remove it. */
rc = lfsck_lpf_remove_name_entry(env, lfsck, name);
}
GOTO(out_put, rc);
out_put:
if (parent2 != NULL && !IS_ERR(parent2))
lfsck_object_put(env, parent2);
out_done:
return rc;
}
/**
* lfsck_verify_lpf() - Verify the /ROOT/.lustre/lost+found/ directory.
* @env: pointer to the thread context
* @lfsck: pointer to the lfsck instance
*
* /ROOT/.lustre/lost+found/ is a special directory to hold the objects that
* the LFSCK does not exactly know how to handle, such as orphans. So before
* the LFSCK scanning the system, the consistency of such directory needs to
* be verified firstly to allow the users to use it during the LFSCK.
*
* Return:
* * %positive number for uncertain inconsistency
* * %0 for success
* * %negative error number on failure
*/
int lfsck_verify_lpf(const struct lu_env *env, struct lfsck_instance *lfsck)
{
struct lfsck_thread_info *info = lfsck_env_info(env);
struct lu_fid *pfid = &info->lti_fid;
struct lu_fid *cfid = &info->lti_fid2;
struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
struct dt_object *parent;
/* child1's FID is in the bookmark file. */
struct dt_object *child1 = NULL;
/* child2's FID is in the name entry MDTxxxx. */
struct dt_object *child2 = NULL;
const struct lu_name *cname;
char name[8];
int node = lfsck_dev_idx(lfsck);
int rc = 0;
ENTRY;
LASSERT(lfsck->li_master);
if (lfsck_is_dryrun(lfsck))
RETURN(0);
if (lfsck->li_lpf_root_obj != NULL)
RETURN(0);
if (node == 0) {
parent = lfsck_object_find_by_dev(env, lfsck->li_bottom,
&LU_LPF_FID);
} else {
struct lfsck_tgt_desc *ltd;
ltd = lfsck_tgt_get(&lfsck->li_mdt_descs, 0);
if (unlikely(ltd == NULL))
RETURN(-ENXIO);
parent = lfsck_object_find_by_dev(env, ltd->ltd_tgt,
&LU_LPF_FID);
kref_put(<d->ltd_ref, lfsck_tgt_free);
}
if (IS_ERR(parent))
RETURN(PTR_ERR(parent));
LASSERT(dt_object_exists(parent));
if (unlikely(!dt_try_as_dir(env, parent, true))) {
lfsck_object_put(env, parent);
GOTO(put, rc = -ENOTDIR);
}
lfsck->li_lpf_root_obj = parent;
if (node == 0) {
rc = lfsck_scan_lpf_bad_entries(env, lfsck);
if (rc != 0)
CDEBUG(D_LFSCK,
"%s: scan .lustre/lost+found/ for bad sub-directories: rc = %d\n",
lfsck_lfsck2name(lfsck), rc);
}
/* child2 */
snprintf(name, 8, "MDT%04x", node);
rc = dt_lookup_dir(env, parent, name, cfid);
if (rc == -ENOENT) {
rc = 0;
goto find_child1;
}
if (rc != 0)
GOTO(put, rc);
/* Invalid FID in the name entry, remove the name entry. */
if (!fid_is_norm(cfid)) {
rc = lfsck_lpf_remove_name_entry(env, lfsck, name);
if (rc != 0)
GOTO(put, rc);
goto find_child1;
}
child2 = lfsck_object_find_bottom(env, lfsck, cfid);
if (IS_ERR(child2))
GOTO(put, rc = PTR_ERR(child2));
if (unlikely(!dt_object_exists(child2) ||
dt_object_remote(child2)) ||
!S_ISDIR(lfsck_object_type(child2))) {
rc = lfsck_lpf_remove_name_entry(env, lfsck, name);
if (rc != 0)
GOTO(put, rc);
goto find_child1;
}
if (unlikely(!dt_try_as_dir(env, child2, true)))
GOTO(put, rc = -ENOTDIR);
find_child1:
if (fid_is_zero(&bk->lb_lpf_fid))
goto check_child2;
if (likely(lu_fid_eq(cfid, &bk->lb_lpf_fid))) {
if (lfsck->li_lpf_obj == NULL) {
lu_object_get(&child2->do_lu);
lfsck->li_lpf_obj = child2;
}
cname = lfsck_name_get_const(env, name, strlen(name));
rc = lfsck_verify_linkea(env, lfsck, child2, cname,
&LU_LPF_FID);
GOTO(put, rc);
}
if (unlikely(!fid_is_norm(&bk->lb_lpf_fid))) {
struct lu_fid tfid = bk->lb_lpf_fid;
/* Invalid FID record in the bookmark file, reset it. */
fid_zero(&bk->lb_lpf_fid);
rc = lfsck_bookmark_store(env, lfsck);
CDEBUG(D_LFSCK, "%s: reset invalid LPF fid "DFID
" in the bookmark file: rc = %d\n",
lfsck_lfsck2name(lfsck), PFID(&tfid), rc);
if (rc != 0)
GOTO(put, rc);
goto check_child2;
}
child1 = lfsck_object_find_bottom(env, lfsck, &bk->lb_lpf_fid);
if (IS_ERR(child1)) {
child1 = NULL;
goto check_child2;
}
if (unlikely(!dt_object_exists(child1) ||
dt_object_remote(child1)) ||
!S_ISDIR(lfsck_object_type(child1))) {
/* Invalid FID record in the bookmark file, reset it. */
fid_zero(&bk->lb_lpf_fid);
rc = lfsck_bookmark_store(env, lfsck);
CDEBUG(D_LFSCK, "%s: reset invalid LPF fid "DFID
" in the bookmark file: rc = %d\n",
lfsck_lfsck2name(lfsck),
PFID(lfsck_dto2fid(child1)), rc);
if (rc != 0)
GOTO(put, rc);
lfsck_object_put(env, child1);
child1 = NULL;
goto check_child2;
}
if (unlikely(!dt_try_as_dir(env, child1, true))) {
lfsck_object_put(env, child1);
child1 = NULL;
rc = -ENOTDIR;
goto check_child2;
}
rc = lfsck_verify_lpf_pairs(env, lfsck, child1, name, pfid,
LVLT_BY_BOOKMARK);
if (lu_fid_eq(pfid, &LU_LPF_FID))
GOTO(put, rc);
check_child2:
if (child2 != NULL)
rc = lfsck_verify_lpf_pairs(env, lfsck, child2, name,
pfid, LVLT_BY_NAMEENTRY);
GOTO(put, rc);
put:
if (lfsck->li_lpf_obj != NULL) {
if (unlikely(!dt_try_as_dir(env, lfsck->li_lpf_obj, true))) {
lfsck_object_put(env, lfsck->li_lpf_obj);
lfsck->li_lpf_obj = NULL;
rc = -ENOTDIR;
}
} else if (rc == 0) {
rc = lfsck_create_lpf(env, lfsck);
}
if (child2 != NULL && !IS_ERR(child2))
lfsck_object_put(env, child2);
if (child1 != NULL && !IS_ERR(child1))
lfsck_object_put(env, child1);
return rc;
}
static int lfsck_fid_init(struct lfsck_instance *lfsck)
{
struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
struct seq_server_site *ss = lfsck_dev_site(lfsck);
char *prefix;
int rc = 0;
ENTRY;
if (unlikely(ss == NULL))
RETURN(-ENXIO);
OBD_ALLOC_PTR(lfsck->li_seq);
if (lfsck->li_seq == NULL)
RETURN(-ENOMEM);
OBD_ALLOC(prefix, MAX_OBD_NAME + 7);
if (prefix == NULL)
GOTO(out, rc = -ENOMEM);
snprintf(prefix, MAX_OBD_NAME + 7, "lfsck-%s", lfsck_lfsck2name(lfsck));
seq_client_init(lfsck->li_seq, NULL, LUSTRE_SEQ_METADATA, prefix,
ss->ss_server_seq);
OBD_FREE(prefix, MAX_OBD_NAME + 7);
if (fid_is_sane(&bk->lb_last_fid))
lfsck->li_seq->lcs_fid = bk->lb_last_fid;
RETURN(0);
out:
OBD_FREE_PTR(lfsck->li_seq);
lfsck->li_seq = NULL;
return rc;
}
static void lfsck_fid_fini(struct lfsck_instance *lfsck)
{
if (lfsck->li_seq != NULL) {
seq_client_fini(lfsck->li_seq);
OBD_FREE_PTR(lfsck->li_seq);
lfsck->li_seq = NULL;
}
}
void lfsck_instance_cleanup(const struct lu_env *env,
struct lfsck_instance *lfsck)
{
struct lfsck_component *com;
struct lfsck_component *next;
struct lfsck_lmv_unit *llu;
struct lfsck_lmv_unit *llu_next;
struct lfsck_lmv *llmv;
ENTRY;
LASSERT(list_empty(&lfsck->li_link));
LASSERT(!lfsck->li_task);
if (lfsck->li_obj_oit != NULL) {
lfsck_object_put(env, lfsck->li_obj_oit);
lfsck->li_obj_oit = NULL;
}
list_for_each_entry_safe(llu, llu_next, &lfsck->li_list_lmv, llu_link) {
llmv = &llu->llu_lmv;
LASSERTF(atomic_read(&llmv->ll_ref) == 1,
"still in using: %u\n",
atomic_read(&llmv->ll_ref));
lfsck_lmv_put(env, llmv);
}
list_for_each_entry_safe(com, next, &lfsck->li_list_scan, lc_link) {
lfsck_component_cleanup(env, com);
}
LASSERT(list_empty(&lfsck->li_list_dir));
list_for_each_entry_safe(com, next, &lfsck->li_list_double_scan,
lc_link) {
lfsck_component_cleanup(env, com);
}
list_for_each_entry_safe(com, next, &lfsck->li_list_idle, lc_link) {
lfsck_component_cleanup(env, com);
}
lfsck_tgt_descs_fini(&lfsck->li_ost_descs);
lfsck_tgt_descs_fini(&lfsck->li_mdt_descs);
if (lfsck->li_lfsck_dir != NULL) {
lfsck_object_put(env, lfsck->li_lfsck_dir);
lfsck->li_lfsck_dir = NULL;
}
if (lfsck->li_bookmark_obj != NULL) {
lfsck_object_put(env, lfsck->li_bookmark_obj);
lfsck->li_bookmark_obj = NULL;
}
if (lfsck->li_lpf_obj != NULL) {
lfsck_object_put(env, lfsck->li_lpf_obj);
lfsck->li_lpf_obj = NULL;
}
if (lfsck->li_lpf_root_obj != NULL) {
lfsck_object_put(env, lfsck->li_lpf_root_obj);
lfsck->li_lpf_root_obj = NULL;
}
if (lfsck->li_los != NULL) {
local_oid_storage_fini(env, lfsck->li_los);
lfsck->li_los = NULL;
}
lfsck_fid_fini(lfsck);
OBD_FREE_PTR(lfsck);
}
static inline struct lfsck_instance *
__lfsck_instance_find(struct dt_device *key, bool ref, bool unlink)
{
struct lfsck_instance *lfsck;
list_for_each_entry(lfsck, &lfsck_instance_list, li_link) {
if (lfsck->li_bottom == key) {
if (ref)
lfsck_instance_get(lfsck);
if (unlink)
list_del_init(&lfsck->li_link);
return lfsck;
}
}
return NULL;
}
struct lfsck_instance *lfsck_instance_find(struct dt_device *key, bool ref,
bool unlink)
{
struct lfsck_instance *lfsck;
spin_lock(&lfsck_instance_lock);
lfsck = __lfsck_instance_find(key, ref, unlink);
spin_unlock(&lfsck_instance_lock);
return lfsck;
}
static inline int lfsck_instance_add(struct lfsck_instance *lfsck)
{
struct lfsck_instance *tmp;
spin_lock(&lfsck_instance_lock);
list_for_each_entry(tmp, &lfsck_instance_list, li_link) {
if (lfsck->li_bottom == tmp->li_bottom) {
spin_unlock(&lfsck_instance_lock);
return -EEXIST;
}
}
list_add_tail(&lfsck->li_link, &lfsck_instance_list);
spin_unlock(&lfsck_instance_lock);
return 0;
}
void lfsck_bits_dump(struct seq_file *m, int bits, const char *const names[],
const char *prefix)
{
int flag;
int i;
bool newline = (bits != 0 ? false : true);
seq_printf(m, "%s:%c", prefix, bits != 0 ? ' ' : '\n');
for (i = 0, flag = 1; bits != 0; i++, flag = BIT(i)) {
if (flag & bits) {
bits &= ~flag;
if (names[i] != NULL) {
if (bits == 0)
newline = true;
seq_printf(m, "%s%c", names[i],
newline ? '\n' : ',');
}
}
}
if (!newline)
seq_putc(m, '\n');
}
void lfsck_time_dump(struct seq_file *m, time64_t time, const char *name)
{
if (time == 0) {
seq_printf(m, "%s_time: N/A\n", name);
seq_printf(m, "time_since_%s: N/A\n", name);
} else {
seq_printf(m, "%s_time: %lld\n", name, time);
seq_printf(m, "time_since_%s: %lld seconds\n",
name, ktime_get_real_seconds() - time);
}
}
void lfsck_pos_dump(struct seq_file *m, struct lfsck_position *pos,
const char *prefix)
{
if (fid_is_zero(&pos->lp_dir_parent)) {
if (pos->lp_oit_cookie == 0) {
seq_printf(m, "%s: N/A, N/A, N/A\n", prefix);
return;
}
seq_printf(m, "%s: %llu, N/A, N/A\n",
prefix, pos->lp_oit_cookie);
} else {
seq_printf(m, "%s: %llu, "DFID", %#llx\n",
prefix, pos->lp_oit_cookie,
PFID(&pos->lp_dir_parent), pos->lp_dir_cookie);
}
}
void lfsck_pos_fill(const struct lu_env *env, struct lfsck_instance *lfsck,
struct lfsck_position *pos, bool init)
{
const struct dt_it_ops *iops = &lfsck->li_obj_oit->do_index_ops->dio_it;
if (unlikely(lfsck->li_di_oit == NULL)) {
memset(pos, 0, sizeof(*pos));
return;
}
pos->lp_oit_cookie = iops->store(env, lfsck->li_di_oit);
if (!lfsck->li_current_oit_processed && !init)
pos->lp_oit_cookie--;
if (unlikely(pos->lp_oit_cookie == 0))
pos->lp_oit_cookie = 1;
spin_lock(&lfsck->li_lock);
if (lfsck->li_di_dir != NULL) {
struct dt_object *dto = lfsck->li_obj_dir;
pos->lp_dir_cookie = dto->do_index_ops->dio_it.store(env,
lfsck->li_di_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(dto);
}
} else {
fid_zero(&pos->lp_dir_parent);
pos->lp_dir_cookie = 0;
}
spin_unlock(&lfsck->li_lock);
}
bool __lfsck_set_speed(struct lfsck_instance *lfsck, __u32 limit)
{
bool dirty = false;
if (limit != LFSCK_SPEED_NO_LIMIT) {
if (limit > cfs_time_seconds(1)) {
lfsck->li_sleep_rate = limit / cfs_time_seconds(1);
lfsck->li_sleep_jif = 1;
} else {
lfsck->li_sleep_rate = 1;
lfsck->li_sleep_jif = cfs_time_seconds(1) / limit;
}
} else {
lfsck->li_sleep_jif = 0;
lfsck->li_sleep_rate = 0;
}
if (lfsck->li_bookmark_ram.lb_speed_limit != limit) {
lfsck->li_bookmark_ram.lb_speed_limit = limit;
dirty = true;
}
return dirty;
}
void lfsck_control_speed(struct lfsck_instance *lfsck)
{
if (lfsck->li_sleep_jif > 0 &&
lfsck->li_new_scanned >= lfsck->li_sleep_rate) {
wait_var_event_timeout(lfsck, lfsck_should_stop(lfsck),
lfsck->li_sleep_jif);
lfsck->li_new_scanned = 0;
}
}
void lfsck_control_speed_by_self(struct lfsck_component *com)
{
struct lfsck_instance *lfsck = com->lc_lfsck;
if (lfsck->li_sleep_jif > 0 &&
com->lc_new_scanned >= lfsck->li_sleep_rate) {
wait_var_event_timeout(lfsck, lfsck_should_stop(lfsck),
lfsck->li_sleep_jif);
com->lc_new_scanned = 0;
}
}
static struct lfsck_thread_args *
lfsck_thread_args_init(struct lfsck_instance *lfsck,
struct lfsck_component *com,
struct lfsck_start_param *lsp)
{
struct lfsck_thread_args *lta;
int rc;
OBD_ALLOC_PTR(lta);
if (lta == NULL)
return ERR_PTR(-ENOMEM);
rc = lu_env_init(<a->lta_env, LCT_MD_THREAD | LCT_DT_THREAD);
if (rc != 0) {
OBD_FREE_PTR(lta);
return ERR_PTR(rc);
}
lta->lta_lfsck = lfsck_instance_get(lfsck);
if (com != NULL)
lta->lta_com = lfsck_component_get(com);
lta->lta_lsp = *lsp;
if (lsp->lsp_start) {
lta->lta_start = *lsp->lsp_start;
lta->lta_lsp.lsp_start = <a->lta_start;
}
return lta;
}
void lfsck_thread_args_fini(struct lfsck_thread_args *lta)
{
if (lta->lta_com != NULL)
lfsck_component_put(<a->lta_env, lta->lta_com);
lfsck_instance_put(<a->lta_env, lta->lta_lfsck);
lu_env_fini(<a->lta_env);
OBD_FREE_PTR(lta);
}
struct lfsck_assistant_data *
lfsck_assistant_data_init(const struct lfsck_assistant_operations *lao,
const char *name)
{
struct lfsck_assistant_data *lad;
OBD_ALLOC_PTR(lad);
if (lad != NULL) {
lad->lad_bitmap = bitmap_zalloc(BITS_PER_LONG, GFP_KERNEL);
if (lad->lad_bitmap == NULL) {
OBD_FREE_PTR(lad);
return NULL;
}
lad->lad_bitmap_count = BITS_PER_LONG;
INIT_LIST_HEAD(&lad->lad_req_list);
spin_lock_init(&lad->lad_lock);
INIT_LIST_HEAD(&lad->lad_ost_list);
INIT_LIST_HEAD(&lad->lad_ost_phase1_list);
INIT_LIST_HEAD(&lad->lad_ost_phase2_list);
INIT_LIST_HEAD(&lad->lad_mdt_list);
INIT_LIST_HEAD(&lad->lad_mdt_phase1_list);
INIT_LIST_HEAD(&lad->lad_mdt_phase2_list);
lad->lad_ops = lao;
lad->lad_name = name;
}
return lad;
}
struct lfsck_assistant_object *
lfsck_assistant_object_init(const struct lu_env *env, const struct lu_fid *fid,
const struct lu_attr *attr, __u64 cookie,
bool is_dir)
{
struct lfsck_assistant_object *lso;
OBD_ALLOC_PTR(lso);
if (lso == NULL)
return ERR_PTR(-ENOMEM);
lso->lso_fid = *fid;
if (attr != NULL)
lso->lso_attr = *attr;
kref_init(&lso->lso_ref);
lso->lso_oit_cookie = cookie;
if (is_dir)
lso->lso_is_dir = 1;
return lso;
}
struct dt_object *
lfsck_assistant_object_load(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct lfsck_assistant_object *lso)
{
struct dt_object *obj;
obj = lfsck_object_find_bottom(env, lfsck, &lso->lso_fid);
if (IS_ERR(obj))
return obj;
if (unlikely(!dt_object_exists(obj) || lfsck_is_dead_obj(obj))) {
lso->lso_dead = 1;
lfsck_object_put(env, obj);
return ERR_PTR(-ENOENT);
}
if (lso->lso_is_dir && unlikely(!dt_try_as_dir(env, obj, true))) {
lfsck_object_put(env, obj);
return ERR_PTR(-ENOTDIR);
}
return obj;
}
/**
* lfsck_async_interpret_common() - Generic LFSCK async communication interpretor
* @env: pointer to the thread context
* @req: pointer to the LFSCK request
* @args: pointer to the lfsck_async_interpret_args
* @rc: the result for handling the LFSCK request
*
* Generic LFSCK asynchronous communication interpretor function.
* The LFSCK RPC reply for both the event notification and status
* querying will be handled here.
*
* Return:
* * %0 for success
* * %negative error number on failure
*/
int lfsck_async_interpret_common(const struct lu_env *env,
struct ptlrpc_request *req,
void *args, int rc)
{
struct lfsck_async_interpret_args *laia = args;
struct lfsck_component *com = laia->laia_com;
struct lfsck_assistant_data *lad = com->lc_data;
struct lfsck_tgt_descs *ltds = laia->laia_ltds;
struct lfsck_tgt_desc *ltd = laia->laia_ltd;
struct lfsck_request *lr = laia->laia_lr;
LASSERT(com->lc_lfsck->li_master);
switch (lr->lr_event) {
case LE_START:
if (unlikely(rc == -EINPROGRESS)) {
ltd->ltd_retry_start = 1;
break;
}
if (rc != 0) {
CDEBUG(D_LFSCK,
"%s: fail to notify %s %x for %s start: rc = %d\n",
lfsck_lfsck2name(com->lc_lfsck),
(lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
ltd->ltd_index, lad->lad_name, rc);
if (com->lc_type == LFSCK_TYPE_LAYOUT) {
struct lfsck_layout *lo = com->lc_file_ram;
if (lr->lr_flags & LEF_TO_OST)
lfsck_lad_set_bitmap(env, com,
ltd->ltd_index);
else
lo->ll_flags |= LF_INCOMPLETE;
} else {
struct lfsck_namespace *ns = com->lc_file_ram;
/* If some MDT does not join the namespace
* LFSCK, then we cannot know whether there
* is some name entry on such MDT that with
* the referenced MDT-object on this MDT or
* not. So the namespace LFSCK on this MDT
* cannot handle orphan MDT-objects properly.
* So we mark the LFSCK as LF_INCOMPLETE and
* skip orphan MDT-objects handling.
*/
ns->ln_flags |= LF_INCOMPLETE;
}
break;
}
spin_lock(<ds->ltd_lock);
if (ltd->ltd_dead) {
spin_unlock(<ds->ltd_lock);
break;
}
if (com->lc_type == LFSCK_TYPE_LAYOUT) {
struct list_head *list;
struct list_head *phase_list;
if (ltd->ltd_layout_done) {
spin_unlock(<ds->ltd_lock);
break;
}
if (lr->lr_flags & LEF_TO_OST) {
list = &lad->lad_ost_list;
phase_list = &lad->lad_ost_phase1_list;
} else {
list = &lad->lad_mdt_list;
phase_list = &lad->lad_mdt_phase1_list;
}
if (list_empty(<d->ltd_layout_list))
list_add_tail(<d->ltd_layout_list, list);
if (list_empty(<d->ltd_layout_phase_list))
list_add_tail(<d->ltd_layout_phase_list,
phase_list);
} else {
if (ltd->ltd_namespace_done) {
spin_unlock(<ds->ltd_lock);
break;
}
if (list_empty(<d->ltd_namespace_list))
list_add_tail(<d->ltd_namespace_list,
&lad->lad_mdt_list);
if (list_empty(<d->ltd_namespace_phase_list))
list_add_tail(<d->ltd_namespace_phase_list,
&lad->lad_mdt_phase1_list);
}
spin_unlock(<ds->ltd_lock);
break;
case LE_STOP:
case LE_PHASE1_DONE:
case LE_PHASE2_DONE:
case LE_PEER_EXIT:
if (rc != 0 && rc != -EALREADY)
CDEBUG(D_LFSCK,
"%s: fail to notify %s %x for %s: event = %d, rc = %d\n",
lfsck_lfsck2name(com->lc_lfsck),
(lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
ltd->ltd_index, lad->lad_name, lr->lr_event, rc);
break;
case LE_QUERY: {
struct lfsck_reply *reply;
struct list_head *list;
struct list_head *phase_list;
if (com->lc_type == LFSCK_TYPE_LAYOUT) {
list = <d->ltd_layout_list;
phase_list = <d->ltd_layout_phase_list;
} else {
list = <d->ltd_namespace_list;
phase_list = <d->ltd_namespace_phase_list;
}
if (rc != 0) {
if (lr->lr_flags & LEF_QUERY_ALL) {
lfsck_reset_ltd_status(ltd, com->lc_type);
break;
}
spin_lock(<ds->ltd_lock);
list_del_init(phase_list);
list_del_init(list);
spin_unlock(<ds->ltd_lock);
break;
}
reply = req_capsule_server_get(&req->rq_pill,
&RMF_LFSCK_REPLY);
if (reply == NULL) {
rc = -EPROTO;
CDEBUG(D_LFSCK,
"%s: invalid query reply for %s: rc = %d\n",
lfsck_lfsck2name(com->lc_lfsck),
lad->lad_name, rc);
if (lr->lr_flags & LEF_QUERY_ALL) {
lfsck_reset_ltd_status(ltd, com->lc_type);
break;
}
spin_lock(<ds->ltd_lock);
list_del_init(phase_list);
list_del_init(list);
spin_unlock(<ds->ltd_lock);
break;
}
if (lr->lr_flags & LEF_QUERY_ALL) {
if (com->lc_type == LFSCK_TYPE_LAYOUT) {
ltd->ltd_layout_status = reply->lr_status;
ltd->ltd_layout_repaired = reply->lr_repaired;
} else {
ltd->ltd_namespace_status = reply->lr_status;
ltd->ltd_namespace_repaired =
reply->lr_repaired;
}
break;
}
switch (reply->lr_status) {
case LS_SCANNING_PHASE1:
break;
case LS_SCANNING_PHASE2:
spin_lock(<ds->ltd_lock);
list_del_init(phase_list);
if (ltd->ltd_dead) {
spin_unlock(<ds->ltd_lock);
break;
}
if (com->lc_type == LFSCK_TYPE_LAYOUT) {
if (ltd->ltd_layout_done) {
spin_unlock(<ds->ltd_lock);
break;
}
if (lr->lr_flags & LEF_TO_OST)
list_add_tail(phase_list,
&lad->lad_ost_phase2_list);
else
list_add_tail(phase_list,
&lad->lad_mdt_phase2_list);
} else {
if (ltd->ltd_namespace_done) {
spin_unlock(<ds->ltd_lock);
break;
}
list_add_tail(phase_list,
&lad->lad_mdt_phase2_list);
}
spin_unlock(<ds->ltd_lock);
break;
default:
spin_lock(<ds->ltd_lock);
list_del_init(phase_list);
list_del_init(list);
spin_unlock(<ds->ltd_lock);
break;
}
break;
}
default:
CDEBUG(D_LFSCK, "%s: unexpected event: rc = %d\n",
lfsck_lfsck2name(com->lc_lfsck), lr->lr_event);
break;
}
if (!laia->laia_shared) {
kref_put(<d->ltd_ref, lfsck_tgt_free);
lfsck_component_put(env, com);
}
return 0;
}
static void lfsck_interpret(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct ptlrpc_request *req, void *args, int result)
{
struct lfsck_async_interpret_args *laia = args;
struct lfsck_component *com;
LASSERT(laia->laia_com == NULL);
LASSERT(laia->laia_shared);
spin_lock(&lfsck->li_lock);
list_for_each_entry(com, &lfsck->li_list_scan, lc_link) {
laia->laia_com = com;
lfsck_async_interpret_common(env, req, laia, result);
}
list_for_each_entry(com, &lfsck->li_list_double_scan, lc_link) {
laia->laia_com = com;
lfsck_async_interpret_common(env, req, laia, result);
}
spin_unlock(&lfsck->li_lock);
}
static int lfsck_stop_notify(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct lfsck_tgt_descs *ltds,
struct lfsck_tgt_desc *ltd, __u16 type)
{
struct lfsck_component *com;
int rc = 0;
ENTRY;
LASSERT(lfsck->li_master);
spin_lock(&lfsck->li_lock);
com = __lfsck_component_find(lfsck, type, &lfsck->li_list_scan);
if (com == NULL)
com = __lfsck_component_find(lfsck, type,
&lfsck->li_list_double_scan);
if (com != NULL)
lfsck_component_get(com);
spin_unlock(&lfsck->li_lock);
if (com != NULL) {
struct lfsck_thread_info *info = lfsck_env_info(env);
struct lfsck_async_interpret_args *laia = &info->lti_laia;
struct lfsck_request *lr = &info->lti_lr;
struct lfsck_assistant_data *lad = com->lc_data;
struct list_head *list;
struct list_head *phase_list;
struct ptlrpc_request_set *set;
set = ptlrpc_prep_set();
if (set == NULL) {
lfsck_component_put(env, com);
RETURN(-ENOMEM);
}
if (type == LFSCK_TYPE_LAYOUT) {
list = <d->ltd_layout_list;
phase_list = <d->ltd_layout_phase_list;
} else {
list = <d->ltd_namespace_list;
phase_list = <d->ltd_namespace_phase_list;
}
spin_lock(<ds->ltd_lock);
if (list_empty(list)) {
LASSERT(list_empty(phase_list));
spin_unlock(<ds->ltd_lock);
ptlrpc_set_destroy(set);
RETURN(0);
}
list_del_init(phase_list);
list_del_init(list);
spin_unlock(<ds->ltd_lock);
memset(lr, 0, sizeof(*lr));
lr->lr_index = lfsck_dev_idx(lfsck);
lr->lr_event = LE_PEER_EXIT;
lr->lr_active = type;
lr->lr_status = LS_CO_PAUSED;
if (ltds == &lfsck->li_ost_descs)
lr->lr_flags = LEF_TO_OST;
memset(laia, 0, sizeof(*laia));
laia->laia_com = com;
laia->laia_ltds = ltds;
kref_get(<d->ltd_ref);
laia->laia_ltd = ltd;
laia->laia_lr = lr;
rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
lfsck_async_interpret_common,
laia, LFSCK_NOTIFY);
if (rc != 0) {
CDEBUG(D_LFSCK,
"%s: fail to notify %s %x for co-stop for %s: rc = %d\n",
lfsck_lfsck2name(lfsck),
(lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
ltd->ltd_index, lad->lad_name, rc);
kref_put(<d->ltd_ref, lfsck_tgt_free);
} else {
rc = ptlrpc_set_wait(env, set);
}
ptlrpc_set_destroy(set);
lfsck_component_put(env, com);
}
RETURN(rc);
}
static int lfsck_async_interpret(const struct lu_env *env,
struct ptlrpc_request *req,
void *args, int rc)
{
struct lfsck_async_interpret_args *laia = args;
struct lfsck_instance *lfsck;
lfsck = container_of(laia->laia_ltds, struct lfsck_instance,
li_mdt_descs);
lfsck_interpret(env, lfsck, req, laia, rc);
kref_put(&laia->laia_ltd->ltd_ref, lfsck_tgt_free);
if (rc != 0 && laia->laia_result != -EALREADY)
laia->laia_result = rc;
return 0;
}
int lfsck_async_request(const struct lu_env *env, struct obd_export *exp,
struct lfsck_request *lr,
struct ptlrpc_request_set *set,
ptlrpc_interpterer_t interpreter,
void *args, int request)
{
struct lfsck_async_interpret_args *laia;
struct ptlrpc_request *req;
struct lfsck_request *tmp;
struct req_format *format;
int rc;
switch (request) {
case LFSCK_NOTIFY:
format = &RQF_LFSCK_NOTIFY;
break;
case LFSCK_QUERY:
format = &RQF_LFSCK_QUERY;
break;
default:
CDEBUG(D_LFSCK, "%s: unknown async request %d: rc = %d\n",
exp->exp_obd->obd_name, request, -EINVAL);
return -EINVAL;
}
req = ptlrpc_request_alloc(class_exp2cliimp(exp), format);
if (req == NULL)
return -ENOMEM;
rc = ptlrpc_request_pack(req, LUSTRE_OBD_VERSION, request);
if (rc != 0) {
ptlrpc_request_free(req);
return rc;
}
tmp = req_capsule_client_get(&req->rq_pill, &RMF_LFSCK_REQUEST);
*tmp = *lr;
ptlrpc_request_set_replen(req);
laia = ptlrpc_req_async_args(laia, req);
*laia = *(struct lfsck_async_interpret_args *)args;
if (laia->laia_com != NULL)
lfsck_component_get(laia->laia_com);
req->rq_interpret_reply = interpreter;
req->rq_allow_intr = 1;
req->rq_no_delay = 1;
ptlrpc_set_add_req(set, req);
return 0;
}
int lfsck_query_all(const struct lu_env *env, struct lfsck_component *com)
{
struct lfsck_thread_info *info = lfsck_env_info(env);
struct lfsck_request *lr = &info->lti_lr;
struct lfsck_async_interpret_args *laia = &info->lti_laia;
struct lfsck_instance *lfsck = com->lc_lfsck;
struct lfsck_tgt_descs *ltds = &lfsck->li_mdt_descs;
struct lfsck_tgt_desc *ltd;
struct ptlrpc_request_set *set;
int idx;
int rc;
ENTRY;
memset(lr, 0, sizeof(*lr));
lr->lr_event = LE_QUERY;
lr->lr_active = com->lc_type;
lr->lr_flags = LEF_QUERY_ALL;
memset(laia, 0, sizeof(*laia));
laia->laia_com = com;
laia->laia_lr = lr;
set = ptlrpc_prep_set();
if (set == NULL)
RETURN(-ENOMEM);
again:
laia->laia_ltds = ltds;
down_read(<ds->ltd_rw_sem);
for_each_set_bit(idx, ltds->ltd_tgts_bitmap, ltds->ltd_tgts_mask_len) {
ltd = lfsck_tgt_get(ltds, idx);
LASSERT(ltd != NULL);
laia->laia_ltd = ltd;
up_read(<ds->ltd_rw_sem);
rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
lfsck_async_interpret_common,
laia, LFSCK_QUERY);
if (rc != 0) {
struct lfsck_assistant_data *lad = com->lc_data;
CDEBUG(D_LFSCK,
"%s: Fail to query %s %x for stat %s: rc = %d\n",
lfsck_lfsck2name(lfsck),
(lr->lr_flags & LEF_TO_OST) ? "OST" : "MDT",
ltd->ltd_index, lad->lad_name, rc);
lfsck_reset_ltd_status(ltd, com->lc_type);
kref_put(<d->ltd_ref, lfsck_tgt_free);
}
down_read(<ds->ltd_rw_sem);
}
up_read(<ds->ltd_rw_sem);
if (com->lc_type == LFSCK_TYPE_LAYOUT && !(lr->lr_flags & LEF_TO_OST)) {
ltds = &lfsck->li_ost_descs;
lr->lr_flags |= LEF_TO_OST;
goto again;
}
rc = ptlrpc_set_wait(env, set);
ptlrpc_set_destroy(set);
RETURN(rc);
}
int lfsck_start_assistant(const struct lu_env *env, struct lfsck_component *com,
struct lfsck_start_param *lsp)
{
struct lfsck_instance *lfsck = com->lc_lfsck;
struct lfsck_assistant_data *lad = com->lc_data;
struct lfsck_thread_args *lta;
struct task_struct *task;
int rc = 0;
ENTRY;
CDEBUG(D_LFSCK, "%s: start %s assistant thread\n",
lfsck_lfsck2name(lfsck), lad->lad_name);
lad->lad_assistant_status = 0;
lad->lad_post_result = 0;
lad->lad_flags = 0;
lad->lad_advance_lock = false;
lta = lfsck_thread_args_init(lfsck, com, lsp);
if (IS_ERR(lta))
RETURN(PTR_ERR(lta));
task = kthread_create(lfsck_assistant_engine, lta, "%s", lad->lad_name);
if (IS_ERR(task)) {
rc = PTR_ERR(task);
CERROR("%s: cannot start LFSCK assistant thread for %s: rc = %d\n",
lfsck_lfsck2name(lfsck), lad->lad_name, rc);
lfsck_thread_args_fini(lta);
} else if (cmpxchg(&lad->lad_task, NULL, task) != NULL) {
/* already running */
kthread_stop(task);
} else {
wake_up_process(task);
rc = lad->lad_assistant_status;
}
RETURN(rc);
}
void lfsck_stop_assistant(struct lfsck_assistant_data *lad)
{
struct task_struct *task;
/* called by master thread */
LASSERT(current != lad->lad_task);
task = xchg(&lad->lad_task, NULL);
if (task) {
send_sig(SIGINT, task, 1);
kthread_stop(task);
}
}
int lfsck_checkpoint_generic(const struct lu_env *env,
struct lfsck_component *com)
{
struct lfsck_assistant_data *lad = com->lc_data;
wait_var_event(com->lc_lfsck, list_empty(&lad->lad_req_list) ||
lfsck_should_stop(com->lc_lfsck) || !lad->lad_task);
if (lfsck_should_stop(com->lc_lfsck) || !lad->lad_task)
return LFSCK_CHECKPOINT_SKIP;
return 0;
}
void lfsck_post_generic(const struct lu_env *env,
struct lfsck_component *com, int *result)
{
struct lfsck_assistant_data *lad = com->lc_data;
lad->lad_post_result = *result;
if (*result <= 0) {
lfsck_stop_assistant(lad);
} else {
set_bit(LAD_TO_POST, &lad->lad_flags);
wake_up_var(com->lc_lfsck);
}
CDEBUG(D_LFSCK, "%s: waiting for assistant to do %s post, rc = %d\n",
lfsck_lfsck2name(com->lc_lfsck), lad->lad_name, *result);
wait_var_event(com->lc_lfsck,
(*result > 0 && list_empty(&lad->lad_req_list)) ||
lfsck_should_stop(com->lc_lfsck) ||
test_bit(LAD_STOPPED, &lad->lad_flags));
if (lad->lad_assistant_status < 0)
*result = lad->lad_assistant_status;
CDEBUG(D_LFSCK, "%s: the assistant has done %s post, rc = %d\n",
lfsck_lfsck2name(com->lc_lfsck), lad->lad_name, *result);
}
int lfsck_double_scan_generic(const struct lu_env *env,
struct lfsck_component *com, int status)
{
struct lfsck_assistant_data *lad = com->lc_data;
if (status != LS_SCANNING_PHASE2) {
lfsck_stop_assistant(lad);
} else {
set_bit(LAD_TO_DOUBLE_SCAN, &lad->lad_flags);
wake_up_var(com->lc_lfsck);
}
CDEBUG(D_LFSCK,
"%s: waiting for assistant to do %s double_scan, status %d\n",
lfsck_lfsck2name(com->lc_lfsck), lad->lad_name, status);
wait_var_event(com->lc_lfsck,
test_bit(LAD_IN_DOUBLE_SCAN, &lad->lad_flags) ||
lfsck_should_stop(com->lc_lfsck) ||
test_bit(LAD_STOPPED, &lad->lad_flags));
CDEBUG(D_LFSCK,
"%s: the assistant has done %s double_scan, status %d\n",
lfsck_lfsck2name(com->lc_lfsck), lad->lad_name,
lad->lad_assistant_status);
if (lad->lad_assistant_status < 0)
return lad->lad_assistant_status;
return 0;
}
int lfsck_load_one_trace_file(const struct lu_env *env,
struct lfsck_component *com,
struct dt_object *parent,
struct dt_object **child,
const struct dt_index_features *ft,
const char *name, bool reset)
{
struct lfsck_instance *lfsck = com->lc_lfsck;
struct dt_object *obj;
int rc;
ENTRY;
if (*child != NULL) {
struct dt_it *it;
const struct dt_it_ops *iops;
struct lu_fid *fid = &lfsck_env_info(env)->lti_fid3;
if (!reset)
RETURN(0);
obj = *child;
rc = obj->do_ops->do_index_try(env, obj, ft);
if (rc)
/* unlink by force */
goto unlink;
iops = &obj->do_index_ops->dio_it;
it = iops->init(env, obj, 0);
if (IS_ERR(it))
/* unlink by force */
goto unlink;
fid_zero(fid);
rc = iops->get(env, it, (const struct dt_key *)fid);
if (rc >= 0) {
rc = iops->next(env, it);
iops->put(env, it);
}
iops->fini(env, it);
if (rc > 0)
/* "rc > 0" means the index file is empty. */
RETURN(0);
unlink:
/* The old index is not empty, remove it firstly. */
rc = local_object_unlink(env, lfsck->li_bottom, parent, name);
CDEBUG_LIMIT(rc ? D_ERROR : D_LFSCK,
"%s: unlink lfsck sub trace file %s: rc = %d\n",
lfsck_lfsck2name(com->lc_lfsck), name, rc);
if (rc)
RETURN(rc);
if (*child) {
lfsck_object_put(env, *child);
*child = NULL;
}
} else if (reset) {
goto unlink;
}
obj = local_index_find_or_create(env, lfsck->li_los, parent, name,
S_IFREG | 0644, ft);
if (IS_ERR(obj))
RETURN(PTR_ERR(obj));
rc = obj->do_ops->do_index_try(env, obj, ft);
if (rc) {
lfsck_object_put(env, obj);
CDEBUG(D_LFSCK,
"%s: LFSCK fail to load sub trace file %s: rc = %d\n",
lfsck_lfsck2name(com->lc_lfsck), name, rc);
} else {
*child = obj;
}
RETURN(rc);
}
int lfsck_load_sub_trace_files(const struct lu_env *env,
struct lfsck_component *com,
const struct dt_index_features *ft,
const char *prefix, bool reset)
{
char *name = lfsck_env_info(env)->lti_key;
struct lfsck_sub_trace_obj *lsto;
int rc;
int i;
for (i = 0, rc = 0, lsto = &com->lc_sub_trace_objs[0];
i < LFSCK_STF_COUNT && rc == 0; i++, lsto++) {
snprintf(name, NAME_MAX, "%s_%02d", prefix, i);
rc = lfsck_load_one_trace_file(env, com,
com->lc_lfsck->li_lfsck_dir,
&lsto->lsto_obj, ft, name, reset);
}
return rc;
}
/* external interfaces */
int lfsck_get_speed(char *buf, struct dt_device *key)
{
struct lu_env env;
struct lfsck_instance *lfsck;
int rc;
ENTRY;
rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
if (rc != 0)
RETURN(rc);
lfsck = lfsck_instance_find(key, true, false);
if (lfsck && buf) {
rc = sprintf(buf, "%u\n",
lfsck->li_bookmark_ram.lb_speed_limit);
lfsck_instance_put(&env, lfsck);
} else {
rc = -ENXIO;
}
lu_env_fini(&env);
RETURN(rc);
}
EXPORT_SYMBOL(lfsck_get_speed);
int lfsck_set_speed(struct dt_device *key, __u32 val)
{
struct lu_env env;
struct lfsck_instance *lfsck;
int rc;
ENTRY;
rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
if (rc != 0)
RETURN(rc);
lfsck = lfsck_instance_find(key, true, false);
if (likely(lfsck != NULL)) {
mutex_lock(&lfsck->li_mutex);
if (__lfsck_set_speed(lfsck, val))
rc = lfsck_bookmark_store(&env, lfsck);
mutex_unlock(&lfsck->li_mutex);
lfsck_instance_put(&env, lfsck);
} else {
rc = -ENXIO;
}
lu_env_fini(&env);
RETURN(rc);
}
EXPORT_SYMBOL(lfsck_set_speed);
int lfsck_get_windows(char *buf, struct dt_device *key)
{
struct lu_env env;
struct lfsck_instance *lfsck;
int rc;
ENTRY;
rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
if (rc != 0)
RETURN(rc);
lfsck = lfsck_instance_find(key, true, false);
if (likely(lfsck != NULL)) {
rc = sprintf(buf, "%u\n",
lfsck->li_bookmark_ram.lb_async_windows);
lfsck_instance_put(&env, lfsck);
} else {
rc = -ENXIO;
}
lu_env_fini(&env);
RETURN(rc);
}
EXPORT_SYMBOL(lfsck_get_windows);
int lfsck_set_windows(struct dt_device *key, unsigned int val)
{
struct lu_env env;
struct lfsck_instance *lfsck;
int rc;
ENTRY;
rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
if (rc != 0)
RETURN(rc);
lfsck = lfsck_instance_find(key, true, false);
if (likely(lfsck != NULL)) {
if (val < 1 || val > LFSCK_ASYNC_WIN_MAX) {
CWARN("%s: invalid async windows size that may cause memory issues. The valid range is [1 - %u].\n",
lfsck_lfsck2name(lfsck), LFSCK_ASYNC_WIN_MAX);
rc = -EINVAL;
} else if (lfsck->li_bookmark_ram.lb_async_windows != val) {
mutex_lock(&lfsck->li_mutex);
lfsck->li_bookmark_ram.lb_async_windows = val;
rc = lfsck_bookmark_store(&env, lfsck);
mutex_unlock(&lfsck->li_mutex);
}
lfsck_instance_put(&env, lfsck);
} else {
rc = -ENXIO;
}
lu_env_fini(&env);
RETURN(rc);
}
EXPORT_SYMBOL(lfsck_set_windows);
int lfsck_dump(struct seq_file *m, struct dt_device *key, enum lfsck_type type)
{
struct lu_env env;
struct lfsck_instance *lfsck;
struct lfsck_component *com;
int rc;
ENTRY;
rc = lu_env_init(&env, LCT_MD_THREAD | LCT_DT_THREAD);
if (rc != 0)
RETURN(rc);
lfsck = lfsck_instance_find(key, true, false);
if (likely(lfsck != NULL)) {
com = lfsck_component_find(lfsck, type);
if (likely(com != NULL)) {
com->lc_ops->lfsck_dump(&env, com, m);
lfsck_component_put(&env, com);
} else {
rc = -ENOTSUPP;
}
lfsck_instance_put(&env, lfsck);
} else {
rc = -ENXIO;
}
lu_env_fini(&env);
RETURN(rc);
}
EXPORT_SYMBOL(lfsck_dump);
static int lfsck_stop_all(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct lfsck_stop *stop)
{
struct lfsck_thread_info *info = lfsck_env_info(env);
struct lfsck_request *lr = &info->lti_lr;
struct lfsck_async_interpret_args *laia = &info->lti_laia;
struct ptlrpc_request_set *set;
struct lfsck_tgt_descs *ltds = &lfsck->li_mdt_descs;
struct lfsck_tgt_desc *ltd;
struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
int idx;
int rc = 0;
int rc1 = 0;
ENTRY;
LASSERT(stop->ls_flags & LPF_BROADCAST);
set = ptlrpc_prep_set();
if (unlikely(set == NULL))
RETURN(-ENOMEM);
memset(lr, 0, sizeof(*lr));
lr->lr_event = LE_STOP;
lr->lr_index = lfsck_dev_idx(lfsck);
lr->lr_status = stop->ls_status;
lr->lr_version = bk->lb_version;
lr->lr_active = LFSCK_TYPES_ALL;
lr->lr_param = stop->ls_flags;
memset(laia, 0, sizeof(*laia));
laia->laia_ltds = ltds;
laia->laia_lr = lr;
laia->laia_shared = 1;
down_read(<ds->ltd_rw_sem);
for_each_set_bit(idx, ltds->ltd_tgts_bitmap, ltds->ltd_tgts_mask_len) {
ltd = lfsck_tgt_get(ltds, idx);
LASSERT(ltd != NULL);
laia->laia_ltd = ltd;
rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
lfsck_async_interpret, laia,
LFSCK_NOTIFY);
if (rc != 0) {
lfsck_interpret(env, lfsck, NULL, laia, rc);
kref_put(<d->ltd_ref, lfsck_tgt_free);
CERROR("%s: cannot notify MDT %x for LFSCK stop: rc = %d\n",
lfsck_lfsck2name(lfsck), idx, rc);
rc1 = rc;
}
}
up_read(<ds->ltd_rw_sem);
rc = ptlrpc_set_wait(env, set);
ptlrpc_set_destroy(set);
if (rc == 0)
rc = laia->laia_result;
if (rc == -EALREADY)
rc = 0;
if (rc != 0)
CERROR("%s: fail to stop LFSCK on some MDTs: rc = %d\n",
lfsck_lfsck2name(lfsck), rc);
RETURN(rc != 0 ? rc : rc1);
}
static int lfsck_start_all(const struct lu_env *env,
struct lfsck_instance *lfsck,
struct lfsck_start *start)
{
struct lfsck_thread_info *info = lfsck_env_info(env);
struct lfsck_request *lr = &info->lti_lr;
struct lfsck_async_interpret_args *laia = &info->lti_laia;
struct ptlrpc_request_set *set;
struct lfsck_tgt_descs *ltds = &lfsck->li_mdt_descs;
struct lfsck_tgt_desc *ltd;
struct lfsck_bookmark *bk = &lfsck->li_bookmark_ram;
int idx;
int rc = 0;
bool retry = false;
ENTRY;
LASSERT(start->ls_flags & LPF_BROADCAST);
memset(lr, 0, sizeof(*lr));
lr->lr_event = LE_START;
lr->lr_index = lfsck_dev_idx(lfsck);
lr->lr_speed = bk->lb_speed_limit;
lr->lr_version = bk->lb_version;
lr->lr_active = start->ls_active;
lr->lr_param = start->ls_flags;
lr->lr_async_windows = bk->lb_async_windows;
lr->lr_valid = LSV_SPEED_LIMIT | LSV_ERROR_HANDLE | LSV_DRYRUN |
LSV_ASYNC_WINDOWS | LSV_CREATE_OSTOBJ |
LSV_CREATE_MDTOBJ;
memset(laia, 0, sizeof(*laia));
laia->laia_ltds = ltds;
laia->laia_lr = lr;
laia->laia_shared = 1;
again:
set = ptlrpc_prep_set();
if (unlikely(!set))
RETURN(-ENOMEM);
down_read(<ds->ltd_rw_sem);
for_each_set_bit(idx, ltds->ltd_tgts_bitmap, ltds->ltd_tgts_mask_len) {
ltd = lfsck_tgt_get(ltds, idx);
LASSERT(ltd != NULL);
if (retry && !ltd->ltd_retry_start) {
kref_put(<d->ltd_ref, lfsck_tgt_free);
continue;
}
laia->laia_ltd = ltd;
ltd->ltd_retry_start = 0;
ltd->ltd_layout_done = 0;
ltd->ltd_namespace_done = 0;
ltd->ltd_synced_failures = 0;
rc = lfsck_async_request(env, ltd->ltd_exp, lr, set,
lfsck_async_interpret, laia,
LFSCK_NOTIFY);
if (rc != 0) {
lfsck_interpret(env, lfsck, NULL, laia, rc);
kref_put(<d->ltd_ref, lfsck_tgt_free);
CERROR("%s: cannot notify MDT %x for LFSCK start, failout: rc = %d\n",
lfsck_lfsck2name(lfsck), idx, rc);
break;
}
}
up_read(<ds->ltd_rw_sem);
if (rc != 0) {
ptlrpc_set_destroy(set);
RETURN(rc);
}
rc = ptlrpc_set_wait(env, set);
ptlrpc_set_destroy(set);
if (rc == 0)
rc = laia->laia_result;
if (unlikely(rc == -EINPROGRESS)) {
retry = true;
schedule_timeout_interruptible(cfs_time_seconds(1));
set_current_state(TASK_RUNNING);
if (!signal_pending(current) && lfsck->li_task)
goto again;
rc = -EINTR;
}
if (rc != 0) {
struct lfsck_stop *stop = &info->lti_stop;
CERROR("%s: cannot start LFSCK on some MDTs, stop all: rc = %d\n",
lfsck_lfsck2name(lfsck), rc);
if (rc != -EALREADY) {
stop->ls_status = LS_FAILED;
stop->ls_flags = LPF_ALL_TGT | LPF_BROADCAST;
lfsck_stop_all(env, lfsck, stop);
}
}
RETURN(rc);
}
int lfsck_start(const struct lu_env *env, struct dt_device *key,
struct lfsck_start_param *lsp)
{
struct lfsck_start *start = lsp->lsp_start;
struct lfsck_instance *lfsck;
struct lfsck_bookmark *bk;
struct lfsck_component *com;
struct lfsck_thread_args *lta;
struct task_struct *task;
struct lfsck_tgt_descs *ltds;
struct lfsck_tgt_desc *ltd;
int idx;
int rc = 0;
__u16 valid = 0;
__u16 flags = 0;
__u16 type = 1;
ENTRY;
if (key->dd_rdonly)
RETURN(-EROFS);
lfsck = lfsck_instance_find(key, true, false);
if (unlikely(lfsck == NULL))
RETURN(-ENXIO);
CDEBUG(D_LFSCK, "%s: start master thread\n", lfsck_lfsck2name(lfsck));
/* System is not ready, try again later. */
if (unlikely(lfsck->li_namespace == NULL ||
lfsck_dev_site(lfsck)->ss_server_fld == NULL))
GOTO(put, rc = -EINPROGRESS);
/* start == NULL means auto trigger paused LFSCK. */
if (!start) {
if (list_empty(&lfsck->li_list_scan) ||
CFS_FAIL_CHECK(OBD_FAIL_LFSCK_NO_AUTO))
GOTO(put, rc = 0);
} else if (start->ls_flags & LPF_BROADCAST && !lfsck->li_master) {
CERROR("%s: only allow to specify '-A | -o' via MDS\n",
lfsck_lfsck2name(lfsck));
GOTO(put, rc = -EPERM);
}
bk = &lfsck->li_bookmark_ram;
mutex_lock(&lfsck->li_mutex);
spin_lock(&lfsck->li_lock);
if (lfsck->li_task) {
rc = -EALREADY;
if (unlikely(start == NULL)) {
spin_unlock(&lfsck->li_lock);
GOTO(out, rc);
}
while (start->ls_active != 0) {
if (!(type & start->ls_active)) {
type <<= 1;
continue;
}
com = __lfsck_component_find(lfsck, type,
&lfsck->li_list_scan);
if (com == NULL)
com = __lfsck_component_find(lfsck, type,
&lfsck->li_list_double_scan);
if (com == NULL) {
rc = -EOPNOTSUPP;
break;
}
if (com->lc_ops->lfsck_join != NULL) {
rc = com->lc_ops->lfsck_join(env, com, lsp);
if (rc != 0 && rc != -EALREADY)
break;
}
start->ls_active &= ~type;
type <<= 1;
}
spin_unlock(&lfsck->li_lock);
GOTO(out, rc);
}
spin_unlock(&lfsck->li_lock);
lfsck->li_status = 0;
lfsck->li_oit_over = 0;
lfsck->li_start_unplug = 0;
lfsck->li_drop_dryrun = 0;
lfsck->li_new_scanned = 0;
lfsck->li_master_ready = 0;
/* For auto trigger. */
if (start == NULL)
goto trigger;
start->ls_version = bk->lb_version;
if (start->ls_active != 0) {
struct lfsck_component *next;
if (start->ls_active == LFSCK_TYPES_ALL)
start->ls_active = LFSCK_TYPES_SUPPORTED;
if (start->ls_active & ~LFSCK_TYPES_SUPPORTED) {
start->ls_active &= ~LFSCK_TYPES_SUPPORTED;
GOTO(out, rc = -ENOTSUPP);
}
list_for_each_entry_safe(com, next,
&lfsck->li_list_scan, lc_link) {
if (!(com->lc_type & start->ls_active)) {
rc = com->lc_ops->lfsck_post(env, com, 0,
false);
if (rc != 0)
GOTO(out, rc);
}
}
while (start->ls_active != 0) {
if (type & start->ls_active) {
com = __lfsck_component_find(lfsck, type,
&lfsck->li_list_idle);
if (com != NULL)
/* Component status will be updated when
* its prep() is called later by LFSCK
* main engine.
*/
list_move_tail(&com->lc_link,
&lfsck->li_list_scan);
start->ls_active &= ~type;
}
type <<= 1;
}
}
if (list_empty(&lfsck->li_list_scan)) {
/* The speed limit will be used to control both the LFSCK and
* low layer scrub (if applied), need to be handled firstly.
*/
if (start->ls_valid & LSV_SPEED_LIMIT) {
if (__lfsck_set_speed(lfsck, start->ls_speed_limit)) {
rc = lfsck_bookmark_store(env, lfsck);
if (rc != 0)
GOTO(out, rc);
}
}
goto trigger;
}
if (start->ls_flags & LPF_RESET)
flags |= DOIF_RESET;
rc = lfsck_set_param(env, lfsck, start, !!(flags & DOIF_RESET));
if (rc != 0)
GOTO(out, rc);
list_for_each_entry(com, &lfsck->li_list_scan, lc_link) {
start->ls_active |= com->lc_type;
if (flags & DOIF_RESET) {
rc = com->lc_ops->lfsck_reset(env, com, false);
if (rc != 0)
GOTO(out, rc);
}
}
ltds = &lfsck->li_mdt_descs;
down_read(<ds->ltd_rw_sem);
for_each_set_bit(idx, ltds->ltd_tgts_bitmap, ltds->ltd_tgts_mask_len) {
ltd = lfsck_ltd2tgt(ltds, idx);
LASSERT(ltd != NULL);
ltd->ltd_layout_done = 0;
ltd->ltd_namespace_done = 0;
ltd->ltd_synced_failures = 0;
lfsck_reset_ltd_status(ltd, LFSCK_TYPE_NAMESPACE);
lfsck_reset_ltd_status(ltd, LFSCK_TYPE_LAYOUT);
list_del_init(<d->ltd_layout_phase_list);
list_del_init(<d->ltd_layout_list);
list_del_init(<d->ltd_namespace_phase_list);
list_del_init(<d->ltd_namespace_list);
}
up_read(<ds->ltd_rw_sem);
ltds = &lfsck->li_ost_descs;
down_read(<ds->ltd_rw_sem);
for_each_set_bit(idx, ltds->ltd_tgts_bitmap, ltds->ltd_tgts_mask_len) {
ltd = lfsck_ltd2tgt(ltds, idx);
LASSERT(ltd != NULL);
ltd->ltd_layout_done = 0;
ltd->ltd_synced_failures = 0;
lfsck_reset_ltd_status(ltd, LFSCK_TYPE_LAYOUT);
list_del_init(<d->ltd_layout_phase_list);
list_del_init(<d->ltd_layout_list);
}
up_read(<ds->ltd_rw_sem);
trigger:
lfsck->li_args_dir = LUDA_64BITHASH | LUDA_VERIFY | LUDA_TYPE;
if (bk->lb_param & LPF_DRYRUN)
lfsck->li_args_dir |= LUDA_VERIFY_DRYRUN;
if (start != NULL && start->ls_valid & LSV_ERROR_HANDLE) {
valid |= DOIV_ERROR_HANDLE;
if (start->ls_flags & LPF_FAILOUT)
flags |= DOIF_FAILOUT;
}
if (start != NULL && start->ls_valid & LSV_DRYRUN) {
valid |= DOIV_DRYRUN;
if (start->ls_flags & LPF_DRYRUN)
flags |= DOIF_DRYRUN;
}
if (!list_empty(&lfsck->li_list_scan))
flags |= DOIF_OUTUSED;
lfsck->li_args_oit = (flags << DT_OTABLE_IT_FLAGS_SHIFT) | valid;
lta = lfsck_thread_args_init(lfsck, NULL, lsp);
if (IS_ERR(lta))
GOTO(out, rc = PTR_ERR(lta));
__lfsck_set_speed(lfsck, bk->lb_speed_limit);
task = kthread_create(lfsck_master_engine, lta, "lfsck");
if (IS_ERR(task)) {
rc = PTR_ERR(task);
CERROR("%s: cannot start LFSCK thread: rc = %d\n",
lfsck_lfsck2name(lfsck), rc);
lfsck_thread_args_fini(lta);
GOTO(out, rc);
} else {
LASSERT(!lfsck->li_task);
lfsck->li_task = task;
wake_up_process(task);
}
if (start == NULL || !(start->ls_flags & LPF_BROADCAST)) {
lfsck->li_start_unplug = 1;
wake_up_var(lfsck);
wait_var_event(lfsck, lfsck->li_master_ready ||
!lfsck->li_task);
GOTO(out, rc = 0);
}
/* release lfsck::li_mutex to avoid deadlock. */
mutex_unlock(&lfsck->li_mutex);
rc = lfsck_start_all(env, lfsck, start);
if (rc != 0) {
task = xchg(&lfsck->li_task, NULL);
if (task)
kthread_stop(task);
} else {
lfsck->li_start_unplug = 1;
wake_up_var(lfsck);
wait_var_event(lfsck, lfsck->li_master_ready ||
!lfsck->li_task);
}
GOTO(put, rc);
out:
mutex_unlock(&lfsck->li_mutex);
put:
lfsck_instance_put(env, lfsck);
return rc < 0 ? rc : 0;
}
EXPORT_SYMBOL(lfsck_start);
int lfsck_stop(const struct lu_env *env, struct dt_device *key,
struct lfsck_stop *stop)
{
struct lfsck_instance *lfsck;
struct task_struct *master_task;
struct task_struct *task;
int rc = 0;
int rc1 = 0;
ENTRY;
LASSERT(stop);
lfsck = lfsck_instance_find(key, true, false);
if (unlikely(lfsck == NULL))
RETURN(-ENXIO);
if ((stop->ls_flags & LPF_BROADCAST) && !lfsck->li_master) {
CERROR("%s: only allow to specify '-A' via MDS\n",
lfsck_lfsck2name(lfsck));
GOTO(put, rc = -EPERM);
}
mutex_lock(&lfsck->li_mutex);
if (!lfsck->li_task) {
/* no error if LFSCK is stopped, or not started */
GOTO(unlock, rc = 0);
}
master_task = xchg(&lfsck->li_task, NULL);
stop_assistant:
spin_lock(&lfsck->li_lock);
lfsck->li_status = stop->ls_status;
lfsck->li_flags = stop->ls_flags;
if (lfsck->li_master) {
struct lfsck_component *com;
struct lfsck_assistant_data *lad;
list_for_each_entry(com, &lfsck->li_list_scan, lc_link) {
lad = com->lc_data;
task = xchg(&lad->lad_task, NULL);
if (task) {
spin_unlock(&lfsck->li_lock);
send_sig(SIGINT, task, 1);
kthread_stop(task);
goto stop_assistant;
}
}
list_for_each_entry(com, &lfsck->li_list_double_scan, lc_link) {
lad = com->lc_data;
task = xchg(&lad->lad_task, NULL);
if (task) {
spin_unlock(&lfsck->li_lock);
send_sig(SIGINT, task, 1);
kthread_stop(task);
goto stop_assistant;
}
}
}
spin_unlock(&lfsck->li_lock);
if (master_task) {
send_sig(SIGINT, master_task, 1);
kthread_stop(master_task);
}
if (stop->ls_flags & LPF_BROADCAST)
rc1 = lfsck_stop_all(env, lfsck, stop);
EXIT;
unlock:
mutex_unlock(&lfsck->li_mutex);
put:
lfsck_instance_put(env, lfsck);
return rc != 0 ? rc : rc1;
}
EXPORT_SYMBOL(lfsck_stop);
int lfsck_in_notify_local(const struct lu_env *env, struct dt_device *key,
struct lfsck_req_local *lrl, struct thandle *th)
{
struct lfsck_instance *lfsck;
struct lfsck_component *com;
int rc = -EOPNOTSUPP;
ENTRY;
lfsck = lfsck_instance_find(key, true, false);
if (unlikely(!lfsck))
RETURN(-ENXIO);
com = lfsck_component_find(lfsck, lrl->lrl_active);
if (likely(com && com->lc_ops->lfsck_in_notify_local)) {
rc = com->lc_ops->lfsck_in_notify_local(env, com, lrl, th);
lfsck_component_put(env, com);
}
lfsck_instance_put(env, lfsck);
RETURN(rc);
}
EXPORT_SYMBOL(lfsck_in_notify_local);
int lfsck_in_notify(const struct lu_env *env, struct dt_device *key,
struct lfsck_request *lr)
{
int rc = -EOPNOTSUPP;
ENTRY;
switch (lr->lr_event) {
case LE_START: {
struct lfsck_start *start = &lfsck_env_info(env)->lti_start;
struct lfsck_start_param lsp;
memset(start, 0, sizeof(*start));
start->ls_valid = lr->lr_valid;
start->ls_speed_limit = lr->lr_speed;
start->ls_version = lr->lr_version;
start->ls_active = lr->lr_active;
start->ls_flags = lr->lr_param & ~LPF_BROADCAST;
start->ls_async_windows = lr->lr_async_windows;
lsp.lsp_start = start;
lsp.lsp_index = lr->lr_index;
lsp.lsp_index_valid = 1;
rc = lfsck_start(env, key, &lsp);
break;
}
case LE_STOP: {
struct lfsck_stop *stop = &lfsck_env_info(env)->lti_stop;
memset(stop, 0, sizeof(*stop));
stop->ls_status = lr->lr_status;
stop->ls_flags = lr->lr_param & ~LPF_BROADCAST;
rc = lfsck_stop(env, key, stop);
break;
}
case LE_PHASE1_DONE:
case LE_PHASE2_DONE:
case LE_PEER_EXIT:
case LE_CONDITIONAL_DESTROY:
case LE_SET_LMV_MASTER:
case LE_SET_LMV_SLAVE:
case LE_PAIRS_VERIFY: {
struct lfsck_instance *lfsck;
struct lfsck_component *com;
lfsck = lfsck_instance_find(key, true, false);
if (unlikely(lfsck == NULL))
RETURN(-ENXIO);
com = lfsck_component_find(lfsck, lr->lr_active);
if (likely(com)) {
rc = com->lc_ops->lfsck_in_notify(env, com, lr);
lfsck_component_put(env, com);
}
lfsck_instance_put(env, lfsck);
break;
}
default:
break;
}
RETURN(rc);
}
EXPORT_SYMBOL(lfsck_in_notify);
int lfsck_query(const struct lu_env *env, struct dt_device *key,
struct lfsck_request *req, struct lfsck_reply *rep,
struct lfsck_query *que)
{
struct lfsck_instance *lfsck;
struct lfsck_component *com;
int i;
int rc = 0;
__u16 type;
ENTRY;
lfsck = lfsck_instance_find(key, true, false);
if (unlikely(lfsck == NULL))
RETURN(-ENXIO);
if (que != NULL) {
if (que->lu_types == LFSCK_TYPES_ALL)
que->lu_types =
LFSCK_TYPES_SUPPORTED & ~LFSCK_TYPE_SCRUB;
if (que->lu_types & ~LFSCK_TYPES_SUPPORTED) {
que->lu_types &= ~LFSCK_TYPES_SUPPORTED;
GOTO(out, rc = -ENOTSUPP);
}
for (i = 0, type = BIT(i); i < LFSCK_TYPE_BITS;
i++, type = BIT(i)) {
if (!(que->lu_types & type))
continue;
again:
com = lfsck_component_find(lfsck, type);
if (unlikely(com == NULL))
GOTO(out, rc = -ENOTSUPP);
memset(que->lu_mdts_count[i], 0,
sizeof(__u32) * (LS_MAX + 1));
memset(que->lu_osts_count[i], 0,
sizeof(__u32) * (LS_MAX + 1));
que->lu_repaired[i] = 0;
rc = com->lc_ops->lfsck_query(env, com, req, rep,
que, i);
lfsck_component_put(env, com);
if (rc < 0)
GOTO(out, rc);
}
if (!(que->lu_flags & LPF_WAIT))
GOTO(out, rc);
for (i = 0, type = BIT(i); i < LFSCK_TYPE_BITS;
i++, type = BIT(i)) {
if (!(que->lu_types & type))
continue;
if (que->lu_mdts_count[i][LS_SCANNING_PHASE1] != 0 ||
que->lu_mdts_count[i][LS_SCANNING_PHASE2] != 0 ||
que->lu_osts_count[i][LS_SCANNING_PHASE1] != 0 ||
que->lu_osts_count[i][LS_SCANNING_PHASE2] != 0) {
/* If it is required to wait, then sleep
* 3 seconds and try to query again.
*/
unsigned long timeout =
msecs_to_jiffies(3000) + 1;
while (timeout &&
!fatal_signal_pending(current))
timeout = schedule_timeout_killable(
timeout);
if (timeout == 0)
goto again;
}
}
} else {
com = lfsck_component_find(lfsck, req->lr_active);
if (likely(com != NULL)) {
rc = com->lc_ops->lfsck_query(env, com, req, rep,
que, -1);
lfsck_component_put(env, com);
} else {
rc = -ENOTSUPP;
}
}
GOTO(out, rc);
out:
lfsck_instance_put(env, lfsck);
return rc;
}
EXPORT_SYMBOL(lfsck_query);
int lfsck_register_namespace(const struct lu_env *env, struct dt_device *key,
struct ldlm_namespace *ns)
{
struct lfsck_instance *lfsck;
int rc = -ENXIO;
lfsck = lfsck_instance_find(key, true, false);
if (likely(lfsck != NULL)) {
lfsck->li_namespace = ns;
lfsck_instance_put(env, lfsck);
rc = 0;
}
return rc;
}
EXPORT_SYMBOL(lfsck_register_namespace);
int lfsck_register(const struct lu_env *env, struct dt_device *key,
struct dt_device *next, struct obd_device *obd,
lfsck_out_notify notify, void *notify_data, bool master)
{
struct lfsck_instance *lfsck;
struct dt_object *root = NULL;
struct dt_object *obj = NULL;
struct lu_fid *fid = &lfsck_env_info(env)->lti_fid;
int rc;
ENTRY;
lfsck = lfsck_instance_find(key, false, false);
if (unlikely(lfsck != NULL))
RETURN(-EEXIST);
OBD_ALLOC_PTR(lfsck);
if (lfsck == NULL)
RETURN(-ENOMEM);
mutex_init(&lfsck->li_mutex);
spin_lock_init(&lfsck->li_lock);
INIT_LIST_HEAD(&lfsck->li_link);
INIT_LIST_HEAD(&lfsck->li_list_scan);
INIT_LIST_HEAD(&lfsck->li_list_dir);
INIT_LIST_HEAD(&lfsck->li_list_double_scan);
INIT_LIST_HEAD(&lfsck->li_list_idle);
INIT_LIST_HEAD(&lfsck->li_list_lmv);
refcount_set(&lfsck->li_ref, 1);
atomic_set(&lfsck->li_double_scan_count, 0);
lfsck->li_out_notify = notify;
lfsck->li_out_notify_data = notify_data;
lfsck->li_next = next;
lfsck->li_bottom = key;
lfsck->li_obd = obd;
rc = lfsck_tgt_descs_init(&lfsck->li_ost_descs);
if (rc != 0)
GOTO(out, rc);
rc = lfsck_tgt_descs_init(&lfsck->li_mdt_descs);
if (rc != 0)
GOTO(out, rc);
fid->f_seq = FID_SEQ_LOCAL_NAME;
fid->f_oid = 1;
fid->f_ver = 0;
rc = local_oid_storage_init(env, key, fid, &lfsck->li_los);
if (rc != 0)
GOTO(out, rc);
rc = dt_root_get(env, key, fid);
if (rc != 0)
GOTO(out, rc);
root = dt_locate(env, key, fid);
if (IS_ERR(root))
GOTO(out, rc = PTR_ERR(root));
lfsck->li_local_root_fid = *fid;
if (master) {
lfsck->li_master = 1;
if (lfsck_dev_idx(lfsck) == 0) {
struct lu_fid *pfid = &lfsck_env_info(env)->lti_fid2;
const struct lu_name *cname;
rc = dt_lookup_dir(env, root, "ROOT",
&lfsck->li_global_root_fid);
if (rc != 0)
GOTO(out, rc);
obj = dt_locate(env, key, &lfsck->li_global_root_fid);
if (IS_ERR(obj))
GOTO(out, rc = PTR_ERR(obj));
rc = dt_lookup_dir(env, obj, dotlustre, fid);
if (rc != 0)
GOTO(out, rc);
lfsck_object_put(env, obj);
obj = dt_locate(env, key, fid);
if (IS_ERR(obj))
GOTO(out, rc = PTR_ERR(obj));
cname = lfsck_name_get_const(env, dotlustre,
strlen(dotlustre));
rc = lfsck_verify_linkea(env, lfsck, obj, cname,
&lfsck->li_global_root_fid);
if (rc != 0)
GOTO(out, rc);
*pfid = *fid;
rc = dt_lookup_dir(env, obj, lostfound, fid);
if (rc != 0)
GOTO(out, rc);
lfsck_object_put(env, obj);
obj = dt_locate(env, key, fid);
if (IS_ERR(obj))
GOTO(out, rc = PTR_ERR(obj));
cname = lfsck_name_get_const(env, lostfound,
strlen(lostfound));
rc = lfsck_verify_linkea(env, lfsck, obj, cname, pfid);
if (rc != 0)
GOTO(out, rc);
lfsck_object_put(env, obj);
obj = NULL;
}
}
fid->f_seq = FID_SEQ_LOCAL_FILE;
fid->f_oid = OTABLE_IT_OID;
fid->f_ver = 0;
obj = dt_locate(env, key, fid);
if (IS_ERR(obj))
GOTO(out, rc = PTR_ERR(obj));
rc = obj->do_ops->do_index_try(env, obj, &dt_otable_features);
if (rc != 0)
GOTO(out, rc);
lfsck->li_obj_oit = obj;
obj = local_file_find_or_create(env, lfsck->li_los, root, LFSCK_DIR,
S_IFDIR | 0644);
if (IS_ERR(obj))
GOTO(out, rc = PTR_ERR(obj));
lu_object_get(&obj->do_lu);
lfsck->li_lfsck_dir = obj;
rc = lfsck_bookmark_setup(env, lfsck);
if (rc != 0)
GOTO(out, rc);
if (master) {
rc = lfsck_fid_init(lfsck);
if (rc < 0)
GOTO(out, rc);
rc = lfsck_namespace_setup(env, lfsck);
if (rc < 0)
GOTO(out, rc);
}
rc = lfsck_layout_setup(env, lfsck);
if (rc < 0)
GOTO(out, rc);
/* XXX: more LFSCK components initialization to be added here. */
rc = lfsck_instance_add(lfsck);
if (rc == 0)
rc = lfsck_add_target_from_orphan(env, lfsck);
out:
if (obj != NULL && !IS_ERR(obj))
lfsck_object_put(env, obj);
if (root != NULL && !IS_ERR(root))
lfsck_object_put(env, root);
if (rc != 0)
lfsck_instance_cleanup(env, lfsck);
return rc;
}
EXPORT_SYMBOL(lfsck_register);
void lfsck_degister(const struct lu_env *env, struct dt_device *key)
{
struct lfsck_instance *lfsck;
lfsck = lfsck_instance_find(key, false, true);
if (lfsck != NULL)
lfsck_instance_put(env, lfsck);
}
EXPORT_SYMBOL(lfsck_degister);
int lfsck_add_target(const struct lu_env *env, struct dt_device *key,
struct dt_device *tgt, struct obd_export *exp,
__u32 index, bool for_ost)
{
struct lfsck_instance *lfsck;
struct lfsck_tgt_desc *ltd;
int rc;
ENTRY;
OBD_ALLOC_PTR(ltd);
if (ltd == NULL)
RETURN(-ENOMEM);
ltd->ltd_tgt = tgt;
ltd->ltd_key = key;
ltd->ltd_exp = exp;
INIT_LIST_HEAD(<d->ltd_orphan_list);
INIT_LIST_HEAD(<d->ltd_layout_list);
INIT_LIST_HEAD(<d->ltd_layout_phase_list);
INIT_LIST_HEAD(<d->ltd_namespace_list);
INIT_LIST_HEAD(<d->ltd_namespace_phase_list);
kref_init(<d->ltd_ref);
ltd->ltd_index = index;
spin_lock(&lfsck_instance_lock);
lfsck = __lfsck_instance_find(key, true, false);
if (lfsck == NULL) {
if (for_ost)
list_add_tail(<d->ltd_orphan_list,
&lfsck_ost_orphan_list);
else
list_add_tail(<d->ltd_orphan_list,
&lfsck_mdt_orphan_list);
spin_unlock(&lfsck_instance_lock);
RETURN(0);
}
spin_unlock(&lfsck_instance_lock);
rc = __lfsck_add_target(env, lfsck, ltd, for_ost, false);
if (rc != 0)
kref_put(<d->ltd_ref, lfsck_tgt_free);
lfsck_instance_put(env, lfsck);
RETURN(rc);
}
EXPORT_SYMBOL(lfsck_add_target);
void lfsck_del_target(const struct lu_env *env, struct dt_device *key,
struct dt_device *tgt, __u32 index, bool for_ost)
{
struct lfsck_instance *lfsck;
struct lfsck_tgt_descs *ltds;
struct lfsck_tgt_desc *ltd;
struct list_head *head;
if (for_ost)
head = &lfsck_ost_orphan_list;
else
head = &lfsck_mdt_orphan_list;
spin_lock(&lfsck_instance_lock);
list_for_each_entry(ltd, head, ltd_orphan_list) {
if (ltd->ltd_tgt == tgt) {
list_del_init(<d->ltd_orphan_list);
spin_unlock(&lfsck_instance_lock);
kref_put(<d->ltd_ref, lfsck_tgt_free);
return;
}
}
ltd = NULL;
lfsck = __lfsck_instance_find(key, true, false);
spin_unlock(&lfsck_instance_lock);
if (unlikely(lfsck == NULL))
return;
if (for_ost)
ltds = &lfsck->li_ost_descs;
else
ltds = &lfsck->li_mdt_descs;
down_write(<ds->ltd_rw_sem);
LASSERT(ltds->ltd_tgts_bitmap);
if (unlikely(index >= ltds->ltd_tgts_mask_len))
goto unlock;
ltd = lfsck_ltd2tgt(ltds, index);
if (unlikely(ltd == NULL))
goto unlock;
LASSERT(ltds->ltd_tgtnr > 0);
ltds->ltd_tgtnr--;
set_bit(index, ltds->ltd_tgts_bitmap);
lfsck_assign_tgt(ltds, NULL, index);
unlock:
if (ltd == NULL) {
if (for_ost)
head = &lfsck->li_ost_descs.ltd_orphan;
else
head = &lfsck->li_mdt_descs.ltd_orphan;
list_for_each_entry(ltd, head, ltd_orphan_list) {
if (ltd->ltd_tgt == tgt) {
list_del_init(<d->ltd_orphan_list);
break;
}
}
}
up_write(<ds->ltd_rw_sem);
if (ltd != NULL) {
spin_lock(<ds->ltd_lock);
ltd->ltd_dead = 1;
spin_unlock(<ds->ltd_lock);
lfsck_stop_notify(env, lfsck, ltds, ltd, LFSCK_TYPE_NAMESPACE);
lfsck_stop_notify(env, lfsck, ltds, ltd, LFSCK_TYPE_LAYOUT);
kref_put(<d->ltd_ref, lfsck_tgt_free);
}
lfsck_instance_put(env, lfsck);
}
EXPORT_SYMBOL(lfsck_del_target);
static int __init lfsck_init(void)
{
int rc;
rc = libcfs_setup();
if (rc)
return rc;
lfsck_key_init_generic(&lfsck_thread_key, NULL);
rc = lu_context_key_register(&lfsck_thread_key);
if (!rc) {
tgt_register_lfsck_in_notify_local(lfsck_in_notify_local);
tgt_register_lfsck_in_notify(lfsck_in_notify);
tgt_register_lfsck_query(lfsck_query);
}
return rc;
}
static void __exit lfsck_exit(void)
{
struct lfsck_tgt_desc *ltd;
struct lfsck_tgt_desc *next;
LASSERT(list_empty(&lfsck_instance_list));
list_for_each_entry_safe(ltd, next, &lfsck_ost_orphan_list,
ltd_orphan_list) {
list_del_init(<d->ltd_orphan_list);
kref_put(<d->ltd_ref, lfsck_tgt_free);
}
list_for_each_entry_safe(ltd, next, &lfsck_mdt_orphan_list,
ltd_orphan_list) {
list_del_init(<d->ltd_orphan_list);
kref_put(<d->ltd_ref, lfsck_tgt_free);
}
lu_context_key_degister(&lfsck_thread_key);
}
void lfsck_tgt_free(struct kref *kref)
{
struct lfsck_tgt_desc *ltd = container_of(kref, struct lfsck_tgt_desc,
ltd_ref);
OBD_FREE_PTR(ltd);
}
MODULE_AUTHOR("OpenSFS, Inc. <http://www.lustre.org/>");
MODULE_DESCRIPTION("Lustre File System Checker");
MODULE_VERSION(LUSTRE_VERSION_STRING);
MODULE_LICENSE("GPL");
late_initcall_sync(lfsck_init);
module_exit(lfsck_exit);