Searched refs:klist_node (Results 1 - 13 of 13) sorted by relevance
/linux-4.4.14/include/linux/ |
H A D | klist.h | 19 struct klist_node; 23 void (*get)(struct klist_node *); 24 void (*put)(struct klist_node *); 36 extern void klist_init(struct klist *k, void (*get)(struct klist_node *), 37 void (*put)(struct klist_node *)); 39 struct klist_node { struct 45 extern void klist_add_tail(struct klist_node *n, struct klist *k); 46 extern void klist_add_head(struct klist_node *n, struct klist *k); 47 extern void klist_add_behind(struct klist_node *n, struct klist_node *pos); 48 extern void klist_add_before(struct klist_node *n, struct klist_node *pos); 50 extern void klist_del(struct klist_node *n); 51 extern void klist_remove(struct klist_node *n); 53 extern int klist_node_attached(struct klist_node *n); 58 struct klist_node *i_cur; 64 struct klist_node *n); 66 extern struct klist_node *klist_prev(struct klist_iter *i); 67 extern struct klist_node *klist_next(struct klist_iter *i);
|
H A D | device.h | 830 struct klist_node knode_class;
|
/linux-4.4.14/lib/ |
H A D | klist.c | 10 * "node" (struct klist_node) objects. For struct klist, a spinlock is 12 * klist_node provides a pointer to the klist that owns it and a kref 25 * reference count of the previous klist_node and increments the count of 26 * the next klist_node. It then drops the lock and returns. 48 static struct klist *knode_klist(struct klist_node *knode) knode_klist() 54 static bool knode_dead(struct klist_node *knode) knode_dead() 59 static void knode_set_klist(struct klist_node *knode, struct klist *klist) knode_set_klist() 66 static void knode_kill(struct klist_node *knode) knode_kill() 79 * Initialises the klist structure. If the klist_node structures are 85 void klist_init(struct klist *k, void (*get)(struct klist_node *), klist_init() 86 void (*put)(struct klist_node *)) klist_init() 95 static void add_head(struct klist *k, struct klist_node *n) add_head() 102 static void add_tail(struct klist *k, struct klist_node *n) add_tail() 109 static void klist_node_init(struct klist *k, struct klist_node *n) klist_node_init() 119 * klist_add_head - Initialize a klist_node and add it to front. 123 void klist_add_head(struct klist_node *n, struct klist *k) klist_add_head() 131 * klist_add_tail - Initialize a klist_node and add it to back. 135 void klist_add_tail(struct klist_node *n, struct klist *k) klist_add_tail() 143 * klist_add_behind - Init a klist_node and add it after an existing node 147 void klist_add_behind(struct klist_node *n, struct klist_node *pos) klist_add_behind() 159 * klist_add_before - Init a klist_node and add it before an existing node 163 void klist_add_before(struct klist_node *n, struct klist_node *pos) klist_add_before() 176 struct klist_node *node; 187 struct klist_node *n = container_of(kref, struct klist_node, n_ref); klist_release() 205 static int klist_dec_and_del(struct klist_node *n) klist_dec_and_del() 210 static void klist_put(struct klist_node *n, bool kill) klist_put() 213 void (*put)(struct klist_node *) = k->put; klist_put() 229 void klist_del(struct klist_node *n) klist_del() 239 void klist_remove(struct klist_node *n) klist_remove() 266 int klist_node_attached(struct klist_node *n) klist_node_attached() 282 struct klist_node *n) klist_iter_init_node() 321 static struct klist_node *to_klist_node(struct list_head *n) to_klist_node() 323 return container_of(n, struct klist_node, n_node); to_klist_node() 334 struct klist_node *klist_prev(struct klist_iter *i) klist_prev() 336 void (*put)(struct klist_node *) = i->i_klist->put; klist_prev() 337 struct klist_node *last = i->i_cur; klist_prev() 338 struct klist_node *prev; klist_prev() 375 struct klist_node *klist_next(struct klist_iter *i) klist_next() 377 void (*put)(struct klist_node *) = i->i_klist->put; klist_next() 378 struct klist_node *last = i->i_cur; klist_next() 379 struct klist_node *next; klist_next()
|
/linux-4.4.14/drivers/base/ |
H A D | base.h | 49 struct klist_node knode_bus; 73 struct klist_node knode_parent; 74 struct klist_node knode_driver; 75 struct klist_node knode_bus;
|
H A D | attribute_container.c | 27 struct klist_node node; 32 static void internal_container_klist_get(struct klist_node *n) internal_container_klist_get() 39 static void internal_container_klist_put(struct klist_node *n) internal_container_klist_put() 185 struct klist_node *n = klist_next(iter); \
|
H A D | bus.c | 271 struct klist_node *n = klist_next(i); next_device() 422 struct klist_node *n = klist_next(i); next_driver() 853 static void klist_devices_get(struct klist_node *n) klist_devices_get() 861 static void klist_devices_put(struct klist_node *n) klist_devices_put() 1023 struct klist_node *n; device_insertion_sort_klist() 1028 n = container_of(pos, struct klist_node, n_node); list_for_each() 1046 struct klist_node *n; bus_sort_breadthfirst() 1055 n = container_of(pos, struct klist_node, n_node); bus_sort_breadthfirst() 1080 struct klist_node *start_knode = NULL; subsys_dev_iter_init() 1103 struct klist_node *knode; subsys_dev_iter_next()
|
H A D | class.c | 152 static void klist_class_dev_get(struct klist_node *n) klist_class_dev_get() 159 static void klist_class_dev_put(struct klist_node *n) klist_class_dev_put() 297 struct klist_node *start_knode = NULL; class_dev_iter_init() 320 struct klist_node *knode; class_dev_iter_next()
|
H A D | driver.c | 23 struct klist_node *n = klist_next(i); next_device()
|
H A D | core.c | 664 static void klist_children_get(struct klist_node *n) klist_children_get() 672 static void klist_children_put(struct klist_node *n) klist_children_put() 1306 struct klist_node *n = klist_prev(i); prev_device() 1319 struct klist_node *n = klist_next(i); next_device()
|
/linux-4.4.14/drivers/crypto/ux500/cryp/ |
H A D | cryp.h | 246 struct klist_node list_node;
|
H A D | cryp_core.c | 427 struct klist_node *device_node; cryp_get_device_data()
|
/linux-4.4.14/drivers/crypto/ux500/hash/ |
H A D | hash_alg.h | 367 struct klist_node list_node;
|
H A D | hash_core.c | 385 struct klist_node *device_node; hash_get_device_data()
|
Completed in 258 milliseconds