arithmetic.c 12 KB

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