/*******************************************************************************
* Copyright 2021 Intel Corporation
*
* 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 <algorithm>
#include <deque>
#include <iterator>
#include <unordered_map>
#include <unordered_set>

#include "common/verbose.hpp"
#include "graph/interface/op_schema.hpp"
#include "graph/utils/pm/nested_matcher.hpp"

#define DEBUGINFO_PM 5

/*
User need to build library with ONEDNN_DEV_MODE=ON to enable
debuginfo for pattern matcher, and set verbose level as 5 to 
debuginfo:
export ONEDNN_VERBOSE=debuginfo=5,filter=graph
This mode is for developers especially who is familiar with pattern
matcher and want to debug pattern matcher.
*/
#if defined(DNNL_DEV_MODE)
#define DEBUg(debug_level, ...) \
    do { \
        if (get_verbose(verbose_t::debuginfo, component_t::graph) \
                >= debug_level) { \
            verbose_printf("graph,debuginfo,pattern_matcher," __VA_ARGS__); \
        } \
    } while (0)
#else
#define DEBUg(debug_level, ...)
#endif

#define DEBUG(debug_level, ...) DEBUg(debug_level, __VA_ARGS__)

/*
This mode is for users or developers who want to know the 
matching status of each pattern, it can be enabled by simply
using:
export ONEDNN_VERBOSE=dispatch,filter=graph
*/
#define VPATTERN_MATCHER(...) \
    do { \
        if (get_verbose(verbose_t::create_dispatch, component_t::graph)) { \
            verbose_printf( \
                    "graph,create:dispatch,pattern_matcher," __VA_ARGS__); \
        } \
    } while (0)

namespace dnnl {
namespace impl {
namespace graph {
namespace utils {
namespace pm {

namespace {
// check if an op has commutative inputs
bool is_commutative_op(op_t *op) {
    const op_schema_t *opm
            = op_schema_registry_t::get_op_schema(op->get_kind());
    return opm->is_commutative_op();
}

// check if an op's specific inputs are commutative
bool is_commutative_inputs(op_t *op, const size_t input0, const size_t input1) {
    const op_schema_t *opm
            = op_schema_registry_t::get_op_schema(op->get_kind());
    return opm->is_commutative_inputs(input0, input1);
}

// fill local context in map when optional exists
void fill_optional_in_map(match_context_t *local_ctx, pb_node_t *cur_node,
        op_t *cur_op, size_t cur_op_port = 0) {
    fill_local_in_map(local_ctx, cur_node, cur_op, cur_op_port);

    std::vector<std::pair<iport_t, producer_t>> node_inputs
            = cur_node->get_inputs();
    if (node_inputs.empty()) return;

    pb_node_t *next_node = node_inputs[0].second.first;
    fill_optional_in_map(local_ctx, next_node, cur_op);
}

// fill local context out map when optional exists
void fill_optional_out_map(match_context_t *local_ctx, pb_node_t *cur_node,
        op_t *cur_op, size_t cur_op_port = 0) {
    fill_local_out_map(local_ctx, cur_node, cur_op, cur_op_port);

    std::vector<std::pair<oport_t, consumers_t>> node_outputs
            = cur_node->get_outputs();
    if (node_outputs.empty()) return;

    pb_node_t *next_node = node_outputs[0].second[0]->first;
    fill_optional_out_map(local_ctx, next_node, cur_op);
}
} // namespace

binding_t::binding_t(node_bind_kind p_kind, op_t *p_op, size_t p_op_port,
        pb_node_t *p_node, size_t p_port)
    : bind_op {p_op}
    , bind_node {p_node}
    , bind_kind {p_kind}
    , bind_port {p_port}
    , bind_op_port {p_op_port} {}

match_context_t::match_context_t(match_context_t *p_ctx, pb_node_t *p_graph)
    : parent_ctx(p_ctx), graph_(dynamic_cast<pb_graph_t *>(p_graph)) {}

bool match_node_attributes(op_t *op, pb_node_t *node) {
    size_t n_func = node->get_num_decision_functions();
    for (size_t i = 0; i < n_func; i++) {
        if (!(node->get_decision_function(i)(op))) { return false; }
    }
    return true;
}

node_inputs_matcher_t::node_inputs_matcher_t(const binding_t &b,
        match_context_t *ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map)
    : op_ {b.bind_op}
    , node_ {b.bind_node}
    , bind_ {b}
    , ctx_ {ctx}
    , updated_op_map_ {matched_op_map} {

    node_inputs_ = node_->get_inputs();
}

// check if a pb_node is optional and its producers are all optional
bool node_inputs_matcher_t::support_optional_inputs(pb_node_t *n) {
    if (n->get_node_kind() != pb_node_kind::PB_NODE_KIND_REPETITION)
        return false;
    repetition_t *rep_node = dynamic_cast<repetition_t *>(n);
    if (rep_node->get_min_rep() != 0) return false;

    std::vector<std::pair<iport_t, producer_t>> node_inputs = n->get_inputs();
    if (node_inputs.empty()) return true;
    /* for optional input, only 1 producer is supported
        opt_input?
            |
            n?
    */
    if (node_inputs.size() != 1) return false;
    return support_optional_inputs(node_inputs[0].second.first);
}

bool node_inputs_matcher_t::check_recursion_termination() {
    // if we have touched the upper boundary of the pattern
    // graph, it's time to terminate the recursion:
    return node_inputs_.empty();
}

bool node_inputs_matcher_t::match_input_by_offset(
        const size_t &op_input_offset, const size_t &node_input_offset) {
    pb_node_t *in_node = node_inputs_[node_input_offset].second.first;
    std::shared_ptr<value_t> op_in_value = nullptr;
    if (op_->num_inputs() > op_input_offset) {
        op_in_value = op_->get_input_value(op_input_offset);
    }
    if (!op_in_value || !op_in_value->has_producer()) {
        // pattern node has producer while graph op
        // doesn't have. In this case, only optional
        // can survive
        bool support_optional = support_optional_inputs(in_node);
        if (support_optional) {
            fill_optional_in_map(ctx_, in_node, op_, op_input_offset);
        }
        return support_optional;
    } else {
        op_t *in_op = op_->get_input_op(op_input_offset);
        size_t in_op_oport = op_in_value->get_offset();
        oport_t in_node_oport = node_inputs_[node_input_offset].second.second;
        binding_t in_bind(BIND_OUT, in_op, in_op_oport, in_node, in_node_oport);
        // handle the potential zero trip match case, fill context's i/o
        // map with hint op
        in_bind.hint_op = op_;
        in_bind.hint_op_port = op_input_offset;
        return match_graph_helper(in_bind, ctx_, updated_op_map_);
    }

    return true;
}

bool node_inputs_matcher_t::match_commutative_inputs() {
    // commutative ops need to consider switching inputs
    std::unordered_set<size_t> verified_node_input_ports;
    std::unordered_set<size_t> verified_op_input_ports;
    if (bind_.bind_kind == BIND_IN) {
        verified_node_input_ports.insert(bind_.bind_port);
        verified_op_input_ports.insert(bind_.bind_op_port);
    }

    for (size_t node_input_offset = 0; node_input_offset < node_inputs_.size();
            ++node_input_offset) {
        if (verified_node_input_ports.find(
                    node_inputs_[node_input_offset].first)
                != verified_node_input_ports.end())
            continue;
        for (size_t op_input_offset = 0; op_input_offset < op_->num_inputs();
                ++op_input_offset) {
            if (verified_op_input_ports.find(op_input_offset)
                            == verified_op_input_ports.end()
                    && (node_input_offset == op_input_offset
                            || is_commutative_inputs(get_op(),
                                    node_input_offset, op_input_offset))
                    && match_input_by_offset(
                            op_input_offset, node_input_offset)) {
                verified_op_input_ports.insert(op_input_offset);
                break;
            }
            // none of the op's inputs can match to the node's current input
            if (op_input_offset == op_->num_inputs() - 1) return false;
        }
    }
    return true;
}

bool node_inputs_matcher_t::match_non_commutative_inputs() {
    for (size_t i = 0; i < node_inputs_.size(); ++i) {
        iport_t node_iport = node_inputs_[i].first;
        if (!match_input_by_offset(node_iport, i)) return false;
    }

    // check node_inputs that doesn't have a producer:
    // if the node is a consumer of graph's input_ports, then we
    // need to check if the input port's consumers are aligned with
    // each other
    if (ctx_->in_port_map.empty()) return true;
    auto inner_cons = ctx_->get_graph()->get_inner_consumers();
    if (inner_cons.empty()) return true;

    for (const auto &pair : inner_cons) {
        const auto &graph_in_port = pair.first;
        auto it = ctx_->in_port_map.find(graph_in_port);
        if (it == ctx_->in_port_map.end()) continue;

        const auto &graph_in_port_consumers = pair.second;
        for (const auto &con : graph_in_port_consumers) {
            if (con->first == node_) {
                // check if the input port has been filled, if filled, the existing
                // input should be the same as the current op
                if (op_->num_inputs() <= con->second) return false;
                if (it->second.first->get_input_value(it->second.second)
                        != op_->get_input_value(con->second)) {
                    return false;
                }
            }
        }
    }

    return true;
}

bool node_inputs_matcher_t::match_variadic_inputs() {
    assertm(op_->num_inputs() < VARIADIC_INPUT_NUM,
            "variadic input num should be larger than actual op's num of "
            "inputs");
    for (size_t i = 0; i < node_inputs_.size(); ++i) {
        iport_t node_iport = node_inputs_[i].first;
        if (op_->num_inputs() < node_iport + 1) break;
        if (!match_input_by_offset(node_iport, i)) return false;
    }

    return true;
}

bool match_node_inputs(const binding_t &b, match_context_t *ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    node_inputs_matcher_t node_inputs_matcher(b, ctx, matched_op_map);

    if (node_inputs_matcher.check_recursion_termination()) return true;

    bool matching_status = true;
    if (node_inputs_matcher.get_node()->get_inputs().size()
            == VARIADIC_INPUT_NUM) {
        matching_status = node_inputs_matcher.match_variadic_inputs();
    } else if (!is_commutative_op(node_inputs_matcher.get_op())) {
        matching_status = node_inputs_matcher.match_non_commutative_inputs();
    } else {
        matching_status = node_inputs_matcher.match_commutative_inputs();
    }
    if (!matching_status) return false;

    matched_op_map = node_inputs_matcher.get_updated_op_map();
    return true;
}

node_outputs_matcher_t::node_outputs_matcher_t(op_t *op, pb_node_t *node,
        match_context_t *ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map)
    : op_(op)
    , node_(node)
    , ctx_(ctx)
    , updated_op_map_(matched_op_map)
    , node_outputs_(node_->get_outputs())
    , support_optional_(support_optional_outputs(node_))
    , is_optional_case_(false) {}

// check if a pb_node's all consumers are optional
bool node_outputs_matcher_t::support_optional_outputs(pb_node_t *n) {
    std::vector<std::pair<oport_t, consumers_t>> node_outputs
            = n->get_outputs();
    if (node_outputs.empty()) return true;
    /* for optional output, only 1 consumer is supported
            n
            |
        opt_output?
    */
    if (node_outputs.size() != 1) return false;
    if (node_outputs[0].second.size() != 1) return false;
    pb_node_t *node_output = node_outputs[0].second[0]->first;
    if (node_output->get_node_kind() != pb_node_kind::PB_NODE_KIND_REPETITION)
        return false;
    repetition_t *rep_node = dynamic_cast<repetition_t *>(node_output);
    if (rep_node->get_min_rep() != 0) return false;

    return support_optional_outputs(node_output);
}

bool node_outputs_matcher_t::check_recursion_termination() {
    // if we have touched the lower boundary of the pattern
    // graph, it's time to terminate the recursion:
    return node_outputs_.empty();
}

bool node_outputs_matcher_t::check_node_consumers(
        std::unordered_set<size_t> &node_oport_matched_cons) {
    if (node_oport_matched_cons.size() != current_node_output_.second.size()) {
        if (support_optional_) {
            is_optional_case_ = true;
            fill_optional_out_map(ctx_, node_, op_);
            return true;
        }
        return false;
    }
    return true;
}

bool node_outputs_matcher_t::check_internal_inputs(op_t *out_op) {
    // if it's an edge between internal ops, then it's fine
    if (updated_op_map_.count(out_op)) {
        auto p_out_op = updated_op_map_[out_op];
        if (p_out_op->is_allowing_internal_inputs()) return true;
    }
    return false;
}

bool node_outputs_matcher_t::check_external_outputs() {
    // if it's the allow_external_output case, then it's fine
    auto p_op = updated_op_map_[op_];
    if (p_op->is_allowing_external_outputs()) return true;
    return false;
}

bool node_outputs_matcher_t::check_optional() {
    // if it's the optional case, also fine
    if (support_optional_) {
        is_optional_case_ = true;
        fill_optional_out_map(ctx_, node_, op_);
    }
    return support_optional_;
}

bool node_outputs_matcher_t::op_consumer_unmatching_checking(op_t *out_op) {
    bool internal_input_case = check_internal_inputs(out_op);
    bool external_output_case = check_external_outputs();
    if (internal_input_case || external_output_case) return true;

    return check_optional();
}

bool node_outputs_matcher_t::match_op_consumers() {
    std::shared_ptr<value_t> op_out_value
            = op_->get_output_value(current_node_oport_);

    std::vector<value_t::consumer_t> sorted_consumers;
    sorted_consumers = sort_op_consumers(op_out_value);
    std::unordered_set<size_t> node_oport_matched_cons;

    for (size_t j = 0; j < sorted_consumers.size(); j++) {
        auto op_consumer = sorted_consumers[j];
        op_t *out_op = &(op_consumer.get_op());
        bool consumer_matched = false;

        for (size_t k = 0; k < current_node_output_.second.size(); k++) {
            auto node_consumer = current_node_output_.second[k];
            pb_node_t *out_node = node_consumer->first;
            // check if the out_node has been matched by previous out_ops
            if (node_oport_matched_cons.count(k)) {
                if (out_node->get_node_kind() == pb_node_kind::PB_NODE_KIND_OP)
                    continue;
                if (out_node->get_node_kind()
                        == pb_node_kind::PB_NODE_KIND_ALTERNATION)
                    continue;
                // For repetition case, check if multi consumers have been matched
                if (updated_op_map_.find(out_op) == updated_op_map_.end()) {
                    repetition_t *rep_node
                            = dynamic_cast<repetition_t *>(out_node);
                    if (rep_node->get_body()->get_inner_consumer(0) == nullptr)
                        continue;
                    if (rep_node->get_body()->get_inner_consumer(0)->size()
                            == 1)
                        continue;
                } else {
                    consumer_matched = true;
                    break;
                }
            }

            binding_t out_bind(BIND_IN, out_op, op_consumer.get_offset(),
                    out_node, node_consumer->second);

            // handle the potential zero trip match case, fill context's i/o
            // map with hint op
            out_bind.hint_op = op_;
            out_bind.hint_op_port = current_node_oport_;
            if (!match_graph_helper(out_bind, ctx_, updated_op_map_)) {
                continue;
            } else {
                consumer_matched = true;
                node_oport_matched_cons.insert(k);
                break;
            }
        }
        if (!consumer_matched) {
            bool matching_status = op_consumer_unmatching_checking(out_op);
            if (is_optional_case_) {
                return true;
            } else {
                if (!matching_status) return false;
                continue;
            }
        }
    }

    // check if not all consumers of node output are matched
    bool matching_status = check_node_consumers(node_oport_matched_cons);
    return matching_status;
}

bool node_outputs_matcher_t::match_output() {
    // match output for node and op
    for (auto &node_output : node_outputs_) {
        current_node_output_ = node_output;
        current_node_oport_ = current_node_output_.first;

        // match the op consumers one by one
        bool matching_status = match_op_consumers();
        if (!matching_status) return false;
        if (is_optional_case_) return true;
    }
    return true;
}

bool match_node_outputs(op_t *op, pb_node_t *node, match_context_t *ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    node_outputs_matcher_t node_outputs_matcher(op, node, ctx, matched_op_map);

    if (node_outputs_matcher.check_recursion_termination()) return true;

    if (node_outputs_matcher.get_op()->num_outputs()
            < node_outputs_matcher.get_node()->get_outputs().size())
        return false;

    // match output
    bool matching_status = node_outputs_matcher.match_output();
    if (!matching_status) return false;
    if (node_outputs_matcher.get_optional_case_status() == true) {
        return true;
    }

    matched_op_map = node_outputs_matcher.get_updated_op_map();

    return true;
}

bool check_cyclic(
        op_t *op, const std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    // internal_ops: ops that are in the matched graph
    std::unordered_set<op_t *> internal_ops;
    for (const auto &kv : matched_op_map)
        internal_ops.insert(kv.first);

    for (size_t op_input_offset = 0; op_input_offset < op->num_inputs();
            ++op_input_offset) {
        std::shared_ptr<value_t> op_in_value
                = op->get_input_value(op_input_offset);
        if (op_in_value->has_producer()) {
            op_t *in_op = op->get_input_op(op_input_offset);
            if (internal_ops.find(in_op) == internal_ops.end()) {
                // in_op is an external_op.
                // recursively traverse the producers of in_op
                // check if any producer is among internal_ops
                // if yes, a cycle exists.
                status_t ret = topo_order_visit({in_op}, [&](op_t *temp_op) {
                    if (internal_ops.find(temp_op) != internal_ops.end())
                        return status::invalid_graph;
                    return status::success;
                });
                // there's a cycle
                if (ret != status::success) return true;
            }
        }
    }

    // no cycle
    return false;
}

bool match_node(const binding_t &b, match_context_t *ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    if (b.bind_op == nullptr) {
        DEBUG(DEBUGINFO_PM, "bind_op is a nullptr [%s:%i] \n", __FILE__,
                __LINE__);
        VPATTERN_MATCHER(
                "op,node matching failed: bind_op is a nullptr,%s:%i \n",
                __FILE__, __LINE__);
        return false;
    }
    if (b.bind_node == nullptr) {
        DEBUG(DEBUGINFO_PM,
                "matching op & node: %s (%s) <=> (node), matching failed \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str());
        DEBUG(DEBUGINFO_PM, "bind_node is a nullptr [%s:%i] \n", __FILE__,
                __LINE__);
        VPATTERN_MATCHER(
                "op:%s (%s),node matching failed:bind_node is a "
                "nullptr,%s:%i \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), __FILE__, __LINE__);
        return false;
    }
    if (b.bind_op->get_partition() != nullptr) {
        DEBUG(DEBUGINFO_PM,
                "matching op & node: %s (%s) <=> %s, matching "
                "failed \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str());
        DEBUG(DEBUGINFO_PM,
                "bind_op already belongs to certain partition "
                "[%s:%i] \n",
                __FILE__, __LINE__);
        VPATTERN_MATCHER(
                "op:%s (%s),node:%s,node matching failed:bind_op already "
                "belongs to certain partition,%s:%i \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str(),
                __FILE__, __LINE__);
        return false;
    }
    if (b.bind_op->has_attr(op_attr::matched)) {
        DEBUG(DEBUGINFO_PM,
                "matching op & node: %s (%s) <=> %s, matching "
                "failed \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str());
        DEBUG(DEBUGINFO_PM, "bind_op is already matched [%s:%i] \n", __FILE__,
                __LINE__);
        VPATTERN_MATCHER(
                "op:%s (%s),node:%s,node matching failed:bind_op is already "
                "matched,%s:%i \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str(),
                __FILE__, __LINE__);
        return false;
    }
    if (b.bind_op_port != b.bind_port
            && !is_commutative_inputs(b.bind_op, b.bind_op_port, b.bind_port)) {
        DEBUG(DEBUGINFO_PM,
                "matching op & node: %s (%s) <=> %s, matching "
                "failed \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str());
        DEBUG(DEBUGINFO_PM, "op inputs are not commutative [%s:%i] \n",
                __FILE__, __LINE__);
        VPATTERN_MATCHER(
                "op:%s (%s),node:%s,node matching failed:op inputs are not "
                "commutative,%s:%i \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str(),
                __FILE__, __LINE__);
        return false;
    }

    if (!match_node_attributes(b.bind_op, b.bind_node)) {
        DEBUG(DEBUGINFO_PM,
                "matching op & node: %s (%s) <=> %s, matching "
                "failed \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str());
        DEBUG(DEBUGINFO_PM,
                "attributes of bind_op & bind_node do not match, please "
                "check if all decision functions of op are satisfied or not"
                "[%s:%i] \n",
                __FILE__, __LINE__);
        VPATTERN_MATCHER(
                "op:%s (%s),node:%s,node matching failed:attributes of bind_op "
                "& bind_node do not match,%s:%i \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str(),
                __FILE__, __LINE__);
        return false;
    }

    if (!match_node_inputs(b, ctx, matched_op_map)) return false;

    if (check_cyclic(b.bind_op, matched_op_map)) {
        DEBUG(DEBUGINFO_PM,
                "matching op & node: %s (%s) <=> %s, matching "
                "failed \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str());
        DEBUG(DEBUGINFO_PM, "cyclic check failed [%s:%i] \n", __FILE__,
                __LINE__);
        VPATTERN_MATCHER(
                "op:%s (%s),node:%s,node matching failed:cyclic check "
                "failed,%s:%i \n",
                dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind())
                        .c_str(),
                b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str(),
                __FILE__, __LINE__);
        return false;
    }
    DEBUG(DEBUGINFO_PM,
            "matching op & node: %s (%s) <=> %s, matching "
            "success \n",
            dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind()).c_str(),
            b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str());
    VPATTERN_MATCHER("op:%s (%s),node:%s,node matching success \n",
            dnnl::impl::graph::op_t::kind2str(b.bind_op->get_kind()).c_str(),
            b.bind_op->get_name().c_str(), b.bind_node->get_name().c_str());

    if (!match_node_outputs(b.bind_op, b.bind_node, ctx, matched_op_map))
        return false;

    return true;
}

bool resolve_node(const binding_t &bind_arg, match_context_t *ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    bool success = false;
    switch (bind_arg.bind_node->get_node_kind()) {
        case pb_node_kind::PB_NODE_KIND_ALTERNATION:
            success = match_alternation(bind_arg, ctx, matched_op_map);
            break;
        case pb_node_kind::PB_NODE_KIND_REPETITION:
            success = match_repetition(bind_arg, ctx, matched_op_map);
            break;
        default: break;
    }
    return success;
}

std::vector<value_t::consumer_t> sort_op_consumers(
        std::shared_ptr<value_t> &op_out_value) {
    auto &cons = op_out_value->get_consumers();
    if (cons.empty()) return cons;
    std::vector<value_t::consumer_t> sorted_consumers = cons;
    std::sort(sorted_consumers.begin(), sorted_consumers.end(),
            [&](value_t::consumer_t con_1, value_t::consumer_t con_2) {
        return con_1.get_op().get_attr<int64_t>(op_attr::op_depth)
                > con_2.get_op().get_attr<int64_t>(op_attr::op_depth);
    });

    return sorted_consumers;
}

bool match_pattern(op_t *first_op, const std::shared_ptr<pb_graph_t> &pattern,
        std::vector<op_t *> &fusion_ops) {
    match_context_t global_ctx {nullptr, nullptr};
    match_context_t init_ctx {&global_ctx, pattern.get()};
    binding_t init_bind {BIND_NONE, first_op, 0, pattern.get(), 0};
    std::unordered_map<op_t *, pb_op_t *> matched_op_map;
    if (first_op->has_attr(op_attr::matched)
            && first_op->get_attr<bool>(op_attr::matched))
        return false;
    DEBUG(DEBUGINFO_PM, "start matching");
    if (!match_graph(init_bind, &init_ctx, matched_op_map)) {
        DEBUG(DEBUGINFO_PM, "matching failed \n");
        return false;
    }
    if (!verify_global_in_map(&init_ctx)) { return false; }

    fusion_ops = reorder_matched_list(matched_op_map);
    DEBUG(DEBUGINFO_PM, "finish matching, matched ops: ");
    for (size_t i = 0; i < fusion_ops.size(); i++) {
        if (i < fusion_ops.size() - 1) {
            DEBUG(DEBUGINFO_PM, "%s ", fusion_ops[i]->get_name().c_str());
        } else {
            DEBUG(DEBUGINFO_PM, "%s ", fusion_ops[i]->get_name().c_str());
        }
    }

    return true;
}

bool verify_global_in_map(match_context_t *ctx) {
    pb_graph_t *graph = ctx->get_graph();
    if (!graph) return true;

    auto inner_cons = graph->get_inner_consumers();
    if (inner_cons.empty()) return true;

    for (size_t i = 0; i < inner_cons.size(); ++i) {
        if (inner_cons[i].second.size() != ctx->in_port_map.count(i)) {
            DEBUG(DEBUGINFO_PM,
                    "expected graph input %zu consumers size: %zu, actual "
                    "consumers size: %zu",
                    i, inner_cons[i].second.size(), ctx->in_port_map.count(i));
            VPATTERN_MATCHER(
                    "matching failed: number of inputs check failed,%s:%i \n",
                    __FILE__, __LINE__);
            return false;
        }
    }
    return true;
}

inline std::vector<op_t *> reorder_matched_list(
        const std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    // split ops and pb_op_ts
    std::vector<op_t *> fusion_ops;
    std::vector<pb_op_t *> pb_op_ts;
    for (auto kv : matched_op_map) {
        fusion_ops.push_back(kv.first);
        pb_op_ts.push_back(kv.second);
    }

    // a deque of op indexes in fusion_ops
    std::deque<op_t *> dq;
    // find an end_op to start reorder, find an op whose output isn't in
    // fusion_ops
    for (auto &aop : fusion_ops) {
        bool is_end = true;
        for (auto &output : aop->get_output_values()) {
            for (auto &consumer : output->get_consumers()) {
                if (std::find(fusion_ops.begin(), fusion_ops.end(),
                            &(consumer.get_op()))
                        != fusion_ops.end()) {
                    is_end = false;
                    break;
                }
            }
            if (!is_end) { break; }
        }
        if (is_end) {
            dq.push_back(aop);
            break;
        }
    }
    std::unordered_set<op_t *> visited;
    std::vector<op_t *> reordered_fusion_ops;
    // sort the fusion_ops to topo order
    while (!dq.empty()) {
        op_t *op = dq.front();
        if (visited.find(op) != visited.end()) {
            dq.pop_front();
            continue;
        }
        bool ready = true;
        auto &inputs = op->get_input_values();
        for (auto it = inputs.rbegin(); it != inputs.rend(); ++it) {
            if ((*it)->has_producer()) {
                op_t &producer = (*it)->get_producer();
                // if current op's producers have not been visited
                // current op is not ready, need to visit its
                // producers first
                if (visited.find(&producer) == visited.end()
                        && std::find(fusion_ops.begin(), fusion_ops.end(),
                                   &producer)
                                != fusion_ops.end()) {
                    dq.push_front(&producer);
                    ready = false;
                }
            }
        }
        auto &outputs = op->get_output_values();
        for (auto it = outputs.begin(); it != outputs.end(); ++it) {
            const auto &cons = (*it)->get_consumers();
            for (auto &con : cons) {
                op_t &con_op = con.get_op();
                if (std::find(dq.begin(), dq.end(), &con_op) == dq.end()
                        && std::find(fusion_ops.begin(), fusion_ops.end(),
                                   &con_op)
                                != fusion_ops.end()) {
                    dq.push_back(&con_op);
                }
            }
        }
        // all producers of current op have been visited,
        // then current op is ready
        if (ready) {
            // need to check if the corresponding pb_op_t is
            // wildcard before adding it to reordered_fusion_ops
            auto iter = std::find(fusion_ops.begin(), fusion_ops.end(), op);
            size_t index = iter - fusion_ops.begin();
            pb_op_t *corresponding_pb_op_t = pb_op_ts[index];
            // create a temp_op to match, only wildcard can match wildcard
            op_t temp_op {op_kind::Wildcard};
            if (fusion_ops.size() == 1 // single op partition
                    || !match_node_attributes(
                            &temp_op, corresponding_pb_op_t)) {
                // pb_op_t is not a wildcard
                op->set_attr<bool>(op_attr::matched, true);
                reordered_fusion_ops.emplace_back(op);
            }
            visited.insert(op);
        }
    }
    return reordered_fusion_ops;
}

void fill_parent_io_map(
        match_context_t *local_ctx, const binding_t &local_bind) {
    auto parent_ctx = local_ctx->get_parent_context();

    for (const auto &in_port_con : local_ctx->in_port_map) {
        fill_local_in_map(parent_ctx, local_bind.bind_node,
                in_port_con.second.first, in_port_con.second.second);
    }

    for (const auto &out_port_pro : local_ctx->out_port_map) {
        fill_local_out_map(parent_ctx, local_bind.bind_node,
                out_port_pro.second.first, out_port_pro.second.second);
    }
}

void fill_local_in_map(match_context_t *local_ctx, pb_node_t *cur_node,
        op_t *cur_op, size_t cur_op_port) {
    pb_graph_t *graph = local_ctx->get_graph();
    if (!graph) return;

    // TODO(Zitian): restrict to 1 port 1 consumer in pattern def
    auto inner_cons = graph->get_inner_consumers();
    if (inner_cons.empty()) return;

    for (size_t i = 0; i < inner_cons.size(); ++i) {
        for (size_t j = 0; j < inner_cons[i].second.size(); ++j) {
            size_t iport = inner_cons[i].first;
            const std::shared_ptr<consumer_t> &con = inner_cons[i].second[j];
            if (con->first == cur_node) {
                // check if the input port has been filled, if filled, the existing
                // input should be the same as the current op
                auto it = local_ctx->in_port_map.find(iport);
                if (it != local_ctx->in_port_map.end()) {
                    if (it->second.first->get_input_value(it->second.second)
                            != cur_op->get_input_value(con->second)) {
                        return;
                    }
                }
                local_ctx->in_port_map.insert({iport, {cur_op, con->second}});
            }
        }
    }
}

void fill_local_out_map(match_context_t *local_ctx, pb_node_t *cur_node,
        op_t *cur_op, size_t cur_op_port) {
    pb_graph_t *graph = local_ctx->get_graph();
    if (!graph) return;

    auto inner_pros = graph->get_inner_producers();
    if (inner_pros.empty()) return;

    assertm(inner_pros.size() == 1, "only support 1 port 1 consumer");
    size_t oport = inner_pros[0].first;
    const producer_t &pro = inner_pros[0].second;
    if (pro.first == cur_node)
        local_ctx->out_port_map[oport] = {cur_op, cur_op_port};
}

bool match_graph_helper(const binding_t &local_bind, match_context_t *ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    if (local_bind.bind_node->get_node_kind()
            != pb_node_kind::PB_NODE_KIND_OP) {
        // if current op has been visited
        if (matched_op_map.count(local_bind.bind_op)) {
            auto contained_ops = local_bind.bind_node->get_contained_ops();
            if (contained_ops.find(matched_op_map[local_bind.bind_op])
                    != contained_ops.end())
                return true;
        }
        if (!resolve_node(local_bind, ctx, matched_op_map)) return false;
    } else {
        pb_op_t *bind_pb_op = dynamic_cast<pb_op_t *>(local_bind.bind_node);
        // if current op has been visited
        if (matched_op_map.count(local_bind.bind_op)) {
            return matched_op_map[local_bind.bind_op] == bind_pb_op;
        }
        // if current op hasn't been visited, match it.
        matched_op_map[local_bind.bind_op] = bind_pb_op;
        // temporarily save in/out port maps
        // to restore in case of match failure
        graph_in_port_map saved_in_map = ctx->in_port_map;
        graph_out_port_map saved_out_map = ctx->out_port_map;
        fill_local_in_map(ctx, local_bind.bind_node, local_bind.bind_op,
                local_bind.bind_op_port);
        fill_local_out_map(ctx, local_bind.bind_node, local_bind.bind_op,
                local_bind.bind_op_port);

        if (!match_node(local_bind, ctx, matched_op_map)) {
            matched_op_map.erase(local_bind.bind_op);
            ctx->in_port_map = std::move(saved_in_map);
            ctx->out_port_map = std::move(saved_out_map);
            return false;
        }
    }
    return true;
}

bool match_graph(const binding_t &bind_arg, match_context_t *ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    binding_t local_bind = bind_arg;
    // Get initial internal node to bind
    switch (bind_arg.bind_kind) {
        case BIND_NONE: {
            local_bind.bind_node = ctx->get_graph()->get_nodes().front();
            DEBUG(DEBUGINFO_PM,
                    "matching begins from op & node: %s (%s) <=> %s",
                    dnnl::impl::graph::op_t::kind2str(
                            local_bind.bind_op->get_kind())
                            .c_str(),
                    local_bind.bind_op->get_name().c_str(),
                    local_bind.bind_node->get_name().c_str());
        } break;
        case BIND_IN: {
            auto consumers
                    = ctx->get_graph()->get_inner_consumer(bind_arg.bind_port);
            if (consumers == nullptr) return true;
            // TODO(Yixin) Currently support more than 1 consumer for in_ports
            // But will only traverse from the first consumer
            local_bind.bind_node = (*consumers)[0]->first;
            local_bind.bind_port = (*consumers)[0]->second;
        } break;
        case BIND_OUT: {
            std::shared_ptr<producer_t> prod
                    = ctx->get_graph()->get_inner_producer(bind_arg.bind_port);
            local_bind.bind_node = prod->first;
            local_bind.bind_port = prod->second;
        } break;
        default: {
            return false;
        } break;
    }

    return match_graph_helper(local_bind, ctx, matched_op_map);
}

bool match_alternation(const binding_t &bind_arg, match_context_t *ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    alternation_t *alt_nodes
            = dynamic_cast<alternation_t *>(bind_arg.bind_node);
    // Every node-matching will go through the graph
    // from top-down and bottom-up to keep consistency
    // In case of printing repetively,
    // we add condition here and elsewhere to limit the print order
    if (bind_arg.bind_kind == BIND_IN) {
        DEBUG(DEBUGINFO_PM, "now doing alt matching");
    }
    // Coverity: Dynamic cast to pointer can return NULL.
    if (!alt_nodes) return false;

    for (pb_graph_t *alt_node : alt_nodes->get_alternatives()) {
        std::unordered_map<op_t *, pb_op_t *> temp_op_map = matched_op_map;
        binding_t temp_bind = bind_arg;
        temp_bind.bind_node = alt_node;
        match_context_t local_ctx {ctx, temp_bind.bind_node};
        if (bind_arg.bind_kind == BIND_IN) {
            DEBUG(DEBUGINFO_PM,
                    "matching op & alternation subgraph: %s (%s) <=> "
                    "%s",
                    dnnl::impl::graph::op_t::kind2str(
                            bind_arg.bind_op->get_kind())
                            .c_str(),
                    bind_arg.bind_op->get_name().c_str(),
                    alt_node->get_name().c_str());
        }

        if (match_graph(temp_bind, &local_ctx, temp_op_map)) {
            matched_op_map = temp_op_map;
            fill_parent_io_map(&local_ctx, bind_arg);
            if (bind_arg.bind_kind == BIND_IN) {
                DEBUG(DEBUGINFO_PM, "alternation matching done");
            }
            if (bind_arg.bind_kind != BIND_OUT) {
                // alternation is restricted to have only 1 out port
                if (local_ctx.out_port_map.size() != 1) return false;
                op_t *current_op = local_ctx.out_port_map[0].first;
                return match_node_outputs(
                        current_op, bind_arg.bind_node, ctx, matched_op_map);
            } else {
                // alternation is restricted to have only 1 in port
                if (local_ctx.in_port_map.size() != 1) return false;
                const auto &iter = local_ctx.in_port_map.find(0);
                if (iter == local_ctx.in_port_map.end()) return false;

                op_t *current_op = iter->second.first;
                size_t current_port = iter->second.second;
                binding_t current_bind(BIND_OUT, current_op, current_port,
                        bind_arg.bind_node, bind_arg.bind_port);
                return match_node_inputs(current_bind, ctx, matched_op_map);
            }
        }
    }
    return false;
}

repetition_matcher_t::repetition_matcher_t(const binding_t &bind_arg,
        match_context_t *parent_ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map)
    : single_iter_bind_(bind_arg)
    , parent_ctx_(parent_ctx)
    , updated_op_map_(matched_op_map)
    , rep_node_(dynamic_cast<repetition_t *>(bind_arg.bind_node))
    , pmap_(rep_node_->get_port_map())
    , min_rep_(rep_node_->get_min_rep())
    , max_rep_(rep_node_->get_max_rep() - 1)
    , forward_match_(single_iter_bind_.bind_kind != BIND_OUT)
    , rep_global_ctx_(
              match_context_t(parent_ctx, single_iter_bind_.bind_node)) {
    // binding_t for first iteration.
    // all iterations have same body_graph, bind_kind and bind_port
    // but they have different bind_op.
    // First iteration has the same bind_op as the repetition node.
    single_iter_bind_.bind_node = rep_node_->get_body();

    // a merge context to tag on incremental iterations.
    rep_global_ctx_ = match_context_t(parent_ctx_, single_iter_bind_.bind_node);
}

bool repetition_matcher_t::prepare_next_matching_round(
        const match_context_t &local_cached_ctx) {
    // Forward matching
    if (forward_match_) {
        single_iter_bind_.bind_kind = BIND_IN;
        oport_t oport = pmap_.first;
        op_t *current_op = local_cached_ctx.out_port_map.at(oport).first;
        if (oport >= current_op->num_outputs()) {
            DEBUG(DEBUGINFO_PM,
                    "oport: %zu exceeds the number of outputs of "
                    "current_op: %zu [%s:%i] \n",
                    oport, current_op->num_outputs(), __FILE__, __LINE__);
            VPATTERN_MATCHER(
                    "op:%s (%s),node:%s,repetition node matching failed:oport: "
                    "%zu exceeds the number of outputs of current_op: "
                    "%zu,%s:%i \n",
                    dnnl::impl::graph::op_t::kind2str(
                            single_iter_bind_.bind_op->get_kind())
                            .c_str(),
                    single_iter_bind_.bind_op->get_name().c_str(),
                    single_iter_bind_.bind_node->get_name().c_str(), oport,
                    current_op->num_outputs(), __FILE__, __LINE__);

            return true;
        }
        std::shared_ptr<value_t> op_out_value
                = current_op->get_output_value(oport);
        std::vector<value_t::consumer_t> sorted_consumers;
        sorted_consumers = sort_op_consumers(op_out_value);
        if (sorted_consumers.empty()) {
            DEBUG(DEBUGINFO_PM,
                    "no consumer for next matching round [%s:%i] \n", __FILE__,
                    __LINE__);
            VPATTERN_MATCHER(
                    "op:%s (%s),node:%s,repetition node matching failed:no "
                    "consumer for next matching round,%s:%i \n",
                    dnnl::impl::graph::op_t::kind2str(
                            single_iter_bind_.bind_op->get_kind())
                            .c_str(),
                    single_iter_bind_.bind_op->get_name().c_str(),
                    single_iter_bind_.bind_node->get_name().c_str(), __FILE__,
                    __LINE__);
            return true;
        }
        if (sorted_consumers.size() == 1) {
            op_t *next_op = &(sorted_consumers[0].get_op());
            single_iter_bind_.bind_op = next_op;
            single_iter_bind_.bind_op_port = sorted_consumers[0].get_offset();
        } else {
            // More than 1 consumers. In this case, needs to check
            // if the last node of previous match accepts external
            // output. If no, break
            pb_op_t *current_pb_op = updated_op_map_[current_op];
            if (!current_pb_op->is_allowing_external_outputs()) {
                DEBUG(DEBUGINFO_PM,
                        "pb_op does not allow external op [%s:%i] \n", __FILE__,
                        __LINE__);
                VPATTERN_MATCHER(
                        "op:%s (%s),node:%s,repetition node matching "
                        "failed:pb_op does not allow external op,%s:%i \n",
                        dnnl::impl::graph::op_t::kind2str(
                                single_iter_bind_.bind_op->get_kind())
                                .c_str(),
                        single_iter_bind_.bind_op->get_name().c_str(),
                        single_iter_bind_.bind_node->get_name().c_str(),
                        __FILE__, __LINE__);
                return true;
            }
            // If yes, decide which one of the consumers will be used
            // for next round's match
            iport_t iport = pmap_.second;
            // start op for last round's match
            const auto &it_iport = local_cached_ctx.in_port_map.find(iport);
            if (it_iport == local_cached_ctx.in_port_map.end()) return false;

            op_t *start_op = it_iport->second.first;
            pb_op_t *start_pb_op = updated_op_map_[start_op];
            op_t *next_op = nullptr;
            size_t next_op_iport = 0;
            for (auto &con : sorted_consumers) {
                if (match_node_attributes(&con.get_op(), start_pb_op)) {
                    next_op = &(con.get_op());
                    next_op_iport = con.get_offset();
                    break;
                }
            }
            if (!next_op) {
                DEBUG(DEBUGINFO_PM,
                        "no next_op for next matching round "
                        "[%s:%i] \n",
                        __FILE__, __LINE__);
                VPATTERN_MATCHER(
                        "op:%s (%s),node:%s,repetition node matching failed:no "
                        "next_op for next matching round,%s:%i \n",
                        dnnl::impl::graph::op_t::kind2str(
                                single_iter_bind_.bind_op->get_kind())
                                .c_str(),
                        single_iter_bind_.bind_op->get_name().c_str(),
                        single_iter_bind_.bind_node->get_name().c_str(),
                        __FILE__, __LINE__);
                return true;
            }
            single_iter_bind_.bind_op = next_op;
            single_iter_bind_.bind_op_port = next_op_iport;
        }
    } else { // backward matching
        single_iter_bind_.bind_kind = BIND_OUT;
        iport_t iport = pmap_.second;
        const auto &it_iport = local_cached_ctx.in_port_map.find(iport);
        if (it_iport == local_cached_ctx.in_port_map.end()) return false;

        op_t *current_op = it_iport->second.first;
        if (iport >= current_op->num_inputs()) return true;
        auto in_value = current_op->get_input_value(iport);
        single_iter_bind_.bind_op = &(in_value->get_producer());
        single_iter_bind_.bind_op_port = in_value->get_offset();
    }

    return false;
}

bool repetition_matcher_t::match_current_op(const binding_t &bind_arg) {
    if (forward_match_) {
        // nothing needs to be matched, success
        if (bind_arg.bind_node->get_outputs().empty()) {
            if (bind_arg.hint_op) {
                fill_optional_out_map(parent_ctx_, bind_arg.bind_node,
                        bind_arg.hint_op, bind_arg.hint_op_port);
            }
            return true;
        }
        assertm(bind_arg.bind_node->get_outputs().size() == 1,
                "repetition is restricted to have only 1 output");
        assertm(bind_arg.bind_node->get_consumers(0)->size() == 1,
                "repetition is restricted to have only 1 output with "
                "only 1 consumer");
        auto cons = bind_arg.bind_node->get_consumers(pmap_.first);
        if (cons) {
            binding_t con_bind = bind_arg;
            con_bind.bind_node = (*cons)[0]->first;
            con_bind.bind_port = (*cons)[0]->second;
            if (!match_graph_helper(con_bind, parent_ctx_, updated_op_map_))
                return false;
        }
    } else {
        if (bind_arg.bind_node->get_inputs().empty()) {
            if (bind_arg.hint_op) {
                fill_optional_in_map(parent_ctx_, bind_arg.bind_node,
                        bind_arg.hint_op, bind_arg.hint_op_port);
            }
            return true;
        }
        auto prod = bind_arg.bind_node->get_producer(pmap_.second);
        if (prod) {
            binding_t prod_bind = bind_arg;
            prod_bind.bind_node = prod->first;
            prod_bind.bind_port = prod->second;
            if (!match_graph_helper(prod_bind, parent_ctx_, updated_op_map_))
                return false;
        }
    }
    return true;
}

bool repetition_matcher_t::match_next_op(const binding_t &bind_arg) {
    fill_parent_io_map(&rep_global_ctx_, bind_arg);
    if (forward_match_) {
        assertm(bind_arg.bind_node->get_outputs().size() <= 1,
                "repetition is restricted to have only 1 output");

        if (bind_arg.bind_node->get_outputs().size() == 1) {
            assertm(bind_arg.bind_node->get_consumers(0)->size() == 1,
                    "repetition is restricted to have only 1 output with "
                    "only 1 consumer");
            op_t *current_op = rep_global_ctx_.out_port_map[pmap_.first].first;
            if (!match_node_outputs(
                        current_op, rep_node_, parent_ctx_, updated_op_map_))
                return false;
        }

    } else {
        assertm(bind_arg.bind_node->get_inputs().size() <= 1,
                "repetition is restricted to have only 1 input");
        if (bind_arg.bind_node->get_inputs().size() == 1) {
            const auto &iter = rep_global_ctx_.in_port_map.find(pmap_.second);
            if (iter == rep_global_ctx_.in_port_map.end()) return false;

            op_t *current_op = iter->second.first;
            size_t current_port = iter->second.second;
            binding_t current_bind(BIND_OUT, current_op, current_port,
                    rep_node_, bind_arg.bind_port);
            if (!match_node_inputs(current_bind, parent_ctx_, updated_op_map_))
                return false;
        }
    }
    return true;
}

bool repetition_matcher_t::post_repetition_matching(
        size_t num_rep, const binding_t &bind_arg) {
    if (num_rep < min_rep_) return false;
    bool matching_status = true;
    if (num_rep == 0 && min_rep_ == 0) {
        // Zero trip match
        // need to forward binding to neighboring nodes
        matching_status = match_current_op(bind_arg);
    } else { // num_rep > 0
        matching_status = match_next_op(bind_arg);
    }
    if (!matching_status) return false;

    return true;
}

bool repetition_matcher_t::verify_current_matching_round(
        const match_context_t &local_cached_ctx,
        const std::unordered_map<op_t *, pb_op_t *> &local_op_map) const {
    if (forward_match_) return true;

    // for backward match
    oport_t oport = pmap_.first;
    op_t *cur_op = local_cached_ctx.out_port_map.at(oport).first;
    size_t cur_op_port = local_cached_ctx.out_port_map.at(oport).second;
    const auto &cons = cur_op->get_output_value(cur_op_port)->get_consumers();
    if (cons.size() <= 1) return true;

    // if current op has more than 1 consumers, while the repetition unit
    // only has 1 consumer, only allow_external_outputs can survive.
    pb_op_t *cur_pb_op = local_op_map.at(cur_op);
    if (cur_pb_op->is_allowing_external_outputs()) return true;
    return false;
}

size_t repetition_matcher_t::match_repetition_blocks() {
    // num of repetition blocks matched
    size_t num_rep = 0;
    while (true) {
        match_context_t local_cached_ctx {rep_global_ctx_};
        local_cached_ctx.in_port_map.clear();
        local_cached_ctx.out_port_map.clear();
        std::unordered_map<op_t *, pb_op_t *> local_op_map = updated_op_map_;
        if (forward_match_) {
            // Same reason as adding condition of
            // checking bind_kind == BIND_IN
            DEBUG(DEBUGINFO_PM,
                    "matching op & repetition subgraph: %s (%s) <=> "
                    "%s \n",
                    dnnl::impl::graph::op_t::kind2str(
                            single_iter_bind_.bind_op->get_kind())
                            .c_str(),
                    single_iter_bind_.bind_op->get_name().c_str(),
                    single_iter_bind_.bind_node->get_name().c_str());
        }
        if (!match_graph(single_iter_bind_, &local_cached_ctx, local_op_map))
            break;
        if (!verify_current_matching_round(local_cached_ctx, local_op_map))
            break;
        ++num_rep;
        updated_op_map_ = local_op_map;

        // connect previous repetition's out_port_map to
        // current repetition's in_port_map
        if (forward_match_) {
            if (num_rep == 1) {
                rep_global_ctx_.in_port_map.insert(
                        local_cached_ctx.in_port_map.begin(),
                        local_cached_ctx.in_port_map.end());
            }
            rep_global_ctx_.out_port_map.clear();
            rep_global_ctx_.out_port_map.insert(
                    local_cached_ctx.out_port_map.begin(),
                    local_cached_ctx.out_port_map.end());

        } else {
            if (num_rep == 1) {
                rep_global_ctx_.out_port_map.insert(
                        local_cached_ctx.out_port_map.begin(),
                        local_cached_ctx.out_port_map.end());
            }
            rep_global_ctx_.in_port_map.clear();
            rep_global_ctx_.in_port_map.insert(
                    local_cached_ctx.in_port_map.begin(),
                    local_cached_ctx.in_port_map.end());
        }

        if (num_rep == max_rep_) {
            DEBUG(DEBUGINFO_PM, "reach the max repetition number \n");
            VPATTERN_MATCHER(
                    "op:%s (%s),node:%s,repetition node matching failed:reach "
                    "the max repetition number,%s:%i \n",
                    dnnl::impl::graph::op_t::kind2str(
                            single_iter_bind_.bind_op->get_kind())
                            .c_str(),
                    single_iter_bind_.bind_op->get_name().c_str(),
                    single_iter_bind_.bind_node->get_name().c_str(), __FILE__,
                    __LINE__);
            break;
        }

        // prepare for the next round of matching
        DEBUG(DEBUGINFO_PM, "prepare next round of rep block match \n");
        bool prepare_fail = prepare_next_matching_round(local_cached_ctx);

        if (prepare_fail) {
            DEBUG(DEBUGINFO_PM, "preparation failed \n");
            break;
        }
    }
    return num_rep;
}

bool match_repetition(const binding_t &bind_arg, match_context_t *parent_ctx,
        std::unordered_map<op_t *, pb_op_t *> &matched_op_map) {
    repetition_matcher_t repetition_matcher(
            bind_arg, parent_ctx, matched_op_map);

    DEBUG(DEBUGINFO_PM, "now doing rep matching \n");

    size_t num_rep = repetition_matcher.match_repetition_blocks();
    DEBUG(DEBUGINFO_PM, "matched repetition block in total: %zu \n", num_rep);

    bool matching_status
            = repetition_matcher.post_repetition_matching(num_rep, bind_arg);

    if (!matching_status) return false;

    matched_op_map = repetition_matcher.get_updated_op_map();
    return true;
}

} // namespace pm
} // namespace utils
} // namespace graph
} // namespace impl
} // namespace dnnl
