/* Generated with CMSIS-DSP Compute Graph Scripts. The generated code is not covered by CMSIS-DSP license. The support classes and code is covered by CMSIS-DSP license. */ #include "arm_math.h" #include "custom.h" #include "GenericNodes.h" #include "AppNodes.h" #include "scheduler.h" #if !defined(CHECKERROR) #define CHECKERROR if (cgStaticError < 0) \ {\ goto errorHandling;\ } #endif #if !defined(CG_BEFORE_ITERATION) #define CG_BEFORE_ITERATION #endif #if !defined(CG_AFTER_ITERATION) #define CG_AFTER_ITERATION #endif #if !defined(CG_BEFORE_SCHEDULE) #define CG_BEFORE_SCHEDULE #endif #if !defined(CG_AFTER_SCHEDULE) #define CG_AFTER_SCHEDULE #endif #if !defined(CG_BEFORE_BUFFER) #define CG_BEFORE_BUFFER #endif #if !defined(CG_BEFORE_FIFO_BUFFERS) #define CG_BEFORE_FIFO_BUFFERS #endif #if !defined(CG_BEFORE_FIFO_INIT) #define CG_BEFORE_FIFO_INIT #endif #if !defined(CG_BEFORE_NODE_INIT) #define CG_BEFORE_NODE_INIT #endif #if !defined(CG_AFTER_INCLUDES) #define CG_AFTER_INCLUDES #endif #if !defined(CG_BEFORE_SCHEDULER_FUNCTION) #define CG_BEFORE_SCHEDULER_FUNCTION #endif #if !defined(CG_BEFORE_NODE_EXECUTION) #define CG_BEFORE_NODE_EXECUTION #endif #if !defined(CG_AFTER_NODE_EXECUTION) #define CG_AFTER_NODE_EXECUTION #endif CG_AFTER_INCLUDES /* Description of the scheduling. */ static unsigned int schedule[4]= { 3,1,0,2, }; CG_BEFORE_FIFO_BUFFERS /*********** FIFO buffers ************/ #define FIFOSIZE0 5 #define FIFOSIZE1 5 #define FIFOSIZE2 5 #define FIFOSIZE3 5 #define BUFFERSIZE1 5 CG_BEFORE_BUFFER float32_t buf1[BUFFERSIZE1]={0}; #define BUFFERSIZE2 5 CG_BEFORE_BUFFER float32_t buf2[BUFFERSIZE2]={0}; #define BUFFERSIZE3 5 CG_BEFORE_BUFFER float32_t buf3[BUFFERSIZE3]={0}; #define BUFFERSIZE4 5 CG_BEFORE_BUFFER float32_t buf4[BUFFERSIZE4]={0}; CG_BEFORE_SCHEDULER_FUNCTION uint32_t scheduler(int *error,int someVariable) { int cgStaticError=0; uint32_t nbSchedule=0; int32_t debugCounter=2; CG_BEFORE_FIFO_INIT; /* Create FIFOs objects */ FIFO fifo0(buf1); FIFO fifo1(buf2); FIFO fifo2(buf3); FIFO fifo3(buf4,5); CG_BEFORE_NODE_INIT; /* Create node objects */ Duplicate2 dup0(fifo1,fifo2,fifo3); ProcessingNode filter(fifo0,fifo3,fifo1); Sink sink(fifo2); Source source(fifo0); /* Run several schedule iterations */ CG_BEFORE_SCHEDULE; while((cgStaticError==0) && (debugCounter > 0)) { /* Run a schedule iteration */ CG_BEFORE_ITERATION; for(unsigned long id=0 ; id < 4; id++) { CG_BEFORE_NODE_EXECUTION; switch(schedule[id]) { case 0: { cgStaticError = dup0.run(); } break; case 1: { cgStaticError = filter.run(); } break; case 2: { cgStaticError = sink.run(); } break; case 3: { cgStaticError = source.run(); } break; default: break; } CG_AFTER_NODE_EXECUTION; CHECKERROR; } debugCounter--; CG_AFTER_ITERATION; nbSchedule++; } errorHandling: CG_AFTER_SCHEDULE; *error=cgStaticError; return(nbSchedule); }