vm.c 43 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578
  1. /* Copyright (C) 2001, 2009, 2010, 2011, 2012, 2013, 2014, 2015 Free Software Foundation, Inc.
  2. *
  3. * This library is free software; you can redistribute it and/or
  4. * modify it under the terms of the GNU Lesser General Public License
  5. * as published by the Free Software Foundation; either version 3 of
  6. * the License, or (at your option) any later version.
  7. *
  8. * This library is distributed in the hope that it will be useful, but
  9. * WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * Lesser General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU Lesser General Public
  14. * License along with this library; if not, write to the Free Software
  15. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
  16. * 02110-1301 USA
  17. */
  18. #if HAVE_CONFIG_H
  19. # include <config.h>
  20. #endif
  21. #include <stdlib.h>
  22. #include <alloca.h>
  23. #include <alignof.h>
  24. #include <string.h>
  25. #include <stdint.h>
  26. #include <unistd.h>
  27. #ifdef HAVE_SYS_MMAN_H
  28. #include <sys/mman.h>
  29. #endif
  30. #include "libguile/bdw-gc.h"
  31. #include <gc/gc_mark.h>
  32. #include "_scm.h"
  33. #include "control.h"
  34. #include "frames.h"
  35. #include "gc-inline.h"
  36. #include "instructions.h"
  37. #include "loader.h"
  38. #include "programs.h"
  39. #include "simpos.h"
  40. #include "vm.h"
  41. #include "vm-builtins.h"
  42. static int vm_default_engine = SCM_VM_REGULAR_ENGINE;
  43. /* Unfortunately we can't snarf these: snarfed things are only loaded up from
  44. (system vm vm), which might not be loaded before an error happens. */
  45. static SCM sym_vm_run;
  46. static SCM sym_vm_error;
  47. static SCM sym_keyword_argument_error;
  48. static SCM sym_regular;
  49. static SCM sym_debug;
  50. /* The page size. */
  51. static size_t page_size;
  52. /* The VM has a number of internal assertions that shouldn't normally be
  53. necessary, but might be if you think you found a bug in the VM. */
  54. /* #define VM_ENABLE_ASSERTIONS */
  55. static void vm_expand_stack (struct scm_vm *vp,
  56. union scm_vm_stack_element *new_sp) SCM_NOINLINE;
  57. /* RESTORE is for the case where we know we have done a PUSH of equal or
  58. greater stack size in the past. Otherwise PUSH is the thing, which
  59. may expand the stack. */
  60. enum vm_increase_sp_kind { VM_SP_PUSH, VM_SP_RESTORE };
  61. static inline void
  62. vm_increase_sp (struct scm_vm *vp, union scm_vm_stack_element *new_sp,
  63. enum vm_increase_sp_kind kind)
  64. {
  65. if (new_sp >= vp->sp_min_since_gc)
  66. {
  67. vp->sp = new_sp;
  68. return;
  69. }
  70. if (kind == VM_SP_PUSH && new_sp < vp->stack_limit)
  71. vm_expand_stack (vp, new_sp);
  72. else
  73. vp->sp_min_since_gc = vp->sp = new_sp;
  74. }
  75. static inline void
  76. vm_push_sp (struct scm_vm *vp, union scm_vm_stack_element *new_sp)
  77. {
  78. vm_increase_sp (vp, new_sp, VM_SP_PUSH);
  79. }
  80. static inline void
  81. vm_restore_sp (struct scm_vm *vp, union scm_vm_stack_element *new_sp)
  82. {
  83. vm_increase_sp (vp, new_sp, VM_SP_RESTORE);
  84. }
  85. /*
  86. * VM Continuation
  87. */
  88. void
  89. scm_i_vm_cont_print (SCM x, SCM port, scm_print_state *pstate)
  90. {
  91. scm_puts_unlocked ("#<vm-continuation ", port);
  92. scm_uintprint (SCM_UNPACK (x), 16, port);
  93. scm_puts_unlocked (">", port);
  94. }
  95. int
  96. scm_i_vm_cont_to_frame (SCM cont, struct scm_frame *frame)
  97. {
  98. struct scm_vm_cont *data = SCM_VM_CONT_DATA (cont);
  99. union scm_vm_stack_element *stack_top;
  100. stack_top = data->stack_bottom + data->stack_size;
  101. frame->stack_holder = data;
  102. frame->fp_offset = stack_top - (data->fp + data->reloc);
  103. frame->sp_offset = data->stack_size;
  104. frame->ip = data->ra;
  105. return 1;
  106. }
  107. /* Ideally we could avoid copying the C stack if the continuation root
  108. is inside VM code, and call/cc was invoked within that same call to
  109. vm_run. That's currently not implemented. */
  110. SCM
  111. scm_i_vm_capture_stack (union scm_vm_stack_element *stack_top,
  112. union scm_vm_stack_element *fp,
  113. union scm_vm_stack_element *sp, scm_t_uint32 *ra,
  114. scm_t_dynstack *dynstack, scm_t_uint32 flags)
  115. {
  116. struct scm_vm_cont *p;
  117. p = scm_gc_malloc (sizeof (*p), "capture_vm_cont");
  118. p->stack_size = stack_top - sp;
  119. p->stack_bottom = scm_gc_malloc (p->stack_size * sizeof (*p->stack_bottom),
  120. "capture_vm_cont");
  121. p->ra = ra;
  122. p->fp = fp;
  123. memcpy (p->stack_bottom, sp, p->stack_size * sizeof (*p->stack_bottom));
  124. p->reloc = (p->stack_bottom + p->stack_size) - stack_top;
  125. p->dynstack = dynstack;
  126. p->flags = flags;
  127. return scm_cell (scm_tc7_vm_cont, (scm_t_bits) p);
  128. }
  129. struct return_to_continuation_data
  130. {
  131. struct scm_vm_cont *cp;
  132. struct scm_vm *vp;
  133. };
  134. /* Called with the GC lock to prevent the stack marker from traversing a
  135. stack in an inconsistent state. */
  136. static void *
  137. vm_return_to_continuation_inner (void *data_ptr)
  138. {
  139. struct return_to_continuation_data *data = data_ptr;
  140. struct scm_vm *vp = data->vp;
  141. struct scm_vm_cont *cp = data->cp;
  142. union scm_vm_stack_element *cp_stack_top;
  143. scm_t_ptrdiff reloc;
  144. /* We know that there is enough space for the continuation, because we
  145. captured it in the past. However there may have been an expansion
  146. since the capture, so we may have to re-link the frame
  147. pointers. */
  148. cp_stack_top = cp->stack_bottom + cp->stack_size;
  149. reloc = (vp->stack_top - (cp_stack_top - cp->reloc));
  150. vp->fp = cp->fp + reloc;
  151. memcpy (vp->stack_top - cp->stack_size,
  152. cp->stack_bottom,
  153. cp->stack_size * sizeof (*cp->stack_bottom));
  154. vm_restore_sp (vp, vp->stack_top - cp->stack_size);
  155. return NULL;
  156. }
  157. static void
  158. vm_return_to_continuation (struct scm_vm *vp, SCM cont, size_t n,
  159. union scm_vm_stack_element *argv)
  160. {
  161. struct scm_vm_cont *cp;
  162. union scm_vm_stack_element *argv_copy;
  163. struct return_to_continuation_data data;
  164. argv_copy = alloca (n * sizeof (*argv));
  165. memcpy (argv_copy, argv, n * sizeof (*argv));
  166. cp = SCM_VM_CONT_DATA (cont);
  167. data.cp = cp;
  168. data.vp = vp;
  169. GC_call_with_alloc_lock (vm_return_to_continuation_inner, &data);
  170. /* Now we have the continuation properly copied over. We just need to
  171. copy on an empty frame and the return values, as the continuation
  172. expects. */
  173. vm_push_sp (vp, vp->sp - 3 - n);
  174. vp->sp[n+2].as_scm = SCM_BOOL_F;
  175. vp->sp[n+1].as_scm = SCM_BOOL_F;
  176. vp->sp[n].as_scm = SCM_BOOL_F;
  177. memcpy(vp->sp, argv_copy, n * sizeof (union scm_vm_stack_element));
  178. vp->ip = cp->ra;
  179. }
  180. static struct scm_vm * thread_vm (scm_i_thread *t);
  181. SCM
  182. scm_i_capture_current_stack (void)
  183. {
  184. scm_i_thread *thread;
  185. struct scm_vm *vp;
  186. thread = SCM_I_CURRENT_THREAD;
  187. vp = thread_vm (thread);
  188. return scm_i_vm_capture_stack (vp->stack_top, vp->fp, vp->sp, vp->ip,
  189. scm_dynstack_capture_all (&thread->dynstack),
  190. 0);
  191. }
  192. static void vm_dispatch_apply_hook (struct scm_vm *vp) SCM_NOINLINE;
  193. static void vm_dispatch_push_continuation_hook (struct scm_vm *vp) SCM_NOINLINE;
  194. static void vm_dispatch_pop_continuation_hook
  195. (struct scm_vm *vp, union scm_vm_stack_element *old_fp) SCM_NOINLINE;
  196. static void vm_dispatch_next_hook (struct scm_vm *vp) SCM_NOINLINE;
  197. static void vm_dispatch_abort_hook (struct scm_vm *vp) SCM_NOINLINE;
  198. static void
  199. vm_dispatch_hook (struct scm_vm *vp, int hook_num,
  200. union scm_vm_stack_element *argv, int n)
  201. {
  202. SCM hook;
  203. struct scm_frame c_frame;
  204. scm_t_cell *frame;
  205. int saved_trace_level;
  206. hook = vp->hooks[hook_num];
  207. if (SCM_LIKELY (scm_is_false (hook))
  208. || scm_is_null (SCM_HOOK_PROCEDURES (hook)))
  209. return;
  210. saved_trace_level = vp->trace_level;
  211. vp->trace_level = 0;
  212. /* Allocate a frame object on the stack. This is more efficient than calling
  213. `scm_c_make_frame ()' to allocate on the heap, but it forces hooks to not
  214. capture frame objects.
  215. At the same time, procedures such as `frame-procedure' make sense only
  216. while the stack frame represented by the frame object is visible, so it
  217. seems reasonable to limit the lifetime of frame objects. */
  218. c_frame.stack_holder = vp;
  219. c_frame.fp_offset = vp->stack_top - vp->fp;
  220. c_frame.sp_offset = vp->stack_top - vp->sp;
  221. c_frame.ip = vp->ip;
  222. /* Arrange for FRAME to be 8-byte aligned, like any other cell. */
  223. frame = alloca (sizeof (*frame) + 8);
  224. frame = (scm_t_cell *) ROUND_UP ((scm_t_uintptr) frame, 8UL);
  225. frame->word_0 = SCM_PACK (scm_tc7_frame | (SCM_VM_FRAME_KIND_VM << 8));
  226. frame->word_1 = SCM_PACK_POINTER (&c_frame);
  227. if (n == 0)
  228. {
  229. SCM args[1];
  230. args[0] = SCM_PACK_POINTER (frame);
  231. scm_c_run_hookn (hook, args, 1);
  232. }
  233. else if (n == 1)
  234. {
  235. SCM args[2];
  236. args[0] = SCM_PACK_POINTER (frame);
  237. args[1] = argv[0].as_scm;
  238. scm_c_run_hookn (hook, args, 2);
  239. }
  240. else
  241. {
  242. SCM args = SCM_EOL;
  243. int i;
  244. for (i = 0; i < n; i++)
  245. args = scm_cons (argv[i].as_scm, args);
  246. scm_c_run_hook (hook, scm_cons (SCM_PACK_POINTER (frame), args));
  247. }
  248. vp->trace_level = saved_trace_level;
  249. }
  250. static void
  251. vm_dispatch_apply_hook (struct scm_vm *vp)
  252. {
  253. return vm_dispatch_hook (vp, SCM_VM_APPLY_HOOK, NULL, 0);
  254. }
  255. static void vm_dispatch_push_continuation_hook (struct scm_vm *vp)
  256. {
  257. return vm_dispatch_hook (vp, SCM_VM_PUSH_CONTINUATION_HOOK, NULL, 0);
  258. }
  259. static void vm_dispatch_pop_continuation_hook (struct scm_vm *vp,
  260. union scm_vm_stack_element *old_fp)
  261. {
  262. return vm_dispatch_hook (vp, SCM_VM_POP_CONTINUATION_HOOK,
  263. vp->sp, SCM_FRAME_NUM_LOCALS (old_fp, vp->sp) - 1);
  264. }
  265. static void vm_dispatch_next_hook (struct scm_vm *vp)
  266. {
  267. return vm_dispatch_hook (vp, SCM_VM_NEXT_HOOK, NULL, 0);
  268. }
  269. static void vm_dispatch_abort_hook (struct scm_vm *vp)
  270. {
  271. return vm_dispatch_hook (vp, SCM_VM_ABORT_CONTINUATION_HOOK,
  272. vp->sp, SCM_FRAME_NUM_LOCALS (vp->fp, vp->sp) - 1);
  273. }
  274. static void
  275. vm_abort (struct scm_vm *vp, SCM tag, size_t nargs,
  276. scm_i_jmp_buf *current_registers) SCM_NORETURN;
  277. static void
  278. vm_abort (struct scm_vm *vp, SCM tag, size_t nargs,
  279. scm_i_jmp_buf *current_registers)
  280. {
  281. size_t i;
  282. SCM *argv;
  283. argv = alloca (nargs * sizeof (SCM));
  284. for (i = 0; i < nargs; i++)
  285. argv[i] = vp->sp[nargs - i - 1].as_scm;
  286. vp->sp = vp->fp;
  287. scm_c_abort (vp, tag, nargs, argv, current_registers);
  288. }
  289. struct vm_reinstate_partial_continuation_data
  290. {
  291. struct scm_vm *vp;
  292. struct scm_vm_cont *cp;
  293. scm_t_ptrdiff reloc;
  294. };
  295. static void *
  296. vm_reinstate_partial_continuation_inner (void *data_ptr)
  297. {
  298. struct vm_reinstate_partial_continuation_data *data = data_ptr;
  299. struct scm_vm *vp = data->vp;
  300. struct scm_vm_cont *cp = data->cp;
  301. union scm_vm_stack_element *base_fp;
  302. scm_t_ptrdiff reloc;
  303. base_fp = vp->fp;
  304. reloc = cp->reloc + (base_fp - (cp->stack_bottom + cp->stack_size));
  305. memcpy (base_fp - cp->stack_size,
  306. cp->stack_bottom,
  307. cp->stack_size * sizeof (*cp->stack_bottom));
  308. vp->fp = cp->fp + reloc;
  309. vp->ip = cp->ra;
  310. data->reloc = reloc;
  311. return NULL;
  312. }
  313. static void
  314. vm_reinstate_partial_continuation (struct scm_vm *vp, SCM cont, size_t nargs,
  315. scm_t_dynstack *dynstack,
  316. scm_i_jmp_buf *registers)
  317. {
  318. struct vm_reinstate_partial_continuation_data data;
  319. struct scm_vm_cont *cp;
  320. union scm_vm_stack_element *args;
  321. scm_t_ptrdiff reloc;
  322. args = alloca (nargs * sizeof (*args));
  323. memcpy (args, vp->sp, nargs * sizeof (*args));
  324. cp = SCM_VM_CONT_DATA (cont);
  325. vm_push_sp (vp, vp->fp - (cp->stack_size + nargs + 1));
  326. data.vp = vp;
  327. data.cp = cp;
  328. GC_call_with_alloc_lock (vm_reinstate_partial_continuation_inner, &data);
  329. reloc = data.reloc;
  330. /* The resume continuation will expect ARGS on the stack as if from a
  331. multiple-value return. Fill in the closure slot with #f, and copy
  332. the arguments into place. */
  333. vp->sp[nargs].as_scm = SCM_BOOL_F;
  334. memcpy (vp->sp, args, nargs * sizeof (*args));
  335. /* The prompt captured a slice of the dynamic stack. Here we wind
  336. those entries onto the current thread's stack. We also have to
  337. relocate any prompts that we see along the way. */
  338. {
  339. scm_t_bits *walk;
  340. for (walk = SCM_DYNSTACK_FIRST (cp->dynstack);
  341. SCM_DYNSTACK_TAG (walk);
  342. walk = SCM_DYNSTACK_NEXT (walk))
  343. {
  344. scm_t_bits tag = SCM_DYNSTACK_TAG (walk);
  345. if (SCM_DYNSTACK_TAG_TYPE (tag) == SCM_DYNSTACK_TYPE_PROMPT)
  346. scm_dynstack_wind_prompt (dynstack, walk, reloc, registers);
  347. else
  348. scm_dynstack_wind_1 (dynstack, walk);
  349. }
  350. }
  351. }
  352. /*
  353. * VM Error Handling
  354. */
  355. static void vm_error (const char *msg, SCM arg) SCM_NORETURN;
  356. static void vm_error_bad_instruction (scm_t_uint32 inst) SCM_NORETURN SCM_NOINLINE;
  357. static void vm_error_unbound (SCM sym) SCM_NORETURN SCM_NOINLINE;
  358. static void vm_error_unbound_fluid (SCM fluid) SCM_NORETURN SCM_NOINLINE;
  359. static void vm_error_not_a_variable (const char *func_name, SCM x) SCM_NORETURN SCM_NOINLINE;
  360. static void vm_error_apply_to_non_list (SCM x) SCM_NORETURN SCM_NOINLINE;
  361. static void vm_error_kwargs_length_not_even (SCM proc) SCM_NORETURN SCM_NOINLINE;
  362. static void vm_error_kwargs_invalid_keyword (SCM proc, SCM obj) SCM_NORETURN SCM_NOINLINE;
  363. static void vm_error_kwargs_unrecognized_keyword (SCM proc, SCM kw) SCM_NORETURN SCM_NOINLINE;
  364. static void vm_error_too_many_args (int nargs) SCM_NORETURN SCM_NOINLINE;
  365. static void vm_error_wrong_num_args (SCM proc) SCM_NORETURN SCM_NOINLINE;
  366. static void vm_error_wrong_type_apply (SCM proc) SCM_NORETURN SCM_NOINLINE;
  367. static void vm_error_stack_underflow (void) SCM_NORETURN SCM_NOINLINE;
  368. static void vm_error_improper_list (SCM x) SCM_NORETURN SCM_NOINLINE;
  369. static void vm_error_not_a_pair (const char *subr, SCM x) SCM_NORETURN SCM_NOINLINE;
  370. static void vm_error_not_a_string (const char *subr, SCM x) SCM_NORETURN SCM_NOINLINE;
  371. static void vm_error_not_a_bytevector (const char *subr, SCM x) SCM_NORETURN SCM_NOINLINE;
  372. static void vm_error_not_a_struct (const char *subr, SCM x) SCM_NORETURN SCM_NOINLINE;
  373. static void vm_error_not_a_vector (const char *subr, SCM v) SCM_NORETURN SCM_NOINLINE;
  374. static void vm_error_out_of_range (const char *subr, SCM k) SCM_NORETURN SCM_NOINLINE;
  375. static void vm_error_out_of_range_uint64 (const char *subr, scm_t_uint64 idx) SCM_NORETURN SCM_NOINLINE;
  376. static void vm_error_out_of_range_int64 (const char *subr, scm_t_int64 idx) SCM_NORETURN SCM_NOINLINE;
  377. static void vm_error_no_values (void) SCM_NORETURN SCM_NOINLINE;
  378. static void vm_error_not_enough_values (void) SCM_NORETURN SCM_NOINLINE;
  379. static void vm_error_wrong_number_of_values (scm_t_uint32 expected) SCM_NORETURN SCM_NOINLINE;
  380. static void vm_error_continuation_not_rewindable (SCM cont) SCM_NORETURN SCM_NOINLINE;
  381. static void vm_error_bad_wide_string_length (size_t len) SCM_NORETURN SCM_NOINLINE;
  382. static void
  383. vm_error (const char *msg, SCM arg)
  384. {
  385. scm_throw (sym_vm_error,
  386. scm_list_3 (sym_vm_run, scm_from_latin1_string (msg),
  387. SCM_UNBNDP (arg) ? SCM_EOL : scm_list_1 (arg)));
  388. abort(); /* not reached */
  389. }
  390. static void
  391. vm_error_bad_instruction (scm_t_uint32 inst)
  392. {
  393. vm_error ("VM: Bad instruction: ~s", scm_from_uint32 (inst));
  394. }
  395. static void
  396. vm_error_unbound (SCM sym)
  397. {
  398. scm_error_scm (scm_misc_error_key, SCM_BOOL_F,
  399. scm_from_latin1_string ("Unbound variable: ~s"),
  400. scm_list_1 (sym), SCM_BOOL_F);
  401. }
  402. static void
  403. vm_error_unbound_fluid (SCM fluid)
  404. {
  405. scm_error_scm (scm_misc_error_key, SCM_BOOL_F,
  406. scm_from_latin1_string ("Unbound fluid: ~s"),
  407. scm_list_1 (fluid), SCM_BOOL_F);
  408. }
  409. static void
  410. vm_error_not_a_variable (const char *func_name, SCM x)
  411. {
  412. scm_error (scm_arg_type_key, func_name, "Not a variable: ~S",
  413. scm_list_1 (x), scm_list_1 (x));
  414. }
  415. static void
  416. vm_error_apply_to_non_list (SCM x)
  417. {
  418. scm_error (scm_arg_type_key, "apply", "Apply to non-list: ~S",
  419. scm_list_1 (x), scm_list_1 (x));
  420. }
  421. static void
  422. vm_error_kwargs_length_not_even (SCM proc)
  423. {
  424. scm_error_scm (sym_keyword_argument_error, proc,
  425. scm_from_latin1_string ("Odd length of keyword argument list"),
  426. SCM_EOL, SCM_BOOL_F);
  427. }
  428. static void
  429. vm_error_kwargs_invalid_keyword (SCM proc, SCM obj)
  430. {
  431. scm_error_scm (sym_keyword_argument_error, proc,
  432. scm_from_latin1_string ("Invalid keyword"),
  433. SCM_EOL, scm_list_1 (obj));
  434. }
  435. static void
  436. vm_error_kwargs_unrecognized_keyword (SCM proc, SCM kw)
  437. {
  438. scm_error_scm (sym_keyword_argument_error, proc,
  439. scm_from_latin1_string ("Unrecognized keyword"),
  440. SCM_EOL, scm_list_1 (kw));
  441. }
  442. static void
  443. vm_error_too_many_args (int nargs)
  444. {
  445. vm_error ("VM: Too many arguments", scm_from_int (nargs));
  446. }
  447. static void
  448. vm_error_wrong_num_args (SCM proc)
  449. {
  450. scm_wrong_num_args (proc);
  451. }
  452. static void
  453. vm_error_wrong_type_apply (SCM proc)
  454. {
  455. scm_error (scm_arg_type_key, NULL, "Wrong type to apply: ~S",
  456. scm_list_1 (proc), scm_list_1 (proc));
  457. }
  458. static void
  459. vm_error_stack_underflow (void)
  460. {
  461. vm_error ("VM: Stack underflow", SCM_UNDEFINED);
  462. }
  463. static void
  464. vm_error_improper_list (SCM x)
  465. {
  466. vm_error ("Expected a proper list, but got object with tail ~s", x);
  467. }
  468. static void
  469. vm_error_not_a_pair (const char *subr, SCM x)
  470. {
  471. scm_wrong_type_arg_msg (subr, 1, x, "pair");
  472. }
  473. static void
  474. vm_error_not_a_string (const char *subr, SCM x)
  475. {
  476. scm_wrong_type_arg_msg (subr, 1, x, "string");
  477. }
  478. static void
  479. vm_error_not_a_bytevector (const char *subr, SCM x)
  480. {
  481. scm_wrong_type_arg_msg (subr, 1, x, "bytevector");
  482. }
  483. static void
  484. vm_error_not_a_struct (const char *subr, SCM x)
  485. {
  486. scm_wrong_type_arg_msg (subr, 1, x, "struct");
  487. }
  488. static void
  489. vm_error_not_a_vector (const char *subr, SCM x)
  490. {
  491. scm_wrong_type_arg_msg (subr, 1, x, "vector");
  492. }
  493. static void
  494. vm_error_out_of_range (const char *subr, SCM k)
  495. {
  496. scm_to_size_t (k);
  497. scm_out_of_range (subr, k);
  498. }
  499. static void
  500. vm_error_out_of_range_uint64 (const char *subr, scm_t_uint64 idx)
  501. {
  502. scm_out_of_range (subr, scm_from_uint64 (idx));
  503. }
  504. static void
  505. vm_error_out_of_range_int64 (const char *subr, scm_t_int64 idx)
  506. {
  507. scm_out_of_range (subr, scm_from_int64 (idx));
  508. }
  509. static void
  510. vm_error_no_values (void)
  511. {
  512. vm_error ("Zero values returned to single-valued continuation",
  513. SCM_UNDEFINED);
  514. }
  515. static void
  516. vm_error_not_enough_values (void)
  517. {
  518. vm_error ("Too few values returned to continuation", SCM_UNDEFINED);
  519. }
  520. static void
  521. vm_error_wrong_number_of_values (scm_t_uint32 expected)
  522. {
  523. vm_error ("Wrong number of values returned to continuation (expected ~a)",
  524. scm_from_uint32 (expected));
  525. }
  526. static void
  527. vm_error_continuation_not_rewindable (SCM cont)
  528. {
  529. vm_error ("Unrewindable partial continuation", cont);
  530. }
  531. static void
  532. vm_error_bad_wide_string_length (size_t len)
  533. {
  534. vm_error ("VM: Bad wide string length: ~S", scm_from_size_t (len));
  535. }
  536. static SCM vm_boot_continuation;
  537. static SCM vm_builtin_apply;
  538. static SCM vm_builtin_values;
  539. static SCM vm_builtin_abort_to_prompt;
  540. static SCM vm_builtin_call_with_values;
  541. static SCM vm_builtin_call_with_current_continuation;
  542. static const scm_t_uint32 vm_boot_continuation_code[] = {
  543. SCM_PACK_OP_24 (halt, 0)
  544. };
  545. static const scm_t_uint32 vm_apply_non_program_code[] = {
  546. SCM_PACK_OP_24 (apply_non_program, 0)
  547. };
  548. static const scm_t_uint32 vm_builtin_apply_code[] = {
  549. SCM_PACK_OP_24 (assert_nargs_ge, 3),
  550. SCM_PACK_OP_24 (tail_apply, 0), /* proc in r1, args from r2 */
  551. };
  552. static const scm_t_uint32 vm_builtin_values_code[] = {
  553. SCM_PACK_OP_24 (return_values, 0) /* vals from r1 */
  554. };
  555. static const scm_t_uint32 vm_builtin_abort_to_prompt_code[] = {
  556. SCM_PACK_OP_24 (assert_nargs_ge, 2),
  557. SCM_PACK_OP_24 (abort, 0), /* tag in r1, vals from r2 */
  558. /* FIXME: Partial continuation should capture caller regs. */
  559. SCM_PACK_OP_24 (return_values, 0) /* vals from r1 */
  560. };
  561. static const scm_t_uint32 vm_builtin_call_with_values_code[] = {
  562. SCM_PACK_OP_24 (assert_nargs_ee, 3),
  563. SCM_PACK_OP_24 (alloc_frame, 7),
  564. SCM_PACK_OP_12_12 (mov, 0, 5),
  565. SCM_PACK_OP_24 (call, 6), SCM_PACK_OP_ARG_8_24 (0, 1),
  566. SCM_PACK_OP_24 (long_fmov, 0), SCM_PACK_OP_ARG_8_24 (0, 2),
  567. SCM_PACK_OP_24 (tail_call_shuffle, 7)
  568. };
  569. static const scm_t_uint32 vm_builtin_call_with_current_continuation_code[] = {
  570. SCM_PACK_OP_24 (assert_nargs_ee, 2),
  571. SCM_PACK_OP_24 (call_cc, 0)
  572. };
  573. int
  574. scm_i_vm_is_boot_continuation_code (scm_t_uint32 *ip)
  575. {
  576. return ip == vm_boot_continuation_code;
  577. }
  578. static SCM
  579. scm_vm_builtin_ref (unsigned idx)
  580. {
  581. switch (idx)
  582. {
  583. #define INDEX_TO_NAME(builtin, BUILTIN, req, opt, rest) \
  584. case SCM_VM_BUILTIN_##BUILTIN: return vm_builtin_##builtin;
  585. FOR_EACH_VM_BUILTIN(INDEX_TO_NAME)
  586. #undef INDEX_TO_NAME
  587. default: abort();
  588. }
  589. }
  590. SCM scm_sym_apply;
  591. static SCM scm_sym_values;
  592. static SCM scm_sym_abort_to_prompt;
  593. static SCM scm_sym_call_with_values;
  594. static SCM scm_sym_call_with_current_continuation;
  595. SCM
  596. scm_vm_builtin_name_to_index (SCM name)
  597. #define FUNC_NAME "builtin-name->index"
  598. {
  599. SCM_VALIDATE_SYMBOL (1, name);
  600. #define NAME_TO_INDEX(builtin, BUILTIN, req, opt, rest) \
  601. if (scm_is_eq (name, scm_sym_##builtin)) \
  602. return scm_from_uint (SCM_VM_BUILTIN_##BUILTIN);
  603. FOR_EACH_VM_BUILTIN(NAME_TO_INDEX)
  604. #undef NAME_TO_INDEX
  605. return SCM_BOOL_F;
  606. }
  607. #undef FUNC_NAME
  608. SCM
  609. scm_vm_builtin_index_to_name (SCM index)
  610. #define FUNC_NAME "builtin-index->name"
  611. {
  612. unsigned idx;
  613. SCM_VALIDATE_UINT_COPY (1, index, idx);
  614. switch (idx)
  615. {
  616. #define INDEX_TO_NAME(builtin, BUILTIN, req, opt, rest) \
  617. case SCM_VM_BUILTIN_##BUILTIN: return scm_sym_##builtin;
  618. FOR_EACH_VM_BUILTIN(INDEX_TO_NAME)
  619. #undef INDEX_TO_NAME
  620. default: return SCM_BOOL_F;
  621. }
  622. }
  623. #undef FUNC_NAME
  624. static void
  625. scm_init_vm_builtins (void)
  626. {
  627. scm_c_define_gsubr ("builtin-name->index", 1, 0, 0,
  628. scm_vm_builtin_name_to_index);
  629. scm_c_define_gsubr ("builtin-index->name", 1, 0, 0,
  630. scm_vm_builtin_index_to_name);
  631. }
  632. SCM
  633. scm_i_call_with_current_continuation (SCM proc)
  634. {
  635. return scm_call_1 (vm_builtin_call_with_current_continuation, proc);
  636. }
  637. /*
  638. * VM
  639. */
  640. #define VM_NAME vm_regular_engine
  641. #define VM_USE_HOOKS 0
  642. #define FUNC_NAME "vm-regular-engine"
  643. #include "vm-engine.c"
  644. #undef FUNC_NAME
  645. #undef VM_USE_HOOKS
  646. #undef VM_NAME
  647. #define VM_NAME vm_debug_engine
  648. #define VM_USE_HOOKS 1
  649. #define FUNC_NAME "vm-debug-engine"
  650. #include "vm-engine.c"
  651. #undef FUNC_NAME
  652. #undef VM_USE_HOOKS
  653. #undef VM_NAME
  654. typedef SCM (*scm_t_vm_engine) (scm_i_thread *current_thread, struct scm_vm *vp,
  655. scm_i_jmp_buf *registers, int resume);
  656. static const scm_t_vm_engine vm_engines[SCM_VM_NUM_ENGINES] =
  657. { vm_regular_engine, vm_debug_engine };
  658. static union scm_vm_stack_element*
  659. allocate_stack (size_t size)
  660. {
  661. void *ret;
  662. if (size >= ((size_t) -1) / sizeof (union scm_vm_stack_element))
  663. abort ();
  664. size *= sizeof (union scm_vm_stack_element);
  665. #if HAVE_SYS_MMAN_H
  666. ret = mmap (NULL, size, PROT_READ | PROT_WRITE,
  667. MAP_PRIVATE | MAP_ANONYMOUS, -1, 0);
  668. if (ret == NULL)
  669. /* Shouldn't happen. */
  670. abort ();
  671. if (ret == MAP_FAILED)
  672. ret = NULL;
  673. #else
  674. ret = malloc (size);
  675. #endif
  676. if (!ret)
  677. perror ("allocate_stack failed");
  678. return (union scm_vm_stack_element *) ret;
  679. }
  680. static void
  681. free_stack (union scm_vm_stack_element *stack, size_t size)
  682. {
  683. size *= sizeof (*stack);
  684. #if HAVE_SYS_MMAN_H
  685. munmap (stack, size);
  686. #else
  687. free (stack);
  688. #endif
  689. }
  690. /* Ideally what we would like is an mremap or a realloc that grows at
  691. the bottom, not the top. Oh well; mmap and memcpy are fast enough,
  692. considering that they run very infrequently. */
  693. static union scm_vm_stack_element*
  694. expand_stack (union scm_vm_stack_element *old_bottom, size_t old_size,
  695. size_t new_size)
  696. #define FUNC_NAME "expand_stack"
  697. {
  698. union scm_vm_stack_element *new_bottom;
  699. size_t extension_size;
  700. if (new_size >= ((size_t) -1) / sizeof (union scm_vm_stack_element))
  701. abort ();
  702. if (new_size <= old_size)
  703. abort ();
  704. extension_size = new_size - old_size;
  705. if ((size_t)old_bottom < extension_size * sizeof (union scm_vm_stack_element))
  706. abort ();
  707. new_bottom = allocate_stack (new_size);
  708. if (!new_bottom)
  709. return NULL;
  710. memcpy (new_bottom + extension_size,
  711. old_bottom,
  712. old_size * sizeof (union scm_vm_stack_element));
  713. free_stack (old_bottom, old_size);
  714. return new_bottom;
  715. }
  716. #undef FUNC_NAME
  717. static struct scm_vm *
  718. make_vm (void)
  719. #define FUNC_NAME "make_vm"
  720. {
  721. int i;
  722. struct scm_vm *vp;
  723. vp = scm_gc_malloc (sizeof (struct scm_vm), "vm");
  724. vp->stack_size = page_size / sizeof (union scm_vm_stack_element);
  725. vp->stack_bottom = allocate_stack (vp->stack_size);
  726. if (!vp->stack_bottom)
  727. /* As in expand_stack, we don't have any way to throw an exception
  728. if we can't allocate one measely page -- there's no stack to
  729. handle it. For now, abort. */
  730. abort ();
  731. vp->stack_top = vp->stack_bottom + vp->stack_size;
  732. vp->stack_limit = vp->stack_bottom;
  733. vp->overflow_handler_stack = SCM_EOL;
  734. vp->ip = NULL;
  735. vp->sp = vp->stack_top;
  736. vp->sp_min_since_gc = vp->sp;
  737. vp->fp = vp->stack_top;
  738. vp->engine = vm_default_engine;
  739. vp->trace_level = 0;
  740. for (i = 0; i < SCM_VM_NUM_HOOKS; i++)
  741. vp->hooks[i] = SCM_BOOL_F;
  742. return vp;
  743. }
  744. #undef FUNC_NAME
  745. static void
  746. return_unused_stack_to_os (struct scm_vm *vp)
  747. {
  748. #if HAVE_SYS_MMAN_H
  749. scm_t_uintptr lo = (scm_t_uintptr) vp->stack_bottom;
  750. scm_t_uintptr hi = (scm_t_uintptr) vp->sp;
  751. /* The second condition is needed to protect against wrap-around. */
  752. if (vp->sp_min_since_gc >= vp->stack_bottom && vp->sp >= vp->sp_min_since_gc)
  753. lo = (scm_t_uintptr) vp->sp_min_since_gc;
  754. lo &= ~(page_size - 1U); /* round down */
  755. hi &= ~(page_size - 1U); /* round down */
  756. /* Return these pages to the OS. The next time they are paged in,
  757. they will be zeroed. */
  758. if (lo < hi)
  759. {
  760. int ret = 0;
  761. do
  762. ret = madvise ((void *) lo, hi - lo, MADV_DONTNEED);
  763. while (ret && errno == -EAGAIN);
  764. if (ret)
  765. perror ("madvise failed");
  766. }
  767. vp->sp_min_since_gc = vp->sp;
  768. #endif
  769. }
  770. #define SLOT_MAP_CACHE_SIZE 32U
  771. struct slot_map_cache_entry
  772. {
  773. scm_t_uint32 *ip;
  774. const scm_t_uint8 *map;
  775. };
  776. struct slot_map_cache
  777. {
  778. struct slot_map_cache_entry entries[SLOT_MAP_CACHE_SIZE];
  779. };
  780. static const scm_t_uint8 *
  781. find_slot_map (scm_t_uint32 *ip, struct slot_map_cache *cache)
  782. {
  783. /* The lower two bits should be zero. FIXME: Use a better hash
  784. function; we don't expose scm_raw_hashq currently. */
  785. size_t slot = (((scm_t_uintptr) ip) >> 2) % SLOT_MAP_CACHE_SIZE;
  786. const scm_t_uint8 *map;
  787. if (cache->entries[slot].ip == ip)
  788. map = cache->entries[slot].map;
  789. else
  790. {
  791. map = scm_find_slot_map_unlocked (ip);
  792. cache->entries[slot].ip = ip;
  793. cache->entries[slot].map = map;
  794. }
  795. return map;
  796. }
  797. enum slot_desc
  798. {
  799. SLOT_DESC_DEAD = 0,
  800. SLOT_DESC_LIVE_RAW = 1,
  801. SLOT_DESC_LIVE_SCM = 2,
  802. SLOT_DESC_UNUSED = 3
  803. };
  804. /* Mark the active VM stack region. */
  805. struct GC_ms_entry *
  806. scm_i_vm_mark_stack (struct scm_vm *vp, struct GC_ms_entry *mark_stack_ptr,
  807. struct GC_ms_entry *mark_stack_limit)
  808. {
  809. union scm_vm_stack_element *sp, *fp;
  810. /* The first frame will be marked conservatively (without a slot map).
  811. This is because GC can happen at any point within the hottest
  812. activation, due to multiple threads or per-instruction hooks, and
  813. providing slot maps for all points in a program would take a
  814. prohibitive amount of space. */
  815. const scm_t_uint8 *slot_map = NULL;
  816. void *upper = (void *) GC_greatest_plausible_heap_addr;
  817. void *lower = (void *) GC_least_plausible_heap_addr;
  818. struct slot_map_cache cache;
  819. memset (&cache, 0, sizeof (cache));
  820. for (fp = vp->fp, sp = vp->sp;
  821. fp < vp->stack_top;
  822. fp = SCM_FRAME_DYNAMIC_LINK (fp))
  823. {
  824. scm_t_ptrdiff nlocals = SCM_FRAME_NUM_LOCALS (fp, sp);
  825. size_t slot = nlocals - 1;
  826. for (slot = nlocals - 1; sp < fp; sp++, slot--)
  827. {
  828. enum slot_desc desc = SLOT_DESC_LIVE_SCM;
  829. if (slot_map)
  830. desc = (slot_map[slot / 4U] >> ((slot % 4U) * 2)) & 3U;
  831. switch (desc)
  832. {
  833. case SLOT_DESC_LIVE_RAW:
  834. break;
  835. case SLOT_DESC_UNUSED:
  836. case SLOT_DESC_LIVE_SCM:
  837. if (SCM_NIMP (sp->as_scm) &&
  838. sp->as_ptr >= lower && sp->as_ptr <= upper)
  839. mark_stack_ptr = GC_mark_and_push (sp->as_ptr,
  840. mark_stack_ptr,
  841. mark_stack_limit,
  842. NULL);
  843. break;
  844. case SLOT_DESC_DEAD:
  845. /* This value may become dead as a result of GC,
  846. so we can't just leave it on the stack. */
  847. sp->as_scm = SCM_UNSPECIFIED;
  848. break;
  849. }
  850. }
  851. sp = SCM_FRAME_PREVIOUS_SP (fp);
  852. /* Inner frames may have a dead slots map for precise marking.
  853. Note that there may be other reasons to not have a dead slots
  854. map, e.g. if all of the frame's slots below the callee frame
  855. are live. */
  856. slot_map = find_slot_map (SCM_FRAME_RETURN_ADDRESS (fp), &cache);
  857. }
  858. return_unused_stack_to_os (vp);
  859. return mark_stack_ptr;
  860. }
  861. /* Free the VM stack, as this thread is exiting. */
  862. void
  863. scm_i_vm_free_stack (struct scm_vm *vp)
  864. {
  865. free_stack (vp->stack_bottom, vp->stack_size);
  866. vp->stack_bottom = vp->stack_top = vp->stack_limit = NULL;
  867. vp->stack_size = 0;
  868. }
  869. struct vm_expand_stack_data
  870. {
  871. struct scm_vm *vp;
  872. size_t stack_size;
  873. union scm_vm_stack_element *new_sp;
  874. };
  875. static void *
  876. vm_expand_stack_inner (void *data_ptr)
  877. {
  878. struct vm_expand_stack_data *data = data_ptr;
  879. struct scm_vm *vp = data->vp;
  880. union scm_vm_stack_element *old_top, *new_bottom;
  881. size_t new_size;
  882. scm_t_ptrdiff reloc;
  883. old_top = vp->stack_top;
  884. new_size = vp->stack_size;
  885. while (new_size < data->stack_size)
  886. new_size *= 2;
  887. new_bottom = expand_stack (vp->stack_bottom, vp->stack_size, new_size);
  888. if (!new_bottom)
  889. return NULL;
  890. vp->stack_bottom = new_bottom;
  891. vp->stack_size = new_size;
  892. vp->stack_top = vp->stack_bottom + new_size;
  893. vp->stack_limit = vp->stack_bottom;
  894. reloc = vp->stack_top - old_top;
  895. if (vp->fp)
  896. vp->fp += reloc;
  897. data->new_sp += reloc;
  898. return new_bottom;
  899. }
  900. static scm_t_ptrdiff
  901. current_overflow_size (struct scm_vm *vp)
  902. {
  903. if (scm_is_pair (vp->overflow_handler_stack))
  904. return scm_to_ptrdiff_t (scm_caar (vp->overflow_handler_stack));
  905. return -1;
  906. }
  907. static int
  908. should_handle_stack_overflow (struct scm_vm *vp, scm_t_ptrdiff stack_size)
  909. {
  910. scm_t_ptrdiff overflow_size = current_overflow_size (vp);
  911. return overflow_size >= 0 && stack_size >= overflow_size;
  912. }
  913. static void
  914. reset_stack_limit (struct scm_vm *vp)
  915. {
  916. if (should_handle_stack_overflow (vp, vp->stack_size))
  917. vp->stack_limit = vp->stack_top - current_overflow_size (vp);
  918. else
  919. vp->stack_limit = vp->stack_bottom;
  920. }
  921. struct overflow_handler_data
  922. {
  923. struct scm_vm *vp;
  924. SCM overflow_handler_stack;
  925. };
  926. static void
  927. wind_overflow_handler (void *ptr)
  928. {
  929. struct overflow_handler_data *data = ptr;
  930. data->vp->overflow_handler_stack = data->overflow_handler_stack;
  931. reset_stack_limit (data->vp);
  932. }
  933. static void
  934. unwind_overflow_handler (void *ptr)
  935. {
  936. struct overflow_handler_data *data = ptr;
  937. data->vp->overflow_handler_stack = scm_cdr (data->overflow_handler_stack);
  938. reset_stack_limit (data->vp);
  939. }
  940. static void
  941. vm_expand_stack (struct scm_vm *vp, union scm_vm_stack_element *new_sp)
  942. {
  943. scm_t_ptrdiff stack_size = vp->stack_top - new_sp;
  944. if (stack_size > vp->stack_size)
  945. {
  946. struct vm_expand_stack_data data;
  947. data.vp = vp;
  948. data.stack_size = stack_size;
  949. data.new_sp = new_sp;
  950. if (!GC_call_with_alloc_lock (vm_expand_stack_inner, &data))
  951. /* Throw an unwind-only exception. */
  952. scm_report_stack_overflow ();
  953. new_sp = data.new_sp;
  954. }
  955. vp->sp_min_since_gc = vp->sp = new_sp;
  956. if (should_handle_stack_overflow (vp, stack_size))
  957. {
  958. SCM more_stack, new_limit;
  959. struct overflow_handler_data data;
  960. data.vp = vp;
  961. data.overflow_handler_stack = vp->overflow_handler_stack;
  962. scm_dynwind_begin (SCM_F_DYNWIND_REWINDABLE);
  963. scm_dynwind_rewind_handler (unwind_overflow_handler, &data,
  964. SCM_F_WIND_EXPLICITLY);
  965. scm_dynwind_unwind_handler (wind_overflow_handler, &data,
  966. SCM_F_WIND_EXPLICITLY);
  967. /* Call the overflow handler. */
  968. more_stack = scm_call_0 (scm_cdar (data.overflow_handler_stack));
  969. /* If the overflow handler returns, its return value should be an
  970. integral number of words from the outer stack limit to transfer
  971. to the inner limit. */
  972. if (scm_to_ptrdiff_t (more_stack) <= 0)
  973. scm_out_of_range (NULL, more_stack);
  974. new_limit = scm_sum (scm_caar (data.overflow_handler_stack), more_stack);
  975. if (scm_is_pair (scm_cdr (data.overflow_handler_stack)))
  976. new_limit = scm_min (new_limit,
  977. scm_caadr (data.overflow_handler_stack));
  978. /* Ensure the new limit is in range. */
  979. scm_to_ptrdiff_t (new_limit);
  980. /* Increase the limit that we will restore. */
  981. scm_set_car_x (scm_car (data.overflow_handler_stack), new_limit);
  982. scm_dynwind_end ();
  983. /* Recurse. */
  984. return vm_expand_stack (vp, new_sp);
  985. }
  986. }
  987. static struct scm_vm *
  988. thread_vm (scm_i_thread *t)
  989. {
  990. if (SCM_UNLIKELY (!t->vp))
  991. t->vp = make_vm ();
  992. return t->vp;
  993. }
  994. struct scm_vm *
  995. scm_the_vm (void)
  996. {
  997. return thread_vm (SCM_I_CURRENT_THREAD);
  998. }
  999. SCM
  1000. scm_call_n (SCM proc, SCM *argv, size_t nargs)
  1001. {
  1002. scm_i_thread *thread;
  1003. struct scm_vm *vp;
  1004. union scm_vm_stack_element *return_fp, *call_fp;
  1005. /* Since nargs can only describe the length of a valid argv array in
  1006. elements and each element is at least 4 bytes, nargs will not be
  1007. greater than INTMAX/2 and therefore we don't have to check for
  1008. overflow here or below. */
  1009. size_t return_nlocals = 1, call_nlocals = nargs + 1, frame_size = 2;
  1010. scm_t_ptrdiff stack_reserve_words;
  1011. size_t i;
  1012. thread = SCM_I_CURRENT_THREAD;
  1013. vp = thread_vm (thread);
  1014. SCM_CHECK_STACK;
  1015. /* It's not valid for argv to point into the stack already. */
  1016. if ((void *) argv < (void *) vp->stack_top &&
  1017. (void *) argv >= (void *) vp->sp)
  1018. abort();
  1019. /* Check that we have enough space for the two stack frames: the
  1020. innermost one that makes the call, and its continuation which
  1021. receives the resulting value(s) and returns from the engine
  1022. call. */
  1023. stack_reserve_words = call_nlocals + frame_size + return_nlocals + frame_size;
  1024. vm_push_sp (vp, vp->sp - stack_reserve_words);
  1025. call_fp = vp->sp + call_nlocals;
  1026. return_fp = call_fp + frame_size + return_nlocals;
  1027. SCM_FRAME_SET_RETURN_ADDRESS (return_fp, vp->ip);
  1028. SCM_FRAME_SET_DYNAMIC_LINK (return_fp, vp->fp);
  1029. SCM_FRAME_LOCAL (return_fp, 0) = vm_boot_continuation;
  1030. vp->ip = (scm_t_uint32 *) vm_boot_continuation_code;
  1031. vp->fp = call_fp;
  1032. SCM_FRAME_SET_RETURN_ADDRESS (call_fp, vp->ip);
  1033. SCM_FRAME_SET_DYNAMIC_LINK (call_fp, return_fp);
  1034. SCM_FRAME_LOCAL (call_fp, 0) = proc;
  1035. for (i = 0; i < nargs; i++)
  1036. SCM_FRAME_LOCAL (call_fp, i + 1) = argv[i];
  1037. {
  1038. scm_i_jmp_buf registers;
  1039. int resume = SCM_I_SETJMP (registers);
  1040. if (SCM_UNLIKELY (resume))
  1041. {
  1042. scm_gc_after_nonlocal_exit ();
  1043. /* Non-local return. */
  1044. vm_dispatch_abort_hook (vp);
  1045. }
  1046. return vm_engines[vp->engine](thread, vp, &registers, resume);
  1047. }
  1048. }
  1049. /* Scheme interface */
  1050. #define VM_DEFINE_HOOK(n) \
  1051. { \
  1052. struct scm_vm *vp; \
  1053. vp = scm_the_vm (); \
  1054. if (scm_is_false (vp->hooks[n])) \
  1055. vp->hooks[n] = scm_make_hook (SCM_I_MAKINUM (1)); \
  1056. return vp->hooks[n]; \
  1057. }
  1058. SCM_DEFINE (scm_vm_apply_hook, "vm-apply-hook", 0, 0, 0,
  1059. (void),
  1060. "")
  1061. #define FUNC_NAME s_scm_vm_apply_hook
  1062. {
  1063. VM_DEFINE_HOOK (SCM_VM_APPLY_HOOK);
  1064. }
  1065. #undef FUNC_NAME
  1066. SCM_DEFINE (scm_vm_push_continuation_hook, "vm-push-continuation-hook", 0, 0, 0,
  1067. (void),
  1068. "")
  1069. #define FUNC_NAME s_scm_vm_push_continuation_hook
  1070. {
  1071. VM_DEFINE_HOOK (SCM_VM_PUSH_CONTINUATION_HOOK);
  1072. }
  1073. #undef FUNC_NAME
  1074. SCM_DEFINE (scm_vm_pop_continuation_hook, "vm-pop-continuation-hook", 0, 0, 0,
  1075. (void),
  1076. "")
  1077. #define FUNC_NAME s_scm_vm_pop_continuation_hook
  1078. {
  1079. VM_DEFINE_HOOK (SCM_VM_POP_CONTINUATION_HOOK);
  1080. }
  1081. #undef FUNC_NAME
  1082. SCM_DEFINE (scm_vm_next_hook, "vm-next-hook", 0, 0, 0,
  1083. (void),
  1084. "")
  1085. #define FUNC_NAME s_scm_vm_next_hook
  1086. {
  1087. VM_DEFINE_HOOK (SCM_VM_NEXT_HOOK);
  1088. }
  1089. #undef FUNC_NAME
  1090. SCM_DEFINE (scm_vm_abort_continuation_hook, "vm-abort-continuation-hook", 0, 0, 0,
  1091. (void),
  1092. "")
  1093. #define FUNC_NAME s_scm_vm_abort_continuation_hook
  1094. {
  1095. VM_DEFINE_HOOK (SCM_VM_ABORT_CONTINUATION_HOOK);
  1096. }
  1097. #undef FUNC_NAME
  1098. SCM_DEFINE (scm_vm_trace_level, "vm-trace-level", 0, 0, 0,
  1099. (void),
  1100. "")
  1101. #define FUNC_NAME s_scm_vm_trace_level
  1102. {
  1103. return scm_from_int (scm_the_vm ()->trace_level);
  1104. }
  1105. #undef FUNC_NAME
  1106. SCM_DEFINE (scm_set_vm_trace_level_x, "set-vm-trace-level!", 1, 0, 0,
  1107. (SCM level),
  1108. "")
  1109. #define FUNC_NAME s_scm_set_vm_trace_level_x
  1110. {
  1111. scm_the_vm ()->trace_level = scm_to_int (level);
  1112. return SCM_UNSPECIFIED;
  1113. }
  1114. #undef FUNC_NAME
  1115. /*
  1116. * VM engines
  1117. */
  1118. static int
  1119. symbol_to_vm_engine (SCM engine, const char *FUNC_NAME)
  1120. {
  1121. if (scm_is_eq (engine, sym_regular))
  1122. return SCM_VM_REGULAR_ENGINE;
  1123. else if (scm_is_eq (engine, sym_debug))
  1124. return SCM_VM_DEBUG_ENGINE;
  1125. else
  1126. SCM_MISC_ERROR ("Unknown VM engine: ~a", scm_list_1 (engine));
  1127. }
  1128. static SCM
  1129. vm_engine_to_symbol (int engine, const char *FUNC_NAME)
  1130. {
  1131. switch (engine)
  1132. {
  1133. case SCM_VM_REGULAR_ENGINE:
  1134. return sym_regular;
  1135. case SCM_VM_DEBUG_ENGINE:
  1136. return sym_debug;
  1137. default:
  1138. /* ? */
  1139. SCM_MISC_ERROR ("Unknown VM engine: ~a",
  1140. scm_list_1 (scm_from_int (engine)));
  1141. }
  1142. }
  1143. SCM_DEFINE (scm_vm_engine, "vm-engine", 0, 0, 0,
  1144. (void),
  1145. "")
  1146. #define FUNC_NAME s_scm_vm_engine
  1147. {
  1148. return vm_engine_to_symbol (scm_the_vm ()->engine, FUNC_NAME);
  1149. }
  1150. #undef FUNC_NAME
  1151. void
  1152. scm_c_set_vm_engine_x (int engine)
  1153. #define FUNC_NAME "set-vm-engine!"
  1154. {
  1155. if (engine < 0 || engine >= SCM_VM_NUM_ENGINES)
  1156. SCM_MISC_ERROR ("Unknown VM engine: ~a",
  1157. scm_list_1 (scm_from_int (engine)));
  1158. scm_the_vm ()->engine = engine;
  1159. }
  1160. #undef FUNC_NAME
  1161. SCM_DEFINE (scm_set_vm_engine_x, "set-vm-engine!", 1, 0, 0,
  1162. (SCM engine),
  1163. "")
  1164. #define FUNC_NAME s_scm_set_vm_engine_x
  1165. {
  1166. scm_c_set_vm_engine_x (symbol_to_vm_engine (engine, FUNC_NAME));
  1167. return SCM_UNSPECIFIED;
  1168. }
  1169. #undef FUNC_NAME
  1170. void
  1171. scm_c_set_default_vm_engine_x (int engine)
  1172. #define FUNC_NAME "set-default-vm-engine!"
  1173. {
  1174. if (engine < 0 || engine >= SCM_VM_NUM_ENGINES)
  1175. SCM_MISC_ERROR ("Unknown VM engine: ~a",
  1176. scm_list_1 (scm_from_int (engine)));
  1177. vm_default_engine = engine;
  1178. }
  1179. #undef FUNC_NAME
  1180. SCM_DEFINE (scm_set_default_vm_engine_x, "set-default-vm-engine!", 1, 0, 0,
  1181. (SCM engine),
  1182. "")
  1183. #define FUNC_NAME s_scm_set_default_vm_engine_x
  1184. {
  1185. scm_c_set_default_vm_engine_x (symbol_to_vm_engine (engine, FUNC_NAME));
  1186. return SCM_UNSPECIFIED;
  1187. }
  1188. #undef FUNC_NAME
  1189. /* FIXME: This function makes no sense, but we keep it to make sure we
  1190. have a way of switching to the debug or regular VM. */
  1191. SCM_DEFINE (scm_call_with_vm, "call-with-vm", 1, 0, 1,
  1192. (SCM proc, SCM args),
  1193. "Apply @var{proc} to @var{args} in a dynamic extent in which\n"
  1194. "@var{vm} is the current VM.")
  1195. #define FUNC_NAME s_scm_call_with_vm
  1196. {
  1197. return scm_apply_0 (proc, args);
  1198. }
  1199. #undef FUNC_NAME
  1200. SCM_DEFINE (scm_call_with_stack_overflow_handler,
  1201. "call-with-stack-overflow-handler", 3, 0, 0,
  1202. (SCM limit, SCM thunk, SCM handler),
  1203. "Call @var{thunk} in an environment in which the stack limit has\n"
  1204. "been reduced to @var{limit} additional words. If the limit is\n"
  1205. "reached, @var{handler} (a thunk) will be invoked in the dynamic\n"
  1206. "environment of the error. For the extent of the call to\n"
  1207. "@var{handler}, the stack limit and handler are restored to the\n"
  1208. "values that were in place when\n"
  1209. "@code{call-with-stack-overflow-handler} was called.")
  1210. #define FUNC_NAME s_scm_call_with_stack_overflow_handler
  1211. {
  1212. struct scm_vm *vp;
  1213. scm_t_ptrdiff c_limit, stack_size;
  1214. struct overflow_handler_data data;
  1215. SCM new_limit, ret;
  1216. vp = scm_the_vm ();
  1217. stack_size = vp->stack_top - vp->sp;
  1218. c_limit = scm_to_ptrdiff_t (limit);
  1219. if (c_limit <= 0)
  1220. scm_out_of_range (FUNC_NAME, limit);
  1221. new_limit = scm_sum (scm_from_ptrdiff_t (stack_size), limit);
  1222. if (scm_is_pair (vp->overflow_handler_stack))
  1223. new_limit = scm_min (new_limit, scm_caar (vp->overflow_handler_stack));
  1224. /* Hacky check that the current stack depth plus the limit is within
  1225. the range of a ptrdiff_t. */
  1226. scm_to_ptrdiff_t (new_limit);
  1227. data.vp = vp;
  1228. data.overflow_handler_stack =
  1229. scm_acons (limit, handler, vp->overflow_handler_stack);
  1230. scm_dynwind_begin (SCM_F_DYNWIND_REWINDABLE);
  1231. scm_dynwind_rewind_handler (wind_overflow_handler, &data,
  1232. SCM_F_WIND_EXPLICITLY);
  1233. scm_dynwind_unwind_handler (unwind_overflow_handler, &data,
  1234. SCM_F_WIND_EXPLICITLY);
  1235. /* Reset vp->sp_min_since_gc so that the VM checks actually
  1236. trigger. */
  1237. return_unused_stack_to_os (vp);
  1238. ret = scm_call_0 (thunk);
  1239. scm_dynwind_end ();
  1240. return ret;
  1241. }
  1242. #undef FUNC_NAME
  1243. /*
  1244. * Initialize
  1245. */
  1246. SCM
  1247. scm_load_compiled_with_vm (SCM file)
  1248. {
  1249. return scm_call_0 (scm_load_thunk_from_file (file));
  1250. }
  1251. void
  1252. scm_init_vm_builtin_properties (void)
  1253. {
  1254. /* FIXME: Seems hacky to do this here, but oh well :/ */
  1255. scm_sym_apply = scm_from_utf8_symbol ("apply");
  1256. scm_sym_values = scm_from_utf8_symbol ("values");
  1257. scm_sym_abort_to_prompt = scm_from_utf8_symbol ("abort-to-prompt");
  1258. scm_sym_call_with_values = scm_from_utf8_symbol ("call-with-values");
  1259. scm_sym_call_with_current_continuation =
  1260. scm_from_utf8_symbol ("call-with-current-continuation");
  1261. #define INIT_BUILTIN(builtin, BUILTIN, req, opt, rest) \
  1262. scm_set_procedure_property_x (vm_builtin_##builtin, scm_sym_name, \
  1263. scm_sym_##builtin); \
  1264. scm_set_procedure_minimum_arity_x (vm_builtin_##builtin, \
  1265. SCM_I_MAKINUM (req), \
  1266. SCM_I_MAKINUM (opt), \
  1267. scm_from_bool (rest));
  1268. FOR_EACH_VM_BUILTIN (INIT_BUILTIN);
  1269. #undef INIT_BUILTIN
  1270. }
  1271. void
  1272. scm_bootstrap_vm (void)
  1273. {
  1274. scm_c_register_extension ("libguile-" SCM_EFFECTIVE_VERSION,
  1275. "scm_init_vm",
  1276. (scm_t_extension_init_func)scm_init_vm, NULL);
  1277. scm_c_register_extension ("libguile-" SCM_EFFECTIVE_VERSION,
  1278. "scm_init_vm_builtins",
  1279. (scm_t_extension_init_func)scm_init_vm_builtins,
  1280. NULL);
  1281. page_size = getpagesize ();
  1282. /* page_size should be a power of two. */
  1283. if (page_size & (page_size - 1))
  1284. abort ();
  1285. sym_vm_run = scm_from_latin1_symbol ("vm-run");
  1286. sym_vm_error = scm_from_latin1_symbol ("vm-error");
  1287. sym_keyword_argument_error = scm_from_latin1_symbol ("keyword-argument-error");
  1288. sym_regular = scm_from_latin1_symbol ("regular");
  1289. sym_debug = scm_from_latin1_symbol ("debug");
  1290. vm_boot_continuation = scm_i_make_program (vm_boot_continuation_code);
  1291. SCM_SET_CELL_WORD_0 (vm_boot_continuation,
  1292. (SCM_CELL_WORD_0 (vm_boot_continuation)
  1293. | SCM_F_PROGRAM_IS_BOOT));
  1294. #define DEFINE_BUILTIN(builtin, BUILTIN, req, opt, rest) \
  1295. vm_builtin_##builtin = scm_i_make_program (vm_builtin_##builtin##_code);
  1296. FOR_EACH_VM_BUILTIN (DEFINE_BUILTIN);
  1297. #undef DEFINE_BUILTIN
  1298. }
  1299. void
  1300. scm_init_vm (void)
  1301. {
  1302. #ifndef SCM_MAGIC_SNARFER
  1303. #include "libguile/vm.x"
  1304. #endif
  1305. }
  1306. /*
  1307. Local Variables:
  1308. c-file-style: "gnu"
  1309. End:
  1310. */