NCDInterpProcess.c 14 KB

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