1 /* -*- mode: c; c-basic-offset: 8; indent-tabs-mode: nil; -*-
2 * vim:expandtab:shiftwidth=8:tabstop=8:
6 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 only,
10 * as published by the Free Software Foundation.
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License version 2 for more details (a copy is included
16 * in the LICENSE file that accompanied this code).
18 * You should have received a copy of the GNU General Public License
19 * version 2 along with this program; If not, see
20 * http://www.sun.com/software/products/lustre/docs/GPLv2.pdf
22 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
23 * CA 95054 USA or visit www.sun.com if you need additional information or
29 * Copyright 2008 Sun Microsystems, Inc. All rights reserved
30 * Use is subject to license terms.
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
36 * lustre/ptlrpc/ptlrpcd.c
39 #define DEBUG_SUBSYSTEM S_RPC
42 # include <libcfs/libcfs.h>
43 #else /* __KERNEL__ */
44 # include <liblustre.h>
48 #include <libcfs/kp30.h>
49 #include <lustre_net.h>
50 # include <lustre_lib.h>
52 #include <lustre_ha.h>
53 #include <obd_class.h> /* for obd_zombie */
54 #include <obd_support.h> /* for OBD_FAIL_CHECK */
55 #include <lprocfs_status.h>
57 static struct ptlrpcd_ctl ptlrpcd_pc;
58 static struct ptlrpcd_ctl ptlrpcd_recovery_pc;
60 struct semaphore ptlrpcd_sem;
61 static int ptlrpcd_users = 0;
63 void ptlrpcd_wake(struct ptlrpc_request *req)
65 struct ptlrpc_request_set *rq_set = req->rq_set;
67 LASSERT(rq_set != NULL);
69 cfs_waitq_signal(&rq_set->set_waitq);
73 * Move all request from an existing request set to the ptlrpcd queue.
74 * All requests from the set must be in phase RQ_PHASE_NEW.
76 void ptlrpcd_add_rqset(struct ptlrpc_request_set *set)
78 struct list_head *tmp, *pos;
80 list_for_each_safe(pos, tmp, &set->set_requests) {
81 struct ptlrpc_request *req =
82 list_entry(pos, struct ptlrpc_request, rq_set_chain);
84 LASSERT(req->rq_phase == RQ_PHASE_NEW);
85 list_del_init(&req->rq_set_chain);
90 LASSERT(set->set_remaining == 0);
92 EXPORT_SYMBOL(ptlrpcd_add_rqset);
95 * Requests that are added to the ptlrpcd queue are sent via
96 * ptlrpcd_check->ptlrpc_check_set().
98 int ptlrpcd_add_req(struct ptlrpc_request *req)
100 struct ptlrpcd_ctl *pc;
103 if (req->rq_send_state == LUSTRE_IMP_FULL)
106 pc = &ptlrpcd_recovery_pc;
107 rc = ptlrpc_set_add_new_req(pc, req);
110 * Thread is probably in stop now so we need to
111 * kill this rpc as it was not added. Let's call
112 * interpret for it to let know we're killing it
113 * so that higher levels might free assosiated
117 ptlrpc_req_interpret(req, -EBADR);
119 ptlrpc_req_finished(req);
120 } else if (req->rq_send_state == LUSTRE_IMP_CONNECTING) {
122 * The request is for recovery, should be sent ASAP.
124 cfs_waitq_signal(&pc->pc_set->set_waitq);
130 static int ptlrpcd_check(struct ptlrpcd_ctl *pc)
132 struct list_head *tmp, *pos;
133 struct ptlrpc_request *req;
137 spin_lock(&pc->pc_set->set_new_req_lock);
138 list_for_each_safe(pos, tmp, &pc->pc_set->set_new_requests) {
139 req = list_entry(pos, struct ptlrpc_request, rq_set_chain);
140 list_del_init(&req->rq_set_chain);
141 ptlrpc_set_add_req(pc->pc_set, req);
143 * Need to calculate its timeout.
147 spin_unlock(&pc->pc_set->set_new_req_lock);
149 if (pc->pc_set->set_remaining) {
150 rc = rc | ptlrpc_check_set(pc->pc_set);
153 * XXX: our set never completes, so we prune the completed
154 * reqs after each iteration. boy could this be smarter.
156 list_for_each_safe(pos, tmp, &pc->pc_set->set_requests) {
157 req = list_entry(pos, struct ptlrpc_request,
159 if (req->rq_phase != RQ_PHASE_COMPLETE)
162 list_del_init(&req->rq_set_chain);
164 ptlrpc_req_finished (req);
170 * If new requests have been added, make sure to wake up.
172 spin_lock(&pc->pc_set->set_new_req_lock);
173 rc = !list_empty(&pc->pc_set->set_new_requests);
174 spin_unlock(&pc->pc_set->set_new_req_lock);
182 * ptlrpc's code paths like to execute in process context, so we have this
183 * thread which spins on a set which contains the io rpcs. llite specifies
184 * ptlrpcd's set when it pushes pages down into the oscs.
186 static int ptlrpcd(void *arg)
188 struct ptlrpcd_ctl *pc = arg;
192 if ((rc = cfs_daemonize_ctxt(pc->pc_name))) {
193 complete(&pc->pc_starting);
197 complete(&pc->pc_starting);
200 * This mainloop strongly resembles ptlrpc_set_wait() except that our
201 * set never completes. ptlrpcd_check() calls ptlrpc_check_set() when
202 * there are requests in the set. New requests come in on the set's
203 * new_req_list and ptlrpcd_check() moves them into the set.
206 struct l_wait_info lwi;
209 timeout = ptlrpc_set_next_timeout(pc->pc_set);
210 lwi = LWI_TIMEOUT(cfs_time_seconds(timeout ? timeout : 1),
211 ptlrpc_expired_set, pc->pc_set);
213 l_wait_event(pc->pc_set->set_waitq, ptlrpcd_check(pc), &lwi);
216 * Abort inflight rpcs for forced stop case.
218 if (test_bit(LIOD_STOP, &pc->pc_flags)) {
219 if (test_bit(LIOD_FORCE, &pc->pc_flags))
220 ptlrpc_abort_set(pc->pc_set);
225 * Let's make one more loop to make sure that ptlrpcd_check()
226 * copied all raced new rpcs into the set so we can kill them.
231 * Wait for inflight requests to drain.
233 if (!list_empty(&pc->pc_set->set_requests))
234 ptlrpc_set_wait(pc->pc_set);
236 complete(&pc->pc_finishing);
238 clear_bit(LIOD_START, &pc->pc_flags);
239 clear_bit(LIOD_STOP, &pc->pc_flags);
240 clear_bit(LIOD_FORCE, &pc->pc_flags);
246 int ptlrpcd_check_async_rpcs(void *arg)
248 struct ptlrpcd_ctl *pc = arg;
256 if (pc->pc_recurred == 1) {
257 rc = ptlrpcd_check(pc);
259 ptlrpc_expired_set(pc->pc_set);
261 * XXX: send replay requests.
263 if (pc == &ptlrpcd_recovery_pc)
264 rc = ptlrpcd_check(pc);
271 int ptlrpcd_idle(void *arg)
273 struct ptlrpcd_ctl *pc = arg;
275 return (list_empty(&pc->pc_set->set_new_requests) &&
276 pc->pc_set->set_remaining == 0);
281 int ptlrpcd_start(char *name, struct ptlrpcd_ctl *pc)
287 * Do not allow start second thread for one pc.
289 if (test_bit(LIOD_START, &pc->pc_flags)) {
290 CERROR("Starting second thread (%s) for same pc %p\n",
295 set_bit(LIOD_START, &pc->pc_flags);
296 init_completion(&pc->pc_starting);
297 init_completion(&pc->pc_finishing);
298 spin_lock_init(&pc->pc_lock);
299 strncpy(pc->pc_name, name, sizeof(pc->pc_name) - 1);
301 pc->pc_set = ptlrpc_prep_set();
302 if (pc->pc_set == NULL)
303 GOTO(out, rc = -ENOMEM);
306 rc = cfs_kernel_thread(ptlrpcd, pc, 0);
308 ptlrpc_set_destroy(pc->pc_set);
312 wait_for_completion(&pc->pc_starting);
314 pc->pc_wait_callback =
315 liblustre_register_wait_callback("ptlrpcd_check_async_rpcs",
316 &ptlrpcd_check_async_rpcs, pc);
317 pc->pc_idle_callback =
318 liblustre_register_idle_callback("ptlrpcd_check_idle_rpcs",
323 clear_bit(LIOD_START, &pc->pc_flags);
327 void ptlrpcd_stop(struct ptlrpcd_ctl *pc, int force)
329 if (!test_bit(LIOD_START, &pc->pc_flags)) {
330 CERROR("Thread for pc %p was not started\n", pc);
334 set_bit(LIOD_STOP, &pc->pc_flags);
336 set_bit(LIOD_FORCE, &pc->pc_flags);
337 cfs_waitq_signal(&pc->pc_set->set_waitq);
339 wait_for_completion(&pc->pc_finishing);
341 liblustre_deregister_wait_callback(pc->pc_wait_callback);
342 liblustre_deregister_idle_callback(pc->pc_idle_callback);
344 ptlrpc_set_destroy(pc->pc_set);
347 int ptlrpcd_addref(void)
352 mutex_down(&ptlrpcd_sem);
353 if (++ptlrpcd_users != 1)
356 rc = ptlrpcd_start("ptlrpcd", &ptlrpcd_pc);
362 rc = ptlrpcd_start("ptlrpcd-recov", &ptlrpcd_recovery_pc);
364 ptlrpcd_stop(&ptlrpcd_pc, 0);
369 mutex_up(&ptlrpcd_sem);
373 void ptlrpcd_decref(void)
375 mutex_down(&ptlrpcd_sem);
376 if (--ptlrpcd_users == 0) {
377 ptlrpcd_stop(&ptlrpcd_pc, 0);
378 ptlrpcd_stop(&ptlrpcd_recovery_pc, 0);
380 mutex_up(&ptlrpcd_sem);