| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| D | test_graph.py | 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, [])
23 self.assertTrue(graph.node_data(1) is o1)
24 self.assertTrue(graph.node_data(2) is o2)
25 self.assertTrue(graph.node_data(3) is None)
[all …]
|
| D | test_object_graph.py | 31 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 = ObjectGraph()
45 self.assertEqual(repr(graph), '<ObjectGraph>')
[all …]
|
| /external/skia/tests/ |
| D | TopoSortTest.cpp | 14 typedef void (*CreateGraphPF)(SkTDArray<sk_tool_utils::TopoTestNode*>* graph);
23 static void create_graph0(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) { in create_graph0() argument
24 sk_tool_utils::TopoTestNode::AllocNodes(graph, 4); in create_graph0()
26 (*graph)[0]->dependsOn((*graph)[1]); in create_graph0()
27 (*graph)[0]->dependsOn((*graph)[2]); in create_graph0()
28 (*graph)[1]->dependsOn((*graph)[3]); in create_graph0()
29 (*graph)[2]->dependsOn((*graph)[3]); in create_graph0()
41 static void create_graph1(SkTDArray<sk_tool_utils::TopoTestNode*>* graph) { in create_graph1() argument
42 sk_tool_utils::TopoTestNode::AllocNodes(graph, 4); in create_graph1()
44 (*graph)[0]->dependsOn((*graph)[1]); in create_graph1()
[all …]
|
| /external/v8/test/unittests/compiler/ |
| D | node-matchers-unittest.cc | 46 graph()->SetStart(graph()->NewNode(common()->Start(0))); in TEST_F()
49 Node* d0 = graph()->NewNode(d0_op); in TEST_F()
52 Node* d1 = graph()->NewNode(d1_op); in TEST_F()
55 Node* d2 = graph()->NewNode(d2_op); in TEST_F()
58 Node* d3 = graph()->NewNode(d3_op); in TEST_F()
61 Node* d4 = graph()->NewNode(d4_op); in TEST_F()
64 Node* d5 = graph()->NewNode(d5_op); in TEST_F()
67 Node* d7 = graph()->NewNode(d7_op); in TEST_F()
70 Node* d8 = graph()->NewNode(d8_op); in TEST_F()
73 Node* d9 = graph()->NewNode(d9_op); in TEST_F()
[all …]
|
| D | branch-elimination-unittest.cc | 28 JSGraph jsgraph(isolate(), graph(), common(), &javascript, nullptr, in Reduce()
30 GraphReducer graph_reducer(zone(), graph(), jsgraph.Dead()); in Reduce()
48 graph()->NewNode(common()->Branch(), condition, graph()->start()); in TEST_F()
50 Node* outer_if_true = graph()->NewNode(common()->IfTrue(), outer_branch); in TEST_F()
52 graph()->NewNode(common()->Branch(), condition, outer_if_true); in TEST_F()
53 Node* inner_if_true = graph()->NewNode(common()->IfTrue(), inner_branch); in TEST_F()
54 Node* inner_if_false = graph()->NewNode(common()->IfFalse(), inner_branch); in TEST_F()
56 graph()->NewNode(common()->Merge(2), inner_if_true, inner_if_false); in TEST_F()
58 graph()->NewNode(common()->Phi(MachineRepresentation::kWord32, 2), in TEST_F()
61 Node* outer_if_false = graph()->NewNode(common()->IfFalse(), outer_branch); in TEST_F()
[all …]
|
| D | scheduler-unittest.cc | 36 SourcePositionTable table(graph()); in ComputeAndVerifySchedule()
37 os << AsJSON(*graph(), &table); in ComputeAndVerifySchedule()
41 Scheduler::ComputeSchedule(zone(), graph(), Scheduler::kSplitNodes); in ComputeAndVerifySchedule()
61 Graph* graph() { return &graph_; } in graph() function in v8::internal::compiler::SchedulerTest
635 graph()->SetStart(graph()->NewNode(common()->Start(0))); in TEST_F()
636 graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start())); in TEST_F()
637 USE(Scheduler::ComputeSchedule(zone(), graph(), Scheduler::kNoFlags)); in TEST_F()
642 graph()->SetStart(graph()->NewNode(common()->Start(0))); in TEST_F()
644 Node* p1 = graph()->NewNode(common()->Parameter(0), graph()->start()); in TEST_F()
645 Node* ret = graph()->NewNode(common()->Return(), p1, graph()->start(), in TEST_F()
[all …]
|
| D | dead-code-elimination-unittest.cc | 26 DeadCodeElimination reducer(editor, graph(), common()); in Reduce()
60 Node* const effect = graph()->start(); in TEST_F()
61 Node* const dead = graph()->NewNode(common()->Dead()); in TEST_F()
62 Node* const node = graph()->NewNode(&kOp0, value, effect, dead); in TEST_F()
78 Reduce(graph()->NewNode(common()->Branch(hint), Parameter(0), in TEST_F()
79 graph()->NewNode(common()->Dead()))); in TEST_F()
92 graph()->NewNode(common()->IfTrue(), graph()->NewNode(common()->Dead()))); in TEST_F()
103 Reduction const r = Reduce(graph()->NewNode( in TEST_F()
104 common()->IfFalse(), graph()->NewNode(common()->Dead()))); in TEST_F()
115 Reduction const r = Reduce(graph()->NewNode( in TEST_F()
[all …]
|
| D | graph-trimmer-unittest.cc | 23 GraphTrimmer trimmer(zone(), graph()); in TrimGraph()
27 GraphTrimmer trimmer(zone(), graph()); in TrimGraph()
44 Node* const start = graph()->NewNode(common()->Start(0)); in TEST_F()
45 Node* const end = graph()->NewNode(common()->End(1), start); in TEST_F()
46 graph()->SetStart(start); in TEST_F()
47 graph()->SetEnd(end); in TEST_F()
49 EXPECT_EQ(end, graph()->end()); in TEST_F()
50 EXPECT_EQ(start, graph()->start()); in TEST_F()
56 Node* const dead0 = graph()->NewNode(&kDead0, graph()->start()); in TEST_F()
57 graph()->SetEnd(graph()->NewNode(common()->End(1), graph()->start())); in TEST_F()
[all …]
|
| D | graph-reducer-unittest.cc | 86 explicit NewABReducer(Graph* graph) : graph_(graph) {} in NewABReducer() argument
112 explicit A0Wrapper(Graph* graph) : graph_(graph) {} in A0Wrapper() argument
131 explicit B0Wrapper(Graph* graph) : graph_(graph) {} in B0Wrapper() argument
226 Graph* graph() { return &graph_; } in graph() function in v8::internal::compiler::AdvancedReducerTest
243 Node* node0 = graph()->NewNode(&kOpA0); in TEST_F()
244 Node* node1 = graph()->NewNode(&kOpA1, node0); in TEST_F()
262 Node* node0 = graph()->NewNode(&kOpA0); in TEST_F()
263 Node* node1 = graph()->NewNode(&kOpA1, node0); in TEST_F()
293 Node* node = graph()->NewNode(&kMockOperator); in TEST_F()
294 Node* start = graph()->NewNode(common.Start(1)); in TEST_F()
[all …]
|
| D | js-type-feedback-unittest.cc | 44 JSGraph jsgraph(isolate(), graph(), common(), javascript(), &simplified, in Reduce()
48 GraphReducer graph_reducer(zone(), graph()); in Reduce()
56 JSGraph jsgraph(isolate(), graph(), common(), javascript(), nullptr, in EmptyFrameState()
89 Node* load = graph()->NewNode(op, vector, context, EmptyFrameState(), in ReturnLoadNamedFromGlobal()
91 Node* if_success = graph()->NewNode(common()->IfSuccess(), load); in ReturnLoadNamedFromGlobal()
92 return graph()->NewNode(common()->Return(), load, load, if_success); in ReturnLoadNamedFromGlobal()
109 kName, graph()->start(), graph()->start(), in TEST_F()
111 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
126 kName, graph()->start(), graph()->start(), in TEST_F()
128 graph()->SetEnd(graph()->NewNode(common()->End(1), ret)); in TEST_F()
[all …]
|
| D | common-operator-reducer-unittest.cc | 33 CommonOperatorReducer reducer(editor, graph(), common(), &machine); in Reduce()
76 Node* const control = graph()->start(); in TEST_F()
78 graph()->NewNode(common()->Branch(hint), Int32Constant(0), control); in TEST_F()
79 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
80 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
93 Node* const control = graph()->start(); in TEST_F()
95 graph()->NewNode(common()->Branch(hint), Int32Constant(1), control); in TEST_F()
96 Node* const if_true = graph()->NewNode(common()->IfTrue(), branch); in TEST_F()
97 Node* const if_false = graph()->NewNode(common()->IfFalse(), branch); in TEST_F()
110 Node* const control = graph()->start(); in TEST_F()
[all …]
|
| D | js-context-relaxation-unittest.cc | 24 JSGraph jsgraph(isolate(), graph(), common(), javascript(), nullptr, in Reduce()
27 GraphReducer graph_reducer(zone(), graph()); in Reduce()
34 JSGraph jsgraph(isolate(), graph(), common(), javascript(), nullptr, in EmptyFrameState()
48 return graph()->NewNode(op, graph()->start(), graph()->start(), in ShallowFrameStateChain()
49 graph()->start(), outer_context, graph()->start(), in ShallowFrameStateChain()
50 graph()->start()); in ShallowFrameStateChain()
64 return graph()->NewNode(op, graph()->start(), graph()->start(), in DeepFrameStateChain()
65 graph()->start(), graph()->start(), in DeepFrameStateChain()
66 graph()->start(), shallow_frame_state); in DeepFrameStateChain()
84 Node* const effect = graph()->start(); in TEST_F()
[all …]
|
| D | control-flow-optimizer-unittest.cc | 28 ControlFlowOptimizer optimizer(graph(), common(), machine(), zone()); in Optimize()
43 Node* branch0 = graph()->NewNode( in TEST_F()
45 graph()->NewNode(machine()->Word32Equal(), index, Int32Constant(0)), in TEST_F()
47 Node* if_true0 = graph()->NewNode(common()->IfTrue(), branch0); in TEST_F()
48 Node* if_false0 = graph()->NewNode(common()->IfFalse(), branch0); in TEST_F()
49 Node* branch1 = graph()->NewNode( in TEST_F()
51 graph()->NewNode(machine()->Word32Equal(), index, Int32Constant(1)), in TEST_F()
53 Node* if_true1 = graph()->NewNode(common()->IfTrue(), branch1); in TEST_F()
54 Node* if_false1 = graph()->NewNode(common()->IfFalse(), branch1); in TEST_F()
56 graph()->NewNode(common()->Merge(3), if_true0, if_true1, if_false1); in TEST_F()
[all …]
|
| D | machine-operator-reducer-unittest.cc | 32 JSGraph jsgraph(isolate(), graph(), common(), &javascript, nullptr, in Reduce()
272 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
287 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
289 graph()->NewNode(machine()->ChangeInt32ToFloat64(), value))); in TEST_F()
297 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
312 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
314 graph()->NewNode(machine()->ChangeUint32ToFloat64(), value))); in TEST_F()
322 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
337 graph()->NewNode(machine()->ChangeInt32ToFloat64(), Int32Constant(x))); in TEST_F()
351 graph()->NewNode(machine()->ChangeInt32ToInt64(), Int32Constant(x))); in TEST_F()
[all …]
|
| D | tail-call-optimization-unittest.cc | 22 TailCallOptimization tco(common(), graph()); in Reduce()
41 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
42 graph()->start(), graph()->start()); in TEST_F()
43 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
44 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()
63 Node* call = graph()->NewNode(common()->Call(kCallDescriptor), p0, p1, in TEST_F()
64 graph()->start(), graph()->start()); in TEST_F()
65 Node* if_success = graph()->NewNode(common()->IfSuccess(), call); in TEST_F()
66 Node* if_exception = graph()->NewNode( in TEST_F()
68 Node* ret = graph()->NewNode(common()->Return(), call, call, if_success); in TEST_F()
[all …]
|
| D | js-typed-lowering-unittest.cc | 85 JSGraph jsgraph(isolate(), graph(), common(), javascript(), &simplified, in Reduce()
88 GraphReducer graph_reducer(zone(), graph()); in Reduce()
96 Node* state_values = graph()->NewNode(common()->StateValues(0)); in FrameState()
97 return graph()->NewNode( in FrameState()
228 Reduce(graph()->NewNode(javascript()->ToBoolean(ToBooleanHint::kAny), in TEST_F()
229 input, context, graph()->start())); in TEST_F()
258 Reduce(graph()->NewNode(javascript()->ToBoolean(ToBooleanHint::kAny), in TEST_F()
259 input, context, graph()->start())); in TEST_F()
274 Reduce(graph()->NewNode(javascript()->ToBoolean(ToBooleanHint::kAny), in TEST_F()
275 input, context, graph()->start())); in TEST_F()
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | graph_algorithms_test.cc | 44 Graph<int> graph; in TEST() local
45 graph.AddVertex(0); in TEST()
46 graph.AddVertex(1); in TEST()
47 graph.AddVertex(2); in TEST()
48 graph.AddVertex(3); in TEST()
49 graph.AddVertex(4); in TEST()
51 graph.AddEdge(0, 1); in TEST()
52 graph.AddEdge(1, 2); in TEST()
53 graph.AddEdge(2, 3); in TEST()
54 graph.AddEdge(3, 4); in TEST()
[all …]
|
| D | graph_test.cc | 41 Graph<int> graph; in TEST() local
42 EXPECT_EQ(graph.vertices().size(), 0); in TEST()
46 Graph<int> graph; in TEST() local
47 graph.AddVertex(0, 1.0); in TEST()
48 graph.AddVertex(1, 2.0); in TEST()
49 graph.AddEdge(0, 1, 0.5); in TEST()
51 const HashSet<int>& vertices = graph.vertices(); in TEST()
53 EXPECT_EQ(graph.VertexWeight(0), 1.0); in TEST()
54 EXPECT_EQ(graph.VertexWeight(1), 2.0); in TEST()
55 EXPECT_EQ(graph.Neighbors(0).size(), 1); in TEST()
[all …]
|
| D | single_linkage_clustering_test.cc | 46 Graph<int> graph; in TEST() local
49 graph.AddVertex(i); in TEST()
54 graph.AddEdge(0, 1, 1.0); in TEST()
55 graph.AddEdge(1, 2, 1.0); in TEST()
56 graph.AddEdge(2, 3, 1.0); in TEST()
57 graph.AddEdge(4, 5, 1.0); in TEST()
61 ComputeSingleLinkageClustering(options, graph, &membership); in TEST()
73 Graph<int> graph; in TEST() local
76 graph.AddVertex(i); in TEST()
81 graph.AddEdge(0, 1, 1.0); in TEST()
[all …]
|
| /external/v8/test/cctest/compiler/ |
| D | test-graph-visualizer.cc | 30 Graph graph(scope.main_zone()); in TEST() local
33 Node* start = graph.NewNode(common.Start(0)); in TEST()
34 graph.SetStart(start); in TEST()
35 Node* k = graph.NewNode(common.Int32Constant(0)); in TEST()
37 graph.NewNode(common.Phi(MachineRepresentation::kTagged, 1), k, start); in TEST()
39 graph.SetEnd(phi); in TEST()
42 SourcePositionTable table(&graph); in TEST()
43 os << AsJSON(graph, &table); in TEST()
49 Graph graph(scope.main_zone()); in TEST() local
52 Node* start = graph.NewNode(common.Start(0)); in TEST()
[all …]
|
| D | test-node.cc | 145 Graph graph(&zone); in TEST() local
146 Node* n0 = graph.NewNode(&dummy_operator0); in TEST()
147 Node* n1 = graph.NewNode(&dummy_operator1, n0); in TEST()
148 Node* n2 = graph.NewNode(&dummy_operator1, n0); in TEST()
149 Node* n3 = graph.NewNode(&dummy_operator0); in TEST()
170 Graph graph(&zone); in TEST() local
171 Node* n0 = graph.NewNode(&dummy_operator0); in TEST()
172 Node* n1 = graph.NewNode(&dummy_operator1, n0); in TEST()
182 Node* n2 = graph.NewNode(&dummy_operator0); in TEST()
194 Graph graph(&zone); in TEST() local
[all …]
|
| /external/fio/ |
| D | graph.h | 4 struct graph;
11 struct graph *graph_new(unsigned int xdim, unsigned int ydim, const char *font);
13 void graph_set_size(struct graph *g, unsigned int xdim, unsigned int ydim);
15 void graph_set_position(struct graph *g, double xoffset, double yoffset);
17 void bar_graph_draw(struct graph *g, cairo_t *cr);
19 void line_graph_draw(struct graph *g, cairo_t *cr);
21 void line_graph_set_data_count_limit(struct graph *g, int per_label_limit);
26 void graph_set_font(struct graph *g, const char *font);
27 void graph_title(struct graph *g, const char *title);
29 void graph_x_title(struct graph *g, const char *title);
[all …]
|
| /external/v8/src/compiler/ |
| D | js-native-context-specialization.cc | 78 graph()->zone()); in ReduceNamedAccess()
101 Node* check = graph()->NewNode(simplified()->ReferenceEqual(Type::Name()), in ReduceNamedAccess()
104 graph()->NewNode(common()->Branch(BranchHint::kTrue), check, control); in ReduceNamedAccess()
105 exit_controls.push_back(graph()->NewNode(common()->IfFalse(), branch)); in ReduceNamedAccess()
106 control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
110 Node* check = graph()->NewNode(simplified()->ObjectIsSmi(), receiver); in ReduceNamedAccess()
111 Node* branch = graph()->NewNode(common()->Branch(), check, control); in ReduceNamedAccess()
112 control = graph()->NewNode(common()->IfFalse(), branch); in ReduceNamedAccess()
113 Node* receiverissmi_control = graph()->NewNode(common()->IfTrue(), branch); in ReduceNamedAccess()
119 graph()->NewNode(simplified()->LoadField(AccessBuilder::ForMap()), in ReduceNamedAccess()
[all …]
|
| D | change-lowering.cc | 24 Node* control = graph()->start(); in Reduce()
81 Node* effect = graph()->NewNode(common()->BeginRegion(), graph()->start()); in AllocateHeapNumberWithValue()
88 Node* heap_number = graph()->NewNode(allocate_heap_number_operator_.get(), in AllocateHeapNumberWithValue()
90 Node* store = graph()->NewNode( in AllocateHeapNumberWithValue()
94 return graph()->NewNode(common()->FinishRegion(), heap_number, store); in AllocateHeapNumberWithValue()
99 return graph()->NewNode(machine()->ChangeInt32ToFloat64(), value); in ChangeInt32ToFloat64()
105 value = graph()->NewNode(machine()->ChangeInt32ToInt64(), value); in ChangeInt32ToSmi()
107 return graph()->NewNode(machine()->WordShl(), value, SmiShiftBitsConstant()); in ChangeInt32ToSmi()
117 value = graph()->NewNode(machine()->WordSar(), value, SmiShiftBitsConstant()); in ChangeSmiToInt32()
119 value = graph()->NewNode(machine()->TruncateInt64ToInt32(), value); in ChangeSmiToInt32()
[all …]
|
| /external/opencv3/modules/core/test/ |
| D | test_ds.cpp | 175 static void cvTsClearSimpleGraph( CvTsSimpleGraph* graph ) in cvTsClearSimpleGraph() argument
177 int max_vtx_count = graph->vtx->max_count; in cvTsClearSimpleGraph()
178 cvTsClearSimpleSet( graph->vtx ); in cvTsClearSimpleGraph()
179 memset( graph->matrix, 0, max_vtx_count * max_vtx_count * graph->edge_size ); in cvTsClearSimpleGraph()
186 CvTsSimpleGraph* graph; in cvTsCreateSimpleGraph() local
189 graph = (CvTsSimpleGraph*)cvAlloc( sizeof(*graph) + in cvTsCreateSimpleGraph()
191 graph->vtx = cvTsCreateSimpleSet( max_vtx_count, vtx_size ); in cvTsCreateSimpleGraph()
192 graph->edge_size = edge_size + 1; in cvTsCreateSimpleGraph()
193 graph->matrix = (char*)(graph + 1); in cvTsCreateSimpleGraph()
194 graph->oriented = oriented; in cvTsCreateSimpleGraph()
[all …]
|