vm.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703
  1. #include "pocketpy/interpreter/vm.h"
  2. #include "pocketpy/common/memorypool.h"
  3. #include "pocketpy/common/sstream.h"
  4. #include "pocketpy/common/utils.h"
  5. #include "pocketpy/interpreter/generator.h"
  6. #include "pocketpy/interpreter/modules.h"
  7. #include "pocketpy/interpreter/typeinfo.h"
  8. #include "pocketpy/objects/base.h"
  9. #include "pocketpy/interpreter/types.h"
  10. #include "pocketpy/common/_generated.h"
  11. #include "pocketpy/pocketpy.h"
  12. #include <stdbool.h>
  13. static char* pk_default_importfile(const char* path) {
  14. #if PK_ENABLE_OS
  15. FILE* f = fopen(path, "rb");
  16. if(f == NULL) return NULL;
  17. fseek(f, 0, SEEK_END);
  18. long size = ftell(f);
  19. fseek(f, 0, SEEK_SET);
  20. char* buffer = PK_MALLOC(size + 1);
  21. size = fread(buffer, 1, size, f);
  22. buffer[size] = 0;
  23. fclose(f);
  24. return buffer;
  25. #else
  26. return NULL;
  27. #endif
  28. }
  29. static void pk_default_print(const char* data) { printf("%s", data); }
  30. static void pk_default_flush() { fflush(stdout); }
  31. static int pk_default_getchr() { return getchar(); }
  32. void LineProfiler__tracefunc(py_Frame* frame, enum py_TraceEvent event) {
  33. LineProfiler* self = &pk_current_vm->line_profiler;
  34. if(self->enabled && event == TRACE_EVENT_LINE) { LineProfiler__tracefunc_line(self, frame); }
  35. }
  36. static int BinTree__cmp_cstr(void* lhs, void* rhs) {
  37. const char* l = (const char*)lhs;
  38. const char* r = (const char*)rhs;
  39. return strcmp(l, r);
  40. }
  41. void VM__ctor(VM* self) {
  42. self->top_frame = NULL;
  43. const static BinTreeConfig modules_config = {
  44. .f_cmp = BinTree__cmp_cstr,
  45. .need_free_key = false,
  46. };
  47. BinTree__ctor(&self->modules, "", py_NIL(), &modules_config);
  48. c11_vector__ctor(&self->types, sizeof(TypePointer));
  49. self->builtins = NULL;
  50. self->main = NULL;
  51. self->callbacks.importfile = pk_default_importfile;
  52. self->callbacks.print = pk_default_print;
  53. self->callbacks.flush = pk_default_flush;
  54. self->callbacks.getchr = pk_default_getchr;
  55. self->last_retval = *py_NIL();
  56. self->curr_exception = *py_NIL();
  57. self->recursion_depth = 0;
  58. self->max_recursion_depth = 1000;
  59. self->is_curr_exc_handled = false;
  60. self->ctx = NULL;
  61. self->curr_class = NULL;
  62. self->curr_decl_based_function = NULL;
  63. memset(&self->trace_info, 0, sizeof(TraceInfo));
  64. memset(&self->watchdog_info, 0, sizeof(WatchdogInfo));
  65. LineProfiler__ctor(&self->line_profiler);
  66. FixedMemoryPool__ctor(&self->pool_frame, sizeof(py_Frame), 32);
  67. ManagedHeap__ctor(&self->heap);
  68. ValueStack__ctor(&self->stack);
  69. CachedNames__ctor(&self->cached_names);
  70. NameDict__ctor(&self->compile_time_funcs, PK_TYPE_ATTR_LOAD_FACTOR);
  71. /* Init Builtin Types */
  72. // 0: unused
  73. TypePointer* placeholder = c11_vector__emplace(&self->types);
  74. placeholder->ti = NULL;
  75. placeholder->dtor = NULL;
  76. #define validate(t, expr) \
  77. if(t != (expr)) abort()
  78. validate(tp_object, pk_newtype("object", tp_nil, NULL, NULL, true, false));
  79. validate(tp_type, pk_newtype("type", tp_object, NULL, NULL, false, true));
  80. pk_object__register();
  81. validate(tp_int, pk_newtype("int", tp_object, NULL, NULL, false, true));
  82. validate(tp_float, pk_newtype("float", tp_object, NULL, NULL, false, true));
  83. validate(tp_bool, pk_newtype("bool", tp_object, NULL, NULL, false, true));
  84. pk_number__register();
  85. validate(tp_str, pk_str__register());
  86. validate(tp_str_iterator, pk_str_iterator__register());
  87. validate(tp_list, pk_list__register());
  88. validate(tp_tuple, pk_tuple__register());
  89. validate(tp_array_iterator, pk_array_iterator__register());
  90. validate(tp_slice, pk_slice__register());
  91. validate(tp_range, pk_range__register());
  92. validate(tp_range_iterator, pk_range_iterator__register());
  93. validate(tp_module, pk_module__register());
  94. validate(tp_function, pk_function__register());
  95. validate(tp_nativefunc, pk_nativefunc__register());
  96. validate(tp_boundmethod, pk_boundmethod__register());
  97. validate(tp_super, pk_super__register());
  98. validate(tp_BaseException, pk_BaseException__register());
  99. validate(tp_Exception, pk_Exception__register());
  100. validate(tp_bytes, pk_bytes__register());
  101. validate(tp_namedict, pk_namedict__register());
  102. validate(tp_locals, pk_newtype("locals", tp_object, NULL, NULL, false, true));
  103. validate(tp_code, pk_code__register());
  104. validate(tp_dict, pk_dict__register());
  105. validate(tp_dict_iterator, pk_dict_items__register());
  106. validate(tp_property, pk_property__register());
  107. validate(tp_star_wrapper, pk_newtype("star_wrapper", tp_object, NULL, NULL, false, true));
  108. validate(tp_staticmethod, pk_staticmethod__register());
  109. validate(tp_classmethod, pk_classmethod__register());
  110. validate(tp_NoneType, pk_newtype("NoneType", tp_object, NULL, NULL, false, true));
  111. validate(tp_NotImplementedType,
  112. pk_newtype("NotImplementedType", tp_object, NULL, NULL, false, true));
  113. validate(tp_ellipsis, pk_newtype("ellipsis", tp_object, NULL, NULL, false, true));
  114. validate(tp_generator, pk_generator__register());
  115. self->builtins = pk_builtins__register();
  116. // inject some builtin exceptions
  117. #define INJECT_BUILTIN_EXC(name, TBase) \
  118. do { \
  119. py_Type type = pk_newtype(#name, TBase, self->builtins, NULL, false, true); \
  120. py_setdict(self->builtins, py_name(#name), py_tpobject(type)); \
  121. validate(tp_##name, type); \
  122. } while(0)
  123. INJECT_BUILTIN_EXC(SystemExit, tp_BaseException);
  124. INJECT_BUILTIN_EXC(KeyboardInterrupt, tp_BaseException);
  125. validate(tp_StopIteration, pk_StopIteration__register());
  126. py_setdict(self->builtins, py_name("StopIteration"), py_tpobject(tp_StopIteration));
  127. INJECT_BUILTIN_EXC(SyntaxError, tp_Exception);
  128. INJECT_BUILTIN_EXC(RecursionError, tp_Exception);
  129. INJECT_BUILTIN_EXC(OSError, tp_Exception);
  130. INJECT_BUILTIN_EXC(NotImplementedError, tp_Exception);
  131. INJECT_BUILTIN_EXC(TypeError, tp_Exception);
  132. INJECT_BUILTIN_EXC(IndexError, tp_Exception);
  133. INJECT_BUILTIN_EXC(ValueError, tp_Exception);
  134. INJECT_BUILTIN_EXC(RuntimeError, tp_Exception);
  135. INJECT_BUILTIN_EXC(TimeoutError, tp_Exception);
  136. INJECT_BUILTIN_EXC(ZeroDivisionError, tp_Exception);
  137. INJECT_BUILTIN_EXC(NameError, tp_Exception);
  138. INJECT_BUILTIN_EXC(UnboundLocalError, tp_Exception);
  139. INJECT_BUILTIN_EXC(AttributeError, tp_Exception);
  140. INJECT_BUILTIN_EXC(ImportError, tp_Exception);
  141. INJECT_BUILTIN_EXC(AssertionError, tp_Exception);
  142. INJECT_BUILTIN_EXC(KeyError, tp_Exception);
  143. #undef INJECT_BUILTIN_EXC
  144. #undef validate
  145. /* Setup Public Builtin Types */
  146. py_Type public_types[] = {
  147. tp_object,
  148. tp_type,
  149. tp_int,
  150. tp_float,
  151. tp_bool,
  152. tp_str,
  153. tp_list,
  154. tp_tuple,
  155. tp_slice,
  156. tp_range,
  157. tp_bytes,
  158. tp_dict,
  159. tp_property,
  160. tp_staticmethod,
  161. tp_classmethod,
  162. tp_super,
  163. tp_BaseException,
  164. tp_Exception,
  165. };
  166. for(int i = 0; i < c11__count_array(public_types); i++) {
  167. py_TypeInfo* ti = pk_typeinfo(public_types[i]);
  168. py_setdict(self->builtins, ti->name, &ti->self);
  169. }
  170. py_newnotimplemented(py_emplacedict(self->builtins, py_name("NotImplemented")));
  171. pk__add_module_vmath();
  172. pk__add_module_array2d();
  173. pk__add_module_colorcvt();
  174. // add modules
  175. pk__add_module_os();
  176. pk__add_module_sys();
  177. pk__add_module_io();
  178. pk__add_module_math();
  179. pk__add_module_dis();
  180. pk__add_module_random();
  181. pk__add_module_json();
  182. pk__add_module_gc();
  183. pk__add_module_time();
  184. pk__add_module_easing();
  185. pk__add_module_traceback();
  186. pk__add_module_enum();
  187. pk__add_module_inspect();
  188. pk__add_module_pickle();
  189. pk__add_module_base64();
  190. pk__add_module_importlib();
  191. pk__add_module_unicodedata();
  192. pk__add_module_conio();
  193. pk__add_module_lz4(); // optional
  194. pk__add_module_libhv(); // optional
  195. pk__add_module_pkpy();
  196. // add python builtins
  197. do {
  198. bool ok;
  199. ok = py_exec(kPythonLibs_builtins, "<builtins>", EXEC_MODE, self->builtins);
  200. if(!ok) goto __ABORT;
  201. break;
  202. __ABORT:
  203. py_printexc();
  204. c11__abort("failed to load python builtins!");
  205. } while(0);
  206. self->main = py_newmodule("__main__");
  207. }
  208. void VM__dtor(VM* self) {
  209. // reset traceinfo
  210. py_sys_settrace(NULL, true);
  211. LineProfiler__dtor(&self->line_profiler);
  212. // destroy all objects
  213. ManagedHeap__dtor(&self->heap);
  214. // clear frames
  215. while(self->top_frame)
  216. VM__pop_frame(self);
  217. BinTree__dtor(&self->modules);
  218. FixedMemoryPool__dtor(&self->pool_frame);
  219. ValueStack__dtor(&self->stack);
  220. CachedNames__dtor(&self->cached_names);
  221. NameDict__dtor(&self->compile_time_funcs);
  222. c11_vector__dtor(&self->types);
  223. }
  224. void VM__push_frame(VM* self, py_Frame* frame) {
  225. frame->f_back = self->top_frame;
  226. self->top_frame = frame;
  227. self->recursion_depth++;
  228. if(self->trace_info.func) self->trace_info.func(frame, TRACE_EVENT_PUSH);
  229. }
  230. void VM__pop_frame(VM* self) {
  231. assert(self->top_frame);
  232. py_Frame* frame = self->top_frame;
  233. if(self->trace_info.func) self->trace_info.func(frame, TRACE_EVENT_POP);
  234. // reset stack pointer
  235. self->stack.sp = frame->p0;
  236. // pop frame and delete
  237. self->top_frame = frame->f_back;
  238. Frame__delete(frame);
  239. self->recursion_depth--;
  240. }
  241. static void _clip_int(int* value, int min, int max) {
  242. if(*value < min) *value = min;
  243. if(*value > max) *value = max;
  244. }
  245. bool pk__parse_int_slice(py_Ref slice,
  246. int length,
  247. int* restrict start,
  248. int* restrict stop,
  249. int* restrict step) {
  250. if(py_isint(slice)) {
  251. int index = py_toint(slice);
  252. bool ok = pk__normalize_index(&index, length);
  253. if(!ok) return false;
  254. *start = index;
  255. *stop = index + 1;
  256. *step = 1;
  257. return true;
  258. }
  259. if(!py_istype(slice, tp_slice)) c11__abort("pk__parse_int_slice(): not a slice object");
  260. py_Ref s_start = py_getslot(slice, 0);
  261. py_Ref s_stop = py_getslot(slice, 1);
  262. py_Ref s_step = py_getslot(slice, 2);
  263. if(py_isnone(s_step))
  264. *step = 1;
  265. else {
  266. if(!py_checkint(s_step)) return false;
  267. *step = py_toint(s_step);
  268. }
  269. if(*step == 0) return ValueError("slice step cannot be zero");
  270. if(*step > 0) {
  271. if(py_isnone(s_start))
  272. *start = 0;
  273. else {
  274. if(!py_checkint(s_start)) return false;
  275. *start = py_toint(s_start);
  276. if(*start < 0) *start += length;
  277. _clip_int(start, 0, length);
  278. }
  279. if(py_isnone(s_stop))
  280. *stop = length;
  281. else {
  282. if(!py_checkint(s_stop)) return false;
  283. *stop = py_toint(s_stop);
  284. if(*stop < 0) *stop += length;
  285. _clip_int(stop, 0, length);
  286. }
  287. } else {
  288. if(py_isnone(s_start))
  289. *start = length - 1;
  290. else {
  291. if(!py_checkint(s_start)) return false;
  292. *start = py_toint(s_start);
  293. if(*start < 0) *start += length;
  294. _clip_int(start, -1, length - 1);
  295. }
  296. if(py_isnone(s_stop))
  297. *stop = -1;
  298. else {
  299. if(!py_checkint(s_stop)) return false;
  300. *stop = py_toint(s_stop);
  301. if(*stop < 0) *stop += length;
  302. _clip_int(stop, -1, length - 1);
  303. }
  304. }
  305. return true;
  306. }
  307. bool pk__normalize_index(int* index, int length) {
  308. if(*index < 0) *index += length;
  309. if(*index < 0 || *index >= length) return IndexError("%d not in [0, %d)", *index, length);
  310. return true;
  311. }
  312. static bool
  313. prepare_py_call(py_TValue* buffer, py_Ref argv, py_Ref p1, int kwargc, const FuncDecl* decl) {
  314. const CodeObject* co = &decl->code;
  315. int decl_argc = decl->args.length;
  316. if(p1 - argv < decl_argc) {
  317. return TypeError("%s() takes %d positional arguments but %d were given",
  318. co->name->data,
  319. decl_argc,
  320. (int)(p1 - argv));
  321. }
  322. py_TValue* t = argv;
  323. // prepare args
  324. memset(buffer, 0, co->nlocals * sizeof(py_TValue));
  325. c11__foreach(int, &decl->args, index) buffer[*index] = *t++;
  326. // prepare kwdefaults
  327. c11__foreach(FuncDeclKwArg, &decl->kwargs, kv) buffer[kv->index] = kv->value;
  328. // handle *args
  329. if(decl->starred_arg != -1) {
  330. int exceed_argc = p1 - t;
  331. py_Ref vargs = &buffer[decl->starred_arg];
  332. py_Ref data = py_newtuple(vargs, exceed_argc);
  333. for(int j = 0; j < exceed_argc; j++) {
  334. data[j] = *t++;
  335. }
  336. } else {
  337. // kwdefaults override
  338. // def f(a, b, c=None)
  339. // f(1, 2, 3) -> c=3
  340. c11__foreach(FuncDeclKwArg, &decl->kwargs, kv) {
  341. if(t >= p1) break;
  342. buffer[kv->index] = *t++;
  343. }
  344. // not able to consume all args
  345. if(t < p1) return TypeError("too many arguments (%s)", co->name->data);
  346. }
  347. if(decl->starred_kwarg != -1) py_newdict(&buffer[decl->starred_kwarg]);
  348. for(int j = 0; j < kwargc; j++) {
  349. py_Name key = (py_Name)py_toint(&p1[2 * j]);
  350. int index = c11_smallmap_n2d__get(&decl->kw_to_index, key, -1);
  351. // if key is an explicit key, set as local variable
  352. if(index >= 0) {
  353. buffer[index] = p1[2 * j + 1];
  354. } else {
  355. // otherwise, set as **kwargs if possible
  356. if(decl->starred_kwarg == -1) {
  357. return TypeError("'%n' is an invalid keyword argument for %s()",
  358. key,
  359. co->name->data);
  360. } else {
  361. // add to **kwargs
  362. bool ok =
  363. py_dict_setitem(&buffer[decl->starred_kwarg], py_name2ref(key), &p1[2 * j + 1]);
  364. if(!ok) return false;
  365. }
  366. }
  367. }
  368. return true;
  369. }
  370. FrameResult VM__vectorcall(VM* self, uint16_t argc, uint16_t kwargc, bool opcall) {
  371. #ifndef NDEBUG
  372. pk_print_stack(self, self->top_frame, (Bytecode){0});
  373. #endif
  374. py_Ref p1 = self->stack.sp - kwargc * 2;
  375. py_Ref p0 = p1 - argc - 2;
  376. // [callable, <self>, args..., kwargs...]
  377. // ^p0 ^p1 ^_sp
  378. // handle boundmethod, do a patch
  379. if(p0->type == tp_boundmethod) {
  380. assert(py_isnil(p0 + 1)); // self must be NULL
  381. py_TValue* slots = PyObject__slots(p0->_obj);
  382. p0[0] = slots[1]; // callable
  383. p0[1] = slots[0]; // self
  384. // [unbound, self, args..., kwargs...]
  385. }
  386. py_Ref argv = p0 + 1 + (int)py_isnil(p0 + 1);
  387. if(p0->type == tp_function) {
  388. Function* fn = py_touserdata(p0);
  389. const CodeObject* co = &fn->decl->code;
  390. switch(fn->decl->type) {
  391. case FuncType_NORMAL: {
  392. bool ok = prepare_py_call(self->vectorcall_buffer, argv, p1, kwargc, fn->decl);
  393. if(!ok) return RES_ERROR;
  394. // copy buffer back to stack
  395. self->stack.sp = argv + co->nlocals;
  396. memcpy(argv, self->vectorcall_buffer, co->nlocals * sizeof(py_TValue));
  397. // submit the call
  398. if(!fn->cfunc) {
  399. // python function
  400. VM__push_frame(self, Frame__new(co, p0, fn->module, fn->globals, argv, false));
  401. return opcall ? RES_CALL : VM__run_top_frame(self);
  402. } else {
  403. // decl-based binding
  404. self->curr_decl_based_function = p0;
  405. bool ok = py_callcfunc(fn->cfunc, co->nlocals, argv);
  406. self->stack.sp = p0;
  407. self->curr_decl_based_function = NULL;
  408. return ok ? RES_RETURN : RES_ERROR;
  409. }
  410. }
  411. case FuncType_SIMPLE:
  412. if(p1 - argv != fn->decl->args.length) {
  413. const char* fmt = "%s() takes %d positional arguments but %d were given";
  414. TypeError(fmt, co->name->data, fn->decl->args.length, (int)(p1 - argv));
  415. return RES_ERROR;
  416. }
  417. if(kwargc) {
  418. TypeError("%s() takes no keyword arguments", co->name->data);
  419. return RES_ERROR;
  420. }
  421. // [callable, <self>, args..., local_vars...]
  422. // ^p0 ^p1 ^_sp
  423. self->stack.sp = argv + co->nlocals;
  424. // initialize local variables to py_NIL
  425. memset(p1, 0, (char*)self->stack.sp - (char*)p1);
  426. // submit the call
  427. if(!fn->cfunc) {
  428. // python function
  429. VM__push_frame(self, Frame__new(co, p0, fn->module, fn->globals, argv, false));
  430. return opcall ? RES_CALL : VM__run_top_frame(self);
  431. } else {
  432. // decl-based binding
  433. self->curr_decl_based_function = p0;
  434. bool ok = py_callcfunc(fn->cfunc, co->nlocals, argv);
  435. self->stack.sp = p0;
  436. self->curr_decl_based_function = NULL;
  437. return ok ? RES_RETURN : RES_ERROR;
  438. }
  439. case FuncType_GENERATOR: {
  440. bool ok = prepare_py_call(self->vectorcall_buffer, argv, p1, kwargc, fn->decl);
  441. if(!ok) return RES_ERROR;
  442. // copy buffer back to stack
  443. self->stack.sp = argv + co->nlocals;
  444. memcpy(argv, self->vectorcall_buffer, co->nlocals * sizeof(py_TValue));
  445. py_Frame* frame = Frame__new(co, p0, fn->module, fn->globals, argv, false);
  446. pk_newgenerator(py_retval(), frame, p0, self->stack.sp);
  447. self->stack.sp = p0; // reset the stack
  448. return RES_RETURN;
  449. }
  450. default: c11__unreachable();
  451. };
  452. c11__unreachable();
  453. /*****************_py_call*****************/
  454. }
  455. if(p0->type == tp_nativefunc) {
  456. if(kwargc && p0->_cfunc != pk__object_new) {
  457. TypeError("nativefunc does not accept keyword arguments");
  458. return RES_ERROR;
  459. }
  460. bool ok = py_callcfunc(p0->_cfunc, p1 - argv, argv);
  461. self->stack.sp = p0;
  462. return ok ? RES_RETURN : RES_ERROR;
  463. }
  464. if(p0->type == tp_type) {
  465. // [cls, NULL, args..., kwargs...]
  466. py_Ref new_f = py_tpfindmagic(py_totype(p0), __new__);
  467. assert(new_f && py_isnil(p0 + 1));
  468. // prepare a copy of args and kwargs
  469. int span = self->stack.sp - argv;
  470. *self->stack.sp++ = *new_f; // push __new__
  471. *self->stack.sp++ = *p0; // push cls
  472. memcpy(self->stack.sp, argv, span * sizeof(py_TValue));
  473. self->stack.sp += span;
  474. // [new_f, cls, args..., kwargs...]
  475. if(VM__vectorcall(self, argc, kwargc, false) == RES_ERROR) return RES_ERROR;
  476. // by recursively using vectorcall, args and kwargs are consumed
  477. // try __init__
  478. // NOTE: previously we use `get_unbound_method` but here we just use `tpfindmagic`
  479. // >> [cls, NULL, args..., kwargs...]
  480. // >> py_retval() is the new instance
  481. py_Ref init_f = py_tpfindmagic(py_totype(p0), __init__);
  482. if(init_f) {
  483. // do an inplace patch
  484. *p0 = *init_f; // __init__
  485. p0[1] = self->last_retval; // self
  486. // [__init__, self, args..., kwargs...]
  487. if(VM__vectorcall(self, argc, kwargc, false) == RES_ERROR) return RES_ERROR;
  488. *py_retval() = p0[1]; // restore the new instance
  489. }
  490. // reset the stack
  491. self->stack.sp = p0;
  492. return RES_RETURN;
  493. }
  494. // handle `__call__` overload
  495. if(pk_loadmethod(p0, __call__)) {
  496. // [__call__, self, args..., kwargs...]
  497. return VM__vectorcall(self, argc, kwargc, opcall);
  498. }
  499. TypeError("'%t' object is not callable", p0->type);
  500. return RES_ERROR;
  501. }
  502. /****************************************/
  503. void FuncDecl__gc_mark(const FuncDecl* self, c11_vector* p_stack) {
  504. CodeObject__gc_mark(&self->code, p_stack);
  505. for(int j = 0; j < self->kwargs.length; j++) {
  506. FuncDeclKwArg* kw = c11__at(FuncDeclKwArg, &self->kwargs, j);
  507. pk__mark_value(&kw->value);
  508. }
  509. }
  510. void CodeObject__gc_mark(const CodeObject* self, c11_vector* p_stack) {
  511. for(int i = 0; i < self->consts.length; i++) {
  512. py_TValue* p = c11__at(py_TValue, &self->consts, i);
  513. pk__mark_value(p);
  514. }
  515. for(int i = 0; i < self->func_decls.length; i++) {
  516. FuncDecl_ decl = c11__getitem(FuncDecl_, &self->func_decls, i);
  517. FuncDecl__gc_mark(decl, p_stack);
  518. }
  519. }
  520. static void pk__mark_value_func(py_Ref val, void* ctx) {
  521. c11_vector* p_stack = ctx;
  522. pk__mark_value(val);
  523. }
  524. void ManagedHeap__mark(ManagedHeap* self) {
  525. VM* vm = pk_current_vm;
  526. c11_vector* p_stack = &self->gc_roots;
  527. assert(p_stack->length == 0);
  528. // mark value stack
  529. for(py_TValue* p = vm->stack.begin; p != vm->stack.end; p++) {
  530. pk__mark_value(p);
  531. }
  532. // mark modules
  533. BinTree__apply_mark(&vm->modules, p_stack);
  534. // mark cached names
  535. for(int i = 0; i < vm->cached_names.entries.length; i++) {
  536. CachedNames_KV* kv = c11_chunkedvector__at(&vm->cached_names.entries, i);
  537. pk__mark_value(&kv->val);
  538. }
  539. // mark compile time functions
  540. for(int i = 0; i < vm->compile_time_funcs.capacity; i++) {
  541. NameDict_KV* kv = &vm->compile_time_funcs.items[i];
  542. if(kv->key == NULL) continue;
  543. pk__mark_value(&kv->value);
  544. }
  545. // mark types
  546. int types_length = vm->types.length;
  547. // 0-th type is placeholder
  548. for(py_Type i = 1; i < types_length; i++) {
  549. py_TypeInfo* ti = c11__getitem(TypePointer, &vm->types, i).ti;
  550. pk__mark_value(&ti->self);
  551. pk__mark_value(&ti->annotations);
  552. }
  553. // mark frame
  554. for(py_Frame* frame = vm->top_frame; frame; frame = frame->f_back) {
  555. Frame__gc_mark(frame, p_stack);
  556. }
  557. // mark vm's registers
  558. pk__mark_value(&vm->last_retval);
  559. pk__mark_value(&vm->curr_exception);
  560. for(int i = 0; i < c11__count_array(vm->reg); i++) {
  561. pk__mark_value(&vm->reg[i]);
  562. }
  563. // mark user func
  564. if(vm->callbacks.gc_mark) vm->callbacks.gc_mark(pk__mark_value_func, p_stack);
  565. /*****************************/
  566. while(p_stack->length > 0) {
  567. PyObject* obj = c11_vector__back(PyObject*, p_stack);
  568. c11_vector__pop(p_stack);
  569. assert(obj->gc_marked);
  570. if(obj->slots > 0) {
  571. py_TValue* p = PyObject__slots(obj);
  572. for(int i = 0; i < obj->slots; i++)
  573. pk__mark_value(p + i);
  574. } else if(obj->slots == -1) {
  575. NameDict* dict = PyObject__dict(obj);
  576. for(int i = 0; i < dict->capacity; i++) {
  577. NameDict_KV* kv = &dict->items[i];
  578. if(kv->key == NULL) continue;
  579. pk__mark_value(&kv->value);
  580. }
  581. }
  582. void* ud = PyObject__userdata(obj);
  583. switch(obj->type) {
  584. case tp_list: {
  585. List* self = ud;
  586. for(int i = 0; i < self->length; i++) {
  587. py_TValue* val = c11__at(py_TValue, self, i);
  588. pk__mark_value(val);
  589. }
  590. break;
  591. }
  592. case tp_dict: {
  593. Dict* self = ud;
  594. for(int i = 0; i < self->entries.length; i++) {
  595. DictEntry* entry = c11__at(DictEntry, &self->entries, i);
  596. if(py_isnil(&entry->key)) continue;
  597. pk__mark_value(&entry->key);
  598. pk__mark_value(&entry->val);
  599. }
  600. break;
  601. }
  602. case tp_generator: {
  603. Generator* self = ud;
  604. if(self->frame) Frame__gc_mark(self->frame, p_stack);
  605. break;
  606. }
  607. case tp_function: {
  608. function__gc_mark(ud, p_stack);
  609. break;
  610. }
  611. case tp_code: {
  612. CodeObject* self = ud;
  613. CodeObject__gc_mark(self, p_stack);
  614. break;
  615. }
  616. case tp_chunked_array2d: {
  617. c11_chunked_array2d__mark(ud, p_stack);
  618. break;
  619. }
  620. }
  621. }
  622. }