NCDStringIndex.c 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226
  1. /**
  2. * @file NCDStringIndex.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 <string.h>
  30. #include <stdlib.h>
  31. #include <misc/hashfun.h>
  32. #include <misc/strdup.h>
  33. #include <misc/array_length.h>
  34. #include <base/BLog.h>
  35. #include "NCDStringIndex.h"
  36. #include "NCDStringIndex_hash.h"
  37. #include <structure/CHash_impl.h>
  38. #define GROWARRAY_NAME Array
  39. #define GROWARRAY_OBJECT_TYPE NCDStringIndex
  40. #define GROWARRAY_ARRAY_MEMBER entries
  41. #define GROWARRAY_CAPACITY_MEMBER entries_capacity
  42. #define GROWARRAY_MAX_CAPACITY NCD_STRING_ID_MAX
  43. #include <misc/grow_array.h>
  44. #include <generated/blog_channel_ncd.h>
  45. // NOTE: keep synchronized with static_strings.h
  46. static const char *static_strings[] = {
  47. "",
  48. "_args",
  49. "_arg0",
  50. "_arg1",
  51. "_arg2",
  52. "_arg3",
  53. "_arg4",
  54. "_arg5",
  55. "_arg6",
  56. "_arg7",
  57. "_arg8",
  58. "_arg9",
  59. "_arg10",
  60. "_arg11",
  61. "_arg12",
  62. "_arg13",
  63. "_arg14",
  64. "_arg15",
  65. "_arg16",
  66. "_arg17",
  67. "_arg18",
  68. "_arg19"
  69. };
  70. static NCD_string_id_t do_get (NCDStringIndex *o, const char *str, size_t str_len)
  71. {
  72. ASSERT(str)
  73. ASSERT(!memchr(str, '\0', str_len))
  74. NCDStringIndex_hash_key key = {str, str_len};
  75. NCDStringIndex__HashRef ref = NCDStringIndex__Hash_Lookup(&o->hash, o->entries, key);
  76. ASSERT(ref.link == -1 || ref.link >= 0)
  77. ASSERT(ref.link == -1 || ref.link < o->entries_size)
  78. ASSERT(ref.link == -1 || (ref.ptr->str_len == str_len && !memcmp(ref.ptr->str, str, str_len)))
  79. if (ref.link != -1) {
  80. return ref.link;
  81. }
  82. if (o->entries_size == o->entries_capacity && !Array_DoubleUp(o)) {
  83. BLog(BLOG_ERROR, "Array_DoubleUp failed");
  84. return -1;
  85. }
  86. ASSERT(o->entries_size < o->entries_capacity)
  87. struct NCDStringIndex__entry *entry = &o->entries[o->entries_size];
  88. if (!(entry->str = b_strdup_bin(str, str_len))) {
  89. BLog(BLOG_ERROR, "b_strdup_bin failed");
  90. return -1;
  91. }
  92. entry->str_len = str_len;
  93. NCDStringIndex__HashRef newref = {entry, o->entries_size};
  94. int res = NCDStringIndex__Hash_Insert(&o->hash, o->entries, newref, NULL);
  95. ASSERT_EXECUTE(res)
  96. return o->entries_size++;
  97. }
  98. int NCDStringIndex_Init (NCDStringIndex *o)
  99. {
  100. o->entries_size = 0;
  101. if (!Array_Init(o, NCDSTRINGINDEX_INITIAL_CAPACITY)) {
  102. BLog(BLOG_ERROR, "Array_Init failed");
  103. goto fail0;
  104. }
  105. if (!NCDStringIndex__Hash_Init(&o->hash, NCDSTRINGINDEX_HASH_BUCKETS)) {
  106. BLog(BLOG_ERROR, "NCDStringIndex__Hash_Init failed");
  107. goto fail1;
  108. }
  109. for (size_t i = 0; i < B_ARRAY_LENGTH(static_strings); i++) {
  110. if (do_get(o, static_strings[i], strlen(static_strings[i])) < 0) {
  111. goto fail2;
  112. }
  113. }
  114. DebugObject_Init(&o->d_obj);
  115. return 1;
  116. fail2:
  117. for (NCD_string_id_t i = 0; i < o->entries_size; i++) {
  118. free(o->entries[i].str);
  119. }
  120. NCDStringIndex__Hash_Free(&o->hash);
  121. fail1:
  122. Array_Free(o);
  123. fail0:
  124. return 0;
  125. }
  126. void NCDStringIndex_Free (NCDStringIndex *o)
  127. {
  128. DebugObject_Free(&o->d_obj);
  129. for (NCD_string_id_t i = 0; i < o->entries_size; i++) {
  130. free(o->entries[i].str);
  131. }
  132. NCDStringIndex__Hash_Free(&o->hash);
  133. Array_Free(o);
  134. }
  135. NCD_string_id_t NCDStringIndex_Lookup (NCDStringIndex *o, const char *str)
  136. {
  137. DebugObject_Access(&o->d_obj);
  138. ASSERT(str)
  139. return NCDStringIndex_LookupBin(o, str, strlen(str));
  140. }
  141. NCD_string_id_t NCDStringIndex_LookupBin (NCDStringIndex *o, const char *str, size_t str_len)
  142. {
  143. DebugObject_Access(&o->d_obj);
  144. ASSERT(str)
  145. ASSERT(!memchr(str, '\0', str_len))
  146. NCDStringIndex_hash_key key = {str, str_len};
  147. NCDStringIndex__HashRef ref = NCDStringIndex__Hash_Lookup(&o->hash, o->entries, key);
  148. ASSERT(ref.link == -1 || ref.link >= 0)
  149. ASSERT(ref.link == -1 || ref.link < o->entries_size)
  150. ASSERT(ref.link == -1 || (ref.ptr->str_len == str_len && !memcmp(ref.ptr->str, str, str_len)))
  151. return ref.link;
  152. }
  153. NCD_string_id_t NCDStringIndex_Get (NCDStringIndex *o, const char *str)
  154. {
  155. DebugObject_Access(&o->d_obj);
  156. ASSERT(str)
  157. return NCDStringIndex_GetBin(o, str, strlen(str));
  158. }
  159. NCD_string_id_t NCDStringIndex_GetBin (NCDStringIndex *o, const char *str, size_t str_len)
  160. {
  161. DebugObject_Access(&o->d_obj);
  162. ASSERT(str)
  163. ASSERT(!memchr(str, '\0', str_len))
  164. return do_get(o, str, str_len);
  165. }
  166. const char * NCDStringIndex_Value (NCDStringIndex *o, NCD_string_id_t id)
  167. {
  168. DebugObject_Access(&o->d_obj);
  169. ASSERT(id >= 0)
  170. ASSERT(id < o->entries_size)
  171. ASSERT(o->entries[id].str)
  172. return o->entries[id].str;
  173. }
  174. int NCDStringIndex_GetRequests (NCDStringIndex *o, struct NCD_string_request *requests)
  175. {
  176. DebugObject_Access(&o->d_obj);
  177. ASSERT(requests)
  178. while (requests->str) {
  179. NCD_string_id_t id = NCDStringIndex_Get(o, requests->str);
  180. if (id < 0) {
  181. return 0;
  182. }
  183. requests->id = id;
  184. requests++;
  185. }
  186. return 1;
  187. }