1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
/* Copyright 2017 The TensorFlow Authors. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
==============================================================================*/
#include "tensorflow/core/grappler/utils/frame.h"
#include <deque>
#include <stack>
#include "tensorflow/core/framework/attr_value.pb.h"
#include "tensorflow/core/framework/node_def.pb.h"
#include "tensorflow/core/grappler/op_types.h"
#include "tensorflow/core/grappler/utils.h"
#include "tensorflow/core/lib/core/errors.h"
namespace tensorflow {
namespace grappler {
Status IdentifyFrames(const GraphDef& graph, FrameMap* frame_map,
int* num_frames) {
NodeMap node_map(const_cast<GraphDef*>(&graph));
return IdentifyFramesWithNodeMap(graph, node_map, frame_map, num_frames);
}
Status IdentifyFramesWithNodeMap(const GraphDef& graph, const NodeMap& node_map,
FrameMap* frame_map, int* num_frames) {
std::deque<std::pair<const NodeDef*, std::vector<int>>> ready_nodes;
for (const NodeDef& node : graph.node()) {
if (node.input_size() == 0) {
std::vector<int> empty;
ready_nodes.emplace_back(&node, empty);
(*frame_map)[&node] = empty;
}
}
std::map<string, int> name_to_id;
while (!ready_nodes.empty()) {
auto ready_node = ready_nodes.front();
for (const auto& fanout : node_map.GetOutputs(ready_node.first->name())) {
if (frame_map->count(fanout) < 1) {
std::vector<int> frame_ids = ready_node.second;
if (IsExit(*ready_node.first)) {
frame_ids.pop_back();
}
if (IsEnter(*fanout)) {
CHECK(fanout->attr().count("frame_name"))
<< "Missing frame name for the Enter node " << fanout->name();
string name = fanout->attr().at("frame_name").s();
int id;
if (name_to_id.count(name)) {
id = name_to_id[name];
} else {
id = name_to_id.size();
name_to_id[name] = id;
}
frame_ids.push_back(id);
}
ready_nodes.emplace_back(fanout, frame_ids);
(*frame_map)[fanout] = frame_ids;
} else {
auto frame_ids_fanout = (*frame_map)[fanout];
auto frame_ids_node = ready_node.second;
if (IsEnter(*fanout)) {
frame_ids_fanout.pop_back();
}
if (IsExit(*ready_node.first)) {
frame_ids_node.pop_back();
}
if (frame_ids_node != frame_ids_fanout) {
return errors::InvalidArgument(
"Invalid graph: Frame ids for node ", ready_node.first->name(),
" does not match frame ids for it's fanout.");
}
}
}
ready_nodes.pop_front();
}
*num_frames = name_to_id.size();
return Status::OK();
}
} // namespace grappler
} // namespace tensorflow
|
