value_utils.c 4.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173
  1. /**
  2. * @file value_utils.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. #include <stdint.h>
  30. #include <stddef.h>
  31. #include <limits.h>
  32. #include <misc/debug.h>
  33. #include <misc/parse_number.h>
  34. #include <misc/strdup.h>
  35. #include <misc/balloc.h>
  36. #include <system/BTime.h>
  37. #include <ncd/NCDVal.h>
  38. #include <ncd/NCDStringIndex.h>
  39. #include <ncd/NCDModule.h>
  40. #include <ncd/static_strings.h>
  41. #include "value_utils.h"
  42. int ncd_is_none (NCDValRef string)
  43. {
  44. ASSERT(NCDVal_IsString(string))
  45. if (NCDVal_IsIdString(string)) {
  46. return NCDVal_IdStringId(string) == NCD_STRING_NONE;
  47. } else {
  48. return NCDVal_StringEquals(string, "<none>");
  49. }
  50. }
  51. NCDValRef ncd_make_boolean (NCDValMem *mem, int value, NCDStringIndex *string_index)
  52. {
  53. ASSERT(mem)
  54. ASSERT(string_index)
  55. NCD_string_id_t str_id = (value ? NCD_STRING_TRUE : NCD_STRING_FALSE);
  56. return NCDVal_NewIdString(mem, str_id, string_index);
  57. }
  58. int ncd_read_boolean (NCDValRef val, int *out)
  59. {
  60. ASSERT(out)
  61. if (!NCDVal_IsString(val)) {
  62. return 0;
  63. }
  64. if (NCDVal_IsIdString(val)) {
  65. *out = NCDVal_IdStringId(val) == NCD_STRING_TRUE;
  66. } else {
  67. *out = NCDVal_StringEquals(val, "true");
  68. }
  69. return 1;
  70. }
  71. int ncd_read_uintmax (NCDValRef val, uintmax_t *out)
  72. {
  73. ASSERT(out)
  74. if (!NCDVal_IsString(val)) {
  75. return 0;
  76. }
  77. return parse_unsigned_integer(NCDVal_StringMemRef(val), out);
  78. }
  79. int ncd_read_time (NCDValRef val, btime_t *out)
  80. {
  81. ASSERT(out)
  82. uintmax_t n;
  83. if (!ncd_read_uintmax(val, &n)) {
  84. return 0;
  85. }
  86. if (n > INT64_MAX) {
  87. return 0;
  88. }
  89. *out = n;
  90. return 1;
  91. }
  92. NCD_string_id_t ncd_get_string_id (NCDValRef string, NCDStringIndex *string_index)
  93. {
  94. ASSERT(NCDVal_IsString(string))
  95. ASSERT(string_index)
  96. if (NCDVal_IsIdString(string)) {
  97. return NCDVal_IdStringId(string);
  98. }
  99. return NCDStringIndex_GetBinMr(string_index, NCDVal_StringMemRef(string));
  100. }
  101. NCDValRef ncd_make_uintmax (NCDValMem *mem, uintmax_t value)
  102. {
  103. ASSERT(mem)
  104. int size = compute_decimal_repr_size(value);
  105. NCDValRef val = NCDVal_NewStringUninitialized(mem, size);
  106. if (!NCDVal_IsInvalid(val)) {
  107. char *data = (char *)NCDVal_StringData(val);
  108. generate_decimal_repr(value, data, size);
  109. }
  110. return val;
  111. }
  112. char * ncd_strdup (NCDValRef stringnonulls)
  113. {
  114. ASSERT(NCDVal_IsStringNoNulls(stringnonulls))
  115. return MemRef_StrDup(NCDVal_StringMemRef(stringnonulls));
  116. }
  117. int ncd_eval_func_args_ext (NCDCall const *call, size_t start, size_t count, NCDValMem *mem, NCDValRef *out)
  118. {
  119. ASSERT(start <= NCDCall_ArgCount(call))
  120. ASSERT(count <= NCDCall_ArgCount(call) - start)
  121. *out = NCDVal_NewList(mem, count);
  122. if (NCDVal_IsInvalid(*out)) {
  123. goto fail;
  124. }
  125. for (size_t i = 0; i < count; i++) {
  126. NCDValRef elem = NCDCall_EvalArg(call, start + i, mem);
  127. if (NCDVal_IsInvalid(elem)) {
  128. goto fail;
  129. }
  130. if (!NCDVal_ListAppend(*out, elem)) {
  131. goto fail;
  132. }
  133. }
  134. return 1;
  135. fail:
  136. return 0;
  137. }
  138. int ncd_eval_func_args (NCDCall const *call, NCDValMem *mem, NCDValRef *out)
  139. {
  140. return ncd_eval_func_args_ext(call, 0, NCDCall_ArgCount(call), mem, out);
  141. }