| /external/tensorflow/tensorflow/java/src/main/java/org/tensorflow/ |
| Operation.java | 19 * A Graph node that performs computation on Tensors.
21 * <p>An Operation is a node in a {@link Graph} that takes zero or more {@link Tensor}s (produced by
22 * other Operations in the Graph) as input, and produces zero or more {@link Tensor}s as output.
24 * <p>Operation instances are valid only as long as the Graph they are a part of is valid. Thus, if
25 * {@link Graph#close()} has been invoked, then methods on the Operation instance may fail with an
34 // called unsafeHandle. Graph.ref() is used to safely use the unsafeHandle.
35 Operation(Graph g, long unsafeNativeHandle) {
36 this.graph = g;
42 Graph.Reference r = graph.ref()
205 private final Graph graph; field in class:Operation
[all...] |
| /external/v8/src/compiler/ |
| all-nodes.h | 15 // A helper utility that traverses the graph and gathers all nodes reachable
19 // Constructor. Traverses the graph and builds the {reachable} set of nodes
22 AllNodes(Zone* local_zone, Node* end, const Graph* graph,
24 // Constructor. Traverses the graph and builds the {reachable} set of nodes
26 AllNodes(Zone* local_zone, const Graph* graph, bool only_inputs = true);
42 void Mark(Zone* local_zone, Node* end, const Graph* graph);
|
| loop-peeling.h | 35 static PeeledIteration* Peel(Graph* graph, CommonOperatorBuilder* common,
38 static void PeelInnerLoopsOfTree(Graph* graph, CommonOperatorBuilder* common,
41 static void EliminateLoopExits(Graph* graph, Zone* temp_zone);
|
| basic-block-instrumentor.h | 18 class Graph;
24 Graph* graph, Schedule* schedule);
|
| js-builtin-reducer.cc | 11 #include "src/compiler/js-graph.h"
225 Node* buffer = effect = graph()->NewNode(
230 Node* check = effect = graph()->NewNode(
232 check = graph()->NewNode(simplified()->BooleanNot(), check);
234 graph()->NewNode(simplified()->CheckIf(), check, effect, control);
295 effect = graph()->NewNode(
297 Node* value = effect = graph()->NewNode(
301 effect = graph()->NewNode(simplified()->StoreField(AccessBuilder::ForMap()),
303 effect = graph()->NewNode(
306 effect = graph()->NewNode
2187 Graph* JSBuiltinReducer::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSBuiltinReducer
[all...] |
| /system/update_engine/payload_generator/ |
| graph_utils.h | 34 uint64_t EdgeWeight(const Graph& graph, const Edge& edge);
36 // These add a read-before dependency from graph[src] -> graph[dst]. If the dep
47 // For each node N in graph, drop all edges N->|index|.
48 void DropIncomingEdgesTo(Graph* graph, Vertex::Index index);
50 void DumpGraph(const Graph& graph);
|
| inplace_generator.cc | 83 // their destination extents given the index of the operations in the graph.
86 explicit IndexedInstallOperationsDstComparator(Graph* graph)
87 : graph_(graph) {}
96 const Graph* const graph_;
101 void InplaceGenerator::CheckGraph(const Graph& graph) {
102 for (const Vertex& v : graph) {
139 bool InplaceGenerator::CutEdges(Graph* graph,
745 Graph graph; local
[all...] |
| tarjan_unittest.cc | 45 const Graph::size_type kNodeCount = 8;
47 Graph graph(kNodeCount);
49 graph[n_a].out_edges.insert(make_pair(n_e, EdgeProperties()));
50 graph[n_a].out_edges.insert(make_pair(n_f, EdgeProperties()));
51 graph[n_b].out_edges.insert(make_pair(n_a, EdgeProperties()));
52 graph[n_c].out_edges.insert(make_pair(n_d, EdgeProperties()));
53 graph[n_d].out_edges.insert(make_pair(n_e, EdgeProperties()));
54 graph[n_d].out_edges.insert(make_pair(n_f, EdgeProperties()));
55 graph[n_e].out_edges.insert(make_pair(n_b, EdgeProperties()))
[all...] |
| /external/tensorflow/tensorflow/core/distributed_runtime/rpc/ |
| grpc_session_test.cc | 20 #include "tensorflow/core/framework/graph.pb.h"
23 #include "tensorflow/core/graph/default_device.h"
24 #include "tensorflow/core/graph/graph.h"
25 #include "tensorflow/core/graph/testlib.h"
45 Graph graph(OpRegistry::Global());
49 Node* a = test::graph::Constant(&graph, a_tensor);
54 Node* b = test::graph::Constant(&graph, b_tensor)
88 GraphDef graph; local
124 GraphDef graph; local
156 GraphDef graph; local
187 GraphDef graph; local
697 GraphDef graph; local
828 GraphDef graph; local
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/ |
| build_xla_launch_ops_pass.cc | 26 #include "tensorflow/core/graph/algorithm.h"
27 #include "tensorflow/core/graph/graph.h"
28 #include "tensorflow/core/graph/graph_constructor.h"
40 Graph* graph, Node** node) {
42 def.set_name(graph->NewName(nodename));
55 *node = graph->AddNode(def, &status);
59 static Status ReplaceNodeWithXlaLaunch(Graph* graph, Node* node)
121 Graph* graph = options.graph->get(); local
[all...] |
| /art/compiler/optimizing/ |
| x86_memory_gen.cc | 29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks)
30 : HGraphVisitor(graph),
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph,
75 : HOptimization(graph, kX86MemoryOperandGenerationPassName, stats),
|
| x86_memory_gen.h | 30 X86MemoryOperandGeneration(HGraph* graph,
|
| bounds_check_elimination.h | 29 BoundsCheckElimination(HGraph* graph,
33 : HOptimization(graph, name),
|
| codegen_test.cc | 89 HGraph* graph = CreateCFG(data); local
91 RemoveSuspendChecks(graph);
92 RunCode(target_config, graph, [](HGraph*) {}, has_result, expected);
100 HGraph* graph = CreateCFG(data, DataType::Type::kInt64); local
102 RemoveSuspendChecks(graph);
103 RunCode(target_config, graph, [](HGraph*) {}, has_result, expected);
419 HGraph* graph = CreateGraph(); local
421 HBasicBlock* entry = new (GetAllocator()) HBasicBlock(graph);
422 graph->AddBlock(entry);
423 graph->SetEntryBlock(entry)
479 HGraph* graph = CreateGraph(); local
526 HGraph* graph = CreateGraph(); local
606 HGraph* graph = CreateGraph(); local
718 HGraph* graph = CreateGraph(); local
742 HGraph* graph = CreateGraph(); local
792 HGraph* graph = CreateGraph(); local
835 HGraph* graph = CreateGraph(); local
[all...] |
| instruction_simplifier.h | 32 * Note that graph simplifications producing a constant should be
33 * implemented in art::HConstantFolding, while graph simplifications
41 InstructionSimplifier(HGraph* graph,
46 : HOptimization(graph, name, stats),
|
| load_store_elimination.h | 29 LoadStoreElimination(HGraph* graph,
34 : HOptimization(graph, name, stats),
|
| /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/c/ |
| c_test_util.h | 23 #include "tensorflow/core/framework/graph.pb.h"
47 TF_Operation* Placeholder(TF_Graph* graph, TF_Status* s,
50 TF_Operation* Const(TF_Tensor* t, TF_Graph* graph, TF_Status* s,
53 TF_Operation* ScalarConst(int32_t v, TF_Graph* graph, TF_Status* s,
56 TF_Operation* ScalarConst(double v, TF_Graph* graph, TF_Status* s,
59 TF_Operation* Add(TF_Operation* l, TF_Operation* r, TF_Graph* graph,
62 TF_Operation* AddNoCheck(TF_Operation* l, TF_Operation* r, TF_Graph* graph,
66 TF_Graph* graph, TF_Operation* ctrl_op,
69 TF_Operation* Add(TF_Output l, TF_Output r, TF_Graph* graph, TF_Status* s,
72 TF_Operation* Min(TF_Operation* l, TF_Operation* r, TF_Graph* graph,
[all...] |
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| grappler_test.h | 21 #include "tensorflow/core/framework/graph.pb.h"
30 std::vector<Tensor> EvaluateNodes(const GraphDef& graph,
|
| /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;
|
| /frameworks/support/navigation/common/ktx/src/androidTest/java/androidx/navigation/ |
| NavGraphBuilderTest.kt | 37 val graph = provider.navigation(startDestination = DESTINATION_ID) {
40 assertTrue("Destination should be added to the graph",
41 DESTINATION_ID in graph)
46 val graph = provider.navigation(startDestination = DESTINATION_ID) {
51 assertTrue("Destination should be added to the graph",
52 DESTINATION_ID in graph)
57 val graph = provider.navigation(startDestination = DESTINATION_ID) {
63 assertTrue("Destination should be added to the graph",
64 DESTINATION_ID in graph)
77 val graph = provider.navigation(startDestination = DESTINATION_ID)
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| direct_session_with_tracking_alloc_test.cc | 25 #include "tensorflow/core/framework/graph.pb.h"
30 #include "tensorflow/core/graph/costmodel.h"
31 #include "tensorflow/core/graph/graph.h"
32 #include "tensorflow/core/graph/testlib.h"
49 Graph graph(OpRegistry::Global());
53 Node* a = test::graph::Constant(&graph, a_tensor);
58 Node* x = test::graph::Constant(&graph, x_tensor)
[all...] |
| /external/tensorflow/tensorflow/contrib/framework/python/ops/ |
| ops.py | 28 def get_graph_from_inputs(op_input_list, graph=None):
29 """Returns the appropriate graph to use for the given inputs.
31 1. If `graph` is provided, we validate that all inputs in `op_input_list` are
32 from the same graph.
33 2. Otherwise, we attempt to select a graph from the first Operation- or
35 such inputs are in the same graph.
36 3. If the graph was not specified and it could not be inferred from
37 `op_input_list`, we attempt to use the default graph.
41 `Operation`, and other objects that may be converted to a graph element.
42 graph: (Optional) The explicit graph to use
[all...] |
| /external/v8/src/crankshaft/ |
| hydrogen-uint32-analysis.h | 18 explicit HUint32AnalysisPhase(HGraph* graph)
19 : HPhase("H_Compute safe UInt32 operations", graph), phis_(4, zone()) { }
|
