| /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"
24 namespace graph { namespace in namespace:tensorflow
53 } // namespace graph
|
| default_device.h | 21 #include "tensorflow/core/framework/graph.pb.h"
25 namespace graph { namespace in namespace:tensorflow
38 } // namespace graph
|
| validate.cc | 16 #include "tensorflow/core/graph/validate.h"
27 namespace graph { namespace in namespace:tensorflow
62 } // namespace graph
|
| /art/compiler/optimizing/ |
| linearize_test.cc | 45 HGraph* graph = CreateCFG(data); local
48 x86::CodeGeneratorX86 codegen(graph, *features_x86.get(), CompilerOptions());
49 SsaLivenessAnalysis liveness(graph, &codegen, GetScopedAllocator());
52 ASSERT_EQ(graph->GetLinearOrder().size(), number_of_blocks);
54 ASSERT_EQ(graph->GetLinearOrder()[i]->GetBlockId(), expected_order[i]);
59 // Structure of this graph (+ are back edges)
84 // Structure of this graph (+ are back edges)
109 // Structure of this graph (+ are back edges)
136 /* Structure of this graph (+ are back edges)
166 /* Structure of this graph (+ are back edges
[all...] |
| 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...] |
| 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 | 40 HGraph* graph = CreateCFG(data); local
41 ASSERT_NE(graph, nullptr);
43 StringPrettyPrinter printer_before(graph);
50 x86::CodeGeneratorX86 codegenX86(graph, *features_x86.get(), CompilerOptions());
51 HDeadCodeElimination(graph, nullptr /* stats */, "dead_code_elimination").Run();
52 GraphChecker graph_checker(graph);
56 StringPrettyPrinter printer_after(graph);
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| InjectorGrapher.java | 26 * 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/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;
|
| /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,
36 * @return a bundle containing the graph and associated session.
51 /** Returns the graph that describes the computation performed by the model. */
52 public Graph graph() { method in class:SavedModelBundle
53 return graph;
66 * Releases resources (the {@link Graph} and {@link Session}) associated with the saved model
72 graph.close();
75 private final Graph graph field in class:SavedModelBundle
93 Graph graph = new Graph(graphHandle); local
[all...] |
| /tools/tradefederation/core/tests/src/com/android/tradefed/util/ |
| DirectedGraphTest.java | 26 DirectedGraph<Integer> graph = new DirectedGraph<Integer>(); local
27 graph.addEdge(0, 1);
28 graph.addEdge(1, 2);
29 graph.addEdge(2, 3);
30 assertTrue(graph.contains(0));
31 assertTrue(graph.contains(1));
32 assertTrue(graph.contains(2));
33 assertTrue(graph.contains(3));
35 assertTrue(graph.isDag());
39 DirectedGraph<Integer> graph = new DirectedGraph<Integer>() local
55 DirectedGraph<Integer> graph = new DirectedGraph<Integer>(); local
[all...] |
| /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/core/common_runtime/ |
| function.h | 26 #include "tensorflow/core/graph/graph.h"
72 // instantiated function that is represented as a Graph with arg/ret
76 Graph* graph = nullptr; // owned. member in struct:tensorflow::FunctionBody
84 DataTypeSlice ret_types, Graph* g);
88 // Debugging facility. Returns a debug string for a graph
90 string DebugString(const Graph* instantiated_func_graph);
93 // (a Graph*).
100 bool RemoveDeadNodes(Graph* g)
[all...] |
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| topological_sort_test.cc | 47 GraphDef graph; local
48 *graph.add_node() = CreateNode("2", {"5"});
49 *graph.add_node() = CreateNode("0", {"5", "4"});
50 *graph.add_node() = CreateNode("1", {"4", "3"});
51 *graph.add_node() = CreateNode("3", {"2"});
52 *graph.add_node() = CreateNode("5", {});
53 *graph.add_node() = CreateNode("4", {});
55 TF_EXPECT_OK(TopologicalSort(&graph));
58 EXPECT_EQ(graph.node(i).name(), order[i]);
63 GraphDef graph; local
79 GraphDef graph; local
94 GraphDef graph; local
106 GraphDef graph; local
[all...] |
| /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
163 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);
29 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
32 Graph* graph_;
|
| tail-call-optimization.h | 8 #include "src/compiler/graph-reducer.h"
17 class Graph;
24 TailCallOptimization(CommonOperatorBuilder* common, Graph* graph)
25 : common_(common), graph_(graph) {}
31 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::final
34 Graph* const graph_;
|
| /packages/apps/Settings/tests/robotests/src/com/android/settings/graph/ |
| BottomLabelLayoutTest.java | 18 package com.android.settings.graph;
|
| /frameworks/support/navigation/runtime/src/androidTest/java/androidx/navigation/ |
| NavInflaterTest.java | 51 NavGraph graph = navInflater.inflate(R.navigation.nav_simple); local
53 assertThat(graph, is(notNullValue(NavGraph.class)));
54 assertThat(graph.getStartDestination(), is(R.id.start_test));
61 NavGraph graph = navInflater.inflate(R.navigation.nav_simple); local
63 assertThat(graph, is(notNullValue(NavGraph.class)));
66 Pair<NavDestination, Bundle> result = graph.matchDeepLink(expectedUri);
108 NavGraph graph = navInflater.inflate(R.navigation.nav_default_arguments); local
110 NavDestination startDestination = graph.findNode(graph.getStartDestination());
|
