interpretercore_util.cc 19.8 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
#include "paddle/fluid/framework/executor_gc_helper.h"
18
#include "paddle/fluid/framework/new_executor/data_transfer.h"
W
wanghuancoder 已提交
19 20 21

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

25
AtomicVectorSizeT& AsyncWorkQueue::PrepareAtomicDeps(
26
    const std::vector<size_t>& dependecy_count) {
27 28 29 30 31 32
  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); });
  }

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

39
AtomicVectorSizeT& AsyncWorkQueue::PrepareAtomicVarRef(
40
    const std::vector<VariableMetaInfo>& vec_meta_info) {
41 42 43 44 45
  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); });
  }
46 47

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

W
wanghuancoder 已提交
53 54 55 56 57 58 59 60 61 62 63 64 65 66 67
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 已提交
68 69
get_unused_vars(const BlockDesc& block,
                const std::vector<std::shared_ptr<OperatorBase>>& ops) {
W
wanghuancoder 已提交
70 71 72
  std::unordered_map<std::string, size_t> var_op_idx_map;

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

    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 已提交
84
          info.Build(op.get());
W
wanghuancoder 已提交
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 111
        }

        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 已提交
112 113

    result[ops[op_idx].get()].emplace_back(name);
W
wanghuancoder 已提交
114 115 116 117
  }
  return result;
}

118
void build_variable_scope(const framework::BlockDesc& block,
119 120 121 122 123 124 125 126 127
                          VariableScope* var_scope, bool use_local_scope) {
  VLOG(3) << "Creating Variables";
  auto inner_scope = var_scope->GetMutableScope();

  // NOTE(zhiqiu): if create_local_scope_ is true, the persistable is
  // created in var_scope.scope_ , and other scope is created in local scope.
  Scope* local_scope = use_local_scope ? var_scope->GetMutableLocalScope()
                                       : var_scope->GetMutableScope();

128
  for (auto& var_desc : block.AllVars()) {
129 130
    auto var_name = var_desc->Name();
    if (var_name == framework::kEmptyVarName) {
W
wanghuancoder 已提交
131 132
      continue;
    }
133 134
    if (var_desc->Persistable()) {
      auto* ptr = inner_scope->Var(var_name);
W
wanghuancoder 已提交
135

136 137 138 139
      VLOG(3) << "Initialize Variable " << var_name;
      InitializeVariable(ptr, var_desc->GetType());
      VLOG(3) << "Create Variable " << var_name << " global, which pointer is "
              << ptr << " type is " << static_cast<int>(var_desc->GetType());
140
    } else {
141 142 143 144 145
      auto* ptr = local_scope->Var(var_name);
      InitializeVariable(ptr, var_desc->GetType());
      VLOG(3) << "Create Variable " << var_name << " locally, which pointer is "
              << ptr << "Variable Type "
              << static_cast<int>(var_desc->GetType());
W
wanghuancoder 已提交
146
    }
147
    var_scope->SetVarDesc(var_name, var_desc);
W
wanghuancoder 已提交
148 149 150
  }
}

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

    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 已提交
167
    ops->emplace_back(std::shared_ptr<OperatorBase>(op_base));
W
wanghuancoder 已提交
168
  }
169 170 171
}

std::tuple<VariableValueMap, VariableIdMap> build_variable_map(
172 173
    const VariableNameMap& var_name_map, VariableScope* var_scope,
    bool enforce_exist = true) {
174 175 176 177 178 179 180 181
  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) {
182 183 184 185 186
      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;
      }
187 188 189 190 191 192 193 194 195 196
      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 已提交
197

198 199 200 201 202 203 204 205 206 207 208 209
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 &&
210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225
               (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.";
226 227 228 229 230 231 232
    } else {
      PADDLE_THROW(
          platform::errors::Fatal("Unsupported current place %s", op_device));
    }
  }
}

233
void deal_operator_base(const platform::Place& place,
L
Leo Chen 已提交
234 235
                        const VariableScope* var_scope,
                        std::shared_ptr<OperatorBase> op_base,
236
                        OpFuncNode* op_func_node, Scope* local_scope) {
237 238 239 240 241 242
  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;
243
  op_base->Run(*local_scope, place);  // Run without data transformer.
244 245 246 247 248 249 250 251 252 253 254 255

  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;
}

256
void build_op_func_list(const platform::Place& place,
257
                        const framework::BlockDesc& block,
258
                        std::vector<OpFuncNode>* vec_func_list,
259 260 261
                        VariableScope* var_scope, bool use_local_scope) {
  Scope* local_scope = use_local_scope ? var_scope->GetMutableLocalScope()
                                       : var_scope->GetMutableScope();
262
  auto& all_op_kernels = OperatorWithKernel::AllOpKernels();
L
Leo Chen 已提交
263 264
  std::vector<std::shared_ptr<OperatorBase>>
      ops;  // its elements will be moved to vec_func_list
265
  // Step 1: create all ops for current block.
L
Leo Chen 已提交
266
  create_all_ops(block, &ops);
267
  auto unused_var_map = get_unused_vars(block, ops);
W
wanghuancoder 已提交
268

L
Leo Chen 已提交
269 270
  for (size_t i = 0; i < ops.size(); ++i) {
    auto op = ops[i].get();
271
    VLOG(6) << "Build OpFuncNode from : " << op->Type();
W
wanghuancoder 已提交
272 273 274 275 276

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

    VariableValueMap ins_map;
277
    VariableIdMap ins_name2id;
278
    bool enforce_exist = true;
W
wanghuancoder 已提交
279 280 281 282 283 284 285
    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;
    }
286
    std::tie(ins_map, ins_name2id) =
287
        build_variable_map(inputs_names, var_scope, enforce_exist);
W
wanghuancoder 已提交
288 289

    VariableValueMap outs_map;
290 291
    VariableIdMap outs_name2id;
    std::tie(outs_map, outs_name2id) =
292
        build_variable_map(outputs_names, var_scope, enforce_exist);
W
wanghuancoder 已提交
293

294
    // step 2: build OpFuncNode
W
wanghuancoder 已提交
295
    OpFuncNode op_func_node;
296
    op_func_node.operator_base_ = ops[i];
W
wanghuancoder 已提交
297 298
    op_func_node.input_index = ins_name2id;
    op_func_node.output_index = outs_name2id;
299

L
Leo Chen 已提交
300
    if (dynamic_cast<const framework::OperatorWithKernel*>(op) == nullptr) {
301
      // op is not a operatorwithkernel, so direcly run OperatorBase::Run()
302
      deal_operator_base(place, var_scope, ops[i], &op_func_node, local_scope);
W
wanghuancoder 已提交
303
    } else {
304 305 306 307
      // construct RuntimeContext and analysis KernelType
      RuntimeContext runtime_context({}, {});
      runtime_context.inputs.swap(ins_map);
      runtime_context.outputs.swap(outs_map);
L
Leo Chen 已提交
308
      InterpretercoreInferShapeContext infer_shape_ctx(*op, runtime_context);
309 310
      // TODO(Aurelius84): In case of control flow ops, they are NOT inheritted
      // from OperatorWithKernel.
L
Leo Chen 已提交
311
      static_cast<const framework::OperatorWithKernel*>(op)->InferShape(
312 313 314 315 316 317 318 319 320 321 322 323 324 325 326
          &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 已提交
327
          dynamic_cast<const framework::OperatorWithKernel*>(op)
328
              ->GetExpectedKernelType(
L
Leo Chen 已提交
329
                  ExecutionContext(*op, scope, *dev_ctx, runtime_context));
330 331 332

      // consider device_guard()
      apply_device_guard(
L
Leo Chen 已提交
333
          op, place,
334 335 336
          &expected_kernel_key);  // change device by the device_guard()
      VLOG(3) << "expected_kernel_key : " << expected_kernel_key;

337
      // step 3. apply data transforms and insert data transfer ops
338
      VariableValueMap& ins_map_temp = runtime_context.inputs;
339 340 341 342 343
      std::vector<OpFuncNode> new_op_func_nodes;
      ApplyDataTransform(expected_kernel_key, place, &ins_map_temp, var_scope,
                         &op_func_node, &new_op_func_nodes, use_local_scope);
      for (auto& item : new_op_func_nodes) {
        vec_func_list->emplace_back(std::move(item));
344 345
      }
      // step 4. Run op kernel
L
Leo Chen 已提交
346
      VLOG(3) << op->Type()
347 348 349 350 351 352 353 354 355 356 357 358 359 360
              << " : 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 已提交
361

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

364 365 366 367 368 369
      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 已提交
370

371 372 373
      op_func_node.kernel_func_ = OpKernelComputeFunc(kernel_iter->second);
      op_func_node.kernel_func_(exec_ctx);
    }
W
wanghuancoder 已提交
374

L
Leo Chen 已提交
375
    vec_func_list->emplace_back(op_func_node);
W
wanghuancoder 已提交
376
    // gc---------------------------------------------------------------------------
L
Leo Chen 已提交
377
    auto iter = unused_var_map.find(op);
W
wanghuancoder 已提交
378 379 380 381 382 383 384 385 386
    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) {
387
      auto* var = var_scope->FindVar(var_name);
W
wanghuancoder 已提交
388 389 390 391
      if (var == nullptr) {
        continue;
      }

392
      VLOG(6) << "Erase variable " << var_name;
W
wanghuancoder 已提交
393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413
      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 已提交
414
    VLOG(3) << "run " << op->Type() << " done.";
W
wanghuancoder 已提交
415 416 417
  }
}

418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436
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 已提交
437 438 439 440 441 442 443 444 445 446 447 448 449 450
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 已提交
451
void update_var_min_rw_op(const std::map<int, std::set<int>>& op2dependences,
452
                          std::map<int, std::list<int>>* var2min_rw_op,
X
xiongkun 已提交
453 454 455
                          int cur_op, int rw_var) {
  // rw_var is inputs or outputs of cur_op
  // this function update the var2min_rw_op set .
456
  if (var2min_rw_op->find(rw_var) == var2min_rw_op->end()) {
457
    (*var2min_rw_op)[rw_var] = std::list<int>();
458
  }
X
xiongkun 已提交
459
  for (auto dep_op : op2dependences.at(cur_op)) {
460
    var2min_rw_op->at(rw_var).remove(dep_op);
X
xiongkun 已提交
461
  }
462
  var2min_rw_op->at(rw_var).push_back(cur_op);
X
xiongkun 已提交
463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523
}

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) {
524
        update_var_min_rw_op(op2dependences, &var2min_rw_op, op_idx, var);
X
xiongkun 已提交
525 526 527 528 529 530 531 532 533 534
        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.
535
          update_var_min_rw_op(op2dependences, &var2min_rw_op, op_idx, var);
X
xiongkun 已提交
536 537 538 539 540 541 542
        }
      }
    }
  }
  return std::move(get_downstream_map(op2dependences));
}

543
}  // namespace interpreter
W
wanghuancoder 已提交
544 545
}  // namespace framework
}  // namespace paddle