Home
last modified time | relevance | path

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

123456

/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/openbmc/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 …]
/openbmc/qemu/scripts/
H A Drender_block_graph.py3 # Render Qemu Block Graph
42 Render graph in text (dot) representation into "@filename" and
52 block_graph = qmp.cmd('x-debug-query-block-graph')
54 graph = Digraph(comment='Block Nodes Graph')
55 graph.format = format
56 graph.node('permission symbols:\l'
60 ' g - Graph-mod\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)
/openbmc/qemu/include/block/
H A Dgraph-lock.h2 * Graph lock: rwlock to protect block layer graph manipulations (add/remove
24 * Graph Lock API
26 * graph modifications like edge (BdrvChild) and node (BlockDriverState)
32 * graph, and readers (all other coroutines running in various AioContext),
33 * that go through the graph edges, reading
41 * access the graph as long the writer is not modifying the graph.
91 * currently running the graph.
103 * Start an exclusive write operation to modify the graph. This means we are
104 * adding or removing an edge or a node in the block layer graph. Nobody else
105 * is allowed to access the graph.
[all …]
/openbmc/ipmitool/contrib/
H A Dcreate_webpage_compact.sh25 # Size of graph area (excluding title, legends etc.)
108 <RRD::GRAPH "$img_dir/$hostname-$group-daily.gif"
112 --title "Daily graph"
121 <RRD::GRAPH "$img_dir/$hostname-$group-weekly.gif"
126 --title "Weelky graph"
135 <RRD::GRAPH "$img_dir/$hostname-$group-monthly.gif"
140 --title "Monthly graph"
H A Dcreate_webpage.sh25 # Size of graph area (excluding title, legends etc.)
168 <RRD::GRAPH "$img_dir/$hostname-$group-daily.gif"
172 --title "Daily graph"
181 <RRD::GRAPH "$img_dir/$hostname-$group-weekly.gif"
186 --title "Weelky graph"
195 <RRD::GRAPH "$img_dir/$hostname-$group-monthly.gif"
200 --title "Monthly graph"
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/qemu/tests/qemu-iotests/
H A D25853 # Finds a node in the debug block graph
54 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'
H A D27341 # External data files would add nodes to the block graph, so it would
74 {"execute":"x-debug-query-block-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/qemu/tests/rocker/
H A Dtut.dot1 graph G {
2 graph [hostidtype="hostname", version="1:0", date="04/12/2013"];
/openbmc/qemu/tests/unit/
H A Dtest-bdrv-graph-mod.c2 * Block node graph modifications tests
91 * its neighbors, we can finish up with wrong permission graph.
93 * This test firstly create the following graph:
156 * do the right thing, i.e. not creating loops on the graph.
159 * 1. initial graph:
173 * as it will create a loop on node graph. Resulting picture should
421 * So, inserting such filter should do all graph modifications and only then
451 g_test_add_func("/bdrv-graph-mod/update-perm-tree", test_update_perm_tree); in main()
452 g_test_add_func("/bdrv-graph-mod/should-update-child", in main()
454 g_test_add_func("/bdrv-graph-mod/parallel-perm-update", in main()
[all …]
/openbmc/phosphor-dbus-monitor/src/test/templates/
H A Dconditiongentest.mako.hpp7 <% graphs = [ x for x in callbacks if hasattr(x, 'graph')] %>\
10 ${g.graph},
/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/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/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/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/qemu/block/
H A Dgraph-lock.c2 * Graph lock: rwlock to protect block layer graph manipulations (add/remove
23 #include "block/graph-lock.h"
62 /* How many readers are currently reading the graph. */
66 * List of BdrvGraphRWlock kept in graph-lock.c
185 /* Wake up all coroutines that are waiting to read the graph */ in bdrv_graph_wrunlock()
/openbmc/pldm/tools/visualize-pdr/
H A DREADME.md17 - Graphviz is open source graph visualization software. Graph visualization is
/openbmc/qemu/tests/qemu-iotests/tests/
H A Dimage-fleecing.out11 --- Setting up Fleecing Graph ---
80 --- Setting up Fleecing Graph ---
150 --- Setting up Fleecing Graph ---
222 --- Setting up Fleecing Graph ---
306 --- Setting up Fleecing Graph ---
/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/qemu/tests/qtest/libqos/
H A Dqgraph_internal.h53 /* Graph Node */
56 bool available; /* set by QEMU via QMP, used during graph walk */
57 bool visited; /* used during graph walk */
216 * qos_print_graph(): walks the graph and prints
/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

123456