1429 	struct lock_list *entry;  in add_lock_to_list()  local
1735 			     bool (*match)(struct lock_list *entry, void *data),  in __bfs()
1736 			     bool (*skip)(struct lock_list *entry, void *data),  in __bfs()
1742 	struct lock_list *entry;  in __bfs()  local
1844 	       bool (*match)(struct lock_list *entry, void *data),  in __bfs_forwards()
1845 	       bool (*skip)(struct lock_list *entry, void *data),  in __bfs_forwards()
1856 		bool (*match)(struct lock_list *entry, void *data),  in __bfs_backwards()
1857 	       bool (*skip)(struct lock_list *entry, void *data),  in __bfs_backwards()
1951 print_circular_bug_header(struct lock_list *entry, unsigned int depth,  in print_circular_bug_header()
1996 static inline bool hlock_conflict(struct lock_list *entry, void *data)  in hlock_conflict()
2062 static bool noop_count(struct lock_list *entry, void *data)  in noop_count()
2125 	   bool (*match)(struct lock_list *entry, void *data),  in check_path()
2126 	   bool (*skip)(struct lock_list *entry, void *data),  in check_path()
2224 static inline bool usage_accumulate(struct lock_list *entry, void *mask)  in usage_accumulate()
2243 static inline bool usage_match(struct lock_list *entry, void *mask)  in usage_match()
2251 static inline bool usage_skip(struct lock_list *entry, void *mask)  in usage_skip()
2413 	struct lock_list *entry = leaf;  in print_shortest_lock_dependencies()  local
2459 	struct lock_list *entry = leaf;  in print_shortest_lock_dependencies_backwards()  local
2874 static inline bool usage_skip(struct lock_list *entry, void *mask)  in usage_skip()
2908 static inline bool hlock_equal(struct lock_list *entry, void *data)  in hlock_equal()
3126 	struct lock_list *entry;  in check_prev_add()  local
4072 	struct lock_list *entry = other;  in print_irq_inversion_bug()  local
6246 	struct lock_list *entry;  in zap_class()  local