Home
last modified time | relevance | path

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

1234

/tools/power/cpupower/
A 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
60 case "$prev" in
70 case "$prev" in
[all …]
/tools/usb/usbip/libsrc/
A 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()
72 next->prev = prev; in __list_del()
73 prev->next = next; in __list_del()
82 __list_del(entry->prev, entry->next); in __list_del_entry()
93 __list_del(entry->prev, entry->next); in list_del()
[all …]
/tools/testing/selftests/bpf/progs/
A Dcpumask_failure.c130 if (prev) { in BPF_PROG()
131 bpf_cpumask_release(prev); in BPF_PROG()
164 if (prev) { in BPF_PROG()
165 bpf_cpumask_release(prev); in BPF_PROG()
185 struct bpf_cpumask *prev, *curr; in BPF_PROG() local
192 if (prev) in BPF_PROG()
193 bpf_cpumask_release(prev); in BPF_PROG()
200 if (prev) in BPF_PROG()
201 bpf_cpumask_release(prev); in BPF_PROG()
217 if (prev) { in BPF_PROG()
[all …]
A Dcgroup_hierarchical_stats.c14 __u64 prev; member
51 struct percpu_attach_counter pcpu_init = {.state = state, .prev = 0}; in create_percpu_attach_counter()
98 delta += state - pcpu_counter->prev; in BPF_PROG()
99 pcpu_counter->prev = state; in BPF_PROG()
/tools/include/linux/
A Dlist.h28 list->prev = list; in INIT_LIST_HEAD()
42 next->prev = new; in __list_add()
44 new->prev = prev; in __list_add()
45 prev->next = new; in __list_add()
89 next->prev = prev; in __list_del()
128 new->prev = old->prev; in list_replace()
281 first->prev = prev; in __list_splice()
428 for (pos = (head)->prev; pos != (head); pos = pos->prev)
447 for (pos = (head)->prev, n = pos->prev; \
674 prev->next = n; in hlist_add_behind()
[all …]
A Dinterval_tree_generic.h154 struct rb_node *rb = node->ITRB.rb_right, *prev; \
176 prev = &node->ITRB; \
179 } while (prev == rb); \
/tools/lib/
A Dlist_sort.c58 a->prev = tail; in merge_final()
65 b->prev = tail; in merge_final()
78 b->prev = tail; in merge_final()
85 head->prev = tail; in merge_final()
181 head->prev->next = NULL; in list_sort()
207 tail = &(*tail)->prev; in list_sort()
210 struct list_head *a = *tail, *b = a->prev; in list_sort()
214 a->prev = b->prev; in list_sort()
219 list->prev = pending; in list_sort()
228 pending = pending->prev; in list_sort()
[all …]
/tools/firewire/
A 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)
A 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()
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()
578 prev = list_tail(&t->request_list, struct subaction, link); in handle_response_packet()
579 if (prev->ack != ACK_PENDING) { in handle_response_packet()
[all …]
/tools/perf/
A Dperf-completion.sh74 prev)
75 prev=${words_[$cword_-1]}
165 elif [[ $prev == @("-e"|"--event") &&
206 elif [[ $prev == @("--pfm-events") &&
211 elif [[ $prev == @("-M"|"--metrics") &&
282 local _ret=1 cur cword prev
284 prev=${words[CURRENT-1]}
310 local cur words cword prev
312 _get_comp_words_by_ref -n =:, cur words cword prev
314 __perf_get_comp_words_by_ref -n =:, cur words cword prev
A Dbuiltin-timechart.c746 if (prev && prev->start_time && !prev->end_time) { in pid_begin_io_sample()
753 free(prev); in pid_begin_io_sample()
801 prev = sample->next; in pid_end_io_sample()
807 if (prev && sample->start_time < prev->end_time) { in pid_end_io_sample()
828 if (prev && in pid_end_io_sample()
839 free(prev); in pid_end_io_sample()
990 prev = NULL; in sort_pids()
996 if (prev) { in sort_pids()
998 prev->next = p; in sort_pids()
1009 prev = cursor; in sort_pids()
[all …]
/tools/bpf/bpftool/bash-completion/
A Dbpftool274 case $prev in
308 prev=${words[cword - 1]}
341 case $prev in
363 case $prev in
479 case $prev in
521 case $prev in
573 case $prev in
607 case $prev in
634 case $prev in
666 case $prev in
[all …]
/tools/testing/selftests/powerpc/dscr/
A Ddscr_explicit_test.c30 sem_t *prev = (sem_t *)args; in dscr_explicit_lockstep_thread() local
38 FAIL_IF_EXIT(sem_wait(prev)); in dscr_explicit_lockstep_thread()
56 sem_t *prev = &semaphores[1]; /* reversed prev/next than for the other thread */ in dscr_explicit_lockstep_test() local
65 FAIL_IF(sem_init(prev, 0, 0)); in dscr_explicit_lockstep_test()
71 FAIL_IF(sem_wait(prev)); in dscr_explicit_lockstep_test()
83 FAIL_IF(sem_destroy(prev)); in dscr_explicit_lockstep_test()
/tools/testing/selftests/kvm/lib/
A Dsparsebit.c382 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()
670 if (prev) { in node_reduce()
674 if (prev->mask == 0 && prev->num_after == 0) { in node_reduce()
700 prev_highest_bit = prev->idx + MASK_BITS - 1 + prev->num_after; in node_reduce()
1802 if (prev) { in sparsebit_validate_internal()
1812 prev, prev->idx, nodep, nodep->idx); in sparsebit_validate_internal()
1821 if ((prev->idx + MASK_BITS + prev->num_after - 1) in sparsebit_validate_internal()
1830 prev, prev->idx, prev->num_after, in sparsebit_validate_internal()
1843 prev->idx + MASK_BITS + prev->num_after == nodep->idx) { in sparsebit_validate_internal()
[all …]
/tools/perf/scripts/python/
A Dsched-migration.py108 and prev in self.tasks:
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:
170 self.rqs = prev.rqs.copy()
180 old_rq = self.prev.rqs[cpu]
194 old_rq = self.prev.rqs[old_cpu]
[all …]
/tools/testing/selftests/filesystems/
A Dutils.c72 struct list *prev; member
85 list->next = list->prev = list; in list_init()
93 static inline void __list_add(struct list *new, struct list *prev, struct list *next) in __list_add() argument
95 next->prev = new; in __list_add()
97 new->prev = prev; in __list_add()
98 prev->next = new; in __list_add()
103 __list_add(list, head->prev, head); in list_add_tail()
108 struct list *next, *prev; in list_del() local
111 prev = list->prev; in list_del()
112 next->prev = prev; in list_del()
[all …]
/tools/objtool/arch/x86/
A Dspecial.c10 static struct special_alt *group, *prev; in arch_handle_alternative() local
23 if (iter == prev) in arch_handle_alternative()
31 prev = alt; in arch_handle_alternative()
/tools/bpf/runqslower/
A Drunqslower.bpf.c69 struct task_struct *prev = (struct task_struct *)ctx[1]; in handle__sched_switch() local
76 if (prev->__state == TASK_RUNNING) in handle__sched_switch()
77 trace_enqueue(prev); in handle__sched_switch()
/tools/lib/perf/
A Dmmap.c19 void perf_mmap__init(struct perf_mmap *map, struct perf_mmap *prev, in perf_mmap__init() argument
27 if (prev) in perf_mmap__init()
28 prev->next = map; in perf_mmap__init()
39 map->prev = 0; in perf_mmap__mmap()
97 return perf_mmap__read_head(map) == map->prev && !pc->aux_size; in perf_mmap__empty()
103 u64 old = map->prev; in perf_mmap__consume()
150 u64 old = md->prev; in __perf_mmap__read_init()
165 md->prev = head; in __perf_mmap__read_init()
206 map->prev = perf_mmap__read_head(map); in perf_mmap__read_done()
289 map->prev = map->start; in perf_mmap__read_event()
/tools/perf/util/bpf_skel/
A Doff_cpu.bpf.c256 static int off_cpu_stat(u64 *ctx, struct task_struct *prev, in off_cpu_stat() argument
265 if (!can_record(prev, state)) in off_cpu_stat()
271 pelem = bpf_task_storage_get(&tstamp, prev, NULL, in off_cpu_stat()
355 struct task_struct *prev, *next; in on_switch() local
361 prev = (struct task_struct *)ctx[1]; in on_switch()
367 prev_state = get_task_state(prev); in on_switch()
369 return off_cpu_stat(ctx, prev, next, prev_state & 0xff); in on_switch()
/tools/perf/util/
A 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()
A Dbpf_kwork_top.c272 struct work_key key, prev; in perf_kwork__top_read_bpf() local
285 memset(&prev, 0, sizeof(prev)); in perf_kwork__top_read_bpf()
286 while (!bpf_map_get_next_key(fd, &prev, &key)) { in perf_kwork__top_read_bpf()
299 prev = key; in perf_kwork__top_read_bpf()
/tools/lib/perf/include/internal/
A Dmmap.h30 u64 prev; member
48 void perf_mmap__init(struct perf_mmap *map, struct perf_mmap *prev,
/tools/testing/selftests/kvm/
A Dpre_fault_memory_test.c41 u64 prev; in pre_fault_memory() local
45 prev = range.size; in pre_fault_memory()
48 TEST_ASSERT((range.size < prev) ^ (ret < 0), in pre_fault_memory()
/tools/testing/vma/
A Dvma.c179 vmg->prev = NULL; in vmg_set_range()
824 vmg.prev = vma_prev; in test_vma_merge_with_close()
881 vmg.prev = vma_prev; in test_vma_merge_with_close()
1007 vmg.prev = vma; in test_merge_existing()
1166 vmg.prev = vma; in test_merge_existing()
1172 vmg.prev = vma; in test_merge_existing()
1178 vmg.prev = vma; in test_merge_existing()
1184 vmg.prev = vma; in test_merge_existing()
1190 vmg.prev = vma; in test_merge_existing()
1196 vmg.prev = vma; in test_merge_existing()
[all …]

Completed in 41 milliseconds

1234