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

1234567891011>>

/external/skia/tests/
H A DTopoSortTest.cpp14 typedef void (*CreateGraphPF)(SkTDArray<sk_tool_utils::TopoTestNode*>* graph);
23 static void create_graph0(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) { argument
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)[
41 create_graph1(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) argument
54 create_graph2(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) argument
73 create_graph3(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) argument
94 create_graph4(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) argument
123 SkTDArray<sk_tool_utils::TopoTestNode*> graph; local
[all...]
/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/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/
H A Dtest_graph.py9 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, [])
23 self.assertTrue(graph.node_data(1) is o1)
24 self.assertTrue(graph.node_data(2) is o2)
25 self.assertTrue(graph
[all...]
H A Dtest_object_graph.py31 graph = ObjectGraph()
32 self.assertTrue(isinstance(graph, ObjectGraph))
35 graph = ObjectGraph(g)
36 self.assertTrue(graph.graph is g)
37 self.assertEqual(graph.debug, 0)
38 self.assertEqual(graph.indent, 0)
40 graph = ObjectGraph(debug=5)
41 self.assertEqual(graph.debug, 5)
44 graph
[all...]
/external/v8/test/unittests/compiler/
H A Dgraph-trimmer-unittest.cc5 #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()
[all...]
H A Dscheduler-unittest.cc8 #include "src/compiler/graph-visualizer.h"
9 #include "src/compiler/graph.h"
36 SourcePositionTable table(graph());
37 os << AsJSON(*graph(), &table);
41 Scheduler::ComputeSchedule(zone(), graph(), Scheduler::kSplitNodes);
61 Graph* graph() { return &graph_; } function in class:v8::internal::compiler::SchedulerTest
89 graph()->SetStart(graph()->NewNode(common()->Start(0)));
90 graph()->SetEnd(graph()
110 CreateDiamond(Graph* graph, CommonOperatorBuilder* common, Node* cond) argument
[all...]
H A Dbranch-elimination-unittest.cc6 #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()
[all...]
H A Dnode-matchers-unittest.cc6 #include "src/compiler/graph.h"
12 #include "test/unittests/compiler/graph-unittest.h"
46 graph()->SetStart(graph()->NewNode(common()->Start(0)));
49 Node* d0 = graph()->NewNode(d0_op);
52 Node* d1 = graph()->NewNode(d1_op);
55 Node* d2 = graph()->NewNode(d2_op);
58 Node* d3 = graph()->NewNode(d3_op);
61 Node* d4 = graph()->NewNode(d4_op);
64 Node* d5 = graph()
[all...]
H A Dcontrol-flow-optimizer-unittest.cc8 #include "test/unittests/compiler/graph-unittest.h"
28 ControlFlowOptimizer optimizer(graph(), common(), machine(), zone());
43 Node* branch0 = graph()->NewNode(
45 graph()->NewNode(machine()->Word32Equal(), index, Int32Constant(0)),
47 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0);
48 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0);
49 Node* branch1 = graph()->NewNode(
51 graph()->NewNode(machine()->Word32Equal(), index, Int32Constant(1)),
53 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1);
54 Node* if_false1 = graph()
[all...]
/external/clang/test/PCH/Inputs/
H A Dtypo.hpp4 namespace graph { namespace in namespace:boost
/external/skia/src/core/
H A DSkTTopoSort.h15 void SkTTopoSort_CheckAllUnmarked(const SkTDArray<T*>& graph) { argument
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) { argument
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
81 SkTTopoSort(SkTDArray<T*>* graph) argument
[all...]
/external/autotest/client/site_tests/hardware_PerfCallgraphVerification/src/
H A DMakefile3 OUTPUTS=graph
7 noploop: graph.c
/external/v8/src/crankshaft/
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) {}
/external/v8/test/cctest/compiler/
H A Dtest-graph-visualizer.cc6 #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);
43 os << AsJSON(graph,
[all...]
H A Dtest-node.cc7 #include "src/compiler/graph.h"
146 Graph graph(&zone);
147 Node* n0 = graph.NewNode(&dummy_operator0);
148 Node* n1 = graph.NewNode(&dummy_operator1, n0);
149 Node* n2 = graph.NewNode(&dummy_operator1, n0);
150 Node* n3 = graph.NewNode(&dummy_operator0);
172 Graph graph(&zone);
173 Node* n0 = graph.NewNode(&dummy_operator0);
174 Node* n1 = graph.NewNode(&dummy_operator1, n0);
184 Node* n2 = graph
[all...]
/external/v8/src/compiler/
H A Dnode-marker.cc7 #include "src/compiler/graph.h"
13 NodeMarkerBase::NodeMarkerBase(Graph* graph, uint32_t num_states) argument
14 : mark_min_(graph->mark_max_), mark_max_(graph->mark_max_ += num_states) {
H A Dall-nodes.cc7 #include "src/compiler/graph.h"
13 AllNodes::AllNodes(Zone* local_zone, const Graph* graph) argument
14 : live(local_zone), is_live(graph->NodeCount(), false, local_zone) {
15 Node* end = graph->end();
25 if (input->id() >= graph->NodeCount()) {
H A Dint64-lowering.cc8 #include "src/compiler/graph.h"
22 Int64Lowering::Int64Lowering(Graph* graph, MachineOperatorBuilder* machine, argument
26 graph_(graph),
29 state_(graph, 3),
33 placeholder_(graph->NewNode(common->Parameter(-2, "placeholder"),
34 graph->start())) {
35 DCHECK_NOT_NULL(graph);
36 DCHECK_NOT_NULL(graph->end());
37 replacements_ = zone->NewArray<Replacement>(graph->NodeCount());
38 memset(replacements_, 0, sizeof(Replacement) * graph
[all...]
/external/v8/tools/turbolizer/
H A Dgraph-view.js10 var graph = this;
13 graph.svg = svg;
15 graph.nodes = nodes || [];
16 graph.edges = edges || [];
18 graph.minGraphX = 0;
19 graph.maxGraphX = 1;
20 graph.minGraphY = 0;
21 graph.maxGraphY = 1;
23 graph.state = {
54 var selection = graph
[all...]

Completed in 4661 milliseconds

1234567891011>>