| /external/skia/tests/ |
| TopoSortTest.cpp | 14 typedef void (*CreateGraphPF)(SkTDArray<sk_tool_utils::TopoTestNode*>* graph);
23 static void create_graph0(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) {
24 sk_tool_utils::TopoTestNode::AllocNodes(graph, 4);
26 (*graph)[0]->dependsOn((*graph)[1]);
27 (*graph)[0]->dependsOn((*graph)[2]);
28 (*graph)[1]->dependsOn((*graph)[3]);
29 (*graph)[2]->dependsOn((*graph)[3])
123 SkTDArray<sk_tool_utils::TopoTestNode*> graph; local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| graph_test.cc | 31 #include "ceres/graph.h"
40 TEST(Graph, EmptyGraph) {
41 Graph<int> graph; local
42 EXPECT_EQ(graph.vertices().size(), 0);
45 TEST(Graph, AddVertexAndEdge) {
46 Graph<int> graph; local
47 graph.AddVertex(0, 1.0);
48 graph.AddVertex(1, 2.0)
62 Graph<int> graph; local
87 Graph<int> graph; local
97 Graph<int> graph; local
[all...] |
| single_linkage_clustering_test.cc | 39 #include "ceres/graph.h"
46 Graph<int> graph; local
49 graph.AddVertex(i);
51 // Graph structure:
54 graph.AddEdge(0, 1, 1.0);
55 graph.AddEdge(1, 2, 1.0);
56 graph.AddEdge(2, 3, 1.0);
57 graph.AddEdge(4, 5, 1.0);
61 ComputeSingleLinkageClustering(options, graph, &membership)
73 Graph<int> graph; local
102 Graph<int> graph; local
[all...] |
| graph_algorithms_test.cc | 36 #include "ceres/graph.h"
44 Graph<int> graph; local
45 graph.AddVertex(0);
46 graph.AddVertex(1);
47 graph.AddVertex(2);
48 graph.AddVertex(3);
49 graph.AddVertex(4);
51 graph.AddEdge(0, 1);
52 graph.AddEdge(1, 2)
74 Graph<int> graph; local
105 Graph<int> graph; local
122 Graph<int> graph; local
169 Graph<int> graph; local
201 Graph<int> graph; local
[all...] |
| /external/fio/ |
| graph.h | 4 struct graph;
11 struct graph *graph_new(unsigned int xdim, unsigned int ydim, const char *font);
12 /* graph_new() Returns a new graph structure of the given dimensions and font */
13 void graph_set_size(struct graph *g, unsigned int xdim, unsigned int ydim);
14 /* graph_set_size() Changes the size of a graph to the given dimensions. */
15 void graph_set_position(struct graph *g, double xoffset, double yoffset);
16 /* graph_set_position() sets the x- and y-offset to translate the graph */
17 void bar_graph_draw(struct graph *g, cairo_t *cr);
18 /* bar_graph_draw() draws the given graph as a bar graph */
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_graph.py | 4 from altgraph.Graph import Graph
9 graph = Graph()
11 self.assertEqual(graph.node_list(), [])
16 graph.add_node(1, o1)
17 graph.add_node(1, o1b)
18 graph.add_node(2, o2)
19 graph.add_node(3)
21 self.assertRaises(TypeError, graph.add_node, []
[all...] |
| test_object_graph.py | 4 from altgraph.Graph import Graph
31 graph = ObjectGraph()
32 self.assertTrue(isinstance(graph, ObjectGraph))
34 g = Graph()
35 graph = ObjectGraph(g)
36 self.assertTrue(graph.graph is g)
37 self.assertEqual(graph.debug, 0)
38 self.assertEqual(graph.indent, 0
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-sce.h | 16 explicit HStackCheckEliminationPhase(HGraph* graph)
17 : HPhase("H_Stack check elimination", graph) { }
|
| hydrogen-bch.h | 16 explicit HBoundsCheckHoistingPhase(HGraph* graph)
17 : HPhase("H_Bounds checks hoisting", graph) { }
|
| hydrogen-canonicalize.h | 16 explicit HCanonicalizePhase(HGraph* graph)
17 : HPhase("H_Canonicalize", graph) { }
|
| hydrogen-dehoist.h | 16 explicit HDehoistIndexComputationsPhase(HGraph* graph)
17 : HPhase("H_Dehoist index computations", graph) { }
|
| hydrogen-load-elimination.h | 15 explicit HLoadEliminationPhase(HGraph* graph)
16 : HPhase("H_Load elimination", graph) { }
|
| hydrogen-mark-unreachable.h | 16 explicit HMarkUnreachableBlocksPhase(HGraph* graph)
17 : HPhase("H_Mark unreachable blocks", graph) { }
|
| hydrogen-removable-simulates.h | 16 explicit HMergeRemovableSimulatesPhase(HGraph* graph)
17 : HPhase("H_Merge removable simulates", graph) { }
|
| /external/v8/test/unittests/compiler/ |
| graph-trimmer-unittest.cc | 5 #include "src/compiler/graph-trimmer.h"
6 #include "test/unittests/compiler/graph-unittest.h"
23 GraphTrimmer trimmer(zone(), graph());
27 GraphTrimmer trimmer(zone(), graph());
44 Node* const start = graph()->NewNode(common()->Start(0));
45 Node* const end = graph()->NewNode(common()->End(1), start);
46 graph()->SetStart(start);
47 graph()->SetEnd(end);
49 EXPECT_EQ(end, graph()->end());
50 EXPECT_EQ(start, graph()->start())
[all...] |
| branch-elimination-unittest.cc | 6 #include "src/compiler/js-graph.h"
10 #include "test/unittests/compiler/graph-unittest.h"
28 JSGraph jsgraph(isolate(), graph(), common(), &javascript, nullptr,
30 GraphReducer graph_reducer(zone(), graph(), jsgraph.Dead());
48 graph()->NewNode(common()->Branch(), condition, graph()->start());
50 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch);
52 graph()->NewNode(common()->Branch(), condition, outer_if_true);
53 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch);
54 Node* inner_if_false = graph()->NewNode(common()->IfFalse(), inner_branch)
[all...] |
| /system/update_engine/payload_generator/ |
| tarjan.cc | 35 Graph* graph,
40 for (Graph::iterator it = graph->begin(); it != graph->end(); ++it)
44 Tarjan(vertex, graph);
49 void TarjanAlgorithm::Tarjan(Vertex::Index vertex, Graph* graph) {
50 CHECK_EQ((*graph)[vertex].index, kInvalidIndex);
51 (*graph)[vertex].index = index_
[all...] |
| /art/compiler/optimizing/ |
| find_loops_test.cc | 40 HGraph* graph = CreateCFG(&allocator, data); local
41 for (HBasicBlock* block : graph->GetBlocks()) {
53 HGraph* graph = CreateCFG(&allocator, data); local
54 for (HBasicBlock* block : graph->GetBlocks()) {
69 HGraph* graph = CreateCFG(&allocator, data); local
70 for (HBasicBlock* block : graph->GetBlocks()) {
86 HGraph* graph = CreateCFG(&allocator, data); local
87 for (HBasicBlock* block : graph->GetBlocks()) {
101 HGraph* graph = CreateCFG(&allocator, data); local
102 for (HBasicBlock* block : graph->GetBlocks())
147 HGraph* graph = CreateCFG(&allocator, data); local
175 HGraph* graph = CreateCFG(&allocator, data); local
200 HGraph* graph = CreateCFG(&allocator, data); local
226 HGraph* graph = CreateCFG(&allocator, data); local
252 HGraph* graph = CreateCFG(&allocator, data); local
277 HGraph* graph = CreateCFG(&allocator, data); local
308 HGraph* graph = CreateCFG(&allocator, data); local
338 HGraph* graph = CreateCFG(&allocator, data); local
354 HGraph* graph = CreateCFG(&allocator, data); local
[all...] |
| constant_folding.h | 29 * Note that graph simplifications producing a constant should be
30 * implemented in art::HConstantFolding, while graph simplifications
42 HConstantFolding(HGraph* graph, const char* name = kConstantFoldingPassName)
43 : HOptimization(graph, name) {}
|
| dex_cache_array_fixups_arm.h | 28 DexCacheArrayFixups(HGraph* graph, OptimizingCompilerStats* stats)
29 : HOptimization(graph, "dex_cache_array_fixups_arm", stats) {}
|
| select_generator.h | 50 HSelectGenerator(HGraph* graph, OptimizingCompilerStats* stats)
51 : HOptimization(graph, kSelectGeneratorPassName, stats) {}
|
| /external/skia/src/core/ |
| SkTTopoSort.h | 15 void SkTTopoSort_CheckAllUnmarked(const SkTDArray<T*>& graph) {
16 for (int i = 0; i < graph.count(); ++i) {
17 SkASSERT(!Traits::IsTempMarked(graph[i]));
18 SkASSERT(!Traits::WasOutput(graph[i]));
23 void SkTTopoSort_CleanExit(const SkTDArray<T*>& graph) {
24 for (int i = 0; i < graph.count(); ++i) {
25 SkASSERT(!Traits::IsTempMarked(graph[i]));
26 SkASSERT(Traits::WasOutput(graph[i]));
60 // Topologically sort the nodes in 'graph'. For this sort, when node 'i' depends
62 // A false return value means there was a loop and the contents of 'graph' wil
[all...] |
| /external/autotest/client/site_tests/hardware_PerfCallgraphVerification/src/ |
| Makefile | 3 OUTPUTS=graph
7 noploop: graph.c
|
| /external/v8/src/compiler/ |
| graph-replay.h | 15 class Graph;
17 // Helper class to print a full replay of a graph. This replay can be used to
18 // materialize the same graph within a C++ unit test and hence test subsequent
19 // optimization passes on a graph without going through the construction steps.
23 static void PrintReplay(Graph* graph);
25 static void PrintReplay(Graph* graph) {}
|
| /external/v8/test/cctest/compiler/ |
| test-graph-visualizer.cc | 6 #include "src/compiler/graph.h"
7 #include "src/compiler/graph-visualizer.h"
30 Graph graph(scope.main_zone());
33 Node* start = graph.NewNode(common.Start(0));
34 graph.SetStart(start);
35 Node* k = graph.NewNode(common.Int32Constant(0));
37 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start);
39 graph.SetEnd(phi);
42 SourcePositionTable table(&graph);
[all...] |
