| /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_org/v8/src/ |
| 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) { }
|
| hydrogen-infer-types.h | 16 explicit HInferTypesPhase(HGraph* graph)
17 : HPhase("H_Inferring types", graph), worklist_(8, zone()),
18 in_worklist_(graph->GetMaximumValueID(), zone()) { }
21 InferTypes(0, graph()->blocks()->length() - 1);
|
| hydrogen-mark-deoptimize.h | 21 explicit HMarkDeoptimizeOnUndefinedPhase(HGraph* graph)
22 : HPhase("H_Mark deoptimize on undefined", graph),
40 explicit HComputeChangeUndefinedToNaN(HGraph* graph)
41 : HPhase("H_Compute change undefined to nan", graph) {}
|
| hydrogen-infer-representation.h | 16 explicit HInferRepresentationPhase(HGraph* graph)
17 : HPhase("H_Infer representations", graph),
19 in_worklist_(graph->GetMaximumValueID(), zone()) { }
|
| /frameworks/compile/mclinker/include/mcld/ADT/GraphLite/ |
| GraphBasicTypes.h | 13 namespace graph { namespace in namespace:mcld
16 * \brief Undirected graph category.
21 * \brief Directed graph category.
25 } // namespace of graph
|
| /art/compiler/optimizing/ |
| find_loops_test.cc | 34 HGraph* graph = builder.BuildGraph(*item); local
35 graph->BuildDominatorTree();
36 graph->FindNaturalLoops();
37 return graph;
47 HGraph* graph = TestCode(data, &arena); local
48 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
49 ASSERT_EQ(graph->GetBlocks().Get(i)->GetLoopInformation(), nullptr);
59 HGraph* graph = TestCode(data, &arena); local
60 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
61 ASSERT_EQ(graph->GetBlocks().Get(i)->GetLoopInformation(), nullptr)
74 HGraph* graph = TestCode(data, &arena); local
90 HGraph* graph = TestCode(data, &arena); local
104 HGraph* graph = TestCode(data, &arena); local
149 HGraph* graph = TestCode(data, &arena); local
176 HGraph* graph = TestCode(data, &arena); local
200 HGraph* graph = TestCode(data, &arena); local
225 HGraph* graph = TestCode(data, &arena); local
251 HGraph* graph = TestCode(data, &arena); local
276 HGraph* graph = TestCode(data, &arena); local
307 HGraph* graph = TestCode(data, &arena); local
336 HGraph* graph = TestCode(data, &arena); local
350 HGraph* graph = TestCode(data, &arena); local
[all...] |
| ssa_phi_elimination.h | 25 * Optimization phase that removes dead phis from the graph. Dead phis are unused
30 explicit SsaDeadPhiElimination(HGraph* graph)
31 : graph_(graph), worklist_(graph->GetArena(), kDefaultWorklistSize) {}
52 explicit SsaRedundantPhiElimination(HGraph* graph)
53 : graph_(graph), worklist_(graph->GetArena(), kDefaultWorklistSize) {}
|
| ssa_type_propagation.h | 24 // Compute and propagate types of phis in the graph.
27 explicit SsaTypePropagation(HGraph* graph)
28 : graph_(graph), worklist_(graph->GetArena(), kDefaultWorklistSize) {}
|
| /external/clang/test/PCH/Inputs/ |
| typo.hpp | 4 namespace graph { namespace in namespace:boost
|
| /external/chromium_org/components/keyed_service/core/ |
| dependency_graph_unittest.cc | 15 explicit DummyNode(DependencyGraph* graph) : dependency_graph_(graph) {
29 DependencyGraph graph; local
30 DummyNode node(&graph);
33 EXPECT_TRUE(graph.GetConstructionOrder(&construction_order));
38 EXPECT_TRUE(graph.GetDestructionOrder(&destruction_order));
45 DependencyGraph graph; local
46 DummyNode parent(&graph);
47 DummyNode child(&graph);
49 graph.AddEdge(&parent, &child)
66 DependencyGraph graph; local
91 DependencyGraph graph; local
127 DependencyGraph graph; local
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| GraphTest.cpp | 15 using namespace mcld::graph;
42 ListDigraph graph; local
44 ListDigraph::Node* u1 = graph.addNode();
45 ListDigraph::Node* u2 = graph.addNode();
46 ListDigraph::Node* u3 = graph.addNode();
64 graph.getHead(head);
67 graph.erase(*u2);
84 graph.getHead(head);
90 ListDigraph graph; local
92 ListDigraph::Node* u1 = graph.addNode()
138 ListDigraph graph; local
187 ListDigraph graph; local
208 ListDigraph graph; local
229 ListDigraph graph; local
257 ListDigraph graph; local
284 ListDigraph graph; local
311 ListDigraph graph; local
331 Digraph graph; local
[all...] |
| /external/chromium_org/v8/test/cctest/compiler/ |
| simplified-graph-builder.cc | 5 #include "test/cctest/compiler/simplified-graph-builder.h"
15 Graph* graph, CommonOperatorBuilder* common,
17 : GraphBuilder(graph),
26 DCHECK(graph()->start() == NULL);
27 Node* start = graph()->NewNode(common()->Start(num_parameters));
28 graph()->SetStart(start);
35 graph()->NewNode(common()->Return(), value, effect_, graph()->start());
41 Node* end = graph()->NewNode(common()->End(), return_)
[all...] |
| test-node.cc | 9 #include "graph-tester.h"
21 GraphTester graph; local
22 Node* n1 = graph.NewNode(&dummy_operator);
23 Node* n2 = graph.NewNode(&dummy_operator);
29 GraphTester graph; local
30 Node* n1 = graph.NewNode(&dummy_operator);
31 Node* n2 = graph.NewNode(&dummy_operator);
38 GraphTester graph; local
39 Node* n0 = graph.NewNode(&dummy_operator);
40 Node* n2 = graph.NewNode(&dummy_operator, n0)
47 GraphTester graph; local
58 GraphTester graph; local
70 GraphTester graph; local
82 GraphTester graph; local
94 GraphTester graph; local
108 GraphTester graph; local
119 GraphTester graph; local
133 GraphTester graph; local
159 GraphTester graph; local
181 GraphTester graph; local
232 GraphTester graph; local
281 GraphTester graph; local
299 GraphTester graph; local
342 GraphTester graph; local
363 GraphTester graph; local
400 GraphTester graph; local
418 GraphTester graph; local
441 GraphTester graph; local
477 GraphTester graph; local
519 GraphTester graph; local
541 GraphTester graph; local
558 GraphTester graph; local
631 GraphTester graph; local
727 GraphTester graph; local
798 GraphTester graph; local
[all...] |
| test-graph-reducer.cc | 7 #include "graph-tester.h"
9 #include "src/compiler/graph-reducer.h"
61 explicit NewABReducer(Graph* graph) : graph_(graph) {}
77 Graph* graph_;
107 explicit A0Wrapper(Graph* graph) : graph_(graph) {}
116 Graph* graph_
199 GraphTester graph; local
215 GraphTester graph; local
235 GraphTester graph; local
258 GraphTester graph; local
288 GraphTester graph; local
327 GraphTester graph; local
349 GraphTester graph; local
376 GraphTester graph; local
398 GraphTester graph; local
428 GraphTester graph; local
453 GraphTester graph; local
488 GraphTester graph; local
540 GraphTester graph; local
596 GraphTester graph; local
643 GraphTester graph; local
[all...] |
| test-node-algorithm.cc | 9 #include "graph-tester.h"
13 #include "src/compiler/graph.h"
14 #include "src/compiler/graph-inl.h"
15 #include "src/compiler/graph-visualizer.h"
47 GraphWithStartNodeTester graph; local
50 graph.VisitNodeUsesFromStart(&node_visitor);
57 GraphWithStartNodeTester graph; local
58 Node* n2 = graph.NewNode(&dummy_operator, graph.start());
59 Node* n3 = graph.NewNode(&dummy_operator, n2)
77 GraphWithStartNodeTester graph; local
96 GraphWithStartNodeTester graph; local
123 GraphWithStartNodeTester graph; local
158 GraphWithStartNodeTester graph; local
217 GraphWithStartNodeTester graph; local
313 GraphWithStartNodeTester graph; local
[all...] |
