Home
last modified time | relevance | path

Searched refs:prev (Results 1 – 25 of 49) sorted by relevance

12

/tools/power/cpupower/
Dcpupower-completion.sh10 local prev="${COMP_WORDS[COMP_CWORD-1]}"
12 case "$prev" in
20 local prev="${COMP_WORDS[COMP_CWORD-1]}"
22 case "$prev" in
38 local prev="${COMP_WORDS[COMP_CWORD-1]}"
40 case "$prev" in
48 local prev="${COMP_WORDS[COMP_CWORD-1]}"
50 case "$prev" in
58 local prev="${COMP_WORDS[COMP_CWORD-1]}"
60 case "$prev" in
[all …]
/tools/usb/usbip/libsrc/
Dlist.h20 struct list_head *next, *prev; member
31 list->prev = list; in INIT_LIST_HEAD()
41 struct list_head *prev, in __list_add() argument
44 next->prev = new; in __list_add()
46 new->prev = prev; in __list_add()
47 prev->next = new; in __list_add()
70 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
72 next->prev = prev; in __list_del()
73 prev->next = next; in __list_del()
88 __list_del(entry->prev, entry->next); in __list_del_entry()
[all …]
/tools/firewire/
Dlist.h3 struct list *next, *prev; member
10 list->prev = list; in list_init()
22 new_link->prev = link->prev; in list_insert()
24 new_link->prev->next = new_link; in list_insert()
25 new_link->next->prev = new_link; in list_insert()
43 link->prev->next = link->next; in list_remove()
44 link->next->prev = link->prev; in list_remove()
54 list_entry((list)->prev, type, member)
Dnosy-dump.c485 struct subaction *sa, *prev; in handle_request_packet() local
494 prev = list_tail(&t->request_list, in handle_request_packet()
497 if (!ACK_BUSY(prev->ack)) { in handle_request_packet()
506 if (prev->packet.common.tcode != sa->packet.common.tcode || in handle_request_packet()
507 prev->packet.common.tlabel != sa->packet.common.tlabel) { in handle_request_packet()
550 struct subaction *sa, *prev; in handle_response_packet() local
563 prev = list_tail(&t->response_list, struct subaction, link); in handle_response_packet()
565 if (!ACK_BUSY(prev->ack)) { in handle_response_packet()
572 if (prev->packet.common.tcode != sa->packet.common.tcode || in handle_response_packet()
573 prev->packet.common.tlabel != sa->packet.common.tlabel) { in handle_response_packet()
[all …]
/tools/include/linux/
Dlist.h28 list->prev = list; in INIT_LIST_HEAD()
39 struct list_head *prev, in __list_add() argument
42 next->prev = new; in __list_add()
44 new->prev = prev; in __list_add()
45 prev->next = new; in __list_add()
49 struct list_head *prev,
77 __list_add(new, head->prev, head); in list_add_tail()
87 static inline void __list_del(struct list_head * prev, struct list_head * next) in __list_del() argument
89 next->prev = prev; in __list_del()
90 WRITE_ONCE(prev->next, next); in __list_del()
[all …]
Dtypes.h70 struct list_head *next, *prev; member
/tools/perf/
Dperf-completion.sh74 prev)
75 prev=${words_[$cword_-1]}
163 elif [[ $prev == @("-e"|"--event") &&
267 local _ret=1 cur cword prev
269 prev=${words[CURRENT-1]}
293 local cur words cword prev
295 _get_comp_words_by_ref -n =:, cur words cword prev
297 __perf_get_comp_words_by_ref -n =:, cur words cword prev
Dbuiltin-timechart.c724 struct io_sample *prev; in pid_begin_io_sample() local
735 prev = c->io_samples; in pid_begin_io_sample()
737 if (prev && prev->start_time && !prev->end_time) { in pid_begin_io_sample()
743 c->io_samples = prev->next; in pid_begin_io_sample()
744 free(prev); in pid_begin_io_sample()
768 struct io_sample *sample, *prev; in pid_end_io_sample() local
792 prev = sample->next; in pid_end_io_sample()
798 if (prev && sample->start_time < prev->end_time) { in pid_end_io_sample()
799 if (prev->err) /* try to make errors more visible */ in pid_end_io_sample()
800 sample->start_time = prev->end_time; in pid_end_io_sample()
[all …]
Dbuiltin-annotate.c132 struct addr_map_symbol *prev = NULL; in process_branch_stack() local
147 if (prev) in process_branch_stack()
148 process_basic_block(prev, &bi[i].from, &bi[i].flags); in process_branch_stack()
149 prev = &bi[i].to; in process_branch_stack()
/tools/perf/lib/
Dcpumap.c91 int n, cpu, prev; in perf_cpu_map__read() local
95 prev = -1; in perf_cpu_map__read()
100 if (prev >= 0) { in perf_cpu_map__read()
101 int new_max = nr_cpus + cpu - prev - 1; in perf_cpu_map__read()
114 while (++prev < cpu) in perf_cpu_map__read()
115 tmp_cpus[nr_cpus++] = prev; in perf_cpu_map__read()
127 prev = cpu; in perf_cpu_map__read()
129 prev = -1; in perf_cpu_map__read()
Devlist.c85 perf_evlist__next(struct perf_evlist *evlist, struct perf_evsel *prev) in perf_evlist__next() argument
89 if (!prev) { in perf_evlist__next()
94 next = list_next_entry(prev, node); in perf_evlist__next()
/tools/testing/selftests/kvm/lib/
Dsparsebit.c335 struct node *nodep, *parentp, *prev; in node_add() local
381 prev = node_prev(s, nodep); in node_add()
382 while (prev && prev->idx + MASK_BITS + prev->num_after - 1 >= nodep->idx) { in node_add()
383 unsigned int n1 = (prev->idx + MASK_BITS + prev->num_after - 1) in node_add()
385 assert(prev->num_after > 0); in node_add()
389 prev->num_after--; in node_add()
605 struct node *prev, *next, *tmp; in node_reduce() local
670 prev = node_prev(s, nodep); in node_reduce()
671 if (prev) { in node_reduce()
675 if (prev->mask == 0 && prev->num_after == 0) { in node_reduce()
[all …]
Dkvm_util_internal.h27 struct userspace_mem_region *next, *prev; member
38 struct vcpu *next, *prev; member
/tools/bpf/bpftool/bash-completion/
Dbpftool185 local cur prev words objword
196 case $prev in
229 prev=${words[cword - 1]}
257 case $prev in
270 [[ $prev != "$command" ]] && return 0
275 case $prev in
300 if [[ $prev == "$command" ]]; then
314 case $prev in
334 case $prev in
380 case $prev in
[all …]
/tools/perf/scripts/python/
Dsched-migration.py104 def sched_switch(self, prev, prev_state, next): argument
108 and prev in self.tasks:
112 event = RunqueueEventSleep(prev)
115 if prev in self.tasks:
117 next_tasks.remove(prev)
119 next_tasks.append(prev)
162 def __init__(self, start, prev): argument
164 self.prev = prev
168 if prev is not None:
169 self.total_load = prev.total_load
[all …]
Dcompaction-times.py84 prev = 0
88 prev = 1
90 s += "%sfree_scanner: %s" % (" " if prev else "", self.fscan)
91 prev = 1
93 s += "%smigration_scanner: %s" % (" " if prev else "", self.mscan)
/tools/perf/util/
Dmem2node.c84 struct phys_entry *prev = &entries[j - 1]; in mem2node__init() local
86 if ((prev->end == start) && in mem2node__init()
87 (prev->node == n->node)) { in mem2node__init()
88 prev->end += bsize; in mem2node__init()
Dmmap.c103 map->core.prev = map->core.start; in perf_mmap__read_event()
110 return perf_mmap__read_head(map) == map->core.prev && !map->auxtrace_mmap.base; in perf_mmap__empty()
129 u64 old = map->core.prev; in perf_mmap__consume()
372 map->core.prev = 0; in perf_mmap__mmap()
447 u64 old = md->core.prev; in __perf_mmap__read_init()
462 md->core.prev = head; in __perf_mmap__read_init()
524 md->core.prev = head; in perf_mmap__push()
544 map->core.prev = perf_mmap__read_head(map); in perf_mmap__read_done()
/tools/testing/selftests/
Dkselftest_harness.h644 struct __test_metadata *prev, *next; member
672 t->prev = t; in __register_test()
677 t->prev = __test_list->prev; in __register_test()
678 t->prev->next = t; in __register_test()
679 __test_list->prev = t; in __register_test()
682 t->next->prev = t; in __register_test()
683 t->prev = t; in __register_test()
/tools/testing/selftests/kvm/include/
Dsparsebit.h48 sparsebit_idx_t sparsebit_next_set(struct sparsebit *sbit, sparsebit_idx_t prev);
49 sparsebit_idx_t sparsebit_next_clear(struct sparsebit *sbit, sparsebit_idx_t prev);
/tools/perf/lib/include/internal/
Dmmap.h24 u64 prev; member
Devlist.h70 return list_entry(evlist->entries.prev, struct perf_evsel, node); in perf_evlist__last()
/tools/testing/selftests/bpf/progs/
Dbtf_dump_test_case_ordering.c33 struct list_head *prev; member
/tools/virtio/ringtest/
Dring.c21 unsigned short prev) in need_event() argument
23 return (unsigned short)(next - event - 1) < (unsigned short)(next - prev); in need_event()
/tools/testing/selftests/rcutorture/formal/srcu-cbmc/include/linux/
Dtypes.h109 struct list_head *next, *prev; member

12