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
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 ((NUM_CACHEPAGES >> (20 - PAGE_CACHE_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 struct proc_dir_entry *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 = 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 = 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 = atomic_read(&pl->pl_granted);
301 int grant_rate = atomic_read(&pl->pl_grant_rate);
302 int cancel_rate = 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 write_lock(&obd->obd_pool_lock);
333 obd->obd_pool_slv = pl->pl_server_lock_volume;
334 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 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
348 if (recalc_interval_sec < pl->pl_recalc_period)
351 spin_lock(&pl->pl_lock);
352 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
353 if (recalc_interval_sec < pl->pl_recalc_period) {
354 spin_unlock(&pl->pl_lock);
358 * Recalc SLV after last period. This should be done
359 * _before_ recalculating new grant plan.
361 ldlm_pool_recalc_slv(pl);
364 * Make sure that pool informed obd of last SLV changes.
366 ldlm_srv_pool_push_slv(pl);
369 * Update grant_plan for new period.
371 ldlm_pool_recalc_grant_plan(pl);
373 pl->pl_recalc_time = cfs_time_current_sec();
374 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
375 recalc_interval_sec);
376 spin_unlock(&pl->pl_lock);
381 * This function is used on server side as main entry point for memory
382 * pressure handling. It decreases SLV on \a pl according to passed
383 * \a nr and \a gfp_mask.
385 * Our goal here is to decrease SLV such a way that clients hold \a nr
386 * locks smaller in next 10h.
388 static int ldlm_srv_pool_shrink(struct ldlm_pool *pl,
389 int nr, gfp_t gfp_mask)
394 * VM is asking how many entries may be potentially freed.
397 return atomic_read(&pl->pl_granted);
400 * Client already canceled locks but server is already in shrinker
401 * and can't cancel anything. Let's catch this race.
403 if (atomic_read(&pl->pl_granted) == 0)
406 spin_lock(&pl->pl_lock);
409 * We want shrinker to possibly cause cancellation of @nr locks from
410 * clients or grant approximately @nr locks smaller next intervals.
412 * This is why we decreased SLV by @nr. This effect will only be as
413 * long as one re-calc interval (1s these days) and this should be
414 * enough to pass this decreased SLV to all clients. On next recalc
415 * interval pool will either increase SLV if locks load is not high
416 * or will keep on same level or even decrease again, thus, shrinker
417 * decreased SLV will affect next recalc intervals and this way will
418 * make locking load lower.
420 if (nr < pl->pl_server_lock_volume) {
421 pl->pl_server_lock_volume = pl->pl_server_lock_volume - nr;
423 limit = ldlm_pool_get_limit(pl);
424 pl->pl_server_lock_volume = ldlm_pool_slv_min(limit);
428 * Make sure that pool informed obd of last SLV changes.
430 ldlm_srv_pool_push_slv(pl);
431 spin_unlock(&pl->pl_lock);
434 * We did not really free any memory here so far, it only will be
435 * freed later may be, so that we return 0 to not confuse VM.
441 * Setup server side pool \a pl with passed \a limit.
443 static int ldlm_srv_pool_setup(struct ldlm_pool *pl, int limit)
445 struct obd_device *obd;
447 obd = ldlm_pl2ns(pl)->ns_obd;
448 LASSERT(obd != NULL && obd != LP_POISON);
449 LASSERT(obd->obd_type != LP_POISON);
450 write_lock(&obd->obd_pool_lock);
451 obd->obd_pool_limit = limit;
452 write_unlock(&obd->obd_pool_lock);
454 ldlm_pool_set_limit(pl, limit);
459 * Sets SLV and Limit from ldlm_pl2ns(pl)->ns_obd tp passed \a pl.
461 static void ldlm_cli_pool_pop_slv(struct ldlm_pool *pl)
463 struct obd_device *obd;
466 * Get new SLV and Limit from obd which is updated with coming
469 obd = ldlm_pl2ns(pl)->ns_obd;
470 LASSERT(obd != NULL);
471 read_lock(&obd->obd_pool_lock);
472 pl->pl_server_lock_volume = obd->obd_pool_slv;
473 ldlm_pool_set_limit(pl, obd->obd_pool_limit);
474 read_unlock(&obd->obd_pool_lock);
478 * Recalculates client size pool \a pl according to current SLV and Limit.
480 static int ldlm_cli_pool_recalc(struct ldlm_pool *pl)
482 time_t recalc_interval_sec;
486 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
487 if (recalc_interval_sec < pl->pl_recalc_period)
490 spin_lock(&pl->pl_lock);
492 * Check if we need to recalc lists now.
494 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
495 if (recalc_interval_sec < pl->pl_recalc_period) {
496 spin_unlock(&pl->pl_lock);
501 * Make sure that pool knows last SLV and Limit from obd.
503 ldlm_cli_pool_pop_slv(pl);
504 spin_unlock(&pl->pl_lock);
507 * Do not cancel locks in case lru resize is disabled for this ns.
509 if (!ns_connect_lru_resize(ldlm_pl2ns(pl)))
513 * In the time of canceling locks on client we do not need to maintain
514 * sharp timing, we only want to cancel locks asap according to new SLV.
515 * It may be called when SLV has changed much, this is why we do not
516 * take into account pl->pl_recalc_time here.
518 ret = ldlm_cancel_lru(ldlm_pl2ns(pl), 0, LCF_ASYNC,
522 spin_lock(&pl->pl_lock);
524 * Time of LRU resizing might be longer than period,
525 * so update after LRU resizing rather than before it.
527 pl->pl_recalc_time = cfs_time_current_sec();
528 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_TIMING_STAT,
529 recalc_interval_sec);
530 spin_unlock(&pl->pl_lock);
535 * This function is main entry point for memory pressure handling on client
536 * side. Main goal of this function is to cancel some number of locks on
537 * passed \a pl according to \a nr and \a gfp_mask.
539 static int ldlm_cli_pool_shrink(struct ldlm_pool *pl,
540 int nr, gfp_t gfp_mask)
542 struct ldlm_namespace *ns;
548 * Do not cancel locks in case lru resize is disabled for this ns.
550 if (!ns_connect_lru_resize(ns))
554 * Make sure that pool knows last SLV and Limit from obd.
556 ldlm_cli_pool_pop_slv(pl);
558 spin_lock(&ns->ns_lock);
559 unused = ns->ns_nr_unused;
560 spin_unlock(&ns->ns_lock);
564 return (unused / 100) * sysctl_vfs_cache_pressure;
566 return ldlm_cancel_lru(ns, nr, LCF_ASYNC, LDLM_CANCEL_SHRINK);
568 return unused - (nr ? ldlm_cancel_lru(ns, nr, LCF_ASYNC,
569 LDLM_CANCEL_SHRINK) : 0);
573 struct ldlm_pool_ops ldlm_srv_pool_ops = {
574 .po_recalc = ldlm_srv_pool_recalc,
575 .po_shrink = ldlm_srv_pool_shrink,
576 .po_setup = ldlm_srv_pool_setup
579 struct ldlm_pool_ops ldlm_cli_pool_ops = {
580 .po_recalc = ldlm_cli_pool_recalc,
581 .po_shrink = ldlm_cli_pool_shrink
585 * Pool recalc wrapper. Will call either client or server pool recalc callback
586 * depending what pool \a pl is used.
588 int ldlm_pool_recalc(struct ldlm_pool *pl)
590 time_t recalc_interval_sec;
593 recalc_interval_sec = cfs_time_current_sec() - pl->pl_recalc_time;
594 if (recalc_interval_sec <= 0)
597 spin_lock(&pl->pl_lock);
598 if (recalc_interval_sec > 0) {
600 * Update pool statistics every 1s.
602 ldlm_pool_recalc_stats(pl);
605 * Zero out all rates and speed for the last period.
607 atomic_set(&pl->pl_grant_rate, 0);
608 atomic_set(&pl->pl_cancel_rate, 0);
610 spin_unlock(&pl->pl_lock);
613 if (pl->pl_ops->po_recalc != NULL) {
614 count = pl->pl_ops->po_recalc(pl);
615 lprocfs_counter_add(pl->pl_stats, LDLM_POOL_RECALC_STAT,
618 recalc_interval_sec = pl->pl_recalc_time - cfs_time_current_sec() +
619 pl->pl_recalc_period;
620 if (recalc_interval_sec <= 0) {
621 /* Prevent too frequent recalculation. */
622 CDEBUG(D_DLMTRACE, "Negative interval(%ld), "
623 "too short period(%ld)",
625 pl->pl_recalc_period);
626 recalc_interval_sec = 1;
629 return recalc_interval_sec;
633 * Pool shrink wrapper. Will call either client or server pool recalc callback
634 * depending what pool \a pl is used.
636 int ldlm_pool_shrink(struct ldlm_pool *pl, int nr, gfp_t gfp_mask)
640 if (pl->pl_ops->po_shrink != NULL) {
641 cancel = pl->pl_ops->po_shrink(pl, nr, gfp_mask);
643 lprocfs_counter_add(pl->pl_stats,
644 LDLM_POOL_SHRINK_REQTD_STAT,
646 lprocfs_counter_add(pl->pl_stats,
647 LDLM_POOL_SHRINK_FREED_STAT,
649 CDEBUG(D_DLMTRACE, "%s: request to shrink %d locks, "
650 "shrunk %d\n", pl->pl_name, nr, cancel);
655 EXPORT_SYMBOL(ldlm_pool_shrink);
658 * Pool setup wrapper. Will call either client or server pool recalc callback
659 * depending what pool \a pl is used.
661 * Sets passed \a limit into pool \a pl.
663 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
665 if (pl->pl_ops->po_setup != NULL)
666 return(pl->pl_ops->po_setup(pl, limit));
669 EXPORT_SYMBOL(ldlm_pool_setup);
672 static int lprocfs_pool_state_seq_show(struct seq_file *m, void *unused)
674 int granted, grant_rate, cancel_rate, grant_step;
675 int grant_speed, grant_plan, lvf;
676 struct ldlm_pool *pl = m->private;
680 spin_lock(&pl->pl_lock);
681 slv = pl->pl_server_lock_volume;
682 clv = pl->pl_client_lock_volume;
683 limit = ldlm_pool_get_limit(pl);
684 grant_plan = pl->pl_grant_plan;
685 granted = atomic_read(&pl->pl_granted);
686 grant_rate = atomic_read(&pl->pl_grant_rate);
687 cancel_rate = atomic_read(&pl->pl_cancel_rate);
688 grant_speed = grant_rate - cancel_rate;
689 lvf = atomic_read(&pl->pl_lock_volume_factor);
690 grant_step = ldlm_pool_t2gsp(pl->pl_recalc_period);
691 spin_unlock(&pl->pl_lock);
693 seq_printf(m, "LDLM pool state (%s):\n"
697 pl->pl_name, slv, clv, lvf);
699 if (ns_is_server(ldlm_pl2ns(pl))) {
700 seq_printf(m, " GSP: %d%%\n"
702 grant_step, grant_plan);
704 seq_printf(m, " GR: %d\n" " CR: %d\n" " GS: %d\n"
705 " G: %d\n" " L: %d\n",
706 grant_rate, cancel_rate, grant_speed,
710 LPROC_SEQ_FOPS_RO(lprocfs_pool_state);
712 static int lprocfs_grant_speed_seq_show(struct seq_file *m, void *unused)
714 struct ldlm_pool *pl = m->private;
717 spin_lock(&pl->pl_lock);
718 /* serialize with ldlm_pool_recalc */
719 grant_speed = atomic_read(&pl->pl_grant_rate) -
720 atomic_read(&pl->pl_cancel_rate);
721 spin_unlock(&pl->pl_lock);
722 return lprocfs_uint_seq_show(m, &grant_speed);
725 LDLM_POOL_PROC_READER_SEQ_SHOW(grant_plan, int);
726 LPROC_SEQ_FOPS_RO(lprocfs_grant_plan);
728 LDLM_POOL_PROC_READER_SEQ_SHOW(recalc_period, int);
729 LDLM_POOL_PROC_WRITER(recalc_period, int);
730 static ssize_t lprocfs_recalc_period_seq_write(struct file *file, const char *buf,
731 size_t len, loff_t *off)
733 struct seq_file *seq = file->private_data;
735 return lprocfs_wr_recalc_period(file, buf, len, seq->private);
737 LPROC_SEQ_FOPS(lprocfs_recalc_period);
739 LPROC_SEQ_FOPS_RO_TYPE(ldlm_pool, u64);
740 LPROC_SEQ_FOPS_RO_TYPE(ldlm_pool, atomic);
741 LPROC_SEQ_FOPS_RW_TYPE(ldlm_pool_rw, atomic);
743 LPROC_SEQ_FOPS_RO(lprocfs_grant_speed);
745 static int ldlm_pool_proc_init(struct ldlm_pool *pl)
747 struct ldlm_namespace *ns = ldlm_pl2ns(pl);
748 struct proc_dir_entry *parent_ns_proc;
749 struct lprocfs_seq_vars pool_vars[2];
750 char *var_name = NULL;
754 OBD_ALLOC(var_name, MAX_STRING_SIZE + 1);
758 parent_ns_proc = ns->ns_proc_dir_entry;
759 if (parent_ns_proc == NULL) {
760 CERROR("%s: proc entry is not initialized\n",
762 GOTO(out_free_name, rc = -EINVAL);
764 pl->pl_proc_dir = lprocfs_seq_register("pool", parent_ns_proc,
766 if (IS_ERR(pl->pl_proc_dir)) {
767 rc = PTR_ERR(pl->pl_proc_dir);
768 pl->pl_proc_dir = NULL;
769 CERROR("%s: cannot create 'pool' proc entry: rc = %d\n",
770 ldlm_ns_name(ns), rc);
771 GOTO(out_free_name, rc);
774 var_name[MAX_STRING_SIZE] = '\0';
775 memset(pool_vars, 0, sizeof(pool_vars));
776 pool_vars[0].name = var_name;
778 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "server_lock_volume",
779 &pl->pl_server_lock_volume, &ldlm_pool_u64_fops);
780 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "limit", &pl->pl_limit,
781 &ldlm_pool_rw_atomic_fops);
782 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "granted",
783 &pl->pl_granted, &ldlm_pool_atomic_fops);
784 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "grant_speed", pl,
785 &lprocfs_grant_speed_fops);
786 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "cancel_rate",
787 &pl->pl_cancel_rate, &ldlm_pool_atomic_fops);
788 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "grant_rate",
789 &pl->pl_grant_rate, &ldlm_pool_atomic_fops);
790 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "grant_plan", pl,
791 &lprocfs_grant_plan_fops);
792 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "recalc_period",
793 pl, &lprocfs_recalc_period_fops);
794 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "lock_volume_factor",
795 &pl->pl_lock_volume_factor, &ldlm_pool_rw_atomic_fops);
796 ldlm_add_var(&pool_vars[0], pl->pl_proc_dir, "state", pl,
797 &lprocfs_pool_state_fops);
799 pl->pl_stats = lprocfs_alloc_stats(LDLM_POOL_LAST_STAT -
800 LDLM_POOL_FIRST_STAT, 0);
802 GOTO(out_free_name, rc = -ENOMEM);
804 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANTED_STAT,
805 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
807 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_STAT,
808 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
810 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_STAT,
811 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
813 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_RATE_STAT,
814 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
815 "grant_rate", "locks/s");
816 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_CANCEL_RATE_STAT,
817 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
818 "cancel_rate", "locks/s");
819 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_GRANT_PLAN_STAT,
820 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
821 "grant_plan", "locks/s");
822 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SLV_STAT,
823 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
825 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_REQTD_STAT,
826 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
827 "shrink_request", "locks");
828 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_SHRINK_FREED_STAT,
829 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
830 "shrink_freed", "locks");
831 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_RECALC_STAT,
832 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
833 "recalc_freed", "locks");
834 lprocfs_counter_init(pl->pl_stats, LDLM_POOL_TIMING_STAT,
835 LPROCFS_CNTR_AVGMINMAX | LPROCFS_CNTR_STDDEV,
836 "recalc_timing", "sec");
837 rc = lprocfs_register_stats(pl->pl_proc_dir, "stats", pl->pl_stats);
841 OBD_FREE(var_name, MAX_STRING_SIZE + 1);
845 static void ldlm_pool_proc_fini(struct ldlm_pool *pl)
847 if (pl->pl_stats != NULL) {
848 lprocfs_free_stats(&pl->pl_stats);
851 if (pl->pl_proc_dir != NULL) {
852 lprocfs_remove(&pl->pl_proc_dir);
853 pl->pl_proc_dir = NULL;
856 #else /* !__KERNEL__*/
857 #define ldlm_pool_proc_init(pl) (0)
858 #define ldlm_pool_proc_fini(pl) while (0) {}
861 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
862 int idx, ldlm_side_t client)
867 spin_lock_init(&pl->pl_lock);
868 atomic_set(&pl->pl_granted, 0);
869 pl->pl_recalc_time = cfs_time_current_sec();
870 atomic_set(&pl->pl_lock_volume_factor, 1);
872 atomic_set(&pl->pl_grant_rate, 0);
873 atomic_set(&pl->pl_cancel_rate, 0);
874 pl->pl_grant_plan = LDLM_POOL_GP(LDLM_POOL_HOST_L);
876 snprintf(pl->pl_name, sizeof(pl->pl_name), "ldlm-pool-%s-%d",
877 ldlm_ns_name(ns), idx);
879 if (client == LDLM_NAMESPACE_SERVER) {
880 pl->pl_ops = &ldlm_srv_pool_ops;
881 ldlm_pool_set_limit(pl, LDLM_POOL_HOST_L);
882 pl->pl_recalc_period = LDLM_POOL_SRV_DEF_RECALC_PERIOD;
883 pl->pl_server_lock_volume = ldlm_pool_slv_max(LDLM_POOL_HOST_L);
885 ldlm_pool_set_limit(pl, 1);
886 pl->pl_server_lock_volume = 0;
887 pl->pl_ops = &ldlm_cli_pool_ops;
888 pl->pl_recalc_period = LDLM_POOL_CLI_DEF_RECALC_PERIOD;
890 pl->pl_client_lock_volume = 0;
891 rc = ldlm_pool_proc_init(pl);
895 CDEBUG(D_DLMTRACE, "Lock pool %s is initialized\n", pl->pl_name);
899 EXPORT_SYMBOL(ldlm_pool_init);
901 void ldlm_pool_fini(struct ldlm_pool *pl)
904 ldlm_pool_proc_fini(pl);
907 * Pool should not be used after this point. We can't free it here as
908 * it lives in struct ldlm_namespace, but still interested in catching
909 * any abnormal using cases.
911 POISON(pl, 0x5a, sizeof(*pl));
914 EXPORT_SYMBOL(ldlm_pool_fini);
917 * Add new taken ldlm lock \a lock into pool \a pl accounting.
919 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
922 * FLOCK locks are special in a sense that they are almost never
923 * cancelled, instead special kind of lock is used to drop them.
924 * also there is no LRU for flock locks, so no point in tracking
927 if (lock->l_resource->lr_type == LDLM_FLOCK)
930 atomic_inc(&pl->pl_granted);
931 atomic_inc(&pl->pl_grant_rate);
932 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_GRANT_STAT);
934 * Do not do pool recalc for client side as all locks which
935 * potentially may be canceled has already been packed into
936 * enqueue/cancel rpc. Also we do not want to run out of stack
937 * with too long call paths.
939 if (ns_is_server(ldlm_pl2ns(pl)))
940 ldlm_pool_recalc(pl);
942 EXPORT_SYMBOL(ldlm_pool_add);
945 * Remove ldlm lock \a lock from pool \a pl accounting.
947 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
950 * Filter out FLOCK locks. Read above comment in ldlm_pool_add().
952 if (lock->l_resource->lr_type == LDLM_FLOCK)
955 LASSERT(atomic_read(&pl->pl_granted) > 0);
956 atomic_dec(&pl->pl_granted);
957 atomic_inc(&pl->pl_cancel_rate);
959 lprocfs_counter_incr(pl->pl_stats, LDLM_POOL_CANCEL_STAT);
961 if (ns_is_server(ldlm_pl2ns(pl)))
962 ldlm_pool_recalc(pl);
964 EXPORT_SYMBOL(ldlm_pool_del);
967 * Returns current \a pl SLV.
969 * \pre ->pl_lock is not locked.
971 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
974 spin_lock(&pl->pl_lock);
975 slv = pl->pl_server_lock_volume;
976 spin_unlock(&pl->pl_lock);
979 EXPORT_SYMBOL(ldlm_pool_get_slv);
982 * Sets passed \a slv to \a pl.
984 * \pre ->pl_lock is not locked.
986 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
988 spin_lock(&pl->pl_lock);
989 pl->pl_server_lock_volume = slv;
990 spin_unlock(&pl->pl_lock);
992 EXPORT_SYMBOL(ldlm_pool_set_slv);
995 * Returns current \a pl CLV.
997 * \pre ->pl_lock is not locked.
999 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
1002 spin_lock(&pl->pl_lock);
1003 slv = pl->pl_client_lock_volume;
1004 spin_unlock(&pl->pl_lock);
1007 EXPORT_SYMBOL(ldlm_pool_get_clv);
1010 * Sets passed \a clv to \a pl.
1012 * \pre ->pl_lock is not locked.
1014 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1016 spin_lock(&pl->pl_lock);
1017 pl->pl_client_lock_volume = clv;
1018 spin_unlock(&pl->pl_lock);
1020 EXPORT_SYMBOL(ldlm_pool_set_clv);
1023 * Returns current \a pl limit.
1025 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1027 return atomic_read(&pl->pl_limit);
1029 EXPORT_SYMBOL(ldlm_pool_get_limit);
1032 * Sets passed \a limit to \a pl.
1034 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1036 atomic_set(&pl->pl_limit, limit);
1038 EXPORT_SYMBOL(ldlm_pool_set_limit);
1041 * Returns current LVF from \a pl.
1043 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1045 return atomic_read(&pl->pl_lock_volume_factor);
1047 EXPORT_SYMBOL(ldlm_pool_get_lvf);
1050 static unsigned int ldlm_pool_granted(struct ldlm_pool *pl)
1052 return atomic_read(&pl->pl_granted);
1055 static struct ptlrpc_thread *ldlm_pools_thread;
1056 static struct shrinker *ldlm_pools_srv_shrinker;
1057 static struct shrinker *ldlm_pools_cli_shrinker;
1058 static struct completion ldlm_pools_comp;
1061 * count locks from all namespaces (if possible). Returns number of
1064 static unsigned long ldlm_pools_count(ldlm_side_t client, gfp_t gfp_mask)
1066 int total = 0, nr_ns;
1067 struct ldlm_namespace *ns;
1068 struct ldlm_namespace *ns_old = NULL; /* loop detection */
1071 if (client == LDLM_NAMESPACE_CLIENT && !(gfp_mask & __GFP_FS))
1074 CDEBUG(D_DLMTRACE, "Request to count %s locks from all pools\n",
1075 client == LDLM_NAMESPACE_CLIENT ? "client" : "server");
1077 cookie = cl_env_reenter();
1080 * Find out how many resources we may release.
1082 for (nr_ns = ldlm_namespace_nr_read(client);
1083 nr_ns > 0; nr_ns--) {
1084 mutex_lock(ldlm_namespace_lock(client));
1085 if (list_empty(ldlm_namespace_list(client))) {
1086 mutex_unlock(ldlm_namespace_lock(client));
1087 cl_env_reexit(cookie);
1090 ns = ldlm_namespace_first_locked(client);
1093 mutex_unlock(ldlm_namespace_lock(client));
1097 if (ldlm_ns_empty(ns)) {
1098 ldlm_namespace_move_to_inactive_locked(ns, client);
1099 mutex_unlock(ldlm_namespace_lock(client));
1106 ldlm_namespace_get(ns);
1107 ldlm_namespace_move_to_active_locked(ns, client);
1108 mutex_unlock(ldlm_namespace_lock(client));
1109 total += ldlm_pool_shrink(&ns->ns_pool, 0, gfp_mask);
1110 ldlm_namespace_put(ns);
1113 cl_env_reexit(cookie);
1117 static unsigned long ldlm_pools_scan(ldlm_side_t client, int nr,
1120 unsigned long freed = 0;
1122 struct ldlm_namespace *ns;
1125 if (client == LDLM_NAMESPACE_CLIENT && !(gfp_mask & __GFP_FS))
1128 cookie = cl_env_reenter();
1131 * Shrink at least ldlm_namespace_nr_read(client) namespaces.
1133 for (tmp = nr_ns = ldlm_namespace_nr_read(client);
1135 int cancel, nr_locks;
1138 * Do not call shrink under ldlm_namespace_lock(client)
1140 mutex_lock(ldlm_namespace_lock(client));
1141 if (list_empty(ldlm_namespace_list(client))) {
1142 mutex_unlock(ldlm_namespace_lock(client));
1145 ns = ldlm_namespace_first_locked(client);
1146 ldlm_namespace_get(ns);
1147 ldlm_namespace_move_to_active_locked(ns, client);
1148 mutex_unlock(ldlm_namespace_lock(client));
1150 nr_locks = ldlm_pool_granted(&ns->ns_pool);
1152 * We use to shrink propotionally but with new shrinker API,
1153 * we lost the total number of freeable locks.
1155 cancel = 1 + min_t(int, nr_locks, nr / nr_ns);
1156 freed += ldlm_pool_shrink(&ns->ns_pool, cancel, gfp_mask);
1157 ldlm_namespace_put(ns);
1159 cl_env_reexit(cookie);
1161 * we only decrease the SLV in server pools shrinker, return
1162 * SHRINK_STOP to kernel to avoid needless loop. LU-1128
1164 return (client == LDLM_NAMESPACE_SERVER) ? SHRINK_STOP : freed;
1167 #ifdef HAVE_SHRINKER_COUNT
1168 static unsigned long ldlm_pools_srv_count(struct shrinker *s,
1169 struct shrink_control *sc)
1171 return ldlm_pools_count(LDLM_NAMESPACE_SERVER, sc->gfp_mask);
1174 static unsigned long ldlm_pools_srv_scan(struct shrinker *s,
1175 struct shrink_control *sc)
1177 return ldlm_pools_scan(LDLM_NAMESPACE_SERVER, sc->nr_to_scan,
1181 static unsigned long ldlm_pools_cli_count(struct shrinker *s, struct shrink_control *sc)
1183 return ldlm_pools_count(LDLM_NAMESPACE_CLIENT, sc->gfp_mask);
1186 static unsigned long ldlm_pools_cli_scan(struct shrinker *s,
1187 struct shrink_control *sc)
1189 return ldlm_pools_scan(LDLM_NAMESPACE_CLIENT, sc->nr_to_scan,
1195 * Cancel \a nr locks from all namespaces (if possible). Returns number of
1196 * cached locks after shrink is finished. All namespaces are asked to
1197 * cancel approximately equal amount of locks to keep balancing.
1199 static int ldlm_pools_shrink(ldlm_side_t client, int nr,
1202 unsigned int total = 0;
1204 if (client == LDLM_NAMESPACE_CLIENT && nr != 0 &&
1205 !(gfp_mask & __GFP_FS))
1208 CDEBUG(D_DLMTRACE, "Request to shrink %d %s locks from all pools\n",
1209 nr, client == LDLM_NAMESPACE_CLIENT ? "client" : "server");
1211 total = ldlm_pools_count(client, gfp_mask);
1213 if (nr == 0 || total == 0)
1216 return ldlm_pools_scan(client, nr, gfp_mask);
1219 static int ldlm_pools_srv_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
1221 return ldlm_pools_shrink(LDLM_NAMESPACE_SERVER,
1222 shrink_param(sc, nr_to_scan),
1223 shrink_param(sc, gfp_mask));
1226 static int ldlm_pools_cli_shrink(SHRINKER_ARGS(sc, nr_to_scan, gfp_mask))
1228 return ldlm_pools_shrink(LDLM_NAMESPACE_CLIENT,
1229 shrink_param(sc, nr_to_scan),
1230 shrink_param(sc, gfp_mask));
1233 #endif /* HAVE_SHRINKER_COUNT */
1235 int ldlm_pools_recalc(ldlm_side_t client)
1237 __u32 nr_l = 0, nr_p = 0, l;
1238 struct ldlm_namespace *ns;
1239 struct ldlm_namespace *ns_old = NULL;
1241 int time = 50; /* seconds of sleep if no active namespaces */
1244 * No need to setup pool limit for client pools.
1246 if (client == LDLM_NAMESPACE_SERVER) {
1248 * Check all modest namespaces first.
1250 mutex_lock(ldlm_namespace_lock(client));
1251 list_for_each_entry(ns, ldlm_namespace_list(client),
1254 if (ns->ns_appetite != LDLM_NAMESPACE_MODEST)
1257 l = ldlm_pool_granted(&ns->ns_pool);
1262 * Set the modest pools limit equal to their avg granted
1265 l += dru(l, LDLM_POOLS_MODEST_MARGIN_SHIFT, 0);
1266 ldlm_pool_setup(&ns->ns_pool, l);
1272 * Make sure that modest namespaces did not eat more that 2/3
1275 if (nr_l >= 2 * (LDLM_POOL_HOST_L / 3)) {
1276 CWARN("\"Modest\" pools eat out 2/3 of server locks "
1277 "limit (%d of %lu). This means that you have too "
1278 "many clients for this amount of server RAM. "
1279 "Upgrade server!\n", nr_l, LDLM_POOL_HOST_L);
1284 * The rest is given to greedy namespaces.
1286 list_for_each_entry(ns, ldlm_namespace_list(client),
1289 if (!equal && ns->ns_appetite != LDLM_NAMESPACE_GREEDY)
1294 * In the case 2/3 locks are eaten out by
1295 * modest pools, we re-setup equal limit
1298 l = LDLM_POOL_HOST_L /
1299 ldlm_namespace_nr_read(client);
1302 * All the rest of greedy pools will have
1303 * all locks in equal parts.
1305 l = (LDLM_POOL_HOST_L - nr_l) /
1306 (ldlm_namespace_nr_read(client) -
1309 ldlm_pool_setup(&ns->ns_pool, l);
1311 mutex_unlock(ldlm_namespace_lock(client));
1315 * Recalc at least ldlm_namespace_nr(client) namespaces.
1317 for (nr = ldlm_namespace_nr_read(client); nr > 0; nr--) {
1320 * Lock the list, get first @ns in the list, getref, move it
1321 * to the tail, unlock and call pool recalc. This way we avoid
1322 * calling recalc under @ns lock what is really good as we get
1323 * rid of potential deadlock on client nodes when canceling
1324 * locks synchronously.
1326 mutex_lock(ldlm_namespace_lock(client));
1327 if (list_empty(ldlm_namespace_list(client))) {
1328 mutex_unlock(ldlm_namespace_lock(client));
1331 ns = ldlm_namespace_first_locked(client);
1333 if (ns_old == ns) { /* Full pass complete */
1334 mutex_unlock(ldlm_namespace_lock(client));
1338 /* We got an empty namespace, need to move it back to inactive
1340 * The race with parallel resource creation is fine:
1341 * - If they do namespace_get before our check, we fail the
1342 * check and they move this item to the end of the list anyway
1343 * - If we do the check and then they do namespace_get, then
1344 * we move the namespace to inactive and they will move
1345 * it back to active (synchronised by the lock, so no clash
1348 if (ldlm_ns_empty(ns)) {
1349 ldlm_namespace_move_to_inactive_locked(ns, client);
1350 mutex_unlock(ldlm_namespace_lock(client));
1357 spin_lock(&ns->ns_lock);
1359 * skip ns which is being freed, and we don't want to increase
1360 * its refcount again, not even temporarily. bz21519 & LU-499.
1362 if (ns->ns_stopping) {
1366 ldlm_namespace_get(ns);
1368 spin_unlock(&ns->ns_lock);
1370 ldlm_namespace_move_to_active_locked(ns, client);
1371 mutex_unlock(ldlm_namespace_lock(client));
1374 * After setup is done - recalc the pool.
1377 int ttime = ldlm_pool_recalc(&ns->ns_pool);
1382 ldlm_namespace_put(ns);
1387 EXPORT_SYMBOL(ldlm_pools_recalc);
1389 static int ldlm_pools_thread_main(void *arg)
1391 struct ptlrpc_thread *thread = (struct ptlrpc_thread *)arg;
1395 thread_set_flags(thread, SVC_RUNNING);
1396 wake_up(&thread->t_ctl_waitq);
1398 CDEBUG(D_DLMTRACE, "%s: pool thread starting, process %d\n",
1399 "ldlm_poold", current_pid());
1402 struct l_wait_info lwi;
1405 * Recal all pools on this tick.
1407 s_time = ldlm_pools_recalc(LDLM_NAMESPACE_SERVER);
1408 c_time = ldlm_pools_recalc(LDLM_NAMESPACE_CLIENT);
1411 * Wait until the next check time, or until we're
1414 lwi = LWI_TIMEOUT(cfs_time_seconds(min(s_time, c_time)),
1416 l_wait_event(thread->t_ctl_waitq,
1417 thread_is_stopping(thread) ||
1418 thread_is_event(thread),
1421 if (thread_test_and_clear_flags(thread, SVC_STOPPING))
1424 thread_test_and_clear_flags(thread, SVC_EVENT);
1427 thread_set_flags(thread, SVC_STOPPED);
1428 wake_up(&thread->t_ctl_waitq);
1430 CDEBUG(D_DLMTRACE, "%s: pool thread exiting, process %d\n",
1431 "ldlm_poold", current_pid());
1433 complete_and_exit(&ldlm_pools_comp, 0);
1436 static int ldlm_pools_thread_start(void)
1438 struct l_wait_info lwi = { 0 };
1439 struct task_struct *task;
1442 if (ldlm_pools_thread != NULL)
1445 OBD_ALLOC_PTR(ldlm_pools_thread);
1446 if (ldlm_pools_thread == NULL)
1449 init_completion(&ldlm_pools_comp);
1450 init_waitqueue_head(&ldlm_pools_thread->t_ctl_waitq);
1452 task = kthread_run(ldlm_pools_thread_main, ldlm_pools_thread,
1455 CERROR("Can't start pool thread, error %ld\n", PTR_ERR(task));
1456 OBD_FREE(ldlm_pools_thread, sizeof(*ldlm_pools_thread));
1457 ldlm_pools_thread = NULL;
1458 RETURN(PTR_ERR(task));
1460 l_wait_event(ldlm_pools_thread->t_ctl_waitq,
1461 thread_is_running(ldlm_pools_thread), &lwi);
1465 static void ldlm_pools_thread_stop(void)
1469 if (ldlm_pools_thread == NULL) {
1474 thread_set_flags(ldlm_pools_thread, SVC_STOPPING);
1475 wake_up(&ldlm_pools_thread->t_ctl_waitq);
1478 * Make sure that pools thread is finished before freeing @thread.
1479 * This fixes possible race and oops due to accessing freed memory
1482 wait_for_completion(&ldlm_pools_comp);
1483 OBD_FREE_PTR(ldlm_pools_thread);
1484 ldlm_pools_thread = NULL;
1488 int ldlm_pools_init(void)
1491 DEF_SHRINKER_VAR(shsvar, ldlm_pools_srv_shrink,
1492 ldlm_pools_srv_count, ldlm_pools_srv_scan);
1493 DEF_SHRINKER_VAR(shcvar, ldlm_pools_cli_shrink,
1494 ldlm_pools_cli_count, ldlm_pools_cli_scan);
1497 rc = ldlm_pools_thread_start();
1499 ldlm_pools_srv_shrinker =
1500 set_shrinker(DEFAULT_SEEKS, &shsvar);
1501 ldlm_pools_cli_shrinker =
1502 set_shrinker(DEFAULT_SEEKS, &shcvar);
1506 EXPORT_SYMBOL(ldlm_pools_init);
1508 void ldlm_pools_fini(void)
1510 if (ldlm_pools_srv_shrinker != NULL) {
1511 remove_shrinker(ldlm_pools_srv_shrinker);
1512 ldlm_pools_srv_shrinker = NULL;
1514 if (ldlm_pools_cli_shrinker != NULL) {
1515 remove_shrinker(ldlm_pools_cli_shrinker);
1516 ldlm_pools_cli_shrinker = NULL;
1518 ldlm_pools_thread_stop();
1520 EXPORT_SYMBOL(ldlm_pools_fini);
1521 #endif /* __KERNEL__ */
1523 #else /* !HAVE_LRU_RESIZE_SUPPORT */
1524 int ldlm_pool_setup(struct ldlm_pool *pl, int limit)
1528 EXPORT_SYMBOL(ldlm_pool_setup);
1530 int ldlm_pool_recalc(struct ldlm_pool *pl)
1534 EXPORT_SYMBOL(ldlm_pool_recalc);
1536 int ldlm_pool_shrink(struct ldlm_pool *pl,
1537 int nr, gfp_t gfp_mask)
1541 EXPORT_SYMBOL(ldlm_pool_shrink);
1543 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
1544 int idx, ldlm_side_t client)
1548 EXPORT_SYMBOL(ldlm_pool_init);
1550 void ldlm_pool_fini(struct ldlm_pool *pl)
1554 EXPORT_SYMBOL(ldlm_pool_fini);
1556 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock)
1560 EXPORT_SYMBOL(ldlm_pool_add);
1562 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock)
1566 EXPORT_SYMBOL(ldlm_pool_del);
1568 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl)
1572 EXPORT_SYMBOL(ldlm_pool_get_slv);
1574 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv)
1578 EXPORT_SYMBOL(ldlm_pool_set_slv);
1580 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl)
1584 EXPORT_SYMBOL(ldlm_pool_get_clv);
1586 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv)
1590 EXPORT_SYMBOL(ldlm_pool_set_clv);
1592 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl)
1596 EXPORT_SYMBOL(ldlm_pool_get_limit);
1598 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit)
1602 EXPORT_SYMBOL(ldlm_pool_set_limit);
1604 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl)
1608 EXPORT_SYMBOL(ldlm_pool_get_lvf);
1610 int ldlm_pools_init(void)
1614 EXPORT_SYMBOL(ldlm_pools_init);
1616 void ldlm_pools_fini(void)
1620 EXPORT_SYMBOL(ldlm_pools_fini);
1622 int ldlm_pools_recalc(ldlm_side_t client)
1626 EXPORT_SYMBOL(ldlm_pools_recalc);
1627 #endif /* HAVE_LRU_RESIZE_SUPPORT */