memory_optimize.cpp 4.6 KB
Newer Older
H
hjchen2 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
/* 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 "pass/memory_optimize.h"
#include "framework/lod_tensor.h"

namespace paddle_mobile {
namespace pass {

21 22
void MemoryOptPass::AppendBlockVars(const framework::BlockDesc *block) {
  // block_vars_.clear();
H
hjchen2 已提交
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
  for (const auto var : block->Vars()) {
    block_vars_[var->Name()] = var.get();
  }
}

bool MemoryOptPass::IsPersistable(const std::string name) {
  const auto it = block_vars_.find(name);
  if (it != block_vars_.end()) {
    return it->second->Persistable();
  }
  return false;
}

VarNode *MemoryOptPass::CreateNode(const std::string name) {
  auto it = created_nodes_.find(name);
  if (it != created_nodes_.end()) {
    ++(it->second->count);
    return it->second;
  }
  VarNode *var = new VarNode;
  var->name = name;
  var->count = 1;
  var->visited = false;
  created_nodes_[name] = var;
  return var;
}

void MemoryOptPass::operator()(const framework::ProgramDesc *program,
                               framework::Scope *scope) {
  const auto &blocks = program->Blocks();
  for (const auto &block : blocks) {
54 55
    // access all variables in each block
    AppendBlockVars(block.get());
H
hjchen2 已提交
56 57 58 59 60 61 62

    reused_nodes_.clear();
    // collect all not persistable variables, and accumulate
    // it's reference count
    std::stack<VarNode *> empty_var_nodes;
    analysis_nodes_.swap(empty_var_nodes);

63
    std::vector<VarNode *> fetch_var_nodes;
H
hjchen2 已提交
64 65
    for (const auto &op : block->Ops()) {
      DLOG << "op_desc->Type(): " << op->Type();
H
hjchen2 已提交
66
      for (const auto &outputs : op->GetOutputs()) {
H
hjchen2 已提交
67 68 69 70 71 72 73 74
        for (const auto &output : outputs.second) {
          if (!IsPersistable(output)) {
            DLOG << "output: " << output;
            VarNode *node = CreateNode(output);
            analysis_nodes_.push(node);
          }
        }
      }
H
hjchen2 已提交
75
      for (const auto &inputs : op->GetInputs()) {
H
hjchen2 已提交
76 77 78 79 80
        for (const auto &input : inputs.second) {
          if (!IsPersistable(input)) {
            DLOG << "input: " << input;
            VarNode *node = CreateNode(input);
            analysis_nodes_.push(node);
81 82 83
            if (op->Type() == "fetch") {
              fetch_var_nodes.push_back(node);
            }
H
hjchen2 已提交
84 85 86
          }
        }
      }
H
hjchen2 已提交
87 88 89 90 91 92 93 94 95
      for (const auto &outputs : op->GetOutputs()) {
        for (const auto &output : outputs.second) {
          if (!IsPersistable(output)) {
            DLOG << "output: " << output;
            VarNode *node = CreateNode(output);
            analysis_nodes_.push(node);
          }
        }
      }
H
hjchen2 已提交
96 97
    }

98 99 100 101
    for (const auto &node : fetch_var_nodes) {
      analysis_nodes_.push(node);
    }

H
hjchen2 已提交
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
    // apply optimize
    while (!analysis_nodes_.empty()) {
      auto *node = analysis_nodes_.top();
      analysis_nodes_.pop();
      // only not visited node can reuse memory between other nodes
      // with 0 count which indicate they will not be used any more
      if (!node->visited) {
        bool reused = false;
        // find out a possable reuse list
        for (auto &list : reused_nodes_) {
          if (list.back()->count == 0) {
            list.push_back(node);
            reused = true;
            break;
          }
        }
        // create new list if can't find a reused list
        if (!reused) {
          std::vector<VarNode *> list;
          list.push_back(node);
          reused_nodes_.push_back(std::move(list));
        }
      }
      node->visited = true;
      node->count -= 1;
    }
128 129 130 131 132 133 134 135 136 137 138 139 140 141

    // shared data within all variables in the same reused list
    for (const auto &list : reused_nodes_) {
      DLOG << "\n";
      DLOG << "share memory within these variables";
      std::string name = list[0]->name;
      auto *reused_var = scope->Var(name);
      auto *reuse_tensor =
          reused_var->template GetMutable<framework::LoDTensor>();
      reuse_tensor->mutable_data<float>();
      for (const auto &node : list) {
        DLOG << node->name;
        auto *var = scope->Var(node->name);
        auto *tensor = var->template GetMutable<framework::LoDTensor>();
H
update  
hjchen2 已提交
142
        tensor->ShareHolderWith(*reuse_tensor);
143
      }
H
hjchen2 已提交
144 145 146 147 148 149
    }
  }
}

}  // namespace pass
}  // namespace paddle_mobile