4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 only,
8 * as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2003, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2011, 2017, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * lustre/ptlrpc/ptlrpcd.c
35 /** \defgroup ptlrpcd PortalRPC daemon
37 * ptlrpcd is a special thread with its own set where other user might add
38 * requests when they don't want to wait for their completion.
39 * PtlRPCD will take care of sending such requests and then processing their
40 * replies and calling completion callbacks as necessary.
41 * The callbacks are called directly from ptlrpcd context.
42 * It is important to never significantly block (esp. on RPCs!) within such
43 * completion handler or a deadlock might occur where ptlrpcd enters some
44 * callback that attempts to send another RPC and wait for it to return,
45 * during which time ptlrpcd is completely blocked, so e.g. if import
46 * fails, recovery cannot progress because connection requests are also
52 #define DEBUG_SUBSYSTEM S_RPC
54 #include <linux/kthread.h>
55 #include <libcfs/libcfs.h>
56 #include <lustre_net.h>
57 #include <lustre_lib.h>
58 #include <lustre_ha.h>
59 #include <obd_class.h> /* for obd_zombie */
60 #include <obd_support.h> /* for OBD_FAIL_CHECK */
61 #include <cl_object.h> /* cl_env_{get,put}() */
62 #include <lprocfs_status.h>
64 #include "ptlrpc_internal.h"
66 /* One of these per CPT. */
74 struct ptlrpcd_ctl pd_threads[0];
78 * max_ptlrpcds is obsolete, but retained to ensure that the kernel
79 * module will load on a system where it has been tuned.
80 * A value other than 0 implies it was tuned, in which case the value
81 * is used to derive a setting for ptlrpcd_per_cpt_max.
83 static int max_ptlrpcds;
84 module_param(max_ptlrpcds, int, 0644);
85 MODULE_PARM_DESC(max_ptlrpcds,
86 "Max ptlrpcd thread count to be started (obsolete).");
89 * ptlrpcd_bind_policy is obsolete, but retained to ensure that
90 * the kernel module will load on a system where it has been tuned.
91 * A value other than 0 implies it was tuned, in which case the value
92 * is used to derive a setting for ptlrpcd_partner_group_size.
94 static int ptlrpcd_bind_policy;
95 module_param(ptlrpcd_bind_policy, int, 0644);
96 MODULE_PARM_DESC(ptlrpcd_bind_policy,
97 "Ptlrpcd threads binding mode (obsolete).");
100 * ptlrpcd_per_cpt_max: The maximum number of ptlrpcd threads to run
103 static int ptlrpcd_per_cpt_max;
104 module_param(ptlrpcd_per_cpt_max, int, 0644);
105 MODULE_PARM_DESC(ptlrpcd_per_cpt_max,
106 "Max ptlrpcd thread count to be started per CPT.");
109 * ptlrpcd_partner_group_size: The desired number of threads in each
110 * ptlrpcd partner thread group. Default is 2, corresponding to the
111 * old PDB_POLICY_PAIR. A negative value makes all ptlrpcd threads in
112 * a CPT partners of each other.
114 static int ptlrpcd_partner_group_size;
115 module_param(ptlrpcd_partner_group_size, int, 0644);
116 MODULE_PARM_DESC(ptlrpcd_partner_group_size,
117 "Number of ptlrpcd threads in a partner group.");
120 * ptlrpcd_cpts: A CPT string describing the CPU partitions that
121 * ptlrpcd threads should run on. Used to make ptlrpcd threads run on
122 * a subset of all CPTs.
126 * run ptlrpcd threads only on CPT 2.
130 * run ptlrpcd threads on CPTs 0, 1, 2, and 3.
132 * ptlrpcd_cpts=[0-3,5,7]
133 * run ptlrpcd threads on CPTS 0, 1, 2, 3, 5, and 7.
135 static char *ptlrpcd_cpts;
136 module_param(ptlrpcd_cpts, charp, 0644);
137 MODULE_PARM_DESC(ptlrpcd_cpts,
138 "CPU partitions ptlrpcd threads should run in");
140 /* ptlrpcds_cpt_idx maps cpt numbers to an index in the ptlrpcds array. */
141 static int *ptlrpcds_cpt_idx;
143 /* ptlrpcds_num is the number of entries in the ptlrpcds array. */
144 static int ptlrpcds_num;
145 static struct ptlrpcd **ptlrpcds;
148 * In addition to the regular thread pool above, there is a single
149 * global recovery thread. Recovery isn't critical for performance,
150 * and doesn't block, but must always be able to proceed, and it is
151 * possible that all normal ptlrpcd threads are blocked. Hence the
152 * need for a dedicated thread.
154 static struct ptlrpcd_ctl ptlrpcd_rcv;
156 struct mutex ptlrpcd_mutex;
157 static int ptlrpcd_users = 0;
159 void ptlrpcd_wake(struct ptlrpc_request *req)
161 struct ptlrpc_request_set *set = req->rq_set;
163 LASSERT(set != NULL);
164 wake_up(&set->set_waitq);
166 EXPORT_SYMBOL(ptlrpcd_wake);
168 static struct ptlrpcd_ctl *
169 ptlrpcd_select_pc(struct ptlrpc_request *req)
175 if (req != NULL && req->rq_send_state != LUSTRE_IMP_FULL)
178 cpt = cfs_cpt_current(cfs_cpt_table, 1);
179 if (ptlrpcds_cpt_idx == NULL)
182 idx = ptlrpcds_cpt_idx[cpt];
185 /* We do not care whether it is strict load balance. */
187 if (++idx == pd->pd_nthreads)
191 return &pd->pd_threads[idx];
195 * Move all request from an existing request set to the ptlrpcd queue.
196 * All requests from the set must be in phase RQ_PHASE_NEW.
198 void ptlrpcd_add_rqset(struct ptlrpc_request_set *set)
200 struct list_head *tmp, *pos;
201 struct ptlrpcd_ctl *pc;
202 struct ptlrpc_request_set *new;
205 pc = ptlrpcd_select_pc(NULL);
208 list_for_each_safe(pos, tmp, &set->set_requests) {
209 struct ptlrpc_request *req =
210 list_entry(pos, struct ptlrpc_request,
213 LASSERT(req->rq_phase == RQ_PHASE_NEW);
215 req->rq_queued_time = ktime_get_seconds();
218 spin_lock(&new->set_new_req_lock);
219 list_splice_init(&set->set_requests, &new->set_new_requests);
220 i = atomic_read(&set->set_remaining);
221 count = atomic_add_return(i, &new->set_new_count);
222 atomic_set(&set->set_remaining, 0);
223 spin_unlock(&new->set_new_req_lock);
225 wake_up(&new->set_waitq);
228 * XXX: It maybe unnecessary to wakeup all the partners. But to
229 * guarantee the async RPC can be processed ASAP, we have
230 * no other better choice. It maybe fixed in future.
232 for (i = 0; i < pc->pc_npartners; i++)
233 wake_up(&pc->pc_partners[i]->pc_set->set_waitq);
238 * Return transferred RPCs count.
240 static int ptlrpcd_steal_rqset(struct ptlrpc_request_set *des,
241 struct ptlrpc_request_set *src)
243 struct list_head *tmp, *pos;
244 struct ptlrpc_request *req;
247 spin_lock(&src->set_new_req_lock);
248 if (likely(!list_empty(&src->set_new_requests))) {
249 list_for_each_safe(pos, tmp, &src->set_new_requests) {
250 req = list_entry(pos, struct ptlrpc_request,
254 list_splice_init(&src->set_new_requests,
256 rc = atomic_read(&src->set_new_count);
257 atomic_add(rc, &des->set_remaining);
258 atomic_set(&src->set_new_count, 0);
260 spin_unlock(&src->set_new_req_lock);
265 * Requests that are added to the ptlrpcd queue are sent via
266 * ptlrpcd_check->ptlrpc_check_set().
268 void ptlrpcd_add_req(struct ptlrpc_request *req)
270 struct ptlrpcd_ctl *pc;
273 lustre_msg_set_jobid(req->rq_reqmsg, NULL);
275 spin_lock(&req->rq_lock);
276 if (req->rq_invalid_rqset) {
277 struct l_wait_info lwi = LWI_TIMEOUT(cfs_time_seconds(5),
278 back_to_sleep, NULL);
280 req->rq_invalid_rqset = 0;
281 spin_unlock(&req->rq_lock);
282 l_wait_event(req->rq_set_waitq, (req->rq_set == NULL), &lwi);
283 } else if (req->rq_set) {
285 * If we have a vaid "rq_set", just reuse it to avoid double
288 LASSERT(req->rq_phase == RQ_PHASE_NEW);
289 LASSERT(req->rq_send_state == LUSTRE_IMP_REPLAY);
291 /* ptlrpc_check_set will decrease the count */
292 atomic_inc(&req->rq_set->set_remaining);
293 spin_unlock(&req->rq_lock);
294 wake_up(&req->rq_set->set_waitq);
297 spin_unlock(&req->rq_lock);
300 pc = ptlrpcd_select_pc(req);
302 DEBUG_REQ(D_INFO, req, "add req [%p] to pc [%s:%d]",
303 req, pc->pc_name, pc->pc_index);
305 ptlrpc_set_add_new_req(pc, req);
307 EXPORT_SYMBOL(ptlrpcd_add_req);
309 static inline void ptlrpc_reqset_get(struct ptlrpc_request_set *set)
311 atomic_inc(&set->set_refcount);
315 * Check if there is more work to do on ptlrpcd set.
318 static int ptlrpcd_check(struct lu_env *env, struct ptlrpcd_ctl *pc)
320 struct list_head *tmp, *pos;
321 struct ptlrpc_request *req;
322 struct ptlrpc_request_set *set = pc->pc_set;
328 if (atomic_read(&set->set_new_count)) {
329 spin_lock(&set->set_new_req_lock);
330 if (likely(!list_empty(&set->set_new_requests))) {
331 list_splice_init(&set->set_new_requests,
333 atomic_add(atomic_read(&set->set_new_count),
334 &set->set_remaining);
335 atomic_set(&set->set_new_count, 0);
337 * Need to calculate its timeout.
341 spin_unlock(&set->set_new_req_lock);
345 * We should call lu_env_refill() before handling new requests to make
346 * sure that env key the requests depending on really exists.
348 rc2 = lu_env_refill(env);
351 * XXX This is very awkward situation, because
352 * execution can neither continue (request
353 * interpreters assume that env is set up), nor repeat
354 * the loop (as this potentially results in a tight
355 * loop of -ENOMEM's).
357 * Fortunately, refill only ever does something when
358 * new modules are loaded, i.e., early during boot up.
360 CERROR("Failure to refill session: %d\n", rc2);
364 if (atomic_read(&set->set_remaining))
365 rc |= ptlrpc_check_set(env, set);
368 * NB: ptlrpc_check_set has already moved complted request at the
369 * head of seq::set_requests
371 list_for_each_safe(pos, tmp, &set->set_requests) {
372 req = list_entry(pos, struct ptlrpc_request, rq_set_chain);
373 if (req->rq_phase != RQ_PHASE_COMPLETE)
376 list_del_init(&req->rq_set_chain);
378 ptlrpc_req_finished(req);
383 * If new requests have been added, make sure to wake up.
385 rc = atomic_read(&set->set_new_count);
388 * If we have nothing to do, check whether we can take some
389 * work from our partner threads.
391 if (rc == 0 && pc->pc_npartners > 0) {
392 struct ptlrpcd_ctl *partner;
393 struct ptlrpc_request_set *ps;
394 int first = pc->pc_cursor;
397 partner = pc->pc_partners[pc->pc_cursor++];
398 if (pc->pc_cursor >= pc->pc_npartners)
403 spin_lock(&partner->pc_lock);
404 ps = partner->pc_set;
406 spin_unlock(&partner->pc_lock);
410 ptlrpc_reqset_get(ps);
411 spin_unlock(&partner->pc_lock);
413 if (atomic_read(&ps->set_new_count)) {
414 rc = ptlrpcd_steal_rqset(set, ps);
417 "transfer %d async RPCs [%d->%d]\n",
418 rc, partner->pc_index,
421 ptlrpc_reqset_put(ps);
422 } while (rc == 0 && pc->pc_cursor != first);
426 RETURN(rc || test_bit(LIOD_STOP, &pc->pc_flags));
430 * Main ptlrpcd thread.
431 * ptlrpc's code paths like to execute in process context, so we have this
432 * thread which spins on a set which contains the rpcs and sends them.
434 static int ptlrpcd(void *arg)
436 struct ptlrpcd_ctl *pc = arg;
437 struct ptlrpc_request_set *set;
438 struct lu_context ses = { 0 };
439 struct lu_env env = { .le_ses = &ses };
447 if (cfs_cpt_bind(cfs_cpt_table, pc->pc_cpt) != 0)
448 CWARN("Failed to bind %s on CPT %d\n", pc->pc_name, pc->pc_cpt);
451 * Allocate the request set after the thread has been bound
452 * above. This is safe because no requests will be queued
453 * until all ptlrpcd threads have confirmed that they have
454 * successfully started.
456 set = ptlrpc_prep_set();
458 GOTO(failed, rc = -ENOMEM);
459 spin_lock(&pc->pc_lock);
461 spin_unlock(&pc->pc_lock);
463 /* Both client and server (MDT/OST) may use the environment. */
464 rc = lu_context_init(&env.le_ctx, LCT_MD_THREAD |
471 rc = lu_context_init(env.le_ses, LCT_SESSION |
475 lu_context_fini(&env.le_ctx);
479 complete(&pc->pc_starting);
482 * This mainloop strongly resembles ptlrpc_set_wait() except that our
483 * set never completes. ptlrpcd_check() calls ptlrpc_check_set() when
484 * there are requests in the set. New requests come in on the set's
485 * new_req_list and ptlrpcd_check() moves them into the set.
488 struct l_wait_info lwi;
491 timeout = ptlrpc_set_next_timeout(set);
492 lwi = LWI_TIMEOUT(cfs_time_seconds(timeout),
493 ptlrpc_expired_set, set);
495 lu_context_enter(&env.le_ctx);
496 lu_context_enter(env.le_ses);
497 l_wait_event(set->set_waitq, ptlrpcd_check(&env, pc), &lwi);
498 lu_context_exit(&env.le_ctx);
499 lu_context_exit(env.le_ses);
502 * Abort inflight rpcs for forced stop case.
504 if (test_bit(LIOD_STOP, &pc->pc_flags)) {
505 if (test_bit(LIOD_FORCE, &pc->pc_flags))
506 ptlrpc_abort_set(set);
511 * Let's make one more loop to make sure that ptlrpcd_check()
512 * copied all raced new rpcs into the set so we can kill them.
517 * Wait for inflight requests to drain.
519 if (!list_empty(&set->set_requests))
520 ptlrpc_set_wait(&env, set);
521 lu_context_fini(&env.le_ctx);
522 lu_context_fini(env.le_ses);
524 complete(&pc->pc_finishing);
530 complete(&pc->pc_starting);
534 static void ptlrpcd_ctl_init(struct ptlrpcd_ctl *pc, int index, int cpt)
538 pc->pc_index = index;
540 init_completion(&pc->pc_starting);
541 init_completion(&pc->pc_finishing);
542 spin_lock_init(&pc->pc_lock);
545 /* Recovery thread. */
546 snprintf(pc->pc_name, sizeof(pc->pc_name), "ptlrpcd_rcv");
548 /* Regular thread. */
549 snprintf(pc->pc_name, sizeof(pc->pc_name),
550 "ptlrpcd_%02d_%02d", cpt, index);
556 /* XXX: We want multiple CPU cores to share the async RPC load. So we
557 * start many ptlrpcd threads. We also want to reduce the ptlrpcd
558 * overhead caused by data transfer cross-CPU cores. So we bind
559 * all ptlrpcd threads to a CPT, in the expectation that CPTs
560 * will be defined in a way that matches these boundaries. Within
561 * a CPT a ptlrpcd thread can be scheduled on any available core.
563 * Each ptlrpcd thread has its own request queue. This can cause
564 * response delay if the thread is already busy. To help with
565 * this we define partner threads: these are other threads bound
566 * to the same CPT which will check for work in each other's
567 * request queues if they have no work to do.
569 * The desired number of partner threads can be tuned by setting
570 * ptlrpcd_partner_group_size. The default is to create pairs of
573 static int ptlrpcd_partners(struct ptlrpcd *pd, int index)
575 struct ptlrpcd_ctl *pc;
576 struct ptlrpcd_ctl **ppc;
583 LASSERT(index >= 0 && index < pd->pd_nthreads);
584 pc = &pd->pd_threads[index];
585 pc->pc_npartners = pd->pd_groupsize - 1;
587 if (pc->pc_npartners <= 0)
590 OBD_CPT_ALLOC(pc->pc_partners, cfs_cpt_table, pc->pc_cpt,
591 sizeof(struct ptlrpcd_ctl *) * pc->pc_npartners);
592 if (pc->pc_partners == NULL) {
593 pc->pc_npartners = 0;
594 GOTO(out, rc = -ENOMEM);
597 first = index - index % pd->pd_groupsize;
598 ppc = pc->pc_partners;
599 for (i = first; i < first + pd->pd_groupsize; i++) {
601 *ppc++ = &pd->pd_threads[i];
607 int ptlrpcd_start(struct ptlrpcd_ctl *pc)
609 struct task_struct *task;
615 * Do not allow starting a second thread for one pc.
617 if (test_and_set_bit(LIOD_START, &pc->pc_flags)) {
618 CWARN("Starting second thread (%s) for same pc %p\n",
623 task = kthread_run(ptlrpcd, pc, pc->pc_name);
625 GOTO(out_set, rc = PTR_ERR(task));
627 wait_for_completion(&pc->pc_starting);
635 if (pc->pc_set != NULL) {
636 struct ptlrpc_request_set *set = pc->pc_set;
638 spin_lock(&pc->pc_lock);
640 spin_unlock(&pc->pc_lock);
641 ptlrpc_set_destroy(set);
643 clear_bit(LIOD_START, &pc->pc_flags);
647 void ptlrpcd_stop(struct ptlrpcd_ctl *pc, int force)
651 if (!test_bit(LIOD_START, &pc->pc_flags)) {
652 CWARN("Thread for pc %p was not started\n", pc);
656 set_bit(LIOD_STOP, &pc->pc_flags);
658 set_bit(LIOD_FORCE, &pc->pc_flags);
659 wake_up(&pc->pc_set->set_waitq);
665 void ptlrpcd_free(struct ptlrpcd_ctl *pc)
667 struct ptlrpc_request_set *set = pc->pc_set;
671 if (!test_bit(LIOD_START, &pc->pc_flags)) {
672 CWARN("Thread for pc %p was not started\n", pc);
676 wait_for_completion(&pc->pc_finishing);
678 spin_lock(&pc->pc_lock);
680 spin_unlock(&pc->pc_lock);
681 ptlrpc_set_destroy(set);
683 clear_bit(LIOD_START, &pc->pc_flags);
684 clear_bit(LIOD_STOP, &pc->pc_flags);
685 clear_bit(LIOD_FORCE, &pc->pc_flags);
688 if (pc->pc_npartners > 0) {
689 LASSERT(pc->pc_partners != NULL);
691 OBD_FREE(pc->pc_partners,
692 sizeof(struct ptlrpcd_ctl *) * pc->pc_npartners);
693 pc->pc_partners = NULL;
695 pc->pc_npartners = 0;
700 static void ptlrpcd_fini(void)
708 if (ptlrpcds != NULL) {
709 for (i = 0; i < ptlrpcds_num; i++) {
710 if (ptlrpcds[i] == NULL)
712 for (j = 0; j < ptlrpcds[i]->pd_nthreads; j++)
713 ptlrpcd_stop(&ptlrpcds[i]->pd_threads[j], 0);
714 for (j = 0; j < ptlrpcds[i]->pd_nthreads; j++)
715 ptlrpcd_free(&ptlrpcds[i]->pd_threads[j]);
716 OBD_FREE(ptlrpcds[i], ptlrpcds[i]->pd_size);
719 OBD_FREE(ptlrpcds, sizeof(ptlrpcds[0]) * ptlrpcds_num);
723 ptlrpcd_stop(&ptlrpcd_rcv, 0);
724 ptlrpcd_free(&ptlrpcd_rcv);
726 if (ptlrpcds_cpt_idx != NULL) {
727 ncpts = cfs_cpt_number(cfs_cpt_table);
728 OBD_FREE(ptlrpcds_cpt_idx, ncpts * sizeof(ptlrpcds_cpt_idx[0]));
729 ptlrpcds_cpt_idx = NULL;
735 static int ptlrpcd_init(void)
743 struct cfs_cpt_table *cptable;
752 * Determine the CPTs that ptlrpcd threads will run on.
754 cptable = cfs_cpt_table;
755 ncpts = cfs_cpt_number(cptable);
756 if (ptlrpcd_cpts != NULL) {
757 struct cfs_expr_list *el;
759 size = ncpts * sizeof(ptlrpcds_cpt_idx[0]);
760 OBD_ALLOC(ptlrpcds_cpt_idx, size);
761 if (ptlrpcds_cpt_idx == NULL)
762 GOTO(out, rc = -ENOMEM);
764 rc = cfs_expr_list_parse(ptlrpcd_cpts,
765 strlen(ptlrpcd_cpts),
768 CERROR("%s: invalid CPT pattern string: %s",
769 "ptlrpcd_cpts", ptlrpcd_cpts);
770 GOTO(out, rc = -EINVAL);
773 rc = cfs_expr_list_values(el, ncpts, &cpts);
774 cfs_expr_list_free(el);
776 CERROR("%s: failed to parse CPT array %s: %d\n",
777 "ptlrpcd_cpts", ptlrpcd_cpts, rc);
784 * Create the cpt-to-index map. When there is no match
785 * in the cpt table, pick a cpt at random. This could
786 * be changed to take the topology of the system into
789 for (cpt = 0; cpt < ncpts; cpt++) {
790 for (i = 0; i < rc; i++)
795 ptlrpcds_cpt_idx[cpt] = i;
798 cfs_expr_list_values_free(cpts, rc);
801 ptlrpcds_num = ncpts;
803 size = ncpts * sizeof(ptlrpcds[0]);
804 OBD_ALLOC(ptlrpcds, size);
805 if (ptlrpcds == NULL)
806 GOTO(out, rc = -ENOMEM);
809 * The max_ptlrpcds parameter is obsolete, but do something
810 * sane if it has been tuned, and complain if
811 * ptlrpcd_per_cpt_max has also been tuned.
813 if (max_ptlrpcds != 0) {
814 CWARN("max_ptlrpcds is obsolete.\n");
815 if (ptlrpcd_per_cpt_max == 0) {
816 ptlrpcd_per_cpt_max = max_ptlrpcds / ncpts;
817 /* Round up if there is a remainder. */
818 if (max_ptlrpcds % ncpts != 0)
819 ptlrpcd_per_cpt_max++;
820 CWARN("Setting ptlrpcd_per_cpt_max = %d\n",
821 ptlrpcd_per_cpt_max);
823 CWARN("ptlrpd_per_cpt_max is also set!\n");
828 * The ptlrpcd_bind_policy parameter is obsolete, but do
829 * something sane if it has been tuned, and complain if
830 * ptlrpcd_partner_group_size is also tuned.
832 if (ptlrpcd_bind_policy != 0) {
833 CWARN("ptlrpcd_bind_policy is obsolete.\n");
834 if (ptlrpcd_partner_group_size == 0) {
835 switch (ptlrpcd_bind_policy) {
836 case 1: /* PDB_POLICY_NONE */
837 case 2: /* PDB_POLICY_FULL */
838 ptlrpcd_partner_group_size = 1;
840 case 3: /* PDB_POLICY_PAIR */
841 ptlrpcd_partner_group_size = 2;
843 case 4: /* PDB_POLICY_NEIGHBOR */
845 ptlrpcd_partner_group_size = -1; /* CPT */
847 ptlrpcd_partner_group_size = 3; /* Triplets */
850 default: /* Illegal value, use the default. */
851 ptlrpcd_partner_group_size = 2;
854 CWARN("Setting ptlrpcd_partner_group_size = %d\n",
855 ptlrpcd_partner_group_size);
857 CWARN("ptlrpcd_partner_group_size is also set!\n");
861 if (ptlrpcd_partner_group_size == 0)
862 ptlrpcd_partner_group_size = 2;
863 else if (ptlrpcd_partner_group_size < 0)
864 ptlrpcd_partner_group_size = -1;
865 else if (ptlrpcd_per_cpt_max > 0 &&
866 ptlrpcd_partner_group_size > ptlrpcd_per_cpt_max)
867 ptlrpcd_partner_group_size = ptlrpcd_per_cpt_max;
870 * Start the recovery thread first.
872 set_bit(LIOD_RECOVERY, &ptlrpcd_rcv.pc_flags);
873 ptlrpcd_ctl_init(&ptlrpcd_rcv, -1, CFS_CPT_ANY);
874 rc = ptlrpcd_start(&ptlrpcd_rcv);
878 for (i = 0; i < ncpts; i++) {
884 nthreads = cfs_cpt_weight(cptable, cpt);
885 if (ptlrpcd_per_cpt_max > 0 && ptlrpcd_per_cpt_max < nthreads)
886 nthreads = ptlrpcd_per_cpt_max;
890 if (ptlrpcd_partner_group_size <= 0) {
891 groupsize = nthreads;
892 } else if (nthreads <= ptlrpcd_partner_group_size) {
893 groupsize = nthreads;
895 groupsize = ptlrpcd_partner_group_size;
896 if (nthreads % groupsize != 0)
897 nthreads += groupsize - (nthreads % groupsize);
900 size = offsetof(struct ptlrpcd, pd_threads[nthreads]);
901 OBD_CPT_ALLOC(pd, cptable, cpt, size);
904 GOTO(out, rc = -ENOMEM);
909 pd->pd_nthreads = nthreads;
910 pd->pd_groupsize = groupsize;
914 * The ptlrpcd threads in a partner group can access
915 * each other's struct ptlrpcd_ctl, so these must be
916 * initialized before any thead is started.
918 for (j = 0; j < nthreads; j++) {
919 ptlrpcd_ctl_init(&pd->pd_threads[j], j, cpt);
920 rc = ptlrpcd_partners(pd, j);
925 /* XXX: We start nthreads ptlrpc daemons on this cpt.
926 * Each of them can process any non-recovery
927 * async RPC to improve overall async RPC
930 * But there are some issues with async I/O RPCs
931 * and async non-I/O RPCs processed in the same
932 * set under some cases. The ptlrpcd may be
933 * blocked by some async I/O RPC(s), then will
934 * cause other async non-I/O RPC(s) can not be
937 * Maybe we should distinguish blocked async RPCs
938 * from non-blocked async RPCs, and process them
939 * in different ptlrpcd sets to avoid unnecessary
940 * dependency. But how to distribute async RPCs
941 * load among all the ptlrpc daemons becomes
944 for (j = 0; j < nthreads; j++) {
945 rc = ptlrpcd_start(&pd->pd_threads[j]);
957 int ptlrpcd_addref(void)
963 mutex_lock(&ptlrpcd_mutex);
964 if (++ptlrpcd_users == 1) {
969 mutex_unlock(&ptlrpcd_mutex);
972 EXPORT_SYMBOL(ptlrpcd_addref);
974 void ptlrpcd_decref(void)
976 mutex_lock(&ptlrpcd_mutex);
977 if (--ptlrpcd_users == 0)
979 mutex_unlock(&ptlrpcd_mutex);
981 EXPORT_SYMBOL(ptlrpcd_decref);