basic_functions.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476
  1. /**
  2. * @file basic_functions.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. #include <stdlib.h>
  30. #include <misc/expstring.h>
  31. #include <misc/bsize.h>
  32. #include <ncd/NCDValGenerator.h>
  33. #include <ncd/NCDValParser.h>
  34. #include <ncd/module_common.h>
  35. #include <generated/blog_channel_ncd_basic_functions.h>
  36. // Trivial functions.
  37. static void error_eval (NCDCall call)
  38. {
  39. FunctionLog(&call, BLOG_ERROR, "error: failing");
  40. }
  41. static void identity_eval (NCDCall call)
  42. {
  43. if (NCDCall_ArgCount(&call) != 1) {
  44. return FunctionLog(&call, BLOG_ERROR, "identity: need one argument");
  45. }
  46. NCDCall_SetResult(&call, NCDCall_EvalArg(&call, 0, NCDCall_ResMem(&call)));
  47. }
  48. // Logical functions.
  49. static void if_eval (NCDCall call)
  50. {
  51. if (NCDCall_ArgCount(&call) != 3) {
  52. return FunctionLog(&call, BLOG_ERROR, "if: need three arguments");
  53. }
  54. NCDValRef cond = NCDCall_EvalArg(&call, 0, NCDCall_ResMem(&call));
  55. if (NCDVal_IsInvalid(cond)) {
  56. return;
  57. }
  58. int cond_val;
  59. if (!ncd_read_boolean(cond, &cond_val)) {
  60. return FunctionLog(&call, BLOG_ERROR, "if: bad condition");
  61. }
  62. int eval_arg = 2 - cond_val;
  63. NCDCall_SetResult(&call, NCDCall_EvalArg(&call, eval_arg, NCDCall_ResMem(&call)));
  64. }
  65. static void bool_not_eval (NCDCall call, int negate, char const *name)
  66. {
  67. if (NCDCall_ArgCount(&call) != 1) {
  68. return FunctionLog(&call, BLOG_ERROR, "%s: need one argument", name);
  69. }
  70. NCDValRef arg = NCDCall_EvalArg(&call, 0, NCDCall_ResMem(&call));
  71. if (NCDVal_IsInvalid(arg)) {
  72. return;
  73. }
  74. int arg_val;
  75. if (!ncd_read_boolean(arg, &arg_val)) {
  76. return FunctionLog(&call, BLOG_ERROR, "%s: bad argument", name);
  77. }
  78. int res = (arg_val != negate);
  79. NCDCall_SetResult(&call, ncd_make_boolean(NCDCall_ResMem(&call), res, NCDCall_Iparams(&call)->string_index));
  80. }
  81. static void bool_eval (NCDCall call) { return bool_not_eval(call, 0, "bool"); }
  82. static void not_eval (NCDCall call) { return bool_not_eval(call, 1, "not"); }
  83. static void and_or_eval (NCDCall call, int is_and, char const *name)
  84. {
  85. size_t count = NCDCall_ArgCount(&call);
  86. int res = is_and;
  87. for (size_t i = 0; i < count; i++) {
  88. NCDValRef arg = NCDCall_EvalArg(&call, i, NCDCall_ResMem(&call));
  89. if (NCDVal_IsInvalid(arg)) {
  90. return;
  91. }
  92. int arg_val;
  93. if (!ncd_read_boolean(arg, &arg_val)) {
  94. return FunctionLog(&call, BLOG_ERROR, "%s: bad argument", name);
  95. }
  96. if (arg_val != is_and) {
  97. res = !is_and;
  98. break;
  99. }
  100. }
  101. NCDCall_SetResult(&call, ncd_make_boolean(NCDCall_ResMem(&call), res, NCDCall_Iparams(&call)->string_index));
  102. }
  103. static void and_eval (NCDCall call) { return and_or_eval(call, 1, "and"); }
  104. static void or_eval (NCDCall call) { return and_or_eval(call, 0, "or"); }
  105. static void imp_eval (NCDCall call)
  106. {
  107. if (NCDCall_ArgCount(&call) != 2) {
  108. return FunctionLog(&call, BLOG_ERROR, "imp: need two arguments");
  109. }
  110. int res = 0;
  111. for (size_t i = 0; i < 2; i++) {
  112. NCDValRef arg = NCDCall_EvalArg(&call, i, NCDCall_ResMem(&call));
  113. if (NCDVal_IsInvalid(arg)) {
  114. return;
  115. }
  116. int arg_val;
  117. if (!ncd_read_boolean(arg, &arg_val)) {
  118. return FunctionLog(&call, BLOG_ERROR, "imp: bad argument");
  119. }
  120. if (arg_val == i) {
  121. res = 1;
  122. break;
  123. }
  124. }
  125. NCDCall_SetResult(&call, ncd_make_boolean(NCDCall_ResMem(&call), res, NCDCall_Iparams(&call)->string_index));
  126. }
  127. // Value comparison functions.
  128. typedef int (*value_compare_func) (int cmp);
  129. static void value_compare_eval (NCDCall call, value_compare_func func)
  130. {
  131. if (NCDCall_ArgCount(&call) != 2) {
  132. return FunctionLog(&call, BLOG_ERROR, "value_compare: need two arguments");
  133. }
  134. NCDValRef vals[2];
  135. for (int i = 0; i < 2; i++) {
  136. vals[i] = NCDCall_EvalArg(&call, i, NCDCall_ResMem(&call));
  137. if (NCDVal_IsInvalid(vals[i])) {
  138. return;
  139. }
  140. }
  141. int res = func(NCDVal_Compare(vals[0], vals[1]));
  142. NCDCall_SetResult(&call, ncd_make_boolean(NCDCall_ResMem(&call), res, NCDCall_Iparams(&call)->string_index));
  143. }
  144. #define DEFINE_VALUE_COMPARE(name, expr) \
  145. static int value_compare_##name##_func (int cmp) { return expr; } \
  146. static void value_compare_##name##_eval (NCDCall call) { return value_compare_eval(call, value_compare_##name##_func); }
  147. DEFINE_VALUE_COMPARE(lesser, (cmp < 0))
  148. DEFINE_VALUE_COMPARE(greater, (cmp > 0))
  149. DEFINE_VALUE_COMPARE(lesser_equal, (cmp <= 0))
  150. DEFINE_VALUE_COMPARE(greater_equal, (cmp >= 0))
  151. DEFINE_VALUE_COMPARE(equal, (cmp == 0))
  152. DEFINE_VALUE_COMPARE(different, (cmp != 0))
  153. // Concatenation functions.
  154. static int concat_recurser (ExpString *estr, NCDValRef arg, NCDCall const *call)
  155. {
  156. if (NCDVal_IsString(arg)) {
  157. if (!ExpString_AppendBinary(estr, (uint8_t const *)NCDVal_StringData(arg), NCDVal_StringLength(arg))) {
  158. FunctionLog(call, BLOG_ERROR, "ExpString_AppendBinary failed");
  159. return 0;
  160. }
  161. } else if (NCDVal_IsList(arg)) {
  162. size_t count = NCDVal_ListCount(arg);
  163. for (size_t i = 0; i < count; i++) {
  164. if (!concat_recurser(estr, NCDVal_ListGet(arg, i), call)) {
  165. return 0;
  166. }
  167. }
  168. } else {
  169. FunctionLog(call, BLOG_ERROR, "concat: value is not a string or list");
  170. return 0;
  171. }
  172. return 1;
  173. }
  174. static void concat_eval (NCDCall call)
  175. {
  176. ExpString estr;
  177. if (!ExpString_Init(&estr)) {
  178. FunctionLog(&call, BLOG_ERROR, "ExpString_Init failed");
  179. goto fail0;
  180. }
  181. size_t count = NCDCall_ArgCount(&call);
  182. for (size_t i = 0; i < count; i++) {
  183. NCDValRef arg = NCDCall_EvalArg(&call, i, NCDCall_ResMem(&call));
  184. if (NCDVal_IsInvalid(arg)) {
  185. goto fail1;
  186. }
  187. if (!concat_recurser(&estr, arg, &call)) {
  188. goto fail1;
  189. }
  190. }
  191. NCDCall_SetResult(&call, NCDVal_NewStringBin(NCDCall_ResMem(&call), (uint8_t const *)ExpString_Get(&estr), ExpString_Length(&estr)));
  192. fail1:
  193. ExpString_Free(&estr);
  194. fail0:
  195. return;
  196. }
  197. static void concatlist_eval (NCDCall call)
  198. {
  199. NCDValRef args_list;
  200. if (!ncd_eval_func_args(&call, NCDCall_ResMem(&call), &args_list)) {
  201. return;
  202. }
  203. size_t arg_count = NCDVal_ListCount(args_list);
  204. bsize_t elem_count = bsize_fromsize(0);
  205. for (size_t i = 0; i < arg_count; i++) {
  206. NCDValRef arg = NCDVal_ListGet(args_list, i);
  207. if (!NCDVal_IsList(arg)) {
  208. return FunctionLog(&call, BLOG_ERROR, "concatlist: argument is not a list");
  209. }
  210. elem_count = bsize_add(elem_count, bsize_fromsize(NCDVal_ListCount(arg)));
  211. }
  212. if (elem_count.is_overflow) {
  213. return FunctionLog(&call, BLOG_ERROR, "concatlist: count overflow");
  214. }
  215. NCDValRef res = NCDVal_NewList(NCDCall_ResMem(&call), elem_count.value);
  216. if (NCDVal_IsInvalid(res)) {
  217. return;
  218. }
  219. for (size_t i = 0; i < arg_count; i++) {
  220. NCDValRef arg = NCDVal_ListGet(args_list, i);
  221. size_t arg_list_count = NCDVal_ListCount(arg);
  222. for (size_t j = 0; j < arg_list_count; j++) {
  223. NCDValRef copy = NCDVal_NewCopy(NCDCall_ResMem(&call), NCDVal_ListGet(arg, j));
  224. if (NCDVal_IsInvalid(copy)) {
  225. return;
  226. }
  227. if (!NCDVal_ListAppend(res, copy)) {
  228. return;
  229. }
  230. }
  231. }
  232. NCDCall_SetResult(&call, res);
  233. }
  234. // Integer comparison functions.
  235. typedef int (*integer_compare_func) (uintmax_t n1, uintmax_t n2);
  236. static void integer_compare_eval (NCDCall call, integer_compare_func func)
  237. {
  238. if (NCDCall_ArgCount(&call) != 2) {
  239. return FunctionLog(&call, BLOG_ERROR, "integer_compare: need two arguments");
  240. }
  241. uintmax_t ints[2];
  242. for (int i = 0; i < 2; i++) {
  243. NCDValRef arg = NCDCall_EvalArg(&call, i, NCDCall_ResMem(&call));
  244. if (NCDVal_IsInvalid(arg)) {
  245. return;
  246. }
  247. if (!ncd_read_uintmax(arg, &ints[i])) {
  248. return FunctionLog(&call, BLOG_ERROR, "integer_compare: wrong value");
  249. }
  250. }
  251. int res = func(ints[0], ints[1]);
  252. NCDCall_SetResult(&call, ncd_make_boolean(NCDCall_ResMem(&call), res, NCDCall_Iparams(&call)->string_index));
  253. }
  254. #define DEFINE_INT_COMPARE(name, expr) \
  255. static int integer_compare_##name##_func (uintmax_t n1, uintmax_t n2) { return expr; } \
  256. static void integer_compare_##name##_eval (NCDCall call) { return integer_compare_eval(call, integer_compare_##name##_func); }
  257. DEFINE_INT_COMPARE(lesser, (n1 < n2))
  258. DEFINE_INT_COMPARE(greater, (n1 > n2))
  259. DEFINE_INT_COMPARE(lesser_equal, (n1 <= n2))
  260. DEFINE_INT_COMPARE(greater_equal, (n1 >= n2))
  261. DEFINE_INT_COMPARE(equal, (n1 == n2))
  262. DEFINE_INT_COMPARE(different, (n1 != n2))
  263. // Integer operators.
  264. typedef int (*integer_operator_func) (uintmax_t n1, uintmax_t n2, uintmax_t *out, NCDCall const *call);
  265. static void integer_operator_eval (NCDCall call, integer_operator_func func)
  266. {
  267. if (NCDCall_ArgCount(&call) != 2) {
  268. return FunctionLog(&call, BLOG_ERROR, "integer_operator: need two arguments");
  269. }
  270. uintmax_t ints[2];
  271. for (int i = 0; i < 2; i++) {
  272. NCDValRef arg = NCDCall_EvalArg(&call, i, NCDCall_ResMem(&call));
  273. if (NCDVal_IsInvalid(arg)) {
  274. return;
  275. }
  276. if (!ncd_read_uintmax(arg, &ints[i])) {
  277. return FunctionLog(&call, BLOG_ERROR, "integer_operator: wrong value");
  278. }
  279. }
  280. uintmax_t res;
  281. if (!func(ints[0], ints[1], &res, &call)) {
  282. return;
  283. }
  284. NCDCall_SetResult(&call, ncd_make_uintmax(NCDCall_ResMem(&call), res));
  285. }
  286. #define DEFINE_INT_OPERATOR(name, expr, check_expr, check_err_str) \
  287. static int integer_operator_##name##_func (uintmax_t n1, uintmax_t n2, uintmax_t *out, NCDCall const *call) \
  288. { \
  289. if (check_expr) { \
  290. FunctionLog(call, BLOG_ERROR, check_err_str); \
  291. return 0; \
  292. } \
  293. *out = expr; \
  294. return 1; \
  295. } \
  296. static void integer_operator_##name##_eval (NCDCall call) { return integer_operator_eval(call, integer_operator_##name##_func); }
  297. DEFINE_INT_OPERATOR(add, (n1 + n2), (n1 > UINTMAX_MAX - n2), "addition overflow")
  298. DEFINE_INT_OPERATOR(subtract, (n1 - n2), (n1 < n2), "subtraction underflow")
  299. DEFINE_INT_OPERATOR(multiply, (n1 * n2), (n2 != 0 && n1 > UINTMAX_MAX / n2), "multiplication overflow")
  300. DEFINE_INT_OPERATOR(divide, (n1 / n2), (n2 == 0), "division quotient is zero")
  301. DEFINE_INT_OPERATOR(modulo, (n1 % n2), (n2 == 0), "modulo modulus is zero")
  302. // Encode and decode value.
  303. static void encode_value_eval (NCDCall call)
  304. {
  305. if (NCDCall_ArgCount(&call) != 1) {
  306. return FunctionLog(&call, BLOG_ERROR, "encode_value: need one argument");
  307. }
  308. NCDValRef arg = NCDCall_EvalArg(&call, 0, NCDCall_ResMem(&call));
  309. if (NCDVal_IsInvalid(arg)) {
  310. return;
  311. }
  312. char *str = NCDValGenerator_Generate(arg);
  313. if (!str) {
  314. return FunctionLog(&call, BLOG_ERROR, "encode_value: NCDValGenerator_Generate failed");
  315. }
  316. NCDCall_SetResult(&call, NCDVal_NewString(NCDCall_ResMem(&call), str));
  317. free(str);
  318. }
  319. static void decode_value_eval (NCDCall call)
  320. {
  321. if (NCDCall_ArgCount(&call) != 1) {
  322. return FunctionLog(&call, BLOG_ERROR, "decode_value: need one argument");
  323. }
  324. NCDValRef arg = NCDCall_EvalArg(&call, 0, NCDCall_ResMem(&call));
  325. if (NCDVal_IsInvalid(arg)) {
  326. return;
  327. }
  328. if (!NCDVal_IsString(arg)) {
  329. return;
  330. }
  331. NCDValRef res;
  332. if (!NCDValParser_Parse(NCDVal_StringData(arg), NCDVal_StringLength(arg), NCDCall_ResMem(&call), &res)) {
  333. return FunctionLog(&call, BLOG_ERROR, "decode_value: NCDValParser_Parse failed");
  334. }
  335. NCDCall_SetResult(&call, res);
  336. }
  337. static struct NCDModuleFunction const functions[] = {
  338. {
  339. .func_name = "__error__",
  340. .func_eval = error_eval
  341. }, {
  342. .func_name = "__identity__",
  343. .func_eval = identity_eval
  344. }, {
  345. .func_name = "__if__",
  346. .func_eval = if_eval
  347. }, {
  348. .func_name = "__bool__",
  349. .func_eval = bool_eval
  350. }, {
  351. .func_name = "__not__",
  352. .func_eval = not_eval
  353. }, {
  354. .func_name = "__and__",
  355. .func_eval = and_eval
  356. }, {
  357. .func_name = "__or__",
  358. .func_eval = or_eval
  359. }, {
  360. .func_name = "__imp__",
  361. .func_eval = imp_eval
  362. }, {
  363. .func_name = "__val_lesser__",
  364. .func_eval = value_compare_lesser_eval
  365. }, {
  366. .func_name = "__val_greater__",
  367. .func_eval = value_compare_greater_eval
  368. }, {
  369. .func_name = "__val_lesser_equal__",
  370. .func_eval = value_compare_lesser_equal_eval
  371. }, {
  372. .func_name = "__val_greater_equal__",
  373. .func_eval = value_compare_greater_equal_eval
  374. }, {
  375. .func_name = "__val_equal__",
  376. .func_eval = value_compare_equal_eval
  377. }, {
  378. .func_name = "__val_different__",
  379. .func_eval = value_compare_different_eval
  380. }, {
  381. .func_name = "__concat__",
  382. .func_eval = concat_eval
  383. }, {
  384. .func_name = "__concatlist__",
  385. .func_eval = concatlist_eval
  386. }, {
  387. .func_name = "__num_lesser__",
  388. .func_eval = integer_compare_lesser_eval
  389. }, {
  390. .func_name = "__num_greater__",
  391. .func_eval = integer_compare_greater_eval
  392. }, {
  393. .func_name = "__num_lesser_equal__",
  394. .func_eval = integer_compare_lesser_equal_eval
  395. }, {
  396. .func_name = "__num_greater_equal__",
  397. .func_eval = integer_compare_greater_equal_eval
  398. }, {
  399. .func_name = "__num_equal__",
  400. .func_eval = integer_compare_equal_eval
  401. }, {
  402. .func_name = "__num_different__",
  403. .func_eval = integer_compare_different_eval
  404. }, {
  405. .func_name = "__num_add__",
  406. .func_eval = integer_operator_add_eval
  407. }, {
  408. .func_name = "__num_subtract__",
  409. .func_eval = integer_operator_subtract_eval
  410. }, {
  411. .func_name = "__num_multiply__",
  412. .func_eval = integer_operator_multiply_eval
  413. }, {
  414. .func_name = "__num_divide__",
  415. .func_eval = integer_operator_divide_eval
  416. }, {
  417. .func_name = "__num_modulo__",
  418. .func_eval = integer_operator_modulo_eval
  419. }, {
  420. .func_name = "__encode_value__",
  421. .func_eval = encode_value_eval
  422. }, {
  423. .func_name = "__decode_value__",
  424. .func_eval = decode_value_eval
  425. }, {
  426. .func_name = NULL
  427. }
  428. };
  429. const struct NCDModuleGroup ncdmodule_basic_functions = {
  430. .functions = functions
  431. };