foreach.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714
  1. /**
  2. * @file foreach.c
  3. * @author Ambroz Bizjak <ambrop7@gmail.com>
  4. *
  5. * @section LICENSE
  6. *
  7. * Redistribution and use in source and binary forms, with or without
  8. * modification, are permitted provided that the following conditions are met:
  9. * 1. Redistributions of source code must retain the above copyright
  10. * notice, this list of conditions and the following disclaimer.
  11. * 2. Redistributions in binary form must reproduce the above copyright
  12. * notice, this list of conditions and the following disclaimer in the
  13. * documentation and/or other materials provided with the distribution.
  14. * 3. Neither the name of the author nor the
  15. * names of its contributors may be used to endorse or promote products
  16. * derived from this software without specific prior written permission.
  17. *
  18. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
  19. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  20. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  21. * DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
  22. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  23. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  24. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  25. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  26. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  27. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  28. *
  29. * @section DESCRIPTION
  30. *
  31. * Synopsis:
  32. * foreach(list/map collection, string template, list args)
  33. *
  34. * Description:
  35. * Initializes a template process for each element of list, sequentially,
  36. * obeying to the usual execution model of NCD.
  37. * It's equivalent to (except for special variables):
  38. *
  39. * call(template, args);
  40. * ...
  41. * call(template, args); # one call() for every element of list
  42. *
  43. * Template process specials:
  44. *
  45. * _index - (lists only) index of the list element corresponding to the template,
  46. * process, as a decimal string, starting from zero
  47. * _elem - (lists only) element of list corresponding to the template process
  48. * _key - (maps only) key of the current map entry
  49. * _val - (maps only) value of the current map entry
  50. * _caller.X - X as seen from the foreach() statement
  51. *
  52. * Synopsis:
  53. * foreach_emb(list/map collection, string template, string name1 [, string name2])
  54. *
  55. * Description:
  56. * Foreach for embedded templates; the desugaring process converts Foreach
  57. * clauses into this statement. The called templates have direct access to
  58. * objects as seen from this statement, and also some kind of access to the
  59. * current element of the iteration, depending on the type of collection
  60. * being iterated, and whether 'name2' is provided:
  61. * List and one name: current element is named 'name1'.
  62. * List and both names: current index is named 'name1', current element 'name2'.
  63. * Map and one name: current key is named 'name1'.
  64. * Map and both names: current key is named 'name1', current value 'name2'.
  65. */
  66. #include <stdlib.h>
  67. #include <string.h>
  68. #include <limits.h>
  69. #include <misc/balloc.h>
  70. #include <misc/string_begins_with.h>
  71. #include <misc/debug.h>
  72. #include <misc/offset.h>
  73. #include <system/BReactor.h>
  74. #include <ncd/NCDModule.h>
  75. #include <ncd/static_strings.h>
  76. #include <ncd/extra/value_utils.h>
  77. #include <generated/blog_channel_ncd_foreach.h>
  78. #define ModuleLog(i, ...) NCDModuleInst_Backend_Log((i), BLOG_CURRENT_CHANNEL, __VA_ARGS__)
  79. #define ISTATE_WORKING 1
  80. #define ISTATE_UP 2
  81. #define ISTATE_WAITING 3
  82. #define ISTATE_TERMINATING 4
  83. #define ESTATE_FORGOTTEN 1
  84. #define ESTATE_DOWN 2
  85. #define ESTATE_UP 3
  86. #define ESTATE_WAITING 4
  87. #define ESTATE_TERMINATING 5
  88. struct element;
  89. struct instance {
  90. NCDModuleInst *i;
  91. NCDValRef template_name;
  92. NCDValRef args;
  93. NCD_string_id_t name1;
  94. NCD_string_id_t name2;
  95. BTimer timer;
  96. struct element *elems;
  97. int type;
  98. int num_elems;
  99. int gp; // good pointer
  100. int ip; // initialized pointer
  101. int state;
  102. };
  103. struct element {
  104. struct instance *inst;
  105. union {
  106. struct {
  107. NCDValRef list_elem;
  108. };
  109. struct {
  110. NCDValRef map_key;
  111. NCDValRef map_val;
  112. };
  113. };
  114. NCDModuleProcess process;
  115. int i;
  116. int state;
  117. };
  118. static void assert_state (struct instance *o);
  119. static void work (struct instance *o);
  120. static void advance (struct instance *o);
  121. static void timer_handler (struct instance *o);
  122. static void element_process_handler_event (NCDModuleProcess *process, int event);
  123. static int element_process_func_getspecialobj (NCDModuleProcess *process, NCD_string_id_t name, NCDObject *out_object);
  124. static int element_caller_object_func_getobj (const NCDObject *obj, NCD_string_id_t name, NCDObject *out_object);
  125. static int element_list_index_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  126. static int element_list_elem_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  127. static int element_map_key_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  128. static int element_map_val_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  129. static void instance_free (struct instance *o);
  130. enum {STRING_CALLER, STRING_INDEX, STRING_ELEM, STRING_KEY, STRING_VAL};
  131. static struct NCD_string_request strings[] = {
  132. {"_caller"}, {"_index"}, {"_elem"}, {"_key"}, {"_val"}, {NULL}
  133. };
  134. static void assert_state (struct instance *o)
  135. {
  136. ASSERT(o->num_elems >= 0)
  137. ASSERT(o->gp >= 0)
  138. ASSERT(o->ip >= 0)
  139. ASSERT(o->gp <= o->num_elems)
  140. ASSERT(o->ip <= o->num_elems)
  141. ASSERT(o->gp <= o->ip)
  142. #ifndef NDEBUG
  143. // check GP
  144. for (int i = 0; i < o->gp; i++) {
  145. if (i == o->gp - 1) {
  146. ASSERT(o->elems[i].state == ESTATE_UP || o->elems[i].state == ESTATE_DOWN ||
  147. o->elems[i].state == ESTATE_WAITING)
  148. } else {
  149. ASSERT(o->elems[i].state == ESTATE_UP)
  150. }
  151. }
  152. // check IP
  153. int ip = o->num_elems;
  154. while (ip > 0 && o->elems[ip - 1].state == ESTATE_FORGOTTEN) {
  155. ip--;
  156. }
  157. ASSERT(o->ip == ip)
  158. // check gap
  159. for (int i = o->gp; i < o->ip; i++) {
  160. if (i == o->ip - 1) {
  161. ASSERT(o->elems[i].state == ESTATE_UP || o->elems[i].state == ESTATE_DOWN ||
  162. o->elems[i].state == ESTATE_WAITING || o->elems[i].state == ESTATE_TERMINATING)
  163. } else {
  164. ASSERT(o->elems[i].state == ESTATE_UP || o->elems[i].state == ESTATE_DOWN ||
  165. o->elems[i].state == ESTATE_WAITING)
  166. }
  167. }
  168. #endif
  169. }
  170. static void work (struct instance *o)
  171. {
  172. assert_state(o);
  173. // stop timer
  174. BReactor_RemoveTimer(o->i->params->iparams->reactor, &o->timer);
  175. if (o->state == ISTATE_WAITING) {
  176. return;
  177. }
  178. if (o->state == ISTATE_UP && !(o->gp == o->ip && o->gp == o->num_elems && (o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP))) {
  179. // signal down
  180. NCDModuleInst_Backend_Down(o->i);
  181. // set state waiting
  182. o->state = ISTATE_WAITING;
  183. return;
  184. }
  185. if (o->gp < o->ip) {
  186. // get last element
  187. struct element *le = &o->elems[o->ip - 1];
  188. ASSERT(le->state != ESTATE_FORGOTTEN)
  189. // start terminating if not already
  190. if (le->state != ESTATE_TERMINATING) {
  191. // request termination
  192. NCDModuleProcess_Terminate(&le->process);
  193. // set element state terminating
  194. le->state = ESTATE_TERMINATING;
  195. }
  196. return;
  197. }
  198. if (o->state == ISTATE_TERMINATING) {
  199. // finally die
  200. instance_free(o);
  201. return;
  202. }
  203. if (o->gp == o->num_elems && (o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)) {
  204. if (o->state == ISTATE_WORKING) {
  205. // signal up
  206. NCDModuleInst_Backend_Up(o->i);
  207. // set state up
  208. o->state = ISTATE_UP;
  209. }
  210. return;
  211. }
  212. if (o->gp > 0 && o->elems[o->gp - 1].state == ESTATE_WAITING) {
  213. // get last element
  214. struct element *le = &o->elems[o->gp - 1];
  215. // continue process
  216. NCDModuleProcess_Continue(&le->process);
  217. // set state down
  218. le->state = ESTATE_DOWN;
  219. return;
  220. }
  221. if (o->gp > 0 && o->elems[o->gp - 1].state == ESTATE_DOWN) {
  222. return;
  223. }
  224. ASSERT(o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)
  225. advance(o);
  226. return;
  227. }
  228. static void advance (struct instance *o)
  229. {
  230. assert_state(o);
  231. ASSERT(o->gp == o->ip)
  232. ASSERT(o->gp < o->num_elems)
  233. ASSERT(o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)
  234. ASSERT(o->elems[o->gp].state == ESTATE_FORGOTTEN)
  235. // get next element
  236. struct element *e = &o->elems[o->gp];
  237. // init process
  238. if (!NCDModuleProcess_InitValue(&e->process, o->i, o->template_name, o->args, element_process_handler_event)) {
  239. ModuleLog(o->i, BLOG_ERROR, "NCDModuleProcess_Init failed");
  240. goto fail;
  241. }
  242. // set special functions
  243. NCDModuleProcess_SetSpecialFuncs(&e->process, element_process_func_getspecialobj);
  244. // set element state down
  245. e->state = ESTATE_DOWN;
  246. // increment GP and IP
  247. o->gp++;
  248. o->ip++;
  249. return;
  250. fail:
  251. // set timer
  252. BReactor_SetTimer(o->i->params->iparams->reactor, &o->timer);
  253. }
  254. static void timer_handler (struct instance *o)
  255. {
  256. assert_state(o);
  257. ASSERT(o->gp == o->ip)
  258. ASSERT(o->gp < o->num_elems)
  259. ASSERT(o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)
  260. ASSERT(o->elems[o->gp].state == ESTATE_FORGOTTEN)
  261. advance(o);
  262. return;
  263. }
  264. static void element_process_handler_event (NCDModuleProcess *process, int event)
  265. {
  266. struct element *e = UPPER_OBJECT(process, struct element, process);
  267. struct instance *o = e->inst;
  268. assert_state(o);
  269. ASSERT(e->i < o->ip)
  270. ASSERT(e->state != ESTATE_FORGOTTEN)
  271. switch (event) {
  272. case NCDMODULEPROCESS_EVENT_UP: {
  273. ASSERT(e->state == ESTATE_DOWN)
  274. ASSERT(o->gp == o->ip)
  275. ASSERT(o->gp == e->i + 1)
  276. // set element state up
  277. e->state = ESTATE_UP;
  278. } break;
  279. case NCDMODULEPROCESS_EVENT_DOWN: {
  280. ASSERT(e->state == ESTATE_UP)
  281. // set element state waiting
  282. e->state = ESTATE_WAITING;
  283. // bump down GP
  284. if (o->gp > e->i + 1) {
  285. o->gp = e->i + 1;
  286. }
  287. } break;
  288. case NCDMODULEPROCESS_EVENT_TERMINATED: {
  289. ASSERT(e->state == ESTATE_TERMINATING)
  290. ASSERT(o->gp < o->ip)
  291. ASSERT(o->ip == e->i + 1)
  292. // free process
  293. NCDModuleProcess_Free(&e->process);
  294. // set element state forgotten
  295. e->state = ESTATE_FORGOTTEN;
  296. // decrement IP
  297. o->ip--;
  298. } break;
  299. default: ASSERT(0);
  300. }
  301. work(o);
  302. return;
  303. }
  304. static int element_process_func_getspecialobj (NCDModuleProcess *process, NCD_string_id_t name, NCDObject *out_object)
  305. {
  306. struct element *e = UPPER_OBJECT(process, struct element, process);
  307. struct instance *o = e->inst;
  308. ASSERT(e->state != ESTATE_FORGOTTEN)
  309. switch (o->type) {
  310. case NCDVAL_LIST: {
  311. NCD_string_id_t index_name = (o->name2 >= 0 ? o->name1 : -1);
  312. NCD_string_id_t elem_name = (o->name2 >= 0 ? o->name2 : o->name1);
  313. if (index_name >= 0 && name == index_name) {
  314. *out_object = NCDObject_Build(-1, e, element_list_index_object_func_getvar, NCDObject_no_getobj);
  315. return 1;
  316. }
  317. if (name == elem_name) {
  318. *out_object = NCDObject_Build(-1, e, element_list_elem_object_func_getvar, NCDObject_no_getobj);
  319. return 1;
  320. }
  321. } break;
  322. case NCDVAL_MAP: {
  323. NCD_string_id_t key_name = o->name1;
  324. NCD_string_id_t val_name = o->name2;
  325. if (name == key_name) {
  326. *out_object = NCDObject_Build(-1, e, element_map_key_object_func_getvar, NCDObject_no_getobj);
  327. return 1;
  328. }
  329. if (val_name >= 0 && name == val_name) {
  330. *out_object = NCDObject_Build(-1, e, element_map_val_object_func_getvar, NCDObject_no_getobj);
  331. return 1;
  332. }
  333. } break;
  334. }
  335. if (NCDVal_IsInvalid(o->args)) {
  336. return NCDModuleInst_Backend_GetObj(o->i, name, out_object);
  337. }
  338. if (name == strings[STRING_CALLER].id) {
  339. *out_object = NCDObject_Build(-1, e, NCDObject_no_getvar, element_caller_object_func_getobj);
  340. return 1;
  341. }
  342. return 0;
  343. }
  344. static int element_caller_object_func_getobj (const NCDObject *obj, NCD_string_id_t name, NCDObject *out_object)
  345. {
  346. struct element *e = NCDObject_DataPtr(obj);
  347. struct instance *o = e->inst;
  348. ASSERT(e->state != ESTATE_FORGOTTEN)
  349. ASSERT(!NCDVal_IsInvalid(o->args))
  350. return NCDModuleInst_Backend_GetObj(o->i, name, out_object);
  351. }
  352. static int element_list_index_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  353. {
  354. struct element *e = NCDObject_DataPtr(obj);
  355. struct instance *o = e->inst;
  356. B_USE(o)
  357. ASSERT(e->state != ESTATE_FORGOTTEN)
  358. ASSERT(o->type == NCDVAL_LIST)
  359. if (name != NCD_STRING_EMPTY) {
  360. return 0;
  361. }
  362. *out = ncd_make_uintmax(mem, e->i);
  363. return 1;
  364. }
  365. static int element_list_elem_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  366. {
  367. struct element *e = NCDObject_DataPtr(obj);
  368. struct instance *o = e->inst;
  369. B_USE(o)
  370. ASSERT(e->state != ESTATE_FORGOTTEN)
  371. ASSERT(o->type == NCDVAL_LIST)
  372. if (name != NCD_STRING_EMPTY) {
  373. return 0;
  374. }
  375. *out = NCDVal_NewCopy(mem, e->list_elem);
  376. return 1;
  377. }
  378. static int element_map_key_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  379. {
  380. struct element *e = NCDObject_DataPtr(obj);
  381. struct instance *o = e->inst;
  382. B_USE(o)
  383. ASSERT(e->state != ESTATE_FORGOTTEN)
  384. ASSERT(o->type == NCDVAL_MAP)
  385. if (name != NCD_STRING_EMPTY) {
  386. return 0;
  387. }
  388. *out = NCDVal_NewCopy(mem, e->map_key);
  389. return 1;
  390. }
  391. static int element_map_val_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  392. {
  393. struct element *e = NCDObject_DataPtr(obj);
  394. struct instance *o = e->inst;
  395. B_USE(o)
  396. ASSERT(e->state != ESTATE_FORGOTTEN)
  397. ASSERT(o->type == NCDVAL_MAP)
  398. if (name != NCD_STRING_EMPTY) {
  399. return 0;
  400. }
  401. *out = NCDVal_NewCopy(mem, e->map_val);
  402. return 1;
  403. }
  404. static void func_new_common (void *vo, NCDModuleInst *i, NCDValRef collection, NCDValRef template_name, NCDValRef args, NCD_string_id_t name1, NCD_string_id_t name2)
  405. {
  406. ASSERT(!NCDVal_IsInvalid(collection))
  407. ASSERT(NCDVal_IsString(template_name))
  408. ASSERT(NCDVal_IsInvalid(args) || NCDVal_IsList(args))
  409. ASSERT(name1 >= 0)
  410. struct instance *o = vo;
  411. o->i = i;
  412. o->type = NCDVal_Type(collection);
  413. o->template_name = template_name;
  414. o->args = args;
  415. o->name1 = name1;
  416. o->name2 = name2;
  417. // init timer
  418. btime_t retry_time = NCDModuleInst_Backend_InterpGetRetryTime(i);
  419. BTimer_Init(&o->timer, retry_time, (BTimer_handler)timer_handler, o);
  420. size_t num_elems;
  421. NCDValMapElem cur_map_elem;
  422. switch (o->type) {
  423. case NCDVAL_LIST: {
  424. num_elems = NCDVal_ListCount(collection);
  425. } break;
  426. case NCDVAL_MAP: {
  427. num_elems = NCDVal_MapCount(collection);
  428. cur_map_elem = NCDVal_MapOrderedFirst(collection);
  429. } break;
  430. default:
  431. ModuleLog(i, BLOG_ERROR, "invalid collection type");
  432. goto fail0;
  433. }
  434. if (num_elems > INT_MAX) {
  435. ModuleLog(i, BLOG_ERROR, "too many elements");
  436. goto fail0;
  437. }
  438. o->num_elems = num_elems;
  439. // allocate elements
  440. if (!(o->elems = BAllocArray(o->num_elems, sizeof(o->elems[0])))) {
  441. ModuleLog(i, BLOG_ERROR, "BAllocArray failed");
  442. goto fail0;
  443. }
  444. for (int j = 0; j < o->num_elems; j++) {
  445. struct element *e = &o->elems[j];
  446. // set instance
  447. e->inst = o;
  448. // set index
  449. e->i = j;
  450. // set state forgotten
  451. e->state = ESTATE_FORGOTTEN;
  452. // set values
  453. switch (o->type) {
  454. case NCDVAL_LIST: {
  455. e->list_elem = NCDVal_ListGet(collection, j);
  456. } break;
  457. case NCDVAL_MAP: {
  458. e->map_key = NCDVal_MapElemKey(collection, cur_map_elem);
  459. e->map_val = NCDVal_MapElemVal(collection, cur_map_elem);
  460. cur_map_elem = NCDVal_MapOrderedNext(collection, cur_map_elem);
  461. } break;
  462. }
  463. }
  464. // set GP and IP zero
  465. o->gp = 0;
  466. o->ip = 0;
  467. // set state working
  468. o->state = ISTATE_WORKING;
  469. work(o);
  470. return;
  471. fail0:
  472. NCDModuleInst_Backend_DeadError(i);
  473. }
  474. static void func_new_foreach (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  475. {
  476. // read arguments
  477. NCDValRef arg_collection;
  478. NCDValRef arg_template;
  479. NCDValRef arg_args;
  480. if (!NCDVal_ListRead(params->args, 3, &arg_collection, &arg_template, &arg_args)) {
  481. ModuleLog(i, BLOG_ERROR, "wrong arity");
  482. goto fail0;
  483. }
  484. if (!NCDVal_IsString(arg_template) || !NCDVal_IsList(arg_args)) {
  485. ModuleLog(i, BLOG_ERROR, "wrong type");
  486. goto fail0;
  487. }
  488. NCD_string_id_t name1;
  489. NCD_string_id_t name2;
  490. switch (NCDVal_Type(arg_collection)) {
  491. case NCDVAL_LIST: {
  492. name1 = strings[STRING_INDEX].id;
  493. name2 = strings[STRING_ELEM].id;
  494. } break;
  495. case NCDVAL_MAP: {
  496. name1 = strings[STRING_KEY].id;
  497. name2 = strings[STRING_VAL].id;
  498. } break;
  499. default:
  500. ModuleLog(i, BLOG_ERROR, "invalid collection type");
  501. goto fail0;
  502. }
  503. func_new_common(vo, i, arg_collection, arg_template, arg_args, name1, name2);
  504. return;
  505. fail0:
  506. NCDModuleInst_Backend_DeadError(i);
  507. }
  508. static void func_new_foreach_emb (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  509. {
  510. // read arguments
  511. NCDValRef arg_collection;
  512. NCDValRef arg_template;
  513. NCDValRef arg_name1;
  514. NCDValRef arg_name2 = NCDVal_NewInvalid();
  515. if (!NCDVal_ListRead(params->args, 3, &arg_collection, &arg_template, &arg_name1) && !NCDVal_ListRead(params->args, 4, &arg_collection, &arg_template, &arg_name1, &arg_name2)) {
  516. ModuleLog(i, BLOG_ERROR, "wrong arity");
  517. goto fail0;
  518. }
  519. if (!NCDVal_IsString(arg_template) || !NCDVal_IsString(arg_name1) || (!NCDVal_IsInvalid(arg_name2) && !NCDVal_IsString(arg_name2))) {
  520. ModuleLog(i, BLOG_ERROR, "wrong type");
  521. goto fail0;
  522. }
  523. NCD_string_id_t name1 = ncd_get_string_id(arg_name1, i->params->iparams->string_index);
  524. if (name1 < 0) {
  525. ModuleLog(i, BLOG_ERROR, "ncd_get_string_id failed");
  526. goto fail0;
  527. }
  528. NCD_string_id_t name2 = -1;
  529. if (!NCDVal_IsInvalid(arg_name2)) {
  530. name2 = ncd_get_string_id(arg_name2, i->params->iparams->string_index);
  531. if (name2 < 0) {
  532. ModuleLog(i, BLOG_ERROR, "ncd_get_string_id failed");
  533. goto fail0;
  534. }
  535. }
  536. func_new_common(vo, i, arg_collection, arg_template, NCDVal_NewInvalid(), name1, name2);
  537. return;
  538. fail0:
  539. NCDModuleInst_Backend_DeadError(i);
  540. }
  541. static void instance_free (struct instance *o)
  542. {
  543. ASSERT(o->gp == 0)
  544. ASSERT(o->ip == 0)
  545. // free elements
  546. BFree(o->elems);
  547. // free timer
  548. BReactor_RemoveTimer(o->i->params->iparams->reactor, &o->timer);
  549. NCDModuleInst_Backend_Dead(o->i);
  550. }
  551. static void func_die (void *vo)
  552. {
  553. struct instance *o = vo;
  554. assert_state(o);
  555. ASSERT(o->state != ISTATE_TERMINATING)
  556. // set GP zero
  557. o->gp = 0;
  558. // set state terminating
  559. o->state = ISTATE_TERMINATING;
  560. work(o);
  561. return;
  562. }
  563. static void func_clean (void *vo)
  564. {
  565. struct instance *o = vo;
  566. if (o->state != ISTATE_WAITING) {
  567. return;
  568. }
  569. // set state working
  570. o->state = ISTATE_WORKING;
  571. work(o);
  572. return;
  573. }
  574. static struct NCDModule modules[] = {
  575. {
  576. .type = "foreach",
  577. .func_new2 = func_new_foreach,
  578. .func_die = func_die,
  579. .func_clean = func_clean,
  580. .alloc_size = sizeof(struct instance)
  581. }, {
  582. .type = "foreach_emb",
  583. .func_new2 = func_new_foreach_emb,
  584. .func_die = func_die,
  585. .func_clean = func_clean,
  586. .alloc_size = sizeof(struct instance)
  587. }, {
  588. .type = NULL
  589. }
  590. };
  591. const struct NCDModuleGroup ncdmodule_foreach = {
  592. .modules = modules,
  593. .strings = strings
  594. };