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>
42 #define DEBUG_SUBSYSTEM S_RPC
43 #include <obd_support.h>
44 #include <obd_class.h>
45 #include <lustre_net.h>
46 #include <lprocfs_status.h>
47 #include "ptlrpc_internal.h"
52 * Client Round-Robin scheduling over client NIDs
58 #define NRS_POL_NAME_CRRN "crrn"
61 * Binary heap predicate.
63 * Uses ptlrpc_nrs_request::nr_u::crr::cr_round and
64 * ptlrpc_nrs_request::nr_u::crr::cr_sequence to compare two binheap nodes and
65 * produce a binary predicate that shows their relative priority, so that the
66 * binary heap can perform the necessary sorting operations.
68 * \param[in] e1 the first binheap node to compare
69 * \param[in] e2 the second binheap node to compare
75 crrn_req_compare(struct binheap_node *e1, struct binheap_node *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 struct binheap_ops nrs_crrn_heap_ops = {
94 .hop_compare = crrn_req_compare,
98 * rhashtable operations for nrs_crrn_net::cn_cli_hash
100 * This uses ptlrpc_request::rq_peer.nid (as nid4) as its key, in order to hash
101 * nrs_crrn_client objects.
103 static u32 nrs_crrn_hashfn(const void *data, u32 len, u32 seed)
105 const lnet_nid_t *nid = data;
107 seed ^= cfs_hash_64((u64)nid, 32);
111 static int nrs_crrn_cmpfn(struct rhashtable_compare_arg *arg, const void *obj)
113 const struct nrs_crrn_client *cli = obj;
114 const struct lnet_nid *nid = arg->key;
116 return nid_same(nid, &cli->cc_nid) ? 0 : -ESRCH;
119 static const struct rhashtable_params nrs_crrn_hash_params = {
120 .key_len = sizeof(struct lnet_nid),
121 .key_offset = offsetof(struct nrs_crrn_client, cc_nid),
122 .head_offset = offsetof(struct nrs_crrn_client, cc_rhead),
123 .hashfn = nrs_crrn_hashfn,
124 .obj_cmpfn = nrs_crrn_cmpfn,
127 static void nrs_crrn_exit(void *vcli, void *data)
129 struct nrs_crrn_client *cli = vcli;
131 LASSERTF(atomic_read(&cli->cc_ref) == 0,
132 "Busy CRR-N object from client with NID %s, with %d refs\n",
133 libcfs_nidstr(&cli->cc_nid), atomic_read(&cli->cc_ref));
139 * Called when a CRR-N policy instance is started.
141 * \param[in] policy the policy
143 * \retval -ENOMEM OOM error
146 static int nrs_crrn_start(struct ptlrpc_nrs_policy *policy, char *arg)
148 struct nrs_crrn_net *net;
152 OBD_CPT_ALLOC_PTR(net, nrs_pol2cptab(policy), nrs_pol2cptid(policy));
156 net->cn_binheap = binheap_create(&nrs_crrn_heap_ops,
157 CBH_FLAG_ATOMIC_GROW, 4096, NULL,
158 nrs_pol2cptab(policy),
159 nrs_pol2cptid(policy));
160 if (net->cn_binheap == NULL)
161 GOTO(out_net, rc = -ENOMEM);
163 rc = rhashtable_init(&net->cn_cli_hash, &nrs_crrn_hash_params);
165 GOTO(out_binheap, rc);
168 * Set default quantum value to max_rpcs_in_flight for non-MDS OSCs;
169 * there may be more RPCs pending from each struct nrs_crrn_client even
170 * with the default max_rpcs_in_flight value, as we are scheduling over
171 * NIDs, and there may be more than one mount point per client.
173 net->cn_quantum = OBD_MAX_RIF_DEFAULT;
175 * Set to 1 so that the test inside nrs_crrn_req_add() can evaluate to
178 net->cn_sequence = 1;
180 policy->pol_private = net;
185 binheap_destroy(net->cn_binheap);
193 * Called when a CRR-N policy instance is stopped.
195 * Called when the policy has been instructed to transition to the
196 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state and has no more pending
199 * \param[in] policy the policy
201 static void nrs_crrn_stop(struct ptlrpc_nrs_policy *policy)
203 struct nrs_crrn_net *net = policy->pol_private;
206 LASSERT(net != NULL);
207 LASSERT(net->cn_binheap != NULL);
208 LASSERT(binheap_is_empty(net->cn_binheap));
210 rhashtable_free_and_destroy(&net->cn_cli_hash, nrs_crrn_exit, NULL);
211 binheap_destroy(net->cn_binheap);
217 * Performs a policy-specific ctl function on CRR-N policy instances; similar
220 * \param[in] policy the policy instance
221 * \param[in] opc the opcode
222 * \param[in,out] arg used for passing parameters and information
224 * \pre assert_spin_locked(&policy->pol_nrs->->nrs_lock)
225 * \post assert_spin_locked(&policy->pol_nrs->->nrs_lock)
227 * \retval 0 operation carried out successfully
230 static int nrs_crrn_ctl(struct ptlrpc_nrs_policy *policy,
231 enum ptlrpc_nrs_ctl opc,
234 assert_spin_locked(&policy->pol_nrs->nrs_lock);
241 * Read Round Robin quantum size of a policy instance.
243 case NRS_CTL_CRRN_RD_QUANTUM: {
244 struct nrs_crrn_net *net = policy->pol_private;
246 *(__u16 *)arg = net->cn_quantum;
251 * Write Round Robin quantum size of a policy instance.
253 case NRS_CTL_CRRN_WR_QUANTUM: {
254 struct nrs_crrn_net *net = policy->pol_private;
256 net->cn_quantum = *(__u16 *)arg;
257 LASSERT(net->cn_quantum != 0);
266 * Obtains resources from CRR-N policy instances. The top-level resource lives
267 * inside \e nrs_crrn_net and the second-level resource inside
268 * \e nrs_crrn_client object instances.
270 * \param[in] policy the policy for which resources are being taken for
272 * \param[in] nrq the request for which resources are being taken
273 * \param[in] parent parent resource, embedded in nrs_crrn_net for the
275 * \param[out] resp resources references are placed in this array
276 * \param[in] moving_req signifies limited caller context; used to perform
277 * memory allocations in an atomic context in this
280 * \retval 0 we are returning a top-level, parent resource, one that is
281 * embedded in an nrs_crrn_net object
282 * \retval 1 we are returning a bottom-level resource, one that is embedded
283 * in an nrs_crrn_client object
285 * \see nrs_resource_get_safe()
287 static int nrs_crrn_res_get(struct ptlrpc_nrs_policy *policy,
288 struct ptlrpc_nrs_request *nrq,
289 const struct ptlrpc_nrs_resource *parent,
290 struct ptlrpc_nrs_resource **resp, bool moving_req)
292 struct nrs_crrn_net *net;
293 struct nrs_crrn_client *cli;
294 struct nrs_crrn_client *tmp;
295 struct ptlrpc_request *req;
297 if (parent == NULL) {
298 *resp = &((struct nrs_crrn_net *)policy->pol_private)->cn_res;
302 net = container_of(parent, struct nrs_crrn_net, cn_res);
303 req = container_of(nrq, struct ptlrpc_request, rq_nrq);
304 cli = rhashtable_lookup_fast(&net->cn_cli_hash, &req->rq_peer.nid,
305 nrs_crrn_hash_params);
309 OBD_CPT_ALLOC_GFP(cli, nrs_pol2cptab(policy), nrs_pol2cptid(policy),
310 sizeof(*cli), moving_req ? GFP_ATOMIC : GFP_NOFS);
314 cli->cc_nid = req->rq_peer.nid;
316 atomic_set(&cli->cc_ref, 0);
318 tmp = rhashtable_lookup_get_insert_fast(&net->cn_cli_hash,
320 nrs_crrn_hash_params);
322 /* insertion failed */
329 atomic_inc(&cli->cc_ref);
330 *resp = &cli->cc_res;
336 * Called when releasing references to the resource hierachy obtained for a
337 * request for scheduling using the CRR-N policy.
339 * \param[in] policy the policy the resource belongs to
340 * \param[in] res the resource to be released
342 static void nrs_crrn_res_put(struct ptlrpc_nrs_policy *policy,
343 const struct ptlrpc_nrs_resource *res)
345 struct nrs_crrn_client *cli;
348 * Do nothing for freeing parent, nrs_crrn_net resources
350 if (res->res_parent == NULL)
353 cli = container_of(res, struct nrs_crrn_client, cc_res);
355 atomic_dec(&cli->cc_ref);
359 * Called when getting a request from the CRR-N policy for handlingso that it can be served
361 * \param[in] policy the policy being polled
362 * \param[in] peek when set, signifies that we just want to examine the
363 * request, and not handle it, so the request is not removed
365 * \param[in] force force the policy to return a request; unused in this policy
367 * \retval the request to be handled
368 * \retval NULL no request available
370 * \see ptlrpc_nrs_req_get_nolock()
371 * \see nrs_request_get()
374 struct ptlrpc_nrs_request *nrs_crrn_req_get(struct ptlrpc_nrs_policy *policy,
375 bool peek, bool force)
377 struct nrs_crrn_net *net = policy->pol_private;
378 struct binheap_node *node = binheap_root(net->cn_binheap);
379 struct ptlrpc_nrs_request *nrq;
381 nrq = unlikely(node == NULL) ? NULL :
382 container_of(node, struct ptlrpc_nrs_request, nr_node);
384 if (likely(!peek && nrq != NULL)) {
385 struct nrs_crrn_client *cli;
386 struct ptlrpc_request *req = container_of(nrq,
387 struct ptlrpc_request,
390 cli = container_of(nrs_request_resource(nrq),
391 struct nrs_crrn_client, cc_res);
393 LASSERT(nrq->nr_u.crr.cr_round <= cli->cc_round);
395 binheap_remove(net->cn_binheap, &nrq->nr_node);
399 "NRS: starting to handle %s request from %s, with round "
400 "%llu\n", NRS_POL_NAME_CRRN,
401 libcfs_idstr(&req->rq_peer), nrq->nr_u.crr.cr_round);
403 /** Peek at the next request to be served */
404 node = binheap_root(net->cn_binheap);
406 /** No more requests */
407 if (unlikely(node == NULL)) {
410 struct ptlrpc_nrs_request *next;
412 next = container_of(node, struct ptlrpc_nrs_request,
415 if (net->cn_round < next->nr_u.crr.cr_round)
416 net->cn_round = next->nr_u.crr.cr_round;
424 * Adds request \a nrq to a CRR-N \a policy instance's set of queued requests
426 * A scheduling round is a stream of requests that have been sorted in batches
427 * according to the client that they originate from (as identified by its NID);
428 * there can be only one batch for each client in each round. The batches are of
429 * maximum size nrs_crrn_net:cn_quantum. When a new request arrives for
430 * scheduling from a client that has exhausted its quantum in its current round,
431 * it will start scheduling requests on the next scheduling round. Clients are
432 * allowed to schedule requests against a round until all requests for the round
433 * are serviced, so a client might miss a round if it is not generating requests
434 * for a long enough period of time. Clients that miss a round will continue
435 * with scheduling the next request that they generate, starting at the round
436 * that requests are being dispatched for, at the time of arrival of this new
439 * Requests are tagged with the round number and a sequence number; the sequence
440 * number indicates the relative ordering amongst the batches of requests in a
441 * round, and is identical for all requests in a batch, as is the round number.
442 * The round and sequence numbers are used by crrn_req_compare() in order to
443 * maintain an ordered set of rounds, with each round consisting of an ordered
444 * set of batches of requests.
446 * \param[in] policy the policy
447 * \param[in] nrq the request to add
449 * \retval 0 request successfully added
452 static int nrs_crrn_req_add(struct ptlrpc_nrs_policy *policy,
453 struct ptlrpc_nrs_request *nrq)
455 struct nrs_crrn_net *net;
456 struct nrs_crrn_client *cli;
459 cli = container_of(nrs_request_resource(nrq),
460 struct nrs_crrn_client, cc_res);
461 net = container_of(nrs_request_resource(nrq)->res_parent,
462 struct nrs_crrn_net, cn_res);
464 if (cli->cc_quantum == 0 || cli->cc_round < net->cn_round ||
465 (cli->cc_active == 0 && cli->cc_quantum > 0)) {
468 * If the client has no pending requests, and still some of its
469 * quantum remaining unused, which implies it has not had a
470 * chance to schedule up to its maximum allowed batch size of
471 * requests in the previous round it participated, schedule this
472 * next request on a new round; this avoids fragmentation of
473 * request batches caused by client inactivity, at the expense
474 * of potentially slightly increased service time for the
475 * request batch this request will be a part of.
477 if (cli->cc_active == 0 && cli->cc_quantum > 0)
480 /** A new scheduling round has commenced */
481 if (cli->cc_round < net->cn_round)
482 cli->cc_round = net->cn_round;
484 /** I was not the last client through here */
485 if (cli->cc_sequence < net->cn_sequence)
486 cli->cc_sequence = ++net->cn_sequence;
488 * Reset the quantum if we have reached the maximum quantum
489 * size for this batch, or even if we have not managed to
490 * complete a batch size up to its maximum allowed size.
491 * XXX: Accessed unlocked
493 cli->cc_quantum = net->cn_quantum;
496 nrq->nr_u.crr.cr_round = cli->cc_round;
497 nrq->nr_u.crr.cr_sequence = cli->cc_sequence;
499 rc = binheap_insert(net->cn_binheap, &nrq->nr_node);
502 if (--cli->cc_quantum == 0)
509 * Removes request \a nrq from a CRR-N \a policy instance's set of queued
512 * \param[in] policy the policy
513 * \param[in] nrq the request to remove
515 static void nrs_crrn_req_del(struct ptlrpc_nrs_policy *policy,
516 struct ptlrpc_nrs_request *nrq)
518 struct nrs_crrn_net *net;
519 struct nrs_crrn_client *cli;
522 cli = container_of(nrs_request_resource(nrq),
523 struct nrs_crrn_client, cc_res);
524 net = container_of(nrs_request_resource(nrq)->res_parent,
525 struct nrs_crrn_net, cn_res);
527 LASSERT(nrq->nr_u.crr.cr_round <= cli->cc_round);
529 is_root = &nrq->nr_node == binheap_root(net->cn_binheap);
531 binheap_remove(net->cn_binheap, &nrq->nr_node);
535 * If we just deleted the node at the root of the binheap, we may have
536 * to adjust round numbers.
538 if (unlikely(is_root)) {
539 /** Peek at the next request to be served */
540 struct binheap_node *node = binheap_root(net->cn_binheap);
542 /** No more requests */
543 if (unlikely(node == NULL)) {
546 nrq = container_of(node, struct ptlrpc_nrs_request,
549 if (net->cn_round < nrq->nr_u.crr.cr_round)
550 net->cn_round = nrq->nr_u.crr.cr_round;
556 * Called right after the request \a nrq finishes being handled by CRR-N policy
557 * instance \a policy.
559 * \param[in] policy the policy that handled the request
560 * \param[in] nrq the request that was handled
562 static void nrs_crrn_req_stop(struct ptlrpc_nrs_policy *policy,
563 struct ptlrpc_nrs_request *nrq)
565 struct ptlrpc_request *req = container_of(nrq, struct ptlrpc_request,
569 "NRS: finished handling %s request from %s, with round %llu"
570 "\n", NRS_POL_NAME_CRRN,
571 libcfs_idstr(&req->rq_peer), nrq->nr_u.crr.cr_round);
579 * Retrieves the value of the Round Robin quantum (i.e. the maximum batch size)
580 * for CRR-N policy instances on both the regular and high-priority NRS head
581 * of a service, as long as a policy instance is not in the
582 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state; policy instances in this
583 * state are skipped later by nrs_crrn_ctl().
585 * Quantum values are in # of RPCs, and output is in YAML format.
593 ptlrpc_lprocfs_nrs_crrn_quantum_seq_show(struct seq_file *m, void *data)
595 struct ptlrpc_service *svc = m->private;
600 * Perform two separate calls to this as only one of the NRS heads'
601 * policies may be in the ptlrpc_nrs_pol_state::NRS_POL_STATE_STARTED or
602 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPING state.
604 rc = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_REG,
606 NRS_CTL_CRRN_RD_QUANTUM,
609 seq_printf(m, NRS_LPROCFS_QUANTUM_NAME_REG
612 * Ignore -ENODEV as the regular NRS head's policy may be in the
613 * ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state.
615 } else if (rc != -ENODEV) {
619 if (!nrs_svc_has_hp(svc))
622 rc = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_HP,
624 NRS_CTL_CRRN_RD_QUANTUM,
627 seq_printf(m, NRS_LPROCFS_QUANTUM_NAME_HP"%-5d\n", quantum);
629 * Ignore -ENODEV as the high priority NRS head's policy may be
630 * in the ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state.
632 } else if (rc != -ENODEV) {
641 * Sets the value of the Round Robin quantum (i.e. the maximum batch size)
642 * for CRR-N policy instances of a service. The user can set the quantum size
643 * for the regular or high priority NRS head individually by specifying each
644 * value, or both together in a single invocation.
648 * lctl set_param *.*.*.nrs_crrn_quantum=reg_quantum:32, to set the regular
649 * request quantum size on all PTLRPC services to 32
651 * lctl set_param *.*.*.nrs_crrn_quantum=hp_quantum:16, to set the high
652 * priority request quantum size on all PTLRPC services to 16, and
654 * lctl set_param *.*.ost_io.nrs_crrn_quantum=16, to set both the regular and
655 * high priority request quantum sizes of the ost_io service to 16.
657 * policy instances in the ptlrpc_nrs_pol_state::NRS_POL_STATE_STOPPED state
658 * are skipped later by nrs_crrn_ctl().
661 ptlrpc_lprocfs_nrs_crrn_quantum_seq_write(struct file *file,
662 const char __user *buffer,
666 struct seq_file *m = file->private_data;
667 struct ptlrpc_service *svc = m->private;
668 enum ptlrpc_nrs_queue_type queue = 0;
669 char kernbuf[LPROCFS_NRS_WR_QUANTUM_MAX_CMD];
673 /** lprocfs_find_named_value() modifies its argument, so keep a copy */
678 if (count > (sizeof(kernbuf) - 1))
681 if (copy_from_user(kernbuf, buffer, count))
684 kernbuf[count] = '\0';
689 * Check if the regular quantum value has been specified
691 val = lprocfs_find_named_value(kernbuf, NRS_LPROCFS_QUANTUM_NAME_REG,
693 if (val != kernbuf) {
694 rc = kstrtol(val, 10, &quantum_reg);
698 queue |= PTLRPC_NRS_QUEUE_REG;
704 * Check if the high priority quantum value has been specified
706 val = lprocfs_find_named_value(kernbuf, NRS_LPROCFS_QUANTUM_NAME_HP,
708 if (val != kernbuf) {
709 if (!nrs_svc_has_hp(svc))
712 rc = kstrtol(val, 10, &quantum_hp);
716 queue |= PTLRPC_NRS_QUEUE_HP;
720 * If none of the queues has been specified, look for a valid numerical
724 rc = kstrtol(kernbuf, 10, &quantum_reg);
728 queue = PTLRPC_NRS_QUEUE_REG;
730 if (nrs_svc_has_hp(svc)) {
731 queue |= PTLRPC_NRS_QUEUE_HP;
732 quantum_hp = quantum_reg;
736 if ((((queue & PTLRPC_NRS_QUEUE_REG) != 0) &&
737 ((quantum_reg > LPROCFS_NRS_QUANTUM_MAX || quantum_reg <= 0))) ||
738 (((queue & PTLRPC_NRS_QUEUE_HP) != 0) &&
739 ((quantum_hp > LPROCFS_NRS_QUANTUM_MAX || quantum_hp <= 0))))
743 * We change the values on regular and HP NRS heads separately, so that
744 * we do not exit early from ptlrpc_nrs_policy_control() with an error
745 * returned by nrs_policy_ctl_locked(), in cases where the user has not
746 * started the policy on either the regular or HP NRS head; i.e. we are
747 * ignoring -ENODEV within nrs_policy_ctl_locked(). -ENODEV is returned
748 * only if the operation fails with -ENODEV on all heads that have been
749 * specified by the command; if at least one operation succeeds,
750 * success is returned.
752 if ((queue & PTLRPC_NRS_QUEUE_REG) != 0) {
753 rc = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_REG,
755 NRS_CTL_CRRN_WR_QUANTUM, false,
757 if ((rc < 0 && rc != -ENODEV) ||
758 (rc == -ENODEV && queue == PTLRPC_NRS_QUEUE_REG))
762 if ((queue & PTLRPC_NRS_QUEUE_HP) != 0) {
763 rc2 = ptlrpc_nrs_policy_control(svc, PTLRPC_NRS_QUEUE_HP,
765 NRS_CTL_CRRN_WR_QUANTUM, false,
767 if ((rc2 < 0 && rc2 != -ENODEV) ||
768 (rc2 == -ENODEV && queue == PTLRPC_NRS_QUEUE_HP))
772 return rc == -ENODEV && rc2 == -ENODEV ? -ENODEV : count;
775 LDEBUGFS_SEQ_FOPS(ptlrpc_lprocfs_nrs_crrn_quantum);
778 * Initializes a CRR-N policy's lprocfs interface for service \a svc
780 * \param[in] svc the service
785 static int nrs_crrn_lprocfs_init(struct ptlrpc_service *svc)
787 struct ldebugfs_vars nrs_crrn_lprocfs_vars[] = {
788 { .name = "nrs_crrn_quantum",
789 .fops = &ptlrpc_lprocfs_nrs_crrn_quantum_fops,
794 if (!svc->srv_debugfs_entry)
797 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 */