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(BD_GET_KIOV(desc, i).kiov_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 const struct ptlrpc_bulk_frag_ops ptlrpc_bulk_kvec_ops = {
108 .add_iov_frag = ptlrpc_prep_bulk_frag,
110 EXPORT_SYMBOL(ptlrpc_bulk_kvec_ops);
112 static int ptlrpc_send_new_req(struct ptlrpc_request *req);
113 static int ptlrpcd_check_work(struct ptlrpc_request *req);
114 static int ptlrpc_unregister_reply(struct ptlrpc_request *request, int async);
117 * Initialize passed in client structure \a cl.
119 void ptlrpc_init_client(int req_portal, int rep_portal, const char *name,
120 struct ptlrpc_client *cl)
122 cl->cli_request_portal = req_portal;
123 cl->cli_reply_portal = rep_portal;
126 EXPORT_SYMBOL(ptlrpc_init_client);
129 * Return PortalRPC connection for remore uud \a uuid
131 struct ptlrpc_connection *ptlrpc_uuid_to_connection(struct obd_uuid *uuid,
132 lnet_nid_t nid4refnet)
134 struct ptlrpc_connection *c;
136 struct lnet_process_id peer;
140 * ptlrpc_uuid_to_peer() initializes its 2nd parameter
141 * before accessing its values.
143 /* coverity[uninit_use_in_call] */
144 peer.nid = nid4refnet;
145 err = ptlrpc_uuid_to_peer(uuid, &peer, &self);
147 CNETERR("cannot find peer %s!\n", uuid->uuid);
151 c = ptlrpc_connection_get(peer, self, uuid);
153 memcpy(c->c_remote_uuid.uuid,
154 uuid->uuid, sizeof(c->c_remote_uuid.uuid));
157 CDEBUG(D_INFO, "%s -> %p\n", uuid->uuid, c);
163 * Allocate and initialize new bulk descriptor on the sender.
164 * Returns pointer to the descriptor or NULL on error.
166 struct ptlrpc_bulk_desc *ptlrpc_new_bulk(unsigned int nfrags,
167 unsigned int max_brw,
168 enum ptlrpc_bulk_op_type type,
170 const struct ptlrpc_bulk_frag_ops *ops)
172 struct ptlrpc_bulk_desc *desc;
175 /* ensure that only one of KIOV or IOVEC is set but not both */
176 LASSERT((ptlrpc_is_bulk_desc_kiov(type) &&
177 ops->add_kiov_frag != NULL) ||
178 (ptlrpc_is_bulk_desc_kvec(type) &&
179 ops->add_iov_frag != NULL));
184 if (type & PTLRPC_BULK_BUF_KIOV) {
185 OBD_ALLOC_LARGE(GET_KIOV(desc),
186 nfrags * sizeof(*GET_KIOV(desc)));
190 OBD_ALLOC_LARGE(GET_KVEC(desc),
191 nfrags * sizeof(*GET_KVEC(desc)));
196 spin_lock_init(&desc->bd_lock);
197 init_waitqueue_head(&desc->bd_waitq);
198 desc->bd_max_iov = nfrags;
199 desc->bd_iov_count = 0;
200 desc->bd_portal = portal;
201 desc->bd_type = type;
202 desc->bd_md_count = 0;
203 desc->bd_frag_ops = ops;
204 LASSERT(max_brw > 0);
205 desc->bd_md_max_brw = min(max_brw, PTLRPC_BULK_OPS_COUNT);
207 * PTLRPC_BULK_OPS_COUNT is the compile-time transfer limit for this
208 * node. Negotiated ocd_brw_size will always be <= this number.
210 for (i = 0; i < PTLRPC_BULK_OPS_COUNT; i++)
211 LNetInvalidateMDHandle(&desc->bd_mds[i]);
220 * Prepare bulk descriptor for specified outgoing request \a req that
221 * can fit \a nfrags * pages. \a type is bulk type. \a portal is where
222 * the bulk to be sent. Used on client-side.
223 * Returns pointer to newly allocatrd initialized bulk descriptor or NULL on
226 struct ptlrpc_bulk_desc *ptlrpc_prep_bulk_imp(struct ptlrpc_request *req,
228 unsigned int max_brw,
231 const struct ptlrpc_bulk_frag_ops
234 struct obd_import *imp = req->rq_import;
235 struct ptlrpc_bulk_desc *desc;
238 LASSERT(ptlrpc_is_bulk_op_passive(type));
240 desc = ptlrpc_new_bulk(nfrags, max_brw, type, portal, ops);
244 desc->bd_import = class_import_get(imp);
247 desc->bd_cbid.cbid_fn = client_bulk_callback;
248 desc->bd_cbid.cbid_arg = desc;
250 /* This makes req own desc, and free it when she frees herself */
255 EXPORT_SYMBOL(ptlrpc_prep_bulk_imp);
257 void __ptlrpc_prep_bulk_page(struct ptlrpc_bulk_desc *desc,
258 struct page *page, int pageoffset, int len,
263 LASSERT(desc->bd_iov_count < desc->bd_max_iov);
264 LASSERT(page != NULL);
265 LASSERT(pageoffset >= 0);
267 LASSERT(pageoffset + len <= PAGE_SIZE);
268 LASSERT(ptlrpc_is_bulk_desc_kiov(desc->bd_type));
270 kiov = &BD_GET_KIOV(desc, desc->bd_iov_count);
277 kiov->kiov_page = page;
278 kiov->kiov_offset = pageoffset;
279 kiov->kiov_len = len;
281 desc->bd_iov_count++;
283 EXPORT_SYMBOL(__ptlrpc_prep_bulk_page);
285 int ptlrpc_prep_bulk_frag(struct ptlrpc_bulk_desc *desc,
292 LASSERT(desc->bd_iov_count < desc->bd_max_iov);
293 LASSERT(frag != NULL);
295 LASSERT(ptlrpc_is_bulk_desc_kvec(desc->bd_type));
297 iovec = &BD_GET_KVEC(desc, desc->bd_iov_count);
301 iovec->iov_base = frag;
302 iovec->iov_len = len;
304 desc->bd_iov_count++;
306 RETURN(desc->bd_nob);
308 EXPORT_SYMBOL(ptlrpc_prep_bulk_frag);
310 void ptlrpc_free_bulk(struct ptlrpc_bulk_desc *desc)
314 LASSERT(desc != NULL);
315 LASSERT(desc->bd_iov_count != LI_POISON); /* not freed already */
316 LASSERT(desc->bd_md_count == 0); /* network hands off */
317 LASSERT((desc->bd_export != NULL) ^ (desc->bd_import != NULL));
318 LASSERT(desc->bd_frag_ops != NULL);
320 if (ptlrpc_is_bulk_desc_kiov(desc->bd_type))
321 sptlrpc_enc_pool_put_pages(desc);
324 class_export_put(desc->bd_export);
326 class_import_put(desc->bd_import);
328 if (desc->bd_frag_ops->release_frags != NULL)
329 desc->bd_frag_ops->release_frags(desc);
331 if (ptlrpc_is_bulk_desc_kiov(desc->bd_type))
332 OBD_FREE_LARGE(GET_KIOV(desc),
333 desc->bd_max_iov * sizeof(*GET_KIOV(desc)));
335 OBD_FREE_LARGE(GET_KVEC(desc),
336 desc->bd_max_iov * sizeof(*GET_KVEC(desc)));
340 EXPORT_SYMBOL(ptlrpc_free_bulk);
343 * Set server timelimit for this req, i.e. how long are we willing to wait
344 * for reply before timing out this request.
346 void ptlrpc_at_set_req_timeout(struct ptlrpc_request *req)
352 LASSERT(req->rq_import);
355 /* non-AT settings */
357 * \a imp_server_timeout means this is reverse import and
358 * we send (currently only) ASTs to the client and cannot afford
359 * to wait too long for the reply, otherwise the other client
360 * (because of which we are sending this request) would
361 * timeout waiting for us
363 req->rq_timeout = req->rq_import->imp_server_timeout ?
364 obd_timeout / 2 : obd_timeout;
366 at = &req->rq_import->imp_at;
367 idx = import_at_get_index(req->rq_import,
368 req->rq_request_portal);
369 serv_est = at_get(&at->iat_service_estimate[idx]);
370 req->rq_timeout = at_est2timeout(serv_est);
373 * We could get even fancier here, using history to predict increased
378 * Let the server know what this RPC timeout is by putting it in the
381 lustre_msg_set_timeout(req->rq_reqmsg, req->rq_timeout);
383 EXPORT_SYMBOL(ptlrpc_at_set_req_timeout);
385 /* Adjust max service estimate based on server value */
386 static void ptlrpc_at_adj_service(struct ptlrpc_request *req,
387 unsigned int serv_est)
393 LASSERT(req->rq_import);
394 at = &req->rq_import->imp_at;
396 idx = import_at_get_index(req->rq_import, req->rq_request_portal);
398 * max service estimates are tracked on the server side,
399 * so just keep minimal history here
401 oldse = at_measured(&at->iat_service_estimate[idx], serv_est);
404 "The RPC service estimate for %s ptl %d has changed from %d to %d\n",
405 req->rq_import->imp_obd->obd_name,
406 req->rq_request_portal,
407 oldse, at_get(&at->iat_service_estimate[idx]));
410 /* Expected network latency per remote node (secs) */
411 int ptlrpc_at_get_net_latency(struct ptlrpc_request *req)
413 return AT_OFF ? 0 : at_get(&req->rq_import->imp_at.iat_net_latency);
416 /* Adjust expected network latency */
417 void ptlrpc_at_adj_net_latency(struct ptlrpc_request *req,
418 unsigned int service_time)
420 unsigned int nl, oldnl;
422 time64_t now = ktime_get_real_seconds();
424 LASSERT(req->rq_import);
426 if (service_time > now - req->rq_sent + 3) {
428 * b=16408, however, this can also happen if early reply
429 * is lost and client RPC is expired and resent, early reply
430 * or reply of original RPC can still be fit in reply buffer
431 * of resent RPC, now client is measuring time from the
432 * resent time, but server sent back service time of original
435 CDEBUG((lustre_msg_get_flags(req->rq_reqmsg) & MSG_RESENT) ?
436 D_ADAPTTO : D_WARNING,
437 "Reported service time %u > total measured time %lld\n",
438 service_time, now - req->rq_sent);
442 /* Network latency is total time less server processing time */
443 nl = max_t(int, now - req->rq_sent -
444 service_time, 0) + 1; /* st rounding */
445 at = &req->rq_import->imp_at;
447 oldnl = at_measured(&at->iat_net_latency, nl);
450 "The network latency for %s (nid %s) has changed from %d to %d\n",
451 req->rq_import->imp_obd->obd_name,
452 obd_uuid2str(&req->rq_import->imp_connection->c_remote_uuid),
453 oldnl, at_get(&at->iat_net_latency));
456 static int unpack_reply(struct ptlrpc_request *req)
460 if (SPTLRPC_FLVR_POLICY(req->rq_flvr.sf_rpc) != SPTLRPC_POLICY_NULL) {
461 rc = ptlrpc_unpack_rep_msg(req, req->rq_replen);
463 DEBUG_REQ(D_ERROR, req, "unpack_rep failed: rc = %d",
469 rc = lustre_unpack_rep_ptlrpc_body(req, MSG_PTLRPC_BODY_OFF);
471 DEBUG_REQ(D_ERROR, req, "unpack ptlrpc body failed: rc = %d",
479 * Handle an early reply message, called with the rq_lock held.
480 * If anything goes wrong just ignore it - same as if it never happened
482 static int ptlrpc_at_recv_early_reply(struct ptlrpc_request *req)
483 __must_hold(&req->rq_lock)
485 struct ptlrpc_request *early_req;
491 spin_unlock(&req->rq_lock);
493 rc = sptlrpc_cli_unwrap_early_reply(req, &early_req);
495 spin_lock(&req->rq_lock);
499 rc = unpack_reply(early_req);
501 sptlrpc_cli_finish_early_reply(early_req);
502 spin_lock(&req->rq_lock);
507 * Use new timeout value just to adjust the local value for this
508 * request, don't include it into at_history. It is unclear yet why
509 * service time increased and should it be counted or skipped, e.g.
510 * that can be recovery case or some error or server, the real reply
511 * will add all new data if it is worth to add.
513 req->rq_timeout = lustre_msg_get_timeout(early_req->rq_repmsg);
514 lustre_msg_set_timeout(req->rq_reqmsg, req->rq_timeout);
516 /* Network latency can be adjusted, it is pure network delays */
517 ptlrpc_at_adj_net_latency(req,
518 lustre_msg_get_service_time(early_req->rq_repmsg));
520 sptlrpc_cli_finish_early_reply(early_req);
522 spin_lock(&req->rq_lock);
523 olddl = req->rq_deadline;
525 * server assumes it now has rq_timeout from when the request
526 * arrived, so the client should give it at least that long.
527 * since we don't know the arrival time we'll use the original
530 req->rq_deadline = req->rq_sent + req->rq_timeout +
531 ptlrpc_at_get_net_latency(req);
533 /* The below message is checked in replay-single.sh test_65{a,b} */
534 /* The below message is checked in sanity-{gss,krb5} test_8 */
535 DEBUG_REQ(D_ADAPTTO, req,
536 "Early reply #%d, new deadline in %llds (%llds)",
538 req->rq_deadline - ktime_get_real_seconds(),
539 req->rq_deadline - olddl);
544 static struct kmem_cache *request_cache;
546 int ptlrpc_request_cache_init(void)
548 request_cache = kmem_cache_create("ptlrpc_cache",
549 sizeof(struct ptlrpc_request),
550 0, SLAB_HWCACHE_ALIGN, NULL);
551 return request_cache ? 0 : -ENOMEM;
554 void ptlrpc_request_cache_fini(void)
556 kmem_cache_destroy(request_cache);
559 struct ptlrpc_request *ptlrpc_request_cache_alloc(gfp_t flags)
561 struct ptlrpc_request *req;
563 OBD_SLAB_ALLOC_PTR_GFP(req, request_cache, flags);
567 void ptlrpc_request_cache_free(struct ptlrpc_request *req)
569 OBD_SLAB_FREE_PTR(req, request_cache);
573 * Wind down request pool \a pool.
574 * Frees all requests from the pool too
576 void ptlrpc_free_rq_pool(struct ptlrpc_request_pool *pool)
578 struct list_head *l, *tmp;
579 struct ptlrpc_request *req;
581 LASSERT(pool != NULL);
583 spin_lock(&pool->prp_lock);
584 list_for_each_safe(l, tmp, &pool->prp_req_list) {
585 req = list_entry(l, struct ptlrpc_request, rq_list);
586 list_del(&req->rq_list);
587 LASSERT(req->rq_reqbuf);
588 LASSERT(req->rq_reqbuf_len == pool->prp_rq_size);
589 OBD_FREE_LARGE(req->rq_reqbuf, pool->prp_rq_size);
590 ptlrpc_request_cache_free(req);
592 spin_unlock(&pool->prp_lock);
593 OBD_FREE(pool, sizeof(*pool));
595 EXPORT_SYMBOL(ptlrpc_free_rq_pool);
598 * Allocates, initializes and adds \a num_rq requests to the pool \a pool
600 int ptlrpc_add_rqs_to_pool(struct ptlrpc_request_pool *pool, int num_rq)
605 while (size < pool->prp_rq_size)
608 LASSERTF(list_empty(&pool->prp_req_list) ||
609 size == pool->prp_rq_size,
610 "Trying to change pool size with nonempty pool from %d to %d bytes\n",
611 pool->prp_rq_size, size);
613 pool->prp_rq_size = size;
614 for (i = 0; i < num_rq; i++) {
615 struct ptlrpc_request *req;
616 struct lustre_msg *msg;
618 req = ptlrpc_request_cache_alloc(GFP_NOFS);
621 OBD_ALLOC_LARGE(msg, size);
623 ptlrpc_request_cache_free(req);
626 req->rq_reqbuf = msg;
627 req->rq_reqbuf_len = size;
629 spin_lock(&pool->prp_lock);
630 list_add_tail(&req->rq_list, &pool->prp_req_list);
631 spin_unlock(&pool->prp_lock);
635 EXPORT_SYMBOL(ptlrpc_add_rqs_to_pool);
638 * Create and initialize new request pool with given attributes:
639 * \a num_rq - initial number of requests to create for the pool
640 * \a msgsize - maximum message size possible for requests in thid pool
641 * \a populate_pool - function to be called when more requests need to be added
643 * Returns pointer to newly created pool or NULL on error.
645 struct ptlrpc_request_pool *
646 ptlrpc_init_rq_pool(int num_rq, int msgsize,
647 int (*populate_pool)(struct ptlrpc_request_pool *, int))
649 struct ptlrpc_request_pool *pool;
656 * Request next power of two for the allocation, because internally
657 * kernel would do exactly this
659 spin_lock_init(&pool->prp_lock);
660 INIT_LIST_HEAD(&pool->prp_req_list);
661 pool->prp_rq_size = msgsize + SPTLRPC_MAX_PAYLOAD;
662 pool->prp_populate = populate_pool;
664 populate_pool(pool, num_rq);
668 EXPORT_SYMBOL(ptlrpc_init_rq_pool);
671 * Fetches one request from pool \a pool
673 static struct ptlrpc_request *
674 ptlrpc_prep_req_from_pool(struct ptlrpc_request_pool *pool)
676 struct ptlrpc_request *request;
677 struct lustre_msg *reqbuf;
682 spin_lock(&pool->prp_lock);
685 * See if we have anything in a pool, and bail out if nothing,
686 * in writeout path, where this matters, this is safe to do, because
687 * nothing is lost in this case, and when some in-flight requests
688 * complete, this code will be called again.
690 if (unlikely(list_empty(&pool->prp_req_list))) {
691 spin_unlock(&pool->prp_lock);
695 request = list_entry(pool->prp_req_list.next, struct ptlrpc_request,
697 list_del_init(&request->rq_list);
698 spin_unlock(&pool->prp_lock);
700 LASSERT(request->rq_reqbuf);
701 LASSERT(request->rq_pool);
703 reqbuf = request->rq_reqbuf;
704 memset(request, 0, sizeof(*request));
705 request->rq_reqbuf = reqbuf;
706 request->rq_reqbuf_len = pool->prp_rq_size;
707 request->rq_pool = pool;
713 * Returns freed \a request to pool.
715 static void __ptlrpc_free_req_to_pool(struct ptlrpc_request *request)
717 struct ptlrpc_request_pool *pool = request->rq_pool;
719 spin_lock(&pool->prp_lock);
720 LASSERT(list_empty(&request->rq_list));
721 LASSERT(!request->rq_receiving_reply);
722 list_add_tail(&request->rq_list, &pool->prp_req_list);
723 spin_unlock(&pool->prp_lock);
726 void ptlrpc_add_unreplied(struct ptlrpc_request *req)
728 struct obd_import *imp = req->rq_import;
729 struct list_head *tmp;
730 struct ptlrpc_request *iter;
732 assert_spin_locked(&imp->imp_lock);
733 LASSERT(list_empty(&req->rq_unreplied_list));
735 /* unreplied list is sorted by xid in ascending order */
736 list_for_each_prev(tmp, &imp->imp_unreplied_list) {
737 iter = list_entry(tmp, struct ptlrpc_request,
740 LASSERT(req->rq_xid != iter->rq_xid);
741 if (req->rq_xid < iter->rq_xid)
743 list_add(&req->rq_unreplied_list, &iter->rq_unreplied_list);
746 list_add(&req->rq_unreplied_list, &imp->imp_unreplied_list);
749 void ptlrpc_assign_next_xid_nolock(struct ptlrpc_request *req)
751 req->rq_xid = ptlrpc_next_xid();
752 ptlrpc_add_unreplied(req);
755 static inline void ptlrpc_assign_next_xid(struct ptlrpc_request *req)
757 spin_lock(&req->rq_import->imp_lock);
758 ptlrpc_assign_next_xid_nolock(req);
759 spin_unlock(&req->rq_import->imp_lock);
762 static atomic64_t ptlrpc_last_xid;
764 static void ptlrpc_reassign_next_xid(struct ptlrpc_request *req)
766 spin_lock(&req->rq_import->imp_lock);
767 list_del_init(&req->rq_unreplied_list);
768 ptlrpc_assign_next_xid_nolock(req);
769 spin_unlock(&req->rq_import->imp_lock);
770 DEBUG_REQ(D_RPCTRACE, req, "reassign xid");
773 void ptlrpc_get_mod_rpc_slot(struct ptlrpc_request *req)
775 struct client_obd *cli = &req->rq_import->imp_obd->u.cli;
779 opc = lustre_msg_get_opc(req->rq_reqmsg);
780 tag = obd_get_mod_rpc_slot(cli, opc);
781 lustre_msg_set_tag(req->rq_reqmsg, tag);
782 ptlrpc_reassign_next_xid(req);
784 EXPORT_SYMBOL(ptlrpc_get_mod_rpc_slot);
786 void ptlrpc_put_mod_rpc_slot(struct ptlrpc_request *req)
788 __u16 tag = lustre_msg_get_tag(req->rq_reqmsg);
791 struct client_obd *cli = &req->rq_import->imp_obd->u.cli;
792 __u32 opc = lustre_msg_get_opc(req->rq_reqmsg);
794 obd_put_mod_rpc_slot(cli, opc, tag);
797 EXPORT_SYMBOL(ptlrpc_put_mod_rpc_slot);
799 int ptlrpc_request_bufs_pack(struct ptlrpc_request *request,
800 __u32 version, int opcode, char **bufs,
801 struct ptlrpc_cli_ctx *ctx)
804 struct obd_import *imp;
810 count = req_capsule_filled_sizes(&request->rq_pill, RCL_CLIENT);
811 imp = request->rq_import;
812 lengths = request->rq_pill.rc_area[RCL_CLIENT];
815 request->rq_cli_ctx = sptlrpc_cli_ctx_get(ctx);
817 rc = sptlrpc_req_get_ctx(request);
821 sptlrpc_req_set_flavor(request, opcode);
823 rc = lustre_pack_request(request, imp->imp_msg_magic, count,
828 lustre_msg_add_version(request->rq_reqmsg, version);
829 request->rq_send_state = LUSTRE_IMP_FULL;
830 request->rq_type = PTL_RPC_MSG_REQUEST;
832 request->rq_req_cbid.cbid_fn = request_out_callback;
833 request->rq_req_cbid.cbid_arg = request;
835 request->rq_reply_cbid.cbid_fn = reply_in_callback;
836 request->rq_reply_cbid.cbid_arg = request;
838 request->rq_reply_deadline = 0;
839 request->rq_bulk_deadline = 0;
840 request->rq_req_deadline = 0;
841 request->rq_phase = RQ_PHASE_NEW;
842 request->rq_next_phase = RQ_PHASE_UNDEFINED;
844 request->rq_request_portal = imp->imp_client->cli_request_portal;
845 request->rq_reply_portal = imp->imp_client->cli_reply_portal;
847 ptlrpc_at_set_req_timeout(request);
849 lustre_msg_set_opc(request->rq_reqmsg, opcode);
851 /* Let's setup deadline for req/reply/bulk unlink for opcode. */
852 if (cfs_fail_val == opcode) {
853 time64_t *fail_t = NULL, *fail2_t = NULL;
855 if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK)) {
856 fail_t = &request->rq_bulk_deadline;
857 } else if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK)) {
858 fail_t = &request->rq_reply_deadline;
859 } else if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REQ_UNLINK)) {
860 fail_t = &request->rq_req_deadline;
861 } else if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BOTH_UNLINK)) {
862 fail_t = &request->rq_reply_deadline;
863 fail2_t = &request->rq_bulk_deadline;
864 } else if (CFS_FAIL_CHECK(OBD_FAIL_PTLRPC_ROUND_XID)) {
865 time64_t now = ktime_get_real_seconds();
866 u64 xid = ((u64)now >> 4) << 24;
868 atomic64_set(&ptlrpc_last_xid, xid);
872 *fail_t = ktime_get_real_seconds() + LONG_UNLINK;
875 *fail2_t = ktime_get_real_seconds() +
879 * The RPC is infected, let the test to change the
882 msleep(4 * MSEC_PER_SEC);
885 ptlrpc_assign_next_xid(request);
890 LASSERT(!request->rq_pool);
891 sptlrpc_cli_ctx_put(request->rq_cli_ctx, 1);
893 class_import_put(imp);
897 EXPORT_SYMBOL(ptlrpc_request_bufs_pack);
900 * Pack request buffers for network transfer, performing necessary encryption
901 * steps if necessary.
903 int ptlrpc_request_pack(struct ptlrpc_request *request,
904 __u32 version, int opcode)
906 return ptlrpc_request_bufs_pack(request, version, opcode, NULL, NULL);
908 EXPORT_SYMBOL(ptlrpc_request_pack);
911 * Helper function to allocate new request on import \a imp
912 * and possibly using existing request from pool \a pool if provided.
913 * Returns allocated request structure with import field filled or
917 struct ptlrpc_request *__ptlrpc_request_alloc(struct obd_import *imp,
918 struct ptlrpc_request_pool *pool)
920 struct ptlrpc_request *request = NULL;
922 request = ptlrpc_request_cache_alloc(GFP_NOFS);
924 if (!request && pool)
925 request = ptlrpc_prep_req_from_pool(pool);
928 ptlrpc_cli_req_init(request);
930 LASSERTF((unsigned long)imp > 0x1000, "%p", imp);
931 LASSERT(imp != LP_POISON);
932 LASSERTF((unsigned long)imp->imp_client > 0x1000, "%p\n",
934 LASSERT(imp->imp_client != LP_POISON);
936 request->rq_import = class_import_get(imp);
938 CERROR("request allocation out of memory\n");
945 * Helper function for creating a request.
946 * Calls __ptlrpc_request_alloc to allocate new request sturcture and inits
947 * buffer structures according to capsule template \a format.
948 * Returns allocated request structure pointer or NULL on error.
950 static struct ptlrpc_request *
951 ptlrpc_request_alloc_internal(struct obd_import *imp,
952 struct ptlrpc_request_pool *pool,
953 const struct req_format *format)
955 struct ptlrpc_request *request;
957 request = __ptlrpc_request_alloc(imp, pool);
962 * initiate connection if needed when the import has been
963 * referenced by the new request to avoid races with disconnect
965 if (unlikely(imp->imp_state == LUSTRE_IMP_IDLE)) {
968 CDEBUG_LIMIT(imp->imp_idle_debug,
969 "%s: reconnect after %llds idle\n",
970 imp->imp_obd->obd_name, ktime_get_real_seconds() -
971 imp->imp_last_reply_time);
972 spin_lock(&imp->imp_lock);
973 if (imp->imp_state == LUSTRE_IMP_IDLE) {
974 imp->imp_generation++;
975 imp->imp_initiated_at = imp->imp_generation;
976 imp->imp_state = LUSTRE_IMP_NEW;
978 /* connect_import_locked releases imp_lock */
979 rc = ptlrpc_connect_import_locked(imp);
981 ptlrpc_request_free(request);
984 ptlrpc_pinger_add_import(imp);
986 spin_unlock(&imp->imp_lock);
990 req_capsule_init(&request->rq_pill, request, RCL_CLIENT);
991 req_capsule_set(&request->rq_pill, format);
996 * Allocate new request structure for import \a imp and initialize its
997 * buffer structure according to capsule template \a format.
999 struct ptlrpc_request *ptlrpc_request_alloc(struct obd_import *imp,
1000 const struct req_format *format)
1002 return ptlrpc_request_alloc_internal(imp, NULL, format);
1004 EXPORT_SYMBOL(ptlrpc_request_alloc);
1007 * Allocate new request structure for import \a imp from pool \a pool and
1008 * initialize its buffer structure according to capsule template \a format.
1010 struct ptlrpc_request *
1011 ptlrpc_request_alloc_pool(struct obd_import *imp,
1012 struct ptlrpc_request_pool *pool,
1013 const struct req_format *format)
1015 return ptlrpc_request_alloc_internal(imp, pool, format);
1017 EXPORT_SYMBOL(ptlrpc_request_alloc_pool);
1020 * For requests not from pool, free memory of the request structure.
1021 * For requests obtained from a pool earlier, return request back to pool.
1023 void ptlrpc_request_free(struct ptlrpc_request *request)
1025 if (request->rq_pool)
1026 __ptlrpc_free_req_to_pool(request);
1028 ptlrpc_request_cache_free(request);
1030 EXPORT_SYMBOL(ptlrpc_request_free);
1033 * Allocate new request for operatione \a opcode and immediatelly pack it for
1035 * Only used for simple requests like OBD_PING where the only important
1036 * part of the request is operation itself.
1037 * Returns allocated request or NULL on error.
1039 struct ptlrpc_request *ptlrpc_request_alloc_pack(struct obd_import *imp,
1040 const struct req_format *format,
1041 __u32 version, int opcode)
1043 struct ptlrpc_request *req = ptlrpc_request_alloc(imp, format);
1047 rc = ptlrpc_request_pack(req, version, opcode);
1049 ptlrpc_request_free(req);
1055 EXPORT_SYMBOL(ptlrpc_request_alloc_pack);
1058 * Allocate and initialize new request set structure on the current CPT.
1059 * Returns a pointer to the newly allocated set structure or NULL on error.
1061 struct ptlrpc_request_set *ptlrpc_prep_set(void)
1063 struct ptlrpc_request_set *set;
1067 cpt = cfs_cpt_current(cfs_cpt_tab, 0);
1068 OBD_CPT_ALLOC(set, cfs_cpt_tab, cpt, sizeof(*set));
1071 atomic_set(&set->set_refcount, 1);
1072 INIT_LIST_HEAD(&set->set_requests);
1073 init_waitqueue_head(&set->set_waitq);
1074 atomic_set(&set->set_new_count, 0);
1075 atomic_set(&set->set_remaining, 0);
1076 spin_lock_init(&set->set_new_req_lock);
1077 INIT_LIST_HEAD(&set->set_new_requests);
1078 set->set_max_inflight = UINT_MAX;
1079 set->set_producer = NULL;
1080 set->set_producer_arg = NULL;
1085 EXPORT_SYMBOL(ptlrpc_prep_set);
1088 * Allocate and initialize new request set structure with flow control
1089 * extension. This extension allows to control the number of requests in-flight
1090 * for the whole set. A callback function to generate requests must be provided
1091 * and the request set will keep the number of requests sent over the wire to
1093 * Returns a pointer to the newly allocated set structure or NULL on error.
1095 struct ptlrpc_request_set *ptlrpc_prep_fcset(int max, set_producer_func func,
1099 struct ptlrpc_request_set *set;
1101 set = ptlrpc_prep_set();
1105 set->set_max_inflight = max;
1106 set->set_producer = func;
1107 set->set_producer_arg = arg;
1113 * Wind down and free request set structure previously allocated with
1115 * Ensures that all requests on the set have completed and removes
1116 * all requests from the request list in a set.
1117 * If any unsent request happen to be on the list, pretends that they got
1118 * an error in flight and calls their completion handler.
1120 void ptlrpc_set_destroy(struct ptlrpc_request_set *set)
1122 struct list_head *tmp;
1123 struct list_head *next;
1129 /* Requests on the set should either all be completed, or all be new */
1130 expected_phase = (atomic_read(&set->set_remaining) == 0) ?
1131 RQ_PHASE_COMPLETE : RQ_PHASE_NEW;
1132 list_for_each(tmp, &set->set_requests) {
1133 struct ptlrpc_request *req =
1134 list_entry(tmp, struct ptlrpc_request,
1137 LASSERT(req->rq_phase == expected_phase);
1141 LASSERTF(atomic_read(&set->set_remaining) == 0 ||
1142 atomic_read(&set->set_remaining) == n, "%d / %d\n",
1143 atomic_read(&set->set_remaining), n);
1145 list_for_each_safe(tmp, next, &set->set_requests) {
1146 struct ptlrpc_request *req =
1147 list_entry(tmp, struct ptlrpc_request,
1149 list_del_init(&req->rq_set_chain);
1151 LASSERT(req->rq_phase == expected_phase);
1153 if (req->rq_phase == RQ_PHASE_NEW) {
1154 ptlrpc_req_interpret(NULL, req, -EBADR);
1155 atomic_dec(&set->set_remaining);
1158 spin_lock(&req->rq_lock);
1160 req->rq_invalid_rqset = 0;
1161 spin_unlock(&req->rq_lock);
1163 ptlrpc_req_finished(req);
1166 LASSERT(atomic_read(&set->set_remaining) == 0);
1168 ptlrpc_reqset_put(set);
1171 EXPORT_SYMBOL(ptlrpc_set_destroy);
1174 * Add a new request to the general purpose request set.
1175 * Assumes request reference from the caller.
1177 void ptlrpc_set_add_req(struct ptlrpc_request_set *set,
1178 struct ptlrpc_request *req)
1180 if (set == PTLRPCD_SET) {
1181 ptlrpcd_add_req(req);
1185 LASSERT(req->rq_import->imp_state != LUSTRE_IMP_IDLE);
1186 LASSERT(list_empty(&req->rq_set_chain));
1188 if (req->rq_allow_intr)
1189 set->set_allow_intr = 1;
1191 /* The set takes over the caller's request reference */
1192 list_add_tail(&req->rq_set_chain, &set->set_requests);
1194 atomic_inc(&set->set_remaining);
1195 req->rq_queued_time = ktime_get_seconds();
1198 lustre_msg_set_jobid(req->rq_reqmsg, NULL);
1200 if (set->set_producer)
1202 * If the request set has a producer callback, the RPC must be
1203 * sent straight away
1205 ptlrpc_send_new_req(req);
1207 EXPORT_SYMBOL(ptlrpc_set_add_req);
1210 * Add a request to a request with dedicated server thread
1211 * and wake the thread to make any necessary processing.
1212 * Currently only used for ptlrpcd.
1214 void ptlrpc_set_add_new_req(struct ptlrpcd_ctl *pc,
1215 struct ptlrpc_request *req)
1217 struct ptlrpc_request_set *set = pc->pc_set;
1220 LASSERT(req->rq_set == NULL);
1221 LASSERT(test_bit(LIOD_STOP, &pc->pc_flags) == 0);
1223 spin_lock(&set->set_new_req_lock);
1225 * The set takes over the caller's request reference.
1228 req->rq_queued_time = ktime_get_seconds();
1229 list_add_tail(&req->rq_set_chain, &set->set_new_requests);
1230 count = atomic_inc_return(&set->set_new_count);
1231 spin_unlock(&set->set_new_req_lock);
1233 /* Only need to call wakeup once for the first entry. */
1235 wake_up(&set->set_waitq);
1238 * XXX: It maybe unnecessary to wakeup all the partners. But to
1239 * guarantee the async RPC can be processed ASAP, we have
1240 * no other better choice. It maybe fixed in future.
1242 for (i = 0; i < pc->pc_npartners; i++)
1243 wake_up(&pc->pc_partners[i]->pc_set->set_waitq);
1248 * Based on the current state of the import, determine if the request
1249 * can be sent, is an error, or should be delayed.
1251 * Returns true if this request should be delayed. If false, and
1252 * *status is set, then the request can not be sent and *status is the
1253 * error code. If false and status is 0, then request can be sent.
1255 * The imp->imp_lock must be held.
1257 static int ptlrpc_import_delay_req(struct obd_import *imp,
1258 struct ptlrpc_request *req, int *status)
1266 if (req->rq_ctx_init || req->rq_ctx_fini) {
1267 /* always allow ctx init/fini rpc go through */
1268 } else if (imp->imp_state == LUSTRE_IMP_NEW) {
1269 DEBUG_REQ(D_ERROR, req, "Uninitialized import");
1271 } else if (imp->imp_state == LUSTRE_IMP_CLOSED) {
1272 unsigned int opc = lustre_msg_get_opc(req->rq_reqmsg);
1275 * pings or MDS-equivalent STATFS may safely
1278 DEBUG_REQ((opc == OBD_PING || opc == OST_STATFS) ?
1279 D_HA : D_ERROR, req, "IMP_CLOSED");
1281 } else if (ptlrpc_send_limit_expired(req)) {
1282 /* probably doesn't need to be a D_ERROR afterinitial testing */
1283 DEBUG_REQ(D_HA, req, "send limit expired");
1284 *status = -ETIMEDOUT;
1285 } else if (req->rq_send_state == LUSTRE_IMP_CONNECTING &&
1286 imp->imp_state == LUSTRE_IMP_CONNECTING) {
1287 ;/* allow CONNECT even if import is invalid */
1288 if (atomic_read(&imp->imp_inval_count) != 0) {
1289 DEBUG_REQ(D_ERROR, req, "invalidate in flight");
1292 } else if (imp->imp_invalid || imp->imp_obd->obd_no_recov) {
1293 if (!imp->imp_deactive)
1294 DEBUG_REQ(D_NET, req, "IMP_INVALID");
1295 *status = -ESHUTDOWN; /* b=12940 */
1296 } else if (req->rq_import_generation != imp->imp_generation) {
1297 DEBUG_REQ(D_ERROR, req, "req wrong generation:");
1299 } else if (req->rq_send_state != imp->imp_state) {
1300 /* invalidate in progress - any requests should be drop */
1301 if (atomic_read(&imp->imp_inval_count) != 0) {
1302 DEBUG_REQ(D_ERROR, req, "invalidate in flight");
1304 } else if (req->rq_no_delay &&
1305 imp->imp_generation != imp->imp_initiated_at) {
1306 /* ignore nodelay for requests initiating connections */
1307 *status = -EWOULDBLOCK;
1308 } else if (req->rq_allow_replay &&
1309 (imp->imp_state == LUSTRE_IMP_REPLAY ||
1310 imp->imp_state == LUSTRE_IMP_REPLAY_LOCKS ||
1311 imp->imp_state == LUSTRE_IMP_REPLAY_WAIT ||
1312 imp->imp_state == LUSTRE_IMP_RECOVER)) {
1313 DEBUG_REQ(D_HA, req, "allow during recovery");
1323 * Decide if the error message should be printed to the console or not.
1324 * Makes its decision based on request type, status, and failure frequency.
1326 * \param[in] req request that failed and may need a console message
1328 * \retval false if no message should be printed
1329 * \retval true if console message should be printed
1331 static bool ptlrpc_console_allow(struct ptlrpc_request *req, __u32 opc, int err)
1333 LASSERT(req->rq_reqmsg != NULL);
1335 /* Suppress particular reconnect errors which are to be expected. */
1336 if (opc == OST_CONNECT || opc == MDS_CONNECT || opc == MGS_CONNECT) {
1337 /* Suppress timed out reconnect requests */
1338 if (lustre_handle_is_used(&req->rq_import->imp_remote_handle) ||
1343 * Suppress most unavailable/again reconnect requests, but
1344 * print occasionally so it is clear client is trying to
1345 * connect to a server where no target is running.
1347 if ((err == -ENODEV || err == -EAGAIN) &&
1348 req->rq_import->imp_conn_cnt % 30 != 20)
1352 if (opc == LDLM_ENQUEUE && err == -EAGAIN)
1353 /* -EAGAIN is normal when using POSIX flocks */
1356 if (opc == OBD_PING && (err == -ENODEV || err == -ENOTCONN) &&
1357 (req->rq_xid & 0xf) != 10)
1358 /* Suppress most ping requests, they may fail occasionally */
1365 * Check request processing status.
1366 * Returns the status.
1368 static int ptlrpc_check_status(struct ptlrpc_request *req)
1373 rc = lustre_msg_get_status(req->rq_repmsg);
1374 if (lustre_msg_get_type(req->rq_repmsg) == PTL_RPC_MSG_ERR) {
1375 struct obd_import *imp = req->rq_import;
1376 lnet_nid_t nid = imp->imp_connection->c_peer.nid;
1377 __u32 opc = lustre_msg_get_opc(req->rq_reqmsg);
1379 if (ptlrpc_console_allow(req, opc, rc))
1380 LCONSOLE_ERROR_MSG(0x11,
1381 "%s: operation %s to node %s failed: rc = %d\n",
1382 imp->imp_obd->obd_name,
1384 libcfs_nid2str(nid), rc);
1385 RETURN(rc < 0 ? rc : -EINVAL);
1389 DEBUG_REQ(D_INFO, req, "check status: rc = %d", rc);
1395 * save pre-versions of objects into request for replay.
1396 * Versions are obtained from server reply.
1399 static void ptlrpc_save_versions(struct ptlrpc_request *req)
1401 struct lustre_msg *repmsg = req->rq_repmsg;
1402 struct lustre_msg *reqmsg = req->rq_reqmsg;
1403 __u64 *versions = lustre_msg_get_versions(repmsg);
1406 if (lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)
1410 lustre_msg_set_versions(reqmsg, versions);
1411 CDEBUG(D_INFO, "Client save versions [%#llx/%#llx]\n",
1412 versions[0], versions[1]);
1417 __u64 ptlrpc_known_replied_xid(struct obd_import *imp)
1419 struct ptlrpc_request *req;
1421 assert_spin_locked(&imp->imp_lock);
1422 if (list_empty(&imp->imp_unreplied_list))
1425 req = list_entry(imp->imp_unreplied_list.next, struct ptlrpc_request,
1427 LASSERTF(req->rq_xid >= 1, "XID:%llu\n", req->rq_xid);
1429 if (imp->imp_known_replied_xid < req->rq_xid - 1)
1430 imp->imp_known_replied_xid = req->rq_xid - 1;
1432 return req->rq_xid - 1;
1436 * Callback function called when client receives RPC reply for \a req.
1437 * Returns 0 on success or error code.
1438 * The return alue would be assigned to req->rq_status by the caller
1439 * as request processing status.
1440 * This function also decides if the request needs to be saved for later replay.
1442 static int after_reply(struct ptlrpc_request *req)
1444 struct obd_import *imp = req->rq_import;
1445 struct obd_device *obd = req->rq_import->imp_obd;
1452 LASSERT(obd != NULL);
1453 /* repbuf must be unlinked */
1454 LASSERT(!req->rq_receiving_reply && req->rq_reply_unlinked);
1456 if (req->rq_reply_truncated) {
1457 if (ptlrpc_no_resend(req)) {
1458 DEBUG_REQ(D_ERROR, req,
1459 "reply buffer overflow, expected=%d, actual size=%d",
1460 req->rq_nob_received, req->rq_repbuf_len);
1464 sptlrpc_cli_free_repbuf(req);
1466 * Pass the required reply buffer size (include
1467 * space for early reply).
1468 * NB: no need to roundup because alloc_repbuf
1471 req->rq_replen = req->rq_nob_received;
1472 req->rq_nob_received = 0;
1473 spin_lock(&req->rq_lock);
1475 spin_unlock(&req->rq_lock);
1479 work_start = ktime_get_real();
1480 timediff = ktime_us_delta(work_start, req->rq_sent_ns);
1483 * NB Until this point, the whole of the incoming message,
1484 * including buflens, status etc is in the sender's byte order.
1486 rc = sptlrpc_cli_unwrap_reply(req);
1488 DEBUG_REQ(D_ERROR, req, "unwrap reply failed: rc = %d", rc);
1493 * Security layer unwrap might ask resend this request.
1498 rc = unpack_reply(req);
1502 /* retry indefinitely on EINPROGRESS */
1503 if (lustre_msg_get_status(req->rq_repmsg) == -EINPROGRESS &&
1504 ptlrpc_no_resend(req) == 0 && !req->rq_no_retry_einprogress) {
1505 time64_t now = ktime_get_real_seconds();
1507 DEBUG_REQ((req->rq_nr_resend % 8 == 1 ? D_WARNING : 0) |
1508 D_RPCTRACE, req, "resending request on EINPROGRESS");
1509 spin_lock(&req->rq_lock);
1511 spin_unlock(&req->rq_lock);
1512 req->rq_nr_resend++;
1514 /* Readjust the timeout for current conditions */
1515 ptlrpc_at_set_req_timeout(req);
1517 * delay resend to give a chance to the server to get ready.
1518 * The delay is increased by 1s on every resend and is capped to
1519 * the current request timeout (i.e. obd_timeout if AT is off,
1520 * or AT service time x 125% + 5s, see at_est2timeout)
1522 if (req->rq_nr_resend > req->rq_timeout)
1523 req->rq_sent = now + req->rq_timeout;
1525 req->rq_sent = now + req->rq_nr_resend;
1527 /* Resend for EINPROGRESS will use a new XID */
1528 spin_lock(&imp->imp_lock);
1529 list_del_init(&req->rq_unreplied_list);
1530 spin_unlock(&imp->imp_lock);
1535 if (obd->obd_svc_stats) {
1536 lprocfs_counter_add(obd->obd_svc_stats, PTLRPC_REQWAIT_CNTR,
1538 ptlrpc_lprocfs_rpc_sent(req, timediff);
1541 if (lustre_msg_get_type(req->rq_repmsg) != PTL_RPC_MSG_REPLY &&
1542 lustre_msg_get_type(req->rq_repmsg) != PTL_RPC_MSG_ERR) {
1543 DEBUG_REQ(D_ERROR, req, "invalid packet received (type=%u)",
1544 lustre_msg_get_type(req->rq_repmsg));
1548 if (lustre_msg_get_opc(req->rq_reqmsg) != OBD_PING)
1549 CFS_FAIL_TIMEOUT(OBD_FAIL_PTLRPC_PAUSE_REP, cfs_fail_val);
1550 ptlrpc_at_adj_service(req, lustre_msg_get_timeout(req->rq_repmsg));
1551 ptlrpc_at_adj_net_latency(req,
1552 lustre_msg_get_service_time(req->rq_repmsg));
1554 rc = ptlrpc_check_status(req);
1558 * Either we've been evicted, or the server has failed for
1559 * some reason. Try to reconnect, and if that fails, punt to
1562 if (ptlrpc_recoverable_error(rc)) {
1563 if (req->rq_send_state != LUSTRE_IMP_FULL ||
1564 imp->imp_obd->obd_no_recov || imp->imp_dlm_fake) {
1567 ptlrpc_request_handle_notconn(req);
1572 * Let's look if server sent slv. Do it only for RPC with
1575 ldlm_cli_update_pool(req);
1579 * Store transno in reqmsg for replay.
1581 if (!(lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)) {
1582 req->rq_transno = lustre_msg_get_transno(req->rq_repmsg);
1583 lustre_msg_set_transno(req->rq_reqmsg, req->rq_transno);
1586 if (imp->imp_replayable) {
1587 spin_lock(&imp->imp_lock);
1589 * No point in adding already-committed requests to the replay
1590 * list, we will just remove them immediately. b=9829
1592 if (req->rq_transno != 0 &&
1594 lustre_msg_get_last_committed(req->rq_repmsg) ||
1596 /** version recovery */
1597 ptlrpc_save_versions(req);
1598 ptlrpc_retain_replayable_request(req, imp);
1599 } else if (req->rq_commit_cb &&
1600 list_empty(&req->rq_replay_list)) {
1602 * NB: don't call rq_commit_cb if it's already on
1603 * rq_replay_list, ptlrpc_free_committed() will call
1604 * it later, see LU-3618 for details
1606 spin_unlock(&imp->imp_lock);
1607 req->rq_commit_cb(req);
1608 spin_lock(&imp->imp_lock);
1612 * Replay-enabled imports return commit-status information.
1614 committed = lustre_msg_get_last_committed(req->rq_repmsg);
1615 if (likely(committed > imp->imp_peer_committed_transno))
1616 imp->imp_peer_committed_transno = committed;
1618 ptlrpc_free_committed(imp);
1620 if (!list_empty(&imp->imp_replay_list)) {
1621 struct ptlrpc_request *last;
1623 last = list_entry(imp->imp_replay_list.prev,
1624 struct ptlrpc_request,
1627 * Requests with rq_replay stay on the list even if no
1628 * commit is expected.
1630 if (last->rq_transno > imp->imp_peer_committed_transno)
1631 ptlrpc_pinger_commit_expected(imp);
1634 spin_unlock(&imp->imp_lock);
1641 * Helper function to send request \a req over the network for the first time
1642 * Also adjusts request phase.
1643 * Returns 0 on success or error code.
1645 static int ptlrpc_send_new_req(struct ptlrpc_request *req)
1647 struct obd_import *imp = req->rq_import;
1652 LASSERT(req->rq_phase == RQ_PHASE_NEW);
1654 /* do not try to go further if there is not enough memory in enc_pool */
1655 if (req->rq_sent && req->rq_bulk)
1656 if (req->rq_bulk->bd_iov_count > get_free_pages_in_pool() &&
1657 pool_is_at_full_capacity())
1660 if (req->rq_sent && (req->rq_sent > ktime_get_real_seconds()) &&
1661 (!req->rq_generation_set ||
1662 req->rq_import_generation == imp->imp_generation))
1665 ptlrpc_rqphase_move(req, RQ_PHASE_RPC);
1667 spin_lock(&imp->imp_lock);
1669 LASSERT(req->rq_xid != 0);
1670 LASSERT(!list_empty(&req->rq_unreplied_list));
1672 if (!req->rq_generation_set)
1673 req->rq_import_generation = imp->imp_generation;
1675 if (ptlrpc_import_delay_req(imp, req, &rc)) {
1676 spin_lock(&req->rq_lock);
1677 req->rq_waiting = 1;
1678 spin_unlock(&req->rq_lock);
1680 DEBUG_REQ(D_HA, req, "req waiting for recovery: (%s != %s)",
1681 ptlrpc_import_state_name(req->rq_send_state),
1682 ptlrpc_import_state_name(imp->imp_state));
1683 LASSERT(list_empty(&req->rq_list));
1684 list_add_tail(&req->rq_list, &imp->imp_delayed_list);
1685 atomic_inc(&req->rq_import->imp_inflight);
1686 spin_unlock(&imp->imp_lock);
1691 spin_unlock(&imp->imp_lock);
1692 req->rq_status = rc;
1693 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1697 LASSERT(list_empty(&req->rq_list));
1698 list_add_tail(&req->rq_list, &imp->imp_sending_list);
1699 atomic_inc(&req->rq_import->imp_inflight);
1702 * find the known replied XID from the unreplied list, CONNECT
1703 * and DISCONNECT requests are skipped to make the sanity check
1704 * on server side happy. see process_req_last_xid().
1706 * For CONNECT: Because replay requests have lower XID, it'll
1707 * break the sanity check if CONNECT bump the exp_last_xid on
1710 * For DISCONNECT: Since client will abort inflight RPC before
1711 * sending DISCONNECT, DISCONNECT may carry an XID which higher
1712 * than the inflight RPC.
1714 if (!ptlrpc_req_is_connect(req) && !ptlrpc_req_is_disconnect(req))
1715 min_xid = ptlrpc_known_replied_xid(imp);
1716 spin_unlock(&imp->imp_lock);
1718 lustre_msg_set_last_xid(req->rq_reqmsg, min_xid);
1720 lustre_msg_set_status(req->rq_reqmsg, current_pid());
1722 rc = sptlrpc_req_refresh_ctx(req, -1);
1725 req->rq_status = rc;
1728 spin_lock(&req->rq_lock);
1729 req->rq_wait_ctx = 1;
1730 spin_unlock(&req->rq_lock);
1736 "Sending RPC req@%p pname:cluuid:pid:xid:nid:opc:job %s:%s:%d:%llu:%s:%d:%s\n",
1737 req, current_comm(),
1738 imp->imp_obd->obd_uuid.uuid,
1739 lustre_msg_get_status(req->rq_reqmsg), req->rq_xid,
1740 obd_import_nid2str(imp), lustre_msg_get_opc(req->rq_reqmsg),
1741 lustre_msg_get_jobid(req->rq_reqmsg) ?: "");
1743 rc = ptl_send_rpc(req, 0);
1744 if (rc == -ENOMEM) {
1745 spin_lock(&imp->imp_lock);
1746 if (!list_empty(&req->rq_list)) {
1747 list_del_init(&req->rq_list);
1748 if (atomic_dec_and_test(&req->rq_import->imp_inflight))
1749 wake_up(&req->rq_import->imp_recovery_waitq);
1751 spin_unlock(&imp->imp_lock);
1752 ptlrpc_rqphase_move(req, RQ_PHASE_NEW);
1756 DEBUG_REQ(D_HA, req, "send failed, expect timeout: rc = %d",
1758 spin_lock(&req->rq_lock);
1759 req->rq_net_err = 1;
1760 spin_unlock(&req->rq_lock);
1766 static inline int ptlrpc_set_producer(struct ptlrpc_request_set *set)
1771 LASSERT(set->set_producer != NULL);
1773 remaining = atomic_read(&set->set_remaining);
1776 * populate the ->set_requests list with requests until we
1777 * reach the maximum number of RPCs in flight for this set
1779 while (atomic_read(&set->set_remaining) < set->set_max_inflight) {
1780 rc = set->set_producer(set, set->set_producer_arg);
1781 if (rc == -ENOENT) {
1782 /* no more RPC to produce */
1783 set->set_producer = NULL;
1784 set->set_producer_arg = NULL;
1789 RETURN((atomic_read(&set->set_remaining) - remaining));
1793 * this sends any unsent RPCs in \a set and returns 1 if all are sent
1794 * and no more replies are expected.
1795 * (it is possible to get less replies than requests sent e.g. due to timed out
1796 * requests or requests that we had trouble to send out)
1798 * NOTE: This function contains a potential schedule point (cond_resched()).
1800 int ptlrpc_check_set(const struct lu_env *env, struct ptlrpc_request_set *set)
1802 struct list_head *tmp, *next;
1803 LIST_HEAD(comp_reqs);
1804 int force_timer_recalc = 0;
1807 if (atomic_read(&set->set_remaining) == 0)
1810 list_for_each_safe(tmp, next, &set->set_requests) {
1811 struct ptlrpc_request *req =
1812 list_entry(tmp, struct ptlrpc_request,
1814 struct obd_import *imp = req->rq_import;
1815 int unregistered = 0;
1819 if (req->rq_phase == RQ_PHASE_COMPLETE) {
1820 list_move_tail(&req->rq_set_chain, &comp_reqs);
1825 * This schedule point is mainly for the ptlrpcd caller of this
1826 * function. Most ptlrpc sets are not long-lived and unbounded
1827 * in length, but at the least the set used by the ptlrpcd is.
1828 * Since the processing time is unbounded, we need to insert an
1829 * explicit schedule point to make the thread well-behaved.
1834 * If the caller requires to allow to be interpreted by force
1835 * and it has really been interpreted, then move the request
1836 * to RQ_PHASE_INTERPRET phase in spite of what the current
1839 if (unlikely(req->rq_allow_intr && req->rq_intr)) {
1840 req->rq_status = -EINTR;
1841 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1844 * Since it is interpreted and we have to wait for
1845 * the reply to be unlinked, then use sync mode.
1849 GOTO(interpret, req->rq_status);
1852 if (req->rq_phase == RQ_PHASE_NEW && ptlrpc_send_new_req(req))
1853 force_timer_recalc = 1;
1855 /* delayed send - skip */
1856 if (req->rq_phase == RQ_PHASE_NEW && req->rq_sent)
1859 /* delayed resend - skip */
1860 if (req->rq_phase == RQ_PHASE_RPC && req->rq_resend &&
1861 req->rq_sent > ktime_get_real_seconds())
1864 if (!(req->rq_phase == RQ_PHASE_RPC ||
1865 req->rq_phase == RQ_PHASE_BULK ||
1866 req->rq_phase == RQ_PHASE_INTERPRET ||
1867 req->rq_phase == RQ_PHASE_UNREG_RPC ||
1868 req->rq_phase == RQ_PHASE_UNREG_BULK)) {
1869 DEBUG_REQ(D_ERROR, req, "bad phase %x", req->rq_phase);
1873 if (req->rq_phase == RQ_PHASE_UNREG_RPC ||
1874 req->rq_phase == RQ_PHASE_UNREG_BULK) {
1875 LASSERT(req->rq_next_phase != req->rq_phase);
1876 LASSERT(req->rq_next_phase != RQ_PHASE_UNDEFINED);
1878 if (req->rq_req_deadline &&
1879 !OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REQ_UNLINK))
1880 req->rq_req_deadline = 0;
1881 if (req->rq_reply_deadline &&
1882 !OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK))
1883 req->rq_reply_deadline = 0;
1884 if (req->rq_bulk_deadline &&
1885 !OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK))
1886 req->rq_bulk_deadline = 0;
1889 * Skip processing until reply is unlinked. We
1890 * can't return to pool before that and we can't
1891 * call interpret before that. We need to make
1892 * sure that all rdma transfers finished and will
1893 * not corrupt any data.
1895 if (req->rq_phase == RQ_PHASE_UNREG_RPC &&
1896 ptlrpc_client_recv_or_unlink(req))
1898 if (req->rq_phase == RQ_PHASE_UNREG_BULK &&
1899 ptlrpc_client_bulk_active(req))
1903 * Turn fail_loc off to prevent it from looping
1906 if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK)) {
1907 OBD_FAIL_CHECK_ORSET(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK,
1910 if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK)) {
1911 OBD_FAIL_CHECK_ORSET(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK,
1916 * Move to next phase if reply was successfully
1919 ptlrpc_rqphase_move(req, req->rq_next_phase);
1922 if (req->rq_phase == RQ_PHASE_INTERPRET)
1923 GOTO(interpret, req->rq_status);
1926 * Note that this also will start async reply unlink.
1928 if (req->rq_net_err && !req->rq_timedout) {
1929 ptlrpc_expire_one_request(req, 1);
1932 * Check if we still need to wait for unlink.
1934 if (ptlrpc_client_recv_or_unlink(req) ||
1935 ptlrpc_client_bulk_active(req))
1937 /* If there is no need to resend, fail it now. */
1938 if (req->rq_no_resend) {
1939 if (req->rq_status == 0)
1940 req->rq_status = -EIO;
1941 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1942 GOTO(interpret, req->rq_status);
1949 spin_lock(&req->rq_lock);
1950 req->rq_replied = 0;
1951 spin_unlock(&req->rq_lock);
1952 if (req->rq_status == 0)
1953 req->rq_status = -EIO;
1954 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1955 GOTO(interpret, req->rq_status);
1959 * ptlrpc_set_wait->l_wait_event sets lwi_allow_intr
1960 * so it sets rq_intr regardless of individual rpc
1961 * timeouts. The synchronous IO waiting path sets
1962 * rq_intr irrespective of whether ptlrpcd
1963 * has seen a timeout. Our policy is to only interpret
1964 * interrupted rpcs after they have timed out, so we
1965 * need to enforce that here.
1968 if (req->rq_intr && (req->rq_timedout || req->rq_waiting ||
1969 req->rq_wait_ctx)) {
1970 req->rq_status = -EINTR;
1971 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1972 GOTO(interpret, req->rq_status);
1975 if (req->rq_phase == RQ_PHASE_RPC) {
1976 if (req->rq_timedout || req->rq_resend ||
1977 req->rq_waiting || req->rq_wait_ctx) {
1980 if (!ptlrpc_unregister_reply(req, 1)) {
1981 ptlrpc_unregister_bulk(req, 1);
1985 spin_lock(&imp->imp_lock);
1986 if (ptlrpc_import_delay_req(imp, req,
1989 * put on delay list - only if we wait
1990 * recovery finished - before send
1992 list_move_tail(&req->rq_list,
1993 &imp->imp_delayed_list);
1994 spin_unlock(&imp->imp_lock);
1999 req->rq_status = status;
2000 ptlrpc_rqphase_move(req,
2001 RQ_PHASE_INTERPRET);
2002 spin_unlock(&imp->imp_lock);
2003 GOTO(interpret, req->rq_status);
2005 /* ignore on just initiated connections */
2006 if (ptlrpc_no_resend(req) &&
2007 !req->rq_wait_ctx &&
2008 imp->imp_generation !=
2009 imp->imp_initiated_at) {
2010 req->rq_status = -ENOTCONN;
2011 ptlrpc_rqphase_move(req,
2012 RQ_PHASE_INTERPRET);
2013 spin_unlock(&imp->imp_lock);
2014 GOTO(interpret, req->rq_status);
2017 list_move_tail(&req->rq_list,
2018 &imp->imp_sending_list);
2020 spin_unlock(&imp->imp_lock);
2022 spin_lock(&req->rq_lock);
2023 req->rq_waiting = 0;
2024 spin_unlock(&req->rq_lock);
2026 if (req->rq_timedout || req->rq_resend) {
2028 * This is re-sending anyways,
2029 * let's mark req as resend.
2031 spin_lock(&req->rq_lock);
2033 spin_unlock(&req->rq_lock);
2036 * rq_wait_ctx is only touched by ptlrpcd,
2037 * so no lock is needed here.
2039 status = sptlrpc_req_refresh_ctx(req, -1);
2042 req->rq_status = status;
2043 spin_lock(&req->rq_lock);
2044 req->rq_wait_ctx = 0;
2045 spin_unlock(&req->rq_lock);
2046 force_timer_recalc = 1;
2048 spin_lock(&req->rq_lock);
2049 req->rq_wait_ctx = 1;
2050 spin_unlock(&req->rq_lock);
2055 spin_lock(&req->rq_lock);
2056 req->rq_wait_ctx = 0;
2057 spin_unlock(&req->rq_lock);
2061 * In any case, the previous bulk should be
2062 * cleaned up to prepare for the new sending
2065 !ptlrpc_unregister_bulk(req, 1))
2068 rc = ptl_send_rpc(req, 0);
2069 if (rc == -ENOMEM) {
2070 spin_lock(&imp->imp_lock);
2071 if (!list_empty(&req->rq_list))
2072 list_del_init(&req->rq_list);
2073 spin_unlock(&imp->imp_lock);
2074 ptlrpc_rqphase_move(req, RQ_PHASE_NEW);
2078 DEBUG_REQ(D_HA, req,
2079 "send failed: rc = %d", rc);
2080 force_timer_recalc = 1;
2081 spin_lock(&req->rq_lock);
2082 req->rq_net_err = 1;
2083 spin_unlock(&req->rq_lock);
2086 /* need to reset the timeout */
2087 force_timer_recalc = 1;
2090 spin_lock(&req->rq_lock);
2092 if (ptlrpc_client_early(req)) {
2093 ptlrpc_at_recv_early_reply(req);
2094 spin_unlock(&req->rq_lock);
2098 /* Still waiting for a reply? */
2099 if (ptlrpc_client_recv(req)) {
2100 spin_unlock(&req->rq_lock);
2104 /* Did we actually receive a reply? */
2105 if (!ptlrpc_client_replied(req)) {
2106 spin_unlock(&req->rq_lock);
2110 spin_unlock(&req->rq_lock);
2113 * unlink from net because we are going to
2114 * swab in-place of reply buffer
2116 unregistered = ptlrpc_unregister_reply(req, 1);
2120 req->rq_status = after_reply(req);
2125 * If there is no bulk associated with this request,
2126 * then we're done and should let the interpreter
2127 * process the reply. Similarly if the RPC returned
2128 * an error, and therefore the bulk will never arrive.
2130 if (!req->rq_bulk || req->rq_status < 0) {
2131 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
2132 GOTO(interpret, req->rq_status);
2135 ptlrpc_rqphase_move(req, RQ_PHASE_BULK);
2138 LASSERT(req->rq_phase == RQ_PHASE_BULK);
2139 if (ptlrpc_client_bulk_active(req))
2142 if (req->rq_bulk->bd_failure) {
2144 * The RPC reply arrived OK, but the bulk screwed
2145 * up! Dead weird since the server told us the RPC
2146 * was good after getting the REPLY for her GET or
2147 * the ACK for her PUT.
2149 DEBUG_REQ(D_ERROR, req, "bulk transfer failed");
2150 req->rq_status = -EIO;
2153 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
2156 LASSERT(req->rq_phase == RQ_PHASE_INTERPRET);
2159 * This moves to "unregistering" phase we need to wait for
2162 if (!unregistered && !ptlrpc_unregister_reply(req, async)) {
2163 /* start async bulk unlink too */
2164 ptlrpc_unregister_bulk(req, 1);
2168 if (!ptlrpc_unregister_bulk(req, async))
2172 * When calling interpret receiving already should be
2175 LASSERT(!req->rq_receiving_reply);
2177 ptlrpc_req_interpret(env, req, req->rq_status);
2179 if (ptlrpcd_check_work(req)) {
2180 atomic_dec(&set->set_remaining);
2183 ptlrpc_rqphase_move(req, RQ_PHASE_COMPLETE);
2187 "Completed RPC req@%p pname:cluuid:pid:xid:nid:opc:job %s:%s:%d:%llu:%s:%d:%s\n",
2188 req, current_comm(),
2189 imp->imp_obd->obd_uuid.uuid,
2190 lustre_msg_get_status(req->rq_reqmsg),
2192 obd_import_nid2str(imp),
2193 lustre_msg_get_opc(req->rq_reqmsg),
2194 lustre_msg_get_jobid(req->rq_reqmsg) ?: "");
2196 spin_lock(&imp->imp_lock);
2198 * Request already may be not on sending or delaying list. This
2199 * may happen in the case of marking it erroneous for the case
2200 * ptlrpc_import_delay_req(req, status) find it impossible to
2201 * allow sending this rpc and returns *status != 0.
2203 if (!list_empty(&req->rq_list)) {
2204 list_del_init(&req->rq_list);
2205 if (atomic_dec_and_test(&imp->imp_inflight))
2206 wake_up(&imp->imp_recovery_waitq);
2208 list_del_init(&req->rq_unreplied_list);
2209 spin_unlock(&imp->imp_lock);
2211 atomic_dec(&set->set_remaining);
2212 wake_up(&imp->imp_recovery_waitq);
2214 if (set->set_producer) {
2215 /* produce a new request if possible */
2216 if (ptlrpc_set_producer(set) > 0)
2217 force_timer_recalc = 1;
2220 * free the request that has just been completed
2221 * in order not to pollute set->set_requests
2223 list_del_init(&req->rq_set_chain);
2224 spin_lock(&req->rq_lock);
2226 req->rq_invalid_rqset = 0;
2227 spin_unlock(&req->rq_lock);
2229 /* record rq_status to compute the final status later */
2230 if (req->rq_status != 0)
2231 set->set_rc = req->rq_status;
2232 ptlrpc_req_finished(req);
2234 list_move_tail(&req->rq_set_chain, &comp_reqs);
2239 * move completed request at the head of list so it's easier for
2240 * caller to find them
2242 list_splice(&comp_reqs, &set->set_requests);
2244 /* If we hit an error, we want to recover promptly. */
2245 RETURN(atomic_read(&set->set_remaining) == 0 || force_timer_recalc);
2247 EXPORT_SYMBOL(ptlrpc_check_set);
2250 * Time out request \a req. is \a async_unlink is set, that means do not wait
2251 * until LNet actually confirms network buffer unlinking.
2252 * Return 1 if we should give up further retrying attempts or 0 otherwise.
2254 int ptlrpc_expire_one_request(struct ptlrpc_request *req, int async_unlink)
2256 struct obd_import *imp = req->rq_import;
2257 unsigned int debug_mask = D_RPCTRACE;
2261 spin_lock(&req->rq_lock);
2262 req->rq_timedout = 1;
2263 spin_unlock(&req->rq_lock);
2265 if (ptlrpc_console_allow(req, lustre_msg_get_opc(req->rq_reqmsg),
2266 lustre_msg_get_status(req->rq_reqmsg)))
2267 debug_mask = D_WARNING;
2268 DEBUG_REQ(debug_mask, req, "Request sent has %s: [sent %lld/real %lld]",
2269 req->rq_net_err ? "failed due to network error" :
2270 ((req->rq_real_sent == 0 ||
2271 req->rq_real_sent < req->rq_sent ||
2272 req->rq_real_sent >= req->rq_deadline) ?
2273 "timed out for sent delay" : "timed out for slow reply"),
2274 (s64)req->rq_sent, (s64)req->rq_real_sent);
2276 if (imp && obd_debug_peer_on_timeout)
2277 LNetDebugPeer(imp->imp_connection->c_peer);
2279 ptlrpc_unregister_reply(req, async_unlink);
2280 ptlrpc_unregister_bulk(req, async_unlink);
2282 if (obd_dump_on_timeout)
2283 libcfs_debug_dumplog();
2286 DEBUG_REQ(D_HA, req, "NULL import: already cleaned up?");
2290 atomic_inc(&imp->imp_timeouts);
2292 /* The DLM server doesn't want recovery run on its imports. */
2293 if (imp->imp_dlm_fake)
2297 * If this request is for recovery or other primordial tasks,
2298 * then error it out here.
2300 if (req->rq_ctx_init || req->rq_ctx_fini ||
2301 req->rq_send_state != LUSTRE_IMP_FULL ||
2302 imp->imp_obd->obd_no_recov) {
2303 DEBUG_REQ(D_RPCTRACE, req, "err -110, sent_state=%s (now=%s)",
2304 ptlrpc_import_state_name(req->rq_send_state),
2305 ptlrpc_import_state_name(imp->imp_state));
2306 spin_lock(&req->rq_lock);
2307 req->rq_status = -ETIMEDOUT;
2309 spin_unlock(&req->rq_lock);
2314 * if a request can't be resent we can't wait for an answer after
2317 if (ptlrpc_no_resend(req)) {
2318 DEBUG_REQ(D_RPCTRACE, req, "TIMEOUT-NORESEND:");
2322 ptlrpc_fail_import(imp, lustre_msg_get_conn_cnt(req->rq_reqmsg));
2328 * Time out all uncompleted requests in request set pointed by \a data
2329 * Callback used when waiting on sets with l_wait_event.
2332 void ptlrpc_expired_set(struct ptlrpc_request_set *set)
2334 struct list_head *tmp;
2335 time64_t now = ktime_get_real_seconds();
2338 LASSERT(set != NULL);
2341 * A timeout expired. See which reqs it applies to...
2343 list_for_each(tmp, &set->set_requests) {
2344 struct ptlrpc_request *req =
2345 list_entry(tmp, struct ptlrpc_request,
2348 /* don't expire request waiting for context */
2349 if (req->rq_wait_ctx)
2352 /* Request in-flight? */
2353 if (!((req->rq_phase == RQ_PHASE_RPC &&
2354 !req->rq_waiting && !req->rq_resend) ||
2355 (req->rq_phase == RQ_PHASE_BULK)))
2358 if (req->rq_timedout || /* already dealt with */
2359 req->rq_deadline > now) /* not expired */
2363 * Deal with this guy. Do it asynchronously to not block
2366 ptlrpc_expire_one_request(req, 1);
2371 * Interrupts (sets interrupted flag) all uncompleted requests in
2372 * a set \a data. Callback for l_wait_event for interruptible waits.
2374 static void ptlrpc_interrupted_set(struct ptlrpc_request_set *set)
2376 struct list_head *tmp;
2378 LASSERT(set != NULL);
2379 CDEBUG(D_RPCTRACE, "INTERRUPTED SET %p\n", set);
2381 list_for_each(tmp, &set->set_requests) {
2382 struct ptlrpc_request *req =
2383 list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2388 if (req->rq_phase != RQ_PHASE_RPC &&
2389 req->rq_phase != RQ_PHASE_UNREG_RPC &&
2390 !req->rq_allow_intr)
2393 spin_lock(&req->rq_lock);
2395 spin_unlock(&req->rq_lock);
2400 * Get the smallest timeout in the set; this does NOT set a timeout.
2402 time64_t ptlrpc_set_next_timeout(struct ptlrpc_request_set *set)
2404 struct list_head *tmp;
2405 time64_t now = ktime_get_real_seconds();
2407 struct ptlrpc_request *req;
2411 list_for_each(tmp, &set->set_requests) {
2412 req = list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2414 /* Request in-flight? */
2415 if (!(((req->rq_phase == RQ_PHASE_RPC) && !req->rq_waiting) ||
2416 (req->rq_phase == RQ_PHASE_BULK) ||
2417 (req->rq_phase == RQ_PHASE_NEW)))
2420 /* Already timed out. */
2421 if (req->rq_timedout)
2424 /* Waiting for ctx. */
2425 if (req->rq_wait_ctx)
2428 if (req->rq_phase == RQ_PHASE_NEW)
2429 deadline = req->rq_sent;
2430 else if (req->rq_phase == RQ_PHASE_RPC && req->rq_resend)
2431 deadline = req->rq_sent;
2433 deadline = req->rq_sent + req->rq_timeout;
2435 if (deadline <= now) /* actually expired already */
2436 timeout = 1; /* ASAP */
2437 else if (timeout == 0 || timeout > deadline - now)
2438 timeout = deadline - now;
2444 * Send all unset request from the set and then wait untill all
2445 * requests in the set complete (either get a reply, timeout, get an
2446 * error or otherwise be interrupted).
2447 * Returns 0 on success or error code otherwise.
2449 int ptlrpc_set_wait(const struct lu_env *env, struct ptlrpc_request_set *set)
2451 struct list_head *tmp;
2452 struct ptlrpc_request *req;
2457 if (set->set_producer)
2458 (void)ptlrpc_set_producer(set);
2460 list_for_each(tmp, &set->set_requests) {
2461 req = list_entry(tmp, struct ptlrpc_request,
2463 if (req->rq_phase == RQ_PHASE_NEW)
2464 (void)ptlrpc_send_new_req(req);
2467 if (list_empty(&set->set_requests))
2471 timeout = ptlrpc_set_next_timeout(set);
2474 * wait until all complete, interrupted, or an in-flight
2477 CDEBUG(D_RPCTRACE, "set %p going to sleep for %lld seconds\n",
2480 if ((timeout == 0 && !signal_pending(current)) ||
2481 set->set_allow_intr) {
2483 * No requests are in-flight (ether timed out
2484 * or delayed), so we can allow interrupts.
2485 * We still want to block for a limited time,
2486 * so we allow interrupts during the timeout.
2488 rc = l_wait_event_abortable_timeout(
2490 ptlrpc_check_set(NULL, set),
2491 cfs_time_seconds(timeout ? timeout : 1));
2494 ptlrpc_expired_set(set);
2495 } else if (rc < 0) {
2497 ptlrpc_interrupted_set(set);
2503 * At least one request is in flight, so no
2504 * interrupts are allowed. Wait until all
2505 * complete, or an in-flight req times out.
2507 rc = wait_event_idle_timeout(
2509 ptlrpc_check_set(NULL, set),
2510 cfs_time_seconds(timeout ? timeout : 1));
2512 ptlrpc_expired_set(set);
2519 * LU-769 - if we ignored the signal because
2520 * it was already pending when we started, we
2521 * need to handle it now or we risk it being
2524 if (rc == -ETIMEDOUT &&
2525 signal_pending(current)) {
2526 sigset_t blocked_sigs =
2527 cfs_block_sigsinv(LUSTRE_FATAL_SIGS);
2530 * In fact we only interrupt for the
2531 * "fatal" signals like SIGINT or
2532 * SIGKILL. We still ignore less
2533 * important signals since ptlrpc set
2534 * is not easily reentrant from
2537 if (signal_pending(current))
2538 ptlrpc_interrupted_set(set);
2539 cfs_restore_sigs(blocked_sigs);
2543 LASSERT(rc == 0 || rc == -EINTR || rc == -ETIMEDOUT);
2546 * -EINTR => all requests have been flagged rq_intr so next
2548 * -ETIMEDOUT => someone timed out. When all reqs have
2549 * timed out, signals are enabled allowing completion with
2551 * I don't really care if we go once more round the loop in
2552 * the error cases -eeb.
2554 if (rc == 0 && atomic_read(&set->set_remaining) == 0) {
2555 list_for_each(tmp, &set->set_requests) {
2556 req = list_entry(tmp, struct ptlrpc_request,
2558 spin_lock(&req->rq_lock);
2559 req->rq_invalid_rqset = 1;
2560 spin_unlock(&req->rq_lock);
2563 } while (rc != 0 || atomic_read(&set->set_remaining) != 0);
2565 LASSERT(atomic_read(&set->set_remaining) == 0);
2567 rc = set->set_rc; /* rq_status of already freed requests if any */
2568 list_for_each(tmp, &set->set_requests) {
2569 req = list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2571 LASSERT(req->rq_phase == RQ_PHASE_COMPLETE);
2572 if (req->rq_status != 0)
2573 rc = req->rq_status;
2578 EXPORT_SYMBOL(ptlrpc_set_wait);
2581 * Helper fuction for request freeing.
2582 * Called when request count reached zero and request needs to be freed.
2583 * Removes request from all sorts of sending/replay lists it might be on,
2584 * frees network buffers if any are present.
2585 * If \a locked is set, that means caller is already holding import imp_lock
2586 * and so we no longer need to reobtain it (for certain lists manipulations)
2588 static void __ptlrpc_free_req(struct ptlrpc_request *request, int locked)
2595 LASSERT(!request->rq_srv_req);
2596 LASSERT(request->rq_export == NULL);
2597 LASSERTF(!request->rq_receiving_reply, "req %p\n", request);
2598 LASSERTF(list_empty(&request->rq_list), "req %p\n", request);
2599 LASSERTF(list_empty(&request->rq_set_chain), "req %p\n", request);
2600 LASSERTF(!request->rq_replay, "req %p\n", request);
2602 req_capsule_fini(&request->rq_pill);
2605 * We must take it off the imp_replay_list first. Otherwise, we'll set
2606 * request->rq_reqmsg to NULL while osc_close is dereferencing it.
2608 if (request->rq_import) {
2610 spin_lock(&request->rq_import->imp_lock);
2611 list_del_init(&request->rq_replay_list);
2612 list_del_init(&request->rq_unreplied_list);
2614 spin_unlock(&request->rq_import->imp_lock);
2616 LASSERTF(list_empty(&request->rq_replay_list), "req %p\n", request);
2618 if (atomic_read(&request->rq_refcount) != 0) {
2619 DEBUG_REQ(D_ERROR, request,
2620 "freeing request with nonzero refcount");
2624 if (request->rq_repbuf)
2625 sptlrpc_cli_free_repbuf(request);
2627 if (request->rq_import) {
2628 class_import_put(request->rq_import);
2629 request->rq_import = NULL;
2631 if (request->rq_bulk)
2632 ptlrpc_free_bulk(request->rq_bulk);
2634 if (request->rq_reqbuf || request->rq_clrbuf)
2635 sptlrpc_cli_free_reqbuf(request);
2637 if (request->rq_cli_ctx)
2638 sptlrpc_req_put_ctx(request, !locked);
2640 if (request->rq_pool)
2641 __ptlrpc_free_req_to_pool(request);
2643 ptlrpc_request_cache_free(request);
2647 static int __ptlrpc_req_finished(struct ptlrpc_request *request, int locked);
2649 * Drop one request reference. Must be called with import imp_lock held.
2650 * When reference count drops to zero, request is freed.
2652 void ptlrpc_req_finished_with_imp_lock(struct ptlrpc_request *request)
2654 assert_spin_locked(&request->rq_import->imp_lock);
2655 (void)__ptlrpc_req_finished(request, 1);
2660 * Drops one reference count for request \a request.
2661 * \a locked set indicates that caller holds import imp_lock.
2662 * Frees the request whe reference count reaches zero.
2664 * \retval 1 the request is freed
2665 * \retval 0 some others still hold references on the request
2667 static int __ptlrpc_req_finished(struct ptlrpc_request *request, int locked)
2675 LASSERT(request != LP_POISON);
2676 LASSERT(request->rq_reqmsg != LP_POISON);
2678 DEBUG_REQ(D_INFO, request, "refcount now %u",
2679 atomic_read(&request->rq_refcount) - 1);
2681 spin_lock(&request->rq_lock);
2682 count = atomic_dec_return(&request->rq_refcount);
2683 LASSERTF(count >= 0, "Invalid ref count %d\n", count);
2686 * For open RPC, the client does not know the EA size (LOV, ACL, and
2687 * so on) before replied, then the client has to reserve very large
2688 * reply buffer. Such buffer will not be released until the RPC freed.
2689 * Since The open RPC is replayable, we need to keep it in the replay
2690 * list until close. If there are a lot of files opened concurrently,
2691 * then the client may be OOM.
2693 * If fact, it is unnecessary to keep reply buffer for open replay,
2694 * related EAs have already been saved via mdc_save_lovea() before
2695 * coming here. So it is safe to free the reply buffer some earlier
2696 * before releasing the RPC to avoid client OOM. LU-9514
2698 if (count == 1 && request->rq_early_free_repbuf && request->rq_repbuf) {
2699 spin_lock(&request->rq_early_free_lock);
2700 sptlrpc_cli_free_repbuf(request);
2701 request->rq_repbuf = NULL;
2702 request->rq_repbuf_len = 0;
2703 request->rq_repdata = NULL;
2704 request->rq_reqdata_len = 0;
2705 spin_unlock(&request->rq_early_free_lock);
2707 spin_unlock(&request->rq_lock);
2710 __ptlrpc_free_req(request, locked);
2716 * Drops one reference count for a request.
2718 void ptlrpc_req_finished(struct ptlrpc_request *request)
2720 __ptlrpc_req_finished(request, 0);
2722 EXPORT_SYMBOL(ptlrpc_req_finished);
2725 * Returns xid of a \a request
2727 __u64 ptlrpc_req_xid(struct ptlrpc_request *request)
2729 return request->rq_xid;
2731 EXPORT_SYMBOL(ptlrpc_req_xid);
2734 * Disengage the client's reply buffer from the network
2735 * NB does _NOT_ unregister any client-side bulk.
2736 * IDEMPOTENT, but _not_ safe against concurrent callers.
2737 * The request owner (i.e. the thread doing the I/O) must call...
2738 * Returns 0 on success or 1 if unregistering cannot be made.
2740 static int ptlrpc_unregister_reply(struct ptlrpc_request *request, int async)
2745 LASSERT(!in_interrupt());
2747 /* Let's setup deadline for reply unlink. */
2748 if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK) &&
2749 async && request->rq_reply_deadline == 0 && cfs_fail_val == 0)
2750 request->rq_reply_deadline = ktime_get_real_seconds() +
2754 * Nothing left to do.
2756 if (!ptlrpc_client_recv_or_unlink(request))
2759 LNetMDUnlink(request->rq_reply_md_h);
2762 * Let's check it once again.
2764 if (!ptlrpc_client_recv_or_unlink(request))
2767 /* Move to "Unregistering" phase as reply was not unlinked yet. */
2768 ptlrpc_rqphase_move(request, RQ_PHASE_UNREG_RPC);
2771 * Do not wait for unlink to finish.
2777 * We have to wait_event_idle_timeout() whatever the result, to get
2778 * a chance to run reply_in_callback(), and to make sure we've
2779 * unlinked before returning a req to the pool.
2782 wait_queue_head_t *wq = (request->rq_set) ?
2783 &request->rq_set->set_waitq :
2784 &request->rq_reply_waitq;
2785 int seconds = LONG_UNLINK;
2787 * Network access will complete in finite time but the HUGE
2788 * timeout lets us CWARN for visibility of sluggish NALs
2790 while (seconds > 0 &&
2791 wait_event_idle_timeout(
2793 !ptlrpc_client_recv_or_unlink(request),
2794 cfs_time_seconds(1)) == 0)
2797 ptlrpc_rqphase_move(request, request->rq_next_phase);
2801 DEBUG_REQ(D_WARNING, request,
2802 "Unexpectedly long timeout receiving_reply=%d req_ulinked=%d reply_unlinked=%d",
2803 request->rq_receiving_reply,
2804 request->rq_req_unlinked,
2805 request->rq_reply_unlinked);
2810 static void ptlrpc_free_request(struct ptlrpc_request *req)
2812 spin_lock(&req->rq_lock);
2814 spin_unlock(&req->rq_lock);
2816 if (req->rq_commit_cb)
2817 req->rq_commit_cb(req);
2818 list_del_init(&req->rq_replay_list);
2820 __ptlrpc_req_finished(req, 1);
2824 * the request is committed and dropped from the replay list of its import
2826 void ptlrpc_request_committed(struct ptlrpc_request *req, int force)
2828 struct obd_import *imp = req->rq_import;
2830 spin_lock(&imp->imp_lock);
2831 if (list_empty(&req->rq_replay_list)) {
2832 spin_unlock(&imp->imp_lock);
2836 if (force || req->rq_transno <= imp->imp_peer_committed_transno) {
2837 if (imp->imp_replay_cursor == &req->rq_replay_list)
2838 imp->imp_replay_cursor = req->rq_replay_list.next;
2839 ptlrpc_free_request(req);
2842 spin_unlock(&imp->imp_lock);
2844 EXPORT_SYMBOL(ptlrpc_request_committed);
2847 * Iterates through replay_list on import and prunes
2848 * all requests have transno smaller than last_committed for the
2849 * import and don't have rq_replay set.
2850 * Since requests are sorted in transno order, stops when meetign first
2851 * transno bigger than last_committed.
2852 * caller must hold imp->imp_lock
2854 void ptlrpc_free_committed(struct obd_import *imp)
2856 struct ptlrpc_request *req, *saved;
2857 struct ptlrpc_request *last_req = NULL; /* temporary fire escape */
2858 bool skip_committed_list = true;
2861 LASSERT(imp != NULL);
2862 assert_spin_locked(&imp->imp_lock);
2864 if (imp->imp_peer_committed_transno == imp->imp_last_transno_checked &&
2865 imp->imp_generation == imp->imp_last_generation_checked) {
2866 CDEBUG(D_INFO, "%s: skip recheck: last_committed %llu\n",
2867 imp->imp_obd->obd_name, imp->imp_peer_committed_transno);
2870 CDEBUG(D_RPCTRACE, "%s: committing for last_committed %llu gen %d\n",
2871 imp->imp_obd->obd_name, imp->imp_peer_committed_transno,
2872 imp->imp_generation);
2874 if (imp->imp_generation != imp->imp_last_generation_checked ||
2875 imp->imp_last_transno_checked == 0)
2876 skip_committed_list = false;
2878 imp->imp_last_transno_checked = imp->imp_peer_committed_transno;
2879 imp->imp_last_generation_checked = imp->imp_generation;
2881 list_for_each_entry_safe(req, saved, &imp->imp_replay_list,
2883 /* XXX ok to remove when 1357 resolved - rread 05/29/03 */
2884 LASSERT(req != last_req);
2887 if (req->rq_transno == 0) {
2888 DEBUG_REQ(D_EMERG, req, "zero transno during replay");
2891 if (req->rq_import_generation < imp->imp_generation) {
2892 DEBUG_REQ(D_RPCTRACE, req, "free request with old gen");
2896 /* not yet committed */
2897 if (req->rq_transno > imp->imp_peer_committed_transno) {
2898 DEBUG_REQ(D_RPCTRACE, req, "stopping search");
2902 if (req->rq_replay) {
2903 DEBUG_REQ(D_RPCTRACE, req, "keeping (FL_REPLAY)");
2904 list_move_tail(&req->rq_replay_list,
2905 &imp->imp_committed_list);
2909 DEBUG_REQ(D_INFO, req, "commit (last_committed %llu)",
2910 imp->imp_peer_committed_transno);
2912 ptlrpc_free_request(req);
2915 if (skip_committed_list)
2918 list_for_each_entry_safe(req, saved, &imp->imp_committed_list,
2920 LASSERT(req->rq_transno != 0);
2921 if (req->rq_import_generation < imp->imp_generation ||
2923 DEBUG_REQ(D_RPCTRACE, req, "free %s open request",
2924 req->rq_import_generation <
2925 imp->imp_generation ? "stale" : "closed");
2927 if (imp->imp_replay_cursor == &req->rq_replay_list)
2928 imp->imp_replay_cursor =
2929 req->rq_replay_list.next;
2931 ptlrpc_free_request(req);
2938 void ptlrpc_cleanup_client(struct obd_import *imp)
2945 * Schedule previously sent request for resend.
2946 * For bulk requests we assign new xid (to avoid problems with
2947 * lost replies and therefore several transfers landing into same buffer
2948 * from different sending attempts).
2950 void ptlrpc_resend_req(struct ptlrpc_request *req)
2952 DEBUG_REQ(D_HA, req, "going to resend");
2953 spin_lock(&req->rq_lock);
2956 * Request got reply but linked to the import list still.
2957 * Let ptlrpc_check_set() process it.
2959 if (ptlrpc_client_replied(req)) {
2960 spin_unlock(&req->rq_lock);
2961 DEBUG_REQ(D_HA, req, "it has reply, so skip it");
2965 req->rq_status = -EAGAIN;
2968 req->rq_net_err = 0;
2969 req->rq_timedout = 0;
2971 ptlrpc_client_wake_req(req);
2972 spin_unlock(&req->rq_lock);
2975 /* XXX: this function and rq_status are currently unused */
2976 void ptlrpc_restart_req(struct ptlrpc_request *req)
2978 DEBUG_REQ(D_HA, req, "restarting (possibly-)completed request");
2979 req->rq_status = -ERESTARTSYS;
2981 spin_lock(&req->rq_lock);
2982 req->rq_restart = 1;
2983 req->rq_timedout = 0;
2984 ptlrpc_client_wake_req(req);
2985 spin_unlock(&req->rq_lock);
2989 * Grab additional reference on a request \a req
2991 struct ptlrpc_request *ptlrpc_request_addref(struct ptlrpc_request *req)
2994 atomic_inc(&req->rq_refcount);
2997 EXPORT_SYMBOL(ptlrpc_request_addref);
3000 * Add a request to import replay_list.
3001 * Must be called under imp_lock
3003 void ptlrpc_retain_replayable_request(struct ptlrpc_request *req,
3004 struct obd_import *imp)
3006 struct list_head *tmp;
3008 assert_spin_locked(&imp->imp_lock);
3010 if (req->rq_transno == 0) {
3011 DEBUG_REQ(D_EMERG, req, "saving request with zero transno");
3016 * clear this for new requests that were resent as well
3017 * as resent replayed requests.
3019 lustre_msg_clear_flags(req->rq_reqmsg, MSG_RESENT);
3021 /* don't re-add requests that have been replayed */
3022 if (!list_empty(&req->rq_replay_list))
3025 lustre_msg_add_flags(req->rq_reqmsg, MSG_REPLAY);
3027 spin_lock(&req->rq_lock);
3029 spin_unlock(&req->rq_lock);
3031 LASSERT(imp->imp_replayable);
3032 /* Balanced in ptlrpc_free_committed, usually. */
3033 ptlrpc_request_addref(req);
3034 list_for_each_prev(tmp, &imp->imp_replay_list) {
3035 struct ptlrpc_request *iter = list_entry(tmp,
3036 struct ptlrpc_request,
3040 * We may have duplicate transnos if we create and then
3041 * open a file, or for closes retained if to match creating
3042 * opens, so use req->rq_xid as a secondary key.
3043 * (See bugs 684, 685, and 428.)
3044 * XXX no longer needed, but all opens need transnos!
3046 if (iter->rq_transno > req->rq_transno)
3049 if (iter->rq_transno == req->rq_transno) {
3050 LASSERT(iter->rq_xid != req->rq_xid);
3051 if (iter->rq_xid > req->rq_xid)
3055 list_add(&req->rq_replay_list, &iter->rq_replay_list);
3059 list_add(&req->rq_replay_list, &imp->imp_replay_list);
3063 * Send request and wait until it completes.
3064 * Returns request processing status.
3066 int ptlrpc_queue_wait(struct ptlrpc_request *req)
3068 struct ptlrpc_request_set *set;
3072 LASSERT(req->rq_set == NULL);
3073 LASSERT(!req->rq_receiving_reply);
3075 set = ptlrpc_prep_set();
3077 CERROR("cannot allocate ptlrpc set: rc = %d\n", -ENOMEM);
3081 /* for distributed debugging */
3082 lustre_msg_set_status(req->rq_reqmsg, current_pid());
3084 /* add a ref for the set (see comment in ptlrpc_set_add_req) */
3085 ptlrpc_request_addref(req);
3086 ptlrpc_set_add_req(set, req);
3087 rc = ptlrpc_set_wait(NULL, set);
3088 ptlrpc_set_destroy(set);
3092 EXPORT_SYMBOL(ptlrpc_queue_wait);
3095 * Callback used for replayed requests reply processing.
3096 * In case of successful reply calls registered request replay callback.
3097 * In case of error restart replay process.
3099 static int ptlrpc_replay_interpret(const struct lu_env *env,
3100 struct ptlrpc_request *req,
3103 struct ptlrpc_replay_async_args *aa = args;
3104 struct obd_import *imp = req->rq_import;
3107 atomic_dec(&imp->imp_replay_inflight);
3110 * Note: if it is bulk replay (MDS-MDS replay), then even if
3111 * server got the request, but bulk transfer timeout, let's
3112 * replay the bulk req again
3114 if (!ptlrpc_client_replied(req) ||
3116 lustre_msg_get_status(req->rq_repmsg) == -ETIMEDOUT)) {
3117 DEBUG_REQ(D_ERROR, req, "request replay timed out");
3118 GOTO(out, rc = -ETIMEDOUT);
3121 if (lustre_msg_get_type(req->rq_repmsg) == PTL_RPC_MSG_ERR &&
3122 (lustre_msg_get_status(req->rq_repmsg) == -ENOTCONN ||
3123 lustre_msg_get_status(req->rq_repmsg) == -ENODEV))
3124 GOTO(out, rc = lustre_msg_get_status(req->rq_repmsg));
3126 /** VBR: check version failure */
3127 if (lustre_msg_get_status(req->rq_repmsg) == -EOVERFLOW) {
3128 /** replay was failed due to version mismatch */
3129 DEBUG_REQ(D_WARNING, req, "Version mismatch during replay");
3130 spin_lock(&imp->imp_lock);
3131 imp->imp_vbr_failed = 1;
3132 spin_unlock(&imp->imp_lock);
3133 lustre_msg_set_status(req->rq_repmsg, aa->praa_old_status);
3135 /** The transno had better not change over replay. */
3136 LASSERTF(lustre_msg_get_transno(req->rq_reqmsg) ==
3137 lustre_msg_get_transno(req->rq_repmsg) ||
3138 lustre_msg_get_transno(req->rq_repmsg) == 0,
3140 lustre_msg_get_transno(req->rq_reqmsg),
3141 lustre_msg_get_transno(req->rq_repmsg));
3144 spin_lock(&imp->imp_lock);
3145 imp->imp_last_replay_transno = lustre_msg_get_transno(req->rq_reqmsg);
3146 spin_unlock(&imp->imp_lock);
3147 LASSERT(imp->imp_last_replay_transno);
3149 /* transaction number shouldn't be bigger than the latest replayed */
3150 if (req->rq_transno > lustre_msg_get_transno(req->rq_reqmsg)) {
3151 DEBUG_REQ(D_ERROR, req,
3152 "Reported transno=%llu is bigger than replayed=%llu",
3154 lustre_msg_get_transno(req->rq_reqmsg));
3155 GOTO(out, rc = -EINVAL);
3158 DEBUG_REQ(D_HA, req, "got reply");
3160 /* let the callback do fixups, possibly including in the request */
3161 if (req->rq_replay_cb)
3162 req->rq_replay_cb(req);
3164 if (ptlrpc_client_replied(req) &&
3165 lustre_msg_get_status(req->rq_repmsg) != aa->praa_old_status) {
3166 DEBUG_REQ(D_ERROR, req, "status %d, old was %d",
3167 lustre_msg_get_status(req->rq_repmsg),
3168 aa->praa_old_status);
3171 * Note: If the replay fails for MDT-MDT recovery, let's
3172 * abort all of the following requests in the replay
3173 * and sending list, because MDT-MDT update requests
3174 * are dependent on each other, see LU-7039
3176 if (imp->imp_connect_flags_orig & OBD_CONNECT_MDS_MDS) {
3177 struct ptlrpc_request *free_req;
3178 struct ptlrpc_request *tmp;
3180 spin_lock(&imp->imp_lock);
3181 list_for_each_entry_safe(free_req, tmp,
3182 &imp->imp_replay_list,
3184 ptlrpc_free_request(free_req);
3187 list_for_each_entry_safe(free_req, tmp,
3188 &imp->imp_committed_list,
3190 ptlrpc_free_request(free_req);
3193 list_for_each_entry_safe(free_req, tmp,
3194 &imp->imp_delayed_list,
3196 spin_lock(&free_req->rq_lock);
3197 free_req->rq_err = 1;
3198 free_req->rq_status = -EIO;
3199 ptlrpc_client_wake_req(free_req);
3200 spin_unlock(&free_req->rq_lock);
3203 list_for_each_entry_safe(free_req, tmp,
3204 &imp->imp_sending_list,
3206 spin_lock(&free_req->rq_lock);
3207 free_req->rq_err = 1;
3208 free_req->rq_status = -EIO;
3209 ptlrpc_client_wake_req(free_req);
3210 spin_unlock(&free_req->rq_lock);
3212 spin_unlock(&imp->imp_lock);
3215 /* Put it back for re-replay. */
3216 lustre_msg_set_status(req->rq_repmsg, aa->praa_old_status);
3220 * Errors while replay can set transno to 0, but
3221 * imp_last_replay_transno shouldn't be set to 0 anyway
3223 if (req->rq_transno == 0)
3224 CERROR("Transno is 0 during replay!\n");
3226 /* continue with recovery */
3227 rc = ptlrpc_import_recovery_state_machine(imp);
3229 req->rq_send_state = aa->praa_old_state;
3232 /* this replay failed, so restart recovery */
3233 ptlrpc_connect_import(imp);
3239 * Prepares and queues request for replay.
3240 * Adds it to ptlrpcd queue for actual sending.
3241 * Returns 0 on success.
3243 int ptlrpc_replay_req(struct ptlrpc_request *req)
3245 struct ptlrpc_replay_async_args *aa;
3249 LASSERT(req->rq_import->imp_state == LUSTRE_IMP_REPLAY);
3251 aa = ptlrpc_req_async_args(aa, req);
3252 memset(aa, 0, sizeof(*aa));
3254 /* Prepare request to be resent with ptlrpcd */
3255 aa->praa_old_state = req->rq_send_state;
3256 req->rq_send_state = LUSTRE_IMP_REPLAY;
3257 req->rq_phase = RQ_PHASE_NEW;
3258 req->rq_next_phase = RQ_PHASE_UNDEFINED;
3260 aa->praa_old_status = lustre_msg_get_status(req->rq_repmsg);
3262 req->rq_interpret_reply = ptlrpc_replay_interpret;
3263 /* Readjust the timeout for current conditions */
3264 ptlrpc_at_set_req_timeout(req);
3266 /* Tell server net_latency to calculate how long to wait for reply. */
3267 lustre_msg_set_service_time(req->rq_reqmsg,
3268 ptlrpc_at_get_net_latency(req));
3269 DEBUG_REQ(D_HA, req, "REPLAY");
3271 atomic_inc(&req->rq_import->imp_replay_inflight);
3272 spin_lock(&req->rq_lock);
3273 req->rq_early_free_repbuf = 0;
3274 spin_unlock(&req->rq_lock);
3275 ptlrpc_request_addref(req); /* ptlrpcd needs a ref */
3277 ptlrpcd_add_req(req);
3282 * Aborts all in-flight request on import \a imp sending and delayed lists
3284 void ptlrpc_abort_inflight(struct obd_import *imp)
3286 struct list_head *tmp, *n;
3290 * Make sure that no new requests get processed for this import.
3291 * ptlrpc_{queue,set}_wait must (and does) hold imp_lock while testing
3292 * this flag and then putting requests on sending_list or delayed_list.
3294 assert_spin_locked(&imp->imp_lock);
3297 * XXX locking? Maybe we should remove each request with the list
3298 * locked? Also, how do we know if the requests on the list are
3299 * being freed at this time?
3301 list_for_each_safe(tmp, n, &imp->imp_sending_list) {
3302 struct ptlrpc_request *req = list_entry(tmp,
3303 struct ptlrpc_request,
3306 DEBUG_REQ(D_RPCTRACE, req, "inflight");
3308 spin_lock(&req->rq_lock);
3309 if (req->rq_import_generation < imp->imp_generation) {
3311 req->rq_status = -EIO;
3312 ptlrpc_client_wake_req(req);
3314 spin_unlock(&req->rq_lock);
3317 list_for_each_safe(tmp, n, &imp->imp_delayed_list) {
3318 struct ptlrpc_request *req =
3319 list_entry(tmp, struct ptlrpc_request, rq_list);
3321 DEBUG_REQ(D_RPCTRACE, req, "aborting waiting req");
3323 spin_lock(&req->rq_lock);
3324 if (req->rq_import_generation < imp->imp_generation) {
3326 req->rq_status = -EIO;
3327 ptlrpc_client_wake_req(req);
3329 spin_unlock(&req->rq_lock);
3333 * Last chance to free reqs left on the replay list, but we
3334 * will still leak reqs that haven't committed.
3336 if (imp->imp_replayable)
3337 ptlrpc_free_committed(imp);
3343 * Abort all uncompleted requests in request set \a set
3345 void ptlrpc_abort_set(struct ptlrpc_request_set *set)
3347 struct list_head *tmp, *pos;
3349 LASSERT(set != NULL);
3351 list_for_each_safe(pos, tmp, &set->set_requests) {
3352 struct ptlrpc_request *req =
3353 list_entry(pos, struct ptlrpc_request,
3356 spin_lock(&req->rq_lock);
3357 if (req->rq_phase != RQ_PHASE_RPC) {
3358 spin_unlock(&req->rq_lock);
3363 req->rq_status = -EINTR;
3364 ptlrpc_client_wake_req(req);
3365 spin_unlock(&req->rq_lock);
3370 * Initialize the XID for the node. This is common among all requests on
3371 * this node, and only requires the property that it is monotonically
3372 * increasing. It does not need to be sequential. Since this is also used
3373 * as the RDMA match bits, it is important that a single client NOT have
3374 * the same match bits for two different in-flight requests, hence we do
3375 * NOT want to have an XID per target or similar.
3377 * To avoid an unlikely collision between match bits after a client reboot
3378 * (which would deliver old data into the wrong RDMA buffer) initialize
3379 * the XID based on the current time, assuming a maximum RPC rate of 1M RPC/s.
3380 * If the time is clearly incorrect, we instead use a 62-bit random number.
3381 * In the worst case the random number will overflow 1M RPCs per second in
3382 * 9133 years, or permutations thereof.
3384 #define YEAR_2004 (1ULL << 30)
3385 void ptlrpc_init_xid(void)
3387 time64_t now = ktime_get_real_seconds();
3390 if (now < YEAR_2004) {
3391 get_random_bytes(&xid, sizeof(xid));
3393 xid |= (1ULL << 61);
3395 xid = (u64)now << 20;
3398 /* Need to always be aligned to a power-of-two for mutli-bulk BRW */
3399 BUILD_BUG_ON((PTLRPC_BULK_OPS_COUNT & (PTLRPC_BULK_OPS_COUNT - 1)) !=
3401 xid &= PTLRPC_BULK_OPS_MASK;
3402 atomic64_set(&ptlrpc_last_xid, xid);
3406 * Increase xid and returns resulting new value to the caller.
3408 * Multi-bulk BRW RPCs consume multiple XIDs for each bulk transfer, starting
3409 * at the returned xid, up to xid + PTLRPC_BULK_OPS_COUNT - 1. The BRW RPC
3410 * itself uses the last bulk xid needed, so the server can determine the
3411 * the number of bulk transfers from the RPC XID and a bitmask. The starting
3412 * xid must align to a power-of-two value.
3414 * This is assumed to be true due to the initial ptlrpc_last_xid
3415 * value also being initialized to a power-of-two value. LU-1431
3417 __u64 ptlrpc_next_xid(void)
3419 return atomic64_add_return(PTLRPC_BULK_OPS_COUNT, &ptlrpc_last_xid);
3423 * If request has a new allocated XID (new request or EINPROGRESS resend),
3424 * use this XID as matchbits of bulk, otherwise allocate a new matchbits for
3425 * request to ensure previous bulk fails and avoid problems with lost replies
3426 * and therefore several transfers landing into the same buffer from different
3429 void ptlrpc_set_bulk_mbits(struct ptlrpc_request *req)
3431 struct ptlrpc_bulk_desc *bd = req->rq_bulk;
3433 LASSERT(bd != NULL);
3436 * Generate new matchbits for all resend requests, including
3439 if (req->rq_resend) {
3440 __u64 old_mbits = req->rq_mbits;
3443 * First time resend on -EINPROGRESS will generate new xid,
3444 * so we can actually use the rq_xid as rq_mbits in such case,
3445 * however, it's bit hard to distinguish such resend with a
3446 * 'resend for the -EINPROGRESS resend'. To make it simple,
3447 * we opt to generate mbits for all resend cases.
3449 if (OCD_HAS_FLAG(&bd->bd_import->imp_connect_data,
3451 req->rq_mbits = ptlrpc_next_xid();
3454 * Old version transfers rq_xid to peer as
3457 spin_lock(&req->rq_import->imp_lock);
3458 list_del_init(&req->rq_unreplied_list);
3459 ptlrpc_assign_next_xid_nolock(req);
3460 spin_unlock(&req->rq_import->imp_lock);
3461 req->rq_mbits = req->rq_xid;
3463 CDEBUG(D_HA, "resend bulk old x%llu new x%llu\n",
3464 old_mbits, req->rq_mbits);
3465 } else if (!(lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)) {
3466 /* Request being sent first time, use xid as matchbits. */
3467 if (OCD_HAS_FLAG(&bd->bd_import->imp_connect_data, BULK_MBITS)
3468 || req->rq_mbits == 0) {
3469 req->rq_mbits = req->rq_xid;
3471 int total_md = (bd->bd_iov_count + LNET_MAX_IOV - 1) /
3473 req->rq_mbits -= total_md - 1;
3477 * Replay request, xid and matchbits have already been
3478 * correctly assigned.
3484 * For multi-bulk RPCs, rq_mbits is the last mbits needed for bulks so
3485 * that server can infer the number of bulks that were prepared,
3488 req->rq_mbits += ((bd->bd_iov_count + LNET_MAX_IOV - 1) /
3492 * Set rq_xid as rq_mbits to indicate the final bulk for the old
3493 * server which does not support OBD_CONNECT_BULK_MBITS. LU-6808.
3495 * It's ok to directly set the rq_xid here, since this xid bump
3496 * won't affect the request position in unreplied list.
3498 if (!OCD_HAS_FLAG(&bd->bd_import->imp_connect_data, BULK_MBITS))
3499 req->rq_xid = req->rq_mbits;
3503 * Get a glimpse at what next xid value might have been.
3504 * Returns possible next xid.
3506 __u64 ptlrpc_sample_next_xid(void)
3508 return atomic64_read(&ptlrpc_last_xid) + PTLRPC_BULK_OPS_COUNT;
3510 EXPORT_SYMBOL(ptlrpc_sample_next_xid);
3513 * Functions for operating ptlrpc workers.
3515 * A ptlrpc work is a function which will be running inside ptlrpc context.
3516 * The callback shouldn't sleep otherwise it will block that ptlrpcd thread.
3518 * 1. after a work is created, it can be used many times, that is:
3519 * handler = ptlrpcd_alloc_work();
3520 * ptlrpcd_queue_work();
3522 * queue it again when necessary:
3523 * ptlrpcd_queue_work();
3524 * ptlrpcd_destroy_work();
3525 * 2. ptlrpcd_queue_work() can be called by multiple processes meanwhile, but
3526 * it will only be queued once in any time. Also as its name implies, it may
3527 * have delay before it really runs by ptlrpcd thread.
3529 struct ptlrpc_work_async_args {
3530 int (*cb)(const struct lu_env *, void *);
3534 static void ptlrpcd_add_work_req(struct ptlrpc_request *req)
3536 /* re-initialize the req */
3537 req->rq_timeout = obd_timeout;
3538 req->rq_sent = ktime_get_real_seconds();
3539 req->rq_deadline = req->rq_sent + req->rq_timeout;
3540 req->rq_phase = RQ_PHASE_INTERPRET;
3541 req->rq_next_phase = RQ_PHASE_COMPLETE;
3542 req->rq_xid = ptlrpc_next_xid();
3543 req->rq_import_generation = req->rq_import->imp_generation;
3545 ptlrpcd_add_req(req);
3548 static int work_interpreter(const struct lu_env *env,
3549 struct ptlrpc_request *req, void *args, int rc)
3551 struct ptlrpc_work_async_args *arg = args;
3553 LASSERT(ptlrpcd_check_work(req));
3554 LASSERT(arg->cb != NULL);
3556 rc = arg->cb(env, arg->cbdata);
3558 list_del_init(&req->rq_set_chain);
3561 if (atomic_dec_return(&req->rq_refcount) > 1) {
3562 atomic_set(&req->rq_refcount, 2);
3563 ptlrpcd_add_work_req(req);
3568 static int worker_format;
3570 static int ptlrpcd_check_work(struct ptlrpc_request *req)
3572 return req->rq_pill.rc_fmt == (void *)&worker_format;
3576 * Create a work for ptlrpc.
3578 void *ptlrpcd_alloc_work(struct obd_import *imp,
3579 int (*cb)(const struct lu_env *, void *), void *cbdata)
3581 struct ptlrpc_request *req = NULL;
3582 struct ptlrpc_work_async_args *args;
3588 RETURN(ERR_PTR(-EINVAL));
3590 /* copy some code from deprecated fakereq. */
3591 req = ptlrpc_request_cache_alloc(GFP_NOFS);
3593 CERROR("ptlrpc: run out of memory!\n");
3594 RETURN(ERR_PTR(-ENOMEM));
3597 ptlrpc_cli_req_init(req);
3599 req->rq_send_state = LUSTRE_IMP_FULL;
3600 req->rq_type = PTL_RPC_MSG_REQUEST;
3601 req->rq_import = class_import_get(imp);
3602 req->rq_interpret_reply = work_interpreter;
3603 /* don't want reply */
3604 req->rq_no_delay = req->rq_no_resend = 1;
3605 req->rq_pill.rc_fmt = (void *)&worker_format;
3607 args = ptlrpc_req_async_args(args, req);
3609 args->cbdata = cbdata;
3613 EXPORT_SYMBOL(ptlrpcd_alloc_work);
3615 void ptlrpcd_destroy_work(void *handler)
3617 struct ptlrpc_request *req = handler;
3620 ptlrpc_req_finished(req);
3622 EXPORT_SYMBOL(ptlrpcd_destroy_work);
3624 int ptlrpcd_queue_work(void *handler)
3626 struct ptlrpc_request *req = handler;
3629 * Check if the req is already being queued.
3631 * Here comes a trick: it lacks a way of checking if a req is being
3632 * processed reliably in ptlrpc. Here I have to use refcount of req
3633 * for this purpose. This is okay because the caller should use this
3634 * req as opaque data. - Jinshan
3636 LASSERT(atomic_read(&req->rq_refcount) > 0);
3637 if (atomic_inc_return(&req->rq_refcount) == 2)
3638 ptlrpcd_add_work_req(req);
3641 EXPORT_SYMBOL(ptlrpcd_queue_work);