Home
last modified time | relevance | path

Searched defs:graph (Results 1 – 25 of 155) sorted by relevance

1234567

/external/chromium_org/v8/test/cctest/compiler/
Dtest-node.cc21 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 …]
Dtest-graph-reducer.cc61 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 …]
Dtest-node-cache.cc15 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
Dtest-schedule.cc33 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
Dtest-node-algorithm.cc47 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
/external/ceres-solver/internal/ceres/
Dgraph_test.cc41 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
Dgraph_algorithms_test.cc44 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
Dsingle_linkage_clustering_test.cc46 Graph<int> graph; in TEST() local
73 Graph<int> graph; in TEST() local
102 Graph<int> graph; in TEST() local
Dgraph_algorithms.h51 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()
Dparameter_block_ordering.cc49 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
Dparameter_block_ordering_test.cc86 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/chromium_org/components/keyed_service/core/
Ddependency_graph_unittest.cc15 explicit DummyNode(DependencyGraph* graph) : dependency_graph_(graph) { in DummyNode()
29 DependencyGraph graph; in TEST_F() local
45 DependencyGraph graph; in TEST_F() local
66 DependencyGraph graph; in TEST_F() local
91 DependencyGraph graph; in TEST_F() local
127 DependencyGraph graph; in TEST_F() local
/external/chromium_org/v8/src/
Dhydrogen-mark-deoptimize.h21 explicit HMarkDeoptimizeOnUndefinedPhase(HGraph* graph) in HMarkDeoptimizeOnUndefinedPhase()
40 explicit HComputeChangeUndefinedToNaN(HGraph* graph) in HComputeChangeUndefinedToNaN()
Dhydrogen-canonicalize.h16 explicit HCanonicalizePhase(HGraph* graph) in HCanonicalizePhase()
Dhydrogen-redundant-phi.h18 explicit HRedundantPhiEliminationPhase(HGraph* graph) in HRedundantPhiEliminationPhase()
Dhydrogen-dehoist.h16 explicit HDehoistIndexComputationsPhase(HGraph* graph) in HDehoistIndexComputationsPhase()
Dhydrogen-removable-simulates.h16 explicit HMergeRemovableSimulatesPhase(HGraph* graph) in HMergeRemovableSimulatesPhase()
Dhydrogen-representation-changes.h16 explicit HRepresentationChangesPhase(HGraph* graph) in HRepresentationChangesPhase()
Dhydrogen-mark-unreachable.h16 explicit HMarkUnreachableBlocksPhase(HGraph* graph) in HMarkUnreachableBlocksPhase()
/external/fio/
Dgraph.c77 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/chromium_org/tools/
Dgyp-explain.py23 def GetPath(graph, fro, to): argument
36 def MatchNode(graph, substring): argument
/external/chromium_org/third_party/angle/src/compiler/translator/timing/
DRestrictFragmentShaderTiming.cpp47 void RestrictFragmentShaderTiming::enforceRestrictions(const TDependencyGraph& graph) in enforceRestrictions()
67 …d RestrictFragmentShaderTiming::validateUserDefinedFunctionCallUsage(const TDependencyGraph& graph) in validateUserDefinedFunctionCallUsage()
/external/chromium_org/cc/resources/
Dtask_graph_runner_perftest.cc72 TaskGraph graph; in RunBuildTaskGraphTest() local
102 TaskGraph graph; in RunScheduleTasksTest() local
144 TaskGraph graph; in RunScheduleAlternateTasksTest() local
187 TaskGraph graph; in RunScheduleAndExecuteTasksTest() local
233 TaskGraph* graph) { in BuildTaskGraph()
/external/chromium_org/v8/src/compiler/
Dgeneric-algorithm-inl.h27 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()
/external/chromium_org/third_party/re2/benchlog/
Dmktable34 sub graph() { subroutine

1234567