logical.c 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157
  1. /**
  2. * @file logical.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. * Module for logical operators.
  32. *
  33. * Synopsis: not(string val)
  34. * Variables:
  35. * string (empty) - "true" if val does not equal "true", "false" otherwise
  36. *
  37. * Synopsis: or([string val1, ...])
  38. * Variables:
  39. * string (empty) - "true" if at least one of the values equals "true", "false" otherwise
  40. *
  41. * Synopsis: and([string val1, ...])
  42. * Variables:
  43. * string (empty) - "true" if all of the values equal "true", "false" otherwise
  44. */
  45. #include <stdlib.h>
  46. #include <string.h>
  47. #include <ncd/module_common.h>
  48. #include <generated/blog_channel_ncd_logical.h>
  49. struct instance {
  50. NCDModuleInst *i;
  51. int value;
  52. };
  53. static void func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params, int is_not, int is_or)
  54. {
  55. struct instance *o = vo;
  56. o->i = i;
  57. // compute value from arguments
  58. if (is_not) {
  59. NCDValRef arg;
  60. if (!NCDVal_ListRead(params->args, 1, &arg)) {
  61. ModuleLog(o->i, BLOG_ERROR, "wrong arity");
  62. goto fail0;
  63. }
  64. int arg_val;
  65. if (!ncd_read_boolean(arg, &arg_val)) {
  66. ModuleLog(o->i, BLOG_ERROR, "bad argument");
  67. goto fail0;
  68. }
  69. o->value = !arg_val;
  70. } else {
  71. o->value = (is_or ? 0 : 1);
  72. size_t count = NCDVal_ListCount(params->args);
  73. for (size_t j = 0; j < count; j++) {
  74. NCDValRef arg = NCDVal_ListGet(params->args, j);
  75. int this_value;
  76. if (!ncd_read_boolean(arg, &this_value)) {
  77. ModuleLog(o->i, BLOG_ERROR, "bad argument");
  78. goto fail0;
  79. }
  80. if (is_or) {
  81. o->value = o->value || this_value;
  82. } else {
  83. o->value = o->value && this_value;
  84. }
  85. }
  86. }
  87. // signal up
  88. NCDModuleInst_Backend_Up(o->i);
  89. return;
  90. fail0:
  91. NCDModuleInst_Backend_DeadError(i);
  92. }
  93. static void func_new_not (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  94. {
  95. func_new(vo, i, params, 1, 0);
  96. }
  97. static void func_new_or (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  98. {
  99. func_new(vo, i, params, 0, 1);
  100. }
  101. static void func_new_and (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  102. {
  103. func_new(vo, i, params, 0, 0);
  104. }
  105. static int func_getvar2 (void *vo, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  106. {
  107. struct instance *o = vo;
  108. if (name == NCD_STRING_EMPTY) {
  109. *out = ncd_make_boolean(mem, o->value);
  110. return 1;
  111. }
  112. return 0;
  113. }
  114. static struct NCDModule modules[] = {
  115. {
  116. .type = "not",
  117. .func_new2 = func_new_not,
  118. .func_getvar2 = func_getvar2,
  119. .alloc_size = sizeof(struct instance)
  120. }, {
  121. .type = "or",
  122. .func_new2 = func_new_or,
  123. .func_getvar2 = func_getvar2,
  124. .alloc_size = sizeof(struct instance)
  125. }, {
  126. .type = "and",
  127. .func_new2 = func_new_and,
  128. .func_getvar2 = func_getvar2,
  129. .alloc_size = sizeof(struct instance)
  130. }, {
  131. .type = NULL
  132. }
  133. };
  134. const struct NCDModuleGroup ncdmodule_logical = {
  135. .modules = modules
  136. };