Whamcloud - gitweb
LU-3534 osp: transfer updates with bulk RPC
[fs/lustre-release.git] / lustre / ptlrpc / client.c
1 /*
2  * GPL HEADER START
3  *
4  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5  *
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.
9  *
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).
15  *
16  * You should have received a copy of the GNU General Public License
17  * version 2 along with this program; If not, see
18  * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
19  *
20  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21  * CA 95054 USA or visit www.sun.com if you need additional information or
22  * have any questions.
23  *
24  * GPL HEADER END
25  */
26 /*
27  * Copyright (c) 2002, 2010, Oracle and/or its affiliates. All rights reserved.
28  * Use is subject to license terms.
29  *
30  * Copyright (c) 2011, 2014, Intel Corporation.
31  */
32 /*
33  * This file is part of Lustre, http://www.lustre.org/
34  * Lustre is a trademark of Sun Microsystems, Inc.
35  */
36
37 /** Implementation of client-side PortalRPC interfaces */
38
39 #define DEBUG_SUBSYSTEM S_RPC
40
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>
47
48 #include "ptlrpc_internal.h"
49
50 const struct ptlrpc_bulk_frag_ops ptlrpc_bulk_kiov_pin_ops = {
51         .add_kiov_frag  = ptlrpc_prep_bulk_page_pin,
52         .release_frags  = ptlrpc_release_bulk_page_pin,
53 };
54 EXPORT_SYMBOL(ptlrpc_bulk_kiov_pin_ops);
55
56 const struct ptlrpc_bulk_frag_ops ptlrpc_bulk_kiov_nopin_ops = {
57         .add_kiov_frag  = ptlrpc_prep_bulk_page_nopin,
58         .release_frags  = ptlrpc_release_bulk_noop,
59 };
60 EXPORT_SYMBOL(ptlrpc_bulk_kiov_nopin_ops);
61
62 const struct ptlrpc_bulk_frag_ops ptlrpc_bulk_kvec_ops = {
63         .add_iov_frag = ptlrpc_prep_bulk_frag,
64 };
65 EXPORT_SYMBOL(ptlrpc_bulk_kvec_ops);
66
67 static int ptlrpc_send_new_req(struct ptlrpc_request *req);
68 static int ptlrpcd_check_work(struct ptlrpc_request *req);
69 static int ptlrpc_unregister_reply(struct ptlrpc_request *request, int async);
70
71 /**
72  * Initialize passed in client structure \a cl.
73  */
74 void ptlrpc_init_client(int req_portal, int rep_portal, char *name,
75                         struct ptlrpc_client *cl)
76 {
77         cl->cli_request_portal = req_portal;
78         cl->cli_reply_portal   = rep_portal;
79         cl->cli_name           = name;
80 }
81 EXPORT_SYMBOL(ptlrpc_init_client);
82
83 /**
84  * Return PortalRPC connection for remore uud \a uuid
85  */
86 struct ptlrpc_connection *ptlrpc_uuid_to_connection(struct obd_uuid *uuid)
87 {
88         struct ptlrpc_connection *c;
89         lnet_nid_t                self;
90         lnet_process_id_t         peer;
91         int                       err;
92
93         /* ptlrpc_uuid_to_peer() initializes its 2nd parameter
94          * before accessing its values. */
95         /* coverity[uninit_use_in_call] */
96         err = ptlrpc_uuid_to_peer(uuid, &peer, &self);
97         if (err != 0) {
98                 CNETERR("cannot find peer %s!\n", uuid->uuid);
99                 return NULL;
100         }
101
102         c = ptlrpc_connection_get(peer, self, uuid);
103         if (c) {
104                 memcpy(c->c_remote_uuid.uuid,
105                        uuid->uuid, sizeof(c->c_remote_uuid.uuid));
106         }
107
108         CDEBUG(D_INFO, "%s -> %p\n", uuid->uuid, c);
109
110         return c;
111 }
112
113 /**
114  * Allocate and initialize new bulk descriptor on the sender.
115  * Returns pointer to the descriptor or NULL on error.
116  */
117 struct ptlrpc_bulk_desc *ptlrpc_new_bulk(unsigned nfrags, unsigned max_brw,
118                                          enum ptlrpc_bulk_op_type type,
119                                          unsigned portal,
120                                          const struct ptlrpc_bulk_frag_ops *ops)
121 {
122         struct ptlrpc_bulk_desc *desc;
123         int i;
124
125         /* ensure that only one of KIOV or IOVEC is set but not both */
126         LASSERT((ptlrpc_is_bulk_desc_kiov(type) &&
127                  ops->add_kiov_frag != NULL) ||
128                 (ptlrpc_is_bulk_desc_kvec(type) &&
129                  ops->add_iov_frag != NULL));
130
131         if (type & PTLRPC_BULK_BUF_KIOV) {
132                 OBD_ALLOC(desc,
133                           offsetof(struct ptlrpc_bulk_desc,
134                                    bd_u.bd_kiov.bd_vec[nfrags]));
135         } else {
136                 OBD_ALLOC(desc,
137                           offsetof(struct ptlrpc_bulk_desc,
138                                    bd_u.bd_kvec.bd_kvec[nfrags]));
139         }
140
141         if (!desc)
142                 return NULL;
143
144         spin_lock_init(&desc->bd_lock);
145         init_waitqueue_head(&desc->bd_waitq);
146         desc->bd_max_iov = nfrags;
147         desc->bd_iov_count = 0;
148         desc->bd_portal = portal;
149         desc->bd_type = type;
150         desc->bd_md_count = 0;
151         desc->bd_frag_ops = (struct ptlrpc_bulk_frag_ops *) ops;
152         LASSERT(max_brw > 0);
153         desc->bd_md_max_brw = min(max_brw, PTLRPC_BULK_OPS_COUNT);
154         /* PTLRPC_BULK_OPS_COUNT is the compile-time transfer limit for this
155          * node. Negotiated ocd_brw_size will always be <= this number. */
156         for (i = 0; i < PTLRPC_BULK_OPS_COUNT; i++)
157                 LNetInvalidateHandle(&desc->bd_mds[i]);
158
159         return desc;
160 }
161
162 /**
163  * Prepare bulk descriptor for specified outgoing request \a req that
164  * can fit \a nfrags * pages. \a type is bulk type. \a portal is where
165  * the bulk to be sent. Used on client-side.
166  * Returns pointer to newly allocatrd initialized bulk descriptor or NULL on
167  * error.
168  */
169 struct ptlrpc_bulk_desc *ptlrpc_prep_bulk_imp(struct ptlrpc_request *req,
170                                               unsigned nfrags, unsigned max_brw,
171                                               unsigned int type,
172                                               unsigned portal,
173                                               const struct ptlrpc_bulk_frag_ops
174                                                 *ops)
175 {
176         struct obd_import *imp = req->rq_import;
177         struct ptlrpc_bulk_desc *desc;
178
179         ENTRY;
180         LASSERT(ptlrpc_is_bulk_op_passive(type));
181
182         desc = ptlrpc_new_bulk(nfrags, max_brw, type, portal, ops);
183         if (desc == NULL)
184                 RETURN(NULL);
185
186         desc->bd_import_generation = req->rq_import_generation;
187         desc->bd_import = class_import_get(imp);
188         desc->bd_req = req;
189
190         desc->bd_cbid.cbid_fn  = client_bulk_callback;
191         desc->bd_cbid.cbid_arg = desc;
192
193         /* This makes req own desc, and free it when she frees herself */
194         req->rq_bulk = desc;
195
196         return desc;
197 }
198 EXPORT_SYMBOL(ptlrpc_prep_bulk_imp);
199
200 void __ptlrpc_prep_bulk_page(struct ptlrpc_bulk_desc *desc,
201                              struct page *page, int pageoffset, int len,
202                              int pin)
203 {
204         lnet_kiov_t *kiov;
205
206         LASSERT(desc->bd_iov_count < desc->bd_max_iov);
207         LASSERT(page != NULL);
208         LASSERT(pageoffset >= 0);
209         LASSERT(len > 0);
210         LASSERT(pageoffset + len <= PAGE_CACHE_SIZE);
211         LASSERT(ptlrpc_is_bulk_desc_kiov(desc->bd_type));
212
213         kiov = &BD_GET_KIOV(desc, desc->bd_iov_count);
214
215         desc->bd_nob += len;
216
217         if (pin)
218                 page_cache_get(page);
219
220         kiov->kiov_page = page;
221         kiov->kiov_offset = pageoffset;
222         kiov->kiov_len = len;
223
224         desc->bd_iov_count++;
225 }
226 EXPORT_SYMBOL(__ptlrpc_prep_bulk_page);
227
228 int ptlrpc_prep_bulk_frag(struct ptlrpc_bulk_desc *desc,
229                           void *frag, int len)
230 {
231         struct kvec *iovec;
232         ENTRY;
233
234         LASSERT(desc->bd_iov_count < desc->bd_max_iov);
235         LASSERT(frag != NULL);
236         LASSERT(len > 0);
237         LASSERT(ptlrpc_is_bulk_desc_kvec(desc->bd_type));
238
239         iovec = &BD_GET_KVEC(desc, desc->bd_iov_count);
240
241         desc->bd_nob += len;
242
243         iovec->iov_base = frag;
244         iovec->iov_len = len;
245
246         desc->bd_iov_count++;
247
248         RETURN(desc->bd_nob);
249 }
250 EXPORT_SYMBOL(ptlrpc_prep_bulk_frag);
251
252 void ptlrpc_free_bulk(struct ptlrpc_bulk_desc *desc)
253 {
254         ENTRY;
255
256         LASSERT(desc != NULL);
257         LASSERT(desc->bd_iov_count != LI_POISON); /* not freed already */
258         LASSERT(desc->bd_md_count == 0);         /* network hands off */
259         LASSERT((desc->bd_export != NULL) ^ (desc->bd_import != NULL));
260         LASSERT(desc->bd_frag_ops != NULL);
261
262         if (ptlrpc_is_bulk_desc_kiov(desc->bd_type))
263                 sptlrpc_enc_pool_put_pages(desc);
264
265         if (desc->bd_export)
266                 class_export_put(desc->bd_export);
267         else
268                 class_import_put(desc->bd_import);
269
270         if (desc->bd_frag_ops->release_frags != NULL)
271                 desc->bd_frag_ops->release_frags(desc);
272
273         if (ptlrpc_is_bulk_desc_kiov(desc->bd_type))
274                 OBD_FREE(desc, offsetof(struct ptlrpc_bulk_desc,
275                                         bd_u.bd_kiov.bd_vec[desc->bd_max_iov]));
276         else
277                 OBD_FREE(desc, offsetof(struct ptlrpc_bulk_desc,
278                                         bd_u.bd_kvec.bd_kvec[desc->
279                                                 bd_max_iov]));
280
281         EXIT;
282 }
283 EXPORT_SYMBOL(ptlrpc_free_bulk);
284
285 /**
286  * Set server timelimit for this req, i.e. how long are we willing to wait
287  * for reply before timing out this request.
288  */
289 void ptlrpc_at_set_req_timeout(struct ptlrpc_request *req)
290 {
291         __u32 serv_est;
292         int idx;
293         struct imp_at *at;
294
295         LASSERT(req->rq_import);
296
297         if (AT_OFF) {
298                 /* non-AT settings */
299                 /**
300                  * \a imp_server_timeout means this is reverse import and
301                  * we send (currently only) ASTs to the client and cannot afford
302                  * to wait too long for the reply, otherwise the other client
303                  * (because of which we are sending this request) would
304                  * timeout waiting for us
305                  */
306                 req->rq_timeout = req->rq_import->imp_server_timeout ?
307                                   obd_timeout / 2 : obd_timeout;
308         } else {
309                 at = &req->rq_import->imp_at;
310                 idx = import_at_get_index(req->rq_import,
311                                           req->rq_request_portal);
312                 serv_est = at_get(&at->iat_service_estimate[idx]);
313                 req->rq_timeout = at_est2timeout(serv_est);
314         }
315         /* We could get even fancier here, using history to predict increased
316            loading... */
317
318         /* Let the server know what this RPC timeout is by putting it in the
319            reqmsg*/
320         lustre_msg_set_timeout(req->rq_reqmsg, req->rq_timeout);
321 }
322 EXPORT_SYMBOL(ptlrpc_at_set_req_timeout);
323
324 /* Adjust max service estimate based on server value */
325 static void ptlrpc_at_adj_service(struct ptlrpc_request *req,
326                                   unsigned int serv_est)
327 {
328         int idx;
329         unsigned int oldse;
330         struct imp_at *at;
331
332         LASSERT(req->rq_import);
333         at = &req->rq_import->imp_at;
334
335         idx = import_at_get_index(req->rq_import, req->rq_request_portal);
336         /* max service estimates are tracked on the server side,
337            so just keep minimal history here */
338         oldse = at_measured(&at->iat_service_estimate[idx], serv_est);
339         if (oldse != 0)
340                 CDEBUG(D_ADAPTTO, "The RPC service estimate for %s ptl %d "
341                        "has changed from %d to %d\n",
342                        req->rq_import->imp_obd->obd_name,req->rq_request_portal,
343                        oldse, at_get(&at->iat_service_estimate[idx]));
344 }
345
346 /* Expected network latency per remote node (secs) */
347 int ptlrpc_at_get_net_latency(struct ptlrpc_request *req)
348 {
349         return AT_OFF ? 0 : at_get(&req->rq_import->imp_at.iat_net_latency);
350 }
351
352 /* Adjust expected network latency */
353 void ptlrpc_at_adj_net_latency(struct ptlrpc_request *req,
354                                unsigned int service_time)
355 {
356         unsigned int nl, oldnl;
357         struct imp_at *at;
358         time_t now = cfs_time_current_sec();
359
360         LASSERT(req->rq_import);
361
362         if (service_time > now - req->rq_sent + 3) {
363                 /* bz16408, however, this can also happen if early reply
364                  * is lost and client RPC is expired and resent, early reply
365                  * or reply of original RPC can still be fit in reply buffer
366                  * of resent RPC, now client is measuring time from the
367                  * resent time, but server sent back service time of original
368                  * RPC.
369                  */
370                 CDEBUG((lustre_msg_get_flags(req->rq_reqmsg) & MSG_RESENT) ?
371                        D_ADAPTTO : D_WARNING,
372                        "Reported service time %u > total measured time "
373                        CFS_DURATION_T"\n", service_time,
374                        cfs_time_sub(now, req->rq_sent));
375                 return;
376         }
377
378         /* Network latency is total time less server processing time */
379         nl = max_t(int, now - req->rq_sent -
380                         service_time, 0) + 1; /* st rounding */
381         at = &req->rq_import->imp_at;
382
383         oldnl = at_measured(&at->iat_net_latency, nl);
384         if (oldnl != 0)
385                 CDEBUG(D_ADAPTTO, "The network latency for %s (nid %s) "
386                        "has changed from %d to %d\n",
387                        req->rq_import->imp_obd->obd_name,
388                        obd_uuid2str(
389                                &req->rq_import->imp_connection->c_remote_uuid),
390                        oldnl, at_get(&at->iat_net_latency));
391 }
392
393 static int unpack_reply(struct ptlrpc_request *req)
394 {
395         int rc;
396
397         if (SPTLRPC_FLVR_POLICY(req->rq_flvr.sf_rpc) != SPTLRPC_POLICY_NULL) {
398                 rc = ptlrpc_unpack_rep_msg(req, req->rq_replen);
399                 if (rc) {
400                         DEBUG_REQ(D_ERROR, req, "unpack_rep failed: %d", rc);
401                         return(-EPROTO);
402                 }
403         }
404
405         rc = lustre_unpack_rep_ptlrpc_body(req, MSG_PTLRPC_BODY_OFF);
406         if (rc) {
407                 DEBUG_REQ(D_ERROR, req, "unpack ptlrpc body failed: %d", rc);
408                 return(-EPROTO);
409         }
410         return 0;
411 }
412
413 /**
414  * Handle an early reply message, called with the rq_lock held.
415  * If anything goes wrong just ignore it - same as if it never happened
416  */
417 static int ptlrpc_at_recv_early_reply(struct ptlrpc_request *req)
418 __must_hold(&req->rq_lock)
419 {
420         struct ptlrpc_request *early_req;
421         time_t                 olddl;
422         int                    rc;
423         ENTRY;
424
425         req->rq_early = 0;
426         spin_unlock(&req->rq_lock);
427
428         rc = sptlrpc_cli_unwrap_early_reply(req, &early_req);
429         if (rc) {
430                 spin_lock(&req->rq_lock);
431                 RETURN(rc);
432         }
433
434         rc = unpack_reply(early_req);
435         if (rc != 0) {
436                 sptlrpc_cli_finish_early_reply(early_req);
437                 spin_lock(&req->rq_lock);
438                 RETURN(rc);
439         }
440
441         /* Use new timeout value just to adjust the local value for this
442          * request, don't include it into at_history. It is unclear yet why
443          * service time increased and should it be counted or skipped, e.g.
444          * that can be recovery case or some error or server, the real reply
445          * will add all new data if it is worth to add. */
446         req->rq_timeout = lustre_msg_get_timeout(early_req->rq_repmsg);
447         lustre_msg_set_timeout(req->rq_reqmsg, req->rq_timeout);
448
449         /* Network latency can be adjusted, it is pure network delays */
450         ptlrpc_at_adj_net_latency(req,
451                         lustre_msg_get_service_time(early_req->rq_repmsg));
452
453         sptlrpc_cli_finish_early_reply(early_req);
454
455         spin_lock(&req->rq_lock);
456         olddl = req->rq_deadline;
457         /* server assumes it now has rq_timeout from when the request
458          * arrived, so the client should give it at least that long.
459          * since we don't know the arrival time we'll use the original
460          * sent time */
461         req->rq_deadline = req->rq_sent + req->rq_timeout +
462                            ptlrpc_at_get_net_latency(req);
463
464         DEBUG_REQ(D_ADAPTTO, req,
465                   "Early reply #%d, new deadline in "CFS_DURATION_T"s "
466                   "("CFS_DURATION_T"s)", req->rq_early_count,
467                   cfs_time_sub(req->rq_deadline, cfs_time_current_sec()),
468                   cfs_time_sub(req->rq_deadline, olddl));
469
470         RETURN(rc);
471 }
472
473 static struct kmem_cache *request_cache;
474
475 int ptlrpc_request_cache_init(void)
476 {
477         request_cache = kmem_cache_create("ptlrpc_cache",
478                                           sizeof(struct ptlrpc_request),
479                                           0, SLAB_HWCACHE_ALIGN, NULL);
480         return request_cache == NULL ? -ENOMEM : 0;
481 }
482
483 void ptlrpc_request_cache_fini(void)
484 {
485         kmem_cache_destroy(request_cache);
486 }
487
488 struct ptlrpc_request *ptlrpc_request_cache_alloc(gfp_t flags)
489 {
490         struct ptlrpc_request *req;
491
492         OBD_SLAB_ALLOC_PTR_GFP(req, request_cache, flags);
493         return req;
494 }
495
496 void ptlrpc_request_cache_free(struct ptlrpc_request *req)
497 {
498         OBD_SLAB_FREE_PTR(req, request_cache);
499 }
500
501 /**
502  * Wind down request pool \a pool.
503  * Frees all requests from the pool too
504  */
505 void ptlrpc_free_rq_pool(struct ptlrpc_request_pool *pool)
506 {
507         struct list_head *l, *tmp;
508         struct ptlrpc_request *req;
509
510         LASSERT(pool != NULL);
511
512         spin_lock(&pool->prp_lock);
513         list_for_each_safe(l, tmp, &pool->prp_req_list) {
514                 req = list_entry(l, struct ptlrpc_request, rq_list);
515                 list_del(&req->rq_list);
516                 LASSERT(req->rq_reqbuf);
517                 LASSERT(req->rq_reqbuf_len == pool->prp_rq_size);
518                 OBD_FREE_LARGE(req->rq_reqbuf, pool->prp_rq_size);
519                 ptlrpc_request_cache_free(req);
520         }
521         spin_unlock(&pool->prp_lock);
522         OBD_FREE(pool, sizeof(*pool));
523 }
524 EXPORT_SYMBOL(ptlrpc_free_rq_pool);
525
526 /**
527  * Allocates, initializes and adds \a num_rq requests to the pool \a pool
528  */
529 void ptlrpc_add_rqs_to_pool(struct ptlrpc_request_pool *pool, int num_rq)
530 {
531         int i;
532         int size = 1;
533
534         while (size < pool->prp_rq_size)
535                 size <<= 1;
536
537         LASSERTF(list_empty(&pool->prp_req_list) ||
538                  size == pool->prp_rq_size,
539                  "Trying to change pool size with nonempty pool "
540                  "from %d to %d bytes\n", pool->prp_rq_size, size);
541
542         spin_lock(&pool->prp_lock);
543         pool->prp_rq_size = size;
544         for (i = 0; i < num_rq; i++) {
545                 struct ptlrpc_request *req;
546                 struct lustre_msg *msg;
547
548                 spin_unlock(&pool->prp_lock);
549                 req = ptlrpc_request_cache_alloc(GFP_NOFS);
550                 if (!req)
551                         return;
552                 OBD_ALLOC_LARGE(msg, size);
553                 if (!msg) {
554                         ptlrpc_request_cache_free(req);
555                         return;
556                 }
557                 req->rq_reqbuf = msg;
558                 req->rq_reqbuf_len = size;
559                 req->rq_pool = pool;
560                 spin_lock(&pool->prp_lock);
561                 list_add_tail(&req->rq_list, &pool->prp_req_list);
562         }
563         spin_unlock(&pool->prp_lock);
564         return;
565 }
566 EXPORT_SYMBOL(ptlrpc_add_rqs_to_pool);
567
568 /**
569  * Create and initialize new request pool with given attributes:
570  * \a num_rq - initial number of requests to create for the pool
571  * \a msgsize - maximum message size possible for requests in thid pool
572  * \a populate_pool - function to be called when more requests need to be added
573  *                    to the pool
574  * Returns pointer to newly created pool or NULL on error.
575  */
576 struct ptlrpc_request_pool *
577 ptlrpc_init_rq_pool(int num_rq, int msgsize,
578                     void (*populate_pool)(struct ptlrpc_request_pool *, int))
579 {
580         struct ptlrpc_request_pool *pool;
581
582         OBD_ALLOC(pool, sizeof(struct ptlrpc_request_pool));
583         if (!pool)
584                 return NULL;
585
586         /* Request next power of two for the allocation, because internally
587            kernel would do exactly this */
588
589         spin_lock_init(&pool->prp_lock);
590         INIT_LIST_HEAD(&pool->prp_req_list);
591         pool->prp_rq_size = msgsize + SPTLRPC_MAX_PAYLOAD;
592         pool->prp_populate = populate_pool;
593
594         populate_pool(pool, num_rq);
595
596         if (list_empty(&pool->prp_req_list)) {
597                 /* have not allocated a single request for the pool */
598                 OBD_FREE(pool, sizeof(struct ptlrpc_request_pool));
599                 pool = NULL;
600         }
601         return pool;
602 }
603 EXPORT_SYMBOL(ptlrpc_init_rq_pool);
604
605 /**
606  * Fetches one request from pool \a pool
607  */
608 static struct ptlrpc_request *
609 ptlrpc_prep_req_from_pool(struct ptlrpc_request_pool *pool)
610 {
611         struct ptlrpc_request *request;
612         struct lustre_msg *reqbuf;
613
614         if (!pool)
615                 return NULL;
616
617         spin_lock(&pool->prp_lock);
618
619         /* See if we have anything in a pool, and bail out if nothing,
620          * in writeout path, where this matters, this is safe to do, because
621          * nothing is lost in this case, and when some in-flight requests
622          * complete, this code will be called again. */
623         if (unlikely(list_empty(&pool->prp_req_list))) {
624                 spin_unlock(&pool->prp_lock);
625                 return NULL;
626         }
627
628         request = list_entry(pool->prp_req_list.next, struct ptlrpc_request,
629                              rq_list);
630         list_del_init(&request->rq_list);
631         spin_unlock(&pool->prp_lock);
632
633         LASSERT(request->rq_reqbuf);
634         LASSERT(request->rq_pool);
635
636         reqbuf = request->rq_reqbuf;
637         memset(request, 0, sizeof(*request));
638         request->rq_reqbuf = reqbuf;
639         request->rq_reqbuf_len = pool->prp_rq_size;
640         request->rq_pool = pool;
641
642         return request;
643 }
644
645 /**
646  * Returns freed \a request to pool.
647  */
648 static void __ptlrpc_free_req_to_pool(struct ptlrpc_request *request)
649 {
650         struct ptlrpc_request_pool *pool = request->rq_pool;
651
652         spin_lock(&pool->prp_lock);
653         LASSERT(list_empty(&request->rq_list));
654         LASSERT(!request->rq_receiving_reply);
655         list_add_tail(&request->rq_list, &pool->prp_req_list);
656         spin_unlock(&pool->prp_lock);
657 }
658
659 static int __ptlrpc_request_bufs_pack(struct ptlrpc_request *request,
660                                       __u32 version, int opcode,
661                                       int count, __u32 *lengths, char **bufs,
662                                       struct ptlrpc_cli_ctx *ctx)
663 {
664         struct obd_import  *imp = request->rq_import;
665         int                 rc;
666         ENTRY;
667
668         if (unlikely(ctx))
669                 request->rq_cli_ctx = sptlrpc_cli_ctx_get(ctx);
670         else {
671                 rc = sptlrpc_req_get_ctx(request);
672                 if (rc)
673                         GOTO(out_free, rc);
674         }
675
676         sptlrpc_req_set_flavor(request, opcode);
677
678         rc = lustre_pack_request(request, imp->imp_msg_magic, count,
679                                  lengths, bufs);
680         if (rc) {
681                 LASSERT(!request->rq_pool);
682                 GOTO(out_ctx, rc);
683         }
684
685         lustre_msg_add_version(request->rq_reqmsg, version);
686         request->rq_send_state = LUSTRE_IMP_FULL;
687         request->rq_type = PTL_RPC_MSG_REQUEST;
688
689         request->rq_req_cbid.cbid_fn  = request_out_callback;
690         request->rq_req_cbid.cbid_arg = request;
691
692         request->rq_reply_cbid.cbid_fn  = reply_in_callback;
693         request->rq_reply_cbid.cbid_arg = request;
694
695         request->rq_reply_deadline = 0;
696         request->rq_phase = RQ_PHASE_NEW;
697         request->rq_next_phase = RQ_PHASE_UNDEFINED;
698
699         request->rq_request_portal = imp->imp_client->cli_request_portal;
700         request->rq_reply_portal = imp->imp_client->cli_reply_portal;
701
702         ptlrpc_at_set_req_timeout(request);
703
704         lustre_msg_set_opc(request->rq_reqmsg, opcode);
705
706         RETURN(0);
707 out_ctx:
708         sptlrpc_cli_ctx_put(request->rq_cli_ctx, 1);
709 out_free:
710         class_import_put(imp);
711         return rc;
712 }
713
714 int ptlrpc_request_bufs_pack(struct ptlrpc_request *request,
715                              __u32 version, int opcode, char **bufs,
716                              struct ptlrpc_cli_ctx *ctx)
717 {
718         int count;
719
720         count = req_capsule_filled_sizes(&request->rq_pill, RCL_CLIENT);
721         return __ptlrpc_request_bufs_pack(request, version, opcode, count,
722                                           request->rq_pill.rc_area[RCL_CLIENT],
723                                           bufs, ctx);
724 }
725 EXPORT_SYMBOL(ptlrpc_request_bufs_pack);
726
727 /**
728  * Pack request buffers for network transfer, performing necessary encryption
729  * steps if necessary.
730  */
731 int ptlrpc_request_pack(struct ptlrpc_request *request,
732                         __u32 version, int opcode)
733 {
734         int rc;
735         rc = ptlrpc_request_bufs_pack(request, version, opcode, NULL, NULL);
736         if (rc)
737                 return rc;
738
739         /* For some old 1.8 clients (< 1.8.7), they will LASSERT the size of
740          * ptlrpc_body sent from server equal to local ptlrpc_body size, so we
741          * have to send old ptlrpc_body to keep interoprability with these
742          * clients.
743          *
744          * Only three kinds of server->client RPCs so far:
745          *  - LDLM_BL_CALLBACK
746          *  - LDLM_CP_CALLBACK
747          *  - LDLM_GL_CALLBACK
748          *
749          * XXX This should be removed whenever we drop the interoprability with
750          *     the these old clients.
751          */
752         if (opcode == LDLM_BL_CALLBACK || opcode == LDLM_CP_CALLBACK ||
753             opcode == LDLM_GL_CALLBACK)
754                 req_capsule_shrink(&request->rq_pill, &RMF_PTLRPC_BODY,
755                                    sizeof(struct ptlrpc_body_v2), RCL_CLIENT);
756
757         return rc;
758 }
759 EXPORT_SYMBOL(ptlrpc_request_pack);
760
761 /**
762  * Helper function to allocate new request on import \a imp
763  * and possibly using existing request from pool \a pool if provided.
764  * Returns allocated request structure with import field filled or
765  * NULL on error.
766  */
767 static inline
768 struct ptlrpc_request *__ptlrpc_request_alloc(struct obd_import *imp,
769                                               struct ptlrpc_request_pool *pool)
770 {
771         struct ptlrpc_request *request = NULL;
772
773         if (pool)
774                 request = ptlrpc_prep_req_from_pool(pool);
775
776         if (!request)
777                 request = ptlrpc_request_cache_alloc(GFP_NOFS);
778
779         if (request) {
780                 ptlrpc_cli_req_init(request);
781
782                 LASSERTF((unsigned long)imp > 0x1000, "%p", imp);
783                 LASSERT(imp != LP_POISON);
784                 LASSERTF((unsigned long)imp->imp_client > 0x1000, "%p\n",
785                         imp->imp_client);
786                 LASSERT(imp->imp_client != LP_POISON);
787
788                 request->rq_import = class_import_get(imp);
789         } else {
790                 CERROR("request allocation out of memory\n");
791         }
792
793         return request;
794 }
795
796 /**
797  * Helper function for creating a request.
798  * Calls __ptlrpc_request_alloc to allocate new request sturcture and inits
799  * buffer structures according to capsule template \a format.
800  * Returns allocated request structure pointer or NULL on error.
801  */
802 static struct ptlrpc_request *
803 ptlrpc_request_alloc_internal(struct obd_import *imp,
804                               struct ptlrpc_request_pool * pool,
805                               const struct req_format *format)
806 {
807         struct ptlrpc_request *request;
808
809         request = __ptlrpc_request_alloc(imp, pool);
810         if (request == NULL)
811                 return NULL;
812
813         req_capsule_init(&request->rq_pill, request, RCL_CLIENT);
814         req_capsule_set(&request->rq_pill, format);
815         return request;
816 }
817
818 /**
819  * Allocate new request structure for import \a imp and initialize its
820  * buffer structure according to capsule template \a format.
821  */
822 struct ptlrpc_request *ptlrpc_request_alloc(struct obd_import *imp,
823                                             const struct req_format *format)
824 {
825         return ptlrpc_request_alloc_internal(imp, NULL, format);
826 }
827 EXPORT_SYMBOL(ptlrpc_request_alloc);
828
829 /**
830  * Allocate new request structure for import \a imp from pool \a pool and
831  * initialize its buffer structure according to capsule template \a format.
832  */
833 struct ptlrpc_request *ptlrpc_request_alloc_pool(struct obd_import *imp,
834                                             struct ptlrpc_request_pool * pool,
835                                             const struct req_format *format)
836 {
837         return ptlrpc_request_alloc_internal(imp, pool, format);
838 }
839 EXPORT_SYMBOL(ptlrpc_request_alloc_pool);
840
841 /**
842  * For requests not from pool, free memory of the request structure.
843  * For requests obtained from a pool earlier, return request back to pool.
844  */
845 void ptlrpc_request_free(struct ptlrpc_request *request)
846 {
847         if (request->rq_pool)
848                 __ptlrpc_free_req_to_pool(request);
849         else
850                 ptlrpc_request_cache_free(request);
851 }
852 EXPORT_SYMBOL(ptlrpc_request_free);
853
854 /**
855  * Allocate new request for operatione \a opcode and immediatelly pack it for
856  * network transfer.
857  * Only used for simple requests like OBD_PING where the only important
858  * part of the request is operation itself.
859  * Returns allocated request or NULL on error.
860  */
861 struct ptlrpc_request *ptlrpc_request_alloc_pack(struct obd_import *imp,
862                                                 const struct req_format *format,
863                                                 __u32 version, int opcode)
864 {
865         struct ptlrpc_request *req = ptlrpc_request_alloc(imp, format);
866         int                    rc;
867
868         if (req) {
869                 rc = ptlrpc_request_pack(req, version, opcode);
870                 if (rc) {
871                         ptlrpc_request_free(req);
872                         req = NULL;
873                 }
874         }
875         return req;
876 }
877 EXPORT_SYMBOL(ptlrpc_request_alloc_pack);
878
879 /**
880  * Prepare request (fetched from pool \a poolif not NULL) on import \a imp
881  * for operation \a opcode. Request would contain \a count buffers.
882  * Sizes of buffers are described in array \a lengths and buffers themselves
883  * are provided by a pointer \a bufs.
884  * Returns prepared request structure pointer or NULL on error.
885  */
886 struct ptlrpc_request *
887 ptlrpc_prep_req_pool(struct obd_import *imp,
888                      __u32 version, int opcode,
889                      int count, __u32 *lengths, char **bufs,
890                      struct ptlrpc_request_pool *pool)
891 {
892         struct ptlrpc_request *request;
893         int                    rc;
894
895         request = __ptlrpc_request_alloc(imp, pool);
896         if (!request)
897                 return NULL;
898
899         rc = __ptlrpc_request_bufs_pack(request, version, opcode, count,
900                                         lengths, bufs, NULL);
901         if (rc) {
902                 ptlrpc_request_free(request);
903                 request = NULL;
904         }
905         return request;
906 }
907
908 /**
909  * Same as ptlrpc_prep_req_pool, but without pool
910  */
911 struct ptlrpc_request *
912 ptlrpc_prep_req(struct obd_import *imp, __u32 version, int opcode, int count,
913                 __u32 *lengths, char **bufs)
914 {
915         return ptlrpc_prep_req_pool(imp, version, opcode, count, lengths, bufs,
916                                     NULL);
917 }
918
919 /**
920  * Allocate and initialize new request set structure.
921  * Returns a pointer to the newly allocated set structure or NULL on error.
922  */
923 struct ptlrpc_request_set *ptlrpc_prep_set(void)
924 {
925         struct ptlrpc_request_set *set;
926
927         ENTRY;
928         OBD_ALLOC(set, sizeof *set);
929         if (!set)
930                 RETURN(NULL);
931         atomic_set(&set->set_refcount, 1);
932         INIT_LIST_HEAD(&set->set_requests);
933         init_waitqueue_head(&set->set_waitq);
934         atomic_set(&set->set_new_count, 0);
935         atomic_set(&set->set_remaining, 0);
936         spin_lock_init(&set->set_new_req_lock);
937         INIT_LIST_HEAD(&set->set_new_requests);
938         INIT_LIST_HEAD(&set->set_cblist);
939         set->set_max_inflight = UINT_MAX;
940         set->set_producer     = NULL;
941         set->set_producer_arg = NULL;
942         set->set_rc           = 0;
943
944         RETURN(set);
945 }
946 EXPORT_SYMBOL(ptlrpc_prep_set);
947
948 /**
949  * Allocate and initialize new request set structure with flow control
950  * extension. This extension allows to control the number of requests in-flight
951  * for the whole set. A callback function to generate requests must be provided
952  * and the request set will keep the number of requests sent over the wire to
953  * @max_inflight.
954  * Returns a pointer to the newly allocated set structure or NULL on error.
955  */
956 struct ptlrpc_request_set *ptlrpc_prep_fcset(int max, set_producer_func func,
957                                              void *arg)
958
959 {
960         struct ptlrpc_request_set *set;
961
962         set = ptlrpc_prep_set();
963         if (!set)
964                 RETURN(NULL);
965
966         set->set_max_inflight  = max;
967         set->set_producer      = func;
968         set->set_producer_arg  = arg;
969
970         RETURN(set);
971 }
972
973 /**
974  * Wind down and free request set structure previously allocated with
975  * ptlrpc_prep_set.
976  * Ensures that all requests on the set have completed and removes
977  * all requests from the request list in a set.
978  * If any unsent request happen to be on the list, pretends that they got
979  * an error in flight and calls their completion handler.
980  */
981 void ptlrpc_set_destroy(struct ptlrpc_request_set *set)
982 {
983         struct list_head        *tmp;
984         struct list_head        *next;
985         int                      expected_phase;
986         int                      n = 0;
987         ENTRY;
988
989         /* Requests on the set should either all be completed, or all be new */
990         expected_phase = (atomic_read(&set->set_remaining) == 0) ?
991                          RQ_PHASE_COMPLETE : RQ_PHASE_NEW;
992         list_for_each(tmp, &set->set_requests) {
993                 struct ptlrpc_request *req =
994                         list_entry(tmp, struct ptlrpc_request,
995                                    rq_set_chain);
996
997                 LASSERT(req->rq_phase == expected_phase);
998                 n++;
999         }
1000
1001         LASSERTF(atomic_read(&set->set_remaining) == 0 ||
1002                  atomic_read(&set->set_remaining) == n, "%d / %d\n",
1003                  atomic_read(&set->set_remaining), n);
1004
1005         list_for_each_safe(tmp, next, &set->set_requests) {
1006                 struct ptlrpc_request *req =
1007                         list_entry(tmp, struct ptlrpc_request,
1008                                    rq_set_chain);
1009                 list_del_init(&req->rq_set_chain);
1010
1011                 LASSERT(req->rq_phase == expected_phase);
1012
1013                 if (req->rq_phase == RQ_PHASE_NEW) {
1014                         ptlrpc_req_interpret(NULL, req, -EBADR);
1015                         atomic_dec(&set->set_remaining);
1016                 }
1017
1018                 spin_lock(&req->rq_lock);
1019                 req->rq_set = NULL;
1020                 req->rq_invalid_rqset = 0;
1021                 spin_unlock(&req->rq_lock);
1022
1023                 ptlrpc_req_finished (req);
1024         }
1025
1026         LASSERT(atomic_read(&set->set_remaining) == 0);
1027
1028         ptlrpc_reqset_put(set);
1029         EXIT;
1030 }
1031 EXPORT_SYMBOL(ptlrpc_set_destroy);
1032
1033 /**
1034  * Add a callback function \a fn to the set.
1035  * This function would be called when all requests on this set are completed.
1036  * The function will be passed \a data argument.
1037  */
1038 int ptlrpc_set_add_cb(struct ptlrpc_request_set *set,
1039                       set_interpreter_func fn, void *data)
1040 {
1041         struct ptlrpc_set_cbdata *cbdata;
1042
1043         OBD_ALLOC_PTR(cbdata);
1044         if (cbdata == NULL)
1045                 RETURN(-ENOMEM);
1046
1047         cbdata->psc_interpret = fn;
1048         cbdata->psc_data = data;
1049         list_add_tail(&cbdata->psc_item, &set->set_cblist);
1050
1051         RETURN(0);
1052 }
1053
1054 /**
1055  * Add a new request to the general purpose request set.
1056  * Assumes request reference from the caller.
1057  */
1058 void ptlrpc_set_add_req(struct ptlrpc_request_set *set,
1059                         struct ptlrpc_request *req)
1060 {
1061         LASSERT(list_empty(&req->rq_set_chain));
1062
1063         /* The set takes over the caller's request reference */
1064         list_add_tail(&req->rq_set_chain, &set->set_requests);
1065         req->rq_set = set;
1066         atomic_inc(&set->set_remaining);
1067         req->rq_queued_time = cfs_time_current();
1068
1069         if (req->rq_reqmsg != NULL)
1070                 lustre_msg_set_jobid(req->rq_reqmsg, NULL);
1071
1072         if (set->set_producer != NULL)
1073                 /* If the request set has a producer callback, the RPC must be
1074                  * sent straight away */
1075                 ptlrpc_send_new_req(req);
1076 }
1077 EXPORT_SYMBOL(ptlrpc_set_add_req);
1078
1079 /**
1080  * Add a request to a request with dedicated server thread
1081  * and wake the thread to make any necessary processing.
1082  * Currently only used for ptlrpcd.
1083  */
1084 void ptlrpc_set_add_new_req(struct ptlrpcd_ctl *pc,
1085                            struct ptlrpc_request *req)
1086 {
1087         struct ptlrpc_request_set *set = pc->pc_set;
1088         int count, i;
1089
1090         LASSERT(req->rq_set == NULL);
1091         LASSERT(test_bit(LIOD_STOP, &pc->pc_flags) == 0);
1092
1093         spin_lock(&set->set_new_req_lock);
1094         /*
1095          * The set takes over the caller's request reference.
1096          */
1097         req->rq_set = set;
1098         req->rq_queued_time = cfs_time_current();
1099         list_add_tail(&req->rq_set_chain, &set->set_new_requests);
1100         count = atomic_inc_return(&set->set_new_count);
1101         spin_unlock(&set->set_new_req_lock);
1102
1103         /* Only need to call wakeup once for the first entry. */
1104         if (count == 1) {
1105                 wake_up(&set->set_waitq);
1106
1107                 /* XXX: It maybe unnecessary to wakeup all the partners. But to
1108                  *      guarantee the async RPC can be processed ASAP, we have
1109                  *      no other better choice. It maybe fixed in future. */
1110                 for (i = 0; i < pc->pc_npartners; i++)
1111                         wake_up(&pc->pc_partners[i]->pc_set->set_waitq);
1112         }
1113 }
1114
1115 /**
1116  * Based on the current state of the import, determine if the request
1117  * can be sent, is an error, or should be delayed.
1118  *
1119  * Returns true if this request should be delayed. If false, and
1120  * *status is set, then the request can not be sent and *status is the
1121  * error code.  If false and status is 0, then request can be sent.
1122  *
1123  * The imp->imp_lock must be held.
1124  */
1125 static int ptlrpc_import_delay_req(struct obd_import *imp,
1126                                    struct ptlrpc_request *req, int *status)
1127 {
1128         int delay = 0;
1129         ENTRY;
1130
1131         LASSERT (status != NULL);
1132         *status = 0;
1133
1134         if (req->rq_ctx_init || req->rq_ctx_fini) {
1135                 /* always allow ctx init/fini rpc go through */
1136         } else if (imp->imp_state == LUSTRE_IMP_NEW) {
1137                 DEBUG_REQ(D_ERROR, req, "Uninitialized import.");
1138                 *status = -EIO;
1139         } else if (imp->imp_state == LUSTRE_IMP_CLOSED) {
1140                 /* pings may safely race with umount */
1141                 DEBUG_REQ(lustre_msg_get_opc(req->rq_reqmsg) == OBD_PING ?
1142                           D_HA : D_ERROR, req, "IMP_CLOSED ");
1143                 *status = -EIO;
1144         } else if (ptlrpc_send_limit_expired(req)) {
1145                 /* probably doesn't need to be a D_ERROR after initial testing*/
1146                 DEBUG_REQ(D_HA, req, "send limit expired ");
1147                 *status = -ETIMEDOUT;
1148         } else if (req->rq_send_state == LUSTRE_IMP_CONNECTING &&
1149                    imp->imp_state == LUSTRE_IMP_CONNECTING) {
1150                 /* allow CONNECT even if import is invalid */ ;
1151                 if (atomic_read(&imp->imp_inval_count) != 0) {
1152                         DEBUG_REQ(D_ERROR, req, "invalidate in flight");
1153                         *status = -EIO;
1154                 }
1155         } else if (imp->imp_invalid || imp->imp_obd->obd_no_recov) {
1156                 if (!imp->imp_deactive)
1157                         DEBUG_REQ(D_NET, req, "IMP_INVALID");
1158                 *status = -ESHUTDOWN; /* bz 12940 */
1159         } else if (req->rq_import_generation != imp->imp_generation) {
1160                 DEBUG_REQ(D_ERROR, req, "req wrong generation:");
1161                 *status = -EIO;
1162         } else if (req->rq_send_state != imp->imp_state) {
1163                 /* invalidate in progress - any requests should be drop */
1164                 if (atomic_read(&imp->imp_inval_count) != 0) {
1165                         DEBUG_REQ(D_ERROR, req, "invalidate in flight");
1166                         *status = -EIO;
1167                 } else if (imp->imp_dlm_fake || req->rq_no_delay) {
1168                         *status = -EWOULDBLOCK;
1169                 } else if (req->rq_allow_replay &&
1170                           (imp->imp_state == LUSTRE_IMP_REPLAY ||
1171                            imp->imp_state == LUSTRE_IMP_REPLAY_LOCKS ||
1172                            imp->imp_state == LUSTRE_IMP_REPLAY_WAIT ||
1173                            imp->imp_state == LUSTRE_IMP_RECOVER)) {
1174                         DEBUG_REQ(D_HA, req, "allow during recovery.\n");
1175                 } else {
1176                         delay = 1;
1177                 }
1178         }
1179
1180         RETURN(delay);
1181 }
1182
1183 /**
1184  * Decide if the error message should be printed to the console or not.
1185  * Makes its decision based on request type, status, and failure frequency.
1186  *
1187  * \param[in] req  request that failed and may need a console message
1188  *
1189  * \retval false if no message should be printed
1190  * \retval true  if console message should be printed
1191  */
1192 static bool ptlrpc_console_allow(struct ptlrpc_request *req)
1193 {
1194         __u32 opc;
1195
1196         LASSERT(req->rq_reqmsg != NULL);
1197         opc = lustre_msg_get_opc(req->rq_reqmsg);
1198
1199         /* Suppress particular reconnect errors which are to be expected. */
1200         if (opc == OST_CONNECT || opc == MDS_CONNECT || opc == MGS_CONNECT) {
1201                 int err;
1202
1203                 /* Suppress timed out reconnect requests */
1204                 if (lustre_handle_is_used(&req->rq_import->imp_remote_handle) ||
1205                     req->rq_timedout)
1206                         return false;
1207
1208                 /* Suppress most unavailable/again reconnect requests, but
1209                  * print occasionally so it is clear client is trying to
1210                  * connect to a server where no target is running. */
1211                 err = lustre_msg_get_status(req->rq_repmsg);
1212                 if ((err == -ENODEV || err == -EAGAIN) &&
1213                     req->rq_import->imp_conn_cnt % 30 != 20)
1214                         return false;
1215         }
1216
1217         return true;
1218 }
1219
1220 /**
1221  * Check request processing status.
1222  * Returns the status.
1223  */
1224 static int ptlrpc_check_status(struct ptlrpc_request *req)
1225 {
1226         int err;
1227         ENTRY;
1228
1229         err = lustre_msg_get_status(req->rq_repmsg);
1230         if (lustre_msg_get_type(req->rq_repmsg) == PTL_RPC_MSG_ERR) {
1231                 struct obd_import *imp = req->rq_import;
1232                 lnet_nid_t nid = imp->imp_connection->c_peer.nid;
1233                 __u32 opc = lustre_msg_get_opc(req->rq_reqmsg);
1234
1235                 if (ptlrpc_console_allow(req))
1236                         LCONSOLE_ERROR_MSG(0x11, "%s: operation %s to node %s "
1237                                            "failed: rc = %d\n",
1238                                            imp->imp_obd->obd_name,
1239                                            ll_opcode2str(opc),
1240                                            libcfs_nid2str(nid), err);
1241                 RETURN(err < 0 ? err : -EINVAL);
1242         }
1243
1244         if (err < 0) {
1245                 DEBUG_REQ(D_INFO, req, "status is %d", err);
1246         } else if (err > 0) {
1247                 /* XXX: translate this error from net to host */
1248                 DEBUG_REQ(D_INFO, req, "status is %d", err);
1249         }
1250
1251         RETURN(err);
1252 }
1253
1254 /**
1255  * save pre-versions of objects into request for replay.
1256  * Versions are obtained from server reply.
1257  * used for VBR.
1258  */
1259 static void ptlrpc_save_versions(struct ptlrpc_request *req)
1260 {
1261         struct lustre_msg *repmsg = req->rq_repmsg;
1262         struct lustre_msg *reqmsg = req->rq_reqmsg;
1263         __u64 *versions = lustre_msg_get_versions(repmsg);
1264         ENTRY;
1265
1266         if (lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)
1267                 return;
1268
1269         LASSERT(versions);
1270         lustre_msg_set_versions(reqmsg, versions);
1271         CDEBUG(D_INFO, "Client save versions ["LPX64"/"LPX64"]\n",
1272                versions[0], versions[1]);
1273
1274         EXIT;
1275 }
1276
1277 /**
1278  * Callback function called when client receives RPC reply for \a req.
1279  * Returns 0 on success or error code.
1280  * The return alue would be assigned to req->rq_status by the caller
1281  * as request processing status.
1282  * This function also decides if the request needs to be saved for later replay.
1283  */
1284 static int after_reply(struct ptlrpc_request *req)
1285 {
1286         struct obd_import *imp = req->rq_import;
1287         struct obd_device *obd = req->rq_import->imp_obd;
1288         int rc;
1289         struct timeval work_start;
1290         long timediff;
1291         ENTRY;
1292
1293         LASSERT(obd != NULL);
1294         /* repbuf must be unlinked */
1295         LASSERT(!req->rq_receiving_reply && req->rq_reply_unlinked);
1296
1297         if (req->rq_reply_truncated) {
1298                 if (ptlrpc_no_resend(req)) {
1299                         DEBUG_REQ(D_ERROR, req, "reply buffer overflow,"
1300                                   " expected: %d, actual size: %d",
1301                                   req->rq_nob_received, req->rq_repbuf_len);
1302                         RETURN(-EOVERFLOW);
1303                 }
1304
1305                 sptlrpc_cli_free_repbuf(req);
1306                 /* Pass the required reply buffer size (include
1307                  * space for early reply).
1308                  * NB: no need to roundup because alloc_repbuf
1309                  * will roundup it */
1310                 req->rq_replen       = req->rq_nob_received;
1311                 req->rq_nob_received = 0;
1312                 spin_lock(&req->rq_lock);
1313                 req->rq_resend       = 1;
1314                 spin_unlock(&req->rq_lock);
1315                 RETURN(0);
1316         }
1317
1318         do_gettimeofday(&work_start);
1319         timediff = cfs_timeval_sub(&work_start, &req->rq_sent_tv, NULL);
1320
1321         /*
1322          * NB Until this point, the whole of the incoming message,
1323          * including buflens, status etc is in the sender's byte order.
1324          */
1325         rc = sptlrpc_cli_unwrap_reply(req);
1326         if (rc) {
1327                 DEBUG_REQ(D_ERROR, req, "unwrap reply failed (%d):", rc);
1328                 RETURN(rc);
1329         }
1330
1331         /*
1332          * Security layer unwrap might ask resend this request.
1333          */
1334         if (req->rq_resend)
1335                 RETURN(0);
1336
1337         rc = unpack_reply(req);
1338         if (rc)
1339                 RETURN(rc);
1340
1341         /* retry indefinitely on EINPROGRESS */
1342         if (lustre_msg_get_status(req->rq_repmsg) == -EINPROGRESS &&
1343             ptlrpc_no_resend(req) == 0 && !req->rq_no_retry_einprogress) {
1344                 time_t  now = cfs_time_current_sec();
1345
1346                 DEBUG_REQ(D_RPCTRACE, req, "Resending request on EINPROGRESS");
1347                 spin_lock(&req->rq_lock);
1348                 req->rq_resend = 1;
1349                 spin_unlock(&req->rq_lock);
1350                 req->rq_nr_resend++;
1351
1352                 /* Readjust the timeout for current conditions */
1353                 ptlrpc_at_set_req_timeout(req);
1354                 /* delay resend to give a chance to the server to get ready.
1355                  * The delay is increased by 1s on every resend and is capped to
1356                  * the current request timeout (i.e. obd_timeout if AT is off,
1357                  * or AT service time x 125% + 5s, see at_est2timeout) */
1358                 if (req->rq_nr_resend > req->rq_timeout)
1359                         req->rq_sent = now + req->rq_timeout;
1360                 else
1361                         req->rq_sent = now + req->rq_nr_resend;
1362
1363                 RETURN(0);
1364         }
1365
1366         if (obd->obd_svc_stats != NULL) {
1367                 lprocfs_counter_add(obd->obd_svc_stats, PTLRPC_REQWAIT_CNTR,
1368                                     timediff);
1369                 ptlrpc_lprocfs_rpc_sent(req, timediff);
1370         }
1371
1372         if (lustre_msg_get_type(req->rq_repmsg) != PTL_RPC_MSG_REPLY &&
1373             lustre_msg_get_type(req->rq_repmsg) != PTL_RPC_MSG_ERR) {
1374                 DEBUG_REQ(D_ERROR, req, "invalid packet received (type=%u)",
1375                           lustre_msg_get_type(req->rq_repmsg));
1376                 RETURN(-EPROTO);
1377         }
1378
1379         if (lustre_msg_get_opc(req->rq_reqmsg) != OBD_PING)
1380                 CFS_FAIL_TIMEOUT(OBD_FAIL_PTLRPC_PAUSE_REP, cfs_fail_val);
1381         ptlrpc_at_adj_service(req, lustre_msg_get_timeout(req->rq_repmsg));
1382         ptlrpc_at_adj_net_latency(req,
1383                                   lustre_msg_get_service_time(req->rq_repmsg));
1384
1385         rc = ptlrpc_check_status(req);
1386         imp->imp_connect_error = rc;
1387
1388         if (rc) {
1389                 /*
1390                  * Either we've been evicted, or the server has failed for
1391                  * some reason. Try to reconnect, and if that fails, punt to
1392                  * the upcall.
1393                  */
1394                 if (ptlrpc_recoverable_error(rc)) {
1395                         if (req->rq_send_state != LUSTRE_IMP_FULL ||
1396                             imp->imp_obd->obd_no_recov || imp->imp_dlm_fake) {
1397                                 RETURN(rc);
1398                         }
1399                         ptlrpc_request_handle_notconn(req);
1400                         RETURN(rc);
1401                 }
1402         } else {
1403                 /*
1404                  * Let's look if server sent slv. Do it only for RPC with
1405                  * rc == 0.
1406                  */
1407                 ldlm_cli_update_pool(req);
1408         }
1409
1410         /*
1411          * Store transno in reqmsg for replay.
1412          */
1413         if (!(lustre_msg_get_flags(req->rq_reqmsg) & MSG_REPLAY)) {
1414                 req->rq_transno = lustre_msg_get_transno(req->rq_repmsg);
1415                 lustre_msg_set_transno(req->rq_reqmsg, req->rq_transno);
1416         }
1417
1418         if (imp->imp_replayable) {
1419                 spin_lock(&imp->imp_lock);
1420                 /*
1421                  * No point in adding already-committed requests to the replay
1422                  * list, we will just remove them immediately. b=9829
1423                  */
1424                 if (req->rq_transno != 0 &&
1425                     (req->rq_transno >
1426                      lustre_msg_get_last_committed(req->rq_repmsg) ||
1427                      req->rq_replay)) {
1428                         /** version recovery */
1429                         ptlrpc_save_versions(req);
1430                         ptlrpc_retain_replayable_request(req, imp);
1431                 } else if (req->rq_commit_cb != NULL &&
1432                            list_empty(&req->rq_replay_list)) {
1433                         /* NB: don't call rq_commit_cb if it's already on
1434                          * rq_replay_list, ptlrpc_free_committed() will call
1435                          * it later, see LU-3618 for details */
1436                         spin_unlock(&imp->imp_lock);
1437                         req->rq_commit_cb(req);
1438                         spin_lock(&imp->imp_lock);
1439                 }
1440
1441                 /*
1442                  * Replay-enabled imports return commit-status information.
1443                  */
1444                 if (lustre_msg_get_last_committed(req->rq_repmsg)) {
1445                         imp->imp_peer_committed_transno =
1446                                 lustre_msg_get_last_committed(req->rq_repmsg);
1447                 }
1448
1449                 ptlrpc_free_committed(imp);
1450
1451                 if (!list_empty(&imp->imp_replay_list)) {
1452                         struct ptlrpc_request *last;
1453
1454                         last = list_entry(imp->imp_replay_list.prev,
1455                                           struct ptlrpc_request,
1456                                           rq_replay_list);
1457                         /*
1458                          * Requests with rq_replay stay on the list even if no
1459                          * commit is expected.
1460                          */
1461                         if (last->rq_transno > imp->imp_peer_committed_transno)
1462                                 ptlrpc_pinger_commit_expected(imp);
1463                 }
1464
1465                 spin_unlock(&imp->imp_lock);
1466         }
1467
1468         RETURN(rc);
1469 }
1470
1471 /**
1472  * Helper function to send request \a req over the network for the first time
1473  * Also adjusts request phase.
1474  * Returns 0 on success or error code.
1475  */
1476 static int ptlrpc_send_new_req(struct ptlrpc_request *req)
1477 {
1478         struct obd_import     *imp = req->rq_import;
1479         struct list_head      *tmp;
1480         __u64                  min_xid = ~0ULL;
1481         int rc;
1482         ENTRY;
1483
1484         LASSERT(req->rq_phase == RQ_PHASE_NEW);
1485         if (req->rq_sent && (req->rq_sent > cfs_time_current_sec()) &&
1486             (!req->rq_generation_set ||
1487              req->rq_import_generation == imp->imp_generation))
1488                 RETURN (0);
1489
1490         ptlrpc_rqphase_move(req, RQ_PHASE_RPC);
1491
1492         spin_lock(&imp->imp_lock);
1493
1494         /* the very first time we assign XID. it's important to assign XID
1495          * and put it on the list atomically, so that the lowest assigned
1496          * XID is always known. this is vital for multislot last_rcvd */
1497         if (req->rq_send_state == LUSTRE_IMP_REPLAY) {
1498                 LASSERT(req->rq_xid != 0);
1499         } else {
1500                 LASSERT(req->rq_xid == 0);
1501                 req->rq_xid = ptlrpc_next_xid();
1502         }
1503
1504         if (!req->rq_generation_set)
1505                 req->rq_import_generation = imp->imp_generation;
1506
1507         if (ptlrpc_import_delay_req(imp, req, &rc)) {
1508                 spin_lock(&req->rq_lock);
1509                 req->rq_waiting = 1;
1510                 spin_unlock(&req->rq_lock);
1511
1512                 DEBUG_REQ(D_HA, req, "req from PID %d waiting for recovery: "
1513                           "(%s != %s)", lustre_msg_get_status(req->rq_reqmsg),
1514                           ptlrpc_import_state_name(req->rq_send_state),
1515                           ptlrpc_import_state_name(imp->imp_state));
1516                 LASSERT(list_empty(&req->rq_list));
1517                 list_add_tail(&req->rq_list, &imp->imp_delayed_list);
1518                 atomic_inc(&req->rq_import->imp_inflight);
1519                 spin_unlock(&imp->imp_lock);
1520                 RETURN(0);
1521         }
1522
1523         if (rc != 0) {
1524                 spin_unlock(&imp->imp_lock);
1525                 req->rq_status = rc;
1526                 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1527                 RETURN(rc);
1528         }
1529
1530         LASSERT(list_empty(&req->rq_list));
1531         list_add_tail(&req->rq_list, &imp->imp_sending_list);
1532         atomic_inc(&req->rq_import->imp_inflight);
1533
1534         /* find the lowest unreplied XID */
1535         list_for_each(tmp, &imp->imp_delayed_list) {
1536                 struct ptlrpc_request *r;
1537                 r = list_entry(tmp, struct ptlrpc_request, rq_list);
1538                 if (r->rq_xid < min_xid)
1539                         min_xid = r->rq_xid;
1540         }
1541         list_for_each(tmp, &imp->imp_sending_list) {
1542                 struct ptlrpc_request *r;
1543                 r = list_entry(tmp, struct ptlrpc_request, rq_list);
1544                 if (r->rq_xid < min_xid)
1545                         min_xid = r->rq_xid;
1546         }
1547         spin_unlock(&imp->imp_lock);
1548
1549         if (likely(min_xid != ~0ULL))
1550                 lustre_msg_set_last_xid(req->rq_reqmsg, min_xid - 1);
1551
1552         lustre_msg_set_status(req->rq_reqmsg, current_pid());
1553
1554         rc = sptlrpc_req_refresh_ctx(req, -1);
1555         if (rc) {
1556                 if (req->rq_err) {
1557                         req->rq_status = rc;
1558                         RETURN(1);
1559                 } else {
1560                         spin_lock(&req->rq_lock);
1561                         req->rq_wait_ctx = 1;
1562                         spin_unlock(&req->rq_lock);
1563                         RETURN(0);
1564                 }
1565         }
1566
1567         CDEBUG(D_RPCTRACE, "Sending RPC pname:cluuid:pid:xid:nid:opc"
1568                " %s:%s:%d:"LPU64":%s:%d\n", current_comm(),
1569                imp->imp_obd->obd_uuid.uuid,
1570                lustre_msg_get_status(req->rq_reqmsg), req->rq_xid,
1571                libcfs_nid2str(imp->imp_connection->c_peer.nid),
1572                lustre_msg_get_opc(req->rq_reqmsg));
1573
1574         rc = ptl_send_rpc(req, 0);
1575         if (rc) {
1576                 DEBUG_REQ(D_HA, req, "send failed (%d); expect timeout", rc);
1577                 spin_lock(&req->rq_lock);
1578                 req->rq_net_err = 1;
1579                 spin_unlock(&req->rq_lock);
1580                 RETURN(rc);
1581         }
1582         RETURN(0);
1583 }
1584
1585 static inline int ptlrpc_set_producer(struct ptlrpc_request_set *set)
1586 {
1587         int remaining, rc;
1588         ENTRY;
1589
1590         LASSERT(set->set_producer != NULL);
1591
1592         remaining = atomic_read(&set->set_remaining);
1593
1594         /* populate the ->set_requests list with requests until we
1595          * reach the maximum number of RPCs in flight for this set */
1596         while (atomic_read(&set->set_remaining) < set->set_max_inflight) {
1597                 rc = set->set_producer(set, set->set_producer_arg);
1598                 if (rc == -ENOENT) {
1599                         /* no more RPC to produce */
1600                         set->set_producer     = NULL;
1601                         set->set_producer_arg = NULL;
1602                         RETURN(0);
1603                 }
1604         }
1605
1606         RETURN((atomic_read(&set->set_remaining) - remaining));
1607 }
1608
1609 /**
1610  * this sends any unsent RPCs in \a set and returns 1 if all are sent
1611  * and no more replies are expected.
1612  * (it is possible to get less replies than requests sent e.g. due to timed out
1613  * requests or requests that we had trouble to send out)
1614  *
1615  * NOTE: This function contains a potential schedule point (cond_resched()).
1616  */
1617 int ptlrpc_check_set(const struct lu_env *env, struct ptlrpc_request_set *set)
1618 {
1619         struct list_head *tmp, *next;
1620         struct list_head  comp_reqs;
1621         int force_timer_recalc = 0;
1622         ENTRY;
1623
1624         if (atomic_read(&set->set_remaining) == 0)
1625                 RETURN(1);
1626
1627         INIT_LIST_HEAD(&comp_reqs);
1628         list_for_each_safe(tmp, next, &set->set_requests) {
1629                 struct ptlrpc_request *req =
1630                         list_entry(tmp, struct ptlrpc_request,
1631                                    rq_set_chain);
1632                 struct obd_import *imp = req->rq_import;
1633                 int unregistered = 0;
1634                 int rc = 0;
1635
1636                 /* This schedule point is mainly for the ptlrpcd caller of this
1637                  * function.  Most ptlrpc sets are not long-lived and unbounded
1638                  * in length, but at the least the set used by the ptlrpcd is.
1639                  * Since the processing time is unbounded, we need to insert an
1640                  * explicit schedule point to make the thread well-behaved.
1641                  */
1642                 cond_resched();
1643
1644                 if (req->rq_phase == RQ_PHASE_NEW &&
1645                     ptlrpc_send_new_req(req)) {
1646                         force_timer_recalc = 1;
1647                 }
1648
1649                 /* delayed send - skip */
1650                 if (req->rq_phase == RQ_PHASE_NEW && req->rq_sent)
1651                         continue;
1652
1653                 /* delayed resend - skip */
1654                 if (req->rq_phase == RQ_PHASE_RPC && req->rq_resend &&
1655                     req->rq_sent > cfs_time_current_sec())
1656                         continue;
1657
1658                 if (!(req->rq_phase == RQ_PHASE_RPC ||
1659                       req->rq_phase == RQ_PHASE_BULK ||
1660                       req->rq_phase == RQ_PHASE_INTERPRET ||
1661                       req->rq_phase == RQ_PHASE_UNREGISTERING ||
1662                       req->rq_phase == RQ_PHASE_COMPLETE)) {
1663                         DEBUG_REQ(D_ERROR, req, "bad phase %x", req->rq_phase);
1664                         LBUG();
1665                 }
1666
1667                 if (req->rq_phase == RQ_PHASE_UNREGISTERING) {
1668                         LASSERT(req->rq_next_phase != req->rq_phase);
1669                         LASSERT(req->rq_next_phase != RQ_PHASE_UNDEFINED);
1670
1671                         /*
1672                          * Skip processing until reply is unlinked. We
1673                          * can't return to pool before that and we can't
1674                          * call interpret before that. We need to make
1675                          * sure that all rdma transfers finished and will
1676                          * not corrupt any data.
1677                          */
1678                         if (ptlrpc_client_recv_or_unlink(req) ||
1679                             ptlrpc_client_bulk_active(req))
1680                                 continue;
1681
1682                         /*
1683                          * Turn fail_loc off to prevent it from looping
1684                          * forever.
1685                          */
1686                         if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK)) {
1687                                 OBD_FAIL_CHECK_ORSET(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK,
1688                                                      OBD_FAIL_ONCE);
1689                         }
1690                         if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK)) {
1691                                 OBD_FAIL_CHECK_ORSET(OBD_FAIL_PTLRPC_LONG_BULK_UNLINK,
1692                                                      OBD_FAIL_ONCE);
1693                         }
1694
1695                         /*
1696                          * Move to next phase if reply was successfully
1697                          * unlinked.
1698                          */
1699                         ptlrpc_rqphase_move(req, req->rq_next_phase);
1700                 }
1701
1702                 if (req->rq_phase == RQ_PHASE_COMPLETE) {
1703                         list_move_tail(&req->rq_set_chain, &comp_reqs);
1704                         continue;
1705                 }
1706
1707                 if (req->rq_phase == RQ_PHASE_INTERPRET)
1708                         GOTO(interpret, req->rq_status);
1709
1710                 /*
1711                  * Note that this also will start async reply unlink.
1712                  */
1713                 if (req->rq_net_err && !req->rq_timedout) {
1714                         ptlrpc_expire_one_request(req, 1);
1715
1716                         /*
1717                          * Check if we still need to wait for unlink.
1718                          */
1719                         if (ptlrpc_client_recv_or_unlink(req) ||
1720                             ptlrpc_client_bulk_active(req))
1721                                 continue;
1722                         /* If there is no need to resend, fail it now. */
1723                         if (req->rq_no_resend) {
1724                                 if (req->rq_status == 0)
1725                                         req->rq_status = -EIO;
1726                                 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1727                                 GOTO(interpret, req->rq_status);
1728                         } else {
1729                                 continue;
1730                         }
1731                 }
1732
1733                 if (req->rq_err) {
1734                         spin_lock(&req->rq_lock);
1735                         req->rq_replied = 0;
1736                         spin_unlock(&req->rq_lock);
1737                         if (req->rq_status == 0)
1738                                 req->rq_status = -EIO;
1739                         ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1740                         GOTO(interpret, req->rq_status);
1741                 }
1742
1743                 /* ptlrpc_set_wait->l_wait_event sets lwi_allow_intr
1744                  * so it sets rq_intr regardless of individual rpc
1745                  * timeouts. The synchronous IO waiting path sets
1746                  * rq_intr irrespective of whether ptlrpcd
1747                  * has seen a timeout.  Our policy is to only interpret
1748                  * interrupted rpcs after they have timed out, so we
1749                  * need to enforce that here.
1750                  */
1751
1752                 if (req->rq_intr && (req->rq_timedout || req->rq_waiting ||
1753                                      req->rq_wait_ctx)) {
1754                         req->rq_status = -EINTR;
1755                         ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1756                         GOTO(interpret, req->rq_status);
1757                 }
1758
1759                 if (req->rq_phase == RQ_PHASE_RPC) {
1760                         if (req->rq_timedout || req->rq_resend ||
1761                             req->rq_waiting || req->rq_wait_ctx) {
1762                                 int status;
1763
1764                                 if (!ptlrpc_unregister_reply(req, 1)) {
1765                                         ptlrpc_unregister_bulk(req, 1);
1766                                         continue;
1767                                 }
1768
1769                                 spin_lock(&imp->imp_lock);
1770                                 if (ptlrpc_import_delay_req(imp, req, &status)){
1771                                         /* put on delay list - only if we wait
1772                                          * recovery finished - before send */
1773                                         list_del_init(&req->rq_list);
1774                                         list_add_tail(&req->rq_list,
1775                                                           &imp->
1776                                                           imp_delayed_list);
1777                                         spin_unlock(&imp->imp_lock);
1778                                         continue;
1779                                 }
1780
1781                                 if (status != 0)  {
1782                                         req->rq_status = status;
1783                                         ptlrpc_rqphase_move(req,
1784                                                 RQ_PHASE_INTERPRET);
1785                                         spin_unlock(&imp->imp_lock);
1786                                         GOTO(interpret, req->rq_status);
1787                                 }
1788                                 if (ptlrpc_no_resend(req) &&
1789                                     !req->rq_wait_ctx) {
1790                                         req->rq_status = -ENOTCONN;
1791                                         ptlrpc_rqphase_move(req,
1792                                                             RQ_PHASE_INTERPRET);
1793                                         spin_unlock(&imp->imp_lock);
1794                                         GOTO(interpret, req->rq_status);
1795                                 }
1796
1797                                 list_del_init(&req->rq_list);
1798                                 list_add_tail(&req->rq_list,
1799                                                   &imp->imp_sending_list);
1800
1801                                 spin_unlock(&imp->imp_lock);
1802
1803                                 spin_lock(&req->rq_lock);
1804                                 req->rq_waiting = 0;
1805                                 spin_unlock(&req->rq_lock);
1806
1807                                 if (req->rq_timedout || req->rq_resend) {
1808                                         /* This is re-sending anyways,
1809                                          * let's mark req as resend. */
1810                                         spin_lock(&req->rq_lock);
1811                                         req->rq_resend = 1;
1812                                         spin_unlock(&req->rq_lock);
1813
1814                                         if (req->rq_bulk != NULL &&
1815                                             !ptlrpc_unregister_bulk(req, 1))
1816                                                 continue;
1817                                 }
1818                                 /*
1819                                  * rq_wait_ctx is only touched by ptlrpcd,
1820                                  * so no lock is needed here.
1821                                  */
1822                                 status = sptlrpc_req_refresh_ctx(req, -1);
1823                                 if (status) {
1824                                         if (req->rq_err) {
1825                                                 req->rq_status = status;
1826                                                 spin_lock(&req->rq_lock);
1827                                                 req->rq_wait_ctx = 0;
1828                                                 spin_unlock(&req->rq_lock);
1829                                                 force_timer_recalc = 1;
1830                                         } else {
1831                                                 spin_lock(&req->rq_lock);
1832                                                 req->rq_wait_ctx = 1;
1833                                                 spin_unlock(&req->rq_lock);
1834                                         }
1835
1836                                         continue;
1837                                 } else {
1838                                         spin_lock(&req->rq_lock);
1839                                         req->rq_wait_ctx = 0;
1840                                         spin_unlock(&req->rq_lock);
1841                                 }
1842
1843                                 rc = ptl_send_rpc(req, 0);
1844                                 if (rc) {
1845                                         DEBUG_REQ(D_HA, req,
1846                                                   "send failed: rc = %d", rc);
1847                                         force_timer_recalc = 1;
1848                                         spin_lock(&req->rq_lock);
1849                                         req->rq_net_err = 1;
1850                                         spin_unlock(&req->rq_lock);
1851                                         continue;
1852                                 }
1853                                 /* need to reset the timeout */
1854                                 force_timer_recalc = 1;
1855                         }
1856
1857                         spin_lock(&req->rq_lock);
1858
1859                         if (ptlrpc_client_early(req)) {
1860                                 ptlrpc_at_recv_early_reply(req);
1861                                 spin_unlock(&req->rq_lock);
1862                                 continue;
1863                         }
1864
1865                         /* Still waiting for a reply? */
1866                         if (ptlrpc_client_recv(req)) {
1867                                 spin_unlock(&req->rq_lock);
1868                                 continue;
1869                         }
1870
1871                         /* Did we actually receive a reply? */
1872                         if (!ptlrpc_client_replied(req)) {
1873                                 spin_unlock(&req->rq_lock);
1874                                 continue;
1875                         }
1876
1877                         spin_unlock(&req->rq_lock);
1878
1879                         /* unlink from net because we are going to
1880                          * swab in-place of reply buffer */
1881                         unregistered = ptlrpc_unregister_reply(req, 1);
1882                         if (!unregistered)
1883                                 continue;
1884
1885                         req->rq_status = after_reply(req);
1886                         if (req->rq_resend)
1887                                 continue;
1888
1889                         /* If there is no bulk associated with this request,
1890                          * then we're done and should let the interpreter
1891                          * process the reply. Similarly if the RPC returned
1892                          * an error, and therefore the bulk will never arrive.
1893                          */
1894                         if (req->rq_bulk == NULL || req->rq_status < 0) {
1895                                 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1896                                 GOTO(interpret, req->rq_status);
1897                         }
1898
1899                         ptlrpc_rqphase_move(req, RQ_PHASE_BULK);
1900                 }
1901
1902                 LASSERT(req->rq_phase == RQ_PHASE_BULK);
1903                 if (ptlrpc_client_bulk_active(req))
1904                         continue;
1905
1906                 if (req->rq_bulk->bd_failure) {
1907                         /* The RPC reply arrived OK, but the bulk screwed
1908                          * up!  Dead weird since the server told us the RPC
1909                          * was good after getting the REPLY for her GET or
1910                          * the ACK for her PUT. */
1911                         DEBUG_REQ(D_ERROR, req, "bulk transfer failed");
1912                         req->rq_status = -EIO;
1913                 }
1914
1915                 ptlrpc_rqphase_move(req, RQ_PHASE_INTERPRET);
1916
1917         interpret:
1918                 LASSERT(req->rq_phase == RQ_PHASE_INTERPRET);
1919
1920                 /* This moves to "unregistering" phase we need to wait for
1921                  * reply unlink. */
1922                 if (!unregistered && !ptlrpc_unregister_reply(req, 1)) {
1923                         /* start async bulk unlink too */
1924                         ptlrpc_unregister_bulk(req, 1);
1925                         continue;
1926                 }
1927
1928                 if (!ptlrpc_unregister_bulk(req, 1))
1929                         continue;
1930
1931                 /* When calling interpret receiving already should be
1932                  * finished. */
1933                 LASSERT(!req->rq_receiving_reply);
1934
1935                 ptlrpc_req_interpret(env, req, req->rq_status);
1936
1937                 if (ptlrpcd_check_work(req)) {
1938                         atomic_dec(&set->set_remaining);
1939                         continue;
1940                 }
1941                 ptlrpc_rqphase_move(req, RQ_PHASE_COMPLETE);
1942
1943                 CDEBUG(req->rq_reqmsg != NULL ? D_RPCTRACE : 0,
1944                         "Completed RPC pname:cluuid:pid:xid:nid:"
1945                         "opc %s:%s:%d:"LPU64":%s:%d\n",
1946                         current_comm(), imp->imp_obd->obd_uuid.uuid,
1947                         lustre_msg_get_status(req->rq_reqmsg), req->rq_xid,
1948                         libcfs_nid2str(imp->imp_connection->c_peer.nid),
1949                         lustre_msg_get_opc(req->rq_reqmsg));
1950
1951                 spin_lock(&imp->imp_lock);
1952                 /* Request already may be not on sending or delaying list. This
1953                  * may happen in the case of marking it erroneous for the case
1954                  * ptlrpc_import_delay_req(req, status) find it impossible to
1955                  * allow sending this rpc and returns *status != 0. */
1956                 if (!list_empty(&req->rq_list)) {
1957                         list_del_init(&req->rq_list);
1958                         atomic_dec(&imp->imp_inflight);
1959                 }
1960                 spin_unlock(&imp->imp_lock);
1961
1962                 atomic_dec(&set->set_remaining);
1963                 wake_up_all(&imp->imp_recovery_waitq);
1964
1965                 if (set->set_producer) {
1966                         /* produce a new request if possible */
1967                         if (ptlrpc_set_producer(set) > 0)
1968                                 force_timer_recalc = 1;
1969
1970                         /* free the request that has just been completed
1971                          * in order not to pollute set->set_requests */
1972                         list_del_init(&req->rq_set_chain);
1973                         spin_lock(&req->rq_lock);
1974                         req->rq_set = NULL;
1975                         req->rq_invalid_rqset = 0;
1976                         spin_unlock(&req->rq_lock);
1977
1978                         /* record rq_status to compute the final status later */
1979                         if (req->rq_status != 0)
1980                                 set->set_rc = req->rq_status;
1981                         ptlrpc_req_finished(req);
1982                 } else {
1983                         list_move_tail(&req->rq_set_chain, &comp_reqs);
1984                 }
1985         }
1986
1987         /* move completed request at the head of list so it's easier for
1988          * caller to find them */
1989         list_splice(&comp_reqs, &set->set_requests);
1990
1991         /* If we hit an error, we want to recover promptly. */
1992         RETURN(atomic_read(&set->set_remaining) == 0 || force_timer_recalc);
1993 }
1994 EXPORT_SYMBOL(ptlrpc_check_set);
1995
1996 /**
1997  * Time out request \a req. is \a async_unlink is set, that means do not wait
1998  * until LNet actually confirms network buffer unlinking.
1999  * Return 1 if we should give up further retrying attempts or 0 otherwise.
2000  */
2001 int ptlrpc_expire_one_request(struct ptlrpc_request *req, int async_unlink)
2002 {
2003         struct obd_import *imp = req->rq_import;
2004         int rc = 0;
2005         ENTRY;
2006
2007         spin_lock(&req->rq_lock);
2008         req->rq_timedout = 1;
2009         spin_unlock(&req->rq_lock);
2010
2011         DEBUG_REQ(D_WARNING, req, "Request sent has %s: [sent "CFS_DURATION_T
2012                   "/real "CFS_DURATION_T"]",
2013                   req->rq_net_err ? "failed due to network error" :
2014                      ((req->rq_real_sent == 0 ||
2015                        cfs_time_before(req->rq_real_sent, req->rq_sent) ||
2016                        cfs_time_aftereq(req->rq_real_sent, req->rq_deadline)) ?
2017                       "timed out for sent delay" : "timed out for slow reply"),
2018                   req->rq_sent, req->rq_real_sent);
2019
2020         if (imp != NULL && obd_debug_peer_on_timeout)
2021                 LNetCtl(IOC_LIBCFS_DEBUG_PEER, &imp->imp_connection->c_peer);
2022
2023         ptlrpc_unregister_reply(req, async_unlink);
2024         ptlrpc_unregister_bulk(req, async_unlink);
2025
2026         if (obd_dump_on_timeout)
2027                 libcfs_debug_dumplog();
2028
2029         if (imp == NULL) {
2030                 DEBUG_REQ(D_HA, req, "NULL import: already cleaned up?");
2031                 RETURN(1);
2032         }
2033
2034         atomic_inc(&imp->imp_timeouts);
2035
2036         /* The DLM server doesn't want recovery run on its imports. */
2037         if (imp->imp_dlm_fake)
2038                 RETURN(1);
2039
2040         /* If this request is for recovery or other primordial tasks,
2041          * then error it out here. */
2042         if (req->rq_ctx_init || req->rq_ctx_fini ||
2043             req->rq_send_state != LUSTRE_IMP_FULL ||
2044             imp->imp_obd->obd_no_recov) {
2045                 DEBUG_REQ(D_RPCTRACE, req, "err -110, sent_state=%s (now=%s)",
2046                           ptlrpc_import_state_name(req->rq_send_state),
2047                           ptlrpc_import_state_name(imp->imp_state));
2048                 spin_lock(&req->rq_lock);
2049                 req->rq_status = -ETIMEDOUT;
2050                 req->rq_err = 1;
2051                 spin_unlock(&req->rq_lock);
2052                 RETURN(1);
2053         }
2054
2055         /* if a request can't be resent we can't wait for an answer after
2056            the timeout */
2057         if (ptlrpc_no_resend(req)) {
2058                 DEBUG_REQ(D_RPCTRACE, req, "TIMEOUT-NORESEND:");
2059                 rc = 1;
2060         }
2061
2062         ptlrpc_fail_import(imp, lustre_msg_get_conn_cnt(req->rq_reqmsg));
2063
2064         RETURN(rc);
2065 }
2066
2067 /**
2068  * Time out all uncompleted requests in request set pointed by \a data
2069  * Callback used when waiting on sets with l_wait_event.
2070  * Always returns 1.
2071  */
2072 int ptlrpc_expired_set(void *data)
2073 {
2074         struct ptlrpc_request_set       *set = data;
2075         struct list_head                *tmp;
2076         time_t                          now = cfs_time_current_sec();
2077         ENTRY;
2078
2079         LASSERT(set != NULL);
2080
2081         /*
2082          * A timeout expired. See which reqs it applies to...
2083          */
2084         list_for_each(tmp, &set->set_requests) {
2085                 struct ptlrpc_request *req =
2086                         list_entry(tmp, struct ptlrpc_request,
2087                                    rq_set_chain);
2088
2089                 /* don't expire request waiting for context */
2090                 if (req->rq_wait_ctx)
2091                         continue;
2092
2093                 /* Request in-flight? */
2094                 if (!((req->rq_phase == RQ_PHASE_RPC &&
2095                        !req->rq_waiting && !req->rq_resend) ||
2096                       (req->rq_phase == RQ_PHASE_BULK)))
2097                         continue;
2098
2099                 if (req->rq_timedout ||     /* already dealt with */
2100                     req->rq_deadline > now) /* not expired */
2101                         continue;
2102
2103                 /* Deal with this guy. Do it asynchronously to not block
2104                  * ptlrpcd thread. */
2105                 ptlrpc_expire_one_request(req, 1);
2106         }
2107
2108         /*
2109          * When waiting for a whole set, we always break out of the
2110          * sleep so we can recalculate the timeout, or enable interrupts
2111          * if everyone's timed out.
2112          */
2113         RETURN(1);
2114 }
2115
2116 /**
2117  * Sets rq_intr flag in \a req under spinlock.
2118  */
2119 void ptlrpc_mark_interrupted(struct ptlrpc_request *req)
2120 {
2121         spin_lock(&req->rq_lock);
2122         req->rq_intr = 1;
2123         spin_unlock(&req->rq_lock);
2124 }
2125 EXPORT_SYMBOL(ptlrpc_mark_interrupted);
2126
2127 /**
2128  * Interrupts (sets interrupted flag) all uncompleted requests in
2129  * a set \a data. Callback for l_wait_event for interruptible waits.
2130  */
2131 static void ptlrpc_interrupted_set(void *data)
2132 {
2133         struct ptlrpc_request_set *set = data;
2134         struct list_head *tmp;
2135
2136         LASSERT(set != NULL);
2137         CDEBUG(D_RPCTRACE, "INTERRUPTED SET %p\n", set);
2138
2139         list_for_each(tmp, &set->set_requests) {
2140                 struct ptlrpc_request *req =
2141                         list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2142
2143                 if (req->rq_phase != RQ_PHASE_RPC &&
2144                     req->rq_phase != RQ_PHASE_UNREGISTERING)
2145                         continue;
2146
2147                 ptlrpc_mark_interrupted(req);
2148         }
2149 }
2150
2151 /**
2152  * Get the smallest timeout in the set; this does NOT set a timeout.
2153  */
2154 int ptlrpc_set_next_timeout(struct ptlrpc_request_set *set)
2155 {
2156         struct list_head        *tmp;
2157         time_t                   now = cfs_time_current_sec();
2158         int                      timeout = 0;
2159         struct ptlrpc_request   *req;
2160         int                      deadline;
2161         ENTRY;
2162
2163         list_for_each(tmp, &set->set_requests) {
2164                 req = list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2165
2166                 /*
2167                  * Request in-flight?
2168                  */
2169                 if (!(((req->rq_phase == RQ_PHASE_RPC) && !req->rq_waiting) ||
2170                       (req->rq_phase == RQ_PHASE_BULK) ||
2171                       (req->rq_phase == RQ_PHASE_NEW)))
2172                         continue;
2173
2174                 /*
2175                  * Already timed out.
2176                  */
2177                 if (req->rq_timedout)
2178                         continue;
2179
2180                 /*
2181                  * Waiting for ctx.
2182                  */
2183                 if (req->rq_wait_ctx)
2184                         continue;
2185
2186                 if (req->rq_phase == RQ_PHASE_NEW)
2187                         deadline = req->rq_sent;
2188                 else if (req->rq_phase == RQ_PHASE_RPC && req->rq_resend)
2189                         deadline = req->rq_sent;
2190                 else
2191                         deadline = req->rq_sent + req->rq_timeout;
2192
2193                 if (deadline <= now)    /* actually expired already */
2194                         timeout = 1;    /* ASAP */
2195                 else if (timeout == 0 || timeout > deadline - now)
2196                         timeout = deadline - now;
2197         }
2198         RETURN(timeout);
2199 }
2200
2201 /**
2202  * Send all unset request from the set and then wait untill all
2203  * requests in the set complete (either get a reply, timeout, get an
2204  * error or otherwise be interrupted).
2205  * Returns 0 on success or error code otherwise.
2206  */
2207 int ptlrpc_set_wait(struct ptlrpc_request_set *set)
2208 {
2209         struct list_head            *tmp;
2210         struct ptlrpc_request *req;
2211         struct l_wait_info     lwi;
2212         int                    rc, timeout;
2213         ENTRY;
2214
2215         if (set->set_producer)
2216                 (void)ptlrpc_set_producer(set);
2217         else
2218                 list_for_each(tmp, &set->set_requests) {
2219                         req = list_entry(tmp, struct ptlrpc_request,
2220                                          rq_set_chain);
2221                         if (req->rq_phase == RQ_PHASE_NEW)
2222                                 (void)ptlrpc_send_new_req(req);
2223                 }
2224
2225         if (list_empty(&set->set_requests))
2226                 RETURN(0);
2227
2228         do {
2229                 timeout = ptlrpc_set_next_timeout(set);
2230
2231                 /* wait until all complete, interrupted, or an in-flight
2232                  * req times out */
2233                 CDEBUG(D_RPCTRACE, "set %p going to sleep for %d seconds\n",
2234                        set, timeout);
2235
2236                 if (timeout == 0 && !signal_pending(current))
2237                         /*
2238                          * No requests are in-flight (ether timed out
2239                          * or delayed), so we can allow interrupts.
2240                          * We still want to block for a limited time,
2241                          * so we allow interrupts during the timeout.
2242                          */
2243                         lwi = LWI_TIMEOUT_INTR_ALL(cfs_time_seconds(1),
2244                                                    ptlrpc_expired_set,
2245                                                    ptlrpc_interrupted_set, set);
2246                 else
2247                         /*
2248                          * At least one request is in flight, so no
2249                          * interrupts are allowed. Wait until all
2250                          * complete, or an in-flight req times out.
2251                          */
2252                         lwi = LWI_TIMEOUT(cfs_time_seconds(timeout? timeout : 1),
2253                                           ptlrpc_expired_set, set);
2254
2255                 rc = l_wait_event(set->set_waitq, ptlrpc_check_set(NULL, set), &lwi);
2256
2257                 /* LU-769 - if we ignored the signal because it was already
2258                  * pending when we started, we need to handle it now or we risk
2259                  * it being ignored forever */
2260                 if (rc == -ETIMEDOUT && !lwi.lwi_allow_intr &&
2261                     signal_pending(current)) {
2262                         sigset_t blocked_sigs =
2263                                            cfs_block_sigsinv(LUSTRE_FATAL_SIGS);
2264
2265                         /* In fact we only interrupt for the "fatal" signals
2266                          * like SIGINT or SIGKILL. We still ignore less
2267                          * important signals since ptlrpc set is not easily
2268                          * reentrant from userspace again */
2269                         if (signal_pending(current))
2270                                 ptlrpc_interrupted_set(set);
2271                         cfs_restore_sigs(blocked_sigs);
2272                 }
2273
2274                 LASSERT(rc == 0 || rc == -EINTR || rc == -ETIMEDOUT);
2275
2276                 /* -EINTR => all requests have been flagged rq_intr so next
2277                  * check completes.
2278                  * -ETIMEDOUT => someone timed out.  When all reqs have
2279                  * timed out, signals are enabled allowing completion with
2280                  * EINTR.
2281                  * I don't really care if we go once more round the loop in
2282                  * the error cases -eeb. */
2283                 if (rc == 0 && atomic_read(&set->set_remaining) == 0) {
2284                         list_for_each(tmp, &set->set_requests) {
2285                                 req = list_entry(tmp, struct ptlrpc_request,
2286                                                  rq_set_chain);
2287                                 spin_lock(&req->rq_lock);
2288                                 req->rq_invalid_rqset = 1;
2289                                 spin_unlock(&req->rq_lock);
2290                         }
2291                 }
2292         } while (rc != 0 || atomic_read(&set->set_remaining) != 0);
2293
2294         LASSERT(atomic_read(&set->set_remaining) == 0);
2295
2296         rc = set->set_rc; /* rq_status of already freed requests if any */
2297         list_for_each(tmp, &set->set_requests) {
2298                 req = list_entry(tmp, struct ptlrpc_request, rq_set_chain);
2299
2300                 LASSERT(req->rq_phase == RQ_PHASE_COMPLETE);
2301                 if (req->rq_status != 0)
2302                         rc = req->rq_status;
2303         }
2304
2305         if (set->set_interpret != NULL) {
2306                 int (*interpreter)(struct ptlrpc_request_set *set,void *,int) =
2307                         set->set_interpret;
2308                 rc = interpreter (set, set->set_arg, rc);
2309         } else {
2310                 struct ptlrpc_set_cbdata *cbdata, *n;
2311                 int err;
2312
2313                 list_for_each_entry_safe(cbdata, n,
2314                                          &set->set_cblist, psc_item) {
2315                         list_del_init(&cbdata->psc_item);
2316                         err = cbdata->psc_interpret(set, cbdata->psc_data, rc);
2317                         if (err && !rc)
2318                                 rc = err;
2319                         OBD_FREE_PTR(cbdata);
2320                 }
2321         }
2322
2323         RETURN(rc);
2324 }
2325 EXPORT_SYMBOL(ptlrpc_set_wait);
2326
2327 /**
2328  * Helper fuction for request freeing.
2329  * Called when request count reached zero and request needs to be freed.
2330  * Removes request from all sorts of sending/replay lists it might be on,
2331  * frees network buffers if any are present.
2332  * If \a locked is set, that means caller is already holding import imp_lock
2333  * and so we no longer need to reobtain it (for certain lists manipulations)
2334  */
2335 static void __ptlrpc_free_req(struct ptlrpc_request *request, int locked)
2336 {
2337         ENTRY;
2338
2339         if (request == NULL)
2340                 RETURN_EXIT;
2341
2342         LASSERT(!request->rq_srv_req);
2343         LASSERT(request->rq_export == NULL);
2344         LASSERTF(!request->rq_receiving_reply, "req %p\n", request);
2345         LASSERTF(list_empty(&request->rq_list), "req %p\n", request);
2346         LASSERTF(list_empty(&request->rq_set_chain), "req %p\n", request);
2347         LASSERTF(!request->rq_replay, "req %p\n", request);
2348
2349         req_capsule_fini(&request->rq_pill);
2350
2351         /* We must take it off the imp_replay_list first.  Otherwise, we'll set
2352          * request->rq_reqmsg to NULL while osc_close is dereferencing it. */
2353         if (request->rq_import != NULL) {
2354                 if (!locked)
2355                         spin_lock(&request->rq_import->imp_lock);
2356                 list_del_init(&request->rq_replay_list);
2357                 if (!locked)
2358                         spin_unlock(&request->rq_import->imp_lock);
2359         }
2360         LASSERTF(list_empty(&request->rq_replay_list), "req %p\n", request);
2361
2362         if (atomic_read(&request->rq_refcount) != 0) {
2363                 DEBUG_REQ(D_ERROR, request,
2364                           "freeing request with nonzero refcount");
2365                 LBUG();
2366         }
2367
2368         if (request->rq_repbuf != NULL)
2369                 sptlrpc_cli_free_repbuf(request);
2370
2371         if (request->rq_import != NULL) {
2372                 class_import_put(request->rq_import);
2373                 request->rq_import = NULL;
2374         }
2375         if (request->rq_bulk != NULL)
2376                 ptlrpc_free_bulk(request->rq_bulk);
2377
2378         if (request->rq_reqbuf != NULL || request->rq_clrbuf != NULL)
2379                 sptlrpc_cli_free_reqbuf(request);
2380
2381         if (request->rq_cli_ctx)
2382                 sptlrpc_req_put_ctx(request, !locked);
2383
2384         if (request->rq_pool)
2385                 __ptlrpc_free_req_to_pool(request);
2386         else
2387                 ptlrpc_request_cache_free(request);
2388         EXIT;
2389 }
2390
2391 static int __ptlrpc_req_finished(struct ptlrpc_request *request, int locked);
2392 /**
2393  * Drop one request reference. Must be called with import imp_lock held.
2394  * When reference count drops to zero, request is freed.
2395  */
2396 void ptlrpc_req_finished_with_imp_lock(struct ptlrpc_request *request)
2397 {
2398         assert_spin_locked(&request->rq_import->imp_lock);
2399         (void)__ptlrpc_req_finished(request, 1);
2400 }
2401
2402 /**
2403  * Helper function
2404  * Drops one reference count for request \a request.
2405  * \a locked set indicates that caller holds import imp_lock.
2406  * Frees the request whe reference count reaches zero.
2407  */
2408 static int __ptlrpc_req_finished(struct ptlrpc_request *request, int locked)
2409 {
2410         ENTRY;
2411         if (request == NULL)
2412                 RETURN(1);
2413
2414         if (request == LP_POISON ||
2415             request->rq_reqmsg == LP_POISON) {
2416                 CERROR("dereferencing freed request (bug 575)\n");
2417                 LBUG();
2418                 RETURN(1);
2419         }
2420
2421         DEBUG_REQ(D_INFO, request, "refcount now %u",
2422                   atomic_read(&request->rq_refcount) - 1);
2423
2424         if (atomic_dec_and_test(&request->rq_refcount)) {
2425                 __ptlrpc_free_req(request, locked);
2426                 RETURN(1);
2427         }
2428
2429         RETURN(0);
2430 }
2431
2432 /**
2433  * Drops one reference count for a request.
2434  */
2435 void ptlrpc_req_finished(struct ptlrpc_request *request)
2436 {
2437         __ptlrpc_req_finished(request, 0);
2438 }
2439 EXPORT_SYMBOL(ptlrpc_req_finished);
2440
2441 /**
2442  * Returns xid of a \a request
2443  */
2444 __u64 ptlrpc_req_xid(struct ptlrpc_request *request)
2445 {
2446         return request->rq_xid;
2447 }
2448 EXPORT_SYMBOL(ptlrpc_req_xid);
2449
2450 /**
2451  * Disengage the client's reply buffer from the network
2452  * NB does _NOT_ unregister any client-side bulk.
2453  * IDEMPOTENT, but _not_ safe against concurrent callers.
2454  * The request owner (i.e. the thread doing the I/O) must call...
2455  * Returns 0 on success or 1 if unregistering cannot be made.
2456  */
2457 static int ptlrpc_unregister_reply(struct ptlrpc_request *request, int async)
2458 {
2459         int                rc;
2460         struct l_wait_info lwi;
2461
2462         /*
2463          * Might sleep.
2464          */
2465         LASSERT(!in_interrupt());
2466
2467         /*
2468          * Let's setup deadline for reply unlink.
2469          */
2470         if (OBD_FAIL_CHECK(OBD_FAIL_PTLRPC_LONG_REPL_UNLINK) &&
2471             async && request->rq_reply_deadline == 0)
2472                 request->rq_reply_deadline = cfs_time_current_sec()+LONG_UNLINK;
2473
2474         /*
2475          * Nothing left to do.
2476          */
2477         if (!ptlrpc_client_recv_or_unlink(request))
2478                 RETURN(1);
2479
2480         LNetMDUnlink(request->rq_reply_md_h);
2481
2482         /*
2483          * Let's check it once again.
2484          */
2485         if (!ptlrpc_client_recv_or_unlink(request))
2486                 RETURN(1);
2487
2488         /*
2489          * Move to "Unregistering" phase as reply was not unlinked yet.
2490          */
2491         ptlrpc_rqphase_move(request, RQ_PHASE_UNREGISTERING);
2492
2493         /*
2494          * Do not wait for unlink to finish.
2495          */
2496         if (async)
2497                 RETURN(0);
2498
2499         /*
2500          * We have to l_wait_event() whatever the result, to give liblustre
2501          * a chance to run reply_in_callback(), and to make sure we've
2502          * unlinked before returning a req to the pool.
2503          */
2504         for (;;) {
2505                 /* The wq argument is ignored by user-space wait_event macros */
2506                 wait_queue_head_t *wq = (request->rq_set != NULL) ?
2507                                         &request->rq_set->set_waitq :
2508                                         &request->rq_reply_waitq;
2509                 /* Network access will complete in finite time but the HUGE
2510                  * timeout lets us CWARN for visibility of sluggish NALs */
2511                 lwi = LWI_TIMEOUT_INTERVAL(cfs_time_seconds(LONG_UNLINK),
2512                                            cfs_time_seconds(1), NULL, NULL);
2513                 rc = l_wait_event(*wq, !ptlrpc_client_recv_or_unlink(request),
2514                                   &lwi);
2515                 if (rc == 0) {
2516                         ptlrpc_rqphase_move(request, request->rq_next_phase);
2517                         RETURN(1);
2518                 }
2519
2520                 LASSERT(rc == -ETIMEDOUT);
2521                 DEBUG_REQ(D_WARNING, request, "Unexpectedly long timeout "
2522                           "receiving_reply=%d req_ulinked=%d reply_unlinked=%d",
2523                           request->rq_receiving_reply,
2524                           request->rq_req_unlinked,
2525                           request->rq_reply_unlinked);
2526         }
2527         RETURN(0);
2528 }
2529
2530 static void ptlrpc_free_request(struct ptlrpc_request *req)
2531 {
2532         spin_lock(&req->rq_lock);
2533         req->rq_replay = 0;
2534         spin_unlock(&req->rq_lock);
2535
2536         if (req->rq_commit_cb != NULL)
2537                 req->rq_commit_cb(req);
2538         list_del_init(&req->rq_replay_list);
2539
2540         __ptlrpc_req_finished(req, 1);
2541 }
2542
2543 /**
2544  * the request is committed and dropped from the replay list of its import
2545  */
2546 void ptlrpc_request_committed(struct ptlrpc_request *req, int force)
2547 {
2548         struct obd_import       *imp = req->rq_import;
2549
2550         spin_lock(&imp->imp_lock);
2551         if (list_empty(&req->rq_replay_list)) {
2552                 spin_unlock(&imp->imp_lock);
2553                 return;
2554         }
2555
2556         if (force || req->rq_transno <= imp->imp_peer_committed_transno)
2557                 ptlrpc_free_request(req);
2558
2559         spin_unlock(&imp->imp_lock);
2560 }
2561 EXPORT_SYMBOL(ptlrpc_request_committed);
2562
2563 /**
2564  * Iterates through replay_list on import and prunes
2565  * all requests have transno smaller than last_committed for the
2566  * import and don't have rq_replay set.
2567  * Since requests are sorted in transno order, stops when meetign first
2568  * transno bigger than last_committed.
2569  * caller must hold imp->imp_lock
2570  */
2571 void ptlrpc_free_committed(struct obd_import *imp)
2572 {
2573         struct ptlrpc_request   *req, *saved;
2574         struct ptlrpc_request   *last_req = NULL; /* temporary fire escape */
2575         bool                     skip_committed_list = true;
2576         ENTRY;
2577
2578         LASSERT(imp != NULL);
2579         assert_spin_locked(&imp->imp_lock);
2580
2581         if (imp->imp_peer_committed_transno == imp->imp_last_transno_checked &&
2582             imp->imp_generation == imp->imp_last_generation_checked) {
2583                 CDEBUG(D_INFO, "%s: skip recheck: last_committed "LPU64"\n",
2584                        imp->imp_obd->obd_name, imp->imp_peer_committed_transno);
2585                 RETURN_EXIT;
2586         }
2587         CDEBUG(D_RPCTRACE, "%s: committing for last_committed "LPU64" gen %d\n",
2588                imp->imp_obd->obd_name, imp->imp_peer_committed_transno,
2589                imp->imp_generation);
2590
2591         if (imp->imp_generation != imp->imp_last_generation_checked ||
2592             imp->imp_last_transno_checked == 0)
2593                 skip_committed_list = false;
2594
2595         imp->imp_last_transno_checked = imp->imp_peer_committed_transno;
2596         imp->imp_last_generation_checked = imp->imp_generation;
2597
2598         list_for_each_entry_safe(req, saved, &imp->imp_replay_list,
2599                                      rq_replay_list) {
2600                 /* XXX ok to remove when 1357 resolved - rread 05/29/03  */
2601                 LASSERT(req != last_req);
2602                 last_req = req;
2603
2604                 if (req->rq_transno == 0) {
2605                         DEBUG_REQ(D_EMERG, req, "zero transno during replay");
2606                         LBUG();
2607                 }
2608                 if (req->rq_import_generation < imp->imp_generation) {
2609                         DEBUG_REQ(D_RPCTRACE, req, "free request with old gen");
2610                         GOTO(free_req, 0);
2611                 }
2612
2613                 /* not yet committed */
2614                 if (req->rq_transno > imp->imp_peer_committed_transno) {
2615                         DEBUG_REQ(D_RPCTRACE, req, "stopping search");
2616                         break;
2617                 }
2618
2619                 if (req->rq_replay) {
2620                         DEBUG_REQ(D_RPCTRACE, req, "keeping (FL_REPLAY)");
2621                         list_move_tail(&req->rq_replay_list,
2622                                            &imp->imp_committed_list);
2623                         continue;
2624                 }
2625
2626                 DEBUG_REQ(D_INFO, req, "commit (last_committed "LPU64")",
2627                           imp->imp_peer_committed_transno);
2628 free_req:
2629                 ptlrpc_free_request(req);
2630         }
2631
2632         if (skip_committed_list)
2633                 GOTO(out, 0);
2634
2635         list_for_each_entry_safe(req, saved, &imp->imp_committed_list,
2636                                      rq_replay_list) {
2637                 LASSERT(req->rq_transno != 0);
2638                 if (req->rq_import_generation < imp->imp_generation) {
2639                         DEBUG_REQ(D_RPCTRACE, req, "free stale open request");
2640                         ptlrpc_free_request(req);
2641                 } else if (!req->rq_replay) {
2642                         DEBUG_REQ(D_RPCTRACE, req, "free closed open request");
2643                         ptlrpc_free_request(req);
2644                 }
2645         }
2646 out:
2647         EXIT;
2648 }
2649
2650 void ptlrpc_cleanup_client(struct obd_import *imp)
2651 {
2652         ENTRY;
2653         EXIT;
2654 }
2655
2656 /**
2657  * Schedule previously sent request for resend.
2658  * For bulk requests we assign new xid (to avoid problems with
2659  * lost replies and therefore several transfers landing into same buffer
2660  * from different sending attempts).
2661  */
2662 void ptlrpc_resend_req(struct ptlrpc_request *req)
2663 {
2664         DEBUG_REQ(D_HA, req, "going to resend");
2665         spin_lock(&req->rq_lock);
2666
2667         /* Request got reply but linked to the import list still.
2668            Let ptlrpc_check_set() to process it. */
2669         if (ptlrpc_client_replied(req)) {
2670                 spin_unlock(&req->rq_lock);
2671                 DEBUG_REQ(D_HA, req, "it has reply, so skip it");
2672                 return;
2673         }
2674
2675         lustre_msg_set_handle(req->rq_reqmsg, &(struct lustre_handle){ 0 });
2676         req->rq_status = -EAGAIN;
2677
2678         req->rq_resend = 1;
2679         req->rq_net_err = 0;
2680         req->rq_timedout = 0;
2681
2682         ptlrpc_client_wake_req(req);
2683         spin_unlock(&req->rq_lock);
2684 }
2685
2686 /* XXX: this function and rq_status are currently unused */
2687 void ptlrpc_restart_req(struct ptlrpc_request *req)
2688 {
2689         DEBUG_REQ(D_HA, req, "restarting (possibly-)completed request");
2690         req->rq_status = -ERESTARTSYS;
2691
2692         spin_lock(&req->rq_lock);
2693         req->rq_restart = 1;
2694         req->rq_timedout = 0;
2695         ptlrpc_client_wake_req(req);
2696         spin_unlock(&req->rq_lock);
2697 }
2698
2699 /**
2700  * Grab additional reference on a request \a req
2701  */
2702 struct ptlrpc_request *ptlrpc_request_addref(struct ptlrpc_request *req)
2703 {
2704         ENTRY;
2705         atomic_inc(&req->rq_refcount);
2706         RETURN(req);
2707 }
2708 EXPORT_SYMBOL(ptlrpc_request_addref);
2709
2710 /**
2711  * Add a request to import replay_list.
2712  * Must be called under imp_lock
2713  */
2714 void ptlrpc_retain_replayable_request(struct ptlrpc_request *req,
2715                                       struct obd_import *imp)
2716 {
2717         struct list_head *tmp;
2718
2719         assert_spin_locked(&imp->imp_lock);
2720
2721         if (req->rq_transno == 0) {
2722                 DEBUG_REQ(D_EMERG, req, "saving request with zero transno");
2723                 LBUG();
2724         }
2725
2726         /* clear this for new requests that were resent as well
2727            as resent replayed requests. */
2728         lustre_msg_clear_flags(req->rq_reqmsg, MSG_RESENT);
2729
2730         /* don't re-add requests that have been replayed */
2731         if (!list_empty(&req->rq_replay_list))
2732                 return;
2733
2734         lustre_msg_add_flags(req->rq_reqmsg, MSG_REPLAY);
2735
2736         LASSERT(imp->imp_replayable);
2737         /* Balanced in ptlrpc_free_committed, usually. */
2738         ptlrpc_request_addref(req);
2739         list_for_each_prev(tmp, &imp->imp_replay_list) {
2740                 struct ptlrpc_request *iter = list_entry(tmp,
2741                                                          struct ptlrpc_request,
2742                                                          rq_replay_list);
2743
2744                 /* We may have duplicate transnos if we create and then
2745                  * open a file, or for closes retained if to match creating
2746                  * opens, so use req->rq_xid as a secondary key.
2747                  * (See bugs 684, 685, and 428.)
2748                  * XXX no longer needed, but all opens need transnos!
2749                  */
2750                 if (iter->rq_transno > req->rq_transno)
2751                         continue;
2752
2753                 if (iter->rq_transno == req->rq_transno) {
2754                         LASSERT(iter->rq_xid != req->rq_xid);
2755                         if (iter->rq_xid > req->rq_xid)
2756                                 continue;
2757                 }
2758
2759                 list_add(&req->rq_replay_list, &iter->rq_replay_list);
2760                 return;
2761         }
2762
2763         list_add(&req->rq_replay_list, &imp->imp_replay_list);
2764 }
2765
2766 /**
2767  * Send request and wait until it completes.
2768  * Returns request processing status.
2769  */
2770 int ptlrpc_queue_wait(struct ptlrpc_request *req)
2771 {
2772         struct ptlrpc_request_set *set;
2773         int rc;
2774         ENTRY;
2775
2776         LASSERT(req->rq_set == NULL);
2777         LASSERT(!req->rq_receiving_reply);
2778
2779         set = ptlrpc_prep_set();
2780         if (set == NULL) {
2781                 CERROR("cannot allocate ptlrpc set: rc = %d\n", -ENOMEM);
2782                 RETURN(-ENOMEM);
2783         }
2784
2785         /* for distributed debugging */
2786         lustre_msg_set_status(req->rq_reqmsg, current_pid());
2787
2788         /* add a ref for the set (see comment in ptlrpc_set_add_req) */
2789         ptlrpc_request_addref(req);
2790         ptlrpc_set_add_req(set, req);
2791         rc = ptlrpc_set_wait(set);
2792         ptlrpc_set_destroy(set);
2793
2794         RETURN(rc);
2795 }
2796 EXPORT_SYMBOL(ptlrpc_queue_wait);
2797
2798 /**
2799  * Callback used for replayed requests reply processing.
2800  * In case of successful reply calls registered request replay callback.
2801  * In case of error restart replay process.
2802  */
2803 static int ptlrpc_replay_interpret(const struct lu_env *env,
2804                                    struct ptlrpc_request *req,
2805                                    void * data, int rc)
2806 {
2807         struct ptlrpc_replay_async_args *aa = data;
2808         struct obd_import *imp = req->rq_import;
2809
2810         ENTRY;
2811         atomic_dec(&imp->imp_replay_inflight);
2812
2813         if (!ptlrpc_client_replied(req)) {
2814                 CERROR("request replay timed out, restarting recovery\n");
2815                 GOTO(out, rc = -ETIMEDOUT);
2816         }
2817
2818         if (lustre_msg_get_type(req->rq_repmsg) == PTL_RPC_MSG_ERR &&
2819             (lustre_msg_get_status(req->rq_repmsg) == -ENOTCONN ||
2820              lustre_msg_get_status(req->rq_repmsg) == -ENODEV))
2821                 GOTO(out, rc = lustre_msg_get_status(req->rq_repmsg));
2822
2823         /** VBR: check version failure */
2824         if (lustre_msg_get_status(req->rq_repmsg) == -EOVERFLOW) {
2825                 /** replay was failed due to version mismatch */
2826                 DEBUG_REQ(D_WARNING, req, "Version mismatch during replay\n");
2827                 spin_lock(&imp->imp_lock);
2828                 imp->imp_vbr_failed = 1;
2829                 imp->imp_no_lock_replay = 1;
2830                 spin_unlock(&imp->imp_lock);
2831                 lustre_msg_set_status(req->rq_repmsg, aa->praa_old_status);
2832         } else {
2833                 /** The transno had better not change over replay. */
2834                 LASSERTF(lustre_msg_get_transno(req->rq_reqmsg) ==
2835                          lustre_msg_get_transno(req->rq_repmsg) ||
2836                          lustre_msg_get_transno(req->rq_repmsg) == 0,
2837                          LPX64"/"LPX64"\n",
2838                          lustre_msg_get_transno(req->rq_reqmsg),
2839                          lustre_msg_get_transno(req->rq_repmsg));
2840         }
2841
2842         spin_lock(&imp->imp_lock);
2843         /** if replays by version then gap occur on server, no trust to locks */
2844         if (lustre_msg_get_flags(req->rq_repmsg) & MSG_VERSION_REPLAY)
2845                 imp->imp_no_lock_replay = 1;
2846         imp->imp_last_replay_transno = lustre_msg_get_transno(req->rq_reqmsg);
2847         spin_unlock(&imp->imp_lock);
2848         LASSERT(imp->imp_last_replay_transno);
2849
2850         /* transaction number shouldn't be bigger than the latest replayed */
2851         if (req->rq_transno > lustre_msg_get_transno(req->rq_reqmsg)) {
2852                 DEBUG_REQ(D_ERROR, req,
2853                           "Reported transno "LPU64" is bigger than the "
2854                           "replayed one: "LPU64, req->rq_transno,
2855                           lustre_msg_get_transno(req->rq_reqmsg));
2856                 GOTO(out, rc = -EINVAL);
2857         }
2858
2859         DEBUG_REQ(D_HA, req, "got rep");
2860
2861         /* let the callback do fixups, possibly including in the request */
2862         if (req->rq_replay_cb)
2863                 req->rq_replay_cb(req);
2864
2865         if (ptlrpc_client_replied(req) &&
2866             lustre_msg_get_status(req->rq_repmsg) != aa->praa_old_status) {
2867                 DEBUG_REQ(D_ERROR, req, "status %d, old was %d",
2868                           lustre_msg_get_status(req->rq_repmsg),
2869                           aa->praa_old_status);
2870         } else {
2871                 /* Put it back for re-replay. */
2872                 lustre_msg_set_status(req->rq_repmsg, aa->praa_old_status);
2873         }
2874
2875         /*
2876          * Errors while replay can set transno to 0, but
2877          * imp_last_replay_transno shouldn't be set to 0 anyway
2878          */
2879         if (req->rq_transno == 0)
2880                 CERROR("Transno is 0 during replay!\n");
2881
2882         /* continue with recovery */
2883         rc = ptlrpc_import_recovery_state_machine(imp);
2884  out:
2885         req->rq_send_state = aa->praa_old_state;
2886
2887         if (rc != 0)
2888                 /* this replay failed, so restart recovery */
2889                 ptlrpc_connect_import(imp);
2890
2891         RETURN(rc);
2892 }
2893
2894 /**
2895  * Prepares and queues request for replay.
2896  * Adds it to ptlrpcd queue for actual sending.
2897  * Returns 0 on success.
2898  */
2899 int ptlrpc_replay_req(struct ptlrpc_request *req)
2900 {
2901         struct ptlrpc_replay_async_args *aa;
2902         ENTRY;
2903
2904         LASSERT(req->rq_import->imp_state == LUSTRE_IMP_REPLAY);
2905
2906         LASSERT (sizeof (*aa) <= sizeof (req->rq_async_args));
2907         aa = ptlrpc_req_async_args(req);
2908         memset(aa, 0, sizeof *aa);
2909
2910         /* Prepare request to be resent with ptlrpcd */
2911         aa->praa_old_state = req->rq_send_state;
2912         req->rq_send_state = LUSTRE_IMP_REPLAY;
2913         req->rq_phase = RQ_PHASE_NEW;
2914         req->rq_next_phase = RQ_PHASE_UNDEFINED;
2915         if (req->rq_repmsg)
2916                 aa->praa_old_status = lustre_msg_get_status(req->rq_repmsg);
2917         req->rq_status = 0;
2918         req->rq_interpret_reply = ptlrpc_replay_interpret;
2919         /* Readjust the timeout for current conditions */
2920         ptlrpc_at_set_req_timeout(req);
2921
2922         /* Tell server the net_latency, so the server can calculate how long
2923          * it should wait for next replay */
2924         lustre_msg_set_service_time(req->rq_reqmsg,
2925                                     ptlrpc_at_get_net_latency(req));
2926         DEBUG_REQ(D_HA, req, "REPLAY");
2927
2928         atomic_inc(&req->rq_import->imp_replay_inflight);
2929         ptlrpc_request_addref(req);     /* ptlrpcd needs a ref */
2930
2931         ptlrpcd_add_req(req, PDL_POLICY_LOCAL, -1);
2932         RETURN(0);
2933 }
2934
2935 /**
2936  * Aborts all in-flight request on import \a imp sending and delayed lists
2937  */
2938 void ptlrpc_abort_inflight(struct obd_import *imp)
2939 {
2940         struct list_head *tmp, *n;
2941         ENTRY;
2942
2943         /* Make sure that no new requests get processed for this import.
2944          * ptlrpc_{queue,set}_wait must (and does) hold imp_lock while testing
2945          * this flag and then putting requests on sending_list or delayed_list.
2946          */
2947         spin_lock(&imp->imp_lock);
2948
2949         /* XXX locking?  Maybe we should remove each request with the list
2950          * locked?  Also, how do we know if the requests on the list are
2951          * being freed at this time?
2952          */
2953         list_for_each_safe(tmp, n, &imp->imp_sending_list) {
2954                 struct ptlrpc_request *req = list_entry(tmp,
2955                                                         struct ptlrpc_request,
2956                                                         rq_list);
2957
2958                 DEBUG_REQ(D_RPCTRACE, req, "inflight");
2959
2960                 spin_lock(&req->rq_lock);
2961                 if (req->rq_import_generation < imp->imp_generation) {
2962                         req->rq_err = 1;
2963                         req->rq_status = -EIO;
2964                         ptlrpc_client_wake_req(req);
2965                 }
2966                 spin_unlock(&req->rq_lock);
2967         }
2968
2969         list_for_each_safe(tmp, n, &imp->imp_delayed_list) {
2970                 struct ptlrpc_request *req =
2971                         list_entry(tmp, struct ptlrpc_request, rq_list);
2972
2973                 DEBUG_REQ(D_RPCTRACE, req, "aborting waiting req");
2974
2975                 spin_lock(&req->rq_lock);
2976                 if (req->rq_import_generation < imp->imp_generation) {
2977                         req->rq_err = 1;
2978                         req->rq_status = -EIO;
2979                         ptlrpc_client_wake_req(req);
2980                 }
2981                 spin_unlock(&req->rq_lock);
2982         }
2983
2984         /* Last chance to free reqs left on the replay list, but we
2985          * will still leak reqs that haven't committed.  */
2986         if (imp->imp_replayable)
2987                 ptlrpc_free_committed(imp);
2988
2989         spin_unlock(&imp->imp_lock);
2990
2991         EXIT;
2992 }
2993
2994 /**
2995  * Abort all uncompleted requests in request set \a set
2996  */
2997 void ptlrpc_abort_set(struct ptlrpc_request_set *set)
2998 {
2999         struct list_head *tmp, *pos;
3000
3001         LASSERT(set != NULL);
3002
3003         list_for_each_safe(pos, tmp, &set->set_requests) {
3004                 struct ptlrpc_request *req =
3005                         list_entry(pos, struct ptlrpc_request,
3006                                    rq_set_chain);
3007
3008                 spin_lock(&req->rq_lock);
3009                 if (req->rq_phase != RQ_PHASE_RPC) {
3010                         spin_unlock(&req->rq_lock);
3011                         continue;
3012                 }
3013
3014                 req->rq_err = 1;
3015                 req->rq_status = -EINTR;
3016                 ptlrpc_client_wake_req(req);
3017                 spin_unlock(&req->rq_lock);
3018         }
3019 }
3020
3021 static __u64 ptlrpc_last_xid;
3022 static spinlock_t ptlrpc_last_xid_lock;
3023
3024 /**
3025  * Initialize the XID for the node.  This is common among all requests on
3026  * this node, and only requires the property that it is monotonically
3027  * increasing.  It does not need to be sequential.  Since this is also used
3028  * as the RDMA match bits, it is important that a single client NOT have
3029  * the same match bits for two different in-flight requests, hence we do
3030  * NOT want to have an XID per target or similar.
3031  *
3032  * To avoid an unlikely collision between match bits after a client reboot
3033  * (which would deliver old data into the wrong RDMA buffer) initialize
3034  * the XID based on the current time, assuming a maximum RPC rate of 1M RPC/s.
3035  * If the time is clearly incorrect, we instead use a 62-bit random number.
3036  * In the worst case the random number will overflow 1M RPCs per second in
3037  * 9133 years, or permutations thereof.
3038  */
3039 #define YEAR_2004 (1ULL << 30)
3040 void ptlrpc_init_xid(void)
3041 {
3042         time_t now = cfs_time_current_sec();
3043
3044         spin_lock_init(&ptlrpc_last_xid_lock);
3045         if (now < YEAR_2004) {
3046                 cfs_get_random_bytes(&ptlrpc_last_xid, sizeof(ptlrpc_last_xid));
3047                 ptlrpc_last_xid >>= 2;
3048                 ptlrpc_last_xid |= (1ULL << 61);
3049         } else {
3050                 ptlrpc_last_xid = (__u64)now << 20;
3051         }
3052
3053         /* Need to always be aligned to a power-of-two for mutli-bulk BRW */
3054         CLASSERT((PTLRPC_BULK_OPS_COUNT & (PTLRPC_BULK_OPS_COUNT - 1)) == 0);
3055         ptlrpc_last_xid &= PTLRPC_BULK_OPS_MASK;
3056 }
3057
3058 /**
3059  * Increase xid and returns resulting new value to the caller.
3060  *
3061  * Multi-bulk BRW RPCs consume multiple XIDs for each bulk transfer, starting
3062  * at the returned xid, up to xid + PTLRPC_BULK_OPS_COUNT - 1. The BRW RPC
3063  * itself uses the last bulk xid needed, so the server can determine the
3064  * the number of bulk transfers from the RPC XID and a bitmask.  The starting
3065  * xid must align to a power-of-two value.
3066  *
3067  * This is assumed to be true due to the initial ptlrpc_last_xid
3068  * value also being initialized to a power-of-two value. LU-1431
3069  */
3070 __u64 ptlrpc_next_xid(void)
3071 {
3072         __u64 next;
3073
3074         spin_lock(&ptlrpc_last_xid_lock);
3075         next = ptlrpc_last_xid + PTLRPC_BULK_OPS_COUNT;
3076         ptlrpc_last_xid = next;
3077         spin_unlock(&ptlrpc_last_xid_lock);
3078
3079         return next;
3080 }
3081
3082 /**
3083  * If request has a new allocated XID (new request or EINPROGRESS resend),
3084  * use this XID as matchbits of bulk, otherwise allocate a new matchbits for
3085  * request to ensure previous bulk fails and avoid problems with lost replies
3086  * and therefore several transfers landing into the same buffer from different
3087  * sending attempts.
3088  */
3089 void ptlrpc_set_bulk_mbits(struct ptlrpc_request *req)
3090 {
3091         struct ptlrpc_bulk_desc *bd = req->rq_bulk;
3092
3093         LASSERT(bd != NULL);
3094
3095         if (!req->rq_resend || req->rq_nr_resend != 0) {
3096                 /* this request has a new xid, just use it as bulk matchbits */
3097                 req->rq_mbits = req->rq_xid;
3098
3099         } else { /* needs to generate a new matchbits for resend */
3100                 __u64   old_mbits = req->rq_mbits;
3101
3102                 if ((bd->bd_import->imp_connect_data.ocd_connect_flags &
3103                     OBD_CONNECT_BULK_MBITS) != 0)
3104                         req->rq_mbits = ptlrpc_next_xid();
3105                 else /* old version transfers rq_xid to peer as matchbits */
3106                         req->rq_mbits = req->rq_xid = ptlrpc_next_xid();
3107
3108                 CDEBUG(D_HA, "resend bulk old x"LPU64" new x"LPU64"\n",
3109                        old_mbits, req->rq_mbits);
3110         }
3111
3112         /* For multi-bulk RPCs, rq_mbits is the last mbits needed for bulks so
3113          * that server can infer the number of bulks that were prepared,
3114          * see LU-1431 */
3115         req->rq_mbits += ((bd->bd_iov_count + LNET_MAX_IOV - 1) /
3116                           LNET_MAX_IOV) - 1;
3117 }
3118
3119 /**
3120  * Get a glimpse at what next xid value might have been.
3121  * Returns possible next xid.
3122  */
3123 __u64 ptlrpc_sample_next_xid(void)
3124 {
3125 #if BITS_PER_LONG == 32
3126         /* need to avoid possible word tearing on 32-bit systems */
3127         __u64 next;
3128
3129         spin_lock(&ptlrpc_last_xid_lock);
3130         next = ptlrpc_last_xid + PTLRPC_BULK_OPS_COUNT;
3131         spin_unlock(&ptlrpc_last_xid_lock);
3132
3133         return next;
3134 #else
3135         /* No need to lock, since returned value is racy anyways */
3136         return ptlrpc_last_xid + PTLRPC_BULK_OPS_COUNT;
3137 #endif
3138 }
3139 EXPORT_SYMBOL(ptlrpc_sample_next_xid);
3140
3141 /**
3142  * Functions for operating ptlrpc workers.
3143  *
3144  * A ptlrpc work is a function which will be running inside ptlrpc context.
3145  * The callback shouldn't sleep otherwise it will block that ptlrpcd thread.
3146  *
3147  * 1. after a work is created, it can be used many times, that is:
3148  *         handler = ptlrpcd_alloc_work();
3149  *         ptlrpcd_queue_work();
3150  *
3151  *    queue it again when necessary:
3152  *         ptlrpcd_queue_work();
3153  *         ptlrpcd_destroy_work();
3154  * 2. ptlrpcd_queue_work() can be called by multiple processes meanwhile, but
3155  *    it will only be queued once in any time. Also as its name implies, it may
3156  *    have delay before it really runs by ptlrpcd thread.
3157  */
3158 struct ptlrpc_work_async_args {
3159         int   (*cb)(const struct lu_env *, void *);
3160         void   *cbdata;
3161 };
3162
3163 static void ptlrpcd_add_work_req(struct ptlrpc_request *req)
3164 {
3165         /* re-initialize the req */
3166         req->rq_timeout         = obd_timeout;
3167         req->rq_sent            = cfs_time_current_sec();
3168         req->rq_deadline        = req->rq_sent + req->rq_timeout;
3169         req->rq_reply_deadline  = req->rq_deadline;
3170         req->rq_phase           = RQ_PHASE_INTERPRET;
3171         req->rq_next_phase      = RQ_PHASE_COMPLETE;
3172         req->rq_xid             = ptlrpc_next_xid();
3173         req->rq_import_generation = req->rq_import->imp_generation;
3174
3175         ptlrpcd_add_req(req, PDL_POLICY_ROUND, -1);
3176 }
3177
3178 static int work_interpreter(const struct lu_env *env,
3179                             struct ptlrpc_request *req, void *data, int rc)
3180 {
3181         struct ptlrpc_work_async_args *arg = data;
3182
3183         LASSERT(ptlrpcd_check_work(req));
3184         LASSERT(arg->cb != NULL);
3185
3186         rc = arg->cb(env, arg->cbdata);
3187
3188         list_del_init(&req->rq_set_chain);
3189         req->rq_set = NULL;
3190
3191         if (atomic_dec_return(&req->rq_refcount) > 1) {
3192                 atomic_set(&req->rq_refcount, 2);
3193                 ptlrpcd_add_work_req(req);
3194         }
3195         return rc;
3196 }
3197
3198 static int worker_format;
3199
3200 static int ptlrpcd_check_work(struct ptlrpc_request *req)
3201 {
3202         return req->rq_pill.rc_fmt == (void *)&worker_format;
3203 }
3204
3205 /**
3206  * Create a work for ptlrpc.
3207  */
3208 void *ptlrpcd_alloc_work(struct obd_import *imp,
3209                          int (*cb)(const struct lu_env *, void *), void *cbdata)
3210 {
3211         struct ptlrpc_request         *req = NULL;
3212         struct ptlrpc_work_async_args *args;
3213         ENTRY;
3214
3215         might_sleep();
3216
3217         if (cb == NULL)
3218                 RETURN(ERR_PTR(-EINVAL));
3219
3220         /* copy some code from deprecated fakereq. */
3221         req = ptlrpc_request_cache_alloc(GFP_NOFS);
3222         if (req == NULL) {
3223                 CERROR("ptlrpc: run out of memory!\n");
3224                 RETURN(ERR_PTR(-ENOMEM));
3225         }
3226
3227         ptlrpc_cli_req_init(req);
3228
3229         req->rq_send_state = LUSTRE_IMP_FULL;
3230         req->rq_type = PTL_RPC_MSG_REQUEST;
3231         req->rq_import = class_import_get(imp);
3232         req->rq_interpret_reply = work_interpreter;
3233         /* don't want reply */
3234         req->rq_no_delay = req->rq_no_resend = 1;
3235         req->rq_pill.rc_fmt = (void *)&worker_format;
3236
3237         CLASSERT (sizeof(*args) <= sizeof(req->rq_async_args));
3238         args = ptlrpc_req_async_args(req);
3239         args->cb     = cb;
3240         args->cbdata = cbdata;
3241
3242         RETURN(req);
3243 }
3244 EXPORT_SYMBOL(ptlrpcd_alloc_work);
3245
3246 void ptlrpcd_destroy_work(void *handler)
3247 {
3248         struct ptlrpc_request *req = handler;
3249
3250         if (req)
3251                 ptlrpc_req_finished(req);
3252 }
3253 EXPORT_SYMBOL(ptlrpcd_destroy_work);
3254
3255 int ptlrpcd_queue_work(void *handler)
3256 {
3257         struct ptlrpc_request *req = handler;
3258
3259         /*
3260          * Check if the req is already being queued.
3261          *
3262          * Here comes a trick: it lacks a way of checking if a req is being
3263          * processed reliably in ptlrpc. Here I have to use refcount of req
3264          * for this purpose. This is okay because the caller should use this
3265          * req as opaque data. - Jinshan
3266          */
3267         LASSERT(atomic_read(&req->rq_refcount) > 0);
3268         if (atomic_inc_return(&req->rq_refcount) == 2)
3269                 ptlrpcd_add_work_req(req);
3270         return 0;
3271 }
3272 EXPORT_SYMBOL(ptlrpcd_queue_work);