arithmetic.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396
  1. /**
  2. * @file arithmetic.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. * Arithmetic functions for unsigned integers.
  32. *
  33. * Synopsis:
  34. * num_lesser(string n1, string n2)
  35. * num_greater(string n1, string n2)
  36. * num_lesser_equal(string n1, string n2)
  37. * num_greater_equal(string n1, string n2)
  38. * num_equal(string n1, string n2)
  39. * num_different(string n1, string n2)
  40. *
  41. * Variables:
  42. * (empty) - "true" or "false", reflecting the value of the relation in question
  43. *
  44. * Description:
  45. * These statements perform arithmetic comparisons. The operands passed must be
  46. * non-negative decimal integers representable in a uintmax_t. Otherwise, an error
  47. * is triggered.
  48. *
  49. * Synopsis:
  50. * num_add(string n1, string n2)
  51. * num_subtract(string n1, string n2)
  52. * num_multiply(string n1, string n2)
  53. * num_divide(string n1, string n2)
  54. * num_modulo(string n1, string n2)
  55. *
  56. * Description:
  57. * These statements perform arithmetic operations. The operands passed must be
  58. * non-negative decimal integers representable in a uintmax_t, and the result must
  59. * also be representable and non-negative. For divide and modulo, n2 must be non-zero.
  60. * If any of these restrictions is violated, an error is triggered.
  61. *
  62. * Variables:
  63. * (empty) - the result of the operation as a string representing a decimal number
  64. */
  65. #include <stdio.h>
  66. #include <stdlib.h>
  67. #include <string.h>
  68. #include <inttypes.h>
  69. #include <limits.h>
  70. #include <misc/parse_number.h>
  71. #include <ncd/NCDModule.h>
  72. #include <ncd/static_strings.h>
  73. #include <ncd/static_strings_utils.h>
  74. #include <generated/blog_channel_ncd_arithmetic.h>
  75. #define ModuleLog(i, ...) NCDModuleInst_Backend_Log((i), BLOG_CURRENT_CHANNEL, __VA_ARGS__)
  76. struct boolean_instance {
  77. NCDModuleInst *i;
  78. int value;
  79. };
  80. typedef int (*boolean_compute_func) (uintmax_t n1, uintmax_t n2);
  81. struct number_instance {
  82. NCDModuleInst *i;
  83. char value[25];
  84. };
  85. typedef int (*number_compute_func) (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, char *out_str);
  86. static int compute_lesser (uintmax_t n1, uintmax_t n2)
  87. {
  88. return n1 < n2;
  89. }
  90. static int compute_greater (uintmax_t n1, uintmax_t n2)
  91. {
  92. return n1 > n2;
  93. }
  94. static int compute_lesser_equal (uintmax_t n1, uintmax_t n2)
  95. {
  96. return n1 <= n2;
  97. }
  98. static int compute_greater_equal (uintmax_t n1, uintmax_t n2)
  99. {
  100. return n1 >= n2;
  101. }
  102. static int compute_equal (uintmax_t n1, uintmax_t n2)
  103. {
  104. return n1 == n2;
  105. }
  106. static int compute_different (uintmax_t n1, uintmax_t n2)
  107. {
  108. return n1 != n2;
  109. }
  110. static int compute_add (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, char *out_str)
  111. {
  112. if (n1 > UINTMAX_MAX - n2) {
  113. ModuleLog(i, BLOG_ERROR, "addition overflow");
  114. return 0;
  115. }
  116. uintmax_t r = n1 + n2;
  117. sprintf(out_str, "%"PRIuMAX, r);
  118. return 1;
  119. }
  120. static int compute_subtract (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, char *out_str)
  121. {
  122. if (n1 < n2) {
  123. ModuleLog(i, BLOG_ERROR, "subtraction underflow");
  124. return 0;
  125. }
  126. uintmax_t r = n1 - n2;
  127. sprintf(out_str, "%"PRIuMAX, r);
  128. return 1;
  129. }
  130. static int compute_multiply (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, char *out_str)
  131. {
  132. if (n1 > UINTMAX_MAX / n2) {
  133. ModuleLog(i, BLOG_ERROR, "multiplication overflow");
  134. return 0;
  135. }
  136. uintmax_t r = n1 * n2;
  137. sprintf(out_str, "%"PRIuMAX, r);
  138. return 1;
  139. }
  140. static int compute_divide (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, char *out_str)
  141. {
  142. if (n2 == 0) {
  143. ModuleLog(i, BLOG_ERROR, "division quotient is zero");
  144. return 0;
  145. }
  146. uintmax_t r = n1 / n2;
  147. sprintf(out_str, "%"PRIuMAX, r);
  148. return 1;
  149. }
  150. static int compute_modulo (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, char *out_str)
  151. {
  152. if (n2 == 0) {
  153. ModuleLog(i, BLOG_ERROR, "modulo modulus is zero");
  154. return 0;
  155. }
  156. uintmax_t r = n1 % n2;
  157. sprintf(out_str, "%"PRIuMAX, r);
  158. return 1;
  159. }
  160. static void new_boolean_templ (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params, boolean_compute_func cfunc)
  161. {
  162. struct boolean_instance *o = vo;
  163. o->i = i;
  164. NCDValRef n1_arg;
  165. NCDValRef n2_arg;
  166. if (!NCDVal_ListRead(params->args, 2, &n1_arg, &n2_arg)) {
  167. ModuleLog(i, BLOG_ERROR, "wrong arity");
  168. goto fail0;
  169. }
  170. if (!NCDVal_IsStringNoNulls(n1_arg) || !NCDVal_IsStringNoNulls(n2_arg)) {
  171. ModuleLog(o->i, BLOG_ERROR, "wrong type");
  172. goto fail0;
  173. }
  174. uintmax_t n1;
  175. uintmax_t n2;
  176. if (!parse_unsigned_integer(NCDVal_StringValue(n1_arg), &n1) || !parse_unsigned_integer(NCDVal_StringValue(n2_arg), &n2)) {
  177. ModuleLog(o->i, BLOG_ERROR, "wrong value");
  178. goto fail0;
  179. }
  180. o->value = cfunc(n1, n2);
  181. NCDModuleInst_Backend_Up(i);
  182. return;
  183. fail0:
  184. NCDModuleInst_Backend_SetError(i);
  185. NCDModuleInst_Backend_Dead(i);
  186. }
  187. static int boolean_func_getvar2 (void *vo, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  188. {
  189. struct boolean_instance *o = vo;
  190. if (name == NCD_STRING_EMPTY) {
  191. *out = ncd_make_boolean(mem, o->value, o->i->params->iparams->string_index);
  192. if (NCDVal_IsInvalid(*out)) {
  193. ModuleLog(o->i, BLOG_ERROR, "ncd_make_boolean failed");
  194. }
  195. return 1;
  196. }
  197. return 0;
  198. }
  199. static void new_number_templ (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params, number_compute_func cfunc)
  200. {
  201. struct number_instance *o = vo;
  202. o->i = i;
  203. NCDValRef n1_arg;
  204. NCDValRef n2_arg;
  205. if (!NCDVal_ListRead(params->args, 2, &n1_arg, &n2_arg)) {
  206. ModuleLog(i, BLOG_ERROR, "wrong arity");
  207. goto fail0;
  208. }
  209. if (!NCDVal_IsStringNoNulls(n1_arg) || !NCDVal_IsStringNoNulls(n2_arg)) {
  210. ModuleLog(o->i, BLOG_ERROR, "wrong type");
  211. goto fail0;
  212. }
  213. uintmax_t n1;
  214. uintmax_t n2;
  215. if (!parse_unsigned_integer(NCDVal_StringValue(n1_arg), &n1) || !parse_unsigned_integer(NCDVal_StringValue(n2_arg), &n2)) {
  216. ModuleLog(o->i, BLOG_ERROR, "wrong value");
  217. goto fail0;
  218. }
  219. if (!cfunc(i, n1, n2, o->value)) {
  220. goto fail0;
  221. }
  222. NCDModuleInst_Backend_Up(i);
  223. return;
  224. fail0:
  225. NCDModuleInst_Backend_SetError(i);
  226. NCDModuleInst_Backend_Dead(i);
  227. }
  228. static int number_func_getvar2 (void *vo, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  229. {
  230. struct number_instance *o = vo;
  231. if (name == NCD_STRING_EMPTY) {
  232. *out = NCDVal_NewString(mem, o->value);
  233. if (NCDVal_IsInvalid(*out)) {
  234. ModuleLog(o->i, BLOG_ERROR, "NCDVal_NewString failed");
  235. }
  236. return 1;
  237. }
  238. return 0;
  239. }
  240. static void func_new_lesser (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  241. {
  242. new_boolean_templ(vo, i, params, compute_lesser);
  243. }
  244. static void func_new_greater (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  245. {
  246. new_boolean_templ(vo, i, params, compute_greater);
  247. }
  248. static void func_new_lesser_equal (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  249. {
  250. new_boolean_templ(vo, i, params, compute_lesser_equal);
  251. }
  252. static void func_new_greater_equal (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  253. {
  254. new_boolean_templ(vo, i, params, compute_greater_equal);
  255. }
  256. static void func_new_equal (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  257. {
  258. new_boolean_templ(vo, i, params, compute_equal);
  259. }
  260. static void func_new_different (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  261. {
  262. new_boolean_templ(vo, i, params, compute_different);
  263. }
  264. static void func_new_add (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  265. {
  266. new_number_templ(vo, i, params, compute_add);
  267. }
  268. static void func_new_subtract (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  269. {
  270. new_number_templ(vo, i, params, compute_subtract);
  271. }
  272. static void func_new_multiply (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  273. {
  274. new_number_templ(vo, i, params, compute_multiply);
  275. }
  276. static void func_new_divide (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  277. {
  278. new_number_templ(vo, i, params, compute_divide);
  279. }
  280. static void func_new_modulo (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  281. {
  282. new_number_templ(vo, i, params, compute_modulo);
  283. }
  284. static struct NCDModule modules[] = {
  285. {
  286. .type = "num_lesser",
  287. .func_new2 = func_new_lesser,
  288. .func_getvar2 = boolean_func_getvar2,
  289. .alloc_size = sizeof(struct boolean_instance)
  290. }, {
  291. .type = "num_greater",
  292. .func_new2 = func_new_greater,
  293. .func_getvar2 = boolean_func_getvar2,
  294. .alloc_size = sizeof(struct boolean_instance)
  295. }, {
  296. .type = "num_lesser_equal",
  297. .func_new2 = func_new_lesser_equal,
  298. .func_getvar2 = boolean_func_getvar2,
  299. .alloc_size = sizeof(struct boolean_instance)
  300. }, {
  301. .type = "num_greater_equal",
  302. .func_new2 = func_new_greater_equal,
  303. .func_getvar2 = boolean_func_getvar2,
  304. .alloc_size = sizeof(struct boolean_instance)
  305. }, {
  306. .type = "num_equal",
  307. .func_new2 = func_new_equal,
  308. .func_getvar2 = boolean_func_getvar2,
  309. .alloc_size = sizeof(struct boolean_instance)
  310. }, {
  311. .type = "num_different",
  312. .func_new2 = func_new_different,
  313. .func_getvar2 = boolean_func_getvar2,
  314. .alloc_size = sizeof(struct boolean_instance)
  315. }, {
  316. .type = "num_add",
  317. .func_new2 = func_new_add,
  318. .func_getvar2 = number_func_getvar2,
  319. .alloc_size = sizeof(struct number_instance)
  320. }, {
  321. .type = "num_subtract",
  322. .func_new2 = func_new_subtract,
  323. .func_getvar2 = number_func_getvar2,
  324. .alloc_size = sizeof(struct number_instance)
  325. }, {
  326. .type = "num_multiply",
  327. .func_new2 = func_new_multiply,
  328. .func_getvar2 = number_func_getvar2,
  329. .alloc_size = sizeof(struct number_instance)
  330. }, {
  331. .type = "num_divide",
  332. .func_new2 = func_new_divide,
  333. .func_getvar2 = number_func_getvar2,
  334. .alloc_size = sizeof(struct number_instance)
  335. }, {
  336. .type = "num_modulo",
  337. .func_new2 = func_new_modulo,
  338. .func_getvar2 = number_func_getvar2,
  339. .alloc_size = sizeof(struct number_instance)
  340. }, {
  341. .type = NULL
  342. }
  343. };
  344. const struct NCDModuleGroup ncdmodule_arithmetic = {
  345. .modules = modules
  346. };