Searched defs:graph (Results 1 - 25 of 331) sorted by relevance

1234567891011>>

/external/clang/test/PCH/Inputs/
H A Dtypo.hpp4 namespace graph { namespace in namespace:boost
/external/tensorflow/tensorflow/core/graph/
H A Dtestlib.h26 #include "tensorflow/core/graph/graph.h"
27 #include "tensorflow/core/graph/types.h"
32 namespace graph { namespace in namespace:tensorflow::test
38 // A few helpers to construct a graph.
212 } // end namespace graph
H A Dvalidate.h19 #include "tensorflow/core/framework/graph.pb.h"
24 namespace graph { namespace in namespace:tensorflow
53 } // namespace graph
H A Ddefault_device.h21 #include "tensorflow/core/framework/graph.pb.h"
25 namespace graph { namespace in namespace:tensorflow
38 } // namespace graph
H A Dgraph_def_builder_util.cc15 #include "tensorflow/core/graph/graph_def_builder_util.h"
17 #include "tensorflow/core/graph/graph_constructor.h"
21 Status GraphDefBuilderToGraph(const GraphDefBuilder& builder, Graph* graph) { argument
25 return ConvertGraphDefToGraph(opts, graph_def, graph);
/external/v8/src/crankshaft/
H A Dhydrogen-canonicalize.h16 explicit HCanonicalizePhase(HGraph* graph) argument
17 : HPhase("H_Canonicalize", graph) { }
H A Dhydrogen-dehoist.h16 explicit HDehoistIndexComputationsPhase(HGraph* graph) argument
17 : HPhase("H_Dehoist index computations", graph) { }
H A Dhydrogen-load-elimination.h15 explicit HLoadEliminationPhase(HGraph* graph) argument
16 : HPhase("H_Load elimination", graph) { }
H A Dhydrogen-mark-unreachable.h16 explicit HMarkUnreachableBlocksPhase(HGraph* graph) argument
17 : HPhase("H_Mark unreachable blocks", graph) { }
H A Dhydrogen-redundant-phi.h18 explicit HRedundantPhiEliminationPhase(HGraph* graph) argument
19 : HPhase("H_Redundant phi elimination", graph) { }
H A Dhydrogen-removable-simulates.h16 explicit HMergeRemovableSimulatesPhase(HGraph* graph) argument
17 : HPhase("H_Merge removable simulates", graph) { }
H A Dhydrogen-representation-changes.h16 explicit HRepresentationChangesPhase(HGraph* graph) argument
17 : HPhase("H_Representation changes", graph) { }
H A Dhydrogen-sce.h16 explicit HStackCheckEliminationPhase(HGraph* graph) argument
17 : HPhase("H_Stack check elimination", graph) { }
H A Dhydrogen-dce.h16 explicit HDeadCodeEliminationPhase(HGraph* graph) argument
17 : HPhase("H_Dead code elimination", graph) { }
H A Dhydrogen-infer-representation.h16 explicit HInferRepresentationPhase(HGraph* graph) argument
17 : HPhase("H_Infer representations", graph),
19 in_worklist_(graph->GetMaximumValueID(), zone()) { }
H A Dhydrogen-store-elimination.h16 explicit HStoreEliminationPhase(HGraph* graph) argument
17 : HPhase("H_Store elimination", graph),
H A Dhydrogen-uint32-analysis.h18 explicit HUint32AnalysisPhase(HGraph* graph) argument
19 : HPhase("H_Compute safe UInt32 operations", graph), phis_(4, zone()) { }
/external/testng/src/test/java/test/
H A DDynamicGraphTest.java13 private static <T> void assertFreeNodesEquals(DynamicGraph<T> graph, T[] expected) { argument
14 Assert.assertEqualsNoOrder(graph.getFreeNodes().toArray(), expected);
/external/v8/src/compiler/
H A Dnode-marker.cc7 #include "src/compiler/graph.h"
13 NodeMarkerBase::NodeMarkerBase(Graph* graph, uint32_t num_states) argument
14 : mark_min_(graph->mark_max_), mark_max_(graph->mark_max_ += num_states) {
/external/guice/extensions/grapher/src/com/google/inject/grapher/
H A DInjectorGrapher.java26 * Guice injector grapher. Renders the guice dependency graph for an injector. It can render the
27 * whole dependency graph or just transitive dependencies of a given set of nodes.
35 * Graphs the guice dependency graph for the given injector using default starting keys.
37 void graph(Injector injector) throws IOException; method in interface:InjectorGrapher
40 * Graphs the guice dependency graph for the given injector using the given starting keys and
43 void graph(Injector injector, Set<Key<?>> root) throws IOException; method in interface:InjectorGrapher
/external/skia/src/core/
H A DSkTTopoSort.h16 void SkTTopoSort_CheckAllUnmarked(const SkTArray<sk_sp<T>>& graph) { argument
17 for (int i = 0; i < graph.count(); ++i) {
18 SkASSERT(!Traits::IsTempMarked(graph[i].get()));
19 SkASSERT(!Traits::WasOutput(graph[i].get()));
24 void SkTTopoSort_CleanExit(const SkTArray<sk_sp<T>>& graph) { argument
25 for (int i = 0; i < graph.count(); ++i) {
26 SkASSERT(!Traits::IsTempMarked(graph[i].get()));
27 SkASSERT(Traits::WasOutput(graph[i].get()));
61 // Topologically sort the nodes in 'graph'. For this sort, when node 'i' depends
63 // A false return value means there was a loop and the contents of 'graph' wil
82 SkTTopoSort(SkTArray<sk_sp<T>>* graph) argument
[all...]
/external/skqp/src/core/
H A DSkTTopoSort.h15 void SkTTopoSort_CheckAllUnmarked(const SkTDArray<T*>& graph) { argument
16 for (int i = 0; i < graph.count(); ++i) {
17 SkASSERT(!Traits::IsTempMarked(graph[i]));
18 SkASSERT(!Traits::WasOutput(graph[i]));
23 void SkTTopoSort_CleanExit(const SkTDArray<T*>& graph) { argument
24 for (int i = 0; i < graph.count(); ++i) {
25 SkASSERT(!Traits::IsTempMarked(graph[i]));
26 SkASSERT(Traits::WasOutput(graph[i]));
60 // Topologically sort the nodes in 'graph'. For this sort, when node 'i' depends
62 // A false return value means there was a loop and the contents of 'graph' wil
81 SkTTopoSort(SkTDArray<T*>* graph) argument
[all...]
/external/tensorflow/tensorflow/core/common_runtime/
H A Dfunction.h26 #include "tensorflow/core/graph/graph.h"
76 Graph* graph = nullptr; // owned. member in struct:tensorflow::FunctionBody
88 // Debugging facility. Returns a debug string for a graph
116 // For each node in "graph", if "lib" indicates that the node is a
120 // This routine goes through "graph" nodes once and applies the
121 // inlining. The caller may decide to apply the inlining on "graph"
123 bool ExpandInlineFunctions(FunctionLibraryRuntime* lib, Graph* graph);
125 // Dump the contents of the "graph" to log files if the logging level is
129 // Applies graph rewrit
[all...]
/external/tensorflow/tensorflow/core/grappler/utils/
H A Dgrappler_test.cc26 const GraphDef& graph, const std::vector<string>& node_names) {
29 TF_CHECK_OK(session->Create(graph));
25 EvaluateNodes( const GraphDef& graph, const std::vector<string>& node_names) argument
H A Dtopological_sort.cc29 Status TopologicalSort(GraphDef* graph) { argument
31 TF_RETURN_IF_ERROR(graph_view.Initialize(*graph));
44 if (IsMerge(graph->node(i))) {
46 if (IsNextIteration(graph->node(input))) {
67 "The graph couldn't be sorted in topological order.");
70 PermuteNodesInPlace(graph, &ready_nodes, /*invert_permutation=*/true);

Completed in 417 milliseconds

1234567891011>>