/external/tensorflow/tensorflow/core/grappler/utils/ |
H A D | frame.cc | 30 NodeMap node_map(const_cast<GraphDef*>(&graph)); 31 return IdentifyFramesWithNodeMap(graph, node_map, frame_map, num_frames); 34 Status IdentifyFramesWithNodeMap(const GraphDef& graph, const NodeMap& node_map, argument 47 for (const auto& fanout : node_map.GetOutputs(ready_node.first->name())) {
|
/external/tensorflow/tensorflow/tools/graph_transforms/ |
H A D | freeze_requantization_ranges_test.cc | 126 std::map<string, const NodeDef*> node_map; local 127 MapNamesToNodes(frozen_graph_def, &node_map); 128 EXPECT_EQ(0, node_map.count("requantization_range_op")); 129 EXPECT_EQ(1, node_map.count("requantize_op")); 131 NodeNameFromInput(node_map.at("requantize_op")->input(3)); 132 ASSERT_EQ(1, node_map.count(min_input)); 133 EXPECT_EQ("Const", node_map.at(min_input)->op()); 135 NodeNameFromInput(node_map.at("requantize_op")->input(4)); 136 ASSERT_EQ(1, node_map.count(max_input)); 137 EXPECT_EQ("Const", node_map [all...] |
H A D | fold_constants_lib.cc | 123 StringPieceMap<const NodeDef*> node_map; local 125 node_map.emplace(node.name(), &node); 142 if (node_map.count(node_name) == 0) { 148 const NodeDef& node = *(node_map[node_name]);
|
H A D | fold_constants_test.cc | 252 std::map<string, const NodeDef*> node_map; local 253 graph_transforms::MapNamesToNodes(result_graph_def, &node_map); 254 EXPECT_EQ(1, node_map.count("original_recv")); 255 EXPECT_EQ(1, node_map.count("a_const")); 256 EXPECT_EQ(1, node_map.count("placeholder")); 257 EXPECT_EQ(1, node_map.count("original_send")); 258 EXPECT_EQ(0, node_map.count("_recv_placeholder_0")); 259 EXPECT_EQ(0, node_map.count("new_send")); 286 std::map<string, const NodeDef*> node_map; local 287 graph_transforms::MapNamesToNodes(result_graph_def, &node_map); 322 std::map<string, const NodeDef*> node_map; local 354 std::map<string, const NodeDef*> node_map; local [all...] |
H A D | freeze_requantization_ranges.cc | 130 std::map<string, const NodeDef*> node_map; local 131 MapNamesToNodes(input_graph_def, &node_map); 136 if (!node_map.count(record.name)) {
|
H A D | transform_utils.cc | 72 std::map<string, const NodeDef*> node_map; local 73 MapNamesToNodes(graph_def, &node_map); 551 std::map<string, const NodeDef*> node_map; local 552 MapNamesToNodes(graph_def, &node_map); 557 if (!node_map.count(input_node)) { 568 std::map<string, const NodeDef*> node_map; local 569 MapNamesToNodes(graph_def, &node_map); 573 << node_map[invalid_input.first]->DebugString();
|
H A D | transform_utils_test.cc | 54 std::map<string, const NodeDef*> node_map; local 55 MapNamesToNodes(graph_def, &node_map); 57 EXPECT_EQ(1, node_map.count("a")); 58 EXPECT_EQ(1, node_map.count("b")); 59 EXPECT_EQ(1, node_map.count("add")); 60 EXPECT_EQ(1, node_map.count("placeholder")); 61 EXPECT_EQ(1, node_map.count("output")); 62 EXPECT_EQ(0, node_map.count("no_such_node")); 250 std::map<string, const NodeDef*> node_map; local 251 MapNamesToNodes(result_graph_def, &node_map); 272 std::map<string, const NodeDef*> node_map; local 546 std::map<string, const NodeDef*> node_map; local 584 std::map<string, const NodeDef*> node_map; local 657 std::map<string, const NodeDef*> node_map; local 694 std::map<string, const NodeDef*> node_map; local 816 std::map<string, const NodeDef*> node_map; local [all...] |
H A D | quantize_nodes_test.cc | 550 std::map<string, const NodeDef*> node_map; local 551 MapNamesToNodes(removed_graph_def, &node_map); 552 EXPECT_EQ(1, node_map.count("final_dequantize")); 553 EXPECT_EQ("quantized_op", node_map.at("final_dequantize")->input(0)); 649 std::map<string, const NodeDef*> node_map; local 650 MapNamesToNodes(removed_graph_def, &node_map); 651 EXPECT_EQ(1, node_map.count("final_dequantize")); 652 EXPECT_EQ("requantize_op", node_map.at("final_dequantize")->input(0)); 811 std::map<string, const NodeDef*> node_map; local 812 MapNamesToNodes(quantized_graph_def, &node_map); 1120 std::map<string, const NodeDef*> node_map; local 1258 std::map<string, const NodeDef*> node_map; local 1307 std::map<string, const NodeDef*> node_map; local 1364 std::map<string, const NodeDef*> node_map; local 1424 std::map<string, const NodeDef*> node_map; local [all...] |
/external/tensorflow/tensorflow/compiler/tf2xla/ |
H A D | tf2xla.cc | 64 Status AddArgNodes(Graph* graph, const NodeMap& node_map, argument 74 auto node_it = node_map.find(remap_it->second); 75 if (node_it == node_map.end()) { 120 Status AddRetvalNodes(Graph* graph, const NodeMap& node_map, argument 125 auto it = node_map.find(id.node_name()); 126 if (it == node_map.end()) { 156 NodeMap node_map; local 158 node_map[n->name()] = n; 161 AddArgNodes(graph, node_map, config.feed(), feed_remapping)); 164 AddRetvalNodes(graph, node_map, confi [all...] |
H A D | functionalize_control_flow.cc | 109 // `node_map` is a vector indexed by source node ID to dest nodes. 110 // Does not traverse into nodes in `node_map`, so by adding nodes to `node_map` 113 // traversal leaves 'frame'; the client must add enough nodes to `node_map` to 125 std::vector<Node*>* node_map, Graph* output) { 145 if ((*node_map)[src->id()] == nullptr) { 146 (*node_map)[src->id()] = output->CopyNode(src); 149 Node* src_copy = (*node_map)[e->src()->id()]; 153 Node* dst_copy = (*node_map)[e->dst()->id()]; 195 std::vector<Node*> node_map(grap 122 CopySubgraph(const Graph& graph, const Frame* frame, std::vector<Node*> stack, const std::vector<bool>& squash_src_outputs, std::vector<Node*>* node_map, Graph* output) argument [all...] |
/external/tensorflow/tensorflow/contrib/tensorrt/convert/ |
H A D | convert_graph.cc | 186 std::unordered_map<string, tensorflow::Node*>* node_map) { 188 if (!node_map->insert({node->name(), node}).second) { 253 std::unordered_map<string, tensorflow::Node*> node_map; local 254 TF_RETURN_IF_ERROR(BuildNodeMap(graph, &node_map)); 258 subgraph_node_ids.insert(node_map.at(node_name)->id()); 184 BuildNodeMap( const tensorflow::Graph& graph, std::unordered_map<string, tensorflow::Node*>* node_map) argument
|
/external/v8/src/compiler/ |
H A D | loop-peeling.cc | 106 NodeMarker<size_t> node_map; member in struct:v8::internal::compiler::Peeling 111 : node_map(graph, static_cast<uint32_t>(max)), pairs(p) {} 114 if (node_map.Get(node) == 0) return node; 115 return pairs->at(node_map.Get(node)); 119 node_map.Set(original, 1 + pairs->size()); 141 Node* copy = pairs->at(node_map.Get(original)); 148 bool Marked(Node* node) { return node_map.Get(node) > 0; }
|
/external/tensorflow/tensorflow/core/common_runtime/ |
H A D | constant_folding.cc | 348 // constant propagation. node_map is the mapping of nodes in the original graph 349 // to nodes in the constant graph. The value of an entry in node_map is a vector 353 Node* n, std::unordered_map<Node*, std::vector<Node*>>* node_map, 355 std::vector<Node*>& added = (*node_map)[n]; 361 auto it = node_map->find(in); 362 CHECK(it != node_map->end()) 381 // propagation. node_map is the mapping of nodes in the original graph to nodes 382 // in the constant graph. The value of an entry in node_map is a vector of nodes 389 std::unordered_map<Node*, std::vector<Node*>>* node_map, 391 std::vector<Node*>& added = (*node_map)[ 352 AddNodeToConstantGraph( Node* n, std::unordered_map<Node*, std::vector<Node*>>* node_map, Graph* constant_graph) argument 385 AddShapeNodeToConstantGraph( Node* n, const std::unordered_map<const Node*, std::vector<Tensor>>& shape_replacement_map, std::unordered_map<Node*, std::vector<Node*>>* node_map, const ConstantFoldNameGenerator& generate_new_name, Graph* constant_graph) argument 419 std::unordered_map<Node*, std::vector<Node*>> node_map; local [all...] |
/external/tensorflow/tensorflow/core/grappler/optimizers/ |
H A D | dependency_optimizer.cc | 39 bool RemoveInput(NodeDef* node, const string& input, NodeMap* node_map) { argument 46 node_map->RemoveOutput(NodeName(input), node->name());
|
H A D | memory_optimizer.cc | 65 const NodeMap& node_map, const GraphDef* graph, 74 for (const NodeDef* output : node_map.GetOutputs(node.name())) { 88 const NodeDef* input_node = node_map.GetNode(input_name); 102 void connected_subgraph(const NodeMap& node_map, bool collect_inputs, argument 121 const NodeDef* input_node = node_map.GetNode(input_name_raw); 129 for (const NodeDef* output : node_map.GetOutputs(current_node->name())) { 145 const GraphDef* graph, const NodeMap& node_map, 151 FindCandidateRecomputeNodes(node_map, graph, should_recompute, is_target); 162 connected_subgraph(node_map, 170 for (NodeDef* output : node_map 64 FindCandidateRecomputeNodes( const NodeMap& node_map, const GraphDef* graph, const std::function<bool(const NodeDef&)>& is_candidate, const std::function<bool(const NodeDef&)>& is_target) argument 144 GetOpGroupsToRecompute( const GraphDef* graph, const NodeMap& node_map, const std::function<bool(const NodeDef&)>& should_recompute, const std::function<bool(const NodeDef&)>& is_target) argument 205 GetMaxDownstreamComponents( const std::unordered_set<const NodeDef*>& recomputed_source_nodes, const std::unordered_set<NodeDef*>& target_nodes, const NodeMap& node_map, const std::unordered_map<const NodeDef*, int>& components) argument 273 AddRecomputeControlDependencyNodes( const std::unordered_set<const NodeDef*>& recomputed_source_nodes, const std::unordered_set<NodeDef*>& target_nodes, const NodeMap& node_map, const std::unordered_map<const NodeDef*, int>& components, const std::unordered_map<const NodeDef*, int>& recomputed_node_max_feed_components, GraphDef* graph) argument 367 RecomputeSubgraph( const std::unordered_set<const NodeDef*>& recomputed_source_nodes, const std::unordered_set<NodeDef*>& target_nodes, const NodeMap& node_map, const std::unordered_map<const NodeDef*, int>& components, GraphDef* graph) argument [all...] |
H A D | arithmetic_optimizer.cc | 158 const NodeMap* node_map) { 163 const NodeDef* perm_node = node_map->GetNode(transpose_node.input(1)); 176 GraphDef* graph, NodeMap* node_map) { 186 ConstantFolding::AddControlDependency(new_input, graph, node_map); 188 node_map->AddOutput(NodeName(new_input), node->name()); 194 NodeMap* node_map) { 198 MaybeAddControlInput(input, to, graph, node_map)) { 252 PartialTensorShape GetInputShape(const string& input, const NodeMap& node_map) { argument 255 const NodeDef* input_node = node_map.GetNode(node_name); 260 const NodeMap& node_map) { 157 IsInnerMatrixTransposeNode(const NodeDef& transpose_node, const NodeMap* node_map) argument 175 MaybeAddControlInput(const string& new_input, NodeDef* node, GraphDef* graph, NodeMap* node_map) argument 193 CopyControlInputs(const NodeDef& from, NodeDef* to, GraphDef* graph, NodeMap* node_map) argument 259 ShapesEqual(const string& input_x, const string& input_y, const NodeMap& node_map) argument 322 GetTailOfValuePreservingChain( const NodeDef& node, const NodeMap& node_map, const std::unordered_set<string>& nodes_to_preserve) argument [all...] |
H A D | constant_folding.cc | 135 GraphDef* graph, NodeMap* node_map) { 145 ConstantFolding::AddControlDependency(new_input, graph, node_map); 147 node_map->AddOutput(NodeName(new_input), node->name()); 154 GraphDef* graph, NodeMap* node_map) { 160 node_map->RemoveOutput(NodeName(old_input), node->name()); 181 NodeMap* node_map) { 185 const NodeDef* node = node_map->GetNode(input_name); 195 auto outputs = node_map->GetOutputs(node->name()); 211 NodeDef* added_node = node_map->GetNode(ctrl_dep_name); 220 node_map 134 MaybeAddControlInput(const string& new_input, NodeDef* node, GraphDef* graph, NodeMap* node_map) argument 153 MaybeRemoveControlInput(const string& old_input, NodeDef* node, GraphDef* graph, NodeMap* node_map) argument 179 AddControlDependency(const string& input_name, GraphDef* graph, NodeMap* node_map) argument [all...] |
H A D | layout_optimizer.cc | 375 GraphDef* graph, NodeMap* node_map) 380 node_map_(node_map) {} 445 OptimizeContext(GraphDef* graph, NodeDef* node, NodeMap* node_map, argument 452 node_map(node_map), 459 NodeMap* node_map; member in struct:tensorflow::grappler::__anon26346::OptimizeContext 471 opt_cxt.node_map), 1882 NodeMap* node_map) 1884 graph, node_map), 2111 NodeMap node_map(outpu 372 GraphProcessor(const GraphProperties& graph_properties, const VirtualPlacer& virtual_placer, const std::unordered_set<string>& nodes_to_preserve, GraphDef* graph, NodeMap* node_map) argument 1877 DataLayoutOptimizer( const GraphProperties& graph_properties, const VirtualPlacer& virtual_placer, const LayoutOptimizer::TuningConfig& config, const std::unordered_set<string>& nodes_to_preserve, GraphDef* graph, NodeMap* node_map) argument [all...] |
/external/tensorflow/tensorflow/core/grappler/ |
H A D | utils.cc | 246 int NumNonControlOutputs(const NodeDef& node, const NodeMap& node_map) { argument 248 for (const NodeDef* output : node_map.GetOutputs(node.name())) { 274 NodeDef* GetTailOfChain(const NodeDef& source, const NodeMap& node_map, argument 285 next = node_map.GetNode(current->input(0));
|
/external/tensorflow/tensorflow/core/graph/ |
H A D | graph_constructor.cc | 1275 node_map; // "Node in src" -> "Node in *dest" local 1276 node_map[src.source_node()] = dest->source_node(); 1277 node_map[src.sink_node()] = dest->sink_node(); 1279 node_map[n] = dest->CopyNode(n); 1284 Node* src_copy = node_map[e->src()]; 1285 Node* dst_copy = node_map[e->dst()];
|