/*******************************************************************************
* Copyright 2020-2022 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 "reduction.hpp"

namespace reduction {

alg_t str2alg(const char *str) {
#define CASE(_alg) \
    if (!strcasecmp(STRINGIFY(_alg), str)) return _alg
    CASE(max);
    CASE(reduction_max);
    CASE(min);
    CASE(reduction_min);
    CASE(sum);
    CASE(reduction_sum);
    CASE(mul);
    CASE(reduction_mul);
    CASE(mean);
    CASE(reduction_mean);
    CASE(norm_lp_max);
    CASE(reduction_norm_lp_max);
    CASE(norm_lp_sum);
    CASE(reduction_norm_lp_sum);
    CASE(norm_lp_power_p_max);
    CASE(reduction_norm_lp_power_p_max);
    CASE(norm_lp_power_p_sum);
    CASE(reduction_norm_lp_power_p_sum);

#undef CASE
    assert(!"unknown algorithm");
    return undef;
}

const char *alg2str(alg_t alg) {
    if (alg == max) return "max";
    if (alg == min) return "min";
    if (alg == sum) return "sum";
    if (alg == mul) return "mul";
    if (alg == mean) return "mean";
    if (alg == norm_lp_max) return "norm_lp_max";
    if (alg == norm_lp_sum) return "norm_lp_sum";
    if (alg == norm_lp_power_p_max) return "norm_lp_power_p_max";
    if (alg == norm_lp_power_p_sum) return "norm_lp_power_p_sum";
    assert(!"unknown algorithm");
    return "undef";
}

dnnl_alg_kind_t alg2alg_kind(alg_t alg) {
    if (alg == max) return dnnl_reduction_max;
    if (alg == min) return dnnl_reduction_min;
    if (alg == sum) return dnnl_reduction_sum;
    if (alg == mul) return dnnl_reduction_mul;
    if (alg == mean) return dnnl_reduction_mean;
    if (alg == norm_lp_max) return dnnl_reduction_norm_lp_max;
    if (alg == norm_lp_sum) return dnnl_reduction_norm_lp_sum;
    if (alg == norm_lp_power_p_max) return dnnl_reduction_norm_lp_power_p_max;
    if (alg == norm_lp_power_p_sum) return dnnl_reduction_norm_lp_power_p_sum;
    assert(!"unknown algorithm");
    return dnnl_alg_kind_undef;
}

std::ostream &operator<<(std::ostream &s, const prb_t &prb) {
    dump_global_params(s);
    settings_t def;

    if (canonical || prb.sdt != def.sdt[0]) s << "--sdt=" << prb.sdt << " ";
    if (canonical || prb.ddt != def.ddt[0]) s << "--ddt=" << prb.ddt << " ";
    if (canonical || prb.stag != def.stag[0]) s << "--stag=" << prb.stag << " ";
    if (canonical || prb.dtag != def.dtag[0]) s << "--dtag=" << prb.dtag << " ";
    if (canonical || prb.alg != def.alg[0])
        s << "--alg=" << alg2str(prb.alg) << " ";
    if (canonical || prb.p != def.p[0]) s << "--p=" << prb.p << " ";
    if (canonical || prb.eps != def.eps[0]) s << "--eps=" << prb.eps << " ";

    s << prb.attr;
    if (canonical || prb.ctx_init != def.ctx_init[0])
        s << "--ctx-init=" << prb.ctx_init << " ";
    if (canonical || prb.ctx_exe != def.ctx_exe[0])
        s << "--ctx-exe=" << prb.ctx_exe << " ";

    s << static_cast<prb_vdims_t>(prb);

    return s;
}

} // namespace reduction
