list.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871
  1. /**
  2. * @file list.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. * 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. goto fail1;
  144. }
  145. IndexedList_InsertAt(&o->il, &e->il_node, idx);
  146. return e;
  147. fail1:
  148. NCDValMem_Free(&e->mem);
  149. free(e);
  150. fail0:
  151. return NULL;
  152. }
  153. static void remove_elem (struct instance *o, struct elem *e)
  154. {
  155. IndexedList_Remove(&o->il, &e->il_node);
  156. NCDValMem_Free(&e->mem);
  157. free(e);
  158. }
  159. static struct elem * get_elem_at (struct instance *o, uint64_t idx)
  160. {
  161. ASSERT(idx < list_count(o))
  162. IndexedListNode *iln = IndexedList_GetAt(&o->il, idx);
  163. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  164. return e;
  165. }
  166. static struct elem * get_first_elem (struct instance *o)
  167. {
  168. ASSERT(list_count(o) > 0)
  169. IndexedListNode *iln = IndexedList_GetFirst(&o->il);
  170. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  171. return e;
  172. }
  173. static struct elem * get_last_elem (struct instance *o)
  174. {
  175. ASSERT(list_count(o) > 0)
  176. IndexedListNode *iln = IndexedList_GetLast(&o->il);
  177. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  178. return e;
  179. }
  180. static void cut_list_front (struct instance *o, uint64_t count)
  181. {
  182. while (list_count(o) > count) {
  183. remove_elem(o, get_first_elem(o));
  184. }
  185. }
  186. static void cut_list_back (struct instance *o, uint64_t count)
  187. {
  188. while (list_count(o) > count) {
  189. remove_elem(o, get_last_elem(o));
  190. }
  191. }
  192. static int append_list_contents (NCDModuleInst *i, struct instance *o, NCDValRef args)
  193. {
  194. ASSERT(NCDVal_IsList(args))
  195. uint64_t orig_count = list_count(o);
  196. size_t append_count = NCDVal_ListCount(args);
  197. for (size_t j = 0; j < append_count; j++) {
  198. NCDValRef elem = NCDVal_ListGet(args, j);
  199. if (!insert_value(i, o, elem, list_count(o))) {
  200. goto fail;
  201. }
  202. }
  203. return 1;
  204. fail:
  205. cut_list_back(o, orig_count);
  206. return 0;
  207. }
  208. static int append_list_contents_contents (NCDModuleInst *i, struct instance *o, NCDValRef args)
  209. {
  210. ASSERT(NCDVal_IsList(args))
  211. uint64_t orig_count = list_count(o);
  212. size_t append_count = NCDVal_ListCount(args);
  213. for (size_t j = 0; j < append_count; j++) {
  214. NCDValRef elem = NCDVal_ListGet(args, j);
  215. if (!NCDVal_IsList(elem)) {
  216. ModuleLog(i, BLOG_ERROR, "wrong type");
  217. goto fail;
  218. }
  219. if (!append_list_contents(i, o, elem)) {
  220. goto fail;
  221. }
  222. }
  223. return 1;
  224. fail:
  225. cut_list_back(o, orig_count);
  226. return 0;
  227. }
  228. static struct elem * find_elem (struct instance *o, NCDValRef val, uint64_t start_idx, uint64_t *out_idx)
  229. {
  230. if (start_idx >= list_count(o)) {
  231. return NULL;
  232. }
  233. for (IndexedListNode *iln = IndexedList_GetAt(&o->il, start_idx); iln; iln = IndexedList_GetNext(&o->il, iln)) {
  234. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  235. if (NCDVal_Compare(e->val, val) == 0) {
  236. if (out_idx) {
  237. *out_idx = start_idx;
  238. }
  239. return e;
  240. }
  241. start_idx++;
  242. }
  243. return NULL;
  244. }
  245. static int list_to_value (NCDModuleInst *i, struct instance *o, NCDValMem *mem, NCDValRef *out_val)
  246. {
  247. *out_val = NCDVal_NewList(mem, IndexedList_Count(&o->il));
  248. if (NCDVal_IsInvalid(*out_val)) {
  249. goto fail;
  250. }
  251. for (IndexedListNode *iln = IndexedList_GetFirst(&o->il); iln; iln = IndexedList_GetNext(&o->il, iln)) {
  252. struct elem *e = UPPER_OBJECT(iln, struct elem, il_node);
  253. NCDValRef copy = NCDVal_NewCopy(mem, e->val);
  254. if (NCDVal_IsInvalid(copy)) {
  255. goto fail;
  256. }
  257. if (!NCDVal_ListAppend(*out_val, copy)) {
  258. goto fail;
  259. }
  260. }
  261. return 1;
  262. fail:
  263. return 0;
  264. }
  265. static void func_new_list (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  266. {
  267. struct instance *o = vo;
  268. o->i = i;
  269. // init list
  270. IndexedList_Init(&o->il);
  271. // append contents
  272. if (!append_list_contents(i, o, params->args)) {
  273. goto fail1;
  274. }
  275. // signal up
  276. NCDModuleInst_Backend_Up(o->i);
  277. return;
  278. fail1:
  279. cut_list_front(o, 0);
  280. NCDModuleInst_Backend_DeadError(i);
  281. }
  282. static void func_new_listfrom (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  283. {
  284. struct instance *o = vo;
  285. o->i = i;
  286. // init list
  287. IndexedList_Init(&o->il);
  288. // append contents contents
  289. if (!append_list_contents_contents(i, o, params->args)) {
  290. goto fail1;
  291. }
  292. // signal up
  293. NCDModuleInst_Backend_Up(o->i);
  294. return;
  295. fail1:
  296. cut_list_front(o, 0);
  297. NCDModuleInst_Backend_DeadError(i);
  298. }
  299. static void func_die (void *vo)
  300. {
  301. struct instance *o = vo;
  302. // free list elements
  303. cut_list_front(o, 0);
  304. NCDModuleInst_Backend_Dead(o->i);
  305. }
  306. static int func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  307. {
  308. struct instance *o = vo;
  309. if (!strcmp(name, "")) {
  310. if (!list_to_value(o->i, o, mem, out)) {
  311. return 0;
  312. }
  313. return 1;
  314. }
  315. if (!strcmp(name, "length")) {
  316. *out = ncd_make_uintmax(mem, list_count(o));
  317. return 1;
  318. }
  319. return 0;
  320. }
  321. static void append_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  322. {
  323. // check arguments
  324. NCDValRef arg;
  325. if (!NCDVal_ListRead(params->args, 1, &arg)) {
  326. ModuleLog(i, BLOG_ERROR, "wrong arity");
  327. goto fail0;
  328. }
  329. // get method object
  330. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  331. // append
  332. if (!insert_value(i, mo, arg, list_count(mo))) {
  333. goto fail0;
  334. }
  335. // signal up
  336. NCDModuleInst_Backend_Up(i);
  337. return;
  338. fail0:
  339. NCDModuleInst_Backend_DeadError(i);
  340. }
  341. static void appendv_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  342. {
  343. // check arguments
  344. NCDValRef arg;
  345. if (!NCDVal_ListRead(params->args, 1, &arg)) {
  346. ModuleLog(i, BLOG_ERROR, "wrong arity");
  347. goto fail0;
  348. }
  349. if (!NCDVal_IsList(arg)) {
  350. ModuleLog(i, BLOG_ERROR, "wrong type");
  351. goto fail0;
  352. }
  353. // get method object
  354. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  355. // append
  356. if (!append_list_contents(i, mo, arg)) {
  357. goto fail0;
  358. }
  359. // signal up
  360. NCDModuleInst_Backend_Up(i);
  361. return;
  362. fail0:
  363. NCDModuleInst_Backend_DeadError(i);
  364. }
  365. static void length_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  366. {
  367. struct length_instance *o = vo;
  368. o->i = i;
  369. // check arguments
  370. if (!NCDVal_ListRead(params->args, 0)) {
  371. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  372. goto fail0;
  373. }
  374. // get method object
  375. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  376. // remember length
  377. o->length = list_count(mo);
  378. // signal up
  379. NCDModuleInst_Backend_Up(o->i);
  380. return;
  381. fail0:
  382. NCDModuleInst_Backend_DeadError(i);
  383. }
  384. static void length_func_die (void *vo)
  385. {
  386. struct length_instance *o = vo;
  387. NCDModuleInst_Backend_Dead(o->i);
  388. }
  389. static int length_func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  390. {
  391. struct length_instance *o = vo;
  392. if (!strcmp(name, "")) {
  393. *out = ncd_make_uintmax(mem, o->length);
  394. return 1;
  395. }
  396. return 0;
  397. }
  398. static void get_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  399. {
  400. struct get_instance *o = vo;
  401. o->i = i;
  402. // check arguments
  403. NCDValRef index_arg;
  404. if (!NCDVal_ListRead(params->args, 1, &index_arg)) {
  405. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  406. goto fail0;
  407. }
  408. if (!NCDVal_IsString(index_arg)) {
  409. ModuleLog(o->i, BLOG_ERROR, "wrong type");
  410. goto fail0;
  411. }
  412. uintmax_t index;
  413. if (!ncd_read_uintmax(index_arg, &index)) {
  414. ModuleLog(o->i, BLOG_ERROR, "wrong value");
  415. goto fail0;
  416. }
  417. // get method object
  418. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  419. // check index
  420. if (index >= list_count(mo)) {
  421. ModuleLog(o->i, BLOG_ERROR, "no element at index %"PRIuMAX, index);
  422. goto fail0;
  423. }
  424. // get element
  425. struct elem *e = get_elem_at(mo, index);
  426. // init mem
  427. NCDValMem_Init(&o->mem);
  428. // copy value
  429. o->val = NCDVal_NewCopy(&o->mem, e->val);
  430. if (NCDVal_IsInvalid(o->val)) {
  431. goto fail1;
  432. }
  433. // signal up
  434. NCDModuleInst_Backend_Up(o->i);
  435. return;
  436. fail1:
  437. NCDValMem_Free(&o->mem);
  438. fail0:
  439. NCDModuleInst_Backend_DeadError(i);
  440. }
  441. static void get_func_die (void *vo)
  442. {
  443. struct get_instance *o = vo;
  444. // free mem
  445. NCDValMem_Free(&o->mem);
  446. NCDModuleInst_Backend_Dead(o->i);
  447. }
  448. static int get_func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  449. {
  450. struct get_instance *o = vo;
  451. if (!strcmp(name, "")) {
  452. *out = NCDVal_NewCopy(mem, o->val);
  453. return 1;
  454. }
  455. return 0;
  456. }
  457. static void shift_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  458. {
  459. // check arguments
  460. if (!NCDVal_ListRead(params->args, 0)) {
  461. ModuleLog(i, BLOG_ERROR, "wrong arity");
  462. goto fail0;
  463. }
  464. // get method object
  465. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  466. // check first
  467. if (list_count(mo) == 0) {
  468. ModuleLog(i, BLOG_ERROR, "list has no elements");
  469. goto fail0;
  470. }
  471. // remove first
  472. remove_elem(mo, get_first_elem(mo));
  473. // signal up
  474. NCDModuleInst_Backend_Up(i);
  475. return;
  476. fail0:
  477. NCDModuleInst_Backend_DeadError(i);
  478. }
  479. static void contains_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  480. {
  481. struct contains_instance *o = vo;
  482. o->i = i;
  483. // read arguments
  484. NCDValRef value_arg;
  485. if (!NCDVal_ListRead(params->args, 1, &value_arg)) {
  486. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  487. goto fail0;
  488. }
  489. // get method object
  490. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  491. // search
  492. o->contains = !!find_elem(mo, value_arg, 0, NULL);
  493. // signal up
  494. NCDModuleInst_Backend_Up(o->i);
  495. return;
  496. fail0:
  497. NCDModuleInst_Backend_DeadError(i);
  498. }
  499. static void contains_func_die (void *vo)
  500. {
  501. struct contains_instance *o = vo;
  502. NCDModuleInst_Backend_Dead(o->i);
  503. }
  504. static int contains_func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  505. {
  506. struct contains_instance *o = vo;
  507. if (!strcmp(name, "")) {
  508. *out = ncd_make_boolean(mem, o->contains, o->i->params->iparams->string_index);
  509. return 1;
  510. }
  511. return 0;
  512. }
  513. static void find_func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  514. {
  515. struct find_instance *o = vo;
  516. o->i = i;
  517. // read arguments
  518. NCDValRef start_pos_arg;
  519. NCDValRef value_arg;
  520. if (!NCDVal_ListRead(params->args, 2, &start_pos_arg, &value_arg)) {
  521. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  522. goto fail0;
  523. }
  524. if (!NCDVal_IsString(start_pos_arg)) {
  525. ModuleLog(o->i, BLOG_ERROR, "wrong type");
  526. goto fail0;
  527. }
  528. // read start position
  529. uintmax_t start_pos;
  530. if (!ncd_read_uintmax(start_pos_arg, &start_pos) || start_pos > UINT64_MAX) {
  531. ModuleLog(o->i, BLOG_ERROR, "wrong start pos");
  532. goto fail0;
  533. }
  534. // get method object
  535. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  536. // find
  537. o->is_found = !!find_elem(mo, value_arg, start_pos, &o->found_pos);
  538. // signal up
  539. NCDModuleInst_Backend_Up(o->i);
  540. return;
  541. fail0:
  542. NCDModuleInst_Backend_DeadError(i);
  543. }
  544. static void find_func_die (void *vo)
  545. {
  546. struct find_instance *o = vo;
  547. NCDModuleInst_Backend_Dead(o->i);
  548. }
  549. static int find_func_getvar (void *vo, const char *name, NCDValMem *mem, NCDValRef *out)
  550. {
  551. struct find_instance *o = vo;
  552. if (!strcmp(name, "pos")) {
  553. char value[64] = "none";
  554. if (o->is_found) {
  555. generate_decimal_repr_string(o->found_pos, value);
  556. }
  557. *out = NCDVal_NewString(mem, value);
  558. return 1;
  559. }
  560. if (!strcmp(name, "found")) {
  561. *out = ncd_make_boolean(mem, o->is_found, o->i->params->iparams->string_index);
  562. return 1;
  563. }
  564. return 0;
  565. }
  566. static void removeat_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  567. {
  568. // read arguments
  569. NCDValRef remove_pos_arg;
  570. if (!NCDVal_ListRead(params->args, 1, &remove_pos_arg)) {
  571. ModuleLog(i, BLOG_ERROR, "wrong arity");
  572. goto fail0;
  573. }
  574. if (!NCDVal_IsString(remove_pos_arg)) {
  575. ModuleLog(i, BLOG_ERROR, "wrong type");
  576. goto fail0;
  577. }
  578. // read position
  579. uintmax_t remove_pos;
  580. if (!ncd_read_uintmax(remove_pos_arg, &remove_pos)) {
  581. ModuleLog(i, BLOG_ERROR, "wrong pos");
  582. goto fail0;
  583. }
  584. // get method object
  585. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  586. // check position
  587. if (remove_pos >= list_count(mo)) {
  588. ModuleLog(i, BLOG_ERROR, "pos out of range");
  589. goto fail0;
  590. }
  591. // remove
  592. remove_elem(mo, get_elem_at(mo, remove_pos));
  593. // signal up
  594. NCDModuleInst_Backend_Up(i);
  595. return;
  596. fail0:
  597. NCDModuleInst_Backend_DeadError(i);
  598. }
  599. static void remove_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  600. {
  601. // read arguments
  602. NCDValRef value_arg;
  603. if (!NCDVal_ListRead(params->args, 1, &value_arg)) {
  604. ModuleLog(i, BLOG_ERROR, "wrong arity");
  605. goto fail0;
  606. }
  607. // get method object
  608. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  609. // find element
  610. struct elem *e = find_elem(mo, value_arg, 0, NULL);
  611. if (!e) {
  612. ModuleLog(i, BLOG_ERROR, "value does not exist");
  613. goto fail0;
  614. }
  615. // remove element
  616. remove_elem(mo, e);
  617. // signal up
  618. NCDModuleInst_Backend_Up(i);
  619. return;
  620. fail0:
  621. NCDModuleInst_Backend_DeadError(i);
  622. }
  623. static void set_func_new (void *unused, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  624. {
  625. // get method object
  626. struct instance *mo = NCDModuleInst_Backend_GetUser((NCDModuleInst *)params->method_user);
  627. // remember old count
  628. uint64_t old_count = list_count(mo);
  629. // append contents of our lists
  630. if (!append_list_contents_contents(i, mo, params->args)) {
  631. goto fail0;
  632. }
  633. // remove old elements
  634. cut_list_front(mo, list_count(mo) - old_count);
  635. // signal up
  636. NCDModuleInst_Backend_Up(i);
  637. return;
  638. fail0:
  639. NCDModuleInst_Backend_DeadError(i);
  640. }
  641. static struct NCDModule modules[] = {
  642. {
  643. .type = "list",
  644. .func_new2 = func_new_list,
  645. .func_die = func_die,
  646. .func_getvar = func_getvar,
  647. .alloc_size = sizeof(struct instance)
  648. }, {
  649. .type = "listfrom",
  650. .base_type = "list",
  651. .func_new2 = func_new_listfrom,
  652. .func_die = func_die,
  653. .func_getvar = func_getvar,
  654. .alloc_size = sizeof(struct instance)
  655. }, {
  656. .type = "concatlist", // alias for listfrom
  657. .base_type = "list",
  658. .func_new2 = func_new_listfrom,
  659. .func_die = func_die,
  660. .func_getvar = func_getvar,
  661. .alloc_size = sizeof(struct instance)
  662. }, {
  663. .type = "list::append",
  664. .func_new2 = append_func_new
  665. }, {
  666. .type = "list::appendv",
  667. .func_new2 = appendv_func_new
  668. }, {
  669. .type = "list::length",
  670. .func_new2 = length_func_new,
  671. .func_die = length_func_die,
  672. .func_getvar = length_func_getvar,
  673. .alloc_size = sizeof(struct length_instance)
  674. }, {
  675. .type = "list::get",
  676. .func_new2 = get_func_new,
  677. .func_die = get_func_die,
  678. .func_getvar = get_func_getvar,
  679. .alloc_size = sizeof(struct get_instance)
  680. }, {
  681. .type = "list::shift",
  682. .func_new2 = shift_func_new
  683. }, {
  684. .type = "list::contains",
  685. .func_new2 = contains_func_new,
  686. .func_die = contains_func_die,
  687. .func_getvar = contains_func_getvar,
  688. .alloc_size = sizeof(struct contains_instance)
  689. }, {
  690. .type = "list::find",
  691. .func_new2 = find_func_new,
  692. .func_die = find_func_die,
  693. .func_getvar = find_func_getvar,
  694. .alloc_size = sizeof(struct find_instance)
  695. }, {
  696. .type = "list::remove_at",
  697. .func_new2 = removeat_func_new
  698. }, {
  699. .type = "list::remove",
  700. .func_new2 = remove_func_new
  701. }, {
  702. .type = "list::set",
  703. .func_new2 = set_func_new
  704. }, {
  705. .type = NULL
  706. }
  707. };
  708. const struct NCDModuleGroup ncdmodule_list = {
  709. .modules = modules
  710. };