Home
last modified time | relevance | path

Searched refs:top (Results 1 – 6 of 6) sorted by relevance

/kernel/trace/
A Dtrace_btf.c79 int i, top = 0; in btf_find_struct_member() local
95 top < BTF_ANON_STACK_MAX) { in btf_find_struct_member()
96 anon_stack[top].tid = tid; in btf_find_struct_member()
97 anon_stack[top++].offset = in btf_find_struct_member()
109 if (top > 0) { in btf_find_struct_member()
111 tid = anon_stack[--top].tid; in btf_find_struct_member()
112 cur_offset = anon_stack[top].offset; in btf_find_struct_member()
A Dtrace_stack.c157 unsigned long this_size, flags; unsigned long *p, *top, *start; in check_stack() local
213 top = (unsigned long *) in check_stack()
229 for (; p < top && i < stack_trace_nr_entries; p++) { in check_stack()
237 (top - p) * sizeof(unsigned long); in check_stack()
A Dtrace_events_filter.c479 int *top; in predicate_parse() local
502 top = op_stack; in predicate_parse()
504 *top = 0; in predicate_parse()
519 *(++top) = invert; in predicate_parse()
573 *top &= ~PROCESS_AND; in predicate_parse()
576 *top |= PROCESS_AND; in predicate_parse()
581 *top &= ~PROCESS_OR; in predicate_parse()
584 *top |= PROCESS_OR; in predicate_parse()
590 if (top == op_stack) { in predicate_parse()
596 top--; /* #12 */ in predicate_parse()
[all …]
A DKconfig542 The tracer is build on top of osnoise tracer, and the osnoise:
789 This allows the user to add tracing events on top of userspace
/kernel/time/
A Dtimer_migration.c1645 int top = 0, err = 0, i = 0; in tmigr_setup_groups() local
1659 top = i; in tmigr_setup_groups()
1676 WARN_ON_ONCE(!err && !group->parent && !list_is_singular(&tmigr_level_list[top])); in tmigr_setup_groups()
1713 if (top != i) in tmigr_setup_groups()
1716 WARN_ON_ONCE(top == 0); in tmigr_setup_groups()
1718 lvllist = &tmigr_level_list[top]; in tmigr_setup_groups()
1734 lvllist = &tmigr_level_list[top - 1]; in tmigr_setup_groups()
/kernel/
A Dfork.c2912 void walk_process_tree(struct task_struct *top, proc_visitor visitor, void *data) in walk_process_tree() argument
2918 leader = top = top->group_leader; in walk_process_tree()
2934 if (leader != top) { in walk_process_tree()

Completed in 25 milliseconds