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 (c) 2007, 2010, Oracle and/or its affiliates. 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_SHIFT (2)
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 * The granularity of SLV calculation.
148 #define LDLM_POOL_SLV_SHIFT (10)
151 extern cfs_proc_dir_entry_t *ldlm_ns_proc_dir;
154 static inline __u64 dru(__u64 val, __u32 shift, int round_up)
156 return (val + (round_up ? (1 << shift) - 1 : 0)) >> shift;
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 = (__u64)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(unsigned int t)
202 * This yields 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 period 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 in short 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 (t >> LDLM_POOL_GSP_STEP_SHIFT));
227 * Recalculates next grant limit on passed \a pl.
229 * \pre ->pl_lock is locked.
231 static 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 = cfs_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;
241 limit = (limit * 5) >> 2;
242 if (pl->pl_grant_plan > limit)
243 pl->pl_grant_plan = limit;
247 * Recalculates next SLV on passed \a pl.
249 * \pre ->pl_lock is locked.
251 static void ldlm_pool_recalc_slv(struct ldlm_pool *pl)
261 slv = pl->pl_server_lock_volume;
262 grant_plan = pl->pl_grant_plan;
263 limit = ldlm_pool_get_limit(pl);
264 granted = cfs_atomic_read(&pl->pl_granted);
265 round_up = granted < limit;
267 grant_usage = max_t(int, limit - (granted - grant_plan), 1);
270 * Find out SLV change factor which is the ratio of grant usage
271 * from limit. SLV changes as fast as the ratio of grant plan
272 * consumption. The more locks from grant plan are not consumed
273 * by clients in last interval (idle time), the faster grows
274 * SLV. And the opposite, the more grant plan is over-consumed
275 * (load time) the faster drops SLV.
277 slv_factor = (grant_usage << LDLM_POOL_SLV_SHIFT);
278 do_div(slv_factor, limit);
279 slv = slv * slv_factor;
280 slv = dru(slv, LDLM_POOL_SLV_SHIFT, round_up);
282 if (slv > ldlm_pool_slv_max(limit)) {
283 slv = ldlm_pool_slv_max(limit);
284 } else if (slv < ldlm_pool_slv_min(limit)) {
285 slv = ldlm_pool_slv_min(limit);
288 pl->pl_server_lock_volume = slv;
292 * Recalculates next stats on passed \a pl.
294 * \pre ->pl_lock is locked.
296 static void ldlm_pool_recalc_stats(struct ldlm_pool *pl)
298 int grant_plan = pl->pl_grant_plan;
299 __u64 slv = pl->pl_server_lock_volume;
300 int granted = cfs_atomic_read(&pl->pl_granted);
301 int grant_rate = cfs_atomic_read(&pl->pl_grant_rate);
302 int cancel_rate = cfs_atomic_read(&pl->pl_cancel_rate);
304 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_SLV_STAT,
306 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
308 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
310 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
312 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
317 * Sets current SLV into obd accessible via ldlm_pl2ns(pl)->ns_obd.
319 static void ldlm_srv_pool_push_slv(struct ldlm_pool *pl)
321 struct obd_device *obd;
324 * Set new SLV in obd field for using it later without accessing the
325 * pool. This is required to avoid race between sending reply to client
326 * with new SLV and cleanup server stack in which we can't guarantee
327 * that namespace is still alive. We know only that obd is alive as
328 * long as valid export is alive.
330 obd = ldlm_pl2ns(pl)->ns_obd;
331 LASSERT(obd != NULL);
332 cfs_write_lock(&obd->obd_pool_lock);
333 obd->obd_pool_slv = pl->pl_server_lock_volume;
334 cfs_write_unlock(&obd->obd_pool_lock);
338 * Recalculates all pool fields on passed \a pl.
340 * \pre ->pl_lock is not locked.
342 static int ldlm_srv_pool_recalc(struct ldlm_pool *pl)
344 time_t recalc_interval_sec;
347 cfs_spin_lock(&pl->pl_lock);
348 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
349 if (recalc_interval_sec >= pl->pl_recalc_period) {
351 * Recalc SLV after last period. This should be done
352 * _before_ recalculating new grant plan.
354 ldlm_pool_recalc_slv(pl);
357 * Make sure that pool informed obd of last SLV changes.
359 ldlm_srv_pool_push_slv(pl);
362 * Update grant_plan for new period.
364 ldlm_pool_recalc_grant_plan(pl);
366 pl->pl_recalc_time = cfs_time_current_sec();
367 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
368 recalc_interval_sec);
371 cfs_spin_unlock(&pl->pl_lock);
376 * This function is used on server side as main entry point for memory
377 * pressure handling. It decreases SLV on \a pl according to passed
378 * \a nr and \a gfp_mask.
380 * Our goal here is to decrease SLV such a way that clients hold \a nr
381 * locks smaller in next 10h.
383 static int ldlm_srv_pool_shrink(struct ldlm_pool *pl,
384 int nr, unsigned int gfp_mask)
389 * VM is asking how many entries may be potentially freed.
392 return cfs_atomic_read(&pl->pl_granted);
395 * Client already canceled locks but server is already in shrinker
396 * and can't cancel anything. Let's catch this race.
398 if (cfs_atomic_read(&pl->pl_granted) == 0)
401 cfs_spin_lock(&pl->pl_lock);
404 * We want shrinker to possibly cause cancellation of @nr locks from
405 * clients or grant approximately @nr locks smaller next intervals.
407 * This is why we decreased SLV by @nr. This effect will only be as
408 * long as one re-calc interval (1s these days) and this should be
409 * enough to pass this decreased SLV to all clients. On next recalc
410 * interval pool will either increase SLV if locks load is not high
411 * or will keep on same level or even decrease again, thus, shrinker
412 * decreased SLV will affect next recalc intervals and this way will
413 * make locking load lower.
415 if (nr < pl->pl_server_lock_volume) {
416 pl->pl_server_lock_volume = pl->pl_server_lock_volume - nr;
418 limit = ldlm_pool_get_limit(pl);
419 pl->pl_server_lock_volume = ldlm_pool_slv_min(limit);
423 * Make sure that pool informed obd of last SLV changes.
425 ldlm_srv_pool_push_slv(pl);
426 cfs_spin_unlock(&pl->pl_lock);
429 * We did not really free any memory here so far, it only will be
430 * freed later may be, so that we return 0 to not confuse VM.
436 * Setup server side pool \a pl with passed \a limit.
438 static int ldlm_srv_pool_setup(struct ldlm_pool *pl, int limit)
440 struct obd_device *obd;
442 obd = ldlm_pl2ns(pl)->ns_obd;
443 LASSERT(obd != NULL && obd != LP_POISON);
444 LASSERT(obd->obd_type != LP_POISON);
445 cfs_write_lock(&obd->obd_pool_lock);
446 obd->obd_pool_limit = limit;
447 cfs_write_unlock(&obd->obd_pool_lock);
449 ldlm_pool_set_limit(pl, limit);
454 * Sets SLV and Limit from ldlm_pl2ns(pl)->ns_obd tp passed \a pl.
456 static void ldlm_cli_pool_pop_slv(struct ldlm_pool *pl)
458 struct obd_device *obd;
461 * Get new SLV and Limit from obd which is updated with coming
464 obd = ldlm_pl2ns(pl)->ns_obd;
465 LASSERT(obd != NULL);
466 cfs_read_lock(&obd->obd_pool_lock);
467 pl->pl_server_lock_volume = obd->obd_pool_slv;
468 ldlm_pool_set_limit(pl, obd->obd_pool_limit);
469 cfs_read_unlock(&obd->obd_pool_lock);
473 * Recalculates client size pool \a pl according to current SLV and Limit.
475 static int ldlm_cli_pool_recalc(struct ldlm_pool *pl)
477 time_t recalc_interval_sec;
480 cfs_spin_lock(&pl->pl_lock);
482 * Check if we need to recalc lists now.
484 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
485 if (recalc_interval_sec < pl->pl_recalc_period) {
486 cfs_spin_unlock(&pl->pl_lock);
491 * Make sure that pool knows last SLV and Limit from obd.
493 ldlm_cli_pool_pop_slv(pl);
495 pl->pl_recalc_time = cfs_time_current_sec();
496 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
497 recalc_interval_sec);
498 cfs_spin_unlock(&pl->pl_lock);
501 * Do not cancel locks in case lru resize is disabled for this ns.
503 if (!ns_connect_lru_resize(ldlm_pl2ns(pl)))
507 * In the time of canceling locks on client we do not need to maintain
508 * sharp timing, we only want to cancel locks asap according to new SLV.
509 * It may be called when SLV has changed much, this is why we do not
510 * take into account pl->pl_recalc_time here.
512 RETURN(ldlm_cancel_lru(ldlm_pl2ns(pl), 0, LDLM_SYNC,
517 * This function is main entry point for memory pressure handling on client
518 * side. Main goal of this function is to cancel some number of locks on
519 * passed \a pl according to \a nr and \a gfp_mask.
521 static int ldlm_cli_pool_shrink(struct ldlm_pool *pl,
522 int nr, unsigned int gfp_mask)
524 struct ldlm_namespace *ns;
525 int canceled = 0, unused;
530 * Do not cancel locks in case lru resize is disabled for this ns.
532 if (!ns_connect_lru_resize(ns))
536 * Make sure that pool knows last SLV and Limit from obd.
538 ldlm_cli_pool_pop_slv(pl);
540 cfs_spin_lock(&ns->ns_unused_lock);
541 unused = ns->ns_nr_unused;
542 cfs_spin_unlock(&ns->ns_unused_lock);
545 canceled = ldlm_cancel_lru(ns, nr, LDLM_SYNC,
550 * Return the number of potentially reclaimable locks.
552 return ((unused - canceled) / 100) * sysctl_vfs_cache_pressure;
554 return unused - canceled;
558 struct ldlm_pool_ops ldlm_srv_pool_ops = {
559 .po_recalc = ldlm_srv_pool_recalc,
560 .po_shrink = ldlm_srv_pool_shrink,
561 .po_setup = ldlm_srv_pool_setup
564 struct ldlm_pool_ops ldlm_cli_pool_ops = {
565 .po_recalc = ldlm_cli_pool_recalc,
566 .po_shrink = ldlm_cli_pool_shrink
570 * Pool recalc wrapper. Will call either client or server pool recalc callback
571 * depending what pool \a pl is used.
573 int ldlm_pool_recalc(struct ldlm_pool *pl)
575 time_t recalc_interval_sec;
578 cfs_spin_lock(&pl->pl_lock);
579 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
580 if (recalc_interval_sec > 0) {
582 * Update pool statistics every 1s.
584 ldlm_pool_recalc_stats(pl);
587 * Zero out all rates and speed for the last period.
589 cfs_atomic_set(&pl->pl_grant_rate, 0);
590 cfs_atomic_set(&pl->pl_cancel_rate, 0);
591 cfs_atomic_set(&pl->pl_grant_speed, 0);
593 cfs_spin_unlock(&pl->pl_lock);
595 if (pl->pl_ops->po_recalc != NULL) {
596 count = pl->pl_ops->po_recalc(pl);
597 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_RECALC_STAT,
604 EXPORT_SYMBOL(ldlm_pool_recalc);
607 * Pool shrink wrapper. Will call either client or server pool recalc callback
608 * depending what pool \a pl is used.
610 int ldlm_pool_shrink(struct ldlm_pool *pl, int nr,
611 unsigned int gfp_mask)
615 if (pl->pl_ops->po_shrink != NULL) {
616 cancel = pl->pl_ops->po_shrink(pl, nr, gfp_mask);
618 lprocfs_counter_add(pl->pl_stats,
619 LDLM_POOL_SHRINK_REQTD_STAT,
621 lprocfs_counter_add(pl->pl_stats,
622 LDLM_POOL_SHRINK_FREED_STAT,
624 CDEBUG(D_DLMTRACE, "%s: request to shrink %d locks, "
625 "shrunk %d\n", pl->pl_name, nr, cancel);
630 EXPORT_SYMBOL(ldlm_pool_shrink);
633 * Pool setup wrapper. Will call either client or server pool recalc callback
634 * depending what pool \a pl is used.
636 * Sets passed \a limit into pool \a pl.
638 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
640 if (pl->pl_ops->po_setup != NULL)
641 return(pl->pl_ops->po_setup(pl, limit));
644 EXPORT_SYMBOL(ldlm_pool_setup);
647 static int lprocfs_rd_pool_state(char *page, char **start, off_t off,
648 int count, int *eof, void *data)
650 int granted, grant_rate, cancel_rate, grant_step;
651 int nr = 0, grant_speed, grant_plan, lvf;
652 struct ldlm_pool *pl = data;
656 cfs_spin_lock(&pl->pl_lock);
657 slv = pl->pl_server_lock_volume;
658 clv = pl->pl_client_lock_volume;
659 limit = ldlm_pool_get_limit(pl);
660 grant_plan = pl->pl_grant_plan;
661 granted = cfs_atomic_read(&pl->pl_granted);
662 grant_rate = cfs_atomic_read(&pl->pl_grant_rate);
663 lvf = cfs_atomic_read(&pl->pl_lock_volume_factor);
664 grant_speed = cfs_atomic_read(&pl->pl_grant_speed);
665 cancel_rate = cfs_atomic_read(&pl->pl_cancel_rate);
666 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
667 cfs_spin_unlock(&pl->pl_lock);
669 nr += snprintf(page + nr, count - nr, "LDLM pool state (%s):\n",
671 nr += snprintf(page + nr, count - nr, " SLV: "LPU64"\n", slv);
672 nr += snprintf(page + nr, count - nr, " CLV: "LPU64"\n", clv);
673 nr += snprintf(page + nr, count - nr, " LVF: %d\n", lvf);
675 if (ns_is_server(ldlm_pl2ns(pl))) {
676 nr += snprintf(page + nr, count - nr, " GSP: %d%%\n",
678 nr += snprintf(page + nr, count - nr, " GP: %d\n",
681 nr += snprintf(page + nr, count - nr, " GR: %d\n",
683 nr += snprintf(page + nr, count - nr, " CR: %d\n",
685 nr += snprintf(page + nr, count - nr, " GS: %d\n",
687 nr += snprintf(page + nr, count - nr, " G: %d\n",
689 nr += snprintf(page + nr, count - nr, " L: %d\n",
694 LDLM_POOL_PROC_READER(grant_plan, int);
695 LDLM_POOL_PROC_READER(recalc_period, int);
696 LDLM_POOL_PROC_WRITER(recalc_period, int);
698 static int ldlm_pool_proc_init(struct ldlm_pool *pl)
700 struct ldlm_namespace *ns = ldlm_pl2ns(pl);
701 struct proc_dir_entry *parent_ns_proc;
702 struct lprocfs_vars pool_vars[2];
703 char *var_name = NULL;
707 OBD_ALLOC(var_name, MAX_STRING_SIZE + 1);
711 parent_ns_proc = lprocfs_srch(ldlm_ns_proc_dir, ns->ns_name);
712 if (parent_ns_proc == NULL) {
713 CERROR("%s: proc entry is not initialized\n",
715 GOTO(out_free_name, rc = -EINVAL);
717 pl->pl_proc_dir = lprocfs_register("pool", parent_ns_proc,
719 if (IS_ERR(pl->pl_proc_dir)) {
720 CERROR("LProcFS failed in ldlm-pool-init\n");
721 rc = PTR_ERR(pl->pl_proc_dir);
722 GOTO(out_free_name, rc);
725 var_name[MAX_STRING_SIZE] = '\0';
726 memset(pool_vars, 0, sizeof(pool_vars));
727 pool_vars[0].name = var_name;
729 snprintf(var_name, MAX_STRING_SIZE, "server_lock_volume");
730 pool_vars[0].data = &pl->pl_server_lock_volume;
731 pool_vars[0].read_fptr = lprocfs_rd_u64;
732 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
734 snprintf(var_name, MAX_STRING_SIZE, "limit");
735 pool_vars[0].data = &pl->pl_limit;
736 pool_vars[0].read_fptr = lprocfs_rd_atomic;
737 pool_vars[0].write_fptr = lprocfs_wr_atomic;
738 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
740 snprintf(var_name, MAX_STRING_SIZE, "granted");
741 pool_vars[0].data = &pl->pl_granted;
742 pool_vars[0].read_fptr = lprocfs_rd_atomic;
743 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
745 snprintf(var_name, MAX_STRING_SIZE, "grant_speed");
746 pool_vars[0].data = &pl->pl_grant_speed;
747 pool_vars[0].read_fptr = lprocfs_rd_atomic;
748 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
750 snprintf(var_name, MAX_STRING_SIZE, "cancel_rate");
751 pool_vars[0].data = &pl->pl_cancel_rate;
752 pool_vars[0].read_fptr = lprocfs_rd_atomic;
753 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
755 snprintf(var_name, MAX_STRING_SIZE, "grant_rate");
756 pool_vars[0].data = &pl->pl_grant_rate;
757 pool_vars[0].read_fptr = lprocfs_rd_atomic;
758 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
760 snprintf(var_name, MAX_STRING_SIZE, "grant_plan");
761 pool_vars[0].data = pl;
762 pool_vars[0].read_fptr = lprocfs_rd_grant_plan;
763 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
765 snprintf(var_name, MAX_STRING_SIZE, "recalc_period");
766 pool_vars[0].data = pl;
767 pool_vars[0].read_fptr = lprocfs_rd_recalc_period;
768 pool_vars[0].write_fptr = lprocfs_wr_recalc_period;
769 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
771 snprintf(var_name, MAX_STRING_SIZE, "lock_volume_factor");
772 pool_vars[0].data = &pl->pl_lock_volume_factor;
773 pool_vars[0].read_fptr = lprocfs_rd_atomic;
774 pool_vars[0].write_fptr = lprocfs_wr_atomic;
775 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
777 snprintf(var_name, MAX_STRING_SIZE, "state");
778 pool_vars[0].data = pl;
779 pool_vars[0].read_fptr = lprocfs_rd_pool_state;
780 lprocfs_add_vars(pl->pl_proc_dir, pool_vars, 0);
782 pl->pl_stats = lprocfs_alloc_stats(LDLM_POOL_LAST_STAT -
783 LDLM_POOL_FIRST_STAT, 0);
785 GOTO(out_free_name, rc = -ENOMEM);
787 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
788 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
790 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_STAT,
791 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
793 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_STAT,
794 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
796 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
797 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
798 "grant_rate", "locks/s");
799 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
800 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
801 "cancel_rate", "locks/s");
802 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
803 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
804 "grant_plan", "locks/s");
805 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SLV_STAT,
806 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
808 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_REQTD_STAT,
809 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
810 "shrink_request", "locks");
811 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_FREED_STAT,
812 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
813 "shrink_freed", "locks");
814 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_RECALC_STAT,
815 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
816 "recalc_freed", "locks");
817 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_TIMING_STAT,
818 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
819 "recalc_timing", "sec");
820 lprocfs_register_stats(pl->pl_proc_dir, "stats", pl->pl_stats);
824 OBD_FREE(var_name, MAX_STRING_SIZE + 1);
828 static void ldlm_pool_proc_fini(struct ldlm_pool *pl)
830 if (pl->pl_stats != NULL) {
831 lprocfs_free_stats(&pl->pl_stats);
834 if (pl->pl_proc_dir != NULL) {
835 lprocfs_remove(&pl->pl_proc_dir);
836 pl->pl_proc_dir = NULL;
839 #else /* !__KERNEL__*/
840 #define ldlm_pool_proc_init(pl) (0)
841 #define ldlm_pool_proc_fini(pl) while (0) {}
844 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
845 int idx, ldlm_side_t client)
850 cfs_spin_lock_init(&pl->pl_lock);
851 cfs_atomic_set(&pl->pl_granted, 0);
852 pl->pl_recalc_time = cfs_time_current_sec();
853 cfs_atomic_set(&pl->pl_lock_volume_factor, 1);
855 cfs_atomic_set(&pl->pl_grant_rate, 0);
856 cfs_atomic_set(&pl->pl_cancel_rate, 0);
857 cfs_atomic_set(&pl->pl_grant_speed, 0);
858 pl->pl_grant_plan = LDLM_POOL_GP(LDLM_POOL_HOST_L);
860 snprintf(pl->pl_name, sizeof(pl->pl_name), "ldlm-pool-%s-%d",
863 if (client == LDLM_NAMESPACE_SERVER) {
864 pl->pl_ops = &ldlm_srv_pool_ops;
865 ldlm_pool_set_limit(pl, LDLM_POOL_HOST_L);
866 pl->pl_recalc_period = LDLM_POOL_SRV_DEF_RECALC_PERIOD;
867 pl->pl_server_lock_volume = ldlm_pool_slv_max(LDLM_POOL_HOST_L);
869 ldlm_pool_set_limit(pl, 1);
870 pl->pl_server_lock_volume = 0;
871 pl->pl_ops = &ldlm_cli_pool_ops;
872 pl->pl_recalc_period = LDLM_POOL_CLI_DEF_RECALC_PERIOD;
874 pl->pl_client_lock_volume = 0;
875 rc = ldlm_pool_proc_init(pl);
879 CDEBUG(D_DLMTRACE, "Lock pool %s is initialized\n", pl->pl_name);
883 EXPORT_SYMBOL(ldlm_pool_init);
885 void ldlm_pool_fini(struct ldlm_pool *pl)
888 ldlm_pool_proc_fini(pl);
891 * Pool should not be used after this point. We can't free it here as
892 * it lives in struct ldlm_namespace, but still interested in catching
893 * any abnormal using cases.
895 POISON(pl, 0x5a, sizeof(*pl));
898 EXPORT_SYMBOL(ldlm_pool_fini);
901 * Add new taken ldlm lock \a lock into pool \a pl accounting.
903 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
906 * FLOCK locks are special in a sense that they are almost never
907 * cancelled, instead special kind of lock is used to drop them.
908 * also there is no LRU for flock locks, so no point in tracking
911 if (lock->l_resource->lr_type == LDLM_FLOCK)
914 cfs_atomic_inc(&pl->pl_granted);
915 cfs_atomic_inc(&pl->pl_grant_rate);
916 cfs_atomic_inc(&pl->pl_grant_speed);
918 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_GRANT_STAT);
920 * Do not do pool recalc for client side as all locks which
921 * potentially may be canceled has already been packed into
922 * enqueue/cancel rpc. Also we do not want to run out of stack
923 * with too long call paths.
925 if (ns_is_server(ldlm_pl2ns(pl)))
926 ldlm_pool_recalc(pl);
928 EXPORT_SYMBOL(ldlm_pool_add);
931 * Remove ldlm lock \a lock from pool \a pl accounting.
933 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
936 * Filter out FLOCK locks. Read above comment in ldlm_pool_add().
938 if (lock->l_resource->lr_type == LDLM_FLOCK)
941 LASSERT(cfs_atomic_read(&pl->pl_granted) > 0);
942 cfs_atomic_dec(&pl->pl_granted);
943 cfs_atomic_inc(&pl->pl_cancel_rate);
944 cfs_atomic_dec(&pl->pl_grant_speed);
946 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_CANCEL_STAT);
948 if (ns_is_server(ldlm_pl2ns(pl)))
949 ldlm_pool_recalc(pl);
951 EXPORT_SYMBOL(ldlm_pool_del);
954 * Returns current \a pl SLV.
956 * \pre ->pl_lock is not locked.
958 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
961 cfs_spin_lock(&pl->pl_lock);
962 slv = pl->pl_server_lock_volume;
963 cfs_spin_unlock(&pl->pl_lock);
966 EXPORT_SYMBOL(ldlm_pool_get_slv);
969 * Sets passed \a slv to \a pl.
971 * \pre ->pl_lock is not locked.
973 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
975 cfs_spin_lock(&pl->pl_lock);
976 pl->pl_server_lock_volume = slv;
977 cfs_spin_unlock(&pl->pl_lock);
979 EXPORT_SYMBOL(ldlm_pool_set_slv);
982 * Returns current \a pl CLV.
984 * \pre ->pl_lock is not locked.
986 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
989 cfs_spin_lock(&pl->pl_lock);
990 slv = pl->pl_client_lock_volume;
991 cfs_spin_unlock(&pl->pl_lock);
994 EXPORT_SYMBOL(ldlm_pool_get_clv);
997 * Sets passed \a clv to \a pl.
999 * \pre ->pl_lock is not locked.
1001 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1003 cfs_spin_lock(&pl->pl_lock);
1004 pl->pl_client_lock_volume = clv;
1005 cfs_spin_unlock(&pl->pl_lock);
1007 EXPORT_SYMBOL(ldlm_pool_set_clv);
1010 * Returns current \a pl limit.
1012 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1014 return cfs_atomic_read(&pl->pl_limit);
1016 EXPORT_SYMBOL(ldlm_pool_get_limit);
1019 * Sets passed \a limit to \a pl.
1021 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1023 cfs_atomic_set(&pl->pl_limit, limit);
1025 EXPORT_SYMBOL(ldlm_pool_set_limit);
1028 * Returns current LVF from \a pl.
1030 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1032 return cfs_atomic_read(&pl->pl_lock_volume_factor);
1034 EXPORT_SYMBOL(ldlm_pool_get_lvf);
1037 static int ldlm_pool_granted(struct ldlm_pool *pl)
1039 return cfs_atomic_read(&pl->pl_granted);
1042 static struct ptlrpc_thread *ldlm_pools_thread;
1043 static struct cfs_shrinker *ldlm_pools_srv_shrinker;
1044 static struct cfs_shrinker *ldlm_pools_cli_shrinker;
1045 static cfs_completion_t ldlm_pools_comp;
1048 * Cancel \a nr locks from all namespaces (if possible). Returns number of
1049 * cached locks after shrink is finished. All namespaces are asked to
1050 * cancel approximately equal amount of locks to keep balancing.
1052 static int ldlm_pools_shrink(ldlm_side_t client, int nr,
1053 unsigned int gfp_mask)
1055 int total = 0, cached = 0, nr_ns;
1056 struct ldlm_namespace *ns;
1059 if (client == LDLM_NAMESPACE_CLIENT && nr != 0 &&
1060 !(gfp_mask & __GFP_FS))
1063 CDEBUG(D_DLMTRACE, "Request to shrink %d %s locks from all pools\n",
1064 nr, client == LDLM_NAMESPACE_CLIENT ? "client" : "server");
1066 cookie = cl_env_reenter();
1069 * Find out how many resources we may release.
1071 for (nr_ns = cfs_atomic_read(ldlm_namespace_nr(client));
1074 cfs_mutex_down(ldlm_namespace_lock(client));
1075 if (cfs_list_empty(ldlm_namespace_list(client))) {
1076 cfs_mutex_up(ldlm_namespace_lock(client));
1077 cl_env_reexit(cookie);
1080 ns = ldlm_namespace_first_locked(client);
1081 ldlm_namespace_get(ns);
1082 ldlm_namespace_move_locked(ns, client);
1083 cfs_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) {
1089 cl_env_reexit(cookie);
1094 * Shrink at least ldlm_namespace_nr(client) namespaces.
1096 for (nr_ns = cfs_atomic_read(ldlm_namespace_nr(client));
1099 int cancel, nr_locks;
1102 * Do not call shrink under ldlm_namespace_lock(client)
1104 cfs_mutex_down(ldlm_namespace_lock(client));
1105 if (cfs_list_empty(ldlm_namespace_list(client))) {
1106 cfs_mutex_up(ldlm_namespace_lock(client));
1108 * If list is empty, we can't return any @cached > 0,
1109 * that probably would cause needless shrinker
1115 ns = ldlm_namespace_first_locked(client);
1116 ldlm_namespace_get(ns);
1117 ldlm_namespace_move_locked(ns, client);
1118 cfs_mutex_up(ldlm_namespace_lock(client));
1120 nr_locks = ldlm_pool_granted(&ns->ns_pool);
1121 cancel = 1 + nr_locks * nr / total;
1122 ldlm_pool_shrink(&ns->ns_pool, cancel, gfp_mask);
1123 cached += ldlm_pool_granted(&ns->ns_pool);
1124 ldlm_namespace_put(ns, 1);
1126 cl_env_reexit(cookie);
1130 static int ldlm_pools_srv_shrink(int nr, unsigned int gfp_mask)
1132 return ldlm_pools_shrink(LDLM_NAMESPACE_SERVER, nr, gfp_mask);
1135 static int ldlm_pools_cli_shrink(int nr, unsigned int gfp_mask)
1137 return ldlm_pools_shrink(LDLM_NAMESPACE_CLIENT, nr, gfp_mask);
1140 void ldlm_pools_recalc(ldlm_side_t client)
1142 __u32 nr_l = 0, nr_p = 0, l;
1143 struct ldlm_namespace *ns;
1147 * No need to setup pool limit for client pools.
1149 if (client == LDLM_NAMESPACE_SERVER) {
1151 * Check all modest namespaces first.
1153 cfs_mutex_down(ldlm_namespace_lock(client));
1154 cfs_list_for_each_entry(ns, ldlm_namespace_list(client),
1157 if (ns->ns_appetite != LDLM_NAMESPACE_MODEST)
1160 l = ldlm_pool_granted(&ns->ns_pool);
1165 * Set the modest pools limit equal to their avg granted
1168 l += dru(l, LDLM_POOLS_MODEST_MARGIN_SHIFT, 0);
1169 ldlm_pool_setup(&ns->ns_pool, l);
1175 * Make sure that modest namespaces did not eat more that 2/3
1178 if (nr_l >= 2 * (LDLM_POOL_HOST_L / 3)) {
1179 CWARN("\"Modest\" pools eat out 2/3 of server locks "
1180 "limit (%d of %lu). This means that you have too "
1181 "many clients for this amount of server RAM. "
1182 "Upgrade server!\n", nr_l, LDLM_POOL_HOST_L);
1187 * The rest is given to greedy namespaces.
1189 cfs_list_for_each_entry(ns, ldlm_namespace_list(client),
1192 if (!equal && ns->ns_appetite != LDLM_NAMESPACE_GREEDY)
1197 * In the case 2/3 locks are eaten out by
1198 * modest pools, we re-setup equal limit
1201 l = LDLM_POOL_HOST_L /
1203 ldlm_namespace_nr(client));
1206 * All the rest of greedy pools will have
1207 * all locks in equal parts.
1209 l = (LDLM_POOL_HOST_L - nr_l) /
1211 ldlm_namespace_nr(client)) -
1214 ldlm_pool_setup(&ns->ns_pool, l);
1216 cfs_mutex_up(ldlm_namespace_lock(client));
1220 * Recalc at least ldlm_namespace_nr(client) namespaces.
1222 for (nr = cfs_atomic_read(ldlm_namespace_nr(client)); nr > 0; nr--) {
1225 * Lock the list, get first @ns in the list, getref, move it
1226 * to the tail, unlock and call pool recalc. This way we avoid
1227 * calling recalc under @ns lock what is really good as we get
1228 * rid of potential deadlock on client nodes when canceling
1229 * locks synchronously.
1231 cfs_mutex_down(ldlm_namespace_lock(client));
1232 if (cfs_list_empty(ldlm_namespace_list(client))) {
1233 cfs_mutex_up(ldlm_namespace_lock(client));
1236 ns = ldlm_namespace_first_locked(client);
1238 cfs_spin_lock(&ns->ns_hash_lock);
1240 * skip ns which is being freed, and we don't want to increase
1241 * its refcount again, not even temporarily. bz21519.
1243 if (ns->ns_refcount == 0) {
1247 ldlm_namespace_get_locked(ns);
1249 cfs_spin_unlock(&ns->ns_hash_lock);
1251 ldlm_namespace_move_locked(ns, client);
1252 cfs_mutex_up(ldlm_namespace_lock(client));
1255 * After setup is done - recalc the pool.
1258 ldlm_pool_recalc(&ns->ns_pool);
1259 ldlm_namespace_put(ns, 1);
1263 EXPORT_SYMBOL(ldlm_pools_recalc);
1265 static int ldlm_pools_thread_main(void *arg)
1267 struct ptlrpc_thread *thread = (struct ptlrpc_thread *)arg;
1268 char *t_name = "ldlm_poold";
1271 cfs_daemonize(t_name);
1272 thread->t_flags = SVC_RUNNING;
1273 cfs_waitq_signal(&thread->t_ctl_waitq);
1275 CDEBUG(D_DLMTRACE, "%s: pool thread starting, process %d\n",
1276 t_name, cfs_curproc_pid());
1279 struct l_wait_info lwi;
1282 * Recal all pools on this tick.
1284 ldlm_pools_recalc(LDLM_NAMESPACE_SERVER);
1285 ldlm_pools_recalc(LDLM_NAMESPACE_CLIENT);
1288 * Wait until the next check time, or until we're
1291 lwi = LWI_TIMEOUT(cfs_time_seconds(LDLM_POOLS_THREAD_PERIOD),
1293 l_wait_event(thread->t_ctl_waitq, (thread->t_flags &
1294 (SVC_STOPPING|SVC_EVENT)),
1297 if (thread->t_flags & SVC_STOPPING) {
1298 thread->t_flags &= ~SVC_STOPPING;
1300 } else if (thread->t_flags & SVC_EVENT) {
1301 thread->t_flags &= ~SVC_EVENT;
1305 thread->t_flags = SVC_STOPPED;
1306 cfs_waitq_signal(&thread->t_ctl_waitq);
1308 CDEBUG(D_DLMTRACE, "%s: pool thread exiting, process %d\n",
1309 t_name, cfs_curproc_pid());
1311 cfs_complete_and_exit(&ldlm_pools_comp, 0);
1314 static int ldlm_pools_thread_start(void)
1316 struct l_wait_info lwi = { 0 };
1320 if (ldlm_pools_thread != NULL)
1323 OBD_ALLOC_PTR(ldlm_pools_thread);
1324 if (ldlm_pools_thread == NULL)
1327 cfs_init_completion(&ldlm_pools_comp);
1328 cfs_waitq_init(&ldlm_pools_thread->t_ctl_waitq);
1331 * CLONE_VM and CLONE_FILES just avoid a needless copy, because we
1332 * just drop the VM and FILES in cfs_daemonize() right away.
1334 rc = cfs_kernel_thread(ldlm_pools_thread_main, ldlm_pools_thread,
1335 CLONE_VM | CLONE_FILES);
1337 CERROR("Can't start pool thread, error %d\n",
1339 OBD_FREE(ldlm_pools_thread, sizeof(*ldlm_pools_thread));
1340 ldlm_pools_thread = NULL;
1343 l_wait_event(ldlm_pools_thread->t_ctl_waitq,
1344 (ldlm_pools_thread->t_flags & SVC_RUNNING), &lwi);
1348 static void ldlm_pools_thread_stop(void)
1352 if (ldlm_pools_thread == NULL) {
1357 ldlm_pools_thread->t_flags = SVC_STOPPING;
1358 cfs_waitq_signal(&ldlm_pools_thread->t_ctl_waitq);
1361 * Make sure that pools thread is finished before freeing @thread.
1362 * This fixes possible race and oops due to accessing freed memory
1365 cfs_wait_for_completion(&ldlm_pools_comp);
1366 OBD_FREE_PTR(ldlm_pools_thread);
1367 ldlm_pools_thread = NULL;
1371 int ldlm_pools_init(void)
1376 rc = ldlm_pools_thread_start();
1378 ldlm_pools_srv_shrinker =
1379 cfs_set_shrinker(CFS_DEFAULT_SEEKS,
1380 ldlm_pools_srv_shrink);
1381 ldlm_pools_cli_shrinker =
1382 cfs_set_shrinker(CFS_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 cfs_remove_shrinker(ldlm_pools_srv_shrinker);
1393 ldlm_pools_srv_shrinker = NULL;
1395 if (ldlm_pools_cli_shrinker != NULL) {
1396 cfs_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 */