/**
 * Copyright (c) 2025 Huawei Technologies Co., Ltd.
 * This program is free software, you can redistribute it and/or modify it under the terms and conditions of 
 * CANN Open Software License Agreement Version 2.0 (the "License").
 * Please refer to the License for details. You may not use this file except in compliance with the License.
 * THIS SOFTWARE IS PROVIDED ON AN "AS IS" BASIS, WITHOUT WARRANTIES OF ANY KIND, EITHER EXPRESS OR IMPLIED, 
 * INCLUDING BUT NOT LIMITED TO NON-INFRINGEMENT, MERCHANTABILITY, OR FITNESS FOR A PARTICULAR PURPOSE.
 * See LICENSE in the root of the software repository for the full text of the License.
 */

#ifndef GE_GRAPH_PASSES_ITERATOR_OP_PASS_H_
#define GE_GRAPH_PASSES_ITERATOR_OP_PASS_H_

#include "graph/graph.h"
#include "graph/passes/graph_pass.h"
#include "runtime/rt.h"

namespace ge {
class IteratorOpPass : public GraphPass {
 public:
  IteratorOpPass() {}

  virtual ~IteratorOpPass() {}

  Status Run(ge::ComputeGraphPtr graph);

 private:
  /// @brief Insert memcpy node
  /// @param preNode
  /// @param graph
  /// @return ge::NodePtr
  ge::NodePtr InsertMemcpyAsyncNode(const ge::NodePtr &pre_node, const ge::ComputeGraphPtr &graph);

  /// @brief Create a Memcpy Async Op object
  /// @param preNode
  /// @return ge::OpDescPtr
  ge::OpDescPtr CreateMemcpyAsyncOp(const ge::NodePtr &pre_node) const;
};
}  // namespace ge
#endif  // GE_GRAPH_PASSES_ITERATOR_OP_PASS_H_