4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2011, 2015, Intel Corporation.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
37 /** Implementation of client-side PortalRPC interfaces */
39 #define DEBUG_SUBSYSTEM S_RPC
41 #include <obd_support.h>
42 #include <obd_class.h>
43 #include <lustre_lib.h>
44 #include <lustre_ha.h>
45 #include <lustre_import.h>
46 #include <lustre_req_layout.h>
48 #include "ptlrpc_internal.h"
50 const struct ptlrpc_bulk_frag_ops ptlrpc_bulk_kiov_pin_ops = {
51 .add_kiov_frag = ptlrpc_prep_bulk_page_pin,
52 .release_frags = ptlrpc_release_bulk_page_pin,
54 EXPORT_SYMBOL(ptlrpc_bulk_kiov_pin_ops);
56 const struct ptlrpc_bulk_frag_ops ptlrpc_bulk_kiov_nopin_ops = {
57 .add_kiov_frag = ptlrpc_prep_bulk_page_nopin,
58 .release_frags = ptlrpc_release_bulk_noop,
60 EXPORT_SYMBOL(ptlrpc_bulk_kiov_nopin_ops);
62 const struct ptlrpc_bulk_frag_ops ptlrpc_bulk_kvec_ops = {
63 .add_iov_frag = ptlrpc_prep_bulk_frag,
65 EXPORT_SYMBOL(ptlrpc_bulk_kvec_ops);
67 static int ptlrpc_send_new_req(struct ptlrpc_request *req);
68 static int ptlrpcd_check_work(struct ptlrpc_request *req);
69 static int ptlrpc_unregister_reply(struct ptlrpc_request *request, int async);
72 * Initialize passed in client structure \a cl.
74 void ptlrpc_init_client(int req_portal, int rep_portal, char *name,
75 struct ptlrpc_client *cl)
77 cl->cli_request_portal = req_portal;
78 cl->cli_reply_portal = rep_portal;
81 EXPORT_SYMBOL(ptlrpc_init_client);
84 * Return PortalRPC connection for remore uud \a uuid
86 struct ptlrpc_connection *ptlrpc_uuid_to_connection(struct obd_uuid *uuid)
88 struct ptlrpc_connection *c;
90 lnet_process_id_t peer;
93 /* ptlrpc_uuid_to_peer() initializes its 2nd parameter
94 * before accessing its values. */
95 /* coverity[uninit_use_in_call] */
96 err = ptlrpc_uuid_to_peer(uuid, &peer, &self);
98 CNETERR("cannot find peer %s!\n", uuid->uuid);
102 c = ptlrpc_connection_get(peer, self, uuid);
104 memcpy(c->c_remote_uuid.uuid,
105 uuid->uuid, sizeof(c->c_remote_uuid.uuid));
108 CDEBUG(D_INFO, "%s -> %p\n", uuid->uuid, c);
114 * Allocate and initialize new bulk descriptor on the sender.
115 * Returns pointer to the descriptor or NULL on error.
117 struct ptlrpc_bulk_desc *ptlrpc_new_bulk(unsigned nfrags, unsigned max_brw,
118 enum ptlrpc_bulk_op_type type,
120 const struct ptlrpc_bulk_frag_ops *ops)
122 struct ptlrpc_bulk_desc *desc;
125 /* ensure that only one of KIOV or IOVEC is set but not both */
126 LASSERT((ptlrpc_is_bulk_desc_kiov(type) &&
127 ops->add_kiov_frag != NULL) ||
128 (ptlrpc_is_bulk_desc_kvec(type) &&
129 ops->add_iov_frag != NULL));
131 if (type & PTLRPC_BULK_BUF_KIOV) {
133 offsetof(struct ptlrpc_bulk_desc,
134 bd_u.bd_kiov.bd_vec[nfrags]));
137 offsetof(struct ptlrpc_bulk_desc,
138 bd_u.bd_kvec.bd_kvec[nfrags]));
144 spin_lock_init(&desc->bd_lock);
145 init_waitqueue_head(&desc->bd_waitq);
146 desc->bd_max_iov = nfrags;
147 desc->bd_iov_count = 0;
148 desc->bd_portal = portal;
149 desc->bd_type = type;
150 desc->bd_md_count = 0;
151 desc->bd_frag_ops = (struct ptlrpc_bulk_frag_ops *) ops;
152 LASSERT(max_brw > 0);
153 desc->bd_md_max_brw = min(max_brw, PTLRPC_BULK_OPS_COUNT);
154 /* PTLRPC_BULK_OPS_COUNT is the compile-time transfer limit for this
155 * node. Negotiated ocd_brw_size will always be <= this number. */
156 for (i = 0; i < PTLRPC_BULK_OPS_COUNT; i++)
157 LNetInvalidateHandle(&desc->bd_mds[i]);
163 * Prepare bulk descriptor for specified outgoing request \a req that
164 * can fit \a nfrags * pages. \a type is bulk type. \a portal is where
165 * the bulk to be sent. Used on client-side.
166 * Returns pointer to newly allocatrd initialized bulk descriptor or NULL on
169 struct ptlrpc_bulk_desc *ptlrpc_prep_bulk_imp(struct ptlrpc_request *req,
170 unsigned nfrags, unsigned max_brw,
173 const struct ptlrpc_bulk_frag_ops
176 struct obd_import *imp = req->rq_import;
177 struct ptlrpc_bulk_desc *desc;
180 LASSERT(ptlrpc_is_bulk_op_passive(type));
182 desc = ptlrpc_new_bulk(nfrags, max_brw, type, portal, ops);
186 desc->bd_import_generation = req->rq_import_generation;
187 desc->bd_import = class_import_get(imp);
190 desc->bd_cbid.cbid_fn = client_bulk_callback;
191 desc->bd_cbid.cbid_arg = desc;
193 /* This makes req own desc, and free it when she frees herself */
198 EXPORT_SYMBOL(ptlrpc_prep_bulk_imp);
200 void __ptlrpc_prep_bulk_page(struct ptlrpc_bulk_desc *desc,
201 struct page *page, int pageoffset, int len,
206 LASSERT(desc->bd_iov_count < desc->bd_max_iov);
207 LASSERT(page != NULL);
208 LASSERT(pageoffset >= 0);
210 LASSERT(pageoffset + len <= PAGE_CACHE_SIZE);
211 LASSERT(ptlrpc_is_bulk_desc_kiov(desc->bd_type));
213 kiov = &BD_GET_KIOV(desc, desc->bd_iov_count);
218 page_cache_get(page);
220 kiov->kiov_page = page;
221 kiov->kiov_offset = pageoffset;
222 kiov->kiov_len = len;
224 desc->bd_iov_count++;
226 EXPORT_SYMBOL(__ptlrpc_prep_bulk_page);
228 int ptlrpc_prep_bulk_frag(struct ptlrpc_bulk_desc *desc,
234 LASSERT(desc->bd_iov_count < desc->bd_max_iov);
235 LASSERT(frag != NULL);
237 LASSERT(ptlrpc_is_bulk_desc_kvec(desc->bd_type));
239 iovec = &BD_GET_KVEC(desc, desc->bd_iov_count);
243 iovec->iov_base = frag;
244 iovec->iov_len = len;
246 desc->bd_iov_count++;
248 RETURN(desc->bd_nob);
250 EXPORT_SYMBOL(ptlrpc_prep_bulk_frag);
252 void ptlrpc_free_bulk(struct ptlrpc_bulk_desc *desc)
256 LASSERT(desc != NULL);
257 LASSERT(desc->bd_iov_count != LI_POISON); /* not freed already */
258 LASSERT(desc->bd_md_count == 0); /* network hands off */
259 LASSERT((desc->bd_export != NULL) ^ (desc->bd_import != NULL));
260 LASSERT(desc->bd_frag_ops != NULL);
262 if (ptlrpc_is_bulk_desc_kiov(desc->bd_type))
263 sptlrpc_enc_pool_put_pages(desc);
266 class_export_put(desc->bd_export);
268 class_import_put(desc->bd_import);
270 if (desc->bd_frag_ops->release_frags != NULL)
271 desc->bd_frag_ops->release_frags(desc);
273 if (ptlrpc_is_bulk_desc_kiov(desc->bd_type))
274 OBD_FREE(desc, offsetof(struct ptlrpc_bulk_desc,
275 bd_u.bd_kiov.bd_vec[desc->bd_max_iov]));
277 OBD_FREE(desc, offsetof(struct ptlrpc_bulk_desc,
278 bd_u.bd_kvec.bd_kvec[desc->
283 EXPORT_SYMBOL(ptlrpc_free_bulk);
286 * Set server timelimit for this req, i.e. how long are we willing to wait
287 * for reply before timing out this request.
289 void ptlrpc_at_set_req_timeout(struct ptlrpc_request *req)
295 LASSERT(req->rq_import);
298 /* non-AT settings */
300 * \a imp_server_timeout means this is reverse import and
301 * we send (currently only) ASTs to the client and cannot afford
302 * to wait too long for the reply, otherwise the other client
303 * (because of which we are sending this request) would
304 * timeout waiting for us
306 req->rq_timeout = req->rq_import->imp_server_timeout ?
307 obd_timeout / 2 : obd_timeout;
309 at = &req->rq_import->imp_at;
310 idx = import_at_get_index(req->rq_import,
311 req->rq_request_portal);
312 serv_est = at_get(&at->iat_service_estimate[idx]);
313 req->rq_timeout = at_est2timeout(serv_est);
315 /* We could get even fancier here, using history to predict increased
318 /* Let the server know what this RPC timeout is by putting it in the
320 lustre_msg_set_timeout(req->rq_reqmsg, req->rq_timeout);
322 EXPORT_SYMBOL(ptlrpc_at_set_req_timeout);
324 /* Adjust max service estimate based on server value */
325 static void ptlrpc_at_adj_service(struct ptlrpc_request *req,
326 unsigned int serv_est)
332 LASSERT(req->rq_import);
333 at = &req->rq_import->imp_at;
335 idx = import_at_get_index(req->rq_import, req->rq_request_portal);
336 /* max service estimates are tracked on the server side,
337 so just keep minimal history here */
338 oldse = at_measured(&at->iat_service_estimate[idx], serv_est);
340 CDEBUG(D_ADAPTTO, "The RPC service estimate for %s ptl %d "
341 "has changed from %d to %d\n",
342 req->rq_import->imp_obd->obd_name,req->rq_request_portal,
343 oldse, at_get(&at->iat_service_estimate[idx]));
346 /* Expected network latency per remote node (secs) */
347 int ptlrpc_at_get_net_latency(struct ptlrpc_request *req)
349 return AT_OFF ? 0 : at_get(&req->rq_import->imp_at.iat_net_latency);
352 /* Adjust expected network latency */
353 void ptlrpc_at_adj_net_latency(struct ptlrpc_request *req,
354 unsigned int service_time)
356 unsigned int nl, oldnl;
358 time_t now = cfs_time_current_sec();
360 LASSERT(req->rq_import);
362 if (service_time > now - req->rq_sent + 3) {
363 /* bz16408, however, this can also happen if early reply
364 * is lost and client RPC is expired and resent, early reply
365 * or reply of original RPC can still be fit in reply buffer
366 * of resent RPC, now client is measuring time from the
367 * resent time, but server sent back service time of original
370 CDEBUG((lustre_msg_get_flags(req->rq_reqmsg) & MSG_RESENT) ?
371 D_ADAPTTO : D_WARNING,
372 "Reported service time %u > total measured time "
373 CFS_DURATION_T"\n", service_time,
374 cfs_time_sub(now, req->rq_sent));
378 /* Network latency is total time less server processing time */
379 nl = max_t(int, now - req->rq_sent -
380 service_time, 0) + 1; /* st rounding */
381 at = &req->rq_import->imp_at;
383 oldnl = at_measured(&at->iat_net_latency, nl);
385 CDEBUG(D_ADAPTTO, "The network latency for %s (nid %s) "
386 "has changed from %d to %d\n",
387 req->rq_import->imp_obd->obd_name,
389 &req->rq_import->imp_connection->c_remote_uuid),
390 oldnl, at_get(&at->iat_net_latency));
393 static int unpack_reply(struct ptlrpc_request *req)
397 if (SPTLRPC_FLVR_POLICY(req->rq_flvr.sf_rpc) != SPTLRPC_POLICY_NULL) {
398 rc = ptlrpc_unpack_rep_msg(req, req->rq_replen);
400 DEBUG_REQ(D_ERROR, req, "unpack_rep failed: %d", rc);
405 rc = lustre_unpack_rep_ptlrpc_body(req, MSG_PTLRPC_BODY_OFF);
407 DEBUG_REQ(D_ERROR, req, "unpack ptlrpc body failed: %d", rc);
414 * Handle an early reply message, called with the rq_lock held.
415 * If anything goes wrong just ignore it - same as if it never happened
417 static int ptlrpc_at_recv_early_reply(struct ptlrpc_request *req)
418 __must_hold(&req->rq_lock)
420 struct ptlrpc_request *early_req;
426 spin_unlock(&req->rq_lock);
428 rc = sptlrpc_cli_unwrap_early_reply(req, &early_req);
430 spin_lock(&req->rq_lock);
434 rc = unpack_reply(early_req);
436 sptlrpc_cli_finish_early_reply(early_req);
437 spin_lock(&req->rq_lock);
441 /* Use new timeout value just to adjust the local value for this
442 * request, don't include it into at_history. It is unclear yet why
443 * service time increased and should it be counted or skipped, e.g.
444 * that can be recovery case or some error or server, the real reply
445 * will add all new data if it is worth to add. */
446 req->rq_timeout = lustre_msg_get_timeout(early_req->rq_repmsg);
447 lustre_msg_set_timeout(req->rq_reqmsg, req->rq_timeout);
449 /* Network latency can be adjusted, it is pure network delays */
450 ptlrpc_at_adj_net_latency(req,
451 lustre_msg_get_service_time(early_req->rq_repmsg));
453 sptlrpc_cli_finish_early_reply(early_req);
455 spin_lock(&req->rq_lock);
456 olddl = req->rq_deadline;
457 /* server assumes it now has rq_timeout from when the request
458 * arrived, so the client should give it at least that long.
459 * since we don't know the arrival time we'll use the original
461 req->rq_deadline = req->rq_sent + req->rq_timeout +
462 ptlrpc_at_get_net_latency(req);
464 DEBUG_REQ(D_ADAPTTO, req,
465 "Early reply #%d, new deadline in "CFS_DURATION_T"s "
466 "("CFS_DURATION_T"s)", req->rq_early_count,
467 cfs_time_sub(req->rq_deadline, cfs_time_current_sec()),
468 cfs_time_sub(req->rq_deadline, olddl));
473 static struct kmem_cache *request_cache;
475 int ptlrpc_request_cache_init(void)
477 request_cache = kmem_cache_create("ptlrpc_cache",
478 sizeof(struct ptlrpc_request),
479 0, SLAB_HWCACHE_ALIGN, NULL);
480 return request_cache == NULL ? -ENOMEM : 0;
483 void ptlrpc_request_cache_fini(void)
485 kmem_cache_destroy(request_cache);
488 struct ptlrpc_request *ptlrpc_request_cache_alloc(gfp_t flags)
490 struct ptlrpc_request *req;
492 OBD_SLAB_ALLOC_PTR_GFP(req, request_cache, flags);
496 void ptlrpc_request_cache_free(struct ptlrpc_request *req)
498 OBD_SLAB_FREE_PTR(req, request_cache);
502 * Wind down request pool \a pool.
503 * Frees all requests from the pool too
505 void ptlrpc_free_rq_pool(struct ptlrpc_request_pool *pool)
507 struct list_head *l, *tmp;
508 struct ptlrpc_request *req;
510 LASSERT(pool != NULL);
512 spin_lock(&pool->prp_lock);
513 list_for_each_safe(l, tmp, &pool->prp_req_list) {
514 req = list_entry(l, struct ptlrpc_request, rq_list);
515 list_del(&req->rq_list);
516 LASSERT(req->rq_reqbuf);
517 LASSERT(req->rq_reqbuf_len == pool->prp_rq_size);
518 OBD_FREE_LARGE(req->rq_reqbuf, pool->prp_rq_size);
519 ptlrpc_request_cache_free(req);
521 spin_unlock(&pool->prp_lock);
522 OBD_FREE(pool, sizeof(*pool));
524 EXPORT_SYMBOL(ptlrpc_free_rq_pool);
527 * Allocates, initializes and adds \a num_rq requests to the pool \a pool
529 int ptlrpc_add_rqs_to_pool(struct ptlrpc_request_pool *pool, int num_rq)
534 while (size < pool->prp_rq_size)
537 LASSERTF(list_empty(&pool->prp_req_list) ||
538 size == pool->prp_rq_size,
539 "Trying to change pool size with nonempty pool "
540 "from %d to %d bytes\n", pool->prp_rq_size, size);
542 spin_lock(&pool->prp_lock);
543 pool->prp_rq_size = size;
544 for (i = 0; i < num_rq; i++) {
545 struct ptlrpc_request *req;
546 struct lustre_msg *msg;
548 spin_unlock(&pool->prp_lock);
549 req = ptlrpc_request_cache_alloc(GFP_NOFS);
552 OBD_ALLOC_LARGE(msg, size);
554 ptlrpc_request_cache_free(req);
557 req->rq_reqbuf = msg;
558 req->rq_reqbuf_len = size;
560 spin_lock(&pool->prp_lock);
561 list_add_tail(&req->rq_list, &pool->prp_req_list);
563 spin_unlock(&pool->prp_lock);
566 EXPORT_SYMBOL(ptlrpc_add_rqs_to_pool);
569 * Create and initialize new request pool with given attributes:
570 * \a num_rq - initial number of requests to create for the pool
571 * \a msgsize - maximum message size possible for requests in thid pool
572 * \a populate_pool - function to be called when more requests need to be added
574 * Returns pointer to newly created pool or NULL on error.
576 struct ptlrpc_request_pool *
577 ptlrpc_init_rq_pool(int num_rq, int msgsize,
578 int (*populate_pool)(struct ptlrpc_request_pool *, int))
580 struct ptlrpc_request_pool *pool;
582 OBD_ALLOC(pool, sizeof(struct ptlrpc_request_pool));
586 /* Request next power of two for the allocation, because internally
587 kernel would do exactly this */
589 spin_lock_init(&pool->prp_lock);
590 INIT_LIST_HEAD(&pool->prp_req_list);
591 pool->prp_rq_size = msgsize + SPTLRPC_MAX_PAYLOAD;
592 pool->prp_populate = populate_pool;
594 populate_pool(pool, num_rq);
598 EXPORT_SYMBOL(ptlrpc_init_rq_pool);
601 * Fetches one request from pool \a pool
603 static struct ptlrpc_request *
604 ptlrpc_prep_req_from_pool(struct ptlrpc_request_pool *pool)
606 struct ptlrpc_request *request;
607 struct lustre_msg *reqbuf;
612 spin_lock(&pool->prp_lock);
614 /* See if we have anything in a pool, and bail out if nothing,
615 * in writeout path, where this matters, this is safe to do, because
616 * nothing is lost in this case, and when some in-flight requests
617 * complete, this code will be called again. */
618 if (unlikely(list_empty(&pool->prp_req_list))) {
619 spin_unlock(&pool->prp_lock);
623 request = list_entry(pool->prp_req_list.next, struct ptlrpc_request,
625 list_del_init(&request->rq_list);
626 spin_unlock(&pool->prp_lock);
628 LASSERT(request->rq_reqbuf);
629 LASSERT(request->rq_pool);
631 reqbuf = request->rq_reqbuf;
632 memset(request, 0, sizeof(*request));
633 request->rq_reqbuf = reqbuf;
634 request->rq_reqbuf_len = pool->prp_rq_size;
635 request->rq_pool = pool;
641 * Returns freed \a request to pool.
643 static void __ptlrpc_free_req_to_pool(struct ptlrpc_request *request)
645 struct ptlrpc_request_pool *pool = request->rq_pool;
647 spin_lock(&pool->prp_lock);
648 LASSERT(list_empty(&request->rq_list));
649 LASSERT(!request->rq_receiving_reply);
650 list_add_tail(&request->rq_list, &pool->prp_req_list);
651 spin_unlock(&pool->prp_lock);
654 void ptlrpc_add_unreplied(struct ptlrpc_request *req)
656 struct obd_import *imp = req->rq_import;
657 struct list_head *tmp;
658 struct ptlrpc_request *iter;
660 assert_spin_locked(&imp->imp_lock);
661 LASSERT(list_empty(&req->rq_unreplied_list));
663 /* unreplied list is sorted by xid in ascending order */
664 list_for_each_prev(tmp, &imp->imp_unreplied_list) {
665 iter = list_entry(tmp, struct ptlrpc_request,
668 LASSERT(req->rq_xid != iter->rq_xid);
669 if (req->rq_xid < iter->rq_xid)
671 list_add(&req->rq_unreplied_list, &iter->rq_unreplied_list);
674 list_add(&req->rq_unreplied_list, &imp->imp_unreplied_list);
677 void ptlrpc_assign_next_xid_nolock(struct ptlrpc_request *req)
679 req->rq_xid = ptlrpc_next_xid();
680 ptlrpc_add_unreplied(req);
683 static inline void ptlrpc_assign_next_xid(struct ptlrpc_request *req)
685 spin_lock(&req->rq_import->imp_lock);
686 ptlrpc_assign_next_xid_nolock(req);
687 spin_unlock(&req->rq_import->imp_lock);
690 int ptlrpc_request_bufs_pack(struct ptlrpc_request *request,
691 __u32 version, int opcode, char **bufs,
692 struct ptlrpc_cli_ctx *ctx)
695 struct obd_import *imp;
701 count = req_capsule_filled_sizes(&request->rq_pill, RCL_CLIENT);
702 imp = request->rq_import;
703 lengths = request->rq_pill.rc_area[RCL_CLIENT];
706 request->rq_cli_ctx = sptlrpc_cli_ctx_get(ctx);
708 rc = sptlrpc_req_get_ctx(request);
712 sptlrpc_req_set_flavor(request, opcode);
714 rc = lustre_pack_request(request, imp->imp_msg_magic, count,
719 lustre_msg_add_version(request->rq_reqmsg, version);
720 request->rq_send_state = LUSTRE_IMP_FULL;
721 request->rq_type = PTL_RPC_MSG_REQUEST;
723 request->rq_req_cbid.cbid_fn = request_out_callback;
724 request->rq_req_cbid.cbid_arg = request;
726 request->rq_reply_cbid.cbid_fn = reply_in_callback;
727 request->rq_reply_cbid.cbid_arg = request;
729 request->rq_reply_deadline = 0;
730 request->rq_phase = RQ_PHASE_NEW;
731 request->rq_next_phase = RQ_PHASE_UNDEFINED;
733 request->rq_request_portal = imp->imp_client->cli_request_portal;
734 request->rq_reply_portal = imp->imp_client->cli_reply_portal;
736 ptlrpc_at_set_req_timeout(request);
738 lustre_msg_set_opc(request->rq_reqmsg, opcode);
739 ptlrpc_assign_next_xid(request);
744 LASSERT(!request->rq_pool);
745 sptlrpc_cli_ctx_put(request->rq_cli_ctx, 1);
747 class_import_put(imp);
752 EXPORT_SYMBOL(ptlrpc_request_bufs_pack);
755 * Pack request buffers for network transfer, performing necessary encryption
756 * steps if necessary.
758 int ptlrpc_request_pack(struct ptlrpc_request *request,
759 __u32 version, int opcode)
762 rc = ptlrpc_request_bufs_pack(request, version, opcode, NULL, NULL);
766 /* For some old 1.8 clients (< 1.8.7), they will LASSERT the size of
767 * ptlrpc_body sent from server equal to local ptlrpc_body size, so we
768 * have to send old ptlrpc_body to keep interoprability with these
771 * Only three kinds of server->client RPCs so far:
776 * XXX This should be removed whenever we drop the interoprability with
777 * the these old clients.
779 if (opcode == LDLM_BL_CALLBACK || opcode == LDLM_CP_CALLBACK ||
780 opcode == LDLM_GL_CALLBACK)
781 req_capsule_shrink(&request->rq_pill, &RMF_PTLRPC_BODY,
782 sizeof(struct ptlrpc_body_v2), RCL_CLIENT);
786 EXPORT_SYMBOL(ptlrpc_request_pack);
789 * Helper function to allocate new request on import \a imp
790 * and possibly using existing request from pool \a pool if provided.
791 * Returns allocated request structure with import field filled or
795 struct ptlrpc_request *__ptlrpc_request_alloc(struct obd_import *imp,
796 struct ptlrpc_request_pool *pool)
798 struct ptlrpc_request *request = NULL;
800 request = ptlrpc_request_cache_alloc(GFP_NOFS);
802 if (!request && pool)
803 request = ptlrpc_prep_req_from_pool(pool);
806 ptlrpc_cli_req_init(request);
808 LASSERTF((unsigned long)imp > 0x1000, "%p", imp);
809 LASSERT(imp != LP_POISON);
810 LASSERTF((unsigned long)imp->imp_client > 0x1000, "%p\n",
812 LASSERT(imp->imp_client != LP_POISON);
814 request->rq_import = class_import_get(imp);
816 CERROR("request allocation out of memory\n");
823 * Helper function for creating a request.
824 * Calls __ptlrpc_request_alloc to allocate new request sturcture and inits
825 * buffer structures according to capsule template \a format.
826 * Returns allocated request structure pointer or NULL on error.
828 static struct ptlrpc_request *
829 ptlrpc_request_alloc_internal(struct obd_import *imp,
830 struct ptlrpc_request_pool * pool,
831 const struct req_format *format)
833 struct ptlrpc_request *request;
835 request = __ptlrpc_request_alloc(imp, pool);
839 req_capsule_init(&request->rq_pill, request, RCL_CLIENT);
840 req_capsule_set(&request->rq_pill, format);
845 * Allocate new request structure for import \a imp and initialize its
846 * buffer structure according to capsule template \a format.
848 struct ptlrpc_request *ptlrpc_request_alloc(struct obd_import *imp,
849 const struct req_format *format)
851 return ptlrpc_request_alloc_internal(imp, NULL, format);
853 EXPORT_SYMBOL(ptlrpc_request_alloc);
856 * Allocate new request structure for import \a imp from pool \a pool and
857 * initialize its buffer structure according to capsule template \a format.
859 struct ptlrpc_request *ptlrpc_request_alloc_pool(struct obd_import *imp,
860 struct ptlrpc_request_pool * pool,
861 const struct req_format *format)
863 return ptlrpc_request_alloc_internal(imp, pool, format);
865 EXPORT_SYMBOL(ptlrpc_request_alloc_pool);
868 * For requests not from pool, free memory of the request structure.
869 * For requests obtained from a pool earlier, return request back to pool.
871 void ptlrpc_request_free(struct ptlrpc_request *request)
873 if (request->rq_pool)
874 __ptlrpc_free_req_to_pool(request);
876 ptlrpc_request_cache_free(request);
878 EXPORT_SYMBOL(ptlrpc_request_free);
881 * Allocate new request for operatione \a opcode and immediatelly pack it for
883 * Only used for simple requests like OBD_PING where the only important
884 * part of the request is operation itself.
885 * Returns allocated request or NULL on error.
887 struct ptlrpc_request *ptlrpc_request_alloc_pack(struct obd_import *imp,
888 const struct req_format *format,
889 __u32 version, int opcode)
891 struct ptlrpc_request *req = ptlrpc_request_alloc(imp, format);
895 rc = ptlrpc_request_pack(req, version, opcode);
897 ptlrpc_request_free(req);
903 EXPORT_SYMBOL(ptlrpc_request_alloc_pack);
906 * Allocate and initialize new request set structure on the current CPT.
907 * Returns a pointer to the newly allocated set structure or NULL on error.
909 struct ptlrpc_request_set *ptlrpc_prep_set(void)
911 struct ptlrpc_request_set *set;
915 cpt = cfs_cpt_current(cfs_cpt_table, 0);
916 OBD_CPT_ALLOC(set, cfs_cpt_table, cpt, sizeof *set);
919 atomic_set(&set->set_refcount, 1);
920 INIT_LIST_HEAD(&set->set_requests);
921 init_waitqueue_head(&set->set_waitq);
922 atomic_set(&set->set_new_count, 0);
923 atomic_set(&set->set_remaining, 0);
924 spin_lock_init(&set->set_new_req_lock);
925 INIT_LIST_HEAD(&set->set_new_requests);
926 INIT_LIST_HEAD(&set->set_cblist);
927 set->set_max_inflight = UINT_MAX;
928 set->set_producer = NULL;
929 set->set_producer_arg = NULL;
934 EXPORT_SYMBOL(ptlrpc_prep_set);
937 * Allocate and initialize new request set structure with flow control
938 * extension. This extension allows to control the number of requests in-flight
939 * for the whole set. A callback function to generate requests must be provided
940 * and the request set will keep the number of requests sent over the wire to
942 * Returns a pointer to the newly allocated set structure or NULL on error.
944 struct ptlrpc_request_set *ptlrpc_prep_fcset(int max, set_producer_func func,
948 struct ptlrpc_request_set *set;
950 set = ptlrpc_prep_set();
954 set->set_max_inflight = max;
955 set->set_producer = func;
956 set->set_producer_arg = arg;
962 * Wind down and free request set structure previously allocated with
964 * Ensures that all requests on the set have completed and removes
965 * all requests from the request list in a set.
966 * If any unsent request happen to be on the list, pretends that they got
967 * an error in flight and calls their completion handler.
969 void ptlrpc_set_destroy(struct ptlrpc_request_set *set)
971 struct list_head *tmp;
972 struct list_head *next;
977 /* Requests on the set should either all be completed, or all be new */
978 expected_phase = (atomic_read(&set->set_remaining) == 0) ?
979 RQ_PHASE_COMPLETE : RQ_PHASE_NEW;
980 list_for_each(tmp, &set->set_requests) {
981 struct ptlrpc_request *req =
982 list_entry(tmp, struct ptlrpc_request,
985 LASSERT(req->rq_phase == expected_phase);
989 LASSERTF(atomic_read(&set->set_remaining) == 0 ||
990 atomic_read(&set->set_remaining) == n, "%d / %d\n",
991 atomic_read(&set->set_remaining), n);
993 list_for_each_safe(tmp, next, &set->set_requests) {
994 struct ptlrpc_request *req =
995 list_entry(tmp, struct ptlrpc_request,
997 list_del_init(&req->rq_set_chain);
999 LASSERT(req->rq_phase == expected_phase);
1001 if (req->rq_phase == RQ_PHASE_NEW) {
1002 ptlrpc_req_interpret(NULL, req, -EBADR);
1003 atomic_dec(&set->set_remaining);
1006 spin_lock(&req->rq_lock);
1008 req->rq_invalid_rqset = 0;
1009 spin_unlock(&req->rq_lock);
1011 ptlrpc_req_finished (req);
1014 LASSERT(atomic_read(&set->set_remaining) == 0);
1016 ptlrpc_reqset_put(set);
1019 EXPORT_SYMBOL(ptlrpc_set_destroy);
1022 * Add a callback function \a fn to the set.
1023 * This function would be called when all requests on this set are completed.
1024 * The function will be passed \a data argument.
1026 int ptlrpc_set_add_cb(struct ptlrpc_request_set *set,
1027 set_interpreter_func fn, void *data)
1029 struct ptlrpc_set_cbdata *cbdata;
1031 OBD_ALLOC_PTR(cbdata);
1035 cbdata->psc_interpret = fn;
1036 cbdata->psc_data = data;
1037 list_add_tail(&cbdata->psc_item, &set->set_cblist);
1043 * Add a new request to the general purpose request set.
1044 * Assumes request reference from the caller.
1046 void ptlrpc_set_add_req(struct ptlrpc_request_set *set,
1047 struct ptlrpc_request *req)
1049 LASSERT(list_empty(&req->rq_set_chain));
1051 /* The set takes over the caller's request reference */
1052 list_add_tail(&req->rq_set_chain, &set->set_requests);
1054 atomic_inc(&set->set_remaining);
1055 req->rq_queued_time = cfs_time_current();
1057 if (req->rq_reqmsg != NULL)
1058 lustre_msg_set_jobid(req->rq_reqmsg, NULL);
1060 if (set->set_producer != NULL)
1061 /* If the request set has a producer callback, the RPC must be
1062 * sent straight away */
1063 ptlrpc_send_new_req(req);
1065 EXPORT_SYMBOL(ptlrpc_set_add_req);
1068 * Add a request to a request with dedicated server thread
1069 * and wake the thread to make any necessary processing.
1070 * Currently only used for ptlrpcd.
1072 void ptlrpc_set_add_new_req(struct ptlrpcd_ctl *pc,
1073 struct ptlrpc_request *req)
1075 struct ptlrpc_request_set *set = pc->pc_set;
1078 LASSERT(req->rq_set == NULL);
1079 LASSERT(test_bit(LIOD_STOP, &pc->pc_flags) == 0);
1081 spin_lock(&set->set_new_req_lock);
1083 * The set takes over the caller's request reference.
1086 req->rq_queued_time = cfs_time_current();
1087 list_add_tail(&req->rq_set_chain, &set->set_new_requests);
1088 count = atomic_inc_return(&set->set_new_count);
1089 spin_unlock(&set->set_new_req_lock);
1091 /* Only need to call wakeup once for the first entry. */
1093 wake_up(&set->set_waitq);
1095 /* XXX: It maybe unnecessary to wakeup all the partners. But to
1096 * guarantee the async RPC can be processed ASAP, we have
1097 * no other better choice. It maybe fixed in future. */
1098 for (i = 0; i < pc->pc_npartners; i++)
1099 wake_up(&pc->pc_partners[i]->pc_set->set_waitq);
1104 * Based on the current state of the import, determine if the request
1105 * can be sent, is an error, or should be delayed.
1107 * Returns true if this request should be delayed. If false, and
1108 * *status is set, then the request can not be sent and *status is the
1109 * error code. If false and status is 0, then request can be sent.
1111 * The imp->imp_lock must be held.
1113 static int ptlrpc_import_delay_req(struct obd_import *imp,
1114 struct ptlrpc_request *req, int *status)
1119 LASSERT (status != NULL);
1122 if (req->rq_ctx_init || req->rq_ctx_fini) {
1123 /* always allow ctx init/fini rpc go through */
1124 } else if (imp->imp_state == LUSTRE_IMP_NEW) {
1125 DEBUG_REQ(D_ERROR, req, "Uninitialized import.");
1127 } else if (imp->imp_state == LUSTRE_IMP_CLOSED) {
1128 /* pings may safely race with umount */
1129 DEBUG_REQ(lustre_msg_get_opc(req->rq_reqmsg) == OBD_PING ?
1130 D_HA : D_ERROR, req, "IMP_CLOSED ");
1132 } else if (ptlrpc_send_limit_expired(req)) {
1133 /* probably doesn't need to be a D_ERROR after initial testing*/
1134 DEBUG_REQ(D_HA, req, "send limit expired ");
1135 *status = -ETIMEDOUT;
1136 } else if (req->rq_send_state == LUSTRE_IMP_CONNECTING &&
1137 imp->imp_state == LUSTRE_IMP_CONNECTING) {
1138 /* allow CONNECT even if import is invalid */ ;
1139 if (atomic_read(&imp->imp_inval_count) != 0) {
1140 DEBUG_REQ(D_ERROR, req, "invalidate in flight");
1143 } else if (imp->imp_invalid || imp->imp_obd->obd_no_recov) {
1144 if (!imp->imp_deactive)
1145 DEBUG_REQ(D_NET, req, "IMP_INVALID");
1146 *status = -ESHUTDOWN; /* bz 12940 */
1147 } else if (req->rq_import_generation != imp->imp_generation) {
1148 DEBUG_REQ(D_ERROR, req, "req wrong generation:");
1150 } else if (req->rq_send_state != imp->imp_state) {
1151 /* invalidate in progress - any requests should be drop */
1152 if (atomic_read(&imp->imp_inval_count) != 0) {
1153 DEBUG_REQ(D_ERROR, req, "invalidate in flight");
1155 } else if (imp->imp_dlm_fake || req->rq_no_delay) {
1156 *status = -EWOULDBLOCK;
1157 } else if (req->rq_allow_replay &&
1158 (imp->imp_state == LUSTRE_IMP_REPLAY ||
1159 imp->imp_state == LUSTRE_IMP_REPLAY_LOCKS ||
1160 imp->imp_state == LUSTRE_IMP_REPLAY_WAIT ||
1161 imp->imp_state == LUSTRE_IMP_RECOVER)) {
1162 DEBUG_REQ(D_HA, req, "allow during recovery.\n");
1172 * Decide if the error message should be printed to the console or not.
1173 * Makes its decision based on request type, status, and failure frequency.
1175 * \param[in] req request that failed and may need a console message
1177 * \retval false if no message should be printed
1178 * \retval true if console message should be printed
1180 static bool ptlrpc_console_allow(struct ptlrpc_request *req)
1184 LASSERT(req->rq_reqmsg != NULL);
1185 opc = lustre_msg_get_opc(req->rq_reqmsg);
1187 /* Suppress particular reconnect errors which are to be expected. */
1188 if (opc == OST_CONNECT || opc == MDS_CONNECT || opc == MGS_CONNECT) {
1191 /* Suppress timed out reconnect requests */
1192 if (lustre_handle_is_used(&req->rq_import->imp_remote_handle) ||
1196 /* Suppress most unavailable/again reconnect requests, but
1197 * print occasionally so it is clear client is trying to
1198 * connect to a server where no target is running. */
1199 err = lustre_msg_get_status(req->rq_repmsg);
1200 if ((err == -ENODEV || err == -EAGAIN) &&
1201 req->rq_import->imp_conn_cnt % 30 != 20)
1209 * Check request processing status.
1210 * Returns the status.
1212 static int ptlrpc_check_status(struct ptlrpc_request *req)
1217 err = lustre_msg_get_status(req->rq_repmsg);
1218 if (lustre_msg_get_type(req->rq_repmsg) == PTL_RPC_MSG_ERR) {
1219 struct obd_import *imp = req->rq_import;
1220 lnet_nid_t nid = imp->imp_connection->c_peer.nid;
1221 __u32 opc = lustre_msg_get_opc(req->rq_reqmsg);
1223 if (ptlrpc_console_allow(req))
1224 LCONSOLE_ERROR_MSG(0x11, "%s: operation %s to node %s "
1225 "failed: rc = %d\n",
1226 imp->imp_obd->obd_name,
1228 libcfs_nid2str(nid), err);
1229 RETURN(err < 0 ? err : -EINVAL);
1233 DEBUG_REQ(D_INFO, req, "status is %d", err);
1234 } else if (err > 0) {
1235 /* XXX: translate this error from net to host */
1236 DEBUG_REQ(D_INFO, req, "status is %d", err);
1243 * save pre-versions of objects into request for replay.
1244 * Versions are obtained from server reply.
1247 static void ptlrpc_save_versions(struct ptlrpc_request *req)
1249 struct lustre_msg *repmsg = req->rq_repmsg;
1250 struct lustre_msg *reqmsg = req->rq_reqmsg;
1251 __u64 *versions = lustre_msg_get_versions(repmsg);
1254 if (lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)
1258 lustre_msg_set_versions(reqmsg, versions);
1259 CDEBUG(D_INFO, "Client save versions ["LPX64"/"LPX64"]\n",
1260 versions[0], versions[1]);
1265 __u64 ptlrpc_known_replied_xid(struct obd_import *imp)
1267 struct ptlrpc_request *req;
1269 assert_spin_locked(&imp->imp_lock);
1270 if (list_empty(&imp->imp_unreplied_list))
1273 req = list_entry(imp->imp_unreplied_list.next, struct ptlrpc_request,
1275 LASSERTF(req->rq_xid >= 1, "XID:"LPU64"\n", req->rq_xid);
1277 if (imp->imp_known_replied_xid < req->rq_xid - 1)
1278 imp->imp_known_replied_xid = req->rq_xid - 1;
1280 return req->rq_xid - 1;
1284 * Callback function called when client receives RPC reply for \a req.
1285 * Returns 0 on success or error code.
1286 * The return alue would be assigned to req->rq_status by the caller
1287 * as request processing status.
1288 * This function also decides if the request needs to be saved for later replay.
1290 static int after_reply(struct ptlrpc_request *req)
1292 struct obd_import *imp = req->rq_import;
1293 struct obd_device *obd = req->rq_import->imp_obd;
1295 struct timeval work_start;
1300 LASSERT(obd != NULL);
1301 /* repbuf must be unlinked */
1302 LASSERT(!req->rq_receiving_reply && req->rq_reply_unlinked);
1304 if (req->rq_reply_truncated) {
1305 if (ptlrpc_no_resend(req)) {
1306 DEBUG_REQ(D_ERROR, req, "reply buffer overflow,"
1307 " expected: %d, actual size: %d",
1308 req->rq_nob_received, req->rq_repbuf_len);
1312 sptlrpc_cli_free_repbuf(req);
1313 /* Pass the required reply buffer size (include
1314 * space for early reply).
1315 * NB: no need to roundup because alloc_repbuf
1316 * will roundup it */
1317 req->rq_replen = req->rq_nob_received;
1318 req->rq_nob_received = 0;
1319 spin_lock(&req->rq_lock);
1321 spin_unlock(&req->rq_lock);
1325 do_gettimeofday(&work_start);
1326 timediff = cfs_timeval_sub(&work_start, &req->rq_sent_tv, NULL);
1329 * NB Until this point, the whole of the incoming message,
1330 * including buflens, status etc is in the sender's byte order.
1332 rc = sptlrpc_cli_unwrap_reply(req);
1334 DEBUG_REQ(D_ERROR, req, "unwrap reply failed (%d):", rc);
1339 * Security layer unwrap might ask resend this request.
1344 rc = unpack_reply(req);
1348 /* retry indefinitely on EINPROGRESS */
1349 if (lustre_msg_get_status(req->rq_repmsg) == -EINPROGRESS &&
1350 ptlrpc_no_resend(req) == 0 && !req->rq_no_retry_einprogress) {
1351 time_t now = cfs_time_current_sec();
1353 DEBUG_REQ(D_RPCTRACE, req, "Resending request on EINPROGRESS");
1354 spin_lock(&req->rq_lock);
1356 spin_unlock(&req->rq_lock);
1357 req->rq_nr_resend++;
1359 /* Readjust the timeout for current conditions */
1360 ptlrpc_at_set_req_timeout(req);
1361 /* delay resend to give a chance to the server to get ready.
1362 * The delay is increased by 1s on every resend and is capped to
1363 * the current request timeout (i.e. obd_timeout if AT is off,
1364 * or AT service time x 125% + 5s, see at_est2timeout) */
1365 if (req->rq_nr_resend > req->rq_timeout)
1366 req->rq_sent = now + req->rq_timeout;
1368 req->rq_sent = now + req->rq_nr_resend;
1370 /* Resend for EINPROGRESS will use a new XID */
1371 spin_lock(&imp->imp_lock);
1372 list_del_init(&req->rq_unreplied_list);
1373 spin_unlock(&imp->imp_lock);
1378 if (obd->obd_svc_stats != NULL) {
1379 lprocfs_counter_add(obd->obd_svc_stats, PTLRPC_REQWAIT_CNTR,
1381 ptlrpc_lprocfs_rpc_sent(req, timediff);
1384 if (lustre_msg_get_type(req->rq_repmsg) != PTL_RPC_MSG_REPLY &&
1385 lustre_msg_get_type(req->rq_repmsg) != PTL_RPC_MSG_ERR) {
1386 DEBUG_REQ(D_ERROR, req, "invalid packet received (type=%u)",
1387 lustre_msg_get_type(req->rq_repmsg));
1391 if (lustre_msg_get_opc(req->rq_reqmsg) != OBD_PING)
1392 CFS_FAIL_TIMEOUT(OBD_FAIL_PTLRPC_PAUSE_REP, cfs_fail_val);
1393 ptlrpc_at_adj_service(req, lustre_msg_get_timeout(req->rq_repmsg));
1394 ptlrpc_at_adj_net_latency(req,
1395 lustre_msg_get_service_time(req->rq_repmsg));
1397 rc = ptlrpc_check_status(req);
1398 imp->imp_connect_error = rc;
1402 * Either we've been evicted, or the server has failed for
1403 * some reason. Try to reconnect, and if that fails, punt to
1406 if (ptlrpc_recoverable_error(rc)) {
1407 if (req->rq_send_state != LUSTRE_IMP_FULL ||
1408 imp->imp_obd->obd_no_recov || imp->imp_dlm_fake) {
1411 ptlrpc_request_handle_notconn(req);
1416 * Let's look if server sent slv. Do it only for RPC with
1419 ldlm_cli_update_pool(req);
1423 * Store transno in reqmsg for replay.
1425 if (!(lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)) {
1426 req->rq_transno = lustre_msg_get_transno(req->rq_repmsg);
1427 lustre_msg_set_transno(req->rq_reqmsg, req->rq_transno);
1430 if (imp->imp_replayable) {
1431 spin_lock(&imp->imp_lock);
1433 * No point in adding already-committed requests to the replay
1434 * list, we will just remove them immediately. b=9829
1436 if (req->rq_transno != 0 &&
1438 lustre_msg_get_last_committed(req->rq_repmsg) ||
1440 /** version recovery */
1441 ptlrpc_save_versions(req);
1442 ptlrpc_retain_replayable_request(req, imp);
1443 } else if (req->rq_commit_cb != NULL &&
1444 list_empty(&req->rq_replay_list)) {
1445 /* NB: don't call rq_commit_cb if it's already on
1446 * rq_replay_list, ptlrpc_free_committed() will call
1447 * it later, see LU-3618 for details */
1448 spin_unlock(&imp->imp_lock);
1449 req->rq_commit_cb(req);
1450 spin_lock(&imp->imp_lock);
1454 * Replay-enabled imports return commit-status information.
1456 committed = lustre_msg_get_last_committed(req->rq_repmsg);
1457 if (likely(committed > imp->imp_peer_committed_transno))
1458 imp->imp_peer_committed_transno = committed;
1460 ptlrpc_free_committed(imp);
1462 if (!list_empty(&imp->imp_replay_list)) {
1463 struct ptlrpc_request *last;
1465 last = list_entry(imp->imp_replay_list.prev,
1466 struct ptlrpc_request,
1469 * Requests with rq_replay stay on the list even if no
1470 * commit is expected.
1472 if (last->rq_transno > imp->imp_peer_committed_transno)
1473 ptlrpc_pinger_commit_expected(imp);
1476 spin_unlock(&imp->imp_lock);
1483 * Helper function to send request \a req over the network for the first time
1484 * Also adjusts request phase.
1485 * Returns 0 on success or error code.
1487 static int ptlrpc_send_new_req(struct ptlrpc_request *req)
1489 struct obd_import *imp = req->rq_import;
1494 LASSERT(req->rq_phase == RQ_PHASE_NEW);
1496 /* do not try to go further if there is not enough memory in enc_pool */
1497 if (req->rq_sent && req->rq_bulk != NULL)
1498 if (req->rq_bulk->bd_iov_count > get_free_pages_in_pool() &&
1499 pool_is_at_full_capacity())
1502 if (req->rq_sent && (req->rq_sent > cfs_time_current_sec()) &&
1503 (!req->rq_generation_set ||
1504 req->rq_import_generation == imp->imp_generation))
1507 ptlrpc_rqphase_move(req, RQ_PHASE_RPC);
1509 spin_lock(&imp->imp_lock);
1511 LASSERT(req->rq_xid != 0);
1512 LASSERT(!list_empty(&req->rq_unreplied_list));
1514 if (!req->rq_generation_set)
1515 req->rq_import_generation = imp->imp_generation;
1517 if (ptlrpc_import_delay_req(imp, req, &rc)) {
1518 spin_lock(&req->rq_lock);
1519 req->rq_waiting = 1;
1520 spin_unlock(&req->rq_lock);
1522 DEBUG_REQ(D_HA, req, "req from PID %d waiting for recovery: "
1523 "(%s != %s)", lustre_msg_get_status(req->rq_reqmsg),
1524 ptlrpc_import_state_name(req->rq_send_state),
1525 ptlrpc_import_state_name(imp->imp_state));
1526 LASSERT(list_empty(&req->rq_list));
1527 list_add_tail(&req->rq_list, &imp->imp_delayed_list);
1528 atomic_inc(&req->rq_import->imp_inflight);
1529 spin_unlock(&imp->imp_lock);
1534 spin_unlock(&imp->imp_lock);
1535 req->rq_status = rc;
1536 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1540 LASSERT(list_empty(&req->rq_list));
1541 list_add_tail(&req->rq_list, &imp->imp_sending_list);
1542 atomic_inc(&req->rq_import->imp_inflight);
1544 /* find the known replied XID from the unreplied list, CONNECT
1545 * and DISCONNECT requests are skipped to make the sanity check
1546 * on server side happy. see process_req_last_xid().
1548 * For CONNECT: Because replay requests have lower XID, it'll
1549 * break the sanity check if CONNECT bump the exp_last_xid on
1552 * For DISCONNECT: Since client will abort inflight RPC before
1553 * sending DISCONNECT, DISCONNECT may carry an XID which higher
1554 * than the inflight RPC.
1556 if (!ptlrpc_req_is_connect(req) && !ptlrpc_req_is_disconnect(req))
1557 min_xid = ptlrpc_known_replied_xid(imp);
1558 spin_unlock(&imp->imp_lock);
1560 lustre_msg_set_last_xid(req->rq_reqmsg, min_xid);
1562 lustre_msg_set_status(req->rq_reqmsg, current_pid());
1564 rc = sptlrpc_req_refresh_ctx(req, -1);
1567 req->rq_status = rc;
1570 spin_lock(&req->rq_lock);
1571 req->rq_wait_ctx = 1;
1572 spin_unlock(&req->rq_lock);
1577 CDEBUG(D_RPCTRACE, "Sending RPC pname:cluuid:pid:xid:nid:opc"
1578 " %s:%s:%d:"LPU64":%s:%d\n", current_comm(),
1579 imp->imp_obd->obd_uuid.uuid,
1580 lustre_msg_get_status(req->rq_reqmsg), req->rq_xid,
1581 libcfs_nid2str(imp->imp_connection->c_peer.nid),
1582 lustre_msg_get_opc(req->rq_reqmsg));
1584 rc = ptl_send_rpc(req, 0);
1585 if (rc == -ENOMEM) {
1586 spin_lock(&imp->imp_lock);
1587 if (!list_empty(&req->rq_list)) {
1588 list_del_init(&req->rq_list);
1589 atomic_dec(&req->rq_import->imp_inflight);
1591 spin_unlock(&imp->imp_lock);
1592 ptlrpc_rqphase_move(req, RQ_PHASE_NEW);
1596 DEBUG_REQ(D_HA, req, "send failed (%d); expect timeout", rc);
1597 spin_lock(&req->rq_lock);
1598 req->rq_net_err = 1;
1599 spin_unlock(&req->rq_lock);
1605 static inline int ptlrpc_set_producer(struct ptlrpc_request_set *set)
1610 LASSERT(set->set_producer != NULL);
1612 remaining = atomic_read(&set->set_remaining);
1614 /* populate the ->set_requests list with requests until we
1615 * reach the maximum number of RPCs in flight for this set */
1616 while (atomic_read(&set->set_remaining) < set->set_max_inflight) {
1617 rc = set->set_producer(set, set->set_producer_arg);
1618 if (rc == -ENOENT) {
1619 /* no more RPC to produce */
1620 set->set_producer = NULL;
1621 set->set_producer_arg = NULL;
1626 RETURN((atomic_read(&set->set_remaining) - remaining));
1630 * this sends any unsent RPCs in \a set and returns 1 if all are sent
1631 * and no more replies are expected.
1632 * (it is possible to get less replies than requests sent e.g. due to timed out
1633 * requests or requests that we had trouble to send out)
1635 * NOTE: This function contains a potential schedule point (cond_resched()).
1637 int ptlrpc_check_set(const struct lu_env *env, struct ptlrpc_request_set *set)
1639 struct list_head *tmp, *next;
1640 struct list_head comp_reqs;
1641 int force_timer_recalc = 0;
1644 if (atomic_read(&set->set_remaining) == 0)
1647 INIT_LIST_HEAD(&comp_reqs);
1648 list_for_each_safe(tmp, next, &set->set_requests) {
1649 struct ptlrpc_request *req =
1650 list_entry(tmp, struct ptlrpc_request,
1652 struct obd_import *imp = req->rq_import;
1653 int unregistered = 0;
1656 /* This schedule point is mainly for the ptlrpcd caller of this
1657 * function. Most ptlrpc sets are not long-lived and unbounded
1658 * in length, but at the least the set used by the ptlrpcd is.
1659 * Since the processing time is unbounded, we need to insert an
1660 * explicit schedule point to make the thread well-behaved.
1664 if (req->rq_phase == RQ_PHASE_NEW &&
1665 ptlrpc_send_new_req(req)) {
1666 force_timer_recalc = 1;
1669 /* delayed send - skip */
1670 if (req->rq_phase == RQ_PHASE_NEW && req->rq_sent)
1673 /* delayed resend - skip */
1674 if (req->rq_phase == RQ_PHASE_RPC && req->rq_resend &&
1675 req->rq_sent > cfs_time_current_sec())
1678 if (!(req->rq_phase == RQ_PHASE_RPC ||
1679 req->rq_phase == RQ_PHASE_BULK ||
1680 req->rq_phase == RQ_PHASE_INTERPRET ||
1681 req->rq_phase == RQ_PHASE_UNREGISTERING ||
1682 req->rq_phase == RQ_PHASE_COMPLETE)) {
1683 DEBUG_REQ(D_ERROR, req, "bad phase %x", req->rq_phase);
1687 if (req->rq_phase == RQ_PHASE_UNREGISTERING) {
1688 LASSERT(req->rq_next_phase != req->rq_phase);
1689 LASSERT(req->rq_next_phase != RQ_PHASE_UNDEFINED);
1692 * Skip processing until reply is unlinked. We
1693 * can't return to pool before that and we can't
1694 * call interpret before that. We need to make
1695 * sure that all rdma transfers finished and will
1696 * not corrupt any data.
1698 if (ptlrpc_client_recv_or_unlink(req) ||
1699 ptlrpc_client_bulk_active(req))
1703 * Turn fail_loc off to prevent it from looping
1706 if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK)) {
1707 OBD_FAIL_CHECK_ORSET(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK,
1710 if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK)) {
1711 OBD_FAIL_CHECK_ORSET(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK,
1716 * Move to next phase if reply was successfully
1719 ptlrpc_rqphase_move(req, req->rq_next_phase);
1722 if (req->rq_phase == RQ_PHASE_COMPLETE) {
1723 list_move_tail(&req->rq_set_chain, &comp_reqs);
1727 if (req->rq_phase == RQ_PHASE_INTERPRET)
1728 GOTO(interpret, req->rq_status);
1731 * Note that this also will start async reply unlink.
1733 if (req->rq_net_err && !req->rq_timedout) {
1734 ptlrpc_expire_one_request(req, 1);
1737 * Check if we still need to wait for unlink.
1739 if (ptlrpc_client_recv_or_unlink(req) ||
1740 ptlrpc_client_bulk_active(req))
1742 /* If there is no need to resend, fail it now. */
1743 if (req->rq_no_resend) {
1744 if (req->rq_status == 0)
1745 req->rq_status = -EIO;
1746 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1747 GOTO(interpret, req->rq_status);
1754 spin_lock(&req->rq_lock);
1755 req->rq_replied = 0;
1756 spin_unlock(&req->rq_lock);
1757 if (req->rq_status == 0)
1758 req->rq_status = -EIO;
1759 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1760 GOTO(interpret, req->rq_status);
1763 /* ptlrpc_set_wait->l_wait_event sets lwi_allow_intr
1764 * so it sets rq_intr regardless of individual rpc
1765 * timeouts. The synchronous IO waiting path sets
1766 * rq_intr irrespective of whether ptlrpcd
1767 * has seen a timeout. Our policy is to only interpret
1768 * interrupted rpcs after they have timed out, so we
1769 * need to enforce that here.
1772 if (req->rq_intr && (req->rq_timedout || req->rq_waiting ||
1773 req->rq_wait_ctx)) {
1774 req->rq_status = -EINTR;
1775 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1776 GOTO(interpret, req->rq_status);
1779 if (req->rq_phase == RQ_PHASE_RPC) {
1780 if (req->rq_timedout || req->rq_resend ||
1781 req->rq_waiting || req->rq_wait_ctx) {
1784 if (!ptlrpc_unregister_reply(req, 1)) {
1785 ptlrpc_unregister_bulk(req, 1);
1789 spin_lock(&imp->imp_lock);
1790 if (ptlrpc_import_delay_req(imp, req, &status)){
1791 /* put on delay list - only if we wait
1792 * recovery finished - before send */
1793 list_del_init(&req->rq_list);
1794 list_add_tail(&req->rq_list,
1797 spin_unlock(&imp->imp_lock);
1802 req->rq_status = status;
1803 ptlrpc_rqphase_move(req,
1804 RQ_PHASE_INTERPRET);
1805 spin_unlock(&imp->imp_lock);
1806 GOTO(interpret, req->rq_status);
1808 if (ptlrpc_no_resend(req) &&
1809 !req->rq_wait_ctx) {
1810 req->rq_status = -ENOTCONN;
1811 ptlrpc_rqphase_move(req,
1812 RQ_PHASE_INTERPRET);
1813 spin_unlock(&imp->imp_lock);
1814 GOTO(interpret, req->rq_status);
1817 list_del_init(&req->rq_list);
1818 list_add_tail(&req->rq_list,
1819 &imp->imp_sending_list);
1821 spin_unlock(&imp->imp_lock);
1823 spin_lock(&req->rq_lock);
1824 req->rq_waiting = 0;
1825 spin_unlock(&req->rq_lock);
1827 if (req->rq_timedout || req->rq_resend) {
1828 /* This is re-sending anyways,
1829 * let's mark req as resend. */
1830 spin_lock(&req->rq_lock);
1832 spin_unlock(&req->rq_lock);
1834 if (req->rq_bulk != NULL &&
1835 !ptlrpc_unregister_bulk(req, 1))
1839 * rq_wait_ctx is only touched by ptlrpcd,
1840 * so no lock is needed here.
1842 status = sptlrpc_req_refresh_ctx(req, -1);
1845 req->rq_status = status;
1846 spin_lock(&req->rq_lock);
1847 req->rq_wait_ctx = 0;
1848 spin_unlock(&req->rq_lock);
1849 force_timer_recalc = 1;
1851 spin_lock(&req->rq_lock);
1852 req->rq_wait_ctx = 1;
1853 spin_unlock(&req->rq_lock);
1858 spin_lock(&req->rq_lock);
1859 req->rq_wait_ctx = 0;
1860 spin_unlock(&req->rq_lock);
1863 rc = ptl_send_rpc(req, 0);
1864 if (rc == -ENOMEM) {
1865 spin_lock(&imp->imp_lock);
1866 if (!list_empty(&req->rq_list))
1867 list_del_init(&req->rq_list);
1868 spin_unlock(&imp->imp_lock);
1869 ptlrpc_rqphase_move(req, RQ_PHASE_NEW);
1873 DEBUG_REQ(D_HA, req,
1874 "send failed: rc = %d", rc);
1875 force_timer_recalc = 1;
1876 spin_lock(&req->rq_lock);
1877 req->rq_net_err = 1;
1878 spin_unlock(&req->rq_lock);
1881 /* need to reset the timeout */
1882 force_timer_recalc = 1;
1885 spin_lock(&req->rq_lock);
1887 if (ptlrpc_client_early(req)) {
1888 ptlrpc_at_recv_early_reply(req);
1889 spin_unlock(&req->rq_lock);
1893 /* Still waiting for a reply? */
1894 if (ptlrpc_client_recv(req)) {
1895 spin_unlock(&req->rq_lock);
1899 /* Did we actually receive a reply? */
1900 if (!ptlrpc_client_replied(req)) {
1901 spin_unlock(&req->rq_lock);
1905 spin_unlock(&req->rq_lock);
1907 /* unlink from net because we are going to
1908 * swab in-place of reply buffer */
1909 unregistered = ptlrpc_unregister_reply(req, 1);
1913 req->rq_status = after_reply(req);
1917 /* If there is no bulk associated with this request,
1918 * then we're done and should let the interpreter
1919 * process the reply. Similarly if the RPC returned
1920 * an error, and therefore the bulk will never arrive.
1922 if (req->rq_bulk == NULL || req->rq_status < 0) {
1923 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1924 GOTO(interpret, req->rq_status);
1927 ptlrpc_rqphase_move(req, RQ_PHASE_BULK);
1930 LASSERT(req->rq_phase == RQ_PHASE_BULK);
1931 if (ptlrpc_client_bulk_active(req))
1934 if (req->rq_bulk->bd_failure) {
1935 /* The RPC reply arrived OK, but the bulk screwed
1936 * up! Dead weird since the server told us the RPC
1937 * was good after getting the REPLY for her GET or
1938 * the ACK for her PUT. */
1939 DEBUG_REQ(D_ERROR, req, "bulk transfer failed");
1940 req->rq_status = -EIO;
1943 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1946 LASSERT(req->rq_phase == RQ_PHASE_INTERPRET);
1948 /* This moves to "unregistering" phase we need to wait for
1950 if (!unregistered && !ptlrpc_unregister_reply(req, 1)) {
1951 /* start async bulk unlink too */
1952 ptlrpc_unregister_bulk(req, 1);
1956 if (!ptlrpc_unregister_bulk(req, 1))
1959 /* When calling interpret receiving already should be
1961 LASSERT(!req->rq_receiving_reply);
1963 ptlrpc_req_interpret(env, req, req->rq_status);
1965 if (ptlrpcd_check_work(req)) {
1966 atomic_dec(&set->set_remaining);
1969 ptlrpc_rqphase_move(req, RQ_PHASE_COMPLETE);
1971 CDEBUG(req->rq_reqmsg != NULL ? D_RPCTRACE : 0,
1972 "Completed RPC pname:cluuid:pid:xid:nid:"
1973 "opc %s:%s:%d:"LPU64":%s:%d\n",
1974 current_comm(), imp->imp_obd->obd_uuid.uuid,
1975 lustre_msg_get_status(req->rq_reqmsg), req->rq_xid,
1976 libcfs_nid2str(imp->imp_connection->c_peer.nid),
1977 lustre_msg_get_opc(req->rq_reqmsg));
1979 spin_lock(&imp->imp_lock);
1980 /* Request already may be not on sending or delaying list. This
1981 * may happen in the case of marking it erroneous for the case
1982 * ptlrpc_import_delay_req(req, status) find it impossible to
1983 * allow sending this rpc and returns *status != 0. */
1984 if (!list_empty(&req->rq_list)) {
1985 list_del_init(&req->rq_list);
1986 atomic_dec(&imp->imp_inflight);
1988 list_del_init(&req->rq_unreplied_list);
1989 spin_unlock(&imp->imp_lock);
1991 atomic_dec(&set->set_remaining);
1992 wake_up_all(&imp->imp_recovery_waitq);
1994 if (set->set_producer) {
1995 /* produce a new request if possible */
1996 if (ptlrpc_set_producer(set) > 0)
1997 force_timer_recalc = 1;
1999 /* free the request that has just been completed
2000 * in order not to pollute set->set_requests */
2001 list_del_init(&req->rq_set_chain);
2002 spin_lock(&req->rq_lock);
2004 req->rq_invalid_rqset = 0;
2005 spin_unlock(&req->rq_lock);
2007 /* record rq_status to compute the final status later */
2008 if (req->rq_status != 0)
2009 set->set_rc = req->rq_status;
2010 ptlrpc_req_finished(req);
2012 list_move_tail(&req->rq_set_chain, &comp_reqs);
2016 /* move completed request at the head of list so it's easier for
2017 * caller to find them */
2018 list_splice(&comp_reqs, &set->set_requests);
2020 /* If we hit an error, we want to recover promptly. */
2021 RETURN(atomic_read(&set->set_remaining) == 0 || force_timer_recalc);
2023 EXPORT_SYMBOL(ptlrpc_check_set);
2026 * Time out request \a req. is \a async_unlink is set, that means do not wait
2027 * until LNet actually confirms network buffer unlinking.
2028 * Return 1 if we should give up further retrying attempts or 0 otherwise.
2030 int ptlrpc_expire_one_request(struct ptlrpc_request *req, int async_unlink)
2032 struct obd_import *imp = req->rq_import;
2036 spin_lock(&req->rq_lock);
2037 req->rq_timedout = 1;
2038 spin_unlock(&req->rq_lock);
2040 DEBUG_REQ(D_WARNING, req, "Request sent has %s: [sent "CFS_DURATION_T
2041 "/real "CFS_DURATION_T"]",
2042 req->rq_net_err ? "failed due to network error" :
2043 ((req->rq_real_sent == 0 ||
2044 cfs_time_before(req->rq_real_sent, req->rq_sent) ||
2045 cfs_time_aftereq(req->rq_real_sent, req->rq_deadline)) ?
2046 "timed out for sent delay" : "timed out for slow reply"),
2047 req->rq_sent, req->rq_real_sent);
2049 if (imp != NULL && obd_debug_peer_on_timeout)
2050 LNetCtl(IOC_LIBCFS_DEBUG_PEER, &imp->imp_connection->c_peer);
2052 ptlrpc_unregister_reply(req, async_unlink);
2053 ptlrpc_unregister_bulk(req, async_unlink);
2055 if (obd_dump_on_timeout)
2056 libcfs_debug_dumplog();
2059 DEBUG_REQ(D_HA, req, "NULL import: already cleaned up?");
2063 atomic_inc(&imp->imp_timeouts);
2065 /* The DLM server doesn't want recovery run on its imports. */
2066 if (imp->imp_dlm_fake)
2069 /* If this request is for recovery or other primordial tasks,
2070 * then error it out here. */
2071 if (req->rq_ctx_init || req->rq_ctx_fini ||
2072 req->rq_send_state != LUSTRE_IMP_FULL ||
2073 imp->imp_obd->obd_no_recov) {
2074 DEBUG_REQ(D_RPCTRACE, req, "err -110, sent_state=%s (now=%s)",
2075 ptlrpc_import_state_name(req->rq_send_state),
2076 ptlrpc_import_state_name(imp->imp_state));
2077 spin_lock(&req->rq_lock);
2078 req->rq_status = -ETIMEDOUT;
2080 spin_unlock(&req->rq_lock);
2084 /* if a request can't be resent we can't wait for an answer after
2086 if (ptlrpc_no_resend(req)) {
2087 DEBUG_REQ(D_RPCTRACE, req, "TIMEOUT-NORESEND:");
2091 ptlrpc_fail_import(imp, lustre_msg_get_conn_cnt(req->rq_reqmsg));
2097 * Time out all uncompleted requests in request set pointed by \a data
2098 * Callback used when waiting on sets with l_wait_event.
2101 int ptlrpc_expired_set(void *data)
2103 struct ptlrpc_request_set *set = data;
2104 struct list_head *tmp;
2105 time_t now = cfs_time_current_sec();
2108 LASSERT(set != NULL);
2111 * A timeout expired. See which reqs it applies to...
2113 list_for_each(tmp, &set->set_requests) {
2114 struct ptlrpc_request *req =
2115 list_entry(tmp, struct ptlrpc_request,
2118 /* don't expire request waiting for context */
2119 if (req->rq_wait_ctx)
2122 /* Request in-flight? */
2123 if (!((req->rq_phase == RQ_PHASE_RPC &&
2124 !req->rq_waiting && !req->rq_resend) ||
2125 (req->rq_phase == RQ_PHASE_BULK)))
2128 if (req->rq_timedout || /* already dealt with */
2129 req->rq_deadline > now) /* not expired */
2132 /* Deal with this guy. Do it asynchronously to not block
2133 * ptlrpcd thread. */
2134 ptlrpc_expire_one_request(req, 1);
2138 * When waiting for a whole set, we always break out of the
2139 * sleep so we can recalculate the timeout, or enable interrupts
2140 * if everyone's timed out.
2146 * Sets rq_intr flag in \a req under spinlock.
2148 void ptlrpc_mark_interrupted(struct ptlrpc_request *req)
2150 spin_lock(&req->rq_lock);
2152 spin_unlock(&req->rq_lock);
2154 EXPORT_SYMBOL(ptlrpc_mark_interrupted);
2157 * Interrupts (sets interrupted flag) all uncompleted requests in
2158 * a set \a data. Callback for l_wait_event for interruptible waits.
2160 static void ptlrpc_interrupted_set(void *data)
2162 struct ptlrpc_request_set *set = data;
2163 struct list_head *tmp;
2165 LASSERT(set != NULL);
2166 CDEBUG(D_RPCTRACE, "INTERRUPTED SET %p\n", set);
2168 list_for_each(tmp, &set->set_requests) {
2169 struct ptlrpc_request *req =
2170 list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2172 if (req->rq_phase != RQ_PHASE_RPC &&
2173 req->rq_phase != RQ_PHASE_UNREGISTERING)
2176 ptlrpc_mark_interrupted(req);
2181 * Get the smallest timeout in the set; this does NOT set a timeout.
2183 int ptlrpc_set_next_timeout(struct ptlrpc_request_set *set)
2185 struct list_head *tmp;
2186 time_t now = cfs_time_current_sec();
2188 struct ptlrpc_request *req;
2192 list_for_each(tmp, &set->set_requests) {
2193 req = list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2196 * Request in-flight?
2198 if (!(((req->rq_phase == RQ_PHASE_RPC) && !req->rq_waiting) ||
2199 (req->rq_phase == RQ_PHASE_BULK) ||
2200 (req->rq_phase == RQ_PHASE_NEW)))
2204 * Already timed out.
2206 if (req->rq_timedout)
2212 if (req->rq_wait_ctx)
2215 if (req->rq_phase == RQ_PHASE_NEW)
2216 deadline = req->rq_sent;
2217 else if (req->rq_phase == RQ_PHASE_RPC && req->rq_resend)
2218 deadline = req->rq_sent;
2220 deadline = req->rq_sent + req->rq_timeout;
2222 if (deadline <= now) /* actually expired already */
2223 timeout = 1; /* ASAP */
2224 else if (timeout == 0 || timeout > deadline - now)
2225 timeout = deadline - now;
2231 * Send all unset request from the set and then wait untill all
2232 * requests in the set complete (either get a reply, timeout, get an
2233 * error or otherwise be interrupted).
2234 * Returns 0 on success or error code otherwise.
2236 int ptlrpc_set_wait(struct ptlrpc_request_set *set)
2238 struct list_head *tmp;
2239 struct ptlrpc_request *req;
2240 struct l_wait_info lwi;
2244 if (set->set_producer)
2245 (void)ptlrpc_set_producer(set);
2247 list_for_each(tmp, &set->set_requests) {
2248 req = list_entry(tmp, struct ptlrpc_request,
2250 if (req->rq_phase == RQ_PHASE_NEW)
2251 (void)ptlrpc_send_new_req(req);
2254 if (list_empty(&set->set_requests))
2258 timeout = ptlrpc_set_next_timeout(set);
2260 /* wait until all complete, interrupted, or an in-flight
2262 CDEBUG(D_RPCTRACE, "set %p going to sleep for %d seconds\n",
2265 if (timeout == 0 && !signal_pending(current))
2267 * No requests are in-flight (ether timed out
2268 * or delayed), so we can allow interrupts.
2269 * We still want to block for a limited time,
2270 * so we allow interrupts during the timeout.
2272 lwi = LWI_TIMEOUT_INTR_ALL(cfs_time_seconds(1),
2274 ptlrpc_interrupted_set, set);
2277 * At least one request is in flight, so no
2278 * interrupts are allowed. Wait until all
2279 * complete, or an in-flight req times out.
2281 lwi = LWI_TIMEOUT(cfs_time_seconds(timeout? timeout : 1),
2282 ptlrpc_expired_set, set);
2284 rc = l_wait_event(set->set_waitq, ptlrpc_check_set(NULL, set), &lwi);
2286 /* LU-769 - if we ignored the signal because it was already
2287 * pending when we started, we need to handle it now or we risk
2288 * it being ignored forever */
2289 if (rc == -ETIMEDOUT && !lwi.lwi_allow_intr &&
2290 signal_pending(current)) {
2291 sigset_t blocked_sigs =
2292 cfs_block_sigsinv(LUSTRE_FATAL_SIGS);
2294 /* In fact we only interrupt for the "fatal" signals
2295 * like SIGINT or SIGKILL. We still ignore less
2296 * important signals since ptlrpc set is not easily
2297 * reentrant from userspace again */
2298 if (signal_pending(current))
2299 ptlrpc_interrupted_set(set);
2300 cfs_restore_sigs(blocked_sigs);
2303 LASSERT(rc == 0 || rc == -EINTR || rc == -ETIMEDOUT);
2305 /* -EINTR => all requests have been flagged rq_intr so next
2307 * -ETIMEDOUT => someone timed out. When all reqs have
2308 * timed out, signals are enabled allowing completion with
2310 * I don't really care if we go once more round the loop in
2311 * the error cases -eeb. */
2312 if (rc == 0 && atomic_read(&set->set_remaining) == 0) {
2313 list_for_each(tmp, &set->set_requests) {
2314 req = list_entry(tmp, struct ptlrpc_request,
2316 spin_lock(&req->rq_lock);
2317 req->rq_invalid_rqset = 1;
2318 spin_unlock(&req->rq_lock);
2321 } while (rc != 0 || atomic_read(&set->set_remaining) != 0);
2323 LASSERT(atomic_read(&set->set_remaining) == 0);
2325 rc = set->set_rc; /* rq_status of already freed requests if any */
2326 list_for_each(tmp, &set->set_requests) {
2327 req = list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2329 LASSERT(req->rq_phase == RQ_PHASE_COMPLETE);
2330 if (req->rq_status != 0)
2331 rc = req->rq_status;
2334 if (set->set_interpret != NULL) {
2335 int (*interpreter)(struct ptlrpc_request_set *set,void *,int) =
2337 rc = interpreter (set, set->set_arg, rc);
2339 struct ptlrpc_set_cbdata *cbdata, *n;
2342 list_for_each_entry_safe(cbdata, n,
2343 &set->set_cblist, psc_item) {
2344 list_del_init(&cbdata->psc_item);
2345 err = cbdata->psc_interpret(set, cbdata->psc_data, rc);
2348 OBD_FREE_PTR(cbdata);
2354 EXPORT_SYMBOL(ptlrpc_set_wait);
2357 * Helper fuction for request freeing.
2358 * Called when request count reached zero and request needs to be freed.
2359 * Removes request from all sorts of sending/replay lists it might be on,
2360 * frees network buffers if any are present.
2361 * If \a locked is set, that means caller is already holding import imp_lock
2362 * and so we no longer need to reobtain it (for certain lists manipulations)
2364 static void __ptlrpc_free_req(struct ptlrpc_request *request, int locked)
2368 if (request == NULL)
2371 LASSERT(!request->rq_srv_req);
2372 LASSERT(request->rq_export == NULL);
2373 LASSERTF(!request->rq_receiving_reply, "req %p\n", request);
2374 LASSERTF(list_empty(&request->rq_list), "req %p\n", request);
2375 LASSERTF(list_empty(&request->rq_set_chain), "req %p\n", request);
2376 LASSERTF(!request->rq_replay, "req %p\n", request);
2378 req_capsule_fini(&request->rq_pill);
2380 /* We must take it off the imp_replay_list first. Otherwise, we'll set
2381 * request->rq_reqmsg to NULL while osc_close is dereferencing it. */
2382 if (request->rq_import != NULL) {
2384 spin_lock(&request->rq_import->imp_lock);
2385 list_del_init(&request->rq_replay_list);
2386 list_del_init(&request->rq_unreplied_list);
2388 spin_unlock(&request->rq_import->imp_lock);
2390 LASSERTF(list_empty(&request->rq_replay_list), "req %p\n", request);
2392 if (atomic_read(&request->rq_refcount) != 0) {
2393 DEBUG_REQ(D_ERROR, request,
2394 "freeing request with nonzero refcount");
2398 if (request->rq_repbuf != NULL)
2399 sptlrpc_cli_free_repbuf(request);
2401 if (request->rq_import != NULL) {
2402 class_import_put(request->rq_import);
2403 request->rq_import = NULL;
2405 if (request->rq_bulk != NULL)
2406 ptlrpc_free_bulk(request->rq_bulk);
2408 if (request->rq_reqbuf != NULL || request->rq_clrbuf != NULL)
2409 sptlrpc_cli_free_reqbuf(request);
2411 if (request->rq_cli_ctx)
2412 sptlrpc_req_put_ctx(request, !locked);
2414 if (request->rq_pool)
2415 __ptlrpc_free_req_to_pool(request);
2417 ptlrpc_request_cache_free(request);
2421 static int __ptlrpc_req_finished(struct ptlrpc_request *request, int locked);
2423 * Drop one request reference. Must be called with import imp_lock held.
2424 * When reference count drops to zero, request is freed.
2426 void ptlrpc_req_finished_with_imp_lock(struct ptlrpc_request *request)
2428 assert_spin_locked(&request->rq_import->imp_lock);
2429 (void)__ptlrpc_req_finished(request, 1);
2434 * Drops one reference count for request \a request.
2435 * \a locked set indicates that caller holds import imp_lock.
2436 * Frees the request whe reference count reaches zero.
2438 static int __ptlrpc_req_finished(struct ptlrpc_request *request, int locked)
2441 if (request == NULL)
2444 if (request == LP_POISON ||
2445 request->rq_reqmsg == LP_POISON) {
2446 CERROR("dereferencing freed request (bug 575)\n");
2451 DEBUG_REQ(D_INFO, request, "refcount now %u",
2452 atomic_read(&request->rq_refcount) - 1);
2454 if (atomic_dec_and_test(&request->rq_refcount)) {
2455 __ptlrpc_free_req(request, locked);
2463 * Drops one reference count for a request.
2465 void ptlrpc_req_finished(struct ptlrpc_request *request)
2467 __ptlrpc_req_finished(request, 0);
2469 EXPORT_SYMBOL(ptlrpc_req_finished);
2472 * Returns xid of a \a request
2474 __u64 ptlrpc_req_xid(struct ptlrpc_request *request)
2476 return request->rq_xid;
2478 EXPORT_SYMBOL(ptlrpc_req_xid);
2481 * Disengage the client's reply buffer from the network
2482 * NB does _NOT_ unregister any client-side bulk.
2483 * IDEMPOTENT, but _not_ safe against concurrent callers.
2484 * The request owner (i.e. the thread doing the I/O) must call...
2485 * Returns 0 on success or 1 if unregistering cannot be made.
2487 static int ptlrpc_unregister_reply(struct ptlrpc_request *request, int async)
2490 struct l_wait_info lwi;
2495 LASSERT(!in_interrupt());
2498 * Let's setup deadline for reply unlink.
2500 if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK) &&
2501 async && request->rq_reply_deadline == 0)
2502 request->rq_reply_deadline = cfs_time_current_sec()+LONG_UNLINK;
2505 * Nothing left to do.
2507 if (!ptlrpc_client_recv_or_unlink(request))
2510 LNetMDUnlink(request->rq_reply_md_h);
2513 * Let's check it once again.
2515 if (!ptlrpc_client_recv_or_unlink(request))
2519 * Move to "Unregistering" phase as reply was not unlinked yet.
2521 ptlrpc_rqphase_move(request, RQ_PHASE_UNREGISTERING);
2524 * Do not wait for unlink to finish.
2530 * We have to l_wait_event() whatever the result, to give liblustre
2531 * a chance to run reply_in_callback(), and to make sure we've
2532 * unlinked before returning a req to the pool.
2535 /* The wq argument is ignored by user-space wait_event macros */
2536 wait_queue_head_t *wq = (request->rq_set != NULL) ?
2537 &request->rq_set->set_waitq :
2538 &request->rq_reply_waitq;
2539 /* Network access will complete in finite time but the HUGE
2540 * timeout lets us CWARN for visibility of sluggish NALs */
2541 lwi = LWI_TIMEOUT_INTERVAL(cfs_time_seconds(LONG_UNLINK),
2542 cfs_time_seconds(1), NULL, NULL);
2543 rc = l_wait_event(*wq, !ptlrpc_client_recv_or_unlink(request),
2546 ptlrpc_rqphase_move(request, request->rq_next_phase);
2550 LASSERT(rc == -ETIMEDOUT);
2551 DEBUG_REQ(D_WARNING, request, "Unexpectedly long timeout "
2552 "receiving_reply=%d req_ulinked=%d reply_unlinked=%d",
2553 request->rq_receiving_reply,
2554 request->rq_req_unlinked,
2555 request->rq_reply_unlinked);
2560 static void ptlrpc_free_request(struct ptlrpc_request *req)
2562 spin_lock(&req->rq_lock);
2564 spin_unlock(&req->rq_lock);
2566 if (req->rq_commit_cb != NULL)
2567 req->rq_commit_cb(req);
2568 list_del_init(&req->rq_replay_list);
2570 __ptlrpc_req_finished(req, 1);
2574 * the request is committed and dropped from the replay list of its import
2576 void ptlrpc_request_committed(struct ptlrpc_request *req, int force)
2578 struct obd_import *imp = req->rq_import;
2580 spin_lock(&imp->imp_lock);
2581 if (list_empty(&req->rq_replay_list)) {
2582 spin_unlock(&imp->imp_lock);
2586 if (force || req->rq_transno <= imp->imp_peer_committed_transno)
2587 ptlrpc_free_request(req);
2589 spin_unlock(&imp->imp_lock);
2591 EXPORT_SYMBOL(ptlrpc_request_committed);
2594 * Iterates through replay_list on import and prunes
2595 * all requests have transno smaller than last_committed for the
2596 * import and don't have rq_replay set.
2597 * Since requests are sorted in transno order, stops when meetign first
2598 * transno bigger than last_committed.
2599 * caller must hold imp->imp_lock
2601 void ptlrpc_free_committed(struct obd_import *imp)
2603 struct ptlrpc_request *req, *saved;
2604 struct ptlrpc_request *last_req = NULL; /* temporary fire escape */
2605 bool skip_committed_list = true;
2608 LASSERT(imp != NULL);
2609 assert_spin_locked(&imp->imp_lock);
2611 if (imp->imp_peer_committed_transno == imp->imp_last_transno_checked &&
2612 imp->imp_generation == imp->imp_last_generation_checked) {
2613 CDEBUG(D_INFO, "%s: skip recheck: last_committed "LPU64"\n",
2614 imp->imp_obd->obd_name, imp->imp_peer_committed_transno);
2617 CDEBUG(D_RPCTRACE, "%s: committing for last_committed "LPU64" gen %d\n",
2618 imp->imp_obd->obd_name, imp->imp_peer_committed_transno,
2619 imp->imp_generation);
2621 if (imp->imp_generation != imp->imp_last_generation_checked ||
2622 imp->imp_last_transno_checked == 0)
2623 skip_committed_list = false;
2625 imp->imp_last_transno_checked = imp->imp_peer_committed_transno;
2626 imp->imp_last_generation_checked = imp->imp_generation;
2628 list_for_each_entry_safe(req, saved, &imp->imp_replay_list,
2630 /* XXX ok to remove when 1357 resolved - rread 05/29/03 */
2631 LASSERT(req != last_req);
2634 if (req->rq_transno == 0) {
2635 DEBUG_REQ(D_EMERG, req, "zero transno during replay");
2638 if (req->rq_import_generation < imp->imp_generation) {
2639 DEBUG_REQ(D_RPCTRACE, req, "free request with old gen");
2643 /* not yet committed */
2644 if (req->rq_transno > imp->imp_peer_committed_transno) {
2645 DEBUG_REQ(D_RPCTRACE, req, "stopping search");
2649 if (req->rq_replay) {
2650 DEBUG_REQ(D_RPCTRACE, req, "keeping (FL_REPLAY)");
2651 list_move_tail(&req->rq_replay_list,
2652 &imp->imp_committed_list);
2656 DEBUG_REQ(D_INFO, req, "commit (last_committed "LPU64")",
2657 imp->imp_peer_committed_transno);
2659 ptlrpc_free_request(req);
2662 if (skip_committed_list)
2665 list_for_each_entry_safe(req, saved, &imp->imp_committed_list,
2667 LASSERT(req->rq_transno != 0);
2668 if (req->rq_import_generation < imp->imp_generation) {
2669 DEBUG_REQ(D_RPCTRACE, req, "free stale open request");
2670 ptlrpc_free_request(req);
2671 } else if (!req->rq_replay) {
2672 DEBUG_REQ(D_RPCTRACE, req, "free closed open request");
2673 ptlrpc_free_request(req);
2680 void ptlrpc_cleanup_client(struct obd_import *imp)
2687 * Schedule previously sent request for resend.
2688 * For bulk requests we assign new xid (to avoid problems with
2689 * lost replies and therefore several transfers landing into same buffer
2690 * from different sending attempts).
2692 void ptlrpc_resend_req(struct ptlrpc_request *req)
2694 DEBUG_REQ(D_HA, req, "going to resend");
2695 spin_lock(&req->rq_lock);
2697 /* Request got reply but linked to the import list still.
2698 Let ptlrpc_check_set() to process it. */
2699 if (ptlrpc_client_replied(req)) {
2700 spin_unlock(&req->rq_lock);
2701 DEBUG_REQ(D_HA, req, "it has reply, so skip it");
2705 lustre_msg_set_handle(req->rq_reqmsg, &(struct lustre_handle){ 0 });
2706 req->rq_status = -EAGAIN;
2709 req->rq_net_err = 0;
2710 req->rq_timedout = 0;
2712 ptlrpc_client_wake_req(req);
2713 spin_unlock(&req->rq_lock);
2716 /* XXX: this function and rq_status are currently unused */
2717 void ptlrpc_restart_req(struct ptlrpc_request *req)
2719 DEBUG_REQ(D_HA, req, "restarting (possibly-)completed request");
2720 req->rq_status = -ERESTARTSYS;
2722 spin_lock(&req->rq_lock);
2723 req->rq_restart = 1;
2724 req->rq_timedout = 0;
2725 ptlrpc_client_wake_req(req);
2726 spin_unlock(&req->rq_lock);
2730 * Grab additional reference on a request \a req
2732 struct ptlrpc_request *ptlrpc_request_addref(struct ptlrpc_request *req)
2735 atomic_inc(&req->rq_refcount);
2738 EXPORT_SYMBOL(ptlrpc_request_addref);
2741 * Add a request to import replay_list.
2742 * Must be called under imp_lock
2744 void ptlrpc_retain_replayable_request(struct ptlrpc_request *req,
2745 struct obd_import *imp)
2747 struct list_head *tmp;
2749 assert_spin_locked(&imp->imp_lock);
2751 if (req->rq_transno == 0) {
2752 DEBUG_REQ(D_EMERG, req, "saving request with zero transno");
2756 /* clear this for new requests that were resent as well
2757 as resent replayed requests. */
2758 lustre_msg_clear_flags(req->rq_reqmsg, MSG_RESENT);
2760 /* don't re-add requests that have been replayed */
2761 if (!list_empty(&req->rq_replay_list))
2764 lustre_msg_add_flags(req->rq_reqmsg, MSG_REPLAY);
2766 spin_lock(&req->rq_lock);
2768 spin_unlock(&req->rq_lock);
2770 LASSERT(imp->imp_replayable);
2771 /* Balanced in ptlrpc_free_committed, usually. */
2772 ptlrpc_request_addref(req);
2773 list_for_each_prev(tmp, &imp->imp_replay_list) {
2774 struct ptlrpc_request *iter = list_entry(tmp,
2775 struct ptlrpc_request,
2778 /* We may have duplicate transnos if we create and then
2779 * open a file, or for closes retained if to match creating
2780 * opens, so use req->rq_xid as a secondary key.
2781 * (See bugs 684, 685, and 428.)
2782 * XXX no longer needed, but all opens need transnos!
2784 if (iter->rq_transno > req->rq_transno)
2787 if (iter->rq_transno == req->rq_transno) {
2788 LASSERT(iter->rq_xid != req->rq_xid);
2789 if (iter->rq_xid > req->rq_xid)
2793 list_add(&req->rq_replay_list, &iter->rq_replay_list);
2797 list_add(&req->rq_replay_list, &imp->imp_replay_list);
2801 * Send request and wait until it completes.
2802 * Returns request processing status.
2804 int ptlrpc_queue_wait(struct ptlrpc_request *req)
2806 struct ptlrpc_request_set *set;
2810 LASSERT(req->rq_set == NULL);
2811 LASSERT(!req->rq_receiving_reply);
2813 set = ptlrpc_prep_set();
2815 CERROR("cannot allocate ptlrpc set: rc = %d\n", -ENOMEM);
2819 /* for distributed debugging */
2820 lustre_msg_set_status(req->rq_reqmsg, current_pid());
2822 /* add a ref for the set (see comment in ptlrpc_set_add_req) */
2823 ptlrpc_request_addref(req);
2824 ptlrpc_set_add_req(set, req);
2825 rc = ptlrpc_set_wait(set);
2826 ptlrpc_set_destroy(set);
2830 EXPORT_SYMBOL(ptlrpc_queue_wait);
2833 * Callback used for replayed requests reply processing.
2834 * In case of successful reply calls registered request replay callback.
2835 * In case of error restart replay process.
2837 static int ptlrpc_replay_interpret(const struct lu_env *env,
2838 struct ptlrpc_request *req,
2839 void * data, int rc)
2841 struct ptlrpc_replay_async_args *aa = data;
2842 struct obd_import *imp = req->rq_import;
2845 atomic_dec(&imp->imp_replay_inflight);
2847 /* Note: if it is bulk replay (MDS-MDS replay), then even if
2848 * server got the request, but bulk transfer timeout, let's
2849 * replay the bulk req again */
2850 if (!ptlrpc_client_replied(req) ||
2851 (req->rq_bulk != NULL &&
2852 lustre_msg_get_status(req->rq_repmsg) == -ETIMEDOUT)) {
2853 DEBUG_REQ(D_ERROR, req, "request replay timed out.\n");
2854 GOTO(out, rc = -ETIMEDOUT);
2857 if (lustre_msg_get_type(req->rq_repmsg) == PTL_RPC_MSG_ERR &&
2858 (lustre_msg_get_status(req->rq_repmsg) == -ENOTCONN ||
2859 lustre_msg_get_status(req->rq_repmsg) == -ENODEV))
2860 GOTO(out, rc = lustre_msg_get_status(req->rq_repmsg));
2862 /** VBR: check version failure */
2863 if (lustre_msg_get_status(req->rq_repmsg) == -EOVERFLOW) {
2864 /** replay was failed due to version mismatch */
2865 DEBUG_REQ(D_WARNING, req, "Version mismatch during replay\n");
2866 spin_lock(&imp->imp_lock);
2867 imp->imp_vbr_failed = 1;
2868 imp->imp_no_lock_replay = 1;
2869 spin_unlock(&imp->imp_lock);
2870 lustre_msg_set_status(req->rq_repmsg, aa->praa_old_status);
2872 /** The transno had better not change over replay. */
2873 LASSERTF(lustre_msg_get_transno(req->rq_reqmsg) ==
2874 lustre_msg_get_transno(req->rq_repmsg) ||
2875 lustre_msg_get_transno(req->rq_repmsg) == 0,
2877 lustre_msg_get_transno(req->rq_reqmsg),
2878 lustre_msg_get_transno(req->rq_repmsg));
2881 spin_lock(&imp->imp_lock);
2882 /** if replays by version then gap occur on server, no trust to locks */
2883 if (lustre_msg_get_flags(req->rq_repmsg) & MSG_VERSION_REPLAY)
2884 imp->imp_no_lock_replay = 1;
2885 imp->imp_last_replay_transno = lustre_msg_get_transno(req->rq_reqmsg);
2886 spin_unlock(&imp->imp_lock);
2887 LASSERT(imp->imp_last_replay_transno);
2889 /* transaction number shouldn't be bigger than the latest replayed */
2890 if (req->rq_transno > lustre_msg_get_transno(req->rq_reqmsg)) {
2891 DEBUG_REQ(D_ERROR, req,
2892 "Reported transno "LPU64" is bigger than the "
2893 "replayed one: "LPU64, req->rq_transno,
2894 lustre_msg_get_transno(req->rq_reqmsg));
2895 GOTO(out, rc = -EINVAL);
2898 DEBUG_REQ(D_HA, req, "got rep");
2900 /* let the callback do fixups, possibly including in the request */
2901 if (req->rq_replay_cb)
2902 req->rq_replay_cb(req);
2904 if (ptlrpc_client_replied(req) &&
2905 lustre_msg_get_status(req->rq_repmsg) != aa->praa_old_status) {
2906 DEBUG_REQ(D_ERROR, req, "status %d, old was %d",
2907 lustre_msg_get_status(req->rq_repmsg),
2908 aa->praa_old_status);
2910 /* Put it back for re-replay. */
2911 lustre_msg_set_status(req->rq_repmsg, aa->praa_old_status);
2915 * Errors while replay can set transno to 0, but
2916 * imp_last_replay_transno shouldn't be set to 0 anyway
2918 if (req->rq_transno == 0)
2919 CERROR("Transno is 0 during replay!\n");
2921 /* continue with recovery */
2922 rc = ptlrpc_import_recovery_state_machine(imp);
2924 req->rq_send_state = aa->praa_old_state;
2927 /* this replay failed, so restart recovery */
2928 ptlrpc_connect_import(imp);
2934 * Prepares and queues request for replay.
2935 * Adds it to ptlrpcd queue for actual sending.
2936 * Returns 0 on success.
2938 int ptlrpc_replay_req(struct ptlrpc_request *req)
2940 struct ptlrpc_replay_async_args *aa;
2943 LASSERT(req->rq_import->imp_state == LUSTRE_IMP_REPLAY);
2945 LASSERT (sizeof (*aa) <= sizeof (req->rq_async_args));
2946 aa = ptlrpc_req_async_args(req);
2947 memset(aa, 0, sizeof *aa);
2949 /* Prepare request to be resent with ptlrpcd */
2950 aa->praa_old_state = req->rq_send_state;
2951 req->rq_send_state = LUSTRE_IMP_REPLAY;
2952 req->rq_phase = RQ_PHASE_NEW;
2953 req->rq_next_phase = RQ_PHASE_UNDEFINED;
2955 aa->praa_old_status = lustre_msg_get_status(req->rq_repmsg);
2957 req->rq_interpret_reply = ptlrpc_replay_interpret;
2958 /* Readjust the timeout for current conditions */
2959 ptlrpc_at_set_req_timeout(req);
2961 /* Tell server the net_latency, so the server can calculate how long
2962 * it should wait for next replay */
2963 lustre_msg_set_service_time(req->rq_reqmsg,
2964 ptlrpc_at_get_net_latency(req));
2965 DEBUG_REQ(D_HA, req, "REPLAY");
2967 atomic_inc(&req->rq_import->imp_replay_inflight);
2968 ptlrpc_request_addref(req); /* ptlrpcd needs a ref */
2970 ptlrpcd_add_req(req);
2975 * Aborts all in-flight request on import \a imp sending and delayed lists
2977 void ptlrpc_abort_inflight(struct obd_import *imp)
2979 struct list_head *tmp, *n;
2982 /* Make sure that no new requests get processed for this import.
2983 * ptlrpc_{queue,set}_wait must (and does) hold imp_lock while testing
2984 * this flag and then putting requests on sending_list or delayed_list.
2986 spin_lock(&imp->imp_lock);
2988 /* XXX locking? Maybe we should remove each request with the list
2989 * locked? Also, how do we know if the requests on the list are
2990 * being freed at this time?
2992 list_for_each_safe(tmp, n, &imp->imp_sending_list) {
2993 struct ptlrpc_request *req = list_entry(tmp,
2994 struct ptlrpc_request,
2997 DEBUG_REQ(D_RPCTRACE, req, "inflight");
2999 spin_lock(&req->rq_lock);
3000 if (req->rq_import_generation < imp->imp_generation) {
3002 req->rq_status = -EIO;
3003 ptlrpc_client_wake_req(req);
3005 spin_unlock(&req->rq_lock);
3008 list_for_each_safe(tmp, n, &imp->imp_delayed_list) {
3009 struct ptlrpc_request *req =
3010 list_entry(tmp, struct ptlrpc_request, rq_list);
3012 DEBUG_REQ(D_RPCTRACE, req, "aborting waiting req");
3014 spin_lock(&req->rq_lock);
3015 if (req->rq_import_generation < imp->imp_generation) {
3017 req->rq_status = -EIO;
3018 ptlrpc_client_wake_req(req);
3020 spin_unlock(&req->rq_lock);
3023 /* Last chance to free reqs left on the replay list, but we
3024 * will still leak reqs that haven't committed. */
3025 if (imp->imp_replayable)
3026 ptlrpc_free_committed(imp);
3028 spin_unlock(&imp->imp_lock);
3034 * Abort all uncompleted requests in request set \a set
3036 void ptlrpc_abort_set(struct ptlrpc_request_set *set)
3038 struct list_head *tmp, *pos;
3040 LASSERT(set != NULL);
3042 list_for_each_safe(pos, tmp, &set->set_requests) {
3043 struct ptlrpc_request *req =
3044 list_entry(pos, struct ptlrpc_request,
3047 spin_lock(&req->rq_lock);
3048 if (req->rq_phase != RQ_PHASE_RPC) {
3049 spin_unlock(&req->rq_lock);
3054 req->rq_status = -EINTR;
3055 ptlrpc_client_wake_req(req);
3056 spin_unlock(&req->rq_lock);
3060 static __u64 ptlrpc_last_xid;
3061 static spinlock_t ptlrpc_last_xid_lock;
3064 * Initialize the XID for the node. This is common among all requests on
3065 * this node, and only requires the property that it is monotonically
3066 * increasing. It does not need to be sequential. Since this is also used
3067 * as the RDMA match bits, it is important that a single client NOT have
3068 * the same match bits for two different in-flight requests, hence we do
3069 * NOT want to have an XID per target or similar.
3071 * To avoid an unlikely collision between match bits after a client reboot
3072 * (which would deliver old data into the wrong RDMA buffer) initialize
3073 * the XID based on the current time, assuming a maximum RPC rate of 1M RPC/s.
3074 * If the time is clearly incorrect, we instead use a 62-bit random number.
3075 * In the worst case the random number will overflow 1M RPCs per second in
3076 * 9133 years, or permutations thereof.
3078 #define YEAR_2004 (1ULL << 30)
3079 void ptlrpc_init_xid(void)
3081 time_t now = cfs_time_current_sec();
3083 spin_lock_init(&ptlrpc_last_xid_lock);
3084 if (now < YEAR_2004) {
3085 cfs_get_random_bytes(&ptlrpc_last_xid, sizeof(ptlrpc_last_xid));
3086 ptlrpc_last_xid >>= 2;
3087 ptlrpc_last_xid |= (1ULL << 61);
3089 ptlrpc_last_xid = (__u64)now << 20;
3092 /* Need to always be aligned to a power-of-two for mutli-bulk BRW */
3093 CLASSERT((PTLRPC_BULK_OPS_COUNT & (PTLRPC_BULK_OPS_COUNT - 1)) == 0);
3094 ptlrpc_last_xid &= PTLRPC_BULK_OPS_MASK;
3098 * Increase xid and returns resulting new value to the caller.
3100 * Multi-bulk BRW RPCs consume multiple XIDs for each bulk transfer, starting
3101 * at the returned xid, up to xid + PTLRPC_BULK_OPS_COUNT - 1. The BRW RPC
3102 * itself uses the last bulk xid needed, so the server can determine the
3103 * the number of bulk transfers from the RPC XID and a bitmask. The starting
3104 * xid must align to a power-of-two value.
3106 * This is assumed to be true due to the initial ptlrpc_last_xid
3107 * value also being initialized to a power-of-two value. LU-1431
3109 __u64 ptlrpc_next_xid(void)
3113 spin_lock(&ptlrpc_last_xid_lock);
3114 next = ptlrpc_last_xid + PTLRPC_BULK_OPS_COUNT;
3115 ptlrpc_last_xid = next;
3116 spin_unlock(&ptlrpc_last_xid_lock);
3122 * If request has a new allocated XID (new request or EINPROGRESS resend),
3123 * use this XID as matchbits of bulk, otherwise allocate a new matchbits for
3124 * request to ensure previous bulk fails and avoid problems with lost replies
3125 * and therefore several transfers landing into the same buffer from different
3128 void ptlrpc_set_bulk_mbits(struct ptlrpc_request *req)
3130 struct ptlrpc_bulk_desc *bd = req->rq_bulk;
3132 LASSERT(bd != NULL);
3134 if (!req->rq_resend) {
3135 /* this request has a new xid, just use it as bulk matchbits */
3136 req->rq_mbits = req->rq_xid;
3138 } else { /* needs to generate a new matchbits for resend */
3139 __u64 old_mbits = req->rq_mbits;
3141 if ((bd->bd_import->imp_connect_data.ocd_connect_flags &
3142 OBD_CONNECT_BULK_MBITS) != 0)
3143 req->rq_mbits = ptlrpc_next_xid();
3144 else /* old version transfers rq_xid to peer as matchbits */
3145 req->rq_mbits = req->rq_xid = ptlrpc_next_xid();
3147 CDEBUG(D_HA, "resend bulk old x"LPU64" new x"LPU64"\n",
3148 old_mbits, req->rq_mbits);
3151 /* For multi-bulk RPCs, rq_mbits is the last mbits needed for bulks so
3152 * that server can infer the number of bulks that were prepared,
3154 req->rq_mbits += ((bd->bd_iov_count + LNET_MAX_IOV - 1) /
3159 * Get a glimpse at what next xid value might have been.
3160 * Returns possible next xid.
3162 __u64 ptlrpc_sample_next_xid(void)
3164 #if BITS_PER_LONG == 32
3165 /* need to avoid possible word tearing on 32-bit systems */
3168 spin_lock(&ptlrpc_last_xid_lock);
3169 next = ptlrpc_last_xid + PTLRPC_BULK_OPS_COUNT;
3170 spin_unlock(&ptlrpc_last_xid_lock);
3174 /* No need to lock, since returned value is racy anyways */
3175 return ptlrpc_last_xid + PTLRPC_BULK_OPS_COUNT;
3178 EXPORT_SYMBOL(ptlrpc_sample_next_xid);
3181 * Functions for operating ptlrpc workers.
3183 * A ptlrpc work is a function which will be running inside ptlrpc context.
3184 * The callback shouldn't sleep otherwise it will block that ptlrpcd thread.
3186 * 1. after a work is created, it can be used many times, that is:
3187 * handler = ptlrpcd_alloc_work();
3188 * ptlrpcd_queue_work();
3190 * queue it again when necessary:
3191 * ptlrpcd_queue_work();
3192 * ptlrpcd_destroy_work();
3193 * 2. ptlrpcd_queue_work() can be called by multiple processes meanwhile, but
3194 * it will only be queued once in any time. Also as its name implies, it may
3195 * have delay before it really runs by ptlrpcd thread.
3197 struct ptlrpc_work_async_args {
3198 int (*cb)(const struct lu_env *, void *);
3202 static void ptlrpcd_add_work_req(struct ptlrpc_request *req)
3204 /* re-initialize the req */
3205 req->rq_timeout = obd_timeout;
3206 req->rq_sent = cfs_time_current_sec();
3207 req->rq_deadline = req->rq_sent + req->rq_timeout;
3208 req->rq_reply_deadline = req->rq_deadline;
3209 req->rq_phase = RQ_PHASE_INTERPRET;
3210 req->rq_next_phase = RQ_PHASE_COMPLETE;
3211 req->rq_xid = ptlrpc_next_xid();
3212 req->rq_import_generation = req->rq_import->imp_generation;
3214 ptlrpcd_add_req(req);
3217 static int work_interpreter(const struct lu_env *env,
3218 struct ptlrpc_request *req, void *data, int rc)
3220 struct ptlrpc_work_async_args *arg = data;
3222 LASSERT(ptlrpcd_check_work(req));
3223 LASSERT(arg->cb != NULL);
3225 rc = arg->cb(env, arg->cbdata);
3227 list_del_init(&req->rq_set_chain);
3230 if (atomic_dec_return(&req->rq_refcount) > 1) {
3231 atomic_set(&req->rq_refcount, 2);
3232 ptlrpcd_add_work_req(req);
3237 static int worker_format;
3239 static int ptlrpcd_check_work(struct ptlrpc_request *req)
3241 return req->rq_pill.rc_fmt == (void *)&worker_format;
3245 * Create a work for ptlrpc.
3247 void *ptlrpcd_alloc_work(struct obd_import *imp,
3248 int (*cb)(const struct lu_env *, void *), void *cbdata)
3250 struct ptlrpc_request *req = NULL;
3251 struct ptlrpc_work_async_args *args;
3257 RETURN(ERR_PTR(-EINVAL));
3259 /* copy some code from deprecated fakereq. */
3260 req = ptlrpc_request_cache_alloc(GFP_NOFS);
3262 CERROR("ptlrpc: run out of memory!\n");
3263 RETURN(ERR_PTR(-ENOMEM));
3266 ptlrpc_cli_req_init(req);
3268 req->rq_send_state = LUSTRE_IMP_FULL;
3269 req->rq_type = PTL_RPC_MSG_REQUEST;
3270 req->rq_import = class_import_get(imp);
3271 req->rq_interpret_reply = work_interpreter;
3272 /* don't want reply */
3273 req->rq_no_delay = req->rq_no_resend = 1;
3274 req->rq_pill.rc_fmt = (void *)&worker_format;
3276 CLASSERT (sizeof(*args) <= sizeof(req->rq_async_args));
3277 args = ptlrpc_req_async_args(req);
3279 args->cbdata = cbdata;
3283 EXPORT_SYMBOL(ptlrpcd_alloc_work);
3285 void ptlrpcd_destroy_work(void *handler)
3287 struct ptlrpc_request *req = handler;
3290 ptlrpc_req_finished(req);
3292 EXPORT_SYMBOL(ptlrpcd_destroy_work);
3294 int ptlrpcd_queue_work(void *handler)
3296 struct ptlrpc_request *req = handler;
3299 * Check if the req is already being queued.
3301 * Here comes a trick: it lacks a way of checking if a req is being
3302 * processed reliably in ptlrpc. Here I have to use refcount of req
3303 * for this purpose. This is okay because the caller should use this
3304 * req as opaque data. - Jinshan
3306 LASSERT(atomic_read(&req->rq_refcount) > 0);
3307 if (atomic_inc_return(&req->rq_refcount) == 2)
3308 ptlrpcd_add_work_req(req);
3311 EXPORT_SYMBOL(ptlrpcd_queue_work);