| /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-reducer.cc | 61 explicit NewABReducer(Graph* graph) : graph_(graph) {} in NewABReducer() argument
107 explicit A0Wrapper(Graph* graph) : graph_(graph) {} in A0Wrapper() argument
123 explicit B0Wrapper(Graph* graph) : graph_(graph) {} in B0Wrapper() argument
199 GraphTester graph; in TEST() local
201 Node* n1 = graph.NewNode(&OPA0); in TEST()
202 Node* end = graph.NewNode(&OPA1, n1); in TEST()
203 graph.SetEnd(end); in TEST()
205 GraphReducer reducer(&graph); in TEST()
206 ReducerRecorder recorder(graph.zone()); in TEST()
215 GraphTester graph; in TEST() local
[all …]
|
| D | test-node.cc | 21 GraphTester graph; in TEST() local
22 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
23 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
29 GraphTester graph; in TEST() local
30 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
31 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
38 GraphTester graph; in TEST() local
39 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
40 Node* n2 = graph.NewNode(&dummy_operator, n0); in TEST()
47 GraphTester graph; in TEST() local
[all …]
|
| D | test-node-algorithm.cc | 47 GraphWithStartNodeTester graph; in TEST() local
50 graph.VisitNodeUsesFromStart(&node_visitor); in TEST()
57 GraphWithStartNodeTester graph; in TEST() local
58 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); in TEST()
59 Node* n3 = graph.NewNode(&dummy_operator, n2); in TEST()
60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3); in TEST()
61 Node* n5 = graph.NewNode(&dummy_operator, n4, n2); in TEST()
62 graph.SetEnd(n5); in TEST()
65 graph.VisitNodeUsesFromStart(&node_visitor); in TEST()
68 CHECK(graph.start()->id() == node_visitor.nodes_[0]->id()); in TEST()
[all …]
|
| D | test-node-cache.cc | 15 GraphTester graph; in TEST() local
19 Node** pos = cache.Find(graph.zone(), i); in TEST()
22 Node** npos = cache.Find(graph.zone(), i); in TEST()
30 GraphTester graph; in TEST() local
32 CommonOperatorBuilder common(graph.zone()); in TEST()
40 Node* node = graph.NewNode(common.Int32Constant(k)); in TEST()
41 *cache.Find(graph.zone(), k) = nodes[i] = node; in TEST()
46 CHECK_EQ(nodes[i], *cache.Find(graph.zone(), k)); in TEST()
52 GraphTester graph; in TEST() local
55 Node** nodes = graph.zone()->NewArray<Node*>(kSize); in TEST()
[all …]
|
| D | test-scheduler.cc | 88 static Schedule* ComputeAndVerifySchedule(int expected, Graph* graph) { in ComputeAndVerifySchedule() argument
91 os << AsDOT(*graph); in ComputeAndVerifySchedule()
94 Schedule* schedule = Scheduler::ComputeSchedule(graph); in ComputeAndVerifySchedule()
622 Graph graph(scope.main_zone()); in TEST() local
624 graph.SetStart(graph.NewNode(builder.Start(0))); in TEST()
625 graph.SetEnd(graph.NewNode(builder.End(), graph.start())); in TEST()
627 USE(Scheduler::ComputeSchedule(&graph)); in TEST()
633 Graph graph(scope.main_zone()); in TEST() local
635 graph.SetStart(graph.NewNode(builder.Start(0))); in TEST()
637 Node* p1 = graph.NewNode(builder.Parameter(0), graph.start()); in TEST()
[all …]
|
| D | test-schedule.cc | 33 Graph graph(scope.main_zone()); in TEST() local
34 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
35 Node* n1 = graph.NewNode(&dummy_operator); in TEST()
47 Node* n2 = graph.NewNode(&dummy_operator); in TEST()
79 Graph graph(scope.main_zone()); in TEST() local
81 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
82 Node* b = graph.NewNode(common.Branch(), n0); in TEST()
104 Graph graph(scope.main_zone()); in TEST() local
105 Node* n0 = graph.NewNode(&dummy_operator); in TEST()
118 Graph graph(scope.main_zone()); in TEST() local
[all …]
|
| D | simplified-graph-builder.cc | 15 Graph* graph, CommonOperatorBuilder* common, in SimplifiedGraphBuilder() argument
17 : GraphBuilder(graph), in SimplifiedGraphBuilder()
26 DCHECK(graph()->start() == NULL); in Begin()
27 Node* start = graph()->NewNode(common()->Start(num_parameters)); in Begin()
28 graph()->SetStart(start); in Begin()
35 graph()->NewNode(common()->Return(), value, effect_, graph()->start()); in Return()
41 Node* end = graph()->NewNode(common()->End(), return_); in End()
42 graph()->SetEnd(end); in End()
61 result = graph()->NewNode(op, value_input_count, value_inputs); in MakeNode()
73 *current_input++ = graph()->start(); in MakeNode()
[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 | change-lowering.cc | 18 Node* control = graph()->start(); in Reduce()
71 Node* effect = graph()->NewNode(common()->ValueEffect(1), value); in AllocateHeapNumberWithValue()
77 Node* heap_number = graph()->NewNode( in AllocateHeapNumberWithValue()
81 Node* store = graph()->NewNode( in AllocateHeapNumberWithValue()
84 return graph()->NewNode(common()->Finish(1), heap_number, store); in AllocateHeapNumberWithValue()
89 value = graph()->NewNode(machine()->WordSar(), value, SmiShiftBitsConstant()); in ChangeSmiToInt32()
91 value = graph()->NewNode(machine()->TruncateInt64ToInt32(), value); in ChangeSmiToInt32()
98 return graph()->NewNode(machine()->Load(kMachFloat64), value, in LoadHeapNumberValue()
100 graph()->NewNode(common()->ControlEffect(), control)); in LoadHeapNumberValue()
105 Node* branch = graph()->NewNode(common()->Branch(), val, control); in ChangeBitToBool()
[all …]
|
| D | simplified-operator-reducer-unittest.cc | 27 JSGraph jsgraph(graph(), common(), &javascript, &typer, &machine); in Reduce()
165 graph()->NewNode((simplified()->*unop.constructor)(), Parameter(0))); in TEST_P()
182 graph()->NewNode(simplified()->BooleanNot(), in TEST_F()
183 graph()->NewNode(simplified()->BooleanNot(), param0))); in TEST_F()
191 Reduce(graph()->NewNode(simplified()->BooleanNot(), FalseConstant())); in TEST_F()
199 Reduce(graph()->NewNode(simplified()->BooleanNot(), TrueConstant())); in TEST_F()
211 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
213 graph()->NewNode(simplified()->ChangeBoolToBit(), param0))); in TEST_F()
221 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(0))); in TEST_F()
229 graph()->NewNode(simplified()->ChangeBitToBool(), Int32Constant(1))); in TEST_F()
[all …]
|
| D | pipeline.cc | 90 void Pipeline::VerifyAndPrintGraph(Graph* graph, const char* phase) { in VerifyAndPrintGraph() argument
109 of << AsDOT(*graph); in VerifyAndPrintGraph()
116 if (VerifyGraphs()) Verifier::Run(graph); in VerifyAndPrintGraph()
176 Graph graph(zone()); in GenerateCode() local
177 SourcePositionTable source_positions(&graph); in GenerateCode()
186 JSGraph jsgraph(&graph, &common, &javascript, &typer, &machine); in GenerateCode()
200 GraphReducer graph_reducer(&graph); in GenerateCode()
208 VerifyAndPrintGraph(&graph, "Initial untyped"); in GenerateCode()
216 VerifyAndPrintGraph(&graph, "Context specialized"); in GenerateCode()
224 VerifyAndPrintGraph(&graph, "Inlined"); in GenerateCode()
[all …]
|
| D | machine-operator-reducer-unittest.cc | 24 JSGraph jsgraph(graph(), common(), &javascript, &typer, &machine_); in Reduce()
235 Reduce(graph()->NewNode((machine()->*unop.constructor)(), Parameter(0))); in TEST_P()
251 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
266 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
268 graph()->NewNode(machine()->ChangeInt32ToFloat64(), value))); in TEST_F()
276 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
291 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
293 graph()->NewNode(machine()->ChangeUint32ToFloat64(), value))); in TEST_F()
301 Reduction reduction = Reduce(graph()->NewNode( in TEST_F()
316 graph()->NewNode(machine()->ChangeInt32ToFloat64(), Int32Constant(x))); in TEST_F()
[all …]
|
| D | value-numbering-reducer-unittest.cc | 30 Graph* graph() { return &graph_; } in graph() function in v8::internal::compiler::ValueNumberingReducerTest
39 Node* na = graph()->NewNode(&kOp0); in TEST_F()
40 Node* nb = graph()->NewNode(&kOp0); in TEST_F()
41 Node* n1 = graph()->NewNode(&kOp0, na); in TEST_F()
42 Node* n2 = graph()->NewNode(&kOp0, nb); in TEST_F()
49 Node* n0 = graph()->NewNode(&kOp0); in TEST_F()
50 Node* n1 = graph()->NewNode(&kOp1, n0); in TEST_F()
53 EXPECT_FALSE(Reduce(graph()->NewNode(&kOp1, n0)).Changed()); in TEST_F()
63 inputs[i] = graph()->NewNode(new (zone()) SimpleOperator( in TEST_F()
70 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); in TEST_F()
[all …]
|
| /external/libvorbis/examples/ |
| D | frameview.pl | 289 my($graph)=@_;
294 my$w=$graph->{"canvas"};
304 if($graph->{"vars"}->[$i]){
306 if(!defined($graph->{"minx"})){
308 $graph->{"maxx"}=$1;
309 $graph->{"minx"}=$1;
310 $graph->{"maxy"}=$2;
311 $graph->{"miny"}=$2;
317 $rescale=1 if($1>$graph->{"maxx"});
318 $rescale=1 if($1<$graph->{"minx"});
[all …]
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_graph.cpp | 49 node->graph = this; in insert()
88 in(0), out(0), graph(0), in Node()
119 assert(graph || node->graph); in attach()
120 if (!node->graph) in attach()
121 graph->insert(node); in attach()
122 if (!graph) in attach()
123 node->graph->insert(this); in attach()
126 graph->classifyEdges(); in attach()
151 if (graph) { in cut()
152 if (graph->root == this) in cut()
[all …]
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/de-DE/ |
| D | de-DE_kdt_posp.dtfmt | 19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/fr-FR/ |
| D | fr-FR_kdt_posp.dtfmt | 19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/es-ES/ |
| D | es-ES_kdt_posp.dtfmt | 19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-GB/ |
| D | en-GB_kdt_posp.dtfmt | 19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/it-IT/ |
| D | it-IT_kdt_posp.dtfmt | 19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
|
| /external/svox/pico_resources/tools/LingwareBuilding/PicoLingware_source_files/textana/en-US/ |
| D | en-US_kdt_posp.dtfmt | 19 ! - graph (grapheme values)
26 :ATTR "1" :PROP type = graph
28 :ATTR "2" :PROP type = graph
30 :ATTR "3" :PROP type = graph
32 :ATTR "4" :PROP type = graph
34 :ATTR "5" :PROP type = graph
36 :ATTR "6" :PROP type = graph
38 :ATTR "7" :PROP type = graph
40 :ATTR "8" :PROP type = graph
42 :ATTR "9" :PROP type = graph
[all …]
|
| /external/opencv/cvaux/src/ |
| D | cvclique.cpp | 92 void _MarkNodes( CvGraph* graph )
95 for( int i = 0; i < graph->total; i++ )
97 CvGraphVtx* ver = cvGetGraphVtx( graph, i );
105 void _FillAdjMatrix( CvGraph* graph, int** connected, int reverse )
108 for( int i = 0; i < graph->total; i++ )
110 for( int j = 0; j < graph->total; j++ )
115 CvGraphVtx* ver = cvGetGraphVtx( graph, i );
129 void cvStartFindCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse, int weighted, int wei…
137 finder->vertex_weights = (float*)malloc( sizeof(float)*(graph->total+1));
138 finder->cur_weight = (float*)malloc( sizeof(float)*(graph->total+1));
[all …]
|