| /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()) { }
|
| hydrogen-dce.h | 16 explicit HDeadCodeEliminationPhase(HGraph* graph)
17 : HPhase("H_Dead code elimination", graph) { }
|
| hydrogen-redundant-phi.h | 18 explicit HRedundantPhiEliminationPhase(HGraph* graph)
19 : HPhase("H_Redundant phi elimination", graph) { }
|
| hydrogen-representation-changes.h | 16 explicit HRepresentationChangesPhase(HGraph* graph)
17 : HPhase("H_Representation changes", graph) { }
|
| /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) {}
|
| graph_test.cc | 28 static HBasicBlock* createIfBlock(HGraph* graph, ArenaAllocator* allocator) {
29 HBasicBlock* if_block = new (allocator) HBasicBlock(graph);
30 graph->AddBlock(if_block);
40 static HBasicBlock* createGotoBlock(HGraph* graph, ArenaAllocator* allocator) {
41 HBasicBlock* block = new (allocator) HBasicBlock(graph);
42 graph->AddBlock(block);
48 static HBasicBlock* createReturnBlock(HGraph* graph, ArenaAllocator* allocator) {
49 HBasicBlock* block = new (allocator) HBasicBlock(graph);
50 graph->AddBlock(block);
56 static HBasicBlock* createExitBlock(HGraph* graph, ArenaAllocator* allocator)
71 HGraph* graph = new (&allocator) HGraph(&allocator); local
106 HGraph* graph = new (&allocator) HGraph(&allocator); local
141 HGraph* graph = new (&allocator) HGraph(&allocator); local
177 HGraph* graph = new (&allocator) HGraph(&allocator); local
213 HGraph* graph = new (&allocator) HGraph(&allocator); local
253 HGraph* graph = new (&allocator) HGraph(&allocator); local
290 HGraph* graph = new (&allocator) HGraph(&allocator); local
[all...] |
| /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...] |
