Home
last modified time | relevance | path

Searched full:graph (Results 1 – 25 of 762) sorted by relevance

12345678910>>...31

/OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-kernel/pm-graph/pm-graph/
H A D0001-Makefile-fix-multilib-build-failure.patch30 - install -d $(DESTDIR)$(PREFIX)/lib/pm-graph
31 - install sleepgraph.py $(DESTDIR)$(PREFIX)/lib/pm-graph
32 - install bootgraph.py $(DESTDIR)$(PREFIX)/lib/pm-graph
33 - install -d $(DESTDIR)$(PREFIX)/lib/pm-graph/config
34 - install -m 644 config/cgskip.txt $(DESTDIR)$(PREFIX)/lib/pm-graph/config
35 - install -m 644 config/freeze-callgraph.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
36 - install -m 644 config/freeze.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
37 - install -m 644 config/freeze-dev.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
38 - install -m 644 config/standby-callgraph.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
39 - install -m 644 config/standby.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
[all …]
/OK3568_Linux_fs/kernel/tools/power/pm-graph/
H A DMakefile9 install -d $(DESTDIR)$(PREFIX)/lib/pm-graph
10 install sleepgraph.py $(DESTDIR)$(PREFIX)/lib/pm-graph
11 install bootgraph.py $(DESTDIR)$(PREFIX)/lib/pm-graph
12 install -d $(DESTDIR)$(PREFIX)/lib/pm-graph/config
13 install -m 644 config/cgskip.txt $(DESTDIR)$(PREFIX)/lib/pm-graph/config
14 install -m 644 config/freeze-callgraph.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
15 install -m 644 config/freeze.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
16 install -m 644 config/freeze-dev.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
17 install -m 644 config/standby-callgraph.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
18 install -m 644 config/standby.cfg $(DESTDIR)$(PREFIX)/lib/pm-graph/config
[all …]
/OK3568_Linux_fs/kernel/drivers/media/mc/
H A Dmc-entity.c228 * Graph traversal
241 static void stack_push(struct media_graph *graph, in stack_push() argument
244 if (graph->top == MEDIA_ENTITY_ENUM_MAX_DEPTH - 1) { in stack_push()
248 graph->top++; in stack_push()
249 graph->stack[graph->top].link = entity->links.next; in stack_push()
250 graph->stack[graph->top].entity = entity; in stack_push()
253 static struct media_entity *stack_pop(struct media_graph *graph) in stack_pop() argument
257 entity = graph->stack[graph->top].entity; in stack_pop()
258 graph->top--; in stack_pop()
267 * media_graph_walk_init - Allocate resources for graph walk
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/lib/gcc/arm-none-linux-gnueabihf/10.3.1/plugin/include/
H A Dgraphds.h1 /* Graph representation.
23 /* Structure representing edge of a graph. */
33 /* Structure representing vertex of a graph. */
45 /* Structure representing a graph. */
47 struct graph struct
54 struct graph *new_graph (int); argument
55 void dump_graph (FILE *, struct graph *);
56 struct graph_edge *add_edge (struct graph *, int, int);
57 void identify_vertices (struct graph *, int, int);
59 int graphds_dfs (struct graph *, int *, int,
[all …]
H A Dshortest-paths.h26 /* A record of the shortest path to each node in an graph
40 shortest_paths (const graph_t &graph, const node_t *origin);
60 to give the shortest path to any node in GRAPH from ORIGIN. */
64 shortest_paths<GraphTraits, Path_t>::shortest_paths (const graph_t &graph, in shortest_paths() argument
66 : m_graph (graph), in shortest_paths()
67 m_dist (graph.m_nodes.length ()), in shortest_paths()
68 m_prev (graph.m_nodes.length ()) in shortest_paths()
72 auto_vec<int> queue (graph.m_nodes.length ()); in shortest_paths()
74 for (unsigned i = 0; i < graph.m_nodes.length (); i++) in shortest_paths()
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dgraphds.h1 /* Graph representation.
23 /* Structure representing edge of a graph. */
33 /* Structure representing vertex of a graph. */
45 /* Structure representing a graph. */
47 struct graph struct
54 struct graph *new_graph (int); argument
55 void dump_graph (FILE *, struct graph *);
56 struct graph_edge *add_edge (struct graph *, int, int);
57 void identify_vertices (struct graph *, int, int);
59 int graphds_dfs (struct graph *, int *, int,
[all …]
H A Dshortest-paths.h26 /* A record of the shortest path to each node in an graph
40 shortest_paths (const graph_t &graph, const node_t *origin);
60 to give the shortest path to any node in GRAPH from ORIGIN. */
64 shortest_paths<GraphTraits, Path_t>::shortest_paths (const graph_t &graph, in shortest_paths() argument
66 : m_graph (graph), in shortest_paths()
67 m_dist (graph.m_nodes.length ()), in shortest_paths()
68 m_prev (graph.m_nodes.length ()) in shortest_paths()
72 auto_vec<int> queue (graph.m_nodes.length ()); in shortest_paths()
74 for (unsigned i = 0; i < graph.m_nodes.length (); i++) in shortest_paths()
/OK3568_Linux_fs/kernel/drivers/hwtracing/coresight/
H A Dcoresight-platform.c95 * if the device doesn't have any graph connections in of_coresight_get_ports_legacy()
351 /* ACPI Graph _DSD UUID : "ab02a46b-74c7-45a2-bd68-f7d344ef2153" */
355 /* Coresight ACPI Graph UUID : "3ecbc8b6-1d0e-4fb3-8107-e627f805c6cd" */
408 * acpi_validate_dsd_graph - Make sure the given _DSD graph conforms
409 * to the ACPI _DSD Graph specification.
411 * ACPI Devices Graph property has the following format:
415 * Graph[1],
417 * Graph[N]
420 * And each Graph entry has the following format:
422 * GraphID - Integer, identifying a graph the device belongs to.
[all …]
/OK3568_Linux_fs/buildroot/docs/manual/
H A Dcommon-usage.txt101 * +BR2_GRAPH_DEPS_OPTS+ to pass extra options to the dependency graph; see
102 xref:graph-depends[] for the accepted options
104 draw the dependency graph.
105 * +BR2_GRAPH_SIZE_OPTS+ to pass extra options to the size graph; see
106 xref:graph-size[] for the acepted options
185 [[graph-depends]]
198 To generate a dependency graph of the full system you have compiled,
202 make graph-depends
205 You will find the generated graph in
206 +output/graphs/graph-depends.pdf+.
[all …]
/OK3568_Linux_fs/kernel/lib/
H A Dobjagg.c710 static int objagg_tmp_graph_edge_index(struct objagg_tmp_graph *graph, in objagg_tmp_graph_edge_index() argument
713 return index * graph->nodes_count + parent_index; in objagg_tmp_graph_edge_index()
716 static void objagg_tmp_graph_edge_set(struct objagg_tmp_graph *graph, in objagg_tmp_graph_edge_set() argument
719 int edge_index = objagg_tmp_graph_edge_index(graph, index, in objagg_tmp_graph_edge_set()
722 __set_bit(edge_index, graph->edges); in objagg_tmp_graph_edge_set()
725 static bool objagg_tmp_graph_is_edge(struct objagg_tmp_graph *graph, in objagg_tmp_graph_is_edge() argument
728 int edge_index = objagg_tmp_graph_edge_index(graph, index, in objagg_tmp_graph_is_edge()
731 return test_bit(edge_index, graph->edges); in objagg_tmp_graph_is_edge()
734 static unsigned int objagg_tmp_graph_node_weight(struct objagg_tmp_graph *graph, in objagg_tmp_graph_node_weight() argument
737 struct objagg_tmp_node *node = &graph->nodes[index]; in objagg_tmp_graph_node_weight()
[all …]
/OK3568_Linux_fs/kernel/include/media/
H A Dmedia-entity.h25 * enum media_gobj_type - type of a graph object
44 /* Structs to represent the objects that belong to a media graph */
47 * struct media_gobj - Define a graph object.
56 * All objects on the media graph should have this struct embedded
79 * struct media_graph - Media graph traversal state
81 * @stack: Graph traversal stack; the stack contains information
84 * @stack.entity: pointer to &struct media_entity at the graph.
103 * @graph: Media graph walk during pipeline start / stop
107 struct media_graph graph; member
111 * struct media_link - A link object part of a media graph.
[all …]
/OK3568_Linux_fs/yocto/poky/scripts/contrib/
H A Dgraph-tool3 # Simple graph query utility
29 graph = networkx.DiGraph(networkx.nx_pydot.read_dot(dotfile))
32 close_matches = difflib.get_close_matches(node, graph.nodes(), cutoff=0.7)
34 … print('ERROR: no node "%s" in graph. Close matches:\n %s' % (node, '\n '.join(close_matches)))
37 if not fromnode in graph:
39 if not tonode in graph:
41 return networkx.all_simple_paths(graph, source=fromnode, target=tonode)
49 print("ERROR: no path from %s to %s in graph" % (args.fromnode, args.tonode))
88 … parser = argparse_oe.ArgumentParser(description='Small utility for working with .dot graph files')
94 … help='Find all of the paths between two nodes in a dot graph',
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/man/man1/
H A Daarch64-none-linux-gnu-gprof.1142 gprof \- display call graph profile data
150 [ \-\-[no\-]flat\-profile[=\fIname\fR] ] [ \-\-[no\-]graph[=\fIname\fR] ]
157 [ \-\-separate\-files ] [ \-\-static\-call\-graph ] [ \-\-sum ]
167 of each caller. The profile data is taken from the call graph profile file
174 its symbol table and the call graph profile from \fIgmon.out\fR.
179 Next, these times are propagated along the edges of the call graph.
189 The \fIcall graph\fR shows, for each function, which functions called it, which
209 which prints a flat profile and call graph analysis
258 call graph, and basic-block count records is displayed.
325 .IX Item "--graph[=symspec]"
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/man/man1/
H A Darm-none-linux-gnueabihf-gprof.1142 gprof \- display call graph profile data
150 [ \-\-[no\-]flat\-profile[=\fIname\fR] ] [ \-\-[no\-]graph[=\fIname\fR] ]
157 [ \-\-separate\-files ] [ \-\-static\-call\-graph ] [ \-\-sum ]
167 of each caller. The profile data is taken from the call graph profile file
174 its symbol table and the call graph profile from \fIgmon.out\fR.
179 Next, these times are propagated along the edges of the call graph.
189 The \fIcall graph\fR shows, for each function, which functions called it, which
209 which prints a flat profile and call graph analysis
258 call graph, and basic-block count records is displayed.
325 .IX Item "--graph[=symspec]"
[all …]
/OK3568_Linux_fs/buildroot/support/scripts/
H A Dgraph-depends4 # ./support/scripts/graph-depends [-p package-name] > test.dot
7 # With no arguments, graph-depends will draw a complete graph of
9 # If '-p <package-name>' is specified, graph-depends will draw a graph
11 # If '-d <depth>' is specified, graph-depends will limit the depth of
12 # the dependency graph to 'depth' levels.
18 # openssl if openssl has been enabled. This tool will graph the
33 MODE_FULL = 1 # draw full dependency graph for all selected packages
34 MODE_PKG = 2 # draw dependency graph for a given package
117 # to trim when generating the dependency graph.
165 # reverse graph, because mandatory deps are only direct deps.
[all …]
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/sound/
H A Daudio-graph-card.txt1 Audio Graph Card:
3 Audio Graph Card specifies audio DAI connections of SoC <-> codec.
5 see ${LINUX}/Documentation/devicetree/bindings/graph.txt
7 Basically, Audio Graph Card property is same as Simple Card.
29 - compatible : "audio-graph-card";
40 compatible = "audio-graph-card";
71 compatible = "audio-graph-card";
143 compatible = "audio-graph-card";
180 compatible = "audio-graph-card";
193 audio-graph-card,prefix = "codec";
[all …]
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/deps/boost/1.65.1/include/boost/geometry/algorithms/detail/is_valid/
H A Ddebug_complement_graph.hpp28 complement_graph<TurnPoint> const& graph) in debug_print_complement_graph() argument
32 os << "num rings: " << graph.m_num_rings << std::endl; in debug_print_complement_graph()
34 for (vertex_handle it = graph.m_vertices.begin(); in debug_print_complement_graph()
35 it != graph.m_vertices.end(); ++it) in debug_print_complement_graph()
41 for (vertex_handle it = graph.m_vertices.begin(); in debug_print_complement_graph()
42 it != graph.m_vertices.end(); ++it) in debug_print_complement_graph()
49 nit = graph.m_neighbors[it->id()].begin(); in debug_print_complement_graph()
50 nit != graph.m_neighbors[it->id()].end(); ++nit) in debug_print_complement_graph()
/OK3568_Linux_fs/yocto/meta-openembedded/meta-oe/recipes-support/lcov/files/
H A D0001-geninfo-Add-intermediate-text-format-support.patch131 $type = "graph";
160 - $base_dir = find_base_from_graph($base_dir, $instr, $graph);
162 + [ keys(%{$instr}), keys(%{$graph}) ]);
165 - ($instr, $graph) = adjust_graph_filenames($base_dir, $instr, $graph);
167 + adjust_source_filenames($graph, $base_dir);
170 # from $da_dir if the graph file is just a link to the "real" object
348 +# Create output for a single file (either a data file or a graph file) using
373 + # Process graph file - copy to temp directory to prevent
407 + # Remove graph file copy
642 my ($instr, $graph) = @_;
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/doc/gprof.html/
H A DPrimary.html26 <link href="Call-Graph.html#Call-Graph" rel="up" title="Call Graph">
28 <link href="Call-Graph.html#Call-Graph" rel="previous" title="Call Graph">
65 …y="n" rel="next">Callers</a>, Up: <a href="Call-Graph.html#Call-Graph" accesskey="u" rel="up">Call…
71 <p>The <em>primary line</em> in a call graph entry is the line that
151 …y="n" rel="next">Callers</a>, Up: <a href="Call-Graph.html#Call-Graph" accesskey="u" rel="up">Call…
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/doc/gprof.html/
H A DPrimary.html26 <link href="Call-Graph.html#Call-Graph" rel="up" title="Call Graph">
28 <link href="Call-Graph.html#Call-Graph" rel="previous" title="Call Graph">
65 …y="n" rel="next">Callers</a>, Up: <a href="Call-Graph.html#Call-Graph" accesskey="u" rel="up">Call…
71 <p>The <em>primary line</em> in a call graph entry is the line that
151 …y="n" rel="next">Callers</a>, Up: <a href="Call-Graph.html#Call-Graph" accesskey="u" rel="up">Call…
/OK3568_Linux_fs/kernel/tools/perf/Documentation/
H A Dperf-config.txt112 [call-graph]
115 print-type = graph
148 To query the record mode of call graph, do
150 % perf config call-graph.record-mode
154 % perf config report.queue-size call-graph.order report.children
156 To query the config value of sort order of call graph in user config file (i.e. `~/.perfconfig`), do
158 % perf config --user call-graph.sort-order
412 call-graph.*::
414 -g/--call-graph options).
416 call-graph.record-mode::
[all …]
/OK3568_Linux_fs/kernel/drivers/iio/adc/
H A Dsc27xx_adc.c92 * through 2 points in the linear graph. If the voltage is less than 1.2v, we
93 * should use the small-scale graph, and if more than 1.2v, we should use the
94 * big-scale graph.
125 struct sc27xx_adc_linear_graph *graph; in sc27xx_adc_scale_calibration() local
134 graph = &big_scale_graph; in sc27xx_adc_scale_calibration()
138 graph = &small_scale_graph; in sc27xx_adc_scale_calibration()
154 /* Only need to calibrate the adc values in the linear graph. */ in sc27xx_adc_scale_calibration()
155 graph->adc0 = sc27xx_adc_get_calib_data(calib_data, calib_graph->adc0); in sc27xx_adc_scale_calibration()
156 graph->adc1 = sc27xx_adc_get_calib_data(calib_data >> 8, in sc27xx_adc_scale_calibration()
271 static int sc27xx_adc_to_volt(struct sc27xx_adc_linear_graph *graph, in sc27xx_adc_to_volt() argument
[all …]
/OK3568_Linux_fs/kernel/Documentation/devicetree/bindings/display/rockchip/
H A Drockchip,rk618.txt18 The connections to the video ports are modeled using the OF graph
19 bindings specified in Documentation/devicetree/bindings/graph.txt.
69 The connections to the video ports are modeled using the OF graph
70 bindings specified in Documentation/devicetree/bindings/graph.txt.
123 The connections to the video ports are modeled using the OF graph
124 bindings specified in Documentation/devicetree/bindings/graph.txt.
174 The connections to the video ports are modeled using the OF graph
175 bindings specified in Documentation/devicetree/bindings/graph.txt.
230 The connections to the video ports are modeled using the OF graph
231 bindings specified in Documentation/devicetree/bindings/graph.txt.
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/share/info/
H A Dgprof.info94 The "call graph" shows, for each function, which functions called it,
98 that use a lot of time. *Note The Call Graph: Call Graph.
135 well as your link options. If it is not then no call-graph data will be
139 gprof: gmon.out file is missing call-graph data
141 If you add the '-Q' switch to suppress the printing of the call graph
182 greatly reduce the usefulness of the call graph.
262 profile and a call graph on standard output. Typically you would
306 which prints a flat profile and call graph analysis for all functions.
335 call graph, and basic-block count records is displayed.
371 '--graph[=SYMSPEC]'
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/arm/gcc-arm-10.3-2021.07-x86_64-arm-none-linux-gnueabihf/share/info/
H A Dgprof.info94 The "call graph" shows, for each function, which functions called it,
98 that use a lot of time. *Note The Call Graph: Call Graph.
135 well as your link options. If it is not then no call-graph data will be
139 gprof: gmon.out file is missing call-graph data
141 If you add the '-Q' switch to suppress the printing of the call graph
182 greatly reduce the usefulness of the call graph.
262 profile and a call graph on standard output. Typically you would
306 which prints a flat profile and call graph analysis for all functions.
335 call graph, and basic-block count records is displayed.
371 '--graph[=SYMSPEC]'
[all …]

12345678910>>...31