graph.cc 4.1 KB
Newer Older
X
Xin Pan 已提交
1
/* Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.
X
start  
Xin Pan 已提交
2 3 4 5 6 7 8 9 10 11 12 13 14

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. */

X
Xin Pan 已提交
15 16 17
#include <algorithm>
#include <unordered_set>

X
start  
Xin Pan 已提交
18
#include "paddle/fluid/framework/ir/graph.h"
X
Xin Pan 已提交
19
#include "paddle/fluid/framework/op_proto_maker.h"
20 21
#include "paddle/fluid/framework/program_desc.h"
#include "paddle/fluid/framework/var_desc.h"
X
start  
Xin Pan 已提交
22 23

namespace paddle {
X
Xin Pan 已提交
24
namespace framework {
X
Xin Pan 已提交
25
namespace ir {
X
Xin Pan 已提交
26

X
clean  
Xin Pan 已提交
27
Graph::Graph(const ProgramDesc &program) : program_(program) {
Q
qiaolongfei 已提交
28
  VLOG(3) << "block in program:" << program_.Size();
29 30 31 32 33
  std::unordered_map<std::string, VarDesc *> all_vars;
  for (auto *var : program.Block(0).AllVars()) {
    all_vars.emplace(var->Name(), var);
  }

X
Xin Pan 已提交
34
  std::map<std::string, std::vector<ir::Node *>> var_nodes;
35
  for (auto *op : program.Block(0).AllOps()) {
X
clean  
Xin Pan 已提交
36
    ir::Node *node = CreateOpNode(op);
X
Xin Pan 已提交
37 38
    // For input args, reuse the same var name if it was created before.
    // Otherwise, create a new one.
39 40
    for (auto &each_var_name : op->InputArgumentNames()) {
      ir::Node *var = nullptr;
X
Xin Pan 已提交
41
      if (var_nodes.find(each_var_name) != var_nodes.end()) {
X
Xin Pan 已提交
42
        var = var_nodes.at(each_var_name).back();
X
Xin Pan 已提交
43
      } else if (all_vars.count(each_var_name) != 0) {
X
clean  
Xin Pan 已提交
44
        var = CreateVarNode(all_vars.at(each_var_name));
X
Xin Pan 已提交
45
        var_nodes[each_var_name].push_back(var);
46
      } else {
X
Xin Pan 已提交
47 48 49
        // Operation input var can be optional (dispensable). Which means
        // the operation doesn't really need the var at runtime. In this
        // case, the no-existed var is ready at the beginning.
X
polish  
Xin Pan 已提交
50
        var = CreateEmptyNode(each_var_name, ir::Node::Type::kVariable);
X
Xin Pan 已提交
51
        var_nodes[each_var_name].push_back(var);
52 53 54 55
      }
      node->inputs.push_back(var);
      var->outputs.push_back(node);
    }
X
Xin Pan 已提交
56
    // For output args, always create a new var.
57
    for (auto &each_var_name : op->OutputArgumentNames()) {
X
Xin Pan 已提交
58 59
      ir::Node *var = CreateVarNode(all_vars.at(each_var_name));
      var_nodes[each_var_name].push_back(var);
60 61 62 63
      node->outputs.push_back(var);
      var->inputs.push_back(node);
    }
  }
X
polish  
Xin Pan 已提交
64 65 66 67 68 69 70
  /**
   * We only handle write after read(WAR), since it should not have a write
   * after write in program. If there are write after write operators, we need
   * prune them.
   *
   * https://en.wikipedia.org/wiki/Hazard_(computer_architecture)#Write_after_read_(WAR)
   */
X
Xin Pan 已提交
71

X
Xin Pan 已提交
72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89
  for (auto &var : var_nodes) {
    auto &versions = var.second;
    if (versions.size() <= 1) continue;

    auto it_new = versions.rbegin();
    auto it_old = versions.rbegin();
    ++it_old;
    for (; it_old != versions.rend(); it_new = it_old, ++it_old) {
      ir::Node *write_op =
          (*it_new)->inputs.empty() ? nullptr : (*it_new)->inputs[0];
      const auto &read_ops = (*it_old)->outputs;

      for (auto *read_op : read_ops) {
        // Manually add a dependency var from read_op to write_op;
        if (read_op == write_op) {
          // Read Write is the same op.
          continue;
        }
X
Xin Pan 已提交
90 91 92 93 94 95 96 97 98 99 100
        // 2 ops might have been connected via other vars.
        bool has_dep = false;
        for (ir::Node *r_out : read_op->outputs) {
          for (ir::Node *w_in : write_op->inputs) {
            if (r_out == w_in) {
              has_dep = true;
              break;
            }
          }
        }
        if (has_dep) continue;
X
Xin Pan 已提交
101

X
Xin Pan 已提交
102
        ir::Node *dep_var = CreateControlDepVar();
X
Xin Pan 已提交
103 104 105 106 107 108 109
        read_op->outputs.push_back(dep_var);
        dep_var->inputs.push_back(read_op);
        write_op->inputs.push_back(dep_var);
        dep_var->outputs.push_back(write_op);
      }
    }
  }
X
better  
Xin Pan 已提交
110
}
X
Xin Pan 已提交
111 112 113 114

bool IsControlDepVar(const ir::Node &var) {
  return var.Name().find(ir::Node::kControlDepVarName) != std::string::npos;
}
X
Xin Pan 已提交
115
}  // namespace ir
X
Xin Pan 已提交
116
}  // namespace framework
X
start  
Xin Pan 已提交
117
}  // namespace paddle