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.
37 /** \defgroup LDLM Lustre Distributed Lock Manager
39 * Lustre DLM is based on VAX DLM.
40 * Its two main roles are:
41 * - To provide locking assuring consistency of data on all Lustre nodes.
42 * - To allow clients to cache state protected by a lock by holding the
43 * lock until a conflicting lock is requested or it is expired by the LRU.
48 #ifndef _LUSTRE_DLM_H__
49 #define _LUSTRE_DLM_H__
51 #include <linux/lustre_dlm.h>
53 #include <lustre_lib.h>
54 #include <lustre_net.h>
55 #include <lustre_import.h>
56 #include <lustre_handles.h>
57 #include <interval_tree.h> /* for interval_node{}, ldlm_extent */
60 #include "lustre_dlm_flags.h"
65 #define OBD_LDLM_DEVICENAME "ldlm"
67 #define LDLM_DEFAULT_LRU_SIZE (100 * num_online_cpus())
68 #define LDLM_DEFAULT_MAX_ALIVE (cfs_time_seconds(36000))
69 #define LDLM_CTIME_AGE_LIMIT (10)
70 #define LDLM_DEFAULT_PARALLEL_AST_LIMIT 1024
73 * LDLM non-error return states
78 ELDLM_LOCK_CHANGED = 300,
79 ELDLM_LOCK_ABORTED = 301,
80 ELDLM_LOCK_REPLACED = 302,
81 ELDLM_NO_LOCK_DATA = 303,
82 ELDLM_LOCK_WOULDBLOCK = 304,
84 ELDLM_NAMESPACE_EXISTS = 400,
85 ELDLM_BAD_NAMESPACE = 401
89 * LDLM namespace type.
90 * The "client" type is actually an indication that this is a narrow local view
91 * into complete namespace on the server. Such namespaces cannot make any
92 * decisions about lack of conflicts or do any autonomous lock granting without
93 * first speaking to a server.
96 LDLM_NAMESPACE_SERVER = 1 << 0,
97 LDLM_NAMESPACE_CLIENT = 1 << 1
101 * The blocking callback is overloaded to perform two functions. These flags
102 * indicate which operation should be performed.
104 #define LDLM_CB_BLOCKING 1
105 #define LDLM_CB_CANCELING 2
108 * \name Lock Compatibility Matrix.
110 * A lock has both a type (extent, flock, inode bits, or plain) and a mode.
111 * Lock types are described in their respective implementation files:
112 * ldlm_{extent,flock,inodebits,plain}.c.
114 * There are six lock modes along with a compatibility matrix to indicate if
115 * two locks are compatible.
117 * - EX: Exclusive mode. Before a new file is created, MDS requests EX lock
119 * - PW: Protective Write (normal write) mode. When a client requests a write
120 * lock from an OST, a lock with PW mode will be issued.
121 * - PR: Protective Read (normal read) mode. When a client requests a read from
122 * an OST, a lock with PR mode will be issued. Also, if the client opens a
123 * file for execution, it is granted a lock with PR mode.
124 * - CW: Concurrent Write mode. The type of lock that the MDS grants if a client
125 * requests a write lock during a file open operation.
126 * - CR Concurrent Read mode. When a client performs a path lookup, MDS grants
127 * an inodebit lock with the CR mode on the intermediate path component.
141 #define LCK_COMPAT_EX LCK_NL
142 #define LCK_COMPAT_PW (LCK_COMPAT_EX | LCK_CR)
143 #define LCK_COMPAT_PR (LCK_COMPAT_PW | LCK_PR)
144 #define LCK_COMPAT_CW (LCK_COMPAT_PW | LCK_CW)
145 #define LCK_COMPAT_CR (LCK_COMPAT_CW | LCK_PR | LCK_PW)
146 #define LCK_COMPAT_NL (LCK_COMPAT_CR | LCK_EX | LCK_GROUP)
147 #define LCK_COMPAT_GROUP (LCK_GROUP | LCK_NL)
148 #define LCK_COMPAT_COS (LCK_COS)
149 /** @} Lock Compatibility Matrix */
151 extern ldlm_mode_t lck_compat_array[];
153 static inline void lockmode_verify(ldlm_mode_t mode)
155 LASSERT(mode > LCK_MINMODE && mode < LCK_MAXMODE);
158 static inline int lockmode_compat(ldlm_mode_t exist_mode, ldlm_mode_t new_mode)
160 return (lck_compat_array[exist_mode] & new_mode);
165 * cluster name spaces
169 #define DLM_OST_NAMESPACE 1
170 #define DLM_MDS_NAMESPACE 2
173 - do we just separate this by security domains and use a prefix for
174 multiple namespaces in the same domain?
179 * Locking rules for LDLM:
184 * waiting_locks_spinlock
199 struct ldlm_resource;
200 struct ldlm_namespace;
203 * Operations on LDLM pools.
204 * LDLM pool is a pool of locks in the namespace without any implicitly
206 * Locks in the pool are organized in LRU.
207 * Local memory pressure or server instructions (e.g. mempressure on server)
208 * can trigger freeing of locks from the pool
210 struct ldlm_pool_ops {
211 /** Recalculate pool \a pl usage */
212 int (*po_recalc)(struct ldlm_pool *pl);
213 /** Cancel at least \a nr locks from pool \a pl */
214 int (*po_shrink)(struct ldlm_pool *pl, int nr,
216 int (*po_setup)(struct ldlm_pool *pl, int limit);
219 /** One second for pools thread check interval. Each pool has own period. */
220 #define LDLM_POOLS_THREAD_PERIOD (1)
222 /** ~6% margin for modest pools. See ldlm_pool.c for details. */
223 #define LDLM_POOLS_MODEST_MARGIN_SHIFT (4)
225 /** Default recalc period for server side pools in sec. */
226 #define LDLM_POOL_SRV_DEF_RECALC_PERIOD (1)
228 /** Default recalc period for client side pools in sec. */
229 #define LDLM_POOL_CLI_DEF_RECALC_PERIOD (10)
232 * LDLM pool structure to track granted locks.
233 * For purposes of determining when to release locks on e.g. memory pressure.
234 * This feature is commonly referred to as lru_resize.
237 /** Pool proc directory. */
238 struct proc_dir_entry *pl_proc_dir;
239 /** Pool name, must be long enough to hold compound proc entry name. */
241 /** Lock for protecting SLV/CLV updates. */
243 /** Number of allowed locks in in pool, both, client and server side. */
245 /** Number of granted locks in */
247 /** Grant rate per T. */
248 atomic_t pl_grant_rate;
249 /** Cancel rate per T. */
250 atomic_t pl_cancel_rate;
251 /** Server lock volume (SLV). Protected by pl_lock. */
252 __u64 pl_server_lock_volume;
253 /** Current biggest client lock volume. Protected by pl_lock. */
254 __u64 pl_client_lock_volume;
255 /** Lock volume factor. SLV on client is calculated as following:
256 * server_slv * lock_volume_factor. */
257 atomic_t pl_lock_volume_factor;
258 /** Time when last SLV from server was obtained. */
259 time_t pl_recalc_time;
260 /** Recalculation period for pool. */
261 time_t pl_recalc_period;
262 /** Recalculation and shrink operations. */
263 const struct ldlm_pool_ops *pl_ops;
264 /** Number of planned locks for next period. */
266 /** Pool statistics. */
267 struct lprocfs_stats *pl_stats;
270 typedef int (*ldlm_res_policy)(struct ldlm_namespace *, struct ldlm_lock **,
271 void *req_cookie, ldlm_mode_t mode, __u64 flags,
274 typedef int (*ldlm_cancel_for_recovery)(struct ldlm_lock *lock);
278 * LVB is Lock Value Block. This is a special opaque (to LDLM) value that could
279 * be associated with an LDLM lock and transferred from client to server and
282 * Currently LVBs are used by:
283 * - OSC-OST code to maintain current object size/times
284 * - layout lock code to return the layout when the layout lock is granted
286 struct ldlm_valblock_ops {
287 int (*lvbo_init)(struct ldlm_resource *res);
288 int (*lvbo_update)(struct ldlm_resource *res,
289 struct ptlrpc_request *r,
291 int (*lvbo_free)(struct ldlm_resource *res);
292 /* Return size of lvb data appropriate RPC size can be reserved */
293 int (*lvbo_size)(struct ldlm_lock *lock);
294 /* Called to fill in lvb data to RPC buffer @buf */
295 int (*lvbo_fill)(struct ldlm_lock *lock, void *buf, int buflen);
299 * LDLM pools related, type of lock pool in the namespace.
300 * Greedy means release cached locks aggressively
303 LDLM_NAMESPACE_GREEDY = 1 << 0,
304 LDLM_NAMESPACE_MODEST = 1 << 1
308 * Default values for the "max_nolock_size", "contention_time" and
309 * "contended_locks" namespace tunables.
311 #define NS_DEFAULT_MAX_NOLOCK_BYTES 0
312 #define NS_DEFAULT_CONTENTION_SECONDS 2
313 #define NS_DEFAULT_CONTENDED_LOCKS 32
315 struct ldlm_ns_bucket {
316 /** back pointer to namespace */
317 struct ldlm_namespace *nsb_namespace;
319 * Estimated lock callback time. Used by adaptive timeout code to
320 * avoid spurious client evictions due to unresponsiveness when in
321 * fact the network or overall system load is at fault
323 struct adaptive_timeout nsb_at_estimate;
327 /** LDLM namespace lock stats */
334 LDLM_NS_TYPE_UNKNOWN = 0,
352 * Namespace serves to contain locks related to a particular service.
353 * There are two kinds of namespaces:
354 * - Server namespace has knowledge of all locks and is therefore authoritative
355 * to make decisions like what locks could be granted and what conflicts
356 * exist during new lock enqueue.
357 * - Client namespace only has limited knowledge about locks in the namespace,
358 * only seeing locks held by the client.
360 * Every Lustre service has one server namespace present on the server serving
361 * that service. Every client connected to the service has a client namespace
363 * Every lock obtained by client in that namespace is actually represented by
364 * two in-memory locks. One on the server and one on the client. The locks are
365 * linked by a special cookie by which one node can tell to the other which lock
366 * it actually means during communications. Such locks are called remote locks.
367 * The locks held by server only without any reference to a client are called
370 struct ldlm_namespace {
371 /** Backward link to OBD, required for LDLM pool to store new SLV. */
372 struct obd_device *ns_obd;
374 /** Flag indicating if namespace is on client instead of server */
375 ldlm_side_t ns_client;
377 /** Resource hash table for namespace. */
378 struct cfs_hash *ns_rs_hash;
383 /** big refcount (by bucket) */
387 * Namespace connect flags supported by server (may be changed via
388 * /proc, LRU resize may be disabled/enabled).
390 __u64 ns_connect_flags;
392 /** Client side original connect flags supported by server. */
393 __u64 ns_orig_connect_flags;
395 /* namespace proc dir entry */
396 struct proc_dir_entry *ns_proc_dir_entry;
399 * Position in global namespace list linking all namespaces on
402 struct list_head ns_list_chain;
405 * List of unused locks for this namespace. This list is also called
407 * Unused locks are locks with zero reader/writer reference counts.
408 * This list is only used on clients for lock caching purposes.
409 * When we want to release some locks voluntarily or if server wants
410 * us to release some locks due to e.g. memory pressure, we take locks
411 * to release from the head of this list.
412 * Locks are linked via l_lru field in \see struct ldlm_lock.
414 struct list_head ns_unused_list;
415 /** Number of locks in the LRU list above */
419 * Maximum number of locks permitted in the LRU. If 0, means locks
420 * are managed by pools and there is no preset limit, rather it is all
421 * controlled by available memory on this client and on server.
423 unsigned int ns_max_unused;
424 /** Maximum allowed age (last used time) for locks in the LRU */
425 unsigned int ns_max_age;
427 * Server only: number of times we evicted clients due to lack of reply
430 unsigned int ns_timeouts;
432 * Number of seconds since the file change time after which the
433 * MDT will return an UPDATE lock along with a LOOKUP lock.
434 * This allows the client to start caching negative dentries
435 * for a directory and may save an RPC for a later stat.
437 unsigned int ns_ctime_age_limit;
440 * Used to rate-limit ldlm_namespace_dump calls.
441 * \see ldlm_namespace_dump. Increased by 10 seconds every time
444 cfs_time_t ns_next_dump;
446 /** "policy" function that does actual lock conflict determination */
447 ldlm_res_policy ns_policy;
450 * LVB operations for this namespace.
451 * \see struct ldlm_valblock_ops
453 struct ldlm_valblock_ops *ns_lvbo;
456 * Used by filter code to store pointer to OBD of the service.
457 * Should be dropped in favor of \a ns_obd
462 * Wait queue used by __ldlm_namespace_free. Gets woken up every time
463 * a resource is removed.
465 wait_queue_head_t ns_waitq;
466 /** LDLM pool structure for this namespace */
467 struct ldlm_pool ns_pool;
468 /** Definition of how eagerly unused locks will be released from LRU */
469 ldlm_appetite_t ns_appetite;
472 * If more than \a ns_contended_locks are found, the resource is
473 * considered to be contended. Lock enqueues might specify that no
474 * contended locks should be granted
476 unsigned ns_contended_locks;
479 * The resources in this namespace remember contended state during
480 * \a ns_contention_time, in seconds.
482 unsigned ns_contention_time;
485 * Limit size of contended extent locks, in bytes.
486 * If extended lock is requested for more then this many bytes and
487 * caller instructs us not to grant contended locks, we would disregard
490 unsigned ns_max_nolock_size;
492 /** Limit of parallel AST RPC count. */
493 unsigned ns_max_parallel_ast;
495 /** Callback to cancel locks before replaying it during recovery. */
496 ldlm_cancel_for_recovery ns_cancel_for_recovery;
498 /** LDLM lock stats */
499 struct lprocfs_stats *ns_stats;
502 * Flag to indicate namespace is being freed. Used to determine if
503 * recalculation of LDLM pool statistics should be skipped.
505 unsigned ns_stopping:1;
509 * Returns 1 if namespace \a ns is a client namespace.
511 static inline int ns_is_client(struct ldlm_namespace *ns)
514 LASSERT(!(ns->ns_client & ~(LDLM_NAMESPACE_CLIENT |
515 LDLM_NAMESPACE_SERVER)));
516 LASSERT(ns->ns_client == LDLM_NAMESPACE_CLIENT ||
517 ns->ns_client == LDLM_NAMESPACE_SERVER);
518 return ns->ns_client == LDLM_NAMESPACE_CLIENT;
522 * Returns 1 if namespace \a ns is a server namespace.
524 static inline int ns_is_server(struct ldlm_namespace *ns)
527 LASSERT(!(ns->ns_client & ~(LDLM_NAMESPACE_CLIENT |
528 LDLM_NAMESPACE_SERVER)));
529 LASSERT(ns->ns_client == LDLM_NAMESPACE_CLIENT ||
530 ns->ns_client == LDLM_NAMESPACE_SERVER);
531 return ns->ns_client == LDLM_NAMESPACE_SERVER;
535 * Returns 1 if namespace \a ns supports early lock cancel (ELC).
537 static inline int ns_connect_cancelset(struct ldlm_namespace *ns)
540 return !!(ns->ns_connect_flags & OBD_CONNECT_CANCELSET);
544 * Returns 1 if this namespace supports lru_resize.
546 static inline int ns_connect_lru_resize(struct ldlm_namespace *ns)
549 return !!(ns->ns_connect_flags & OBD_CONNECT_LRU_RESIZE);
552 static inline void ns_register_cancel(struct ldlm_namespace *ns,
553 ldlm_cancel_for_recovery arg)
556 ns->ns_cancel_for_recovery = arg;
561 /** Type for blocking callback function of a lock. */
562 typedef int (*ldlm_blocking_callback)(struct ldlm_lock *lock,
563 struct ldlm_lock_desc *new, void *data,
565 /** Type for completion callback function of a lock. */
566 typedef int (*ldlm_completion_callback)(struct ldlm_lock *lock, __u64 flags,
568 /** Type for glimpse callback function of a lock. */
569 typedef int (*ldlm_glimpse_callback)(struct ldlm_lock *lock, void *data);
571 /** Work list for sending GL ASTs to multiple locks. */
572 struct ldlm_glimpse_work {
573 struct ldlm_lock *gl_lock; /* lock to glimpse */
574 struct list_head gl_list; /* linkage to other gl work structs */
575 __u32 gl_flags;/* see LDLM_GL_WORK_* below */
576 union ldlm_gl_desc *gl_desc; /* glimpse descriptor to be packed in
577 * glimpse callback request */
580 /** The ldlm_glimpse_work is allocated on the stack and should not be freed. */
581 #define LDLM_GL_WORK_NOFREE 0x1
583 /** Interval node data for each LDLM_EXTENT lock. */
584 struct ldlm_interval {
585 struct interval_node li_node; /* node for tree management */
586 struct list_head li_group; /* the locks which have the same
587 * policy - group of the policy */
589 #define to_ldlm_interval(n) container_of(n, struct ldlm_interval, li_node)
592 * Interval tree for extent locks.
593 * The interval tree must be accessed under the resource lock.
594 * Interval trees are used for granted extent locks to speed up conflicts
595 * lookup. See ldlm/interval_tree.c for more details.
597 struct ldlm_interval_tree {
600 ldlm_mode_t lit_mode; /* lock mode */
601 struct interval_node *lit_root; /* actual ldlm_interval */
604 /** Whether to track references to exports by LDLM locks. */
605 #define LUSTRE_TRACKS_LOCK_EXP_REFS (0)
609 LCF_ASYNC = 0x1, /* Cancel locks asynchronously. */
610 LCF_LOCAL = 0x2, /* Cancel locks locally, not notifing server */
611 LCF_BL_AST = 0x4, /* Cancel locks marked as LDLM_FL_BL_AST
613 } ldlm_cancel_flags_t;
619 __u64 blocking_owner;
620 struct obd_export *blocking_export;
621 /* Protected by the hash lock */
627 struct ldlm_extent l_extent;
628 struct ldlm_flock l_flock;
629 struct ldlm_inodebits l_inodebits;
630 } ldlm_policy_data_t;
632 void ldlm_convert_policy_to_wire(ldlm_type_t type,
633 const ldlm_policy_data_t *lpolicy,
634 ldlm_wire_policy_data_t *wpolicy);
635 void ldlm_convert_policy_to_local(struct obd_export *exp, ldlm_type_t type,
636 const ldlm_wire_policy_data_t *wpolicy,
637 ldlm_policy_data_t *lpolicy);
647 * LDLM lock structure
649 * Represents a single LDLM lock and its state in memory. Each lock is
650 * associated with a single ldlm_resource, the object which is being
651 * locked. There may be multiple ldlm_locks on a single resource,
652 * depending on the lock type and whether the locks are conflicting or
658 * When remote side wants to tell us about a lock, they address
659 * it by this opaque handle. The handle does not hold a
660 * reference on the ldlm_lock, so it can be safely passed to
661 * other threads or nodes. When the lock needs to be accessed
662 * from the handle, it is looked up again in the lock table, and
663 * may no longer exist.
665 * Must be first in the structure.
667 struct portals_handle l_handle;
669 * Lock reference count.
670 * This is how many users have pointers to actual structure, so that
671 * we do not accidentally free lock structure that is in use.
675 * Internal spinlock protects l_resource. We should hold this lock
676 * first before taking res_lock.
680 * Pointer to actual resource this lock is in.
681 * ldlm_lock_change_resource() can change this.
683 struct ldlm_resource *l_resource;
685 * List item for client side LRU list.
686 * Protected by ns_lock in struct ldlm_namespace.
688 struct list_head l_lru;
690 * Linkage to resource's lock queues according to current lock state.
691 * (could be granted, waiting or converting)
692 * Protected by lr_lock in struct ldlm_resource.
694 struct list_head l_res_link;
696 * Tree node for ldlm_extent.
698 struct ldlm_interval *l_tree_node;
700 * Per export hash of locks.
701 * Protected by per-bucket exp->exp_lock_hash locks.
703 struct hlist_node l_exp_hash;
705 * Per export hash of flock locks.
706 * Protected by per-bucket exp->exp_flock_hash locks.
708 struct hlist_node l_exp_flock_hash;
711 * Protected by lr_lock.
713 ldlm_mode_t l_req_mode;
715 * Granted mode, also protected by lr_lock.
717 ldlm_mode_t l_granted_mode;
718 /** Lock completion handler pointer. Called when lock is granted. */
719 ldlm_completion_callback l_completion_ast;
721 * Lock blocking AST handler pointer.
722 * It plays two roles:
723 * - as a notification of an attempt to queue a conflicting lock (once)
724 * - as a notification when the lock is being cancelled.
726 * As such it's typically called twice: once for the initial conflict
727 * and then once more when the last user went away and the lock is
728 * cancelled (could happen recursively).
730 ldlm_blocking_callback l_blocking_ast;
732 * Lock glimpse handler.
733 * Glimpse handler is used to obtain LVB updates from a client by
736 ldlm_glimpse_callback l_glimpse_ast;
740 * This is a pointer to actual client export for locks that were granted
741 * to clients. Used server-side.
743 struct obd_export *l_export;
745 * Lock connection export.
746 * Pointer to server export on a client.
748 struct obd_export *l_conn_export;
751 * Remote lock handle.
752 * If the lock is remote, this is the handle of the other side lock
755 struct lustre_handle l_remote_handle;
758 * Representation of private data specific for a lock type.
759 * Examples are: extent range for extent lock or bitmask for ibits locks
761 ldlm_policy_data_t l_policy_data;
764 * Lock state flags. Protected by lr_lock.
765 * \see lustre_dlm_flags.h where the bits are defined.
770 * Lock r/w usage counters.
771 * Protected by lr_lock.
776 * If the lock is granted, a process sleeps on this waitq to learn when
777 * it's no longer in use. If the lock is not granted, a process sleeps
778 * on this waitq to learn when it becomes granted.
780 wait_queue_head_t l_waitq;
783 * Seconds. It will be updated if there is any activity related to
784 * the lock, e.g. enqueue the lock or send blocking AST.
786 cfs_time_t l_last_activity;
789 * Time last used by e.g. being matched by lock match.
790 * Jiffies. Should be converted to time if needed.
792 cfs_time_t l_last_used;
794 /** Originally requested extent for the extent lock. */
795 struct ldlm_extent l_req_extent;
798 * Client-side-only members.
801 enum lvb_type l_lvb_type;
804 * Temporary storage for a LVB received during an enqueue operation.
809 /** Private storage for lock user. Opaque to LDLM. */
813 * Server-side-only members.
817 * Connection cookie for the client originating the operation.
818 * Used by Commit on Share (COS) code. Currently only used for
819 * inodebits locks on MDS.
821 __u64 l_client_cookie;
824 * List item for locks waiting for cancellation from clients.
825 * The lists this could be linked into are:
826 * waiting_locks_list (protected by waiting_locks_spinlock),
827 * then if the lock timed out, it is moved to
828 * expired_lock_thread.elt_expired_locks for further processing.
829 * Protected by elt_lock.
831 struct list_head l_pending_chain;
834 * Set when lock is sent a blocking AST. Time in seconds when timeout
835 * is reached and client holding this lock could be evicted.
836 * This timeout could be further extended by e.g. certain IO activity
838 * \see ost_rw_prolong_locks
840 cfs_time_t l_callback_timeout;
842 /** Local PID of process which created this lock. */
846 * Number of times blocking AST was sent for this lock.
847 * This is for debugging. Valid values are 0 and 1, if there is an
848 * attempt to send blocking AST more than once, an assertion would be
849 * hit. \see ldlm_work_bl_ast_lock
852 /** List item ldlm_add_ast_work_item() for case of blocking ASTs. */
853 struct list_head l_bl_ast;
854 /** List item ldlm_add_ast_work_item() for case of completion ASTs. */
855 struct list_head l_cp_ast;
856 /** For ldlm_add_ast_work_item() for "revoke" AST used in COS. */
857 struct list_head l_rk_ast;
860 * Pointer to a conflicting lock that caused blocking AST to be sent
863 struct ldlm_lock *l_blocking_lock;
866 * Protected by lr_lock, linkages to "skip lists".
867 * For more explanations of skip lists see ldlm/ldlm_inodebits.c
869 struct list_head l_sl_mode;
870 struct list_head l_sl_policy;
872 /** Reference tracking structure to debug leaked locks. */
873 struct lu_ref l_reference;
874 #if LUSTRE_TRACKS_LOCK_EXP_REFS
875 /* Debugging stuff for bug 20498, for tracking export references. */
876 /** number of export references taken */
878 /** link all locks referencing one export */
879 struct list_head l_exp_refs_link;
880 /** referenced export object */
881 struct obd_export *l_exp_refs_target;
884 * export blocking dlm lock list, protected by
885 * l_export->exp_bl_list_lock.
886 * Lock order of waiting_lists_spinlock, exp_bl_list_lock and res lock
887 * is: res lock -> exp_bl_list_lock -> wanting_lists_spinlock.
889 struct list_head l_exp_list;
893 * LDLM resource description.
894 * Basically, resource is a representation for a single object.
895 * Object has a name which is currently 4 64-bit integers. LDLM user is
896 * responsible for creation of a mapping between objects it wants to be
897 * protected and resource names.
899 * A resource can only hold locks of a single lock type, though there may be
900 * multiple ldlm_locks on a single resource, depending on the lock type and
901 * whether the locks are conflicting or not.
903 struct ldlm_resource {
904 struct ldlm_ns_bucket *lr_ns_bucket;
907 * List item for list in namespace hash.
908 * protected by ns_lock
910 struct hlist_node lr_hash;
912 /** Spinlock to protect locks under this resource. */
916 * protected by lr_lock
918 /** List of locks in granted state */
919 struct list_head lr_granted;
920 /** List of locks waiting to change their granted mode (converted) */
921 struct list_head lr_converting;
923 * List of locks that could not be granted due to conflicts and
924 * that are waiting for conflicts to go away */
925 struct list_head lr_waiting;
928 /* XXX No longer needed? Remove ASAP */
929 ldlm_mode_t lr_most_restr;
931 /** Type of locks this resource can hold. Only one type per resource. */
932 ldlm_type_t lr_type; /* LDLM_{PLAIN,EXTENT,FLOCK,IBITS} */
935 struct ldlm_res_id lr_name;
936 /** Reference count for this resource */
937 atomic_t lr_refcount;
940 * Interval trees (only for extent locks) for all modes of this resource
942 struct ldlm_interval_tree lr_itree[LCK_MODE_NUM];
945 * Server-side-only lock value block elements.
946 * To serialize lvbo_init.
948 struct mutex lr_lvb_mutex;
950 /** protected by lr_lock */
953 /** When the resource was considered as contended. */
954 cfs_time_t lr_contention_time;
955 /** List of references to this resource. For debugging. */
956 struct lu_ref lr_reference;
958 struct inode *lr_lvb_inode;
961 static inline bool ldlm_has_layout(struct ldlm_lock *lock)
963 return lock->l_resource->lr_type == LDLM_IBITS &&
964 lock->l_policy_data.l_inodebits.bits & MDS_INODELOCK_LAYOUT;
968 ldlm_ns_name(struct ldlm_namespace *ns)
970 return ns->ns_rs_hash->hs_name;
973 static inline struct ldlm_namespace *
974 ldlm_res_to_ns(struct ldlm_resource *res)
976 return res->lr_ns_bucket->nsb_namespace;
979 static inline struct ldlm_namespace *
980 ldlm_lock_to_ns(struct ldlm_lock *lock)
982 return ldlm_res_to_ns(lock->l_resource);
986 ldlm_lock_to_ns_name(struct ldlm_lock *lock)
988 return ldlm_ns_name(ldlm_lock_to_ns(lock));
991 static inline struct adaptive_timeout *
992 ldlm_lock_to_ns_at(struct ldlm_lock *lock)
994 return &lock->l_resource->lr_ns_bucket->nsb_at_estimate;
997 static inline int ldlm_lvbo_init(struct ldlm_resource *res)
999 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1001 if (ns->ns_lvbo != NULL && ns->ns_lvbo->lvbo_init != NULL)
1002 return ns->ns_lvbo->lvbo_init(res);
1007 static inline int ldlm_lvbo_size(struct ldlm_lock *lock)
1009 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
1011 if (ns->ns_lvbo != NULL && ns->ns_lvbo->lvbo_size != NULL)
1012 return ns->ns_lvbo->lvbo_size(lock);
1017 static inline int ldlm_lvbo_fill(struct ldlm_lock *lock, void *buf, int len)
1019 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
1021 if (ns->ns_lvbo != NULL) {
1022 LASSERT(ns->ns_lvbo->lvbo_fill != NULL);
1023 return ns->ns_lvbo->lvbo_fill(lock, buf, len);
1028 struct ldlm_ast_work {
1029 struct ldlm_lock *w_lock;
1031 struct ldlm_lock_desc w_desc;
1032 struct list_head w_list;
1039 * Common ldlm_enqueue parameters
1041 struct ldlm_enqueue_info {
1042 __u32 ei_type; /** Type of the lock being enqueued. */
1043 __u32 ei_mode; /** Mode of the lock being enqueued. */
1044 void *ei_cb_bl; /** blocking lock callback */
1045 void *ei_cb_cp; /** lock completion callback */
1046 void *ei_cb_gl; /** lock glimpse callback */
1047 void *ei_cbdata; /** Data to be passed into callbacks. */
1050 extern struct obd_ops ldlm_obd_ops;
1052 extern char *ldlm_lockname[];
1053 extern char *ldlm_typename[];
1054 extern char *ldlm_it2str(int it);
1057 * Just a fancy CDEBUG call with log level preset to LDLM_DEBUG.
1058 * For the cases where we do not have actual lock to print along
1059 * with a debugging message that is ldlm-related
1061 #define LDLM_DEBUG_NOLOCK(format, a...) \
1062 CDEBUG(D_DLMTRACE, "### " format "\n" , ##a)
1065 * Support function for lock information printing into debug logs.
1068 #define ldlm_lock_debug(msgdata, mask, cdls, lock, fmt, a...) do { \
1069 CFS_CHECK_STACK(msgdata, mask, cdls); \
1071 if (((mask) & D_CANTMASK) != 0 || \
1072 ((libcfs_debug & (mask)) != 0 && \
1073 (libcfs_subsystem_debug & DEBUG_SUBSYSTEM) != 0)) \
1074 _ldlm_lock_debug(lock, msgdata, fmt, ##a); \
1077 void _ldlm_lock_debug(struct ldlm_lock *lock,
1078 struct libcfs_debug_msg_data *data,
1079 const char *fmt, ...)
1080 __attribute__ ((format (printf, 3, 4)));
1083 * Rate-limited version of lock printing function.
1085 #define LDLM_DEBUG_LIMIT(mask, lock, fmt, a...) do { \
1086 static struct cfs_debug_limit_state _ldlm_cdls; \
1087 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, mask, &_ldlm_cdls); \
1088 ldlm_lock_debug(&msgdata, mask, &_ldlm_cdls, lock, "### " fmt , ##a);\
1091 #define LDLM_ERROR(lock, fmt, a...) LDLM_DEBUG_LIMIT(D_ERROR, lock, fmt, ## a)
1092 #define LDLM_WARN(lock, fmt, a...) LDLM_DEBUG_LIMIT(D_WARNING, lock, fmt, ## a)
1094 /** Non-rate-limited lock printing function for debugging purposes. */
1095 #define LDLM_DEBUG(lock, fmt, a...) do { \
1096 if (likely(lock != NULL)) { \
1097 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, D_DLMTRACE, NULL); \
1098 ldlm_lock_debug(&msgdata, D_DLMTRACE, NULL, lock, \
1099 "### " fmt , ##a); \
1101 LDLM_DEBUG_NOLOCK("no dlm lock: " fmt, ##a); \
1105 typedef int (*ldlm_processing_policy)(struct ldlm_lock *lock, __u64 *flags,
1106 int first_enq, ldlm_error_t *err,
1107 struct list_head *work_list);
1110 * Return values for lock iterators.
1111 * Also used during deciding of lock grants and cancellations.
1113 #define LDLM_ITER_CONTINUE 1 /* keep iterating */
1114 #define LDLM_ITER_STOP 2 /* stop iterating */
1116 typedef int (*ldlm_iterator_t)(struct ldlm_lock *, void *);
1117 typedef int (*ldlm_res_iterator_t)(struct ldlm_resource *, void *);
1119 /** \defgroup ldlm_iterator Lock iterators
1121 * LDLM provides for a way to iterate through every lock on a resource or
1122 * namespace or every resource in a namespace.
1124 int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter,
1126 void ldlm_namespace_foreach(struct ldlm_namespace *ns, ldlm_iterator_t iter,
1128 int ldlm_resource_iterate(struct ldlm_namespace *, const struct ldlm_res_id *,
1129 ldlm_iterator_t iter, void *data);
1130 /** @} ldlm_iterator */
1132 int ldlm_replay_locks(struct obd_import *imp);
1135 int ldlm_flock_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data);
1138 __u64 ldlm_extent_shift_kms(struct ldlm_lock *lock, __u64 old_kms);
1140 struct ldlm_callback_suite {
1141 ldlm_completion_callback lcs_completion;
1142 ldlm_blocking_callback lcs_blocking;
1143 ldlm_glimpse_callback lcs_glimpse;
1147 int ldlm_del_waiting_lock(struct ldlm_lock *lock);
1148 int ldlm_refresh_waiting_lock(struct ldlm_lock *lock, int timeout);
1149 int ldlm_get_ref(void);
1150 void ldlm_put_ref(void);
1151 int ldlm_init_export(struct obd_export *exp);
1152 void ldlm_destroy_export(struct obd_export *exp);
1153 struct ldlm_lock *ldlm_request_lock(struct ptlrpc_request *req);
1156 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg);
1157 void ldlm_lock2handle(const struct ldlm_lock *lock,
1158 struct lustre_handle *lockh);
1159 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *, __u64 flags);
1160 void ldlm_cancel_callback(struct ldlm_lock *);
1161 int ldlm_lock_remove_from_lru(struct ldlm_lock *);
1162 int ldlm_lock_set_data(struct lustre_handle *, void *);
1165 * Obtain a lock reference by its handle.
1167 static inline struct ldlm_lock *ldlm_handle2lock(const struct lustre_handle *h)
1169 return __ldlm_handle2lock(h, 0);
1172 #define LDLM_LOCK_REF_DEL(lock) \
1173 lu_ref_del(&lock->l_reference, "handle", current)
1175 static inline struct ldlm_lock *
1176 ldlm_handle2lock_long(const struct lustre_handle *h, __u64 flags)
1178 struct ldlm_lock *lock;
1180 lock = __ldlm_handle2lock(h, flags);
1182 LDLM_LOCK_REF_DEL(lock);
1187 * Update Lock Value Block Operations (LVBO) on a resource taking into account
1188 * data from request \a r
1190 static inline int ldlm_res_lvbo_update(struct ldlm_resource *res,
1191 struct ptlrpc_request *r, int increase)
1193 if (ldlm_res_to_ns(res)->ns_lvbo &&
1194 ldlm_res_to_ns(res)->ns_lvbo->lvbo_update) {
1195 return ldlm_res_to_ns(res)->ns_lvbo->lvbo_update(res, r,
1201 int ldlm_error2errno(ldlm_error_t error);
1202 ldlm_error_t ldlm_errno2error(int err_no); /* don't call it `errno': this
1203 * confuses user-space. */
1204 #if LUSTRE_TRACKS_LOCK_EXP_REFS
1205 void ldlm_dump_export_locks(struct obd_export *exp);
1209 * Release a temporary lock reference obtained by ldlm_handle2lock() or
1210 * __ldlm_handle2lock().
1212 #define LDLM_LOCK_PUT(lock) \
1214 LDLM_LOCK_REF_DEL(lock); \
1215 /*LDLM_DEBUG((lock), "put");*/ \
1216 ldlm_lock_put(lock); \
1220 * Release a lock reference obtained by some other means (see
1223 #define LDLM_LOCK_RELEASE(lock) \
1225 /*LDLM_DEBUG((lock), "put");*/ \
1226 ldlm_lock_put(lock); \
1229 #define LDLM_LOCK_GET(lock) \
1231 ldlm_lock_get(lock); \
1232 /*LDLM_DEBUG((lock), "get");*/ \
1236 #define ldlm_lock_list_put(head, member, count) \
1238 struct ldlm_lock *_lock, *_next; \
1240 list_for_each_entry_safe(_lock, _next, head, member) { \
1243 list_del_init(&_lock->member); \
1244 LDLM_LOCK_RELEASE(_lock); \
1249 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
1250 void ldlm_lock_put(struct ldlm_lock *lock);
1251 void ldlm_lock_destroy(struct ldlm_lock *lock);
1252 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc);
1253 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode);
1254 int ldlm_lock_addref_try(struct lustre_handle *lockh, __u32 mode);
1255 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode);
1256 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode);
1257 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock);
1258 void ldlm_lock_fail_match(struct ldlm_lock *lock);
1259 void ldlm_lock_allow_match(struct ldlm_lock *lock);
1260 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock);
1261 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1262 const struct ldlm_res_id *, ldlm_type_t type,
1263 ldlm_policy_data_t *, ldlm_mode_t mode,
1264 struct lustre_handle *, int unref);
1265 ldlm_mode_t ldlm_revalidate_lock_handle(struct lustre_handle *lockh,
1267 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
1269 void ldlm_lock_downgrade(struct ldlm_lock *lock, int new_mode);
1270 void ldlm_lock_cancel(struct ldlm_lock *lock);
1271 void ldlm_reprocess_all(struct ldlm_resource *res);
1272 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns);
1273 void ldlm_lock_dump_handle(int level, struct lustre_handle *);
1274 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req);
1277 struct ldlm_namespace *
1278 ldlm_namespace_new(struct obd_device *obd, char *name,
1279 ldlm_side_t client, ldlm_appetite_t apt,
1280 ldlm_ns_type_t ns_type);
1281 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags);
1282 void ldlm_namespace_free(struct ldlm_namespace *ns,
1283 struct obd_import *imp, int force);
1284 void ldlm_namespace_register(struct ldlm_namespace *ns, ldlm_side_t client);
1285 void ldlm_namespace_unregister(struct ldlm_namespace *ns, ldlm_side_t client);
1286 void ldlm_namespace_get(struct ldlm_namespace *ns);
1287 void ldlm_namespace_put(struct ldlm_namespace *ns);
1289 int ldlm_proc_setup(void);
1290 void ldlm_proc_cleanup(void);
1292 static inline int ldlm_proc_setup(void) { return 0; }
1293 static inline void ldlm_proc_cleanup(void) {}
1296 /* resource.c - internal */
1297 struct ldlm_resource *ldlm_resource_get(struct ldlm_namespace *ns,
1298 struct ldlm_resource *parent,
1299 const struct ldlm_res_id *,
1300 ldlm_type_t type, int create);
1301 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res);
1302 int ldlm_resource_putref(struct ldlm_resource *res);
1303 void ldlm_resource_add_lock(struct ldlm_resource *res,
1304 struct list_head *head,
1305 struct ldlm_lock *lock);
1306 void ldlm_resource_unlink_lock(struct ldlm_lock *lock);
1307 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc);
1308 void ldlm_dump_all_namespaces(ldlm_side_t client, int level);
1309 void ldlm_namespace_dump(int level, struct ldlm_namespace *);
1310 void ldlm_resource_dump(int level, struct ldlm_resource *);
1311 int ldlm_lock_change_resource(struct ldlm_namespace *, struct ldlm_lock *,
1312 const struct ldlm_res_id *);
1314 #define LDLM_RESOURCE_ADDREF(res) do { \
1315 lu_ref_add_atomic(&(res)->lr_reference, __func__, current); \
1318 #define LDLM_RESOURCE_DELREF(res) do { \
1319 lu_ref_del(&(res)->lr_reference, __func__, current); \
1322 /* ldlm_request.c */
1323 int ldlm_expired_completion_wait(void *data);
1324 /** \defgroup ldlm_local_ast Default AST handlers for local locks
1325 * These AST handlers are typically used for server-side local locks and are
1326 * also used by client-side lock handlers to perform minimum level base
1329 int ldlm_blocking_ast_nocheck(struct ldlm_lock *lock);
1330 int ldlm_blocking_ast(struct ldlm_lock *lock, struct ldlm_lock_desc *desc,
1331 void *data, int flag);
1332 int ldlm_glimpse_ast(struct ldlm_lock *lock, void *reqp);
1333 int ldlm_completion_ast_async(struct ldlm_lock *lock, __u64 flags, void *data);
1334 int ldlm_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data);
1335 /** @} ldlm_local_ast */
1337 /** \defgroup ldlm_cli_api API to operate on locks from actual LDLM users.
1338 * These are typically used by client and server (*_local versions)
1339 * to obtain and release locks.
1341 int ldlm_cli_enqueue(struct obd_export *exp, struct ptlrpc_request **reqp,
1342 struct ldlm_enqueue_info *einfo,
1343 const struct ldlm_res_id *res_id,
1344 ldlm_policy_data_t const *policy, __u64 *flags,
1345 void *lvb, __u32 lvb_len, enum lvb_type lvb_type,
1346 struct lustre_handle *lockh, int async);
1347 int ldlm_prep_enqueue_req(struct obd_export *exp,
1348 struct ptlrpc_request *req,
1349 struct list_head *cancels,
1351 int ldlm_prep_elc_req(struct obd_export *exp,
1352 struct ptlrpc_request *req,
1353 int version, int opc, int canceloff,
1354 struct list_head *cancels, int count);
1356 struct ptlrpc_request *ldlm_enqueue_pack(struct obd_export *exp, int lvb_len);
1357 int ldlm_handle_enqueue0(struct ldlm_namespace *ns, struct ptlrpc_request *req,
1358 const struct ldlm_request *dlm_req,
1359 const struct ldlm_callback_suite *cbs);
1360 int ldlm_cli_enqueue_fini(struct obd_export *exp, struct ptlrpc_request *req,
1361 ldlm_type_t type, __u8 with_policy, ldlm_mode_t mode,
1362 __u64 *flags, void *lvb, __u32 lvb_len,
1363 struct lustre_handle *lockh, int rc);
1364 int ldlm_cli_enqueue_local(struct ldlm_namespace *ns,
1365 const struct ldlm_res_id *res_id,
1366 ldlm_type_t type, ldlm_policy_data_t *policy,
1367 ldlm_mode_t mode, __u64 *flags,
1368 ldlm_blocking_callback blocking,
1369 ldlm_completion_callback completion,
1370 ldlm_glimpse_callback glimpse,
1371 void *data, __u32 lvb_len, enum lvb_type lvb_type,
1372 const __u64 *client_cookie,
1373 struct lustre_handle *lockh);
1374 int ldlm_server_ast(struct lustre_handle *lockh, struct ldlm_lock_desc *new,
1375 void *data, __u32 data_len);
1376 int ldlm_cli_convert(struct lustre_handle *, int new_mode, __u32 *flags);
1377 int ldlm_cli_update_pool(struct ptlrpc_request *req);
1378 int ldlm_cli_cancel(struct lustre_handle *lockh,
1379 ldlm_cancel_flags_t cancel_flags);
1380 int ldlm_cli_cancel_unused(struct ldlm_namespace *, const struct ldlm_res_id *,
1381 ldlm_cancel_flags_t flags, void *opaque);
1382 int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
1383 const struct ldlm_res_id *res_id,
1384 ldlm_policy_data_t *policy,
1386 ldlm_cancel_flags_t flags,
1388 int ldlm_cli_cancel_req(struct obd_export *exp, struct list_head *head,
1389 int count, ldlm_cancel_flags_t flags);
1390 int ldlm_cancel_resource_local(struct ldlm_resource *res,
1391 struct list_head *cancels,
1392 ldlm_policy_data_t *policy,
1393 ldlm_mode_t mode, int lock_flags,
1394 ldlm_cancel_flags_t cancel_flags, void *opaque);
1395 int ldlm_cli_cancel_list_local(struct list_head *cancels, int count,
1396 ldlm_cancel_flags_t flags);
1397 int ldlm_cli_cancel_list(struct list_head *head, int count,
1398 struct ptlrpc_request *req, ldlm_cancel_flags_t flags);
1399 /** @} ldlm_cli_api */
1402 /* This has to be here because recursive inclusion sucks. */
1403 int intent_disposition(struct ldlm_reply *rep, int flag);
1404 void intent_set_disposition(struct ldlm_reply *rep, int flag);
1407 /* ioctls for trying requests */
1408 #define IOC_LDLM_TYPE 'f'
1409 #define IOC_LDLM_MIN_NR 40
1411 #define IOC_LDLM_TEST _IOWR('f', 40, long)
1412 #define IOC_LDLM_DUMP _IOWR('f', 41, long)
1413 #define IOC_LDLM_REGRESS_START _IOWR('f', 42, long)
1414 #define IOC_LDLM_REGRESS_STOP _IOWR('f', 43, long)
1415 #define IOC_LDLM_MAX_NR 43
1418 * "Modes" of acquiring lock_res, necessary to tell lockdep that taking more
1419 * than one lock_res is dead-lock safe.
1421 enum lock_res_type {
1426 /** Lock resource. */
1427 static inline void lock_res(struct ldlm_resource *res)
1429 spin_lock(&res->lr_lock);
1432 /** Lock resource with a way to instruct lockdep code about nestedness-safe. */
1433 static inline void lock_res_nested(struct ldlm_resource *res,
1434 enum lock_res_type mode)
1436 spin_lock_nested(&res->lr_lock, mode);
1439 /** Unlock resource. */
1440 static inline void unlock_res(struct ldlm_resource *res)
1442 spin_unlock(&res->lr_lock);
1445 /** Check if resource is already locked, assert if not. */
1446 static inline void check_res_locked(struct ldlm_resource *res)
1448 assert_spin_locked(&res->lr_lock);
1451 struct ldlm_resource * lock_res_and_lock(struct ldlm_lock *lock);
1452 void unlock_res_and_lock(struct ldlm_lock *lock);
1455 /** \defgroup ldlm_pools Various LDLM pool related functions
1456 * There are not used outside of ldlm.
1459 int ldlm_pools_recalc(ldlm_side_t client);
1460 int ldlm_pools_init(void);
1461 void ldlm_pools_fini(void);
1463 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
1464 int idx, ldlm_side_t client);
1465 int ldlm_pool_shrink(struct ldlm_pool *pl, int nr,
1467 void ldlm_pool_fini(struct ldlm_pool *pl);
1468 int ldlm_pool_setup(struct ldlm_pool *pl, int limit);
1469 int ldlm_pool_recalc(struct ldlm_pool *pl);
1470 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl);
1471 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl);
1472 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl);
1473 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl);
1474 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv);
1475 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv);
1476 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit);
1477 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock);
1478 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock);