/*

 * Copyright (c) 2003, 2007-14 Matteo Frigo

 * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology

 *

 * This program is free software; you can redistribute it and/or modify

 * it under the terms of the GNU General Public License as published by

 * the Free Software Foundation; either version 2 of the License, or

 * (at your option) any later version.

 *

 * This program is distributed in the hope that it will be useful,

 * but WITHOUT ANY WARRANTY; without even the implied warranty of

 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the

 * GNU General Public License for more details.

 *

 * You should have received a copy of the GNU General Public License

 * along with this program; if not, write to the Free Software

 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA

 *

 */

/* This file was automatically generated --- DO NOT EDIT */

/* Generated on Fri Jul 18 06:51:54 UTC 2025 */

#include "rdft/codelet-rdft.h"

#if defined(ARCH_PREFERS_FMA) || defined(ISA_EXTENSION_PREFERS_FMA)

/* Generated by: ../../../genfft/gen_hc2cdft.native -fma -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hc2cbdft_2 -include rdft/scalar/hc2cb.h */

/*

 * This function contains 10 FP additions, 4 FP multiplications,

 * (or, 8 additions, 2 multiplications, 2 fused multiply/add),

 * 15 stack variables, 0 constants, and 8 memory accesses

 */

#include "rdft/scalar/hc2cb.h"

static void hc2cbdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)

{

     {

    INT m;

    for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {

         E T3, Ta, Tc, T9, Td, T4, T8, Tb, Te;

         {

        E T1, T2, T5, T6, T7;

        T1 = Ip[0];

        T2 = Im[0];

        T3 = T1 - T2;

        Ta = T1 + T2;

        T5 = Rp[0];

        T6 = Rm[0];

        T7 = T5 - T6;

        Tc = T5 + T6;

        T9 = W[1];

        Td = T9 * T7;

        T4 = W[0];

        T8 = T4 * T7;

         }

         Tb = FNMS(T9, Ta, T8);

         Ip[0] = T3 + Tb;

         Im[0] = Tb - T3;

         Te = FMA(T4, Ta, Td);

         Rp[0] = Tc - Te;

         Rm[0] = Tc + Te;

    }

     }

}

static const tw_instr twinstr[] = {

     { TW_FULL, 1, 2 },

     { TW_NEXT, 1, 0 }

};

static const hc2c_desc desc = { 2, "hc2cbdft_2", twinstr, &GENUS, { 8, 2, 2, 0 } };

void X(codelet_hc2cbdft_2) (planner *p) {

     X(khc2c_register) (p, hc2cbdft_2, &desc, HC2C_VIA_DFT);

}

#else

/* Generated by: ../../../genfft/gen_hc2cdft.native -compact -variables 4 -pipeline-latency 4 -sign 1 -n 2 -dif -name hc2cbdft_2 -include rdft/scalar/hc2cb.h */

/*

 * This function contains 10 FP additions, 4 FP multiplications,

 * (or, 8 additions, 2 multiplications, 2 fused multiply/add),

 * 9 stack variables, 0 constants, and 8 memory accesses

 */

#include "rdft/scalar/hc2cb.h"

static void hc2cbdft_2(R *Rp, R *Ip, R *Rm, R *Im, const R *W, stride rs, INT mb, INT me, INT ms)

{

     {

    INT m;

    for (m = mb, W = W + ((mb - 1) * 2); m < me; m = m + 1, Rp = Rp + ms, Ip = Ip + ms, Rm = Rm - ms, Im = Im - ms, W = W + 2, MAKE_VOLATILE_STRIDE(8, rs)) {

         E T3, T9, T7, Tb;

         {

        E T1, T2, T5, T6;

        T1 = Ip[0];

        T2 = Im[0];

        T3 = T1 - T2;

        T9 = T1 + T2;

        T5 = Rp[0];

        T6 = Rm[0];

        T7 = T5 - T6;

        Tb = T5 + T6;

         }

         {

        E Ta, Tc, T4, T8;

        T4 = W[0];

        T8 = W[1];

        Ta = FNMS(T8, T9, T4 * T7);

        Tc = FMA(T8, T7, T4 * T9);

        Ip[0] = T3 + Ta;

        Rp[0] = Tb - Tc;

        Im[0] = Ta - T3;

        Rm[0] = Tb + Tc;

         }

    }

     }

}

static const tw_instr twinstr[] = {

     { TW_FULL, 1, 2 },

     { TW_NEXT, 1, 0 }

};

static const hc2c_desc desc = { 2, "hc2cbdft_2", twinstr, &GENUS, { 8, 2, 2, 0 } };

void X(codelet_hc2cbdft_2) (planner *p) {

     X(khc2c_register) (p, hc2cbdft_2, &desc, HC2C_VIA_DFT);

}

#endif