NCDInterpProcess.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490
  1. /**
  2. * @file NCDInterpProcess.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/maxalign.h>
  35. #include <misc/strdup.h>
  36. #include <base/BLog.h>
  37. #include <ncd/make_name_indices.h>
  38. #include "NCDInterpProcess.h"
  39. #include <generated/blog_channel_ncd.h>
  40. static int compute_prealloc (NCDInterpProcess *o)
  41. {
  42. int size = 0;
  43. for (int i = 0; i < o->num_stmts; i++) {
  44. int mod = size % BMAX_ALIGN;
  45. int align_size = (mod == 0 ? 0 : BMAX_ALIGN - mod);
  46. if (align_size + o->stmts[i].alloc_size > INT_MAX - size) {
  47. return 0;
  48. }
  49. o->stmts[i].prealloc_offset = size + align_size;
  50. size += align_size + o->stmts[i].alloc_size;
  51. }
  52. ASSERT(size >= 0)
  53. o->prealloc_size = size;
  54. return 1;
  55. }
  56. static int convert_value_recurser (NCDPlaceholderDb *pdb, NCDStringIndex *string_index, NCDValue *value, NCDValMem *mem, NCDValRef *out)
  57. {
  58. ASSERT(pdb)
  59. ASSERT(string_index)
  60. ASSERT((NCDValue_Type(value), 1))
  61. ASSERT(mem)
  62. ASSERT(out)
  63. switch (NCDValue_Type(value)) {
  64. case NCDVALUE_STRING: {
  65. const char *str = NCDValue_StringValue(value);
  66. size_t len = NCDValue_StringLength(value);
  67. NCD_string_id_t string_id = NCDStringIndex_GetBin(string_index, str, len);
  68. if (string_id < 0) {
  69. BLog(BLOG_ERROR, "NCDStringIndex_GetBin failed");
  70. goto fail;
  71. }
  72. *out = NCDVal_NewIdString(mem, string_id, string_index);
  73. if (NCDVal_IsInvalid(*out)) {
  74. goto fail;
  75. }
  76. } break;
  77. case NCDVALUE_LIST: {
  78. *out = NCDVal_NewList(mem, NCDValue_ListCount(value));
  79. if (NCDVal_IsInvalid(*out)) {
  80. goto fail;
  81. }
  82. for (NCDValue *e = NCDValue_ListFirst(value); e; e = NCDValue_ListNext(value, e)) {
  83. NCDValRef vval;
  84. if (!convert_value_recurser(pdb, string_index, e, mem, &vval)) {
  85. goto fail;
  86. }
  87. if (!NCDVal_ListAppend(*out, vval)) {
  88. BLog(BLOG_ERROR, "depth limit exceeded");
  89. goto fail;
  90. }
  91. }
  92. } break;
  93. case NCDVALUE_MAP: {
  94. *out = NCDVal_NewMap(mem, NCDValue_MapCount(value));
  95. if (NCDVal_IsInvalid(*out)) {
  96. goto fail;
  97. }
  98. for (NCDValue *ekey = NCDValue_MapFirstKey(value); ekey; ekey = NCDValue_MapNextKey(value, ekey)) {
  99. NCDValue *eval = NCDValue_MapKeyValue(value, ekey);
  100. NCDValRef vkey;
  101. NCDValRef vval;
  102. if (!convert_value_recurser(pdb, string_index, ekey, mem, &vkey) ||
  103. !convert_value_recurser(pdb, string_index, eval, mem, &vval)
  104. ) {
  105. goto fail;
  106. }
  107. int inserted;
  108. if (!NCDVal_MapInsert(*out, vkey, vval, &inserted)) {
  109. BLog(BLOG_ERROR, "depth limit exceeded");
  110. goto fail;
  111. }
  112. if (!inserted) {
  113. BLog(BLOG_ERROR, "duplicate key in map");
  114. goto fail;
  115. }
  116. }
  117. } break;
  118. case NCDVALUE_VAR: {
  119. int plid;
  120. if (!NCDPlaceholderDb_AddVariable(pdb, NCDValue_VarName(value), &plid)) {
  121. goto fail;
  122. }
  123. if (NCDVAL_MINIDX + plid >= -1) {
  124. goto fail;
  125. }
  126. *out = NCDVal_NewPlaceholder(mem, plid);
  127. } break;
  128. default:
  129. goto fail;
  130. }
  131. return 1;
  132. fail:
  133. return 0;
  134. }
  135. int NCDInterpProcess_Init (NCDInterpProcess *o, NCDProcess *process, NCDStringIndex *string_index, NCDPlaceholderDb *pdb, NCDModuleIndex *module_index)
  136. {
  137. ASSERT(process)
  138. ASSERT(string_index)
  139. ASSERT(pdb)
  140. ASSERT(module_index)
  141. NCDBlock *block = NCDProcess_Block(process);
  142. if (NCDBlock_NumStatements(block) > INT_MAX) {
  143. BLog(BLOG_ERROR, "too many statements");
  144. goto fail0;
  145. }
  146. int num_stmts = NCDBlock_NumStatements(block);
  147. if (!(o->stmts = BAllocArray(num_stmts, sizeof(o->stmts[0])))) {
  148. BLog(BLOG_ERROR, "BAllocArray failed");
  149. goto fail0;
  150. }
  151. o->num_hash_buckets = num_stmts;
  152. if (!(o->hash_buckets = BAllocArray(o->num_hash_buckets, sizeof(o->hash_buckets[0])))) {
  153. BLog(BLOG_ERROR, "BAllocArray failed");
  154. goto fail1;
  155. }
  156. for (size_t i = 0; i < o->num_hash_buckets; i++) {
  157. o->hash_buckets[i] = -1;
  158. }
  159. if (!(o->name = b_strdup(NCDProcess_Name(process)))) {
  160. BLog(BLOG_ERROR, "b_strdup failed");
  161. goto fail2;
  162. }
  163. o->num_stmts = 0;
  164. o->prealloc_size = -1;
  165. o->is_template = NCDProcess_IsTemplate(process);
  166. o->cache = NULL;
  167. for (NCDStatement *s = NCDBlock_FirstStatement(block); s; s = NCDBlock_NextStatement(block, s)) {
  168. ASSERT(NCDStatement_Type(s) == NCDSTATEMENT_REG)
  169. struct NCDInterpProcess__stmt *e = &o->stmts[o->num_stmts];
  170. e->name = -1;
  171. e->objnames = NULL;
  172. e->num_objnames = 0;
  173. e->alloc_size = 0;
  174. if (NCDStatement_Name(s)) {
  175. e->name = NCDStringIndex_Get(string_index, NCDStatement_Name(s));
  176. if (e->name < 0) {
  177. BLog(BLOG_ERROR, "NCDStringIndex_Get failed");
  178. goto loop_fail0;
  179. }
  180. }
  181. e->cmdname = NCDStringIndex_Get(string_index, NCDStatement_RegCmdName(s));
  182. if (e->cmdname < 0) {
  183. BLog(BLOG_ERROR, "NCDStringIndex_Get failed");
  184. goto loop_fail0;
  185. }
  186. NCDValMem_Init(&e->arg_mem);
  187. NCDValRef val;
  188. if (!convert_value_recurser(pdb, string_index, NCDStatement_RegArgs(s), &e->arg_mem, &val)) {
  189. BLog(BLOG_ERROR, "convert_value_recurser failed");
  190. goto loop_fail1;
  191. }
  192. e->arg_ref = NCDVal_ToSafe(val);
  193. if (!NCDValReplaceProg_Init(&e->arg_prog, val)) {
  194. BLog(BLOG_ERROR, "NCDValReplaceProg_Init failed");
  195. goto loop_fail1;
  196. }
  197. if (NCDStatement_RegObjName(s)) {
  198. if (!ncd_make_name_indices(string_index, NCDStatement_RegObjName(s), &e->objnames, &e->num_objnames)) {
  199. BLog(BLOG_ERROR, "ncd_make_name_indices failed");
  200. goto loop_fail2;
  201. }
  202. e->binding.method_name_id = NCDModuleIndex_GetMethodNameId(module_index, NCDStatement_RegCmdName(s));
  203. if (e->binding.method_name_id == -1) {
  204. BLog(BLOG_ERROR, "NCDModuleIndex_GetMethodNameId failed");
  205. goto loop_fail3;
  206. }
  207. } else {
  208. e->binding.simple_module = NCDModuleIndex_FindModule(module_index, NCDStatement_RegCmdName(s));
  209. }
  210. if (e->name >= 0) {
  211. size_t bucket_idx = e->name % o->num_hash_buckets;
  212. e->hash_next = o->hash_buckets[bucket_idx];
  213. o->hash_buckets[bucket_idx] = o->num_stmts;
  214. }
  215. o->num_stmts++;
  216. continue;
  217. loop_fail3:
  218. BFree(e->objnames);
  219. loop_fail2:
  220. NCDValReplaceProg_Free(&e->arg_prog);
  221. loop_fail1:
  222. NCDValMem_Free(&e->arg_mem);
  223. loop_fail0:
  224. goto fail3;
  225. }
  226. ASSERT(o->num_stmts == num_stmts)
  227. DebugObject_Init(&o->d_obj);
  228. return 1;
  229. fail3:
  230. while (o->num_stmts-- > 0) {
  231. struct NCDInterpProcess__stmt *e = &o->stmts[o->num_stmts];
  232. BFree(e->objnames);
  233. NCDValReplaceProg_Free(&e->arg_prog);
  234. NCDValMem_Free(&e->arg_mem);
  235. }
  236. free(o->name);
  237. fail2:
  238. BFree(o->hash_buckets);
  239. fail1:
  240. BFree(o->stmts);
  241. fail0:
  242. return 0;
  243. }
  244. void NCDInterpProcess_Free (NCDInterpProcess *o)
  245. {
  246. DebugObject_Free(&o->d_obj);
  247. while (o->num_stmts-- > 0) {
  248. struct NCDInterpProcess__stmt *e = &o->stmts[o->num_stmts];
  249. BFree(e->objnames);
  250. NCDValReplaceProg_Free(&e->arg_prog);
  251. NCDValMem_Free(&e->arg_mem);
  252. }
  253. free(o->name);
  254. BFree(o->hash_buckets);
  255. BFree(o->stmts);
  256. }
  257. int NCDInterpProcess_FindStatement (NCDInterpProcess *o, int from_index, NCD_string_id_t name)
  258. {
  259. DebugObject_Access(&o->d_obj);
  260. ASSERT(from_index >= 0)
  261. ASSERT(from_index <= o->num_stmts)
  262. size_t bucket_idx = name % o->num_hash_buckets;
  263. int stmt_idx = o->hash_buckets[bucket_idx];
  264. ASSERT(stmt_idx >= -1)
  265. ASSERT(stmt_idx < o->num_stmts)
  266. while (stmt_idx >= 0) {
  267. if (stmt_idx < from_index && o->stmts[stmt_idx].name == name) {
  268. return stmt_idx;
  269. }
  270. stmt_idx = o->stmts[stmt_idx].hash_next;
  271. ASSERT(stmt_idx >= -1)
  272. ASSERT(stmt_idx < o->num_stmts)
  273. }
  274. return -1;
  275. }
  276. const char * NCDInterpProcess_StatementCmdName (NCDInterpProcess *o, int i, NCDStringIndex *string_index)
  277. {
  278. DebugObject_Access(&o->d_obj);
  279. ASSERT(i >= 0)
  280. ASSERT(i < o->num_stmts)
  281. ASSERT(string_index)
  282. return NCDStringIndex_Value(string_index, o->stmts[i].cmdname);
  283. }
  284. void NCDInterpProcess_StatementObjNames (NCDInterpProcess *o, int i, const NCD_string_id_t **out_objnames, size_t *out_num_objnames)
  285. {
  286. DebugObject_Access(&o->d_obj);
  287. ASSERT(i >= 0)
  288. ASSERT(i < o->num_stmts)
  289. ASSERT(out_objnames)
  290. ASSERT(out_num_objnames)
  291. *out_objnames = o->stmts[i].objnames;
  292. *out_num_objnames = o->stmts[i].num_objnames;
  293. }
  294. const struct NCDInterpModule * NCDInterpProcess_StatementGetSimpleModule (NCDInterpProcess *o, int i)
  295. {
  296. DebugObject_Access(&o->d_obj);
  297. ASSERT(i >= 0)
  298. ASSERT(i < o->num_stmts)
  299. ASSERT(!o->stmts[i].objnames)
  300. return o->stmts[i].binding.simple_module;
  301. }
  302. const struct NCDInterpModule * NCDInterpProcess_StatementGetMethodModule (NCDInterpProcess *o, int i, NCD_string_id_t obj_type, NCDModuleIndex *module_index)
  303. {
  304. DebugObject_Access(&o->d_obj);
  305. ASSERT(i >= 0)
  306. ASSERT(i < o->num_stmts)
  307. ASSERT(o->stmts[i].objnames)
  308. ASSERT(obj_type >= 0)
  309. ASSERT(module_index)
  310. return NCDModuleIndex_GetMethodModule(module_index, obj_type, o->stmts[i].binding.method_name_id);
  311. }
  312. int NCDInterpProcess_CopyStatementArgs (NCDInterpProcess *o, int i, NCDValMem *out_valmem, NCDValRef *out_val, NCDValReplaceProg *out_prog)
  313. {
  314. DebugObject_Access(&o->d_obj);
  315. ASSERT(i >= 0)
  316. ASSERT(i < o->num_stmts)
  317. ASSERT(out_valmem)
  318. ASSERT(out_val)
  319. ASSERT(out_prog)
  320. struct NCDInterpProcess__stmt *e = &o->stmts[i];
  321. if (!NCDValMem_InitCopy(out_valmem, &e->arg_mem)) {
  322. return 0;
  323. }
  324. *out_val = NCDVal_FromSafe(out_valmem, e->arg_ref);
  325. *out_prog = e->arg_prog;
  326. return 1;
  327. }
  328. void NCDInterpProcess_StatementBumpAllocSize (NCDInterpProcess *o, int i, int alloc_size)
  329. {
  330. DebugObject_Access(&o->d_obj);
  331. ASSERT(i >= 0)
  332. ASSERT(i < o->num_stmts)
  333. ASSERT(alloc_size >= 0)
  334. if (alloc_size > o->stmts[i].alloc_size) {
  335. o->stmts[i].alloc_size = alloc_size;
  336. o->prealloc_size = -1;
  337. }
  338. }
  339. int NCDInterpProcess_PreallocSize (NCDInterpProcess *o)
  340. {
  341. DebugObject_Access(&o->d_obj);
  342. ASSERT(o->prealloc_size == -1 || o->prealloc_size >= 0)
  343. if (o->prealloc_size < 0 && !compute_prealloc(o)) {
  344. return -1;
  345. }
  346. return o->prealloc_size;
  347. }
  348. int NCDInterpProcess_StatementPreallocSize (NCDInterpProcess *o, int i)
  349. {
  350. DebugObject_Access(&o->d_obj);
  351. ASSERT(i >= 0)
  352. ASSERT(i < o->num_stmts)
  353. ASSERT(o->prealloc_size >= 0)
  354. return o->stmts[i].alloc_size;
  355. }
  356. int NCDInterpProcess_StatementPreallocOffset (NCDInterpProcess *o, int i)
  357. {
  358. DebugObject_Access(&o->d_obj);
  359. ASSERT(i >= 0)
  360. ASSERT(i < o->num_stmts)
  361. ASSERT(o->prealloc_size >= 0)
  362. return o->stmts[i].prealloc_offset;
  363. }
  364. const char * NCDInterpProcess_Name (NCDInterpProcess *o)
  365. {
  366. DebugObject_Access(&o->d_obj);
  367. return o->name;
  368. }
  369. int NCDInterpProcess_IsTemplate (NCDInterpProcess *o)
  370. {
  371. DebugObject_Access(&o->d_obj);
  372. return o->is_template;
  373. }
  374. int NCDInterpProcess_NumStatements (NCDInterpProcess *o)
  375. {
  376. DebugObject_Access(&o->d_obj);
  377. return o->num_stmts;
  378. }
  379. int NCDInterpProcess_CachePush (NCDInterpProcess *o, void *elem)
  380. {
  381. DebugObject_Access(&o->d_obj);
  382. ASSERT(elem)
  383. if (o->cache) {
  384. return 0;
  385. }
  386. o->cache = elem;
  387. return 1;
  388. }
  389. void * NCDInterpProcess_CachePull (NCDInterpProcess *o)
  390. {
  391. DebugObject_Access(&o->d_obj);
  392. void *elem = o->cache;
  393. o->cache = NULL;
  394. return elem;
  395. }