foreach.c 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717
  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 <system/BReactor.h>
  73. #include <ncd/NCDModule.h>
  74. #include <ncd/static_strings.h>
  75. #include <ncd/value_utils.h>
  76. #include <generated/blog_channel_ncd_foreach.h>
  77. #define ModuleLog(i, ...) NCDModuleInst_Backend_Log((i), BLOG_CURRENT_CHANNEL, __VA_ARGS__)
  78. #define ISTATE_WORKING 1
  79. #define ISTATE_UP 2
  80. #define ISTATE_WAITING 3
  81. #define ISTATE_TERMINATING 4
  82. #define ESTATE_FORGOTTEN 1
  83. #define ESTATE_DOWN 2
  84. #define ESTATE_UP 3
  85. #define ESTATE_WAITING 4
  86. #define ESTATE_TERMINATING 5
  87. struct element;
  88. struct instance {
  89. NCDModuleInst *i;
  90. NCDValRef template_name;
  91. NCDValRef args;
  92. NCD_string_id_t name1;
  93. NCD_string_id_t name2;
  94. BTimer timer;
  95. struct element *elems;
  96. int type;
  97. int num_elems;
  98. int gp; // good pointer
  99. int ip; // initialized pointer
  100. int state;
  101. };
  102. struct element {
  103. struct instance *inst;
  104. union {
  105. struct {
  106. NCDValRef list_elem;
  107. };
  108. struct {
  109. NCDValRef map_key;
  110. NCDValRef map_val;
  111. };
  112. };
  113. NCDModuleProcess process;
  114. int i;
  115. int state;
  116. };
  117. static void assert_state (struct instance *o);
  118. static void work (struct instance *o);
  119. static void advance (struct instance *o);
  120. static void timer_handler (struct instance *o);
  121. static void element_process_handler_event (struct element *e, int event);
  122. static int element_process_func_getspecialobj (struct element *e, NCD_string_id_t name, NCDObject *out_object);
  123. static int element_caller_object_func_getobj (struct element *e, NCD_string_id_t name, NCDObject *out_object);
  124. static int element_list_index_object_func_getvar (struct element *e, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  125. static int element_list_elem_object_func_getvar (struct element *e, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  126. static int element_map_key_object_func_getvar (struct element *e, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  127. static int element_map_val_object_func_getvar (struct element *e, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out);
  128. static void instance_free (struct instance *o);
  129. enum {STRING_CALLER, STRING_INDEX, STRING_ELEM, STRING_KEY, STRING_VAL};
  130. static struct NCD_string_request strings[] = {
  131. {"_caller"}, {"_index"}, {"_elem"}, {"_key"}, {"_val"}, {NULL}
  132. };
  133. static void assert_state (struct instance *o)
  134. {
  135. ASSERT(o->num_elems >= 0)
  136. ASSERT(o->gp >= 0)
  137. ASSERT(o->ip >= 0)
  138. ASSERT(o->gp <= o->num_elems)
  139. ASSERT(o->ip <= o->num_elems)
  140. ASSERT(o->gp <= o->ip)
  141. #ifndef NDEBUG
  142. // check GP
  143. for (int i = 0; i < o->gp; i++) {
  144. if (i == o->gp - 1) {
  145. ASSERT(o->elems[i].state == ESTATE_UP || o->elems[i].state == ESTATE_DOWN ||
  146. o->elems[i].state == ESTATE_WAITING)
  147. } else {
  148. ASSERT(o->elems[i].state == ESTATE_UP)
  149. }
  150. }
  151. // check IP
  152. int ip = o->num_elems;
  153. while (ip > 0 && o->elems[ip - 1].state == ESTATE_FORGOTTEN) {
  154. ip--;
  155. }
  156. ASSERT(o->ip == ip)
  157. // check gap
  158. for (int i = o->gp; i < o->ip; i++) {
  159. if (i == o->ip - 1) {
  160. ASSERT(o->elems[i].state == ESTATE_UP || o->elems[i].state == ESTATE_DOWN ||
  161. o->elems[i].state == ESTATE_WAITING || o->elems[i].state == ESTATE_TERMINATING)
  162. } else {
  163. ASSERT(o->elems[i].state == ESTATE_UP || o->elems[i].state == ESTATE_DOWN ||
  164. o->elems[i].state == ESTATE_WAITING)
  165. }
  166. }
  167. #endif
  168. }
  169. static void work (struct instance *o)
  170. {
  171. assert_state(o);
  172. // stop timer
  173. BReactor_RemoveTimer(o->i->params->iparams->reactor, &o->timer);
  174. if (o->state == ISTATE_WAITING) {
  175. return;
  176. }
  177. 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))) {
  178. // signal down
  179. NCDModuleInst_Backend_Down(o->i);
  180. // set state waiting
  181. o->state = ISTATE_WAITING;
  182. return;
  183. }
  184. if (o->gp < o->ip) {
  185. // get last element
  186. struct element *le = &o->elems[o->ip - 1];
  187. ASSERT(le->state != ESTATE_FORGOTTEN)
  188. // start terminating if not already
  189. if (le->state != ESTATE_TERMINATING) {
  190. // request termination
  191. NCDModuleProcess_Terminate(&le->process);
  192. // set element state terminating
  193. le->state = ESTATE_TERMINATING;
  194. }
  195. return;
  196. }
  197. if (o->state == ISTATE_TERMINATING) {
  198. // finally die
  199. instance_free(o);
  200. return;
  201. }
  202. if (o->gp == o->num_elems && (o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)) {
  203. if (o->state == ISTATE_WORKING) {
  204. // signal up
  205. NCDModuleInst_Backend_Up(o->i);
  206. // set state up
  207. o->state = ISTATE_UP;
  208. }
  209. return;
  210. }
  211. if (o->gp > 0 && o->elems[o->gp - 1].state == ESTATE_WAITING) {
  212. // get last element
  213. struct element *le = &o->elems[o->gp - 1];
  214. // continue process
  215. NCDModuleProcess_Continue(&le->process);
  216. // set state down
  217. le->state = ESTATE_DOWN;
  218. return;
  219. }
  220. if (o->gp > 0 && o->elems[o->gp - 1].state == ESTATE_DOWN) {
  221. return;
  222. }
  223. ASSERT(o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)
  224. advance(o);
  225. return;
  226. }
  227. static void advance (struct instance *o)
  228. {
  229. assert_state(o);
  230. ASSERT(o->gp == o->ip)
  231. ASSERT(o->gp < o->num_elems)
  232. ASSERT(o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)
  233. ASSERT(o->elems[o->gp].state == ESTATE_FORGOTTEN)
  234. // get next element
  235. struct element *e = &o->elems[o->gp];
  236. // init process
  237. if (!NCDModuleProcess_InitValue(&e->process, o->i, o->template_name, o->args, e, (NCDModuleProcess_handler_event)element_process_handler_event)) {
  238. ModuleLog(o->i, BLOG_ERROR, "NCDModuleProcess_Init failed");
  239. goto fail;
  240. }
  241. // set special functions
  242. NCDModuleProcess_SetSpecialFuncs(&e->process, (NCDModuleProcess_func_getspecialobj)element_process_func_getspecialobj);
  243. // set element state down
  244. e->state = ESTATE_DOWN;
  245. // increment GP and IP
  246. o->gp++;
  247. o->ip++;
  248. return;
  249. fail:
  250. // set timer
  251. BReactor_SetTimer(o->i->params->iparams->reactor, &o->timer);
  252. }
  253. static void timer_handler (struct instance *o)
  254. {
  255. assert_state(o);
  256. ASSERT(o->gp == o->ip)
  257. ASSERT(o->gp < o->num_elems)
  258. ASSERT(o->gp == 0 || o->elems[o->gp - 1].state == ESTATE_UP)
  259. ASSERT(o->elems[o->gp].state == ESTATE_FORGOTTEN)
  260. advance(o);
  261. return;
  262. }
  263. static void element_process_handler_event (struct element *e, int event)
  264. {
  265. struct instance *o = e->inst;
  266. assert_state(o);
  267. ASSERT(e->i < o->ip)
  268. ASSERT(e->state != ESTATE_FORGOTTEN)
  269. switch (event) {
  270. case NCDMODULEPROCESS_EVENT_UP: {
  271. ASSERT(e->state == ESTATE_DOWN)
  272. ASSERT(o->gp == o->ip)
  273. ASSERT(o->gp == e->i + 1)
  274. // set element state up
  275. e->state = ESTATE_UP;
  276. } break;
  277. case NCDMODULEPROCESS_EVENT_DOWN: {
  278. ASSERT(e->state == ESTATE_UP)
  279. // set element state waiting
  280. e->state = ESTATE_WAITING;
  281. // bump down GP
  282. if (o->gp > e->i + 1) {
  283. o->gp = e->i + 1;
  284. }
  285. } break;
  286. case NCDMODULEPROCESS_EVENT_TERMINATED: {
  287. ASSERT(e->state == ESTATE_TERMINATING)
  288. ASSERT(o->gp < o->ip)
  289. ASSERT(o->ip == e->i + 1)
  290. // free process
  291. NCDModuleProcess_Free(&e->process);
  292. // set element state forgotten
  293. e->state = ESTATE_FORGOTTEN;
  294. // decrement IP
  295. o->ip--;
  296. } break;
  297. default: ASSERT(0);
  298. }
  299. work(o);
  300. return;
  301. }
  302. static int element_process_func_getspecialobj (struct element *e, NCD_string_id_t name, NCDObject *out_object)
  303. {
  304. struct instance *o = e->inst;
  305. ASSERT(e->state != ESTATE_FORGOTTEN)
  306. switch (o->type) {
  307. case NCDVAL_LIST: {
  308. NCD_string_id_t index_name = (o->name2 >= 0 ? o->name1 : -1);
  309. NCD_string_id_t elem_name = (o->name2 >= 0 ? o->name2 : o->name1);
  310. if (index_name >= 0 && name == index_name) {
  311. *out_object = NCDObject_Build(-1, e, (NCDObject_func_getvar)element_list_index_object_func_getvar, NULL);
  312. return 1;
  313. }
  314. if (name == elem_name) {
  315. *out_object = NCDObject_Build(-1, e, (NCDObject_func_getvar)element_list_elem_object_func_getvar, NULL);
  316. return 1;
  317. }
  318. } break;
  319. case NCDVAL_MAP: {
  320. NCD_string_id_t key_name = o->name1;
  321. NCD_string_id_t val_name = o->name2;
  322. if (name == key_name) {
  323. *out_object = NCDObject_Build(-1, e, (NCDObject_func_getvar)element_map_key_object_func_getvar, NULL);
  324. return 1;
  325. }
  326. if (val_name >= 0 && name == val_name) {
  327. *out_object = NCDObject_Build(-1, e, (NCDObject_func_getvar)element_map_val_object_func_getvar, NULL);
  328. return 1;
  329. }
  330. } break;
  331. }
  332. if (NCDVal_IsInvalid(o->args)) {
  333. return NCDModuleInst_Backend_GetObj(o->i, name, out_object);
  334. }
  335. if (name == strings[STRING_CALLER].id) {
  336. *out_object = NCDObject_Build(-1, e, NULL, (NCDObject_func_getobj)element_caller_object_func_getobj);
  337. return 1;
  338. }
  339. return 0;
  340. }
  341. static int element_caller_object_func_getobj (struct element *e, NCD_string_id_t name, NCDObject *out_object)
  342. {
  343. struct instance *o = e->inst;
  344. ASSERT(e->state != ESTATE_FORGOTTEN)
  345. ASSERT(!NCDVal_IsInvalid(o->args))
  346. return NCDModuleInst_Backend_GetObj(o->i, name, out_object);
  347. }
  348. static int element_list_index_object_func_getvar (struct element *e, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  349. {
  350. struct instance *o = e->inst;
  351. ASSERT(e->state != ESTATE_FORGOTTEN)
  352. ASSERT(o->type == NCDVAL_LIST)
  353. if (name != NCD_STRING_EMPTY) {
  354. return 0;
  355. }
  356. *out = ncd_make_uintmax(mem, e->i);
  357. if (NCDVal_IsInvalid(*out)) {
  358. ModuleLog(o->i, BLOG_ERROR, "ncd_make_uintmax failed");
  359. }
  360. return 1;
  361. }
  362. static int element_list_elem_object_func_getvar (struct element *e, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  363. {
  364. struct instance *o = e->inst;
  365. ASSERT(e->state != ESTATE_FORGOTTEN)
  366. ASSERT(o->type == NCDVAL_LIST)
  367. if (name != NCD_STRING_EMPTY) {
  368. return 0;
  369. }
  370. *out = NCDVal_NewCopy(mem, e->list_elem);
  371. if (NCDVal_IsInvalid(*out)) {
  372. ModuleLog(o->i, BLOG_ERROR, "NCDVal_NewCopy failed");
  373. }
  374. return 1;
  375. }
  376. static int element_map_key_object_func_getvar (struct element *e, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  377. {
  378. struct instance *o = e->inst;
  379. ASSERT(e->state != ESTATE_FORGOTTEN)
  380. ASSERT(o->type == NCDVAL_MAP)
  381. if (name != NCD_STRING_EMPTY) {
  382. return 0;
  383. }
  384. *out = NCDVal_NewCopy(mem, e->map_key);
  385. if (NCDVal_IsInvalid(*out)) {
  386. ModuleLog(o->i, BLOG_ERROR, "NCDVal_NewCopy failed");
  387. }
  388. return 1;
  389. }
  390. static int element_map_val_object_func_getvar (struct element *e, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  391. {
  392. struct instance *o = e->inst;
  393. ASSERT(e->state != ESTATE_FORGOTTEN)
  394. ASSERT(o->type == NCDVAL_MAP)
  395. if (name != NCD_STRING_EMPTY) {
  396. return 0;
  397. }
  398. *out = NCDVal_NewCopy(mem, e->map_val);
  399. if (NCDVal_IsInvalid(*out)) {
  400. ModuleLog(o->i, BLOG_ERROR, "NCDVal_NewCopy failed");
  401. }
  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_SetError(i);
  473. NCDModuleInst_Backend_Dead(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 = strings[STRING_INDEX].id;
  494. name2 = strings[STRING_ELEM].id;
  495. } break;
  496. case NCDVAL_MAP: {
  497. name1 = strings[STRING_KEY].id;
  498. name2 = strings[STRING_VAL].id;
  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_SetError(i);
  508. NCDModuleInst_Backend_Dead(i);
  509. }
  510. static void func_new_foreach_emb (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  511. {
  512. // read arguments
  513. NCDValRef arg_collection;
  514. NCDValRef arg_template;
  515. NCDValRef arg_name1;
  516. NCDValRef arg_name2 = NCDVal_NewInvalid();
  517. 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)) {
  518. ModuleLog(i, BLOG_ERROR, "wrong arity");
  519. goto fail0;
  520. }
  521. if (!NCDVal_IsString(arg_template) || !NCDVal_IsString(arg_name1) || (!NCDVal_IsInvalid(arg_name2) && !NCDVal_IsString(arg_name2))) {
  522. ModuleLog(i, BLOG_ERROR, "wrong type");
  523. goto fail0;
  524. }
  525. NCD_string_id_t name1 = ncd_get_string_id(arg_name1, i->params->iparams->string_index);
  526. if (name1 < 0) {
  527. ModuleLog(i, BLOG_ERROR, "ncd_get_string_id failed");
  528. goto fail0;
  529. }
  530. NCD_string_id_t name2 = -1;
  531. if (!NCDVal_IsInvalid(arg_name2)) {
  532. name2 = ncd_get_string_id(arg_name2, i->params->iparams->string_index);
  533. if (name2 < 0) {
  534. ModuleLog(i, BLOG_ERROR, "ncd_get_string_id failed");
  535. goto fail0;
  536. }
  537. }
  538. func_new_common(vo, i, arg_collection, arg_template, NCDVal_NewInvalid(), name1, name2);
  539. return;
  540. fail0:
  541. NCDModuleInst_Backend_SetError(i);
  542. NCDModuleInst_Backend_Dead(i);
  543. }
  544. static void instance_free (struct instance *o)
  545. {
  546. ASSERT(o->gp == 0)
  547. ASSERT(o->ip == 0)
  548. // free elements
  549. BFree(o->elems);
  550. // free timer
  551. BReactor_RemoveTimer(o->i->params->iparams->reactor, &o->timer);
  552. NCDModuleInst_Backend_Dead(o->i);
  553. }
  554. static void func_die (void *vo)
  555. {
  556. struct instance *o = vo;
  557. assert_state(o);
  558. ASSERT(o->state != ISTATE_TERMINATING)
  559. // set GP zero
  560. o->gp = 0;
  561. // set state terminating
  562. o->state = ISTATE_TERMINATING;
  563. work(o);
  564. return;
  565. }
  566. static void func_clean (void *vo)
  567. {
  568. struct instance *o = vo;
  569. if (o->state != ISTATE_WAITING) {
  570. return;
  571. }
  572. // set state working
  573. o->state = ISTATE_WORKING;
  574. work(o);
  575. return;
  576. }
  577. static struct NCDModule modules[] = {
  578. {
  579. .type = "foreach",
  580. .func_new2 = func_new_foreach,
  581. .func_die = func_die,
  582. .func_clean = func_clean,
  583. .alloc_size = sizeof(struct instance)
  584. }, {
  585. .type = "foreach_emb",
  586. .func_new2 = func_new_foreach_emb,
  587. .func_die = func_die,
  588. .func_clean = func_clean,
  589. .alloc_size = sizeof(struct instance)
  590. }, {
  591. .type = NULL
  592. }
  593. };
  594. const struct NCDModuleGroup ncdmodule_foreach = {
  595. .modules = modules,
  596. .strings = strings
  597. };