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, 2012, 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 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 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)
589 spin_lock(&pl->pl_lock);
590 if (recalc_interval_sec > 0) {
592 * Update pool statistics every 1s.
594 ldlm_pool_recalc_stats(pl);
597 * Zero out all rates and speed for the last period.
599 atomic_set(&pl->pl_grant_rate, 0);
600 atomic_set(&pl->pl_cancel_rate, 0);
602 spin_unlock(&pl->pl_lock);
605 if (pl->pl_ops->po_recalc != NULL) {
606 count = pl->pl_ops->po_recalc(pl);
607 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_RECALC_STAT,
610 recalc_interval_sec = pl->pl_recalc_time - cfs_time_current_sec() +
611 pl->pl_recalc_period;
612 if (recalc_interval_sec <= 0) {
613 /* Prevent too frequent recalculation. */
614 recalc_interval_sec = 1;
617 return recalc_interval_sec;
621 * Pool shrink wrapper. Will call either client or server pool recalc callback
622 * depending what pool \a pl is used.
624 int ldlm_pool_shrink(struct ldlm_pool *pl, int nr, gfp_t gfp_mask)
628 if (pl->pl_ops->po_shrink != NULL) {
629 cancel = pl->pl_ops->po_shrink(pl, nr, gfp_mask);
631 lprocfs_counter_add(pl->pl_stats,
632 LDLM_POOL_SHRINK_REQTD_STAT,
634 lprocfs_counter_add(pl->pl_stats,
635 LDLM_POOL_SHRINK_FREED_STAT,
637 CDEBUG(D_DLMTRACE, "%s: request to shrink %d locks, "
638 "shrunk %d\n", pl->pl_name, nr, cancel);
643 EXPORT_SYMBOL(ldlm_pool_shrink);
646 * Pool setup wrapper. Will call either client or server pool recalc callback
647 * depending what pool \a pl is used.
649 * Sets passed \a limit into pool \a pl.
651 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
653 if (pl->pl_ops->po_setup != NULL)
654 return(pl->pl_ops->po_setup(pl, limit));
657 EXPORT_SYMBOL(ldlm_pool_setup);
659 static int lprocfs_pool_state_seq_show(struct seq_file *m, void *unused)
661 int granted, grant_rate, cancel_rate, grant_step;
662 int grant_speed, grant_plan, lvf;
663 struct ldlm_pool *pl = m->private;
667 spin_lock(&pl->pl_lock);
668 slv = pl->pl_server_lock_volume;
669 clv = pl->pl_client_lock_volume;
670 limit = ldlm_pool_get_limit(pl);
671 grant_plan = pl->pl_grant_plan;
672 granted = ldlm_pool_granted(pl);
673 grant_rate = atomic_read(&pl->pl_grant_rate);
674 cancel_rate = atomic_read(&pl->pl_cancel_rate);
675 grant_speed = grant_rate - cancel_rate;
676 lvf = atomic_read(&pl->pl_lock_volume_factor);
677 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
678 spin_unlock(&pl->pl_lock);
680 seq_printf(m, "LDLM pool state (%s):\n"
684 pl->pl_name, slv, clv, lvf);
686 if (ns_is_server(ldlm_pl2ns(pl))) {
687 seq_printf(m, " GSP: %d%%\n"
689 grant_step, grant_plan);
691 seq_printf(m, " GR: %d\n" " CR: %d\n" " GS: %d\n"
692 " G: %d\n" " L: %d\n",
693 grant_rate, cancel_rate, grant_speed,
697 LPROC_SEQ_FOPS_RO(lprocfs_pool_state);
699 static int lprocfs_grant_speed_seq_show(struct seq_file *m, void *unused)
701 struct ldlm_pool *pl = m->private;
704 spin_lock(&pl->pl_lock);
705 /* serialize with ldlm_pool_recalc */
706 grant_speed = atomic_read(&pl->pl_grant_rate) -
707 atomic_read(&pl->pl_cancel_rate);
708 spin_unlock(&pl->pl_lock);
709 return lprocfs_uint_seq_show(m, &grant_speed);
712 LDLM_POOL_PROC_READER_SEQ_SHOW(grant_plan, int);
713 LPROC_SEQ_FOPS_RO(lprocfs_grant_plan);
715 LDLM_POOL_PROC_READER_SEQ_SHOW(recalc_period, int);
716 LDLM_POOL_PROC_WRITER(recalc_period, int);
717 static ssize_t lprocfs_recalc_period_seq_write(struct file *file,
718 const char __user *buf,
719 size_t len, loff_t *off)
721 struct seq_file *seq = file->private_data;
723 return lprocfs_wr_recalc_period(file, buf, len, seq->private);
725 LPROC_SEQ_FOPS(lprocfs_recalc_period);
727 LPROC_SEQ_FOPS_RO_TYPE(ldlm_pool, u64);
728 LPROC_SEQ_FOPS_RO_TYPE(ldlm_pool, atomic);
729 LPROC_SEQ_FOPS_RW_TYPE(ldlm_pool_rw, atomic);
731 LPROC_SEQ_FOPS_RO(lprocfs_grant_speed);
733 static int ldlm_pool_proc_init(struct ldlm_pool *pl)
735 struct ldlm_namespace *ns = ldlm_pl2ns(pl);
736 struct proc_dir_entry *parent_ns_proc;
737 struct lprocfs_seq_vars pool_vars[2];
738 char *var_name = NULL;
742 OBD_ALLOC(var_name, MAX_STRING_SIZE + 1);
746 parent_ns_proc = ns->ns_proc_dir_entry;
747 if (parent_ns_proc == NULL) {
748 CERROR("%s: proc entry is not initialized\n",
750 GOTO(out_free_name, rc = -EINVAL);
752 pl->pl_proc_dir = lprocfs_seq_register("pool", parent_ns_proc,
754 if (IS_ERR(pl->pl_proc_dir)) {
755 rc = PTR_ERR(pl->pl_proc_dir);
756 pl->pl_proc_dir = NULL;
757 CERROR("%s: cannot create 'pool' proc entry: rc = %d\n",
758 ldlm_ns_name(ns), rc);
759 GOTO(out_free_name, rc);
762 var_name[MAX_STRING_SIZE] = '\0';
763 memset(pool_vars, 0, sizeof(pool_vars));
764 pool_vars[0].name = var_name;
766 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "server_lock_volume",
767 &pl->pl_server_lock_volume, &ldlm_pool_u64_fops);
768 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "limit", &pl->pl_limit,
769 &ldlm_pool_rw_atomic_fops);
770 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "granted",
771 &pl->pl_granted, &ldlm_pool_atomic_fops);
772 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "grant_speed", pl,
773 &lprocfs_grant_speed_fops);
774 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "cancel_rate",
775 &pl->pl_cancel_rate, &ldlm_pool_atomic_fops);
776 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "grant_rate",
777 &pl->pl_grant_rate, &ldlm_pool_atomic_fops);
778 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "grant_plan", pl,
779 &lprocfs_grant_plan_fops);
780 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "recalc_period",
781 pl, &lprocfs_recalc_period_fops);
782 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "lock_volume_factor",
783 &pl->pl_lock_volume_factor, &ldlm_pool_rw_atomic_fops);
784 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "state", pl,
785 &lprocfs_pool_state_fops);
787 pl->pl_stats = lprocfs_alloc_stats(LDLM_POOL_LAST_STAT -
788 LDLM_POOL_FIRST_STAT, 0);
790 GOTO(out_free_name, rc = -ENOMEM);
792 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
793 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
795 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_STAT,
796 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
798 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_STAT,
799 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
801 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
802 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
803 "grant_rate", "locks/s");
804 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
805 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
806 "cancel_rate", "locks/s");
807 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
808 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
809 "grant_plan", "locks/s");
810 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SLV_STAT,
811 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
813 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_REQTD_STAT,
814 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
815 "shrink_request", "locks");
816 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_FREED_STAT,
817 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
818 "shrink_freed", "locks");
819 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_RECALC_STAT,
820 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
821 "recalc_freed", "locks");
822 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_TIMING_STAT,
823 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
824 "recalc_timing", "sec");
825 rc = lprocfs_register_stats(pl->pl_proc_dir, "stats", pl->pl_stats);
829 OBD_FREE(var_name, MAX_STRING_SIZE + 1);
833 static void ldlm_pool_proc_fini(struct ldlm_pool *pl)
835 if (pl->pl_stats != NULL) {
836 lprocfs_free_stats(&pl->pl_stats);
839 if (pl->pl_proc_dir != NULL) {
840 lprocfs_remove(&pl->pl_proc_dir);
841 pl->pl_proc_dir = NULL;
845 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
846 int idx, ldlm_side_t client)
851 spin_lock_init(&pl->pl_lock);
852 atomic_set(&pl->pl_granted, 0);
853 pl->pl_recalc_time = cfs_time_current_sec();
854 atomic_set(&pl->pl_lock_volume_factor, 1);
856 atomic_set(&pl->pl_grant_rate, 0);
857 atomic_set(&pl->pl_cancel_rate, 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",
861 ldlm_ns_name(ns), idx);
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 atomic_inc(&pl->pl_granted);
915 atomic_inc(&pl->pl_grant_rate);
916 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_GRANT_STAT);
918 * Do not do pool recalc for client side as all locks which
919 * potentially may be canceled has already been packed into
920 * enqueue/cancel rpc. Also we do not want to run out of stack
921 * with too long call paths.
923 if (ns_is_server(ldlm_pl2ns(pl)))
924 ldlm_pool_recalc(pl);
926 EXPORT_SYMBOL(ldlm_pool_add);
929 * Remove ldlm lock \a lock from pool \a pl accounting.
931 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
934 * Filter out FLOCK locks. Read above comment in ldlm_pool_add().
936 if (lock->l_resource->lr_type == LDLM_FLOCK)
939 LASSERT(atomic_read(&pl->pl_granted) > 0);
940 atomic_dec(&pl->pl_granted);
941 atomic_inc(&pl->pl_cancel_rate);
943 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_CANCEL_STAT);
945 if (ns_is_server(ldlm_pl2ns(pl)))
946 ldlm_pool_recalc(pl);
948 EXPORT_SYMBOL(ldlm_pool_del);
951 * Returns current \a pl SLV.
953 * \pre ->pl_lock is not locked.
955 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
958 spin_lock(&pl->pl_lock);
959 slv = pl->pl_server_lock_volume;
960 spin_unlock(&pl->pl_lock);
963 EXPORT_SYMBOL(ldlm_pool_get_slv);
966 * Sets passed \a slv to \a pl.
968 * \pre ->pl_lock is not locked.
970 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
972 spin_lock(&pl->pl_lock);
973 pl->pl_server_lock_volume = slv;
974 spin_unlock(&pl->pl_lock);
976 EXPORT_SYMBOL(ldlm_pool_set_slv);
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);
991 EXPORT_SYMBOL(ldlm_pool_get_clv);
994 * Sets passed \a clv to \a pl.
996 * \pre ->pl_lock is not locked.
998 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1000 spin_lock(&pl->pl_lock);
1001 pl->pl_client_lock_volume = clv;
1002 spin_unlock(&pl->pl_lock);
1004 EXPORT_SYMBOL(ldlm_pool_set_clv);
1007 * Returns current \a pl limit.
1009 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1011 return atomic_read(&pl->pl_limit);
1013 EXPORT_SYMBOL(ldlm_pool_get_limit);
1016 * Sets passed \a limit to \a pl.
1018 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1020 atomic_set(&pl->pl_limit, limit);
1022 EXPORT_SYMBOL(ldlm_pool_set_limit);
1025 * Returns current LVF from \a pl.
1027 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1029 return atomic_read(&pl->pl_lock_volume_factor);
1031 EXPORT_SYMBOL(ldlm_pool_get_lvf);
1033 static struct ptlrpc_thread *ldlm_pools_thread;
1034 static struct shrinker *ldlm_pools_srv_shrinker;
1035 static struct shrinker *ldlm_pools_cli_shrinker;
1036 static struct completion ldlm_pools_comp;
1039 * count locks from all namespaces (if possible). Returns number of
1042 static unsigned long ldlm_pools_count(ldlm_side_t client, gfp_t gfp_mask)
1044 unsigned long total = 0;
1046 struct ldlm_namespace *ns;
1047 struct ldlm_namespace *ns_old = NULL; /* loop detection */
1050 if (client == LDLM_NAMESPACE_CLIENT && !(gfp_mask & __GFP_FS))
1053 CDEBUG(D_DLMTRACE, "Request to count %s locks from all pools\n",
1054 client == LDLM_NAMESPACE_CLIENT ? "client" : "server");
1056 cookie = cl_env_reenter();
1059 * Find out how many resources we may release.
1061 for (nr_ns = ldlm_namespace_nr_read(client);
1062 nr_ns > 0; nr_ns--) {
1063 mutex_lock(ldlm_namespace_lock(client));
1064 if (list_empty(ldlm_namespace_list(client))) {
1065 mutex_unlock(ldlm_namespace_lock(client));
1066 cl_env_reexit(cookie);
1069 ns = ldlm_namespace_first_locked(client);
1072 mutex_unlock(ldlm_namespace_lock(client));
1076 if (ldlm_ns_empty(ns)) {
1077 ldlm_namespace_move_to_inactive_locked(ns, client);
1078 mutex_unlock(ldlm_namespace_lock(client));
1085 ldlm_namespace_get(ns);
1086 ldlm_namespace_move_to_active_locked(ns, client);
1087 mutex_unlock(ldlm_namespace_lock(client));
1088 total += ldlm_pool_shrink(&ns->ns_pool, 0, gfp_mask);
1089 ldlm_namespace_put(ns);
1092 cl_env_reexit(cookie);
1096 static unsigned long ldlm_pools_scan(ldlm_side_t client, int nr,
1099 unsigned long freed = 0;
1101 struct ldlm_namespace *ns;
1104 if (client == LDLM_NAMESPACE_CLIENT && !(gfp_mask & __GFP_FS))
1107 cookie = cl_env_reenter();
1110 * Shrink at least ldlm_namespace_nr_read(client) namespaces.
1112 for (tmp = nr_ns = ldlm_namespace_nr_read(client);
1114 int cancel, nr_locks;
1117 * Do not call shrink under ldlm_namespace_lock(client)
1119 mutex_lock(ldlm_namespace_lock(client));
1120 if (list_empty(ldlm_namespace_list(client))) {
1121 mutex_unlock(ldlm_namespace_lock(client));
1124 ns = ldlm_namespace_first_locked(client);
1125 ldlm_namespace_get(ns);
1126 ldlm_namespace_move_to_active_locked(ns, client);
1127 mutex_unlock(ldlm_namespace_lock(client));
1129 nr_locks = ldlm_pool_granted(&ns->ns_pool);
1131 * We use to shrink propotionally but with new shrinker API,
1132 * we lost the total number of freeable locks.
1134 cancel = 1 + min_t(int, nr_locks, nr / nr_ns);
1135 freed += ldlm_pool_shrink(&ns->ns_pool, cancel, gfp_mask);
1136 ldlm_namespace_put(ns);
1138 cl_env_reexit(cookie);
1140 * we only decrease the SLV in server pools shrinker, return
1141 * SHRINK_STOP to kernel to avoid needless loop. LU-1128
1143 return (client == LDLM_NAMESPACE_SERVER) ? SHRINK_STOP : freed;
1146 #ifdef HAVE_SHRINKER_COUNT
1147 static unsigned long ldlm_pools_srv_count(struct shrinker *s,
1148 struct shrink_control *sc)
1150 return ldlm_pools_count(LDLM_NAMESPACE_SERVER, sc->gfp_mask);
1153 static unsigned long ldlm_pools_srv_scan(struct shrinker *s,
1154 struct shrink_control *sc)
1156 return ldlm_pools_scan(LDLM_NAMESPACE_SERVER, sc->nr_to_scan,
1160 static unsigned long ldlm_pools_cli_count(struct shrinker *s, struct shrink_control *sc)
1162 return ldlm_pools_count(LDLM_NAMESPACE_CLIENT, sc->gfp_mask);
1165 static unsigned long ldlm_pools_cli_scan(struct shrinker *s,
1166 struct shrink_control *sc)
1168 return ldlm_pools_scan(LDLM_NAMESPACE_CLIENT, sc->nr_to_scan,
1174 * Cancel \a nr locks from all namespaces (if possible). Returns number of
1175 * cached locks after shrink is finished. All namespaces are asked to
1176 * cancel approximately equal amount of locks to keep balancing.
1178 static int ldlm_pools_shrink(ldlm_side_t client, int nr,
1181 unsigned long total = 0;
1183 if (client == LDLM_NAMESPACE_CLIENT && nr != 0 &&
1184 !(gfp_mask & __GFP_FS))
1187 CDEBUG(D_DLMTRACE, "Request to shrink %d %s locks from all pools\n",
1188 nr, client == LDLM_NAMESPACE_CLIENT ? "client" : "server");
1190 total = ldlm_pools_count(client, gfp_mask);
1192 if (nr == 0 || total == 0)
1195 return ldlm_pools_scan(client, nr, gfp_mask);
1198 static int ldlm_pools_srv_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
1200 return ldlm_pools_shrink(LDLM_NAMESPACE_SERVER,
1201 shrink_param(sc, nr_to_scan),
1202 shrink_param(sc, gfp_mask));
1205 static int ldlm_pools_cli_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
1207 return ldlm_pools_shrink(LDLM_NAMESPACE_CLIENT,
1208 shrink_param(sc, nr_to_scan),
1209 shrink_param(sc, gfp_mask));
1212 #endif /* HAVE_SHRINKER_COUNT */
1214 int ldlm_pools_recalc(ldlm_side_t client)
1216 unsigned long nr_l = 0, nr_p = 0, l;
1217 struct ldlm_namespace *ns;
1218 struct ldlm_namespace *ns_old = NULL;
1220 int time = 50; /* seconds of sleep if no active namespaces */
1223 * No need to setup pool limit for client pools.
1225 if (client == LDLM_NAMESPACE_SERVER) {
1227 * Check all modest namespaces first.
1229 mutex_lock(ldlm_namespace_lock(client));
1230 list_for_each_entry(ns, ldlm_namespace_list(client),
1233 if (ns->ns_appetite != LDLM_NAMESPACE_MODEST)
1236 l = ldlm_pool_granted(&ns->ns_pool);
1241 * Set the modest pools limit equal to their avg granted
1244 l += dru(l, LDLM_POOLS_MODEST_MARGIN_SHIFT, 0);
1245 ldlm_pool_setup(&ns->ns_pool, l);
1251 * Make sure that modest namespaces did not eat more that 2/3
1254 if (nr_l >= 2 * (LDLM_POOL_HOST_L / 3)) {
1255 CWARN("\"Modest\" pools eat out 2/3 of server locks "
1256 "limit (%lu of %lu). This means that you have too "
1257 "many clients for this amount of server RAM. "
1258 "Upgrade server!\n", nr_l, LDLM_POOL_HOST_L);
1263 * The rest is given to greedy namespaces.
1265 list_for_each_entry(ns, ldlm_namespace_list(client),
1268 if (!equal && ns->ns_appetite != LDLM_NAMESPACE_GREEDY)
1273 * In the case 2/3 locks are eaten out by
1274 * modest pools, we re-setup equal limit
1277 l = LDLM_POOL_HOST_L /
1278 ldlm_namespace_nr_read(client);
1281 * All the rest of greedy pools will have
1282 * all locks in equal parts.
1284 l = (LDLM_POOL_HOST_L - nr_l) /
1285 (ldlm_namespace_nr_read(client) -
1288 ldlm_pool_setup(&ns->ns_pool, l);
1290 mutex_unlock(ldlm_namespace_lock(client));
1294 * Recalc at least ldlm_namespace_nr(client) namespaces.
1296 for (nr = ldlm_namespace_nr_read(client); nr > 0; nr--) {
1299 * Lock the list, get first @ns in the list, getref, move it
1300 * to the tail, unlock and call pool recalc. This way we avoid
1301 * calling recalc under @ns lock what is really good as we get
1302 * rid of potential deadlock on client nodes when canceling
1303 * locks synchronously.
1305 mutex_lock(ldlm_namespace_lock(client));
1306 if (list_empty(ldlm_namespace_list(client))) {
1307 mutex_unlock(ldlm_namespace_lock(client));
1310 ns = ldlm_namespace_first_locked(client);
1312 if (ns_old == ns) { /* Full pass complete */
1313 mutex_unlock(ldlm_namespace_lock(client));
1317 /* We got an empty namespace, need to move it back to inactive
1319 * The race with parallel resource creation is fine:
1320 * - If they do namespace_get before our check, we fail the
1321 * check and they move this item to the end of the list anyway
1322 * - If we do the check and then they do namespace_get, then
1323 * we move the namespace to inactive and they will move
1324 * it back to active (synchronised by the lock, so no clash
1327 if (ldlm_ns_empty(ns)) {
1328 ldlm_namespace_move_to_inactive_locked(ns, client);
1329 mutex_unlock(ldlm_namespace_lock(client));
1336 spin_lock(&ns->ns_lock);
1338 * skip ns which is being freed, and we don't want to increase
1339 * its refcount again, not even temporarily. bz21519 & LU-499.
1341 if (ns->ns_stopping) {
1345 ldlm_namespace_get(ns);
1347 spin_unlock(&ns->ns_lock);
1349 ldlm_namespace_move_to_active_locked(ns, client);
1350 mutex_unlock(ldlm_namespace_lock(client));
1353 * After setup is done - recalc the pool.
1356 int ttime = ldlm_pool_recalc(&ns->ns_pool);
1361 ldlm_namespace_put(ns);
1366 EXPORT_SYMBOL(ldlm_pools_recalc);
1368 static int ldlm_pools_thread_main(void *arg)
1370 struct ptlrpc_thread *thread = (struct ptlrpc_thread *)arg;
1374 thread_set_flags(thread, SVC_RUNNING);
1375 wake_up(&thread->t_ctl_waitq);
1377 CDEBUG(D_DLMTRACE, "%s: pool thread starting, process %d\n",
1378 "ldlm_poold", current_pid());
1381 struct l_wait_info lwi;
1384 * Recal all pools on this tick.
1386 s_time = ldlm_pools_recalc(LDLM_NAMESPACE_SERVER);
1387 c_time = ldlm_pools_recalc(LDLM_NAMESPACE_CLIENT);
1390 * Wait until the next check time, or until we're
1393 lwi = LWI_TIMEOUT(cfs_time_seconds(min(s_time, c_time)),
1395 l_wait_event(thread->t_ctl_waitq,
1396 thread_is_stopping(thread) ||
1397 thread_is_event(thread),
1400 if (thread_test_and_clear_flags(thread, SVC_STOPPING))
1403 thread_test_and_clear_flags(thread, SVC_EVENT);
1406 thread_set_flags(thread, SVC_STOPPED);
1407 wake_up(&thread->t_ctl_waitq);
1409 CDEBUG(D_DLMTRACE, "%s: pool thread exiting, process %d\n",
1410 "ldlm_poold", current_pid());
1412 complete_and_exit(&ldlm_pools_comp, 0);
1415 static int ldlm_pools_thread_start(void)
1417 struct l_wait_info lwi = { 0 };
1418 struct task_struct *task;
1421 if (ldlm_pools_thread != NULL)
1424 OBD_ALLOC_PTR(ldlm_pools_thread);
1425 if (ldlm_pools_thread == NULL)
1428 init_completion(&ldlm_pools_comp);
1429 init_waitqueue_head(&ldlm_pools_thread->t_ctl_waitq);
1431 task = kthread_run(ldlm_pools_thread_main, ldlm_pools_thread,
1434 CERROR("Can't start pool thread, error %ld\n", PTR_ERR(task));
1435 OBD_FREE(ldlm_pools_thread, sizeof(*ldlm_pools_thread));
1436 ldlm_pools_thread = NULL;
1437 RETURN(PTR_ERR(task));
1439 l_wait_event(ldlm_pools_thread->t_ctl_waitq,
1440 thread_is_running(ldlm_pools_thread), &lwi);
1444 static void ldlm_pools_thread_stop(void)
1448 if (ldlm_pools_thread == NULL) {
1453 thread_set_flags(ldlm_pools_thread, SVC_STOPPING);
1454 wake_up(&ldlm_pools_thread->t_ctl_waitq);
1457 * Make sure that pools thread is finished before freeing @thread.
1458 * This fixes possible race and oops due to accessing freed memory
1461 wait_for_completion(&ldlm_pools_comp);
1462 OBD_FREE_PTR(ldlm_pools_thread);
1463 ldlm_pools_thread = NULL;
1467 int ldlm_pools_init(void)
1470 DEF_SHRINKER_VAR(shsvar, ldlm_pools_srv_shrink,
1471 ldlm_pools_srv_count, ldlm_pools_srv_scan);
1472 DEF_SHRINKER_VAR(shcvar, ldlm_pools_cli_shrink,
1473 ldlm_pools_cli_count, ldlm_pools_cli_scan);
1476 rc = ldlm_pools_thread_start();
1478 ldlm_pools_srv_shrinker =
1479 set_shrinker(DEFAULT_SEEKS, &shsvar);
1480 ldlm_pools_cli_shrinker =
1481 set_shrinker(DEFAULT_SEEKS, &shcvar);
1485 EXPORT_SYMBOL(ldlm_pools_init);
1487 void ldlm_pools_fini(void)
1489 if (ldlm_pools_srv_shrinker != NULL) {
1490 remove_shrinker(ldlm_pools_srv_shrinker);
1491 ldlm_pools_srv_shrinker = NULL;
1493 if (ldlm_pools_cli_shrinker != NULL) {
1494 remove_shrinker(ldlm_pools_cli_shrinker);
1495 ldlm_pools_cli_shrinker = NULL;
1497 ldlm_pools_thread_stop();
1499 EXPORT_SYMBOL(ldlm_pools_fini);
1501 #else /* !HAVE_LRU_RESIZE_SUPPORT */
1502 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
1506 EXPORT_SYMBOL(ldlm_pool_setup);
1508 int ldlm_pool_recalc(struct ldlm_pool *pl)
1512 EXPORT_SYMBOL(ldlm_pool_recalc);
1514 int ldlm_pool_shrink(struct ldlm_pool *pl,
1515 int nr, gfp_t gfp_mask)
1519 EXPORT_SYMBOL(ldlm_pool_shrink);
1521 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
1522 int idx, ldlm_side_t client)
1526 EXPORT_SYMBOL(ldlm_pool_init);
1528 void ldlm_pool_fini(struct ldlm_pool *pl)
1532 EXPORT_SYMBOL(ldlm_pool_fini);
1534 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
1538 EXPORT_SYMBOL(ldlm_pool_add);
1540 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
1544 EXPORT_SYMBOL(ldlm_pool_del);
1546 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
1550 EXPORT_SYMBOL(ldlm_pool_get_slv);
1552 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
1556 EXPORT_SYMBOL(ldlm_pool_set_slv);
1558 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
1562 EXPORT_SYMBOL(ldlm_pool_get_clv);
1564 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1568 EXPORT_SYMBOL(ldlm_pool_set_clv);
1570 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1574 EXPORT_SYMBOL(ldlm_pool_get_limit);
1576 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1580 EXPORT_SYMBOL(ldlm_pool_set_limit);
1582 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1586 EXPORT_SYMBOL(ldlm_pool_get_lvf);
1588 int ldlm_pools_init(void)
1592 EXPORT_SYMBOL(ldlm_pools_init);
1594 void ldlm_pools_fini(void)
1598 EXPORT_SYMBOL(ldlm_pools_fini);
1600 int ldlm_pools_recalc(ldlm_side_t client)
1604 EXPORT_SYMBOL(ldlm_pools_recalc);
1605 #endif /* HAVE_LRU_RESIZE_SUPPORT */