ncdval_test.c 7.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206
  1. /**
  2. * @file ncdval_test.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 <stdio.h>
  30. #include <ncd/NCDVal.h>
  31. #include <ncd/NCDStringIndex.h>
  32. #include <ncd/static_strings.h>
  33. #include <base/BLog.h>
  34. #include <misc/debug.h>
  35. #define FORCE(cmd) if (!(cmd)) { fprintf(stderr, "failed\n"); exit(1); }
  36. static void print_indent (int indent)
  37. {
  38. for (int i = 0; i < indent; i++) {
  39. printf(" ");
  40. }
  41. }
  42. static void print_value (NCDValRef val, unsigned int indent)
  43. {
  44. switch (NCDVal_Type(val)) {
  45. case NCDVAL_STRING: {
  46. NCDValNullTermString nts;
  47. FORCE( NCDVal_StringNullTerminate(val, &nts) )
  48. print_indent(indent);
  49. printf("string(%zu) %s\n", NCDVal_StringLength(val), nts.data);
  50. NCDValNullTermString_Free(&nts);
  51. } break;
  52. case NCDVAL_LIST: {
  53. size_t count = NCDVal_ListCount(val);
  54. print_indent(indent);
  55. printf("list(%zu)\n", NCDVal_ListCount(val));
  56. for (size_t i = 0; i < count; i++) {
  57. NCDValRef elem_val = NCDVal_ListGet(val, i);
  58. print_value(elem_val, indent + 1);
  59. }
  60. } break;
  61. case NCDVAL_MAP: {
  62. print_indent(indent);
  63. printf("map(%zu)\n", NCDVal_MapCount(val));
  64. for (NCDValMapElem e = NCDVal_MapOrderedFirst(val); !NCDVal_MapElemInvalid(e); e = NCDVal_MapOrderedNext(val, e)) {
  65. NCDValRef ekey = NCDVal_MapElemKey(val, e);
  66. NCDValRef eval = NCDVal_MapElemVal(val, e);
  67. print_indent(indent + 1);
  68. printf("key=\n");
  69. print_value(ekey, indent + 2);
  70. print_indent(indent + 1);
  71. printf("val=\n");
  72. print_value(eval, indent + 2);
  73. }
  74. } break;
  75. }
  76. }
  77. int main ()
  78. {
  79. int res;
  80. BLog_InitStdout();
  81. NCDStringIndex string_index;
  82. FORCE( NCDStringIndex_Init(&string_index) )
  83. // Some basic usage of values.
  84. NCDValMem mem;
  85. NCDValMem_Init(&mem);
  86. NCDValRef s1 = NCDVal_NewString(&mem, "Hello World");
  87. FORCE( !NCDVal_IsInvalid(s1) )
  88. ASSERT( NCDVal_IsString(s1) )
  89. ASSERT( !NCDVal_IsIdString(s1) )
  90. ASSERT( NCDVal_Type(s1) == NCDVAL_STRING )
  91. NCDValRef s2 = NCDVal_NewString(&mem, "This is reeeeeeeeeeeeeallllllllyyyyy fun!");
  92. FORCE( !NCDVal_IsInvalid(s2) )
  93. NCDValRef l1 = NCDVal_NewList(&mem, 10);
  94. FORCE( !NCDVal_IsInvalid(l1) )
  95. FORCE( NCDVal_ListAppend(l1, s1) )
  96. FORCE( NCDVal_ListAppend(l1, s2) )
  97. print_value(s1, 0);
  98. print_value(s2, 0);
  99. print_value(l1, 0);
  100. NCDValRef k1 = NCDVal_NewString(&mem, "K1");
  101. FORCE( !NCDVal_IsInvalid(k1) )
  102. NCDValRef v1 = NCDVal_NewString(&mem, "V1");
  103. FORCE( !NCDVal_IsInvalid(v1) )
  104. NCDValRef k2 = NCDVal_NewString(&mem, "K2");
  105. FORCE( !NCDVal_IsInvalid(k2) )
  106. NCDValRef v2 = NCDVal_NewString(&mem, "V2");
  107. FORCE( !NCDVal_IsInvalid(v2) )
  108. NCDValRef m1 = NCDVal_NewMap(&mem, 3);
  109. FORCE( !NCDVal_IsInvalid(m1) )
  110. FORCE( NCDVal_MapInsert(m1, k1, v1, &res) && res )
  111. FORCE( NCDVal_MapInsert(m1, k2, v2, &res) && res )
  112. ASSERT( NCDVal_MapGetValue(m1, "K1").idx == v1.idx )
  113. ASSERT( NCDVal_MapGetValue(m1, "K2").idx == v2.idx )
  114. ASSERT( NCDVal_IsInvalid(NCDVal_MapGetValue(m1, "K3")) )
  115. NCDValRef ids1 = NCDVal_NewIdString(&mem, NCD_STRING_ARG1, &string_index);
  116. FORCE( !NCDVal_IsInvalid(ids1) )
  117. ASSERT( !memcmp(NCDVal_StringData(ids1), "_arg1", 5) )
  118. ASSERT( NCDVal_StringLength(ids1) == 5 )
  119. ASSERT( !NCDVal_StringHasNulls(ids1) )
  120. ASSERT( NCDVal_StringEquals(ids1, "_arg1") )
  121. ASSERT( NCDVal_Type(ids1) == NCDVAL_STRING )
  122. ASSERT( NCDVal_IsIdString(ids1) )
  123. NCDValRef ids2 = NCDVal_NewIdString(&mem, NCD_STRING_ARG2, &string_index);
  124. FORCE( !NCDVal_IsInvalid(ids2) )
  125. ASSERT( !memcmp(NCDVal_StringData(ids2), "_arg2", 5) )
  126. ASSERT( NCDVal_StringLength(ids2) == 5 )
  127. ASSERT( !NCDVal_StringHasNulls(ids2) )
  128. ASSERT( NCDVal_StringEquals(ids2, "_arg2") )
  129. ASSERT( NCDVal_Type(ids2) == NCDVAL_STRING )
  130. ASSERT( NCDVal_IsIdString(ids2) )
  131. FORCE( NCDVal_MapInsert(m1, ids1, ids2, &res) && res )
  132. ASSERT( NCDVal_MapGetValue(m1, "_arg1").idx == ids2.idx )
  133. print_value(m1, 0);
  134. NCDValRef copy = NCDVal_NewCopy(&mem, m1);
  135. FORCE( !NCDVal_IsInvalid(copy) )
  136. ASSERT( NCDVal_Compare(copy, m1) == 0 )
  137. NCDValMem_Free(&mem);
  138. // Try to make copies of a string within the same memory object.
  139. // This is an evil test because we cannot simply copy a string using e.g.
  140. // NCDVal_NewStringBin() - it requires that the buffer passed
  141. // be outside the memory object of the new string.
  142. // We use NCDVal_NewCopy(), which takes care of this by creating
  143. // an uninitialized string using NCDVal_NewStringUninitialized() and
  144. // then copyng the data.
  145. NCDValMem_Init(&mem);
  146. NCDValRef s[100];
  147. s[0] = NCDVal_NewString(&mem, "Eeeeeeeeeeeevil.");
  148. FORCE( !NCDVal_IsInvalid(s[0]) )
  149. for (int i = 1; i < 100; i++) {
  150. s[i] = NCDVal_NewCopy(&mem, s[i - 1]);
  151. FORCE( !NCDVal_IsInvalid(s[i]) )
  152. ASSERT( NCDVal_StringEquals(s[i - 1], "Eeeeeeeeeeeevil.") )
  153. ASSERT( NCDVal_StringEquals(s[i], "Eeeeeeeeeeeevil.") )
  154. }
  155. for (int i = 0; i < 100; i++) {
  156. ASSERT( NCDVal_StringEquals(s[i], "Eeeeeeeeeeeevil.") )
  157. }
  158. NCDValMem_Free(&mem);
  159. NCDStringIndex_Free(&string_index);
  160. return 0;
  161. }