/
graph.h
475 lines (425 loc) · 14.3 KB
/
graph.h
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
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
/* Copyright (c) 2018 PaddlePaddle 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. */
#pragma once
#include <gflags/gflags.h>
#include <map>
#include <memory>
#include <string>
#include <unordered_set>
#include <vector>
#include "paddle/fluid/framework/ir/node.h"
#include "paddle/fluid/framework/program_desc.h"
#include "paddle/fluid/platform/enforce.h"
#include "paddle/utils/any.h"
DECLARE_bool(convert_all_blocks);
namespace paddle {
namespace framework {
class OpDesc;
class VarDesc;
} // namespace framework
} // namespace paddle
namespace paddle {
namespace framework {
namespace details {
// This attr is not recommended, because the graph should not dependence
// the program once it is built.
constexpr char kStaleProgramOpDescs[] = "stale_program_op_descs";
constexpr char kRemovedVars[] = "removed_vars";
typedef std::unordered_set<std::shared_ptr<ir::Node>> RemovedVars;
} // namespace details
namespace ir {
/*
* The graph is a Directed Acyclic Single Static Assignment Graph.
*
* In more detail, the following properties must hold:
*
* The graph shouldn't contain cycle. Each node is a black-box to the graph
* so the node itself could be a loop operator.
*
* Each Variable-type node has only one input (thus single static assignment).
*
* The output/input of operator is variable and the output/input of variable
* is operator.
*
* The following data harzards in Program are addressed in the Graph:
*
* Write-After-Read
* a = op1(x)
* x = op2(b)
* A control-dependency connection is created bettwen op1 and op2 such that
* op1->op2, so as to ensure correct order.
*
* Write-After-Write
* x = op1(a)
* x = op2(b)
* A control-dependency connection is created between op1 and op2 such that
* op1->op2, so as to ensure correct order.
*
* Other properties currently hold, but is not enforced yet:
*
* Variable-type node (not control dep) with the same variable name share
* the same underlying VarDesc.
*/
class Graph {
public:
// Construct a main_graph with some sub_graphs
explicit Graph(const ProgramDesc &program);
// Construct a main_graph with some sub_graphs, and the 1st sub_graph is
// constructed with ops[start_op_index, end_op_index)
Graph(const ProgramDesc &program,
const int64_t start_op_index,
const int64_t end_op_index);
// Construct a sub_graph
Graph(const BlockDesc &block, const Graph *main_graph);
// Construct a sub_graph with ops[start_op_index, end_op_index)
Graph(const BlockDesc &block,
const Graph *main_graph,
const int64_t start_op_index,
const int64_t end_op_index);
virtual ~Graph() {
for (auto &attr : attrs_) {
attr_dels_[attr.first]();
}
attrs_.clear();
attr_dels_.clear();
}
bool IsConstructedByPartialProgram() const {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->IsConstructedByPartialProgram();
}
}
return is_partial_;
}
bool Has(const std::string &attr_name) const {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->Has(attr_name);
}
}
return attrs_.count(attr_name) > 0;
}
template <typename AttrType>
AttrType &GetOrInit(const std::string &attr_name) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->GetOrInit<AttrType>(attr_name);
}
}
if (!Has(attr_name)) {
Set(attr_name, new AttrType);
}
return Get<AttrType>(attr_name);
}
template <typename AttrType>
AttrType &Get(const std::string &attr_name) const {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->Get<AttrType>(attr_name);
}
}
PADDLE_ENFORCE_EQ(
Has(attr_name),
true,
platform::errors::PreconditionNotMet(
"%s attribute not registered for current graph.", attr_name));
try {
return *paddle::any_cast<AttrType *>(attrs_.at(attr_name));
} catch (paddle::bad_any_cast &) {
PADDLE_THROW(platform::errors::InvalidArgument(
"Invalid attribute type of %s, expected: %s, received: %s.",
attr_name,
platform::demangle(typeid(AttrType *).name()), // NOLINT
platform::demangle(attrs_.at(attr_name).type().name())));
}
}
template <typename AttrType>
void Set(const std::string &attr_name, AttrType *attr) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->Set<AttrType>(attr_name, attr);
}
}
PADDLE_ENFORCE_EQ(
attrs_.count(attr_name),
0,
platform::errors::AlreadyExists(
"The attribute %s to be set already exists in the graph.",
attr_name));
attrs_[attr_name] = attr;
attr_dels_[attr_name] = [attr, attr_name]() {
VLOG(3) << "deleting " << attr_name;
delete attr;
};
}
template <typename AttrType>
void SetNotOwned(const std::string &attr_name, AttrType *attr) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->SetNotOwned<AttrType>(attr_name, attr);
}
}
PADDLE_ENFORCE_EQ(
attrs_.count(attr_name),
0,
platform::errors::AlreadyExists("The attribute %s to be set(not owned) "
"already exists in the graph.",
attr_name));
attrs_[attr_name] = attr;
attr_dels_[attr_name] = []() {};
}
void Erase(const std::string &attr_name) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->Erase(attr_name);
}
}
PADDLE_ENFORCE_NE(
attrs_.count(attr_name),
0,
platform::errors::NotFound(
"The attribute %s to be erased does not exist in the graph.",
attr_name));
attr_dels_[attr_name]();
attrs_.erase(attr_name);
attr_dels_.erase(attr_name);
}
const std::unordered_set<ir::Node *> &Nodes() const {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->Nodes();
}
}
return node_set_;
}
// Create a normal variable with non-null VarDesc.
ir::Node *CreateVarNode(VarDesc *var_desc, int block_id = -1) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->CreateVarNode(var_desc);
}
}
PADDLE_ENFORCE_NOT_NULL(
var_desc,
platform::errors::InvalidArgument(
"The VarDesc used to create variable node is null."));
auto *x =
AddNode(new ir::Node(var_desc, block_id == -1 ? block_id_ : block_id));
x->SetId(num_node_created_++);
x->SetGraphId(block_id_);
return x;
}
// Create a normal runnable operator with OpDesc.
ir::Node *CreateOpNode(OpDesc *op_desc) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->CreateOpNode(op_desc);
}
}
PADDLE_ENFORCE_NOT_NULL(
op_desc,
platform::errors::InvalidArgument(
"The OpDesc used to create operator node is null."));
auto *x = AddNode(new ir::Node(op_desc));
x->SetId(num_node_created_++);
x->SetGraphId(block_id_);
return x;
}
// Create a control dependency var that connects 2 operations. The
// var doesn't hold any data. Other than that, it's no different from
// other var, considering dependency analysis.
ir::Node *CreateControlDepVar() {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->CreateControlDepVar();
}
}
// TODO(panyx0718): control var name should be really unique.
const std::string name =
string::Sprintf("%s@%llu",
static_cast<const char *>(ir::Node::kControlDepVarName),
num_node_created_);
auto *x = AddNode(new ir::Node(name, ir::Node::Type::kVariable, block_id_));
x->SetId(num_node_created_++);
x->SetGraphId(block_id_);
return x;
}
// A more free style way of creating a graph node. Mostly use for test
// or "copy" from another node. Avoid using it if possible.
ir::Node *CreateEmptyNode(const std::string &name, ir::Node::Type type) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->CreateEmptyNode(name, type);
}
}
auto *x = AddNode(new ir::Node(name, type, block_id_));
x->SetId(num_node_created_++);
x->SetGraphId(block_id_);
return x;
}
// Clear all node information of the graph and return the ownership of the
// nodes.
std::vector<std::unique_ptr<ir::Node>> ReleaseNodes() {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->ReleaseNodes();
}
}
std::vector<std::unique_ptr<ir::Node>> ret;
for (auto &n : nodes_) {
ret.emplace_back(n.second.release());
}
nodes_.clear();
node_set_.clear();
return ret;
}
std::unique_ptr<ir::Node> RemoveNode(ir::Node *node) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->RemoveNode(node);
}
}
PADDLE_ENFORCE_EQ(node_set_.find(node) != node_set_.end(),
true,
platform::errors::PreconditionNotMet(
"The node to be removed does not exist."));
std::unique_ptr<ir::Node> ret;
ret.reset(nodes_.at(node).release());
nodes_.erase(node);
node_set_.erase(node);
return ret;
}
// NOTE low performance, but simple and secure.
Node *RetrieveNode(int id) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->RetrieveNode(id);
}
}
for (auto &node : nodes_) {
if (node.second->id() == id) {
return node.second.get();
}
}
return nullptr;
}
// Returns reference to the original program.
// WARN: After a series of passes, the current graph can be quite
// different from OriginProgram. Caller shouldn't assume much from
// the returned OriginProgram.
const ProgramDesc &OriginProgram() const {
if (FLAGS_convert_all_blocks) {
if (!IsMainGraph()) {
return main_graph_->OriginProgram();
}
}
return program_;
}
// This method takes ownership of `node`.
ir::Node *AddNode(ir::Node *node) {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->AddNode(node);
}
}
PADDLE_ENFORCE_EQ(node_set_.find(node) == node_set_.end(),
true,
platform::errors::PreconditionNotMet(
"The node to be added already exists."));
nodes_[node].reset(node);
node_set_.insert(node);
return node;
}
void ResolveHazard(
const std::map<std::string, std::vector<ir::Node *>> &var_nodes);
// Create a new and duplicated graph.
// WARN: The method only clones the graph structure, not its attributes.
std::shared_ptr<Graph> Clone();
bool IsMainGraph() const { return main_graph_ == nullptr; }
Graph *GetSubGraph(const size_t idx) const {
PADDLE_ENFORCE_EQ(
this->IsMainGraph(),
true,
platform::errors::InvalidArgument("This graph is not main_graph"));
PADDLE_ENFORCE_LT(
idx,
sub_graphs_.size(),
platform::errors::InvalidArgument("Invalid sub_graph index"));
return sub_graphs_.at(idx).get();
}
int GetBlockId() const {
if (FLAGS_convert_all_blocks) {
if (IsMainGraph()) {
return GetSubGraph(0)->block_id_;
}
}
return block_id_;
}
size_t SubGraphsSize() const {
PADDLE_ENFORCE_EQ(
this->IsMainGraph(),
true,
platform::errors::InvalidArgument("This graph is not main_graph"));
return sub_graphs_.size();
}
private:
// TODO(levi): delete this interface after when we can convert all
// blocks into sub_graphs.
std::map<std::string, std::vector<ir::Node *>> InitFromProgram(
const ProgramDesc &program,
const int64_t start_op_index,
const int64_t end_op_index);
std::map<std::string, std::vector<ir::Node *>> InitFromBlock(
const BlockDesc &block,
const int64_t start_op_index,
const int64_t end_op_index);
void ReleaseSubGraphs() {
PADDLE_ENFORCE_EQ(
this->IsMainGraph(),
true,
platform::errors::InvalidArgument("This graph is not main_graph"));
sub_graphs_.clear();
}
void AddSubGraph(std::unique_ptr<Graph> sub_graph) {
PADDLE_ENFORCE_EQ(
this->IsMainGraph(),
true,
platform::errors::InvalidArgument("This graph is not main_graph"));
PADDLE_ENFORCE_EQ(sub_graphs_.size(),
sub_graph->block_id_,
platform::errors::InvalidArgument(
"sub_graph idx is not equal to block_id_"));
sub_graphs_.push_back(std::move(sub_graph));
}
std::unique_ptr<Graph> CloneSubGraph(const size_t idx);
// NOTE: program_ shouldn't be exposed to user.
const ProgramDesc program_;
// NOTE: main_graph_ doesn't hold any node. It's used as a container of
// sub_graphs, and the sub_graph holds the nodes.
const Graph *main_graph_; // not owned.
std::vector<std::unique_ptr<Graph>> sub_graphs_;
std::map<std::string, paddle::any> attrs_;
std::map<std::string, std::function<void(void)>> attr_dels_;
std::map<ir::Node *, std::unique_ptr<ir::Node>> nodes_;
std::unordered_set<ir::Node *> node_set_;
size_t num_node_created_{0}; // help to generate a unique node id.
// NOTE(Aurelius84): Whether is constructed with partial ProgramDesc.
// In case of @to_static, whole trainning program is splited into two
// parts: forward graph and backward graph, which can be executed
// independently.
bool is_partial_{false};
// The block this SubGraph belongs to.
int block_id_{0};
};
bool IsControlDepVar(const ir::Node &var);
} // namespace ir
} // namespace framework
} // namespace paddle