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) 2013, 2017, 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
76 crrn_req_compare(struct cfs_binheap_node *e1, struct cfs_binheap_node *e2)
78 struct ptlrpc_nrs_request *nrq1;
79 struct ptlrpc_nrs_request *nrq2;
81 nrq1 = container_of(e1, struct ptlrpc_nrs_request, nr_node);
82 nrq2 = container_of(e2, struct ptlrpc_nrs_request, nr_node);
84 if (nrq1->nr_u.crr.cr_round < nrq2->nr_u.crr.cr_round)
86 else if (nrq1->nr_u.crr.cr_round > nrq2->nr_u.crr.cr_round)
89 return nrq1->nr_u.crr.cr_sequence < nrq2->nr_u.crr.cr_sequence;
92 static struct cfs_binheap_ops nrs_crrn_heap_ops = {
95 .hop_compare = crrn_req_compare,
99 * rhashtable operations for nrs_crrn_net::cn_cli_hash
101 * This uses ptlrpc_request::rq_peer.nid as its key, in order to hash
102 * nrs_crrn_client objects.
104 static u32 nrs_crrn_hashfn(const void *data, u32 len, u32 seed)
106 const lnet_nid_t *nid = data;
108 seed ^= cfs_hash_64((u64)nid, 32);
112 static int nrs_crrn_cmpfn(struct rhashtable_compare_arg *arg, const void *obj)
114 const struct nrs_crrn_client *cli = obj;
115 const lnet_nid_t *nid = arg->key;
117 return *nid != cli->cc_nid;
120 static const struct rhashtable_params nrs_crrn_hash_params = {
121 .key_len = sizeof(lnet_nid_t),
122 .key_offset = offsetof(struct nrs_crrn_client, cc_nid),
123 .head_offset = offsetof(struct nrs_crrn_client, cc_rhead),
124 .hashfn = nrs_crrn_hashfn,
125 .obj_cmpfn = nrs_crrn_cmpfn,
128 static void nrs_crrn_exit(void *vcli, void *data)
130 struct nrs_crrn_client *cli = vcli;
132 LASSERTF(atomic_read(&cli->cc_ref) == 0,
133 "Busy CRR-N object from client with NID %s, with %d refs\n",
134 libcfs_nid2str(cli->cc_nid), atomic_read(&cli->cc_ref));
140 * Called when a CRR-N policy instance is started.
142 * \param[in] policy the policy
144 * \retval -ENOMEM OOM error
147 static int nrs_crrn_start(struct ptlrpc_nrs_policy *policy, char *arg)
149 struct nrs_crrn_net *net;
153 OBD_CPT_ALLOC_PTR(net, nrs_pol2cptab(policy), nrs_pol2cptid(policy));
157 net->cn_binheap = cfs_binheap_create(&nrs_crrn_heap_ops,
158 CBH_FLAG_ATOMIC_GROW, 4096, NULL,
159 nrs_pol2cptab(policy),
160 nrs_pol2cptid(policy));
161 if (net->cn_binheap == NULL)
162 GOTO(out_net, rc = -ENOMEM);
164 rc = rhashtable_init(&net->cn_cli_hash, &nrs_crrn_hash_params);
166 GOTO(out_binheap, rc);
169 * Set default quantum value to max_rpcs_in_flight for non-MDS OSCs;
170 * there may be more RPCs pending from each struct nrs_crrn_client even
171 * with the default max_rpcs_in_flight value, as we are scheduling over
172 * NIDs, and there may be more than one mount point per client.
174 net->cn_quantum = OBD_MAX_RIF_DEFAULT;
176 * Set to 1 so that the test inside nrs_crrn_req_add() can evaluate to
179 net->cn_sequence = 1;
181 policy->pol_private = net;
186 cfs_binheap_destroy(net->cn_binheap);
194 * Called when a CRR-N policy instance is stopped.
196 * Called when the policy has been instructed to transition to the
197 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state and has no more pending
200 * \param[in] policy the policy
202 static void nrs_crrn_stop(struct ptlrpc_nrs_policy *policy)
204 struct nrs_crrn_net *net = policy->pol_private;
207 LASSERT(net != NULL);
208 LASSERT(net->cn_binheap != NULL);
209 LASSERT(cfs_binheap_is_empty(net->cn_binheap));
211 rhashtable_free_and_destroy(&net->cn_cli_hash, nrs_crrn_exit, NULL);
212 cfs_binheap_destroy(net->cn_binheap);
218 * Performs a policy-specific ctl function on CRR-N policy instances; similar
221 * \param[in] policy the policy instance
222 * \param[in] opc the opcode
223 * \param[in,out] arg used for passing parameters and information
225 * \pre assert_spin_locked(&policy->pol_nrs->->nrs_lock)
226 * \post assert_spin_locked(&policy->pol_nrs->->nrs_lock)
228 * \retval 0 operation carried out successfully
231 static int nrs_crrn_ctl(struct ptlrpc_nrs_policy *policy,
232 enum ptlrpc_nrs_ctl opc,
235 assert_spin_locked(&policy->pol_nrs->nrs_lock);
237 switch((enum nrs_ctl_crr)opc) {
242 * Read Round Robin quantum size of a policy instance.
244 case NRS_CTL_CRRN_RD_QUANTUM: {
245 struct nrs_crrn_net *net = policy->pol_private;
247 *(__u16 *)arg = net->cn_quantum;
252 * Write Round Robin quantum size of a policy instance.
254 case NRS_CTL_CRRN_WR_QUANTUM: {
255 struct nrs_crrn_net *net = policy->pol_private;
257 net->cn_quantum = *(__u16 *)arg;
258 LASSERT(net->cn_quantum != 0);
267 * Obtains resources from CRR-N policy instances. The top-level resource lives
268 * inside \e nrs_crrn_net and the second-level resource inside
269 * \e nrs_crrn_client object instances.
271 * \param[in] policy the policy for which resources are being taken for
273 * \param[in] nrq the request for which resources are being taken
274 * \param[in] parent parent resource, embedded in nrs_crrn_net for the
276 * \param[out] resp resources references are placed in this array
277 * \param[in] moving_req signifies limited caller context; used to perform
278 * memory allocations in an atomic context in this
281 * \retval 0 we are returning a top-level, parent resource, one that is
282 * embedded in an nrs_crrn_net object
283 * \retval 1 we are returning a bottom-level resource, one that is embedded
284 * in an nrs_crrn_client object
286 * \see nrs_resource_get_safe()
288 static int nrs_crrn_res_get(struct ptlrpc_nrs_policy *policy,
289 struct ptlrpc_nrs_request *nrq,
290 const struct ptlrpc_nrs_resource *parent,
291 struct ptlrpc_nrs_resource **resp, bool moving_req)
293 struct nrs_crrn_net *net;
294 struct nrs_crrn_client *cli;
295 struct nrs_crrn_client *tmp;
296 struct ptlrpc_request *req;
298 if (parent == NULL) {
299 *resp = &((struct nrs_crrn_net *)policy->pol_private)->cn_res;
303 net = container_of(parent, struct nrs_crrn_net, cn_res);
304 req = container_of(nrq, struct ptlrpc_request, rq_nrq);
306 cli = rhashtable_lookup_fast(&net->cn_cli_hash, &req->rq_peer.nid,
307 nrs_crrn_hash_params);
311 OBD_CPT_ALLOC_GFP(cli, nrs_pol2cptab(policy), nrs_pol2cptid(policy),
312 sizeof(*cli), moving_req ? GFP_ATOMIC : GFP_NOFS);
316 cli->cc_nid = req->rq_peer.nid;
318 atomic_set(&cli->cc_ref, 0);
320 tmp = rhashtable_lookup_get_insert_fast(&net->cn_cli_hash,
322 nrs_crrn_hash_params);
324 /* insertion failed */
331 atomic_inc(&cli->cc_ref);
332 *resp = &cli->cc_res;
338 * Called when releasing references to the resource hierachy obtained for a
339 * request for scheduling using the CRR-N policy.
341 * \param[in] policy the policy the resource belongs to
342 * \param[in] res the resource to be released
344 static void nrs_crrn_res_put(struct ptlrpc_nrs_policy *policy,
345 const struct ptlrpc_nrs_resource *res)
347 struct nrs_crrn_client *cli;
350 * Do nothing for freeing parent, nrs_crrn_net resources
352 if (res->res_parent == NULL)
355 cli = container_of(res, struct nrs_crrn_client, cc_res);
357 atomic_dec(&cli->cc_ref);
361 * Called when getting a request from the CRR-N policy for handlingso that it can be served
363 * \param[in] policy the policy being polled
364 * \param[in] peek when set, signifies that we just want to examine the
365 * request, and not handle it, so the request is not removed
367 * \param[in] force force the policy to return a request; unused in this policy
369 * \retval the request to be handled
370 * \retval NULL no request available
372 * \see ptlrpc_nrs_req_get_nolock()
373 * \see nrs_request_get()
376 struct ptlrpc_nrs_request *nrs_crrn_req_get(struct ptlrpc_nrs_policy *policy,
377 bool peek, bool force)
379 struct nrs_crrn_net *net = policy->pol_private;
380 struct cfs_binheap_node *node = cfs_binheap_root(net->cn_binheap);
381 struct ptlrpc_nrs_request *nrq;
383 nrq = unlikely(node == NULL) ? NULL :
384 container_of(node, struct ptlrpc_nrs_request, nr_node);
386 if (likely(!peek && nrq != NULL)) {
387 struct nrs_crrn_client *cli;
388 struct ptlrpc_request *req = container_of(nrq,
389 struct ptlrpc_request,
392 cli = container_of(nrs_request_resource(nrq),
393 struct nrs_crrn_client, cc_res);
395 LASSERT(nrq->nr_u.crr.cr_round <= cli->cc_round);
397 cfs_binheap_remove(net->cn_binheap, &nrq->nr_node);
401 "NRS: starting to handle %s request from %s, with round "
402 "%llu\n", NRS_POL_NAME_CRRN,
403 libcfs_id2str(req->rq_peer), nrq->nr_u.crr.cr_round);
405 /** Peek at the next request to be served */
406 node = cfs_binheap_root(net->cn_binheap);
408 /** No more requests */
409 if (unlikely(node == NULL)) {
412 struct ptlrpc_nrs_request *next;
414 next = container_of(node, struct ptlrpc_nrs_request,
417 if (net->cn_round < next->nr_u.crr.cr_round)
418 net->cn_round = next->nr_u.crr.cr_round;
426 * Adds request \a nrq to a CRR-N \a policy instance's set of queued requests
428 * A scheduling round is a stream of requests that have been sorted in batches
429 * according to the client that they originate from (as identified by its NID);
430 * there can be only one batch for each client in each round. The batches are of
431 * maximum size nrs_crrn_net:cn_quantum. When a new request arrives for
432 * scheduling from a client that has exhausted its quantum in its current round,
433 * it will start scheduling requests on the next scheduling round. Clients are
434 * allowed to schedule requests against a round until all requests for the round
435 * are serviced, so a client might miss a round if it is not generating requests
436 * for a long enough period of time. Clients that miss a round will continue
437 * with scheduling the next request that they generate, starting at the round
438 * that requests are being dispatched for, at the time of arrival of this new
441 * Requests are tagged with the round number and a sequence number; the sequence
442 * number indicates the relative ordering amongst the batches of requests in a
443 * round, and is identical for all requests in a batch, as is the round number.
444 * The round and sequence numbers are used by crrn_req_compare() in order to
445 * maintain an ordered set of rounds, with each round consisting of an ordered
446 * set of batches of requests.
448 * \param[in] policy the policy
449 * \param[in] nrq the request to add
451 * \retval 0 request successfully added
454 static int nrs_crrn_req_add(struct ptlrpc_nrs_policy *policy,
455 struct ptlrpc_nrs_request *nrq)
457 struct nrs_crrn_net *net;
458 struct nrs_crrn_client *cli;
461 cli = container_of(nrs_request_resource(nrq),
462 struct nrs_crrn_client, cc_res);
463 net = container_of(nrs_request_resource(nrq)->res_parent,
464 struct nrs_crrn_net, cn_res);
466 if (cli->cc_quantum == 0 || cli->cc_round < net->cn_round ||
467 (cli->cc_active == 0 && cli->cc_quantum > 0)) {
470 * If the client has no pending requests, and still some of its
471 * quantum remaining unused, which implies it has not had a
472 * chance to schedule up to its maximum allowed batch size of
473 * requests in the previous round it participated, schedule this
474 * next request on a new round; this avoids fragmentation of
475 * request batches caused by client inactivity, at the expense
476 * of potentially slightly increased service time for the
477 * request batch this request will be a part of.
479 if (cli->cc_active == 0 && cli->cc_quantum > 0)
482 /** A new scheduling round has commenced */
483 if (cli->cc_round < net->cn_round)
484 cli->cc_round = net->cn_round;
486 /** I was not the last client through here */
487 if (cli->cc_sequence < net->cn_sequence)
488 cli->cc_sequence = ++net->cn_sequence;
490 * Reset the quantum if we have reached the maximum quantum
491 * size for this batch, or even if we have not managed to
492 * complete a batch size up to its maximum allowed size.
493 * XXX: Accessed unlocked
495 cli->cc_quantum = net->cn_quantum;
498 nrq->nr_u.crr.cr_round = cli->cc_round;
499 nrq->nr_u.crr.cr_sequence = cli->cc_sequence;
501 rc = cfs_binheap_insert(net->cn_binheap, &nrq->nr_node);
504 if (--cli->cc_quantum == 0)
511 * Removes request \a nrq from a CRR-N \a policy instance's set of queued
514 * \param[in] policy the policy
515 * \param[in] nrq the request to remove
517 static void nrs_crrn_req_del(struct ptlrpc_nrs_policy *policy,
518 struct ptlrpc_nrs_request *nrq)
520 struct nrs_crrn_net *net;
521 struct nrs_crrn_client *cli;
524 cli = container_of(nrs_request_resource(nrq),
525 struct nrs_crrn_client, cc_res);
526 net = container_of(nrs_request_resource(nrq)->res_parent,
527 struct nrs_crrn_net, cn_res);
529 LASSERT(nrq->nr_u.crr.cr_round <= cli->cc_round);
531 is_root = &nrq->nr_node == cfs_binheap_root(net->cn_binheap);
533 cfs_binheap_remove(net->cn_binheap, &nrq->nr_node);
537 * If we just deleted the node at the root of the binheap, we may have
538 * to adjust round numbers.
540 if (unlikely(is_root)) {
541 /** Peek at the next request to be served */
542 struct cfs_binheap_node *node = cfs_binheap_root(net->cn_binheap);
544 /** No more requests */
545 if (unlikely(node == NULL)) {
548 nrq = container_of(node, struct ptlrpc_nrs_request,
551 if (net->cn_round < nrq->nr_u.crr.cr_round)
552 net->cn_round = nrq->nr_u.crr.cr_round;
558 * Called right after the request \a nrq finishes being handled by CRR-N policy
559 * instance \a policy.
561 * \param[in] policy the policy that handled the request
562 * \param[in] nrq the request that was handled
564 static void nrs_crrn_req_stop(struct ptlrpc_nrs_policy *policy,
565 struct ptlrpc_nrs_request *nrq)
567 struct ptlrpc_request *req = container_of(nrq, struct ptlrpc_request,
571 "NRS: finished handling %s request from %s, with round %llu"
572 "\n", NRS_POL_NAME_CRRN,
573 libcfs_id2str(req->rq_peer), nrq->nr_u.crr.cr_round);
581 * Retrieves the value of the Round Robin quantum (i.e. the maximum batch size)
582 * for CRR-N policy instances on both the regular and high-priority NRS head
583 * of a service, as long as a policy instance is not in the
584 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state; policy instances in this
585 * state are skipped later by nrs_crrn_ctl().
587 * Quantum values are in # of RPCs, and output is in YAML format.
595 ptlrpc_lprocfs_nrs_crrn_quantum_seq_show(struct seq_file *m, void *data)
597 struct ptlrpc_service *svc = m->private;
602 * Perform two separate calls to this as only one of the NRS heads'
603 * policies may be in the ptlrpc_nrs_pol_state::NRS_POL_STATE_STARTED or
604 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPING state.
606 rc = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_REG,
608 NRS_CTL_CRRN_RD_QUANTUM,
611 seq_printf(m, NRS_LPROCFS_QUANTUM_NAME_REG
614 * Ignore -ENODEV as the regular NRS head's policy may be in the
615 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state.
617 } else if (rc != -ENODEV) {
621 if (!nrs_svc_has_hp(svc))
624 rc = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_HP,
626 NRS_CTL_CRRN_RD_QUANTUM,
629 seq_printf(m, NRS_LPROCFS_QUANTUM_NAME_HP"%-5d\n", quantum);
631 * Ignore -ENODEV as the high priority NRS head's policy may be
632 * in the ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state.
634 } else if (rc != -ENODEV) {
643 * Sets the value of the Round Robin quantum (i.e. the maximum batch size)
644 * for CRR-N policy instances of a service. The user can set the quantum size
645 * for the regular or high priority NRS head individually by specifying each
646 * value, or both together in a single invocation.
650 * lctl set_param *.*.*.nrs_crrn_quantum=reg_quantum:32, to set the regular
651 * request quantum size on all PTLRPC services to 32
653 * lctl set_param *.*.*.nrs_crrn_quantum=hp_quantum:16, to set the high
654 * priority request quantum size on all PTLRPC services to 16, and
656 * lctl set_param *.*.ost_io.nrs_crrn_quantum=16, to set both the regular and
657 * high priority request quantum sizes of the ost_io service to 16.
659 * policy instances in the ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state
660 * are skipped later by nrs_crrn_ctl().
663 ptlrpc_lprocfs_nrs_crrn_quantum_seq_write(struct file *file,
664 const char __user *buffer,
668 struct seq_file *m = file->private_data;
669 struct ptlrpc_service *svc = m->private;
670 enum ptlrpc_nrs_queue_type queue = 0;
671 char kernbuf[LPROCFS_NRS_WR_QUANTUM_MAX_CMD];
675 /** lprocfs_find_named_value() modifies its argument, so keep a copy */
680 if (count > (sizeof(kernbuf) - 1))
683 if (copy_from_user(kernbuf, buffer, count))
686 kernbuf[count] = '\0';
691 * Check if the regular quantum value has been specified
693 val = lprocfs_find_named_value(kernbuf, NRS_LPROCFS_QUANTUM_NAME_REG,
695 if (val != kernbuf) {
696 rc = kstrtol(val, 10, &quantum_reg);
700 queue |= PTLRPC_NRS_QUEUE_REG;
706 * Check if the high priority quantum value has been specified
708 val = lprocfs_find_named_value(kernbuf, NRS_LPROCFS_QUANTUM_NAME_HP,
710 if (val != kernbuf) {
711 if (!nrs_svc_has_hp(svc))
714 rc = kstrtol(val, 10, &quantum_hp);
718 queue |= PTLRPC_NRS_QUEUE_HP;
722 * If none of the queues has been specified, look for a valid numerical
726 rc = kstrtol(kernbuf, 10, &quantum_reg);
730 queue = PTLRPC_NRS_QUEUE_REG;
732 if (nrs_svc_has_hp(svc)) {
733 queue |= PTLRPC_NRS_QUEUE_HP;
734 quantum_hp = quantum_reg;
738 if ((((queue & PTLRPC_NRS_QUEUE_REG) != 0) &&
739 ((quantum_reg > LPROCFS_NRS_QUANTUM_MAX || quantum_reg <= 0))) ||
740 (((queue & PTLRPC_NRS_QUEUE_HP) != 0) &&
741 ((quantum_hp > LPROCFS_NRS_QUANTUM_MAX || quantum_hp <= 0))))
745 * We change the values on regular and HP NRS heads separately, so that
746 * we do not exit early from ptlrpc_nrs_policy_control() with an error
747 * returned by nrs_policy_ctl_locked(), in cases where the user has not
748 * started the policy on either the regular or HP NRS head; i.e. we are
749 * ignoring -ENODEV within nrs_policy_ctl_locked(). -ENODEV is returned
750 * only if the operation fails with -ENODEV on all heads that have been
751 * specified by the command; if at least one operation succeeds,
752 * success is returned.
754 if ((queue & PTLRPC_NRS_QUEUE_REG) != 0) {
755 rc = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_REG,
757 NRS_CTL_CRRN_WR_QUANTUM, false,
759 if ((rc < 0 && rc != -ENODEV) ||
760 (rc == -ENODEV && queue == PTLRPC_NRS_QUEUE_REG))
764 if ((queue & PTLRPC_NRS_QUEUE_HP) != 0) {
765 rc2 = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_HP,
767 NRS_CTL_CRRN_WR_QUANTUM, false,
769 if ((rc2 < 0 && rc2 != -ENODEV) ||
770 (rc2 == -ENODEV && queue == PTLRPC_NRS_QUEUE_HP))
774 return rc == -ENODEV && rc2 == -ENODEV ? -ENODEV : count;
777 LDEBUGFS_SEQ_FOPS(ptlrpc_lprocfs_nrs_crrn_quantum);
780 * Initializes a CRR-N policy's lprocfs interface for service \a svc
782 * \param[in] svc the service
787 static int nrs_crrn_lprocfs_init(struct ptlrpc_service *svc)
789 struct lprocfs_vars nrs_crrn_lprocfs_vars[] = {
790 { .name = "nrs_crrn_quantum",
791 .fops = &ptlrpc_lprocfs_nrs_crrn_quantum_fops,
796 if (!svc->srv_debugfs_entry)
799 return ldebugfs_add_vars(svc->srv_debugfs_entry, nrs_crrn_lprocfs_vars, NULL);
803 * CRR-N policy operations
805 static const struct ptlrpc_nrs_pol_ops nrs_crrn_ops = {
806 .op_policy_start = nrs_crrn_start,
807 .op_policy_stop = nrs_crrn_stop,
808 .op_policy_ctl = nrs_crrn_ctl,
809 .op_res_get = nrs_crrn_res_get,
810 .op_res_put = nrs_crrn_res_put,
811 .op_req_get = nrs_crrn_req_get,
812 .op_req_enqueue = nrs_crrn_req_add,
813 .op_req_dequeue = nrs_crrn_req_del,
814 .op_req_stop = nrs_crrn_req_stop,
815 .op_lprocfs_init = nrs_crrn_lprocfs_init,
819 * CRR-N policy configuration
821 struct ptlrpc_nrs_pol_conf nrs_conf_crrn = {
822 .nc_name = NRS_POL_NAME_CRRN,
823 .nc_ops = &nrs_crrn_ops,
824 .nc_compat = nrs_policy_compat_all,
827 /** @} CRR-N policy */
831 #endif /* HAVE_SERVER_SUPPORT */