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.sun.com/software/products/lustre/docs/GPLv2.pdf
20 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
21 * CA 95054 USA or visit www.sun.com if you need additional information or
27 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
30 * Copyright (c) 2010, 2014, Intel Corporation.
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
100 #include <lustre_dlm.h>
101 #include <cl_object.h>
102 #include <obd_class.h>
103 #include <obd_support.h>
104 #include "ldlm_internal.h"
106 #ifdef HAVE_LRU_RESIZE_SUPPORT
109 * 50 ldlm locks for 1MB of RAM.
111 #define LDLM_POOL_HOST_L ((NUM_CACHEPAGES >> (20 - PAGE_CACHE_SHIFT)) * 50)
114 * Maximal possible grant step plan in %.
116 #define LDLM_POOL_MAX_GSP (30)
119 * Minimal possible grant step plan in %.
121 #define LDLM_POOL_MIN_GSP (1)
124 * This controls the speed of reaching LDLM_POOL_MAX_GSP
125 * with increasing thread period.
127 #define LDLM_POOL_GSP_STEP_SHIFT (2)
130 * LDLM_POOL_GSP% of all locks is default GP.
132 #define LDLM_POOL_GP(L) (((L) * LDLM_POOL_MAX_GSP) / 100)
135 * Max age for locks on clients.
137 #define LDLM_POOL_MAX_AGE (36000)
140 * The granularity of SLV calculation.
142 #define LDLM_POOL_SLV_SHIFT (10)
144 extern struct proc_dir_entry *ldlm_ns_proc_dir;
146 static inline __u64 dru(__u64 val, __u32 shift, int round_up)
148 return (val + (round_up ? (1 << shift) - 1 : 0)) >> shift;
151 static inline __u64 ldlm_pool_slv_max(__u32 L)
154 * Allow to have all locks for 1 client for 10 hrs.
155 * Formula is the following: limit * 10h / 1 client.
157 __u64 lim = (__u64)L * LDLM_POOL_MAX_AGE / 1;
161 static inline __u64 ldlm_pool_slv_min(__u32 L)
167 LDLM_POOL_FIRST_STAT = 0,
168 LDLM_POOL_GRANTED_STAT = LDLM_POOL_FIRST_STAT,
169 LDLM_POOL_GRANT_STAT,
170 LDLM_POOL_CANCEL_STAT,
171 LDLM_POOL_GRANT_RATE_STAT,
172 LDLM_POOL_CANCEL_RATE_STAT,
173 LDLM_POOL_GRANT_PLAN_STAT,
175 LDLM_POOL_SHRINK_REQTD_STAT,
176 LDLM_POOL_SHRINK_FREED_STAT,
177 LDLM_POOL_RECALC_STAT,
178 LDLM_POOL_TIMING_STAT,
182 static inline struct ldlm_namespace *ldlm_pl2ns(struct ldlm_pool *pl)
184 return container_of(pl, struct ldlm_namespace, ns_pool);
188 * Calculates suggested grant_step in % of available locks for passed
189 * \a period. This is later used in grant_plan calculations.
191 static inline int ldlm_pool_t2gsp(unsigned int t)
194 * This yields 1% grant step for anything below LDLM_POOL_GSP_STEP
195 * and up to 30% for anything higher than LDLM_POOL_GSP_STEP.
197 * How this will affect execution is the following:
199 * - for thread period 1s we will have grant_step 1% which good from
200 * pov of taking some load off from server and push it out to clients.
201 * This is like that because 1% for grant_step means that server will
202 * not allow clients to get lots of locks in short period of time and
203 * keep all old locks in their caches. Clients will always have to
204 * get some locks back if they want to take some new;
206 * - for thread period 10s (which is default) we will have 23% which
207 * means that clients will have enough of room to take some new locks
208 * without getting some back. All locks from this 23% which were not
209 * taken by clients in current period will contribute in SLV growing.
210 * SLV growing means more locks cached on clients until limit or grant
213 return LDLM_POOL_MAX_GSP -
214 ((LDLM_POOL_MAX_GSP - LDLM_POOL_MIN_GSP) >>
215 (t >> LDLM_POOL_GSP_STEP_SHIFT));
218 static inline int ldlm_pool_granted(struct ldlm_pool *pl)
220 return atomic_read(&pl->pl_granted);
224 * Recalculates next grant limit on passed \a pl.
226 * \pre ->pl_lock is locked.
228 static void ldlm_pool_recalc_grant_plan(struct ldlm_pool *pl)
230 int granted, grant_step, limit;
232 limit = ldlm_pool_get_limit(pl);
233 granted = ldlm_pool_granted(pl);
235 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
236 grant_step = ((limit - granted) * grant_step) / 100;
237 pl->pl_grant_plan = granted + grant_step;
238 limit = (limit * 5) >> 2;
239 if (pl->pl_grant_plan > limit)
240 pl->pl_grant_plan = limit;
244 * Recalculates next SLV on passed \a pl.
246 * \pre ->pl_lock is locked.
248 static void ldlm_pool_recalc_slv(struct ldlm_pool *pl)
258 slv = pl->pl_server_lock_volume;
259 grant_plan = pl->pl_grant_plan;
260 limit = ldlm_pool_get_limit(pl);
261 granted = ldlm_pool_granted(pl);
262 round_up = granted < limit;
264 grant_usage = max_t(int, limit - (granted - grant_plan), 1);
267 * Find out SLV change factor which is the ratio of grant usage
268 * from limit. SLV changes as fast as the ratio of grant plan
269 * consumption. The more locks from grant plan are not consumed
270 * by clients in last interval (idle time), the faster grows
271 * SLV. And the opposite, the more grant plan is over-consumed
272 * (load time) the faster drops SLV.
274 slv_factor = (grant_usage << LDLM_POOL_SLV_SHIFT);
275 do_div(slv_factor, limit);
276 slv = slv * slv_factor;
277 slv = dru(slv, LDLM_POOL_SLV_SHIFT, round_up);
279 if (slv > ldlm_pool_slv_max(limit)) {
280 slv = ldlm_pool_slv_max(limit);
281 } else if (slv < ldlm_pool_slv_min(limit)) {
282 slv = ldlm_pool_slv_min(limit);
285 pl->pl_server_lock_volume = slv;
289 * Recalculates next stats on passed \a pl.
291 * \pre ->pl_lock is locked.
293 static void ldlm_pool_recalc_stats(struct ldlm_pool *pl)
295 int grant_plan = pl->pl_grant_plan;
296 __u64 slv = pl->pl_server_lock_volume;
297 int granted = ldlm_pool_granted(pl);
298 int grant_rate = atomic_read(&pl->pl_grant_rate);
299 int cancel_rate = atomic_read(&pl->pl_cancel_rate);
301 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_SLV_STAT,
303 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
305 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
307 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
309 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
314 * Sets current SLV into obd accessible via ldlm_pl2ns(pl)->ns_obd.
316 static void ldlm_srv_pool_push_slv(struct ldlm_pool *pl)
318 struct obd_device *obd;
321 * Set new SLV in obd field for using it later without accessing the
322 * pool. This is required to avoid race between sending reply to client
323 * with new SLV and cleanup server stack in which we can't guarantee
324 * that namespace is still alive. We know only that obd is alive as
325 * long as valid export is alive.
327 obd = ldlm_pl2ns(pl)->ns_obd;
328 LASSERT(obd != NULL);
329 write_lock(&obd->obd_pool_lock);
330 obd->obd_pool_slv = pl->pl_server_lock_volume;
331 write_unlock(&obd->obd_pool_lock);
335 * Recalculates all pool fields on passed \a pl.
337 * \pre ->pl_lock is not locked.
339 static int ldlm_srv_pool_recalc(struct ldlm_pool *pl)
341 time_t recalc_interval_sec;
344 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
345 if (recalc_interval_sec < pl->pl_recalc_period)
348 spin_lock(&pl->pl_lock);
349 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
350 if (recalc_interval_sec < pl->pl_recalc_period) {
351 spin_unlock(&pl->pl_lock);
355 * Recalc SLV after last period. This should be done
356 * _before_ recalculating new grant plan.
358 ldlm_pool_recalc_slv(pl);
361 * Make sure that pool informed obd of last SLV changes.
363 ldlm_srv_pool_push_slv(pl);
366 * Update grant_plan for new period.
368 ldlm_pool_recalc_grant_plan(pl);
370 pl->pl_recalc_time = cfs_time_current_sec();
371 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
372 recalc_interval_sec);
373 spin_unlock(&pl->pl_lock);
378 * This function is used on server side as main entry point for memory
379 * pressure handling. It decreases SLV on \a pl according to passed
380 * \a nr and \a gfp_mask.
382 * Our goal here is to decrease SLV such a way that clients hold \a nr
383 * locks smaller in next 10h.
385 static int ldlm_srv_pool_shrink(struct ldlm_pool *pl,
386 int nr, gfp_t gfp_mask)
391 * VM is asking how many entries may be potentially freed.
394 return ldlm_pool_granted(pl);
397 * Client already canceled locks but server is already in shrinker
398 * and can't cancel anything. Let's catch this race.
400 if (ldlm_pool_granted(pl) == 0)
403 spin_lock(&pl->pl_lock);
406 * We want shrinker to possibly cause cancellation of @nr locks from
407 * clients or grant approximately @nr locks smaller next intervals.
409 * This is why we decreased SLV by @nr. This effect will only be as
410 * long as one re-calc interval (1s these days) and this should be
411 * enough to pass this decreased SLV to all clients. On next recalc
412 * interval pool will either increase SLV if locks load is not high
413 * or will keep on same level or even decrease again, thus, shrinker
414 * decreased SLV will affect next recalc intervals and this way will
415 * make locking load lower.
417 if (nr < pl->pl_server_lock_volume) {
418 pl->pl_server_lock_volume = pl->pl_server_lock_volume - nr;
420 limit = ldlm_pool_get_limit(pl);
421 pl->pl_server_lock_volume = ldlm_pool_slv_min(limit);
425 * Make sure that pool informed obd of last SLV changes.
427 ldlm_srv_pool_push_slv(pl);
428 spin_unlock(&pl->pl_lock);
431 * We did not really free any memory here so far, it only will be
432 * freed later may be, so that we return 0 to not confuse VM.
438 * Setup server side pool \a pl with passed \a limit.
440 static int ldlm_srv_pool_setup(struct ldlm_pool *pl, int limit)
442 struct obd_device *obd;
444 obd = ldlm_pl2ns(pl)->ns_obd;
445 LASSERT(obd != NULL && obd != LP_POISON);
446 LASSERT(obd->obd_type != LP_POISON);
447 write_lock(&obd->obd_pool_lock);
448 obd->obd_pool_limit = limit;
449 write_unlock(&obd->obd_pool_lock);
451 ldlm_pool_set_limit(pl, limit);
456 * Sets SLV and Limit from ldlm_pl2ns(pl)->ns_obd tp passed \a pl.
458 static void ldlm_cli_pool_pop_slv(struct ldlm_pool *pl)
460 struct obd_device *obd;
463 * Get new SLV and Limit from obd which is updated with coming
466 obd = ldlm_pl2ns(pl)->ns_obd;
467 LASSERT(obd != NULL);
468 read_lock(&obd->obd_pool_lock);
469 pl->pl_server_lock_volume = obd->obd_pool_slv;
470 ldlm_pool_set_limit(pl, obd->obd_pool_limit);
471 read_unlock(&obd->obd_pool_lock);
475 * Recalculates client size pool \a pl according to current SLV and Limit.
477 static int ldlm_cli_pool_recalc(struct ldlm_pool *pl)
479 time_t recalc_interval_sec;
483 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
484 if (recalc_interval_sec < pl->pl_recalc_period)
487 spin_lock(&pl->pl_lock);
489 * Check if we need to recalc lists now.
491 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
492 if (recalc_interval_sec < pl->pl_recalc_period) {
493 spin_unlock(&pl->pl_lock);
498 * Make sure that pool knows last SLV and Limit from obd.
500 ldlm_cli_pool_pop_slv(pl);
501 spin_unlock(&pl->pl_lock);
504 * Do not cancel locks in case lru resize is disabled for this ns.
506 if (!ns_connect_lru_resize(ldlm_pl2ns(pl)))
510 * In the time of canceling locks on client we do not need to maintain
511 * sharp timing, we only want to cancel locks asap according to new SLV.
512 * It may be called when SLV has changed much, this is why we do not
513 * take into account pl->pl_recalc_time here.
515 ret = ldlm_cancel_lru(ldlm_pl2ns(pl), 0, LCF_ASYNC,
519 spin_lock(&pl->pl_lock);
521 * Time of LRU resizing might be longer than period,
522 * so update after LRU resizing rather than before it.
524 pl->pl_recalc_time = cfs_time_current_sec();
525 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
526 recalc_interval_sec);
527 spin_unlock(&pl->pl_lock);
532 * This function is main entry point for memory pressure handling on client
533 * side. Main goal of this function is to cancel some number of locks on
534 * passed \a pl according to \a nr and \a gfp_mask.
536 static int ldlm_cli_pool_shrink(struct ldlm_pool *pl,
537 int nr, gfp_t gfp_mask)
539 struct ldlm_namespace *ns;
545 * Do not cancel locks in case lru resize is disabled for this ns.
547 if (!ns_connect_lru_resize(ns))
551 * Make sure that pool knows last SLV and Limit from obd.
553 ldlm_cli_pool_pop_slv(pl);
555 spin_lock(&ns->ns_lock);
556 unused = ns->ns_nr_unused;
557 spin_unlock(&ns->ns_lock);
560 return (unused / 100) * sysctl_vfs_cache_pressure;
562 return ldlm_cancel_lru(ns, nr, LCF_ASYNC, LDLM_CANCEL_SHRINK);
565 static struct ldlm_pool_ops ldlm_srv_pool_ops = {
566 .po_recalc = ldlm_srv_pool_recalc,
567 .po_shrink = ldlm_srv_pool_shrink,
568 .po_setup = ldlm_srv_pool_setup
571 static struct ldlm_pool_ops ldlm_cli_pool_ops = {
572 .po_recalc = ldlm_cli_pool_recalc,
573 .po_shrink = ldlm_cli_pool_shrink
577 * Pool recalc wrapper. Will call either client or server pool recalc callback
578 * depending what pool \a pl is used.
580 int ldlm_pool_recalc(struct ldlm_pool *pl)
582 time_t recalc_interval_sec;
585 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
586 if (recalc_interval_sec > 0) {
587 spin_lock(&pl->pl_lock);
588 recalc_interval_sec = cfs_time_current_sec() -
591 if (recalc_interval_sec > 0) {
593 * Update pool statistics every 1s.
595 ldlm_pool_recalc_stats(pl);
598 * Zero out all rates and speed for the last period.
600 atomic_set(&pl->pl_grant_rate, 0);
601 atomic_set(&pl->pl_cancel_rate, 0);
603 spin_unlock(&pl->pl_lock);
606 if (pl->pl_ops->po_recalc != NULL) {
607 count = pl->pl_ops->po_recalc(pl);
608 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_RECALC_STAT,
612 recalc_interval_sec = pl->pl_recalc_time - cfs_time_current_sec() +
613 pl->pl_recalc_period;
614 if (recalc_interval_sec <= 0) {
615 /* DEBUG: should be re-removed after LU-4536 is fixed */
616 CDEBUG(D_DLMTRACE, "%s: Negative interval(%ld), "
617 "too short period(%ld)\n",
618 pl->pl_name, recalc_interval_sec,
619 pl->pl_recalc_period);
621 /* Prevent too frequent recalculation. */
622 recalc_interval_sec = 1;
625 return recalc_interval_sec;
629 * Pool shrink wrapper. Will call either client or server pool recalc callback
630 * depending what pool \a pl is used.
632 int ldlm_pool_shrink(struct ldlm_pool *pl, int nr, gfp_t gfp_mask)
636 if (pl->pl_ops->po_shrink != NULL) {
637 cancel = pl->pl_ops->po_shrink(pl, nr, gfp_mask);
639 lprocfs_counter_add(pl->pl_stats,
640 LDLM_POOL_SHRINK_REQTD_STAT,
642 lprocfs_counter_add(pl->pl_stats,
643 LDLM_POOL_SHRINK_FREED_STAT,
645 CDEBUG(D_DLMTRACE, "%s: request to shrink %d locks, "
646 "shrunk %d\n", pl->pl_name, nr, cancel);
653 * Pool setup wrapper. Will call either client or server pool recalc callback
654 * depending what pool \a pl is used.
656 * Sets passed \a limit into pool \a pl.
658 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
660 if (pl->pl_ops->po_setup != NULL)
661 return(pl->pl_ops->po_setup(pl, limit));
665 static int lprocfs_pool_state_seq_show(struct seq_file *m, void *unused)
667 int granted, grant_rate, cancel_rate, grant_step;
668 int grant_speed, grant_plan, lvf;
669 struct ldlm_pool *pl = m->private;
673 spin_lock(&pl->pl_lock);
674 slv = pl->pl_server_lock_volume;
675 clv = pl->pl_client_lock_volume;
676 limit = ldlm_pool_get_limit(pl);
677 grant_plan = pl->pl_grant_plan;
678 granted = ldlm_pool_granted(pl);
679 grant_rate = atomic_read(&pl->pl_grant_rate);
680 cancel_rate = atomic_read(&pl->pl_cancel_rate);
681 grant_speed = grant_rate - cancel_rate;
682 lvf = atomic_read(&pl->pl_lock_volume_factor);
683 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
684 spin_unlock(&pl->pl_lock);
686 seq_printf(m, "LDLM pool state (%s):\n"
690 pl->pl_name, slv, clv, lvf);
692 if (ns_is_server(ldlm_pl2ns(pl))) {
693 seq_printf(m, " GSP: %d%%\n"
695 grant_step, grant_plan);
697 seq_printf(m, " GR: %d\n" " CR: %d\n" " GS: %d\n"
698 " G: %d\n" " L: %d\n",
699 grant_rate, cancel_rate, grant_speed,
703 LPROC_SEQ_FOPS_RO(lprocfs_pool_state);
705 static int lprocfs_grant_speed_seq_show(struct seq_file *m, void *unused)
707 struct ldlm_pool *pl = m->private;
710 spin_lock(&pl->pl_lock);
711 /* serialize with ldlm_pool_recalc */
712 grant_speed = atomic_read(&pl->pl_grant_rate) -
713 atomic_read(&pl->pl_cancel_rate);
714 spin_unlock(&pl->pl_lock);
715 return lprocfs_uint_seq_show(m, &grant_speed);
718 LDLM_POOL_PROC_READER_SEQ_SHOW(grant_plan, int);
719 LPROC_SEQ_FOPS_RO(lprocfs_grant_plan);
721 LDLM_POOL_PROC_READER_SEQ_SHOW(recalc_period, int);
722 LDLM_POOL_PROC_WRITER(recalc_period, int);
723 static ssize_t lprocfs_recalc_period_seq_write(struct file *file,
724 const char __user *buf,
725 size_t len, loff_t *off)
727 struct seq_file *seq = file->private_data;
729 return lprocfs_wr_recalc_period(file, buf, len, seq->private);
731 LPROC_SEQ_FOPS(lprocfs_recalc_period);
733 LPROC_SEQ_FOPS_RO_TYPE(ldlm_pool, u64);
734 LPROC_SEQ_FOPS_RO_TYPE(ldlm_pool, atomic);
735 LPROC_SEQ_FOPS_RW_TYPE(ldlm_pool_rw, atomic);
737 LPROC_SEQ_FOPS_RO(lprocfs_grant_speed);
739 static int ldlm_pool_proc_init(struct ldlm_pool *pl)
741 struct ldlm_namespace *ns = ldlm_pl2ns(pl);
742 struct proc_dir_entry *parent_ns_proc;
743 struct lprocfs_vars pool_vars[2];
744 char *var_name = NULL;
748 OBD_ALLOC(var_name, MAX_STRING_SIZE + 1);
752 parent_ns_proc = ns->ns_proc_dir_entry;
753 if (parent_ns_proc == NULL) {
754 CERROR("%s: proc entry is not initialized\n",
756 GOTO(out_free_name, rc = -EINVAL);
758 pl->pl_proc_dir = lprocfs_register("pool", parent_ns_proc,
760 if (IS_ERR(pl->pl_proc_dir)) {
761 rc = PTR_ERR(pl->pl_proc_dir);
762 pl->pl_proc_dir = NULL;
763 CERROR("%s: cannot create 'pool' proc entry: rc = %d\n",
764 ldlm_ns_name(ns), rc);
765 GOTO(out_free_name, rc);
768 var_name[MAX_STRING_SIZE] = '\0';
769 memset(pool_vars, 0, sizeof(pool_vars));
770 pool_vars[0].name = var_name;
772 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "server_lock_volume",
773 &pl->pl_server_lock_volume, &ldlm_pool_u64_fops);
774 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "limit", &pl->pl_limit,
775 &ldlm_pool_rw_atomic_fops);
776 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "granted",
777 &pl->pl_granted, &ldlm_pool_atomic_fops);
778 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "grant_speed", pl,
779 &lprocfs_grant_speed_fops);
780 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "cancel_rate",
781 &pl->pl_cancel_rate, &ldlm_pool_atomic_fops);
782 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "grant_rate",
783 &pl->pl_grant_rate, &ldlm_pool_atomic_fops);
784 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "grant_plan", pl,
785 &lprocfs_grant_plan_fops);
786 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "recalc_period",
787 pl, &lprocfs_recalc_period_fops);
788 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "lock_volume_factor",
789 &pl->pl_lock_volume_factor, &ldlm_pool_rw_atomic_fops);
790 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "state", pl,
791 &lprocfs_pool_state_fops);
793 pl->pl_stats = lprocfs_alloc_stats(LDLM_POOL_LAST_STAT -
794 LDLM_POOL_FIRST_STAT, 0);
796 GOTO(out_free_name, rc = -ENOMEM);
798 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
799 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
801 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_STAT,
802 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
804 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_STAT,
805 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
807 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
808 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
809 "grant_rate", "locks/s");
810 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
811 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
812 "cancel_rate", "locks/s");
813 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
814 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
815 "grant_plan", "locks/s");
816 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SLV_STAT,
817 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
819 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_REQTD_STAT,
820 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
821 "shrink_request", "locks");
822 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_FREED_STAT,
823 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
824 "shrink_freed", "locks");
825 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_RECALC_STAT,
826 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
827 "recalc_freed", "locks");
828 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_TIMING_STAT,
829 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
830 "recalc_timing", "sec");
831 rc = lprocfs_register_stats(pl->pl_proc_dir, "stats", pl->pl_stats);
835 OBD_FREE(var_name, MAX_STRING_SIZE + 1);
839 static void ldlm_pool_proc_fini(struct ldlm_pool *pl)
841 if (pl->pl_stats != NULL) {
842 lprocfs_free_stats(&pl->pl_stats);
845 if (pl->pl_proc_dir != NULL) {
846 lprocfs_remove(&pl->pl_proc_dir);
847 pl->pl_proc_dir = NULL;
851 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
852 int idx, ldlm_side_t client)
857 spin_lock_init(&pl->pl_lock);
858 atomic_set(&pl->pl_granted, 0);
859 pl->pl_recalc_time = cfs_time_current_sec();
860 atomic_set(&pl->pl_lock_volume_factor, 1);
862 atomic_set(&pl->pl_grant_rate, 0);
863 atomic_set(&pl->pl_cancel_rate, 0);
864 pl->pl_grant_plan = LDLM_POOL_GP(LDLM_POOL_HOST_L);
866 snprintf(pl->pl_name, sizeof(pl->pl_name), "ldlm-pool-%s-%d",
867 ldlm_ns_name(ns), idx);
869 if (client == LDLM_NAMESPACE_SERVER) {
870 pl->pl_ops = &ldlm_srv_pool_ops;
871 ldlm_pool_set_limit(pl, LDLM_POOL_HOST_L);
872 pl->pl_recalc_period = LDLM_POOL_SRV_DEF_RECALC_PERIOD;
873 pl->pl_server_lock_volume = ldlm_pool_slv_max(LDLM_POOL_HOST_L);
875 ldlm_pool_set_limit(pl, 1);
876 pl->pl_server_lock_volume = 0;
877 pl->pl_ops = &ldlm_cli_pool_ops;
878 pl->pl_recalc_period = LDLM_POOL_CLI_DEF_RECALC_PERIOD;
880 pl->pl_client_lock_volume = 0;
881 rc = ldlm_pool_proc_init(pl);
885 CDEBUG(D_DLMTRACE, "Lock pool %s is initialized\n", pl->pl_name);
890 void ldlm_pool_fini(struct ldlm_pool *pl)
893 ldlm_pool_proc_fini(pl);
896 * Pool should not be used after this point. We can't free it here as
897 * it lives in struct ldlm_namespace, but still interested in catching
898 * any abnormal using cases.
900 POISON(pl, 0x5a, sizeof(*pl));
905 * Add new taken ldlm lock \a lock into pool \a pl accounting.
907 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
910 * FLOCK locks are special in a sense that they are almost never
911 * cancelled, instead special kind of lock is used to drop them.
912 * also there is no LRU for flock locks, so no point in tracking
915 if (lock->l_resource->lr_type == LDLM_FLOCK)
918 atomic_inc(&pl->pl_granted);
919 atomic_inc(&pl->pl_grant_rate);
920 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_GRANT_STAT);
922 * Do not do pool recalc for client side as all locks which
923 * potentially may be canceled has already been packed into
924 * enqueue/cancel rpc. Also we do not want to run out of stack
925 * with too long call paths.
927 if (ns_is_server(ldlm_pl2ns(pl)))
928 ldlm_pool_recalc(pl);
932 * Remove ldlm lock \a lock from pool \a pl accounting.
934 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
937 * Filter out FLOCK locks. Read above comment in ldlm_pool_add().
939 if (lock->l_resource->lr_type == LDLM_FLOCK)
942 LASSERT(atomic_read(&pl->pl_granted) > 0);
943 atomic_dec(&pl->pl_granted);
944 atomic_inc(&pl->pl_cancel_rate);
946 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_CANCEL_STAT);
948 if (ns_is_server(ldlm_pl2ns(pl)))
949 ldlm_pool_recalc(pl);
953 * Returns current \a pl SLV.
955 * \pre ->pl_lock is not locked.
957 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
960 spin_lock(&pl->pl_lock);
961 slv = pl->pl_server_lock_volume;
962 spin_unlock(&pl->pl_lock);
967 * Sets passed \a slv to \a pl.
969 * \pre ->pl_lock is not locked.
971 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
973 spin_lock(&pl->pl_lock);
974 pl->pl_server_lock_volume = slv;
975 spin_unlock(&pl->pl_lock);
979 * Returns current \a pl CLV.
981 * \pre ->pl_lock is not locked.
983 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
986 spin_lock(&pl->pl_lock);
987 slv = pl->pl_client_lock_volume;
988 spin_unlock(&pl->pl_lock);
993 * Sets passed \a clv to \a pl.
995 * \pre ->pl_lock is not locked.
997 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
999 spin_lock(&pl->pl_lock);
1000 pl->pl_client_lock_volume = clv;
1001 spin_unlock(&pl->pl_lock);
1005 * Returns current \a pl limit.
1007 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1009 return atomic_read(&pl->pl_limit);
1013 * Sets passed \a limit to \a pl.
1015 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1017 atomic_set(&pl->pl_limit, limit);
1021 * Returns current LVF from \a pl.
1023 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1025 return atomic_read(&pl->pl_lock_volume_factor);
1028 static struct ptlrpc_thread *ldlm_pools_thread;
1029 static struct shrinker *ldlm_pools_srv_shrinker;
1030 static struct shrinker *ldlm_pools_cli_shrinker;
1031 static struct completion ldlm_pools_comp;
1034 * count locks from all namespaces (if possible). Returns number of
1037 static unsigned long ldlm_pools_count(ldlm_side_t client, gfp_t gfp_mask)
1039 unsigned long total = 0;
1041 struct ldlm_namespace *ns;
1042 struct ldlm_namespace *ns_old = NULL; /* loop detection */
1045 if (client == LDLM_NAMESPACE_CLIENT && !(gfp_mask & __GFP_FS))
1048 CDEBUG(D_DLMTRACE, "Request to count %s locks from all pools\n",
1049 client == LDLM_NAMESPACE_CLIENT ? "client" : "server");
1051 cookie = cl_env_reenter();
1054 * Find out how many resources we may release.
1056 for (nr_ns = ldlm_namespace_nr_read(client);
1057 nr_ns > 0; nr_ns--) {
1058 mutex_lock(ldlm_namespace_lock(client));
1059 if (list_empty(ldlm_namespace_list(client))) {
1060 mutex_unlock(ldlm_namespace_lock(client));
1061 cl_env_reexit(cookie);
1064 ns = ldlm_namespace_first_locked(client);
1067 mutex_unlock(ldlm_namespace_lock(client));
1071 if (ldlm_ns_empty(ns)) {
1072 ldlm_namespace_move_to_inactive_locked(ns, client);
1073 mutex_unlock(ldlm_namespace_lock(client));
1080 ldlm_namespace_get(ns);
1081 ldlm_namespace_move_to_active_locked(ns, client);
1082 mutex_unlock(ldlm_namespace_lock(client));
1083 total += ldlm_pool_shrink(&ns->ns_pool, 0, gfp_mask);
1084 ldlm_namespace_put(ns);
1087 cl_env_reexit(cookie);
1091 static unsigned long ldlm_pools_scan(ldlm_side_t client, int nr,
1094 unsigned long freed = 0;
1096 struct ldlm_namespace *ns;
1099 if (client == LDLM_NAMESPACE_CLIENT && !(gfp_mask & __GFP_FS))
1102 cookie = cl_env_reenter();
1105 * Shrink at least ldlm_namespace_nr_read(client) namespaces.
1107 for (tmp = nr_ns = ldlm_namespace_nr_read(client);
1109 int cancel, nr_locks;
1112 * Do not call shrink under ldlm_namespace_lock(client)
1114 mutex_lock(ldlm_namespace_lock(client));
1115 if (list_empty(ldlm_namespace_list(client))) {
1116 mutex_unlock(ldlm_namespace_lock(client));
1119 ns = ldlm_namespace_first_locked(client);
1120 ldlm_namespace_get(ns);
1121 ldlm_namespace_move_to_active_locked(ns, client);
1122 mutex_unlock(ldlm_namespace_lock(client));
1124 nr_locks = ldlm_pool_granted(&ns->ns_pool);
1126 * We use to shrink propotionally but with new shrinker API,
1127 * we lost the total number of freeable locks.
1129 cancel = 1 + min_t(int, nr_locks, nr / nr_ns);
1130 freed += ldlm_pool_shrink(&ns->ns_pool, cancel, gfp_mask);
1131 ldlm_namespace_put(ns);
1133 cl_env_reexit(cookie);
1135 * we only decrease the SLV in server pools shrinker, return
1136 * SHRINK_STOP to kernel to avoid needless loop. LU-1128
1138 return (client == LDLM_NAMESPACE_SERVER) ? SHRINK_STOP : freed;
1141 #ifdef HAVE_SHRINKER_COUNT
1142 static unsigned long ldlm_pools_srv_count(struct shrinker *s,
1143 struct shrink_control *sc)
1145 return ldlm_pools_count(LDLM_NAMESPACE_SERVER, sc->gfp_mask);
1148 static unsigned long ldlm_pools_srv_scan(struct shrinker *s,
1149 struct shrink_control *sc)
1151 return ldlm_pools_scan(LDLM_NAMESPACE_SERVER, sc->nr_to_scan,
1155 static unsigned long ldlm_pools_cli_count(struct shrinker *s, struct shrink_control *sc)
1157 return ldlm_pools_count(LDLM_NAMESPACE_CLIENT, sc->gfp_mask);
1160 static unsigned long ldlm_pools_cli_scan(struct shrinker *s,
1161 struct shrink_control *sc)
1163 return ldlm_pools_scan(LDLM_NAMESPACE_CLIENT, sc->nr_to_scan,
1169 * Cancel \a nr locks from all namespaces (if possible). Returns number of
1170 * cached locks after shrink is finished. All namespaces are asked to
1171 * cancel approximately equal amount of locks to keep balancing.
1173 static int ldlm_pools_shrink(ldlm_side_t client, int nr,
1176 unsigned long total = 0;
1178 if (client == LDLM_NAMESPACE_CLIENT && nr != 0 &&
1179 !(gfp_mask & __GFP_FS))
1182 CDEBUG(D_DLMTRACE, "Request to shrink %d %s locks from all pools\n",
1183 nr, client == LDLM_NAMESPACE_CLIENT ? "client" : "server");
1185 total = ldlm_pools_count(client, gfp_mask);
1187 if (nr == 0 || total == 0)
1190 return ldlm_pools_scan(client, nr, gfp_mask);
1193 static int ldlm_pools_srv_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
1195 return ldlm_pools_shrink(LDLM_NAMESPACE_SERVER,
1196 shrink_param(sc, nr_to_scan),
1197 shrink_param(sc, gfp_mask));
1200 static int ldlm_pools_cli_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
1202 return ldlm_pools_shrink(LDLM_NAMESPACE_CLIENT,
1203 shrink_param(sc, nr_to_scan),
1204 shrink_param(sc, gfp_mask));
1207 #endif /* HAVE_SHRINKER_COUNT */
1209 int ldlm_pools_recalc(ldlm_side_t client)
1211 unsigned long nr_l = 0, nr_p = 0, l;
1212 struct ldlm_namespace *ns;
1213 struct ldlm_namespace *ns_old = NULL;
1215 int time = 50; /* seconds of sleep if no active namespaces */
1218 * No need to setup pool limit for client pools.
1220 if (client == LDLM_NAMESPACE_SERVER) {
1222 * Check all modest namespaces first.
1224 mutex_lock(ldlm_namespace_lock(client));
1225 list_for_each_entry(ns, ldlm_namespace_list(client),
1228 if (ns->ns_appetite != LDLM_NAMESPACE_MODEST)
1231 l = ldlm_pool_granted(&ns->ns_pool);
1236 * Set the modest pools limit equal to their avg granted
1239 l += dru(l, LDLM_POOLS_MODEST_MARGIN_SHIFT, 0);
1240 ldlm_pool_setup(&ns->ns_pool, l);
1246 * Make sure that modest namespaces did not eat more that 2/3
1249 if (nr_l >= 2 * (LDLM_POOL_HOST_L / 3)) {
1250 CWARN("\"Modest\" pools eat out 2/3 of server locks "
1251 "limit (%lu of %lu). This means that you have too "
1252 "many clients for this amount of server RAM. "
1253 "Upgrade server!\n", nr_l, LDLM_POOL_HOST_L);
1258 * The rest is given to greedy namespaces.
1260 list_for_each_entry(ns, ldlm_namespace_list(client),
1263 if (!equal && ns->ns_appetite != LDLM_NAMESPACE_GREEDY)
1268 * In the case 2/3 locks are eaten out by
1269 * modest pools, we re-setup equal limit
1272 l = LDLM_POOL_HOST_L /
1273 ldlm_namespace_nr_read(client);
1276 * All the rest of greedy pools will have
1277 * all locks in equal parts.
1279 l = (LDLM_POOL_HOST_L - nr_l) /
1280 (ldlm_namespace_nr_read(client) -
1283 ldlm_pool_setup(&ns->ns_pool, l);
1285 mutex_unlock(ldlm_namespace_lock(client));
1289 * Recalc at least ldlm_namespace_nr(client) namespaces.
1291 for (nr = ldlm_namespace_nr_read(client); nr > 0; nr--) {
1294 * Lock the list, get first @ns in the list, getref, move it
1295 * to the tail, unlock and call pool recalc. This way we avoid
1296 * calling recalc under @ns lock what is really good as we get
1297 * rid of potential deadlock on client nodes when canceling
1298 * locks synchronously.
1300 mutex_lock(ldlm_namespace_lock(client));
1301 if (list_empty(ldlm_namespace_list(client))) {
1302 mutex_unlock(ldlm_namespace_lock(client));
1305 ns = ldlm_namespace_first_locked(client);
1307 if (ns_old == ns) { /* Full pass complete */
1308 mutex_unlock(ldlm_namespace_lock(client));
1312 /* We got an empty namespace, need to move it back to inactive
1314 * The race with parallel resource creation is fine:
1315 * - If they do namespace_get before our check, we fail the
1316 * check and they move this item to the end of the list anyway
1317 * - If we do the check and then they do namespace_get, then
1318 * we move the namespace to inactive and they will move
1319 * it back to active (synchronised by the lock, so no clash
1322 if (ldlm_ns_empty(ns)) {
1323 ldlm_namespace_move_to_inactive_locked(ns, client);
1324 mutex_unlock(ldlm_namespace_lock(client));
1331 spin_lock(&ns->ns_lock);
1333 * skip ns which is being freed, and we don't want to increase
1334 * its refcount again, not even temporarily. bz21519 & LU-499.
1336 if (ns->ns_stopping) {
1340 ldlm_namespace_get(ns);
1342 spin_unlock(&ns->ns_lock);
1344 ldlm_namespace_move_to_active_locked(ns, client);
1345 mutex_unlock(ldlm_namespace_lock(client));
1348 * After setup is done - recalc the pool.
1351 int ttime = ldlm_pool_recalc(&ns->ns_pool);
1356 ldlm_namespace_put(ns);
1362 static int ldlm_pools_thread_main(void *arg)
1364 struct ptlrpc_thread *thread = (struct ptlrpc_thread *)arg;
1368 thread_set_flags(thread, SVC_RUNNING);
1369 wake_up(&thread->t_ctl_waitq);
1371 CDEBUG(D_DLMTRACE, "%s: pool thread starting, process %d\n",
1372 "ldlm_poold", current_pid());
1375 struct l_wait_info lwi;
1378 * Recal all pools on this tick.
1380 s_time = ldlm_pools_recalc(LDLM_NAMESPACE_SERVER);
1381 c_time = ldlm_pools_recalc(LDLM_NAMESPACE_CLIENT);
1384 * Wait until the next check time, or until we're
1387 lwi = LWI_TIMEOUT(cfs_time_seconds(min(s_time, c_time)),
1389 l_wait_event(thread->t_ctl_waitq,
1390 thread_is_stopping(thread) ||
1391 thread_is_event(thread),
1394 if (thread_test_and_clear_flags(thread, SVC_STOPPING))
1397 thread_test_and_clear_flags(thread, SVC_EVENT);
1400 thread_set_flags(thread, SVC_STOPPED);
1401 wake_up(&thread->t_ctl_waitq);
1403 CDEBUG(D_DLMTRACE, "%s: pool thread exiting, process %d\n",
1404 "ldlm_poold", current_pid());
1406 complete_and_exit(&ldlm_pools_comp, 0);
1409 static int ldlm_pools_thread_start(void)
1411 struct l_wait_info lwi = { 0 };
1412 struct task_struct *task;
1415 if (ldlm_pools_thread != NULL)
1418 OBD_ALLOC_PTR(ldlm_pools_thread);
1419 if (ldlm_pools_thread == NULL)
1422 init_completion(&ldlm_pools_comp);
1423 init_waitqueue_head(&ldlm_pools_thread->t_ctl_waitq);
1425 task = kthread_run(ldlm_pools_thread_main, ldlm_pools_thread,
1428 CERROR("Can't start pool thread, error %ld\n", PTR_ERR(task));
1429 OBD_FREE(ldlm_pools_thread, sizeof(*ldlm_pools_thread));
1430 ldlm_pools_thread = NULL;
1431 RETURN(PTR_ERR(task));
1433 l_wait_event(ldlm_pools_thread->t_ctl_waitq,
1434 thread_is_running(ldlm_pools_thread), &lwi);
1438 static void ldlm_pools_thread_stop(void)
1442 if (ldlm_pools_thread == NULL) {
1447 thread_set_flags(ldlm_pools_thread, SVC_STOPPING);
1448 wake_up(&ldlm_pools_thread->t_ctl_waitq);
1451 * Make sure that pools thread is finished before freeing @thread.
1452 * This fixes possible race and oops due to accessing freed memory
1455 wait_for_completion(&ldlm_pools_comp);
1456 OBD_FREE_PTR(ldlm_pools_thread);
1457 ldlm_pools_thread = NULL;
1461 int ldlm_pools_init(void)
1464 DEF_SHRINKER_VAR(shsvar, ldlm_pools_srv_shrink,
1465 ldlm_pools_srv_count, ldlm_pools_srv_scan);
1466 DEF_SHRINKER_VAR(shcvar, ldlm_pools_cli_shrink,
1467 ldlm_pools_cli_count, ldlm_pools_cli_scan);
1470 rc = ldlm_pools_thread_start();
1472 ldlm_pools_srv_shrinker =
1473 set_shrinker(DEFAULT_SEEKS, &shsvar);
1474 ldlm_pools_cli_shrinker =
1475 set_shrinker(DEFAULT_SEEKS, &shcvar);
1480 void ldlm_pools_fini(void)
1482 if (ldlm_pools_srv_shrinker != NULL) {
1483 remove_shrinker(ldlm_pools_srv_shrinker);
1484 ldlm_pools_srv_shrinker = NULL;
1486 if (ldlm_pools_cli_shrinker != NULL) {
1487 remove_shrinker(ldlm_pools_cli_shrinker);
1488 ldlm_pools_cli_shrinker = NULL;
1490 ldlm_pools_thread_stop();
1493 #else /* !HAVE_LRU_RESIZE_SUPPORT */
1494 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
1499 int ldlm_pool_recalc(struct ldlm_pool *pl)
1504 int ldlm_pool_shrink(struct ldlm_pool *pl,
1505 int nr, gfp_t gfp_mask)
1510 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
1511 int idx, ldlm_side_t client)
1516 void ldlm_pool_fini(struct ldlm_pool *pl)
1521 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
1526 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
1531 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
1536 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
1541 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
1546 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1551 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1556 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1561 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1566 int ldlm_pools_init(void)
1571 void ldlm_pools_fini(void)
1576 int ldlm_pools_recalc(ldlm_side_t client)
1580 #endif /* HAVE_LRU_RESIZE_SUPPORT */