Searched refs:graph (Results 1 – 16 of 16) sorted by relevance
59 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr() argument68 if (!task->ret_stack || index < *graph) in print_ftrace_graph_addr()71 index -= *graph; in print_ftrace_graph_addr()76 (*graph)++; in print_ftrace_graph_addr()82 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr() argument92 int graph = 0; in stack_reader_dump() local104 context, &graph); in stack_reader_dump()
63 if (WARN_ON_ONCE(frame->graph == -1)) in unwind_frame()65 if (frame->graph < -1) in unwind_frame()66 frame->graph += FTRACE_NOTRACE_DEPTH; in unwind_frame()74 frame->pc = tsk->ret_stack[frame->graph--].ret; in unwind_frame()143 frame.graph = current->curr_ret_stack; in save_stack_trace_regs()174 frame.graph = tsk->curr_ret_stack; in __save_stack_trace()
55 frame.graph = current->curr_ret_stack; in profile_pc()
49 frame.graph = current->curr_ret_stack; in return_address()
167 frame.graph = current->curr_ret_stack; in perf_callchain_kernel()
501 frame.graph = p->curr_ret_stack; in get_wchan()
176 frame.graph = tsk->curr_ret_stack; in dump_backtrace()
19 int graph = 0; in __save_stack_trace() local61 if (t->ret_stack && index >= graph) { in __save_stack_trace()62 pc = t->ret_stack[index - graph].ret; in __save_stack_trace()66 graph++; in __save_stack_trace()
1742 int graph = 0; in perf_callchain_kernel() local1775 if (current->ret_stack && index >= graph) { in perf_callchain_kernel()1776 pc = current->ret_stack[index - graph].ret; in perf_callchain_kernel()1778 graph++; in perf_callchain_kernel()
2445 int graph = 0; in show_stack() local2488 if (tsk->ret_stack && index >= graph) { in show_stack()2489 pc = tsk->ret_stack[index - graph].ret; in show_stack()2491 graph++; in show_stack()
38 compatible = "audio-graph-card";43 compatible = "audio-graph-card";
61 compatible = "audio-graph-card";66 compatible = "audio-graph-card";
30 int graph; member
97 compatible = "audio-graph-card";
475 compatible = "audio-graph-card";
417 The complexity M of a function's control flow graph is defined as: