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

1234567891011>>

/external/ceres-solver/internal/ceres/
H A Dgraph_test.cc31 #include "ceres/graph.h"
41 Graph<int> graph; local
42 EXPECT_EQ(graph.vertices().size(), 0);
46 Graph<int> graph; local
47 graph.AddVertex(0, 1.0);
48 graph.AddVertex(1, 2.0);
49 graph.AddEdge(0, 1, 0.5);
51 const HashSet<int>& vertices = graph.vertices();
53 EXPECT_EQ(graph.VertexWeight(0), 1.0);
54 EXPECT_EQ(graph
62 Graph<int> graph; local
87 Graph<int> graph; local
97 Graph<int> graph; local
[all...]
H A Dsingle_linkage_clustering_test.cc39 #include "ceres/graph.h"
46 Graph<int> graph; local
49 graph.AddVertex(i);
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
76 graph
102 Graph<int> graph; local
[all...]
H A Dgraph_algorithms_test.cc36 #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);
53 graph
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/
H A Dgraph.h4 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/clang/test/PCH/Inputs/
H A Dtypo.hpp4 namespace graph { namespace in namespace:boost
/external/chromium_org/v8/src/
H A Dhydrogen-sce.h16 explicit HStackCheckEliminationPhase(HGraph* graph) argument
17 : HPhase("H_Stack check elimination", graph) { }
H A Dhydrogen-infer-types.h16 explicit HInferTypesPhase(HGraph* graph) argument
17 : HPhase("H_Inferring types", graph), worklist_(8, zone()),
18 in_worklist_(graph->GetMaximumValueID(), zone()) { }
21 InferTypes(0, graph()->blocks()->length() - 1);
H A Dhydrogen-infer-representation.h16 explicit HInferRepresentationPhase(HGraph* graph) argument
17 : HPhase("H_Infer representations", graph),
19 in_worklist_(graph->GetMaximumValueID(), zone()) { }
H A Dhydrogen-mark-deoptimize.h21 explicit HMarkDeoptimizeOnUndefinedPhase(HGraph* graph) argument
22 : HPhase("H_Mark deoptimize on undefined", graph),
40 explicit HComputeChangeUndefinedToNaN(HGraph* graph) argument
41 : HPhase("H_Compute change undefined to nan", graph) {}
H A Dhydrogen-bch.h16 explicit HBoundsCheckHoistingPhase(HGraph* graph) argument
17 : HPhase("H_Bounds checks hoisting", graph) { }
H A Dhydrogen-canonicalize.h16 explicit HCanonicalizePhase(HGraph* graph) argument
17 : HPhase("H_Canonicalize", graph) { }
H A Dhydrogen-dehoist.h16 explicit HDehoistIndexComputationsPhase(HGraph* graph) argument
17 : HPhase("H_Dehoist index computations", graph) { }
H A Dhydrogen-load-elimination.h15 explicit HLoadEliminationPhase(HGraph* graph) argument
16 : HPhase("H_Load elimination", graph) { }
H A Dhydrogen-mark-unreachable.h16 explicit HMarkUnreachableBlocksPhase(HGraph* graph) argument
17 : HPhase("H_Mark unreachable blocks", graph) { }
H A Dhydrogen-redundant-phi.h18 explicit HRedundantPhiEliminationPhase(HGraph* graph) argument
19 : HPhase("H_Redundant phi elimination", graph) { }
H A Dhydrogen-removable-simulates.h16 explicit HMergeRemovableSimulatesPhase(HGraph* graph) argument
17 : HPhase("H_Merge removable simulates", graph) { }
H A Dhydrogen-representation-changes.h16 explicit HRepresentationChangesPhase(HGraph* graph) argument
17 : HPhase("H_Representation changes", graph) { }
/external/chromium_org/components/keyed_service/core/
H A Ddependency_graph_unittest.cc15 explicit DummyNode(DependencyGraph* graph) : dependency_graph_(graph) { argument
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
66 DependencyGraph graph; local
91 DependencyGraph graph; local
127 DependencyGraph graph; local
[all...]
/external/chromium_org/v8/test/cctest/compiler/
H A Dsimplified-graph-builder.cc5 #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_);
42 graph()
14 SimplifiedGraphBuilder( Graph* graph, CommonOperatorBuilder* common, MachineOperatorBuilder* machine, SimplifiedOperatorBuilder* simplified) argument
[all...]
H A Dtest-node.cc9 #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
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...]
H A Dtest-graph-reducer.cc7 #include "graph-tester.h"
9 #include "src/compiler/graph-reducer.h"
61 explicit NewABReducer(Graph* graph) : graph_(graph) {} argument
107 explicit A0Wrapper(Graph* graph) : graph_(graph) {} argument
123 explicit B0Wrapper(Graph* graph) : graph_(graph) {} argument
199 GraphTester graph; local
201 Node* n1 = graph
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
521 GenDAG(Graph* graph, int* p3, int* p2, int* p1) argument
540 GraphTester graph; local
596 GraphTester graph; local
643 GraphTester graph; local
[all...]
H A Dtest-node-algorithm.cc9 #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
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...]
H A Dtest-node-cache.cc7 #include "graph-tester.h"
15 GraphTester graph; local
19 Node** pos = cache.Find(graph.zone(), i);
22 Node** npos = cache.Find(graph.zone(), i);
30 GraphTester graph; local
32 CommonOperatorBuilder common(graph.zone());
40 Node* node = graph.NewNode(common.Int32Constant(k));
41 *cache.Find(graph.zone(), k) = nodes[i] = node;
46 CHECK_EQ(nodes[i], *cache.Find(graph.zone(), k));
52 GraphTester graph; local
78 GraphTester graph; local
93 GraphTester graph; local
119 GraphTester graph; local
136 GraphTester graph; local
[all...]
/external/chromium_org/v8/src/compiler/
H A Dgraph-visualizer.h20 explicit AsDOT(const Graph& g) : graph(g) {}
21 const Graph& graph; member in struct:v8::internal::compiler::AsDOT
H A Dchange-lowering.cc8 #include "src/compiler/js-graph.h"
18 Node* control = graph()->start();
71 Node* effect = graph()->NewNode(common()->ValueEffect(1), value);
77 Node* heap_number = graph()->NewNode(
81 Node* store = graph()->NewNode(
84 return graph()->NewNode(common()->Finish(1), heap_number, store);
89 value = graph()->NewNode(machine()->WordSar(), value, SmiShiftBitsConstant());
91 value = graph()->NewNode(machine()->TruncateInt64ToInt32(), value);
98 return graph()->NewNode(machine()->Load(kMachFloat64), value,
100 graph()
242 Graph* ChangeLowering::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::ChangeLowering
[all...]

Completed in 508 milliseconds

1234567891011>>