from_string.c 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123
  1. /**
  2. * @file from_string.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. * Synopsis:
  32. * from_string(string str)
  33. * Variables:
  34. * (empty) - str, parsed as a value
  35. */
  36. #include <stdlib.h>
  37. #include <string.h>
  38. #include <ncd/NCDValParser.h>
  39. #include <ncd/module_common.h>
  40. #include <generated/blog_channel_ncd_from_string.h>
  41. struct instance {
  42. NCDModuleInst *i;
  43. NCDValMem mem;
  44. NCDValRef val;
  45. };
  46. static void func_new (void *vo, NCDModuleInst *i, const struct NCDModuleInst_new_params *params)
  47. {
  48. struct instance *o = vo;
  49. o->i = i;
  50. // read arguments
  51. NCDValRef str_arg;
  52. if (!NCDVal_ListRead(params->args, 1, &str_arg)) {
  53. ModuleLog(i, BLOG_ERROR, "wrong arity");
  54. goto fail0;
  55. }
  56. if (!NCDVal_IsString(str_arg)) {
  57. ModuleLog(i, BLOG_ERROR, "wrong type");
  58. goto fail0;
  59. }
  60. // init mem
  61. NCDValMem_Init(&o->mem, i->params->iparams->string_index);
  62. // parse value string
  63. if (!NCDValParser_Parse(NCDVal_StringMemRef(str_arg), &o->mem, &o->val)) {
  64. ModuleLog(i, BLOG_ERROR, "failed to parse");
  65. goto fail1;
  66. }
  67. // signal up
  68. NCDModuleInst_Backend_Up(i);
  69. return;
  70. fail1:
  71. NCDValMem_Free(&o->mem);
  72. fail0:
  73. NCDModuleInst_Backend_DeadError(i);
  74. }
  75. static void func_die (void *vo)
  76. {
  77. struct instance *o = vo;
  78. // free mem
  79. NCDValMem_Free(&o->mem);
  80. NCDModuleInst_Backend_Dead(o->i);
  81. }
  82. static int func_getvar2 (void *vo, NCD_string_id_t name, NCDValMem *mem, NCDValRef *out)
  83. {
  84. struct instance *o = vo;
  85. if (name == NCD_STRING_EMPTY) {
  86. *out = NCDVal_NewCopy(mem, o->val);
  87. return 1;
  88. }
  89. return 0;
  90. }
  91. static struct NCDModule modules[] = {
  92. {
  93. .type = "from_string",
  94. .func_new2 = func_new,
  95. .func_die = func_die,
  96. .func_getvar2 = func_getvar2,
  97. .alloc_size = sizeof(struct instance)
  98. }, {
  99. .type = NULL
  100. }
  101. };
  102. const struct NCDModuleGroup ncdmodule_from_string = {
  103. .modules = modules
  104. };