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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
|
/* 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 <memory>
#include "tensorflow/core/grappler/utils.h"
#include "tensorflow/core/lib/strings/numbers.h"
#include "tensorflow/core/lib/strings/scanner.h"
#include "tensorflow/core/lib/strings/strcat.h"
#include "tensorflow/core/platform/notification.h"
namespace tensorflow {
namespace grappler {
NodeMap::NodeMap(GraphDef* graph) : graph_(graph) {
for (int i = 0; i < graph_->node_size(); i++) {
auto node = graph_->mutable_node(i);
auto rslt = nodes_.insert(std::make_pair(node->name(), node));
// Check that the graph doesn't contain multiple nodes with the same name.
CHECK(rslt.second);
for (const auto& input : node->input()) {
outputs_[NodeName(input)].insert(nodes_[node->name()]);
}
}
}
NodeDef* NodeMap::GetNode(const string& name) const {
string node_name = NodeName(name);
auto it = nodes_.find(node_name);
if (it == nodes_.end()) {
return nullptr;
}
return it->second;
}
const std::set<NodeDef*>& NodeMap::GetOutputs(const string& node_name) const {
auto it = outputs_.find(node_name);
if (it == outputs_.end()) {
return empty_set_;
}
return it->second;
}
void NodeMap::AddNode(const string& name, NodeDef* node) {
auto ret = nodes_.insert(std::make_pair(name, node));
CHECK(ret.second) << "Pair (" << name << "," << node
<< ") is not inserted because a same key already exists.";
}
void NodeMap::AddOutput(const string& node_name, const string& output_name) {
auto output_node = nodes_[output_name];
CHECK(output_node) << "Output node " << output_name
<< " is missing in NodeMap.";
outputs_[node_name].insert(output_node);
}
void NodeMap::RemoveOutput(const string& node_name, const string& output_name) {
outputs_[node_name].erase(nodes_[output_name]);
}
void NodeMap::UpdateInput(const string& node_name, const string& old_input_name,
const string& new_input_name) {
RemoveOutput(old_input_name, node_name);
AddOutput(new_input_name, node_name);
}
void NodeMap::RemoveInputs(const string& node_name) {
auto node = nodes_[node_name];
for (const auto& input : node->input()) {
RemoveOutput(NodeName(input), node->name());
}
}
void NodeMap::RemoveOutputs(const string& node_name) {
outputs_.erase(node_name);
}
void NodeMap::UpdateOutput(const string& node_name,
const string& old_output_name,
const string& new_output_name) {
std::set<NodeDef*>& outputs = outputs_[node_name];
outputs.erase(nodes_[old_output_name]);
outputs.insert(nodes_[new_output_name]);
}
bool IsSameInput(const string& name1, const string& name2) {
if (name1 == name2) {
return true;
}
int position1;
string node1 = ParseNodeName(name1, &position1);
int position2;
string node2 = ParseNodeName(name2, &position2);
return (position1 == position2) && (node1 == node2);
}
string ParseNodeName(const string& name, int* position) {
// Strip the prefix '^' (if any), and strip the trailing ":{digits} (if any)
// to get a node name.
strings::Scanner scan(name);
scan.ZeroOrOneLiteral("^")
.RestartCapture()
.One(strings::Scanner::LETTER_DIGIT_DOT)
.Any(strings::Scanner::LETTER_DIGIT_DASH_DOT_SLASH_UNDERSCORE);
StringPiece capture;
StringPiece remaining;
if (scan.Peek(':') != ':' || !scan.GetResult(&remaining, &capture)) {
*position = 0;
return "";
} else {
if (name[0] == '^') {
*position = -1;
} else if (remaining.empty()) {
*position = 0;
} else {
// Skip the first ':' character.
CHECK(strings::safe_strto32(remaining.substr(1), position));
}
return capture.ToString();
}
}
bool IsControlInput(const string& name) {
return !name.empty() && name[0] == '^';
}
string NodeName(const string& name) {
int position;
return ParseNodeName(name, &position);
}
int NodePosition(const string& name) {
int position;
ParseNodeName(name, &position);
return position;
}
string AddPrefixToNodeName(const string& name, const string& prefix,
const string& delimiter) {
if (!name.empty()) {
if (name[0] == '^') {
return strings::StrCat("^", prefix, delimiter, name.substr(1));
}
}
return strings::StrCat(prefix, delimiter, name);
}
string AddPrefixToNodeName(const string& name, const string& prefix) {
return AddPrefixToNodeName(name, prefix, "/");
}
bool ExecuteWithTimeout(std::function<void()> fn, const int64 timeout_in_ms,
thread::ThreadPool* const thread_pool) {
if (timeout_in_ms <= 0) {
fn();
return true;
}
auto done = std::make_shared<Notification>();
thread_pool->Schedule([done, fn]() {
fn();
done->Notify();
});
const bool notified =
WaitForNotificationWithTimeout(done.get(), timeout_in_ms * 1000);
return notified;
}
string AsControlDependency(const NodeDef& node) {
return strings::StrCat("^", node.name());
}
string AsControlDependency(const string& node) {
return strings::StrCat("^", node);
}
} // end namespace grappler
} // end namespace tensorflow
|
