| /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/chromium_org/components/keyed_service/core/ |
| D | dependency_graph_unittest.cc | 15 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/ |
| 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-mark-unreachable.h | 16 explicit HMarkUnreachableBlocksPhase(HGraph* graph) in HMarkUnreachableBlocksPhase()
|
| D | hydrogen-canonicalize.h | 16 explicit HCanonicalizePhase(HGraph* graph) in HCanonicalizePhase()
|
| D | hydrogen-removable-simulates.h | 16 explicit HMergeRemovableSimulatesPhase(HGraph* graph) in HMergeRemovableSimulatesPhase()
|
| D | hydrogen-sce.h | 16 explicit HStackCheckEliminationPhase(HGraph* graph) in HStackCheckEliminationPhase()
|
| D | hydrogen-load-elimination.h | 15 explicit HLoadEliminationPhase(HGraph* graph) in HLoadEliminationPhase()
|
| D | hydrogen-redundant-phi.h | 18 explicit HRedundantPhiEliminationPhase(HGraph* graph) in HRedundantPhiEliminationPhase()
|
| D | hydrogen-dehoist.h | 16 explicit HDehoistIndexComputationsPhase(HGraph* graph) in HDehoistIndexComputationsPhase()
|
| D | hydrogen-store-elimination.h | 16 explicit HStoreEliminationPhase(HGraph* graph) in HStoreEliminationPhase()
|
| D | hydrogen-dce.h | 16 explicit HDeadCodeEliminationPhase(HGraph* graph) in HDeadCodeEliminationPhase()
|
| /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/chromium_org/tools/ |
| D | gyp-explain.py | 23 def GetPath(graph, fro, to): argument
36 def MatchNode(graph, substring): argument
|
| /external/chromium_org/third_party/angle/src/compiler/translator/timing/ |
| D | RestrictFragmentShaderTiming.cpp | 47 void RestrictFragmentShaderTiming::enforceRestrictions(const TDependencyGraph& graph) in enforceRestrictions()
67 …d RestrictFragmentShaderTiming::validateUserDefinedFunctionCallUsage(const TDependencyGraph& graph) in validateUserDefinedFunctionCallUsage()
|
| /external/chromium_org/cc/resources/ |
| D | task_graph_runner_perftest.cc | 72 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/regex-re2/benchlog/ |
| D | mktable | 34 sub graph() { subroutine
|
| /external/chromium_org/third_party/re2/benchlog/ |
| D | mktable | 34 sub graph() { subroutine
|
| /external/clang/test/PCH/Inputs/ |
| D | typo.hpp | 4 namespace graph { namespace
|