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, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License version 2 for more details (a copy is included
14 * in the LICENSE file that accompanied this code).
16 * You should have received a copy of the GNU General Public License
17 * version 2 along with this program; If not, see
18 * http://www.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2010, 2017, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
32 * lustre/ldlm/ldlm_pool.c
34 * Author: Yury Umanets <umka@clusterfs.com>
38 * Idea of this code is rather simple. Each second, for each server namespace
39 * we have SLV - server lock volume which is calculated on current number of
40 * granted locks, grant speed for past period, etc - that is, locking load.
41 * This SLV number may be thought as a flow definition for simplicity. It is
42 * sent to clients with each occasion to let them know what is current load
43 * situation on the server. By default, at the beginning, SLV on server is
44 * set max value which is calculated as the following: allow to one client
45 * have all locks of limit ->pl_limit for 10h.
47 * Next, on clients, number of cached locks is not limited artificially in any
48 * way as it was before. Instead, client calculates CLV, that is, client lock
49 * volume for each lock and compares it with last SLV from the server. CLV is
50 * calculated as the number of locks in LRU * lock live time in seconds. If
51 * CLV > SLV - lock is canceled.
53 * Client has LVF, that is, lock volume factor which regulates how much
54 * sensitive client should be about last SLV from server. The higher LVF is the
55 * more locks will be canceled on client. Default value for it is 1. Setting
56 * LVF to 2 means that client will cancel locks 2 times faster.
58 * Locks on a client will be canceled more intensively in these cases:
59 * (1) if SLV is smaller, that is, load is higher on the server;
60 * (2) client has a lot of locks (the more locks are held by client, the bigger
61 * chances that some of them should be canceled);
62 * (3) client has old locks (taken some time ago);
64 * Thus, according to flow paradigm that we use for better understanding SLV,
65 * CLV is the volume of particle in flow described by SLV. According to this,
66 * if flow is getting thinner, more and more particles become outside of it and
67 * as particles are locks, they should be canceled.
69 * General idea of this belongs to Vitaly Fertman (vitaly@clusterfs.com).
70 * Andreas Dilger(adilger@clusterfs.com) proposed few nice ideas like using LVF
71 * and many cleanups. Flow definition to allow more easy understanding of the
72 * logic belongs to Nikita Danilov(nikita@clusterfs.com) as well as many
73 * cleanups and fixes. And design and implementation are done by Yury Umanets
74 * (umka@clusterfs.com).
76 * Glossary for terms used:
78 * pl_limit - Number of allowed locks in pool. Applies to server and client
81 * pl_granted - Number of granted locks (calculated);
82 * pl_grant_rate - Number of granted locks for last T (calculated);
83 * pl_cancel_rate - Number of canceled locks for last T (calculated);
84 * pl_grant_speed - Grant speed (GR - CR) for last T (calculated);
85 * pl_grant_plan - Planned number of granted locks for next T (calculated);
86 * pl_server_lock_volume - Current server lock volume (calculated);
88 * As it may be seen from list above, we have few possible tunables which may
89 * affect behavior much. They all may be modified via sysfs. However, they also
90 * give a possibility for constructing few pre-defined behavior policies. If
91 * none of predefines is suitable for a working pattern being used, new one may
92 * be "constructed" via sysfs tunables.
95 #define DEBUG_SUBSYSTEM S_LDLM
97 #include <linux/workqueue.h>
98 #include <libcfs/linux/linux-mem.h>
99 #include <lustre_dlm.h>
100 #include <cl_object.h>
101 #include <obd_class.h>
102 #include <obd_support.h>
103 #include "ldlm_internal.h"
105 #ifdef HAVE_LRU_RESIZE_SUPPORT
108 * 50 ldlm locks for 1MB of RAM.
110 #define LDLM_POOL_HOST_L ((NUM_CACHEPAGES >> (20 - PAGE_SHIFT)) * 50)
113 * Maximal possible grant step plan in %.
115 #define LDLM_POOL_MAX_GSP (30)
118 * Minimal possible grant step plan in %.
120 #define LDLM_POOL_MIN_GSP (1)
123 * This controls the speed of reaching LDLM_POOL_MAX_GSP
124 * with increasing thread period.
126 #define LDLM_POOL_GSP_STEP_SHIFT (2)
129 * LDLM_POOL_GSP% of all locks is default GP.
131 #define LDLM_POOL_GP(L) (((L) * LDLM_POOL_MAX_GSP) / 100)
134 * Max age for locks on clients.
136 #define LDLM_POOL_MAX_AGE (36000)
139 * The granularity of SLV calculation.
141 #define LDLM_POOL_SLV_SHIFT (10)
143 static inline __u64 dru(__u64 val, __u32 shift, int round_up)
145 return (val + (round_up ? (1 << shift) - 1 : 0)) >> shift;
148 static inline __u64 ldlm_pool_slv_max(__u32 L)
151 * Allow to have all locks for 1 client for 10 hrs.
152 * Formula is the following: limit * 10h / 1 client.
154 __u64 lim = (__u64)L * LDLM_POOL_MAX_AGE / 1;
158 static inline __u64 ldlm_pool_slv_min(__u32 L)
164 LDLM_POOL_FIRST_STAT = 0,
165 LDLM_POOL_GRANTED_STAT = LDLM_POOL_FIRST_STAT,
166 LDLM_POOL_GRANT_STAT,
167 LDLM_POOL_CANCEL_STAT,
168 LDLM_POOL_GRANT_RATE_STAT,
169 LDLM_POOL_CANCEL_RATE_STAT,
170 LDLM_POOL_GRANT_PLAN_STAT,
172 LDLM_POOL_SHRINK_REQTD_STAT,
173 LDLM_POOL_SHRINK_FREED_STAT,
174 LDLM_POOL_RECALC_STAT,
175 LDLM_POOL_TIMING_STAT,
179 static inline struct ldlm_namespace *ldlm_pl2ns(struct ldlm_pool *pl)
181 return container_of(pl, struct ldlm_namespace, ns_pool);
185 * Calculates suggested grant_step in % of available locks for passed
186 * \a period. This is later used in grant_plan calculations.
188 static inline int ldlm_pool_t2gsp(unsigned int t)
191 * This yields 1% grant step for anything below LDLM_POOL_GSP_STEP
192 * and up to 30% for anything higher than LDLM_POOL_GSP_STEP.
194 * How this will affect execution is the following:
196 * - for thread period 1s we will have grant_step 1% which good from
197 * pov of taking some load off from server and push it out to clients.
198 * This is like that because 1% for grant_step means that server will
199 * not allow clients to get lots of locks in short period of time and
200 * keep all old locks in their caches. Clients will always have to
201 * get some locks back if they want to take some new;
203 * - for thread period 10s (which is default) we will have 23% which
204 * means that clients will have enough of room to take some new locks
205 * without getting some back. All locks from this 23% which were not
206 * taken by clients in current period will contribute in SLV growing.
207 * SLV growing means more locks cached on clients until limit or grant
210 return LDLM_POOL_MAX_GSP -
211 ((LDLM_POOL_MAX_GSP - LDLM_POOL_MIN_GSP) >>
212 (t >> LDLM_POOL_GSP_STEP_SHIFT));
215 static inline int ldlm_pool_granted(struct ldlm_pool *pl)
217 return atomic_read(&pl->pl_granted);
221 * Recalculates next grant limit on passed \a pl.
223 * \pre ->pl_lock is locked.
225 static void ldlm_pool_recalc_grant_plan(struct ldlm_pool *pl)
227 int granted, grant_step, limit;
229 limit = ldlm_pool_get_limit(pl);
230 granted = ldlm_pool_granted(pl);
232 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
233 grant_step = ((limit - granted) * grant_step) / 100;
234 pl->pl_grant_plan = granted + grant_step;
235 limit = (limit * 5) >> 2;
236 if (pl->pl_grant_plan > limit)
237 pl->pl_grant_plan = limit;
241 * Recalculates next SLV on passed \a pl.
243 * \pre ->pl_lock is locked.
245 static void ldlm_pool_recalc_slv(struct ldlm_pool *pl)
255 slv = pl->pl_server_lock_volume;
256 grant_plan = pl->pl_grant_plan;
257 limit = ldlm_pool_get_limit(pl);
258 granted = ldlm_pool_granted(pl);
259 round_up = granted < limit;
261 grant_usage = max_t(int, limit - (granted - grant_plan), 1);
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 * consumption. 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 << LDLM_POOL_SLV_SHIFT);
272 do_div(slv_factor, limit);
273 slv = slv * slv_factor;
274 slv = dru(slv, LDLM_POOL_SLV_SHIFT, round_up);
276 if (slv > ldlm_pool_slv_max(limit))
277 slv = ldlm_pool_slv_max(limit);
278 else if (slv < ldlm_pool_slv_min(limit))
279 slv = ldlm_pool_slv_min(limit);
281 pl->pl_server_lock_volume = slv;
285 * Recalculates next stats on passed \a pl.
287 * \pre ->pl_lock is locked.
289 static void ldlm_pool_recalc_stats(struct ldlm_pool *pl)
291 int grant_plan = pl->pl_grant_plan;
292 __u64 slv = pl->pl_server_lock_volume;
293 int granted = ldlm_pool_granted(pl);
294 int grant_rate = atomic_read(&pl->pl_grant_rate);
295 int cancel_rate = atomic_read(&pl->pl_cancel_rate);
297 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_SLV_STAT,
299 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
301 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
303 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
305 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
310 * Sets current SLV into obd accessible via ldlm_pl2ns(pl)->ns_obd.
312 static void ldlm_srv_pool_push_slv(struct ldlm_pool *pl)
314 struct obd_device *obd;
317 * Set new SLV in obd field for using it later without accessing the
318 * pool. This is required to avoid race between sending reply to client
319 * with new SLV and cleanup server stack in which we can't guarantee
320 * that namespace is still alive. We know only that obd is alive as
321 * long as valid export is alive.
323 obd = ldlm_pl2ns(pl)->ns_obd;
324 LASSERT(obd != NULL);
325 write_lock(&obd->obd_pool_lock);
326 obd->obd_pool_slv = pl->pl_server_lock_volume;
327 write_unlock(&obd->obd_pool_lock);
331 * Recalculates all pool fields on passed \a pl.
333 * \pre ->pl_lock is not locked.
335 static int ldlm_srv_pool_recalc(struct ldlm_pool *pl)
337 time64_t recalc_interval_sec;
341 recalc_interval_sec = ktime_get_real_seconds() - pl->pl_recalc_time;
342 if (recalc_interval_sec < pl->pl_recalc_period)
345 spin_lock(&pl->pl_lock);
346 recalc_interval_sec = ktime_get_real_seconds() - pl->pl_recalc_time;
347 if (recalc_interval_sec < pl->pl_recalc_period) {
348 spin_unlock(&pl->pl_lock);
352 * Recalc SLV after last period. This should be done
353 * _before_ recalculating new grant plan.
355 ldlm_pool_recalc_slv(pl);
358 * Make sure that pool informed obd of last SLV changes.
360 ldlm_srv_pool_push_slv(pl);
363 * Update grant_plan for new period.
365 ldlm_pool_recalc_grant_plan(pl);
367 pl->pl_recalc_time = ktime_get_real_seconds();
368 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
369 recalc_interval_sec);
370 spin_unlock(&pl->pl_lock);
375 * This function is used on server side as main entry point for memory
376 * pressure handling. It decreases SLV on \a pl according to passed
377 * \a nr and \a gfp_mask.
379 * Our goal here is to decrease SLV such a way that clients hold \a nr
380 * locks smaller in next 10h.
382 static int ldlm_srv_pool_shrink(struct ldlm_pool *pl,
383 int nr, gfp_t gfp_mask)
388 * VM is asking how many entries may be potentially freed.
391 return ldlm_pool_granted(pl);
394 * Client already canceled locks but server is already in shrinker
395 * and can't cancel anything. Let's catch this race.
397 if (ldlm_pool_granted(pl) == 0)
400 spin_lock(&pl->pl_lock);
403 * We want shrinker to possibly cause cancellation of @nr locks from
404 * clients or grant approximately @nr locks smaller next intervals.
406 * This is why we decreased SLV by @nr. This effect will only be as
407 * long as one re-calc interval (1s these days) and this should be
408 * enough to pass this decreased SLV to all clients. On next recalc
409 * interval pool will either increase SLV if locks load is not high
410 * or will keep on same level or even decrease again, thus, shrinker
411 * decreased SLV will affect next recalc intervals and this way will
412 * make locking load lower.
414 if (nr < pl->pl_server_lock_volume) {
415 pl->pl_server_lock_volume = pl->pl_server_lock_volume - nr;
417 limit = ldlm_pool_get_limit(pl);
418 pl->pl_server_lock_volume = ldlm_pool_slv_min(limit);
422 * Make sure that pool informed obd of last SLV changes.
424 ldlm_srv_pool_push_slv(pl);
425 spin_unlock(&pl->pl_lock);
428 * We did not really free any memory here so far, it only will be
429 * freed later may be, so that we return 0 to not confuse VM.
435 * Setup server side pool \a pl with passed \a limit.
437 static int ldlm_srv_pool_setup(struct ldlm_pool *pl, int limit)
439 struct obd_device *obd;
441 obd = ldlm_pl2ns(pl)->ns_obd;
442 LASSERT(obd != NULL && obd != LP_POISON);
443 LASSERT(obd->obd_type != LP_POISON);
444 write_lock(&obd->obd_pool_lock);
445 obd->obd_pool_limit = limit;
446 write_unlock(&obd->obd_pool_lock);
448 ldlm_pool_set_limit(pl, limit);
453 * Sets SLV and Limit from ldlm_pl2ns(pl)->ns_obd tp passed \a pl.
455 static void ldlm_cli_pool_pop_slv(struct ldlm_pool *pl)
457 struct obd_device *obd;
460 * Get new SLV and Limit from obd which is updated with coming
463 obd = ldlm_pl2ns(pl)->ns_obd;
464 LASSERT(obd != NULL);
465 read_lock(&obd->obd_pool_lock);
466 pl->pl_server_lock_volume = obd->obd_pool_slv;
467 ldlm_pool_set_limit(pl, obd->obd_pool_limit);
468 read_unlock(&obd->obd_pool_lock);
472 * Recalculates client size pool \a pl according to current SLV and Limit.
474 static int ldlm_cli_pool_recalc(struct ldlm_pool *pl)
476 time64_t recalc_interval_sec;
481 recalc_interval_sec = ktime_get_real_seconds() - pl->pl_recalc_time;
482 if (recalc_interval_sec < pl->pl_recalc_period)
485 spin_lock(&pl->pl_lock);
487 * Check if we need to recalc lists now.
489 recalc_interval_sec = ktime_get_real_seconds() - pl->pl_recalc_time;
490 if (recalc_interval_sec < pl->pl_recalc_period) {
491 spin_unlock(&pl->pl_lock);
496 * Make sure that pool knows last SLV and Limit from obd.
498 ldlm_cli_pool_pop_slv(pl);
499 spin_unlock(&pl->pl_lock);
502 * In the time of canceling locks on client we do not need to maintain
503 * sharp timing, we only want to cancel locks asap according to new SLV.
504 * It may be called when SLV has changed much, this is why we do not
505 * take into account pl->pl_recalc_time here.
507 ret = ldlm_cancel_lru(ldlm_pl2ns(pl), 0, LCF_ASYNC, 0);
509 spin_lock(&pl->pl_lock);
511 * Time of LRU resizing might be longer than period,
512 * so update after LRU resizing rather than before it.
514 pl->pl_recalc_time = ktime_get_real_seconds();
515 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
516 recalc_interval_sec);
517 spin_unlock(&pl->pl_lock);
522 * This function is main entry point for memory pressure handling on client
523 * side. Main goal of this function is to cancel some number of locks on
524 * passed \a pl according to \a nr and \a gfp_mask.
526 static int ldlm_cli_pool_shrink(struct ldlm_pool *pl,
527 int nr, gfp_t gfp_mask)
529 struct ldlm_namespace *ns;
535 * Do not cancel locks in case lru resize is disabled for this ns.
537 if (!ns_connect_lru_resize(ns))
541 * Make sure that pool knows last SLV and Limit from obd.
543 ldlm_cli_pool_pop_slv(pl);
545 spin_lock(&ns->ns_lock);
546 unused = ns->ns_nr_unused;
547 spin_unlock(&ns->ns_lock);
550 return (unused / 100) * sysctl_vfs_cache_pressure;
552 return ldlm_cancel_lru(ns, nr, LCF_ASYNC, 0);
555 static struct ldlm_pool_ops ldlm_srv_pool_ops = {
556 .po_recalc = ldlm_srv_pool_recalc,
557 .po_shrink = ldlm_srv_pool_shrink,
558 .po_setup = ldlm_srv_pool_setup
561 static struct ldlm_pool_ops ldlm_cli_pool_ops = {
562 .po_recalc = ldlm_cli_pool_recalc,
563 .po_shrink = ldlm_cli_pool_shrink
567 * Pool recalc wrapper. Will call either client or server pool recalc callback
568 * depending what pool \a pl is used.
570 time64_t ldlm_pool_recalc(struct ldlm_pool *pl)
572 time64_t recalc_interval_sec;
575 recalc_interval_sec = ktime_get_real_seconds() - pl->pl_recalc_time;
576 if (recalc_interval_sec > 0) {
577 spin_lock(&pl->pl_lock);
578 recalc_interval_sec = ktime_get_real_seconds() -
581 if (recalc_interval_sec > 0) {
583 * Update pool statistics every 1s.
585 ldlm_pool_recalc_stats(pl);
588 * Zero out all rates and speed for the last period.
590 atomic_set(&pl->pl_grant_rate, 0);
591 atomic_set(&pl->pl_cancel_rate, 0);
593 spin_unlock(&pl->pl_lock);
596 if (pl->pl_ops->po_recalc != NULL) {
597 count = pl->pl_ops->po_recalc(pl);
598 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_RECALC_STAT,
602 recalc_interval_sec = pl->pl_recalc_time - ktime_get_real_seconds() +
603 pl->pl_recalc_period;
604 if (recalc_interval_sec <= 0) {
605 /* DEBUG: should be re-removed after LU-4536 is fixed */
606 CDEBUG(D_DLMTRACE, "%s: Negative interval(%lld), too short period(%lld)\n",
607 pl->pl_name, recalc_interval_sec,
608 (s64)pl->pl_recalc_period);
610 /* Prevent too frequent recalculation. */
611 recalc_interval_sec = 1;
614 return recalc_interval_sec;
618 * Pool shrink wrapper. Will call either client or server pool recalc callback
619 * depending what pool \a pl is used.
621 int ldlm_pool_shrink(struct ldlm_pool *pl, int nr, gfp_t gfp_mask)
625 if (pl->pl_ops->po_shrink != NULL) {
626 cancel = pl->pl_ops->po_shrink(pl, nr, gfp_mask);
628 lprocfs_counter_add(pl->pl_stats,
629 LDLM_POOL_SHRINK_REQTD_STAT,
631 lprocfs_counter_add(pl->pl_stats,
632 LDLM_POOL_SHRINK_FREED_STAT,
635 "%s: request to shrink %d locks, shrunk %d\n",
636 pl->pl_name, nr, cancel);
643 * Pool setup wrapper. Will call either client or server pool recalc callback
644 * depending what pool \a pl is used.
646 * Sets passed \a limit into pool \a pl.
648 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
650 if (pl->pl_ops->po_setup != NULL)
651 return pl->pl_ops->po_setup(pl, limit);
655 static int lprocfs_pool_state_seq_show(struct seq_file *m, void *unused)
657 int granted, grant_rate, cancel_rate, grant_step;
658 int grant_speed, grant_plan, lvf;
659 struct ldlm_pool *pl = m->private;
663 spin_lock(&pl->pl_lock);
664 slv = pl->pl_server_lock_volume;
665 clv = pl->pl_client_lock_volume;
666 limit = ldlm_pool_get_limit(pl);
667 grant_plan = pl->pl_grant_plan;
668 granted = ldlm_pool_granted(pl);
669 grant_rate = atomic_read(&pl->pl_grant_rate);
670 cancel_rate = atomic_read(&pl->pl_cancel_rate);
671 grant_speed = grant_rate - cancel_rate;
672 lvf = atomic_read(&pl->pl_lock_volume_factor);
673 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
674 spin_unlock(&pl->pl_lock);
676 seq_printf(m, "LDLM pool state (%s):\n"
680 pl->pl_name, slv, clv, lvf);
682 if (ns_is_server(ldlm_pl2ns(pl))) {
683 seq_printf(m, " GSP: %d%%\n", grant_step);
684 seq_printf(m, " GP: %d\n", grant_plan);
687 seq_printf(m, " GR: %d\n CR: %d\n GS: %d\n G: %d\n L: %d\n",
688 grant_rate, cancel_rate, grant_speed,
693 LDEBUGFS_SEQ_FOPS_RO(lprocfs_pool_state);
695 static ssize_t grant_speed_show(struct kobject *kobj, struct attribute *attr,
698 struct ldlm_pool *pl = container_of(kobj, struct ldlm_pool,
702 spin_lock(&pl->pl_lock);
703 /* serialize with ldlm_pool_recalc */
704 grant_speed = atomic_read(&pl->pl_grant_rate) -
705 atomic_read(&pl->pl_cancel_rate);
706 spin_unlock(&pl->pl_lock);
707 return sprintf(buf, "%d\n", grant_speed);
709 LUSTRE_RO_ATTR(grant_speed);
711 LDLM_POOL_SYSFS_READER_SHOW(grant_plan, int);
712 LUSTRE_RO_ATTR(grant_plan);
714 LDLM_POOL_SYSFS_READER_SHOW(recalc_period, int);
715 LDLM_POOL_SYSFS_WRITER_STORE(recalc_period, int);
716 LUSTRE_RW_ATTR(recalc_period);
718 LDLM_POOL_SYSFS_READER_NOLOCK_SHOW(server_lock_volume, u64);
719 LUSTRE_RO_ATTR(server_lock_volume);
721 LDLM_POOL_SYSFS_READER_NOLOCK_SHOW(limit, atomic);
722 LDLM_POOL_SYSFS_WRITER_NOLOCK_STORE(limit, atomic);
723 LUSTRE_RW_ATTR(limit);
725 LDLM_POOL_SYSFS_READER_NOLOCK_SHOW(granted, atomic);
726 LUSTRE_RO_ATTR(granted);
728 LDLM_POOL_SYSFS_READER_NOLOCK_SHOW(cancel_rate, atomic);
729 LUSTRE_RO_ATTR(cancel_rate);
731 LDLM_POOL_SYSFS_READER_NOLOCK_SHOW(grant_rate, atomic);
732 LUSTRE_RO_ATTR(grant_rate);
734 LDLM_POOL_SYSFS_READER_NOLOCK_SHOW(lock_volume_factor, atomic);
735 LDLM_POOL_SYSFS_WRITER_NOLOCK_STORE(lock_volume_factor, atomic);
736 LUSTRE_RW_ATTR(lock_volume_factor);
738 /* These are for pools in /sys/fs/lustre/ldlm/namespaces/.../pool */
739 static struct attribute *ldlm_pl_attrs[] = {
740 &lustre_attr_grant_speed.attr,
741 &lustre_attr_grant_plan.attr,
742 &lustre_attr_recalc_period.attr,
743 &lustre_attr_server_lock_volume.attr,
744 &lustre_attr_limit.attr,
745 &lustre_attr_granted.attr,
746 &lustre_attr_cancel_rate.attr,
747 &lustre_attr_grant_rate.attr,
748 &lustre_attr_lock_volume_factor.attr,
752 static void ldlm_pl_release(struct kobject *kobj)
754 struct ldlm_pool *pl = container_of(kobj, struct ldlm_pool,
756 complete(&pl->pl_kobj_unregister);
759 static struct kobj_type ldlm_pl_ktype = {
760 .default_attrs = ldlm_pl_attrs,
761 .sysfs_ops = &lustre_sysfs_ops,
762 .release = ldlm_pl_release,
765 static int ldlm_pool_sysfs_init(struct ldlm_pool *pl)
767 struct ldlm_namespace *ns = ldlm_pl2ns(pl);
770 init_completion(&pl->pl_kobj_unregister);
771 err = kobject_init_and_add(&pl->pl_kobj, &ldlm_pl_ktype, &ns->ns_kobj,
777 static int ldlm_pool_debugfs_init(struct ldlm_pool *pl)
779 struct ldlm_namespace *ns = ldlm_pl2ns(pl);
780 struct dentry *debugfs_ns_parent;
781 struct ldebugfs_vars pool_vars[2];
786 debugfs_ns_parent = ns->ns_debugfs_entry;
787 if (IS_ERR_OR_NULL(debugfs_ns_parent)) {
788 CERROR("%s: debugfs entry is not initialized\n",
790 GOTO(out, rc = -EINVAL);
792 pl->pl_debugfs_entry = debugfs_create_dir("pool", debugfs_ns_parent);
794 memset(pool_vars, 0, sizeof(pool_vars));
796 ldlm_add_var(&pool_vars[0], pl->pl_debugfs_entry, "state", pl,
797 &lprocfs_pool_state_fops);
799 pl->pl_stats = lprocfs_alloc_stats(LDLM_POOL_LAST_STAT -
800 LDLM_POOL_FIRST_STAT, 0);
802 GOTO(out, rc = -ENOMEM);
804 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
805 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
807 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_STAT,
808 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
810 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_STAT,
811 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
813 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
814 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
815 "grant_rate", "locks/s");
816 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
817 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
818 "cancel_rate", "locks/s");
819 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
820 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
821 "grant_plan", "locks/s");
822 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SLV_STAT,
823 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
825 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_REQTD_STAT,
826 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
827 "shrink_request", "locks");
828 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_FREED_STAT,
829 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
830 "shrink_freed", "locks");
831 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_RECALC_STAT,
832 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
833 "recalc_freed", "locks");
834 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_TIMING_STAT,
835 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
836 "recalc_timing", "sec");
837 debugfs_create_file("stats", 0644, pl->pl_debugfs_entry,
838 pl->pl_stats, &ldebugfs_stats_seq_fops);
845 static void ldlm_pool_sysfs_fini(struct ldlm_pool *pl)
847 kobject_put(&pl->pl_kobj);
848 wait_for_completion(&pl->pl_kobj_unregister);
851 static void ldlm_pool_debugfs_fini(struct ldlm_pool *pl)
853 if (pl->pl_stats != NULL) {
854 lprocfs_free_stats(&pl->pl_stats);
857 debugfs_remove_recursive(pl->pl_debugfs_entry);
858 pl->pl_debugfs_entry = NULL;
861 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
862 int idx, enum ldlm_side client)
868 spin_lock_init(&pl->pl_lock);
869 atomic_set(&pl->pl_granted, 0);
870 pl->pl_recalc_time = ktime_get_real_seconds();
871 atomic_set(&pl->pl_lock_volume_factor, 1);
873 atomic_set(&pl->pl_grant_rate, 0);
874 atomic_set(&pl->pl_cancel_rate, 0);
875 pl->pl_grant_plan = LDLM_POOL_GP(LDLM_POOL_HOST_L);
877 snprintf(pl->pl_name, sizeof(pl->pl_name), "ldlm-pool-%s-%d",
878 ldlm_ns_name(ns), idx);
880 if (client == LDLM_NAMESPACE_SERVER) {
881 pl->pl_ops = &ldlm_srv_pool_ops;
882 ldlm_pool_set_limit(pl, LDLM_POOL_HOST_L);
883 pl->pl_recalc_period = LDLM_POOL_SRV_DEF_RECALC_PERIOD;
884 pl->pl_server_lock_volume = ldlm_pool_slv_max(LDLM_POOL_HOST_L);
886 ldlm_pool_set_limit(pl, 1);
887 pl->pl_server_lock_volume = 0;
888 pl->pl_ops = &ldlm_cli_pool_ops;
889 pl->pl_recalc_period = LDLM_POOL_CLI_DEF_RECALC_PERIOD;
891 pl->pl_client_lock_volume = 0;
892 rc = ldlm_pool_debugfs_init(pl);
896 rc = ldlm_pool_sysfs_init(pl);
900 CDEBUG(D_DLMTRACE, "Lock pool %s is initialized\n", pl->pl_name);
905 void ldlm_pool_fini(struct ldlm_pool *pl)
908 ldlm_pool_sysfs_fini(pl);
909 ldlm_pool_debugfs_fini(pl);
912 * Pool should not be used after this point. We can't free it here as
913 * it lives in struct ldlm_namespace, but still interested in catching
914 * any abnormal using cases.
916 POISON(pl, 0x5a, sizeof(*pl));
921 * Add new taken ldlm lock \a lock into pool \a pl accounting.
923 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
926 * FLOCK locks are special in a sense that they are almost never
927 * cancelled, instead special kind of lock is used to drop them.
928 * also there is no LRU for flock locks, so no point in tracking
931 * PLAIN locks are used by config and quota, the quantity is small
932 * and usually they are not in LRU.
934 if (lock->l_resource->lr_type == LDLM_FLOCK ||
935 lock->l_resource->lr_type == LDLM_PLAIN)
938 ldlm_reclaim_add(lock);
940 atomic_inc(&pl->pl_granted);
941 atomic_inc(&pl->pl_grant_rate);
942 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_GRANT_STAT);
944 * Do not do pool recalc for client side as all locks which
945 * potentially may be canceled has already been packed into
946 * enqueue/cancel rpc. Also we do not want to run out of stack
947 * with too long call paths.
949 if (ns_is_server(ldlm_pl2ns(pl)))
950 ldlm_pool_recalc(pl);
954 * Remove ldlm lock \a lock from pool \a pl accounting.
956 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
959 * Filter out FLOCK & PLAIN locks. Read above comment in
962 if (lock->l_resource->lr_type == LDLM_FLOCK ||
963 lock->l_resource->lr_type == LDLM_PLAIN)
966 ldlm_reclaim_del(lock);
968 LASSERT(atomic_read(&pl->pl_granted) > 0);
969 atomic_dec(&pl->pl_granted);
970 atomic_inc(&pl->pl_cancel_rate);
972 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_CANCEL_STAT);
974 if (ns_is_server(ldlm_pl2ns(pl)))
975 ldlm_pool_recalc(pl);
979 * Returns current \a pl SLV.
981 * \pre ->pl_lock is not locked.
983 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
987 spin_lock(&pl->pl_lock);
988 slv = pl->pl_server_lock_volume;
989 spin_unlock(&pl->pl_lock);
994 * Sets passed \a slv to \a pl.
996 * \pre ->pl_lock is not locked.
998 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
1000 spin_lock(&pl->pl_lock);
1001 pl->pl_server_lock_volume = slv;
1002 spin_unlock(&pl->pl_lock);
1006 * Returns current \a pl CLV.
1008 * \pre ->pl_lock is not locked.
1010 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
1014 spin_lock(&pl->pl_lock);
1015 slv = pl->pl_client_lock_volume;
1016 spin_unlock(&pl->pl_lock);
1021 * Sets passed \a clv to \a pl.
1023 * \pre ->pl_lock is not locked.
1025 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1027 spin_lock(&pl->pl_lock);
1028 pl->pl_client_lock_volume = clv;
1029 spin_unlock(&pl->pl_lock);
1033 * Returns current \a pl limit.
1035 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1037 return atomic_read(&pl->pl_limit);
1041 * Sets passed \a limit to \a pl.
1043 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1045 atomic_set(&pl->pl_limit, limit);
1049 * Returns current LVF from \a pl.
1051 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1053 return atomic_read(&pl->pl_lock_volume_factor);
1056 static struct shrinker *ldlm_pools_srv_shrinker;
1057 static struct shrinker *ldlm_pools_cli_shrinker;
1060 * count locks from all namespaces (if possible). Returns number of
1063 static unsigned long ldlm_pools_count(enum ldlm_side client, gfp_t gfp_mask)
1065 unsigned long total = 0;
1067 struct ldlm_namespace *ns;
1068 struct ldlm_namespace *ns_old = NULL; /* loop detection */
1070 if (client == LDLM_NAMESPACE_CLIENT && !(gfp_mask & __GFP_FS))
1074 * Find out how many resources we may release.
1076 for (nr_ns = ldlm_namespace_nr_read(client);
1077 nr_ns > 0; nr_ns--) {
1078 mutex_lock(ldlm_namespace_lock(client));
1079 if (list_empty(ldlm_namespace_list(client))) {
1080 mutex_unlock(ldlm_namespace_lock(client));
1083 ns = ldlm_namespace_first_locked(client);
1086 mutex_unlock(ldlm_namespace_lock(client));
1090 if (ldlm_ns_empty(ns)) {
1091 ldlm_namespace_move_to_inactive_locked(ns, client);
1092 mutex_unlock(ldlm_namespace_lock(client));
1099 ldlm_namespace_get(ns);
1100 ldlm_namespace_move_to_active_locked(ns, client);
1101 mutex_unlock(ldlm_namespace_lock(client));
1102 total += ldlm_pool_shrink(&ns->ns_pool, 0, gfp_mask);
1103 ldlm_namespace_put(ns);
1109 static unsigned long ldlm_pools_scan(enum ldlm_side client, int nr,
1112 unsigned long freed = 0;
1114 struct ldlm_namespace *ns;
1116 if (client == LDLM_NAMESPACE_CLIENT && !(gfp_mask & __GFP_FS))
1120 * Shrink at least ldlm_namespace_nr_read(client) namespaces.
1122 for (tmp = nr_ns = ldlm_namespace_nr_read(client);
1124 int cancel, nr_locks;
1127 * Do not call shrink under ldlm_namespace_lock(client)
1129 mutex_lock(ldlm_namespace_lock(client));
1130 if (list_empty(ldlm_namespace_list(client))) {
1131 mutex_unlock(ldlm_namespace_lock(client));
1134 ns = ldlm_namespace_first_locked(client);
1135 ldlm_namespace_get(ns);
1136 ldlm_namespace_move_to_active_locked(ns, client);
1137 mutex_unlock(ldlm_namespace_lock(client));
1139 nr_locks = ldlm_pool_granted(&ns->ns_pool);
1141 * We use to shrink propotionally but with new shrinker API,
1142 * we lost the total number of freeable locks.
1144 cancel = 1 + min_t(int, nr_locks, nr / nr_ns);
1145 freed += ldlm_pool_shrink(&ns->ns_pool, cancel, gfp_mask);
1146 ldlm_namespace_put(ns);
1149 * we only decrease the SLV in server pools shrinker, return
1150 * SHRINK_STOP to kernel to avoid needless loop. LU-1128
1152 return (client == LDLM_NAMESPACE_SERVER) ? SHRINK_STOP : freed;
1155 #ifdef HAVE_SHRINKER_COUNT
1156 static unsigned long ldlm_pools_srv_count(struct shrinker *s,
1157 struct shrink_control *sc)
1159 return ldlm_pools_count(LDLM_NAMESPACE_SERVER, sc->gfp_mask);
1162 static unsigned long ldlm_pools_srv_scan(struct shrinker *s,
1163 struct shrink_control *sc)
1165 return ldlm_pools_scan(LDLM_NAMESPACE_SERVER, sc->nr_to_scan,
1169 static unsigned long ldlm_pools_cli_count(struct shrinker *s,
1170 struct shrink_control *sc)
1172 return ldlm_pools_count(LDLM_NAMESPACE_CLIENT, sc->gfp_mask);
1175 static unsigned long ldlm_pools_cli_scan(struct shrinker *s,
1176 struct shrink_control *sc)
1178 return ldlm_pools_scan(LDLM_NAMESPACE_CLIENT, sc->nr_to_scan,
1184 * Cancel \a nr locks from all namespaces (if possible). Returns number of
1185 * cached locks after shrink is finished. All namespaces are asked to
1186 * cancel approximately equal amount of locks to keep balancing.
1188 static int ldlm_pools_shrink(enum ldlm_side client, int nr, gfp_t gfp_mask)
1190 unsigned long total = 0;
1192 if (client == LDLM_NAMESPACE_CLIENT && nr != 0 &&
1193 !(gfp_mask & __GFP_FS))
1196 total = ldlm_pools_count(client, gfp_mask);
1198 if (nr == 0 || total == 0)
1201 return ldlm_pools_scan(client, nr, gfp_mask);
1204 static int ldlm_pools_srv_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
1206 return ldlm_pools_shrink(LDLM_NAMESPACE_SERVER,
1207 shrink_param(sc, nr_to_scan),
1208 shrink_param(sc, gfp_mask));
1211 static int ldlm_pools_cli_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
1213 return ldlm_pools_shrink(LDLM_NAMESPACE_CLIENT,
1214 shrink_param(sc, nr_to_scan),
1215 shrink_param(sc, gfp_mask));
1218 #endif /* HAVE_SHRINKER_COUNT */
1220 static time64_t ldlm_pools_recalc_delay(enum ldlm_side side)
1222 struct ldlm_namespace *ns;
1223 struct ldlm_namespace *ns_old = NULL;
1224 /* seconds of sleep if no active namespaces */
1225 time64_t delay = side == LDLM_NAMESPACE_SERVER ?
1226 LDLM_POOL_SRV_DEF_RECALC_PERIOD :
1227 LDLM_POOL_CLI_DEF_RECALC_PERIOD;
1230 /* Recalc at least ldlm_namespace_nr(side) namespaces. */
1231 for (nr = ldlm_namespace_nr_read(side); nr > 0; nr--) {
1234 * Lock the list, get first @ns in the list, getref, move it
1235 * to the tail, unlock and call pool recalc. This way we avoid
1236 * calling recalc under @ns lock, which is really good as we
1237 * get rid of potential deadlock on side nodes when canceling
1238 * locks synchronously.
1240 mutex_lock(ldlm_namespace_lock(side));
1241 if (list_empty(ldlm_namespace_list(side))) {
1242 mutex_unlock(ldlm_namespace_lock(side));
1245 ns = ldlm_namespace_first_locked(side);
1247 if (ns_old == ns) { /* Full pass complete */
1248 mutex_unlock(ldlm_namespace_lock(side));
1252 /* We got an empty namespace, need to move it back to inactive
1254 * The race with parallel resource creation is fine:
1255 * - If they do namespace_get before our check, we fail the
1256 * check and they move this item to the end of the list anyway
1257 * - If we do the check and then they do namespace_get, then
1258 * we move the namespace to inactive and they will move
1259 * it back to active (synchronised by the lock, so no clash
1262 if (ldlm_ns_empty(ns)) {
1263 ldlm_namespace_move_to_inactive_locked(ns, side);
1264 mutex_unlock(ldlm_namespace_lock(side));
1271 spin_lock(&ns->ns_lock);
1273 * skip ns which is being freed, and we don't want to increase
1274 * its refcount again, not even temporarily. bz21519 & LU-499.
1276 if (ns->ns_stopping) {
1280 ldlm_namespace_get(ns);
1282 spin_unlock(&ns->ns_lock);
1284 ldlm_namespace_move_to_active_locked(ns, side);
1285 mutex_unlock(ldlm_namespace_lock(side));
1288 * After setup is done - recalc the pool.
1291 delay = min(delay, ldlm_pool_recalc(&ns->ns_pool));
1292 ldlm_namespace_put(ns);
1299 static void ldlm_pools_recalc_task(struct work_struct *ws);
1300 static DECLARE_DELAYED_WORK(ldlm_pools_recalc_work, ldlm_pools_recalc_task);
1302 static void ldlm_pools_recalc_task(struct work_struct *ws)
1304 /* seconds of sleep if no active namespaces */
1306 #ifdef HAVE_SERVER_SUPPORT
1307 struct ldlm_namespace *ns;
1308 unsigned long nr_l = 0, nr_p = 0, l;
1311 /* Check all modest namespaces first. */
1312 mutex_lock(ldlm_namespace_lock(LDLM_NAMESPACE_SERVER));
1313 list_for_each_entry(ns, ldlm_namespace_list(LDLM_NAMESPACE_SERVER),
1315 if (ns->ns_appetite != LDLM_NAMESPACE_MODEST)
1318 l = ldlm_pool_granted(&ns->ns_pool);
1323 * Set the modest pools limit equal to their avg granted
1326 l += dru(l, LDLM_POOLS_MODEST_MARGIN_SHIFT, 0);
1327 ldlm_pool_setup(&ns->ns_pool, l);
1333 * Make sure than modest namespaces did not eat more that 2/3
1336 if (nr_l >= 2 * (LDLM_POOL_HOST_L / 3)) {
1337 CWARN("'Modest' pools eat out 2/3 of server locks limit (%lu of %lu). This means that you have too many clients for this amount of server RAM. Upgrade server!\n",
1338 nr_l, LDLM_POOL_HOST_L);
1342 /* The rest is given to greedy namespaces. */
1343 list_for_each_entry(ns, ldlm_namespace_list(LDLM_NAMESPACE_SERVER),
1345 if (!equal && ns->ns_appetite != LDLM_NAMESPACE_GREEDY)
1350 * In the case 2/3 locks are eaten out by
1351 * modest pools, we re-setup equal limit
1354 l = LDLM_POOL_HOST_L /
1355 ldlm_namespace_nr_read(LDLM_NAMESPACE_SERVER);
1358 * All the rest of greedy pools will have
1359 * all locks in equal parts.
1361 l = (LDLM_POOL_HOST_L - nr_l) /
1362 (ldlm_namespace_nr_read(LDLM_NAMESPACE_SERVER) -
1365 ldlm_pool_setup(&ns->ns_pool, l);
1367 mutex_unlock(ldlm_namespace_lock(LDLM_NAMESPACE_SERVER));
1369 delay = min(ldlm_pools_recalc_delay(LDLM_NAMESPACE_SERVER),
1370 ldlm_pools_recalc_delay(LDLM_NAMESPACE_CLIENT));
1371 #else /* !HAVE_SERVER_SUPPORT */
1372 delay = ldlm_pools_recalc_delay(LDLM_NAMESPACE_CLIENT);
1373 #endif /* HAVE_SERVER_SUPPORT */
1375 /* Wake up the blocking threads from time to time. */
1376 ldlm_bl_thread_wakeup();
1378 schedule_delayed_work(&ldlm_pools_recalc_work, cfs_time_seconds(delay));
1381 int ldlm_pools_init(void)
1383 DEF_SHRINKER_VAR(shsvar, ldlm_pools_srv_shrink,
1384 ldlm_pools_srv_count, ldlm_pools_srv_scan);
1385 DEF_SHRINKER_VAR(shcvar, ldlm_pools_cli_shrink,
1386 ldlm_pools_cli_count, ldlm_pools_cli_scan);
1388 schedule_delayed_work(&ldlm_pools_recalc_work,
1389 LDLM_POOL_CLI_DEF_RECALC_PERIOD);
1390 ldlm_pools_srv_shrinker = set_shrinker(DEFAULT_SEEKS, &shsvar);
1391 ldlm_pools_cli_shrinker = set_shrinker(DEFAULT_SEEKS, &shcvar);
1396 void ldlm_pools_fini(void)
1398 if (ldlm_pools_srv_shrinker != NULL) {
1399 remove_shrinker(ldlm_pools_srv_shrinker);
1400 ldlm_pools_srv_shrinker = NULL;
1402 if (ldlm_pools_cli_shrinker != NULL) {
1403 remove_shrinker(ldlm_pools_cli_shrinker);
1404 ldlm_pools_cli_shrinker = NULL;
1406 cancel_delayed_work_sync(&ldlm_pools_recalc_work);
1409 #else /* !HAVE_LRU_RESIZE_SUPPORT */
1410 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
1415 time64_t ldlm_pool_recalc(struct ldlm_pool *pl)
1420 int ldlm_pool_shrink(struct ldlm_pool *pl,
1421 int nr, gfp_t gfp_mask)
1426 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
1427 int idx, enum ldlm_side client)
1432 void ldlm_pool_fini(struct ldlm_pool *pl)
1437 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
1442 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
1447 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
1452 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
1457 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
1462 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1467 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1472 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1477 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1482 int ldlm_pools_init(void)
1487 void ldlm_pools_fini(void)
1492 #endif /* HAVE_LRU_RESIZE_SUPPORT */