/external/tensorflow/tensorflow/python/kernel_tests/ |
conv_ops_test.py | [all...] |
metrics_test.py | [all...] |
sparse_ops_test.py | 211 with ops.Graph().as_default(): [all...] |
control_flow_ops_py_test.py | 85 def check_consumers(graph): 89 for op in graph.get_operations(): 101 graph = ops.get_default_graph() 102 for op in graph.get_operations(): 104 if graph.is_fetchable(t): 111 graph = ops.get_default_graph() 112 for op in graph.get_operations(): 114 if graph.is_feedable(t): 389 graph = ops.get_default_graph() 390 for op in graph.get_operations() [all...] |
/external/tensorflow/tensorflow/contrib/metrics/python/ops/ |
metric_ops_test.py | [all...] |
/external/tensorflow/tensorflow/contrib/learn/python/learn/estimators/ |
dnn_linear_combined_test.py | 162 with ops.Graph().as_default(): [all...] |
/external/tensorflow/tensorflow/core/common_runtime/gpu/ |
gpu_device.cc | 55 #include "tensorflow/core/graph/types.h" 454 Status BaseGPUDevice::FillContextMap(const Graph* graph, 468 gpu_stream_util::AssignStreams(graph, opts, &node_to_stream_id)); 474 device_context_map->resize(graph->num_node_ids()); 475 for (Node* n : graph->nodes()) { [all...] |
/external/v8/src/compiler/ |
load-elimination.cc | 8 #include "src/compiler/js-graph.h" 930 NodeProperties::GetType(replacement), graph()->zone()); 932 graph()->NewNode(common()->TypeGuard(replacement_type), 1373 Graph* LoadElimination::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::LoadElimination [all...] |
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...] |
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...] |
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-create-lowering.cc | 12 #include "src/compiler/js-graph.h" 172 Node* const control = graph()->start(); 188 graph()->NewNode(simplified()->ArgumentsFrame()); 189 Node* const arguments_length = graph()->NewNode( 220 graph()->NewNode(simplified()->ArgumentsFrame()); 221 Node* const arguments_length = graph()->NewNode( 227 graph()->NewNode(simplified()->NewArgumentsElements(0), 248 graph()->NewNode(simplified()->ArgumentsFrame()); 249 Node* const rest_length = graph()->NewNode( 257 graph()->NewNode(simplified()->NewArgumentsElements(0) 1811 Graph* JSCreateLowering::graph() const { return jsgraph()->graph(); } function in class:v8::internal::compiler::JSCreateLowering [all...] |
machine-operator-reducer.cc | 11 #include "src/compiler/graph.h" 12 #include "src/compiler/machine-graph.h" 29 return graph()->NewNode(common()->Float32Constant(value)); 44 return graph()->NewNode(common()->Int64Constant(value)); 48 return graph()->NewNode(machine()->Float64Mul(), lhs, rhs); 53 graph()->NewNode(machine()->Float64Add(), Float64Constant(0.0), value); 54 Diamond d(graph(), common(), 55 graph()->NewNode(machine()->Float64LessThanOrEqual(), value, 59 graph()->NewNode(machine()->Float64Sqrt(), value)); 63 Node* const node = graph()->NewNode(machine()->Word32And(), lhs, rhs) 1436 Graph* MachineOperatorReducer::graph() const { return mcgraph()->graph(); } function in class:v8::internal::compiler::MachineOperatorReducer [all...] |
verifier.cc | 16 #include "src/compiler/graph.h" 218 // All inputs are graph terminators. 226 // Dead is never connected to the graph. 329 // stay connected to the graph end. 443 // Type is merged from other values in the graph and could be any. 558 // kTypedStateValues (to signal the type). Once AST graph builder 559 // is removed, we should check this here. Until then, AST graph [all...] |
/external/clang/lib/Analysis/ |
CFG.cpp | 280 /// LocalScope::const_iterator that specifies position in LocalScope graph. [all...] |
/external/clang/lib/StaticAnalyzer/Core/ |
BugReporter.cpp | [all...] |
/external/v8/src/inspector/build/closure-compiler/ |
closure-compiler.jar | |
/external/tensorflow/tensorflow/python/ops/ |
image_ops_test.py | 491 with session.Session("", graph=ops.Graph(), config=config) as sess: 521 with session.Session("", graph=ops.Graph(), config=config) as sess: 551 with session.Session("", graph=ops.Graph(), config=config) as sess: [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
nv50_ir_emit_nv50.cpp | [all...] |
/external/tensorflow/tensorflow/core/distributed_runtime/ |
master_session.cc | 37 #include "tensorflow/core/graph/graph_partition.h" 38 #include "tensorflow/core/graph/tensor_id.h" 62 // compiled graphs while the compiled graph is still being used. 84 << client_graph_before_register_->graph.num_node_ids(); 89 for (Node* n : client_graph_before_register_->graph.nodes()) { 145 // ReffedClient graph has deleted it. 195 // Partitions the graph into subgraphs and registers them on 248 // Graph partitioned into per-location subgraphs. 305 // The actual graph partitioning and registration implementation. 425 cost_model.InitFromGraph(client_graph->graph); 1013 const Graph* graph = execution_state->full_graph(); local [all...] |
/external/tensorflow/tensorflow/compiler/tf2tensorrt/convert/ |
convert_nodes.cc | 39 #include "tensorflow/core/graph/algorithm.h" 40 #include "tensorflow/core/graph/graph.h" 41 #include "tensorflow/core/graph/graph_constructor.h" [all...] |
/external/llvm/lib/CodeGen/ |
MachineScheduler.cpp | 53 /// nodes in the graph, provide a cutoff to hide them. [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
MachineScheduler.cpp | 92 /// nodes in the graph, provide a cutoff to hide them. [all...] |
/external/tensorflow/tensorflow/c/ |
c_api_test.cc | 31 #include "tensorflow/core/framework/graph.pb_text.h" 42 #include "tensorflow/core/graph/tensor_id.h" 96 std::unique_ptr<TF_Graph, decltype(&TF_DeleteGraph)> graph(TF_NewGraph(), 100 TF_Session* sess = TF_NewSession(graph.get(), opts, s); 281 EXPECT_EQ("Session was not created with a graph before Run()!", 361 TF_Graph* graph = TF_NewGraph(); local 363 TF_Operation* feed = Placeholder(graph, s); 369 num_dims = TF_GraphGetTensorNumDims(graph, feed_out_0, s); 374 TF_GraphSetTensorShape(graph, feed_out_0, /*dims=*/nullptr, -1, s); 376 num_dims = TF_GraphGetTensorNumDims(graph, feed_out_0, s) 458 TF_Graph* graph = TF_NewGraph(); local 658 TF_Graph* graph = TF_NewGraph(); local 835 TF_Graph* graph = TF_NewGraph(); local 886 TF_Graph* graph = TF_NewGraph(); local 942 TF_Graph* graph = TF_NewGraph(); local 1001 TF_Graph* graph = TF_NewGraph(); local 1063 TF_Graph* graph = TF_NewGraph(); local 1133 TF_Graph* graph = TF_NewGraph(); local 1160 TF_Graph* graph = TF_NewGraph(); local 1361 TF_Graph* graph = TF_NewGraph(); local 1434 TF_Graph* graph = TF_NewGraph(); local [all...] |
/external/tensorflow/tensorflow/lite/toco/ |
import_tensorflow.cc | 40 #include "tensorflow/core/framework/graph.pb.h" 45 #include "tensorflow/core/graph/graph_constructor.h" 470 // require that until we encounter a graph where that's not the case. 551 // This may cause problems if a graph transformation rule changes parameters 553 // graph transformation rule will change an existing operator with the same [all...] |