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,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License version 2 for more details. A copy is
14 * included in the COPYING file that accompanied this code.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 * Copyright (c) 2011 Intel Corporation
25 * Copyright 2012 Xyratex Technology Limited
28 * lustre/ptlrpc/nrs_crr.c
30 * Network Request Scheduler (NRS) CRR-N policy
32 * Request ordering in a batched Round-Robin manner over client NIDs
34 * Author: Liang Zhen <liang@whamcloud.com>
35 * Author: Nikitas Angelinas <nikitas_angelinas@xyratex.com>
41 #ifdef HAVE_SERVER_SUPPORT
43 #define DEBUG_SUBSYSTEM S_RPC
44 #include <obd_support.h>
45 #include <obd_class.h>
46 #include <lustre_net.h>
47 #include <lprocfs_status.h>
48 #include "ptlrpc_internal.h"
53 * Client Round-Robin scheduling over client NIDs
59 #define NRS_POL_NAME_CRRN "crrn"
62 * Binary heap predicate.
64 * Uses ptlrpc_nrs_request::nr_u::crr::cr_round and
65 * ptlrpc_nrs_request::nr_u::crr::cr_sequence to compare two binheap nodes and
66 * produce a binary predicate that shows their relative priority, so that the
67 * binary heap can perform the necessary sorting operations.
69 * \param[in] e1 the first binheap node to compare
70 * \param[in] e2 the second binheap node to compare
75 static int crrn_req_compare(cfs_binheap_node_t *e1, cfs_binheap_node_t *e2)
77 struct ptlrpc_nrs_request *nrq1;
78 struct ptlrpc_nrs_request *nrq2;
80 nrq1 = container_of(e1, struct ptlrpc_nrs_request, nr_node);
81 nrq2 = container_of(e2, struct ptlrpc_nrs_request, nr_node);
83 if (nrq1->nr_u.crr.cr_round < nrq2->nr_u.crr.cr_round)
85 else if (nrq1->nr_u.crr.cr_round > nrq2->nr_u.crr.cr_round)
88 return nrq1->nr_u.crr.cr_sequence < nrq2->nr_u.crr.cr_sequence;
91 static cfs_binheap_ops_t nrs_crrn_heap_ops = {
94 .hop_compare = crrn_req_compare,
98 * libcfs_hash operations for nrs_crrn_net::cn_cli_hash
100 * This uses ptlrpc_request::rq_peer.nid as its key, in order to hash
101 * nrs_crrn_client objects.
103 #define NRS_NID_BKT_BITS 8
104 #define NRS_NID_BITS 16
106 static unsigned nrs_crrn_hop_hash(cfs_hash_t *hs, const void *key,
109 return cfs_hash_djb2_hash(key, sizeof(lnet_nid_t), mask);
112 static int nrs_crrn_hop_keycmp(const void *key, struct hlist_node *hnode)
114 lnet_nid_t *nid = (lnet_nid_t *)key;
115 struct nrs_crrn_client *cli = hlist_entry(hnode,
116 struct nrs_crrn_client,
118 return *nid == cli->cc_nid;
121 static void *nrs_crrn_hop_key(struct hlist_node *hnode)
123 struct nrs_crrn_client *cli = hlist_entry(hnode,
124 struct nrs_crrn_client,
129 static void *nrs_crrn_hop_object(struct hlist_node *hnode)
131 return hlist_entry(hnode, struct nrs_crrn_client, cc_hnode);
134 static void nrs_crrn_hop_get(cfs_hash_t *hs, struct hlist_node *hnode)
136 struct nrs_crrn_client *cli = hlist_entry(hnode,
137 struct nrs_crrn_client,
139 atomic_inc(&cli->cc_ref);
142 static void nrs_crrn_hop_put(cfs_hash_t *hs, struct hlist_node *hnode)
144 struct nrs_crrn_client *cli = hlist_entry(hnode,
145 struct nrs_crrn_client,
147 atomic_dec(&cli->cc_ref);
150 static void nrs_crrn_hop_exit(cfs_hash_t *hs, struct hlist_node *hnode)
152 struct nrs_crrn_client *cli = hlist_entry(hnode,
153 struct nrs_crrn_client,
155 LASSERTF(atomic_read(&cli->cc_ref) == 0,
156 "Busy CRR-N object from client with NID %s, with %d refs\n",
157 libcfs_nid2str(cli->cc_nid), atomic_read(&cli->cc_ref));
162 static cfs_hash_ops_t nrs_crrn_hash_ops = {
163 .hs_hash = nrs_crrn_hop_hash,
164 .hs_keycmp = nrs_crrn_hop_keycmp,
165 .hs_key = nrs_crrn_hop_key,
166 .hs_object = nrs_crrn_hop_object,
167 .hs_get = nrs_crrn_hop_get,
168 .hs_put = nrs_crrn_hop_put,
169 .hs_put_locked = nrs_crrn_hop_put,
170 .hs_exit = nrs_crrn_hop_exit,
174 * Called when a CRR-N policy instance is started.
176 * \param[in] policy the policy
178 * \retval -ENOMEM OOM error
181 static int nrs_crrn_start(struct ptlrpc_nrs_policy *policy, char *arg)
183 struct nrs_crrn_net *net;
187 OBD_CPT_ALLOC_PTR(net, nrs_pol2cptab(policy), nrs_pol2cptid(policy));
191 net->cn_binheap = cfs_binheap_create(&nrs_crrn_heap_ops,
192 CBH_FLAG_ATOMIC_GROW, 4096, NULL,
193 nrs_pol2cptab(policy),
194 nrs_pol2cptid(policy));
195 if (net->cn_binheap == NULL)
196 GOTO(failed, rc = -ENOMEM);
198 net->cn_cli_hash = cfs_hash_create("nrs_crrn_nid_hash",
199 NRS_NID_BITS, NRS_NID_BITS,
204 CFS_HASH_RW_BKTLOCK);
205 if (net->cn_cli_hash == NULL)
206 GOTO(failed, rc = -ENOMEM);
209 * Set default quantum value to max_rpcs_in_flight for non-MDS OSCs;
210 * there may be more RPCs pending from each struct nrs_crrn_client even
211 * with the default max_rpcs_in_flight value, as we are scheduling over
212 * NIDs, and there may be more than one mount point per client.
214 net->cn_quantum = OBD_MAX_RIF_DEFAULT;
216 * Set to 1 so that the test inside nrs_crrn_req_add() can evaluate to
219 net->cn_sequence = 1;
221 policy->pol_private = net;
226 if (net->cn_binheap != NULL)
227 cfs_binheap_destroy(net->cn_binheap);
235 * Called when a CRR-N policy instance is stopped.
237 * Called when the policy has been instructed to transition to the
238 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state and has no more pending
241 * \param[in] policy the policy
243 static void nrs_crrn_stop(struct ptlrpc_nrs_policy *policy)
245 struct nrs_crrn_net *net = policy->pol_private;
248 LASSERT(net != NULL);
249 LASSERT(net->cn_binheap != NULL);
250 LASSERT(net->cn_cli_hash != NULL);
251 LASSERT(cfs_binheap_is_empty(net->cn_binheap));
253 cfs_binheap_destroy(net->cn_binheap);
254 cfs_hash_putref(net->cn_cli_hash);
260 * Performs a policy-specific ctl function on CRR-N policy instances; similar
263 * \param[in] policy the policy instance
264 * \param[in] opc the opcode
265 * \param[in,out] arg used for passing parameters and information
267 * \pre assert_spin_locked(&policy->pol_nrs->->nrs_lock)
268 * \post assert_spin_locked(&policy->pol_nrs->->nrs_lock)
270 * \retval 0 operation carried out successfully
273 int nrs_crrn_ctl(struct ptlrpc_nrs_policy *policy, enum ptlrpc_nrs_ctl opc,
276 assert_spin_locked(&policy->pol_nrs->nrs_lock);
278 switch((enum nrs_ctl_crr)opc) {
283 * Read Round Robin quantum size of a policy instance.
285 case NRS_CTL_CRRN_RD_QUANTUM: {
286 struct nrs_crrn_net *net = policy->pol_private;
288 *(__u16 *)arg = net->cn_quantum;
293 * Write Round Robin quantum size of a policy instance.
295 case NRS_CTL_CRRN_WR_QUANTUM: {
296 struct nrs_crrn_net *net = policy->pol_private;
298 net->cn_quantum = *(__u16 *)arg;
299 LASSERT(net->cn_quantum != 0);
308 * Obtains resources from CRR-N policy instances. The top-level resource lives
309 * inside \e nrs_crrn_net and the second-level resource inside
310 * \e nrs_crrn_client object instances.
312 * \param[in] policy the policy for which resources are being taken for
314 * \param[in] nrq the request for which resources are being taken
315 * \param[in] parent parent resource, embedded in nrs_crrn_net for the
317 * \param[out] resp resources references are placed in this array
318 * \param[in] moving_req signifies limited caller context; used to perform
319 * memory allocations in an atomic context in this
322 * \retval 0 we are returning a top-level, parent resource, one that is
323 * embedded in an nrs_crrn_net object
324 * \retval 1 we are returning a bottom-level resource, one that is embedded
325 * in an nrs_crrn_client object
327 * \see nrs_resource_get_safe()
329 int nrs_crrn_res_get(struct ptlrpc_nrs_policy *policy,
330 struct ptlrpc_nrs_request *nrq,
331 const struct ptlrpc_nrs_resource *parent,
332 struct ptlrpc_nrs_resource **resp, bool moving_req)
334 struct nrs_crrn_net *net;
335 struct nrs_crrn_client *cli;
336 struct nrs_crrn_client *tmp;
337 struct ptlrpc_request *req;
339 if (parent == NULL) {
340 *resp = &((struct nrs_crrn_net *)policy->pol_private)->cn_res;
344 net = container_of(parent, struct nrs_crrn_net, cn_res);
345 req = container_of(nrq, struct ptlrpc_request, rq_nrq);
347 cli = cfs_hash_lookup(net->cn_cli_hash, &req->rq_peer.nid);
351 OBD_CPT_ALLOC_GFP(cli, nrs_pol2cptab(policy), nrs_pol2cptid(policy),
352 sizeof(*cli), moving_req ? GFP_ATOMIC : GFP_NOFS);
356 cli->cc_nid = req->rq_peer.nid;
358 atomic_set(&cli->cc_ref, 1);
359 tmp = cfs_hash_findadd_unique(net->cn_cli_hash, &cli->cc_nid,
366 *resp = &cli->cc_res;
372 * Called when releasing references to the resource hierachy obtained for a
373 * request for scheduling using the CRR-N policy.
375 * \param[in] policy the policy the resource belongs to
376 * \param[in] res the resource to be released
378 static void nrs_crrn_res_put(struct ptlrpc_nrs_policy *policy,
379 const struct ptlrpc_nrs_resource *res)
381 struct nrs_crrn_net *net;
382 struct nrs_crrn_client *cli;
385 * Do nothing for freeing parent, nrs_crrn_net resources
387 if (res->res_parent == NULL)
390 cli = container_of(res, struct nrs_crrn_client, cc_res);
391 net = container_of(res->res_parent, struct nrs_crrn_net, cn_res);
393 cfs_hash_put(net->cn_cli_hash, &cli->cc_hnode);
397 * Called when getting a request from the CRR-N policy for handlingso that it can be served
399 * \param[in] policy the policy being polled
400 * \param[in] peek when set, signifies that we just want to examine the
401 * request, and not handle it, so the request is not removed
403 * \param[in] force force the policy to return a request; unused in this policy
405 * \retval the request to be handled
406 * \retval NULL no request available
408 * \see ptlrpc_nrs_req_get_nolock()
409 * \see nrs_request_get()
412 struct ptlrpc_nrs_request *nrs_crrn_req_get(struct ptlrpc_nrs_policy *policy,
413 bool peek, bool force)
415 struct nrs_crrn_net *net = policy->pol_private;
416 cfs_binheap_node_t *node = cfs_binheap_root(net->cn_binheap);
417 struct ptlrpc_nrs_request *nrq;
419 nrq = unlikely(node == NULL) ? NULL :
420 container_of(node, struct ptlrpc_nrs_request, nr_node);
422 if (likely(!peek && nrq != NULL)) {
423 struct nrs_crrn_client *cli;
424 struct ptlrpc_request *req = container_of(nrq,
425 struct ptlrpc_request,
428 cli = container_of(nrs_request_resource(nrq),
429 struct nrs_crrn_client, cc_res);
431 LASSERT(nrq->nr_u.crr.cr_round <= cli->cc_round);
433 cfs_binheap_remove(net->cn_binheap, &nrq->nr_node);
437 "NRS: starting to handle %s request from %s, with round "
438 LPU64"\n", NRS_POL_NAME_CRRN,
439 libcfs_id2str(req->rq_peer), nrq->nr_u.crr.cr_round);
441 /** Peek at the next request to be served */
442 node = cfs_binheap_root(net->cn_binheap);
444 /** No more requests */
445 if (unlikely(node == NULL)) {
448 struct ptlrpc_nrs_request *next;
450 next = container_of(node, struct ptlrpc_nrs_request,
453 if (net->cn_round < next->nr_u.crr.cr_round)
454 net->cn_round = next->nr_u.crr.cr_round;
462 * Adds request \a nrq to a CRR-N \a policy instance's set of queued requests
464 * A scheduling round is a stream of requests that have been sorted in batches
465 * according to the client that they originate from (as identified by its NID);
466 * there can be only one batch for each client in each round. The batches are of
467 * maximum size nrs_crrn_net:cn_quantum. When a new request arrives for
468 * scheduling from a client that has exhausted its quantum in its current round,
469 * it will start scheduling requests on the next scheduling round. Clients are
470 * allowed to schedule requests against a round until all requests for the round
471 * are serviced, so a client might miss a round if it is not generating requests
472 * for a long enough period of time. Clients that miss a round will continue
473 * with scheduling the next request that they generate, starting at the round
474 * that requests are being dispatched for, at the time of arrival of this new
477 * Requests are tagged with the round number and a sequence number; the sequence
478 * number indicates the relative ordering amongst the batches of requests in a
479 * round, and is identical for all requests in a batch, as is the round number.
480 * The round and sequence numbers are used by crrn_req_compare() in order to
481 * maintain an ordered set of rounds, with each round consisting of an ordered
482 * set of batches of requests.
484 * \param[in] policy the policy
485 * \param[in] nrq the request to add
487 * \retval 0 request successfully added
490 static int nrs_crrn_req_add(struct ptlrpc_nrs_policy *policy,
491 struct ptlrpc_nrs_request *nrq)
493 struct nrs_crrn_net *net;
494 struct nrs_crrn_client *cli;
497 cli = container_of(nrs_request_resource(nrq),
498 struct nrs_crrn_client, cc_res);
499 net = container_of(nrs_request_resource(nrq)->res_parent,
500 struct nrs_crrn_net, cn_res);
502 if (cli->cc_quantum == 0 || cli->cc_round < net->cn_round ||
503 (cli->cc_active == 0 && cli->cc_quantum > 0)) {
506 * If the client has no pending requests, and still some of its
507 * quantum remaining unused, which implies it has not had a
508 * chance to schedule up to its maximum allowed batch size of
509 * requests in the previous round it participated, schedule this
510 * next request on a new round; this avoids fragmentation of
511 * request batches caused by client inactivity, at the expense
512 * of potentially slightly increased service time for the
513 * request batch this request will be a part of.
515 if (cli->cc_active == 0 && cli->cc_quantum > 0)
518 /** A new scheduling round has commenced */
519 if (cli->cc_round < net->cn_round)
520 cli->cc_round = net->cn_round;
522 /** I was not the last client through here */
523 if (cli->cc_sequence < net->cn_sequence)
524 cli->cc_sequence = ++net->cn_sequence;
526 * Reset the quantum if we have reached the maximum quantum
527 * size for this batch, or even if we have not managed to
528 * complete a batch size up to its maximum allowed size.
529 * XXX: Accessed unlocked
531 cli->cc_quantum = net->cn_quantum;
534 nrq->nr_u.crr.cr_round = cli->cc_round;
535 nrq->nr_u.crr.cr_sequence = cli->cc_sequence;
537 rc = cfs_binheap_insert(net->cn_binheap, &nrq->nr_node);
540 if (--cli->cc_quantum == 0)
547 * Removes request \a nrq from a CRR-N \a policy instance's set of queued
550 * \param[in] policy the policy
551 * \param[in] nrq the request to remove
553 static void nrs_crrn_req_del(struct ptlrpc_nrs_policy *policy,
554 struct ptlrpc_nrs_request *nrq)
556 struct nrs_crrn_net *net;
557 struct nrs_crrn_client *cli;
560 cli = container_of(nrs_request_resource(nrq),
561 struct nrs_crrn_client, cc_res);
562 net = container_of(nrs_request_resource(nrq)->res_parent,
563 struct nrs_crrn_net, cn_res);
565 LASSERT(nrq->nr_u.crr.cr_round <= cli->cc_round);
567 is_root = &nrq->nr_node == cfs_binheap_root(net->cn_binheap);
569 cfs_binheap_remove(net->cn_binheap, &nrq->nr_node);
573 * If we just deleted the node at the root of the binheap, we may have
574 * to adjust round numbers.
576 if (unlikely(is_root)) {
577 /** Peek at the next request to be served */
578 cfs_binheap_node_t *node = cfs_binheap_root(net->cn_binheap);
580 /** No more requests */
581 if (unlikely(node == NULL)) {
584 nrq = container_of(node, struct ptlrpc_nrs_request,
587 if (net->cn_round < nrq->nr_u.crr.cr_round)
588 net->cn_round = nrq->nr_u.crr.cr_round;
594 * Called right after the request \a nrq finishes being handled by CRR-N policy
595 * instance \a policy.
597 * \param[in] policy the policy that handled the request
598 * \param[in] nrq the request that was handled
600 static void nrs_crrn_req_stop(struct ptlrpc_nrs_policy *policy,
601 struct ptlrpc_nrs_request *nrq)
603 struct ptlrpc_request *req = container_of(nrq, struct ptlrpc_request,
607 "NRS: finished handling %s request from %s, with round "LPU64
608 "\n", NRS_POL_NAME_CRRN,
609 libcfs_id2str(req->rq_peer), nrq->nr_u.crr.cr_round);
619 * Retrieves the value of the Round Robin quantum (i.e. the maximum batch size)
620 * for CRR-N policy instances on both the regular and high-priority NRS head
621 * of a service, as long as a policy instance is not in the
622 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state; policy instances in this
623 * state are skipped later by nrs_crrn_ctl().
625 * Quantum values are in # of RPCs, and output is in YAML format.
633 ptlrpc_lprocfs_nrs_crrn_quantum_seq_show(struct seq_file *m, void *data)
635 struct ptlrpc_service *svc = m->private;
640 * Perform two separate calls to this as only one of the NRS heads'
641 * policies may be in the ptlrpc_nrs_pol_state::NRS_POL_STATE_STARTED or
642 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPING state.
644 rc = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_REG,
646 NRS_CTL_CRRN_RD_QUANTUM,
649 seq_printf(m, NRS_LPROCFS_QUANTUM_NAME_REG
652 * Ignore -ENODEV as the regular NRS head's policy may be in the
653 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state.
655 } else if (rc != -ENODEV) {
659 if (!nrs_svc_has_hp(svc))
662 rc = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_HP,
664 NRS_CTL_CRRN_RD_QUANTUM,
667 seq_printf(m, NRS_LPROCFS_QUANTUM_NAME_HP"%-5d\n", quantum);
669 * Ignore -ENODEV as the high priority NRS head's policy may be
670 * in the ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state.
672 } else if (rc != -ENODEV) {
681 * Sets the value of the Round Robin quantum (i.e. the maximum batch size)
682 * for CRR-N policy instances of a service. The user can set the quantum size
683 * for the regular or high priority NRS head individually by specifying each
684 * value, or both together in a single invocation.
688 * lctl set_param *.*.*.nrs_crrn_quantum=reg_quantum:32, to set the regular
689 * request quantum size on all PTLRPC services to 32
691 * lctl set_param *.*.*.nrs_crrn_quantum=hp_quantum:16, to set the high
692 * priority request quantum size on all PTLRPC services to 16, and
694 * lctl set_param *.*.ost_io.nrs_crrn_quantum=16, to set both the regular and
695 * high priority request quantum sizes of the ost_io service to 16.
697 * policy instances in the ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state
698 * are skipped later by nrs_crrn_ctl().
701 ptlrpc_lprocfs_nrs_crrn_quantum_seq_write(struct file *file,
702 const char *buffer, size_t count,
705 struct ptlrpc_service *svc = ((struct seq_file *)file->private_data)->private;
706 enum ptlrpc_nrs_queue_type queue = 0;
707 char kernbuf[LPROCFS_NRS_WR_QUANTUM_MAX_CMD];
711 /** lprocfs_find_named_value() modifies its argument, so keep a copy */
716 if (count > (sizeof(kernbuf) - 1))
719 if (copy_from_user(kernbuf, buffer, count))
722 kernbuf[count] = '\0';
727 * Check if the regular quantum value has been specified
729 val = lprocfs_find_named_value(kernbuf, NRS_LPROCFS_QUANTUM_NAME_REG,
731 if (val != kernbuf) {
732 quantum_reg = simple_strtol(val, NULL, 10);
734 queue |= PTLRPC_NRS_QUEUE_REG;
740 * Check if the high priority quantum value has been specified
742 val = lprocfs_find_named_value(kernbuf, NRS_LPROCFS_QUANTUM_NAME_HP,
744 if (val != kernbuf) {
745 if (!nrs_svc_has_hp(svc))
748 quantum_hp = simple_strtol(val, NULL, 10);
750 queue |= PTLRPC_NRS_QUEUE_HP;
754 * If none of the queues has been specified, look for a valid numerical
758 if (!isdigit(kernbuf[0]))
761 quantum_reg = simple_strtol(kernbuf, NULL, 10);
763 queue = PTLRPC_NRS_QUEUE_REG;
765 if (nrs_svc_has_hp(svc)) {
766 queue |= PTLRPC_NRS_QUEUE_HP;
767 quantum_hp = quantum_reg;
771 if ((((queue & PTLRPC_NRS_QUEUE_REG) != 0) &&
772 ((quantum_reg > LPROCFS_NRS_QUANTUM_MAX || quantum_reg <= 0))) ||
773 (((queue & PTLRPC_NRS_QUEUE_HP) != 0) &&
774 ((quantum_hp > LPROCFS_NRS_QUANTUM_MAX || quantum_hp <= 0))))
778 * We change the values on regular and HP NRS heads separately, so that
779 * we do not exit early from ptlrpc_nrs_policy_control() with an error
780 * returned by nrs_policy_ctl_locked(), in cases where the user has not
781 * started the policy on either the regular or HP NRS head; i.e. we are
782 * ignoring -ENODEV within nrs_policy_ctl_locked(). -ENODEV is returned
783 * only if the operation fails with -ENODEV on all heads that have been
784 * specified by the command; if at least one operation succeeds,
785 * success is returned.
787 if ((queue & PTLRPC_NRS_QUEUE_REG) != 0) {
788 rc = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_REG,
790 NRS_CTL_CRRN_WR_QUANTUM, false,
792 if ((rc < 0 && rc != -ENODEV) ||
793 (rc == -ENODEV && queue == PTLRPC_NRS_QUEUE_REG))
797 if ((queue & PTLRPC_NRS_QUEUE_HP) != 0) {
798 rc2 = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_HP,
800 NRS_CTL_CRRN_WR_QUANTUM, false,
802 if ((rc2 < 0 && rc2 != -ENODEV) ||
803 (rc2 == -ENODEV && queue == PTLRPC_NRS_QUEUE_HP))
807 return rc == -ENODEV && rc2 == -ENODEV ? -ENODEV : count;
809 LPROC_SEQ_FOPS(ptlrpc_lprocfs_nrs_crrn_quantum);
812 * Initializes a CRR-N policy's lprocfs interface for service \a svc
814 * \param[in] svc the service
819 int nrs_crrn_lprocfs_init(struct ptlrpc_service *svc)
821 struct lprocfs_seq_vars nrs_crrn_lprocfs_vars[] = {
822 { .name = "nrs_crrn_quantum",
823 .fops = &ptlrpc_lprocfs_nrs_crrn_quantum_fops,
828 if (svc->srv_procroot == NULL)
831 return lprocfs_seq_add_vars(svc->srv_procroot, nrs_crrn_lprocfs_vars,
836 * Cleans up a CRR-N policy's lprocfs interface for service \a svc
838 * \param[in] svc the service
840 void nrs_crrn_lprocfs_fini(struct ptlrpc_service *svc)
842 if (svc->srv_procroot == NULL)
845 lprocfs_remove_proc_entry("nrs_crrn_quantum", svc->srv_procroot);
851 * CRR-N policy operations
853 static const struct ptlrpc_nrs_pol_ops nrs_crrn_ops = {
854 .op_policy_start = nrs_crrn_start,
855 .op_policy_stop = nrs_crrn_stop,
856 .op_policy_ctl = nrs_crrn_ctl,
857 .op_res_get = nrs_crrn_res_get,
858 .op_res_put = nrs_crrn_res_put,
859 .op_req_get = nrs_crrn_req_get,
860 .op_req_enqueue = nrs_crrn_req_add,
861 .op_req_dequeue = nrs_crrn_req_del,
862 .op_req_stop = nrs_crrn_req_stop,
864 .op_lprocfs_init = nrs_crrn_lprocfs_init,
865 .op_lprocfs_fini = nrs_crrn_lprocfs_fini,
870 * CRR-N policy configuration
872 struct ptlrpc_nrs_pol_conf nrs_conf_crrn = {
873 .nc_name = NRS_POL_NAME_CRRN,
874 .nc_ops = &nrs_crrn_ops,
875 .nc_compat = nrs_policy_compat_all,
878 /** @} CRR-N policy */
882 #endif /* HAVE_SERVER_SUPPORT */