NCDInterpBlock.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383
  1. /**
  2. * @file NCDInterpBlock.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 <limits.h>
  31. #include <string.h>
  32. #include <stdlib.h>
  33. #include <misc/balloc.h>
  34. #include <misc/split_string.h>
  35. #include <misc/hashfun.h>
  36. #include <misc/maxalign.h>
  37. #include <misc/strdup.h>
  38. #include <base/BLog.h>
  39. #include "NCDInterpBlock.h"
  40. #include <generated/blog_channel_ncd.h>
  41. #include "NCDInterpBlock_hash.h"
  42. #include <structure/CHash_impl.h>
  43. static int compute_prealloc (NCDInterpBlock *o)
  44. {
  45. int size = 0;
  46. for (int i = 0; i < o->num_stmts; i++) {
  47. int mod = size % BMAX_ALIGN;
  48. int align_size = (mod == 0 ? 0 : BMAX_ALIGN - mod);
  49. if (align_size + o->stmts[i].alloc_size > INT_MAX - size) {
  50. return 0;
  51. }
  52. o->stmts[i].prealloc_offset = size + align_size;
  53. size += align_size + o->stmts[i].alloc_size;
  54. }
  55. ASSERT(size >= 0)
  56. o->prealloc_size = size;
  57. return 1;
  58. }
  59. int convert_value_recurser (NCDPlaceholderDb *pdb, NCDValue *value, NCDValMem *mem, NCDValRef *out)
  60. {
  61. ASSERT(pdb)
  62. ASSERT((NCDValue_Type(value), 1))
  63. ASSERT(mem)
  64. ASSERT(out)
  65. switch (NCDValue_Type(value)) {
  66. case NCDVALUE_STRING: {
  67. *out = NCDVal_NewStringBin(mem, (const uint8_t *)NCDValue_StringValue(value), NCDValue_StringLength(value));
  68. if (NCDVal_IsInvalid(*out)) {
  69. goto fail;
  70. }
  71. } break;
  72. case NCDVALUE_LIST: {
  73. *out = NCDVal_NewList(mem, NCDValue_ListCount(value));
  74. if (NCDVal_IsInvalid(*out)) {
  75. goto fail;
  76. }
  77. for (NCDValue *e = NCDValue_ListFirst(value); e; e = NCDValue_ListNext(value, e)) {
  78. NCDValRef vval;
  79. if (!convert_value_recurser(pdb, e, mem, &vval)) {
  80. goto fail;
  81. }
  82. NCDVal_ListAppend(*out, vval);
  83. }
  84. } break;
  85. case NCDVALUE_MAP: {
  86. *out = NCDVal_NewMap(mem, NCDValue_MapCount(value));
  87. if (NCDVal_IsInvalid(*out)) {
  88. goto fail;
  89. }
  90. for (NCDValue *ekey = NCDValue_MapFirstKey(value); ekey; ekey = NCDValue_MapNextKey(value, ekey)) {
  91. NCDValue *eval = NCDValue_MapKeyValue(value, ekey);
  92. NCDValRef vkey;
  93. NCDValRef vval;
  94. if (!convert_value_recurser(pdb, ekey, mem, &vkey) ||
  95. !convert_value_recurser(pdb, eval, mem, &vval)
  96. ) {
  97. goto fail;
  98. }
  99. int res = NCDVal_MapInsert(*out, vkey, vval);
  100. ASSERT(res) // we assume different variables get different placeholder ids
  101. }
  102. } break;
  103. case NCDVALUE_VAR: {
  104. int plid;
  105. if (!NCDPlaceholderDb_AddVariable(pdb, NCDValue_VarName(value), &plid)) {
  106. goto fail;
  107. }
  108. if (NCDVAL_MINIDX + plid >= -1) {
  109. goto fail;
  110. }
  111. *out = NCDVal_NewPlaceholder(mem, plid);
  112. } break;
  113. default:
  114. goto fail;
  115. }
  116. return 1;
  117. fail:
  118. return 0;
  119. }
  120. int NCDInterpBlock_Init (NCDInterpBlock *o, NCDBlock *block, NCDProcess *process, NCDPlaceholderDb *pdb)
  121. {
  122. ASSERT(block)
  123. ASSERT(process)
  124. ASSERT(pdb)
  125. if (NCDBlock_NumStatements(block) > INT_MAX) {
  126. BLog(BLOG_ERROR, "too many statements");
  127. goto fail0;
  128. }
  129. int num_stmts = NCDBlock_NumStatements(block);
  130. if (!(o->stmts = BAllocArray(num_stmts, sizeof(o->stmts[0])))) {
  131. BLog(BLOG_ERROR, "BAllocArray failed");
  132. goto fail0;
  133. }
  134. if (!NCDInterpBlock__Hash_Init(&o->hash, num_stmts)) {
  135. BLog(BLOG_ERROR, "NCDInterpBlock__Hash_Init failed");
  136. goto fail1;
  137. }
  138. o->num_stmts = 0;
  139. o->prealloc_size = -1;
  140. o->process = process;
  141. for (NCDStatement *s = NCDBlock_FirstStatement(block); s; s = NCDBlock_NextStatement(block, s)) {
  142. ASSERT(NCDStatement_Type(s) == NCDSTATEMENT_REG)
  143. struct NCDInterpBlock__stmt *e = &o->stmts[o->num_stmts];
  144. e->name = NCDStatement_Name(s);
  145. e->cmdname = NCDStatement_RegCmdName(s);
  146. e->objnames = NULL;
  147. e->num_objnames = 0;
  148. e->alloc_size = 0;
  149. NCDValMem mem;
  150. NCDValMem_Init(&mem);
  151. NCDValRef val;
  152. if (!convert_value_recurser(pdb, NCDStatement_RegArgs(s), &mem, &val)) {
  153. BLog(BLOG_ERROR, "convert_value_recurser failed");
  154. NCDValMem_Free(&mem);
  155. goto loop_fail0;
  156. }
  157. e->arg_ref = NCDVal_ToSafe(val);
  158. if (!NCDValReplaceProg_Init(&e->arg_prog, val)) {
  159. BLog(BLOG_ERROR, "NCDValReplaceProg_Init failed");
  160. NCDValMem_Free(&mem);
  161. goto loop_fail0;
  162. }
  163. if (!NCDValMem_FreeExport(&mem, &e->arg_data, &e->arg_len)) {
  164. BLog(BLOG_ERROR, "NCDValMem_FreeExport failed");
  165. NCDValMem_Free(&mem);
  166. goto loop_fail1;
  167. }
  168. if (NCDStatement_RegObjName(s)) {
  169. if (!(e->objnames = b_strdup(NCDStatement_RegObjName(s)))) {
  170. BLog(BLOG_ERROR, "b_strdup failed");
  171. goto loop_fail2;
  172. }
  173. e->num_objnames = split_string_inplace2(e->objnames, '.') + 1;
  174. }
  175. if (e->name) {
  176. NCDInterpBlock__HashRef ref = {e, o->num_stmts};
  177. NCDInterpBlock__Hash_InsertMulti(&o->hash, o->stmts, ref);
  178. }
  179. o->num_stmts++;
  180. continue;
  181. loop_fail2:
  182. BFree(e->arg_data);
  183. loop_fail1:
  184. NCDValReplaceProg_Free(&e->arg_prog);
  185. loop_fail0:
  186. goto fail2;
  187. }
  188. ASSERT(o->num_stmts == num_stmts)
  189. DebugObject_Init(&o->d_obj);
  190. return 1;
  191. fail2:
  192. while (o->num_stmts-- > 0) {
  193. struct NCDInterpBlock__stmt *e = &o->stmts[o->num_stmts];
  194. free(e->objnames);
  195. BFree(e->arg_data);
  196. NCDValReplaceProg_Free(&e->arg_prog);
  197. }
  198. fail1:
  199. BFree(o->stmts);
  200. fail0:
  201. return 0;
  202. }
  203. void NCDInterpBlock_Free (NCDInterpBlock *o)
  204. {
  205. DebugObject_Free(&o->d_obj);
  206. while (o->num_stmts-- > 0) {
  207. struct NCDInterpBlock__stmt *e = &o->stmts[o->num_stmts];
  208. free(e->objnames);
  209. BFree(e->arg_data);
  210. NCDValReplaceProg_Free(&e->arg_prog);
  211. }
  212. NCDInterpBlock__Hash_Free(&o->hash);
  213. BFree(o->stmts);
  214. }
  215. int NCDInterpBlock_FindStatement (NCDInterpBlock *o, int from_index, const char *name)
  216. {
  217. DebugObject_Access(&o->d_obj);
  218. ASSERT(from_index >= 0)
  219. ASSERT(from_index <= o->num_stmts)
  220. ASSERT(name)
  221. // We rely on that we get matching statements here in reverse order of insertion,
  222. // to properly return the greatest matching statement lesser than from_index.
  223. NCDInterpBlock__HashRef ref = NCDInterpBlock__Hash_Lookup(&o->hash, o->stmts, name);
  224. while (ref.link != NCDInterpBlock__HashNullLink()) {
  225. ASSERT(ref.link >= 0)
  226. ASSERT(ref.link < o->num_stmts)
  227. ASSERT(ref.ptr == &o->stmts[ref.link])
  228. ASSERT(!strcmp(ref.ptr->name, name))
  229. if (ref.link < from_index) {
  230. return ref.link;
  231. }
  232. ref = NCDInterpBlock__Hash_GetNextEqual(&o->hash, o->stmts, ref);
  233. }
  234. return -1;
  235. }
  236. const char * NCDInterpBlock_StatementCmdName (NCDInterpBlock *o, int i)
  237. {
  238. DebugObject_Access(&o->d_obj);
  239. ASSERT(i >= 0)
  240. ASSERT(i < o->num_stmts)
  241. return o->stmts[i].cmdname;
  242. }
  243. void NCDInterpBlock_StatementObjNames (NCDInterpBlock *o, int i, const char **out_objnames, size_t *out_num_objnames)
  244. {
  245. DebugObject_Access(&o->d_obj);
  246. ASSERT(i >= 0)
  247. ASSERT(i < o->num_stmts)
  248. ASSERT(out_objnames)
  249. ASSERT(out_num_objnames)
  250. *out_objnames = o->stmts[i].objnames;
  251. *out_num_objnames = o->stmts[i].num_objnames;
  252. }
  253. int NCDInterpBlock_CopyStatementArgs (NCDInterpBlock *o, int i, NCDValMem *out_valmem, NCDValRef *out_val, NCDValReplaceProg *out_prog)
  254. {
  255. DebugObject_Access(&o->d_obj);
  256. ASSERT(i >= 0)
  257. ASSERT(i < o->num_stmts)
  258. ASSERT(out_valmem)
  259. ASSERT(out_val)
  260. ASSERT(out_prog)
  261. struct NCDInterpBlock__stmt *e = &o->stmts[i];
  262. if (!NCDValMem_InitImport(out_valmem, e->arg_data, e->arg_len)) {
  263. return 0;
  264. }
  265. *out_val = NCDVal_FromSafe(out_valmem, e->arg_ref);
  266. *out_prog = e->arg_prog;
  267. return 1;
  268. }
  269. void NCDInterpBlock_StatementBumpAllocSize (NCDInterpBlock *o, int i, int alloc_size)
  270. {
  271. DebugObject_Access(&o->d_obj);
  272. ASSERT(i >= 0)
  273. ASSERT(i < o->num_stmts)
  274. ASSERT(alloc_size >= 0)
  275. if (alloc_size > o->stmts[i].alloc_size) {
  276. o->stmts[i].alloc_size = alloc_size;
  277. o->prealloc_size = -1;
  278. }
  279. }
  280. int NCDInterpBlock_StatementPreallocSize (NCDInterpBlock *o, int i)
  281. {
  282. DebugObject_Access(&o->d_obj);
  283. ASSERT(i >= 0)
  284. ASSERT(i < o->num_stmts)
  285. return o->stmts[i].alloc_size;
  286. }
  287. int NCDInterpBlock_PreallocSize (NCDInterpBlock *o)
  288. {
  289. DebugObject_Access(&o->d_obj);
  290. ASSERT(o->prealloc_size == -1 || o->prealloc_size >= 0)
  291. if (o->prealloc_size < 0 && !compute_prealloc(o)) {
  292. return -1;
  293. }
  294. return o->prealloc_size;
  295. }
  296. int NCDInterpBlock_StatementPreallocOffset (NCDInterpBlock *o, int i)
  297. {
  298. DebugObject_Access(&o->d_obj);
  299. ASSERT(i >= 0)
  300. ASSERT(i < o->num_stmts)
  301. ASSERT(o->prealloc_size >= 0)
  302. return o->stmts[i].prealloc_offset;
  303. }
  304. NCDProcess * NCDInterpBlock_Process (NCDInterpBlock *o)
  305. {
  306. DebugObject_Access(&o->d_obj);
  307. return o->process;
  308. }