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/ldlm/ldlm_pool.c
38 * Author: Yury Umanets <umka@clusterfs.com>
42 * Idea of this code is rather simple. Each second, for each server namespace
43 * we have SLV - server lock volume which is calculated on current number of
44 * granted locks, grant speed for past period, etc - that is, locking load.
45 * This SLV number may be thought as a flow definition for simplicity. It is
46 * sent to clients with each occasion to let them know what is current load
47 * situation on the server. By default, at the beginning, SLV on server is
48 * set max value which is calculated as the following: allow to one client
49 * have all locks of limit ->pl_limit for 10h.
51 * Next, on clients, number of cached locks is not limited artificially in any
52 * way as it was before. Instead, client calculates CLV, that is, client lock
53 * volume for each lock and compares it with last SLV from the server. CLV is
54 * calculated as the number of locks in LRU * lock live time in seconds. If
55 * CLV > SLV - lock is canceled.
57 * Client has LVF, that is, lock volume factor which regulates how much sensitive
58 * client should be about last SLV from server. The higher LVF is the more locks
59 * will be canceled on client. Default value for it is 1. Setting LVF to 2 means
60 * that client will cancel locks 2 times faster.
62 * Locks on a client will be canceled more intensively in these cases:
63 * (1) if SLV is smaller, that is, load is higher on the server;
64 * (2) client has a lot of locks (the more locks are held by client, the bigger
65 * chances that some of them should be canceled);
66 * (3) client has old locks (taken some time ago);
68 * Thus, according to flow paradigm that we use for better understanding SLV,
69 * CLV is the volume of particle in flow described by SLV. According to this,
70 * if flow is getting thinner, more and more particles become outside of it and
71 * as particles are locks, they should be canceled.
73 * General idea of this belongs to Vitaly Fertman (vitaly@clusterfs.com). Andreas
74 * Dilger (adilger@clusterfs.com) proposed few nice ideas like using LVF and many
75 * cleanups. Flow definition to allow more easy understanding of the logic belongs
76 * to Nikita Danilov (nikita@clusterfs.com) as well as many cleanups and fixes.
77 * And design and implementation are done by Yury Umanets (umka@clusterfs.com).
79 * Glossary for terms used:
81 * pl_limit - Number of allowed locks in pool. Applies to server and client
84 * pl_granted - Number of granted locks (calculated);
85 * pl_grant_rate - Number of granted locks for last T (calculated);
86 * pl_cancel_rate - Number of canceled locks for last T (calculated);
87 * pl_grant_speed - Grant speed (GR - CR) for last T (calculated);
88 * pl_grant_plan - Planned number of granted locks for next T (calculated);
89 * pl_server_lock_volume - Current server lock volume (calculated);
91 * As it may be seen from list above, we have few possible tunables which may
92 * affect behavior much. They all may be modified via proc. However, they also
93 * give a possibility for constructing few pre-defined behavior policies. If
94 * none of predefines is suitable for a working pattern being used, new one may
95 * be "constructed" via proc tunables.
98 #define DEBUG_SUBSYSTEM S_LDLM
101 # include <lustre_dlm.h>
103 # include <liblustre.h>
106 #include <cl_object.h>
108 #include <obd_class.h>
109 #include <obd_support.h>
110 #include "ldlm_internal.h"
112 #ifdef HAVE_LRU_RESIZE_SUPPORT
115 * 50 ldlm locks for 1MB of RAM.
117 #define LDLM_POOL_HOST_L ((CFS_NUM_CACHEPAGES >> (20 - CFS_PAGE_SHIFT)) * 50)
120 * Maximal possible grant step plan in %.
122 #define LDLM_POOL_MAX_GSP (30)
125 * Minimal possible grant step plan in %.
127 #define LDLM_POOL_MIN_GSP (1)
130 * This controls the speed of reaching LDLM_POOL_MAX_GSP
131 * with increasing thread period.
133 #define LDLM_POOL_GSP_STEP (4)
136 * LDLM_POOL_GSP% of all locks is default GP.
138 #define LDLM_POOL_GP(L) (((L) * LDLM_POOL_MAX_GSP) / 100)
141 * Max age for locks on clients.
143 #define LDLM_POOL_MAX_AGE (36000)
146 extern cfs_proc_dir_entry_t *ldlm_ns_proc_dir;
149 #define avg(src, add) \
150 ((src) = ((src) + (add)) / 2)
152 static inline __u64 dru(__u64 val, __u32 div)
154 __u64 ret = val + (div - 1);
159 static inline __u64 ldlm_pool_slv_max(__u32 L)
162 * Allow to have all locks for 1 client for 10 hrs.
163 * Formula is the following: limit * 10h / 1 client.
165 __u64 lim = L * LDLM_POOL_MAX_AGE / 1;
169 static inline __u64 ldlm_pool_slv_min(__u32 L)
175 LDLM_POOL_FIRST_STAT = 0,
176 LDLM_POOL_GRANTED_STAT = LDLM_POOL_FIRST_STAT,
177 LDLM_POOL_GRANT_STAT,
178 LDLM_POOL_CANCEL_STAT,
179 LDLM_POOL_GRANT_RATE_STAT,
180 LDLM_POOL_CANCEL_RATE_STAT,
181 LDLM_POOL_GRANT_PLAN_STAT,
183 LDLM_POOL_SHRINK_REQTD_STAT,
184 LDLM_POOL_SHRINK_FREED_STAT,
185 LDLM_POOL_RECALC_STAT,
186 LDLM_POOL_TIMING_STAT,
190 static inline struct ldlm_namespace *ldlm_pl2ns(struct ldlm_pool *pl)
192 return container_of(pl, struct ldlm_namespace, ns_pool);
196 * Calculates suggested grant_step in % of available locks for passed
197 * \a period. This is later used in grant_plan calculations.
199 static inline int ldlm_pool_t2gsp(int t)
202 * This yeilds 1% grant step for anything below LDLM_POOL_GSP_STEP
203 * and up to 30% for anything higher than LDLM_POOL_GSP_STEP.
205 * How this will affect execution is the following:
207 * - for thread peroid 1s we will have grant_step 1% which good from
208 * pov of taking some load off from server and push it out to clients.
209 * This is like that because 1% for grant_step means that server will
210 * not allow clients to get lots of locks inshort period of time and
211 * keep all old locks in their caches. Clients will always have to
212 * get some locks back if they want to take some new;
214 * - for thread period 10s (which is default) we will have 23% which
215 * means that clients will have enough of room to take some new locks
216 * without getting some back. All locks from this 23% which were not
217 * taken by clients in current period will contribute in SLV growing.
218 * SLV growing means more locks cached on clients until limit or grant
221 return LDLM_POOL_MAX_GSP -
222 (LDLM_POOL_MAX_GSP - LDLM_POOL_MIN_GSP) /
223 (1 << (t / LDLM_POOL_GSP_STEP));
227 * Recalculates next grant limit on passed \a pl.
229 * \pre ->pl_lock is locked.
231 static inline void ldlm_pool_recalc_grant_plan(struct ldlm_pool *pl)
233 int granted, grant_step, limit;
235 limit = ldlm_pool_get_limit(pl);
236 granted = atomic_read(&pl->pl_granted);
238 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
239 grant_step = ((limit - granted) * grant_step) / 100;
240 pl->pl_grant_plan = granted + grant_step;
244 * Recalculates next SLV on passed \a pl.
246 * \pre ->pl_lock is locked.
248 static inline void ldlm_pool_recalc_slv(struct ldlm_pool *pl)
250 int grant_usage, granted, grant_plan;
251 __u64 slv, slv_factor;
254 slv = pl->pl_server_lock_volume;
255 grant_plan = pl->pl_grant_plan;
256 limit = ldlm_pool_get_limit(pl);
257 granted = atomic_read(&pl->pl_granted);
259 grant_usage = limit - (granted - grant_plan);
260 if (grant_usage <= 0)
264 * Find out SLV change factor which is the ratio of grant usage
265 * from limit. SLV changes as fast as the ratio of grant plan
266 * consumtion. The more locks from grant plan are not consumed
267 * by clients in last interval (idle time), the faster grows
268 * SLV. And the opposite, the more grant plan is over-consumed
269 * (load time) the faster drops SLV.
271 slv_factor = (grant_usage * 100) / limit;
272 if (2 * abs(granted - limit) > limit) {
273 slv_factor *= slv_factor;
274 slv_factor = dru(slv_factor, 100);
276 slv = slv * slv_factor;
279 if (slv > ldlm_pool_slv_max(limit)) {
280 slv = ldlm_pool_slv_max(limit);
281 } else if (slv < ldlm_pool_slv_min(limit)) {
282 slv = ldlm_pool_slv_min(limit);
285 pl->pl_server_lock_volume = slv;
289 * Recalculates next stats on passed \a pl.
291 * \pre ->pl_lock is locked.
293 static inline void ldlm_pool_recalc_stats(struct ldlm_pool *pl)
295 int grant_plan = pl->pl_grant_plan;
296 __u64 slv = pl->pl_server_lock_volume;
297 int granted = atomic_read(&pl->pl_granted);
298 int grant_rate = atomic_read(&pl->pl_grant_rate);
299 int cancel_rate = atomic_read(&pl->pl_cancel_rate);
301 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_SLV_STAT,
303 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
305 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
307 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
309 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
314 * Sets current SLV into obd accessible via ldlm_pl2ns(pl)->ns_obd.
316 static void ldlm_srv_pool_push_slv(struct ldlm_pool *pl)
318 struct obd_device *obd;
321 * Set new SLV in obd field for using it later without accessing the
322 * pool. This is required to avoid race between sending reply to client
323 * with new SLV and cleanup server stack in which we can't guarantee
324 * that namespace is still alive. We know only that obd is alive as
325 * long as valid export is alive.
327 obd = ldlm_pl2ns(pl)->ns_obd;
328 LASSERT(obd != NULL);
329 write_lock(&obd->obd_pool_lock);
330 obd->obd_pool_slv = pl->pl_server_lock_volume;
331 write_unlock(&obd->obd_pool_lock);
335 * Recalculates all pool fields on passed \a pl.
337 * \pre ->pl_lock is not locked.
339 static int ldlm_srv_pool_recalc(struct ldlm_pool *pl)
341 time_t recalc_interval_sec;
344 spin_lock(&pl->pl_lock);
345 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
346 if (recalc_interval_sec >= pl->pl_recalc_period) {
348 * Recalc SLV after last period. This should be done
349 * _before_ recalculating new grant plan.
351 ldlm_pool_recalc_slv(pl);
354 * Make sure that pool informed obd of last SLV changes.
356 ldlm_srv_pool_push_slv(pl);
359 * Update grant_plan for new period.
361 ldlm_pool_recalc_grant_plan(pl);
363 pl->pl_recalc_time = cfs_time_current_sec();
364 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
365 recalc_interval_sec);
368 spin_unlock(&pl->pl_lock);
373 * This function is used on server side as main entry point for memory
374 * preasure handling. It decreases SLV on \a pl according to passed
375 * \a nr and \a gfp_mask.
377 * Our goal here is to decrease SLV such a way that clients hold \a nr
378 * locks smaller in next 10h.
380 static int ldlm_srv_pool_shrink(struct ldlm_pool *pl,
381 int nr, unsigned int gfp_mask)
386 * VM is asking how many entries may be potentially freed.
389 return atomic_read(&pl->pl_granted);
392 * Client already canceled locks but server is already in shrinker
393 * and can't cancel anything. Let's catch this race.
395 if (atomic_read(&pl->pl_granted) == 0)
398 spin_lock(&pl->pl_lock);
401 * We want shrinker to possibly cause cancelation of @nr locks from
402 * clients or grant approximately @nr locks smaller next intervals.
404 * This is why we decresed SLV by @nr. This effect will only be as
405 * long as one re-calc interval (1s these days) and this should be
406 * enough to pass this decreased SLV to all clients. On next recalc
407 * interval pool will either increase SLV if locks load is not high
408 * or will keep on same level or even decrease again, thus, shrinker
409 * decreased SLV will affect next recalc intervals and this way will
410 * make locking load lower.
412 if (nr < pl->pl_server_lock_volume) {
413 pl->pl_server_lock_volume = pl->pl_server_lock_volume - nr;
415 limit = ldlm_pool_get_limit(pl);
416 pl->pl_server_lock_volume = ldlm_pool_slv_min(limit);
420 * Make sure that pool informed obd of last SLV changes.
422 ldlm_srv_pool_push_slv(pl);
423 spin_unlock(&pl->pl_lock);
426 * We did not really free any memory here so far, it only will be
427 * freed later may be, so that we return 0 to not confuse VM.
433 * Setup server side pool \a pl with passed \a limit.
435 static int ldlm_srv_pool_setup(struct ldlm_pool *pl, int limit)
437 struct obd_device *obd;
440 obd = ldlm_pl2ns(pl)->ns_obd;
441 LASSERT(obd != NULL && obd != LP_POISON);
442 LASSERT(obd->obd_type != LP_POISON);
443 write_lock(&obd->obd_pool_lock);
444 obd->obd_pool_limit = limit;
445 write_unlock(&obd->obd_pool_lock);
447 ldlm_pool_set_limit(pl, limit);
452 * Sets SLV and Limit from ldlm_pl2ns(pl)->ns_obd tp passed \a pl.
454 static void ldlm_cli_pool_pop_slv(struct ldlm_pool *pl)
456 struct obd_device *obd;
459 * Get new SLV and Limit from obd which is updated with comming
462 obd = ldlm_pl2ns(pl)->ns_obd;
463 LASSERT(obd != NULL);
464 read_lock(&obd->obd_pool_lock);
465 pl->pl_server_lock_volume = obd->obd_pool_slv;
466 ldlm_pool_set_limit(pl, obd->obd_pool_limit);
467 read_unlock(&obd->obd_pool_lock);
471 * Recalculates client sise pool \a pl according to current SLV and Limit.
473 static int ldlm_cli_pool_recalc(struct ldlm_pool *pl)
475 time_t recalc_interval_sec;
478 spin_lock(&pl->pl_lock);
480 * Check if we need to recalc lists now.
482 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
483 if (recalc_interval_sec < pl->pl_recalc_period) {
484 spin_unlock(&pl->pl_lock);
489 * Make sure that pool knows last SLV and Limit from obd.
491 ldlm_cli_pool_pop_slv(pl);
493 pl->pl_recalc_time = cfs_time_current_sec();
494 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
495 recalc_interval_sec);
496 spin_unlock(&pl->pl_lock);
499 * Do not cancel locks in case lru resize is disabled for this ns.
501 if (!ns_connect_lru_resize(ldlm_pl2ns(pl)))
505 * In the time of canceling locks on client we do not need to maintain
506 * sharp timing, we only want to cancel locks asap according to new SLV.
507 * It may be called when SLV has changed much, this is why we do not
508 * take into account pl->pl_recalc_time here.
510 RETURN(ldlm_cancel_lru(ldlm_pl2ns(pl), 0, LDLM_SYNC,
515 * This function is main entry point for memory preasure handling on client side.
516 * Main goal of this function is to cancel some number of locks on passed \a pl
517 * according to \a nr and \a gfp_mask.
519 static int ldlm_cli_pool_shrink(struct ldlm_pool *pl,
520 int nr, unsigned int gfp_mask)
522 struct ldlm_namespace *ns;
523 int canceled = 0, unused;
528 * Do not cancel locks in case lru resize is disabled for this ns.
530 if (!ns_connect_lru_resize(ns))
534 * Make sure that pool knows last SLV and Limit from obd.
536 ldlm_cli_pool_pop_slv(pl);
538 spin_lock(&ns->ns_unused_lock);
539 unused = ns->ns_nr_unused;
540 spin_unlock(&ns->ns_unused_lock);
543 canceled = ldlm_cancel_lru(ns, nr, LDLM_SYNC,
548 * Retrun the number of potentially reclaimable locks.
550 return ((unused - canceled) / 100) * sysctl_vfs_cache_pressure;
552 return unused - canceled;
556 struct ldlm_pool_ops ldlm_srv_pool_ops = {
557 .po_recalc = ldlm_srv_pool_recalc,
558 .po_shrink = ldlm_srv_pool_shrink,
559 .po_setup = ldlm_srv_pool_setup
562 struct ldlm_pool_ops ldlm_cli_pool_ops = {
563 .po_recalc = ldlm_cli_pool_recalc,
564 .po_shrink = ldlm_cli_pool_shrink
568 * Pool recalc wrapper. Will call either client or server pool recalc callback
569 * depending what pool \a pl is used.
571 int ldlm_pool_recalc(struct ldlm_pool *pl)
573 time_t recalc_interval_sec;
576 spin_lock(&pl->pl_lock);
577 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
578 if (recalc_interval_sec > 0) {
580 * Update pool statistics every 1s.
582 ldlm_pool_recalc_stats(pl);
585 * Zero out all rates and speed for the last period.
587 atomic_set(&pl->pl_grant_rate, 0);
588 atomic_set(&pl->pl_cancel_rate, 0);
589 atomic_set(&pl->pl_grant_speed, 0);
591 spin_unlock(&pl->pl_lock);
593 if (pl->pl_ops->po_recalc != NULL) {
594 count = pl->pl_ops->po_recalc(pl);
595 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_RECALC_STAT,
602 EXPORT_SYMBOL(ldlm_pool_recalc);
605 * Pool shrink wrapper. Will call either client or server pool recalc callback
606 * depending what pool \a pl is used.
608 int ldlm_pool_shrink(struct ldlm_pool *pl, int nr,
609 unsigned int gfp_mask)
613 if (pl->pl_ops->po_shrink != NULL) {
614 cancel = pl->pl_ops->po_shrink(pl, nr, gfp_mask);
616 lprocfs_counter_add(pl->pl_stats,
617 LDLM_POOL_SHRINK_REQTD_STAT,
619 lprocfs_counter_add(pl->pl_stats,
620 LDLM_POOL_SHRINK_FREED_STAT,
622 CDEBUG(D_DLMTRACE, "%s: request to shrink %d locks, "
623 "shrunk %d\n", pl->pl_name, nr, cancel);
628 EXPORT_SYMBOL(ldlm_pool_shrink);
631 * Pool setup wrapper. Will call either client or server pool recalc callback
632 * depending what pool \a pl is used.
634 * Sets passed \a limit into pool \a pl.
636 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
639 if (pl->pl_ops->po_setup != NULL)
640 RETURN(pl->pl_ops->po_setup(pl, limit));
643 EXPORT_SYMBOL(ldlm_pool_setup);
646 static int lprocfs_rd_pool_state(char *page, char **start, off_t off,
647 int count, int *eof, void *data)
649 int granted, grant_rate, cancel_rate, grant_step;
650 int nr = 0, grant_speed, grant_plan, lvf;
651 struct ldlm_pool *pl = data;
655 spin_lock(&pl->pl_lock);
656 slv = pl->pl_server_lock_volume;
657 clv = pl->pl_client_lock_volume;
658 limit = ldlm_pool_get_limit(pl);
659 grant_plan = pl->pl_grant_plan;
660 granted = atomic_read(&pl->pl_granted);
661 grant_rate = atomic_read(&pl->pl_grant_rate);
662 lvf = atomic_read(&pl->pl_lock_volume_factor);
663 grant_speed = atomic_read(&pl->pl_grant_speed);
664 cancel_rate = atomic_read(&pl->pl_cancel_rate);
665 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
666 spin_unlock(&pl->pl_lock);
668 nr += snprintf(page + nr, count - nr, "LDLM pool state (%s):\n",
670 nr += snprintf(page + nr, count - nr, " SLV: "LPU64"\n", slv);
671 nr += snprintf(page + nr, count - nr, " CLV: "LPU64"\n", clv);
672 nr += snprintf(page + nr, count - nr, " LVF: %d\n", lvf);
674 if (ns_is_server(ldlm_pl2ns(pl))) {
675 nr += snprintf(page + nr, count - nr, " GSP: %d%%\n",
677 nr += snprintf(page + nr, count - nr, " GP: %d\n",
680 nr += snprintf(page + nr, count - nr, " GR: %d\n",
682 nr += snprintf(page + nr, count - nr, " CR: %d\n",
684 nr += snprintf(page + nr, count - nr, " GS: %d\n",
686 nr += snprintf(page + nr, count - nr, " G: %d\n",
688 nr += snprintf(page + nr, count - nr, " L: %d\n",
693 LDLM_POOL_PROC_READER(grant_plan, int);
694 LDLM_POOL_PROC_READER(recalc_period, int);
695 LDLM_POOL_PROC_WRITER(recalc_period, int);
697 static int ldlm_pool_proc_init(struct ldlm_pool *pl)
699 struct ldlm_namespace *ns = ldlm_pl2ns(pl);
700 struct proc_dir_entry *parent_ns_proc;
701 struct lprocfs_vars pool_vars[2];
702 char *var_name = NULL;
706 OBD_ALLOC(var_name, MAX_STRING_SIZE + 1);
710 parent_ns_proc = lprocfs_srch(ldlm_ns_proc_dir, ns->ns_name);
711 if (parent_ns_proc == NULL) {
712 CERROR("%s: proc entry is not initialized\n",
714 GOTO(out_free_name, rc = -EINVAL);
716 pl->pl_proc_dir = lprocfs_register("pool", parent_ns_proc,
718 if (IS_ERR(pl->pl_proc_dir)) {
719 CERROR("LProcFS failed in ldlm-pool-init\n");
720 rc = PTR_ERR(pl->pl_proc_dir);
721 GOTO(out_free_name, rc);
724 var_name[MAX_STRING_SIZE] = '\0';
725 memset(pool_vars, 0, sizeof(pool_vars));
726 pool_vars[0].name = var_name;
728 snprintf(var_name, MAX_STRING_SIZE, "server_lock_volume");
729 pool_vars[0].data = &pl->pl_server_lock_volume;
730 pool_vars[0].read_fptr = lprocfs_rd_u64;
731 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
733 snprintf(var_name, MAX_STRING_SIZE, "limit");
734 pool_vars[0].data = &pl->pl_limit;
735 pool_vars[0].read_fptr = lprocfs_rd_atomic;
736 pool_vars[0].write_fptr = lprocfs_wr_atomic;
737 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
739 snprintf(var_name, MAX_STRING_SIZE, "granted");
740 pool_vars[0].data = &pl->pl_granted;
741 pool_vars[0].read_fptr = lprocfs_rd_atomic;
742 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
744 snprintf(var_name, MAX_STRING_SIZE, "grant_speed");
745 pool_vars[0].data = &pl->pl_grant_speed;
746 pool_vars[0].read_fptr = lprocfs_rd_atomic;
747 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
749 snprintf(var_name, MAX_STRING_SIZE, "cancel_rate");
750 pool_vars[0].data = &pl->pl_cancel_rate;
751 pool_vars[0].read_fptr = lprocfs_rd_atomic;
752 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
754 snprintf(var_name, MAX_STRING_SIZE, "grant_rate");
755 pool_vars[0].data = &pl->pl_grant_rate;
756 pool_vars[0].read_fptr = lprocfs_rd_atomic;
757 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
759 snprintf(var_name, MAX_STRING_SIZE, "grant_plan");
760 pool_vars[0].data = pl;
761 pool_vars[0].read_fptr = lprocfs_rd_grant_plan;
762 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
764 snprintf(var_name, MAX_STRING_SIZE, "recalc_period");
765 pool_vars[0].data = pl;
766 pool_vars[0].read_fptr = lprocfs_rd_recalc_period;
767 pool_vars[0].write_fptr = lprocfs_wr_recalc_period;
768 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
770 snprintf(var_name, MAX_STRING_SIZE, "lock_volume_factor");
771 pool_vars[0].data = &pl->pl_lock_volume_factor;
772 pool_vars[0].read_fptr = lprocfs_rd_atomic;
773 pool_vars[0].write_fptr = lprocfs_wr_atomic;
774 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
776 snprintf(var_name, MAX_STRING_SIZE, "state");
777 pool_vars[0].data = pl;
778 pool_vars[0].read_fptr = lprocfs_rd_pool_state;
779 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
781 pl->pl_stats = lprocfs_alloc_stats(LDLM_POOL_LAST_STAT -
782 LDLM_POOL_FIRST_STAT, 0);
784 GOTO(out_free_name, rc = -ENOMEM);
786 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
787 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
789 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_STAT,
790 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
792 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_STAT,
793 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
795 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
796 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
797 "grant_rate", "locks/s");
798 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
799 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
800 "cancel_rate", "locks/s");
801 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
802 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
803 "grant_plan", "locks/s");
804 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SLV_STAT,
805 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
807 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_REQTD_STAT,
808 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
809 "shrink_request", "locks");
810 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_FREED_STAT,
811 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
812 "shrink_freed", "locks");
813 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_RECALC_STAT,
814 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
815 "recalc_freed", "locks");
816 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_TIMING_STAT,
817 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
818 "recalc_timing", "sec");
819 lprocfs_register_stats(pl->pl_proc_dir, "stats", pl->pl_stats);
823 OBD_FREE(var_name, MAX_STRING_SIZE + 1);
827 static void ldlm_pool_proc_fini(struct ldlm_pool *pl)
829 if (pl->pl_stats != NULL) {
830 lprocfs_free_stats(&pl->pl_stats);
833 if (pl->pl_proc_dir != NULL) {
834 lprocfs_remove(&pl->pl_proc_dir);
835 pl->pl_proc_dir = NULL;
838 #else /* !__KERNEL__*/
839 #define ldlm_pool_proc_init(pl) (0)
840 #define ldlm_pool_proc_fini(pl) while (0) {}
843 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
844 int idx, ldlm_side_t client)
849 spin_lock_init(&pl->pl_lock);
850 atomic_set(&pl->pl_granted, 0);
851 pl->pl_recalc_time = cfs_time_current_sec();
852 atomic_set(&pl->pl_lock_volume_factor, 1);
854 atomic_set(&pl->pl_grant_rate, 0);
855 atomic_set(&pl->pl_cancel_rate, 0);
856 atomic_set(&pl->pl_grant_speed, 0);
857 pl->pl_grant_plan = LDLM_POOL_GP(LDLM_POOL_HOST_L);
859 snprintf(pl->pl_name, sizeof(pl->pl_name), "ldlm-pool-%s-%d",
862 if (client == LDLM_NAMESPACE_SERVER) {
863 pl->pl_ops = &ldlm_srv_pool_ops;
864 ldlm_pool_set_limit(pl, LDLM_POOL_HOST_L);
865 pl->pl_recalc_period = LDLM_POOL_SRV_DEF_RECALC_PERIOD;
866 pl->pl_server_lock_volume = ldlm_pool_slv_max(LDLM_POOL_HOST_L);
868 ldlm_pool_set_limit(pl, 1);
869 pl->pl_server_lock_volume = 1;
870 pl->pl_ops = &ldlm_cli_pool_ops;
871 pl->pl_recalc_period = LDLM_POOL_CLI_DEF_RECALC_PERIOD;
873 pl->pl_client_lock_volume = 0;
874 rc = ldlm_pool_proc_init(pl);
878 CDEBUG(D_DLMTRACE, "Lock pool %s is initialized\n", pl->pl_name);
882 EXPORT_SYMBOL(ldlm_pool_init);
884 void ldlm_pool_fini(struct ldlm_pool *pl)
887 ldlm_pool_proc_fini(pl);
890 * Pool should not be used after this point. We can't free it here as
891 * it lives in struct ldlm_namespace, but still interested in catching
892 * any abnormal using cases.
894 POISON(pl, 0x5a, sizeof(*pl));
897 EXPORT_SYMBOL(ldlm_pool_fini);
900 * Add new taken ldlm lock \a lock into pool \a pl accounting.
902 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
905 * FLOCK locks are special in a sense that they are almost never
906 * cancelled, instead special kind of lock is used to drop them.
907 * also there is no LRU for flock locks, so no point in tracking
910 if (lock->l_resource->lr_type == LDLM_FLOCK)
914 LDLM_DEBUG(lock, "add lock to pool");
915 atomic_inc(&pl->pl_granted);
916 atomic_inc(&pl->pl_grant_rate);
917 atomic_inc(&pl->pl_grant_speed);
919 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_GRANT_STAT);
921 * Do not do pool recalc for client side as all locks which
922 * potentially may be canceled has already been packed into
923 * enqueue/cancel rpc. Also we do not want to run out of stack
924 * with too long call paths.
926 if (ns_is_server(ldlm_pl2ns(pl)))
927 ldlm_pool_recalc(pl);
930 EXPORT_SYMBOL(ldlm_pool_add);
933 * Remove ldlm lock \a lock from pool \a pl accounting.
935 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
938 * Filter out FLOCK locks. Read above comment in ldlm_pool_add().
940 if (lock->l_resource->lr_type == LDLM_FLOCK)
944 LDLM_DEBUG(lock, "del lock from pool");
945 LASSERT(atomic_read(&pl->pl_granted) > 0);
946 atomic_dec(&pl->pl_granted);
947 atomic_inc(&pl->pl_cancel_rate);
948 atomic_dec(&pl->pl_grant_speed);
950 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_CANCEL_STAT);
952 if (ns_is_server(ldlm_pl2ns(pl)))
953 ldlm_pool_recalc(pl);
956 EXPORT_SYMBOL(ldlm_pool_del);
959 * Returns current \a pl SLV.
961 * \pre ->pl_lock is not locked.
963 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
966 spin_lock(&pl->pl_lock);
967 slv = pl->pl_server_lock_volume;
968 spin_unlock(&pl->pl_lock);
971 EXPORT_SYMBOL(ldlm_pool_get_slv);
974 * Sets passed \a slv to \a pl.
976 * \pre ->pl_lock is not locked.
978 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
980 spin_lock(&pl->pl_lock);
981 pl->pl_server_lock_volume = slv;
982 spin_unlock(&pl->pl_lock);
984 EXPORT_SYMBOL(ldlm_pool_set_slv);
987 * Returns current \a pl CLV.
989 * \pre ->pl_lock is not locked.
991 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
994 spin_lock(&pl->pl_lock);
995 slv = pl->pl_client_lock_volume;
996 spin_unlock(&pl->pl_lock);
999 EXPORT_SYMBOL(ldlm_pool_get_clv);
1002 * Sets passed \a clv to \a pl.
1004 * \pre ->pl_lock is not locked.
1006 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1008 spin_lock(&pl->pl_lock);
1009 pl->pl_client_lock_volume = clv;
1010 spin_unlock(&pl->pl_lock);
1012 EXPORT_SYMBOL(ldlm_pool_set_clv);
1015 * Returns current \a pl limit.
1017 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1019 return atomic_read(&pl->pl_limit);
1021 EXPORT_SYMBOL(ldlm_pool_get_limit);
1024 * Sets passed \a limit to \a pl.
1026 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1028 atomic_set(&pl->pl_limit, limit);
1030 EXPORT_SYMBOL(ldlm_pool_set_limit);
1033 * Returns current LVF from \a pl.
1035 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1037 return atomic_read(&pl->pl_lock_volume_factor);
1039 EXPORT_SYMBOL(ldlm_pool_get_lvf);
1042 static int ldlm_pool_granted(struct ldlm_pool *pl)
1044 return atomic_read(&pl->pl_granted);
1047 static struct ptlrpc_thread *ldlm_pools_thread;
1048 static struct shrinker *ldlm_pools_srv_shrinker;
1049 static struct shrinker *ldlm_pools_cli_shrinker;
1050 static struct completion ldlm_pools_comp;
1053 * Cancel \a nr locks from all namespaces (if possible). Returns number of
1054 * cached locks after shrink is finished. All namespaces are asked to
1055 * cancel approximately equal amount of locks to keep balancing.
1057 static int ldlm_pools_shrink(ldlm_side_t client, int nr,
1058 unsigned int gfp_mask)
1060 int total = 0, cached = 0, nr_ns;
1061 struct ldlm_namespace *ns;
1064 if (nr != 0 && !(gfp_mask & __GFP_FS))
1067 CDEBUG(D_DLMTRACE, "Request to shrink %d %s locks from all pools\n",
1068 nr, client == LDLM_NAMESPACE_CLIENT ? "client" : "server");
1070 cookie = cl_env_reenter();
1073 * Find out how many resources we may release.
1075 for (nr_ns = atomic_read(ldlm_namespace_nr(client));
1078 mutex_down(ldlm_namespace_lock(client));
1079 if (list_empty(ldlm_namespace_list(client))) {
1080 mutex_up(ldlm_namespace_lock(client));
1081 cl_env_reexit(cookie);
1084 ns = ldlm_namespace_first_locked(client);
1085 ldlm_namespace_get(ns);
1086 ldlm_namespace_move_locked(ns, client);
1087 mutex_up(ldlm_namespace_lock(client));
1088 total += ldlm_pool_shrink(&ns->ns_pool, 0, gfp_mask);
1089 ldlm_namespace_put(ns, 1);
1092 if (nr == 0 || total == 0) {
1093 cl_env_reexit(cookie);
1098 * Shrink at least ldlm_namespace_nr(client) namespaces.
1100 for (nr_ns = atomic_read(ldlm_namespace_nr(client));
1103 int cancel, nr_locks;
1106 * Do not call shrink under ldlm_namespace_lock(client)
1108 mutex_down(ldlm_namespace_lock(client));
1109 if (list_empty(ldlm_namespace_list(client))) {
1110 mutex_up(ldlm_namespace_lock(client));
1112 * If list is empty, we can't return any @cached > 0,
1113 * that probably would cause needless shrinker
1119 ns = ldlm_namespace_first_locked(client);
1120 ldlm_namespace_get(ns);
1121 ldlm_namespace_move_locked(ns, client);
1122 mutex_up(ldlm_namespace_lock(client));
1124 nr_locks = ldlm_pool_granted(&ns->ns_pool);
1125 cancel = 1 + nr_locks * nr / total;
1126 ldlm_pool_shrink(&ns->ns_pool, cancel, gfp_mask);
1127 cached += ldlm_pool_granted(&ns->ns_pool);
1128 ldlm_namespace_put(ns, 1);
1130 cl_env_reexit(cookie);
1134 static int ldlm_pools_srv_shrink(int nr, unsigned int gfp_mask)
1136 return ldlm_pools_shrink(LDLM_NAMESPACE_SERVER, nr, gfp_mask);
1139 static int ldlm_pools_cli_shrink(int nr, unsigned int gfp_mask)
1141 return ldlm_pools_shrink(LDLM_NAMESPACE_CLIENT, nr, gfp_mask);
1144 void ldlm_pools_recalc(ldlm_side_t client)
1146 __u32 nr_l = 0, nr_p = 0, l;
1147 struct ldlm_namespace *ns;
1151 * No need to setup pool limit for client pools.
1153 if (client == LDLM_NAMESPACE_SERVER) {
1155 * Check all modest namespaces first.
1157 mutex_down(ldlm_namespace_lock(client));
1158 list_for_each_entry(ns, ldlm_namespace_list(client),
1161 if (ns->ns_appetite != LDLM_NAMESPACE_MODEST)
1164 l = ldlm_pool_granted(&ns->ns_pool);
1169 * Set the modest pools limit equal to their avg granted
1172 l += dru(l * LDLM_POOLS_MODEST_MARGIN, 100);
1173 ldlm_pool_setup(&ns->ns_pool, l);
1179 * Make sure that modest namespaces did not eat more that 2/3
1182 if (nr_l >= 2 * (LDLM_POOL_HOST_L / 3)) {
1183 CWARN("\"Modest\" pools eat out 2/3 of server locks "
1184 "limit (%d of %lu). This means that you have too "
1185 "many clients for this amount of server RAM. "
1186 "Upgrade server!\n", nr_l, LDLM_POOL_HOST_L);
1191 * The rest is given to greedy namespaces.
1193 list_for_each_entry(ns, ldlm_namespace_list(client),
1196 if (!equal && ns->ns_appetite != LDLM_NAMESPACE_GREEDY)
1201 * In the case 2/3 locks are eaten out by
1202 * modest pools, we re-setup equal limit
1205 l = LDLM_POOL_HOST_L /
1206 atomic_read(ldlm_namespace_nr(client));
1209 * All the rest of greedy pools will have
1210 * all locks in equal parts.
1212 l = (LDLM_POOL_HOST_L - nr_l) /
1213 (atomic_read(ldlm_namespace_nr(client)) -
1216 ldlm_pool_setup(&ns->ns_pool, l);
1218 mutex_up(ldlm_namespace_lock(client));
1222 * Recalc at least ldlm_namespace_nr(client) namespaces.
1224 for (nr = atomic_read(ldlm_namespace_nr(client)); nr > 0; nr--) {
1227 * Lock the list, get first @ns in the list, getref, move it
1228 * to the tail, unlock and call pool recalc. This way we avoid
1229 * calling recalc under @ns lock what is really good as we get
1230 * rid of potential deadlock on client nodes when canceling
1231 * locks synchronously.
1233 mutex_down(ldlm_namespace_lock(client));
1234 if (list_empty(ldlm_namespace_list(client))) {
1235 mutex_up(ldlm_namespace_lock(client));
1238 ns = ldlm_namespace_first_locked(client);
1240 spin_lock(&ns->ns_hash_lock);
1242 * skip ns which is being freed, and we don't want to increase
1243 * its refcount again, not even temporarily. bz21519.
1245 if (ns->ns_refcount == 0) {
1249 ldlm_namespace_get_locked(ns);
1251 spin_unlock(&ns->ns_hash_lock);
1253 ldlm_namespace_move_locked(ns, client);
1254 mutex_up(ldlm_namespace_lock(client));
1257 * After setup is done - recalc the pool.
1260 ldlm_pool_recalc(&ns->ns_pool);
1261 ldlm_namespace_put(ns, 1);
1265 EXPORT_SYMBOL(ldlm_pools_recalc);
1267 static int ldlm_pools_thread_main(void *arg)
1269 struct ptlrpc_thread *thread = (struct ptlrpc_thread *)arg;
1270 char *t_name = "ldlm_poold";
1273 cfs_daemonize(t_name);
1274 thread->t_flags = SVC_RUNNING;
1275 cfs_waitq_signal(&thread->t_ctl_waitq);
1277 CDEBUG(D_DLMTRACE, "%s: pool thread starting, process %d\n",
1278 t_name, cfs_curproc_pid());
1281 struct l_wait_info lwi;
1284 * Recal all pools on this tick.
1286 ldlm_pools_recalc(LDLM_NAMESPACE_SERVER);
1287 ldlm_pools_recalc(LDLM_NAMESPACE_CLIENT);
1290 * Wait until the next check time, or until we're
1293 lwi = LWI_TIMEOUT(cfs_time_seconds(LDLM_POOLS_THREAD_PERIOD),
1295 l_wait_event(thread->t_ctl_waitq, (thread->t_flags &
1296 (SVC_STOPPING|SVC_EVENT)),
1299 if (thread->t_flags & SVC_STOPPING) {
1300 thread->t_flags &= ~SVC_STOPPING;
1302 } else if (thread->t_flags & SVC_EVENT) {
1303 thread->t_flags &= ~SVC_EVENT;
1307 thread->t_flags = SVC_STOPPED;
1308 cfs_waitq_signal(&thread->t_ctl_waitq);
1310 CDEBUG(D_DLMTRACE, "%s: pool thread exiting, process %d\n",
1311 t_name, cfs_curproc_pid());
1313 complete_and_exit(&ldlm_pools_comp, 0);
1316 static int ldlm_pools_thread_start(void)
1318 struct l_wait_info lwi = { 0 };
1322 if (ldlm_pools_thread != NULL)
1325 OBD_ALLOC_PTR(ldlm_pools_thread);
1326 if (ldlm_pools_thread == NULL)
1329 init_completion(&ldlm_pools_comp);
1330 cfs_waitq_init(&ldlm_pools_thread->t_ctl_waitq);
1333 * CLONE_VM and CLONE_FILES just avoid a needless copy, because we
1334 * just drop the VM and FILES in cfs_daemonize() right away.
1336 rc = cfs_kernel_thread(ldlm_pools_thread_main, ldlm_pools_thread,
1337 CLONE_VM | CLONE_FILES);
1339 CERROR("Can't start pool thread, error %d\n",
1341 OBD_FREE(ldlm_pools_thread, sizeof(*ldlm_pools_thread));
1342 ldlm_pools_thread = NULL;
1345 l_wait_event(ldlm_pools_thread->t_ctl_waitq,
1346 (ldlm_pools_thread->t_flags & SVC_RUNNING), &lwi);
1350 static void ldlm_pools_thread_stop(void)
1354 if (ldlm_pools_thread == NULL) {
1359 ldlm_pools_thread->t_flags = SVC_STOPPING;
1360 cfs_waitq_signal(&ldlm_pools_thread->t_ctl_waitq);
1363 * Make sure that pools thread is finished before freeing @thread.
1364 * This fixes possible race and oops due to accessing freed memory
1367 wait_for_completion(&ldlm_pools_comp);
1368 OBD_FREE_PTR(ldlm_pools_thread);
1369 ldlm_pools_thread = NULL;
1373 int ldlm_pools_init(void)
1378 rc = ldlm_pools_thread_start();
1380 ldlm_pools_srv_shrinker = set_shrinker(DEFAULT_SEEKS,
1381 ldlm_pools_srv_shrink);
1382 ldlm_pools_cli_shrinker = set_shrinker(DEFAULT_SEEKS,
1383 ldlm_pools_cli_shrink);
1387 EXPORT_SYMBOL(ldlm_pools_init);
1389 void ldlm_pools_fini(void)
1391 if (ldlm_pools_srv_shrinker != NULL) {
1392 remove_shrinker(ldlm_pools_srv_shrinker);
1393 ldlm_pools_srv_shrinker = NULL;
1395 if (ldlm_pools_cli_shrinker != NULL) {
1396 remove_shrinker(ldlm_pools_cli_shrinker);
1397 ldlm_pools_cli_shrinker = NULL;
1399 ldlm_pools_thread_stop();
1401 EXPORT_SYMBOL(ldlm_pools_fini);
1402 #endif /* __KERNEL__ */
1404 #else /* !HAVE_LRU_RESIZE_SUPPORT */
1405 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
1409 EXPORT_SYMBOL(ldlm_pool_setup);
1411 int ldlm_pool_recalc(struct ldlm_pool *pl)
1415 EXPORT_SYMBOL(ldlm_pool_recalc);
1417 int ldlm_pool_shrink(struct ldlm_pool *pl,
1418 int nr, unsigned int gfp_mask)
1422 EXPORT_SYMBOL(ldlm_pool_shrink);
1424 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
1425 int idx, ldlm_side_t client)
1429 EXPORT_SYMBOL(ldlm_pool_init);
1431 void ldlm_pool_fini(struct ldlm_pool *pl)
1435 EXPORT_SYMBOL(ldlm_pool_fini);
1437 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
1441 EXPORT_SYMBOL(ldlm_pool_add);
1443 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
1447 EXPORT_SYMBOL(ldlm_pool_del);
1449 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
1453 EXPORT_SYMBOL(ldlm_pool_get_slv);
1455 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
1459 EXPORT_SYMBOL(ldlm_pool_set_slv);
1461 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
1465 EXPORT_SYMBOL(ldlm_pool_get_clv);
1467 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1471 EXPORT_SYMBOL(ldlm_pool_set_clv);
1473 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1477 EXPORT_SYMBOL(ldlm_pool_get_limit);
1479 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1483 EXPORT_SYMBOL(ldlm_pool_set_limit);
1485 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1489 EXPORT_SYMBOL(ldlm_pool_get_lvf);
1491 int ldlm_pools_init(void)
1495 EXPORT_SYMBOL(ldlm_pools_init);
1497 void ldlm_pools_fini(void)
1501 EXPORT_SYMBOL(ldlm_pools_fini);
1503 void ldlm_pools_recalc(ldlm_side_t client)
1507 EXPORT_SYMBOL(ldlm_pools_recalc);
1508 #endif /* HAVE_LRU_RESIZE_SUPPORT */