/
jitcommon.c
4101 lines (3567 loc) · 123 KB
/
jitcommon.c
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
/*
Racket
Copyright (c) 2006-2016 PLT Design Inc.
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free
Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
Boston, MA 02110-1301 USA.
*/
#include "schpriv.h"
#include "schmach.h"
#include "future.h"
#ifdef MZ_USE_JIT
#include "jit.h"
struct scheme_jit_common_record scheme_jit_common;
void *scheme_on_demand_jit_code;
static void call_wrong_return_arity(int expected, int got, Scheme_Object **argv)
{
scheme_wrong_return_arity(NULL, expected, got, argv, NULL);
}
static void raise_bad_call_with_values(Scheme_Object *f)
{
Scheme_Object *a[1];
a[0] = f;
scheme_wrong_contract("call-with-values", "procedure?", -1, 1, a);
}
static Scheme_Object *call_with_values_from_multiple_result(Scheme_Object *f)
{
Scheme_Thread *p = scheme_current_thread;
if (SAME_OBJ(p->ku.multiple.array, p->values_buffer))
p->values_buffer = NULL;
return _scheme_apply(f, p->ku.multiple.count, p->ku.multiple.array);
}
static Scheme_Object *call_with_values_from_multiple_result_multi(Scheme_Object *f)
{
Scheme_Thread *p = scheme_current_thread;
if (SAME_OBJ(p->ku.multiple.array, p->values_buffer))
p->values_buffer = NULL;
return _scheme_apply_multi(f, p->ku.multiple.count, p->ku.multiple.array);
}
static Scheme_Object *tail_call_with_values_from_multiple_result(Scheme_Object *f)
{
Scheme_Thread *p = scheme_current_thread;
int num_rands = p->ku.multiple.count;
if (num_rands > p->tail_buffer_size) {
/* scheme_tail_apply will allocate */
if (SAME_OBJ(p->ku.multiple.array, p->values_buffer))
p->values_buffer = NULL;
}
return scheme_tail_apply(f, num_rands, p->ku.multiple.array);
}
static Scheme_Object *apply_checked_fail(Scheme_Object **args)
{
Scheme_Object *a[3];
a[0] = args[1];
a[1] = args[3];
a[2] = args[4];
return _scheme_apply(args[2], 3, a);
}
static void apply_prim_to_fail(int argc, Scheme_Object **argv, void *_p)
{
Scheme_Primitive_Closure_Proc *p = (Scheme_Primitive_Closure_Proc *)_p;
(void)p(argc, argv, NULL);
}
static Scheme_Object *vector_check_chaperone_of(Scheme_Object *o, Scheme_Object *orig, int setter)
{
if (!scheme_chaperone_of(o, orig))
scheme_contract_error((setter ? "vector-set!" : "vector-ref"),
"chaperone produced a result that is not a chaperone of the original result",
"chaperone result", 1, o,
"original result", 1, o,
NULL);
return o;
}
static int save_struct_temp(mz_jit_state *jitter, int reg)
{
#if defined(MZ_USE_JIT_PPC) || defined(MZ_USE_JIT_ARM)
jit_movr_p(JIT_V(3), reg);
#endif
#ifdef MZ_USE_JIT_I386
# ifdef X86_ALIGN_STACK
mz_set_local_p(reg, JIT_LOCAL3);
# else
jit_pushr_p(reg);
# endif
#endif
return 1;
}
int scheme_save_struct_temp(mz_jit_state *jitter, int reg) {
return save_struct_temp(jitter, reg);
}
static int restore_struct_temp(mz_jit_state *jitter, int reg)
{
#if defined(MZ_USE_JIT_PPC) || defined(MZ_USE_JIT_ARM)
jit_movr_p(reg, JIT_V(3));
#endif
#ifdef MZ_USE_JIT_I386
# ifdef X86_ALIGN_STACK
mz_get_local_p(reg, JIT_LOCAL3);
# else
jit_popr_p(reg);
# endif
#endif
return 1;
}
int scheme_restore_struct_temp(mz_jit_state *jitter, int reg) {
return restore_struct_temp(jitter, reg);
}
static void allocate_values(int count, Scheme_Thread *p)
{
Scheme_Object **a;
a = MALLOC_N(Scheme_Object *, count);
p->values_buffer = a;
p->values_buffer_size = count;
}
void scheme_jit_allocate_values(int count, Scheme_Thread *p)
{
allocate_values(count, p);
}
#ifdef MZ_USE_FUTURES
static void ts_allocate_values(int count, Scheme_Thread *p) XFORM_SKIP_PROC
{
if (scheme_use_rtcall) {
/* try thread-local allocation: */
Scheme_Object **a;
a = MALLOC_N(Scheme_Object *, count);
if (a) {
p->values_buffer = a;
p->values_buffer_size = count;
} else
scheme_rtcall_allocate_values(count, p);
} else
allocate_values(count, p);
}
#else
# define ts_allocate_values allocate_values
#endif
static void chaperone_set_mark()
/* arguments are on runstack; result goes there, too */
{
Scheme_Object *v;
v = scheme_chaperone_do_continuation_mark("with-continuation-mark", 0, MZ_RUNSTACK[1], MZ_RUNSTACK[0]);
MZ_RUNSTACK[0] = v;
MZ_RUNSTACK[1] = SCHEME_CHAPERONE_VAL(MZ_RUNSTACK[1]);
}
#define JITCOMMON_TS_PROCS
#include "jit_ts.c"
#ifdef MZ_USE_FUTURES
static Scheme_Object **ts_scheme_on_demand(Scheme_Object **rs) XFORM_SKIP_PROC
{
if (scheme_use_rtcall) {
return scheme_rtcall_on_demand(rs);
} else
return scheme_on_demand(rs);
}
#endif
/* ************************************************************ */
static int common0(mz_jit_state *jitter, void *_data)
{
int in;
GC_CAN_IGNORE jit_insn *ref;
GC_CAN_IGNORE jit_insn *ref2 USED_ONLY_FOR_FUTURES;
/* *** check_arity_code *** */
/* Called as a function: */
sjc.check_arity_code = (Native_Check_Arity_Proc)jit_get_ip();
jit_prolog(NATIVE_ARG_COUNT); /* only need 2 arguments, but return path overlaps with proc conventions */
mz_push_threadlocal_early();
in = jit_arg_p();
jit_getarg_p(JIT_R0, in); /* closure */
in = jit_arg_p();
jit_getarg_i(JIT_R2, in); /* argc */
in = jit_arg_p();
jit_getarg_i(JIT_R1, in); /* ignored */
mz_push_locals();
mz_push_threadlocal(in);
jit_movi_i(JIT_R1, -1);
jit_ldxi_p(JIT_V1, JIT_R0, &((Scheme_Native_Closure *)0x0)->code);
jit_ldxi_p(JIT_V1, JIT_V1, &((Scheme_Native_Closure_Data *)0x0)->arity_code);
jit_jmpr(JIT_V1); /* leads to a jit_ret() that assumes NATIVE_ARG_COUNT arguments */
CHECK_LIMIT();
/* *** get_arity_code *** */
/* Called as a function: */
sjc.get_arity_code = (Native_Get_Arity_Proc)jit_get_ip();
jit_prolog(NATIVE_ARG_COUNT); /* only need 1 argument, but return path overlaps with proc conventions */
mz_push_threadlocal_early();
in = jit_arg_p();
jit_getarg_p(JIT_R0, in); /* closure */
in = jit_arg_p();
jit_getarg_p(JIT_R1, in); /* ignored */
in = jit_arg_p();
jit_getarg_i(JIT_R1, in); /* ignored */
mz_push_locals();
mz_push_threadlocal(in);
jit_movi_i(JIT_R1, -1);
(void)jit_movi_p(JIT_R2, 0x0);
jit_ldxi_p(JIT_V1, JIT_R0, &((Scheme_Native_Closure *)0x0)->code);
jit_ldxi_p(JIT_V1, JIT_V1, &((Scheme_Native_Closure_Data *)0x0)->arity_code);
jit_jmpr(JIT_V1); /* leads to a jit_ret() that assumes NATIVE_ARG_COUNT arguments */
CHECK_LIMIT();
/* *** bad_result_arity_code *** */
/* Jumped-to from non-tail contexts */
sjc.bad_result_arity_code = (Native_Get_Arity_Proc)jit_get_ip();
mz_tl_ldi_p(JIT_R2, tl_scheme_current_thread);
jit_ldxi_l(JIT_R1, JIT_R2, &((Scheme_Thread *)0x0)->ku.multiple.count);
jit_ldxi_p(JIT_R2, JIT_R2, &((Scheme_Thread *)0x0)->ku.multiple.array);
CHECK_LIMIT();
mz_prepare(3);
jit_pusharg_p(JIT_R2);
jit_pusharg_i(JIT_R1);
CHECK_LIMIT();
jit_movi_i(JIT_V1, 1);
jit_pusharg_i(JIT_V1);
(void)mz_finish_lwe(ts_call_wrong_return_arity, ref);
CHECK_LIMIT();
/* *** unbound_global_code *** */
sjc.unbound_global_code = jit_get_ip();
JIT_UPDATE_THREAD_RSPTR();
mz_prepare(1);
jit_pusharg_p(JIT_R2);
(void)mz_finish_lwe(ts_scheme_unbound_global, ref);
CHECK_LIMIT();
/* *** quote_syntax_code *** */
/* R0 is WORDS_TO_BYTES(c), R1 is &0->a[i+p+1], R2 is &0->a[p] */
sjc.quote_syntax_code = jit_get_ip();
mz_prolog(JIT_V1);
__START_SHORT_JUMPS__(1);
/* Load global array: */
jit_ldxr_p(JIT_V1, JIT_RUNSTACK, JIT_R0);
#ifdef JIT_PRECISE_GC
/* Save global-array index before we lose it: */
mz_set_local_p(JIT_R0, JIT_LOCAL3);
#endif
/* Load syntax object: */
jit_ldxr_p(JIT_R0, JIT_V1, JIT_R1);
/* Is it null? */
ref = jit_bnei_p(jit_forward(), JIT_R0, 0x0);
CHECK_LIMIT();
/* Syntax object is NULL, so we need to create it. */
jit_ldxr_p(JIT_R0, JIT_V1, JIT_R2); /* put element at p in R0 */
#ifndef JIT_PRECISE_GC
/* Save global array: */
mz_set_local_p(JIT_V1, JIT_LOCAL3);
#endif
/* Move R1 to V1 to save it: */
jit_movr_p(JIT_V1, JIT_R1);
/* Compute i in JIT_R1: */
jit_subr_p(JIT_R1, JIT_R1, JIT_R2);
jit_subi_p(JIT_R1, JIT_R1, WORDS_TO_BYTES(1));
jit_rshi_ul(JIT_R1, JIT_R1, JIT_LOG_WORD_SIZE);
CHECK_LIMIT();
/* Call scheme_delayed_shift: */
JIT_UPDATE_THREAD_RSPTR();
CHECK_LIMIT();
mz_prepare(2);
jit_pusharg_l(JIT_R1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_delayed_shift, ref2);
CHECK_LIMIT();
jit_retval(JIT_R0);
/* Restore global array into JIT_R1, and put computed element at i+p+1: */
#ifdef JIT_PRECISE_GC
mz_get_local_p(JIT_R1, JIT_LOCAL3);
jit_ldxr_p(JIT_R1, JIT_RUNSTACK, JIT_R1);
#else
mz_get_local_p(JIT_R1, JIT_LOCAL3);
#endif
jit_stxr_p(JIT_V1, JIT_R1, JIT_R0);
mz_patch_branch(ref);
__END_SHORT_JUMPS__(1);
mz_epilog(JIT_V1);
return 1;
}
static int common1(mz_jit_state *jitter, void *_data)
{
int i;
GC_CAN_IGNORE jit_insn *ref USED_ONLY_FOR_FUTURES;
/* *** [bad_][m]{car,cdr,...,{imag,real}_part}_code *** */
/* Argument is in R2 for cXX+r, R0 otherwise */
for (i = 0; i < 13; i++) {
void *code;
code = jit_get_ip();
switch (i) {
case 0:
sjc.bad_car_code = code;
break;
case 1:
sjc.bad_cdr_code = code;
break;
case 2:
sjc.bad_caar_code = code;
break;
case 3:
sjc.bad_cadr_code = code;
break;
case 4:
sjc.bad_cdar_code = code;
break;
case 5:
sjc.bad_cddr_code = code;
break;
case 6:
sjc.bad_mcar_code = code;
break;
case 7:
sjc.bad_mcdr_code = code;
break;
case 8:
sjc.real_part_code = code;
break;
case 9:
sjc.imag_part_code = code;
break;
case 10:
sjc.bad_flreal_part_code = code;
break;
case 11:
sjc.bad_flimag_part_code = code;
break;
case 12:
sjc.bad_cXr_code = code;
break;
}
mz_prolog(JIT_R1);
jit_subi_p(JIT_RUNSTACK, JIT_RUNSTACK, WORDS_TO_BYTES(1));
CHECK_RUNSTACK_OVERFLOW();
if ((i != 12) && ((i < 2) || (i > 5))) {
jit_str_p(JIT_RUNSTACK, JIT_R0);
} else {
jit_str_p(JIT_RUNSTACK, JIT_R2);
}
JIT_UPDATE_THREAD_RSPTR();
CHECK_LIMIT();
jit_movi_i(JIT_R1, 1);
if (i == 12) {
jit_prepare(3);
jit_pusharg_p(JIT_R0);
} else {
jit_prepare(2);
}
jit_pusharg_p(JIT_RUNSTACK);
jit_pusharg_i(JIT_R1);
switch (i) {
case 0:
(void)mz_finish_lwe(ts_scheme_checked_car, ref);
break;
case 1:
(void)mz_finish_lwe(ts_scheme_checked_cdr, ref);
break;
case 2:
(void)mz_finish_lwe(ts_scheme_checked_caar, ref);
break;
case 3:
(void)mz_finish_lwe(ts_scheme_checked_cadr, ref);
break;
case 4:
(void)mz_finish_lwe(ts_scheme_checked_cdar, ref);
break;
case 5:
(void)mz_finish_lwe(ts_scheme_checked_cddr, ref);
break;
case 6:
(void)mz_finish_lwe(ts_scheme_checked_mcar, ref);
break;
case 7:
(void)mz_finish_lwe(ts_scheme_checked_mcdr, ref);
break;
case 8:
(void)mz_finish_lwe(ts_scheme_checked_real_part, ref);
break;
case 9:
(void)mz_finish_lwe(ts_scheme_checked_imag_part, ref);
break;
case 10:
(void)mz_finish_lwe(ts_scheme_checked_flreal_part, ref);
break;
case 11:
(void)mz_finish_lwe(ts_scheme_checked_flimag_part, ref);
break;
case 12:
(void)mz_finish_lwe(ts_apply_prim_to_fail, ref);
break;
}
CHECK_LIMIT();
switch (i) {
case 8:
case 9:
jit_addi_p(JIT_RUNSTACK, JIT_RUNSTACK, WORDS_TO_BYTES(1));
JIT_UPDATE_THREAD_RSPTR();
jit_retval(JIT_R0);
mz_epilog(JIT_R1);
break;
default:
/* never returns */
break;
}
scheme_jit_register_sub_func(jitter, code, scheme_false);
}
return 1;
}
static int common1b(mz_jit_state *jitter, void *_data)
{
int i;
GC_CAN_IGNORE jit_insn *ref, *ref2;
/* *** bad_set_{car,cdr}_code and make_[fl]rectangular_code *** */
/* Bad argument is in R0, other is in R1 */
for (i = 0; i < 4; i++) {
void *code;
code = jit_get_ip();
switch (i) {
case 0:
sjc.bad_set_mcar_code = code;
break;
case 1:
sjc.bad_set_mcdr_code = code;
break;
case 2:
sjc.make_rectangular_code = code;
break;
case 3:
sjc.bad_make_flrectangular_code = code;
break;
}
mz_prolog(JIT_R2);
jit_subi_p(JIT_RUNSTACK, JIT_RUNSTACK, WORDS_TO_BYTES(2));
CHECK_RUNSTACK_OVERFLOW();
jit_str_p(JIT_RUNSTACK, JIT_R0);
jit_stxi_p(WORDS_TO_BYTES(1), JIT_RUNSTACK, JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
CHECK_LIMIT();
jit_movi_i(JIT_R1, 2);
jit_prepare(2);
jit_pusharg_p(JIT_RUNSTACK);
jit_pusharg_i(JIT_R1);
switch (i) {
case 0:
(void)mz_finish_lwe(ts_scheme_checked_set_mcar, ref);
break;
case 1:
(void)mz_finish_lwe(ts_scheme_checked_set_mcdr, ref);
break;
case 2:
(void)mz_finish_lwe(ts_scheme_checked_make_rectangular, ref);
jit_retval(JIT_R0);
jit_addi_p(JIT_RUNSTACK, JIT_RUNSTACK, WORDS_TO_BYTES(2));
mz_epilog(JIT_R2);
break;
case 3:
(void)mz_finish_lwe(ts_scheme_checked_make_flrectangular, ref);
break;
}
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, code, scheme_false);
}
/* *** unbox_code *** */
/* R0 is argument */
sjc.unbox_code = jit_get_ip();
mz_prolog(JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
jit_prepare(1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_unbox, ref);
CHECK_LIMIT();
jit_retval(JIT_R0); /* returns if proxied */
mz_epilog(JIT_R1);
scheme_jit_register_sub_func(jitter, sjc.unbox_code, scheme_false);
/* *** set_box_code *** */
/* R0 is box, R1 is value */
sjc.set_box_code = jit_get_ip();
mz_prolog(JIT_R2);
JIT_UPDATE_THREAD_RSPTR();
jit_prepare(2);
jit_pusharg_p(JIT_R1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_set_box, ref);
CHECK_LIMIT();
/* returns if proxied */
mz_epilog(JIT_R2);
scheme_jit_register_sub_func(jitter, sjc.set_box_code, scheme_false);
/* *** box_cas_fail_code *** */
/* Arguments are on runstack; */
/* call scheme_box_cas to raise the exception,
we use mz_finish_lwe because it will capture the stack,
and the ts_ version because we may be in a future */
sjc.box_cas_fail_code = jit_get_ip();
mz_prolog(JIT_R2);
JIT_UPDATE_THREAD_RSPTR();
jit_movi_l(JIT_R0, 3);
mz_prepare(2);
jit_pusharg_p(JIT_RUNSTACK);
jit_pusharg_l(JIT_R0);
CHECK_LIMIT();
(void)mz_finish_lwe(ts_scheme_box_cas, ref); /* doesn't return */
scheme_jit_register_sub_func(jitter, sjc.box_cas_fail_code, scheme_false);
/* *** bad_vector_length_code *** */
/* R0 is argument */
sjc.bad_vector_length_code = jit_get_ip();
mz_prolog(JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
/* Check for chaperone: */
ref2 = jit_bmsi_ul(jit_forward(), JIT_R0, 0x1);
ref = mz_bnei_t(jit_forward(), JIT_R0, scheme_chaperone_type, JIT_R1);
jit_ldxi_p(JIT_R0, JIT_R0, (intptr_t)&((Scheme_Chaperone *)0x0)->val);
mz_epilog(JIT_R1); /* return after unwrapping */
CHECK_LIMIT();
mz_patch_branch(ref);
mz_patch_branch(ref2);
jit_prepare(1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_vector_length, ref);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, sjc.bad_vector_length_code, scheme_false);
/* *** bad_flvector_length_code *** */
/* R0 is argument */
sjc.bad_flvector_length_code = jit_get_ip();
mz_prolog(JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
jit_prepare(1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_flvector_length, ref);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, sjc.bad_flvector_length_code, scheme_false);
#ifdef MZ_LONG_DOUBLE
/* *** bad_extflvector_length_code *** */
/* R0 is argument */
sjc.bad_extflvector_length_code = jit_get_ip();
mz_prolog(JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
jit_prepare(1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_extflvector_length, ref);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, sjc.bad_extflvector_length_code, scheme_false);
#endif
/* *** bad_fxvector_length_code *** */
/* R0 is argument */
sjc.bad_fxvector_length_code = jit_get_ip();
mz_prolog(JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
jit_prepare(1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_fxvector_length, ref);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, sjc.bad_fxvector_length_code, scheme_false);
/* *** bad_string_length_code *** */
/* R0 is argument */
sjc.bad_string_length_code = jit_get_ip();
mz_prolog(JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
jit_prepare(1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_string_length, ref);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, sjc.bad_string_length_code, scheme_false);
/* *** bad_bytes_length_code *** */
/* R0 is argument */
sjc.bad_bytes_length_code = jit_get_ip();
mz_prolog(JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
jit_prepare(1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_byte_string_length, ref);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, sjc.bad_bytes_length_code, scheme_false);
/* *** bad_string_eq_2_code *** */
/* R0 and R1 are arguments */
sjc.bad_string_eq_2_code = jit_get_ip();
mz_prolog(JIT_R2);
JIT_UPDATE_THREAD_RSPTR();
jit_prepare(2);
jit_pusharg_p(JIT_R1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_string_eq_2, ref);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, sjc.bad_string_eq_2_code, scheme_false);
/* *** bad_bytes_eq_2_code *** */
/* R0 and R1 are arguments */
sjc.bad_bytes_eq_2_code = jit_get_ip();
mz_prolog(JIT_R2);
JIT_UPDATE_THREAD_RSPTR();
jit_prepare(2);
jit_pusharg_p(JIT_R1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_scheme_byte_string_eq_2, ref);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, sjc.bad_bytes_eq_2_code, scheme_false);
return 1;
}
static int common2(mz_jit_state *jitter, void *_data)
{
int in, i;
GC_CAN_IGNORE jit_insn *ref, *ref2;
/* *** call_original_unary_arith_code *** */
/* R0 is arg, R2 is code pointer;
if for branch, V1 is return address for false,
LOCAL2 is target address for true */
for (i = 0; i < 3; i++) {
int argc, j;
void *code;
for (j = 0; j < 2; j++) {
CHECK_LIMIT();
code = jit_get_ip();
if (!i) {
if (!j)
sjc.call_original_unary_arith_code = code;
else
sjc.call_original_unary_arith_for_branch_code = code;
argc = 1;
} else if (i == 1) {
if (!j)
sjc.call_original_binary_arith_code = code;
else
sjc.call_original_binary_arith_for_branch_code = code;
argc = 2;
} else {
if (!j)
sjc.call_original_binary_rev_arith_code = code;
else
sjc.call_original_binary_rev_arith_for_branch_code = code;
argc = 2;
}
if (!j) {
mz_prolog(JIT_V1);
}
jit_subi_p(JIT_RUNSTACK, JIT_RUNSTACK, WORDS_TO_BYTES(argc));
CHECK_RUNSTACK_OVERFLOW();
if (i == 2) {
jit_str_p(JIT_RUNSTACK, JIT_R0);
jit_stxi_p(WORDS_TO_BYTES(1), JIT_RUNSTACK, JIT_R1);
} else if (i == 1) {
jit_str_p(JIT_RUNSTACK, JIT_R1);
jit_stxi_p(WORDS_TO_BYTES(1), JIT_RUNSTACK, JIT_R0);
} else {
jit_str_p(JIT_RUNSTACK, JIT_R0);
}
jit_movi_i(JIT_R1, argc);
JIT_UPDATE_THREAD_RSPTR();
mz_prepare_direct_prim(2);
{
/* May use JIT_R0 and create local branch: */
mz_generate_direct_prim(jit_pusharg_p(JIT_RUNSTACK),
jit_pusharg_i(JIT_R1),
JIT_R2, scheme_noncm_prim_indirect);
}
CHECK_LIMIT();
jit_retval(JIT_R0);
VALIDATE_RESULT(JIT_R0);
jit_addi_p(JIT_RUNSTACK, JIT_RUNSTACK, WORDS_TO_BYTES(argc));
JIT_UPDATE_THREAD_RSPTR();
if (!j) {
mz_epilog(JIT_V1);
} else {
/* In for_branch mode, V1 is target for false, LOCAL2 is target for true */
mz_get_local_p(JIT_R1, JIT_LOCAL2);
__START_TINY_JUMPS__(1);
ref = jit_beqi_p(jit_forward(), JIT_R0, scheme_true);
jit_jmpr(JIT_V1);
mz_patch_branch(ref);
jit_jmpr(JIT_R1);
__END_TINY_JUMPS__(1);
}
CHECK_LIMIT();
if (!j)
scheme_jit_register_sub_func(jitter, code, scheme_false);
else
scheme_jit_register_sub_func(jitter, code, scheme_void);
}
}
/* *** call_original_nary_arith_code *** */
/* rator is in V1, count is in R1, args are on runstack */
{
void *code;
code = jit_get_ip();
sjc.call_original_nary_arith_code = code;
mz_prolog(JIT_R2);
JIT_UPDATE_THREAD_RSPTR();
mz_prepare_direct_prim(2);
{
/* May use JIT_R0 and create local branch: */
mz_generate_direct_prim(jit_pusharg_p(JIT_RUNSTACK),
jit_pusharg_i(JIT_R1),
JIT_V1, scheme_noncm_prim_indirect);
}
CHECK_LIMIT();
jit_retval(JIT_R0);
VALIDATE_RESULT(JIT_R0);
mz_epilog(JIT_R2);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, code, scheme_false);
}
/* *** on_demand_jit_[arity_]code *** */
/* Used as the code stub for a closure whose
code is not yet compiled. See generate_function_prolog
for the state of registers on entry */
scheme_on_demand_jit_code = jit_get_ip();
jit_prolog(NATIVE_ARG_COUNT);
mz_push_threadlocal_early();
in = jit_arg_p();
jit_getarg_p(JIT_R0, in); /* closure */
in = jit_arg_i();
jit_getarg_i(JIT_R1, in); /* argc */
in = jit_arg_p();
jit_getarg_p(JIT_R2, in); /* argv */
CHECK_LIMIT();
mz_push_locals();
mz_push_threadlocal(in);
mz_tl_ldi_p(JIT_RUNSTACK, tl_MZ_RUNSTACK);
sjc.on_demand_jit_arity_code = jit_get_ip(); /* <<<- arity variant starts here */
jit_subi_p(JIT_RUNSTACK, JIT_RUNSTACK, WORDS_TO_BYTES(2));
CHECK_RUNSTACK_OVERFLOW();
jit_str_p(JIT_RUNSTACK, JIT_R0);
jit_fixnum_l(JIT_R1, JIT_R1);
CHECK_LIMIT();
jit_stxi_p(WORDS_TO_BYTES(1), JIT_RUNSTACK, JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
mz_prepare(1);
jit_pusharg_p(JIT_R2); /* argv is threaded through as an argument (for lwc handling) */
(void)mz_finish_lwe(ts_scheme_on_demand, ref);
CHECK_LIMIT();
/* Restore registers and runstack, and jump to arity checking
of newly-created code when argv == runstack (i.e., a tail call): */
jit_retval(JIT_R2);
jit_ldr_p(JIT_R0, JIT_RUNSTACK);
jit_ldxi_p(JIT_R1, JIT_RUNSTACK, WORDS_TO_BYTES(1));
jit_rshi_ul(JIT_R1, JIT_R1, 0x1);
jit_addi_p(JIT_RUNSTACK, JIT_RUNSTACK, WORDS_TO_BYTES(2));
CHECK_LIMIT();
ref = jit_bner_p(jit_forward(), JIT_RUNSTACK, JIT_R2);
/* Also, check that the runstack is big enough with the revised
max_let_depth. */
jit_ldxi_p(JIT_V1, JIT_R0, &((Scheme_Native_Closure *)0x0)->code);
jit_ldxi_i(JIT_V1, JIT_V1, &((Scheme_Native_Closure_Data *)0x0)->max_let_depth);
mz_set_local_p(JIT_R2, JIT_LOCAL2);
mz_tl_ldi_p(JIT_R2, tl_MZ_RUNSTACK_START);
jit_subr_ul(JIT_R2, JIT_RUNSTACK, JIT_R2);
jit_subr_ul(JIT_V1, JIT_R2, JIT_V1);
mz_get_local_p(JIT_R2, JIT_LOCAL2);
ref2 = jit_blti_l(jit_forward(), JIT_V1, 0);
CHECK_LIMIT();
/* This is the tail-call fast path: */
/* Set runstack base to end of arguments on runstack: */
jit_movr_p(JIT_RUNSTACK_BASE_OR_ALT(JIT_V1), JIT_R1);
jit_lshi_ul(JIT_RUNSTACK_BASE_OR_ALT(JIT_V1), JIT_RUNSTACK_BASE_OR_ALT(JIT_V1), JIT_LOG_WORD_SIZE);
jit_addr_p(JIT_RUNSTACK_BASE_OR_ALT(JIT_V1), JIT_RUNSTACK_BASE_OR_ALT(JIT_V1), JIT_RUNSTACK);
mz_st_runstack_base_alt(JIT_V1);
/* Extract function and jump: */
jit_ldxi_p(JIT_V1, JIT_R0, &((Scheme_Native_Closure *)0x0)->code);
jit_ldxi_p(JIT_V1, JIT_V1, &((Scheme_Native_Closure_Data *)0x0)->arity_code);
jit_jmpr(JIT_V1);
CHECK_LIMIT();
/* Slower path (non-tail) when argv != runstack. */
mz_patch_branch(ref);
mz_patch_branch(ref2);
CHECK_LIMIT();
JIT_UPDATE_THREAD_RSPTR();
mz_prepare(3);
jit_pusharg_p(JIT_R2);
jit_pusharg_i(JIT_R1);
jit_pusharg_p(JIT_R0);
scheme_generate_finish_multi_apply(jitter);
CHECK_LIMIT();
mz_pop_threadlocal();
mz_pop_locals();
jit_ret();
CHECK_LIMIT();
scheme_jit_register_helper_func(jitter, scheme_on_demand_jit_code, 0);
/* Used for the state of a function that is being JITted
(for a kind of cycle detection) without breaking concurrent
future threads that might try to call the function. */
sjc.in_progress_on_demand_jit_arity_code = jit_get_ip();
(void)jit_jmpi(sjc.on_demand_jit_arity_code);
/* *** app_values_tail_slow_code *** */
/* RELIES ON jit_prolog(NATIVE_ARG_COUNT) FROM ABOVE */
/* Rator in V1, arguments are in thread's multiple-values cells. */
sjc.app_values_tail_slow_code = jit_get_ip();
JIT_UPDATE_THREAD_RSPTR();
mz_prepare(1);
jit_pusharg_p(JIT_V1);
(void)mz_finish_lwe(ts_tail_call_with_values_from_multiple_result, ref);
jit_retval(JIT_R0);
VALIDATE_RESULT(JIT_R0);
/* Return: */
mz_pop_threadlocal();
mz_pop_locals();
jit_ret();
CHECK_LIMIT();
/* *** finish_tail_call_[fixup_]code *** */
/* RELIES ON jit_prolog(NATIVE_ARG_COUNT) FROM ABOVE */
sjc.finish_tail_call_code = jit_get_ip();
scheme_generate_finish_tail_call(jitter, 0);
CHECK_LIMIT();
scheme_jit_register_helper_func(jitter, sjc.finish_tail_call_code, 0);
sjc.finish_tail_call_fixup_code = jit_get_ip();
scheme_generate_finish_tail_call(jitter, 2);
CHECK_LIMIT();
scheme_jit_register_helper_func(jitter, sjc.finish_tail_call_fixup_code, 0);
/* *** get_stack_pointer_code *** */
sjc.get_stack_pointer_code = jit_get_ip();
jit_leaf(0);
jit_movr_p(JIT_R0, JIT_FP);
/* Get frame pointer of caller... */
#ifdef MZ_USE_JIT_PPC
jit_ldr_p(JIT_R0, JIT_R0);
#endif
#ifdef MZ_USE_JIT_I386
jit_ldr_p(JIT_R0, JIT_R0);
#endif
#ifdef MZ_USE_JIT_ARM
jit_ldxi_p(JIT_R0, JIT_R0, JIT_NEXT_FP_OFFSET);
#endif
jit_movr_p(JIT_RET, JIT_R0);
jit_ret();
CHECK_LIMIT();
/* *** stack_cache_pop_code *** */
/* DANGER: this code must save and restore (or avoid)
any registers that a function call would normally save
and restore. JIT_AUX, which is used by things like jit_ldi,
is such a register for PPC. */
sjc.stack_cache_pop_code = jit_get_ip();
jit_movr_p(JIT_R0, JIT_RET);
#ifdef MZ_USE_JIT_PPC
jit_subi_p(JIT_SP, JIT_SP, 48); /* includes space maybe used by callee */
jit_stxi_p(44, JIT_SP, JIT_AUX);
#endif
/* Decrement stack_cache_stack_pos (using a function,
in case of thread-local vars) and get record pointer.
Use jit_normal_finish(), because jit_finish() shuffles
callee-saved registers to match the mz protocol
(on x86_64). */
mz_prepare(1);
jit_normal_pushonlyarg_p(JIT_R0);
(void)jit_normal_finish(scheme_decrement_cache_stack_pos);
jit_retval(JIT_R1); /* = pointer to a stack_cache_stack element */
CHECK_LIMIT();
/* Extract old return address and jump to it */
jit_ldxi_l(JIT_R0, JIT_R1, &((Stack_Cache_Elem *)0x0)->orig_result);
(void)jit_movi_p(JIT_R2, NULL);
jit_stxi_l(&((Stack_Cache_Elem *)0x0)->orig_result, JIT_R1, JIT_R2);
jit_ldxi_l(JIT_R2, JIT_R1, &((Stack_Cache_Elem *)0x0)->orig_return_address);
jit_movr_p(JIT_RET, JIT_R0);
#ifdef MZ_USE_JIT_PPC
jit_ldxi_p(JIT_AUX, JIT_SP, 44);
jit_addi_p(JIT_SP, JIT_SP, 48);
#endif
jit_jmpr(JIT_R2);
CHECK_LIMIT();
scheme_jit_register_sub_func(jitter, sjc.stack_cache_pop_code, scheme_false);
/* *** bad_app_vals_target *** */
/* Non-proc is in R0 */
sjc.bad_app_vals_target = jit_get_ip();
JIT_UPDATE_THREAD_RSPTR();
mz_prepare(1);
jit_pusharg_p(JIT_R0);
(void)mz_finish_lwe(ts_raise_bad_call_with_values, ref);
/* Doesn't return */
CHECK_LIMIT();
/* *** app_values[_multi]_slow_code *** */
/* Rator in V1, arguments are in thread's multiple-values cells. */
for (i = 0; i < 2; i++) {
if (i)
sjc.app_values_multi_slow_code = jit_get_ip();
else
sjc.app_values_slow_code = jit_get_ip();
mz_prolog(JIT_R1);
JIT_UPDATE_THREAD_RSPTR();
mz_prepare(1);
jit_pusharg_p(JIT_V1);
if (i) {
(void)mz_finish_lwe(ts_call_with_values_from_multiple_result_multi, ref);
} else {
(void)mz_finish_lwe(ts_call_with_values_from_multiple_result, ref);
}
jit_retval(JIT_R0);
VALIDATE_RESULT(JIT_R0);
mz_epilog(JIT_R1);
CHECK_LIMIT();
}
/*** values_code ***/
/* Arguments on runstack, V1 has count */
{
GC_CAN_IGNORE jit_insn *refslow, *ref1, *refloop;
GC_CAN_IGNORE jit_insn *ref2 USED_ONLY_FOR_FUTURES;
sjc.values_code = jit_get_ip();
mz_prolog(JIT_R1);
mz_tl_ldi_p(JIT_R2, tl_scheme_current_thread);
jit_ldxi_p(JIT_R1, JIT_R2, &((Scheme_Thread *)0x0)->values_buffer);
ref1 = jit_bnei_p(jit_forward(), JIT_R1, NULL);
CHECK_LIMIT();
/* Allocate new array: */
refslow = jit_get_ip();
JIT_UPDATE_THREAD_RSPTR();
mz_prepare(2);
jit_pusharg_p(JIT_R2);
jit_pusharg_i(JIT_V1);
(void)mz_finish_lwe(ts_allocate_values, ref2);
CHECK_LIMIT();
/* Try again... */
mz_tl_ldi_p(JIT_R2, tl_scheme_current_thread);
jit_ldxi_p(JIT_R1, JIT_R2, &((Scheme_Thread *)0x0)->values_buffer);
/* Buffer is non-NULL... big enough? */
mz_patch_branch(ref1);
jit_ldxi_i(JIT_R0, JIT_R2, &((Scheme_Thread *)0x0)->values_buffer_size);
(void)jit_bltr_i(refslow, JIT_R0, JIT_V1);
/* Buffer is ready */
jit_stxi_p(&((Scheme_Thread *)0x0)->ku.multiple.array, JIT_R2, JIT_R1);
jit_stxi_i(&((Scheme_Thread *)0x0)->ku.multiple.count, JIT_R2, JIT_V1);
CHECK_LIMIT();
/* Copy values over: */