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.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2011, 2017, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
33 /** Implementation of client-side PortalRPC interfaces */
35 #define DEBUG_SUBSYSTEM S_RPC
37 #include <linux/delay.h>
38 #include <linux/random.h>
40 #include <lnet/lib-lnet.h>
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 static void ptlrpc_prep_bulk_page_pin(struct ptlrpc_bulk_desc *desc,
51 struct page *page, int pageoffset,
54 __ptlrpc_prep_bulk_page(desc, page, pageoffset, len, 1);
57 static void ptlrpc_prep_bulk_page_nopin(struct ptlrpc_bulk_desc *desc,
58 struct page *page, int pageoffset,
61 __ptlrpc_prep_bulk_page(desc, page, pageoffset, len, 0);
64 static void ptlrpc_release_bulk_page_pin(struct ptlrpc_bulk_desc *desc)
68 for (i = 0; i < desc->bd_iov_count ; i++)
69 put_page(desc->bd_vec[i].bv_page);
72 static int ptlrpc_prep_bulk_frag_pages(struct ptlrpc_bulk_desc *desc,
75 unsigned int offset = (unsigned long)frag & ~PAGE_MASK;
79 int page_len = min_t(unsigned int, PAGE_SIZE - offset,
81 unsigned long vaddr = (unsigned long)frag;
83 ptlrpc_prep_bulk_page_nopin(desc,
84 lnet_kvaddr_to_page(vaddr),
94 const struct ptlrpc_bulk_frag_ops ptlrpc_bulk_kiov_pin_ops = {
95 .add_kiov_frag = ptlrpc_prep_bulk_page_pin,
96 .release_frags = ptlrpc_release_bulk_page_pin,
98 EXPORT_SYMBOL(ptlrpc_bulk_kiov_pin_ops);
100 const struct ptlrpc_bulk_frag_ops ptlrpc_bulk_kiov_nopin_ops = {
101 .add_kiov_frag = ptlrpc_prep_bulk_page_nopin,
102 .release_frags = ptlrpc_release_bulk_noop,
103 .add_iov_frag = ptlrpc_prep_bulk_frag_pages,
105 EXPORT_SYMBOL(ptlrpc_bulk_kiov_nopin_ops);
107 static int ptlrpc_send_new_req(struct ptlrpc_request *req);
108 static int ptlrpcd_check_work(struct ptlrpc_request *req);
109 static int ptlrpc_unregister_reply(struct ptlrpc_request *request, int async);
112 * Initialize passed in client structure \a cl.
114 void ptlrpc_init_client(int req_portal, int rep_portal, const char *name,
115 struct ptlrpc_client *cl)
117 cl->cli_request_portal = req_portal;
118 cl->cli_reply_portal = rep_portal;
121 EXPORT_SYMBOL(ptlrpc_init_client);
124 * Return PortalRPC connection for remore uud \a uuid
126 struct ptlrpc_connection *ptlrpc_uuid_to_connection(struct obd_uuid *uuid,
127 lnet_nid_t nid4refnet)
129 struct ptlrpc_connection *c;
131 struct lnet_process_id peer;
135 * ptlrpc_uuid_to_peer() initializes its 2nd parameter
136 * before accessing its values.
138 /* coverity[uninit_use_in_call] */
139 peer.nid = nid4refnet;
140 err = ptlrpc_uuid_to_peer(uuid, &peer, &self);
142 CNETERR("cannot find peer %s!\n", uuid->uuid);
146 c = ptlrpc_connection_get(peer, self, uuid);
148 memcpy(c->c_remote_uuid.uuid,
149 uuid->uuid, sizeof(c->c_remote_uuid.uuid));
152 CDEBUG(D_INFO, "%s -> %p\n", uuid->uuid, c);
158 * Allocate and initialize new bulk descriptor on the sender.
159 * Returns pointer to the descriptor or NULL on error.
161 struct ptlrpc_bulk_desc *ptlrpc_new_bulk(unsigned int nfrags,
162 unsigned int max_brw,
163 enum ptlrpc_bulk_op_type type,
165 const struct ptlrpc_bulk_frag_ops *ops)
167 struct ptlrpc_bulk_desc *desc;
170 LASSERT(ops->add_kiov_frag != NULL);
176 OBD_ALLOC_LARGE(desc->bd_vec,
177 nfrags * sizeof(*desc->bd_vec));
181 spin_lock_init(&desc->bd_lock);
182 init_waitqueue_head(&desc->bd_waitq);
183 desc->bd_max_iov = nfrags;
184 desc->bd_iov_count = 0;
185 desc->bd_portal = portal;
186 desc->bd_type = type;
187 desc->bd_md_count = 0;
188 desc->bd_frag_ops = ops;
189 LASSERT(max_brw > 0);
190 desc->bd_md_max_brw = min(max_brw, PTLRPC_BULK_OPS_COUNT);
192 * PTLRPC_BULK_OPS_COUNT is the compile-time transfer limit for this
193 * node. Negotiated ocd_brw_size will always be <= this number.
195 for (i = 0; i < PTLRPC_BULK_OPS_COUNT; i++)
196 LNetInvalidateMDHandle(&desc->bd_mds[i]);
205 * Prepare bulk descriptor for specified outgoing request \a req that
206 * can fit \a nfrags * pages. \a type is bulk type. \a portal is where
207 * the bulk to be sent. Used on client-side.
208 * Returns pointer to newly allocatrd initialized bulk descriptor or NULL on
211 struct ptlrpc_bulk_desc *ptlrpc_prep_bulk_imp(struct ptlrpc_request *req,
213 unsigned int max_brw,
216 const struct ptlrpc_bulk_frag_ops
219 struct obd_import *imp = req->rq_import;
220 struct ptlrpc_bulk_desc *desc;
223 LASSERT(ptlrpc_is_bulk_op_passive(type));
225 desc = ptlrpc_new_bulk(nfrags, max_brw, type, portal, ops);
229 desc->bd_import = class_import_get(imp);
232 desc->bd_cbid.cbid_fn = client_bulk_callback;
233 desc->bd_cbid.cbid_arg = desc;
235 /* This makes req own desc, and free it when she frees herself */
240 EXPORT_SYMBOL(ptlrpc_prep_bulk_imp);
242 void __ptlrpc_prep_bulk_page(struct ptlrpc_bulk_desc *desc,
243 struct page *page, int pageoffset, int len,
246 struct bio_vec *kiov;
248 LASSERT(desc->bd_iov_count < desc->bd_max_iov);
249 LASSERT(page != NULL);
250 LASSERT(pageoffset >= 0);
252 LASSERT(pageoffset + len <= PAGE_SIZE);
254 kiov = &desc->bd_vec[desc->bd_iov_count];
261 kiov->bv_page = page;
262 kiov->bv_offset = pageoffset;
265 desc->bd_iov_count++;
267 EXPORT_SYMBOL(__ptlrpc_prep_bulk_page);
269 void ptlrpc_free_bulk(struct ptlrpc_bulk_desc *desc)
273 LASSERT(desc != NULL);
274 LASSERT(desc->bd_iov_count != LI_POISON); /* not freed already */
275 LASSERT(desc->bd_md_count == 0); /* network hands off */
276 LASSERT((desc->bd_export != NULL) ^ (desc->bd_import != NULL));
277 LASSERT(desc->bd_frag_ops != NULL);
279 sptlrpc_enc_pool_put_pages(desc);
282 class_export_put(desc->bd_export);
284 class_import_put(desc->bd_import);
286 if (desc->bd_frag_ops->release_frags != NULL)
287 desc->bd_frag_ops->release_frags(desc);
289 OBD_FREE_LARGE(desc->bd_vec,
290 desc->bd_max_iov * sizeof(*desc->bd_vec));
294 EXPORT_SYMBOL(ptlrpc_free_bulk);
297 * Set server timelimit for this req, i.e. how long are we willing to wait
298 * for reply before timing out this request.
300 void ptlrpc_at_set_req_timeout(struct ptlrpc_request *req)
302 LASSERT(req->rq_import);
305 /* non-AT settings */
307 * \a imp_server_timeout means this is reverse import and
308 * we send (currently only) ASTs to the client and cannot afford
309 * to wait too long for the reply, otherwise the other client
310 * (because of which we are sending this request) would
311 * timeout waiting for us
313 req->rq_timeout = req->rq_import->imp_server_timeout ?
314 obd_timeout / 2 : obd_timeout;
316 struct imp_at *at = &req->rq_import->imp_at;
320 idx = import_at_get_index(req->rq_import,
321 req->rq_request_portal);
322 serv_est = at_get(&at->iat_service_estimate[idx]);
324 * Currently a 32 bit value is sent over the
325 * wire for rq_timeout so please don't change this
326 * to time64_t. The work for LU-1158 will in time
327 * replace rq_timeout with a 64 bit nanosecond value
329 req->rq_timeout = at_est2timeout(serv_est);
332 * We could get even fancier here, using history to predict increased
335 * Let the server know what this RPC timeout is by putting it in the
338 lustre_msg_set_timeout(req->rq_reqmsg, req->rq_timeout);
340 EXPORT_SYMBOL(ptlrpc_at_set_req_timeout);
342 /* Adjust max service estimate based on server value */
343 static void ptlrpc_at_adj_service(struct ptlrpc_request *req,
350 LASSERT(req->rq_import);
351 at = &req->rq_import->imp_at;
353 idx = import_at_get_index(req->rq_import, req->rq_request_portal);
355 * max service estimates are tracked on the server side,
356 * so just keep minimal history here
358 oldse = at_measured(&at->iat_service_estimate[idx], serv_est);
361 "The RPC service estimate for %s ptl %d has changed from %d to %d\n",
362 req->rq_import->imp_obd->obd_name,
363 req->rq_request_portal,
364 oldse, at_get(&at->iat_service_estimate[idx]));
367 /* Expected network latency per remote node (secs) */
368 int ptlrpc_at_get_net_latency(struct ptlrpc_request *req)
370 return AT_OFF ? 0 : at_get(&req->rq_import->imp_at.iat_net_latency);
373 /* Adjust expected network latency */
374 void ptlrpc_at_adj_net_latency(struct ptlrpc_request *req,
375 timeout_t service_timeout)
377 time64_t now = ktime_get_real_seconds();
382 LASSERT(req->rq_import);
384 if (service_timeout > now - req->rq_sent + 3) {
386 * b=16408, however, this can also happen if early reply
387 * is lost and client RPC is expired and resent, early reply
388 * or reply of original RPC can still be fit in reply buffer
389 * of resent RPC, now client is measuring time from the
390 * resent time, but server sent back service time of original
393 CDEBUG((lustre_msg_get_flags(req->rq_reqmsg) & MSG_RESENT) ?
394 D_ADAPTTO : D_WARNING,
395 "Reported service time %u > total measured time %lld\n",
396 service_timeout, now - req->rq_sent);
400 /* Network latency is total time less server processing time,
403 nl = max_t(timeout_t, now - req->rq_sent - service_timeout, 0) + 1;
404 at = &req->rq_import->imp_at;
406 oldnl = at_measured(&at->iat_net_latency, nl);
409 "The network latency for %s (nid %s) has changed from %d to %d\n",
410 req->rq_import->imp_obd->obd_name,
411 obd_uuid2str(&req->rq_import->imp_connection->c_remote_uuid),
412 oldnl, at_get(&at->iat_net_latency));
415 static int unpack_reply(struct ptlrpc_request *req)
419 if (SPTLRPC_FLVR_POLICY(req->rq_flvr.sf_rpc) != SPTLRPC_POLICY_NULL) {
420 rc = ptlrpc_unpack_rep_msg(req, req->rq_replen);
422 DEBUG_REQ(D_ERROR, req, "unpack_rep failed: rc = %d",
428 rc = lustre_unpack_rep_ptlrpc_body(req, MSG_PTLRPC_BODY_OFF);
430 DEBUG_REQ(D_ERROR, req, "unpack ptlrpc body failed: rc = %d",
438 * Handle an early reply message, called with the rq_lock held.
439 * If anything goes wrong just ignore it - same as if it never happened
441 static int ptlrpc_at_recv_early_reply(struct ptlrpc_request *req)
442 __must_hold(&req->rq_lock)
444 struct ptlrpc_request *early_req;
445 timeout_t service_timeout;
451 spin_unlock(&req->rq_lock);
453 rc = sptlrpc_cli_unwrap_early_reply(req, &early_req);
455 spin_lock(&req->rq_lock);
459 rc = unpack_reply(early_req);
461 sptlrpc_cli_finish_early_reply(early_req);
462 spin_lock(&req->rq_lock);
467 * Use new timeout value just to adjust the local value for this
468 * request, don't include it into at_history. It is unclear yet why
469 * service time increased and should it be counted or skipped, e.g.
470 * that can be recovery case or some error or server, the real reply
471 * will add all new data if it is worth to add.
473 req->rq_timeout = lustre_msg_get_timeout(early_req->rq_repmsg);
474 lustre_msg_set_timeout(req->rq_reqmsg, req->rq_timeout);
476 /* Network latency can be adjusted, it is pure network delays */
477 service_timeout = lustre_msg_get_service_timeout(early_req->rq_repmsg);
478 ptlrpc_at_adj_net_latency(req, service_timeout);
480 sptlrpc_cli_finish_early_reply(early_req);
482 spin_lock(&req->rq_lock);
483 olddl = req->rq_deadline;
485 * server assumes it now has rq_timeout from when the request
486 * arrived, so the client should give it at least that long.
487 * since we don't know the arrival time we'll use the original
490 req->rq_deadline = req->rq_sent + req->rq_timeout +
491 ptlrpc_at_get_net_latency(req);
493 /* The below message is checked in replay-single.sh test_65{a,b} */
494 /* The below message is checked in sanity-{gss,krb5} test_8 */
495 DEBUG_REQ(D_ADAPTTO, req,
496 "Early reply #%d, new deadline in %llds (%llds)",
498 req->rq_deadline - ktime_get_real_seconds(),
499 req->rq_deadline - olddl);
504 static struct kmem_cache *request_cache;
506 int ptlrpc_request_cache_init(void)
508 request_cache = kmem_cache_create("ptlrpc_cache",
509 sizeof(struct ptlrpc_request),
510 0, SLAB_HWCACHE_ALIGN, NULL);
511 return request_cache ? 0 : -ENOMEM;
514 void ptlrpc_request_cache_fini(void)
516 kmem_cache_destroy(request_cache);
519 struct ptlrpc_request *ptlrpc_request_cache_alloc(gfp_t flags)
521 struct ptlrpc_request *req;
523 OBD_SLAB_ALLOC_PTR_GFP(req, request_cache, flags);
527 void ptlrpc_request_cache_free(struct ptlrpc_request *req)
529 OBD_SLAB_FREE_PTR(req, request_cache);
533 * Wind down request pool \a pool.
534 * Frees all requests from the pool too
536 void ptlrpc_free_rq_pool(struct ptlrpc_request_pool *pool)
538 struct list_head *l, *tmp;
539 struct ptlrpc_request *req;
541 LASSERT(pool != NULL);
543 spin_lock(&pool->prp_lock);
544 list_for_each_safe(l, tmp, &pool->prp_req_list) {
545 req = list_entry(l, struct ptlrpc_request, rq_list);
546 list_del(&req->rq_list);
547 LASSERT(req->rq_reqbuf);
548 LASSERT(req->rq_reqbuf_len == pool->prp_rq_size);
549 OBD_FREE_LARGE(req->rq_reqbuf, pool->prp_rq_size);
550 ptlrpc_request_cache_free(req);
552 spin_unlock(&pool->prp_lock);
553 OBD_FREE(pool, sizeof(*pool));
555 EXPORT_SYMBOL(ptlrpc_free_rq_pool);
558 * Allocates, initializes and adds \a num_rq requests to the pool \a pool
560 int ptlrpc_add_rqs_to_pool(struct ptlrpc_request_pool *pool, int num_rq)
565 while (size < pool->prp_rq_size)
568 LASSERTF(list_empty(&pool->prp_req_list) ||
569 size == pool->prp_rq_size,
570 "Trying to change pool size with nonempty pool from %d to %d bytes\n",
571 pool->prp_rq_size, size);
573 pool->prp_rq_size = size;
574 for (i = 0; i < num_rq; i++) {
575 struct ptlrpc_request *req;
576 struct lustre_msg *msg;
578 req = ptlrpc_request_cache_alloc(GFP_NOFS);
581 OBD_ALLOC_LARGE(msg, size);
583 ptlrpc_request_cache_free(req);
586 req->rq_reqbuf = msg;
587 req->rq_reqbuf_len = size;
589 spin_lock(&pool->prp_lock);
590 list_add_tail(&req->rq_list, &pool->prp_req_list);
591 spin_unlock(&pool->prp_lock);
595 EXPORT_SYMBOL(ptlrpc_add_rqs_to_pool);
598 * Create and initialize new request pool with given attributes:
599 * \a num_rq - initial number of requests to create for the pool
600 * \a msgsize - maximum message size possible for requests in thid pool
601 * \a populate_pool - function to be called when more requests need to be added
603 * Returns pointer to newly created pool or NULL on error.
605 struct ptlrpc_request_pool *
606 ptlrpc_init_rq_pool(int num_rq, int msgsize,
607 int (*populate_pool)(struct ptlrpc_request_pool *, int))
609 struct ptlrpc_request_pool *pool;
616 * Request next power of two for the allocation, because internally
617 * kernel would do exactly this
619 spin_lock_init(&pool->prp_lock);
620 INIT_LIST_HEAD(&pool->prp_req_list);
621 pool->prp_rq_size = msgsize + SPTLRPC_MAX_PAYLOAD;
622 pool->prp_populate = populate_pool;
624 populate_pool(pool, num_rq);
628 EXPORT_SYMBOL(ptlrpc_init_rq_pool);
631 * Fetches one request from pool \a pool
633 static struct ptlrpc_request *
634 ptlrpc_prep_req_from_pool(struct ptlrpc_request_pool *pool)
636 struct ptlrpc_request *request;
637 struct lustre_msg *reqbuf;
642 spin_lock(&pool->prp_lock);
645 * See if we have anything in a pool, and bail out if nothing,
646 * in writeout path, where this matters, this is safe to do, because
647 * nothing is lost in this case, and when some in-flight requests
648 * complete, this code will be called again.
650 if (unlikely(list_empty(&pool->prp_req_list))) {
651 spin_unlock(&pool->prp_lock);
655 request = list_entry(pool->prp_req_list.next, struct ptlrpc_request,
657 list_del_init(&request->rq_list);
658 spin_unlock(&pool->prp_lock);
660 LASSERT(request->rq_reqbuf);
661 LASSERT(request->rq_pool);
663 reqbuf = request->rq_reqbuf;
664 memset(request, 0, sizeof(*request));
665 request->rq_reqbuf = reqbuf;
666 request->rq_reqbuf_len = pool->prp_rq_size;
667 request->rq_pool = pool;
673 * Returns freed \a request to pool.
675 static void __ptlrpc_free_req_to_pool(struct ptlrpc_request *request)
677 struct ptlrpc_request_pool *pool = request->rq_pool;
679 spin_lock(&pool->prp_lock);
680 LASSERT(list_empty(&request->rq_list));
681 LASSERT(!request->rq_receiving_reply);
682 list_add_tail(&request->rq_list, &pool->prp_req_list);
683 spin_unlock(&pool->prp_lock);
686 void ptlrpc_add_unreplied(struct ptlrpc_request *req)
688 struct obd_import *imp = req->rq_import;
689 struct list_head *tmp;
690 struct ptlrpc_request *iter;
692 assert_spin_locked(&imp->imp_lock);
693 LASSERT(list_empty(&req->rq_unreplied_list));
695 /* unreplied list is sorted by xid in ascending order */
696 list_for_each_prev(tmp, &imp->imp_unreplied_list) {
697 iter = list_entry(tmp, struct ptlrpc_request,
700 LASSERT(req->rq_xid != iter->rq_xid);
701 if (req->rq_xid < iter->rq_xid)
703 list_add(&req->rq_unreplied_list, &iter->rq_unreplied_list);
706 list_add(&req->rq_unreplied_list, &imp->imp_unreplied_list);
709 void ptlrpc_assign_next_xid_nolock(struct ptlrpc_request *req)
711 req->rq_xid = ptlrpc_next_xid();
712 ptlrpc_add_unreplied(req);
715 static inline void ptlrpc_assign_next_xid(struct ptlrpc_request *req)
717 spin_lock(&req->rq_import->imp_lock);
718 ptlrpc_assign_next_xid_nolock(req);
719 spin_unlock(&req->rq_import->imp_lock);
722 static atomic64_t ptlrpc_last_xid;
724 static void ptlrpc_reassign_next_xid(struct ptlrpc_request *req)
726 spin_lock(&req->rq_import->imp_lock);
727 list_del_init(&req->rq_unreplied_list);
728 ptlrpc_assign_next_xid_nolock(req);
729 spin_unlock(&req->rq_import->imp_lock);
730 DEBUG_REQ(D_RPCTRACE, req, "reassign xid");
733 void ptlrpc_get_mod_rpc_slot(struct ptlrpc_request *req)
735 struct client_obd *cli = &req->rq_import->imp_obd->u.cli;
739 opc = lustre_msg_get_opc(req->rq_reqmsg);
740 tag = obd_get_mod_rpc_slot(cli, opc);
741 lustre_msg_set_tag(req->rq_reqmsg, tag);
742 ptlrpc_reassign_next_xid(req);
744 EXPORT_SYMBOL(ptlrpc_get_mod_rpc_slot);
746 void ptlrpc_put_mod_rpc_slot(struct ptlrpc_request *req)
748 __u16 tag = lustre_msg_get_tag(req->rq_reqmsg);
751 struct client_obd *cli = &req->rq_import->imp_obd->u.cli;
752 __u32 opc = lustre_msg_get_opc(req->rq_reqmsg);
754 obd_put_mod_rpc_slot(cli, opc, tag);
757 EXPORT_SYMBOL(ptlrpc_put_mod_rpc_slot);
759 int ptlrpc_request_bufs_pack(struct ptlrpc_request *request,
760 __u32 version, int opcode, char **bufs,
761 struct ptlrpc_cli_ctx *ctx)
764 struct obd_import *imp;
770 count = req_capsule_filled_sizes(&request->rq_pill, RCL_CLIENT);
771 imp = request->rq_import;
772 lengths = request->rq_pill.rc_area[RCL_CLIENT];
775 request->rq_cli_ctx = sptlrpc_cli_ctx_get(ctx);
777 rc = sptlrpc_req_get_ctx(request);
781 sptlrpc_req_set_flavor(request, opcode);
783 rc = lustre_pack_request(request, imp->imp_msg_magic, count,
788 lustre_msg_add_version(request->rq_reqmsg, version);
789 request->rq_send_state = LUSTRE_IMP_FULL;
790 request->rq_type = PTL_RPC_MSG_REQUEST;
792 request->rq_req_cbid.cbid_fn = request_out_callback;
793 request->rq_req_cbid.cbid_arg = request;
795 request->rq_reply_cbid.cbid_fn = reply_in_callback;
796 request->rq_reply_cbid.cbid_arg = request;
798 request->rq_reply_deadline = 0;
799 request->rq_bulk_deadline = 0;
800 request->rq_req_deadline = 0;
801 request->rq_phase = RQ_PHASE_NEW;
802 request->rq_next_phase = RQ_PHASE_UNDEFINED;
804 request->rq_request_portal = imp->imp_client->cli_request_portal;
805 request->rq_reply_portal = imp->imp_client->cli_reply_portal;
807 ptlrpc_at_set_req_timeout(request);
809 lustre_msg_set_opc(request->rq_reqmsg, opcode);
811 /* Let's setup deadline for req/reply/bulk unlink for opcode. */
812 if (cfs_fail_val == opcode) {
813 time64_t *fail_t = NULL, *fail2_t = NULL;
815 if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK)) {
816 fail_t = &request->rq_bulk_deadline;
817 } else if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK)) {
818 fail_t = &request->rq_reply_deadline;
819 } else if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REQ_UNLINK)) {
820 fail_t = &request->rq_req_deadline;
821 } else if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BOTH_UNLINK)) {
822 fail_t = &request->rq_reply_deadline;
823 fail2_t = &request->rq_bulk_deadline;
824 } else if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_ROUND_XID)) {
825 time64_t now = ktime_get_real_seconds();
826 u64 xid = ((u64)now >> 4) << 24;
828 atomic64_set(&ptlrpc_last_xid, xid);
832 *fail_t = ktime_get_real_seconds() + LONG_UNLINK;
835 *fail2_t = ktime_get_real_seconds() +
839 * The RPC is infected, let the test to change the
842 msleep(4 * MSEC_PER_SEC);
845 ptlrpc_assign_next_xid(request);
850 LASSERT(!request->rq_pool);
851 sptlrpc_cli_ctx_put(request->rq_cli_ctx, 1);
853 atomic_dec(&imp->imp_reqs);
854 class_import_put(imp);
858 EXPORT_SYMBOL(ptlrpc_request_bufs_pack);
861 * Pack request buffers for network transfer, performing necessary encryption
862 * steps if necessary.
864 int ptlrpc_request_pack(struct ptlrpc_request *request,
865 __u32 version, int opcode)
867 return ptlrpc_request_bufs_pack(request, version, opcode, NULL, NULL);
869 EXPORT_SYMBOL(ptlrpc_request_pack);
872 * Helper function to allocate new request on import \a imp
873 * and possibly using existing request from pool \a pool if provided.
874 * Returns allocated request structure with import field filled or
878 struct ptlrpc_request *__ptlrpc_request_alloc(struct obd_import *imp,
879 struct ptlrpc_request_pool *pool)
881 struct ptlrpc_request *request = NULL;
883 request = ptlrpc_request_cache_alloc(GFP_NOFS);
885 if (!request && pool)
886 request = ptlrpc_prep_req_from_pool(pool);
889 ptlrpc_cli_req_init(request);
891 LASSERTF((unsigned long)imp > 0x1000, "%p", imp);
892 LASSERT(imp != LP_POISON);
893 LASSERTF((unsigned long)imp->imp_client > 0x1000, "%p\n",
895 LASSERT(imp->imp_client != LP_POISON);
897 request->rq_import = class_import_get(imp);
898 atomic_inc(&imp->imp_reqs);
900 CERROR("request allocation out of memory\n");
906 static int ptlrpc_reconnect_if_idle(struct obd_import *imp)
911 * initiate connection if needed when the import has been
912 * referenced by the new request to avoid races with disconnect.
913 * serialize this check against conditional state=IDLE
914 * in ptlrpc_disconnect_idle_interpret()
916 spin_lock(&imp->imp_lock);
917 if (imp->imp_state == LUSTRE_IMP_IDLE) {
918 imp->imp_generation++;
919 imp->imp_initiated_at = imp->imp_generation;
920 imp->imp_state = LUSTRE_IMP_NEW;
922 /* connect_import_locked releases imp_lock */
923 rc = ptlrpc_connect_import_locked(imp);
926 ptlrpc_pinger_add_import(imp);
928 spin_unlock(&imp->imp_lock);
934 * Helper function for creating a request.
935 * Calls __ptlrpc_request_alloc to allocate new request sturcture and inits
936 * buffer structures according to capsule template \a format.
937 * Returns allocated request structure pointer or NULL on error.
939 static struct ptlrpc_request *
940 ptlrpc_request_alloc_internal(struct obd_import *imp,
941 struct ptlrpc_request_pool *pool,
942 const struct req_format *format)
944 struct ptlrpc_request *request;
946 request = __ptlrpc_request_alloc(imp, pool);
950 /* don't make expensive check for idling connection
951 * if it's already connected */
952 if (unlikely(imp->imp_state != LUSTRE_IMP_FULL)) {
953 if (ptlrpc_reconnect_if_idle(imp) < 0) {
954 atomic_dec(&imp->imp_reqs);
955 ptlrpc_request_free(request);
960 req_capsule_init(&request->rq_pill, request, RCL_CLIENT);
961 req_capsule_set(&request->rq_pill, format);
966 * Allocate new request structure for import \a imp and initialize its
967 * buffer structure according to capsule template \a format.
969 struct ptlrpc_request *ptlrpc_request_alloc(struct obd_import *imp,
970 const struct req_format *format)
972 return ptlrpc_request_alloc_internal(imp, NULL, format);
974 EXPORT_SYMBOL(ptlrpc_request_alloc);
977 * Allocate new request structure for import \a imp from pool \a pool and
978 * initialize its buffer structure according to capsule template \a format.
980 struct ptlrpc_request *
981 ptlrpc_request_alloc_pool(struct obd_import *imp,
982 struct ptlrpc_request_pool *pool,
983 const struct req_format *format)
985 return ptlrpc_request_alloc_internal(imp, pool, format);
987 EXPORT_SYMBOL(ptlrpc_request_alloc_pool);
990 * For requests not from pool, free memory of the request structure.
991 * For requests obtained from a pool earlier, return request back to pool.
993 void ptlrpc_request_free(struct ptlrpc_request *request)
995 if (request->rq_pool)
996 __ptlrpc_free_req_to_pool(request);
998 ptlrpc_request_cache_free(request);
1000 EXPORT_SYMBOL(ptlrpc_request_free);
1003 * Allocate new request for operatione \a opcode and immediatelly pack it for
1005 * Only used for simple requests like OBD_PING where the only important
1006 * part of the request is operation itself.
1007 * Returns allocated request or NULL on error.
1009 struct ptlrpc_request *ptlrpc_request_alloc_pack(struct obd_import *imp,
1010 const struct req_format *format,
1011 __u32 version, int opcode)
1013 struct ptlrpc_request *req = ptlrpc_request_alloc(imp, format);
1017 rc = ptlrpc_request_pack(req, version, opcode);
1019 ptlrpc_request_free(req);
1025 EXPORT_SYMBOL(ptlrpc_request_alloc_pack);
1028 * Allocate and initialize new request set structure on the current CPT.
1029 * Returns a pointer to the newly allocated set structure or NULL on error.
1031 struct ptlrpc_request_set *ptlrpc_prep_set(void)
1033 struct ptlrpc_request_set *set;
1037 cpt = cfs_cpt_current(cfs_cpt_tab, 0);
1038 OBD_CPT_ALLOC(set, cfs_cpt_tab, cpt, sizeof(*set));
1041 atomic_set(&set->set_refcount, 1);
1042 INIT_LIST_HEAD(&set->set_requests);
1043 init_waitqueue_head(&set->set_waitq);
1044 atomic_set(&set->set_new_count, 0);
1045 atomic_set(&set->set_remaining, 0);
1046 spin_lock_init(&set->set_new_req_lock);
1047 INIT_LIST_HEAD(&set->set_new_requests);
1048 set->set_max_inflight = UINT_MAX;
1049 set->set_producer = NULL;
1050 set->set_producer_arg = NULL;
1055 EXPORT_SYMBOL(ptlrpc_prep_set);
1058 * Allocate and initialize new request set structure with flow control
1059 * extension. This extension allows to control the number of requests in-flight
1060 * for the whole set. A callback function to generate requests must be provided
1061 * and the request set will keep the number of requests sent over the wire to
1063 * Returns a pointer to the newly allocated set structure or NULL on error.
1065 struct ptlrpc_request_set *ptlrpc_prep_fcset(int max, set_producer_func func,
1069 struct ptlrpc_request_set *set;
1071 set = ptlrpc_prep_set();
1075 set->set_max_inflight = max;
1076 set->set_producer = func;
1077 set->set_producer_arg = arg;
1083 * Wind down and free request set structure previously allocated with
1085 * Ensures that all requests on the set have completed and removes
1086 * all requests from the request list in a set.
1087 * If any unsent request happen to be on the list, pretends that they got
1088 * an error in flight and calls their completion handler.
1090 void ptlrpc_set_destroy(struct ptlrpc_request_set *set)
1092 struct list_head *tmp;
1093 struct list_head *next;
1099 /* Requests on the set should either all be completed, or all be new */
1100 expected_phase = (atomic_read(&set->set_remaining) == 0) ?
1101 RQ_PHASE_COMPLETE : RQ_PHASE_NEW;
1102 list_for_each(tmp, &set->set_requests) {
1103 struct ptlrpc_request *req =
1104 list_entry(tmp, struct ptlrpc_request,
1107 LASSERT(req->rq_phase == expected_phase);
1111 LASSERTF(atomic_read(&set->set_remaining) == 0 ||
1112 atomic_read(&set->set_remaining) == n, "%d / %d\n",
1113 atomic_read(&set->set_remaining), n);
1115 list_for_each_safe(tmp, next, &set->set_requests) {
1116 struct ptlrpc_request *req =
1117 list_entry(tmp, struct ptlrpc_request,
1119 list_del_init(&req->rq_set_chain);
1121 LASSERT(req->rq_phase == expected_phase);
1123 if (req->rq_phase == RQ_PHASE_NEW) {
1124 ptlrpc_req_interpret(NULL, req, -EBADR);
1125 atomic_dec(&set->set_remaining);
1128 spin_lock(&req->rq_lock);
1130 req->rq_invalid_rqset = 0;
1131 spin_unlock(&req->rq_lock);
1133 ptlrpc_req_finished(req);
1136 LASSERT(atomic_read(&set->set_remaining) == 0);
1138 ptlrpc_reqset_put(set);
1141 EXPORT_SYMBOL(ptlrpc_set_destroy);
1144 * Add a new request to the general purpose request set.
1145 * Assumes request reference from the caller.
1147 void ptlrpc_set_add_req(struct ptlrpc_request_set *set,
1148 struct ptlrpc_request *req)
1150 if (set == PTLRPCD_SET) {
1151 ptlrpcd_add_req(req);
1155 LASSERT(req->rq_import->imp_state != LUSTRE_IMP_IDLE);
1156 LASSERT(list_empty(&req->rq_set_chain));
1158 if (req->rq_allow_intr)
1159 set->set_allow_intr = 1;
1161 /* The set takes over the caller's request reference */
1162 list_add_tail(&req->rq_set_chain, &set->set_requests);
1164 atomic_inc(&set->set_remaining);
1165 req->rq_queued_time = ktime_get_seconds();
1168 lustre_msg_set_jobid(req->rq_reqmsg, NULL);
1170 if (set->set_producer)
1172 * If the request set has a producer callback, the RPC must be
1173 * sent straight away
1175 ptlrpc_send_new_req(req);
1177 EXPORT_SYMBOL(ptlrpc_set_add_req);
1180 * Add a request to a request with dedicated server thread
1181 * and wake the thread to make any necessary processing.
1182 * Currently only used for ptlrpcd.
1184 void ptlrpc_set_add_new_req(struct ptlrpcd_ctl *pc,
1185 struct ptlrpc_request *req)
1187 struct ptlrpc_request_set *set = pc->pc_set;
1190 LASSERT(req->rq_set == NULL);
1191 LASSERT(test_bit(LIOD_STOP, &pc->pc_flags) == 0);
1193 spin_lock(&set->set_new_req_lock);
1195 * The set takes over the caller's request reference.
1198 req->rq_queued_time = ktime_get_seconds();
1199 list_add_tail(&req->rq_set_chain, &set->set_new_requests);
1200 count = atomic_inc_return(&set->set_new_count);
1201 spin_unlock(&set->set_new_req_lock);
1203 /* Only need to call wakeup once for the first entry. */
1205 wake_up(&set->set_waitq);
1208 * XXX: It maybe unnecessary to wakeup all the partners. But to
1209 * guarantee the async RPC can be processed ASAP, we have
1210 * no other better choice. It maybe fixed in future.
1212 for (i = 0; i < pc->pc_npartners; i++)
1213 wake_up(&pc->pc_partners[i]->pc_set->set_waitq);
1218 * Based on the current state of the import, determine if the request
1219 * can be sent, is an error, or should be delayed.
1221 * Returns true if this request should be delayed. If false, and
1222 * *status is set, then the request can not be sent and *status is the
1223 * error code. If false and status is 0, then request can be sent.
1225 * The imp->imp_lock must be held.
1227 static int ptlrpc_import_delay_req(struct obd_import *imp,
1228 struct ptlrpc_request *req, int *status)
1236 if (req->rq_ctx_init || req->rq_ctx_fini) {
1237 /* always allow ctx init/fini rpc go through */
1238 } else if (imp->imp_state == LUSTRE_IMP_NEW) {
1239 DEBUG_REQ(D_ERROR, req, "Uninitialized import");
1241 } else if (imp->imp_state == LUSTRE_IMP_CLOSED) {
1242 unsigned int opc = lustre_msg_get_opc(req->rq_reqmsg);
1245 * pings or MDS-equivalent STATFS may safely
1248 DEBUG_REQ((opc == OBD_PING || opc == OST_STATFS) ?
1249 D_HA : D_ERROR, req, "IMP_CLOSED");
1251 } else if (ptlrpc_send_limit_expired(req)) {
1252 /* probably doesn't need to be a D_ERROR afterinitial testing */
1253 DEBUG_REQ(D_HA, req, "send limit expired");
1254 *status = -ETIMEDOUT;
1255 } else if (req->rq_send_state == LUSTRE_IMP_CONNECTING &&
1256 imp->imp_state == LUSTRE_IMP_CONNECTING) {
1257 ;/* allow CONNECT even if import is invalid */
1258 if (atomic_read(&imp->imp_inval_count) != 0) {
1259 DEBUG_REQ(D_ERROR, req, "invalidate in flight");
1262 } else if (imp->imp_invalid || imp->imp_obd->obd_no_recov) {
1263 if (!imp->imp_deactive)
1264 DEBUG_REQ(D_NET, req, "IMP_INVALID");
1265 *status = -ESHUTDOWN; /* b=12940 */
1266 } else if (req->rq_import_generation != imp->imp_generation) {
1267 DEBUG_REQ(D_ERROR, req, "req wrong generation:");
1269 } else if (req->rq_send_state != imp->imp_state) {
1270 /* invalidate in progress - any requests should be drop */
1271 if (atomic_read(&imp->imp_inval_count) != 0) {
1272 DEBUG_REQ(D_ERROR, req, "invalidate in flight");
1274 } else if (req->rq_no_delay &&
1275 imp->imp_generation != imp->imp_initiated_at) {
1276 /* ignore nodelay for requests initiating connections */
1277 *status = -EWOULDBLOCK;
1278 } else if (req->rq_allow_replay &&
1279 (imp->imp_state == LUSTRE_IMP_REPLAY ||
1280 imp->imp_state == LUSTRE_IMP_REPLAY_LOCKS ||
1281 imp->imp_state == LUSTRE_IMP_REPLAY_WAIT ||
1282 imp->imp_state == LUSTRE_IMP_RECOVER)) {
1283 DEBUG_REQ(D_HA, req, "allow during recovery");
1293 * Decide if the error message should be printed to the console or not.
1294 * Makes its decision based on request type, status, and failure frequency.
1296 * \param[in] req request that failed and may need a console message
1298 * \retval false if no message should be printed
1299 * \retval true if console message should be printed
1301 static bool ptlrpc_console_allow(struct ptlrpc_request *req, __u32 opc, int err)
1303 LASSERT(req->rq_reqmsg != NULL);
1305 /* Suppress particular reconnect errors which are to be expected. */
1306 if (opc == OST_CONNECT || opc == MDS_CONNECT || opc == MGS_CONNECT) {
1307 /* Suppress timed out reconnect requests */
1308 if (lustre_handle_is_used(&req->rq_import->imp_remote_handle) ||
1313 * Suppress most unavailable/again reconnect requests, but
1314 * print occasionally so it is clear client is trying to
1315 * connect to a server where no target is running.
1317 if ((err == -ENODEV || err == -EAGAIN) &&
1318 req->rq_import->imp_conn_cnt % 30 != 20)
1322 if (opc == LDLM_ENQUEUE && err == -EAGAIN)
1323 /* -EAGAIN is normal when using POSIX flocks */
1326 if (opc == OBD_PING && (err == -ENODEV || err == -ENOTCONN) &&
1327 (req->rq_xid & 0xf) != 10)
1328 /* Suppress most ping requests, they may fail occasionally */
1335 * Check request processing status.
1336 * Returns the status.
1338 static int ptlrpc_check_status(struct ptlrpc_request *req)
1343 rc = lustre_msg_get_status(req->rq_repmsg);
1344 if (lustre_msg_get_type(req->rq_repmsg) == PTL_RPC_MSG_ERR) {
1345 struct obd_import *imp = req->rq_import;
1346 lnet_nid_t nid = imp->imp_connection->c_peer.nid;
1347 __u32 opc = lustre_msg_get_opc(req->rq_reqmsg);
1349 if (ptlrpc_console_allow(req, opc, rc))
1350 LCONSOLE_ERROR_MSG(0x11,
1351 "%s: operation %s to node %s failed: rc = %d\n",
1352 imp->imp_obd->obd_name,
1354 libcfs_nid2str(nid), rc);
1355 RETURN(rc < 0 ? rc : -EINVAL);
1359 DEBUG_REQ(D_INFO, req, "check status: rc = %d", rc);
1365 * save pre-versions of objects into request for replay.
1366 * Versions are obtained from server reply.
1369 static void ptlrpc_save_versions(struct ptlrpc_request *req)
1371 struct lustre_msg *repmsg = req->rq_repmsg;
1372 struct lustre_msg *reqmsg = req->rq_reqmsg;
1373 __u64 *versions = lustre_msg_get_versions(repmsg);
1376 if (lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)
1380 lustre_msg_set_versions(reqmsg, versions);
1381 CDEBUG(D_INFO, "Client save versions [%#llx/%#llx]\n",
1382 versions[0], versions[1]);
1387 __u64 ptlrpc_known_replied_xid(struct obd_import *imp)
1389 struct ptlrpc_request *req;
1391 assert_spin_locked(&imp->imp_lock);
1392 if (list_empty(&imp->imp_unreplied_list))
1395 req = list_entry(imp->imp_unreplied_list.next, struct ptlrpc_request,
1397 LASSERTF(req->rq_xid >= 1, "XID:%llu\n", req->rq_xid);
1399 if (imp->imp_known_replied_xid < req->rq_xid - 1)
1400 imp->imp_known_replied_xid = req->rq_xid - 1;
1402 return req->rq_xid - 1;
1406 * Callback function called when client receives RPC reply for \a req.
1407 * Returns 0 on success or error code.
1408 * The return alue would be assigned to req->rq_status by the caller
1409 * as request processing status.
1410 * This function also decides if the request needs to be saved for later replay.
1412 static int after_reply(struct ptlrpc_request *req)
1414 struct obd_import *imp = req->rq_import;
1415 struct obd_device *obd = req->rq_import->imp_obd;
1422 LASSERT(obd != NULL);
1423 /* repbuf must be unlinked */
1424 LASSERT(!req->rq_receiving_reply && req->rq_reply_unlinked);
1426 if (req->rq_reply_truncated) {
1427 if (ptlrpc_no_resend(req)) {
1428 DEBUG_REQ(D_ERROR, req,
1429 "reply buffer overflow, expected=%d, actual size=%d",
1430 req->rq_nob_received, req->rq_repbuf_len);
1434 sptlrpc_cli_free_repbuf(req);
1436 * Pass the required reply buffer size (include
1437 * space for early reply).
1438 * NB: no need to roundup because alloc_repbuf
1441 req->rq_replen = req->rq_nob_received;
1442 req->rq_nob_received = 0;
1443 spin_lock(&req->rq_lock);
1445 spin_unlock(&req->rq_lock);
1449 work_start = ktime_get_real();
1450 timediff = ktime_us_delta(work_start, req->rq_sent_ns);
1453 * NB Until this point, the whole of the incoming message,
1454 * including buflens, status etc is in the sender's byte order.
1456 rc = sptlrpc_cli_unwrap_reply(req);
1458 DEBUG_REQ(D_ERROR, req, "unwrap reply failed: rc = %d", rc);
1463 * Security layer unwrap might ask resend this request.
1468 rc = unpack_reply(req);
1472 /* retry indefinitely on EINPROGRESS */
1473 if (lustre_msg_get_status(req->rq_repmsg) == -EINPROGRESS &&
1474 ptlrpc_no_resend(req) == 0 && !req->rq_no_retry_einprogress) {
1475 time64_t now = ktime_get_real_seconds();
1477 DEBUG_REQ((req->rq_nr_resend % 8 == 1 ? D_WARNING : 0) |
1478 D_RPCTRACE, req, "resending request on EINPROGRESS");
1479 spin_lock(&req->rq_lock);
1481 spin_unlock(&req->rq_lock);
1482 req->rq_nr_resend++;
1484 /* Readjust the timeout for current conditions */
1485 ptlrpc_at_set_req_timeout(req);
1487 * delay resend to give a chance to the server to get ready.
1488 * The delay is increased by 1s on every resend and is capped to
1489 * the current request timeout (i.e. obd_timeout if AT is off,
1490 * or AT service time x 125% + 5s, see at_est2timeout)
1492 if (req->rq_nr_resend > req->rq_timeout)
1493 req->rq_sent = now + req->rq_timeout;
1495 req->rq_sent = now + req->rq_nr_resend;
1497 /* Resend for EINPROGRESS will use a new XID */
1498 spin_lock(&imp->imp_lock);
1499 list_del_init(&req->rq_unreplied_list);
1500 spin_unlock(&imp->imp_lock);
1505 if (obd->obd_svc_stats) {
1506 lprocfs_counter_add(obd->obd_svc_stats, PTLRPC_REQWAIT_CNTR,
1508 ptlrpc_lprocfs_rpc_sent(req, timediff);
1511 if (lustre_msg_get_type(req->rq_repmsg) != PTL_RPC_MSG_REPLY &&
1512 lustre_msg_get_type(req->rq_repmsg) != PTL_RPC_MSG_ERR) {
1513 DEBUG_REQ(D_ERROR, req, "invalid packet received (type=%u)",
1514 lustre_msg_get_type(req->rq_repmsg));
1518 if (lustre_msg_get_opc(req->rq_reqmsg) != OBD_PING)
1519 CFS_FAIL_TIMEOUT(OBD_FAIL_PTLRPC_PAUSE_REP, cfs_fail_val);
1520 ptlrpc_at_adj_service(req, lustre_msg_get_timeout(req->rq_repmsg));
1521 ptlrpc_at_adj_net_latency(req,
1522 lustre_msg_get_service_timeout(req->rq_repmsg));
1524 rc = ptlrpc_check_status(req);
1528 * Either we've been evicted, or the server has failed for
1529 * some reason. Try to reconnect, and if that fails, punt to
1532 if (ptlrpc_recoverable_error(rc)) {
1533 if (req->rq_send_state != LUSTRE_IMP_FULL ||
1534 imp->imp_obd->obd_no_recov || imp->imp_dlm_fake) {
1537 ptlrpc_request_handle_notconn(req);
1542 * Let's look if server sent slv. Do it only for RPC with
1545 ldlm_cli_update_pool(req);
1549 * Store transno in reqmsg for replay.
1551 if (!(lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)) {
1552 req->rq_transno = lustre_msg_get_transno(req->rq_repmsg);
1553 lustre_msg_set_transno(req->rq_reqmsg, req->rq_transno);
1556 if (imp->imp_replayable) {
1557 spin_lock(&imp->imp_lock);
1559 * No point in adding already-committed requests to the replay
1560 * list, we will just remove them immediately. b=9829
1562 if (req->rq_transno != 0 &&
1564 lustre_msg_get_last_committed(req->rq_repmsg) ||
1566 /** version recovery */
1567 ptlrpc_save_versions(req);
1568 ptlrpc_retain_replayable_request(req, imp);
1569 } else if (req->rq_commit_cb &&
1570 list_empty(&req->rq_replay_list)) {
1572 * NB: don't call rq_commit_cb if it's already on
1573 * rq_replay_list, ptlrpc_free_committed() will call
1574 * it later, see LU-3618 for details
1576 spin_unlock(&imp->imp_lock);
1577 req->rq_commit_cb(req);
1578 spin_lock(&imp->imp_lock);
1582 * Replay-enabled imports return commit-status information.
1584 committed = lustre_msg_get_last_committed(req->rq_repmsg);
1585 if (likely(committed > imp->imp_peer_committed_transno))
1586 imp->imp_peer_committed_transno = committed;
1588 ptlrpc_free_committed(imp);
1590 if (!list_empty(&imp->imp_replay_list)) {
1591 struct ptlrpc_request *last;
1593 last = list_entry(imp->imp_replay_list.prev,
1594 struct ptlrpc_request,
1597 * Requests with rq_replay stay on the list even if no
1598 * commit is expected.
1600 if (last->rq_transno > imp->imp_peer_committed_transno)
1601 ptlrpc_pinger_commit_expected(imp);
1604 spin_unlock(&imp->imp_lock);
1611 * Helper function to send request \a req over the network for the first time
1612 * Also adjusts request phase.
1613 * Returns 0 on success or error code.
1615 static int ptlrpc_send_new_req(struct ptlrpc_request *req)
1617 struct obd_import *imp = req->rq_import;
1622 LASSERT(req->rq_phase == RQ_PHASE_NEW);
1624 /* do not try to go further if there is not enough memory in enc_pool */
1625 if (req->rq_sent && req->rq_bulk)
1626 if (req->rq_bulk->bd_iov_count > get_free_pages_in_pool() &&
1627 pool_is_at_full_capacity())
1630 if (req->rq_sent && (req->rq_sent > ktime_get_real_seconds()) &&
1631 (!req->rq_generation_set ||
1632 req->rq_import_generation == imp->imp_generation))
1635 ptlrpc_rqphase_move(req, RQ_PHASE_RPC);
1637 spin_lock(&imp->imp_lock);
1639 LASSERT(req->rq_xid != 0);
1640 LASSERT(!list_empty(&req->rq_unreplied_list));
1642 if (!req->rq_generation_set)
1643 req->rq_import_generation = imp->imp_generation;
1645 if (ptlrpc_import_delay_req(imp, req, &rc)) {
1646 spin_lock(&req->rq_lock);
1647 req->rq_waiting = 1;
1648 spin_unlock(&req->rq_lock);
1650 DEBUG_REQ(D_HA, req, "req waiting for recovery: (%s != %s)",
1651 ptlrpc_import_state_name(req->rq_send_state),
1652 ptlrpc_import_state_name(imp->imp_state));
1653 LASSERT(list_empty(&req->rq_list));
1654 list_add_tail(&req->rq_list, &imp->imp_delayed_list);
1655 atomic_inc(&req->rq_import->imp_inflight);
1656 spin_unlock(&imp->imp_lock);
1661 spin_unlock(&imp->imp_lock);
1662 req->rq_status = rc;
1663 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1667 LASSERT(list_empty(&req->rq_list));
1668 list_add_tail(&req->rq_list, &imp->imp_sending_list);
1669 atomic_inc(&req->rq_import->imp_inflight);
1672 * find the known replied XID from the unreplied list, CONNECT
1673 * and DISCONNECT requests are skipped to make the sanity check
1674 * on server side happy. see process_req_last_xid().
1676 * For CONNECT: Because replay requests have lower XID, it'll
1677 * break the sanity check if CONNECT bump the exp_last_xid on
1680 * For DISCONNECT: Since client will abort inflight RPC before
1681 * sending DISCONNECT, DISCONNECT may carry an XID which higher
1682 * than the inflight RPC.
1684 if (!ptlrpc_req_is_connect(req) && !ptlrpc_req_is_disconnect(req))
1685 min_xid = ptlrpc_known_replied_xid(imp);
1686 spin_unlock(&imp->imp_lock);
1688 lustre_msg_set_last_xid(req->rq_reqmsg, min_xid);
1690 lustre_msg_set_status(req->rq_reqmsg, current->pid);
1692 rc = sptlrpc_req_refresh_ctx(req, 0);
1695 req->rq_status = rc;
1698 spin_lock(&req->rq_lock);
1699 req->rq_wait_ctx = 1;
1700 spin_unlock(&req->rq_lock);
1706 "Sending RPC req@%p pname:cluuid:pid:xid:nid:opc:job %s:%s:%d:%llu:%s:%d:%s\n",
1708 imp->imp_obd->obd_uuid.uuid,
1709 lustre_msg_get_status(req->rq_reqmsg), req->rq_xid,
1710 obd_import_nid2str(imp), lustre_msg_get_opc(req->rq_reqmsg),
1711 lustre_msg_get_jobid(req->rq_reqmsg) ?: "");
1713 rc = ptl_send_rpc(req, 0);
1714 if (rc == -ENOMEM) {
1715 spin_lock(&imp->imp_lock);
1716 if (!list_empty(&req->rq_list)) {
1717 list_del_init(&req->rq_list);
1718 if (atomic_dec_and_test(&req->rq_import->imp_inflight))
1719 wake_up(&req->rq_import->imp_recovery_waitq);
1721 spin_unlock(&imp->imp_lock);
1722 ptlrpc_rqphase_move(req, RQ_PHASE_NEW);
1726 DEBUG_REQ(D_HA, req, "send failed, expect timeout: rc = %d",
1728 spin_lock(&req->rq_lock);
1729 req->rq_net_err = 1;
1730 spin_unlock(&req->rq_lock);
1736 static inline int ptlrpc_set_producer(struct ptlrpc_request_set *set)
1741 LASSERT(set->set_producer != NULL);
1743 remaining = atomic_read(&set->set_remaining);
1746 * populate the ->set_requests list with requests until we
1747 * reach the maximum number of RPCs in flight for this set
1749 while (atomic_read(&set->set_remaining) < set->set_max_inflight) {
1750 rc = set->set_producer(set, set->set_producer_arg);
1751 if (rc == -ENOENT) {
1752 /* no more RPC to produce */
1753 set->set_producer = NULL;
1754 set->set_producer_arg = NULL;
1759 RETURN((atomic_read(&set->set_remaining) - remaining));
1763 * this sends any unsent RPCs in \a set and returns 1 if all are sent
1764 * and no more replies are expected.
1765 * (it is possible to get less replies than requests sent e.g. due to timed out
1766 * requests or requests that we had trouble to send out)
1768 * NOTE: This function contains a potential schedule point (cond_resched()).
1770 int ptlrpc_check_set(const struct lu_env *env, struct ptlrpc_request_set *set)
1772 struct list_head *tmp, *next;
1773 LIST_HEAD(comp_reqs);
1774 int force_timer_recalc = 0;
1777 if (atomic_read(&set->set_remaining) == 0)
1780 list_for_each_safe(tmp, next, &set->set_requests) {
1781 struct ptlrpc_request *req =
1782 list_entry(tmp, struct ptlrpc_request,
1784 struct obd_import *imp = req->rq_import;
1785 int unregistered = 0;
1789 if (req->rq_phase == RQ_PHASE_COMPLETE) {
1790 list_move_tail(&req->rq_set_chain, &comp_reqs);
1795 * This schedule point is mainly for the ptlrpcd caller of this
1796 * function. Most ptlrpc sets are not long-lived and unbounded
1797 * in length, but at the least the set used by the ptlrpcd is.
1798 * Since the processing time is unbounded, we need to insert an
1799 * explicit schedule point to make the thread well-behaved.
1804 * If the caller requires to allow to be interpreted by force
1805 * and it has really been interpreted, then move the request
1806 * to RQ_PHASE_INTERPRET phase in spite of what the current
1809 if (unlikely(req->rq_allow_intr && req->rq_intr)) {
1810 req->rq_status = -EINTR;
1811 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1814 * Since it is interpreted and we have to wait for
1815 * the reply to be unlinked, then use sync mode.
1819 GOTO(interpret, req->rq_status);
1822 if (req->rq_phase == RQ_PHASE_NEW && ptlrpc_send_new_req(req))
1823 force_timer_recalc = 1;
1825 /* delayed send - skip */
1826 if (req->rq_phase == RQ_PHASE_NEW && req->rq_sent)
1829 /* delayed resend - skip */
1830 if (req->rq_phase == RQ_PHASE_RPC && req->rq_resend &&
1831 req->rq_sent > ktime_get_real_seconds())
1834 if (!(req->rq_phase == RQ_PHASE_RPC ||
1835 req->rq_phase == RQ_PHASE_BULK ||
1836 req->rq_phase == RQ_PHASE_INTERPRET ||
1837 req->rq_phase == RQ_PHASE_UNREG_RPC ||
1838 req->rq_phase == RQ_PHASE_UNREG_BULK)) {
1839 DEBUG_REQ(D_ERROR, req, "bad phase %x", req->rq_phase);
1843 if (req->rq_phase == RQ_PHASE_UNREG_RPC ||
1844 req->rq_phase == RQ_PHASE_UNREG_BULK) {
1845 LASSERT(req->rq_next_phase != req->rq_phase);
1846 LASSERT(req->rq_next_phase != RQ_PHASE_UNDEFINED);
1848 if (req->rq_req_deadline &&
1849 !OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REQ_UNLINK))
1850 req->rq_req_deadline = 0;
1851 if (req->rq_reply_deadline &&
1852 !OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK))
1853 req->rq_reply_deadline = 0;
1854 if (req->rq_bulk_deadline &&
1855 !OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK))
1856 req->rq_bulk_deadline = 0;
1859 * Skip processing until reply is unlinked. We
1860 * can't return to pool before that and we can't
1861 * call interpret before that. We need to make
1862 * sure that all rdma transfers finished and will
1863 * not corrupt any data.
1865 if (req->rq_phase == RQ_PHASE_UNREG_RPC &&
1866 ptlrpc_client_recv_or_unlink(req))
1868 if (req->rq_phase == RQ_PHASE_UNREG_BULK &&
1869 ptlrpc_client_bulk_active(req))
1873 * Turn fail_loc off to prevent it from looping
1876 if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK)) {
1877 OBD_FAIL_CHECK_ORSET(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK,
1880 if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK)) {
1881 OBD_FAIL_CHECK_ORSET(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK,
1886 * Move to next phase if reply was successfully
1889 ptlrpc_rqphase_move(req, req->rq_next_phase);
1892 if (req->rq_phase == RQ_PHASE_INTERPRET)
1893 GOTO(interpret, req->rq_status);
1896 * Note that this also will start async reply unlink.
1898 if (req->rq_net_err && !req->rq_timedout) {
1899 ptlrpc_expire_one_request(req, 1);
1902 * Check if we still need to wait for unlink.
1904 if (ptlrpc_client_recv_or_unlink(req) ||
1905 ptlrpc_client_bulk_active(req))
1907 /* If there is no need to resend, fail it now. */
1908 if (req->rq_no_resend) {
1909 if (req->rq_status == 0)
1910 req->rq_status = -EIO;
1911 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1912 GOTO(interpret, req->rq_status);
1919 spin_lock(&req->rq_lock);
1920 req->rq_replied = 0;
1921 spin_unlock(&req->rq_lock);
1922 if (req->rq_status == 0)
1923 req->rq_status = -EIO;
1924 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1925 GOTO(interpret, req->rq_status);
1929 * ptlrpc_set_wait uses l_wait_event_abortable_timeout()
1930 * so it sets rq_intr regardless of individual rpc
1931 * timeouts. The synchronous IO waiting path sets
1932 * rq_intr irrespective of whether ptlrpcd
1933 * has seen a timeout. Our policy is to only interpret
1934 * interrupted rpcs after they have timed out, so we
1935 * need to enforce that here.
1938 if (req->rq_intr && (req->rq_timedout || req->rq_waiting ||
1939 req->rq_wait_ctx)) {
1940 req->rq_status = -EINTR;
1941 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1942 GOTO(interpret, req->rq_status);
1945 if (req->rq_phase == RQ_PHASE_RPC) {
1946 if (req->rq_timedout || req->rq_resend ||
1947 req->rq_waiting || req->rq_wait_ctx) {
1950 if (!ptlrpc_unregister_reply(req, 1)) {
1951 ptlrpc_unregister_bulk(req, 1);
1955 spin_lock(&imp->imp_lock);
1956 if (ptlrpc_import_delay_req(imp, req,
1959 * put on delay list - only if we wait
1960 * recovery finished - before send
1962 list_move_tail(&req->rq_list,
1963 &imp->imp_delayed_list);
1964 spin_unlock(&imp->imp_lock);
1969 req->rq_status = status;
1970 ptlrpc_rqphase_move(req,
1971 RQ_PHASE_INTERPRET);
1972 spin_unlock(&imp->imp_lock);
1973 GOTO(interpret, req->rq_status);
1975 /* ignore on just initiated connections */
1976 if (ptlrpc_no_resend(req) &&
1977 !req->rq_wait_ctx &&
1978 imp->imp_generation !=
1979 imp->imp_initiated_at) {
1980 req->rq_status = -ENOTCONN;
1981 ptlrpc_rqphase_move(req,
1982 RQ_PHASE_INTERPRET);
1983 spin_unlock(&imp->imp_lock);
1984 GOTO(interpret, req->rq_status);
1987 list_move_tail(&req->rq_list,
1988 &imp->imp_sending_list);
1990 spin_unlock(&imp->imp_lock);
1992 spin_lock(&req->rq_lock);
1993 req->rq_waiting = 0;
1994 spin_unlock(&req->rq_lock);
1996 if (req->rq_timedout || req->rq_resend) {
1998 * This is re-sending anyways,
1999 * let's mark req as resend.
2001 spin_lock(&req->rq_lock);
2003 spin_unlock(&req->rq_lock);
2006 * rq_wait_ctx is only touched by ptlrpcd,
2007 * so no lock is needed here.
2009 status = sptlrpc_req_refresh_ctx(req, 0);
2012 req->rq_status = status;
2013 spin_lock(&req->rq_lock);
2014 req->rq_wait_ctx = 0;
2015 spin_unlock(&req->rq_lock);
2016 force_timer_recalc = 1;
2018 spin_lock(&req->rq_lock);
2019 req->rq_wait_ctx = 1;
2020 spin_unlock(&req->rq_lock);
2025 spin_lock(&req->rq_lock);
2026 req->rq_wait_ctx = 0;
2027 spin_unlock(&req->rq_lock);
2031 * In any case, the previous bulk should be
2032 * cleaned up to prepare for the new sending
2035 !ptlrpc_unregister_bulk(req, 1))
2038 rc = ptl_send_rpc(req, 0);
2039 if (rc == -ENOMEM) {
2040 spin_lock(&imp->imp_lock);
2041 if (!list_empty(&req->rq_list))
2042 list_del_init(&req->rq_list);
2043 spin_unlock(&imp->imp_lock);
2044 ptlrpc_rqphase_move(req, RQ_PHASE_NEW);
2048 DEBUG_REQ(D_HA, req,
2049 "send failed: rc = %d", rc);
2050 force_timer_recalc = 1;
2051 spin_lock(&req->rq_lock);
2052 req->rq_net_err = 1;
2053 spin_unlock(&req->rq_lock);
2056 /* need to reset the timeout */
2057 force_timer_recalc = 1;
2060 spin_lock(&req->rq_lock);
2062 if (ptlrpc_client_early(req)) {
2063 ptlrpc_at_recv_early_reply(req);
2064 spin_unlock(&req->rq_lock);
2068 /* Still waiting for a reply? */
2069 if (ptlrpc_client_recv(req)) {
2070 spin_unlock(&req->rq_lock);
2074 /* Did we actually receive a reply? */
2075 if (!ptlrpc_client_replied(req)) {
2076 spin_unlock(&req->rq_lock);
2080 spin_unlock(&req->rq_lock);
2083 * unlink from net because we are going to
2084 * swab in-place of reply buffer
2086 unregistered = ptlrpc_unregister_reply(req, 1);
2090 req->rq_status = after_reply(req);
2095 * If there is no bulk associated with this request,
2096 * then we're done and should let the interpreter
2097 * process the reply. Similarly if the RPC returned
2098 * an error, and therefore the bulk will never arrive.
2100 if (!req->rq_bulk || req->rq_status < 0) {
2101 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
2102 GOTO(interpret, req->rq_status);
2105 ptlrpc_rqphase_move(req, RQ_PHASE_BULK);
2108 LASSERT(req->rq_phase == RQ_PHASE_BULK);
2109 if (ptlrpc_client_bulk_active(req))
2112 if (req->rq_bulk->bd_failure) {
2114 * The RPC reply arrived OK, but the bulk screwed
2115 * up! Dead weird since the server told us the RPC
2116 * was good after getting the REPLY for her GET or
2117 * the ACK for her PUT.
2119 DEBUG_REQ(D_ERROR, req, "bulk transfer failed");
2120 req->rq_status = -EIO;
2123 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
2126 LASSERT(req->rq_phase == RQ_PHASE_INTERPRET);
2129 * This moves to "unregistering" phase we need to wait for
2132 if (!unregistered && !ptlrpc_unregister_reply(req, async)) {
2133 /* start async bulk unlink too */
2134 ptlrpc_unregister_bulk(req, 1);
2138 if (!ptlrpc_unregister_bulk(req, async))
2142 * When calling interpret receiving already should be
2145 LASSERT(!req->rq_receiving_reply);
2147 ptlrpc_req_interpret(env, req, req->rq_status);
2149 if (ptlrpcd_check_work(req)) {
2150 atomic_dec(&set->set_remaining);
2153 ptlrpc_rqphase_move(req, RQ_PHASE_COMPLETE);
2157 "Completed RPC req@%p pname:cluuid:pid:xid:nid:opc:job %s:%s:%d:%llu:%s:%d:%s\n",
2159 imp->imp_obd->obd_uuid.uuid,
2160 lustre_msg_get_status(req->rq_reqmsg),
2162 obd_import_nid2str(imp),
2163 lustre_msg_get_opc(req->rq_reqmsg),
2164 lustre_msg_get_jobid(req->rq_reqmsg) ?: "");
2166 spin_lock(&imp->imp_lock);
2168 * Request already may be not on sending or delaying list. This
2169 * may happen in the case of marking it erroneous for the case
2170 * ptlrpc_import_delay_req(req, status) find it impossible to
2171 * allow sending this rpc and returns *status != 0.
2173 if (!list_empty(&req->rq_list)) {
2174 list_del_init(&req->rq_list);
2175 if (atomic_dec_and_test(&imp->imp_inflight))
2176 wake_up(&imp->imp_recovery_waitq);
2178 list_del_init(&req->rq_unreplied_list);
2179 spin_unlock(&imp->imp_lock);
2181 atomic_dec(&set->set_remaining);
2182 wake_up(&imp->imp_recovery_waitq);
2184 if (set->set_producer) {
2185 /* produce a new request if possible */
2186 if (ptlrpc_set_producer(set) > 0)
2187 force_timer_recalc = 1;
2190 * free the request that has just been completed
2191 * in order not to pollute set->set_requests
2193 list_del_init(&req->rq_set_chain);
2194 spin_lock(&req->rq_lock);
2196 req->rq_invalid_rqset = 0;
2197 spin_unlock(&req->rq_lock);
2199 /* record rq_status to compute the final status later */
2200 if (req->rq_status != 0)
2201 set->set_rc = req->rq_status;
2202 ptlrpc_req_finished(req);
2204 list_move_tail(&req->rq_set_chain, &comp_reqs);
2209 * move completed request at the head of list so it's easier for
2210 * caller to find them
2212 list_splice(&comp_reqs, &set->set_requests);
2214 /* If we hit an error, we want to recover promptly. */
2215 RETURN(atomic_read(&set->set_remaining) == 0 || force_timer_recalc);
2217 EXPORT_SYMBOL(ptlrpc_check_set);
2220 * Time out request \a req. is \a async_unlink is set, that means do not wait
2221 * until LNet actually confirms network buffer unlinking.
2222 * Return 1 if we should give up further retrying attempts or 0 otherwise.
2224 int ptlrpc_expire_one_request(struct ptlrpc_request *req, int async_unlink)
2226 struct obd_import *imp = req->rq_import;
2227 unsigned int debug_mask = D_RPCTRACE;
2231 spin_lock(&req->rq_lock);
2232 req->rq_timedout = 1;
2233 spin_unlock(&req->rq_lock);
2235 if (ptlrpc_console_allow(req, lustre_msg_get_opc(req->rq_reqmsg),
2236 lustre_msg_get_status(req->rq_reqmsg)))
2237 debug_mask = D_WARNING;
2238 DEBUG_REQ(debug_mask, req, "Request sent has %s: [sent %lld/real %lld]",
2239 req->rq_net_err ? "failed due to network error" :
2240 ((req->rq_real_sent == 0 ||
2241 req->rq_real_sent < req->rq_sent ||
2242 req->rq_real_sent >= req->rq_deadline) ?
2243 "timed out for sent delay" : "timed out for slow reply"),
2244 req->rq_sent, req->rq_real_sent);
2246 if (imp && obd_debug_peer_on_timeout)
2247 LNetDebugPeer(imp->imp_connection->c_peer);
2249 ptlrpc_unregister_reply(req, async_unlink);
2250 ptlrpc_unregister_bulk(req, async_unlink);
2252 if (obd_dump_on_timeout)
2253 libcfs_debug_dumplog();
2256 DEBUG_REQ(D_HA, req, "NULL import: already cleaned up?");
2260 atomic_inc(&imp->imp_timeouts);
2262 /* The DLM server doesn't want recovery run on its imports. */
2263 if (imp->imp_dlm_fake)
2267 * If this request is for recovery or other primordial tasks,
2268 * then error it out here.
2270 if (req->rq_ctx_init || req->rq_ctx_fini ||
2271 req->rq_send_state != LUSTRE_IMP_FULL ||
2272 imp->imp_obd->obd_no_recov) {
2273 DEBUG_REQ(D_RPCTRACE, req, "err -110, sent_state=%s (now=%s)",
2274 ptlrpc_import_state_name(req->rq_send_state),
2275 ptlrpc_import_state_name(imp->imp_state));
2276 spin_lock(&req->rq_lock);
2277 req->rq_status = -ETIMEDOUT;
2279 spin_unlock(&req->rq_lock);
2284 * if a request can't be resent we can't wait for an answer after
2287 if (ptlrpc_no_resend(req)) {
2288 DEBUG_REQ(D_RPCTRACE, req, "TIMEOUT-NORESEND:");
2292 ptlrpc_fail_import(imp, lustre_msg_get_conn_cnt(req->rq_reqmsg));
2298 * Time out all uncompleted requests in request set pointed by \a data
2299 * This is called when a wait times out.
2301 void ptlrpc_expired_set(struct ptlrpc_request_set *set)
2303 struct list_head *tmp;
2304 time64_t now = ktime_get_real_seconds();
2307 LASSERT(set != NULL);
2310 * A timeout expired. See which reqs it applies to...
2312 list_for_each(tmp, &set->set_requests) {
2313 struct ptlrpc_request *req =
2314 list_entry(tmp, struct ptlrpc_request,
2317 /* don't expire request waiting for context */
2318 if (req->rq_wait_ctx)
2321 /* Request in-flight? */
2322 if (!((req->rq_phase == RQ_PHASE_RPC &&
2323 !req->rq_waiting && !req->rq_resend) ||
2324 (req->rq_phase == RQ_PHASE_BULK)))
2327 if (req->rq_timedout || /* already dealt with */
2328 req->rq_deadline > now) /* not expired */
2332 * Deal with this guy. Do it asynchronously to not block
2335 ptlrpc_expire_one_request(req, 1);
2340 * Interrupts (sets interrupted flag) all uncompleted requests in
2341 * a set \a data. This is called when a wait_event is interrupted
2344 static void ptlrpc_interrupted_set(struct ptlrpc_request_set *set)
2346 struct list_head *tmp;
2348 LASSERT(set != NULL);
2349 CDEBUG(D_RPCTRACE, "INTERRUPTED SET %p\n", set);
2351 list_for_each(tmp, &set->set_requests) {
2352 struct ptlrpc_request *req =
2353 list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2358 if (req->rq_phase != RQ_PHASE_RPC &&
2359 req->rq_phase != RQ_PHASE_UNREG_RPC &&
2360 !req->rq_allow_intr)
2363 spin_lock(&req->rq_lock);
2365 spin_unlock(&req->rq_lock);
2370 * Get the smallest timeout in the set; this does NOT set a timeout.
2372 time64_t ptlrpc_set_next_timeout(struct ptlrpc_request_set *set)
2374 struct list_head *tmp;
2375 time64_t now = ktime_get_real_seconds();
2377 struct ptlrpc_request *req;
2381 list_for_each(tmp, &set->set_requests) {
2382 req = list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2384 /* Request in-flight? */
2385 if (!(((req->rq_phase == RQ_PHASE_RPC) && !req->rq_waiting) ||
2386 (req->rq_phase == RQ_PHASE_BULK) ||
2387 (req->rq_phase == RQ_PHASE_NEW)))
2390 /* Already timed out. */
2391 if (req->rq_timedout)
2394 /* Waiting for ctx. */
2395 if (req->rq_wait_ctx)
2398 if (req->rq_phase == RQ_PHASE_NEW)
2399 deadline = req->rq_sent;
2400 else if (req->rq_phase == RQ_PHASE_RPC && req->rq_resend)
2401 deadline = req->rq_sent;
2403 deadline = req->rq_sent + req->rq_timeout;
2405 if (deadline <= now) /* actually expired already */
2406 timeout = 1; /* ASAP */
2407 else if (timeout == 0 || timeout > deadline - now)
2408 timeout = deadline - now;
2414 * Send all unset request from the set and then wait untill all
2415 * requests in the set complete (either get a reply, timeout, get an
2416 * error or otherwise be interrupted).
2417 * Returns 0 on success or error code otherwise.
2419 int ptlrpc_set_wait(const struct lu_env *env, struct ptlrpc_request_set *set)
2421 struct list_head *tmp;
2422 struct ptlrpc_request *req;
2427 if (set->set_producer)
2428 (void)ptlrpc_set_producer(set);
2430 list_for_each(tmp, &set->set_requests) {
2431 req = list_entry(tmp, struct ptlrpc_request,
2433 if (req->rq_phase == RQ_PHASE_NEW)
2434 (void)ptlrpc_send_new_req(req);
2437 if (list_empty(&set->set_requests))
2441 timeout = ptlrpc_set_next_timeout(set);
2444 * wait until all complete, interrupted, or an in-flight
2447 CDEBUG(D_RPCTRACE, "set %p going to sleep for %lld seconds\n",
2450 if ((timeout == 0 && !signal_pending(current)) ||
2451 set->set_allow_intr) {
2453 * No requests are in-flight (ether timed out
2454 * or delayed), so we can allow interrupts.
2455 * We still want to block for a limited time,
2456 * so we allow interrupts during the timeout.
2458 rc = l_wait_event_abortable_timeout(
2460 ptlrpc_check_set(NULL, set),
2461 cfs_time_seconds(timeout ? timeout : 1));
2464 ptlrpc_expired_set(set);
2465 } else if (rc < 0) {
2467 ptlrpc_interrupted_set(set);
2473 * At least one request is in flight, so no
2474 * interrupts are allowed. Wait until all
2475 * complete, or an in-flight req times out.
2477 rc = wait_event_idle_timeout(
2479 ptlrpc_check_set(NULL, set),
2480 cfs_time_seconds(timeout ? timeout : 1));
2482 ptlrpc_expired_set(set);
2489 * LU-769 - if we ignored the signal because
2490 * it was already pending when we started, we
2491 * need to handle it now or we risk it being
2494 if (rc == -ETIMEDOUT &&
2495 signal_pending(current)) {
2496 sigset_t blocked_sigs;
2498 cfs_block_sigsinv(LUSTRE_FATAL_SIGS,
2501 * In fact we only interrupt for the
2502 * "fatal" signals like SIGINT or
2503 * SIGKILL. We still ignore less
2504 * important signals since ptlrpc set
2505 * is not easily reentrant from
2508 if (signal_pending(current))
2509 ptlrpc_interrupted_set(set);
2510 cfs_restore_sigs(&blocked_sigs);
2514 LASSERT(rc == 0 || rc == -EINTR || rc == -ETIMEDOUT);
2517 * -EINTR => all requests have been flagged rq_intr so next
2519 * -ETIMEDOUT => someone timed out. When all reqs have
2520 * timed out, signals are enabled allowing completion with
2522 * I don't really care if we go once more round the loop in
2523 * the error cases -eeb.
2525 if (rc == 0 && atomic_read(&set->set_remaining) == 0) {
2526 list_for_each(tmp, &set->set_requests) {
2527 req = list_entry(tmp, struct ptlrpc_request,
2529 spin_lock(&req->rq_lock);
2530 req->rq_invalid_rqset = 1;
2531 spin_unlock(&req->rq_lock);
2534 } while (rc != 0 || atomic_read(&set->set_remaining) != 0);
2536 LASSERT(atomic_read(&set->set_remaining) == 0);
2538 rc = set->set_rc; /* rq_status of already freed requests if any */
2539 list_for_each(tmp, &set->set_requests) {
2540 req = list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2542 LASSERT(req->rq_phase == RQ_PHASE_COMPLETE);
2543 if (req->rq_status != 0)
2544 rc = req->rq_status;
2549 EXPORT_SYMBOL(ptlrpc_set_wait);
2552 * Helper fuction for request freeing.
2553 * Called when request count reached zero and request needs to be freed.
2554 * Removes request from all sorts of sending/replay lists it might be on,
2555 * frees network buffers if any are present.
2556 * If \a locked is set, that means caller is already holding import imp_lock
2557 * and so we no longer need to reobtain it (for certain lists manipulations)
2559 static void __ptlrpc_free_req(struct ptlrpc_request *request, int locked)
2566 LASSERT(!request->rq_srv_req);
2567 LASSERT(request->rq_export == NULL);
2568 LASSERTF(!request->rq_receiving_reply, "req %p\n", request);
2569 LASSERTF(list_empty(&request->rq_list), "req %p\n", request);
2570 LASSERTF(list_empty(&request->rq_set_chain), "req %p\n", request);
2571 LASSERTF(!request->rq_replay, "req %p\n", request);
2573 req_capsule_fini(&request->rq_pill);
2576 * We must take it off the imp_replay_list first. Otherwise, we'll set
2577 * request->rq_reqmsg to NULL while osc_close is dereferencing it.
2579 if (request->rq_import) {
2581 spin_lock(&request->rq_import->imp_lock);
2582 list_del_init(&request->rq_replay_list);
2583 list_del_init(&request->rq_unreplied_list);
2585 spin_unlock(&request->rq_import->imp_lock);
2587 LASSERTF(list_empty(&request->rq_replay_list), "req %p\n", request);
2589 if (atomic_read(&request->rq_refcount) != 0) {
2590 DEBUG_REQ(D_ERROR, request,
2591 "freeing request with nonzero refcount");
2595 if (request->rq_repbuf)
2596 sptlrpc_cli_free_repbuf(request);
2598 if (request->rq_import) {
2599 if (!ptlrpcd_check_work(request)) {
2600 LASSERT(atomic_read(&request->rq_import->imp_reqs) > 0);
2601 atomic_dec(&request->rq_import->imp_reqs);
2603 class_import_put(request->rq_import);
2604 request->rq_import = NULL;
2606 if (request->rq_bulk)
2607 ptlrpc_free_bulk(request->rq_bulk);
2609 if (request->rq_reqbuf || request->rq_clrbuf)
2610 sptlrpc_cli_free_reqbuf(request);
2612 if (request->rq_cli_ctx)
2613 sptlrpc_req_put_ctx(request, !locked);
2615 if (request->rq_pool)
2616 __ptlrpc_free_req_to_pool(request);
2618 ptlrpc_request_cache_free(request);
2622 static int __ptlrpc_req_finished(struct ptlrpc_request *request, int locked);
2624 * Drop one request reference. Must be called with import imp_lock held.
2625 * When reference count drops to zero, request is freed.
2627 void ptlrpc_req_finished_with_imp_lock(struct ptlrpc_request *request)
2629 assert_spin_locked(&request->rq_import->imp_lock);
2630 (void)__ptlrpc_req_finished(request, 1);
2635 * Drops one reference count for request \a request.
2636 * \a locked set indicates that caller holds import imp_lock.
2637 * Frees the request whe reference count reaches zero.
2639 * \retval 1 the request is freed
2640 * \retval 0 some others still hold references on the request
2642 static int __ptlrpc_req_finished(struct ptlrpc_request *request, int locked)
2650 LASSERT(request != LP_POISON);
2651 LASSERT(request->rq_reqmsg != LP_POISON);
2653 DEBUG_REQ(D_INFO, request, "refcount now %u",
2654 atomic_read(&request->rq_refcount) - 1);
2656 spin_lock(&request->rq_lock);
2657 count = atomic_dec_return(&request->rq_refcount);
2658 LASSERTF(count >= 0, "Invalid ref count %d\n", count);
2661 * For open RPC, the client does not know the EA size (LOV, ACL, and
2662 * so on) before replied, then the client has to reserve very large
2663 * reply buffer. Such buffer will not be released until the RPC freed.
2664 * Since The open RPC is replayable, we need to keep it in the replay
2665 * list until close. If there are a lot of files opened concurrently,
2666 * then the client may be OOM.
2668 * If fact, it is unnecessary to keep reply buffer for open replay,
2669 * related EAs have already been saved via mdc_save_lovea() before
2670 * coming here. So it is safe to free the reply buffer some earlier
2671 * before releasing the RPC to avoid client OOM. LU-9514
2673 if (count == 1 && request->rq_early_free_repbuf && request->rq_repbuf) {
2674 spin_lock(&request->rq_early_free_lock);
2675 sptlrpc_cli_free_repbuf(request);
2676 request->rq_repbuf = NULL;
2677 request->rq_repbuf_len = 0;
2678 request->rq_repdata = NULL;
2679 request->rq_reqdata_len = 0;
2680 spin_unlock(&request->rq_early_free_lock);
2682 spin_unlock(&request->rq_lock);
2685 __ptlrpc_free_req(request, locked);
2691 * Drops one reference count for a request.
2693 void ptlrpc_req_finished(struct ptlrpc_request *request)
2695 __ptlrpc_req_finished(request, 0);
2697 EXPORT_SYMBOL(ptlrpc_req_finished);
2700 * Returns xid of a \a request
2702 __u64 ptlrpc_req_xid(struct ptlrpc_request *request)
2704 return request->rq_xid;
2706 EXPORT_SYMBOL(ptlrpc_req_xid);
2709 * Disengage the client's reply buffer from the network
2710 * NB does _NOT_ unregister any client-side bulk.
2711 * IDEMPOTENT, but _not_ safe against concurrent callers.
2712 * The request owner (i.e. the thread doing the I/O) must call...
2713 * Returns 0 on success or 1 if unregistering cannot be made.
2715 static int ptlrpc_unregister_reply(struct ptlrpc_request *request, int async)
2720 LASSERT(!in_interrupt());
2722 /* Let's setup deadline for reply unlink. */
2723 if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK) &&
2724 async && request->rq_reply_deadline == 0 && cfs_fail_val == 0)
2725 request->rq_reply_deadline = ktime_get_real_seconds() +
2729 * Nothing left to do.
2731 if (!ptlrpc_client_recv_or_unlink(request))
2734 LNetMDUnlink(request->rq_reply_md_h);
2737 * Let's check it once again.
2739 if (!ptlrpc_client_recv_or_unlink(request))
2742 /* Move to "Unregistering" phase as reply was not unlinked yet. */
2743 ptlrpc_rqphase_move(request, RQ_PHASE_UNREG_RPC);
2746 * Do not wait for unlink to finish.
2752 * We have to wait_event_idle_timeout() whatever the result, to get
2753 * a chance to run reply_in_callback(), and to make sure we've
2754 * unlinked before returning a req to the pool.
2757 wait_queue_head_t *wq = (request->rq_set) ?
2758 &request->rq_set->set_waitq :
2759 &request->rq_reply_waitq;
2760 int seconds = LONG_UNLINK;
2762 * Network access will complete in finite time but the HUGE
2763 * timeout lets us CWARN for visibility of sluggish NALs
2765 while (seconds > 0 &&
2766 wait_event_idle_timeout(
2768 !ptlrpc_client_recv_or_unlink(request),
2769 cfs_time_seconds(1)) == 0)
2772 ptlrpc_rqphase_move(request, request->rq_next_phase);
2776 DEBUG_REQ(D_WARNING, request,
2777 "Unexpectedly long timeout receiving_reply=%d req_ulinked=%d reply_unlinked=%d",
2778 request->rq_receiving_reply,
2779 request->rq_req_unlinked,
2780 request->rq_reply_unlinked);
2785 static void ptlrpc_free_request(struct ptlrpc_request *req)
2787 spin_lock(&req->rq_lock);
2789 spin_unlock(&req->rq_lock);
2791 if (req->rq_commit_cb)
2792 req->rq_commit_cb(req);
2793 list_del_init(&req->rq_replay_list);
2795 __ptlrpc_req_finished(req, 1);
2799 * the request is committed and dropped from the replay list of its import
2801 void ptlrpc_request_committed(struct ptlrpc_request *req, int force)
2803 struct obd_import *imp = req->rq_import;
2805 spin_lock(&imp->imp_lock);
2806 if (list_empty(&req->rq_replay_list)) {
2807 spin_unlock(&imp->imp_lock);
2811 if (force || req->rq_transno <= imp->imp_peer_committed_transno) {
2812 if (imp->imp_replay_cursor == &req->rq_replay_list)
2813 imp->imp_replay_cursor = req->rq_replay_list.next;
2814 ptlrpc_free_request(req);
2817 spin_unlock(&imp->imp_lock);
2819 EXPORT_SYMBOL(ptlrpc_request_committed);
2822 * Iterates through replay_list on import and prunes
2823 * all requests have transno smaller than last_committed for the
2824 * import and don't have rq_replay set.
2825 * Since requests are sorted in transno order, stops when meetign first
2826 * transno bigger than last_committed.
2827 * caller must hold imp->imp_lock
2829 void ptlrpc_free_committed(struct obd_import *imp)
2831 struct ptlrpc_request *req, *saved;
2832 struct ptlrpc_request *last_req = NULL; /* temporary fire escape */
2833 bool skip_committed_list = true;
2836 LASSERT(imp != NULL);
2837 assert_spin_locked(&imp->imp_lock);
2839 if (imp->imp_peer_committed_transno == imp->imp_last_transno_checked &&
2840 imp->imp_generation == imp->imp_last_generation_checked) {
2841 CDEBUG(D_INFO, "%s: skip recheck: last_committed %llu\n",
2842 imp->imp_obd->obd_name, imp->imp_peer_committed_transno);
2845 CDEBUG(D_RPCTRACE, "%s: committing for last_committed %llu gen %d\n",
2846 imp->imp_obd->obd_name, imp->imp_peer_committed_transno,
2847 imp->imp_generation);
2849 if (imp->imp_generation != imp->imp_last_generation_checked ||
2850 imp->imp_last_transno_checked == 0)
2851 skip_committed_list = false;
2853 imp->imp_last_transno_checked = imp->imp_peer_committed_transno;
2854 imp->imp_last_generation_checked = imp->imp_generation;
2856 list_for_each_entry_safe(req, saved, &imp->imp_replay_list,
2858 /* XXX ok to remove when 1357 resolved - rread 05/29/03 */
2859 LASSERT(req != last_req);
2862 if (req->rq_transno == 0) {
2863 DEBUG_REQ(D_EMERG, req, "zero transno during replay");
2866 if (req->rq_import_generation < imp->imp_generation) {
2867 DEBUG_REQ(D_RPCTRACE, req, "free request with old gen");
2871 /* not yet committed */
2872 if (req->rq_transno > imp->imp_peer_committed_transno) {
2873 DEBUG_REQ(D_RPCTRACE, req, "stopping search");
2877 if (req->rq_replay) {
2878 DEBUG_REQ(D_RPCTRACE, req, "keeping (FL_REPLAY)");
2879 list_move_tail(&req->rq_replay_list,
2880 &imp->imp_committed_list);
2884 DEBUG_REQ(D_INFO, req, "commit (last_committed %llu)",
2885 imp->imp_peer_committed_transno);
2887 ptlrpc_free_request(req);
2890 if (skip_committed_list)
2893 list_for_each_entry_safe(req, saved, &imp->imp_committed_list,
2895 LASSERT(req->rq_transno != 0);
2896 if (req->rq_import_generation < imp->imp_generation ||
2898 DEBUG_REQ(D_RPCTRACE, req, "free %s open request",
2899 req->rq_import_generation <
2900 imp->imp_generation ? "stale" : "closed");
2902 if (imp->imp_replay_cursor == &req->rq_replay_list)
2903 imp->imp_replay_cursor =
2904 req->rq_replay_list.next;
2906 ptlrpc_free_request(req);
2913 void ptlrpc_cleanup_client(struct obd_import *imp)
2920 * Schedule previously sent request for resend.
2921 * For bulk requests we assign new xid (to avoid problems with
2922 * lost replies and therefore several transfers landing into same buffer
2923 * from different sending attempts).
2925 void ptlrpc_resend_req(struct ptlrpc_request *req)
2927 DEBUG_REQ(D_HA, req, "going to resend");
2928 spin_lock(&req->rq_lock);
2931 * Request got reply but linked to the import list still.
2932 * Let ptlrpc_check_set() process it.
2934 if (ptlrpc_client_replied(req)) {
2935 spin_unlock(&req->rq_lock);
2936 DEBUG_REQ(D_HA, req, "it has reply, so skip it");
2940 req->rq_status = -EAGAIN;
2943 req->rq_net_err = 0;
2944 req->rq_timedout = 0;
2946 ptlrpc_client_wake_req(req);
2947 spin_unlock(&req->rq_lock);
2950 /* XXX: this function and rq_status are currently unused */
2951 void ptlrpc_restart_req(struct ptlrpc_request *req)
2953 DEBUG_REQ(D_HA, req, "restarting (possibly-)completed request");
2954 req->rq_status = -ERESTARTSYS;
2956 spin_lock(&req->rq_lock);
2957 req->rq_restart = 1;
2958 req->rq_timedout = 0;
2959 ptlrpc_client_wake_req(req);
2960 spin_unlock(&req->rq_lock);
2964 * Grab additional reference on a request \a req
2966 struct ptlrpc_request *ptlrpc_request_addref(struct ptlrpc_request *req)
2969 atomic_inc(&req->rq_refcount);
2972 EXPORT_SYMBOL(ptlrpc_request_addref);
2975 * Add a request to import replay_list.
2976 * Must be called under imp_lock
2978 void ptlrpc_retain_replayable_request(struct ptlrpc_request *req,
2979 struct obd_import *imp)
2981 struct list_head *tmp;
2983 assert_spin_locked(&imp->imp_lock);
2985 if (req->rq_transno == 0) {
2986 DEBUG_REQ(D_EMERG, req, "saving request with zero transno");
2991 * clear this for new requests that were resent as well
2992 * as resent replayed requests.
2994 lustre_msg_clear_flags(req->rq_reqmsg, MSG_RESENT);
2996 /* don't re-add requests that have been replayed */
2997 if (!list_empty(&req->rq_replay_list))
3000 lustre_msg_add_flags(req->rq_reqmsg, MSG_REPLAY);
3002 spin_lock(&req->rq_lock);
3004 spin_unlock(&req->rq_lock);
3006 LASSERT(imp->imp_replayable);
3007 /* Balanced in ptlrpc_free_committed, usually. */
3008 ptlrpc_request_addref(req);
3009 list_for_each_prev(tmp, &imp->imp_replay_list) {
3010 struct ptlrpc_request *iter = list_entry(tmp,
3011 struct ptlrpc_request,
3015 * We may have duplicate transnos if we create and then
3016 * open a file, or for closes retained if to match creating
3017 * opens, so use req->rq_xid as a secondary key.
3018 * (See bugs 684, 685, and 428.)
3019 * XXX no longer needed, but all opens need transnos!
3021 if (iter->rq_transno > req->rq_transno)
3024 if (iter->rq_transno == req->rq_transno) {
3025 LASSERT(iter->rq_xid != req->rq_xid);
3026 if (iter->rq_xid > req->rq_xid)
3030 list_add(&req->rq_replay_list, &iter->rq_replay_list);
3034 list_add(&req->rq_replay_list, &imp->imp_replay_list);
3038 * Send request and wait until it completes.
3039 * Returns request processing status.
3041 int ptlrpc_queue_wait(struct ptlrpc_request *req)
3043 struct ptlrpc_request_set *set;
3047 LASSERT(req->rq_set == NULL);
3048 LASSERT(!req->rq_receiving_reply);
3050 set = ptlrpc_prep_set();
3052 CERROR("cannot allocate ptlrpc set: rc = %d\n", -ENOMEM);
3056 /* for distributed debugging */
3057 lustre_msg_set_status(req->rq_reqmsg, current->pid);
3059 /* add a ref for the set (see comment in ptlrpc_set_add_req) */
3060 ptlrpc_request_addref(req);
3061 ptlrpc_set_add_req(set, req);
3062 rc = ptlrpc_set_wait(NULL, set);
3063 ptlrpc_set_destroy(set);
3067 EXPORT_SYMBOL(ptlrpc_queue_wait);
3070 * Callback used for replayed requests reply processing.
3071 * In case of successful reply calls registered request replay callback.
3072 * In case of error restart replay process.
3074 static int ptlrpc_replay_interpret(const struct lu_env *env,
3075 struct ptlrpc_request *req,
3078 struct ptlrpc_replay_async_args *aa = args;
3079 struct obd_import *imp = req->rq_import;
3082 atomic_dec(&imp->imp_replay_inflight);
3085 * Note: if it is bulk replay (MDS-MDS replay), then even if
3086 * server got the request, but bulk transfer timeout, let's
3087 * replay the bulk req again
3089 if (!ptlrpc_client_replied(req) ||
3091 lustre_msg_get_status(req->rq_repmsg) == -ETIMEDOUT)) {
3092 DEBUG_REQ(D_ERROR, req, "request replay timed out");
3093 GOTO(out, rc = -ETIMEDOUT);
3096 if (lustre_msg_get_type(req->rq_repmsg) == PTL_RPC_MSG_ERR &&
3097 (lustre_msg_get_status(req->rq_repmsg) == -ENOTCONN ||
3098 lustre_msg_get_status(req->rq_repmsg) == -ENODEV))
3099 GOTO(out, rc = lustre_msg_get_status(req->rq_repmsg));
3101 /** VBR: check version failure */
3102 if (lustre_msg_get_status(req->rq_repmsg) == -EOVERFLOW) {
3103 /** replay was failed due to version mismatch */
3104 DEBUG_REQ(D_WARNING, req, "Version mismatch during replay");
3105 spin_lock(&imp->imp_lock);
3106 imp->imp_vbr_failed = 1;
3107 spin_unlock(&imp->imp_lock);
3108 lustre_msg_set_status(req->rq_repmsg, aa->praa_old_status);
3110 /** The transno had better not change over replay. */
3111 LASSERTF(lustre_msg_get_transno(req->rq_reqmsg) ==
3112 lustre_msg_get_transno(req->rq_repmsg) ||
3113 lustre_msg_get_transno(req->rq_repmsg) == 0,
3115 lustre_msg_get_transno(req->rq_reqmsg),
3116 lustre_msg_get_transno(req->rq_repmsg));
3119 spin_lock(&imp->imp_lock);
3120 imp->imp_last_replay_transno = lustre_msg_get_transno(req->rq_reqmsg);
3121 spin_unlock(&imp->imp_lock);
3122 LASSERT(imp->imp_last_replay_transno);
3124 /* transaction number shouldn't be bigger than the latest replayed */
3125 if (req->rq_transno > lustre_msg_get_transno(req->rq_reqmsg)) {
3126 DEBUG_REQ(D_ERROR, req,
3127 "Reported transno=%llu is bigger than replayed=%llu",
3129 lustre_msg_get_transno(req->rq_reqmsg));
3130 GOTO(out, rc = -EINVAL);
3133 DEBUG_REQ(D_HA, req, "got reply");
3135 /* let the callback do fixups, possibly including in the request */
3136 if (req->rq_replay_cb)
3137 req->rq_replay_cb(req);
3139 if (ptlrpc_client_replied(req) &&
3140 lustre_msg_get_status(req->rq_repmsg) != aa->praa_old_status) {
3141 DEBUG_REQ(D_ERROR, req, "status %d, old was %d",
3142 lustre_msg_get_status(req->rq_repmsg),
3143 aa->praa_old_status);
3146 * Note: If the replay fails for MDT-MDT recovery, let's
3147 * abort all of the following requests in the replay
3148 * and sending list, because MDT-MDT update requests
3149 * are dependent on each other, see LU-7039
3151 if (imp->imp_connect_flags_orig & OBD_CONNECT_MDS_MDS) {
3152 struct ptlrpc_request *free_req;
3153 struct ptlrpc_request *tmp;
3155 spin_lock(&imp->imp_lock);
3156 list_for_each_entry_safe(free_req, tmp,
3157 &imp->imp_replay_list,
3159 ptlrpc_free_request(free_req);
3162 list_for_each_entry_safe(free_req, tmp,
3163 &imp->imp_committed_list,
3165 ptlrpc_free_request(free_req);
3168 list_for_each_entry_safe(free_req, tmp,
3169 &imp->imp_delayed_list,
3171 spin_lock(&free_req->rq_lock);
3172 free_req->rq_err = 1;
3173 free_req->rq_status = -EIO;
3174 ptlrpc_client_wake_req(free_req);
3175 spin_unlock(&free_req->rq_lock);
3178 list_for_each_entry_safe(free_req, tmp,
3179 &imp->imp_sending_list,
3181 spin_lock(&free_req->rq_lock);
3182 free_req->rq_err = 1;
3183 free_req->rq_status = -EIO;
3184 ptlrpc_client_wake_req(free_req);
3185 spin_unlock(&free_req->rq_lock);
3187 spin_unlock(&imp->imp_lock);
3190 /* Put it back for re-replay. */
3191 lustre_msg_set_status(req->rq_repmsg, aa->praa_old_status);
3195 * Errors while replay can set transno to 0, but
3196 * imp_last_replay_transno shouldn't be set to 0 anyway
3198 if (req->rq_transno == 0)
3199 CERROR("Transno is 0 during replay!\n");
3201 /* continue with recovery */
3202 rc = ptlrpc_import_recovery_state_machine(imp);
3204 req->rq_send_state = aa->praa_old_state;
3207 /* this replay failed, so restart recovery */
3208 ptlrpc_connect_import(imp);
3214 * Prepares and queues request for replay.
3215 * Adds it to ptlrpcd queue for actual sending.
3216 * Returns 0 on success.
3218 int ptlrpc_replay_req(struct ptlrpc_request *req)
3220 struct ptlrpc_replay_async_args *aa;
3224 LASSERT(req->rq_import->imp_state == LUSTRE_IMP_REPLAY);
3226 aa = ptlrpc_req_async_args(aa, req);
3227 memset(aa, 0, sizeof(*aa));
3229 /* Prepare request to be resent with ptlrpcd */
3230 aa->praa_old_state = req->rq_send_state;
3231 req->rq_send_state = LUSTRE_IMP_REPLAY;
3232 req->rq_phase = RQ_PHASE_NEW;
3233 req->rq_next_phase = RQ_PHASE_UNDEFINED;
3235 aa->praa_old_status = lustre_msg_get_status(req->rq_repmsg);
3237 req->rq_interpret_reply = ptlrpc_replay_interpret;
3238 /* Readjust the timeout for current conditions */
3239 ptlrpc_at_set_req_timeout(req);
3241 /* Tell server net_latency to calculate how long to wait for reply. */
3242 lustre_msg_set_service_timeout(req->rq_reqmsg,
3243 ptlrpc_at_get_net_latency(req));
3244 DEBUG_REQ(D_HA, req, "REPLAY");
3246 atomic_inc(&req->rq_import->imp_replay_inflight);
3247 spin_lock(&req->rq_lock);
3248 req->rq_early_free_repbuf = 0;
3249 spin_unlock(&req->rq_lock);
3250 ptlrpc_request_addref(req); /* ptlrpcd needs a ref */
3252 ptlrpcd_add_req(req);
3257 * Aborts all in-flight request on import \a imp sending and delayed lists
3259 void ptlrpc_abort_inflight(struct obd_import *imp)
3261 struct list_head *tmp, *n;
3265 * Make sure that no new requests get processed for this import.
3266 * ptlrpc_{queue,set}_wait must (and does) hold imp_lock while testing
3267 * this flag and then putting requests on sending_list or delayed_list.
3269 assert_spin_locked(&imp->imp_lock);
3272 * XXX locking? Maybe we should remove each request with the list
3273 * locked? Also, how do we know if the requests on the list are
3274 * being freed at this time?
3276 list_for_each_safe(tmp, n, &imp->imp_sending_list) {
3277 struct ptlrpc_request *req = list_entry(tmp,
3278 struct ptlrpc_request,
3281 DEBUG_REQ(D_RPCTRACE, req, "inflight");
3283 spin_lock(&req->rq_lock);
3284 if (req->rq_import_generation < imp->imp_generation) {
3286 req->rq_status = -EIO;
3287 ptlrpc_client_wake_req(req);
3289 spin_unlock(&req->rq_lock);
3292 list_for_each_safe(tmp, n, &imp->imp_delayed_list) {
3293 struct ptlrpc_request *req =
3294 list_entry(tmp, struct ptlrpc_request, rq_list);
3296 DEBUG_REQ(D_RPCTRACE, req, "aborting waiting req");
3298 spin_lock(&req->rq_lock);
3299 if (req->rq_import_generation < imp->imp_generation) {
3301 req->rq_status = -EIO;
3302 ptlrpc_client_wake_req(req);
3304 spin_unlock(&req->rq_lock);
3308 * Last chance to free reqs left on the replay list, but we
3309 * will still leak reqs that haven't committed.
3311 if (imp->imp_replayable)
3312 ptlrpc_free_committed(imp);
3318 * Abort all uncompleted requests in request set \a set
3320 void ptlrpc_abort_set(struct ptlrpc_request_set *set)
3322 struct list_head *tmp, *pos;
3324 LASSERT(set != NULL);
3326 list_for_each_safe(pos, tmp, &set->set_requests) {
3327 struct ptlrpc_request *req =
3328 list_entry(pos, struct ptlrpc_request,
3331 spin_lock(&req->rq_lock);
3332 if (req->rq_phase != RQ_PHASE_RPC) {
3333 spin_unlock(&req->rq_lock);
3338 req->rq_status = -EINTR;
3339 ptlrpc_client_wake_req(req);
3340 spin_unlock(&req->rq_lock);
3345 * Initialize the XID for the node. This is common among all requests on
3346 * this node, and only requires the property that it is monotonically
3347 * increasing. It does not need to be sequential. Since this is also used
3348 * as the RDMA match bits, it is important that a single client NOT have
3349 * the same match bits for two different in-flight requests, hence we do
3350 * NOT want to have an XID per target or similar.
3352 * To avoid an unlikely collision between match bits after a client reboot
3353 * (which would deliver old data into the wrong RDMA buffer) initialize
3354 * the XID based on the current time, assuming a maximum RPC rate of 1M RPC/s.
3355 * If the time is clearly incorrect, we instead use a 62-bit random number.
3356 * In the worst case the random number will overflow 1M RPCs per second in
3357 * 9133 years, or permutations thereof.
3359 #define YEAR_2004 (1ULL << 30)
3360 void ptlrpc_init_xid(void)
3362 time64_t now = ktime_get_real_seconds();
3365 if (now < YEAR_2004) {
3366 get_random_bytes(&xid, sizeof(xid));
3368 xid |= (1ULL << 61);
3370 xid = (u64)now << 20;
3373 /* Need to always be aligned to a power-of-two for mutli-bulk BRW */
3374 BUILD_BUG_ON((PTLRPC_BULK_OPS_COUNT & (PTLRPC_BULK_OPS_COUNT - 1)) !=
3376 xid &= PTLRPC_BULK_OPS_MASK;
3377 atomic64_set(&ptlrpc_last_xid, xid);
3381 * Increase xid and returns resulting new value to the caller.
3383 * Multi-bulk BRW RPCs consume multiple XIDs for each bulk transfer, starting
3384 * at the returned xid, up to xid + PTLRPC_BULK_OPS_COUNT - 1. The BRW RPC
3385 * itself uses the last bulk xid needed, so the server can determine the
3386 * the number of bulk transfers from the RPC XID and a bitmask. The starting
3387 * xid must align to a power-of-two value.
3389 * This is assumed to be true due to the initial ptlrpc_last_xid
3390 * value also being initialized to a power-of-two value. LU-1431
3392 __u64 ptlrpc_next_xid(void)
3394 return atomic64_add_return(PTLRPC_BULK_OPS_COUNT, &ptlrpc_last_xid);
3398 * If request has a new allocated XID (new request or EINPROGRESS resend),
3399 * use this XID as matchbits of bulk, otherwise allocate a new matchbits for
3400 * request to ensure previous bulk fails and avoid problems with lost replies
3401 * and therefore several transfers landing into the same buffer from different
3404 void ptlrpc_set_bulk_mbits(struct ptlrpc_request *req)
3406 struct ptlrpc_bulk_desc *bd = req->rq_bulk;
3408 LASSERT(bd != NULL);
3411 * Generate new matchbits for all resend requests, including
3414 if (req->rq_resend) {
3415 __u64 old_mbits = req->rq_mbits;
3418 * First time resend on -EINPROGRESS will generate new xid,
3419 * so we can actually use the rq_xid as rq_mbits in such case,
3420 * however, it's bit hard to distinguish such resend with a
3421 * 'resend for the -EINPROGRESS resend'. To make it simple,
3422 * we opt to generate mbits for all resend cases.
3424 if (OCD_HAS_FLAG(&bd->bd_import->imp_connect_data,
3426 req->rq_mbits = ptlrpc_next_xid();
3429 * Old version transfers rq_xid to peer as
3432 spin_lock(&req->rq_import->imp_lock);
3433 list_del_init(&req->rq_unreplied_list);
3434 ptlrpc_assign_next_xid_nolock(req);
3435 spin_unlock(&req->rq_import->imp_lock);
3436 req->rq_mbits = req->rq_xid;
3438 CDEBUG(D_HA, "resend bulk old x%llu new x%llu\n",
3439 old_mbits, req->rq_mbits);
3440 } else if (!(lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)) {
3441 /* Request being sent first time, use xid as matchbits. */
3442 if (OCD_HAS_FLAG(&bd->bd_import->imp_connect_data, BULK_MBITS)
3443 || req->rq_mbits == 0) {
3444 req->rq_mbits = req->rq_xid;
3446 int total_md = (bd->bd_iov_count + LNET_MAX_IOV - 1) /
3448 req->rq_mbits -= total_md - 1;
3452 * Replay request, xid and matchbits have already been
3453 * correctly assigned.
3459 * For multi-bulk RPCs, rq_mbits is the last mbits needed for bulks so
3460 * that server can infer the number of bulks that were prepared,
3463 req->rq_mbits += ((bd->bd_iov_count + LNET_MAX_IOV - 1) /
3467 * Set rq_xid as rq_mbits to indicate the final bulk for the old
3468 * server which does not support OBD_CONNECT_BULK_MBITS. LU-6808.
3470 * It's ok to directly set the rq_xid here, since this xid bump
3471 * won't affect the request position in unreplied list.
3473 if (!OCD_HAS_FLAG(&bd->bd_import->imp_connect_data, BULK_MBITS))
3474 req->rq_xid = req->rq_mbits;
3478 * Get a glimpse at what next xid value might have been.
3479 * Returns possible next xid.
3481 __u64 ptlrpc_sample_next_xid(void)
3483 return atomic64_read(&ptlrpc_last_xid) + PTLRPC_BULK_OPS_COUNT;
3485 EXPORT_SYMBOL(ptlrpc_sample_next_xid);
3488 * Functions for operating ptlrpc workers.
3490 * A ptlrpc work is a function which will be running inside ptlrpc context.
3491 * The callback shouldn't sleep otherwise it will block that ptlrpcd thread.
3493 * 1. after a work is created, it can be used many times, that is:
3494 * handler = ptlrpcd_alloc_work();
3495 * ptlrpcd_queue_work();
3497 * queue it again when necessary:
3498 * ptlrpcd_queue_work();
3499 * ptlrpcd_destroy_work();
3500 * 2. ptlrpcd_queue_work() can be called by multiple processes meanwhile, but
3501 * it will only be queued once in any time. Also as its name implies, it may
3502 * have delay before it really runs by ptlrpcd thread.
3504 struct ptlrpc_work_async_args {
3505 int (*cb)(const struct lu_env *, void *);
3509 static void ptlrpcd_add_work_req(struct ptlrpc_request *req)
3511 /* re-initialize the req */
3512 req->rq_timeout = obd_timeout;
3513 req->rq_sent = ktime_get_real_seconds();
3514 req->rq_deadline = req->rq_sent + req->rq_timeout;
3515 req->rq_phase = RQ_PHASE_INTERPRET;
3516 req->rq_next_phase = RQ_PHASE_COMPLETE;
3517 req->rq_xid = ptlrpc_next_xid();
3518 req->rq_import_generation = req->rq_import->imp_generation;
3520 ptlrpcd_add_req(req);
3523 static int work_interpreter(const struct lu_env *env,
3524 struct ptlrpc_request *req, void *args, int rc)
3526 struct ptlrpc_work_async_args *arg = args;
3528 LASSERT(ptlrpcd_check_work(req));
3529 LASSERT(arg->cb != NULL);
3531 rc = arg->cb(env, arg->cbdata);
3533 list_del_init(&req->rq_set_chain);
3536 if (atomic_dec_return(&req->rq_refcount) > 1) {
3537 atomic_set(&req->rq_refcount, 2);
3538 ptlrpcd_add_work_req(req);
3543 static int worker_format;
3545 static int ptlrpcd_check_work(struct ptlrpc_request *req)
3547 return req->rq_pill.rc_fmt == (void *)&worker_format;
3551 * Create a work for ptlrpc.
3553 void *ptlrpcd_alloc_work(struct obd_import *imp,
3554 int (*cb)(const struct lu_env *, void *), void *cbdata)
3556 struct ptlrpc_request *req = NULL;
3557 struct ptlrpc_work_async_args *args;
3563 RETURN(ERR_PTR(-EINVAL));
3565 /* copy some code from deprecated fakereq. */
3566 req = ptlrpc_request_cache_alloc(GFP_NOFS);
3568 CERROR("ptlrpc: run out of memory!\n");
3569 RETURN(ERR_PTR(-ENOMEM));
3572 ptlrpc_cli_req_init(req);
3574 req->rq_send_state = LUSTRE_IMP_FULL;
3575 req->rq_type = PTL_RPC_MSG_REQUEST;
3576 req->rq_import = class_import_get(imp);
3577 req->rq_interpret_reply = work_interpreter;
3578 /* don't want reply */
3579 req->rq_no_delay = req->rq_no_resend = 1;
3580 req->rq_pill.rc_fmt = (void *)&worker_format;
3582 args = ptlrpc_req_async_args(args, req);
3584 args->cbdata = cbdata;
3588 EXPORT_SYMBOL(ptlrpcd_alloc_work);
3590 void ptlrpcd_destroy_work(void *handler)
3592 struct ptlrpc_request *req = handler;
3595 ptlrpc_req_finished(req);
3597 EXPORT_SYMBOL(ptlrpcd_destroy_work);
3599 int ptlrpcd_queue_work(void *handler)
3601 struct ptlrpc_request *req = handler;
3604 * Check if the req is already being queued.
3606 * Here comes a trick: it lacks a way of checking if a req is being
3607 * processed reliably in ptlrpc. Here I have to use refcount of req
3608 * for this purpose. This is okay because the caller should use this
3609 * req as opaque data. - Jinshan
3611 LASSERT(atomic_read(&req->rq_refcount) > 0);
3612 if (atomic_inc_return(&req->rq_refcount) == 2)
3613 ptlrpcd_add_work_req(req);
3616 EXPORT_SYMBOL(ptlrpcd_queue_work);