view example/fft/task_init.cc @ 1621:f907bbac14f2 draft

Implement Boyer-Moore String Search Algorithm.(But incomplete divided file point)
author Masa <e085726@ie.u-ryukyu.ac.jp>
date Tue, 21 May 2013 17:03:53 +0900
parents 7d307bac94a6
children 6c0b6947c231
line wrap: on
line source

#include "Func.h"
#include "Scheduler.h"
#include "GpuScheduler.h"

#ifndef __CERIUM_GPU__
SchedExternTask(setid);
SchedExternTask(spinFact);
SchedExternTask(bitReverse);
SchedExternTask(norm);
SchedExternTask(butterfly);
SchedExternTask(transpose);
SchedExternTask(highPassFilter);
#endif // not __CERIUM_GPU__

void
task_init(void)
{
#ifdef __CERIUM_GPU__
    GpuSchedRegister(SPIN_FACT, "gpu/fft.cl", "spinFact");
    GpuSchedRegister(BIT_REVERSE, "gpu/fft.cl", "bitReverse");
    GpuSchedRegister(NORMALIZATION, "gpu/fft.cl", "norm");
    GpuSchedRegister(BUTTERFLY, "gpu/fft.cl", "butterfly");
    GpuSchedRegister(TRANSEPOSE, "gpu/fft.cl", "transpose");
    GpuSchedRegister(HIGH_PASS_FILTER, "gpu/fft.cl", "highPassFilter");
#else
    SchedRegisterTask(SET_ID,setid);
    SchedRegisterTask(SPIN_FACT,spinFact);
    SchedRegisterTask(NORMALIZATION, norm);
    SchedRegisterTask(BIT_REVERSE, bitReverse);
    SchedRegisterTask(BUTTERFLY, butterfly);
    SchedRegisterTask(TRANSEPOSE, transpose);
    SchedRegisterTask(HIGH_PASS_FILTER, highPassFilter);
#endif
}