| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| constant_folding_test.cc | 76 TF_CHECK_OK(s.ToGraphDef(&item.graph));
114 EvaluateNodes(item.graph, item.fetch, {{"x", x_t}});
165 TF_CHECK_OK(s.ToGraphDef(&item.graph));
214 auto expected = EvaluateNodes(item.graph, fetch, {{"x", value}});
220 // Build a simple graph with a few trivially prunable ops.
230 TF_CHECK_OK(s.ToGraphDef(&item.graph));
244 auto tensors_expected = EvaluateNodes(item.graph, fetch);
276 TF_CHECK_OK(s.ToGraphDef(&item.graph));
330 auto tensor_expected = EvaluateNodes(item.graph, fetch);
535 TF_CHECK_OK(s.ToGraphDef(&item.graph));
3379 GraphDef& graph = item.graph; local
[all...] |
| layout_optimizer.cc | 400 GraphDef* graph, NodeMap* node_map)
404 graph_(graph),
470 OptimizeContext(GraphDef* graph, NodeDef* node, NodeMap* node_map,
475 : graph(graph),
482 GraphDef* graph; member in struct:tensorflow::grappler::__anon45152::OptimizeContext
495 opt_cxt.nodes_to_preserve, opt_cxt.graph,
[all...] |
| /external/tensorflow/tensorflow/python/framework/ |
| ops.py | 144 """Convert `obj` to a graph element if possible, otherwise return `None`.
245 enables TensorFlow to execute an entire `Graph` that represents a
248 2. After the graph has been launched in a session, the value of the
259 # Build a dataflow graph.
264 # Construct a `Session` to execute the graph.
267 # Execute the graph and store the value that `e` represents in `result`.
332 # to easily navigate a computation graph.
347 def graph(self): member in class:Tensor
348 """The `Graph` that contains this tensor."""
349 return self._op.graph
937 def graph(self): member in class:_EagerTensorBase
1696 def graph(self): member in class:IndexedSlices
2462 def graph(self): member in class:Operation
[all...] |
| /external/v8/src/compiler/ |
| js-typed-lowering.cc | 12 #include "src/compiler/js-graph.h"
119 Node* left_input = graph()->NewNode(simplified()->CheckReceiver(), left(),
133 Node* right_input = graph()->NewNode(simplified()->CheckReceiver(),
145 Node* left_input = graph()->NewNode(simplified()->CheckSymbol(), left(),
151 Node* right_input = graph()->NewNode(simplified()->CheckSymbol(), right(),
164 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), left(),
171 graph()->NewNode(simplified()->CheckString(VectorSlotPair()), right(),
183 Node* left_input = graph()->NewNode(
190 graph()->NewNode(simplified()->CheckInternalizedString(), right(),
363 Graph* graph() const { return lowering_->graph(); function in class:v8::internal::compiler::final
2394 Graph* JSTypedLowering::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSTypedLowering
[all...] |
| pipeline.cc | 21 #include "src/compiler/bytecode-graph-builder.h"
34 #include "src/compiler/graph-trimmer.h"
35 #include "src/compiler/graph-visualizer.h"
54 #include "src/compiler/machine-graph-verifier.h"
126 graph_ = new (graph_zone_) Graph(graph_zone_);
163 graph_(mcgraph->graph()),
177 // For machine graph testing entry point.
179 Isolate* isolate, Graph* graph, Schedule* schedule,
189 graph_(graph),
254 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::PipelineData
1910 Graph* graph = data->graph(); local
[all...] |
| raw-machine-assembler.h | 10 #include "src/compiler/graph.h"
27 // The RawMachineAssembler produces a low-level IR graph. All nodes are wired
28 // into a graph and also placed into a schedule immediately, hence subsequent
35 // Also note that the generated graph is only valid together with the generated
36 // schedule, using one without the other is invalid as the graph is inherently
41 Isolate* isolate, Graph* graph, CallDescriptor* call_descriptor,
53 Graph* graph() const { return graph_; } function in class:v8::internal::compiler::RawMachineAssembler
54 Zone* zone() const { return graph()->zone();
[all...] |
| simplified-lowering.cc | 45 // 1.) PROPAGATE: Traverse the graph from the end, pushing usage information
295 count_(jsgraph->graph()->NodeCount()),
320 typing_stack_.push({graph()->end(), 0});
321 GetInfo(graph()->end())->set_pushed();
598 EnqueueInitial(jsgraph_->graph()->end());
1254 Graph* graph() const { return jsgraph_->graph(); } function in class:v8::internal::compiler::RepresentationSelector
[all...] |
| effect-control-linearizer.cc | 10 #include "src/compiler/js-graph.h"
36 Graph* EffectControlLinearizer::graph() const { return js_graph_->graph(); } function in class:v8::internal::compiler::EffectControlLinearizer
84 Graph* graph = jsgraph->graph(); local
88 effect = graph->NewNode(common->Unreachable(), effect, control);
90 Node* throw_node = graph->NewNode(common->Throw(), effect, control);
91 NodeProperties::MergeControlToEnd(graph, common, throw_node)
[all...] |
| js-call-reducer.cc | 16 #include "src/compiler/js-graph.h"
50 graph()->NewNode(simplified()->SpeculativeToNumber(
53 Node* value = graph()->NewNode(op, input);
76 graph()->NewNode(simplified()->SpeculativeToNumber(
80 graph()->NewNode(simplified()->SpeculativeToNumber(
83 Node* value = graph()->NewNode(op, left, right);
107 graph()->NewNode(simplified()->SpeculativeToNumber(
111 graph()->NewNode(simplified()->SpeculativeToNumber(
114 left = graph()->NewNode(simplified()->NumberToUint32(), left);
115 right = graph()->NewNode(simplified()->NumberToUint32(), right)
7280 Graph* JSCallReducer::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSCallReducer
[all...] |
| typer.cc | 12 #include "src/compiler/graph-reducer.h"
37 Graph* graph)
39 graph_(graph),
231 Graph* graph() { return typer_->graph(); } function in class:v8::internal::compiler::Typer::Visitor
354 GraphReducer graph_reducer(zone(), graph());
[all...] |
| bytecode-graph-builder.cc | 5 #include "src/compiler/bytecode-graph-builder.h"
65 // Preserve a checkpoint of the environment for the IR graph. Any
100 Graph* graph() const { return builder_->graph(); } function in class:v8::internal::compiler::BytecodeGraphBuilder::Environment
161 Node* parameter = builder->graph()->NewNode(op, graph()->start());
177 context_ = builder->graph()->NewNode(op, graph()->start());
184 Node* new_target_node = builder->graph()->NewNode(op, graph()->start())
[all...] |
| wasm-compiler.cc | 23 #include "src/compiler/graph-visualizer.h"
24 #include "src/compiler/graph.h"
27 #include "src/compiler/js-graph.h"
73 SetEffect(graph()->NewNode( \
79 SetEffect(graph()->NewNode( \
94 Graph* g = mcgraph->graph();
137 Node* start = graph()->NewNode(mcgraph()->common()->Start(params));
138 graph()->SetStart(start);
143 return graph()->NewNode(mcgraph()->common()->Parameter(index)
3386 Graph* WasmGraphBuilder::graph() { return mcgraph()->graph(); } function in class:v8::internal::compiler::WasmGraphBuilder
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| executor.cc | 35 #include "tensorflow/core/framework/graph.pb.h"
45 #include "tensorflow/core/graph/edgeset.h"
150 // A graph node.
256 // Immutable view of a Graph organized for efficient execution.
262 void Initialize(const Graph* g);
263 Status SetAllocAttrs(const Graph* g, const Device* device);
290 ExecutorImpl(const LocalExecutorParams& p, std::unique_ptr<const Graph> g)
310 // Process all Nodes in the current graph, attempting to infer the
355 static Status BuildControlFlowInfo(const Graph* graph,
1508 const Graph* graph = impl_->graph_.get(); local
[all...] |
| /external/v8/src/profiler/ |
| heap-snapshot-generator.cc | 2308 EmbedderGraphImpl graph; local
[all...] |
| /external/v8/src/inspector/build/closure-compiler/ |
| closure-compiler.jar | |
| /external/guice/lib/build/ |
| truth-0.36.jar | |
| /external/owasp/sanitizer/tools/findbugs/lib/ |
| findbugs.jar | |
| /external/icu/tools/srcgen/currysrc/libs/ |
| org.eclipse.core.jobs_3.10.0.v20180427-1454.jar | |
| /external/testng/ant/ |
| ivy-2.1.0.jar | |
| /external/dokka/maven/org/jetbrains/dokka/dokka-fatjar/0.9.17-g20190326/ |
| dokka-fatjar-0.9.17-g20190326.jar | |
| /external/error_prone/javac/ |
| javac-9+181-r4173-1.jar | |
