| /external/v8/test/cctest/compiler/ |
| D | test-node.cc | 21 GraphTester graph; in TEST() local
29 GraphTester graph; in TEST() local
38 GraphTester graph; in TEST() local
47 GraphTester graph; in TEST() local
58 GraphTester graph; in TEST() local
70 GraphTester graph; in TEST() local
82 GraphTester graph; in TEST() local
94 GraphTester graph; in TEST() local
108 GraphTester graph; in TEST() local
119 GraphTester graph; in TEST() local
[all …]
|
| D | test-graph-reducer.cc | 61 explicit NewABReducer(Graph* graph) : graph_(graph) {} in NewABReducer()
107 explicit A0Wrapper(Graph* graph) : graph_(graph) {} in A0Wrapper()
123 explicit B0Wrapper(Graph* graph) : graph_(graph) {} in B0Wrapper()
199 GraphTester graph; in TEST() local
215 GraphTester graph; in TEST() local
235 GraphTester graph; in TEST() local
258 GraphTester graph; in TEST() local
288 GraphTester graph; in TEST() local
327 GraphTester graph; in TEST() local
349 GraphTester graph; in TEST() local
[all …]
|
| D | test-node-cache.cc | 15 GraphTester graph; in TEST() local
30 GraphTester graph; in TEST() local
52 GraphTester graph; in TEST() local
78 GraphTester graph; in TEST() local
93 GraphTester graph; in TEST() local
119 GraphTester graph; in TEST() local
136 GraphTester graph; in TEST() local
|
| D | test-node-algorithm.cc | 47 GraphWithStartNodeTester graph; in TEST() local
57 GraphWithStartNodeTester graph; in TEST() local
77 GraphWithStartNodeTester graph; in TEST() local
96 GraphWithStartNodeTester graph; in TEST() local
123 GraphWithStartNodeTester graph; in TEST() local
158 GraphWithStartNodeTester graph; in TEST() local
217 GraphWithStartNodeTester graph; in TEST() local
313 GraphWithStartNodeTester graph; in TEST() local
|
| D | test-schedule.cc | 33 Graph graph(scope.main_zone()); in TEST() local
79 Graph graph(scope.main_zone()); in TEST() local
104 Graph graph(scope.main_zone()); in TEST() local
118 Graph graph(scope.main_zone()); in TEST() local
132 Graph graph(scope.main_zone()); in TEST() local
|
| /external/ceres-solver/internal/ceres/ |
| D | graph_test.cc | 41 Graph<int> graph; in TEST() local
46 Graph<int> graph; in TEST() local
62 Graph<int> graph; in TEST() local
87 Graph<int> graph; in TEST() local
97 Graph<int> graph; in TEST() local
|
| D | graph_algorithms_test.cc | 44 Graph<int> graph; in TEST() local
74 Graph<int> graph; in TEST() local
105 Graph<int> graph; in TEST() local
122 Graph<int> graph; in TEST() local
169 Graph<int> graph; in TEST() local
201 Graph<int> graph; in TEST() local
|
| D | single_linkage_clustering_test.cc | 46 Graph<int> graph; in TEST() local
73 Graph<int> graph; in TEST() local
102 Graph<int> graph; in TEST() local
|
| D | graph_algorithms.h | 51 explicit VertexTotalOrdering(const Graph<Vertex>& graph) in VertexTotalOrdering()
68 explicit VertexDegreeLessThan(const Graph<Vertex>& graph) in VertexDegreeLessThan()
96 int IndependentSetOrdering(const Graph<Vertex>& graph, in IndependentSetOrdering()
172 int StableIndependentSetOrdering(const Graph<Vertex>& graph, in StableIndependentSetOrdering()
274 Degree2MaximumSpanningForest(const Graph<Vertex>& graph) { in Degree2MaximumSpanningForest()
|
| D | parameter_block_ordering.cc | 49 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeStableSchurOrdering() local
75 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeSchurOrdering() local
94 scoped_ptr<Graph< ParameterBlock*> > graph(CreateHessianGraph(program)); in ComputeRecursiveIndependentSetOrdering() local
114 Graph<ParameterBlock*>* graph = CHECK_NOTNULL(new Graph<ParameterBlock*>); in CreateHessianGraph() local
|
| D | parameter_block_ordering_test.cc | 86 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
131 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
140 scoped_ptr<HessianGraph> graph(CreateHessianGraph(program)); in TEST_F() local
|
| /external/fio/ |
| D | graph.c | 77 struct graph { struct
86 graph_axis_unit_change_callback x_axis_unit_change_callback; argument
87 graph_axis_unit_change_callback y_axis_unit_change_callback; argument
89 unsigned int dont_graph_all_zeroes; argument
105 void graph_set_size(struct graph *g, unsigned int xdim, unsigned int ydim) in graph_set_size() argument
|
| /external/v8/src/ |
| D | hydrogen-mark-deoptimize.h | 21 explicit HMarkDeoptimizeOnUndefinedPhase(HGraph* graph) in HMarkDeoptimizeOnUndefinedPhase()
40 explicit HComputeChangeUndefinedToNaN(HGraph* graph) in HComputeChangeUndefinedToNaN()
|
| D | hydrogen-representation-changes.h | 16 explicit HRepresentationChangesPhase(HGraph* graph) in HRepresentationChangesPhase()
|
| D | hydrogen-dehoist.h | 16 explicit HDehoistIndexComputationsPhase(HGraph* graph) in HDehoistIndexComputationsPhase()
|
| D | hydrogen-load-elimination.h | 15 explicit HLoadEliminationPhase(HGraph* graph) in HLoadEliminationPhase()
|
| D | hydrogen-removable-simulates.h | 16 explicit HMergeRemovableSimulatesPhase(HGraph* graph) in HMergeRemovableSimulatesPhase()
|
| D | hydrogen-redundant-phi.h | 18 explicit HRedundantPhiEliminationPhase(HGraph* graph) in HRedundantPhiEliminationPhase()
|
| D | hydrogen-sce.h | 16 explicit HStackCheckEliminationPhase(HGraph* graph) in HStackCheckEliminationPhase()
|
| D | hydrogen-mark-unreachable.h | 16 explicit HMarkUnreachableBlocksPhase(HGraph* graph) in HMarkUnreachableBlocksPhase()
|
| D | hydrogen-canonicalize.h | 16 explicit HCanonicalizePhase(HGraph* graph) in HCanonicalizePhase()
|
| /external/v8/src/compiler/ |
| D | generic-algorithm-inl.h | 27 static int max_id(GenericGraphBase* graph) { return graph->NodeCount(); } in max_id()
40 static int max_id(GenericGraphBase* graph) { return graph->NodeCount(); } in max_id()
|
| D | pipeline.cc | 90 void Pipeline::VerifyAndPrintGraph(Graph* graph, const char* phase) { in VerifyAndPrintGraph()
176 Graph graph(zone()); in GenerateCode() local
331 Schedule* Pipeline::ComputeSchedule(Graph* graph) { in ComputeSchedule()
341 Graph* graph, in GenerateCodeForMachineGraph()
363 Handle<Code> Pipeline::GenerateCode(Linkage* linkage, Graph* graph, in GenerateCode()
|
| D | js-graph.h | 26 JSGraph(Graph* graph, CommonOperatorBuilder* common, in JSGraph()
86 Graph* graph() { return graph_; } in graph() function
|
| /external/regex-re2/benchlog/ |
| D | mktable | 34 sub graph() { subroutine
|