]> git.proxmox.com Git - mirror_ubuntu-eoan-kernel.git/blob - drivers/staging/lustre/lustre/include/lustre_dlm.h
Merge tag 'tegra-for-4.3-cleanup' of git://git.kernel.org/pub/scm/linux/kernel/git...
[mirror_ubuntu-eoan-kernel.git] / drivers / staging / lustre / lustre / include / lustre_dlm.h
1 /*
2 * GPL HEADER START
3 *
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5 *
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.
9 *
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).
15 *
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
19 *
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
22 * have any questions.
23 *
24 * GPL HEADER END
25 */
26 /*
27 * Copyright (c) 2007, 2010, Oracle and/or its affiliates. All rights reserved.
28 * Use is subject to license terms.
29 *
30 * Copyright (c) 2010, 2012, Intel Corporation.
31 */
32 /*
33 * This file is part of Lustre, http://www.lustre.org/
34 * Lustre is a trademark of Sun Microsystems, Inc.
35 */
36
37 /** \defgroup LDLM Lustre Distributed Lock Manager
38 *
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.
44 *
45 * @{
46 */
47
48 #ifndef _LUSTRE_DLM_H__
49 #define _LUSTRE_DLM_H__
50
51 #include "lustre_lib.h"
52 #include "lustre_net.h"
53 #include "lustre_import.h"
54 #include "lustre_handles.h"
55 #include "interval_tree.h" /* for interval_node{}, ldlm_extent */
56 #include "lu_ref.h"
57
58 #include "lustre_dlm_flags.h"
59
60 struct obd_ops;
61 struct obd_device;
62
63 extern struct kset *ldlm_ns_kset;
64 extern struct kset *ldlm_svc_kset;
65
66 #define OBD_LDLM_DEVICENAME "ldlm"
67
68 #define LDLM_DEFAULT_LRU_SIZE (100 * num_online_cpus())
69 #define LDLM_DEFAULT_MAX_ALIVE (cfs_time_seconds(36000))
70 #define LDLM_DEFAULT_PARALLEL_AST_LIMIT 1024
71
72 /**
73 * LDLM non-error return states
74 */
75 typedef enum {
76 ELDLM_OK = 0,
77
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,
83
84 ELDLM_NAMESPACE_EXISTS = 400,
85 ELDLM_BAD_NAMESPACE = 401
86 } ldlm_error_t;
87
88 /**
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.
94 */
95 typedef enum {
96 LDLM_NAMESPACE_SERVER = 1 << 0,
97 LDLM_NAMESPACE_CLIENT = 1 << 1
98 } ldlm_side_t;
99
100 /**
101 * The blocking callback is overloaded to perform two functions. These flags
102 * indicate which operation should be performed.
103 */
104 #define LDLM_CB_BLOCKING 1
105 #define LDLM_CB_CANCELING 2
106
107 /**
108 * \name Lock Compatibility Matrix.
109 *
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.
113 *
114 * There are six lock modes along with a compatibility matrix to indicate if
115 * two locks are compatible.
116 *
117 * - EX: Exclusive mode. Before a new file is created, MDS requests EX lock
118 * on the parent.
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.
128 * - NL Null mode.
129 *
130 * <PRE>
131 * NL CR CW PR PW EX
132 * NL 1 1 1 1 1 1
133 * CR 1 1 1 1 1 0
134 * CW 1 1 1 0 0 0
135 * PR 1 1 0 1 0 0
136 * PW 1 1 0 0 0 0
137 * EX 1 0 0 0 0 0
138 * </PRE>
139 */
140 /** @{ */
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 */
150
151 extern ldlm_mode_t lck_compat_array[];
152
153 static inline void lockmode_verify(ldlm_mode_t mode)
154 {
155 LASSERT(mode > LCK_MINMODE && mode < LCK_MAXMODE);
156 }
157
158 static inline int lockmode_compat(ldlm_mode_t exist_mode, ldlm_mode_t new_mode)
159 {
160 return (lck_compat_array[exist_mode] & new_mode);
161 }
162
163 /*
164 *
165 * cluster name spaces
166 *
167 */
168
169 #define DLM_OST_NAMESPACE 1
170 #define DLM_MDS_NAMESPACE 2
171
172 /* XXX
173 - do we just separate this by security domains and use a prefix for
174 multiple namespaces in the same domain?
175 -
176 */
177
178 /**
179 * Locking rules for LDLM:
180 *
181 * lr_lock
182 *
183 * lr_lock
184 * waiting_locks_spinlock
185 *
186 * lr_lock
187 * led_lock
188 *
189 * lr_lock
190 * ns_lock
191 *
192 * lr_lvb_mutex
193 * lr_lock
194 *
195 */
196
197 struct ldlm_pool;
198 struct ldlm_lock;
199 struct ldlm_resource;
200 struct ldlm_namespace;
201
202 /**
203 * Operations on LDLM pools.
204 * LDLM pool is a pool of locks in the namespace without any implicitly
205 * specified limits.
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
209 */
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,
215 gfp_t gfp_mask);
216 int (*po_setup)(struct ldlm_pool *pl, int limit);
217 };
218
219 /** One second for pools thread check interval. Each pool has own period. */
220 #define LDLM_POOLS_THREAD_PERIOD (1)
221
222 /** ~6% margin for modest pools. See ldlm_pool.c for details. */
223 #define LDLM_POOLS_MODEST_MARGIN_SHIFT (4)
224
225 /** Default recalc period for server side pools in sec. */
226 #define LDLM_POOL_SRV_DEF_RECALC_PERIOD (1)
227
228 /** Default recalc period for client side pools in sec. */
229 #define LDLM_POOL_CLI_DEF_RECALC_PERIOD (10)
230
231 /**
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.
235 */
236 struct ldlm_pool {
237 /** Pool debugfs directory. */
238 struct dentry *pl_debugfs_entry;
239 /** Pool name, must be long enough to hold compound proc entry name. */
240 char pl_name[100];
241 /** Lock for protecting SLV/CLV updates. */
242 spinlock_t pl_lock;
243 /** Number of allowed locks in in pool, both, client and server side. */
244 atomic_t pl_limit;
245 /** Number of granted locks in */
246 atomic_t pl_granted;
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. */
265 int pl_grant_plan;
266 /** Pool statistics. */
267 struct lprocfs_stats *pl_stats;
268
269 /* sysfs object */
270 struct kobject pl_kobj;
271 struct completion pl_kobj_unregister;
272 };
273
274 typedef int (*ldlm_res_policy)(struct ldlm_namespace *, struct ldlm_lock **,
275 void *req_cookie, ldlm_mode_t mode, __u64 flags,
276 void *data);
277
278 typedef int (*ldlm_cancel_for_recovery)(struct ldlm_lock *lock);
279
280 /**
281 * LVB operations.
282 * LVB is Lock Value Block. This is a special opaque (to LDLM) value that could
283 * be associated with an LDLM lock and transferred from client to server and
284 * back.
285 *
286 * Currently LVBs are used by:
287 * - OSC-OST code to maintain current object size/times
288 * - layout lock code to return the layout when the layout lock is granted
289 */
290 struct ldlm_valblock_ops {
291 int (*lvbo_init)(struct ldlm_resource *res);
292 int (*lvbo_update)(struct ldlm_resource *res,
293 struct ptlrpc_request *r,
294 int increase);
295 int (*lvbo_free)(struct ldlm_resource *res);
296 /* Return size of lvb data appropriate RPC size can be reserved */
297 int (*lvbo_size)(struct ldlm_lock *lock);
298 /* Called to fill in lvb data to RPC buffer @buf */
299 int (*lvbo_fill)(struct ldlm_lock *lock, void *buf, int buflen);
300 };
301
302 /**
303 * LDLM pools related, type of lock pool in the namespace.
304 * Greedy means release cached locks aggressively
305 */
306 typedef enum {
307 LDLM_NAMESPACE_GREEDY = 1 << 0,
308 LDLM_NAMESPACE_MODEST = 1 << 1
309 } ldlm_appetite_t;
310
311 struct ldlm_ns_bucket {
312 /** back pointer to namespace */
313 struct ldlm_namespace *nsb_namespace;
314 /**
315 * Estimated lock callback time. Used by adaptive timeout code to
316 * avoid spurious client evictions due to unresponsiveness when in
317 * fact the network or overall system load is at fault
318 */
319 struct adaptive_timeout nsb_at_estimate;
320 };
321
322 enum {
323 /** LDLM namespace lock stats */
324 LDLM_NSS_LOCKS = 0,
325 LDLM_NSS_LAST
326 };
327
328 typedef enum {
329 /** invalid type */
330 LDLM_NS_TYPE_UNKNOWN = 0,
331 /** mdc namespace */
332 LDLM_NS_TYPE_MDC,
333 /** mds namespace */
334 LDLM_NS_TYPE_MDT,
335 /** osc namespace */
336 LDLM_NS_TYPE_OSC,
337 /** ost namespace */
338 LDLM_NS_TYPE_OST,
339 /** mgc namespace */
340 LDLM_NS_TYPE_MGC,
341 /** mgs namespace */
342 LDLM_NS_TYPE_MGT,
343 } ldlm_ns_type_t;
344
345 /**
346 * LDLM Namespace.
347 *
348 * Namespace serves to contain locks related to a particular service.
349 * There are two kinds of namespaces:
350 * - Server namespace has knowledge of all locks and is therefore authoritative
351 * to make decisions like what locks could be granted and what conflicts
352 * exist during new lock enqueue.
353 * - Client namespace only has limited knowledge about locks in the namespace,
354 * only seeing locks held by the client.
355 *
356 * Every Lustre service has one server namespace present on the server serving
357 * that service. Every client connected to the service has a client namespace
358 * for it.
359 * Every lock obtained by client in that namespace is actually represented by
360 * two in-memory locks. One on the server and one on the client. The locks are
361 * linked by a special cookie by which one node can tell to the other which lock
362 * it actually means during communications. Such locks are called remote locks.
363 * The locks held by server only without any reference to a client are called
364 * local locks.
365 */
366 struct ldlm_namespace {
367 /** Backward link to OBD, required for LDLM pool to store new SLV. */
368 struct obd_device *ns_obd;
369
370 /** Flag indicating if namespace is on client instead of server */
371 ldlm_side_t ns_client;
372
373 /** Resource hash table for namespace. */
374 struct cfs_hash *ns_rs_hash;
375
376 /** serialize */
377 spinlock_t ns_lock;
378
379 /** big refcount (by bucket) */
380 atomic_t ns_bref;
381
382 /**
383 * Namespace connect flags supported by server (may be changed via
384 * /proc, LRU resize may be disabled/enabled).
385 */
386 __u64 ns_connect_flags;
387
388 /** Client side original connect flags supported by server. */
389 __u64 ns_orig_connect_flags;
390
391 /* namespace debugfs dir entry */
392 struct dentry *ns_debugfs_entry;
393
394 /**
395 * Position in global namespace list linking all namespaces on
396 * the node.
397 */
398 struct list_head ns_list_chain;
399
400 /**
401 * List of unused locks for this namespace. This list is also called
402 * LRU lock list.
403 * Unused locks are locks with zero reader/writer reference counts.
404 * This list is only used on clients for lock caching purposes.
405 * When we want to release some locks voluntarily or if server wants
406 * us to release some locks due to e.g. memory pressure, we take locks
407 * to release from the head of this list.
408 * Locks are linked via l_lru field in \see struct ldlm_lock.
409 */
410 struct list_head ns_unused_list;
411 /** Number of locks in the LRU list above */
412 int ns_nr_unused;
413
414 /**
415 * Maximum number of locks permitted in the LRU. If 0, means locks
416 * are managed by pools and there is no preset limit, rather it is all
417 * controlled by available memory on this client and on server.
418 */
419 unsigned int ns_max_unused;
420 /** Maximum allowed age (last used time) for locks in the LRU */
421 unsigned int ns_max_age;
422
423 /**
424 * Used to rate-limit ldlm_namespace_dump calls.
425 * \see ldlm_namespace_dump. Increased by 10 seconds every time
426 * it is called.
427 */
428 unsigned long ns_next_dump;
429
430 /** "policy" function that does actual lock conflict determination */
431 ldlm_res_policy ns_policy;
432
433 /**
434 * LVB operations for this namespace.
435 * \see struct ldlm_valblock_ops
436 */
437 struct ldlm_valblock_ops *ns_lvbo;
438
439 /**
440 * Used by filter code to store pointer to OBD of the service.
441 * Should be dropped in favor of \a ns_obd
442 */
443 void *ns_lvbp;
444
445 /**
446 * Wait queue used by __ldlm_namespace_free. Gets woken up every time
447 * a resource is removed.
448 */
449 wait_queue_head_t ns_waitq;
450 /** LDLM pool structure for this namespace */
451 struct ldlm_pool ns_pool;
452 /** Definition of how eagerly unused locks will be released from LRU */
453 ldlm_appetite_t ns_appetite;
454
455 /** Limit of parallel AST RPC count. */
456 unsigned ns_max_parallel_ast;
457
458 /** Callback to cancel locks before replaying it during recovery. */
459 ldlm_cancel_for_recovery ns_cancel_for_recovery;
460
461 /** LDLM lock stats */
462 struct lprocfs_stats *ns_stats;
463
464 /**
465 * Flag to indicate namespace is being freed. Used to determine if
466 * recalculation of LDLM pool statistics should be skipped.
467 */
468 unsigned ns_stopping:1;
469
470 struct kobject ns_kobj; /* sysfs object */
471 struct completion ns_kobj_unregister;
472 };
473
474 /**
475 * Returns 1 if namespace \a ns is a client namespace.
476 */
477 static inline int ns_is_client(struct ldlm_namespace *ns)
478 {
479 LASSERT(ns != NULL);
480 LASSERT(!(ns->ns_client & ~(LDLM_NAMESPACE_CLIENT |
481 LDLM_NAMESPACE_SERVER)));
482 LASSERT(ns->ns_client == LDLM_NAMESPACE_CLIENT ||
483 ns->ns_client == LDLM_NAMESPACE_SERVER);
484 return ns->ns_client == LDLM_NAMESPACE_CLIENT;
485 }
486
487 /**
488 * Returns 1 if namespace \a ns is a server namespace.
489 */
490 static inline int ns_is_server(struct ldlm_namespace *ns)
491 {
492 LASSERT(ns != NULL);
493 LASSERT(!(ns->ns_client & ~(LDLM_NAMESPACE_CLIENT |
494 LDLM_NAMESPACE_SERVER)));
495 LASSERT(ns->ns_client == LDLM_NAMESPACE_CLIENT ||
496 ns->ns_client == LDLM_NAMESPACE_SERVER);
497 return ns->ns_client == LDLM_NAMESPACE_SERVER;
498 }
499
500 /**
501 * Returns 1 if namespace \a ns supports early lock cancel (ELC).
502 */
503 static inline int ns_connect_cancelset(struct ldlm_namespace *ns)
504 {
505 LASSERT(ns != NULL);
506 return !!(ns->ns_connect_flags & OBD_CONNECT_CANCELSET);
507 }
508
509 /**
510 * Returns 1 if this namespace supports lru_resize.
511 */
512 static inline int ns_connect_lru_resize(struct ldlm_namespace *ns)
513 {
514 LASSERT(ns != NULL);
515 return !!(ns->ns_connect_flags & OBD_CONNECT_LRU_RESIZE);
516 }
517
518 static inline void ns_register_cancel(struct ldlm_namespace *ns,
519 ldlm_cancel_for_recovery arg)
520 {
521 LASSERT(ns != NULL);
522 ns->ns_cancel_for_recovery = arg;
523 }
524
525 struct ldlm_lock;
526
527 /** Type for blocking callback function of a lock. */
528 typedef int (*ldlm_blocking_callback)(struct ldlm_lock *lock,
529 struct ldlm_lock_desc *new, void *data,
530 int flag);
531 /** Type for completion callback function of a lock. */
532 typedef int (*ldlm_completion_callback)(struct ldlm_lock *lock, __u64 flags,
533 void *data);
534 /** Type for glimpse callback function of a lock. */
535 typedef int (*ldlm_glimpse_callback)(struct ldlm_lock *lock, void *data);
536
537 /** Work list for sending GL ASTs to multiple locks. */
538 struct ldlm_glimpse_work {
539 struct ldlm_lock *gl_lock; /* lock to glimpse */
540 struct list_head gl_list; /* linkage to other gl work structs */
541 __u32 gl_flags;/* see LDLM_GL_WORK_* below */
542 union ldlm_gl_desc *gl_desc; /* glimpse descriptor to be packed in
543 * glimpse callback request */
544 };
545
546 /** The ldlm_glimpse_work is allocated on the stack and should not be freed. */
547 #define LDLM_GL_WORK_NOFREE 0x1
548
549 /** Interval node data for each LDLM_EXTENT lock. */
550 struct ldlm_interval {
551 struct interval_node li_node; /* node for tree management */
552 struct list_head li_group; /* the locks which have the same
553 * policy - group of the policy */
554 };
555 #define to_ldlm_interval(n) container_of(n, struct ldlm_interval, li_node)
556
557 /**
558 * Interval tree for extent locks.
559 * The interval tree must be accessed under the resource lock.
560 * Interval trees are used for granted extent locks to speed up conflicts
561 * lookup. See ldlm/interval_tree.c for more details.
562 */
563 struct ldlm_interval_tree {
564 /** Tree size. */
565 int lit_size;
566 ldlm_mode_t lit_mode; /* lock mode */
567 struct interval_node *lit_root; /* actual ldlm_interval */
568 };
569
570 /** Whether to track references to exports by LDLM locks. */
571 #define LUSTRE_TRACKS_LOCK_EXP_REFS (0)
572
573 /** Cancel flags. */
574 typedef enum {
575 LCF_ASYNC = 0x1, /* Cancel locks asynchronously. */
576 LCF_LOCAL = 0x2, /* Cancel locks locally, not notifing server */
577 LCF_BL_AST = 0x4, /* Cancel locks marked as LDLM_FL_BL_AST
578 * in the same RPC */
579 } ldlm_cancel_flags_t;
580
581 struct ldlm_flock {
582 __u64 start;
583 __u64 end;
584 __u64 owner;
585 __u64 blocking_owner;
586 struct obd_export *blocking_export;
587 /* Protected by the hash lock */
588 __u32 blocking_refs;
589 __u32 pid;
590 };
591
592 typedef union {
593 struct ldlm_extent l_extent;
594 struct ldlm_flock l_flock;
595 struct ldlm_inodebits l_inodebits;
596 } ldlm_policy_data_t;
597
598 void ldlm_convert_policy_to_wire(ldlm_type_t type,
599 const ldlm_policy_data_t *lpolicy,
600 ldlm_wire_policy_data_t *wpolicy);
601 void ldlm_convert_policy_to_local(struct obd_export *exp, ldlm_type_t type,
602 const ldlm_wire_policy_data_t *wpolicy,
603 ldlm_policy_data_t *lpolicy);
604
605 enum lvb_type {
606 LVB_T_NONE = 0,
607 LVB_T_OST = 1,
608 LVB_T_LQUOTA = 2,
609 LVB_T_LAYOUT = 3,
610 };
611
612 /**
613 * LDLM lock structure
614 *
615 * Represents a single LDLM lock and its state in memory. Each lock is
616 * associated with a single ldlm_resource, the object which is being
617 * locked. There may be multiple ldlm_locks on a single resource,
618 * depending on the lock type and whether the locks are conflicting or
619 * not.
620 */
621 struct ldlm_lock {
622 /**
623 * Local lock handle.
624 * When remote side wants to tell us about a lock, they address
625 * it by this opaque handle. The handle does not hold a
626 * reference on the ldlm_lock, so it can be safely passed to
627 * other threads or nodes. When the lock needs to be accessed
628 * from the handle, it is looked up again in the lock table, and
629 * may no longer exist.
630 *
631 * Must be first in the structure.
632 */
633 struct portals_handle l_handle;
634 /**
635 * Lock reference count.
636 * This is how many users have pointers to actual structure, so that
637 * we do not accidentally free lock structure that is in use.
638 */
639 atomic_t l_refc;
640 /**
641 * Internal spinlock protects l_resource. We should hold this lock
642 * first before taking res_lock.
643 */
644 spinlock_t l_lock;
645 /**
646 * Pointer to actual resource this lock is in.
647 * ldlm_lock_change_resource() can change this.
648 */
649 struct ldlm_resource *l_resource;
650 /**
651 * List item for client side LRU list.
652 * Protected by ns_lock in struct ldlm_namespace.
653 */
654 struct list_head l_lru;
655 /**
656 * Linkage to resource's lock queues according to current lock state.
657 * (could be granted, waiting or converting)
658 * Protected by lr_lock in struct ldlm_resource.
659 */
660 struct list_head l_res_link;
661 /**
662 * Tree node for ldlm_extent.
663 */
664 struct ldlm_interval *l_tree_node;
665 /**
666 * Per export hash of locks.
667 * Protected by per-bucket exp->exp_lock_hash locks.
668 */
669 struct hlist_node l_exp_hash;
670 /**
671 * Per export hash of flock locks.
672 * Protected by per-bucket exp->exp_flock_hash locks.
673 */
674 struct hlist_node l_exp_flock_hash;
675 /**
676 * Requested mode.
677 * Protected by lr_lock.
678 */
679 ldlm_mode_t l_req_mode;
680 /**
681 * Granted mode, also protected by lr_lock.
682 */
683 ldlm_mode_t l_granted_mode;
684 /** Lock completion handler pointer. Called when lock is granted. */
685 ldlm_completion_callback l_completion_ast;
686 /**
687 * Lock blocking AST handler pointer.
688 * It plays two roles:
689 * - as a notification of an attempt to queue a conflicting lock (once)
690 * - as a notification when the lock is being cancelled.
691 *
692 * As such it's typically called twice: once for the initial conflict
693 * and then once more when the last user went away and the lock is
694 * cancelled (could happen recursively).
695 */
696 ldlm_blocking_callback l_blocking_ast;
697 /**
698 * Lock glimpse handler.
699 * Glimpse handler is used to obtain LVB updates from a client by
700 * server
701 */
702 ldlm_glimpse_callback l_glimpse_ast;
703
704 /**
705 * Lock export.
706 * This is a pointer to actual client export for locks that were granted
707 * to clients. Used server-side.
708 */
709 struct obd_export *l_export;
710 /**
711 * Lock connection export.
712 * Pointer to server export on a client.
713 */
714 struct obd_export *l_conn_export;
715
716 /**
717 * Remote lock handle.
718 * If the lock is remote, this is the handle of the other side lock
719 * (l_handle)
720 */
721 struct lustre_handle l_remote_handle;
722
723 /**
724 * Representation of private data specific for a lock type.
725 * Examples are: extent range for extent lock or bitmask for ibits locks
726 */
727 ldlm_policy_data_t l_policy_data;
728
729 /**
730 * Lock state flags. Protected by lr_lock.
731 * \see lustre_dlm_flags.h where the bits are defined.
732 */
733 __u64 l_flags;
734
735 /**
736 * Lock r/w usage counters.
737 * Protected by lr_lock.
738 */
739 __u32 l_readers;
740 __u32 l_writers;
741 /**
742 * If the lock is granted, a process sleeps on this waitq to learn when
743 * it's no longer in use. If the lock is not granted, a process sleeps
744 * on this waitq to learn when it becomes granted.
745 */
746 wait_queue_head_t l_waitq;
747
748 /**
749 * Seconds. It will be updated if there is any activity related to
750 * the lock, e.g. enqueue the lock or send blocking AST.
751 */
752 unsigned long l_last_activity;
753
754 /**
755 * Time last used by e.g. being matched by lock match.
756 * Jiffies. Should be converted to time if needed.
757 */
758 unsigned long l_last_used;
759
760 /** Originally requested extent for the extent lock. */
761 struct ldlm_extent l_req_extent;
762
763 /*
764 * Client-side-only members.
765 */
766
767 enum lvb_type l_lvb_type;
768
769 /**
770 * Temporary storage for a LVB received during an enqueue operation.
771 */
772 __u32 l_lvb_len;
773 void *l_lvb_data;
774
775 /** Private storage for lock user. Opaque to LDLM. */
776 void *l_ast_data;
777
778 /*
779 * Server-side-only members.
780 */
781
782 /**
783 * Connection cookie for the client originating the operation.
784 * Used by Commit on Share (COS) code. Currently only used for
785 * inodebits locks on MDS.
786 */
787 __u64 l_client_cookie;
788
789 /**
790 * List item for locks waiting for cancellation from clients.
791 * The lists this could be linked into are:
792 * waiting_locks_list (protected by waiting_locks_spinlock),
793 * then if the lock timed out, it is moved to
794 * expired_lock_thread.elt_expired_locks for further processing.
795 * Protected by elt_lock.
796 */
797 struct list_head l_pending_chain;
798
799 /**
800 * Set when lock is sent a blocking AST. Time in seconds when timeout
801 * is reached and client holding this lock could be evicted.
802 * This timeout could be further extended by e.g. certain IO activity
803 * under this lock.
804 * \see ost_rw_prolong_locks
805 */
806 unsigned long l_callback_timeout;
807
808 /** Local PID of process which created this lock. */
809 __u32 l_pid;
810
811 /**
812 * Number of times blocking AST was sent for this lock.
813 * This is for debugging. Valid values are 0 and 1, if there is an
814 * attempt to send blocking AST more than once, an assertion would be
815 * hit. \see ldlm_work_bl_ast_lock
816 */
817 int l_bl_ast_run;
818 /** List item ldlm_add_ast_work_item() for case of blocking ASTs. */
819 struct list_head l_bl_ast;
820 /** List item ldlm_add_ast_work_item() for case of completion ASTs. */
821 struct list_head l_cp_ast;
822 /** For ldlm_add_ast_work_item() for "revoke" AST used in COS. */
823 struct list_head l_rk_ast;
824
825 /**
826 * Pointer to a conflicting lock that caused blocking AST to be sent
827 * for this lock
828 */
829 struct ldlm_lock *l_blocking_lock;
830
831 /**
832 * Protected by lr_lock, linkages to "skip lists".
833 * For more explanations of skip lists see ldlm/ldlm_inodebits.c
834 */
835 struct list_head l_sl_mode;
836 struct list_head l_sl_policy;
837
838 /** Reference tracking structure to debug leaked locks. */
839 struct lu_ref l_reference;
840 #if LUSTRE_TRACKS_LOCK_EXP_REFS
841 /* Debugging stuff for bug 20498, for tracking export references. */
842 /** number of export references taken */
843 int l_exp_refs_nr;
844 /** link all locks referencing one export */
845 struct list_head l_exp_refs_link;
846 /** referenced export object */
847 struct obd_export *l_exp_refs_target;
848 #endif
849 /**
850 * export blocking dlm lock list, protected by
851 * l_export->exp_bl_list_lock.
852 * Lock order of waiting_lists_spinlock, exp_bl_list_lock and res lock
853 * is: res lock -> exp_bl_list_lock -> wanting_lists_spinlock.
854 */
855 struct list_head l_exp_list;
856 };
857
858 /**
859 * LDLM resource description.
860 * Basically, resource is a representation for a single object.
861 * Object has a name which is currently 4 64-bit integers. LDLM user is
862 * responsible for creation of a mapping between objects it wants to be
863 * protected and resource names.
864 *
865 * A resource can only hold locks of a single lock type, though there may be
866 * multiple ldlm_locks on a single resource, depending on the lock type and
867 * whether the locks are conflicting or not.
868 */
869 struct ldlm_resource {
870 struct ldlm_ns_bucket *lr_ns_bucket;
871
872 /**
873 * List item for list in namespace hash.
874 * protected by ns_lock
875 */
876 struct hlist_node lr_hash;
877
878 /** Spinlock to protect locks under this resource. */
879 spinlock_t lr_lock;
880
881 /**
882 * protected by lr_lock
883 * @{ */
884 /** List of locks in granted state */
885 struct list_head lr_granted;
886 /** List of locks waiting to change their granted mode (converted) */
887 struct list_head lr_converting;
888 /**
889 * List of locks that could not be granted due to conflicts and
890 * that are waiting for conflicts to go away */
891 struct list_head lr_waiting;
892 /** @} */
893
894 /* XXX No longer needed? Remove ASAP */
895 ldlm_mode_t lr_most_restr;
896
897 /** Type of locks this resource can hold. Only one type per resource. */
898 ldlm_type_t lr_type; /* LDLM_{PLAIN,EXTENT,FLOCK,IBITS} */
899
900 /** Resource name */
901 struct ldlm_res_id lr_name;
902 /** Reference count for this resource */
903 atomic_t lr_refcount;
904
905 /**
906 * Interval trees (only for extent locks) for all modes of this resource
907 */
908 struct ldlm_interval_tree lr_itree[LCK_MODE_NUM];
909
910 /**
911 * Server-side-only lock value block elements.
912 * To serialize lvbo_init.
913 */
914 struct mutex lr_lvb_mutex;
915 int lr_lvb_len;
916 /** protected by lr_lock */
917 void *lr_lvb_data;
918
919 /** When the resource was considered as contended. */
920 unsigned long lr_contention_time;
921 /** List of references to this resource. For debugging. */
922 struct lu_ref lr_reference;
923
924 struct inode *lr_lvb_inode;
925 };
926
927 static inline bool ldlm_has_layout(struct ldlm_lock *lock)
928 {
929 return lock->l_resource->lr_type == LDLM_IBITS &&
930 lock->l_policy_data.l_inodebits.bits & MDS_INODELOCK_LAYOUT;
931 }
932
933 static inline char *
934 ldlm_ns_name(struct ldlm_namespace *ns)
935 {
936 return ns->ns_rs_hash->hs_name;
937 }
938
939 static inline struct ldlm_namespace *
940 ldlm_res_to_ns(struct ldlm_resource *res)
941 {
942 return res->lr_ns_bucket->nsb_namespace;
943 }
944
945 static inline struct ldlm_namespace *
946 ldlm_lock_to_ns(struct ldlm_lock *lock)
947 {
948 return ldlm_res_to_ns(lock->l_resource);
949 }
950
951 static inline char *
952 ldlm_lock_to_ns_name(struct ldlm_lock *lock)
953 {
954 return ldlm_ns_name(ldlm_lock_to_ns(lock));
955 }
956
957 static inline struct adaptive_timeout *
958 ldlm_lock_to_ns_at(struct ldlm_lock *lock)
959 {
960 return &lock->l_resource->lr_ns_bucket->nsb_at_estimate;
961 }
962
963 static inline int ldlm_lvbo_init(struct ldlm_resource *res)
964 {
965 struct ldlm_namespace *ns = ldlm_res_to_ns(res);
966
967 if (ns->ns_lvbo != NULL && ns->ns_lvbo->lvbo_init != NULL)
968 return ns->ns_lvbo->lvbo_init(res);
969
970 return 0;
971 }
972
973 static inline int ldlm_lvbo_size(struct ldlm_lock *lock)
974 {
975 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
976
977 if (ns->ns_lvbo != NULL && ns->ns_lvbo->lvbo_size != NULL)
978 return ns->ns_lvbo->lvbo_size(lock);
979
980 return 0;
981 }
982
983 static inline int ldlm_lvbo_fill(struct ldlm_lock *lock, void *buf, int len)
984 {
985 struct ldlm_namespace *ns = ldlm_lock_to_ns(lock);
986
987 if (ns->ns_lvbo != NULL) {
988 LASSERT(ns->ns_lvbo->lvbo_fill != NULL);
989 return ns->ns_lvbo->lvbo_fill(lock, buf, len);
990 }
991 return 0;
992 }
993
994 struct ldlm_ast_work {
995 struct ldlm_lock *w_lock;
996 int w_blocking;
997 struct ldlm_lock_desc w_desc;
998 struct list_head w_list;
999 int w_flags;
1000 void *w_data;
1001 int w_datalen;
1002 };
1003
1004 /**
1005 * Common ldlm_enqueue parameters
1006 */
1007 struct ldlm_enqueue_info {
1008 __u32 ei_type; /** Type of the lock being enqueued. */
1009 __u32 ei_mode; /** Mode of the lock being enqueued. */
1010 void *ei_cb_bl; /** blocking lock callback */
1011 void *ei_cb_cp; /** lock completion callback */
1012 void *ei_cb_gl; /** lock glimpse callback */
1013 void *ei_cbdata; /** Data to be passed into callbacks. */
1014 };
1015
1016 extern struct obd_ops ldlm_obd_ops;
1017
1018 extern char *ldlm_lockname[];
1019 extern char *ldlm_typename[];
1020 extern char *ldlm_it2str(int it);
1021
1022 /**
1023 * Just a fancy CDEBUG call with log level preset to LDLM_DEBUG.
1024 * For the cases where we do not have actual lock to print along
1025 * with a debugging message that is ldlm-related
1026 */
1027 #define LDLM_DEBUG_NOLOCK(format, a...) \
1028 CDEBUG(D_DLMTRACE, "### " format "\n" , ##a)
1029
1030 /**
1031 * Support function for lock information printing into debug logs.
1032 * \see LDLM_DEBUG
1033 */
1034 #define ldlm_lock_debug(msgdata, mask, cdls, lock, fmt, a...) do { \
1035 CFS_CHECK_STACK(msgdata, mask, cdls); \
1036 \
1037 if (((mask) & D_CANTMASK) != 0 || \
1038 ((libcfs_debug & (mask)) != 0 && \
1039 (libcfs_subsystem_debug & DEBUG_SUBSYSTEM) != 0)) \
1040 _ldlm_lock_debug(lock, msgdata, fmt, ##a); \
1041 } while (0)
1042
1043 void _ldlm_lock_debug(struct ldlm_lock *lock,
1044 struct libcfs_debug_msg_data *data,
1045 const char *fmt, ...)
1046 __printf(3, 4);
1047
1048 /**
1049 * Rate-limited version of lock printing function.
1050 */
1051 #define LDLM_DEBUG_LIMIT(mask, lock, fmt, a...) do { \
1052 static struct cfs_debug_limit_state _ldlm_cdls; \
1053 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, mask, &_ldlm_cdls); \
1054 ldlm_lock_debug(&msgdata, mask, &_ldlm_cdls, lock, "### " fmt , ##a);\
1055 } while (0)
1056
1057 #define LDLM_ERROR(lock, fmt, a...) LDLM_DEBUG_LIMIT(D_ERROR, lock, fmt, ## a)
1058 #define LDLM_WARN(lock, fmt, a...) LDLM_DEBUG_LIMIT(D_WARNING, lock, fmt, ## a)
1059
1060 /** Non-rate-limited lock printing function for debugging purposes. */
1061 #define LDLM_DEBUG(lock, fmt, a...) do { \
1062 if (likely(lock != NULL)) { \
1063 LIBCFS_DEBUG_MSG_DATA_DECL(msgdata, D_DLMTRACE, NULL); \
1064 ldlm_lock_debug(&msgdata, D_DLMTRACE, NULL, lock, \
1065 "### " fmt , ##a); \
1066 } else { \
1067 LDLM_DEBUG_NOLOCK("no dlm lock: " fmt, ##a); \
1068 } \
1069 } while (0)
1070
1071 typedef int (*ldlm_processing_policy)(struct ldlm_lock *lock, __u64 *flags,
1072 int first_enq, ldlm_error_t *err,
1073 struct list_head *work_list);
1074
1075 /**
1076 * Return values for lock iterators.
1077 * Also used during deciding of lock grants and cancellations.
1078 */
1079 #define LDLM_ITER_CONTINUE 1 /* keep iterating */
1080 #define LDLM_ITER_STOP 2 /* stop iterating */
1081
1082 typedef int (*ldlm_iterator_t)(struct ldlm_lock *, void *);
1083 typedef int (*ldlm_res_iterator_t)(struct ldlm_resource *, void *);
1084
1085 /** \defgroup ldlm_iterator Lock iterators
1086 *
1087 * LDLM provides for a way to iterate through every lock on a resource or
1088 * namespace or every resource in a namespace.
1089 * @{ */
1090 int ldlm_resource_foreach(struct ldlm_resource *res, ldlm_iterator_t iter,
1091 void *closure);
1092 void ldlm_namespace_foreach(struct ldlm_namespace *ns, ldlm_iterator_t iter,
1093 void *closure);
1094 int ldlm_resource_iterate(struct ldlm_namespace *, const struct ldlm_res_id *,
1095 ldlm_iterator_t iter, void *data);
1096 /** @} ldlm_iterator */
1097
1098 int ldlm_replay_locks(struct obd_import *imp);
1099
1100 /* ldlm_flock.c */
1101 int ldlm_flock_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data);
1102
1103 /* ldlm_extent.c */
1104 __u64 ldlm_extent_shift_kms(struct ldlm_lock *lock, __u64 old_kms);
1105
1106 struct ldlm_callback_suite {
1107 ldlm_completion_callback lcs_completion;
1108 ldlm_blocking_callback lcs_blocking;
1109 ldlm_glimpse_callback lcs_glimpse;
1110 };
1111
1112 /* ldlm_lockd.c */
1113 int ldlm_del_waiting_lock(struct ldlm_lock *lock);
1114 int ldlm_refresh_waiting_lock(struct ldlm_lock *lock, int timeout);
1115 int ldlm_get_ref(void);
1116 void ldlm_put_ref(void);
1117 int ldlm_init_export(struct obd_export *exp);
1118 void ldlm_destroy_export(struct obd_export *exp);
1119 struct ldlm_lock *ldlm_request_lock(struct ptlrpc_request *req);
1120
1121 /* ldlm_lock.c */
1122 void ldlm_register_intent(struct ldlm_namespace *ns, ldlm_res_policy arg);
1123 void ldlm_lock2handle(const struct ldlm_lock *lock,
1124 struct lustre_handle *lockh);
1125 struct ldlm_lock *__ldlm_handle2lock(const struct lustre_handle *, __u64 flags);
1126 void ldlm_cancel_callback(struct ldlm_lock *);
1127 int ldlm_lock_remove_from_lru(struct ldlm_lock *);
1128 int ldlm_lock_set_data(struct lustre_handle *, void *);
1129
1130 /**
1131 * Obtain a lock reference by its handle.
1132 */
1133 static inline struct ldlm_lock *ldlm_handle2lock(const struct lustre_handle *h)
1134 {
1135 return __ldlm_handle2lock(h, 0);
1136 }
1137
1138 #define LDLM_LOCK_REF_DEL(lock) \
1139 lu_ref_del(&lock->l_reference, "handle", current)
1140
1141 static inline struct ldlm_lock *
1142 ldlm_handle2lock_long(const struct lustre_handle *h, __u64 flags)
1143 {
1144 struct ldlm_lock *lock;
1145
1146 lock = __ldlm_handle2lock(h, flags);
1147 if (lock != NULL)
1148 LDLM_LOCK_REF_DEL(lock);
1149 return lock;
1150 }
1151
1152 /**
1153 * Update Lock Value Block Operations (LVBO) on a resource taking into account
1154 * data from request \a r
1155 */
1156 static inline int ldlm_res_lvbo_update(struct ldlm_resource *res,
1157 struct ptlrpc_request *r, int increase)
1158 {
1159 if (ldlm_res_to_ns(res)->ns_lvbo &&
1160 ldlm_res_to_ns(res)->ns_lvbo->lvbo_update) {
1161 return ldlm_res_to_ns(res)->ns_lvbo->lvbo_update(res, r,
1162 increase);
1163 }
1164 return 0;
1165 }
1166
1167 int ldlm_error2errno(ldlm_error_t error);
1168 ldlm_error_t ldlm_errno2error(int err_no); /* don't call it `errno': this
1169 * confuses user-space. */
1170 #if LUSTRE_TRACKS_LOCK_EXP_REFS
1171 void ldlm_dump_export_locks(struct obd_export *exp);
1172 #endif
1173
1174 /**
1175 * Release a temporary lock reference obtained by ldlm_handle2lock() or
1176 * __ldlm_handle2lock().
1177 */
1178 #define LDLM_LOCK_PUT(lock) \
1179 do { \
1180 LDLM_LOCK_REF_DEL(lock); \
1181 /*LDLM_DEBUG((lock), "put");*/ \
1182 ldlm_lock_put(lock); \
1183 } while (0)
1184
1185 /**
1186 * Release a lock reference obtained by some other means (see
1187 * LDLM_LOCK_PUT()).
1188 */
1189 #define LDLM_LOCK_RELEASE(lock) \
1190 do { \
1191 /*LDLM_DEBUG((lock), "put");*/ \
1192 ldlm_lock_put(lock); \
1193 } while (0)
1194
1195 #define LDLM_LOCK_GET(lock) \
1196 ({ \
1197 ldlm_lock_get(lock); \
1198 /*LDLM_DEBUG((lock), "get");*/ \
1199 lock; \
1200 })
1201
1202 #define ldlm_lock_list_put(head, member, count) \
1203 ({ \
1204 struct ldlm_lock *_lock, *_next; \
1205 int c = count; \
1206 list_for_each_entry_safe(_lock, _next, head, member) { \
1207 if (c-- == 0) \
1208 break; \
1209 list_del_init(&_lock->member); \
1210 LDLM_LOCK_RELEASE(_lock); \
1211 } \
1212 LASSERT(c <= 0); \
1213 })
1214
1215 struct ldlm_lock *ldlm_lock_get(struct ldlm_lock *lock);
1216 void ldlm_lock_put(struct ldlm_lock *lock);
1217 void ldlm_lock_destroy(struct ldlm_lock *lock);
1218 void ldlm_lock2desc(struct ldlm_lock *lock, struct ldlm_lock_desc *desc);
1219 void ldlm_lock_addref(struct lustre_handle *lockh, __u32 mode);
1220 int ldlm_lock_addref_try(struct lustre_handle *lockh, __u32 mode);
1221 void ldlm_lock_decref(struct lustre_handle *lockh, __u32 mode);
1222 void ldlm_lock_decref_and_cancel(struct lustre_handle *lockh, __u32 mode);
1223 void ldlm_lock_fail_match_locked(struct ldlm_lock *lock);
1224 void ldlm_lock_fail_match(struct ldlm_lock *lock);
1225 void ldlm_lock_allow_match(struct ldlm_lock *lock);
1226 void ldlm_lock_allow_match_locked(struct ldlm_lock *lock);
1227 ldlm_mode_t ldlm_lock_match(struct ldlm_namespace *ns, __u64 flags,
1228 const struct ldlm_res_id *, ldlm_type_t type,
1229 ldlm_policy_data_t *, ldlm_mode_t mode,
1230 struct lustre_handle *, int unref);
1231 ldlm_mode_t ldlm_revalidate_lock_handle(struct lustre_handle *lockh,
1232 __u64 *bits);
1233 struct ldlm_resource *ldlm_lock_convert(struct ldlm_lock *lock, int new_mode,
1234 __u32 *flags);
1235 void ldlm_lock_downgrade(struct ldlm_lock *lock, int new_mode);
1236 void ldlm_lock_cancel(struct ldlm_lock *lock);
1237 void ldlm_reprocess_all(struct ldlm_resource *res);
1238 void ldlm_reprocess_all_ns(struct ldlm_namespace *ns);
1239 void ldlm_lock_dump_handle(int level, struct lustre_handle *);
1240 void ldlm_unlink_lock_skiplist(struct ldlm_lock *req);
1241
1242 /* resource.c */
1243 struct ldlm_namespace *
1244 ldlm_namespace_new(struct obd_device *obd, char *name,
1245 ldlm_side_t client, ldlm_appetite_t apt,
1246 ldlm_ns_type_t ns_type);
1247 int ldlm_namespace_cleanup(struct ldlm_namespace *ns, __u64 flags);
1248 void ldlm_namespace_free(struct ldlm_namespace *ns,
1249 struct obd_import *imp, int force);
1250 void ldlm_namespace_register(struct ldlm_namespace *ns, ldlm_side_t client);
1251 void ldlm_namespace_unregister(struct ldlm_namespace *ns, ldlm_side_t client);
1252 void ldlm_namespace_get(struct ldlm_namespace *ns);
1253 void ldlm_namespace_put(struct ldlm_namespace *ns);
1254 int ldlm_debugfs_setup(void);
1255 void ldlm_debugfs_cleanup(void);
1256
1257 /* resource.c - internal */
1258 struct ldlm_resource *ldlm_resource_get(struct ldlm_namespace *ns,
1259 struct ldlm_resource *parent,
1260 const struct ldlm_res_id *,
1261 ldlm_type_t type, int create);
1262 struct ldlm_resource *ldlm_resource_getref(struct ldlm_resource *res);
1263 int ldlm_resource_putref(struct ldlm_resource *res);
1264 void ldlm_resource_add_lock(struct ldlm_resource *res,
1265 struct list_head *head,
1266 struct ldlm_lock *lock);
1267 void ldlm_resource_unlink_lock(struct ldlm_lock *lock);
1268 void ldlm_res2desc(struct ldlm_resource *res, struct ldlm_resource_desc *desc);
1269 void ldlm_dump_all_namespaces(ldlm_side_t client, int level);
1270 void ldlm_namespace_dump(int level, struct ldlm_namespace *);
1271 void ldlm_resource_dump(int level, struct ldlm_resource *);
1272 int ldlm_lock_change_resource(struct ldlm_namespace *, struct ldlm_lock *,
1273 const struct ldlm_res_id *);
1274
1275 #define LDLM_RESOURCE_ADDREF(res) do { \
1276 lu_ref_add_atomic(&(res)->lr_reference, __func__, current); \
1277 } while (0)
1278
1279 #define LDLM_RESOURCE_DELREF(res) do { \
1280 lu_ref_del(&(res)->lr_reference, __func__, current); \
1281 } while (0)
1282
1283 /* ldlm_request.c */
1284 int ldlm_expired_completion_wait(void *data);
1285 /** \defgroup ldlm_local_ast Default AST handlers for local locks
1286 * These AST handlers are typically used for server-side local locks and are
1287 * also used by client-side lock handlers to perform minimum level base
1288 * processing.
1289 * @{ */
1290 int ldlm_blocking_ast_nocheck(struct ldlm_lock *lock);
1291 int ldlm_blocking_ast(struct ldlm_lock *lock, struct ldlm_lock_desc *desc,
1292 void *data, int flag);
1293 int ldlm_glimpse_ast(struct ldlm_lock *lock, void *reqp);
1294 int ldlm_completion_ast_async(struct ldlm_lock *lock, __u64 flags, void *data);
1295 int ldlm_completion_ast(struct ldlm_lock *lock, __u64 flags, void *data);
1296 /** @} ldlm_local_ast */
1297
1298 /** \defgroup ldlm_cli_api API to operate on locks from actual LDLM users.
1299 * These are typically used by client and server (*_local versions)
1300 * to obtain and release locks.
1301 * @{ */
1302 int ldlm_cli_enqueue(struct obd_export *exp, struct ptlrpc_request **reqp,
1303 struct ldlm_enqueue_info *einfo,
1304 const struct ldlm_res_id *res_id,
1305 ldlm_policy_data_t const *policy, __u64 *flags,
1306 void *lvb, __u32 lvb_len, enum lvb_type lvb_type,
1307 struct lustre_handle *lockh, int async);
1308 int ldlm_prep_enqueue_req(struct obd_export *exp,
1309 struct ptlrpc_request *req,
1310 struct list_head *cancels,
1311 int count);
1312 int ldlm_prep_elc_req(struct obd_export *exp,
1313 struct ptlrpc_request *req,
1314 int version, int opc, int canceloff,
1315 struct list_head *cancels, int count);
1316
1317 struct ptlrpc_request *ldlm_enqueue_pack(struct obd_export *exp, int lvb_len);
1318 int ldlm_handle_enqueue0(struct ldlm_namespace *ns, struct ptlrpc_request *req,
1319 const struct ldlm_request *dlm_req,
1320 const struct ldlm_callback_suite *cbs);
1321 int ldlm_cli_enqueue_fini(struct obd_export *exp, struct ptlrpc_request *req,
1322 ldlm_type_t type, __u8 with_policy, ldlm_mode_t mode,
1323 __u64 *flags, void *lvb, __u32 lvb_len,
1324 struct lustre_handle *lockh, int rc);
1325 int ldlm_cli_enqueue_local(struct ldlm_namespace *ns,
1326 const struct ldlm_res_id *res_id,
1327 ldlm_type_t type, ldlm_policy_data_t *policy,
1328 ldlm_mode_t mode, __u64 *flags,
1329 ldlm_blocking_callback blocking,
1330 ldlm_completion_callback completion,
1331 ldlm_glimpse_callback glimpse,
1332 void *data, __u32 lvb_len, enum lvb_type lvb_type,
1333 const __u64 *client_cookie,
1334 struct lustre_handle *lockh);
1335 int ldlm_server_ast(struct lustre_handle *lockh, struct ldlm_lock_desc *new,
1336 void *data, __u32 data_len);
1337 int ldlm_cli_convert(struct lustre_handle *, int new_mode, __u32 *flags);
1338 int ldlm_cli_update_pool(struct ptlrpc_request *req);
1339 int ldlm_cli_cancel(struct lustre_handle *lockh,
1340 ldlm_cancel_flags_t cancel_flags);
1341 int ldlm_cli_cancel_unused(struct ldlm_namespace *, const struct ldlm_res_id *,
1342 ldlm_cancel_flags_t flags, void *opaque);
1343 int ldlm_cli_cancel_unused_resource(struct ldlm_namespace *ns,
1344 const struct ldlm_res_id *res_id,
1345 ldlm_policy_data_t *policy,
1346 ldlm_mode_t mode,
1347 ldlm_cancel_flags_t flags,
1348 void *opaque);
1349 int ldlm_cli_cancel_req(struct obd_export *exp, struct list_head *head,
1350 int count, ldlm_cancel_flags_t flags);
1351 int ldlm_cancel_resource_local(struct ldlm_resource *res,
1352 struct list_head *cancels,
1353 ldlm_policy_data_t *policy,
1354 ldlm_mode_t mode, __u64 lock_flags,
1355 ldlm_cancel_flags_t cancel_flags, void *opaque);
1356 int ldlm_cli_cancel_list_local(struct list_head *cancels, int count,
1357 ldlm_cancel_flags_t flags);
1358 int ldlm_cli_cancel_list(struct list_head *head, int count,
1359 struct ptlrpc_request *req, ldlm_cancel_flags_t flags);
1360 /** @} ldlm_cli_api */
1361
1362 /* mds/handler.c */
1363 /* This has to be here because recursive inclusion sucks. */
1364 int intent_disposition(struct ldlm_reply *rep, int flag);
1365 void intent_set_disposition(struct ldlm_reply *rep, int flag);
1366
1367
1368 /* ioctls for trying requests */
1369 #define IOC_LDLM_TYPE 'f'
1370 #define IOC_LDLM_MIN_NR 40
1371
1372 #define IOC_LDLM_TEST _IOWR('f', 40, long)
1373 #define IOC_LDLM_DUMP _IOWR('f', 41, long)
1374 #define IOC_LDLM_REGRESS_START _IOWR('f', 42, long)
1375 #define IOC_LDLM_REGRESS_STOP _IOWR('f', 43, long)
1376 #define IOC_LDLM_MAX_NR 43
1377
1378 /**
1379 * "Modes" of acquiring lock_res, necessary to tell lockdep that taking more
1380 * than one lock_res is dead-lock safe.
1381 */
1382 enum lock_res_type {
1383 LRT_NORMAL,
1384 LRT_NEW
1385 };
1386
1387 /** Lock resource. */
1388 static inline void lock_res(struct ldlm_resource *res)
1389 {
1390 spin_lock(&res->lr_lock);
1391 }
1392
1393 /** Lock resource with a way to instruct lockdep code about nestedness-safe. */
1394 static inline void lock_res_nested(struct ldlm_resource *res,
1395 enum lock_res_type mode)
1396 {
1397 spin_lock_nested(&res->lr_lock, mode);
1398 }
1399
1400 /** Unlock resource. */
1401 static inline void unlock_res(struct ldlm_resource *res)
1402 {
1403 spin_unlock(&res->lr_lock);
1404 }
1405
1406 /** Check if resource is already locked, assert if not. */
1407 static inline void check_res_locked(struct ldlm_resource *res)
1408 {
1409 assert_spin_locked(&res->lr_lock);
1410 }
1411
1412 struct ldlm_resource *lock_res_and_lock(struct ldlm_lock *lock);
1413 void unlock_res_and_lock(struct ldlm_lock *lock);
1414
1415 /* ldlm_pool.c */
1416 /** \defgroup ldlm_pools Various LDLM pool related functions
1417 * There are not used outside of ldlm.
1418 * @{
1419 */
1420 int ldlm_pools_recalc(ldlm_side_t client);
1421 int ldlm_pools_init(void);
1422 void ldlm_pools_fini(void);
1423
1424 int ldlm_pool_init(struct ldlm_pool *pl, struct ldlm_namespace *ns,
1425 int idx, ldlm_side_t client);
1426 int ldlm_pool_shrink(struct ldlm_pool *pl, int nr,
1427 gfp_t gfp_mask);
1428 void ldlm_pool_fini(struct ldlm_pool *pl);
1429 int ldlm_pool_setup(struct ldlm_pool *pl, int limit);
1430 int ldlm_pool_recalc(struct ldlm_pool *pl);
1431 __u32 ldlm_pool_get_lvf(struct ldlm_pool *pl);
1432 __u64 ldlm_pool_get_slv(struct ldlm_pool *pl);
1433 __u64 ldlm_pool_get_clv(struct ldlm_pool *pl);
1434 __u32 ldlm_pool_get_limit(struct ldlm_pool *pl);
1435 void ldlm_pool_set_slv(struct ldlm_pool *pl, __u64 slv);
1436 void ldlm_pool_set_clv(struct ldlm_pool *pl, __u64 clv);
1437 void ldlm_pool_set_limit(struct ldlm_pool *pl, __u32 limit);
1438 void ldlm_pool_add(struct ldlm_pool *pl, struct ldlm_lock *lock);
1439 void ldlm_pool_del(struct ldlm_pool *pl, struct ldlm_lock *lock);
1440 /** @} */
1441
1442 #endif
1443 /** @} LDLM */