Home
last modified time | relevance | path

Searched refs:graph (Results 1 – 25 of 72) sorted by relevance

123

/openbmc/openbmc/meta-openembedded/meta-oe/recipes-kernel/pm-graph/pm-graph/
H A D0001-Makefile-fix-multilib-build-failure.patch22 SHRDIR ?= /usr/share/pm-graph
36 $(INSTALL) -d $(DESTDIR)$(LIBDIR)/pm-graph
37 $(INSTALL) sleepgraph.py $(DESTDIR)$(LIBDIR)/pm-graph
42 - ln -s ../lib/pm-graph/bootgraph.py $(DESTDIR)$(BINDIR)/bootgraph
43 - ln -s ../lib/pm-graph/sleepgraph.py $(DESTDIR)$(BINDIR)/sleepgraph
44 - ln -s ../lib/pm-graph/netfix.py $(DESTDIR)$(BINDIR)/netfix
46 + ln -s ../$(BASELIB)/pm-graph/bootgraph.py $(DESTDIR)$(BINDIR)/bootgraph
47 + ln -s ../$(BASELIB)/pm-graph/sleepgraph.py $(DESTDIR)$(BINDIR)/sleepgraph
48 + ln -s ../$(BASELIB)/pm-graph/netfix.py $(DESTDIR)$(BINDIR)/netfix
54 rm -f $(DESTDIR)$(LIBDIR)/pm-graph/hwcheck.py
[all …]
/openbmc/qemu/scripts/
H A Drender_block_graph.py54 graph = Digraph(comment='Block Nodes Graph')
55 graph.format = format
56 graph.node('permission symbols:\l'
83 graph.node(str(n['id']), label, shape=shape)
88 graph.edge(str(e['parent']), str(e['child']), label=label)
90 graph.render(filename)
H A Ddecodetree.py94 def __init__(self, graph=None): argument
95 self.graph = graph
103 if not self.graph:
107 for k, v in self.graph.items():
507 graph = {}
510 graph[n] = refs
513 ts = TopologicalSorter(graph)
/openbmc/qemu/tests/qemu-iotests/
H A D25854 def find_graph_node(graph, node_id): argument
55 return next(node for node in graph['nodes'] if node['id'] == node_id)
144 graph = vm.qmp('x-debug-query-block-graph')['return']
145 for edge in graph['edges']:
147 find_graph_node(graph, edge['parent'])['name'] == 'node3':
148 assert find_graph_node(graph, edge['child'])['name'] == 'node0'
/openbmc/phosphor-dbus-monitor/src/
H A Dcallback.hpp143 graph(graphEntry) in GroupOfCallbacks()
149 for (auto e : graph) in operator ()()
157 const std::vector<size_t>& graph; member in phosphor::dbus::monitoring::GroupOfCallbacks
174 Conditional& cond) : graph(graphEntry), condition(cond) in ConditionalCallback()
182 (*CallbackAccess::get()[graph[0]])(ctx); in operator ()()
188 const std::vector<size_t>& graph; member in phosphor::dbus::monitoring::ConditionalCallback
/openbmc/openbmc/poky/scripts/contrib/
H A Dgraph-tool29 graph = networkx.DiGraph(networkx.nx_pydot.read_dot(dotfile))
32 close_matches = difflib.get_close_matches(node, graph.nodes(), cutoff=0.7)
37 if not fromnode in graph:
39 if not tonode in graph:
41 return networkx.all_simple_paths(graph, source=fromnode, target=tonode)
/openbmc/qemu/tests/rocker/
H A Dtut.dot1 graph G {
2 graph [hostidtype="hostname", version="1:0", date="04/12/2013"];
/openbmc/phosphor-dbus-monitor/src/templates/
H A Dconditional.mako.cpp3 ${indent(1)}ConfigPropertyCallbackGroups::get()[${c.graph}],
8 ${indent(1)}ConfigPropertyCallbackGroups::get()[${c.graph}],
H A Dcallbackpathgroup.mako.cpp2 ${indent(1)}ConfigPathCallbackGroups::get()[${c.graph}])\
H A Dcallbackgroup.mako.cpp2 ${indent(1)}ConfigPropertyCallbackGroups::get()[${c.graph}])\
/openbmc/openbmc/meta-openembedded/meta-oe/recipes-kernel/pm-graph/
H A Dpm-graph_5.13.bb4 HOMEPAGE = "https://01.org/pm-graph"
9 SRC_URI = "git://github.com/intel/pm-graph.git;branch=master;protocol=https \
29 rm -rf ${D}${libdir}/pm-graph/__pycache__
/openbmc/openbmc/meta-openembedded/meta-oe/recipes-support/opencv/
H A Dade_0.1.2.bb1 SUMMARY = "A graph construction, manipulation, and processing framework"
2 DESCRIPTION = "ADE Framework is a graph construction, manipulation, \
/openbmc/openbmc/poky/meta/lib/oeqa/core/decorator/
H A Ddepends.py44 def _dep_resolve(graph, node, resolved, seen): argument
46 for edge in graph[node]:
51 _dep_resolve(graph, edge, resolved, seen)
/openbmc/openbmc/meta-openembedded/meta-oe/recipes-support/mcelog/mce-test/
H A D0001-gcov_merge.py-scov_merge.py-switch-to-python3.patch24 # Merge gcov graph from several test cases. This can be used to check
53 - print 'Usage: %s <gcov graph files>' % (sys.argv[0])
54 + print('Usage: %s <gcov graph files>' % (sys.argv[0]))
/openbmc/openbmc/poky/meta/lib/oe/package_manager/deb/
H A Drootfs.py80 def _dep_resolve(graph, node, resolved, seen): argument
83 for edge in graph[node]:
89 _dep_resolve(graph, edge, resolved, seen)
/openbmc/phosphor-dbus-monitor/src/test/templates/
H A Dconditiongentest.mako.hpp10 ${g.graph},
/openbmc/qemu/qapi/
H A Dyank.json25 # Specifies which block graph node to yank. See `YankInstance` for
28 # @node-name: the name of the block graph node
/openbmc/openbmc/meta-openembedded/meta-oe/recipes-benchmark/lmbench/lmbench/
H A Dlmbench_result_html_report.patch4 Subject: [PATCH] lmbench: Fix "make html" graph failure
68 <img align=middle src=\"../gifs/graph.gif\">System results table of contents</a>
/openbmc/ipmitool/contrib/
H A DREADME54 img_dir Directory to store the graph images. This path must be within
65 graph_width Size of the graph area in pixels (excluding title, legends etc.)
86 collects all sensors that measure the same unit into the same graph thus
/openbmc/openbmc/poky/meta/lib/oe/package_manager/ipk/
H A Drootfs.py81 def _dep_resolve(graph, node, resolved, seen): argument
84 for edge in graph[node]:
90 _dep_resolve(graph, edge, resolved, seen)
/openbmc/u-boot/arch/arm/dts/
H A Duniphier-pxs2-vodka.dts35 compatible = "audio-graph-card";
H A Duniphier-pxs2-gentil.dts37 compatible = "audio-graph-card";
/openbmc/phosphor-dbus-interfaces/yaml/xyz/openbmc_project/Inventory/Item/
H A DREADME.md9 objects. A graph consisting of Inventory objects as vertices and Association as
/openbmc/openbmc/meta-openembedded/meta-oe/recipes-extended/rrdtool/
H A Drrdtool_1.9.0.bb29 PACKAGECONFIG ??= "perl graph ${@bb.utils.filter('DISTRO_FEATURES', 'systemd', d)}"
45 PACKAGECONFIG[graph] = "--enable-rrd_graph,--disable-rrd_graph,pango cairo"
/openbmc/openbmc/poky/documentation/
H A Dwhat-i-wish-id-known.rst104 #. **Know that you can generate a dependency graph and learn how to do it:**
105 A dependency graph shows dependencies between recipes, tasks, and targets.
106 You can use the "-g" option with BitBake to generate this graph. When you
109 dependency graph can clarify that confusion. You can learn more about
123 specify a user interface viewer into the dependency graph (e.g. knotty,
183 * generate and understand a dependency graph

123