Home
last modified time | relevance | path

Searched refs:list (Results 1 – 25 of 81) sorted by relevance

1234

/kernel/
Daudit_tree.c19 struct list_head list; member
34 struct list_head list; member
103 INIT_LIST_HEAD(&tree->list); in alloc_tree()
204 INIT_LIST_HEAD(&chunk->owners[i].list); in alloc_chunk()
230 struct list_head *list; in insert_hash() local
239 list = chunk_hash(chunk->key); in insert_hash()
240 list_add_rcu(&chunk->hash, list); in insert_hash()
247 struct list_head *list = chunk_hash(key); in audit_tree_lookup() local
250 list_for_each_entry_rcu(p, list, hash) { in audit_tree_lookup()
315 list_replace_init(&old->owners[j].list, &new->owners[i].list); in replace_chunk()
[all …]
Dkprobes.c84 struct list_head list; member
140 list_for_each_entry_rcu(kip, &c->pages, list) { in __get_insn_slot()
178 INIT_LIST_HEAD(&kip->list); in __get_insn_slot()
184 list_add_rcu(&kip->list, &c->pages); in __get_insn_slot()
203 if (!list_is_singular(&kip->list)) { in collect_one_slot()
204 list_del_rcu(&kip->list); in collect_one_slot()
221 list_for_each_entry_safe(kip, next, &c->pages, list) { in collect_garbage_slots()
243 list_for_each_entry_rcu(kip, &c->pages, list) { in __free_insn_slot()
281 list_for_each_entry_rcu(kip, &c->pages, list) { in __is_insn_slot_addr()
351 list_empty(&p->list); in kprobe_unused()
[all …]
Dauditfilter.c165 int __init audit_register_class(int class, unsigned *list) in audit_register_class() argument
170 while (*list != ~0U) { in audit_register_class()
171 unsigned n = *list++; in audit_register_class()
895 struct list_head *list; in audit_find_rule() local
900 *p = list = &audit_inode_hash[h]; in audit_find_rule()
904 list = &audit_inode_hash[h]; in audit_find_rule()
905 list_for_each_entry(e, list, list) in audit_find_rule()
913 *p = list = &audit_filter_list[entry->rule.listnr]; in audit_find_rule()
916 list_for_each_entry(e, list, list) in audit_find_rule()
935 struct list_head *list; in audit_add_rule() local
[all …]
Dtaskstats.c52 struct list_head list; member
59 struct list_head list; member
126 list_for_each_entry(s, &listeners->list, list) { in send_cpu_listeners()
128 if (!list_is_last(&s->list, &listeners->list)) { in send_cpu_listeners()
150 list_for_each_entry_safe(s, tmp, &listeners->list, list) { in send_cpu_listeners()
152 list_del(&s->list); in send_cpu_listeners()
307 list_for_each_entry(s2, &listeners->list, list) { in add_del_listener()
311 list_add(&s->list, &listeners->list); in add_del_listener()
325 list_for_each_entry_safe(s, tmp, &listeners->list, list) { in add_del_listener()
327 list_del(&s->list); in add_del_listener()
[all …]
Dpadata.c72 list_replace_init(&pqueue->parallel.list, &local_list); in padata_parallel_worker()
79 struct padata_priv, list); in padata_parallel_worker()
81 list_del_init(&padata->list); in padata_parallel_worker()
151 list_add_tail(&padata->list, &queue->parallel.list); in padata_do_parallel()
187 if (list_empty(&reorder->list)) { in padata_find_next()
192 padata = list_entry(reorder->list.next, struct padata_priv, list); in padata_find_next()
204 list_del_init(&padata->list); in padata_find_next()
250 list_add_tail(&padata->list, &squeue->serial.list); in padata_reorder()
269 if (!list_empty(&next_queue->reorder.list) && in padata_reorder()
296 list_replace_init(&squeue->serial.list, &local_list); in padata_serial_worker()
[all …]
Dfail_function.c27 struct list_head list; member
70 INIT_LIST_HEAD(&attr->list); in fei_attr_new()
87 list_for_each_entry(attr, &fei_attr_list, list) { in fei_attr_lookup()
99 list_for_each_entry(attr, &fei_attr_list, list) { in fei_attr_is_valid()
201 struct fei_attr *attr = list_entry(v, struct fei_attr, list); in fei_seq_show()
223 list_del(&attr->list); in fei_attr_remove()
231 list_for_each_entry_safe(attr, n, &fei_attr_list, list) { in fei_attr_remove_all()
303 list_add_tail(&attr->list, &fei_attr_list); in fei_write()
Daudit_watch.c280 list_del_rcu(&oentry->list); in audit_update_watch()
284 list_del(&oentry->rule.list); in audit_update_watch()
298 list_add_rcu(&nentry->list, &audit_inode_hash[h]); in audit_update_watch()
299 list_replace(&oentry->rule.list, in audit_update_watch()
300 &nentry->rule.list); in audit_update_watch()
335 list_del(&r->list); in audit_remove_parent_watches()
336 list_del_rcu(&e->list); in audit_remove_parent_watches()
399 int audit_add_watch(struct audit_krule *krule, struct list_head **list) in audit_add_watch() argument
439 *list = &audit_inode_hash[h]; in audit_add_watch()
/kernel/trace/
Dtrace_dynevent.h41 struct list_head list; member
62 struct list_head list; member
74 INIT_LIST_HEAD(&ev->list); in dyn_event_init()
86 list_add_tail(&ev->list, &dyn_event_list); in dyn_event_add()
93 list_del_init(&ev->list); in dyn_event_remove()
110 list_for_each_entry(pos, &dyn_event_list, list)
118 list_for_each_entry_safe(pos, n, &dyn_event_list, list)
Dring_buffer.c329 struct list_head list; /* list of buffer pages */ member
877 static struct list_head *rb_list_head(struct list_head *list) in rb_list_head() argument
879 unsigned long val = (unsigned long)list; in rb_list_head()
894 struct buffer_page *page, struct list_head *list) in rb_is_head_page() argument
898 val = (unsigned long)list->next; in rb_is_head_page()
900 if ((val & ~RB_FLAG_MASK) != (unsigned long)&page->list) in rb_is_head_page()
915 struct list_head *list = page->list.prev; in rb_is_reader_page() local
917 return rb_list_head(list->next) != &page->list; in rb_is_reader_page()
924 struct list_head *list) in rb_set_list_to_head() argument
928 ptr = (unsigned long *)&list->next; in rb_set_list_to_head()
[all …]
Dtrace_events_trigger.c66 list_for_each_entry_rcu(data, &file->triggers, list) { in event_triggers_call()
104 list_for_each_entry_rcu(data, &file->triggers, list) { in event_triggers_post_call()
156 list_for_each_entry_reverse(p, &trigger_commands, list) in trigger_show()
163 data = list_entry(v, struct event_trigger_data, list); in trigger_show()
198 list_for_each_entry(p, &trigger_commands, list) { in event_trigger_regex_open()
233 list_for_each_entry(p, &trigger_commands, list) { in trigger_process_regex()
335 list_for_each_entry(p, &trigger_commands, list) { in register_event_command()
341 list_add(&cmd->list, &trigger_commands); in register_event_command()
358 list_for_each_entry_safe(p, n, &trigger_commands, list) { in unregister_event_command()
361 list_del_init(&p->list); in unregister_event_command()
[all …]
Dtrace_printk.c34 struct list_head list; member
45 list_for_each_entry(pos, &trace_bprintk_fmt_list, list) { in lookup_format()
76 list_add_tail(&tb_fmt->list, &trace_bprintk_fmt_list); in hold_module_trace_bprintk_format()
140 list_for_each_entry(p, &trace_bprintk_fmt_list, list) { in find_next_mod_format()
154 if (mod_fmt->list.next == &trace_bprintk_fmt_list) in find_next_mod_format()
157 mod_fmt = container_of(mod_fmt->list.next, typeof(*mod_fmt), list); in find_next_mod_format()
Dtrace_event_perf.c99 struct hlist_head __percpu *list; in perf_trace_event_reg() local
107 list = alloc_percpu(struct hlist_head); in perf_trace_event_reg()
108 if (!list) in perf_trace_event_reg()
112 INIT_HLIST_HEAD(per_cpu_ptr(list, cpu)); in perf_trace_event_reg()
114 tp_event->perf_events = list; in perf_trace_event_reg()
224 list_for_each_entry(tp_event, &ftrace_events, list) { in perf_trace_init()
369 struct hlist_head *list; in perf_trace_add() local
375 list = this_cpu_ptr(pcpu_list); in perf_trace_add()
376 hlist_add_head_rcu(&p_event->hlist_entry, list); in perf_trace_add()
Dtrace_events.c63 list_for_each_entry(tr, &ftrace_trace_arrays, list) { \
64 list_for_each_entry(file, &tr->events, list)
67 list_for_each_entry(tr, &ftrace_trace_arrays, list) { \
69 list_for_each_entry_safe(file, ___n, &tr->events, list)
492 list_for_each_entry(file, &tr->events, list) { in ftrace_clear_events()
618 list_for_each_entry(file, &tr->events, list) { in __ftrace_clear_event_pids()
648 list_del(&system->list); in __put_system()
696 list_del(&dir->list); in remove_subsystem()
717 list_del(&file->list); in remove_event_file_dir()
736 list_for_each_entry(file, &tr->events, list) { in __ftrace_set_clr_event_nolock()
[all …]
Dtrace_probe.h243 struct list_head list; member
252 struct list_head list; member
305 return list_first_entry_or_null(&tpe->probes, struct trace_probe, list); in trace_probe_primary_from_call()
315 struct list_head *list = trace_probe_probe_list(tp); in trace_probe_has_sibling() local
317 return !list_empty(list) && !list_is_singular(list); in trace_probe_has_sibling()
347 list_for_each_entry(pos, &(tp)->event->files, list)
349 list_for_each_entry_rcu(pos, &(tp)->event->files, list)
/kernel/bpf/
Dbpf_lru_list.c77 if (&node->list == l->next_inactive_rotation) in __bpf_lru_node_move_to_free()
83 list_move(&node->list, free_list); in __bpf_lru_node_move_to_free()
98 list_move(&node->list, &l->lists[tgt_type]); in __bpf_lru_node_move_in()
123 if (&node->list == l->next_inactive_rotation) in __bpf_lru_node_move()
126 list_move(&node->list, &l->lists[tgt_type]); in __bpf_lru_node_move()
151 first_node = list_first_entry(active, struct bpf_lru_node, list); in __bpf_lru_list_rotate_active()
152 list_for_each_entry_safe_reverse(node, tmp_node, active, list) { in __bpf_lru_list_rotate_active()
193 node = list_entry(cur, struct bpf_lru_node, list); in __bpf_lru_list_rotate_inactive()
222 list_for_each_entry_safe_reverse(node, tmp_node, inactive, list) { in __bpf_lru_list_shrink_inactive()
283 list) { in __bpf_lru_list_shrink()
[all …]
Dlocal_storage.c25 struct list_head list; member
245 if (list_empty(&map->list)) in cgroup_storage_get_next_key()
253 storage = list_next_entry(storage, list); in cgroup_storage_get_next_key()
257 storage = list_first_entry(&map->list, in cgroup_storage_get_next_key()
258 struct bpf_cgroup_storage, list); in cgroup_storage_get_next_key()
313 INIT_LIST_HEAD(&map->list); in cgroup_storage_map_alloc()
323 WARN_ON(!list_empty(&map->list)); in cgroup_storage_map_free()
578 list_add(&storage->list, &map->list); in bpf_cgroup_storage_link()
596 list_del(&storage->list); in bpf_cgroup_storage_unlink()
/kernel/rcu/
Dtiny.c79 struct rcu_head *next, *list; in rcu_process_callbacks() local
89 list = rcu_ctrlblk.rcucblist; in rcu_process_callbacks()
98 while (list) { in rcu_process_callbacks()
99 next = list->next; in rcu_process_callbacks()
101 debug_rcu_head_unqueue(list); in rcu_process_callbacks()
103 __rcu_reclaim("", list); in rcu_process_callbacks()
105 list = next; in rcu_process_callbacks()
Dupdate.c635 struct rcu_head *list; in rcu_tasks_kthread() local
653 list = rcu_tasks_cbs_head; in rcu_tasks_kthread()
659 if (!list) { in rcu_tasks_kthread()
776 while (list) { in rcu_tasks_kthread()
777 next = list->next; in rcu_tasks_kthread()
779 list->func(list); in rcu_tasks_kthread()
781 list = next; in rcu_tasks_kthread()
/kernel/time/
Dclockevents.c349 struct clock_event_device, list); in clockevents_notify_released()
350 list_del(&dev->list); in clockevents_notify_released()
351 list_add(&dev->list, &clockevent_devices); in clockevents_notify_released()
363 list_for_each_entry(dev, &clockevent_devices, list) { in clockevents_replace()
379 list_del_init(&ced->list); in clockevents_replace()
391 list_del_init(&ced->list); in __clockevents_try_unbind()
464 list_add(&dev->list, &clockevent_devices); in clockevents_register_device()
579 list_del(&old->list); in clockevents_exchange_device()
580 list_add(&old->list, &clockevents_released); in clockevents_exchange_device()
596 list_for_each_entry_reverse(dev, &clockevent_devices, list) in clockevents_suspend()
[all …]
Dclocksource.c161 if (list_empty(&cs->list)) { in __clocksource_unstable()
187 if (!list_empty(&cs->list) && list_empty(&cs->wd_list)) in clocksource_mark_unstable()
407 list_for_each_entry(cs, &clocksource_list, list) { in clocksource_select_watchdog()
544 list_for_each_entry(cs, &clocksource_list, list) { in clocksource_suspend_select()
645 list_for_each_entry_reverse(cs, &clocksource_list, list) in clocksource_suspend()
657 list_for_each_entry(cs, &clocksource_list, list) in clocksource_resume()
763 list_for_each_entry(cs, &clocksource_list, list) { in clocksource_find_best()
787 list_for_each_entry(cs, &clocksource_list, list) { in __clocksource_select()
878 list_for_each_entry(tmp, &clocksource_list, list) { in clocksource_enqueue()
882 entry = &tmp->list; in clocksource_enqueue()
[all …]
/kernel/power/
Dqos.c69 .list = PLIST_HEAD_INIT(cpu_dma_constraints.list),
107 if (plist_head_empty(&c->list)) in pm_qos_get_value()
112 return plist_first(&c->list)->prio; in pm_qos_get_value()
115 return plist_last(&c->list)->prio; in pm_qos_get_value()
118 plist_for_each(node, &c->list) in pm_qos_get_value()
162 if (plist_head_empty(&c->list)) { in pm_qos_debug_show()
181 plist_for_each_entry(req, &c->list, node) { in pm_qos_debug_show()
230 plist_del(node, &c->list); in pm_qos_update_target()
238 plist_del(node, &c->list); in pm_qos_update_target()
242 plist_add(node, &c->list); in pm_qos_update_target()
[all …]
Dsnapshot.c235 static inline void free_list_of_pages(struct linked_page *list, in free_list_of_pages() argument
238 while (list) { in free_list_of_pages()
239 struct linked_page *lp = list->next; in free_list_of_pages()
241 free_image_page(list, clear_page_nosave); in free_list_of_pages()
242 list = lp; in free_list_of_pages()
349 struct list_head list; member
358 struct list_head list; /* Link Zones together */ member
404 struct list_head *list) in alloc_rtree_node() argument
416 list_add_tail(&node->list, list); in alloc_rtree_node()
541 list_for_each_entry(node, &zone->nodes, list) in free_zone_bm_rtree()
[all …]
/kernel/locking/
Dmutex-debug.c34 INIT_LIST_HEAD(&waiter->list); in debug_mutex_lock_common()
42 DEBUG_LOCKS_WARN_ON(list_empty(&waiter->list)); in debug_mutex_wake_waiter()
47 DEBUG_LOCKS_WARN_ON(!list_empty(&waiter->list)); in debug_mutex_free_waiter()
63 DEBUG_LOCKS_WARN_ON(list_empty(&waiter->list)); in debug_mutex_remove_waiter()
68 INIT_LIST_HEAD(&waiter->list); in debug_mutex_remove_waiter()
Dsemaphore.c194 struct list_head list; member
209 list_add_tail(&waiter.list, &sem->wait_list); in __down_common()
227 list_del(&waiter.list); in __down_common()
231 list_del(&waiter.list); in __down_common()
258 struct semaphore_waiter, list); in __up()
259 list_del(&waiter->list); in __up()
/kernel/dma/
Ddebug.c68 struct list_head list; member
88 struct list_head list; member
298 list_for_each_entry(entry, &bucket->list, list) { in __hash_bucket_find()
380 list_add_tail(&entry->list, &bucket->list); in hash_bucket_add()
388 list_del(&entry->list); in hash_bucket_del()
413 list_for_each_entry(entry, &bucket->list, list) { in debug_dma_dump_mappings()
638 list_add_tail(&entry[i].list, &free_entries); in dma_debug_create_entries()
650 entry = list_entry(free_entries.next, struct dma_debug_entry, list); in __dma_entry_alloc()
651 list_del(&entry->list); in __dma_entry_alloc()
717 list_add(&entry->list, &free_entries); in dma_entry_free()
[all …]

1234