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>
104 # include <libcfs/kp30.h>
107 #include <obd_class.h>
108 #include <obd_support.h>
109 #include "ldlm_internal.h"
111 #ifdef HAVE_LRU_RESIZE_SUPPORT
114 * 50 ldlm locks for 1MB of RAM.
116 #define LDLM_POOL_HOST_L ((CFS_NUM_CACHEPAGES >> (20 - CFS_PAGE_SHIFT)) * 50)
119 * Maximal possible grant step plan in %.
121 #define LDLM_POOL_MAX_GSP (30)
124 * Minimal possible grant step plan in %.
126 #define LDLM_POOL_MIN_GSP (1)
129 * This controls the speed of reaching LDLM_POOL_MAX_GSP
130 * with increasing thread period. This is 4s which means
131 * that for 10s thread period we will have 2 steps by 4s
134 #define LDLM_POOL_GSP_STEP (4)
137 * LDLM_POOL_GSP% of all locks is default GP.
139 #define LDLM_POOL_GP(L) (((L) * LDLM_POOL_MAX_GSP) / 100)
142 * Max age for locks on clients.
144 #define LDLM_POOL_MAX_AGE (36000)
147 extern cfs_proc_dir_entry_t *ldlm_ns_proc_dir;
150 #define avg(src, add) \
151 ((src) = ((src) + (add)) / 2)
153 static inline __u64 dru(__u64 val, __u32 div)
155 __u64 ret = val + (div - 1);
160 static inline __u64 ldlm_pool_slv_max(__u32 L)
163 * Allow to have all locks for 1 client for 10 hrs.
164 * Formula is the following: limit * 10h / 1 client.
166 __u64 lim = L * LDLM_POOL_MAX_AGE / 1;
170 static inline __u64 ldlm_pool_slv_min(__u32 L)
176 LDLM_POOL_FIRST_STAT = 0,
177 LDLM_POOL_GRANTED_STAT = LDLM_POOL_FIRST_STAT,
178 LDLM_POOL_GRANT_STAT,
179 LDLM_POOL_CANCEL_STAT,
180 LDLM_POOL_GRANT_RATE_STAT,
181 LDLM_POOL_CANCEL_RATE_STAT,
182 LDLM_POOL_GRANT_PLAN_STAT,
184 LDLM_POOL_SHRINK_REQTD_STAT,
185 LDLM_POOL_SHRINK_FREED_STAT,
186 LDLM_POOL_RECALC_STAT,
187 LDLM_POOL_TIMING_STAT,
191 static inline struct ldlm_namespace *ldlm_pl2ns(struct ldlm_pool *pl)
193 return container_of(pl, struct ldlm_namespace, ns_pool);
197 * Calculates suggested grant_step in % of available locks for passed
198 * \a period. This is later used in grant_plan calculations.
200 static inline int ldlm_pool_t2gsp(int t)
203 * This yeilds 1% grant step for anything below LDLM_POOL_GSP_STEP
204 * and up to 30% for anything higher than LDLM_POOL_GSP_STEP.
206 * How this will affect execution is the following:
208 * - for thread peroid 1s we will have grant_step 1% which good from
209 * pov of taking some load off from server and push it out to clients.
210 * This is like that because 1% for grant_step means that server will
211 * not allow clients to get lots of locks inshort period of time and
212 * keep all old locks in their caches. Clients will always have to
213 * get some locks back if they want to take some new;
215 * - for thread period 10s (which is default) we will have 23% which
216 * means that clients will have enough of room to take some new locks
217 * without getting some back. All locks from this 23% which were not
218 * taken by clients in current period will contribute in SLV growing.
219 * SLV growing means more locks cached on clients until limit or grant
222 return LDLM_POOL_MAX_GSP -
223 (LDLM_POOL_MAX_GSP - LDLM_POOL_MIN_GSP) /
224 (1 << (t / LDLM_POOL_GSP_STEP));
228 * Recalculates next grant limit on passed \a pl.
230 * \pre ->pl_lock is locked.
232 static inline void ldlm_pool_recalc_grant_plan(struct ldlm_pool *pl)
234 int granted, grant_step, limit;
236 limit = ldlm_pool_get_limit(pl);
237 granted = atomic_read(&pl->pl_granted);
239 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
240 grant_step = ((limit - granted) * grant_step) / 100;
241 pl->pl_grant_plan = granted + grant_step;
245 * Recalculates next SLV on passed \a pl.
247 * \pre ->pl_lock is locked.
249 static inline void ldlm_pool_recalc_slv(struct ldlm_pool *pl)
251 int grant_usage, granted, grant_plan;
252 __u64 slv, slv_factor;
255 slv = pl->pl_server_lock_volume;
256 grant_plan = pl->pl_grant_plan;
257 limit = ldlm_pool_get_limit(pl);
258 granted = atomic_read(&pl->pl_granted);
260 grant_usage = limit - (granted - grant_plan);
261 if (grant_usage <= 0)
265 * Find out SLV change factor which is the ratio of grant usage
266 * from limit. SLV changes as fast as the ratio of grant plan
267 * consumtion. The more locks from grant plan are not consumed
268 * by clients in last interval (idle time), the faster grows
269 * SLV. And the opposite, the more grant plan is over-consumed
270 * (load time) the faster drops SLV.
272 slv_factor = (grant_usage * 100) / limit;
273 if (2 * abs(granted - limit) > limit) {
274 slv_factor *= slv_factor;
275 slv_factor = dru(slv_factor, 100);
277 slv = slv * slv_factor;
280 if (slv > ldlm_pool_slv_max(limit)) {
281 slv = ldlm_pool_slv_max(limit);
282 } else if (slv < ldlm_pool_slv_min(limit)) {
283 slv = ldlm_pool_slv_min(limit);
286 pl->pl_server_lock_volume = slv;
290 * Recalculates next stats on passed \a pl.
292 * \pre ->pl_lock is locked.
294 static inline void ldlm_pool_recalc_stats(struct ldlm_pool *pl)
296 int grant_plan = pl->pl_grant_plan;
297 __u64 slv = pl->pl_server_lock_volume;
298 int granted = atomic_read(&pl->pl_granted);
299 int grant_rate = atomic_read(&pl->pl_grant_rate);
300 int cancel_rate = atomic_read(&pl->pl_cancel_rate);
302 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_SLV_STAT,
304 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
306 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
308 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
310 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
315 * Sets current SLV into obd accessible via ldlm_pl2ns(pl)->ns_obd.
317 static void ldlm_srv_pool_push_slv(struct ldlm_pool *pl)
319 struct obd_device *obd;
322 * Set new SLV in obd field for using it later without accessing the
323 * pool. This is required to avoid race between sending reply to client
324 * with new SLV and cleanup server stack in which we can't guarantee
325 * that namespace is still alive. We know only that obd is alive as
326 * long as valid export is alive.
328 obd = ldlm_pl2ns(pl)->ns_obd;
329 LASSERT(obd != NULL);
330 write_lock(&obd->obd_pool_lock);
331 obd->obd_pool_slv = pl->pl_server_lock_volume;
332 write_unlock(&obd->obd_pool_lock);
336 * Recalculates all pool fields on passed \a pl.
338 * \pre ->pl_lock is not locked.
340 static int ldlm_srv_pool_recalc(struct ldlm_pool *pl)
342 time_t recalc_interval_sec;
345 spin_lock(&pl->pl_lock);
346 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
347 if (recalc_interval_sec >= pl->pl_recalc_period) {
349 * Recalc SLV after last period. This should be done
350 * _before_ recalculating new grant plan.
352 ldlm_pool_recalc_slv(pl);
355 * Make sure that pool informed obd of last SLV changes.
357 ldlm_srv_pool_push_slv(pl);
360 * Update grant_plan for new period.
362 ldlm_pool_recalc_grant_plan(pl);
364 pl->pl_recalc_time = cfs_time_current_sec();
365 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
366 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 atomic_inc(&pl->pl_granted);
915 atomic_inc(&pl->pl_grant_rate);
916 atomic_inc(&pl->pl_grant_speed);
918 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 LASSERT(atomic_read(&pl->pl_granted) > 0);
945 atomic_dec(&pl->pl_granted);
946 atomic_inc(&pl->pl_cancel_rate);
947 atomic_dec(&pl->pl_grant_speed);
949 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_CANCEL_STAT);
951 if (ns_is_server(ldlm_pl2ns(pl)))
952 ldlm_pool_recalc(pl);
955 EXPORT_SYMBOL(ldlm_pool_del);
958 * Returns current \a pl SLV.
960 * \pre ->pl_lock is not locked.
962 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
965 spin_lock(&pl->pl_lock);
966 slv = pl->pl_server_lock_volume;
967 spin_unlock(&pl->pl_lock);
970 EXPORT_SYMBOL(ldlm_pool_get_slv);
973 * Sets passed \a slv to \a pl.
975 * \pre ->pl_lock is not locked.
977 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
979 spin_lock(&pl->pl_lock);
980 pl->pl_server_lock_volume = slv;
981 spin_unlock(&pl->pl_lock);
983 EXPORT_SYMBOL(ldlm_pool_set_slv);
986 * Returns current \a pl CLV.
988 * \pre ->pl_lock is not locked.
990 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
993 spin_lock(&pl->pl_lock);
994 slv = pl->pl_client_lock_volume;
995 spin_unlock(&pl->pl_lock);
998 EXPORT_SYMBOL(ldlm_pool_get_clv);
1001 * Sets passed \a clv to \a pl.
1003 * \pre ->pl_lock is not locked.
1005 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1007 spin_lock(&pl->pl_lock);
1008 pl->pl_client_lock_volume = clv;
1009 spin_unlock(&pl->pl_lock);
1011 EXPORT_SYMBOL(ldlm_pool_set_clv);
1014 * Returns current \a pl limit.
1016 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1018 return atomic_read(&pl->pl_limit);
1020 EXPORT_SYMBOL(ldlm_pool_get_limit);
1023 * Sets passed \a limit to \a pl.
1025 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1027 atomic_set(&pl->pl_limit, limit);
1029 EXPORT_SYMBOL(ldlm_pool_set_limit);
1032 * Returns current LVF from \a pl.
1034 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1036 return atomic_read(&pl->pl_lock_volume_factor);
1038 EXPORT_SYMBOL(ldlm_pool_get_lvf);
1041 static int ldlm_pool_granted(struct ldlm_pool *pl)
1043 return atomic_read(&pl->pl_granted);
1046 static struct ptlrpc_thread *ldlm_pools_thread;
1047 static struct shrinker *ldlm_pools_srv_shrinker;
1048 static struct shrinker *ldlm_pools_cli_shrinker;
1049 static struct completion ldlm_pools_comp;
1052 * Cancel \a nr locks from all namespaces (if possible). Returns number of
1053 * cached locks after shrink is finished. All namespaces are asked to
1054 * cancel approximately equal amount of locks to keep balancing.
1056 static int ldlm_pools_shrink(ldlm_side_t client, int nr,
1057 unsigned int gfp_mask)
1059 int total = 0, cached = 0, nr_ns;
1060 struct ldlm_namespace *ns;
1062 if (nr != 0 && !(gfp_mask & __GFP_FS))
1066 CDEBUG(D_DLMTRACE, "Request to shrink %d %s locks\n",
1067 nr, client == LDLM_NAMESPACE_CLIENT ? "client":"server");
1070 * Find out how many resources we may release.
1072 for (nr_ns = atomic_read(ldlm_namespace_nr(client));
1075 mutex_down(ldlm_namespace_lock(client));
1076 if (list_empty(ldlm_namespace_list(client))) {
1077 mutex_up(ldlm_namespace_lock(client));
1080 ns = ldlm_namespace_first_locked(client);
1081 ldlm_namespace_get(ns);
1082 ldlm_namespace_move_locked(ns, client);
1083 mutex_up(ldlm_namespace_lock(client));
1084 total += ldlm_pool_shrink(&ns->ns_pool, 0, gfp_mask);
1085 ldlm_namespace_put(ns, 1);
1088 if (nr == 0 || total == 0)
1092 * Shrink at least ldlm_namespace_nr(client) namespaces.
1094 for (nr_ns = atomic_read(ldlm_namespace_nr(client));
1097 int cancel, nr_locks;
1100 * Do not call shrink under ldlm_namespace_lock(client)
1102 mutex_down(ldlm_namespace_lock(client));
1103 if (list_empty(ldlm_namespace_list(client))) {
1104 mutex_up(ldlm_namespace_lock(client));
1106 * If list is empty, we can't return any @cached > 0,
1107 * that probably would cause needless shrinker
1113 ns = ldlm_namespace_first_locked(client);
1114 ldlm_namespace_get(ns);
1115 ldlm_namespace_move_locked(ns, client);
1116 mutex_up(ldlm_namespace_lock(client));
1118 nr_locks = ldlm_pool_granted(&ns->ns_pool);
1119 cancel = 1 + nr_locks * nr / total;
1120 ldlm_pool_shrink(&ns->ns_pool, cancel, gfp_mask);
1121 cached += ldlm_pool_granted(&ns->ns_pool);
1122 ldlm_namespace_put(ns, 1);
1127 static int ldlm_pools_srv_shrink(int nr, unsigned int gfp_mask)
1129 return ldlm_pools_shrink(LDLM_NAMESPACE_SERVER, nr, gfp_mask);
1132 static int ldlm_pools_cli_shrink(int nr, unsigned int gfp_mask)
1134 return ldlm_pools_shrink(LDLM_NAMESPACE_CLIENT, nr, gfp_mask);
1137 void ldlm_pools_recalc(ldlm_side_t client)
1139 __u32 nr_l = 0, nr_p = 0, l;
1140 struct ldlm_namespace *ns;
1144 * No need to setup pool limit for client pools.
1146 if (client == LDLM_NAMESPACE_SERVER) {
1148 * Check all modest namespaces first.
1150 mutex_down(ldlm_namespace_lock(client));
1151 list_for_each_entry(ns, ldlm_namespace_list(client),
1154 if (ns->ns_appetite != LDLM_NAMESPACE_MODEST)
1157 l = ldlm_pool_granted(&ns->ns_pool);
1162 * Set the modest pools limit equal to their avg granted
1165 l += dru(l * LDLM_POOLS_MODEST_MARGIN, 100);
1166 ldlm_pool_setup(&ns->ns_pool, l);
1172 * Make sure that modest namespaces did not eat more that 2/3
1175 if (nr_l >= 2 * (LDLM_POOL_HOST_L / 3)) {
1176 CWARN("\"Modest\" pools eat out 2/3 of server locks "
1177 "limit (%d of %lu). This means that you have too "
1178 "many clients for this amount of server RAM. "
1179 "Upgrade server!\n", nr_l, LDLM_POOL_HOST_L);
1184 * The rest is given to greedy namespaces.
1186 list_for_each_entry(ns, ldlm_namespace_list(client),
1189 if (!equal && ns->ns_appetite != LDLM_NAMESPACE_GREEDY)
1194 * In the case 2/3 locks are eaten out by
1195 * modest pools, we re-setup equal limit
1198 l = LDLM_POOL_HOST_L /
1199 atomic_read(ldlm_namespace_nr(client));
1202 * All the rest of greedy pools will have
1203 * all locks in equal parts.
1205 l = (LDLM_POOL_HOST_L - nr_l) /
1206 (atomic_read(ldlm_namespace_nr(client)) -
1209 ldlm_pool_setup(&ns->ns_pool, l);
1211 mutex_up(ldlm_namespace_lock(client));
1215 * Recalc at least ldlm_namespace_nr(client) namespaces.
1217 for (nr = atomic_read(ldlm_namespace_nr(client)); nr > 0; nr--) {
1219 * Lock the list, get first @ns in the list, getref, move it
1220 * to the tail, unlock and call pool recalc. This way we avoid
1221 * calling recalc under @ns lock what is really good as we get
1222 * rid of potential deadlock on client nodes when canceling
1223 * locks synchronously.
1225 mutex_down(ldlm_namespace_lock(client));
1226 if (list_empty(ldlm_namespace_list(client))) {
1227 mutex_up(ldlm_namespace_lock(client));
1230 ns = ldlm_namespace_first_locked(client);
1231 ldlm_namespace_get(ns);
1232 ldlm_namespace_move_locked(ns, client);
1233 mutex_up(ldlm_namespace_lock(client));
1236 * After setup is done - recalc the pool.
1238 ldlm_pool_recalc(&ns->ns_pool);
1239 ldlm_namespace_put(ns, 1);
1242 EXPORT_SYMBOL(ldlm_pools_recalc);
1244 static int ldlm_pools_thread_main(void *arg)
1246 struct ptlrpc_thread *thread = (struct ptlrpc_thread *)arg;
1247 char *t_name = "ldlm_poold";
1250 cfs_daemonize(t_name);
1251 thread->t_flags = SVC_RUNNING;
1252 cfs_waitq_signal(&thread->t_ctl_waitq);
1254 CDEBUG(D_DLMTRACE, "%s: pool thread starting, process %d\n",
1255 t_name, cfs_curproc_pid());
1258 struct l_wait_info lwi;
1261 * Recal all pools on this tick.
1263 ldlm_pools_recalc(LDLM_NAMESPACE_SERVER);
1264 ldlm_pools_recalc(LDLM_NAMESPACE_CLIENT);
1267 * Wait until the next check time, or until we're
1270 lwi = LWI_TIMEOUT(cfs_time_seconds(LDLM_POOLS_THREAD_PERIOD),
1272 l_wait_event(thread->t_ctl_waitq, (thread->t_flags &
1273 (SVC_STOPPING|SVC_EVENT)),
1276 if (thread->t_flags & SVC_STOPPING) {
1277 thread->t_flags &= ~SVC_STOPPING;
1279 } else if (thread->t_flags & SVC_EVENT) {
1280 thread->t_flags &= ~SVC_EVENT;
1284 thread->t_flags = SVC_STOPPED;
1285 cfs_waitq_signal(&thread->t_ctl_waitq);
1287 CDEBUG(D_DLMTRACE, "%s: pool thread exiting, process %d\n",
1288 t_name, cfs_curproc_pid());
1290 complete_and_exit(&ldlm_pools_comp, 0);
1293 static int ldlm_pools_thread_start(void)
1295 struct l_wait_info lwi = { 0 };
1299 if (ldlm_pools_thread != NULL)
1302 OBD_ALLOC_PTR(ldlm_pools_thread);
1303 if (ldlm_pools_thread == NULL)
1306 init_completion(&ldlm_pools_comp);
1307 cfs_waitq_init(&ldlm_pools_thread->t_ctl_waitq);
1310 * CLONE_VM and CLONE_FILES just avoid a needless copy, because we
1311 * just drop the VM and FILES in cfs_daemonize() right away.
1313 rc = cfs_kernel_thread(ldlm_pools_thread_main, ldlm_pools_thread,
1314 CLONE_VM | CLONE_FILES);
1316 CERROR("Can't start pool thread, error %d\n",
1318 OBD_FREE(ldlm_pools_thread, sizeof(*ldlm_pools_thread));
1319 ldlm_pools_thread = NULL;
1322 l_wait_event(ldlm_pools_thread->t_ctl_waitq,
1323 (ldlm_pools_thread->t_flags & SVC_RUNNING), &lwi);
1327 static void ldlm_pools_thread_stop(void)
1331 if (ldlm_pools_thread == NULL) {
1336 ldlm_pools_thread->t_flags = SVC_STOPPING;
1337 cfs_waitq_signal(&ldlm_pools_thread->t_ctl_waitq);
1340 * Make sure that pools thread is finished before freeing @thread.
1341 * This fixes possible race and oops due to accessing freed memory
1344 wait_for_completion(&ldlm_pools_comp);
1345 OBD_FREE_PTR(ldlm_pools_thread);
1346 ldlm_pools_thread = NULL;
1350 int ldlm_pools_init(void)
1355 rc = ldlm_pools_thread_start();
1357 ldlm_pools_srv_shrinker = set_shrinker(DEFAULT_SEEKS,
1358 ldlm_pools_srv_shrink);
1359 ldlm_pools_cli_shrinker = set_shrinker(DEFAULT_SEEKS,
1360 ldlm_pools_cli_shrink);
1364 EXPORT_SYMBOL(ldlm_pools_init);
1366 void ldlm_pools_fini(void)
1368 if (ldlm_pools_srv_shrinker != NULL) {
1369 remove_shrinker(ldlm_pools_srv_shrinker);
1370 ldlm_pools_srv_shrinker = NULL;
1372 if (ldlm_pools_cli_shrinker != NULL) {
1373 remove_shrinker(ldlm_pools_cli_shrinker);
1374 ldlm_pools_cli_shrinker = NULL;
1376 ldlm_pools_thread_stop();
1378 EXPORT_SYMBOL(ldlm_pools_fini);
1379 #endif /* __KERNEL__ */
1381 #else /* !HAVE_LRU_RESIZE_SUPPORT */
1382 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
1386 EXPORT_SYMBOL(ldlm_pool_setup);
1388 int ldlm_pool_recalc(struct ldlm_pool *pl)
1392 EXPORT_SYMBOL(ldlm_pool_recalc);
1394 int ldlm_pool_shrink(struct ldlm_pool *pl,
1395 int nr, unsigned int gfp_mask)
1399 EXPORT_SYMBOL(ldlm_pool_shrink);
1401 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
1402 int idx, ldlm_side_t client)
1406 EXPORT_SYMBOL(ldlm_pool_init);
1408 void ldlm_pool_fini(struct ldlm_pool *pl)
1412 EXPORT_SYMBOL(ldlm_pool_fini);
1414 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
1418 EXPORT_SYMBOL(ldlm_pool_add);
1420 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
1424 EXPORT_SYMBOL(ldlm_pool_del);
1426 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
1430 EXPORT_SYMBOL(ldlm_pool_get_slv);
1432 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
1436 EXPORT_SYMBOL(ldlm_pool_set_slv);
1438 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
1442 EXPORT_SYMBOL(ldlm_pool_get_clv);
1444 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1448 EXPORT_SYMBOL(ldlm_pool_set_clv);
1450 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1454 EXPORT_SYMBOL(ldlm_pool_get_limit);
1456 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1460 EXPORT_SYMBOL(ldlm_pool_set_limit);
1462 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1466 EXPORT_SYMBOL(ldlm_pool_get_lvf);
1468 int ldlm_pools_init(void)
1472 EXPORT_SYMBOL(ldlm_pools_init);
1474 void ldlm_pools_fini(void)
1478 EXPORT_SYMBOL(ldlm_pools_fini);
1480 void ldlm_pools_recalc(ldlm_side_t client)
1484 EXPORT_SYMBOL(ldlm_pools_recalc);
1485 #endif /* HAVE_LRU_RESIZE_SUPPORT */