arithmetic.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382
  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/module_common.h>
  72. #include <generated/blog_channel_ncd_arithmetic.h>
  73. struct boolean_instance {
  74. NCDModuleInst *i;
  75. int value;
  76. };
  77. typedef int (*boolean_compute_func) (uintmax_t n1, uintmax_t n2);
  78. struct number_instance {
  79. NCDModuleInst *i;
  80. uintmax_t value;
  81. };
  82. typedef int (*number_compute_func) (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, uintmax_t *out);
  83. static int compute_lesser (uintmax_t n1, uintmax_t n2)
  84. {
  85. return n1 < n2;
  86. }
  87. static int compute_greater (uintmax_t n1, uintmax_t n2)
  88. {
  89. return n1 > n2;
  90. }
  91. static int compute_lesser_equal (uintmax_t n1, uintmax_t n2)
  92. {
  93. return n1 <= n2;
  94. }
  95. static int compute_greater_equal (uintmax_t n1, uintmax_t n2)
  96. {
  97. return n1 >= n2;
  98. }
  99. static int compute_equal (uintmax_t n1, uintmax_t n2)
  100. {
  101. return n1 == n2;
  102. }
  103. static int compute_different (uintmax_t n1, uintmax_t n2)
  104. {
  105. return n1 != n2;
  106. }
  107. static int compute_add (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, uintmax_t *out)
  108. {
  109. if (n1 > UINTMAX_MAX - n2) {
  110. ModuleLog(i, BLOG_ERROR, "addition overflow");
  111. return 0;
  112. }
  113. *out = n1 + n2;
  114. return 1;
  115. }
  116. static int compute_subtract (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, uintmax_t *out)
  117. {
  118. if (n1 < n2) {
  119. ModuleLog(i, BLOG_ERROR, "subtraction underflow");
  120. return 0;
  121. }
  122. *out = n1 - n2;
  123. return 1;
  124. }
  125. static int compute_multiply (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, uintmax_t *out)
  126. {
  127. if (n2 != 0 && n1 > UINTMAX_MAX / n2) {
  128. ModuleLog(i, BLOG_ERROR, "multiplication overflow");
  129. return 0;
  130. }
  131. *out = n1 * n2;
  132. return 1;
  133. }
  134. static int compute_divide (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, uintmax_t *out)
  135. {
  136. if (n2 == 0) {
  137. ModuleLog(i, BLOG_ERROR, "division quotient is zero");
  138. return 0;
  139. }
  140. *out = n1 / n2;
  141. return 1;
  142. }
  143. static int compute_modulo (NCDModuleInst *i, uintmax_t n1, uintmax_t n2, uintmax_t *out)
  144. {
  145. if (n2 == 0) {
  146. ModuleLog(i, BLOG_ERROR, "modulo modulus is zero");
  147. return 0;
  148. }
  149. *out = n1 % n2;
  150. return 1;
  151. }
  152. static void new_boolean_templ (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params, boolean_compute_func cfunc)
  153. {
  154. struct boolean_instance *o = vo;
  155. o->i = i;
  156. NCDValRef n1_arg;
  157. NCDValRef n2_arg;
  158. if (!NCDVal_ListRead(params->args, 2, &n1_arg, &n2_arg)) {
  159. ModuleLog(i, BLOG_ERROR, "wrong arity");
  160. goto fail0;
  161. }
  162. uintmax_t n1;
  163. if (!ncd_read_uintmax(n1_arg, &n1)) {
  164. ModuleLog(o->i, BLOG_ERROR, "wrong first argument");
  165. goto fail0;
  166. }
  167. uintmax_t n2;
  168. if (!ncd_read_uintmax(n2_arg, &n2)) {
  169. ModuleLog(o->i, BLOG_ERROR, "wrong second argument");
  170. goto fail0;
  171. }
  172. o->value = cfunc(n1, n2);
  173. NCDModuleInst_Backend_Up(i);
  174. return;
  175. fail0:
  176. NCDModuleInst_Backend_DeadError(i);
  177. }
  178. static int boolean_func_getvar2 (void *vo, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  179. {
  180. struct boolean_instance *o = vo;
  181. if (name == NCD_STRING_EMPTY) {
  182. *out = ncd_make_boolean(mem, o->value, o->i->params->iparams->string_index);
  183. return 1;
  184. }
  185. return 0;
  186. }
  187. static void new_number_templ (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params, number_compute_func cfunc)
  188. {
  189. struct number_instance *o = vo;
  190. o->i = i;
  191. NCDValRef n1_arg;
  192. NCDValRef n2_arg;
  193. if (!NCDVal_ListRead(params->args, 2, &n1_arg, &n2_arg)) {
  194. ModuleLog(i, BLOG_ERROR, "wrong arity");
  195. goto fail0;
  196. }
  197. uintmax_t n1;
  198. if (!ncd_read_uintmax(n1_arg, &n1)) {
  199. ModuleLog(o->i, BLOG_ERROR, "wrong first argument");
  200. goto fail0;
  201. }
  202. uintmax_t n2;
  203. if (!ncd_read_uintmax(n2_arg, &n2)) {
  204. ModuleLog(o->i, BLOG_ERROR, "wrong second argument");
  205. goto fail0;
  206. }
  207. if (!cfunc(i, n1, n2, &o->value)) {
  208. goto fail0;
  209. }
  210. NCDModuleInst_Backend_Up(i);
  211. return;
  212. fail0:
  213. NCDModuleInst_Backend_DeadError(i);
  214. }
  215. static int number_func_getvar2 (void *vo, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  216. {
  217. struct number_instance *o = vo;
  218. if (name == NCD_STRING_EMPTY) {
  219. *out = ncd_make_uintmax(mem, o->value);
  220. return 1;
  221. }
  222. return 0;
  223. }
  224. static void func_new_lesser (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  225. {
  226. new_boolean_templ(vo, i, params, compute_lesser);
  227. }
  228. static void func_new_greater (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  229. {
  230. new_boolean_templ(vo, i, params, compute_greater);
  231. }
  232. static void func_new_lesser_equal (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  233. {
  234. new_boolean_templ(vo, i, params, compute_lesser_equal);
  235. }
  236. static void func_new_greater_equal (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  237. {
  238. new_boolean_templ(vo, i, params, compute_greater_equal);
  239. }
  240. static void func_new_equal (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  241. {
  242. new_boolean_templ(vo, i, params, compute_equal);
  243. }
  244. static void func_new_different (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  245. {
  246. new_boolean_templ(vo, i, params, compute_different);
  247. }
  248. static void func_new_add (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  249. {
  250. new_number_templ(vo, i, params, compute_add);
  251. }
  252. static void func_new_subtract (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  253. {
  254. new_number_templ(vo, i, params, compute_subtract);
  255. }
  256. static void func_new_multiply (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  257. {
  258. new_number_templ(vo, i, params, compute_multiply);
  259. }
  260. static void func_new_divide (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  261. {
  262. new_number_templ(vo, i, params, compute_divide);
  263. }
  264. static void func_new_modulo (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  265. {
  266. new_number_templ(vo, i, params, compute_modulo);
  267. }
  268. static struct NCDModule modules[] = {
  269. {
  270. .type = "num_lesser",
  271. .func_new2 = func_new_lesser,
  272. .func_getvar2 = boolean_func_getvar2,
  273. .alloc_size = sizeof(struct boolean_instance)
  274. }, {
  275. .type = "num_greater",
  276. .func_new2 = func_new_greater,
  277. .func_getvar2 = boolean_func_getvar2,
  278. .alloc_size = sizeof(struct boolean_instance)
  279. }, {
  280. .type = "num_lesser_equal",
  281. .func_new2 = func_new_lesser_equal,
  282. .func_getvar2 = boolean_func_getvar2,
  283. .alloc_size = sizeof(struct boolean_instance)
  284. }, {
  285. .type = "num_greater_equal",
  286. .func_new2 = func_new_greater_equal,
  287. .func_getvar2 = boolean_func_getvar2,
  288. .alloc_size = sizeof(struct boolean_instance)
  289. }, {
  290. .type = "num_equal",
  291. .func_new2 = func_new_equal,
  292. .func_getvar2 = boolean_func_getvar2,
  293. .alloc_size = sizeof(struct boolean_instance)
  294. }, {
  295. .type = "num_different",
  296. .func_new2 = func_new_different,
  297. .func_getvar2 = boolean_func_getvar2,
  298. .alloc_size = sizeof(struct boolean_instance)
  299. }, {
  300. .type = "num_add",
  301. .func_new2 = func_new_add,
  302. .func_getvar2 = number_func_getvar2,
  303. .alloc_size = sizeof(struct number_instance)
  304. }, {
  305. .type = "num_subtract",
  306. .func_new2 = func_new_subtract,
  307. .func_getvar2 = number_func_getvar2,
  308. .alloc_size = sizeof(struct number_instance)
  309. }, {
  310. .type = "num_multiply",
  311. .func_new2 = func_new_multiply,
  312. .func_getvar2 = number_func_getvar2,
  313. .alloc_size = sizeof(struct number_instance)
  314. }, {
  315. .type = "num_divide",
  316. .func_new2 = func_new_divide,
  317. .func_getvar2 = number_func_getvar2,
  318. .alloc_size = sizeof(struct number_instance)
  319. }, {
  320. .type = "num_modulo",
  321. .func_new2 = func_new_modulo,
  322. .func_getvar2 = number_func_getvar2,
  323. .alloc_size = sizeof(struct number_instance)
  324. }, {
  325. .type = NULL
  326. }
  327. };
  328. const struct NCDModuleGroup ncdmodule_arithmetic = {
  329. .modules = modules
  330. };