memory_optimize_pass.h 2.3 KB
Newer Older
D
dzhwinter 已提交
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
// 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 <algorithm>
#include <list>
#include <map>
#include <memory>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

#include "paddle/fluid/framework/data_type.h"
D
dzhwinter 已提交
28
#include "paddle/fluid/framework/details/memory_optimize_helper.h"
D
dzhwinter 已提交
29 30 31 32 33 34 35
#include "paddle/fluid/framework/ir/graph.h"
#include "paddle/fluid/framework/ir/pass.h"

namespace paddle {
namespace framework {
namespace details {

D
dzhwinter 已提交
36
class MemoryOptimizePass : public ir::Pass {
D
dzhwinter 已提交
37 38 39 40 41
 protected:
  std::unique_ptr<ir::Graph> ApplyImpl(
      std::unique_ptr<ir::Graph> graph) const override;
  // fill the variable map(var_nodes) by version.
  void InitSSAGraphNodes() const;
D
dzhwinter 已提交
42 43

 private:
D
dzhwinter 已提交
44 45 46 47 48 49 50 51 52
  // update program descs
  void RenameVarInGraphDesc(const std::string& var,
                            const std::string& cache_var, size_t idx) const;
  // update ir nodes
  void RenameVarInGraphNode(const std::string& var,
                            const std::string& cache_var, size_t idx,
                            ir::Graph* graph) const;

  void SubGraphOptimize(OpDesc* op_desc) const;
D
dzhwinter 已提交
53 54 55 56
  // 1. scan op with subblock and collect the output/input vars.
  // while, while_grad, conditional_block
  // 2. scan distributed ops and collect the output/input vars
  void CollectSkipVarsSet(const std::unordered_set<ir::Node*>&) const;
D
dzhwinter 已提交
57 58 59

 private:
  // Reuse Node Pool, Owned.
D
dzhwinter 已提交
60
  mutable OrderedSet pool_;
D
dzhwinter 已提交
61 62 63 64 65 66 67 68 69 70 71
  // controlflow Graph
  mutable std::unique_ptr<ControlFlowGraph> cfg_;
  // skip set
  mutable std::unordered_set<std::string> skip_set_;
  // var nodes
  mutable std::map<std::string, std::vector<ir::Node*>> var_nodes_;
};

}  // namespace details
}  // namespace framework
}  // namespace paddle