| /lib/ |
| D | list_sort.c | 192 struct list_head *list = head->next, *pending = NULL; in list_sort() local
195 if (list == head->prev) /* Zero or one elements */ in list_sort()
237 list->prev = pending; in list_sort()
238 pending = list; in list_sort()
239 list = list->next; in list_sort()
242 } while (list); in list_sort()
245 list = pending; in list_sort()
252 list = merge(priv, cmp, pending, list); in list_sort()
256 merge_final(priv, cmp, head, pending, list); in list_sort()
|
| 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 | rhashtable.c | 326 list_for_each_entry(walker, &old_tbl->walkers, list) in rhashtable_rehash_table()
493 struct rhlist_head *list; in rhashtable_lookup_one() local
508 list = container_of(obj, struct rhlist_head, rhead); in rhashtable_lookup_one()
511 RCU_INIT_POINTER(list->next, plist); in rhashtable_lookup_one()
513 RCU_INIT_POINTER(list->rhead.next, head); in rhashtable_lookup_one()
562 struct rhlist_head *list; in rhashtable_insert_one() local
564 list = container_of(obj, struct rhlist_head, rhead); in rhashtable_insert_one()
565 RCU_INIT_POINTER(list->next, NULL); in rhashtable_insert_one()
669 list_add(&iter->walker.list, &iter->walker.tbl->walkers); in rhashtable_walk_enter()
684 list_del(&iter->walker.list); in rhashtable_walk_exit()
[all …]
|
| D | error-inject.c | 16 struct list_head list; member
29 list_for_each_entry(ent, &error_injection_list, list) { in within_error_injection_list()
43 list_for_each_entry(ent, &error_injection_list, list) { in get_injectable_error_type()
83 INIT_LIST_HEAD(&ent->list); in populate_error_injection_list()
84 list_add_tail(&ent->list, &error_injection_list); in populate_error_injection_list()
118 list_for_each_entry_safe(ent, n, &error_injection_list, list) { in module_unload_ei_list()
120 list_del_init(&ent->list); in module_unload_ei_list()
190 struct ei_entry *ent = list_entry(v, struct ei_entry, list); in ei_seq_show()
|
| D | test_list_sort.c | 23 struct list_head list; member
63 ela = container_of(a, struct debug_el, list); in cmp()
64 elb = container_of(b, struct debug_el, list); in cmp()
94 list_add_tail(&el->list, &head); in list_sort_test()
115 el = container_of(cur, struct debug_el, list); in list_sort_test()
116 el1 = container_of(cur->next, struct debug_el, list); in list_sort_test()
|
| D | textsearch.c | 118 list_for_each_entry_rcu(o, &ts_ops, list) { in lookup_ts_algo()
153 list_for_each_entry(o, &ts_ops, list) { in textsearch_register()
158 list_add_tail_rcu(&ops->list, &ts_ops); in textsearch_register()
184 list_for_each_entry(o, &ts_ops, list) { in textsearch_unregister()
186 list_del_rcu(&o->list); in textsearch_unregister()
|
| D | logic_pio.c | 49 list_for_each_entry(range, &io_range_list, list) { in logic_pio_register_range()
94 list_add_tail_rcu(&new_range->list, &io_range_list); in logic_pio_register_range()
110 list_del_rcu(&range->list); in logic_pio_unregister_range()
128 list_for_each_entry_rcu(range, &io_range_list, list) { in find_io_range_by_fwnode()
145 list_for_each_entry_rcu(range, &io_range_list, list) { in find_io_range()
210 list_for_each_entry_rcu(range, &io_range_list, list) { in logic_pio_trans_cpuaddr()
|
| D | lru_cache.c | 142 list_add(&e->list, &lc->free); in lc_create()
220 list_add(&e->list, &lc->free); in lc_reset()
317 list_move(&e->list, &lc->free); in lc_del()
333 e = list_entry(n, struct lc_element, list); in lc_prepare_for_change()
340 list_move(&e->list, &lc->to_be_changed); in lc_prepare_for_change()
394 list_move(&e->list, &lc->in_use); /* Not evictable... */ in __lc_get()
539 list_for_each_entry_safe(e, tmp, &lc->to_be_changed, list) { in lc_committed()
543 list_move(&e->list, &lc->in_use); in lc_committed()
567 list_move(&e->list, &lc->lru); in lc_put()
626 list_move(&e->list, lh); in lc_set()
|
| D | percpu_counter.c | 137 INIT_LIST_HEAD(&fbc->list); in __percpu_counter_init()
139 list_add(&fbc->list, &percpu_counters); in __percpu_counter_init()
157 list_del(&fbc->list); in percpu_counter_destroy()
184 list_for_each_entry(fbc, &percpu_counters, list) { in percpu_counter_cpu_dead()
|
| D | objagg.c | 27 struct list_head list; /* member of objagg_hints->node_list */ member
56 struct list_head list; /* member of objagg->obj_list */ member
194 list_for_each_entry(objagg_obj_cur, &objagg->obj_list, list) { in objagg_obj_parent_lookup_assign()
384 list_add(&objagg_obj->list, &objagg->obj_list); in objagg_obj_create()
455 list_del(&objagg_obj->list); in objagg_obj_destroy()
616 list_for_each_entry(objagg_obj, &objagg->obj_list, list) { in objagg_stats_get()
676 list_add(&hnode->list, &objagg_hints->node_list); in objagg_hints_node_create()
691 list_for_each_entry_safe(hnode, tmp, &objagg_hints->node_list, list) { in objagg_hints_flush()
692 list_del(&hnode->list); in objagg_hints_flush()
803 list_for_each_entry(objagg_obj, &objagg->obj_list, list) { in objagg_tmp_graph_create()
[all …]
|
| D | klist.c | 174 struct list_head list; member
191 list_for_each_entry_safe(waiter, tmp, &klist_remove_waiters, list) { in klist_release()
195 list_del(&waiter->list); in klist_release()
246 list_add(&waiter.list, &klist_remove_waiters); in klist_remove()
|
| D | debugobjects.c | 44 struct hlist_head list; member
191 hlist_for_each_entry(obj, &b->list, node) { in lookup_object()
205 static struct debug_obj *__alloc_object(struct hlist_head *list) in __alloc_object() argument
209 if (list->first) { in __alloc_object()
210 obj = hlist_entry(list->first, typeof(*obj), node); in __alloc_object()
276 hlist_add_head(&obj->node, &b->list); in alloc_object()
449 hlist_move_list(&db->list, &freelist); in debug_objects_oom()
952 hlist_for_each_entry_safe(obj, tmp, &db->list, node) { in __debug_check_no_obj_freed()
1320 hlist_move_list(&db->list, &objects); in debug_objects_replace_static_objects()
1327 hlist_add_head(&new->node, &db->list); in debug_objects_replace_static_objects()
|
| D | ts_kmp.c | 137 .list = LIST_HEAD_INIT(kmp_ops.list)
|
| D | ts_bm.c | 187 .list = LIST_HEAD_INIT(bm_ops.list)
|
| D | test_rhashtable.c | 508 struct rhlist_head *list = container_of(pos, struct rhlist_head, rhead); in print_ht() local
511 pos = &list->rhead; in print_ht()
512 list = rht_dereference(list->next, ht); in print_ht()
516 list? ", " : " "); in print_ht()
518 } while (list); in print_ht()
|
| D | kobject_uevent.c | 39 struct list_head list; member
317 list_for_each_entry(ue_sk, &uevent_sock_list, list) { in uevent_net_broadcast_untagged()
781 list_add_tail(&ue_sk->list, &uevent_sock_list); in uevent_net_init()
794 list_del(&ue_sk->list); in uevent_net_exit()
|
| D | test_kmod.c | 142 struct list_head list; member
1162 list_add_tail(&test_dev->list, ®_test_devs); in register_test_dev_kmod()
1229 list_for_each_entry_safe(test_dev, tmp, ®_test_devs, list) { in test_kmod_exit()
1230 list_del(&test_dev->list); in test_kmod_exit()
|
| D | kobject.c | 196 list_add_tail(&kobj->entry, &kobj->kset->list); in kobj_kset_join()
817 INIT_LIST_HEAD(&k->list); in kset_init()
901 list_for_each_entry(k, &kset->list, entry) { in kset_find_obj()
|
| D | ts_fsm.c | 321 .list = LIST_HEAD_INIT(fsm_ops.list)
|
| D | bitmap.c | 490 int bitmap_print_to_pagebuf(bool list, char *buf, const unsigned long *maskp, in bitmap_print_to_pagebuf() argument
495 return list ? scnprintf(buf, len, "%*pbl\n", nmaskbits, maskp) : in bitmap_print_to_pagebuf()
|
| D | Kconfig.kgdb | 92 0x0020 - allow passive inspection (backtrace, process list, lsmod)
|
| D | Kconfig.debug | 122 file contains a list of the debug statements that can be enabled. The
334 __init,, etc. (see the full list in include/linux/init.h),
499 Enable this to turn on debugging of RCU list heads (call_rcu() usage).
1353 bool "Debug linked list manipulation"
1356 Enable this to turn on extended checks in the linked-list
1362 bool "Debug priority linked list manipulation"
1366 linked-list (plist) walking routines. This checks the entire
1367 list multiple times during each manipulation.
1687 tristate "Linked list sorting test"
|
| /lib/livepatch/ |
| D | test_klp_shadow_vars.c | 22 struct list_head list; member
29 list_for_each_entry_safe(sp, tmp_sp, &ptr_list, list) { in free_ptr_list()
30 list_del(&sp->list); in free_ptr_list()
40 list_for_each_entry(sp, &ptr_list, list) { in ptr_id()
51 list_add(&sp->list, &ptr_list); in ptr_id()
|
| /lib/reed_solomon/ |
| D | reed_solomon.c | 80 INIT_LIST_HEAD(&rs->list); in codec_init()
156 list_add(&rs->list, &codec_list); in codec_init()
187 list_del(&cd->list); in free_rs()
245 struct rs_codec *cd = list_entry(tmp, struct rs_codec, list); in init_rs_internal()
|