Home | History | Annotate | Download | only in linux

Lines Matching full:lock

19  * Lock-class usage-state bits:
60 * Lock-classes are keyed via unique addresses, by embedding the
62 * static locks we use the lock address itself as the key.)
73 * The lock-class itself:
82 * global list of all lock-classes:
96 * These fields represent a directed graph of lock dependencies,
118 * Map the lock object (the lock instance) to the lock-class object.
119 * This is embedded into specific lock instances:
128 * Every lock has a list of other locks that were taken after it.
138 * We record lock dependency chains, so that we can cache them:
166 * The lock-stack is unified in that the lock chains of interrupt
169 * context, and we also keep do not add cross-context lock
170 * dependencies - the lock usage graph walking covers that area
191 extern void lockdep_reset_lock(struct lockdep_map *lock);
204 extern void lockdep_init_map(struct lockdep_map *lock, const char *name,
208 * Reinitialize a lock key - for cases where there is special locking or
213 #define lockdep_set_class(lock, key) \
214 lockdep_init_map(&(lock)->dep_map, #key, key)
215 #define lockdep_set_class_and_name(lock, key, name) \
216 lockdep_init_map(&(lock)->dep_map, name, key)
219 * Acquire a lock.
233 extern void lock_acquire(struct lockdep_map *lock, unsigned int subclass,
236 extern void lock_release(struct lockdep_map *lock, int nested,
260 # define lockdep_init_map(lock, name, key) do { (void)(key); } while (0)
261 # define lockdep_set_class(lock, key) do { (void)(key); } while (0)
262 # define lockdep_set_class_and_name(lock, key, name) \
288 * For trivial one-depth nesting of a lock-class, the following
290 * of nesting should define their own lock-nesting subclasses.)
296 * on the per lock-class debug mode: