list.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906
  1. /**
  2. * @file list.c
  3. * @author Ambroz Bizjak <[email protected]>
  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. * List construction module.
  32. *
  33. * Synopsis:
  34. * list(elem1, ..., elemN)
  35. * list listfrom(list l1, ..., list lN)
  36. *
  37. * Description:
  38. * The first form creates a list with the given elements.
  39. * The second form creates a list by concatenating the given
  40. * lists.
  41. *
  42. * Variables:
  43. * (empty) - list containing elem1, ..., elemN
  44. * length - number of elements in list
  45. *
  46. * Synopsis: list::append(arg)
  47. *
  48. * Synopsis: list::appendv(list arg)
  49. * Description: Appends the elements of arg to the list.
  50. *
  51. * Synopsis: list::length()
  52. * Variables:
  53. * (empty) - number of elements in list at the time of initialization
  54. * of this method
  55. *
  56. * Synopsis: list::get(string index)
  57. * Variables:
  58. * (empty) - element of list at position index (starting from zero) at the time of initialization
  59. *
  60. * Synopsis: list::shift()
  61. *
  62. * Synopsis: list::contains(value)
  63. * Variables:
  64. * (empty) - "true" if list contains value, "false" if not
  65. *
  66. * Synopsis:
  67. * list::find(start_pos, value)
  68. * Description:
  69. * finds the first occurrence of 'value' in the list at position >='start_pos'.
  70. * Variables:
  71. * pos - position of element, or "none" if not found
  72. * found - "true" if found, "false" if not
  73. *
  74. * Sysnopsis:
  75. * list::remove_at(remove_pos)
  76. * Description:
  77. * Removes the element at position 'remove_pos', which must refer to an existing element.
  78. *
  79. * Synopsis:
  80. * list::remove(value)
  81. * Description:
  82. * Removes the first occurrence of value in the list, which must be in the list.
  83. *
  84. * Synopsis:
  85. * list::set(list l1, ..., list lN)
  86. * Description:
  87. * Replaces the list with the concatenation of given lists.
  88. */
  89. #include <stdlib.h>
  90. #include <string.h>
  91. #include <stdio.h>
  92. #include <inttypes.h>
  93. #include <misc/offset.h>
  94. #include <misc/parse_number.h>
  95. #include <structure/IndexedList.h>
  96. #include <ncd/NCDModule.h>
  97. #include <ncd/extra/value_utils.h>
  98. #include <generated/blog_channel_ncd_list.h>
  99. #define ModuleLog(i, ...) NCDModuleInst_Backend_Log((i), BLOG_CURRENT_CHANNEL, __VA_ARGS__)
  100. struct elem {
  101. IndexedListNode il_node;
  102. NCDValMem mem;
  103. NCDValRef val;
  104. };
  105. struct instance {
  106. NCDModuleInst *i;
  107. IndexedList il;
  108. };
  109. struct length_instance {
  110. NCDModuleInst *i;
  111. uint64_t length;
  112. };
  113. struct get_instance {
  114. NCDModuleInst *i;
  115. NCDValMem mem;
  116. NCDValRef val;
  117. };
  118. struct contains_instance {
  119. NCDModuleInst *i;
  120. int contains;
  121. };
  122. struct find_instance {
  123. NCDModuleInst *i;
  124. int is_found;
  125. uint64_t found_pos;
  126. };
  127. static uint64_t list_count (struct instance *o)
  128. {
  129. return IndexedList_Count(&o->il);
  130. }
  131. static struct elem * insert_value (NCDModuleInst *i, struct instance *o, NCDValRef val, uint64_t idx)
  132. {
  133. ASSERT(idx <= list_count(o))
  134. ASSERT(!NCDVal_IsInvalid(val))
  135. struct elem *e = malloc(sizeof(*e));
  136. if (!e) {
  137. ModuleLog(i, BLOG_ERROR, "malloc failed");
  138. goto fail0;
  139. }
  140. NCDValMem_Init(&e->mem);
  141. e->val = NCDVal_NewCopy(&e->mem, val);
  142. if (NCDVal_IsInvalid(e->val)) {
  143. ModuleLog(i, BLOG_ERROR, "NCDVal_NewCopy failed");
  144. goto fail1;
  145. }
  146. IndexedList_InsertAt(&o->il, &e->il_node, idx);
  147. return e;
  148. fail1:
  149. NCDValMem_Free(&e->mem);
  150. free(e);
  151. fail0:
  152. return NULL;
  153. }
  154. static void remove_elem (struct instance *o, struct elem *e)
  155. {
  156. IndexedList_Remove(&o->il, &e->il_node);
  157. NCDValMem_Free(&e->mem);
  158. free(e);
  159. }
  160. static struct elem * get_elem_at (struct instance *o, uint64_t idx)
  161. {
  162. ASSERT(idx < list_count(o))
  163. IndexedListNode *iln = IndexedList_GetAt(&o->il, idx);
  164. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  165. return e;
  166. }
  167. static struct elem * get_first_elem (struct instance *o)
  168. {
  169. ASSERT(list_count(o) > 0)
  170. IndexedListNode *iln = IndexedList_GetFirst(&o->il);
  171. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  172. return e;
  173. }
  174. static struct elem * get_last_elem (struct instance *o)
  175. {
  176. ASSERT(list_count(o) > 0)
  177. IndexedListNode *iln = IndexedList_GetLast(&o->il);
  178. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  179. return e;
  180. }
  181. static void cut_list_front (struct instance *o, uint64_t count)
  182. {
  183. while (list_count(o) > count) {
  184. remove_elem(o, get_first_elem(o));
  185. }
  186. }
  187. static void cut_list_back (struct instance *o, uint64_t count)
  188. {
  189. while (list_count(o) > count) {
  190. remove_elem(o, get_last_elem(o));
  191. }
  192. }
  193. static int append_list_contents (NCDModuleInst *i, struct instance *o, NCDValRef args)
  194. {
  195. ASSERT(NCDVal_IsList(args))
  196. uint64_t orig_count = list_count(o);
  197. size_t append_count = NCDVal_ListCount(args);
  198. for (size_t j = 0; j < append_count; j++) {
  199. NCDValRef elem = NCDVal_ListGet(args, j);
  200. if (!insert_value(i, o, elem, list_count(o))) {
  201. goto fail;
  202. }
  203. }
  204. return 1;
  205. fail:
  206. cut_list_back(o, orig_count);
  207. return 0;
  208. }
  209. static int append_list_contents_contents (NCDModuleInst *i, struct instance *o, NCDValRef args)
  210. {
  211. ASSERT(NCDVal_IsList(args))
  212. uint64_t orig_count = list_count(o);
  213. size_t append_count = NCDVal_ListCount(args);
  214. for (size_t j = 0; j < append_count; j++) {
  215. NCDValRef elem = NCDVal_ListGet(args, j);
  216. if (!NCDVal_IsList(elem)) {
  217. ModuleLog(i, BLOG_ERROR, "wrong type");
  218. goto fail;
  219. }
  220. if (!append_list_contents(i, o, elem)) {
  221. goto fail;
  222. }
  223. }
  224. return 1;
  225. fail:
  226. cut_list_back(o, orig_count);
  227. return 0;
  228. }
  229. static struct elem * find_elem (struct instance *o, NCDValRef val, uint64_t start_idx, uint64_t *out_idx)
  230. {
  231. if (start_idx >= list_count(o)) {
  232. return NULL;
  233. }
  234. for (IndexedListNode *iln = IndexedList_GetAt(&o->il, start_idx); iln; iln = IndexedList_GetNext(&o->il, iln)) {
  235. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  236. if (NCDVal_Compare(e->val, val) == 0) {
  237. if (out_idx) {
  238. *out_idx = start_idx;
  239. }
  240. return e;
  241. }
  242. start_idx++;
  243. }
  244. return NULL;
  245. }
  246. static int list_to_value (NCDModuleInst *i, struct instance *o, NCDValMem *mem, NCDValRef *out_val)
  247. {
  248. *out_val = NCDVal_NewList(mem, IndexedList_Count(&o->il));
  249. if (NCDVal_IsInvalid(*out_val)) {
  250. ModuleLog(i, BLOG_ERROR, "NCDVal_NewList failed");
  251. goto fail;
  252. }
  253. for (IndexedListNode *iln = IndexedList_GetFirst(&o->il); iln; iln = IndexedList_GetNext(&o->il, iln)) {
  254. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  255. NCDValRef copy = NCDVal_NewCopy(mem, e->val);
  256. if (NCDVal_IsInvalid(copy)) {
  257. ModuleLog(i, BLOG_ERROR, "NCDVal_NewCopy failed");
  258. goto fail;
  259. }
  260. if (!NCDVal_ListAppend(*out_val, copy)) {
  261. ModuleLog(i, BLOG_ERROR, "depth limit exceeded");
  262. goto fail;
  263. }
  264. }
  265. return 1;
  266. fail:
  267. return 0;
  268. }
  269. static void func_new_list (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  270. {
  271. struct instance *o = vo;
  272. o->i = i;
  273. // init list
  274. IndexedList_Init(&o->il);
  275. // append contents
  276. if (!append_list_contents(i, o, params->args)) {
  277. goto fail1;
  278. }
  279. // signal up
  280. NCDModuleInst_Backend_Up(o->i);
  281. return;
  282. fail1:
  283. cut_list_front(o, 0);
  284. NCDModuleInst_Backend_SetError(i);
  285. NCDModuleInst_Backend_Dead(i);
  286. }
  287. static void func_new_listfrom (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  288. {
  289. struct instance *o = vo;
  290. o->i = i;
  291. // init list
  292. IndexedList_Init(&o->il);
  293. // append contents contents
  294. if (!append_list_contents_contents(i, o, params->args)) {
  295. goto fail1;
  296. }
  297. // signal up
  298. NCDModuleInst_Backend_Up(o->i);
  299. return;
  300. fail1:
  301. cut_list_front(o, 0);
  302. NCDModuleInst_Backend_SetError(i);
  303. NCDModuleInst_Backend_Dead(i);
  304. }
  305. static void func_die (void *vo)
  306. {
  307. struct instance *o = vo;
  308. // free list elements
  309. cut_list_front(o, 0);
  310. NCDModuleInst_Backend_Dead(o->i);
  311. }
  312. static int func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  313. {
  314. struct instance *o = vo;
  315. if (!strcmp(name, "")) {
  316. if (!list_to_value(o->i, o, mem, out)) {
  317. return 0;
  318. }
  319. return 1;
  320. }
  321. if (!strcmp(name, "length")) {
  322. *out = ncd_make_uintmax(mem, list_count(o));
  323. if (NCDVal_IsInvalid(*out)) {
  324. ModuleLog(o->i, BLOG_ERROR, "ncd_make_uintmax failed");
  325. }
  326. return 1;
  327. }
  328. return 0;
  329. }
  330. static void append_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  331. {
  332. // check arguments
  333. NCDValRef arg;
  334. if (!NCDVal_ListRead(params->args, 1, &arg)) {
  335. ModuleLog(i, BLOG_ERROR, "wrong arity");
  336. goto fail0;
  337. }
  338. // get method object
  339. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  340. // append
  341. if (!insert_value(i, mo, arg, list_count(mo))) {
  342. goto fail0;
  343. }
  344. // signal up
  345. NCDModuleInst_Backend_Up(i);
  346. return;
  347. fail0:
  348. NCDModuleInst_Backend_SetError(i);
  349. NCDModuleInst_Backend_Dead(i);
  350. }
  351. static void appendv_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  352. {
  353. // check arguments
  354. NCDValRef arg;
  355. if (!NCDVal_ListRead(params->args, 1, &arg)) {
  356. ModuleLog(i, BLOG_ERROR, "wrong arity");
  357. goto fail0;
  358. }
  359. if (!NCDVal_IsList(arg)) {
  360. ModuleLog(i, BLOG_ERROR, "wrong type");
  361. goto fail0;
  362. }
  363. // get method object
  364. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  365. // append
  366. if (!append_list_contents(i, mo, arg)) {
  367. goto fail0;
  368. }
  369. // signal up
  370. NCDModuleInst_Backend_Up(i);
  371. return;
  372. fail0:
  373. NCDModuleInst_Backend_SetError(i);
  374. NCDModuleInst_Backend_Dead(i);
  375. }
  376. static void length_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  377. {
  378. struct length_instance *o = vo;
  379. o->i = i;
  380. // check arguments
  381. if (!NCDVal_ListRead(params->args, 0)) {
  382. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  383. goto fail0;
  384. }
  385. // get method object
  386. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  387. // remember length
  388. o->length = list_count(mo);
  389. // signal up
  390. NCDModuleInst_Backend_Up(o->i);
  391. return;
  392. fail0:
  393. NCDModuleInst_Backend_SetError(i);
  394. NCDModuleInst_Backend_Dead(i);
  395. }
  396. static void length_func_die (void *vo)
  397. {
  398. struct length_instance *o = vo;
  399. NCDModuleInst_Backend_Dead(o->i);
  400. }
  401. static int length_func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  402. {
  403. struct length_instance *o = vo;
  404. if (!strcmp(name, "")) {
  405. *out = ncd_make_uintmax(mem, o->length);
  406. if (NCDVal_IsInvalid(*out)) {
  407. ModuleLog(o->i, BLOG_ERROR, "ncd_make_uintmax failed");
  408. }
  409. return 1;
  410. }
  411. return 0;
  412. }
  413. static void get_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  414. {
  415. struct get_instance *o = vo;
  416. o->i = i;
  417. // check arguments
  418. NCDValRef index_arg;
  419. if (!NCDVal_ListRead(params->args, 1, &index_arg)) {
  420. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  421. goto fail0;
  422. }
  423. if (!NCDVal_IsString(index_arg)) {
  424. ModuleLog(o->i, BLOG_ERROR, "wrong type");
  425. goto fail0;
  426. }
  427. uintmax_t index;
  428. if (!ncd_read_uintmax(index_arg, &index)) {
  429. ModuleLog(o->i, BLOG_ERROR, "wrong value");
  430. goto fail0;
  431. }
  432. // get method object
  433. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  434. // check index
  435. if (index >= list_count(mo)) {
  436. ModuleLog(o->i, BLOG_ERROR, "no element at index %"PRIuMAX, index);
  437. goto fail0;
  438. }
  439. // get element
  440. struct elem *e = get_elem_at(mo, index);
  441. // init mem
  442. NCDValMem_Init(&o->mem);
  443. // copy value
  444. o->val = NCDVal_NewCopy(&o->mem, e->val);
  445. if (NCDVal_IsInvalid(o->val)) {
  446. ModuleLog(o->i, BLOG_ERROR, "NCDVal_NewCopy failed");
  447. goto fail1;
  448. }
  449. // signal up
  450. NCDModuleInst_Backend_Up(o->i);
  451. return;
  452. fail1:
  453. NCDValMem_Free(&o->mem);
  454. fail0:
  455. NCDModuleInst_Backend_SetError(i);
  456. NCDModuleInst_Backend_Dead(i);
  457. }
  458. static void get_func_die (void *vo)
  459. {
  460. struct get_instance *o = vo;
  461. // free mem
  462. NCDValMem_Free(&o->mem);
  463. NCDModuleInst_Backend_Dead(o->i);
  464. }
  465. static int get_func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  466. {
  467. struct get_instance *o = vo;
  468. if (!strcmp(name, "")) {
  469. *out = NCDVal_NewCopy(mem, o->val);
  470. if (NCDVal_IsInvalid(*out)) {
  471. ModuleLog(o->i, BLOG_ERROR, "NCDVal_NewCopy failed");
  472. }
  473. return 1;
  474. }
  475. return 0;
  476. }
  477. static void shift_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  478. {
  479. // check arguments
  480. if (!NCDVal_ListRead(params->args, 0)) {
  481. ModuleLog(i, BLOG_ERROR, "wrong arity");
  482. goto fail0;
  483. }
  484. // get method object
  485. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  486. // check first
  487. if (list_count(mo) == 0) {
  488. ModuleLog(i, BLOG_ERROR, "list has no elements");
  489. goto fail0;
  490. }
  491. // remove first
  492. remove_elem(mo, get_first_elem(mo));
  493. // signal up
  494. NCDModuleInst_Backend_Up(i);
  495. return;
  496. fail0:
  497. NCDModuleInst_Backend_SetError(i);
  498. NCDModuleInst_Backend_Dead(i);
  499. }
  500. static void contains_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  501. {
  502. struct contains_instance *o = vo;
  503. o->i = i;
  504. // read arguments
  505. NCDValRef value_arg;
  506. if (!NCDVal_ListRead(params->args, 1, &value_arg)) {
  507. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  508. goto fail0;
  509. }
  510. // get method object
  511. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  512. // search
  513. o->contains = !!find_elem(mo, value_arg, 0, NULL);
  514. // signal up
  515. NCDModuleInst_Backend_Up(o->i);
  516. return;
  517. fail0:
  518. NCDModuleInst_Backend_SetError(i);
  519. NCDModuleInst_Backend_Dead(i);
  520. }
  521. static void contains_func_die (void *vo)
  522. {
  523. struct contains_instance *o = vo;
  524. NCDModuleInst_Backend_Dead(o->i);
  525. }
  526. static int contains_func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  527. {
  528. struct contains_instance *o = vo;
  529. if (!strcmp(name, "")) {
  530. *out = ncd_make_boolean(mem, o->contains, o->i->params->iparams->string_index);
  531. if (NCDVal_IsInvalid(*out)) {
  532. ModuleLog(o->i, BLOG_ERROR, "ncd_make_boolean failed");
  533. }
  534. return 1;
  535. }
  536. return 0;
  537. }
  538. static void find_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  539. {
  540. struct find_instance *o = vo;
  541. o->i = i;
  542. // read arguments
  543. NCDValRef start_pos_arg;
  544. NCDValRef value_arg;
  545. if (!NCDVal_ListRead(params->args, 2, &start_pos_arg, &value_arg)) {
  546. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  547. goto fail0;
  548. }
  549. if (!NCDVal_IsString(start_pos_arg)) {
  550. ModuleLog(o->i, BLOG_ERROR, "wrong type");
  551. goto fail0;
  552. }
  553. // read start position
  554. uintmax_t start_pos;
  555. if (!ncd_read_uintmax(start_pos_arg, &start_pos) || start_pos > UINT64_MAX) {
  556. ModuleLog(o->i, BLOG_ERROR, "wrong start pos");
  557. goto fail0;
  558. }
  559. // get method object
  560. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  561. // find
  562. o->is_found = !!find_elem(mo, value_arg, start_pos, &o->found_pos);
  563. // signal up
  564. NCDModuleInst_Backend_Up(o->i);
  565. return;
  566. fail0:
  567. NCDModuleInst_Backend_SetError(i);
  568. NCDModuleInst_Backend_Dead(i);
  569. }
  570. static void find_func_die (void *vo)
  571. {
  572. struct find_instance *o = vo;
  573. NCDModuleInst_Backend_Dead(o->i);
  574. }
  575. static int find_func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  576. {
  577. struct find_instance *o = vo;
  578. if (!strcmp(name, "pos")) {
  579. char value[64] = "none";
  580. if (o->is_found) {
  581. generate_decimal_repr_string(o->found_pos, value);
  582. }
  583. *out = NCDVal_NewString(mem, value);
  584. if (NCDVal_IsInvalid(*out)) {
  585. ModuleLog(o->i, BLOG_ERROR, "NCDVal_NewString failed");
  586. }
  587. return 1;
  588. }
  589. if (!strcmp(name, "found")) {
  590. *out = ncd_make_boolean(mem, o->is_found, o->i->params->iparams->string_index);
  591. if (NCDVal_IsInvalid(*out)) {
  592. ModuleLog(o->i, BLOG_ERROR, "ncd_make_boolean failed");
  593. }
  594. return 1;
  595. }
  596. return 0;
  597. }
  598. static void removeat_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  599. {
  600. // read arguments
  601. NCDValRef remove_pos_arg;
  602. if (!NCDVal_ListRead(params->args, 1, &remove_pos_arg)) {
  603. ModuleLog(i, BLOG_ERROR, "wrong arity");
  604. goto fail0;
  605. }
  606. if (!NCDVal_IsString(remove_pos_arg)) {
  607. ModuleLog(i, BLOG_ERROR, "wrong type");
  608. goto fail0;
  609. }
  610. // read position
  611. uintmax_t remove_pos;
  612. if (!ncd_read_uintmax(remove_pos_arg, &remove_pos)) {
  613. ModuleLog(i, BLOG_ERROR, "wrong pos");
  614. goto fail0;
  615. }
  616. // get method object
  617. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  618. // check position
  619. if (remove_pos >= list_count(mo)) {
  620. ModuleLog(i, BLOG_ERROR, "pos out of range");
  621. goto fail0;
  622. }
  623. // remove
  624. remove_elem(mo, get_elem_at(mo, remove_pos));
  625. // signal up
  626. NCDModuleInst_Backend_Up(i);
  627. return;
  628. fail0:
  629. NCDModuleInst_Backend_SetError(i);
  630. NCDModuleInst_Backend_Dead(i);
  631. }
  632. static void remove_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  633. {
  634. // read arguments
  635. NCDValRef value_arg;
  636. if (!NCDVal_ListRead(params->args, 1, &value_arg)) {
  637. ModuleLog(i, BLOG_ERROR, "wrong arity");
  638. goto fail0;
  639. }
  640. // get method object
  641. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  642. // find element
  643. struct elem *e = find_elem(mo, value_arg, 0, NULL);
  644. if (!e) {
  645. ModuleLog(i, BLOG_ERROR, "value does not exist");
  646. goto fail0;
  647. }
  648. // remove element
  649. remove_elem(mo, e);
  650. // signal up
  651. NCDModuleInst_Backend_Up(i);
  652. return;
  653. fail0:
  654. NCDModuleInst_Backend_SetError(i);
  655. NCDModuleInst_Backend_Dead(i);
  656. }
  657. static void set_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  658. {
  659. // get method object
  660. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  661. // remember old count
  662. uint64_t old_count = list_count(mo);
  663. // append contents of our lists
  664. if (!append_list_contents_contents(i, mo, params->args)) {
  665. goto fail0;
  666. }
  667. // remove old elements
  668. cut_list_front(mo, list_count(mo) - old_count);
  669. // signal up
  670. NCDModuleInst_Backend_Up(i);
  671. return;
  672. fail0:
  673. NCDModuleInst_Backend_SetError(i);
  674. NCDModuleInst_Backend_Dead(i);
  675. }
  676. static struct NCDModule modules[] = {
  677. {
  678. .type = "list",
  679. .func_new2 = func_new_list,
  680. .func_die = func_die,
  681. .func_getvar = func_getvar,
  682. .alloc_size = sizeof(struct instance)
  683. }, {
  684. .type = "listfrom",
  685. .base_type = "list",
  686. .func_new2 = func_new_listfrom,
  687. .func_die = func_die,
  688. .func_getvar = func_getvar,
  689. .alloc_size = sizeof(struct instance)
  690. }, {
  691. .type = "concatlist", // alias for listfrom
  692. .base_type = "list",
  693. .func_new2 = func_new_listfrom,
  694. .func_die = func_die,
  695. .func_getvar = func_getvar,
  696. .alloc_size = sizeof(struct instance)
  697. }, {
  698. .type = "list::append",
  699. .func_new2 = append_func_new
  700. }, {
  701. .type = "list::appendv",
  702. .func_new2 = appendv_func_new
  703. }, {
  704. .type = "list::length",
  705. .func_new2 = length_func_new,
  706. .func_die = length_func_die,
  707. .func_getvar = length_func_getvar,
  708. .alloc_size = sizeof(struct length_instance)
  709. }, {
  710. .type = "list::get",
  711. .func_new2 = get_func_new,
  712. .func_die = get_func_die,
  713. .func_getvar = get_func_getvar,
  714. .alloc_size = sizeof(struct get_instance)
  715. }, {
  716. .type = "list::shift",
  717. .func_new2 = shift_func_new
  718. }, {
  719. .type = "list::contains",
  720. .func_new2 = contains_func_new,
  721. .func_die = contains_func_die,
  722. .func_getvar = contains_func_getvar,
  723. .alloc_size = sizeof(struct contains_instance)
  724. }, {
  725. .type = "list::find",
  726. .func_new2 = find_func_new,
  727. .func_die = find_func_die,
  728. .func_getvar = find_func_getvar,
  729. .alloc_size = sizeof(struct find_instance)
  730. }, {
  731. .type = "list::remove_at",
  732. .func_new2 = removeat_func_new
  733. }, {
  734. .type = "list::remove",
  735. .func_new2 = remove_func_new
  736. }, {
  737. .type = "list::set",
  738. .func_new2 = set_func_new
  739. }, {
  740. .type = NULL
  741. }
  742. };
  743. const struct NCDModuleGroup ncdmodule_list = {
  744. .modules = modules
  745. };