Searched refs:graph (Results 1 - 6 of 6) sorted by relevance

/gem5/util/stats/
H A Dstats.py248 if not options.graph:
269 if options.graph:
270 output.graph(stat.name, options.graphdir)
289 if options.graph:
290 output.graph(command, options.graphdir, proxy)
424 options.graph = False
442 options.graph = True;
H A Dprofile.py398 graph = None
427 graph = a
475 if graph:
486 output.graph(name, graph)
498 if not graph and not textout and not dodot:
H A Dbarchart.py59 # graph function takes because it is intuitive. The conversion
151 def graph(self): member in class:BarChart
327 chart1.graph()
337 chart2.graph()
H A Doutput.py65 def graph(self, name, graphdir, proxy=None): member in class:StatOutput
97 raise AttributeError, 'No group selected for graph bars'
189 chart.graph()
/gem5/ext/googletest/googlemock/src/
H A Dgmock-matchers.cc144 // Neither the flow graph nor the residual flow graph are represented
145 // explicitly. Instead, they are implied by the information in 'graph' and
148 // where the flow graph is empty, and the residual flow graph has the
153 // corresponding edge exists in 'graph'.
158 // flow graph.
159 // - The same three edges are removed from the residual flow graph.
161 // to the residual flow graph, which is a directional graph
200 MaxBipartiteMatchState(const MatchMatrix& graph) argument
[all...]
/gem5/ext/googletest/googlemock/test/
H A Dgmock-matchers_test.cc5104 MatchMatrix graph(nodes, nodes);
5107 internal::FindMaxBipartiteMatching(graph);
5108 EXPECT_EQ(FindBacktrackingMaxBPM(graph).size(), matches.size())
5109 << "graph: " << graph.DebugString();
5110 // Check that all elements of matches are in the graph.
5112 std::vector<bool> seen_element(graph.LhsSize());
5113 std::vector<bool> seen_matcher(graph.RhsSize());
5118 EXPECT_TRUE(graph.HasEdge(ilhs, irhs));
5124 } while (graph
[all...]

Completed in 32 milliseconds