foreach.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715
  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 ModuleString(i, id) ((i)->m->group->strings[(id)])
  80. #define ISTATE_WORKING 1
  81. #define ISTATE_UP 2
  82. #define ISTATE_WAITING 3
  83. #define ISTATE_TERMINATING 4
  84. #define ESTATE_FORGOTTEN 1
  85. #define ESTATE_DOWN 2
  86. #define ESTATE_UP 3
  87. #define ESTATE_WAITING 4
  88. #define ESTATE_TERMINATING 5
  89. struct element;
  90. struct instance {
  91. NCDModuleInst *i;
  92. NCDValRef template_name;
  93. NCDValRef args;
  94. NCD_string_id_t name1;
  95. NCD_string_id_t name2;
  96. BTimer timer;
  97. struct element *elems;
  98. int type;
  99. int num_elems;
  100. int gp; // good pointer
  101. int ip; // initialized pointer
  102. int state;
  103. };
  104. struct element {
  105. struct instance *inst;
  106. union {
  107. struct {
  108. NCDValRef list_elem;
  109. };
  110. struct {
  111. NCDValRef map_key;
  112. NCDValRef map_val;
  113. };
  114. };
  115. NCDModuleProcess process;
  116. int i;
  117. int state;
  118. };
  119. static void assert_state (struct instance *o);
  120. static void work (struct instance *o);
  121. static void advance (struct instance *o);
  122. static void timer_handler (struct instance *o);
  123. static void element_process_handler_event (NCDModuleProcess *process, int event);
  124. static int element_process_func_getspecialobj (NCDModuleProcess *process, NCD_string_id_t name, NCDObject *out_object);
  125. static int element_caller_object_func_getobj (const NCDObject *obj, NCD_string_id_t name, NCDObject *out_object);
  126. static int element_list_index_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  127. static int element_list_elem_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  128. static int element_map_key_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  129. static int element_map_val_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  130. static void instance_free (struct instance *o);
  131. enum {STRING_INDEX, STRING_ELEM, STRING_KEY, STRING_VAL};
  132. static const char *strings[] = {
  133. "_index", "_elem", "_key", "_val", NULL
  134. };
  135. static void assert_state (struct instance *o)
  136. {
  137. ASSERT(o->num_elems >= 0)
  138. ASSERT(o->gp >= 0)
  139. ASSERT(o->ip >= 0)
  140. ASSERT(o->gp <= o->num_elems)
  141. ASSERT(o->ip <= o->num_elems)
  142. ASSERT(o->gp <= o->ip)
  143. #ifndef NDEBUG
  144. // check GP
  145. for (int i = 0; i < o->gp; i++) {
  146. if (i == o->gp - 1) {
  147. ASSERT(o->elems[i].state == ESTATE_UP || o->elems[i].state == ESTATE_DOWN ||
  148. o->elems[i].state == ESTATE_WAITING)
  149. } else {
  150. ASSERT(o->elems[i].state == ESTATE_UP)
  151. }
  152. }
  153. // check IP
  154. int ip = o->num_elems;
  155. while (ip > 0 && o->elems[ip - 1].state == ESTATE_FORGOTTEN) {
  156. ip--;
  157. }
  158. ASSERT(o->ip == ip)
  159. // check gap
  160. for (int i = o->gp; i < o->ip; i++) {
  161. if (i == o->ip - 1) {
  162. ASSERT(o->elems[i].state == ESTATE_UP || o->elems[i].state == ESTATE_DOWN ||
  163. o->elems[i].state == ESTATE_WAITING || o->elems[i].state == ESTATE_TERMINATING)
  164. } else {
  165. ASSERT(o->elems[i].state == ESTATE_UP || o->elems[i].state == ESTATE_DOWN ||
  166. o->elems[i].state == ESTATE_WAITING)
  167. }
  168. }
  169. #endif
  170. }
  171. static void work (struct instance *o)
  172. {
  173. assert_state(o);
  174. // stop timer
  175. BReactor_RemoveTimer(o->i->params->iparams->reactor, &o->timer);
  176. if (o->state == ISTATE_WAITING) {
  177. return;
  178. }
  179. 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))) {
  180. // signal down
  181. NCDModuleInst_Backend_Down(o->i);
  182. // set state waiting
  183. o->state = ISTATE_WAITING;
  184. return;
  185. }
  186. if (o->gp < o->ip) {
  187. // get last element
  188. struct element *le = &o->elems[o->ip - 1];
  189. ASSERT(le->state != ESTATE_FORGOTTEN)
  190. // start terminating if not already
  191. if (le->state != ESTATE_TERMINATING) {
  192. // request termination
  193. NCDModuleProcess_Terminate(&le->process);
  194. // set element state terminating
  195. le->state = ESTATE_TERMINATING;
  196. }
  197. return;
  198. }
  199. if (o->state == ISTATE_TERMINATING) {
  200. // finally die
  201. instance_free(o);
  202. return;
  203. }
  204. if (o->gp == o->num_elems && (o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)) {
  205. if (o->state == ISTATE_WORKING) {
  206. // signal up
  207. NCDModuleInst_Backend_Up(o->i);
  208. // set state up
  209. o->state = ISTATE_UP;
  210. }
  211. return;
  212. }
  213. if (o->gp > 0 && o->elems[o->gp - 1].state == ESTATE_WAITING) {
  214. // get last element
  215. struct element *le = &o->elems[o->gp - 1];
  216. // continue process
  217. NCDModuleProcess_Continue(&le->process);
  218. // set state down
  219. le->state = ESTATE_DOWN;
  220. return;
  221. }
  222. if (o->gp > 0 && o->elems[o->gp - 1].state == ESTATE_DOWN) {
  223. return;
  224. }
  225. ASSERT(o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)
  226. advance(o);
  227. return;
  228. }
  229. static void advance (struct instance *o)
  230. {
  231. assert_state(o);
  232. ASSERT(o->gp == o->ip)
  233. ASSERT(o->gp < o->num_elems)
  234. ASSERT(o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)
  235. ASSERT(o->elems[o->gp].state == ESTATE_FORGOTTEN)
  236. // get next element
  237. struct element *e = &o->elems[o->gp];
  238. // init process
  239. if (!NCDModuleProcess_InitValue(&e->process, o->i, o->template_name, o->args, element_process_handler_event)) {
  240. ModuleLog(o->i, BLOG_ERROR, "NCDModuleProcess_Init failed");
  241. goto fail;
  242. }
  243. // set special functions
  244. NCDModuleProcess_SetSpecialFuncs(&e->process, element_process_func_getspecialobj);
  245. // set element state down
  246. e->state = ESTATE_DOWN;
  247. // increment GP and IP
  248. o->gp++;
  249. o->ip++;
  250. return;
  251. fail:
  252. // set timer
  253. BReactor_SetTimer(o->i->params->iparams->reactor, &o->timer);
  254. }
  255. static void timer_handler (struct instance *o)
  256. {
  257. assert_state(o);
  258. ASSERT(o->gp == o->ip)
  259. ASSERT(o->gp < o->num_elems)
  260. ASSERT(o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)
  261. ASSERT(o->elems[o->gp].state == ESTATE_FORGOTTEN)
  262. advance(o);
  263. return;
  264. }
  265. static void element_process_handler_event (NCDModuleProcess *process, int event)
  266. {
  267. struct element *e = UPPER_OBJECT(process, struct element, process);
  268. struct instance *o = e->inst;
  269. assert_state(o);
  270. ASSERT(e->i < o->ip)
  271. ASSERT(e->state != ESTATE_FORGOTTEN)
  272. switch (event) {
  273. case NCDMODULEPROCESS_EVENT_UP: {
  274. ASSERT(e->state == ESTATE_DOWN)
  275. ASSERT(o->gp == o->ip)
  276. ASSERT(o->gp == e->i + 1)
  277. // set element state up
  278. e->state = ESTATE_UP;
  279. } break;
  280. case NCDMODULEPROCESS_EVENT_DOWN: {
  281. ASSERT(e->state == ESTATE_UP)
  282. // set element state waiting
  283. e->state = ESTATE_WAITING;
  284. // bump down GP
  285. if (o->gp > e->i + 1) {
  286. o->gp = e->i + 1;
  287. }
  288. } break;
  289. case NCDMODULEPROCESS_EVENT_TERMINATED: {
  290. ASSERT(e->state == ESTATE_TERMINATING)
  291. ASSERT(o->gp < o->ip)
  292. ASSERT(o->ip == e->i + 1)
  293. // free process
  294. NCDModuleProcess_Free(&e->process);
  295. // set element state forgotten
  296. e->state = ESTATE_FORGOTTEN;
  297. // decrement IP
  298. o->ip--;
  299. } break;
  300. default: ASSERT(0);
  301. }
  302. work(o);
  303. return;
  304. }
  305. static int element_process_func_getspecialobj (NCDModuleProcess *process, NCD_string_id_t name, NCDObject *out_object)
  306. {
  307. struct element *e = UPPER_OBJECT(process, struct element, process);
  308. struct instance *o = e->inst;
  309. ASSERT(e->state != ESTATE_FORGOTTEN)
  310. switch (o->type) {
  311. case NCDVAL_LIST: {
  312. NCD_string_id_t index_name = (o->name2 >= 0 ? o->name1 : -1);
  313. NCD_string_id_t elem_name = (o->name2 >= 0 ? o->name2 : o->name1);
  314. if (index_name >= 0 && name == index_name) {
  315. *out_object = NCDObject_Build(-1, e, element_list_index_object_func_getvar, NCDObject_no_getobj);
  316. return 1;
  317. }
  318. if (name == elem_name) {
  319. *out_object = NCDObject_Build(-1, e, element_list_elem_object_func_getvar, NCDObject_no_getobj);
  320. return 1;
  321. }
  322. } break;
  323. case NCDVAL_MAP: {
  324. NCD_string_id_t key_name = o->name1;
  325. NCD_string_id_t val_name = o->name2;
  326. if (name == key_name) {
  327. *out_object = NCDObject_Build(-1, e, element_map_key_object_func_getvar, NCDObject_no_getobj);
  328. return 1;
  329. }
  330. if (val_name >= 0 && name == val_name) {
  331. *out_object = NCDObject_Build(-1, e, element_map_val_object_func_getvar, NCDObject_no_getobj);
  332. return 1;
  333. }
  334. } break;
  335. }
  336. if (NCDVal_IsInvalid(o->args)) {
  337. return NCDModuleInst_Backend_GetObj(o->i, name, out_object);
  338. }
  339. if (name == NCD_STRING_CALLER) {
  340. *out_object = NCDObject_Build(-1, e, NCDObject_no_getvar, element_caller_object_func_getobj);
  341. return 1;
  342. }
  343. return 0;
  344. }
  345. static int element_caller_object_func_getobj (const NCDObject *obj, NCD_string_id_t name, NCDObject *out_object)
  346. {
  347. struct element *e = NCDObject_DataPtr(obj);
  348. struct instance *o = e->inst;
  349. ASSERT(e->state != ESTATE_FORGOTTEN)
  350. ASSERT(!NCDVal_IsInvalid(o->args))
  351. return NCDModuleInst_Backend_GetObj(o->i, name, out_object);
  352. }
  353. static int element_list_index_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  354. {
  355. struct element *e = NCDObject_DataPtr(obj);
  356. struct instance *o = e->inst;
  357. B_USE(o)
  358. ASSERT(e->state != ESTATE_FORGOTTEN)
  359. ASSERT(o->type == NCDVAL_LIST)
  360. if (name != NCD_STRING_EMPTY) {
  361. return 0;
  362. }
  363. *out = ncd_make_uintmax(mem, e->i);
  364. return 1;
  365. }
  366. static int element_list_elem_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  367. {
  368. struct element *e = NCDObject_DataPtr(obj);
  369. struct instance *o = e->inst;
  370. B_USE(o)
  371. ASSERT(e->state != ESTATE_FORGOTTEN)
  372. ASSERT(o->type == NCDVAL_LIST)
  373. if (name != NCD_STRING_EMPTY) {
  374. return 0;
  375. }
  376. *out = NCDVal_NewCopy(mem, e->list_elem);
  377. return 1;
  378. }
  379. static int element_map_key_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  380. {
  381. struct element *e = NCDObject_DataPtr(obj);
  382. struct instance *o = e->inst;
  383. B_USE(o)
  384. ASSERT(e->state != ESTATE_FORGOTTEN)
  385. ASSERT(o->type == NCDVAL_MAP)
  386. if (name != NCD_STRING_EMPTY) {
  387. return 0;
  388. }
  389. *out = NCDVal_NewCopy(mem, e->map_key);
  390. return 1;
  391. }
  392. static int element_map_val_object_func_getvar (const NCDObject *obj, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  393. {
  394. struct element *e = NCDObject_DataPtr(obj);
  395. struct instance *o = e->inst;
  396. B_USE(o)
  397. ASSERT(e->state != ESTATE_FORGOTTEN)
  398. ASSERT(o->type == NCDVAL_MAP)
  399. if (name != NCD_STRING_EMPTY) {
  400. return 0;
  401. }
  402. *out = NCDVal_NewCopy(mem, e->map_val);
  403. return 1;
  404. }
  405. 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)
  406. {
  407. ASSERT(!NCDVal_IsInvalid(collection))
  408. ASSERT(NCDVal_IsString(template_name))
  409. ASSERT(NCDVal_IsInvalid(args) || NCDVal_IsList(args))
  410. ASSERT(name1 >= 0)
  411. struct instance *o = vo;
  412. o->i = i;
  413. o->type = NCDVal_Type(collection);
  414. o->template_name = template_name;
  415. o->args = args;
  416. o->name1 = name1;
  417. o->name2 = name2;
  418. // init timer
  419. btime_t retry_time = NCDModuleInst_Backend_InterpGetRetryTime(i);
  420. BTimer_Init(&o->timer, retry_time, (BTimer_handler)timer_handler, o);
  421. size_t num_elems;
  422. NCDValMapElem cur_map_elem;
  423. switch (o->type) {
  424. case NCDVAL_LIST: {
  425. num_elems = NCDVal_ListCount(collection);
  426. } break;
  427. case NCDVAL_MAP: {
  428. num_elems = NCDVal_MapCount(collection);
  429. cur_map_elem = NCDVal_MapOrderedFirst(collection);
  430. } break;
  431. default:
  432. ModuleLog(i, BLOG_ERROR, "invalid collection type");
  433. goto fail0;
  434. }
  435. if (num_elems > INT_MAX) {
  436. ModuleLog(i, BLOG_ERROR, "too many elements");
  437. goto fail0;
  438. }
  439. o->num_elems = num_elems;
  440. // allocate elements
  441. if (!(o->elems = BAllocArray(o->num_elems, sizeof(o->elems[0])))) {
  442. ModuleLog(i, BLOG_ERROR, "BAllocArray failed");
  443. goto fail0;
  444. }
  445. for (int j = 0; j < o->num_elems; j++) {
  446. struct element *e = &o->elems[j];
  447. // set instance
  448. e->inst = o;
  449. // set index
  450. e->i = j;
  451. // set state forgotten
  452. e->state = ESTATE_FORGOTTEN;
  453. // set values
  454. switch (o->type) {
  455. case NCDVAL_LIST: {
  456. e->list_elem = NCDVal_ListGet(collection, j);
  457. } break;
  458. case NCDVAL_MAP: {
  459. e->map_key = NCDVal_MapElemKey(collection, cur_map_elem);
  460. e->map_val = NCDVal_MapElemVal(collection, cur_map_elem);
  461. cur_map_elem = NCDVal_MapOrderedNext(collection, cur_map_elem);
  462. } break;
  463. }
  464. }
  465. // set GP and IP zero
  466. o->gp = 0;
  467. o->ip = 0;
  468. // set state working
  469. o->state = ISTATE_WORKING;
  470. work(o);
  471. return;
  472. fail0:
  473. NCDModuleInst_Backend_DeadError(i);
  474. }
  475. static void func_new_foreach (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  476. {
  477. // read arguments
  478. NCDValRef arg_collection;
  479. NCDValRef arg_template;
  480. NCDValRef arg_args;
  481. if (!NCDVal_ListRead(params->args, 3, &arg_collection, &arg_template, &arg_args)) {
  482. ModuleLog(i, BLOG_ERROR, "wrong arity");
  483. goto fail0;
  484. }
  485. if (!NCDVal_IsString(arg_template) || !NCDVal_IsList(arg_args)) {
  486. ModuleLog(i, BLOG_ERROR, "wrong type");
  487. goto fail0;
  488. }
  489. NCD_string_id_t name1;
  490. NCD_string_id_t name2;
  491. switch (NCDVal_Type(arg_collection)) {
  492. case NCDVAL_LIST: {
  493. name1 = ModuleString(i, STRING_INDEX);
  494. name2 = ModuleString(i, STRING_ELEM);
  495. } break;
  496. case NCDVAL_MAP: {
  497. name1 = ModuleString(i, STRING_KEY);
  498. name2 = ModuleString(i, STRING_VAL);
  499. } break;
  500. default:
  501. ModuleLog(i, BLOG_ERROR, "invalid collection type");
  502. goto fail0;
  503. }
  504. func_new_common(vo, i, arg_collection, arg_template, arg_args, name1, name2);
  505. return;
  506. fail0:
  507. NCDModuleInst_Backend_DeadError(i);
  508. }
  509. static void func_new_foreach_emb (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  510. {
  511. // read arguments
  512. NCDValRef arg_collection;
  513. NCDValRef arg_template;
  514. NCDValRef arg_name1;
  515. NCDValRef arg_name2 = NCDVal_NewInvalid();
  516. 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)) {
  517. ModuleLog(i, BLOG_ERROR, "wrong arity");
  518. goto fail0;
  519. }
  520. if (!NCDVal_IsString(arg_template) || !NCDVal_IsString(arg_name1) || (!NCDVal_IsInvalid(arg_name2) && !NCDVal_IsString(arg_name2))) {
  521. ModuleLog(i, BLOG_ERROR, "wrong type");
  522. goto fail0;
  523. }
  524. NCD_string_id_t name1 = ncd_get_string_id(arg_name1, i->params->iparams->string_index);
  525. if (name1 < 0) {
  526. ModuleLog(i, BLOG_ERROR, "ncd_get_string_id failed");
  527. goto fail0;
  528. }
  529. NCD_string_id_t name2 = -1;
  530. if (!NCDVal_IsInvalid(arg_name2)) {
  531. name2 = ncd_get_string_id(arg_name2, i->params->iparams->string_index);
  532. if (name2 < 0) {
  533. ModuleLog(i, BLOG_ERROR, "ncd_get_string_id failed");
  534. goto fail0;
  535. }
  536. }
  537. func_new_common(vo, i, arg_collection, arg_template, NCDVal_NewInvalid(), name1, name2);
  538. return;
  539. fail0:
  540. NCDModuleInst_Backend_DeadError(i);
  541. }
  542. static void instance_free (struct instance *o)
  543. {
  544. ASSERT(o->gp == 0)
  545. ASSERT(o->ip == 0)
  546. // free elements
  547. BFree(o->elems);
  548. // free timer
  549. BReactor_RemoveTimer(o->i->params->iparams->reactor, &o->timer);
  550. NCDModuleInst_Backend_Dead(o->i);
  551. }
  552. static void func_die (void *vo)
  553. {
  554. struct instance *o = vo;
  555. assert_state(o);
  556. ASSERT(o->state != ISTATE_TERMINATING)
  557. // set GP zero
  558. o->gp = 0;
  559. // set state terminating
  560. o->state = ISTATE_TERMINATING;
  561. work(o);
  562. return;
  563. }
  564. static void func_clean (void *vo)
  565. {
  566. struct instance *o = vo;
  567. if (o->state != ISTATE_WAITING) {
  568. return;
  569. }
  570. // set state working
  571. o->state = ISTATE_WORKING;
  572. work(o);
  573. return;
  574. }
  575. static struct NCDModule modules[] = {
  576. {
  577. .type = "foreach",
  578. .func_new2 = func_new_foreach,
  579. .func_die = func_die,
  580. .func_clean = func_clean,
  581. .alloc_size = sizeof(struct instance)
  582. }, {
  583. .type = "foreach_emb",
  584. .func_new2 = func_new_foreach_emb,
  585. .func_die = func_die,
  586. .func_clean = func_clean,
  587. .alloc_size = sizeof(struct instance)
  588. }, {
  589. .type = NULL
  590. }
  591. };
  592. const struct NCDModuleGroup ncdmodule_foreach = {
  593. .modules = modules,
  594. .strings = strings
  595. };