scheduler.cpp 7.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338
  1. /*
  2. Generated with CMSIS-DSP Compute Graph Scripts.
  3. The generated code is not covered by CMSIS-DSP license.
  4. The support classes and code is covered by CMSIS-DSP license.
  5. */
  6. #include "arm_math.h"
  7. #include "custom.h"
  8. #include "GenericNodes.h"
  9. #include "AppNodes.h"
  10. #include "scheduler.h"
  11. #if !defined(CHECKERROR)
  12. #define CHECKERROR if (cgStaticError < 0) \
  13. {\
  14. goto errorHandling;\
  15. }
  16. #endif
  17. #if !defined(CG_BEFORE_ITERATION)
  18. #define CG_BEFORE_ITERATION
  19. #endif
  20. #if !defined(CG_AFTER_ITERATION)
  21. #define CG_AFTER_ITERATION
  22. #endif
  23. #if !defined(CG_BEFORE_SCHEDULE)
  24. #define CG_BEFORE_SCHEDULE
  25. #endif
  26. #if !defined(CG_AFTER_SCHEDULE)
  27. #define CG_AFTER_SCHEDULE
  28. #endif
  29. #if !defined(CG_BEFORE_BUFFER)
  30. #define CG_BEFORE_BUFFER
  31. #endif
  32. #if !defined(CG_BEFORE_FIFO_BUFFERS)
  33. #define CG_BEFORE_FIFO_BUFFERS
  34. #endif
  35. #if !defined(CG_BEFORE_FIFO_INIT)
  36. #define CG_BEFORE_FIFO_INIT
  37. #endif
  38. #if !defined(CG_BEFORE_NODE_INIT)
  39. #define CG_BEFORE_NODE_INIT
  40. #endif
  41. #if !defined(CG_AFTER_INCLUDES)
  42. #define CG_AFTER_INCLUDES
  43. #endif
  44. #if !defined(CG_BEFORE_SCHEDULER_FUNCTION)
  45. #define CG_BEFORE_SCHEDULER_FUNCTION
  46. #endif
  47. #if !defined(CG_BEFORE_NODE_EXECUTION)
  48. #define CG_BEFORE_NODE_EXECUTION
  49. #endif
  50. #if !defined(CG_AFTER_NODE_EXECUTION)
  51. #define CG_AFTER_NODE_EXECUTION
  52. #endif
  53. CG_AFTER_INCLUDES
  54. /*
  55. Description of the scheduling.
  56. */
  57. static unsigned int schedule[9]=
  58. {
  59. 7,8,2,1,4,0,3,5,6,
  60. };
  61. CG_BEFORE_FIFO_BUFFERS
  62. /***********
  63. FIFO buffers
  64. ************/
  65. #define FIFOSIZE0 2
  66. #define FIFOSIZE1 2
  67. #define FIFOSIZE2 2
  68. #define FIFOSIZE3 2
  69. #define FIFOSIZE4 3
  70. #define FIFOSIZE5 2
  71. #define FIFOSIZE6 2
  72. #define FIFOSIZE7 2
  73. #define BUFFERSIZE1 2
  74. CG_BEFORE_BUFFER
  75. int16_t buf1[BUFFERSIZE1]={0};
  76. #define BUFFERSIZE2 2
  77. CG_BEFORE_BUFFER
  78. int16_t buf2[BUFFERSIZE2]={0};
  79. #define BUFFERSIZE3 2
  80. CG_BEFORE_BUFFER
  81. int16_t buf3[BUFFERSIZE3]={0};
  82. #define BUFFERSIZE4 2
  83. CG_BEFORE_BUFFER
  84. int16_t buf4[BUFFERSIZE4]={0};
  85. #define BUFFERSIZE5 3
  86. CG_BEFORE_BUFFER
  87. int16_t buf5[BUFFERSIZE5]={0};
  88. #define BUFFERSIZE6 2
  89. CG_BEFORE_BUFFER
  90. int16_t buf6[BUFFERSIZE6]={0};
  91. #define BUFFERSIZE7 2
  92. CG_BEFORE_BUFFER
  93. int16_t buf7[BUFFERSIZE7]={0};
  94. #define BUFFERSIZE8 2
  95. CG_BEFORE_BUFFER
  96. int16_t buf8[BUFFERSIZE8]={0};
  97. CG_BEFORE_SCHEDULER_FUNCTION
  98. uint32_t scheduler(int *error)
  99. {
  100. int cgStaticError=0;
  101. uint32_t nbSchedule=0;
  102. int32_t debugCounter=10;
  103. CG_BEFORE_FIFO_INIT;
  104. /*
  105. Create FIFOs objects
  106. */
  107. FIFO<int16_t,FIFOSIZE0,0,1> fifo0(buf1);
  108. FIFO<int16_t,FIFOSIZE1,0,1> fifo1(buf2);
  109. FIFO<int16_t,FIFOSIZE2,0,1> fifo2(buf3);
  110. FIFO<int16_t,FIFOSIZE3,0,1> fifo3(buf4);
  111. FIFO<int16_t,FIFOSIZE4,0,1> fifo4(buf5);
  112. FIFO<int16_t,FIFOSIZE5,0,1> fifo5(buf6);
  113. FIFO<int16_t,FIFOSIZE6,0,1> fifo6(buf7);
  114. FIFO<int16_t,FIFOSIZE7,0,1> fifo7(buf8);
  115. CG_BEFORE_NODE_INIT;
  116. /*
  117. Create node objects
  118. */
  119. NullSink<int16_t,1> debug(fifo4);
  120. Duplicate2<int16_t,1,int16_t,1,int16_t,1> dup0(fifo2,fifo3,fifo4);
  121. Duplicate2<int16_t,1,int16_t,1,int16_t,1> dup1(fifo5,fifo6,fifo7);
  122. ProcessingOddEven<int16_t,1,int16_t,1,int16_t,1> proc(fifo3,fifo0,fifo1);
  123. SinkAsync<int16_t,1> sinka(fifo6);
  124. SinkAsync<int16_t,1> sinkb(fifo7);
  125. SourceEven<int16_t,1> sourceEven(fifo0);
  126. SourceOdd<int16_t,1> sourceOdd(fifo2);
  127. /* Run several schedule iterations */
  128. CG_BEFORE_SCHEDULE;
  129. while((cgStaticError==0) && (debugCounter > 0))
  130. {
  131. /* Run a schedule iteration */
  132. CG_BEFORE_ITERATION;
  133. for(unsigned long id=0 ; id < 9; id++)
  134. {
  135. CG_BEFORE_NODE_EXECUTION;
  136. cgStaticError = 0;
  137. switch(schedule[id])
  138. {
  139. case 0:
  140. {
  141. bool canRun=true;
  142. canRun &= !fifo1.willUnderflowWith(1);
  143. canRun &= !fifo5.willOverflowWith(1);
  144. if (!canRun)
  145. {
  146. cgStaticError = CG_SKIP_EXECUTION_ID_CODE;
  147. }
  148. else
  149. {
  150. cgStaticError = 0;
  151. }
  152. }
  153. break;
  154. case 1:
  155. {
  156. cgStaticError = debug.prepareForRunning();
  157. }
  158. break;
  159. case 2:
  160. {
  161. cgStaticError = dup0.prepareForRunning();
  162. }
  163. break;
  164. case 3:
  165. {
  166. cgStaticError = dup1.prepareForRunning();
  167. }
  168. break;
  169. case 4:
  170. {
  171. cgStaticError = proc.prepareForRunning();
  172. }
  173. break;
  174. case 5:
  175. {
  176. cgStaticError = sinka.prepareForRunning();
  177. }
  178. break;
  179. case 6:
  180. {
  181. cgStaticError = sinkb.prepareForRunning();
  182. }
  183. break;
  184. case 7:
  185. {
  186. cgStaticError = sourceEven.prepareForRunning();
  187. }
  188. break;
  189. case 8:
  190. {
  191. cgStaticError = sourceOdd.prepareForRunning();
  192. }
  193. break;
  194. default:
  195. break;
  196. }
  197. if (cgStaticError == CG_SKIP_EXECUTION_ID_CODE)
  198. {
  199. cgStaticError = 0;
  200. continue;
  201. }
  202. CHECKERROR;
  203. switch(schedule[id])
  204. {
  205. case 0:
  206. {
  207. {
  208. int16_t* i0;
  209. int16_t* o1;
  210. i0=fifo1.getReadBuffer(1);
  211. o1=fifo5.getWriteBuffer(1);
  212. compute(i0,o1,1);
  213. cgStaticError = 0;
  214. }
  215. }
  216. break;
  217. case 1:
  218. {
  219. cgStaticError = debug.run();
  220. }
  221. break;
  222. case 2:
  223. {
  224. cgStaticError = dup0.run();
  225. }
  226. break;
  227. case 3:
  228. {
  229. cgStaticError = dup1.run();
  230. }
  231. break;
  232. case 4:
  233. {
  234. cgStaticError = proc.run();
  235. }
  236. break;
  237. case 5:
  238. {
  239. cgStaticError = sinka.run();
  240. }
  241. break;
  242. case 6:
  243. {
  244. cgStaticError = sinkb.run();
  245. }
  246. break;
  247. case 7:
  248. {
  249. cgStaticError = sourceEven.run();
  250. }
  251. break;
  252. case 8:
  253. {
  254. cgStaticError = sourceOdd.run();
  255. }
  256. break;
  257. default:
  258. break;
  259. }
  260. CG_AFTER_NODE_EXECUTION;
  261. CHECKERROR;
  262. }
  263. debugCounter--;
  264. CG_AFTER_ITERATION;
  265. nbSchedule++;
  266. }
  267. errorHandling:
  268. CG_AFTER_SCHEDULE;
  269. *error=cgStaticError;
  270. return(nbSchedule);
  271. }