| /linux-4.1.27/drivers/media/ |
| D | media-entity.c | 103 static void stack_push(struct media_entity_graph *graph, in stack_push() argument
106 if (graph->top == MEDIA_ENTITY_ENUM_MAX_DEPTH - 1) { in stack_push()
110 graph->top++; in stack_push()
111 graph->stack[graph->top].link = 0; in stack_push()
112 graph->stack[graph->top].entity = entity; in stack_push()
115 static struct media_entity *stack_pop(struct media_entity_graph *graph) in stack_pop() argument
119 entity = graph->stack[graph->top].entity; in stack_pop()
120 graph->top--; in stack_pop()
138 void media_entity_graph_walk_start(struct media_entity_graph *graph, in media_entity_graph_walk_start() argument
141 graph->top = 0; in media_entity_graph_walk_start()
[all …]
|
| /linux-4.1.27/arch/sh/kernel/ |
| D | dumpstack.c | 57 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr() argument
66 if (!task->ret_stack || index < *graph) in print_ftrace_graph_addr()
69 index -= *graph; in print_ftrace_graph_addr()
74 (*graph)++; in print_ftrace_graph_addr()
80 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr() argument
90 int graph = 0; in stack_reader_dump() local
102 context, &graph); in stack_reader_dump()
|
| /linux-4.1.27/arch/x86/kernel/ |
| D | dumpstack.c | 45 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr() argument
57 if (!task->ret_stack || index < *graph) in print_ftrace_graph_addr()
60 index -= *graph; in print_ftrace_graph_addr()
65 (*graph)++; in print_ftrace_graph_addr()
71 struct thread_info *tinfo, int *graph) in print_ftrace_graph_addr() argument
99 unsigned long *end, int *graph) in print_context_stack() argument
115 print_ftrace_graph_addr(addr, data, ops, tinfo, graph); in print_context_stack()
127 unsigned long *end, int *graph) in print_context_stack_bp() argument
141 print_ftrace_graph_addr(addr, data, ops, tinfo, graph); in print_context_stack_bp()
|
| D | dumpstack_64.c | 160 int graph = 0; in dump_trace() local
206 data, stack_end, &graph); in dump_trace()
222 ops, data, stack_end, &graph); in dump_trace()
243 bp = ops->walk_stack(tinfo, stack, bp, ops, data, NULL, &graph); in dump_trace()
|
| D | dumpstack_32.c | 46 int graph = 0; in dump_trace() local
73 end_stack, &graph); in dump_trace()
|
| /linux-4.1.27/arch/sparc/kernel/ |
| D | stacktrace.c | 18 int graph = 0; in __save_stack_trace() local
60 if (t->ret_stack && index >= graph) { in __save_stack_trace()
61 pc = t->ret_stack[index - graph].ret; in __save_stack_trace()
65 graph++; in __save_stack_trace()
|
| D | perf_event.c | 1701 int graph = 0; in perf_callchain_kernel() local
1734 if (current->ret_stack && index >= graph) { in perf_callchain_kernel()
1735 pc = current->ret_stack[index - graph].ret; in perf_callchain_kernel()
1737 graph++; in perf_callchain_kernel()
|
| D | traps_64.c | 2326 int graph = 0; in show_stack() local
2369 if (tsk->ret_stack && index >= graph) { in show_stack()
2370 pc = tsk->ret_stack[index - graph].ret; in show_stack()
2372 graph++; in show_stack()
|
| /linux-4.1.27/kernel/trace/ |
| D | trace_irqsoff.c | 36 static void stop_irqsoff_tracer(struct trace_array *tr, int graph);
37 static int start_irqsoff_tracer(struct trace_array *tr, int graph);
65 { TRACER_OPT(display-graph, TRACE_DISPLAY_GRAPH) },
526 static int register_irqsoff_function(struct trace_array *tr, int graph, int set) in register_irqsoff_function() argument
534 if (graph) in register_irqsoff_function()
546 static void unregister_irqsoff_function(struct trace_array *tr, int graph) in unregister_irqsoff_function() argument
551 if (graph) in unregister_irqsoff_function()
577 static int start_irqsoff_tracer(struct trace_array *tr, int graph) in start_irqsoff_tracer() argument
581 ret = register_irqsoff_function(tr, graph, 0); in start_irqsoff_tracer()
591 static void stop_irqsoff_tracer(struct trace_array *tr, int graph) in stop_irqsoff_tracer() argument
[all …]
|
| D | trace_sched_wakeup.c | 48 { TRACER_OPT(display-graph, TRACE_DISPLAY_GRAPH) },
133 static int register_wakeup_function(struct trace_array *tr, int graph, int set) in register_wakeup_function() argument
141 if (graph) in register_wakeup_function()
153 static void unregister_wakeup_function(struct trace_array *tr, int graph) in unregister_wakeup_function() argument
158 if (graph) in unregister_wakeup_function()
184 static int start_func_tracer(struct trace_array *tr, int graph) in start_func_tracer() argument
188 ret = register_wakeup_function(tr, graph, 0); in start_func_tracer()
198 static void stop_func_tracer(struct trace_array *tr, int graph) in stop_func_tracer() argument
202 unregister_wakeup_function(tr, graph); in stop_func_tracer()
|
| D | Kconfig | 160 draw a call graph for each thread with some information like
|
| /linux-4.1.27/arch/x86/include/asm/ |
| D | stacktrace.h | 23 int *graph);
29 unsigned long *end, int *graph);
35 unsigned long *end, int *graph);
|
| /linux-4.1.27/tools/perf/tests/attr/ |
| D | README | 47 perf record -g kill (test-record-graph-default)
48 perf record --call-graph dwarf kill (test-record-graph-dwarf)
49 perf record --call-graph fp kill (test-record-graph-fp)
|
| D | test-record-graph-fp | 3 args = --call-graph fp kill >/dev/null 2>&1
|
| D | test-record-graph-dwarf | 3 args = --call-graph dwarf -- kill >/dev/null 2>&1
|
| /linux-4.1.27/scripts/ |
| D | headerdep.pl | 23 graph => \$opt_graph,
35 graph();
172 sub graph { subroutine
|
| /linux-4.1.27/Documentation/devicetree/bindings/video/ |
| D | vga-connector.txt | 15 The VGA connector internal connections are modeled using the OF graph bindings
16 specified in Documentation/devicetree/bindings/graph.txt.
|
| D | adi,adv7123.txt | 18 graph bindings specified in Documentation/devicetree/bindings/graph.txt.
|
| D | renesas,du.txt | 36 The connections to the DU output video ports are modeled using the OF graph
37 bindings specified in Documentation/devicetree/bindings/graph.txt.
|
| D | adi,adv7511.txt | 49 graph bindings specified in Documentation/devicetree/bindings/graph.txt.
|
| D | thine,thc63lvdm83d | 18 OFgraph bindings specified in Documentation/devicetree/bindings/graph.txt.
|
| D | ti,omap-dss.txt | 28 video ports is described in Documentation/devicetree/bindings/graph.txt,
|
| /linux-4.1.27/drivers/iio/adc/ |
| D | qcom-spmi-vadc.c | 185 struct vadc_linear_graph graph[2]; member
421 vadc->graph[VADC_CALIB_RATIOMETRIC].dx = VADC_RATIOMETRIC_RANGE_UV; in vadc_measure_ref_points()
422 vadc->graph[VADC_CALIB_ABSOLUTE].dx = VADC_ABSOLUTE_RANGE_UV; in vadc_measure_ref_points()
443 vadc->graph[VADC_CALIB_ABSOLUTE].dy = read_1 - read_2; in vadc_measure_ref_points()
444 vadc->graph[VADC_CALIB_ABSOLUTE].gnd = read_2; in vadc_measure_ref_points()
462 vadc->graph[VADC_CALIB_RATIOMETRIC].dy = read_1 - read_2; in vadc_measure_ref_points()
463 vadc->graph[VADC_CALIB_RATIOMETRIC].gnd = read_2; in vadc_measure_ref_points()
477 voltage = adc_code - vadc->graph[prop->calibration].gnd; in vadc_calibrate()
478 voltage *= vadc->graph[prop->calibration].dx; in vadc_calibrate()
479 voltage = div64_s64(voltage, vadc->graph[prop->calibration].dy); in vadc_calibrate()
[all …]
|
| /linux-4.1.27/Documentation/sound/alsa/soc/ |
| D | DPCM.txt | 14 graph representing the DSP internal audio paths and uses the mixer settings to
119 3) Define widget graph connections.
257 3 Widget graph connections
260 The BE DAI links will normally be connected to the graph at initialisation time
278 2) DAPM graph showing DSP audio routing from FE DAIs to BEs.
280 3) DAPM widgets from DSP graph.
295 The BE AIF are used to connect the DSP graph to the graphs for the other
296 component drivers (e.g. codec graph).
326 is enabled or disabled by the state of the DAPM graph. This usually means
331 graph. Control is then carried out by the FE as regular PCM operations.
[all …]
|
| D | platform.txt | 74 1) DAPM graph
|
| D | dapm.txt | 268 Endpoints are added to the DAPM graph so that their usage can be determined in
|
| /linux-4.1.27/Documentation/ |
| D | media-framework.txt | 21 modelled as an oriented graph of building blocks called entities connected
224 The media framework provides APIs to iterate over entities in a graph.
236 Drivers might also need to iterate over all entities in a graph that can be
238 framework provides a depth-first graph traversal API for that purpose.
241 supported by the graph traversal API. To prevent infinite loops, the graph
245 Drivers initiate a graph traversal by calling
247 media_entity_graph_walk_start(struct media_entity_graph *graph,
250 The graph structure, provided by the caller, is initialized to start graph
255 media_entity_graph_walk_next(struct media_entity_graph *graph);
257 When the graph traversal is complete the function will return NULL.
[all …]
|
| D | clk.txt | 124 The call graph for clk_enable is very simple:
|
| D | kernel-parameters.txt | 1174 by the function graph tracer at boot up.
|
| /linux-4.1.27/Documentation/devicetree/bindings/drm/atmel/ |
| D | hlcdc-dc.txt | 15 to external devices using the OF graph reprensentation (see ../graph.txt).
|
| /linux-4.1.27/include/media/ |
| D | media-entity.h | 147 void media_entity_graph_walk_start(struct media_entity_graph *graph,
150 media_entity_graph_walk_next(struct media_entity_graph *graph);
|
| /linux-4.1.27/tools/perf/Documentation/ |
| D | perf-top.txt | 161 Enables call-graph (stack chain/backtrace) recording.
163 --call-graph::
164 Setup and enable call-graph (stack chain/backtrace) recording,
170 and will be sorted on the data. It requires -g/--call-graph option
184 function into one place in the call-graph tree.
|
| D | perf-report.txt | 168 --call-graph::
173 - graph: use a graph tree, displaying absolute overhead rates.
174 - fractal: like graph, but displays relative rates. Each branch of
178 - callee: callee based call graph.
179 - caller: inverted caller based call graph.
207 alias for inverted caller based call graph.
212 function into one place in the call-graph tree.
|
| D | perf-record.txt | 117 Enables call-graph (stack chain/backtrace) recording.
119 --call-graph::
120 Setup and enable call-graph (stack chain/backtrace) recording,
|
| D | perf-timechart.txt | 94 Do call-graph (stack chain/backtrace) recording
|
| D | examples.txt | 119 Furthermore, call-graph sampling can be done too, of page
|
| D | perf-script.txt | 182 --hide-call-graph::
|
| /linux-4.1.27/Documentation/devicetree/bindings/ |
| D | graph.txt | 9 arbitrarily complex graph.
10 There already is a simple directed graph between devices tree nodes using
13 tree graph bindings described herein abstract more complex devices that can
|
| /linux-4.1.27/drivers/staging/media/omap4iss/ |
| D | iss.c | 394 struct media_entity_graph graph; in iss_pipeline_pm_use_count() local
397 media_entity_graph_walk_start(&graph, entity); in iss_pipeline_pm_use_count()
399 while ((entity = media_entity_graph_walk_next(&graph))) { in iss_pipeline_pm_use_count()
454 struct media_entity_graph graph; in iss_pipeline_pm_power() local
461 media_entity_graph_walk_start(&graph, entity); in iss_pipeline_pm_power()
463 while (!ret && (entity = media_entity_graph_walk_next(&graph))) in iss_pipeline_pm_power()
470 media_entity_graph_walk_start(&graph, first); in iss_pipeline_pm_power()
472 while ((first = media_entity_graph_walk_next(&graph)) in iss_pipeline_pm_power()
|
| D | iss_video.c | 208 struct media_entity_graph graph; in iss_video_far_end() local
214 media_entity_graph_walk_start(&graph, entity); in iss_video_far_end()
216 while ((entity = media_entity_graph_walk_next(&graph))) { in iss_video_far_end()
824 struct media_entity_graph graph; in iss_video_streamon() local
855 media_entity_graph_walk_start(&graph, entity); in iss_video_streamon()
856 while ((entity = media_entity_graph_walk_next(&graph))) in iss_video_streamon()
|
| /linux-4.1.27/Documentation/devicetree/bindings/drm/imx/ |
| D | ldb.txt | 47 Each LVDS Channel has to contain either an of graph link to a panel device node
54 Documentation/devicetree/bindings/graph.txt.
93 /* Using an of-graph endpoint link to connect the panel */
|
| /linux-4.1.27/drivers/staging/media/davinci_vpfe/ |
| D | vpfe_video.c | 139 struct media_entity_graph graph; in vpfe_prepare_pipeline() local
150 media_entity_graph_walk_start(&graph, entity); in vpfe_prepare_pipeline()
151 while ((entity = media_entity_graph_walk_next(&graph))) { in vpfe_prepare_pipeline()
283 struct media_entity_graph graph; in vpfe_pipeline_enable() local
296 media_entity_graph_walk_start(&graph, entity); in vpfe_pipeline_enable()
297 while ((entity = media_entity_graph_walk_next(&graph))) { in vpfe_pipeline_enable()
323 struct media_entity_graph graph; in vpfe_pipeline_disable() local
336 media_entity_graph_walk_start(&graph, entity); in vpfe_pipeline_disable()
338 while ((entity = media_entity_graph_walk_next(&graph))) { in vpfe_pipeline_disable()
|
| /linux-4.1.27/Documentation/devicetree/bindings/drm/armada/ |
| D | marvell,dove-lcd.txt | 7 - port: video output port with endpoints, as described by graph.txt
|
| /linux-4.1.27/Documentation/devicetree/bindings/arm/ |
| D | coresight.txt | 31 layout using the generic DT graph presentation found in
32 "bindings/graph.txt".
|
| D | idle-states.txt | 119 characterised by the following graph:
143 The graph is split in two parts delimited by time 1ms on the X-axis.
144 The graph curve with X-axis values = { x | 0 < x < 1ms } has a steep slope
147 The graph curve in the area delimited by X-axis values = {x | x > 1ms } has
154 way to visualise this, is by taking the same graph above and comparing some
185 In graph 2 above, that takes into account idle states entry/exit energy
|
| /linux-4.1.27/tools/perf/ui/ |
| D | browser.h | 40 void ui_browser__write_graph(struct ui_browser *browser, int graph);
|
| D | browser.c | 614 int graph) in ui_browser__write_graph() argument
617 SLsmg_write_char(graph); in ui_browser__write_graph()
|
| /linux-4.1.27/drivers/media/platform/omap3isp/ |
| D | isp.c | 690 struct media_entity_graph graph; in isp_pipeline_pm_use_count() local
693 media_entity_graph_walk_start(&graph, entity); in isp_pipeline_pm_use_count()
695 while ((entity = media_entity_graph_walk_next(&graph))) { in isp_pipeline_pm_use_count()
749 struct media_entity_graph graph; in isp_pipeline_pm_power() local
756 media_entity_graph_walk_start(&graph, entity); in isp_pipeline_pm_power()
758 while (!ret && (entity = media_entity_graph_walk_next(&graph))) in isp_pipeline_pm_power()
765 media_entity_graph_walk_start(&graph, first); in isp_pipeline_pm_power()
767 while ((first = media_entity_graph_walk_next(&graph)) in isp_pipeline_pm_power()
|
| D | ispvideo.c | 227 struct media_entity_graph graph; in isp_video_get_graph_data() local
233 media_entity_graph_walk_start(&graph, entity); in isp_video_get_graph_data()
235 while ((entity = media_entity_graph_walk_next(&graph))) { in isp_video_get_graph_data()
|
| /linux-4.1.27/drivers/media/platform/xilinx/ |
| D | xilinx-dma.c | 182 struct media_entity_graph graph; in xvip_pipeline_validate() local
191 media_entity_graph_walk_start(&graph, entity); in xvip_pipeline_validate()
193 while ((entity = media_entity_graph_walk_next(&graph))) { in xvip_pipeline_validate()
|
| /linux-4.1.27/Documentation/locking/ |
| D | ww-mutex-design.txt | 210 e.g. when adjusting edges in a graph where each node has its own ww_mutex lock,
214 a graph from a starting point and then iteratively discovering new edges and
217 held there's no need for additional book-keeping to break cycles in the graph
269 /* magic code which walks over a graph and decides which objects
|
| D | lockstat.txt | 16 The graph below shows the relation between the lock functions and the various
|
| D | lockdep-design.txt | 264 likely to be linked into the lock-dependency graph. This turns out to
|
| /linux-4.1.27/drivers/media/platform/exynos4-is/ |
| D | media-dev.c | 1053 struct media_entity_graph graph; in __fimc_md_modify_pipelines() local
1062 media_entity_graph_walk_start(&graph, entity); in __fimc_md_modify_pipelines()
1064 while ((entity = media_entity_graph_walk_next(&graph))) { in __fimc_md_modify_pipelines()
1076 media_entity_graph_walk_start(&graph, entity_err); in __fimc_md_modify_pipelines()
1078 while ((entity_err = media_entity_graph_walk_next(&graph))) { in __fimc_md_modify_pipelines()
|
| /linux-4.1.27/arch/x86/ |
| D | Makefile_32.cpu | 50 # prologue (push %ebp, mov %esp, %ebp) which breaks the function graph
|
| /linux-4.1.27/drivers/media/platform/vsp1/ |
| D | vsp1_video.c | 410 struct media_entity_graph graph; in vsp1_pipeline_validate() local
419 media_entity_graph_walk_start(&graph, entity); in vsp1_pipeline_validate()
421 while ((entity = media_entity_graph_walk_next(&graph))) { in vsp1_pipeline_validate()
|
| /linux-4.1.27/Documentation/trace/ |
| D | ftrace.txt | 210 with the function graph tracer (See the section
245 tracer, or if enabled, the function graph tracer. It will
247 and if run with the function graph tracer, it will also keep
267 Used with the function graph tracer. This is the max depth
495 whereas the function graph tracer traces on both entry
497 to draw a graph of function calls similar to C code
726 graph-time
842 sleep-time - When running function graph tracer, to include
847 graph-time - When running function graph tracer, to include the
1858 function graph tracer
[all …]
|
| D | ftrace-design.txt | 109 mcount function to check ftrace graph function pointers, as well as implement
|
| /linux-4.1.27/sound/soc/intel/haswell/ |
| D | sst-haswell-pcm.c | 1039 static const struct snd_soc_dapm_route graph[] = { variable
1147 .dapm_routes = graph,
1148 .num_dapm_routes = ARRAY_SIZE(graph),
|
| /linux-4.1.27/Documentation/scheduler/ |
| D | sched-nice-design.txt | 16 understand it, the timeslice graph went like this (cheesy ASCII art
|
| /linux-4.1.27/Documentation/filesystems/ |
| D | directory-locking | 120 implementation assumes that directory graph is a tree. This assumption is
|
| /linux-4.1.27/Documentation/i2c/ |
| D | slave-interface | 12 bus driver communicate via events. Here is a small graph visualizing the data
|
| /linux-4.1.27/Documentation/cpu-freq/ |
| D | governors.txt | 58 Basically, it's the following flow graph:
|
| /linux-4.1.27/Documentation/hid/ |
| D | hid-transport.txt | 48 Everything below "HID Core" is simplified in this graph as it is only of
|
| /linux-4.1.27/Documentation/devicetree/ |
| D | usage-model.txt | 19 Structurally, the DT is a tree, or acyclic graph with named nodes, and
|
| /linux-4.1.27/Documentation/sound/alsa/ |
| D | HD-Audio.txt | 801 Codecgraph is a utility program to generate a graph and visualizes the
|