OpenHarmony-v5.1.0-Release/s

/**
 * Copyright 2024 Huawei Technologies Co., Ltd
 *
 * 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 "frontend/parallel/auto_parallel/rec_core/rec_parse_graph.h"

#include <algorithm>
#include <memory>
#include <string>
#include <vector>

#include "ir/value.h"
#include "frontend/parallel/auto_parallel/rec_core/rec_graph.h"
#include "frontend/parallel/auto_parallel/rec_core/rec_tensor.h"
#include "frontend/parallel/ops_info/operator_info.h"

namespace mindspore {
namespace parallel {
const TensorParam MakeTensor(int64_t n, int64_t c, int64_t h, int64_t w) {
  TensorParam new_tensor;
  new_tensor.tensor_type = kFloat32;
  new_tensor.tensor_shape.shape_n = n;
  new_tensor.tensor_shape.shape_c = c;
  new_tensor.tensor_shape.shape_h = h;
  new_tensor.tensor_shape.shape_w = w;
  const TensorParam &tensor = new_tensor;
  return tensor;
}

Graph::NodeType MakeNewOperator(const std::vector<std::shared_ptr<OperatorInfo>> &ops, size_t iter_ops) {
  Graph::NodeType NewOp;
  NewOp.name = ops[iter_ops]->name();
  NewOp.info = InfoType::kApplication;

  auto pos = ops[iter_ops]->name().find("Info");
  auto name = ops[iter_ops]->name().substr(0, pos);
  auto op_type = ops[iter_ops]->type();
  auto idx = DictOpType.find(op_type);
  if (idx != DictOpType.end()) {
    NewOp.apply.op_type = DictOpType.at(op_type);
  } else if (name == STAND_ALONE) {
    MS_LOG(INFO) << ops[iter_ops]->type() << ": standalone operator.";
    NewOp.apply.op_type = OperatorType::kRecStandAlone;
  } else if (name == BATCH_PARALLEL) {
    MS_LOG(INFO) << ops[iter_ops]->type() << ": batch parallel operator.";
    NewOp.apply.op_type = OperatorType::kRecBatchParallel;
  } else {
    NewOp.apply.op_type = OperatorType::kRecUnknownType;
    MS_LOG(INFO) << ops[iter_ops]->name() << ": Unknown operator type " << op_type;
  }

  if (ops[iter_ops]->outputs_shape().size() == SIZE_ZERO) {
    MS_LOG(EXCEPTION) << ops[iter_ops]->name() << " outputs shape is empty.";
  }

  if (ops[iter_ops]->outputs_shape()[0].size() == SIZE_FOUR) {
    NewOp.tensor_parm = MakeTensor(ops[iter_ops]->outputs_shape()[0][0], ops[iter_ops]->outputs_shape()[0][1],
                                   ops[iter_ops]->outputs_shape()[INDEX_ZERO][INDEX_TWO],
                                   ops[iter_ops]->outputs_shape()[INDEX_ZERO][INDEX_THREE]);
  } else if (ops[iter_ops]->outputs_shape()[0].size() == SIZE_THREE) {
    NewOp.tensor_parm = MakeTensor(1, ops[iter_ops]->outputs_shape()[0][0], ops[iter_ops]->outputs_shape()[0][1],
                                   ops[iter_ops]->outputs_shape()[INDEX_ZERO][INDEX_TWO]);
  } else if (ops[iter_ops]->outputs_shape()[0].size() == SIZE_TWO) {
    NewOp.tensor_parm = MakeTensor(1, 1, ops[iter_ops]->outputs_shape()[0][0], ops[iter_ops]->outputs_shape()[0][1]);
  } else if (ops[iter_ops]->outputs_shape()[0].size() == SIZE_ONE) {
    NewOp.tensor_parm = MakeTensor(1, 1, 1, ops[iter_ops]->outputs_shape()[0][0]);
  } else if (ops[iter_ops]->outputs_shape()[0].size() == SIZE_ZERO) {
    NewOp.tensor_parm = MakeTensor(1, 1, 1, 1);
  } else {
    MS_LOG(WARNING) << ops[iter_ops]->name() << ": output tensor shape is unexpected.";
  }

  CompleteOperatorInputs(ops, iter_ops, &NewOp);
  MS_LOG(INFO) << "Node " << NewOp.name << "created successfully"
               << " its input is " << ops[iter_ops]->inputs_shape() << " and its output is "
               << ops[iter_ops]->outputs_shape() << ".";
  return NewOp;
}

void CompleteOperatorInputs(const std::vector<std::shared_ptr<OperatorInfo>> &ops, const size_t iter_ops,
                            Graph::NodeType *NewTensor) {
  size_t input_tensor_size = ops[iter_ops]->inputs_shape().size();
  if (ops[iter_ops]->type() == STACK) {
    input_tensor_size = 1;
  }
  if (input_tensor_size > MAX_INPUT_NUM) {
    MS_LOG(EXCEPTION) << ops[iter_ops]->name() << " input tensor " << input_tensor_size << " num exceeds limit("
                      << MAX_INPUT_NUM << ").";
  }

  for (size_t iter_input_tensors = 0; iter_input_tensors < input_tensor_size; iter_input_tensors++) {
    if (ops[iter_ops]->inputs_shape()[iter_input_tensors].size() == SIZE_FOUR) {
      Complete4DInputs(ops, iter_ops, iter_input_tensors, NewTensor);
    } else if (ops[iter_ops]->inputs_shape()[iter_input_tensors].size() == SIZE_THREE) {
      NewTensor->apply.arguments[iter_input_tensors] =
        MakeTensor(1, ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ZERO],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ONE],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_TWO]);
    } else if (ops[iter_ops]->inputs_shape()[iter_input_tensors].size() == SIZE_TWO) {
      Complete2DInputs(ops, iter_ops, iter_input_tensors, NewTensor);
    } else if (ops[iter_ops]->inputs_shape()[iter_input_tensors].size() == SIZE_ONE) {
      NewTensor->apply.arguments[iter_input_tensors] =
        MakeTensor(1, 1, 1, ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ZERO]);
    } else if (ops[iter_ops]->inputs_shape()[iter_input_tensors].size() == 0) {
      NewTensor->apply.arguments[iter_input_tensors] = MakeTensor(1, 1, 1, 1);
    } else {
      MS_LOG(WARNING) << ops[iter_ops]->name() << ": input tensor shape is unexpected.";
    }
  }
}

void Complete2DInputs(const std::vector<std::shared_ptr<OperatorInfo>> &ops, const size_t iter_ops,
                      const size_t iter_input_tensors, Graph::NodeType *NewTensor) {
  if (NewTensor->apply.op_type == OperatorType::kRecMatMul) {
    auto input_value = ops[iter_ops]->input_value();
    bool transpose_a = input_value[2]->cast<BoolImmPtr>()->value();
    bool transpose_b = input_value[3]->cast<BoolImmPtr>()->value();
    if (transpose_a && (iter_input_tensors == 0)) {
      NewTensor->apply.arguments[iter_input_tensors] =
        MakeTensor(1, 1, ops[iter_ops]->inputs_shape()[iter_input_tensors][1],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][0]);
    } else if (transpose_b && (iter_input_tensors == 1)) {
      NewTensor->apply.arguments[iter_input_tensors] =
        MakeTensor(1, 1, ops[iter_ops]->inputs_shape()[iter_input_tensors][1],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][0]);
    } else {
      NewTensor->apply.arguments[iter_input_tensors] =
        MakeTensor(1, 1, ops[iter_ops]->inputs_shape()[iter_input_tensors][0],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][1]);
    }
  } else {
    NewTensor->apply.arguments[iter_input_tensors] = MakeTensor(
      1, 1, ops[iter_ops]->inputs_shape()[iter_input_tensors][0], ops[iter_ops]->inputs_shape()[iter_input_tensors][1]);
  }
}

void Complete4DInputs(const std::vector<std::shared_ptr<OperatorInfo>> &ops, const size_t iter_ops,
                      const size_t iter_input_tensors, Graph::NodeType *NewTensor) {
  if (NewTensor->apply.op_type == OperatorType::kRecBatchMatMul) {
    auto input_value = ops[iter_ops]->input_value();
    bool transpose_a = input_value[2]->cast<BoolImmPtr>()->value();
    bool transpose_b = input_value[3]->cast<BoolImmPtr>()->value();
    if (transpose_a && (iter_input_tensors == 0)) {
      NewTensor->apply.arguments[iter_input_tensors] =
        MakeTensor(ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ZERO],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ONE],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_THREE],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_TWO]);
    } else if (transpose_b && (iter_input_tensors == 1)) {
      NewTensor->apply.arguments[iter_input_tensors] =
        MakeTensor(ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ZERO],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ONE],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_THREE],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_TWO]);
    } else {
      NewTensor->apply.arguments[iter_input_tensors] =
        MakeTensor(ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ZERO],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ONE],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_TWO],
                   ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_THREE]);
    }
  } else {
    NewTensor->apply.arguments[iter_input_tensors] =
      MakeTensor(ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ZERO],
                 ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_ONE],
                 ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_TWO],
                 ops[iter_ops]->inputs_shape()[iter_input_tensors][INDEX_THREE]);
  }
}

std::shared_ptr<Graph> ParseGraph(const std::vector<std::shared_ptr<OperatorInfo>> &ops,
                                  const std::vector<std::vector<std::string>> &input_tensor_names) {
  std::shared_ptr<Graph> graph = std::make_shared<Graph>();
  constexpr size_t MAX_OP_NUM = SIZE_MAX / 2;
  if (ops.size() > MAX_OP_NUM) {
    MS_LOG(EXCEPTION) << "Total number of operators is bigger than " << MAX_OP_NUM;
  }

  for (size_t iter_ops = 0; iter_ops < ops.size(); iter_ops++) {
    Graph::NodeType NewOp = MakeNewOperator(ops, iter_ops);
    NewOp.param_name = ops[iter_ops]->get_involved_param_name();
    graph->nodes.push_back(NewOp);
  }
  MakeEdge(input_tensor_names, graph);

  return graph;
}

void MakeEdge(const std::vector<std::vector<std::string>> &input_tensor_names, const std::shared_ptr<Graph> &graph) {
  for (size_t iter_i = 0; iter_i < input_tensor_names.size(); iter_i++) {
    for (size_t iter_j = 1; iter_j < input_tensor_names[iter_i].size(); iter_j++) {
      size_t head_node_index = GetIndexInInputTensorNames(input_tensor_names, input_tensor_names[iter_i][iter_j]);
      if (head_node_index < SIZE_MAX / 2 && head_node_index != iter_i) {
        graph->nodes[iter_i].node_in.push_back(head_node_index);
        graph->nodes[head_node_index].node_out.push_back(iter_i);
      }
    }
  }
}

size_t GetIndexInInputTensorNames(const std::vector<std::vector<std::string>> &input_tensor_name,
                                  const std::string &input_name) {
  for (size_t index = 0; index < input_tensor_name.size(); index++) {
    if (input_tensor_name[index][0] == input_name) {
      return index;
    }
  }
  MS_LOG(INFO) << "Get index failed, using SIZE_MAX instead";
  return SIZE_MAX;
}

void Eliminate_Aux(size_t node_index, const std::shared_ptr<Graph> &graph,
                   const std::shared_ptr<std::vector<std::vector<size_t>>> &eli_list) {
  MS_EXCEPTION_IF_NULL(graph);
  MS_EXCEPTION_IF_NULL(eli_list);
  std::vector<size_t> eli;
  eli.push_back(node_index);
  for (size_t i = 0; i < graph->nodes[node_index].node_out.size(); i++) {
    auto outgoing_node_idx = graph->nodes[node_index].node_out[i];
    eli.push_back(outgoing_node_idx);
    if (!graph->nodes[node_index].param_name.empty() &&
        graph->nodes[node_index].apply.op_type == OperatorType::kRecCast &&
        (graph->nodes[outgoing_node_idx].apply.op_type == OperatorType::kRecMatMul ||
         graph->nodes[outgoing_node_idx].apply.op_type == OperatorType::kRecBatchMatMul)) {
      graph->nodes[outgoing_node_idx].param_name = graph->nodes[node_index].param_name;
    }
  }
  eli_list->push_back(eli);

  // Iterate over all input operators of the current node
  for (size_t i = 0; i < graph->nodes[node_index].node_in.size(); i++) {
    auto *incoming_outputs = &graph->nodes[graph->nodes[node_index].node_in[i]].node_out;
    auto it = find(incoming_outputs->begin(), incoming_outputs->end(), node_index);
    if (it != incoming_outputs->end()) {
      it = incoming_outputs->erase(it);
      for (auto outgoing_index : graph->nodes[node_index].node_out) {
        it = find(incoming_outputs->begin(), incoming_outputs->end(), outgoing_index);
        if (it == incoming_outputs->end()) {
          incoming_outputs->push_back(outgoing_index);
        }
      }
    }
  }

  // Iterate over all aux_input operators of the current node
  for (size_t i = 0; i < graph->nodes[node_index].node_in_aux.size(); i++) {
    auto *aux_incoming_outputs = &graph->nodes[graph->nodes[node_index].node_in_aux[i]].node_out;
    auto it = find(aux_incoming_outputs->begin(), aux_incoming_outputs->end(), node_index);
    if (it != aux_incoming_outputs->end()) {
      it = aux_incoming_outputs->erase(it);
      for (auto outgoing_index : graph->nodes[node_index].node_out) {
        it = find(aux_incoming_outputs->begin(), aux_incoming_outputs->end(), outgoing_index);
        if (it == aux_incoming_outputs->end()) {
          aux_incoming_outputs->push_back(outgoing_index);
        }
      }
    }
  }

  // Iterate over all output operators of the current node
  Eliminate_Aux_Outgoing(node_index, graph);
}

void EliminateAuxOutgoingInput(size_t node_index, const std::shared_ptr<Graph> &graph, size_t i) {
  MS_EXCEPTION_IF_NULL(graph);
  auto *outgoing_inputs = &graph->nodes[graph->nodes[node_index].node_out[i]].node_in;
  MS_EXCEPTION_IF_NULL(outgoing_inputs);
  // Check if the current node is the input operator of the current node's output operator
  auto it = find(outgoing_inputs->begin(), outgoing_inputs->end(), node_index);
  if (it != outgoing_inputs->end()) {
    if (graph->nodes[node_index].node_in.size() > 0) {
      // If the current node has input operator, then add input[0] of the current node to the input of the current
      // node's output operator (if input[0] is also in the aux_input of the current node's output operator, then remove
      // it from the aux_input and keep it only in the input)
      auto exist_in_outgoing_auxinputs =
        find(graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.begin(),
             graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.end(), graph->nodes[node_index].node_in[0]);
      if (exist_in_outgoing_auxinputs != graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.end()) {
        size_t index_remove_node = LongToSize(std::distance(
          graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.begin(), exist_in_outgoing_auxinputs));
        if (graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux_idx.size() > index_remove_node) {
          (void)graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux_idx.erase(
            graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux_idx.begin() + index_remove_node);
        } else {
          MS_LOG(DEBUG) << "Trying to erase vector element at index " << index_remove_node << ", out of range!";
        }
        if (graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.size() > index_remove_node) {
          (void)graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.erase(exist_in_outgoing_auxinputs);
        } else {
          MS_LOG(DEBUG) << "Trying to erase vector element at index " << index_remove_node
                        << ", which is out of range!";
        }
      }
      size_t idx = LongToSize(std::distance(outgoing_inputs->begin(), it));
      if (outgoing_inputs->size() > idx) {
        outgoing_inputs->at(idx) = graph->nodes[node_index].node_in[0];
      } else {
        MS_LOG(DEBUG) << "Trying to index vector element at index " << idx << ", out of range!";
      }
      // Then add the other input operators of the current node to the aux_input of the current node's output operator
      for (size_t j = 1; j < graph->nodes[node_index].node_in.size(); j++) {
        exist_in_outgoing_auxinputs = find(graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.begin(),
                                           graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.end(),
                                           graph->nodes[node_index].node_in[j]);
        if (exist_in_outgoing_auxinputs == graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.end()) {
          size_t index_aux = LongToSize(std::distance(outgoing_inputs->begin(), it));
          graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux_idx.push_back(index_aux);
          graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.push_back(graph->nodes[node_index].node_in[j]);
        }
      }
      // Then add all the operators in the aux_input of the current node to the aux_input of the output operator of the
      // current node
      for (size_t j = 0; j < graph->nodes[node_index].node_in_aux.size(); j++) {
        exist_in_outgoing_auxinputs = find(graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.begin(),
                                           graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.end(),
                                           graph->nodes[node_index].node_in_aux[j]);
        if (exist_in_outgoing_auxinputs == graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.end()) {
          size_t index_aux = LongToSize(std::distance(outgoing_inputs->begin(), it));
          graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux_idx.push_back(index_aux);
          graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux.push_back(
            graph->nodes[node_index].node_in_aux[j]);
        }
      }
    } else {
      auto idx = LongToSize(std::distance(outgoing_inputs->begin(), it));
      if (outgoing_inputs->size() > idx) {
        (void)outgoing_inputs->erase(it);
      } else {
        MS_LOG(DEBUG) << "Trying to erase vector element at index " << idx << ", out of range!";
      }
    }
  }
}

void EliminateAuxOutgoingAuxInput(size_t node_index, const std::shared_ptr<Graph> &graph, size_t i) {
  MS_EXCEPTION_IF_NULL(graph);
  auto *outgoing_auxinputs = &graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux;
  MS_EXCEPTION_IF_NULL(outgoing_auxinputs);
  auto *outgoing_auxinputs_index = &graph->nodes[graph->nodes[node_index].node_out[i]].node_in_aux_idx;
  // Check if the current node is the aux_input operator of the current node's output operator
  auto it = find(outgoing_auxinputs->begin(), outgoing_auxinputs->end(), node_index);
  size_t index_entree = LongToSize(std::distance(outgoing_auxinputs->begin(), it));
  if (it != outgoing_auxinputs->end()) {
    if (graph->nodes[node_index].node_in.size() > 0) {
      // If the current node has input operator, and if the input[0] of the current node is in
      // the input of the output operator of the current node, then delete it
      // from the aux_input of the output of the current node, otherwise add the input[0]
      // to the auxinput of the output of the current node
      auto exist_in_outgoing_inputs =
        find(graph->nodes[graph->nodes[node_index].node_out[i]].node_in.begin(),
             graph->nodes[graph->nodes[node_index].node_out[i]].node_in.end(), graph->nodes[node_index].node_in[0]);
      if (exist_in_outgoing_inputs != graph->nodes[graph->nodes[node_index].node_out[i]].node_in.end()) {
        index_entree = LongToSize(std::distance(outgoing_auxinputs->begin(), it));
        if (outgoing_auxinputs_index->size() > index_entree) {
          (void)outgoing_auxinputs_index->erase(outgoing_auxinputs_index->begin() + index_entree);
        } else {
          MS_LOG(DEBUG) << "Trying to erase vector element at index " << index_entree << ", out of range!";
        }
        if (outgoing_auxinputs->size() > index_entree) {
          (void)outgoing_auxinputs->erase(it);
        } else {
          MS_LOG(DEBUG) << "Trying to erase vector element at index " << index_entree << ", out of range!";
        }
      } else {
        size_t idx = LongToSize(std::distance(outgoing_auxinputs->begin(), it));
        if (outgoing_auxinputs->size() > idx) {
          outgoing_auxinputs->at(idx) = graph->nodes[node_index].node_in[0];
        } else {
          MS_LOG(DEBUG) << "Trying to index vector element at index " << idx << ", out of range!";
        }
        index_entree = LongToSize(std::distance(
          outgoing_auxinputs->begin(),
          find(outgoing_auxinputs->begin(), outgoing_auxinputs->end(), graph->nodes[node_index].node_in[0])));
      }
      // Determine whether the other input operator of the current node is in the input of the output operator,
      // and if not, add it to the aux_input of the output operator
      for (size_t j = 1; j < graph->nodes[node_index].node_in.size(); j++) {
        exist_in_outgoing_inputs =
          find(graph->nodes[graph->nodes[node_index].node_out[i]].node_in.begin(),
               graph->nodes[graph->nodes[node_index].node_out[i]].node_in.end(), graph->nodes[node_index].node_in[j]);
        if (exist_in_outgoing_inputs == graph->nodes[graph->nodes[node_index].node_out[i]].node_in.end()) {
          outgoing_auxinputs->push_back(graph->nodes[node_index].node_in[j]);
          if (outgoing_auxinputs_index->size() > index_entree) {
            outgoing_auxinputs_index->push_back(outgoing_auxinputs_index->at(index_entree));
          } else {
            MS_LOG(DEBUG) << "Trying to index vector element at index " << index_entree << ", out of range!";
          }
        }
      }
      // Determine if the aux_input operator of the current node is in the input of the output operator,
      // and if not, add it to the aux_input of the output operator
      for (size_t j = 0; j < graph->nodes[node_index].node_in_aux.size(); j++) {
        exist_in_outgoing_inputs = find(graph->nodes[graph->nodes[node_index].node_out[i]].node_in.begin(),
                                        graph->nodes[graph->nodes[node_index].node_out[i]].node_in.end(),
                                        graph->nodes[node_index].node_in_aux[j]);
        if (exist_in_outgoing_inputs == graph->nodes[graph->nodes[node_index].node_out[i]].node_in.end()) {
          outgoing_auxinputs->push_back(graph->nodes[node_index].node_in_aux[j]);
          outgoing_auxinputs_index->push_back(outgoing_auxinputs_index->at(index_entree));
        }
      }
    } else {
      if (outgoing_auxinputs_index->size() > index_entree) {
        (void)outgoing_auxinputs_index->erase(outgoing_auxinputs_index->begin() + index_entree);
      } else {
        MS_LOG(DEBUG) << "Trying to erase vector element at index " << index_entree << ", out of range!";
      }
      if (outgoing_auxinputs->size() > index_entree) {
        (void)outgoing_auxinputs->erase(it);
      } else {
        MS_LOG(DEBUG) << "Trying to erase vector element at index " << index_entree << ", which is out of range.";
      }
    }
  }
}

void Eliminate_Aux_Outgoing(size_t node_index, const std::shared_ptr<Graph> &graph) {
  for (size_t i = 0; i < graph->nodes[node_index].node_out.size(); i++) {
    // Handle the output operator connected to the current node via main edge
    EliminateAuxOutgoingInput(node_index, graph, i);
    // Handle the output operator connected to the current node via auxiliary edge
    EliminateAuxOutgoingAuxInput(node_index, graph, i);
  }
}

static void EraseEliminatedNode(std::vector<size_t> *nodes, const std::shared_ptr<std::vector<size_t>> &index_list) {
  for (size_t j = nodes->size(); j > 0; j--) {
    bool IsEliminated = (index_list->at(nodes->at(j - 1)) == SIZE_MAX);
    if (IsEliminated) {
      (void)nodes->erase(nodes->begin() + SizeToLong(j) - 1);
    } else {
      nodes->at(j - 1) = index_list->at(nodes->at(j - 1));
    }
  }
}

std::shared_ptr<Graph> EliminateGraph(const std::shared_ptr<Graph> &graph,
                                      const std::shared_ptr<std::vector<std::vector<size_t>>> &eli_list,
                                      const std::shared_ptr<std::vector<size_t>> &index_list,
                                      const bool dyn_shape_tmp_fix) {
  MS_EXCEPTION_IF_NULL(graph);
  for (size_t node_index = 0; node_index < graph->nodes.size(); node_index++) {
    auto type = graph->nodes[node_index].apply.op_type;
    if (dyn_shape_tmp_fix && type == OperatorType::kRecBatchMatMul) {
      continue;
    } else if (EliminateOpType.find(type) != EliminateOpType.end()) {
      Eliminate_Aux(node_index, graph, eli_list);
    }
  }
  index_list->reserve(graph->nodes.size());
  for (size_t i = 0; i < graph->nodes.size(); i++) {
    index_list->push_back(i);
  }
  for (size_t i = 0; i < eli_list->size(); i++) {
    if (eli_list->at(i)[0] >= index_list->size()) {
      MS_LOG(EXCEPTION) << "Failure: Operators' elements out of range.";
    }
    index_list->at(eli_list->at(i)[0]) = SIZE_MAX;
    for (size_t j = eli_list->at(i)[0] + 1; j < index_list->size(); j++) {
      index_list->at(j)--;
    }
  }
  std::shared_ptr<Graph> new_graph = std::make_shared<Graph>();
  for (size_t i = 0; i < graph->nodes.size(); i++) {
    if (index_list->at(i) > SIZE_MAX / 2) {
      continue;
    }
    new_graph->nodes.push_back(graph->nodes[i]);
    auto *node_in = &new_graph->nodes[index_list->at(i)].node_in;
    EraseEliminatedNode(node_in, index_list);
    auto *node_in_aux = &new_graph->nodes[index_list->at(i)].node_in_aux;
    EraseEliminatedNode(node_in_aux, index_list);
    auto *node_out = &new_graph->nodes[index_list->at(i)].node_out;
    EraseEliminatedNode(node_out, index_list);
  }
  return new_graph;
}
}  // namespace parallel
}  // namespace mindspore