mirror of https://gitee.com/openkylin/linux.git
staging: lustre: Fix typo in lustre/ptlrpc
This patch fixed spelling typo in lustre/ptlrpc. Signed-off-by: Masanari Iida <standby24x7@gmail.com> Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
This commit is contained in:
parent
fb4b81fea5
commit
b6da17f319
|
@ -545,7 +545,7 @@ int ptlrpc_ni_init(void)
|
|||
* different depending on... */
|
||||
/* kernel LNet calls our master callback when there are new event,
|
||||
* because we are guaranteed to get every event via callback,
|
||||
* so we just set EQ size to 0 to avoid overhread of serializing
|
||||
* so we just set EQ size to 0 to avoid overhead of serializing
|
||||
* enqueue/dequeue operations in LNet. */
|
||||
rc = LNetEQAlloc(0, ptlrpc_master_callback, &ptlrpc_eq_h);
|
||||
if (rc == 0)
|
||||
|
|
|
@ -1042,7 +1042,7 @@ static int ptlrpc_connect_interpret(const struct lu_env *env,
|
|||
if ((ocd->ocd_cksum_types &
|
||||
cksum_types_supported_client()) == 0) {
|
||||
LCONSOLE_WARN("The negotiation of the checksum "
|
||||
"alogrithm to use with server %s "
|
||||
"algorithm to use with server %s "
|
||||
"failed (%x/%x), disabling "
|
||||
"checksums\n",
|
||||
obd2cli_tgt(imp->imp_obd),
|
||||
|
@ -1260,7 +1260,7 @@ static int ptlrpc_invalidate_import_thread(void *data)
|
|||
/**
|
||||
* This is the state machine for client-side recovery on import.
|
||||
*
|
||||
* Typicaly we have two possibly paths. If we came to server and it is not
|
||||
* Typically we have two possibly paths. If we came to server and it is not
|
||||
* in recovery, we just enter IMP_EVICTED state, invalidate our import
|
||||
* state and reconnect from scratch.
|
||||
* If we came to server that is in recovery, we enter IMP_REPLAY import state.
|
||||
|
|
|
@ -2154,7 +2154,7 @@ EXPORT_SYMBOL(req_capsule_server_sized_swab_get);
|
|||
* request (if the caller is executing on the server-side) or reply (if the
|
||||
* caller is executing on the client-side).
|
||||
*
|
||||
* This function convienient for use is code that could be executed on the
|
||||
* This function convenient for use is code that could be executed on the
|
||||
* client and server alike.
|
||||
*/
|
||||
const void *req_capsule_other_get(struct req_capsule *pill,
|
||||
|
|
|
@ -616,7 +616,7 @@ static int ptlrpc_lprocfs_nrs_seq_show(struct seq_file *m, void *n)
|
|||
}
|
||||
|
||||
/**
|
||||
* The longest valid command string is the maxium policy name size, plus the
|
||||
* The longest valid command string is the maximum policy name size, plus the
|
||||
* length of the " reg" substring
|
||||
*/
|
||||
#define LPROCFS_NRS_WR_MAX_CMD (NRS_POL_NAME_MAX + sizeof(" reg") - 1)
|
||||
|
@ -1184,7 +1184,7 @@ int lprocfs_wr_evict_client(struct file *file, const char *buffer,
|
|||
}
|
||||
tmpbuf = cfs_firststr(kbuf, min_t(unsigned long, BUFLEN - 1, count));
|
||||
/* Kludge code(deadlock situation): the lprocfs lock has been held
|
||||
* since the client is evicted by writting client's
|
||||
* since the client is evicted by writing client's
|
||||
* uuid/nid to procfs "evict_client" entry. However,
|
||||
* obd_export_evict_by_uuid() will call lprocfs_remove() to destroy
|
||||
* the proc entries under the being destroyed export{}, so I have
|
||||
|
|
|
@ -349,7 +349,7 @@ static void ptlrpc_at_set_reply(struct ptlrpc_request *req, int flags)
|
|||
/**
|
||||
* Send request reply from request \a req reply buffer.
|
||||
* \a flags defines reply types
|
||||
* Returns 0 on sucess or error code
|
||||
* Returns 0 on success or error code
|
||||
*/
|
||||
int ptlrpc_send_reply(struct ptlrpc_request *req, int flags)
|
||||
{
|
||||
|
@ -389,7 +389,7 @@ int ptlrpc_send_reply(struct ptlrpc_request *req, int flags)
|
|||
* ptlrpc_body in reply buffer to ptlrpc_body_v2, otherwise, the
|
||||
* reply buffer on client will be overflow.
|
||||
*
|
||||
* XXX Remove this whenver we drop the interoprability with such client.
|
||||
* XXX Remove this whenever we drop the interoprability with such client.
|
||||
*/
|
||||
req->rq_replen = lustre_shrink_msg(req->rq_repmsg, 0,
|
||||
sizeof(struct ptlrpc_body_v2), 1);
|
||||
|
|
|
@ -1322,7 +1322,7 @@ EXPORT_SYMBOL(ptlrpc_nrs_policy_unregister);
|
|||
* Setup NRS heads on all service partitions of service \a svc, and register
|
||||
* all compatible policies on those NRS heads.
|
||||
*
|
||||
* To be called from withing ptl
|
||||
* To be called from within ptl
|
||||
* \param[in] svc the service to setup
|
||||
*
|
||||
* \retval -ve error, the calling logic should eventually call
|
||||
|
@ -1736,7 +1736,7 @@ int ptlrpc_nrs_init(void)
|
|||
}
|
||||
|
||||
/**
|
||||
* Removes all policy desciptors from nrs_core::nrs_policies, and frees the
|
||||
* Removes all policy descriptors from nrs_core::nrs_policies, and frees the
|
||||
* policy descriptors.
|
||||
*
|
||||
* Since all PTLRPC services are stopped at this point, there are no more
|
||||
|
|
|
@ -123,7 +123,7 @@ int lustre_msg_early_size(void)
|
|||
* with the old client (< 2.3) which doesn't have pb_jobid
|
||||
* in the ptlrpc_body.
|
||||
*
|
||||
* XXX Remove this whenever we dorp interoprability with such
|
||||
* XXX Remove this whenever we drop interoprability with such
|
||||
* client.
|
||||
*/
|
||||
__u32 pblen = sizeof(struct ptlrpc_body_v2);
|
||||
|
@ -1537,7 +1537,7 @@ void lustre_msg_set_jobid(struct lustre_msg *msg, char *jobid)
|
|||
__u32 opc = lustre_msg_get_opc(msg);
|
||||
struct ptlrpc_body *pb;
|
||||
|
||||
/* Don't set jobid for ldlm ast RPCs, they've been shrinked.
|
||||
/* Don't set jobid for ldlm ast RPCs, they've been shrunk.
|
||||
* See the comment in ptlrpc_request_pack(). */
|
||||
if (!opc || opc == LDLM_BL_CALLBACK ||
|
||||
opc == LDLM_CP_CALLBACK || opc == LDLM_GL_CALLBACK)
|
||||
|
|
|
@ -229,7 +229,7 @@ void ptlrpcd_add_req(struct ptlrpc_request *req, pdl_policy_t policy, int idx)
|
|||
spin_unlock(&req->rq_lock);
|
||||
l_wait_event(req->rq_set_waitq, (req->rq_set == NULL), &lwi);
|
||||
} else if (req->rq_set) {
|
||||
/* If we have a vaid "rq_set", just reuse it to avoid double
|
||||
/* If we have a valid "rq_set", just reuse it to avoid double
|
||||
* linked. */
|
||||
LASSERT(req->rq_phase == RQ_PHASE_NEW);
|
||||
LASSERT(req->rq_send_state == LUSTRE_IMP_REPLAY);
|
||||
|
@ -471,7 +471,7 @@ static int ptlrpcd(void *arg)
|
|||
* be better. But it breaks former data transfer policy.
|
||||
*
|
||||
* So we shouldn't be blind for avoiding the data transfer. We make some
|
||||
* compromise: divide the ptlrpcd threds pool into two parts. One part is
|
||||
* compromise: divide the ptlrpcd threads pool into two parts. One part is
|
||||
* for bound mode, each ptlrpcd thread in this part is bound to some CPU
|
||||
* core. The other part is for free mode, all the ptlrpcd threads in the
|
||||
* part can be scheduled on any CPU core. We specify some partnership
|
||||
|
|
|
@ -113,7 +113,7 @@ static struct ptlrpc_enc_page_pool {
|
|||
unsigned long epp_st_missings; /* # of cache missing */
|
||||
unsigned long epp_st_lowfree; /* lowest free pages reached */
|
||||
unsigned int epp_st_max_wqlen; /* highest waitqueue length */
|
||||
cfs_time_t epp_st_max_wait; /* in jeffies */
|
||||
cfs_time_t epp_st_max_wait; /* in jiffies */
|
||||
/*
|
||||
* pointers to pools
|
||||
*/
|
||||
|
|
|
@ -255,7 +255,7 @@ void sptlrpc_rule_set_free(struct sptlrpc_rule_set *rset)
|
|||
EXPORT_SYMBOL(sptlrpc_rule_set_free);
|
||||
|
||||
/*
|
||||
* return 0 if the rule set could accomodate one more rule.
|
||||
* return 0 if the rule set could accommodate one more rule.
|
||||
*/
|
||||
int sptlrpc_rule_set_expand(struct sptlrpc_rule_set *rset)
|
||||
{
|
||||
|
|
|
@ -752,7 +752,7 @@ ptlrpc_register_service(struct ptlrpc_service_conf *conf,
|
|||
spin_lock_init(&service->srv_lock);
|
||||
service->srv_name = conf->psc_name;
|
||||
service->srv_watchdog_factor = conf->psc_watchdog_factor;
|
||||
INIT_LIST_HEAD(&service->srv_list); /* for safty of cleanup */
|
||||
INIT_LIST_HEAD(&service->srv_list); /* for safety of cleanup */
|
||||
|
||||
/* buffer configuration */
|
||||
service->srv_nbuf_per_group = test_req_buffer_pressure ?
|
||||
|
|
Loading…
Reference in New Issue