interpretercore_util.cc 27.6 KB
Newer Older
W
wanghuancoder 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14
// Copyright (c) 2021 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 "paddle/fluid/framework/new_executor/interpretercore_util.h"
15 16
#include <algorithm>

W
wanghuancoder 已提交
17 18 19 20
#include "paddle/fluid/framework/executor_gc_helper.h"

namespace paddle {
namespace framework {
21
namespace interpreter {
22
using VariableIdMap = std::map<std::string, std::vector<int>>;
W
wanghuancoder 已提交
23

24
AtomicVectorSizeT& AsyncWorkQueue::PrepareAtomicDeps(
25
    const std::vector<size_t>& dependecy_count) {
26 27 28 29 30 31
  if (atomic_deps_.size() != dependecy_count.size()) {
    atomic_deps_.clear();
    std::generate_n(std::back_inserter(atomic_deps_), dependecy_count.size(),
                    [] { return std::make_unique<std::atomic<size_t>>(0); });
  }

32
  for (size_t i = 0; i < dependecy_count.size(); ++i) {
33
    atomic_deps_[i]->store(dependecy_count[i]);
34
  }
35
  return atomic_deps_;
36 37
}

38
AtomicVectorSizeT& AsyncWorkQueue::PrepareAtomicVarRef(
39
    const std::vector<VariableMetaInfo>& vec_meta_info) {
40 41 42 43 44
  if (atomic_var_ref_.size() != vec_meta_info.size()) {
    atomic_var_ref_.clear();
    std::generate_n(std::back_inserter(atomic_var_ref_), vec_meta_info.size(),
                    [] { return std::make_unique<std::atomic<size_t>>(0); });
  }
45 46

  for (size_t i = 0; i < vec_meta_info.size(); ++i) {
47
    atomic_var_ref_[i]->store(vec_meta_info[i].var_ref_count_);
48
  }
49
  return atomic_var_ref_;
50 51
}

W
wanghuancoder 已提交
52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
bool var_can_be_deleted(const std::string& name, const BlockDesc& block) {
  auto* var_desc = block.FindVar(name);
  if (var_desc == nullptr || var_desc->Persistable()) {
    return false;
  }

  auto type = var_desc->Proto()->type().type();

  return type == proto::VarType::LOD_TENSOR ||
         type == proto::VarType::SELECTED_ROWS ||
         type == proto::VarType::LOD_TENSOR_ARRAY;
}

std::unordered_map<const paddle::framework::OperatorBase*,
                   std::vector<std::string>>
L
Leo Chen 已提交
67 68
get_unused_vars(const BlockDesc& block,
                const std::vector<std::shared_ptr<OperatorBase>>& ops) {
W
wanghuancoder 已提交
69 70 71
  std::unordered_map<std::string, size_t> var_op_idx_map;

  for (size_t i = 0; i < ops.size(); ++i) {
L
Leo Chen 已提交
72
    const auto& op = ops[i];
W
wanghuancoder 已提交
73 74 75 76 77 78 79 80 81 82

    OpInOutInfo info;
    for (auto& name_pair : op->Inputs()) {
      for (auto& name : name_pair.second) {
        if (!var_can_be_deleted(name, block)) {
          continue;
        }

        // var can be gc-ed
        if (!info.IsBuilt()) {
L
Leo Chen 已提交
83
          info.Build(op.get());
W
wanghuancoder 已提交
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
        }

        if (info.IsInArgBufferNeeded(name)) {
          // Update the last living op of variable to current op
          var_op_idx_map[name] = i;
        } else {
          VLOG(10) << "Skip reference count computing of variable "
                   << name_pair.first << "(" << name << ") in Operator "
                   << op->Type();
        }
      }
    }

    for (auto& name_pair : op->Outputs()) {
      for (auto& name : name_pair.second) {
        if (var_can_be_deleted(name, block)) {
          // Update the last living op of variable to current op
          var_op_idx_map[name] = i;
        }
      }
    }
  }

  std::unordered_map<const OperatorBase*, std::vector<std::string>> result;
  for (auto& name_op_idx_pair : var_op_idx_map) {
    auto& name = name_op_idx_pair.first;
    size_t op_idx = name_op_idx_pair.second;
L
Leo Chen 已提交
111 112

    result[ops[op_idx].get()].emplace_back(name);
W
wanghuancoder 已提交
113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133
  }
  return result;
}

std::string get_memcpy_type(const platform::Place& src_place,
                            const platform::Place& dst_place) {
  PADDLE_ENFORCE_EQ(platform::is_same_place(src_place, dst_place), false,
                    platform::errors::PreconditionNotMet(
                        "Required src_place shall be different with dst_place, "
                        "but received same place: %s",
                        src_place));
  if (platform::is_gpu_place(dst_place)) {
    return kMemcpyH2D;
  } else if (platform::is_gpu_place(src_place)) {
    return kMemcpyD2H;
  } else {
    PADDLE_THROW(platform::errors::PreconditionNotMet(
        "Not support Memcpy typ : %s -> %s", src_place, dst_place));
  }
}

134
void build_variable_scope(const framework::BlockDesc& block,
W
wanghuancoder 已提交
135
                          VariableScope* var_scope) {
136
  for (auto& var_desc : block.AllVars()) {
137 138
    auto var_name = var_desc->Name();
    if (var_name == framework::kEmptyVarName) {
W
wanghuancoder 已提交
139 140 141
      continue;
    }

142 143
    if (nullptr == var_scope->FindVar(var_name)) {
      var_scope->AddVar(var_desc->Name(), var_desc);
144
    } else {
145 146
      auto* var_desc_tmp = var_scope->VarDesc(var_name);
      if (nullptr == var_desc_tmp) {
147 148
        VLOG(3) << "update var:" << var_name << " desc from nullptr into "
                << var_desc;
149
        var_scope->SetVarDesc(var_name, var_desc);
150
      }
W
wanghuancoder 已提交
151 152 153 154
    }
  }
}

L
Leo Chen 已提交
155 156
void create_all_ops(const framework::BlockDesc& block,
                    std::vector<std::shared_ptr<OperatorBase>>* ops) {
157 158
  for (auto& op : block.AllOps()) {
    VLOG(3) << "CreateOp from : " << op->Type();
W
wanghuancoder 已提交
159 160 161 162 163 164 165 166 167 168 169 170

    auto& info = OpInfoMap::Instance().Get(op->Type());

    const VariableNameMap& inputs_names = op->Inputs();
    const VariableNameMap& outputs_names = op->Outputs();
    AttributeMap op_attr_map = op->GetAttrMap();

    if (info.Checker() != nullptr) {
      info.Checker()->Check(&op_attr_map);
    }
    auto op_base =
        info.Creator()(op->Type(), inputs_names, outputs_names, op_attr_map);
L
Leo Chen 已提交
171
    ops->emplace_back(std::shared_ptr<OperatorBase>(op_base));
W
wanghuancoder 已提交
172
  }
173 174 175
}

std::tuple<VariableValueMap, VariableIdMap> build_variable_map(
176 177
    const VariableNameMap& var_name_map, VariableScope* var_scope,
    bool enforce_exist = true) {
178 179 180 181 182 183 184 185
  VariableValueMap name2var;
  VariableIdMap name2id;
  for (auto& item : var_name_map) {
    std::vector<Variable*> vars;
    std::vector<int> ids;
    vars.reserve(item.second.size());

    for (auto& var_name : item.second) {
186 187 188 189 190
      if (!enforce_exist && !var_scope->HasVar(var_name)) {
        // skip the non-exist variable: such as recurrent_grad
        VLOG(4) << var_name << " don't exist in variable scope, skip it!";
        continue;
      }
191 192 193 194 195 196 197 198 199 200
      auto var_id = var_scope->VarId(var_name);
      auto* in_var = var_scope->Var(var_id);
      vars.push_back(in_var);
      ids.push_back(var_id);
    }
    name2var[item.first] = std::move(vars);
    name2id[item.first] = std::move(ids);
  }
  return std::make_tuple(name2var, name2id);
}
W
wanghuancoder 已提交
201

202 203 204 205 206 207 208 209 210 211 212 213
void apply_device_guard(const OperatorBase* op_base,
                        const platform::Place& place,
                        OpKernelType* expected_kernel_key) {
  bool need_change_place =
      (op_base->HasAttr("op_device") &&
       (op_base->Attr<std::string>("op_device").length() > 0));
  if (need_change_place) {
    auto& op_device = op_base->Attr<std::string>("op_device");
    if (op_device == "cpu" || platform::is_cpu_place(place)) {
      VLOG(3) << "Switch into CPUPlace by device_guard.";
      expected_kernel_key->place_ = platform::CPUPlace();
    } else if (op_device.find("gpu") != std::string::npos &&
214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229
               (platform::is_gpu_place(place) ||
                platform::is_npu_place(place))) {
      // when the Op that only has CPUKernel is assigned to GPU, the CPUKernel
      // will be executed and a warning will be given at the same time.
      if (op_base->SupportGPU()) {
        expected_kernel_key->place_ = place;
      } else if (op_base->SupportNPU()) {
        expected_kernel_key->place_ = place;
      } else {
        expected_kernel_key->place_ = platform::CPUPlace();
        LOG_FIRST_N(WARNING, 1)
            << "Op(" << op_base->Type()
            << ") has no CUDA implementation. It will be assigned to CPUPlace.";
      }
      VLOG(3) << "Switch into " << expected_kernel_key->place_
              << " by device_guard.";
230 231 232 233 234 235 236
    } else {
      PADDLE_THROW(
          platform::errors::Fatal("Unsupported current place %s", op_device));
    }
  }
}

237
void deal_operator_base(const platform::Place& place,
L
Leo Chen 已提交
238 239
                        const VariableScope* var_scope,
                        std::shared_ptr<OperatorBase> op_base,
240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259
                        OpFuncNode* op_func_node) {
  platform::DeviceContextPool& pool = platform::DeviceContextPool::Instance();
  auto* dev_ctx = pool.Get(place);
  // input, output is prepared. set the other attributes.
  op_func_node->operator_base_ = op_base;
  op_func_node->type_ = OpFuncType::kQueueSync;  // alway Sync
  op_func_node->kernel_func_ = nullptr;
  op_base->Run(*var_scope->GetScope(), place);  // Run without data transformer.

  std::unordered_set<int> no_data_transform_index;
  for (auto& it : op_func_node->input_index) {
    for (auto& id : it.second) {
      no_data_transform_index.emplace(id);
    }
  }
  op_func_node->no_data_transform_index =
      no_data_transform_index;  // all index is no-need-transform
  op_func_node->dev_ctx_ = dev_ctx;
}

X
xiongkun 已提交
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
// the return value is whether data transformer is needed for this var
bool need_place_transform_for_var(const OpKernelType& kernel_type_for_var,
                                  const OpKernelType& expected_kernel_key) {
  if (platform::is_same_place(kernel_type_for_var.place_,
                              expected_kernel_key.place_) ||
      (is_cuda_pinned_place(kernel_type_for_var.place_) &&
       is_cpu_place(expected_kernel_key.place_))) {
    return false;
  } else {
    return true;
  }
}

bool need_dtype_transform_for_var(const OpKernelType& kernel_type_for_var,
                                  const OpKernelType& expected_kernel_key) {
  return false;  // TODO(@xiongkun) add dtype judgement here
}

bool need_layout_transform_for_var(const OpKernelType& kernel_type_for_var,
                                   const OpKernelType& expected_kernel_key) {
  return false;  // TODO(@xiongkun) add layout judgement here
}

// NOTE(@xiongkun03)
// the difference between var_name and outer_name :
// if "X": ["var1", "var2"], then X is the outer name,
// var1 and var2 is the var_name
std::tuple<std::string, OpFuncNode> apply_place_transform_for_var(
    const OpKernelType& kernel_type_for_var,
    const OpKernelType& expected_kernel_key, const platform::Place& place,
    const std::string& var_name, const std::string& outer_name,
    const OpFuncNode& op_func_node, Variable* var, VariableScope* var_scope) {
  auto& all_op_kernels = OperatorWithKernel::AllOpKernels();
  platform::DeviceContextPool& pool = platform::DeviceContextPool::Instance();
  std::string new_var_name =
      var_name + "_copy_" + std::to_string(var_scope->VarSize() + 1);
  var_scope->AddVar(new_var_name, nullptr);

  VariableNameMap copy_in_map;
  copy_in_map["X"] = {var_name};
  VariableNameMap copy_out_map;
  copy_out_map["Out"] = {new_var_name};
  AttributeMap attr_map;
  attr_map["dst_place_type"] =
      is_cpu_place(expected_kernel_key.place_)
          ? 0
          : is_gpu_place(expected_kernel_key.place_) ? 1 : -1;

  std::map<std::string, std::vector<int>> copy_ins_name2id;
309
  copy_ins_name2id["X"] = {var_scope->VarId(var_name)};
X
xiongkun 已提交
310 311 312 313 314 315 316 317 318 319 320 321 322 323 324
  std::map<std::string, std::vector<int>> copy_out_name2id;
  copy_out_name2id["Out"] = {var_scope->VarId(new_var_name)};

  VariableValueMap copy_ins_value_map;
  copy_ins_value_map["X"] = {var};
  VariableValueMap copy_outs_value_map;
  copy_outs_value_map["Out"] = {var_scope->Var(new_var_name)};

  // memcpy_d2h, memcpy_h2d
  auto memcpy_op_type =
      get_memcpy_type(kernel_type_for_var.place_, expected_kernel_key.place_);
  VLOG(3) << string::Sprintf("Insert %s with %s(%s) -> %s(%s).", memcpy_op_type,
                             var_name, kernel_type_for_var.place_, new_var_name,
                             expected_kernel_key.place_);
  auto& copy_info = OpInfoMap::Instance().Get(memcpy_op_type);
L
Leo Chen 已提交
325 326 327
  auto copy_op = std::shared_ptr<OperatorBase>(
      copy_info.Creator()(memcpy_op_type, copy_in_map, copy_out_map, attr_map));

X
xiongkun 已提交
328 329 330 331 332 333 334
  OpFuncNode copy_op_func_node;
  copy_op_func_node.input_index = copy_ins_name2id;
  copy_op_func_node.output_index = copy_out_name2id;

  RuntimeContext copy_runtime_context({}, {});
  copy_runtime_context.inputs.swap(copy_ins_value_map);
  copy_runtime_context.outputs.swap(copy_outs_value_map);
L
Leo Chen 已提交
335
  InterpretercoreInferShapeContext copy_infer_shape_ctx(*copy_op.get(),
X
xiongkun 已提交
336
                                                        copy_runtime_context);
L
Leo Chen 已提交
337 338
  static_cast<const framework::OperatorWithKernel*>(copy_op.get())
      ->InferShape(&copy_infer_shape_ctx);
X
xiongkun 已提交
339 340 341 342 343 344 345 346 347 348 349 350 351

  auto kernels_iter = all_op_kernels.find(memcpy_op_type);
  PADDLE_ENFORCE_NE(kernels_iter, all_op_kernels.end(),
                    platform::errors::Unavailable(
                        "There are no kernels which are registered in "
                        "the memcpy operator."));

  OpKernelMap& kernels = kernels_iter->second;
  auto* dev_ctx = pool.Get(place);
  Scope scope;
  auto copy_exec_ctx =
      ExecutionContext(*copy_op, scope, *dev_ctx, copy_runtime_context);
  auto copy_expected_kernel_key =
L
Leo Chen 已提交
352
      dynamic_cast<const framework::OperatorWithKernel*>(copy_op.get())
X
xiongkun 已提交
353 354 355 356 357 358 359 360 361 362 363 364 365 366
          ->GetExpectedKernelType(copy_exec_ctx);
  auto kernel_iter = kernels.find(copy_expected_kernel_key);
  copy_op_func_node.kernel_func_ = OpKernelComputeFunc(kernel_iter->second);
  copy_op_func_node.kernel_func_(copy_exec_ctx);
  VLOG(3) << "Run " << memcpy_op_type << " done.";
  // NOTE(Aurelius84): memcpy_op is expensive operation, so we tag them
  // as kQueueSync and execute them in thread pool.
  copy_op_func_node.type_ = OpFuncType::kQueueSync;
  copy_op_func_node.dev_ctx_ = dev_ctx;
  copy_op_func_node.operator_base_ = copy_op;

  return std::make_pair(new_var_name, copy_op_func_node);
}

L
Leo Chen 已提交
367 368 369 370 371 372
void apply_data_transform(const OpKernelType& expected_kernel_key,
                          const platform::Place& place,
                          VariableValueMap* ins_map_temp,
                          VariableScope* var_scope, OpFuncNode* op_func_node,
                          std::vector<OpFuncNode>* copy_func_nodes) {
  auto op_base = op_func_node->operator_base_.get();
X
xiongkun 已提交
373 374 375
  PADDLE_ENFORCE_NOT_NULL(op_base, platform::errors::PreconditionNotMet(
                                       "op_base is null, please pass a valid "
                                       "op_base in apply_data_transform."));
L
Leo Chen 已提交
376 377

  VariableNameMap new_ins(op_base->Inputs());
X
xiongkun 已提交
378 379 380 381

  std::unordered_set<int>
      no_data_transform_index;  // record the no need transform variable index.

382
  for (auto& var_name_item : *ins_map_temp) {
X
xiongkun 已提交
383 384
    for (size_t i = 0; i < var_name_item.second.size(); ++i) {
      auto var = var_name_item.second[i];
385 386 387
      if (!(var->IsType<LoDTensor>() || var->IsType<SelectedRows>())) {
        continue;
      }
L
Leo Chen 已提交
388
      auto& var_name = new_ins[var_name_item.first].at(i);
X
xiongkun 已提交
389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406
      auto tensor_in = GetLoDTensorOrSelectedRowsValueFromVar(*var);
      if (!tensor_in->IsInitialized()) {
        continue;
      }
      auto kernel_type_for_var =  // the true kernel type for op_base
          static_cast<const framework::OperatorWithKernel*>(op_base)
              ->GetKernelTypeForVar(var_name_item.first, *tensor_in,
                                    expected_kernel_key);
      if (need_place_transform_for_var(kernel_type_for_var,
                                       expected_kernel_key)) {
        if (op_base->Type() == "fetch_v2") {
          op_base->SetAttr("deepcopy", false);
        }
        std::string new_var_name;
        OpFuncNode copy_op_func_node;
        std::tie(new_var_name, copy_op_func_node) =
            apply_place_transform_for_var(
                kernel_type_for_var, expected_kernel_key, place, var_name,
407 408
                var_name_item.first, *op_func_node, var, var_scope);
        op_func_node->input_index[var_name_item.first][i] =
X
xiongkun 已提交
409
            var_scope->VarId(new_var_name);
L
Leo Chen 已提交
410
        copy_func_nodes->emplace_back(copy_op_func_node);
X
xiongkun 已提交
411
        var_name_item.second[i] = var_scope->Var(new_var_name);
L
Leo Chen 已提交
412
        new_ins[var_name_item.first][i] = new_var_name;
X
xiongkun 已提交
413 414 415 416 417 418 419 420 421 422 423 424 425 426 427
      } else if (need_dtype_transform_for_var(kernel_type_for_var,
                                              expected_kernel_key)) {
        // TODO(@xiongkun) add dtype judgement here
      } else if (need_layout_transform_for_var(kernel_type_for_var,
                                               expected_kernel_key)) {
        // TODO(@xiongkun) add layout judgement here
      } else {
        // record no need data transformer input var_id
        VLOG(3) << op_base->Type()
                << " found no data_transform var: " << var_name
                << " with id: " << var_scope->VarId(var_name);
        no_data_transform_index.emplace(var_scope->VarId(var_name));
      }
    }
  }
L
Leo Chen 已提交
428 429 430 431 432 433 434

  // NOTE(zhiqiu): UPDATE the corresponding OeratorBase to make it consistent
  // with instruction
  // hot fix, it is not good design here
  op_func_node->operator_base_ =
      std::shared_ptr<OperatorBase>(framework::OpRegistry::CreateOp(
          op_base->Type(), new_ins, op_base->Outputs(), op_base->Attrs()));
435
  op_func_node->no_data_transform_index = std::move(no_data_transform_index);
X
xiongkun 已提交
436 437
}

438
void build_op_func_list(const platform::Place& place,
439
                        const framework::BlockDesc& block,
440 441 442
                        std::vector<OpFuncNode>* vec_func_list,
                        VariableScope* var_scope) {
  auto& all_op_kernels = OperatorWithKernel::AllOpKernels();
L
Leo Chen 已提交
443 444
  std::vector<std::shared_ptr<OperatorBase>>
      ops;  // its elements will be moved to vec_func_list
445
  // Step 1: create all ops for current block.
L
Leo Chen 已提交
446
  create_all_ops(block, &ops);
447
  auto unused_var_map = get_unused_vars(block, ops);
W
wanghuancoder 已提交
448

L
Leo Chen 已提交
449 450
  for (size_t i = 0; i < ops.size(); ++i) {
    auto op = ops[i].get();
451
    VLOG(6) << "Build OpFuncNode from : " << op->Type();
W
wanghuancoder 已提交
452 453 454 455 456

    auto inputs_names = op->Inputs();
    auto outputs_names = op->Outputs();

    VariableValueMap ins_map;
457
    VariableIdMap ins_name2id;
458
    bool enforce_exist = true;
W
wanghuancoder 已提交
459 460 461 462 463 464 465
    if (op->Type() == "recurrent_grad" || op->Type() == "rnn_memory_helper" ||
        op->Type() == "rnn_memory_helper_grad" ||
        op->Type() == "conditional_block" ||
        op->Type() == "conditional_block_grad" || op->Type() == "while" ||
        op->Type() == "while_grad") {
      enforce_exist = false;
    }
466
    std::tie(ins_map, ins_name2id) =
467
        build_variable_map(inputs_names, var_scope, enforce_exist);
W
wanghuancoder 已提交
468 469

    VariableValueMap outs_map;
470 471
    VariableIdMap outs_name2id;
    std::tie(outs_map, outs_name2id) =
472
        build_variable_map(outputs_names, var_scope, enforce_exist);
W
wanghuancoder 已提交
473

474
    // step 2: build OpFuncNode
W
wanghuancoder 已提交
475 476 477
    OpFuncNode op_func_node;
    op_func_node.input_index = ins_name2id;
    op_func_node.output_index = outs_name2id;
478

L
Leo Chen 已提交
479
    if (dynamic_cast<const framework::OperatorWithKernel*>(op) == nullptr) {
480
      // op is not a operatorwithkernel, so direcly run OperatorBase::Run()
L
Leo Chen 已提交
481
      deal_operator_base(place, var_scope, ops[i], &op_func_node);
W
wanghuancoder 已提交
482
    } else {
483 484 485 486
      // construct RuntimeContext and analysis KernelType
      RuntimeContext runtime_context({}, {});
      runtime_context.inputs.swap(ins_map);
      runtime_context.outputs.swap(outs_map);
L
Leo Chen 已提交
487
      InterpretercoreInferShapeContext infer_shape_ctx(*op, runtime_context);
488 489
      // TODO(Aurelius84): In case of control flow ops, they are NOT inheritted
      // from OperatorWithKernel.
L
Leo Chen 已提交
490
      static_cast<const framework::OperatorWithKernel*>(op)->InferShape(
491 492 493 494 495 496 497 498 499 500 501 502 503 504 505
          &infer_shape_ctx);
      auto kernels_iter = all_op_kernels.find(op->Type());
      PADDLE_ENFORCE_NE(
          kernels_iter, all_op_kernels.end(),
          platform::errors::Unavailable(
              "There are no kernels which are registered in the %s operator.",
              op->Type()));

      OpKernelMap& kernels = kernels_iter->second;

      platform::DeviceContextPool& pool =
          platform::DeviceContextPool::Instance();
      auto* dev_ctx = pool.Get(place);
      Scope scope;
      auto expected_kernel_key =
L
Leo Chen 已提交
506
          dynamic_cast<const framework::OperatorWithKernel*>(op)
507
              ->GetExpectedKernelType(
L
Leo Chen 已提交
508
                  ExecutionContext(*op, scope, *dev_ctx, runtime_context));
509 510 511

      // consider device_guard()
      apply_device_guard(
L
Leo Chen 已提交
512
          op, place,
513 514 515 516 517 518 519 520
          &expected_kernel_key);  // change device by the device_guard()
      VLOG(3) << "expected_kernel_key : " << expected_kernel_key;

      // step 3. apply data transforms and insert memory ops
      VariableValueMap& ins_map_temp = runtime_context.inputs;
      std::vector<OpFuncNode> copy_op_to_insert;
      // NOTE(xiongkun03): assign op_base here to reduce parameter number of
      // apply_data_transform.
L
Leo Chen 已提交
521 522 523
      op_func_node.operator_base_ = ops[i];
      apply_data_transform(expected_kernel_key, place, &ins_map_temp, var_scope,
                           &op_func_node, &copy_op_to_insert);
524 525 526 527
      for (auto& item : copy_op_to_insert) {
        vec_func_list->push_back(item);
      }
      // step 4. Run op kernel
L
Leo Chen 已提交
528
      VLOG(3) << op->Type()
529 530 531 532 533 534 535 536 537 538 539 540 541 542
              << " : expected_kernel_key : " << expected_kernel_key;

      if (platform::is_gpu_place(expected_kernel_key.place_)) {
        op_func_node.type_ = OpFuncType::kQueueAsync;
      } else if (platform::is_cpu_place(expected_kernel_key.place_)) {
        op_func_node.type_ = OpFuncType::kQueueSync;
      } else {
        PADDLE_THROW(platform::errors::Fatal("Unsupported current place %s",
                                             expected_kernel_key.place_));
      }
      if (!(expected_kernel_key.place_ == dev_ctx->GetPlace())) {
        dev_ctx = pool.Get(expected_kernel_key.place_);
      }
      op_func_node.dev_ctx_ = dev_ctx;
W
wanghuancoder 已提交
543

L
Leo Chen 已提交
544
      auto exec_ctx = ExecutionContext(*op, scope, *dev_ctx, runtime_context);
W
wanghuancoder 已提交
545

546 547 548 549 550 551
      auto kernel_iter = kernels.find(expected_kernel_key);
      PADDLE_ENFORCE_NE(
          kernel_iter, kernels.end(),
          platform::errors::NotFound(
              "Operator (%s) does not have kernel for %s.", op->Type(),
              KernelTypeToString(expected_kernel_key)));
W
wanghuancoder 已提交
552

553 554 555
      op_func_node.kernel_func_ = OpKernelComputeFunc(kernel_iter->second);
      op_func_node.kernel_func_(exec_ctx);
    }
W
wanghuancoder 已提交
556

L
Leo Chen 已提交
557
    vec_func_list->emplace_back(op_func_node);
W
wanghuancoder 已提交
558
    // gc---------------------------------------------------------------------------
L
Leo Chen 已提交
559
    auto iter = unused_var_map.find(op);
W
wanghuancoder 已提交
560 561 562 563 564 565 566 567 568
    if (iter == unused_var_map.end()) {
      continue;
    }

    auto& delete_vars = iter->second;
    std::deque<std::shared_ptr<memory::Allocation>>* garbages =
        new std::deque<std::shared_ptr<memory::Allocation>>();

    for (auto& var_name : delete_vars) {
569
      auto* var = var_scope->FindVar(var_name);
W
wanghuancoder 已提交
570 571 572 573
      if (var == nullptr) {
        continue;
      }

574
      VLOG(6) << "Erase variable " << var_name;
W
wanghuancoder 已提交
575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595
      if (var->IsType<LoDTensor>()) {
        garbages->emplace_back(
            var->GetMutable<LoDTensor>()->MoveMemoryHolder());
      } else if (var->IsType<SelectedRows>()) {
        garbages->emplace_back(var->GetMutable<SelectedRows>()
                                   ->mutable_value()
                                   ->MoveMemoryHolder());
      } else if (var->IsType<LoDTensorArray>()) {
        auto* lod_tensor_arr = var->GetMutable<LoDTensorArray>();
        for (auto& t : *lod_tensor_arr) {
          garbages->emplace_back(t.MoveMemoryHolder());
        }
      } else {
        PADDLE_THROW(platform::errors::Unimplemented(
            "Type %s of variable %s is not supported eager deletion.",
            framework::ToTypeName(var->Type()), var_name));
      }
    }

    delete garbages;  // free mem

L
Leo Chen 已提交
596
    VLOG(3) << "run " << op->Type() << " done.";
W
wanghuancoder 已提交
597 598 599
  }
}

600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618
void add_fetch(const std::vector<std::string>& fetch_names,
               framework::BlockDesc* block) {
  auto* fetch_holder = block->Var(kFetchVarName);
  fetch_holder->SetType(proto::VarType::FETCH_LIST);
  fetch_holder->SetPersistable(true);

  int i = 0;
  for (auto& fetch_name : fetch_names) {
    // append fetch op
    auto* op = block->AppendOp();
    op->SetType("fetch_v2");
    op->SetInput("X", {fetch_name});
    op->SetOutput("Out", {kFetchVarName});
    op->SetAttr("col", {static_cast<int>(i)});
    op->CheckAttrs();
    i++;
  }
}

W
wanghuancoder 已提交
619 620 621 622 623 624 625 626 627 628 629 630 631 632
std::vector<size_t> merge_vector(const std::vector<size_t>& first,
                                 const std::vector<size_t>& second) {
  std::vector<size_t> out(first.size() + second.size());
  std::merge(first.begin(), first.end(), second.begin(), second.end(),
             out.begin());

  std::vector<size_t>::iterator it;
  it = std::unique(out.begin(), out.end());

  out.resize(std::distance(out.begin(), it));

  return out;
}

X
xiongkun 已提交
633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723
void update_var_min_rw_op(const std::map<int, std::set<int>>& op2dependences,
                          std::map<int, std::list<int>>& var2min_rw_op,
                          int cur_op, int rw_var) {
  // rw_var is inputs or outputs of cur_op
  // this function update the var2min_rw_op set .
  if (var2min_rw_op.find(rw_var) == var2min_rw_op.end())
    var2min_rw_op[rw_var] = std::list<int>();
  for (auto dep_op : op2dependences.at(cur_op)) {
    var2min_rw_op[rw_var].remove(dep_op);
  }
  var2min_rw_op[rw_var].push_back(cur_op);
}

std::map<int, std::list<int>> get_downstream_map(
    const std::map<int, std::set<int>>& op2dependences) {
  // op2dependences is op -> it's dependences. we want to get op -> [ops] map,
  // where ops is the next instruction of op.
  std::map<int, std::list<int>> result;
  for (auto& item : op2dependences) {
    int op = item.first;
    for (auto dep_op : item.second) {
      if (result.find(dep_op) == result.end())
        result[dep_op] = std::list<int>();
      result[dep_op].push_back(op);
    }
  }
  return std::move(result);
}

std::map<int, std::list<int>> build_op_downstream_map(
    const std::vector<Instruction>& vec_instruction) {
  auto var2min_rw_op = std::map<
      int, std::list<int>>();  // # map from variable id to read / write op id.
  auto var2recent_write_op =
      std::map<int, int>();  // # map from variable to recent write op.
  auto op2dependences =
      std::map<int, std::set<int>>();  //# map from op to the dependence list,
                                       // op must run after the dependence.
  std::set<int>
      remove_duplicate;  // remove the duplicate between inputs and outputs

  // reserve
  for (size_t op_idx = 0; op_idx < vec_instruction.size(); ++op_idx) {
    op2dependences[op_idx] = std::set<int>();
  }

  for (size_t op_idx = 0; op_idx < vec_instruction.size(); ++op_idx) {
    remove_duplicate.clear();
    // step1: update the op2dependences structure
    for (auto& item :
         vec_instruction[op_idx].Inputs()) {  // for all inputs(read only)
      for (auto var : item.second) {
        if (var2recent_write_op.count(var))
          op2dependences[op_idx].insert(var2recent_write_op[var]);
      }
    }

    for (auto& item :
         vec_instruction[op_idx].Outputs()) {  // for all write vars
      for (auto var : item.second) {
        if (var2min_rw_op.count(var)) {
          for (auto dep_op : var2min_rw_op[var]) {
            op2dependences[op_idx].insert(dep_op);
          }
        }
      }
    }

    // step2: update 2 var2xxxx data structure
    for (auto& item :
         vec_instruction[op_idx].Inputs()) {  // for all inputs(read only)
      for (auto var : item.second) {
        update_var_min_rw_op(op2dependences, var2min_rw_op, op_idx, var);
        remove_duplicate.insert(var);
      }
    }

    for (auto& item :
         vec_instruction[op_idx].Outputs()) {  // for all write vars
      for (auto var : item.second) {
        var2recent_write_op[var] = op_idx;
        if (remove_duplicate.count(var) ==
            0) {  // var in input list and in output list, so remove it.
          update_var_min_rw_op(op2dependences, var2min_rw_op, op_idx, var);
        }
      }
    }
  }
  return std::move(get_downstream_map(op2dependences));
}

724
}  // namespace interpreter
W
wanghuancoder 已提交
725 726
}  // namespace framework
}  // namespace paddle