Home
last modified time | relevance | path

Searched refs:next (Results 1 – 25 of 228) sorted by relevance

12345678910

/tools/include/linux/
A Dlist.h43 new->next = next; in __list_add()
90 WRITE_ONCE(prev->next, next); in __list_del()
126 new->next = old->next; in list_replace()
207 struct list_head *next = head->next; in list_empty_careful() local
238 list->next = head->next; in __list_cut_position()
284 last->next = next; in __list_splice()
665 n->next = next; in hlist_add_before()
666 next->pprev = &n->next; in hlist_add_before()
673 n->next = prev->next; in hlist_add_behind()
678 n->next->pprev = &n->next; in hlist_add_behind()
[all …]
/tools/usb/usbip/libsrc/
A Dlist.h20 struct list_head *next, *prev; member
30 list->next = list; in INIT_LIST_HEAD()
44 next->prev = new; in __list_add()
45 new->next = next; in __list_add()
47 prev->next = new; in __list_add()
72 next->prev = prev; in __list_del()
73 prev->next = next; in __list_del()
94 entry->next = LIST_POISON1; in list_del()
112 for (pos = (head)->next; pos != (head); pos = pos->next)
121 for (pos = (head)->next, n = pos->next; pos != (head); \
[all …]
A Dnames.c26 struct vendor *next; member
32 struct product *next; member
38 struct class *next; member
44 struct subclass *next; member
50 struct protocol *next; member
88 for (; v; v = v->next) in names_vendor()
99 for (; p; p = p->next) in names_product()
110 for (; c; c = c->next) in names_class()
143 struct pool *next; member
163 p->next = pool_head; in my_malloc()
[all …]
/tools/testing/selftests/bpf/progs/
A Dtest_core_read_macros.c13 struct callback_head___shuffled *next; member
41 k_probe_in.next = &k_probe_in; in handler()
42 __builtin_preserve_access_index(({k_core_in.next = &k_core_in;})); in handler()
44 k_probe_out = (long)BPF_PROBE_READ(&k_probe_in, next, next, func); in handler()
45 k_core_out = (long)BPF_CORE_READ(&k_core_in, next, next, func); in handler()
46 u_probe_out = (long)BPF_PROBE_READ_USER(u_probe_in, next, next, func); in handler()
47 u_core_out = (long)BPF_CORE_READ_USER(u_core_in, next, next, func); in handler()
A Dbpf_arena_spin_lock.h63 struct arena_mcs_spinlock __arena *next; member
246 struct arena_mcs_spinlock __arena *prev, *next, *node0, *node; in arena_spin_lock_slowpath() local
346 node->next = NULL; in arena_spin_lock_slowpath()
371 next = NULL; in arena_spin_lock_slowpath()
381 WRITE_ONCE(prev->next, node); in arena_spin_lock_slowpath()
390 next = READ_ONCE(node->next); in arena_spin_lock_slowpath()
443 if (!next) in arena_spin_lock_slowpath()
444 next = smp_cond_load_relaxed_label(&node->next, (VAL), release_node_err); in arena_spin_lock_slowpath()
446 arch_mcs_spin_unlock_contended(&next->locked); in arena_spin_lock_slowpath()
A Dbtf_dump_test_case_ordering.c32 struct list_head *next; member
37 struct hlist_node *next; member
46 struct callback_head *next; member
/tools/lib/
A Dlist_sort.c22 tail = &a->next; in merge()
23 a = a->next; in merge()
30 tail = &b->next; in merge()
31 b = b->next; in merge()
57 tail->next = a; in merge_final()
60 a = a->next; in merge_final()
64 tail->next = b; in merge_final()
67 b = b->next; in merge_final()
76 tail->next = b; in merge_final()
80 b = b->next; in merge_final()
[all …]
/tools/firewire/
A Dlist.h3 struct list *next, *prev; member
9 list->next = list; in list_init()
16 return list->next == list; in list_empty()
23 new_link->next = link; in list_insert()
24 new_link->prev->next = new_link; in list_insert()
25 new_link->next->prev = new_link; in list_insert()
37 list_insert(list->next, new_link); in list_prepend()
43 link->prev->next = link->next; in list_remove()
44 link->next->prev = link->prev; in list_remove()
51 list_entry((list)->next, type, member)
[all …]
/tools/testing/selftests/bpf/
A Dbpf_arena_list.h11 arena_list_node_t *next; member
40 pos && ({ ___tmp = (void *)pos->member.next; 1; }) && can_loop; \
49 WRITE_ONCE(n->next, first); in list_add_head()
52 tmp = &n->next; in list_add_head()
67 arena_list_node_t *next = n->next, *tmp; in __list_del() local
70 cast_user(next); in __list_del()
74 WRITE_ONCE(tmp, next); in __list_del()
75 if (next) { in __list_del()
77 cast_kern(next); in __list_del()
78 WRITE_ONCE(next->pprev, pprev); in __list_del()
[all …]
A DDENYLIST3 get_stack_raw_tp # spams with kernel warnings until next bpf -> bpf-next merge
/tools/power/cpupower/lib/
A Dcpufreq.c309 if (!current->next) in cpufreq_get_available_governors()
353 next = tmp->next; in cpufreq_put_available_governors()
357 tmp = next; in cpufreq_put_available_governors()
386 if (!current->next) in cpufreq_get_available_frequencies()
442 if (!current->next) in cpufreq_get_boost_frequencies()
483 next = tmp->next; in cpufreq_put_available_frequencies()
485 tmp = next; in cpufreq_put_available_frequencies()
564 next = tmp->next; in cpufreq_put_affected_cpus()
566 tmp = next; in cpufreq_put_affected_cpus()
794 next = tmp->next; in cpufreq_put_stats()
[all …]
A Dcpufreq.h19 struct cpufreq_available_governors *next; member
25 struct cpufreq_available_frequencies *next; member
32 struct cpufreq_affected_cpus *next; member
39 struct cpufreq_stats *next; member
/tools/testing/selftests/kvm/lib/
A Dsparsebit.c746 if (next) { in node_reduce()
748 if (next->mask == 0 && next->num_after == 0) { in node_reduce()
1421 next && (next->idx < middle_end); in sparsebit_set_num()
1425 next = NULL; in sparsebit_set_num()
1484 next && (next->idx < middle_end); in sparsebit_clear_num()
1981 assert(next == 0 || next > first); in operate()
1982 assert(next == 0 || get_value(next)); in operate()
1986 assert(next == 0 || next > first); in operate()
1987 assert(next == 0 || !get_value(next)); in operate()
1992 assert(next == 0 || next > last); in operate()
[all …]
/tools/testing/selftests/bpf/prog_tests/
A Dcore_read_macros.c7 struct callback_head *next; member
17 struct callback_head___shuffled *next; member
41 u_probe_in.next = &u_probe_in; in test_core_read_macros()
45 u_core_in.next = &u_core_in; in test_core_read_macros()
/tools/perf/util/
A Dblock-range.c81 struct block_range *next, *entry = NULL; in block_range__create() local
113 next = rb_entry(n, struct block_range, node); in block_range__create()
122 .end = next->start - 1, in block_range__create()
127 rb_link_left_of_node(&head->node, &next->node); in block_range__create()
238 next = block_range__next(entry); in block_range__create()
239 if (!next) in block_range__create()
245 if (end < next->start) { /* add tail: [...e->end][...end] */ in block_range__create()
270 if (entry->end + 1 != next->start) { in block_range__create()
277 .end = next->start - 1, in block_range__create()
282 rb_link_left_of_node(&hole->node, &next->node); in block_range__create()
[all …]
A Dtrace-event-info.c39 struct tracepoint_path *next; member
149 tps = tps->next; in name_in_tp_list()
247 tps = tps->next; in system_in_tp_list()
397 tps = tps->next; in put_tracepoints_path()
425 goto next; in tracepoint_id_to_path()
462 next: in tracepoint_id_to_path()
518 if (ppath->next) in get_tracepoints_path()
519 goto next; in get_tracepoints_path()
529 if (!ppath->next) { in get_tracepoints_path()
535 next: in get_tracepoints_path()
[all …]
A Dtrace-event-parse.c134 for (; sym; sym = sym->next) { in convert_sym()
219 for (arg = event->print_fmt.args; arg; arg = arg->next) { in parse_task_states()
238 char *next = NULL; in parse_ftrace_printk() local
242 line = strtok_r(file, "\n", &next); in parse_ftrace_printk()
252 line = strtok_r(NULL, "\n", &next); in parse_ftrace_printk()
263 char *next = NULL; in parse_saved_cmdline() local
266 line = strtok_r(file, "\n", &next); in parse_saved_cmdline()
270 line = strtok_r(NULL, "\n", &next); in parse_saved_cmdline()
/tools/perf/util/bpf_skel/
A Doff_cpu.bpf.c257 struct task_struct *next, int state) in off_cpu_stat() argument
266 goto next; in off_cpu_stat()
274 goto next; in off_cpu_stat()
290 next: in off_cpu_stat()
291 pelem = bpf_task_storage_get(&tstamp, next, NULL, 0); in off_cpu_stat()
295 .pid = next->pid, in off_cpu_stat()
296 .tgid = next->tgid, in off_cpu_stat()
299 .cgroup_id = needs_cgroup ? get_cgroup_id(next) : 0, in off_cpu_stat()
355 struct task_struct *prev, *next; in on_switch() local
362 next = (struct task_struct *)ctx[2]; in on_switch()
[all …]
/tools/testing/selftests/net/tcp_ao/lib/
A Dftrace.c34 struct test_ftracer *next; member
65 struct opts_list_t *next; member
98 tmp->next = opts_list; in disable_trace_options()
114 opts_list = opts_list->next; in disable_trace_options()
402 tracer->next = ftracers; in create_ftracer()
441 ftracers = tracer->next; in destroy_ftracer()
446 if (!f->next) in destroy_ftracer()
448 f = f->next; in destroy_ftracer()
450 f->next = tracer->next; in destroy_ftracer()
452 tracer->next = NULL; in destroy_ftracer()
[all …]
/tools/testing/selftests/filesystems/
A Dutils.c55 for (__iterator = (__list)->next; __iterator != __list; __iterator = __iterator->next)
71 struct list *next; member
85 list->next = list->prev = list; in list_init()
90 return list == list->next; in list_empty()
95 next->prev = new; in __list_add()
96 new->next = next; in __list_add()
98 prev->next = new; in __list_add()
108 struct list *next, *prev; in list_del() local
110 next = list->next; in list_del()
112 next->prev = prev; in list_del()
[all …]
/tools/testing/selftests/powerpc/dscr/
A Ddscr_explicit_test.c31 sem_t *next = (sem_t *)args + 1; in dscr_explicit_lockstep_thread() local
46 FAIL_IF_EXIT(sem_post(next)); in dscr_explicit_lockstep_thread()
57 sem_t *next = &semaphores[0]; in dscr_explicit_lockstep_test() local
66 FAIL_IF(sem_init(next, 0, 1)); /* other thread starts first */ in dscr_explicit_lockstep_test()
79 FAIL_IF(sem_post(next)); in dscr_explicit_lockstep_test()
84 FAIL_IF(sem_destroy(next)); in dscr_explicit_lockstep_test()
/tools/perf/
A Dbuiltin-timechart.c248 c = c->next; in pid_set_comm()
838 sample->next = prev->next; in pid_end_io_sample()
997 p->next = prev->next; in sort_pids()
1086 p = p->next; in draw_wakeups()
1134 c = c->next; in draw_cpu_usage()
1136 p = p->next; in draw_cpu_usage()
1250 p = p->next; in draw_io_bars()
1307 p = p->next; in draw_process_bars()
1378 p = p->next; in determine_display_tasks_filtered()
1419 p = p->next; in determine_display_tasks()
[all …]
/tools/bpf/runqslower/
A Drunqslower.bpf.c70 struct task_struct *next = (struct task_struct *)ctx[2]; in handle__sched_switch() local
79 pid = next->pid; in handle__sched_switch()
86 tsp = bpf_task_storage_get(&start, next, 0, 0); in handle__sched_switch()
102 bpf_task_storage_delete(&start, next); in handle__sched_switch()
/tools/perf/ui/
A Dprogress.c22 if (p->curr >= p->next) { in ui_progress__update()
25 p->next += nr * p->step; in ui_progress__update()
34 p->next = p->step = total / 16 ?: 1; in __ui_progress__init()
/tools/lib/api/
A Dio_dir.h55 struct io_dirent64 *next; member
81 iod->next = iod->buff; in io_dir__readdir()
83 entry = iod->next; in io_dir__readdir()
84 iod->next = (struct io_dirent64 *)((char *)entry + entry->d_reclen); in io_dir__readdir()

Completed in 41 milliseconds

12345678910