infer_clean_graph_pass.cc 2.1 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
// 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.

#include <algorithm>
Y
Yan Chunwei 已提交
16
#include "paddle/fluid/framework/ir/fuse_pass_base.h"
17
#include "paddle/fluid/framework/ir/graph.h"
Y
Yan Chunwei 已提交
18
#include "paddle/fluid/framework/ir/graph_pattern_detector.h"
19 20 21 22 23

namespace paddle {
namespace framework {
namespace ir {

Y
Yan Chunwei 已提交
24
class InferCleanGraphPass : public FusePassBase {
25 26 27 28 29
 public:
  virtual ~InferCleanGraphPass() {}

 protected:
  std::unique_ptr<ir::Graph> ApplyImpl(std::unique_ptr<ir::Graph> graph) const {
Y
Yan Chunwei 已提交
30
    FusePassBase::Init("original_graph", graph.get());
31 32 33 34 35 36
    PADDLE_ENFORCE(graph.get());

    auto is_valid_node = [](Node* x) {
      return x && IsControlDepVar(*x) && x->IsVar() && !x->Var();
    };

Y
Yan Chunwei 已提交
37 38
    std::unordered_set<const Node*> invalid_nodes;
    int valid_op = 0;
39
    for (auto* node : graph->Nodes()) {
S
sneaxiy 已提交
40
      PADDLE_ENFORCE_NOT_NULL(node);
41 42
      if (is_valid_node(node)) {
        invalid_nodes.insert(node);
Y
Yan Chunwei 已提交
43 44 45
      } else if (node->IsOp()) {
        // Collect all the operators to help tracking number of operators.
        ++valid_op;
46 47 48
      }
    }

Y
Yan Chunwei 已提交
49
    GraphSafeRemoveNodes(graph.get(), invalid_nodes);
50

Y
Yan Chunwei 已提交
51
    AddStatis(valid_op);
52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69

    return graph;
  }

  void CleanEdges(std::vector<Node*>* nodes,
                  const std::unordered_set<Node*>& to_remove) const {
    auto it = std::remove_if(nodes->begin(), nodes->end(),
                             [&](Node* x) { return to_remove.count(x); });
    nodes->erase(it, nodes->end());
  }
};

}  // namespace ir
}  // namespace framework
}  // namespace paddle

REGISTER_PASS(infer_clean_graph_pass,
              paddle::framework::ir::InferCleanGraphPass);