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.gnu.org/licenses/gpl-2.0.html
23 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved.
24 * Use is subject to license terms.
26 * Copyright (c) 2010, 2017, Intel Corporation.
29 * This file is part of Lustre, http://www.lustre.org/
30 * Lustre is a trademark of Sun Microsystems, Inc.
33 /** \defgroup LDLM Lustre Distributed Lock Manager
35 * Lustre DLM is based on VAX DLM.
36 * Its two main roles are:
37 * - To provide locking assuring consistency of data on all Lustre nodes.
38 * - To allow clients to cache state protected by a lock by holding the
39 * lock until a conflicting lock is requested or it is expired by the LRU.
44 #ifndef _LUSTRE_DLM_H__
45 #define _LUSTRE_DLM_H__
47 #include <lustre_lib.h>
48 #include <lustre_net.h>
49 #include <lustre_import.h>
50 #include <lustre_handles.h>
51 #include <interval_tree.h> /* for interval_node{}, ldlm_extent */
54 #include "lustre_dlm_flags.h"
59 extern struct kset *ldlm_ns_kset;
60 extern struct kset *ldlm_svc_kset;
62 #define OBD_LDLM_DEVICENAME "ldlm"
64 #define LDLM_DEFAULT_LRU_SIZE (100 * num_online_cpus())
65 #define LDLM_DEFAULT_MAX_ALIVE 3900 /* 3900 seconds ~65 min */
66 #define LDLM_CTIME_AGE_LIMIT (10)
67 /* if client lock is unused for that time it can be cancelled if any other
68 * client shows interest in that lock, e.g. glimpse is occured. */
69 #define LDLM_DIRTY_AGE_LIMIT (10)
70 #define LDLM_DEFAULT_PARALLEL_AST_LIMIT 1024
73 * LDLM non-error return states
77 ELDLM_LOCK_MATCHED = 1,
79 ELDLM_LOCK_CHANGED = 300,
80 ELDLM_LOCK_ABORTED = 301,
81 ELDLM_LOCK_REPLACED = 302,
82 ELDLM_NO_LOCK_DATA = 303,
83 ELDLM_LOCK_WOULDBLOCK = 304,
85 ELDLM_NAMESPACE_EXISTS = 400,
86 ELDLM_BAD_NAMESPACE = 401,
90 * LDLM namespace type.
91 * The "client" type is actually an indication that this is a narrow local view
92 * into complete namespace on the server. Such namespaces cannot make any
93 * decisions about lack of conflicts or do any autonomous lock granting without
94 * first speaking to a server.
97 LDLM_NAMESPACE_SERVER = 0x01,
98 LDLM_NAMESPACE_CLIENT = 0x02
102 * The blocking callback is overloaded to perform two functions. These flags
103 * indicate which operation should be performed.
105 #define LDLM_CB_BLOCKING 1
106 #define LDLM_CB_CANCELING 2
109 * \name Lock Compatibility Matrix.
111 * A lock has both a type (extent, flock, inode bits, or plain) and a mode.
112 * Lock types are described in their respective implementation files:
113 * ldlm_{extent,flock,inodebits,plain}.c.
115 * There are six lock modes along with a compatibility matrix to indicate if
116 * two locks are compatible.
118 * - EX: Exclusive mode. Before a new file is created, MDS requests EX lock
120 * - PW: Protective Write (normal write) mode. When a client requests a write
121 * lock from an OST, a lock with PW mode will be issued.
122 * - PR: Protective Read (normal read) mode. When a client requests a read from
123 * an OST, a lock with PR mode will be issued. Also, if the client opens a
124 * file for execution, it is granted a lock with PR mode.
125 * - CW: Concurrent Write mode. The type of lock that the MDS grants if a client
126 * requests a write lock during a file open operation.
127 * - CR Concurrent Read mode. When a client performs a path lookup, MDS grants
128 * an inodebit lock with the CR mode on the intermediate path component.
142 #define LCK_COMPAT_EX LCK_NL
143 #define LCK_COMPAT_PW (LCK_COMPAT_EX | LCK_CR)
144 #define LCK_COMPAT_PR (LCK_COMPAT_PW | LCK_PR)
145 #define LCK_COMPAT_CW (LCK_COMPAT_PW | LCK_CW)
146 #define LCK_COMPAT_CR (LCK_COMPAT_CW | LCK_PR | LCK_PW)
147 #define LCK_COMPAT_NL (LCK_COMPAT_CR | LCK_EX | LCK_GROUP)
148 #define LCK_COMPAT_GROUP (LCK_GROUP | LCK_NL)
149 #define LCK_COMPAT_COS (LCK_COS)
150 /** @} Lock Compatibility Matrix */
152 extern enum ldlm_mode lck_compat_array[];
154 static inline void lockmode_verify(enum ldlm_mode mode)
156 LASSERT(mode > LCK_MINMODE && mode < LCK_MAXMODE);
159 static inline int lockmode_compat(enum ldlm_mode exist_mode,
160 enum ldlm_mode new_mode)
162 return lck_compat_array[exist_mode] & new_mode;
167 * cluster name spaces
171 #define DLM_OST_NAMESPACE 1
172 #define DLM_MDS_NAMESPACE 2
175 - do we just separate this by security domains and use a prefix for
176 multiple namespaces in the same domain?
181 * Locking rules for LDLM:
186 * waiting_locks_spinlock
201 struct ldlm_resource;
202 struct ldlm_namespace;
205 * Operations on LDLM pools.
206 * LDLM pool is a pool of locks in the namespace without any implicitly
208 * Locks in the pool are organized in LRU.
209 * Local memory pressure or server instructions (e.g. mempressure on server)
210 * can trigger freeing of locks from the pool
212 struct ldlm_pool_ops {
213 /** Recalculate pool \a pl usage */
214 int (*po_recalc)(struct ldlm_pool *pl);
215 /** Cancel at least \a nr locks from pool \a pl */
216 int (*po_shrink)(struct ldlm_pool *pl, int nr, gfp_t gfp_mask);
217 int (*po_setup)(struct ldlm_pool *pl, int limit);
220 /** One second for pools thread check interval. Each pool has own period. */
221 #define LDLM_POOLS_THREAD_PERIOD (1)
223 /** ~6% margin for modest pools. See ldlm_pool.c for details. */
224 #define LDLM_POOLS_MODEST_MARGIN_SHIFT (4)
226 /** Default recalc period for server side pools in sec. */
227 #define LDLM_POOL_SRV_DEF_RECALC_PERIOD (1)
229 /** Default recalc period for client side pools in sec. */
230 #define LDLM_POOL_CLI_DEF_RECALC_PERIOD (10)
233 * LDLM pool structure to track granted locks.
234 * For purposes of determining when to release locks on e.g. memory pressure.
235 * This feature is commonly referred to as lru_resize.
238 /** Pool debugfs directory. */
239 struct dentry *pl_debugfs_entry;
240 /** Pool name, must be long enough to hold compound proc entry name. */
242 /** Lock for protecting SLV/CLV updates. */
244 /** Number of allowed locks in in pool, both, client and server side. */
246 /** Number of granted locks in */
248 /** Grant rate per T. */
249 atomic_t pl_grant_rate;
250 /** Cancel rate per T. */
251 atomic_t pl_cancel_rate;
252 /** Server lock volume (SLV). Protected by pl_lock. */
253 __u64 pl_server_lock_volume;
254 /** Current biggest client lock volume. Protected by pl_lock. */
255 __u64 pl_client_lock_volume;
256 /** Lock volume factor. SLV on client is calculated as following:
257 * server_slv * lock_volume_factor. */
258 atomic_t pl_lock_volume_factor;
259 /** Time when last SLV from server was obtained. */
260 time64_t pl_recalc_time;
261 /** Recalculation period for pool. */
262 time64_t pl_recalc_period;
263 /** Recalculation and shrink operations. */
264 struct ldlm_pool_ops *pl_ops;
265 /** Number of planned locks for next period. */
267 /** Pool statistics. */
268 struct lprocfs_stats *pl_stats;
271 struct kobject pl_kobj;
272 struct completion pl_kobj_unregister;
275 typedef int (*ldlm_res_policy)(const struct lu_env *env,
276 struct ldlm_namespace *,
277 struct ldlm_lock **, void *req_cookie,
278 enum ldlm_mode mode, __u64 flags, void *data);
280 typedef int (*ldlm_cancel_cbt)(struct ldlm_lock *lock);
284 * LVB is Lock Value Block. This is a special opaque (to LDLM) value that could
285 * be associated with an LDLM lock and transferred from client to server and
288 * Currently LVBs are used by:
289 * - OSC-OST code to maintain current object size/times
290 * - layout lock code to return the layout when the layout lock is granted
292 * To ensure delayed LVB initialization, it is highly recommended to use the set
293 * of ldlm_[res_]lvbo_[init,update,fill]() functions.
295 struct ldlm_valblock_ops {
296 int (*lvbo_init)(const struct lu_env *env, struct ldlm_resource *res);
297 int (*lvbo_update)(const struct lu_env *env, struct ldlm_resource *res,
298 struct ldlm_lock *lock, struct ptlrpc_request *r,
300 int (*lvbo_free)(struct ldlm_resource *res);
301 /* Return size of lvb data appropriate RPC size can be reserved */
302 int (*lvbo_size)(struct ldlm_lock *lock);
303 /* Called to fill in lvb data to RPC buffer @buf */
304 int (*lvbo_fill)(const struct lu_env *env, struct ldlm_lock *lock,
305 void *buf, int *buflen);
309 * LDLM pools related, type of lock pool in the namespace.
310 * Greedy means release cached locks aggressively
313 LDLM_NAMESPACE_GREEDY = 1 << 0,
314 LDLM_NAMESPACE_MODEST = 1 << 1
318 * Default values for the "max_nolock_size", "contention_time" and
319 * "contended_locks" namespace tunables.
321 #define NS_DEFAULT_MAX_NOLOCK_BYTES 0
322 #define NS_DEFAULT_CONTENTION_SECONDS 2
323 #define NS_DEFAULT_CONTENDED_LOCKS 32
325 struct ldlm_ns_bucket {
326 /** back pointer to namespace */
327 struct ldlm_namespace *nsb_namespace;
329 * Estimated lock callback time. Used by adaptive timeout code to
330 * avoid spurious client evictions due to unresponsiveness when in
331 * fact the network or overall system load is at fault
333 struct adaptive_timeout nsb_at_estimate;
335 * Which res in the bucket should we start with the reclaim.
337 int nsb_reclaim_start;
341 /** LDLM namespace lock stats */
347 LDLM_NS_TYPE_UNKNOWN = 0, /**< invalid type */
348 LDLM_NS_TYPE_MDC, /**< MDC namespace */
349 LDLM_NS_TYPE_MDT, /**< MDT namespace */
350 LDLM_NS_TYPE_OSC, /**< OSC namespace */
351 LDLM_NS_TYPE_OST, /**< OST namespace */
352 LDLM_NS_TYPE_MGC, /**< MGC namespace */
353 LDLM_NS_TYPE_MGT, /**< MGT namespace */
359 * Namespace serves to contain locks related to a particular service.
360 * There are two kinds of namespaces:
361 * - Server namespace has knowledge of all locks and is therefore authoritative
362 * to make decisions like what locks could be granted and what conflicts
363 * exist during new lock enqueue.
364 * - Client namespace only has limited knowledge about locks in the namespace,
365 * only seeing locks held by the client.
367 * Every Lustre service has one server namespace present on the server serving
368 * that service. Every client connected to the service has a client namespace
370 * Every lock obtained by client in that namespace is actually represented by
371 * two in-memory locks. One on the server and one on the client. The locks are
372 * linked by a special cookie by which one node can tell to the other which lock
373 * it actually means during communications. Such locks are called remote locks.
374 * The locks held by server only without any reference to a client are called
377 struct ldlm_namespace {
378 /** Backward link to OBD, required for LDLM pool to store new SLV. */
379 struct obd_device *ns_obd;
381 /** Flag indicating if namespace is on client instead of server */
382 enum ldlm_side ns_client;
384 /** name of this namespace */
387 /** Resource hash table for namespace. */
388 struct cfs_hash *ns_rs_hash;
393 /** big refcount (by bucket) */
397 * Namespace connect flags supported by server (may be changed via
398 * /proc, LRU resize may be disabled/enabled).
400 __u64 ns_connect_flags;
402 /** Client side original connect flags supported by server. */
403 __u64 ns_orig_connect_flags;
405 /* namespace debugfs dir entry */
406 struct dentry *ns_debugfs_entry;
409 * Position in global namespace list linking all namespaces on
412 struct list_head ns_list_chain;
415 * List of unused locks for this namespace. This list is also called
417 * Unused locks are locks with zero reader/writer reference counts.
418 * This list is only used on clients for lock caching purposes.
419 * When we want to release some locks voluntarily or if server wants
420 * us to release some locks due to e.g. memory pressure, we take locks
421 * to release from the head of this list.
422 * Locks are linked via l_lru field in \see struct ldlm_lock.
424 struct list_head ns_unused_list;
425 /** Number of locks in the LRU list above */
427 struct list_head *ns_last_pos;
430 * Maximum number of locks permitted in the LRU. If 0, means locks
431 * are managed by pools and there is no preset limit, rather it is all
432 * controlled by available memory on this client and on server.
434 unsigned int ns_max_unused;
436 /** Maximum allowed age (last used time) for locks in the LRU */
440 * Server only: number of times we evicted clients due to lack of reply
443 unsigned int ns_timeouts;
445 * Number of seconds since the file change time after which the
446 * MDT will return an UPDATE lock along with a LOOKUP lock.
447 * This allows the client to start caching negative dentries
448 * for a directory and may save an RPC for a later stat.
450 time64_t ns_ctime_age_limit;
452 * Number of seconds since the lock was last used. The client may
453 * cancel the lock limited by this age and flush related data if
454 * any other client shows interest in it doing glimpse request.
455 * This allows to cache stat data locally for such files early.
457 time64_t ns_dirty_age_limit;
459 * Used to rate-limit ldlm_namespace_dump calls.
460 * \see ldlm_namespace_dump. Increased by 10 seconds every time
463 time64_t ns_next_dump;
465 /** "policy" function that does actual lock conflict determination */
466 ldlm_res_policy ns_policy;
469 * LVB operations for this namespace.
470 * \see struct ldlm_valblock_ops
472 struct ldlm_valblock_ops *ns_lvbo;
475 * Used by filter code to store pointer to OBD of the service.
476 * Should be dropped in favor of \a ns_obd
481 * Wait queue used by __ldlm_namespace_free. Gets woken up every time
482 * a resource is removed.
484 wait_queue_head_t ns_waitq;
485 /** LDLM pool structure for this namespace */
486 struct ldlm_pool ns_pool;
487 /** Definition of how eagerly unused locks will be released from LRU */
488 enum ldlm_appetite ns_appetite;
491 * If more than \a ns_contended_locks are found, the resource is
492 * considered to be contended. Lock enqueues might specify that no
493 * contended locks should be granted
495 unsigned ns_contended_locks;
498 * The resources in this namespace remember contended state during
499 * \a ns_contention_time, in seconds.
501 time64_t ns_contention_time;
504 * Limit size of contended extent locks, in bytes.
505 * If extended lock is requested for more then this many bytes and
506 * caller instructs us not to grant contended locks, we would disregard
509 unsigned ns_max_nolock_size;
511 /** Limit of parallel AST RPC count. */
512 unsigned ns_max_parallel_ast;
515 * Callback to check if a lock is good to be canceled by ELC or
518 ldlm_cancel_cbt ns_cancel;
520 /** LDLM lock stats */
521 struct lprocfs_stats *ns_stats;
524 * Flag to indicate namespace is being freed. Used to determine if
525 * recalculation of LDLM pool statistics should be skipped.
527 unsigned ns_stopping:1;
530 * Which bucket should we start with the lock reclaim.
532 int ns_reclaim_start;
534 struct kobject ns_kobj; /* sysfs object */
535 struct completion ns_kobj_unregister;
539 * Returns 1 if namespace \a ns is a client namespace.
541 static inline int ns_is_client(struct ldlm_namespace *ns)
544 LASSERT(ns->ns_client == LDLM_NAMESPACE_CLIENT ||
545 ns->ns_client == LDLM_NAMESPACE_SERVER);
546 return ns->ns_client == LDLM_NAMESPACE_CLIENT;
550 * Returns 1 if namespace \a ns is a server namespace.
552 static inline int ns_is_server(struct ldlm_namespace *ns)
555 LASSERT(ns->ns_client == LDLM_NAMESPACE_CLIENT ||
556 ns->ns_client == LDLM_NAMESPACE_SERVER);
557 return ns->ns_client == LDLM_NAMESPACE_SERVER;
561 * Returns 1 if namespace \a ns supports early lock cancel (ELC).
563 static inline int ns_connect_cancelset(struct ldlm_namespace *ns)
566 return !!(ns->ns_connect_flags & OBD_CONNECT_CANCELSET);
570 * Returns 1 if this namespace supports lru_resize.
572 static inline int ns_connect_lru_resize(struct ldlm_namespace *ns)
575 return !!(ns->ns_connect_flags & OBD_CONNECT_LRU_RESIZE);
578 static inline void ns_register_cancel(struct ldlm_namespace *ns,
587 /** Type for blocking callback function of a lock. */
588 typedef int (*ldlm_blocking_callback)(struct ldlm_lock *lock,
589 struct ldlm_lock_desc *new, void *data,
591 /** Type for completion callback function of a lock. */
592 typedef int (*ldlm_completion_callback)(struct ldlm_lock *lock, __u64 flags,
594 /** Type for glimpse callback function of a lock. */
595 typedef int (*ldlm_glimpse_callback)(struct ldlm_lock *lock, void *data);
597 /** Work list for sending GL ASTs to multiple locks. */
598 struct ldlm_glimpse_work {
599 struct ldlm_lock *gl_lock; /* lock to glimpse */
600 struct list_head gl_list; /* linkage to other gl work structs */
601 __u32 gl_flags;/* see LDLM_GL_WORK_* below */
602 union ldlm_gl_desc *gl_desc; /* glimpse descriptor to be packed in
603 * glimpse callback request */
604 ptlrpc_interpterer_t gl_interpret_reply;
605 void *gl_interpret_data;
608 struct ldlm_bl_desc {
609 unsigned int bl_same_client:1,
613 struct ldlm_cb_set_arg {
614 struct ptlrpc_request_set *set;
615 int type; /* LDLM_{CP,BL,GL}_CALLBACK */
617 struct list_head *list;
618 union ldlm_gl_desc *gl_desc; /* glimpse AST descriptor */
619 ptlrpc_interpterer_t gl_interpret_reply;
620 void *gl_interpret_data;
621 struct ldlm_bl_desc *bl_desc;
624 struct ldlm_cb_async_args {
625 struct ldlm_cb_set_arg *ca_set_arg;
626 struct ldlm_lock *ca_lock;
629 /** The ldlm_glimpse_work was slab allocated & must be freed accordingly.*/
630 #define LDLM_GL_WORK_SLAB_ALLOCATED 0x1
632 /** Interval node data for each LDLM_EXTENT lock. */
633 struct ldlm_interval {
634 struct interval_node li_node; /* node for tree management */
635 struct list_head li_group; /* the locks which have the same
636 * policy - group of the policy */
638 #define to_ldlm_interval(n) container_of(n, struct ldlm_interval, li_node)
641 * Interval tree for extent locks.
642 * The interval tree must be accessed under the resource lock.
643 * Interval trees are used for granted extent locks to speed up conflicts
644 * lookup. See ldlm/interval_tree.c for more details.
646 struct ldlm_interval_tree {
649 enum ldlm_mode lit_mode; /* lock mode */
650 struct interval_node *lit_root; /* actual ldlm_interval */
653 /** Whether to track references to exports by LDLM locks. */
654 #define LUSTRE_TRACKS_LOCK_EXP_REFS (0)
657 enum ldlm_cancel_flags {
658 LCF_ASYNC = 0x1, /* Cancel locks asynchronously. */
659 LCF_LOCAL = 0x2, /* Cancel locks locally, not notifing server */
660 LCF_BL_AST = 0x4, /* Cancel LDLM_FL_BL_AST locks in the same RPC */
661 LCF_CONVERT = 0x8, /* Try to convert IBITS lock before cancel */
668 __u64 blocking_owner;
669 struct obd_export *blocking_export;
670 atomic_t blocking_refs;
674 union ldlm_policy_data {
675 struct ldlm_extent l_extent;
676 struct ldlm_flock l_flock;
677 struct ldlm_inodebits l_inodebits;
680 void ldlm_convert_policy_to_wire(enum ldlm_type type,
681 const union ldlm_policy_data *lpolicy,
682 union ldlm_wire_policy_data *wpolicy);
683 void ldlm_convert_policy_to_local(struct obd_export *exp, enum ldlm_type type,
684 const union ldlm_wire_policy_data *wpolicy,
685 union ldlm_policy_data *lpolicy);
695 * LDLM_GID_ANY is used to match any group id in ldlm_lock_match().
697 #define LDLM_GID_ANY ((__u64)-1)
700 * LDLM lock structure
702 * Represents a single LDLM lock and its state in memory. Each lock is
703 * associated with a single ldlm_resource, the object which is being
704 * locked. There may be multiple ldlm_locks on a single resource,
705 * depending on the lock type and whether the locks are conflicting or
711 * When remote side wants to tell us about a lock, they address
712 * it by this opaque handle. The handle does not hold a
713 * reference on the ldlm_lock, so it can be safely passed to
714 * other threads or nodes. When the lock needs to be accessed
715 * from the handle, it is looked up again in the lock table, and
716 * may no longer exist.
718 * Must be first in the structure.
720 struct portals_handle l_handle;
722 * Lock reference count.
723 * This is how many users have pointers to actual structure, so that
724 * we do not accidentally free lock structure that is in use.
728 * Internal spinlock protects l_resource. We should hold this lock
729 * first before taking res_lock.
733 * Pointer to actual resource this lock is in.
734 * ldlm_lock_change_resource() can change this.
736 struct ldlm_resource *l_resource;
738 * List item for client side LRU list.
739 * Protected by ns_lock in struct ldlm_namespace.
741 struct list_head l_lru;
743 * Linkage to resource's lock queues according to current lock state.
744 * (could be granted or waiting)
745 * Protected by lr_lock in struct ldlm_resource.
747 struct list_head l_res_link;
749 * Tree node for ldlm_extent.
751 struct ldlm_interval *l_tree_node;
753 * Per export hash of locks.
754 * Protected by per-bucket exp->exp_lock_hash locks.
756 struct hlist_node l_exp_hash;
758 * Per export hash of flock locks.
759 * Protected by per-bucket exp->exp_flock_hash locks.
761 struct hlist_node l_exp_flock_hash;
764 * Protected by lr_lock.
766 enum ldlm_mode l_req_mode;
768 * Granted mode, also protected by lr_lock.
770 enum ldlm_mode l_granted_mode;
771 /** Lock completion handler pointer. Called when lock is granted. */
772 ldlm_completion_callback l_completion_ast;
774 * Lock blocking AST handler pointer.
775 * It plays two roles:
776 * - as a notification of an attempt to queue a conflicting lock (once)
777 * - as a notification when the lock is being cancelled.
779 * As such it's typically called twice: once for the initial conflict
780 * and then once more when the last user went away and the lock is
781 * cancelled (could happen recursively).
783 ldlm_blocking_callback l_blocking_ast;
785 * Lock glimpse handler.
786 * Glimpse handler is used to obtain LVB updates from a client by
789 ldlm_glimpse_callback l_glimpse_ast;
793 * This is a pointer to actual client export for locks that were granted
794 * to clients. Used server-side.
796 struct obd_export *l_export;
798 * Lock connection export.
799 * Pointer to server export on a client.
801 struct obd_export *l_conn_export;
804 * Remote lock handle.
805 * If the lock is remote, this is the handle of the other side lock
808 struct lustre_handle l_remote_handle;
811 * Representation of private data specific for a lock type.
812 * Examples are: extent range for extent lock or bitmask for ibits locks
814 union ldlm_policy_data l_policy_data;
817 * Lock state flags. Protected by lr_lock.
818 * \see lustre_dlm_flags.h where the bits are defined.
823 * Lock r/w usage counters.
824 * Protected by lr_lock.
829 * If the lock is granted, a process sleeps on this waitq to learn when
830 * it's no longer in use. If the lock is not granted, a process sleeps
831 * on this waitq to learn when it becomes granted.
833 wait_queue_head_t l_waitq;
836 * Time, in nanoseconds, last used by e.g. being matched by lock match.
840 /** Originally requested extent for the extent lock. */
841 struct ldlm_extent l_req_extent;
844 * Client-side-only members.
847 enum lvb_type l_lvb_type;
850 * Temporary storage for a LVB received during an enqueue operation.
851 * May be vmalloc'd, so needs to be freed with OBD_FREE_LARGE().
856 /** Private storage for lock user. Opaque to LDLM. */
861 * Seconds. It will be updated if there is any activity related to
862 * the lock at client, e.g. enqueue the lock. For server it is the
863 * time when blocking ast was sent.
866 time64_t l_blast_sent;
869 /* separate ost_lvb used mostly by Data-on-MDT for now.
870 * It is introduced to don't mix with layout lock data. */
871 struct ost_lvb l_ost_lvb;
873 * Server-side-only members.
877 * Connection cookie for the client originating the operation.
878 * Used by Commit on Share (COS) code. Currently only used for
879 * inodebits locks on MDS.
881 __u64 l_client_cookie;
884 * List item for locks waiting for cancellation from clients.
885 * The lists this could be linked into are:
886 * waiting_locks_list (protected by waiting_locks_spinlock),
887 * then if the lock timed out, it is moved to
888 * expired_lock_list for further processing.
890 struct list_head l_pending_chain;
893 * Set when lock is sent a blocking AST. Time in seconds when timeout
894 * is reached and client holding this lock could be evicted.
895 * This timeout could be further extended by e.g. certain IO activity
897 * \see ost_rw_prolong_locks
899 time64_t l_callback_timeout;
901 /** Local PID of process which created this lock. */
905 * Number of times blocking AST was sent for this lock.
906 * This is for debugging. Valid values are 0 and 1, if there is an
907 * attempt to send blocking AST more than once, an assertion would be
908 * hit. \see ldlm_work_bl_ast_lock
911 /** List item ldlm_add_ast_work_item() for case of blocking ASTs. */
912 struct list_head l_bl_ast;
913 /** List item ldlm_add_ast_work_item() for case of completion ASTs. */
914 struct list_head l_cp_ast;
915 /** For ldlm_add_ast_work_item() for "revoke" AST used in COS. */
916 struct list_head l_rk_ast;
919 * Pointer to a conflicting lock that caused blocking AST to be sent
922 struct ldlm_lock *l_blocking_lock;
925 * Protected by lr_lock, linkages to "skip lists".
926 * For more explanations of skip lists see ldlm/ldlm_inodebits.c
928 struct list_head l_sl_mode;
929 struct list_head l_sl_policy;
931 /** Reference tracking structure to debug leaked locks. */
932 struct lu_ref l_reference;
933 #if LUSTRE_TRACKS_LOCK_EXP_REFS
934 /* Debugging stuff for bug 20498, for tracking export references. */
935 /** number of export references taken */
937 /** link all locks referencing one export */
938 struct list_head l_exp_refs_link;
939 /** referenced export object */
940 struct obd_export *l_exp_refs_target;
943 * export blocking dlm lock list, protected by
944 * l_export->exp_bl_list_lock.
945 * Lock order of waiting_lists_spinlock, exp_bl_list_lock and res lock
946 * is: res lock -> exp_bl_list_lock -> wanting_lists_spinlock.
948 struct list_head l_exp_list;
951 /** For uncommitted cross-MDT lock, store transno this lock belongs to */
952 #define l_transno l_client_cookie
954 /** For uncommitted cross-MDT lock, which is client lock, share with l_rk_ast
955 * which is for server. */
956 #define l_slc_link l_rk_ast
958 #define HANDLE_MAP_SIZE ((LMV_MAX_STRIPE_COUNT + 7) >> 3)
960 struct lustre_handle_array {
961 unsigned int ha_count;
962 /* ha_map is used as bit flag to indicate handle is remote or local */
963 char ha_map[HANDLE_MAP_SIZE];
964 struct lustre_handle ha_handles[0];
968 * LDLM resource description.
969 * Basically, resource is a representation for a single object.
970 * Object has a name which is currently 4 64-bit integers. LDLM user is
971 * responsible for creation of a mapping between objects it wants to be
972 * protected and resource names.
974 * A resource can only hold locks of a single lock type, though there may be
975 * multiple ldlm_locks on a single resource, depending on the lock type and
976 * whether the locks are conflicting or not.
978 struct ldlm_resource {
979 struct ldlm_ns_bucket *lr_ns_bucket;
982 * List item for list in namespace hash.
983 * protected by ns_lock
985 struct hlist_node lr_hash;
987 /** Reference count for this resource */
988 atomic_t lr_refcount;
990 /** Spinlock to protect locks under this resource. */
994 * protected by lr_lock
996 /** List of locks in granted state */
997 struct list_head lr_granted;
999 * List of locks that could not be granted due to conflicts and
1000 * that are waiting for conflicts to go away */
1001 struct list_head lr_waiting;
1004 /** Resource name */
1005 struct ldlm_res_id lr_name;
1008 * Interval trees (only for extent locks) for all modes of this resource
1010 struct ldlm_interval_tree *lr_itree;
1014 * When the resource was considered as contended,
1015 * used only on server side.
1017 time64_t lr_contention_time;
1019 * Associated inode, used only on client side.
1021 struct inode *lr_lvb_inode;
1024 /** Type of locks this resource can hold. Only one type per resource. */
1025 enum ldlm_type lr_type; /* LDLM_{PLAIN,EXTENT,FLOCK,IBITS} */
1028 * Server-side-only lock value block elements.
1029 * To serialize lvbo_init.
1032 struct mutex lr_lvb_mutex;
1033 /** protected by lr_lock */
1035 /** is lvb initialized ? */
1036 bool lr_lvb_initialized;
1038 /** List of references to this resource. For debugging. */
1039 struct lu_ref lr_reference;
1042 static inline bool ldlm_has_layout(struct ldlm_lock *lock)
1044 return lock->l_resource->lr_type == LDLM_IBITS &&
1045 lock->l_policy_data.l_inodebits.bits & MDS_INODELOCK_LAYOUT;
1048 static inline bool ldlm_has_dom(struct ldlm_lock *lock)
1050 return lock->l_resource->lr_type == LDLM_IBITS &&
1051 lock->l_policy_data.l_inodebits.bits & MDS_INODELOCK_DOM;
1054 static inline char *
1055 ldlm_ns_name(struct ldlm_namespace *ns)
1060 static inline struct ldlm_namespace *
1061 ldlm_res_to_ns(struct ldlm_resource *res)
1063 return res->lr_ns_bucket->nsb_namespace;
1066 static inline struct ldlm_namespace *
1067 ldlm_lock_to_ns(struct ldlm_lock *lock)
1069 return ldlm_res_to_ns(lock->l_resource);
1072 static inline char *
1073 ldlm_lock_to_ns_name(struct ldlm_lock *lock)
1075 return ldlm_ns_name(ldlm_lock_to_ns(lock));
1078 static inline struct adaptive_timeout *
1079 ldlm_lock_to_ns_at(struct ldlm_lock *lock)
1081 return &lock->l_resource->lr_ns_bucket->nsb_at_estimate;
1084 static inline int ldlm_lvbo_init(const struct lu_env *env,
1085 struct ldlm_resource *res)
1087 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1090 if (ns->ns_lvbo == NULL || ns->ns_lvbo->lvbo_init == NULL ||
1091 res->lr_lvb_initialized)
1094 mutex_lock(&res->lr_lvb_mutex);
1095 /* Did we lose the race? */
1096 if (res->lr_lvb_initialized) {
1097 mutex_unlock(&res->lr_lvb_mutex);
1100 rc = ns->ns_lvbo->lvbo_init(env, res);
1102 CDEBUG(D_DLMTRACE, "lvbo_init failed for resource : rc = %d\n",
1104 if (res->lr_lvb_data != NULL) {
1105 OBD_FREE(res->lr_lvb_data, res->lr_lvb_len);
1106 res->lr_lvb_data = NULL;
1108 res->lr_lvb_len = rc;
1110 res->lr_lvb_initialized = true;
1112 mutex_unlock(&res->lr_lvb_mutex);
1116 static inline int ldlm_lvbo_size(struct ldlm_lock *lock)
1118 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
1120 if (ns->ns_lvbo != NULL && ns->ns_lvbo->lvbo_size != NULL)
1121 return ns->ns_lvbo->lvbo_size(lock);
1126 static inline int ldlm_lvbo_fill(const struct lu_env *env,
1127 struct ldlm_lock *lock, void *buf, int *len)
1129 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
1132 if (ns->ns_lvbo != NULL) {
1133 LASSERT(ns->ns_lvbo->lvbo_fill != NULL);
1134 /* init lvb now if not already */
1135 rc = ldlm_lvbo_init(env, lock->l_resource);
1137 CERROR("lock %p: delayed lvb init failed (rc %d)",
1141 return ns->ns_lvbo->lvbo_fill(env, lock, buf, len);
1146 struct ldlm_ast_work {
1147 struct ldlm_lock *w_lock;
1149 struct ldlm_lock_desc w_desc;
1150 struct list_head w_list;
1157 * Common ldlm_enqueue parameters
1159 struct ldlm_enqueue_info {
1160 enum ldlm_type ei_type; /** Type of the lock being enqueued. */
1161 enum ldlm_mode ei_mode; /** Mode of the lock being enqueued. */
1162 void *ei_cb_bl; /** blocking lock callback */
1163 void *ei_cb_local_bl; /** blocking local lock callback */
1164 void *ei_cb_cp; /** lock completion callback */
1165 void *ei_cb_gl; /** lock glimpse callback */
1166 void *ei_cbdata; /** Data to be passed into callbacks. */
1167 void *ei_namespace; /** lock namespace **/
1168 u64 ei_inodebits; /** lock inode bits **/
1169 unsigned int ei_enq_slave:1; /** whether enqueue slave stripes */
1172 #define ei_res_id ei_cb_gl
1174 extern struct obd_ops ldlm_obd_ops;
1176 extern char *ldlm_lockname[];
1177 extern char *ldlm_typename[];
1178 extern const char *ldlm_it2str(enum ldlm_intent_flags it);
1181 * Just a fancy CDEBUG call with log level preset to LDLM_DEBUG.
1182 * For the cases where we do not have actual lock to print along
1183 * with a debugging message that is ldlm-related
1185 #define LDLM_DEBUG_NOLOCK(format, a...) \
1186 CDEBUG(D_DLMTRACE, "### " format "\n" , ##a)
1189 * Support function for lock information printing into debug logs.
1193 #define ldlm_lock_debug(msgdata, mask, cdls, lock, fmt, a...) do { \
1194 CFS_CHECK_STACK(msgdata, mask, cdls); \
1196 if (((mask) & D_CANTMASK) != 0 || \
1197 ((libcfs_debug & (mask)) != 0 && \
1198 (libcfs_subsystem_debug & DEBUG_SUBSYSTEM) != 0)) \
1199 _ldlm_lock_debug(lock, msgdata, fmt, ##a); \
1202 void _ldlm_lock_debug(struct ldlm_lock *lock,
1203 struct libcfs_debug_msg_data *data,
1204 const char *fmt, ...)
1205 __attribute__ ((format (printf, 3, 4)));
1208 * Rate-limited version of lock printing function.
1210 #define LDLM_DEBUG_LIMIT(mask, lock, fmt, a...) do { \
1211 static struct cfs_debug_limit_state _ldlm_cdls; \
1212 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, mask, &_ldlm_cdls); \
1213 ldlm_lock_debug(&msgdata, mask, &_ldlm_cdls, lock, "### " fmt , ##a);\
1216 #define LDLM_ERROR(lock, fmt, a...) LDLM_DEBUG_LIMIT(D_ERROR, lock, fmt, ## a)
1217 #define LDLM_WARN(lock, fmt, a...) LDLM_DEBUG_LIMIT(D_WARNING, lock, fmt, ## a)
1219 /** Non-rate-limited lock printing function for debugging purposes. */
1220 #define LDLM_DEBUG(lock, fmt, a...) do { \
1221 if (likely(lock != NULL)) { \
1222 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, D_DLMTRACE, NULL); \
1223 ldlm_lock_debug(&msgdata, D_DLMTRACE, NULL, lock, \
1224 "### " fmt , ##a); \
1226 LDLM_DEBUG_NOLOCK("no dlm lock: " fmt, ##a); \
1229 #else /* !LIBCFS_DEBUG */
1230 # define LDLM_DEBUG_LIMIT(mask, lock, fmt, a...) ((void)0)
1231 # define LDLM_DEBUG(lock, fmt, a...) ((void)0)
1232 # define LDLM_ERROR(lock, fmt, a...) ((void)0)
1236 * Three intentions can be used for the policy functions in
1237 * ldlm_processing_policy.
1239 * LDLM_PROCESS_RESCAN:
1241 * It's used when policy functions are called from ldlm_reprocess_queue() to
1242 * reprocess the wait list and try to grant locks, blocking ASTs
1243 * have already been sent in this situation, completion ASTs need be sent for
1244 * the locks being granted.
1246 * LDLM_PROCESS_ENQUEUE:
1248 * It's used when policy functions are called from ldlm_lock_enqueue() to
1249 * process the wait list for handling an enqueue request, blocking
1250 * ASTs have not been sent yet, so list of conflicting locks would be
1251 * collected and ASTs sent.
1253 * LDLM_PROCESS_RECOVERY:
1255 * It's used when policy functions are called from ldlm_reprocess_queue() to
1256 * reprocess the wait list when recovery done. In case of blocking
1257 * ASTs are lost before recovery, it needs not only to grant locks if
1258 * available, but also send blocking ASTs to the locks doesn't have AST sent
1259 * flag. Completion ASTs need be sent for the locks being granted.
1261 enum ldlm_process_intention {
1262 LDLM_PROCESS_RESCAN = 0,
1263 LDLM_PROCESS_ENQUEUE = 1,
1264 LDLM_PROCESS_RECOVERY = 2,
1267 typedef int (*ldlm_processing_policy)(struct ldlm_lock *lock, __u64 *flags,
1268 enum ldlm_process_intention intention,
1269 enum ldlm_error *err,
1270 struct list_head *work_list);
1273 * Return values for lock iterators.
1274 * Also used during deciding of lock grants and cancellations.
1276 #define LDLM_ITER_CONTINUE 1 /* keep iterating */
1277 #define LDLM_ITER_STOP 2 /* stop iterating */
1279 typedef int (*ldlm_iterator_t)(struct ldlm_lock *, void *);
1280 typedef int (*ldlm_res_iterator_t)(struct ldlm_resource *, void *);
1282 /** \defgroup ldlm_iterator Lock iterators
1284 * LDLM provides for a way to iterate through every lock on a resource or
1285 * namespace or every resource in a namespace.
1287 int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter,
1289 void ldlm_namespace_foreach(struct ldlm_namespace *ns, ldlm_iterator_t iter,
1291 int ldlm_resource_iterate(struct ldlm_namespace *, const struct ldlm_res_id *,
1292 ldlm_iterator_t iter, void *data);
1293 /** @} ldlm_iterator */
1295 int ldlm_replay_locks(struct obd_import *imp);
1298 int ldlm_flock_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data);
1301 __u64 ldlm_extent_shift_kms(struct ldlm_lock *lock, __u64 old_kms);
1303 struct ldlm_prolong_args {
1304 struct obd_export *lpa_export;
1305 struct ldlm_res_id lpa_resid;
1306 struct ldlm_extent lpa_extent;
1307 enum ldlm_mode lpa_mode;
1308 time64_t lpa_timeout;
1312 void ldlm_lock_prolong_one(struct ldlm_lock *lock,
1313 struct ldlm_prolong_args *arg);
1314 void ldlm_resource_prolong(struct ldlm_prolong_args *arg);
1316 struct ldlm_callback_suite {
1317 ldlm_completion_callback lcs_completion;
1318 ldlm_blocking_callback lcs_blocking;
1319 ldlm_glimpse_callback lcs_glimpse;
1323 #ifdef HAVE_SERVER_SUPPORT
1324 /** \defgroup ldlm_srv_ast Server AST handlers
1325 * These are AST handlers used by server code.
1326 * Their property is that they are just preparing RPCs to be sent to clients.
1329 int ldlm_server_blocking_ast(struct ldlm_lock *, struct ldlm_lock_desc *,
1330 void *data, int flag);
1331 int ldlm_server_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data);
1332 int ldlm_server_glimpse_ast(struct ldlm_lock *lock, void *data);
1333 int ldlm_glimpse_locks(struct ldlm_resource *res,
1334 struct list_head *gl_work_list);
1335 /** @} ldlm_srv_ast */
1337 /** \defgroup ldlm_handlers Server LDLM handlers
1338 * These are handler functions that should be called by "frontends" such as
1339 * MDT or OST to pass through LDLM requests to LDLM for handling
1342 int ldlm_handle_enqueue0(struct ldlm_namespace *ns, struct ptlrpc_request *req,
1343 const struct ldlm_request *dlm_req,
1344 const struct ldlm_callback_suite *cbs);
1345 int ldlm_handle_convert0(struct ptlrpc_request *req,
1346 const struct ldlm_request *dlm_req);
1347 int ldlm_handle_cancel(struct ptlrpc_request *req);
1348 int ldlm_request_cancel(struct ptlrpc_request *req,
1349 const struct ldlm_request *dlm_req,
1350 int first, enum lustre_at_flags flags);
1351 /** @} ldlm_handlers */
1353 void ldlm_revoke_export_locks(struct obd_export *exp);
1354 time64_t ldlm_bl_timeout(struct ldlm_lock *lock);
1356 int ldlm_del_waiting_lock(struct ldlm_lock *lock);
1357 int ldlm_refresh_waiting_lock(struct ldlm_lock *lock, time64_t timeout);
1358 int ldlm_get_ref(void);
1359 void ldlm_put_ref(void);
1360 int ldlm_init_export(struct obd_export *exp);
1361 void ldlm_destroy_export(struct obd_export *exp);
1362 struct ldlm_lock *ldlm_request_lock(struct ptlrpc_request *req);
1365 #ifdef HAVE_SERVER_SUPPORT
1366 ldlm_processing_policy ldlm_get_processing_policy(struct ldlm_resource *res);
1368 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg);
1369 void ldlm_lock2handle(const struct ldlm_lock *lock,
1370 struct lustre_handle *lockh);
1371 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *, __u64 flags);
1372 void ldlm_cancel_callback(struct ldlm_lock *);
1373 int ldlm_lock_remove_from_lru(struct ldlm_lock *);
1374 int ldlm_lock_set_data(const struct lustre_handle *lockh, void *data);
1377 * Obtain a lock reference by its handle.
1379 static inline struct ldlm_lock *ldlm_handle2lock(const struct lustre_handle *h)
1381 return __ldlm_handle2lock(h, 0);
1384 #define LDLM_LOCK_REF_DEL(lock) \
1385 lu_ref_del(&lock->l_reference, "handle", current)
1387 static inline struct ldlm_lock *
1388 ldlm_handle2lock_long(const struct lustre_handle *h, __u64 flags)
1390 struct ldlm_lock *lock;
1392 lock = __ldlm_handle2lock(h, flags);
1394 LDLM_LOCK_REF_DEL(lock);
1399 * Update Lock Value Block Operations (LVBO) on a resource taking into account
1400 * data from request \a r
1402 static inline int ldlm_lvbo_update(const struct lu_env *env,
1403 struct ldlm_resource *res,
1404 struct ldlm_lock *lock,
1405 struct ptlrpc_request *req, int increase)
1407 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
1410 /* delayed lvb init may be required */
1411 rc = ldlm_lvbo_init(env, res);
1413 CERROR("delayed lvb init failed (rc %d)\n", rc);
1417 if (ns->ns_lvbo && ns->ns_lvbo->lvbo_update)
1418 return ns->ns_lvbo->lvbo_update(env, res, lock, req, increase);
1423 static inline int ldlm_res_lvbo_update(const struct lu_env *env,
1424 struct ldlm_resource *res,
1425 struct ptlrpc_request *req,
1428 return ldlm_lvbo_update(env, res, NULL, req, increase);
1431 int ldlm_error2errno(enum ldlm_error error);
1432 enum ldlm_error ldlm_errno2error(int err_no); /* don't call it `errno': this
1433 * confuses user-space. */
1434 #if LUSTRE_TRACKS_LOCK_EXP_REFS
1435 void ldlm_dump_export_locks(struct obd_export *exp);
1439 * Release a temporary lock reference obtained by ldlm_handle2lock() or
1440 * __ldlm_handle2lock().
1442 #define LDLM_LOCK_PUT(lock) \
1444 LDLM_LOCK_REF_DEL(lock); \
1445 /*LDLM_DEBUG((lock), "put");*/ \
1446 ldlm_lock_put(lock); \
1450 * Release a lock reference obtained by some other means (see
1453 #define LDLM_LOCK_RELEASE(lock) \
1455 /*LDLM_DEBUG((lock), "put");*/ \
1456 ldlm_lock_put(lock); \
1459 #define LDLM_LOCK_GET(lock) \
1461 ldlm_lock_get(lock); \
1462 /*LDLM_DEBUG((lock), "get");*/ \
1466 #define ldlm_lock_list_put(head, member, count) \
1468 struct ldlm_lock *_lock, *_next; \
1470 list_for_each_entry_safe(_lock, _next, head, member) { \
1473 list_del_init(&_lock->member); \
1474 LDLM_LOCK_RELEASE(_lock); \
1479 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
1480 void ldlm_lock_put(struct ldlm_lock *lock);
1481 void ldlm_lock_destroy(struct ldlm_lock *lock);
1482 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc);
1483 void ldlm_lock_addref(const struct lustre_handle *lockh, enum ldlm_mode mode);
1484 int ldlm_lock_addref_try(const struct lustre_handle *lockh,
1485 enum ldlm_mode mode);
1486 void ldlm_lock_decref(const struct lustre_handle *lockh, enum ldlm_mode mode);
1487 void ldlm_lock_decref_and_cancel(const struct lustre_handle *lockh,
1488 enum ldlm_mode mode);
1489 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock);
1490 void ldlm_lock_fail_match(struct ldlm_lock *lock);
1491 void ldlm_lock_allow_match(struct ldlm_lock *lock);
1492 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock);
1493 enum ldlm_mode ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1494 const struct ldlm_res_id *, enum ldlm_type type,
1495 union ldlm_policy_data *, enum ldlm_mode mode,
1496 struct lustre_handle *, int unref);
1497 enum ldlm_mode ldlm_revalidate_lock_handle(const struct lustre_handle *lockh,
1499 void ldlm_lock_mode_downgrade(struct ldlm_lock *lock, enum ldlm_mode new_mode);
1500 void ldlm_lock_cancel(struct ldlm_lock *lock);
1501 void ldlm_reprocess_all(struct ldlm_resource *res);
1502 void ldlm_reprocess_recovery_done(struct ldlm_namespace *ns);
1503 void ldlm_lock_dump_handle(int level, const struct lustre_handle *lockh);
1504 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req);
1507 struct ldlm_namespace *ldlm_namespace_new(struct obd_device *obd, char *name,
1508 enum ldlm_side client,
1509 enum ldlm_appetite apt,
1510 enum ldlm_ns_type ns_type);
1511 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags);
1512 void ldlm_namespace_free_prior(struct ldlm_namespace *ns,
1513 struct obd_import *imp,
1515 void ldlm_namespace_free_post(struct ldlm_namespace *ns);
1516 void ldlm_namespace_free(struct ldlm_namespace *ns,
1517 struct obd_import *imp, int force);
1518 void ldlm_namespace_register(struct ldlm_namespace *ns, enum ldlm_side client);
1519 void ldlm_namespace_unregister(struct ldlm_namespace *ns,
1520 enum ldlm_side client);
1521 void ldlm_namespace_get(struct ldlm_namespace *ns);
1522 void ldlm_namespace_put(struct ldlm_namespace *ns);
1524 int ldlm_debugfs_setup(void);
1525 void ldlm_debugfs_cleanup(void);
1527 static inline void ldlm_svc_get_eopc(const struct ldlm_request *dlm_req,
1528 struct lprocfs_stats *srv_stats)
1530 int lock_type = 0, op = 0;
1532 lock_type = dlm_req->lock_desc.l_resource.lr_type;
1534 switch (lock_type) {
1536 op = PTLRPC_LAST_CNTR + LDLM_PLAIN_ENQUEUE;
1539 op = PTLRPC_LAST_CNTR + LDLM_EXTENT_ENQUEUE;
1542 op = PTLRPC_LAST_CNTR + LDLM_FLOCK_ENQUEUE;
1545 op = PTLRPC_LAST_CNTR + LDLM_IBITS_ENQUEUE;
1553 lprocfs_counter_incr(srv_stats, op);
1558 /* resource.c - internal */
1559 struct ldlm_resource *ldlm_resource_get(struct ldlm_namespace *ns,
1560 struct ldlm_resource *parent,
1561 const struct ldlm_res_id *,
1562 enum ldlm_type type, int create);
1563 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res);
1564 int ldlm_resource_putref(struct ldlm_resource *res);
1565 void ldlm_resource_add_lock(struct ldlm_resource *res,
1566 struct list_head *head,
1567 struct ldlm_lock *lock);
1568 void ldlm_resource_unlink_lock(struct ldlm_lock *lock);
1569 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc);
1570 void ldlm_dump_all_namespaces(enum ldlm_side client, int level);
1571 void ldlm_namespace_dump(int level, struct ldlm_namespace *);
1572 void ldlm_resource_dump(int level, struct ldlm_resource *);
1573 int ldlm_lock_change_resource(struct ldlm_namespace *, struct ldlm_lock *,
1574 const struct ldlm_res_id *);
1576 #define LDLM_RESOURCE_ADDREF(res) do { \
1577 lu_ref_add_atomic(&(res)->lr_reference, __FUNCTION__, current); \
1580 #define LDLM_RESOURCE_DELREF(res) do { \
1581 lu_ref_del(&(res)->lr_reference, __FUNCTION__, current); \
1584 /* ldlm_request.c */
1585 int ldlm_expired_completion_wait(void *data);
1586 /** \defgroup ldlm_local_ast Default AST handlers for local locks
1587 * These AST handlers are typically used for server-side local locks and are
1588 * also used by client-side lock handlers to perform minimum level base
1591 int ldlm_blocking_ast_nocheck(struct ldlm_lock *lock);
1592 int ldlm_blocking_ast(struct ldlm_lock *lock, struct ldlm_lock_desc *desc,
1593 void *data, int flag);
1594 int ldlm_glimpse_ast(struct ldlm_lock *lock, void *reqp);
1595 int ldlm_completion_ast_async(struct ldlm_lock *lock, __u64 flags, void *data);
1596 int ldlm_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data);
1597 /** @} ldlm_local_ast */
1599 /** \defgroup ldlm_cli_api API to operate on locks from actual LDLM users.
1600 * These are typically used by client and server (*_local versions)
1601 * to obtain and release locks.
1603 int ldlm_cli_enqueue(struct obd_export *exp, struct ptlrpc_request **reqp,
1604 struct ldlm_enqueue_info *einfo,
1605 const struct ldlm_res_id *res_id,
1606 union ldlm_policy_data const *policy, __u64 *flags,
1607 void *lvb, __u32 lvb_len, enum lvb_type lvb_type,
1608 struct lustre_handle *lockh, int async);
1609 int ldlm_prep_enqueue_req(struct obd_export *exp,
1610 struct ptlrpc_request *req,
1611 struct list_head *cancels,
1613 int ldlm_prep_elc_req(struct obd_export *exp, struct ptlrpc_request *req,
1614 int version, int opc, int canceloff,
1615 struct list_head *cancels, int count);
1617 struct ptlrpc_request *ldlm_enqueue_pack(struct obd_export *exp, int lvb_len);
1618 int ldlm_handle_enqueue0(struct ldlm_namespace *ns, struct ptlrpc_request *req,
1619 const struct ldlm_request *dlm_req,
1620 const struct ldlm_callback_suite *cbs);
1621 int ldlm_cli_enqueue_fini(struct obd_export *exp, struct ptlrpc_request *req,
1622 enum ldlm_type type, __u8 with_policy,
1623 enum ldlm_mode mode, __u64 *flags, void *lvb,
1625 const struct lustre_handle *lockh, int rc);
1626 int ldlm_cli_enqueue_local(const struct lu_env *env,
1627 struct ldlm_namespace *ns,
1628 const struct ldlm_res_id *res_id,
1629 enum ldlm_type type, union ldlm_policy_data *policy,
1630 enum ldlm_mode mode, __u64 *flags,
1631 ldlm_blocking_callback blocking,
1632 ldlm_completion_callback completion,
1633 ldlm_glimpse_callback glimpse,
1634 void *data, __u32 lvb_len, enum lvb_type lvb_type,
1635 const __u64 *client_cookie,
1636 struct lustre_handle *lockh);
1637 int ldlm_cli_convert(struct ldlm_lock *lock, __u32 *flags);
1638 int ldlm_cli_update_pool(struct ptlrpc_request *req);
1639 int ldlm_cli_cancel(const struct lustre_handle *lockh,
1640 enum ldlm_cancel_flags cancel_flags);
1641 int ldlm_cli_cancel_unused(struct ldlm_namespace *, const struct ldlm_res_id *,
1642 enum ldlm_cancel_flags flags, void *opaque);
1643 int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
1644 const struct ldlm_res_id *res_id,
1645 union ldlm_policy_data *policy,
1646 enum ldlm_mode mode,
1647 enum ldlm_cancel_flags flags, void *opaque);
1648 int ldlm_cli_cancel_req(struct obd_export *exp, struct list_head *head,
1649 int count, enum ldlm_cancel_flags flags);
1650 int ldlm_cancel_resource_local(struct ldlm_resource *res,
1651 struct list_head *cancels,
1652 union ldlm_policy_data *policy,
1653 enum ldlm_mode mode, __u64 lock_flags,
1654 enum ldlm_cancel_flags cancel_flags,
1656 int ldlm_cli_cancel_list_local(struct list_head *cancels, int count,
1657 enum ldlm_cancel_flags flags);
1658 int ldlm_cli_cancel_list(struct list_head *head, int count,
1659 struct ptlrpc_request *req,
1660 enum ldlm_cancel_flags flags);
1662 int ldlm_inodebits_drop(struct ldlm_lock *lock, __u64 to_drop);
1663 int ldlm_cli_dropbits(struct ldlm_lock *lock, __u64 drop_bits);
1664 int ldlm_cli_dropbits_list(struct list_head *converts, __u64 drop_bits);
1666 /** @} ldlm_cli_api */
1669 /* This has to be here because recursive inclusion sucks. */
1670 int intent_disposition(struct ldlm_reply *rep, int flag);
1671 void intent_set_disposition(struct ldlm_reply *rep, int flag);
1674 * "Modes" of acquiring lock_res, necessary to tell lockdep that taking more
1675 * than one lock_res is dead-lock safe.
1677 enum lock_res_type {
1682 /** Lock resource. */
1683 static inline void lock_res(struct ldlm_resource *res)
1685 spin_lock(&res->lr_lock);
1688 /** Lock resource with a way to instruct lockdep code about nestedness-safe. */
1689 static inline void lock_res_nested(struct ldlm_resource *res,
1690 enum lock_res_type mode)
1692 spin_lock_nested(&res->lr_lock, mode);
1695 /** Unlock resource. */
1696 static inline void unlock_res(struct ldlm_resource *res)
1698 spin_unlock(&res->lr_lock);
1701 /** Check if resource is already locked, assert if not. */
1702 static inline void check_res_locked(struct ldlm_resource *res)
1704 assert_spin_locked(&res->lr_lock);
1707 struct ldlm_resource * lock_res_and_lock(struct ldlm_lock *lock);
1708 void unlock_res_and_lock(struct ldlm_lock *lock);
1711 /** \defgroup ldlm_pools Various LDLM pool related functions
1712 * There are not used outside of ldlm.
1715 int ldlm_pools_init(void);
1716 void ldlm_pools_fini(void);
1718 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
1719 int idx, enum ldlm_side client);
1720 int ldlm_pool_shrink(struct ldlm_pool *pl, int nr, gfp_t gfp_mask);
1721 void ldlm_pool_fini(struct ldlm_pool *pl);
1722 int ldlm_pool_setup(struct ldlm_pool *pl, int limit);
1723 time64_t ldlm_pool_recalc(struct ldlm_pool *pl);
1724 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl);
1725 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl);
1726 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl);
1727 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl);
1728 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv);
1729 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv);
1730 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit);
1731 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock);
1732 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock);
1735 static inline int ldlm_extent_overlap(const struct ldlm_extent *ex1,
1736 const struct ldlm_extent *ex2)
1738 return ex1->start <= ex2->end && ex2->start <= ex1->end;
1741 /* check if @ex1 contains @ex2 */
1742 static inline int ldlm_extent_contain(const struct ldlm_extent *ex1,
1743 const struct ldlm_extent *ex2)
1745 return ex1->start <= ex2->start && ex1->end >= ex2->end;
1748 int ldlm_inodebits_drop(struct ldlm_lock *lock, __u64 to_drop);