| /lib/ |
| D | list_sort.c | 112 struct list_head *list; in list_sort() local
120 list = head->next; in list_sort()
122 while (list) { in list_sort()
123 struct list_head *cur = list; in list_sort()
124 list = list->next; in list_sort()
143 list = merge(priv, cmp, part[lev], list); in list_sort()
145 merge_and_restore_back_links(priv, cmp, head, part[max_lev], list); in list_sort()
165 struct list_head list; member
205 ela = container_of(a, struct debug_el, list); in cmp()
206 elb = container_of(b, struct debug_el, list); in cmp()
[all …]
|
| D | textsearch.c | 116 list_for_each_entry_rcu(o, &ts_ops, list) { in lookup_ts_algo()
151 list_for_each_entry(o, &ts_ops, list) { in textsearch_register()
156 list_add_tail_rcu(&ops->list, &ts_ops); in textsearch_register()
182 list_for_each_entry(o, &ts_ops, list) { in textsearch_unregister()
184 list_del_rcu(&o->list); in textsearch_unregister()
|
| D | lru_cache.c | 154 list_add(&e->list, &lc->free); in lc_create()
232 list_add(&e->list, &lc->free); in lc_reset()
331 list_move(&e->list, &lc->free); in lc_del()
347 e = list_entry(n, struct lc_element, list); in lc_prepare_for_change()
354 list_move(&e->list, &lc->to_be_changed); in lc_prepare_for_change()
408 list_move(&e->list, &lc->in_use); /* Not evictable... */ in __lc_get()
553 list_for_each_entry_safe(e, tmp, &lc->to_be_changed, list) { in lc_committed()
557 list_move(&e->list, &lc->in_use); in lc_committed()
581 list_move(&e->list, &lc->lru); in lc_put()
640 list_move(&e->list, lh); in lc_set()
|
| D | dma-debug.c | 71 struct list_head list; member
91 struct list_head list; member
305 list_for_each_entry(entry, &bucket->list, list) { in __hash_bucket_find()
387 list_add_tail(&entry->list, &bucket->list); in hash_bucket_add()
395 list_del(&entry->list); in hash_bucket_del()
417 list_for_each_entry(entry, &bucket->list, list) { in debug_dma_dump_mappings()
637 entry = list_entry(free_entries.next, struct dma_debug_entry, list); in __dma_entry_alloc()
638 list_del(&entry->list); in __dma_entry_alloc()
692 list_add(&entry->list, &free_entries); in dma_entry_free()
716 list_add_tail(&entry->list, &tmp); in dma_debug_resize_entries()
[all …]
|
| D | percpu_counter.c | 130 INIT_LIST_HEAD(&fbc->list); in __percpu_counter_init()
132 list_add(&fbc->list, &percpu_counters); in __percpu_counter_init()
150 list_del(&fbc->list); in percpu_counter_destroy()
181 list_for_each_entry(fbc, &percpu_counters, list) { in percpu_counter_hotcpu_callback()
|
| D | kobject_uevent.c | 36 struct list_head list; member
291 list_for_each_entry(ue_sk, &uevent_sock_list, list) { in kobject_uevent_env()
435 list_add_tail(&ue_sk->list, &uevent_sock_list); in uevent_net_init()
445 list_for_each_entry(ue_sk, &uevent_sock_list, list) { in uevent_net_exit()
453 list_del(&ue_sk->list); in uevent_net_exit()
|
| D | klist.c | 175 struct list_head list; member
192 list_for_each_entry_safe(waiter, tmp, &klist_remove_waiters, list) { in klist_release()
196 list_del(&waiter->list); in klist_release()
247 list_add(&waiter.list, &klist_remove_waiters); in klist_remove()
|
| D | ts_kmp.c | 141 .list = LIST_HEAD_INIT(kmp_ops.list)
|
| D | ts_bm.c | 191 .list = LIST_HEAD_INIT(bm_ops.list)
|
| D | debugobjects.c | 32 struct hlist_head list; member
118 hlist_for_each_entry(obj, &b->list, node) { in lookup_object()
148 hlist_add_head(&obj->node, &b->list); in alloc_object()
228 hlist_move_list(&db->list, &freelist); in debug_objects_oom()
692 hlist_for_each_entry_safe(obj, tmp, &db->list, node) { in __debug_check_no_obj_freed()
1054 hlist_move_list(&db->list, &objects); in debug_objects_replace_static_objects()
1061 hlist_add_head(&new->node, &db->list); in debug_objects_replace_static_objects()
|
| D | rhashtable.c | 262 list_for_each_entry(walker, &old_tbl->walkers, list) in rhashtable_rehash_table()
530 list_add(&iter->walker->list, &iter->walker->tbl->walkers); in rhashtable_walk_init()
547 list_del(&iter->walker->list); in rhashtable_walk_exit()
576 list_del(&iter->walker->list); in rhashtable_walk_start()
665 list_add(&iter->walker->list, &tbl->walkers); in rhashtable_walk_stop()
|
| D | kobject.c | 171 list_add_tail(&kobj->entry, &kobj->kset->list); in kobj_kset_join()
771 INIT_LIST_HEAD(&k->list); in kset_init()
855 list_for_each_entry(k, &kset->list, entry) { in kset_find_obj()
|
| D | ts_fsm.c | 325 .list = LIST_HEAD_INIT(fsm_ops.list)
|
| D | bitmap.c | 472 int bitmap_print_to_pagebuf(bool list, char *buf, const unsigned long *maskp, in bitmap_print_to_pagebuf() argument
479 n = list ? scnprintf(buf, len, "%*pbl\n", nmaskbits, maskp) : in bitmap_print_to_pagebuf()
|
| D | Kconfig.kgdb | 91 0x0020 - allow passive inspection (backtrace, process list, lsmod)
|
| D | Kconfig.debug | 72 file contains a list of the debug statements that can be enabled. The
238 mail to the linux kernel mailing list mentioning the symbol and why
293 __init,, etc. (see the full list in include/linux/init.h),
438 Enable this to turn on debugging of RCU list heads (call_rcu() usage).
1191 bool "Debug linked list manipulation"
1194 Enable this to turn on extended checks in the linked-list
1200 bool "Debug priority linked list manipulation"
1204 linked-list (plist) walking routines. This checks the entire
1205 list multiple times during each manipulation.
1653 bool "Linked list sorting test"
|
| /lib/reed_solomon/ |
| D | reed_solomon.c | 77 INIT_LIST_HEAD(&rs->list); in rs_init()
176 list_del(&rs->list); in free_rs()
220 rs = list_entry(tmp, struct rs_control, list); in init_rs_internal()
242 list_add(&rs->list, &rslist); in init_rs_internal()
|