| /external/clang/test/PCH/Inputs/ |
| typo.hpp | 4 namespace graph { namespace in namespace:boost
|
| /external/tensorflow/tensorflow/core/graph/ |
| testlib.h | 26 #include "tensorflow/core/graph/graph.h"
27 #include "tensorflow/core/graph/types.h"
32 namespace graph { namespace in namespace:tensorflow::test
36 void ToGraphDef(Graph* g, GraphDef* def);
38 // A few helpers to construct a graph.
41 Node* Constant(Graph* g, const Tensor& tensor);
42 Node* Constant(Graph* g, const Tensor& tensor, const string& name);
49 Node* HostConstant(Graph* g, const Tensor& tensor);
50 Node* HostConstant(Graph* g, const Tensor& tensor, const string& name)
[all...] |
| validate.h | 19 #include "tensorflow/core/framework/graph.pb.h"
21 #include "tensorflow/core/graph/graph.h"
25 namespace graph { namespace in namespace:tensorflow
54 // Validate that the graph has no cycle except for legal while loop cycles.
60 Status ValidateGraphHasNoCycle(const Graph& graph);
62 // Returns OK if the graph has no duplicate node names.
63 Status VerifyNoDuplicateNodeNames(const GraphDef& graph);
65 } // namespace graph
[all...] |
| default_device.h | 21 #include "tensorflow/core/framework/graph.pb.h"
25 namespace graph { namespace in namespace:tensorflow
38 } // namespace graph
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| InjectorGrapher.java | 25 * Guice injector grapher. Renders the guice dependency graph for an injector. It can render the
26 * whole dependency graph or just transitive dependencies of a given set of nodes.
33 /** Graphs the guice dependency graph for the given injector using default starting keys. */
34 void graph(Injector injector) throws IOException; method in interface:InjectorGrapher
37 * Graphs the guice dependency graph for the given injector using the given starting keys and
40 void graph(Injector injector, Set<Key<?>> root) throws IOException; method in interface:InjectorGrapher
|
| /external/tensorflow/tensorflow/contrib/predictor/ |
| predictor.py | 30 def graph(self): member in class:Predictor
|
| /external/testng/src/main/java/org/testng/internal/thread/graph/ |
| IThreadWorkerFactory.java | 1 package org.testng.internal.thread.graph;
|
| IWorker.java | 1 package org.testng.internal.thread.graph;
|
| /art/compiler/optimizing/ |
| dominator_test.cc | 35 HGraph* graph = CreateCFG(data); local
36 ASSERT_EQ(graph->GetBlocks().size(), blocks_length);
39 if (graph->GetBlocks()[i] == nullptr) {
43 ASSERT_EQ(nullptr, graph->GetBlocks()[i]->GetDominator());
44 ASSERT_TRUE(graph->GetBlocks()[i]->IsEntryBlock());
47 ASSERT_NE(nullptr, graph->GetBlocks()[i]->GetDominator());
48 ASSERT_EQ(blocks[i], graph->GetBlocks()[i]->GetDominator()->GetBlockId());
|
| graph_checker_test.cc | 29 * Create a simple control-flow graph composed of two blocks:
37 HGraph* graph = CreateGraph(); local
38 HBasicBlock* entry_block = new (GetAllocator()) HBasicBlock(graph);
40 graph->AddBlock(entry_block);
41 graph->SetEntryBlock(entry_block);
42 HBasicBlock* exit_block = new (GetAllocator()) HBasicBlock(graph);
44 graph->AddBlock(exit_block);
45 graph->SetExitBlock(exit_block);
47 graph->BuildDominatorTree();
48 return graph;
52 HGraph* graph = CreateCFG(data); local
98 HGraph* graph = CreateSimpleCFG(); local
113 HGraph* graph = CreateSimpleCFG(); local
[all...] |
| linearize_test.cc | 43 HGraph* graph = CreateCFG(data); local
44 std::unique_ptr<CodeGenerator> codegen = CodeGenerator::Create(graph, *compiler_options_);
45 SsaLivenessAnalysis liveness(graph, codegen.get(), GetScopedAllocator());
48 ASSERT_EQ(graph->GetLinearOrder().size(), number_of_blocks);
50 ASSERT_EQ(graph->GetLinearOrder()[i]->GetBlockId(), expected_order[i]);
55 // Structure of this graph (+ are back edges)
80 // Structure of this graph (+ are back edges)
105 // Structure of this graph (+ are back edges)
132 /* Structure of this graph (+ are back edges)
162 /* Structure of this graph (+ are back edges
[all...] |
| pretty_printer_test.cc | 36 HGraph* graph = CreateCFG(data); local
37 StringPrettyPrinter printer(graph);
|
| suspend_check_test.cc | 37 HGraph* graph = CreateCFG(data); local
38 HBasicBlock* first_block = graph->GetEntryBlock()->GetSingleSuccessor();
|
| dead_code_elimination_test.cc | 38 HGraph* graph = CreateCFG(data); local
39 ASSERT_NE(graph, nullptr);
41 StringPrettyPrinter printer_before(graph);
46 HDeadCodeElimination(graph, /* stats= */ nullptr, "dead_code_elimination").Run();
47 GraphChecker graph_checker(graph);
51 StringPrettyPrinter printer_after(graph);
|
| find_loops_test.cc | 38 HGraph* graph = CreateCFG(data); local
39 for (HBasicBlock* block : graph->GetBlocks()) {
49 HGraph* graph = CreateCFG(data); local
50 for (HBasicBlock* block : graph->GetBlocks()) {
63 HGraph* graph = CreateCFG(data); local
64 for (HBasicBlock* block : graph->GetBlocks()) {
78 HGraph* graph = CreateCFG(data); local
79 for (HBasicBlock* block : graph->GetBlocks()) {
91 HGraph* graph = CreateCFG(data); local
92 for (HBasicBlock* block : graph->GetBlocks())
135 HGraph* graph = CreateCFG(data); local
161 HGraph* graph = CreateCFG(data); local
184 HGraph* graph = CreateCFG(data); local
208 HGraph* graph = CreateCFG(data); local
232 HGraph* graph = CreateCFG(data); local
255 HGraph* graph = CreateCFG(data); local
284 HGraph* graph = CreateCFG(data); local
312 HGraph* graph = CreateCFG(data); local
326 HGraph* graph = CreateCFG(data); local
[all...] |
| live_ranges_test.cc | 36 HGraph* graph = CreateCFG(data); local
39 RemoveSuspendChecks(graph);
41 PrepareForRegisterAllocation(graph, *compiler_options_).Run();
42 return graph;
50 * Which becomes the following graph (numbered by lifetime position):
62 HGraph* graph = BuildGraph(data); local
64 std::unique_ptr<CodeGenerator> codegen = CodeGenerator::Create(graph, *compiler_options_);
65 SsaLivenessAnalysis liveness(graph, codegen.get(), GetScopedAllocator());
73 HBasicBlock* block = graph->GetBlocks()[1];
88 * Which becomes the following graph (numbered by lifetime position)
107 HGraph* graph = BuildGraph(data); local
154 HGraph* graph = BuildGraph(data); local
228 HGraph* graph = BuildGraph(data); local
304 HGraph* graph = BuildGraph(data); local
378 HGraph* graph = BuildGraph(data); local
[all...] |
| liveness_test.cc | 48 HGraph* graph = CreateCFG(data); local
50 PrepareForRegisterAllocation(graph, *compiler_options_).Run();
51 std::unique_ptr<CodeGenerator> codegen = CodeGenerator::Create(graph, *compiler_options_);
52 SsaLivenessAnalysis liveness(graph, codegen.get(), GetScopedAllocator());
56 for (HBasicBlock* block : graph->GetBlocks()) {
|
| pc_relative_fixups_mips.cc | 29 PCRelativeHandlerVisitor(HGraph* graph, CodeGenerator* codegen)
30 : HGraphVisitor(graph),
113 HGraph* graph = GetGraph(); variable
115 HMipsPackedSwitch* mips_switch = new (graph->GetAllocator()) HMipsPackedSwitch(
|
| ssa_test.cc | 39 explicit SsaPrettyPrinter(HGraph* graph) : HPrettyPrinter(graph), str_("") {}
71 static void ReNumberInstructions(HGraph* graph) {
73 for (HBasicBlock* block : graph->GetBlocks()) {
84 HGraph* graph = CreateCFG(data); local
87 RemoveSuspendChecks(graph);
88 ReNumberInstructions(graph);
91 for (HBasicBlock* block : graph->GetBlocks()) {
97 SsaPrettyPrinter printer(graph);
|
| /external/dagger2/compiler/src/main/java/dagger/internal/codegen/ |
| MissingBindingSuggestions.java | 23 * Utility code that looks for bindings matching a key in all subcomponents in a binding graph so
30 * Searches the entire binding graph from the top-level graph for a binding matching
39 BindingGraph graph = graphsToTry.removeLast(); local
40 ResolvedBindings bindings = graph.resolvedBindings().get(key);
42 graphsToTry.addAll(graph.subgraphs().values());
45 + graph.componentDescriptor().componentDefinitionType().getQualifiedName());
|
| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/op/ |
| Scope.java | 18 import org.tensorflow.Graph;
28 * Scope scope = new Scope(graph);
39 * scope.graph().opBuilder(
56 * Scope root = new Scope(graph);
81 * @param graph The graph instance to be managed by the scope.
83 public Scope(Graph graph) {
84 this(graph, new NameScope());
87 /** Returns the graph managed by this scope. *
88 public Graph graph() { method in class:Scope
154 private final Graph graph; field in class:Scope
[all...] |
| /external/v8/src/compiler/ |
| select-lowering.h | 8 #include "src/compiler/graph-reducer.h"
16 class Graph;
22 SelectLowering(Graph* graph, CommonOperatorBuilder* common);
31 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
34 Graph* graph_;
|
| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/ |
| SavedModelBundle.java | 21 * <p>The model consists of a description of the computation (a {@link Graph}), a {@link Session}
22 * with tensors (e.g., parameters or variables in the graph) initialized to values saved in storage,
60 * Sets the set of tags that identify the specific graph in the saved model to load.
92 * @return a bundle containing the graph and associated session.
119 /** Returns the graph that describes the computation performed by the model. */
120 public Graph graph() { method in class:SavedModelBundle
121 return graph;
134 * Releases resources (the {@link Graph} and {@link Session}) associated with the saved model
140 graph.close()
143 private final Graph graph; field in class:SavedModelBundle
161 Graph graph = new Graph(graphHandle); local
[all...] |
| /art/tools/ahat/src/main/com/android/ahat/dominators/ |
| DominatorsComputation.java | 24 * directed graph. It can be used with any directed graph data structure
35 * Interface for a directed graph to perform immediate dominators
37 * The dominators computation can be used with directed graph data
39 * dominators computation on your graph, you must make the following
119 * graph, for progress tracking purposes only.
123 Dominators.Graph<Node> graph = new Dominators.Graph<Node>() { local
145 new Dominators(graph).progress(progress, numNodes).computeDominators(root)
[all...] |
| /external/ImageMagick/coders/ |
| dot.c | 109 *graph;
142 graph=agread(GetBlobFileHandle(image));
144 graph=agread(GetBlobFileHandle(image),(Agdisc_t *) NULL);
146 if (graph == (graph_t *) NULL)
153 gvLayout(graphic_context,graph,(char *) "dot");
155 gvLayout(graphic_context,graph,(char *) option);
156 gvRenderFilename(graphic_context,graph,(char *) "svg",read_info->filename);
157 gvFreeLayout(graphic_context,graph);
158 agclose(graph);
160 Read SVG graph
107 *graph; local
[all...] |
