| /lib/ |
| D | parman.c | 96 typeof(struct parman_item), list); in parman_prio_first_item()
107 typeof(struct parman_item), list); in parman_prio_last_item()
118 list_for_each_entry_from_reverse(prio, &parman->prio_list, list) { in parman_lsort_new_index_find()
144 list_move_tail(&item->list, &prio->item_list); in parman_prio_shift_down()
159 list_move(&item->list, &prio->item_list); in parman_prio_shift_up()
172 list_del(&item->list); in parman_prio_item_remove()
177 list_del(&last_item->list); in parman_prio_item_remove()
178 list_replace(&item->list, &last_item->list); in parman_prio_item_remove()
197 list_for_each_entry_reverse(prio2, &parman->prio_list, list) { in parman_lsort_item_add()
203 list_add_tail(&item->list, &prio->item_list); in parman_lsort_item_add()
[all …]
|
| D | irq_poll.c | 37 list_add_tail(&iop->list, this_cpu_ptr(&blk_cpu_iopoll)); in irq_poll_sched()
53 list_del(&iop->list); in __irq_poll_complete()
80 struct list_head *list = this_cpu_ptr(&blk_cpu_iopoll); in irq_poll_softirq() local
86 while (!list_empty(list)) { in irq_poll_softirq()
105 iop = list_entry(list->next, struct irq_poll, list); in irq_poll_softirq()
128 list_move_tail(&iop->list, list); in irq_poll_softirq()
182 INIT_LIST_HEAD(&iop->list); in irq_poll_init()
|
| D | list_sort.c | 110 struct list_head *list; in list_sort() local
118 list = head->next; in list_sort()
120 while (list) { in list_sort()
121 struct list_head *cur = list; in list_sort()
122 list = list->next; in list_sort()
141 list = merge(priv, cmp, part[lev], list); in list_sort()
143 merge_and_restore_back_links(priv, cmp, head, part[max_lev], list); in list_sort()
|
| D | rhashtable.c | 374 list_for_each_entry(walker, &old_tbl->walkers, list) in rhashtable_rehash_table()
538 struct rhlist_head *list; in rhashtable_lookup_one() local
553 list = container_of(obj, struct rhlist_head, rhead); in rhashtable_lookup_one()
556 RCU_INIT_POINTER(list->next, plist); in rhashtable_lookup_one()
558 RCU_INIT_POINTER(list->rhead.next, head); in rhashtable_lookup_one()
607 struct rhlist_head *list; in rhashtable_insert_one() local
609 list = container_of(obj, struct rhlist_head, rhead); in rhashtable_insert_one()
610 RCU_INIT_POINTER(list->next, NULL); in rhashtable_insert_one()
721 list_add(&iter->walker.list, &iter->walker.tbl->walkers); in rhashtable_walk_enter()
736 list_del(&iter->walker.list); in rhashtable_walk_exit()
[all …]
|
| D | test_list_sort.c | 22 struct list_head list; member
62 ela = container_of(a, struct debug_el, list); in cmp()
63 elb = container_of(b, struct debug_el, list); in cmp()
96 list_add_tail(&el->list, &head); in list_sort_test()
117 el = container_of(cur, struct debug_el, list); in list_sort_test()
118 el1 = container_of(cur->next, struct debug_el, list); in list_sort_test()
|
| 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()
329 list_move(&e->list, &lc->free); in lc_del()
345 e = list_entry(n, struct lc_element, list); in lc_prepare_for_change()
352 list_move(&e->list, &lc->to_be_changed); in lc_prepare_for_change()
406 list_move(&e->list, &lc->in_use); /* Not evictable... */ in __lc_get()
551 list_for_each_entry_safe(e, tmp, &lc->to_be_changed, list) { in lc_committed()
555 list_move(&e->list, &lc->in_use); in lc_committed()
579 list_move(&e->list, &lc->lru); in lc_put()
638 list_move(&e->list, lh); in lc_set()
|
| D | dma-debug.c | 75 struct list_head list; member
95 struct list_head list; member
312 list_for_each_entry(entry, &bucket->list, list) { in __hash_bucket_find()
394 list_add_tail(&entry->list, &bucket->list); in hash_bucket_add()
402 list_del(&entry->list); in hash_bucket_del()
427 list_for_each_entry(entry, &bucket->list, list) { in debug_dma_dump_mappings()
647 entry = list_entry(free_entries.next, struct dma_debug_entry, list); in __dma_entry_alloc()
648 list_del(&entry->list); in __dma_entry_alloc()
702 list_add(&entry->list, &free_entries); in dma_entry_free()
726 list_add_tail(&entry->list, &tmp); in dma_debug_resize_entries()
[all …]
|
| D | percpu_counter.c | 138 INIT_LIST_HEAD(&fbc->list); in __percpu_counter_init()
140 list_add(&fbc->list, &percpu_counters); in __percpu_counter_init()
158 list_del(&fbc->list); in percpu_counter_destroy()
185 list_for_each_entry(fbc, &percpu_counters, list) { in percpu_counter_cpu_dead()
|
| 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 | kobject_uevent.c | 38 struct list_head list; member
473 list_for_each_entry(ue_sk, &uevent_sock_list, list) { in kobject_uevent_env()
512 list_for_each_entry(ue_sk, &uevent_sock_list, list) { in kobject_uevent_env()
661 list_add_tail(&ue_sk->list, &uevent_sock_list); in uevent_net_init()
671 list_for_each_entry(ue_sk, &uevent_sock_list, list) { in uevent_net_exit()
679 list_del(&ue_sk->list); in uevent_net_exit()
|
| 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 | 34 struct hlist_head list; member
130 hlist_for_each_entry(obj, &b->list, node) { in lookup_object()
160 hlist_add_head(&obj->node, &b->list); in alloc_object()
255 hlist_move_list(&db->list, &freelist); in debug_objects_oom()
739 hlist_for_each_entry_safe(obj, tmp, &db->list, node) { in __debug_check_no_obj_freed()
1105 hlist_move_list(&db->list, &objects); in debug_objects_replace_static_objects()
1112 hlist_add_head(&new->node, &db->list); in debug_objects_replace_static_objects()
|
| D | test_kmod.c | 142 struct list_head list; member
1169 list_add_tail(&test_dev->list, ®_test_devs); in register_test_dev_kmod()
1236 list_for_each_entry_safe(test_dev, tmp, ®_test_devs, list) { in test_kmod_exit()
1237 list_del(&test_dev->list); in test_kmod_exit()
|
| 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 | 474 int bitmap_print_to_pagebuf(bool list, char *buf, const unsigned long *maskp, in bitmap_print_to_pagebuf() argument
481 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 | 91 file contains a list of the debug statements that can be enabled. The
260 mail to the linux kernel mailing list mentioning the symbol and why
317 __init,, etc. (see the full list in include/linux/init.h),
487 Enable this to turn on debugging of RCU list heads (call_rcu() usage).
1320 bool "Debug linked list manipulation"
1323 Enable this to turn on extended checks in the linked-list
1329 bool "Debug priority linked list manipulation"
1333 linked-list (plist) walking routines. This checks the entire
1334 list multiple times during each manipulation.
1657 tristate "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()
|