forked from racket/racket
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy patheval.c
More file actions
3995 lines (3400 loc) · 117 KB
/
eval.c
File metadata and controls
3995 lines (3400 loc) · 117 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/* This file contains the main interpreter eval-apply loop,
scheme_do_eval(), C and Scheme stack management routines,
and other bridges between evaluation and compilation.
Evaluation:
The bytecode interpreter uses the C stack for continuations, and a
separate Scheme stack for activation-frame variables and collecting
application arguments. Closures are (nearly) flat, so mutable
variables are boxed. A third stack is used for continuation marks,
only as needed.
Tail calls are, for the most part, gotos within scheme_do_eval(). A
C function called by the main evaluation loop can perform a
trampoling tail call via scheme_tail_apply(). The trampoline must
return to its caller without allocating any memory, because an
allocation optimization in the tail-call code assumes no GCs will
occur between the time that a tail call is issued and the time when
it's handled.
Multiple values are returned as a special SCHEME_MULTIPLE_VALUES
token that indicates actual values are stored in the current
thread's record.
The `apply' half of the `eval--apply' loop branches on all possible
application types. Some functions can be JIT-generated native code,
so `apply' is the bridge from interpreted code to JITted
code. Primitive functions (including cons) are implemented by C
functions outside the loop. Continuation applications are handled
directly in scheme_do_eval(). That leaves calls to non-JITted
closures, which are also performed within scheme_do_eval() (so that
most tail calls avoid the trampoline), which is analogous to a
primitive.
The `eval' half of the loop handles all core syntactic forms, such
as application and `letrec's.
When collecting the arguments for an application, scheme_do_eval()
avoids recursive C calls to evaluate arguments by recognizing
easily-evaluated expressions, such as constants and variable
lookups. This can be viewed as a kind of half-way A-normalization.
Bytecodes are not linear. They're actually trees of expression
nodes.
Top-level variables (imported or defined in a linklet) are
referenced through the Scheme stack, so that the variables can be
re-linked each time a linklet is instantiated. The top-level are
sometimes called the "prefix", and push_prefix() initializes the
prefix portion of the stack. This prefix is captured in a
continuation that refers to top-level variables (which is why the
closure is not entirely flat). Special GC support allows a prefix
to be pruned to just the globals that are used by live closures.
Bytecode compilation:
Compilation works in five passes.
The first pass, called "compile", is the expander and compiler
front-end. See "compile.c" along with "compenv.c".
The second pass, called "letrec_check", determines which references
to `letrec'-bound variables need to be guarded with a run-time
check to prevent use before definition. The analysis result is
reflected by the insertion of `check-not-unsafe-undefined`
calls. This this pass mutates records produced by the "compile"
pass.
The third pass, called "optimize", performs constant propagation,
constant folding, and function inlining; this pass mutates records
produced by the "letrec_check" pass. See "optimize.c". This pass
isn't optional; for example, it calculates closure information that
the fourth pass uses.
The fourth pass, called "resolve", finishes compilation by computing
variable offsets and indirections (often mutating the records
produced by the first pass). It is also responsible for closure
conversion (i.e., converting closure content to arguments) and
lifting (of procedures that close over nothing or only globals).
Beware that the resulting bytecode object is a graph, not a tree,
due to sharing (potentially cyclic) of closures that are "empty"
but actually refer to other "empty" closures. See "resolve.c".
The fifth pass, "sfs", performs another liveness analysis on stack
slots and inserts operations to clear stack slots as necessary to
make execution safe for space. In particular, dead slots need to be
cleared before a non-tail call into arbitrary Racket code. This pass
can mutate the result of the "resolve" pass. See "sfs.c".
Bytecode marshaling and validation:
See "marshal.c" for functions that [un]marshal bytecode form
to/from S-expressions (roughly), which can then be printed using a
"fast-load" format.
The bytecode validator is applied to unmarshaled bytecode to check
that the bytecode is well formed and won't cause any segfaults in
the interpreter or in JITted form. See "validate.c".
Just-in-time compilation:
If the JIT is enabled, then an extra "jitprep" pass processes
bytecode one more time --- but only bytecode that is not going to
be marshaled, and possibly bytecode that was just unmarshaled.
In this "jitprep" pass, the `lambda' and `case-lambda'
forms are converted to native-code generators, instead of bytecode
variants. The code is not actually JITted until it is called; this
preparation step merely sets up a JIT hook for each function. The
preparation pass is a shallow, functional (i.e., it doesn't mutate
the original bytecode) pass; the body of a function is prepared for
JITting lazily. See "jitprep.c".
*/
#include "schpriv.h"
#include "schrunst.h"
#ifdef MZ_USE_FUTURES
# include "future.h"
#endif
#ifdef USE_STACKAVAIL
#include <malloc.h>
#endif
#ifdef UNIX_FIND_STACK_BOUNDS
#include <signal.h>
#include <sys/time.h>
#include <sys/resource.h>
#endif
#ifdef PTHREAD_STACKSEG_FIND_STACK_BOUNDS
# include <sys/signal.h>
# include <pthread.h>
# include <pthread_np.h>
#endif
#ifdef WINDOWS_FIND_STACK_BOUNDS
#include <windows.h>
#endif
#include "schmach.h"
#ifdef MACOS_STACK_LIMIT
#include <Memory.h>
#endif
#ifdef MZ_USE_FUTURES
# include "future.h"
#endif
#ifdef MZ_USE_JIT
# define INIT_JIT_ON 1
#else
# define INIT_JIT_ON 0
#endif
#ifdef __clang__
# ifdef MZ_PRECISE_GC
# pragma clang diagnostic ignored "-Wself-assign"
# endif
#endif
/* globals */
SHARED_OK int scheme_startup_use_jit = INIT_JIT_ON;
SHARED_OK int scheme_startup_compile_machine_independent = 0;
void scheme_set_startup_use_jit(int v) { scheme_startup_use_jit = v; }
void scheme_set_startup_compile_machine_independent(int v) {
scheme_startup_compile_machine_independent = v;
}
/* THREAD LOCAL SHARED */
THREAD_LOCAL_DECL(volatile int scheme_fuel_counter);
#ifdef USE_STACK_BOUNDARY_VAR
THREAD_LOCAL_DECL(uintptr_t scheme_stack_boundary);
THREAD_LOCAL_DECL(uintptr_t volatile scheme_jit_stack_boundary);
#endif
THREAD_LOCAL_DECL(int scheme_continuation_application_count);
THREAD_LOCAL_DECL(int scheme_overflow_count);
THREAD_LOCAL_DECL(Scheme_Prefix *scheme_prefix_finalize);
THREAD_LOCAL_DECL(Scheme_Prefix *scheme_inc_prefix_finalize);
THREAD_LOCAL_DECL(Scheme_Object *is_syntax_proc);
THREAD_LOCAL_DECL(Scheme_Object *expander_syntax_to_datum_proc);
THREAD_LOCAL_DECL(Scheme_Bucket_Table *scheme_namespace_to_env);
int scheme_get_overflow_count() { return scheme_overflow_count; }
/* read-only globals */
READ_ONLY Scheme_Object *scheme_eval_waiting;
READ_ONLY Scheme_Object *scheme_multiple_values;
/* symbols */
ROSYM Scheme_Object *scheme_stack_dump_key;
READ_ONLY static Scheme_Object *zero_rands_ptr; /* &zero_rands_ptr is dummy rands pointer */
/* locals */
static Scheme_Object *enable_break(int, Scheme_Object *[]);
static Scheme_Object *allow_set_undefined(int argc, Scheme_Object **argv);
static Scheme_Object *compile_module_constants(int argc, Scheme_Object **argv);
static Scheme_Object *use_jit(int argc, Scheme_Object **argv);
static Scheme_Object *disallow_inline(int argc, Scheme_Object **argv);
static Scheme_Object *compile_target_machine(int argc, Scheme_Object **argv);
static Scheme_Object *compile_is_target_machine(int argc, Scheme_Object **argv);
void scheme_escape_to_continuation(Scheme_Object *obj, int num_rands, Scheme_Object **rands, Scheme_Object *alt_full);
#define cons(x,y) scheme_make_pair(x,y)
typedef void (*DW_PrePost_Proc)(void *);
#ifdef MZ_PRECISE_GC
static void register_traversers(void);
#endif
#define icons scheme_make_pair
/*========================================================================*/
/* initialization */
/*========================================================================*/
void
scheme_init_eval (Scheme_Startup_Env *env)
{
#ifdef MZ_PRECISE_GC
register_traversers();
#endif
#ifdef MZ_EVAL_WAITING_CONSTANT
scheme_eval_waiting = MZ_EVAL_WAITING_CONSTANT;
#else
REGISTER_SO(scheme_eval_waiting);
scheme_eval_waiting = scheme_alloc_eternal_object();
scheme_eval_waiting->type = scheme_eval_waiting_type;
#endif
#ifdef MZ_EVAL_WAITING_CONSTANT
scheme_multiple_values = MZ_MULTIPLE_VALUES_CONSTANT;
#else
REGISTER_SO(scheme_multiple_values);
scheme_multiple_values = scheme_alloc_eternal_object();
scheme_multiple_values->type = scheme_multiple_values_type;
#endif
REGISTER_SO(scheme_stack_dump_key);
scheme_stack_dump_key = scheme_make_symbol("stk"); /* uninterned! */
ADD_PRIM_W_ARITY("break-enabled", enable_break, 0, 1, env);
ADD_PARAMETER("compile-allow-set!-undefined", allow_set_undefined, MZCONFIG_ALLOW_SET_UNDEFINED, env);
ADD_PARAMETER("compile-enforce-module-constants", compile_module_constants, MZCONFIG_COMPILE_MODULE_CONSTS, env);
ADD_PARAMETER("eval-jit-enabled", use_jit, MZCONFIG_USE_JIT, env);
ADD_PARAMETER("compile-context-preservation-enabled", disallow_inline, MZCONFIG_DISALLOW_INLINE, env);
ADD_PARAMETER("current-compile-target-machine", compile_target_machine, MZCONFIG_COMPILE_TARGET_MACHINE, env);
ADD_PRIM_W_ARITY("compile-target-machine?", compile_is_target_machine, 1, 1, env);
}
void scheme_init_eval_places()
{
#ifdef DEBUG_CHECK_STACK_FRAME_SIZE
(void)scheme_do_eval(SCHEME_TAIL_CALL_WAITING, 0, NULL, 0);
#endif
}
XFORM_NONGCING static void ignore_result(Scheme_Object *v)
{
if (SAME_OBJ(v, SCHEME_MULTIPLE_VALUES)) {
scheme_current_thread->ku.multiple.array = NULL;
}
}
void scheme_ignore_result(Scheme_Object *v)
{
ignore_result(v);
}
/*========================================================================*/
/* C stack and Scheme stack handling */
/*========================================================================*/
Scheme_Object *
scheme_handle_stack_overflow(Scheme_Object *(*k)(void))
{
/* "Stack overflow" means running out of C-stack space. The other
end of this handler (i.e., the target for the longjmp) is
scheme_top_level_do in fun.c */
Scheme_Thread *p = scheme_current_thread;
Scheme_Overflow *overflow;
Scheme_Overflow_Jmp *jmp;
scheme_about_to_move_C_stack();
p->overflow_k = k;
scheme_overflow_count++;
overflow = MALLOC_ONE_RT(Scheme_Overflow);
#ifdef MZTAG_REQUIRED
overflow->type = scheme_rt_overflow;
#endif
/* push old overflow */
overflow->prev = scheme_current_thread->overflow;
p->overflow = overflow;
overflow->stack_start = p->stack_start;
jmp = MALLOC_ONE_RT(Scheme_Overflow_Jmp);
#ifdef MZTAG_REQUIRED
jmp->type = scheme_rt_overflow_jmp;
#endif
overflow->jmp = jmp;
scheme_init_jmpup_buf(&overflow->jmp->cont);
scheme_zero_unneeded_rands(scheme_current_thread); /* for GC */
if (scheme_setjmpup(&overflow->jmp->cont, overflow->jmp, p->stack_start)) {
p = scheme_current_thread;
overflow = p->overflow;
p->overflow = overflow->prev;
p->error_buf = overflow->jmp->savebuf;
if (p->meta_prompt) {
/* When unwinding a stack overflow, we need to fix up
the meta prompt to have the restored stack base.
(When overflow happens with a meta prompt in place,
no fixup is needed, because the overflow is detected
at the point where the meta-prompt's base would be used.) */
Scheme_Prompt *meta_prompt;
meta_prompt = MALLOC_ONE_TAGGED(Scheme_Prompt);
memcpy(meta_prompt, p->meta_prompt, sizeof(Scheme_Prompt));
meta_prompt->stack_boundary = p->stack_start;
p->meta_prompt = meta_prompt;
}
if (!overflow->jmp->captured) /* reset if not captured in a continuation */
scheme_reset_jmpup_buf(&overflow->jmp->cont);
if (!scheme_overflow_reply) {
/* No reply value means we should continue some escape. */
if (p->cjs.jumping_to_continuation
&& p->cjs.is_escape) {
/* Jump directly to prompt: */
Scheme_Prompt *prompt = (Scheme_Prompt *)p->cjs.jumping_to_continuation;
scheme_longjmp(*prompt->prompt_buf, 1);
} else if (p->cjs.jumping_to_continuation
&& SCHEME_CONTP(p->cjs.jumping_to_continuation)) {
Scheme_Cont *c = (Scheme_Cont *)p->cjs.jumping_to_continuation;
p->cjs.jumping_to_continuation = NULL;
scheme_longjmpup(&c->buf_ptr->buf);
} else {
/* Continue normal escape: */
scheme_longjmp(scheme_error_buf, 1);
}
} else {
Scheme_Object *reply = scheme_overflow_reply;
scheme_overflow_reply = NULL;
return reply;
}
} else {
p->stack_start = scheme_overflow_stack_start;
scheme_longjmpup(&scheme_overflow_jmp->cont);
}
return NULL; /* never gets here */
}
#ifdef LINUX_FIND_STACK_BASE
static uintptr_t adjust_stack_base(uintptr_t bnd, uintptr_t lim) {
if (bnd == scheme_get_primordial_thread_stack_base()) {
/* The address `base' might be far from the actual stack base
if Exec Shield is enabled (in some versions)? Use
"/proc/self/maps" to get exactly the stack base. */
FILE *f;
char *buf;
f = fopen("/proc/self/maps", "r");
if (f) {
buf = malloc(256);
while (fgets(buf, 256, f)) {
int len;
len = strlen(buf);
if ((len > 8) && !strcmp("[stack]\n", buf XFORM_OK_PLUS len XFORM_OK_MINUS 8)) {
uintptr_t p = 0;
int i;
/* find separator: */
for (i = 0; buf[i]; i++) {
if (buf[i] == '-') {
i++;
break;
}
}
/* parse number after separator: */
for (; buf[i]; i++) {
if ((buf[i] >= '0') && (buf[i] <= '9')) {
p = (p << 4) | (buf[i] - '0');
} else if ((buf[i] >= 'a') && (buf[i] <= 'f')) {
p = (p << 4) | (buf[i] - 'a' + 10);
} else if ((buf[i] >= 'A') && (buf[i] <= 'F')) {
p = (p << 4) | (buf[i] - 'A' + 10);
} else
break;
}
/* printf("%p vs. %p: %d\n", (void*)bnd, (void*)p, p - bnd); */
if ((p > bnd) && ((p - lim) < bnd)) {
bnd = p;
} else {
/* bnd is too far from the expected range; on another thread? */
}
break;
}
}
free(buf);
fclose(f);
}
}
return bnd;
}
#endif
#ifdef WINDOWS_FIND_STACK_BOUNDS
intptr_t find_exe_stack_size()
{
# define WINDOWS_DEFAULT_STACK_SIZE 1048576
intptr_t sz = WINDOWS_DEFAULT_STACK_SIZE;
wchar_t *fn;
DWORD len = 1024;
/* Try to read the executable to find out the initial
stack size. */
fn = (wchar_t *)malloc(sizeof(wchar_t) * len);
if (GetModuleFileNameW(NULL, fn, len) < len) {
HANDLE fd;
fd = CreateFileW(fn,
GENERIC_READ,
FILE_SHARE_READ | FILE_SHARE_WRITE | FILE_SHARE_DELETE,
NULL,
OPEN_EXISTING,
0,
NULL);
if (fd != INVALID_HANDLE_VALUE) {
int pos;
short kind;
DWORD got;
/* Skip DOS stub */
if (SetFilePointer(fd, 0x3C, NULL, FILE_BEGIN)
!= INVALID_SET_FILE_POINTER) {
if (ReadFile(fd, &pos, sizeof(int), &got, NULL)
&& (got == sizeof(int))) {
/* Read offset to header */
if (SetFilePointer(fd, pos + 20 + 4, NULL, FILE_BEGIN)
!= INVALID_SET_FILE_POINTER) {
/* Check magic number */
if (ReadFile(fd, &kind, sizeof(short), &got, NULL)
&& (got == sizeof(short))) {
/* Two possible magic numbers: PE32 or PE32+: */
if ((kind == 0x10b) || (kind == 0x20b)) {
/* Skip to PE32[+] header's stack reservation value: */
if (SetFilePointer(fd, pos + 20 + 4 + 72, NULL, FILE_BEGIN)
!= INVALID_SET_FILE_POINTER) {
if (kind == 0x10b) {
/* PE32: 32-bit stack size: */
int ssz;
if (ReadFile(fd, &ssz, sizeof(int), &got, NULL)
&& (got == sizeof(int))) {
sz = ssz;
}
} else {
/* PE32+: 64-bit stack size: */
mzlonglong lsz;
if (ReadFile(fd, &lsz, sizeof(mzlonglong), &got, NULL)
&& (got == sizeof(mzlonglong))) {
sz = lsz;
}
}
}
}
}
}
}
}
CloseHandle(fd);
}
}
free(fn);
return sz;
}
#endif
void scheme_init_stack_check()
/* Finds the C stack limit --- platform-specific. */
{
int *v, stack_grows_up;
uintptr_t deeper;
deeper = scheme_get_deeper_address();
stack_grows_up = (deeper > (uintptr_t)&v);
#ifdef STACK_GROWS_UP
if (!stack_grows_up) {
if (scheme_console_printf)
scheme_console_printf("Stack grows DOWN, not UP.\n");
else
printf("Stack grows DOWN, not UP.\n");
exit(1);
}
#endif
#ifdef STACK_GROWS_DOWN
if (stack_grows_up) {
if (scheme_console_printf)
scheme_console_printf("Stack grows UP, not DOWN.\n");
else
printf("Stack grows UP, not DOWN.\n");
exit(1);
}
#endif
#ifdef USE_STACK_BOUNDARY_VAR
if (!scheme_stack_boundary) {
# ifdef ASSUME_FIXED_STACK_SIZE
scheme_stack_boundary = scheme_get_current_os_thread_stack_base();
if (stack_grows_up)
scheme_stack_boundary += (FIXED_STACK_SIZE - STACK_SAFETY_MARGIN);
else
scheme_stack_boundary += (STACK_SAFETY_MARGIN - FIXED_STACK_SIZE);
# endif
# ifdef WINDOWS_FIND_STACK_BOUNDS
scheme_stack_boundary = scheme_get_current_os_thread_stack_base();
{
intptr_t sz;
sz = find_exe_stack_size();
scheme_stack_boundary += (STACK_SAFETY_MARGIN - sz);
}
# endif
# ifdef MACOS_FIND_STACK_BOUNDS
scheme_stack_boundary = (uintptr_t)&v + STACK_SAFETY_MARGIN - StackSpace();
# endif
# ifdef PALMOS_FIND_STACK_BOUNDS
{
Ptr s, e;
SysGetStackInfo(Ptr &s, &e);
scheme_stack_boundary = (uintptr_t)e + STACK_SAFETY_MARGIN;
}
# endif
# ifdef UNIX_FIND_STACK_BOUNDS
{
struct rlimit rl;
uintptr_t bnd, lim;
bnd = (uintptr_t)scheme_get_current_os_thread_stack_base();
getrlimit(RLIMIT_STACK, &rl);
lim = (uintptr_t)rl.rlim_cur;
# ifdef UNIX_STACK_MAXIMUM
if (lim > UNIX_STACK_MAXIMUM)
lim = UNIX_STACK_MAXIMUM;
# endif
# ifdef LINUX_FIND_STACK_BASE
bnd = adjust_stack_base(bnd, lim);
# endif
if (stack_grows_up)
bnd += (lim - STACK_SAFETY_MARGIN);
else
bnd += (STACK_SAFETY_MARGIN - lim);
scheme_stack_boundary = bnd;
}
# endif
# ifdef PTHREAD_STACKSEG_FIND_STACK_BOUNDS
{
stack_t stack;
pthread_stackseg_np(pthread_self(), &stack);
scheme_stack_boundary = (uintptr_t)((char *)stack.ss_sp - (stack.ss_size - STACK_SAFETY_MARGIN));
}
# endif
}
#endif
#ifdef USE_STACK_BOUNDARY_VAR
scheme_jit_stack_boundary = scheme_stack_boundary;
#endif
}
int scheme_check_runstack(intptr_t size)
/* Checks whether the Scheme stack has `size' room left */
{
return ((MZ_RUNSTACK - MZ_RUNSTACK_START) >= (size + SCHEME_TAIL_COPY_THRESHOLD));
}
void *scheme_enlarge_runstack(intptr_t size, void *(*k)())
/* Adds a Scheme stack segment, of at least `size' bytes */
{
Scheme_Thread *p = scheme_current_thread;
Scheme_Saved_Stack *saved;
void *v;
int cont_count;
volatile int escape;
mz_jmp_buf newbuf, * volatile savebuf;
saved = MALLOC_ONE_RT(Scheme_Saved_Stack);
#ifdef MZTAG_REQUIRED
saved->type = scheme_rt_saved_stack;
#endif
saved->prev = p->runstack_saved;
saved->runstack_start = MZ_RUNSTACK_START;
saved->runstack_offset = (MZ_RUNSTACK - MZ_RUNSTACK_START);
saved->runstack_size = p->runstack_size;
size += SCHEME_TAIL_COPY_THRESHOLD;
if (size) {
/* If we keep growing the stack, then probably it
needs to be much larger, so at least double the
stack size, to a point: */
intptr_t min_size;
min_size = 2 * (p->runstack_size);
if (min_size > 128000)
min_size = 128000;
if (size < min_size)
size = min_size;
} else {
/* This is for a prompt. Re-use the current size,
up to a point: */
size = p->runstack_size;
if (size > 1000)
size = 1000;
}
if (p->spare_runstack && (size <= p->spare_runstack_size)) {
size = p->spare_runstack_size;
MZ_RUNSTACK_START = p->spare_runstack;
p->spare_runstack = NULL;
} else {
MZ_RUNSTACK_START = scheme_alloc_runstack(size);
}
p->runstack_size = size;
MZ_RUNSTACK = MZ_RUNSTACK_START + size;
p->runstack_saved = saved;
cont_count = scheme_cont_capture_count;
savebuf = p->error_buf;
p->error_buf = &newbuf;
if (scheme_setjmp(newbuf)) {
v = NULL;
escape = 1;
p = scheme_current_thread; /* might have changed! */
} else {
v = k();
escape = 0;
p = scheme_current_thread; /* might have changed! */
scheme_check_runstack_edge(MZ_RUNSTACK_START);
if (cont_count == scheme_cont_capture_count) {
if (!p->spare_runstack || (p->runstack_size > p->spare_runstack_size)) {
p->spare_runstack = MZ_RUNSTACK_START;
p->spare_runstack_size = p->runstack_size;
}
}
}
p->error_buf = savebuf;
saved = p->runstack_saved;
p->runstack_saved = saved->prev;
MZ_RUNSTACK_START = saved->runstack_start;
MZ_RUNSTACK = MZ_RUNSTACK_START + saved->runstack_offset;
p->runstack_size = saved->runstack_size;
if (escape) {
scheme_longjmp(*p->error_buf, 1);
}
return v;
}
/*========================================================================*/
/* continuation marks */
/*========================================================================*/
void scheme_push_continuation_frame(Scheme_Cont_Frame_Data *d)
{
d->cont_mark_pos = MZ_CONT_MARK_POS;
d->cont_mark_stack = MZ_CONT_MARK_STACK;
MZ_CONT_MARK_POS += 2;
}
void scheme_pop_continuation_frame(Scheme_Cont_Frame_Data *d)
{
MZ_CONT_MARK_POS = d->cont_mark_pos;
MZ_CONT_MARK_STACK = d->cont_mark_stack;
}
static MZ_MARK_STACK_TYPE clone_meta_cont_set_mark(Scheme_Meta_Continuation *mc, Scheme_Object *val, intptr_t findpos)
{
/* Clone the meta-continuation, in case it was captured by
a continuation in its current state. */
Scheme_Meta_Continuation *naya;
Scheme_Cont_Mark *cp;
naya = MALLOC_ONE_RT(Scheme_Meta_Continuation);
memcpy(naya, mc, sizeof(Scheme_Meta_Continuation));
cp = MALLOC_N(Scheme_Cont_Mark, naya->cont_mark_total);
memcpy(cp, mc->cont_mark_stack_copied, naya->cont_mark_total * sizeof(Scheme_Cont_Mark));
naya->cont_mark_stack_copied = cp;
naya->copy_after_captured = scheme_cont_capture_count;
mc = naya;
scheme_current_thread->meta_continuation = mc;
mc->cont_mark_stack_copied[findpos].val = val;
mc->cont_mark_stack_copied[findpos].cache = NULL;
return 0;
}
void scheme_new_mark_segment(Scheme_Thread *p)
{
int c = p->cont_mark_seg_count;
Scheme_Cont_Mark **segs, *seg;
/* Note: we perform allocations before changing p to avoid GC trouble,
since Racket adjusts a thread's cont_mark_stack_segments on GC. */
segs = MALLOC_N(Scheme_Cont_Mark *, c + 1);
seg = scheme_malloc_allow_interior(sizeof(Scheme_Cont_Mark) * SCHEME_MARK_SEGMENT_SIZE);
segs[c] = seg;
if (c)
memcpy(segs, p->cont_mark_stack_segments, c * sizeof(Scheme_Cont_Mark *));
p->cont_mark_seg_count++;
p->cont_mark_stack_segments = segs;
}
#ifdef MZ_USE_FUTURES
static void ts_scheme_new_mark_segment(Scheme_Thread *p) XFORM_SKIP_PROC
{
if (scheme_use_rtcall && !(scheme_future_thread_state)->is_runtime_thread)
scheme_rtcall_new_mark_segment(p);
else
scheme_new_mark_segment(p);
}
#else
# define ts_scheme_new_mark_segment scheme_new_mark_segment
#endif
MZ_MARK_STACK_TYPE scheme_set_cont_mark(Scheme_Object *key, Scheme_Object *val)
/* This function can be called inside a future thread */
{
Scheme_Thread *p = scheme_current_thread;
Scheme_Cont_Mark *cm = NULL;
intptr_t findpos, bottom;
findpos = (intptr_t)MZ_CONT_MARK_STACK;
bottom = (intptr_t)p->cont_mark_stack_bottom;
while (1) {
if (findpos-- > bottom) {
Scheme_Cont_Mark *seg = p->cont_mark_stack_segments[findpos >> SCHEME_LOG_MARK_SEGMENT_SIZE];
intptr_t pos = findpos & SCHEME_MARK_SEGMENT_MASK;
Scheme_Cont_Mark *find = seg + pos;
if ((intptr_t)find->pos < (intptr_t)MZ_CONT_MARK_POS) {
break;
} else {
if (find->key == key) {
cm = find;
break;
} else {
/* Assume that we'll mutate rather than allocate a new mark record. */
/* This is a bad assumption for a nasty program that repeatedly
creates a new key for the same frame, but it's good enough. */
find->cache = NULL;
}
}
} else {
if (MZ_CONT_MARK_POS == p->cont_mark_pos_bottom + 2) {
if (p->meta_continuation) {
if (key != scheme_stack_dump_key) {
/* Check the end of the meta-continuation's stack */
Scheme_Meta_Continuation *mc = p->meta_continuation;
for (findpos = (intptr_t)mc->cont_mark_total; findpos--; ) {
if (mc->cont_mark_stack_copied[findpos].pos != mc->cont_mark_pos)
break;
if (mc->cont_mark_stack_copied[findpos].key == key) {
if (mc->copy_after_captured < scheme_cont_capture_count) {
return clone_meta_cont_set_mark(mc, val, findpos);
}
mc->cont_mark_stack_copied[findpos].val = val;
mc->cont_mark_stack_copied[findpos].cache = NULL;
return 0;
} else {
mc->cont_mark_stack_copied[findpos].cache = NULL;
}
}
}
}
}
break;
}
}
if (!cm) {
/* Allocate a new mark record: */
intptr_t segpos;
intptr_t pos;
Scheme_Cont_Mark *seg;
findpos = MZ_CONT_MARK_STACK;
segpos = ((intptr_t)findpos) >> SCHEME_LOG_MARK_SEGMENT_SIZE;
pos = ((intptr_t)findpos) & SCHEME_MARK_SEGMENT_MASK;
if (segpos >= p->cont_mark_seg_count) {
#ifdef MZ_USE_FUTURES
jit_future_storage[0] = key;
jit_future_storage[1] = val;
#endif
ts_scheme_new_mark_segment(p);
p = scheme_current_thread;
#ifdef MZ_USE_FUTURES
key = jit_future_storage[0];
val = jit_future_storage[1];
jit_future_storage[0] = NULL;
jit_future_storage[1] = NULL;
#endif
}
seg = p->cont_mark_stack_segments[segpos];
cm = seg + pos;
MZ_CONT_MARK_STACK = findpos + 1;
}
cm->key = key;
cm->val = val;
cm->pos = MZ_CONT_MARK_POS; /* always odd */
cm->cache = NULL;
return findpos;
}
void scheme_temp_dec_mark_depth()
{
MZ_CONT_MARK_POS -= 2;
}
void scheme_temp_inc_mark_depth()
{
MZ_CONT_MARK_POS += 2;
}
/*========================================================================*/
/* eval-apply helpers */
/*========================================================================*/
/* discourage inlining of functions call ed scheme_do_eval() to keep its frame size smaller */
MZ_DO_NOT_INLINE(static void unbound_global(Scheme_Object *obj));
MZ_DO_NOT_INLINE(static void make_tail_buffer_safe());
MZ_DO_NOT_INLINE(static Scheme_Object **evacuate_runstack(int num_rands, Scheme_Object **rands, Scheme_Object **runstack));
MZ_DO_NOT_INLINE(static Scheme_Object *define_values_execute(Scheme_Object *data));
MZ_DO_NOT_INLINE(static Scheme_Object *set_execute (Scheme_Object *data));
MZ_DO_NOT_INLINE(static Scheme_Object *ref_execute (Scheme_Object *data));
MZ_DO_NOT_INLINE(static Scheme_Object *apply_values_execute(Scheme_Object *data));
MZ_DO_NOT_INLINE(static Scheme_Object *bangboxenv_execute(Scheme_Object *data));
MZ_DO_NOT_INLINE(static Scheme_Object *begin0_execute(Scheme_Object *obj));
/* called in schapp.h */
static Scheme_Object *do_apply_known_k(void)
{
Scheme_Thread *p = scheme_current_thread;
Scheme_Object **argv = (Scheme_Object **)p->ku.k.p2;
p->ku.k.p2 = NULL;
return _scheme_apply_known_prim_closure_multi((Scheme_Object *)p->ku.k.p1,
p->ku.k.i1,
argv);
}
#if 0
# define DEBUG_CHECK_TYPE(v) \
if ((v != SCHEME_MULTIPLE_VALUES) \
&& (v != SCHEME_TAIL_CALL_WAITING) \
&& (v != SCHEME_EVAL_WAITING) \
&& (SCHEME_TYPE(v) > (_scheme_last_type_ + 25))) \
{ Scheme_Object *o = *(Scheme_Object **)(v); \
if (SCHEME_TYPE(o) > (_scheme_last_type_ + 25))\
scheme_signal_error("bad type"); }
#else
# define DEBUG_CHECK_TYPE(v) /**/
#endif
Scheme_Object *_scheme_apply_known_prim_closure_multi(Scheme_Object *rator,
int argc,
Scheme_Object **argv)
{
#define PRIM_CHECK_ARITY 0
#define PRIM_CHECK_MULTI 0
#include "schapp.inc"
}
Scheme_Object *_scheme_apply_prim_closure_multi(Scheme_Object *rator,
int argc,
Scheme_Object **argv)
{
#define PRIM_CHECK_ARITY 1
#define PRIM_CHECK_MULTI 0
#include "schapp.inc"
}
Scheme_Object *_scheme_apply_known_prim_closure(Scheme_Object *rator,
int argc,
Scheme_Object **argv)
{
#define PRIM_CHECK_ARITY 0
#define PRIM_CHECK_MULTI 1
#include "schapp.inc"
}
Scheme_Object *_scheme_apply_prim_closure(Scheme_Object *rator,
int argc,
Scheme_Object **argv)
{
#define PRIM_CHECK_ARITY 1
#define PRIM_CHECK_MULTI 1
#include "schapp.inc"
}
#ifdef MZ_USE_JIT
# define PRIM_APPLY_NAME _scheme_apply_from_native
# define PRIM_APPLY_NAME_FAST _scheme_apply_from_native_fast
# define PRIM_CHECK_VALUE 1
# define PRIM_CHECK_MULTI 1
# include "schnapp.inc"
# define PRIM_APPLY_NAME _scheme_apply_multi_from_native
# define PRIM_APPLY_NAME_FAST _scheme_apply_multi_from_native_fast
# define PRIM_CHECK_VALUE 1
# define PRIM_CHECK_MULTI 0
# include "schnapp.inc"
# define PRIM_APPLY_NAME _scheme_tail_apply_from_native
# define PRIM_APPLY_NAME_FAST _scheme_tail_apply_from_native_fast
/* It's ok to call primitive and closed primitives directly,
since they implement further tail by trampolining. */
# define PRIM_CHECK_VALUE 0
# define PRIM_CHECK_MULTI 0
# include "schnapp.inc"
#endif
Scheme_Object *scheme_check_one_value(Scheme_Object *v)
{
if (v == SCHEME_MULTIPLE_VALUES)
scheme_wrong_return_arity(NULL, 1, scheme_multiple_count, scheme_multiple_array, NULL);
return v;
}
static Scheme_Object *do_eval_k(void)
{
Scheme_Thread *p = scheme_current_thread;
Scheme_Object *obj = (Scheme_Object *)p->ku.k.p1;
Scheme_Object **argv = (Scheme_Object **)p->ku.k.p2;
p->ku.k.p1 = NULL;
p->ku.k.p2 = NULL;
return scheme_do_eval(obj,
p->ku.k.i1,
argv,
p->ku.k.i2);
}
#ifdef MZ_USE_JIT
static Scheme_Object *do_eval_native_k(void)
{
/* If argv corresponds to old runstack, copy to new runstack
and clear old argv for space safety. */
Scheme_Thread *p = scheme_current_thread;
Scheme_Object **argv = (Scheme_Object **)p->ku.k.p2;
if (argv == (p->runstack_saved->runstack_start
+ p->runstack_saved->runstack_offset)) {
int argc = p->ku.k.i1;
MZ_RUNSTACK -= argc;
memcpy(MZ_RUNSTACK, argv, argc * sizeof(Scheme_Object*));
memset(argv, 0, argc * sizeof(Scheme_Object*));
p->ku.k.p2 = MZ_RUNSTACK;
}
return do_eval_k();
}
#endif
static void unbound_global(Scheme_Object *obj)
{
Scheme_Object *tmp;
tmp = MZ_RUNSTACK[SCHEME_TOPLEVEL_DEPTH(obj)];