208 static struct lock_list list_entries[MAX_LOCKDEP_ENTRIES];
1029 	struct lock_list *e;  in class_lock_list_valid()
1091 	struct lock_list *e;  in __check_data_structures()
1402 static struct lock_list *alloc_list_entry(void)  in alloc_list_entry()
1430 	struct lock_list *entry;  in add_lock_to_list()
1471 	struct lock_list *element[MAX_CIRCULAR_QUEUE_SIZE];
1497 static inline int __cq_enqueue(struct circular_queue *cq, struct lock_list *elem)  in __cq_enqueue()
1511 static inline struct lock_list * __cq_dequeue(struct circular_queue *cq)  in __cq_dequeue()
1513 	struct lock_list * lock;  in __cq_dequeue()
1529 static inline void mark_lock_accessed(struct lock_list *lock)  in mark_lock_accessed()
1534 static inline void visit_lock_entry(struct lock_list *lock,  in visit_lock_entry()
1535 				    struct lock_list *parent)  in visit_lock_entry()
1540 static inline unsigned long lock_accessed(struct lock_list *lock)  in lock_accessed()
1545 static inline struct lock_list *get_lock_parent(struct lock_list *child)  in get_lock_parent()
1550 static inline int get_lock_depth(struct lock_list *child)  in get_lock_depth()
1553 	struct lock_list *parent;  in get_lock_depth()
1569 static inline struct list_head *get_dep_list(struct lock_list *lock, int offset)  in get_dep_list()
1661 static inline void __bfs_init_root(struct lock_list *lock,  in __bfs_init_root()
1677 static inline void bfs_init_root(struct lock_list *lock,  in bfs_init_root()
1691 static inline void bfs_init_rootb(struct lock_list *lock,  in bfs_init_rootb()
1698 static inline struct lock_list *__bfs_next(struct lock_list *lock, int offset)  in __bfs_next()
1704 				     &lock->entry, struct lock_list, entry);  in __bfs_next()
1734 static enum bfs_result __bfs(struct lock_list *source_entry,  in __bfs()
1736 			     bool (*match)(struct lock_list *entry, void *data),  in __bfs()
1737 			     bool (*skip)(struct lock_list *entry, void *data),  in __bfs()
1738 			     struct lock_list **target_entry,  in __bfs()
1742 	struct lock_list *lock = NULL;  in __bfs()
1743 	struct lock_list *entry;  in __bfs()
1843 __bfs_forwards(struct lock_list *src_entry,  in __bfs_forwards()
1845 	       bool (*match)(struct lock_list *entry, void *data),  in __bfs_forwards()
1846 	       bool (*skip)(struct lock_list *entry, void *data),  in __bfs_forwards()
1847 	       struct lock_list **target_entry)  in __bfs_forwards()
1855 __bfs_backwards(struct lock_list *src_entry,  in __bfs_backwards()
1857 		bool (*match)(struct lock_list *entry, void *data),  in __bfs_backwards()
1858 	       bool (*skip)(struct lock_list *entry, void *data),  in __bfs_backwards()
1859 		struct lock_list **target_entry)  in __bfs_backwards()
1877 print_circular_bug_entry(struct lock_list *target, int depth)  in print_circular_bug_entry()
1890 			     struct lock_list *prt)  in print_circular_lock_scenario()
1952 print_circular_bug_header(struct lock_list *entry, unsigned int depth,  in print_circular_bug_header()
2005 static inline bool hlock_equal(struct lock_list *entry, void *data)  in hlock_equal()
2032 static inline bool hlock_conflict(struct lock_list *entry, void *data)  in hlock_conflict()
2041 static noinline void print_circular_bug(struct lock_list *this,  in print_circular_bug()
2042 				struct lock_list *target,  in print_circular_bug()
2047 	struct lock_list *parent;  in print_circular_bug()
2048 	struct lock_list *first_parent;  in print_circular_bug()
2098 static bool noop_count(struct lock_list *entry, void *data)  in noop_count()
2104 static unsigned long __lockdep_count_forward_deps(struct lock_list *this)  in __lockdep_count_forward_deps()
2107 	struct lock_list *target_entry;  in __lockdep_count_forward_deps()
2116 	struct lock_list this;  in lockdep_count_forward_deps()
2129 static unsigned long __lockdep_count_backward_deps(struct lock_list *this)  in __lockdep_count_backward_deps()
2132 	struct lock_list *target_entry;  in __lockdep_count_backward_deps()
2142 	struct lock_list this;  in lockdep_count_backward_deps()
2160 check_path(struct held_lock *target, struct lock_list *src_entry,  in check_path()
2161 	   bool (*match)(struct lock_list *entry, void *data),  in check_path()
2162 	   bool (*skip)(struct lock_list *entry, void *data),  in check_path()
2163 	   struct lock_list **target_entry)  in check_path()
2189 	struct lock_list *target_entry;  in check_noncircular()
2190 	struct lock_list src_entry;  in check_noncircular()
2260 static inline bool usage_accumulate(struct lock_list *entry, void *mask)  in usage_accumulate()
2279 static inline bool usage_match(struct lock_list *entry, void *mask)  in usage_match()
2287 static inline bool usage_skip(struct lock_list *entry, void *mask)  in usage_skip()
2338 find_usage_forwards(struct lock_list *root, unsigned long usage_mask,  in find_usage_forwards()
2339 			struct lock_list **target_entry)  in find_usage_forwards()
2355 find_usage_backwards(struct lock_list *root, unsigned long usage_mask,  in find_usage_backwards()
2356 			struct lock_list **target_entry)  in find_usage_backwards()
2446 print_shortest_lock_dependencies(struct lock_list *leaf,  in print_shortest_lock_dependencies()
2447 				 struct lock_list *root)  in print_shortest_lock_dependencies()
2449 	struct lock_list *entry = leaf;  in print_shortest_lock_dependencies()
2492 print_shortest_lock_dependencies_backwards(struct lock_list *leaf,  in print_shortest_lock_dependencies_backwards()
2493 					   struct lock_list *root)  in print_shortest_lock_dependencies_backwards()
2495 	struct lock_list *entry = leaf;  in print_shortest_lock_dependencies_backwards()
2527 print_irq_lock_scenario(struct lock_list *safe_entry,  in print_irq_lock_scenario()
2528 			struct lock_list *unsafe_entry,  in print_irq_lock_scenario()
2584 			 struct lock_list *prev_root,  in print_bad_irq_dependency()
2585 			 struct lock_list *next_root,  in print_bad_irq_dependency()
2586 			 struct lock_list *backwards_entry,  in print_bad_irq_dependency()
2587 			 struct lock_list *forwards_entry,  in print_bad_irq_dependency()
2821 	struct lock_list *target_entry1;  in check_irq_usage()
2822 	struct lock_list *target_entry;  in check_irq_usage()
2823 	struct lock_list this, that;  in check_irq_usage()
2910 static inline bool usage_skip(struct lock_list *entry, void *mask)  in usage_skip()
2930 	struct lock_list *target_entry;  in check_redundant()
2931 	struct lock_list src_entry;  in check_redundant()
3127 	struct lock_list *entry;  in check_prev_add()
4069 			struct lock_list *root, struct lock_list *other,  in print_irq_inversion_bug()
4073 	struct lock_list *entry = other;  in print_irq_inversion_bug()
4074 	struct lock_list *middle = NULL;  in print_irq_inversion_bug()
4140 	struct lock_list root;  in check_usage_forwards()
4141 	struct lock_list *target_entry;  in check_usage_forwards()
4175 	struct lock_list root;  in check_usage_backwards()
4176 	struct lock_list *target_entry;  in check_usage_backwards()
6244 	struct lock_list *entry;  in zap_class()