forked from JuliaLang/julia
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtask.c
942 lines (857 loc) · 26.7 KB
/
task.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
/*
task.c
lightweight processes (symmetric coroutines)
*/
#include "platform.h"
#include <stdlib.h>
#include <string.h>
#include <assert.h>
//#include <sys/mman.h>
#include <signal.h>
#include <errno.h>
#include "julia.h"
#include "julia_internal.h"
#if defined(_OS_WINDOWS_)
#include <winbase.h>
#include <malloc.h>
#include <dbghelp.h>
static volatile int in_stackwalk = 0;
#else
#include <unistd.h>
// This gives unwind only local unwinding options ==> faster code
#define UNW_LOCAL_ONLY
#include <libunwind.h>
#include <dlfcn.h> // for dladdr
#endif
/* This probing code is derived from Douglas Jones' user thread library */
/* true if stack grows up, false if down */
static int _stack_grows_up;
/* the offset of the beginning of the stack frame in a function */
static size_t _frame_offset;
struct _probe_data {
intptr_t low_bound; /* below probe on stack */
intptr_t probe_local; /* local to probe on stack */
intptr_t high_bound; /* above probe on stack */
intptr_t prior_local; /* value of probe_local from earlier call */
jl_jmp_buf probe_env; /* saved environment of probe */
jl_jmp_buf probe_sameAR; /* second environment saved by same call */
jl_jmp_buf probe_samePC; /* environment saved on previous call */
jl_jmp_buf * ref_probe; /* switches between probes */
};
static void boundhigh(struct _probe_data *p)
{
int c;
p->high_bound = (intptr_t)&c;
}
static void probe(struct _probe_data *p)
{
p->prior_local = p->probe_local;
p->probe_local = (intptr_t)&p;
jl_setjmp( *(p->ref_probe), 0 );
p->ref_probe = &p->probe_env;
jl_setjmp( p->probe_sameAR, 0 );
boundhigh(p);
}
static void boundlow(struct _probe_data *p)
{
p->low_bound = (intptr_t)&p;
probe(p);
}
// we need this function to exist so we can measure its stack frame!
#if defined(_OS_WINDOWS_) && !defined(_COMPILER_MINGW_)
static void __declspec(noinline) fill(struct _probe_data *p);
#else
static void fill(struct _probe_data *p) __attribute__ ((noinline));
#endif
static void fill(struct _probe_data *p)
{
boundlow(p);
}
static void _infer_direction_from(int *first_addr)
{
int second;
_stack_grows_up = (first_addr < &second);
}
static void _infer_stack_direction(void)
{
int first;
_infer_direction_from(&first);
}
static int mangle_pointers;
extern char *jl_stack_lo;
extern char *jl_stack_hi;
static void _probe_arch(void)
{
struct _probe_data p;
memset(p.probe_env, 0, sizeof(jl_jmp_buf));
memset(p.probe_sameAR, 0, sizeof(jl_jmp_buf));
memset(p.probe_samePC, 0, sizeof(jl_jmp_buf));
p.ref_probe = &p.probe_samePC;
_infer_stack_direction();
/* do a probe with filler on stack */
fill(&p);
/* do a probe without filler */
boundlow(&p);
#if defined(__linux__) && defined(__i386__)
char **s = (char**)p.ref_probe;
mangle_pointers = !(s[4] > jl_stack_lo &&
s[4] < jl_stack_hi);
#elif defined(__linux__) && defined(__x86_64__)
char **s = (char**)p.ref_probe;
mangle_pointers = !(s[6] > jl_stack_lo &&
s[6] < jl_stack_hi);
#else
mangle_pointers = 0;
#endif
intptr_t prior_diff = p.probe_local - p.prior_local;
_frame_offset = labs(prior_diff);
}
/* end probing code */
/*
TODO:
- per-task storage (scheme-like parameters)
- stack growth
*/
extern size_t jl_page_size;
jl_datatype_t *jl_task_type;
DLLEXPORT jl_task_t * volatile jl_current_task;
jl_task_t *jl_root_task;
jl_value_t * volatile jl_task_arg_in_transit;
static volatile int n_args_in_transit;
jl_value_t *jl_exception_in_transit;
#ifdef JL_GC_MARKSWEEP
jl_gcframe_t *jl_pgcstack = NULL;
#endif
static void start_task(jl_task_t *t);
#ifdef COPY_STACKS
jl_jmp_buf * volatile jl_jmp_target;
static void save_stack(jl_task_t *t)
{
if (t->done)
return;
volatile int _x;
size_t nb = (char*)t->stackbase - (char*)&_x;
char *buf;
if (t->stkbuf == NULL || t->bufsz < nb) {
buf = (char*)allocb(nb);
t->stkbuf = buf;
t->bufsz = nb;
}
else {
buf = (char*)t->stkbuf;
}
t->ssize = nb;
memcpy(buf, (char*)&_x, nb);
}
#if defined(_OS_WINDOWS_) && !defined(_COMPILER_MINGW_)
void __declspec(noinline) restore_stack(jl_task_t *t, jl_jmp_buf *where, char *p)
#else
void __attribute__((noinline)) restore_stack(jl_task_t *t, jl_jmp_buf *where, char *p)
#endif
{
char* _x = (char*)t->stackbase - t->ssize;
if (!p) {
p = _x;
if ((char*)&_x > _x) {
p = (char*)alloca((char*)&_x - _x);
}
restore_stack(t, where, p);
}
jl_jmp_target = where;
if (t->stkbuf != NULL) {
memcpy(_x, t->stkbuf, t->ssize);
}
jl_longjmp(*jl_jmp_target, 1);
}
static void switch_stack(jl_task_t *t, jl_jmp_buf *where)
{
assert(t == jl_current_task);
if (t->stkbuf == NULL) {
start_task(t);
// doesn't return
}
else {
restore_stack(t, where, NULL);
}
}
void jl_switch_stack(jl_task_t *t, jl_jmp_buf *where)
{
switch_stack(t, where);
}
#endif
static void ctx_switch(jl_task_t *t, jl_jmp_buf *where)
{
if (t == jl_current_task)
return;
/*
making task switching interrupt-safe is going to be challenging.
we need JL_SIGATOMIC_BEGIN in jl_enter_handler, and then
JL_SIGATOMIC_END after every JL_TRY sigsetjmp that returns zero.
also protect jl_eh_restore_state.
then we need JL_SIGATOMIC_BEGIN at the top of this function (ctx_switch).
the JL_SIGATOMIC_END at the end of this function handles the case
of task switching with yieldto().
then we need to handle the case of task switching via raise().
to do that, the top of every catch block must do JL_SIGATOMIC_END
*IF AND ONLY IF* throwing the exception involved a task switch.
*/
//JL_SIGATOMIC_BEGIN();
if (!jl_setjmp(jl_current_task->ctx, 0)) {
#ifdef COPY_STACKS
jl_task_t *lastt = jl_current_task;
save_stack(lastt);
#endif
// set up global state for new task
#ifdef JL_GC_MARKSWEEP
jl_current_task->gcstack = jl_pgcstack;
jl_pgcstack = t->gcstack;
#endif
jl_current_task->current_module = jl_current_module;
t->last = jl_current_task;
// by default, parent is first task to switch to this one
if (t->parent == NULL) {
t->parent = jl_current_task;
t->current_module = jl_current_module;
}
else {
jl_current_module = t->current_module;
}
jl_current_task = t;
#ifdef COPY_STACKS
jl_jmp_target = where;
jl_longjmp(lastt->base_ctx, 1);
#else
jl_longjmp(*where, 1);
#endif
}
//JL_SIGATOMIC_END();
}
extern int jl_in_gc;
static jl_value_t *switchto(jl_task_t *t)
{
if (t->done) {
jl_task_arg_in_transit = (jl_value_t*)jl_null;
return t->result;
}
if (jl_in_gc) {
jl_error("task switch not allowed from inside gc finalizer");
}
ctx_switch(t, &t->ctx);
jl_value_t *val = jl_task_arg_in_transit;
jl_task_arg_in_transit = (jl_value_t*)jl_null;
if (jl_current_task->exception != NULL &&
jl_current_task->exception != jl_nothing) {
jl_value_t *exc = jl_current_task->exception;
jl_current_task->exception = jl_nothing;
jl_throw(exc);
}
return val;
}
#ifndef COPY_STACKS
#ifdef __linux__
#if defined(__i386__)
static intptr_t ptr_mangle(intptr_t p)
{
intptr_t ret;
asm(" movl %1, %%eax;\n"
" xorl %%gs:0x18, %%eax;"
" roll $9, %%eax;"
" movl %%eax, %0;"
: "=r"(ret) : "r"(p) : "%eax");
return ret;
}
static intptr_t ptr_demangle(intptr_t p)
{
intptr_t ret;
asm(" movl %1, %%eax;\n"
" rorl $9, %%eax;"
" xorl %%gs:0x18, %%eax;"
" movl %%eax, %0;"
: "=r"(ret) : "r"(p) : "%eax" );
return ret;
}
#elif defined(__x86_64__)
static intptr_t ptr_mangle(intptr_t p)
{
intptr_t ret;
asm(" movq %1, %%rax;\n"
" xorq %%fs:0x30, %%rax;"
" rolq $17, %%rax;"
" movq %%rax, %0;"
: "=r"(ret) : "r"(p) : "%rax");
return ret;
}
static intptr_t ptr_demangle(intptr_t p)
{
intptr_t ret;
asm(" movq %1, %%rax;\n"
" rorq $17, %%rax;"
" xorq %%fs:0x30, %%rax;"
" movq %%rax, %0;"
: "=r"(ret) : "r"(p) : "%rax" );
return ret;
}
#endif
#endif //__linux__
/* rebase any values in saved state to the new stack */
static void rebase_state(jl_jmp_buf *ctx, intptr_t local_sp, intptr_t new_sp)
{
ptrint_t *s = (ptrint_t*)ctx;
ptrint_t diff = new_sp - local_sp; /* subtract old base, and add new base */
#if defined(__linux__) && defined(__i386__)
s[3] += diff;
if (mangle_pointers)
s[4] = ptr_mangle(ptr_demangle(s[4])+diff);
else
s[4] += diff;
#elif defined(__linux__) && defined(__x86_64__)
if (mangle_pointers) {
s[1] = ptr_mangle(ptr_demangle(s[1])+diff);
s[6] = ptr_mangle(ptr_demangle(s[6])+diff);
}
else {
s[1] += diff;
s[6] += diff;
}
#elif defined(__APPLE__) && defined(__i386__)
s[8] += diff;
s[9] += diff;
#elif defined(__APPLE__) && defined(__x86_64__)
s[1] += diff;
s[2] += diff;
#else
#error "COPY_STACKS must be defined on this platform."
#endif
}
#endif /* !COPY_STACKS */
jl_value_t *jl_switchto(jl_task_t *t, jl_value_t *arg)
{
jl_task_arg_in_transit = arg;
n_args_in_transit = 1;
return switchto(t);
}
static jl_function_t *task_done_hook_func=NULL;
static void finish_task(jl_task_t *t, jl_value_t *resultval)
{
assert(t->done==0);
t->done = 1;
t->runnable = 0;
t->result = resultval;
// TODO: early free of t->stkbuf
#ifdef COPY_STACKS
t->stkbuf = NULL;
#endif
if (t->donenotify && t->donenotify != jl_nothing) {
if (task_done_hook_func == NULL) {
task_done_hook_func = (jl_function_t*)jl_get_global(jl_base_module,
jl_symbol("task_done_hook"));
}
if (task_done_hook_func != NULL) {
jl_apply(task_done_hook_func, (jl_value_t**)&t, 1);
}
}
}
static void start_task(jl_task_t *t)
{
// this runs the first time we switch to t
jl_value_t *arg = jl_task_arg_in_transit;
jl_value_t *res;
JL_GC_PUSH1(&arg);
#ifdef COPY_STACKS
ptrint_t local_sp = (ptrint_t)jl_pgcstack;
// here we attempt to figure out how big our stack frame is, since we
// might need to copy all of it later. this is a bit of a fuzzy guess.
local_sp += sizeof(jl_gcframe_t);
local_sp += 12*sizeof(void*);
t->stackbase = (void*)(local_sp + _frame_offset);
if (jl_setjmp(t->base_ctx, 0)) {
// we get here to remove our data from the process stack
switch_stack(jl_current_task, jl_jmp_target);
}
#endif
if (n_args_in_transit == 0) {
res = jl_apply(t->start, NULL, 0);
}
else if (n_args_in_transit == 1) {
res = jl_apply(t->start, &arg, 1);
}
else {
assert(jl_is_tuple(jl_task_arg_in_transit));
res = jl_apply(t->start, &jl_tupleref(jl_task_arg_in_transit,0),
n_args_in_transit);
}
JL_GC_POP();
finish_task(t, res);
jl_task_t *cont = t->parent;
// if parent task has exited, try its parent, and so on
while (cont->done)
cont = cont->parent;
jl_switchto(cont, t->result);
assert(0);
}
#ifndef COPY_STACKS
static void init_task(jl_task_t *t)
{
if (jl_setjmp(t->ctx, 0)) {
start_task(t);
}
// this runs when the task is created
ptrint_t local_sp = (ptrint_t)&t;
ptrint_t new_sp = (ptrint_t)t->stack + t->ssize - _frame_offset;
#ifdef _P64
// SP must be 16-byte aligned
new_sp = new_sp&-16;
local_sp = local_sp&-16;
#endif
memcpy((void*)new_sp, (void*)local_sp, _frame_offset);
rebase_state(&t->ctx, local_sp, new_sp);
}
#endif
ptrint_t bt_data[MAX_BT_SIZE+1];
size_t bt_size = 0;
void getFunctionInfo(const char **name, int *line, const char **filename, size_t pointer);
static const char* name_unknown = "???";
static int frame_info_from_ip(const char **func_name, int *line_num, const char **file_name, size_t ip, int doCframes)
{
int fromC = 0;
getFunctionInfo(func_name, line_num, file_name, ip);
if (*func_name == NULL && doCframes) {
fromC = 1;
#if defined(_OS_WINDOWS_)
if (in_stackwalk) {
*func_name = name_unknown;
*file_name = name_unknown;
*line_num = ip;
}
else {
in_stackwalk = 1;
DWORD64 dwDisplacement64 = 0;
DWORD64 dwAddress = ip;
char buffer[sizeof(SYMBOL_INFO) + MAX_SYM_NAME * sizeof(TCHAR)];
PSYMBOL_INFO pSymbol = (PSYMBOL_INFO)buffer;
pSymbol->SizeOfStruct = sizeof(SYMBOL_INFO);
pSymbol->MaxNameLen = MAX_SYM_NAME;
if (SymFromAddr(GetCurrentProcess(), dwAddress, &dwDisplacement64, pSymbol)) {
// SymFromAddr returned success
*func_name = strdup(pSymbol->Name);
}
else {
*func_name = name_unknown;
// SymFromAddr failed
//DWORD error = GetLastError();
//printf("SymFromAddr returned error : %d\n", error);
}
IMAGEHLP_LINE64 line;
DWORD dwDisplacement = 0;
line.SizeOfStruct = sizeof(IMAGEHLP_LINE64);
if (SymGetLineFromAddr64(GetCurrentProcess(), dwAddress, &dwDisplacement, &line)) {
// SymGetLineFromAddr64 returned success
*file_name = strdup(line.FileName);
*line_num = line.LineNumber;
}
else {
*file_name = name_unknown;
*line_num = ip;
// SymGetLineFromAddr64 failed
//DWORD error = GetLastError();
//printf("SymGetLineFromAddr64 returned error : %d\n", error);
}
in_stackwalk = 0;
}
#else
Dl_info dlinfo;
if (dladdr((void*)ip, &dlinfo) != 0) {
*file_name = (dlinfo.dli_fname != NULL) ? dlinfo.dli_fname : name_unknown;
if (dlinfo.dli_sname != NULL) {
*func_name = dlinfo.dli_sname;
// line number in C looks tricky. addr2line and libbfd seem promising. For now, punt and just return address offset.
*line_num = ip-(size_t)dlinfo.dli_saddr;
}
else {
*func_name = name_unknown;
*line_num = 0;
}
}
else {
*func_name = name_unknown;
*file_name = name_unknown;
*line_num = ip;
}
#endif
}
return fromC;
}
#if defined(_OS_WINDOWS_)
int needsSymRefreshModuleList;
BOOL (WINAPI *hSymRefreshModuleList)(HANDLE);
DLLEXPORT size_t rec_backtrace(ptrint_t *data, size_t maxsize)
{
CONTEXT Context;
memset(&Context, 0, sizeof(Context));
in_stackwalk = 1;
RtlCaptureContext(&Context);
in_stackwalk = 0;
return rec_backtrace_ctx(data, maxsize, &Context);
}
DLLEXPORT size_t rec_backtrace_ctx(ptrint_t *data, size_t maxsize, CONTEXT *Context)
{
if (in_stackwalk) {
return 0;
}
STACKFRAME64 stk;
memset(&stk, 0, sizeof(stk));
if (needsSymRefreshModuleList && hSymRefreshModuleList != 0) {
in_stackwalk = 1;
hSymRefreshModuleList(GetCurrentProcess());
in_stackwalk = 0;
needsSymRefreshModuleList = 0;
}
#if defined(_CPU_X86_64_)
DWORD MachineType = IMAGE_FILE_MACHINE_AMD64;
stk.AddrPC.Offset = Context->Rip;
stk.AddrStack.Offset = Context->Rsp;
stk.AddrFrame.Offset = Context->Rbp;
#elif defined(_CPU_X86_)
DWORD MachineType = IMAGE_FILE_MACHINE_I386;
stk.AddrPC.Offset = Context->Eip;
stk.AddrStack.Offset = Context->Esp;
stk.AddrFrame.Offset = Context->Ebp;
#else
#error WIN16 not supported :P
#endif
stk.AddrPC.Mode = AddrModeFlat;
stk.AddrStack.Mode = AddrModeFlat;
stk.AddrFrame.Mode = AddrModeFlat;
size_t n = 0;
intptr_t lastsp = stk.AddrStack.Offset;
while (n < maxsize) {
in_stackwalk = 1;
BOOL result = StackWalk64(MachineType, GetCurrentProcess(), hMainThread,
&stk, Context, NULL, SymFunctionTableAccess64, SymGetModuleBase64, NULL);
in_stackwalk = 0;
data[n++] = (intptr_t)stk.AddrPC.Offset;
intptr_t sp = (intptr_t)stk.AddrStack.Offset;
if (!result || sp == 0 ||
(_stack_grows_up ? sp < lastsp : sp > lastsp) ||
stk.AddrReturn.Offset == 0)
break;
lastsp = sp;
}
return n;
}
#else
// stacktrace using libunwind
DLLEXPORT size_t rec_backtrace(ptrint_t *data, size_t maxsize)
{
unw_context_t uc;
unw_getcontext(&uc);
return rec_backtrace_ctx(data, maxsize, &uc);
}
DLLEXPORT size_t rec_backtrace_ctx(ptrint_t *data, size_t maxsize, unw_context_t *uc)
{
unw_cursor_t cursor;
unw_word_t ip;
size_t n=0;
unw_init_local(&cursor, uc);
do {
if (n >= maxsize)
break;
if (unw_get_reg(&cursor, UNW_REG_IP, &ip) < 0) {
break;
}
data[n++] = ip;
} while (unw_step(&cursor) > 0);
return n;
}
#ifdef LIBOSXUNWIND
size_t rec_backtrace_ctx_dwarf(ptrint_t *data, size_t maxsize, unw_context_t *uc)
{
unw_cursor_t cursor;
unw_word_t ip;
size_t n=0;
unw_init_local_dwarf(&cursor, uc);
do {
if (n >= maxsize)
break;
if (unw_get_reg(&cursor, UNW_REG_IP, &ip) < 0) {
break;
}
data[n++] = ip;
} while (unw_step(&cursor) > 0);
return n;
}
#endif
#endif
static void record_backtrace(void)
{
bt_size = rec_backtrace(bt_data, MAX_BT_SIZE);
}
static jl_value_t *array_ptr_void_type = NULL;
DLLEXPORT jl_value_t *jl_backtrace_from_here(void)
{
if (array_ptr_void_type == NULL)
array_ptr_void_type = jl_apply_type((jl_value_t*)jl_array_type,
jl_tuple2(jl_voidpointer_type,
jl_box_long(1)));
jl_array_t *bt = jl_alloc_array_1d(array_ptr_void_type, MAX_BT_SIZE);
size_t n = rec_backtrace((ptrint_t*)jl_array_data(bt), MAX_BT_SIZE);
if (n < MAX_BT_SIZE)
jl_array_del_end(bt, MAX_BT_SIZE-n);
return (jl_value_t*)bt;
}
DLLEXPORT jl_value_t *jl_lookup_code_address(void *ip, int doCframes)
{
const char *func_name;
int line_num;
const char *file_name;
#ifdef _OS_WINDOWS_
int fromC =
#endif
frame_info_from_ip(&func_name, &line_num, &file_name, (size_t)ip, doCframes);
if (func_name != NULL) {
jl_value_t *r = (jl_value_t*)jl_alloc_tuple(3);
JL_GC_PUSH1(&r);
jl_tupleset(r, 0, jl_symbol(func_name));
jl_tupleset(r, 1, jl_symbol(file_name));
jl_tupleset(r, 2, jl_box_long(line_num));
#ifdef _OS_WINDOWS_
if (fromC && func_name != name_unknown) free((void*)func_name);
if (fromC && file_name != name_unknown) free((void*)file_name);
#endif
JL_GC_POP();
return r;
}
return (jl_value_t*)jl_null;
}
DLLEXPORT jl_value_t *jl_get_backtrace(void)
{
if (array_ptr_void_type == NULL)
array_ptr_void_type = jl_apply_type((jl_value_t*)jl_array_type,
jl_tuple2(jl_voidpointer_type,
jl_box_long(1)));
jl_array_t *bt = jl_alloc_array_1d(array_ptr_void_type, bt_size);
memcpy(bt->data, bt_data, bt_size*sizeof(void*));
return (jl_value_t*)bt;
}
//for looking up functions from gdb:
DLLEXPORT void gdblookup(ptrint_t ip)
{
const char *func_name;
int line_num;
const char *file_name;
int fromC = frame_info_from_ip(&func_name, &line_num, &file_name, ip, 1);
if (func_name != NULL) {
if (fromC)
ios_printf(ios_stderr, "%s at %s: offset %x\n", func_name, file_name, line_num);
else
ios_printf(ios_stderr, "%s at %s:%d\n", func_name, file_name, line_num);
#ifdef _OS_WINDOWS_
if (fromC && func_name != name_unknown) free((void*)func_name);
if (fromC && file_name != name_unknown) free((void*)file_name);
#endif
}
}
DLLEXPORT void jlbacktrace()
{
for(size_t i=0; i < bt_size; i++)
gdblookup(bt_data[i]);
}
DLLEXPORT void gdbbacktrace()
{
record_backtrace();
jlbacktrace();
}
// yield to exception handler
void NORETURN throw_internal(jl_value_t *e)
{
assert(e != NULL);
jl_exception_in_transit = e;
if (jl_current_task->eh != NULL) {
jl_longjmp(jl_current_task->eh->eh_ctx, 1);
}
else {
if (jl_current_task == jl_root_task) {
JL_PRINTF(JL_STDERR, "fatal: error thrown and no exception handler available.\n");
jl_static_show(JL_STDERR, e);
JL_PRINTF(JL_STDERR, "\n");
exit(1);
}
jl_task_t *cont = jl_current_task->parent;
while (cont->done || cont->eh == NULL)
cont = cont->parent;
// for now, exit the task
jl_current_task->exception = e;
finish_task(jl_current_task, e);
jl_current_task->exception = jl_nothing;
ctx_switch(cont, &cont->eh->eh_ctx);
// TODO: continued exception
}
jl_exit(1);
}
// record backtrace and raise an error
DLLEXPORT void jl_throw(jl_value_t *e)
{
assert(e != NULL);
record_backtrace();
throw_internal(e);
}
DLLEXPORT void jl_rethrow(void)
{
throw_internal(jl_exception_in_transit);
}
DLLEXPORT void jl_rethrow_other(jl_value_t *e)
{
throw_internal(e);
}
DLLEXPORT void jl_throw_with_superfluous_argument(jl_value_t *e, int line)
{
jl_throw(e);
}
jl_task_t *jl_new_task(jl_function_t *start, size_t ssize)
{
size_t pagesz = jl_page_size;
jl_task_t *t = (jl_task_t*)allocobj(sizeof(jl_task_t));
t->type = (jl_value_t*)jl_task_type;
ssize = LLT_ALIGN(ssize, pagesz);
t->ssize = ssize;
t->parent = NULL;
t->last = jl_current_task;
t->tls = jl_nothing;
t->consumers = jl_nothing;
t->done = 0;
t->runnable = 1;
t->start = start;
t->result = jl_nothing;
t->donenotify = jl_nothing;
t->exception = jl_nothing;
// there is no active exception handler available on this stack yet
t->eh = NULL;
#ifdef JL_GC_MARKSWEEP
t->gcstack = NULL;
#endif
t->stkbuf = NULL;
#ifdef COPY_STACKS
t->bufsz = 0;
#else
JL_GC_PUSH1(&t);
char *stk = allocb(ssize+pagesz+(pagesz-1));
t->stkbuf = stk;
stk = (char*)LLT_ALIGN((uptrint_t)stk, pagesz);
// add a guard page to detect stack overflow
// the GC might read this area, which is ok, just prevent writes
if (mprotect(stk, pagesz-1, PROT_READ) == -1)
jl_errorf("mprotect: %s", strerror(errno));
t->stack = stk+pagesz;
init_task(t);
JL_GC_POP();
jl_gc_add_finalizer((jl_value_t*)t, jl_unprotect_stack_func);
#endif
return t;
}
JL_CALLABLE(jl_unprotect_stack)
{
#ifndef COPY_STACKS
jl_task_t *t = (jl_task_t*)args[0];
char *stk = t->stack-jl_page_size;
// unprotect stack so it can be reallocated for something else
mprotect(stk, jl_page_size-1, PROT_READ|PROT_WRITE|PROT_EXEC);
#endif
return (jl_value_t*)jl_null;
}
#define JL_MIN_STACK (4096*sizeof(void*))
#define JL_DEFAULT_STACK (2*12288*sizeof(void*))
JL_CALLABLE(jl_f_task)
{
JL_NARGS(Task, 1, 2);
JL_TYPECHK(Task, function, args[0]);
/*
we need a somewhat large stack, because execution can trigger
compilation, which uses perhaps too much stack space.
*/
size_t ssize = JL_DEFAULT_STACK;
if (nargs == 2) {
JL_TYPECHK(Task, long, args[1]);
ssize = jl_unbox_long(args[1]);
if (ssize < JL_MIN_STACK)
jl_error("Task: stack size too small");
}
return (jl_value_t*)jl_new_task((jl_function_t*)args[0], ssize);
}
JL_CALLABLE(jl_f_yieldto)
{
JL_NARGSV(yieldto, 1);
JL_TYPECHK(yieldto, task, args[0]);
n_args_in_transit = nargs-1;
if (nargs == 2) {
jl_task_arg_in_transit = args[1];
}
else if (nargs > 2) {
jl_task_arg_in_transit = jl_f_tuple(NULL, &args[1], n_args_in_transit);
}
else {
jl_task_arg_in_transit = (jl_value_t*)jl_null;
}
return switchto((jl_task_t*)args[0]);
}
DLLEXPORT jl_value_t *jl_get_current_task(void)
{
return (jl_value_t*)jl_current_task;
}
jl_function_t *jl_unprotect_stack_func;
void jl_init_tasks(void *stack, size_t ssize)
{
_probe_arch();
jl_task_type = jl_new_datatype(jl_symbol("Task"),
jl_any_type,
jl_null,
jl_tuple(10,
jl_symbol("parent"),
jl_symbol("last"),
jl_symbol("storage"),
jl_symbol("consumers"),
jl_symbol("done"),
jl_symbol("runnable"),
jl_symbol("result"),
jl_symbol("donenotify"),
jl_symbol("exception"),
jl_symbol("code")),
jl_tuple(10,
jl_any_type, jl_any_type,
jl_any_type, jl_any_type,
jl_bool_type, jl_bool_type,
jl_any_type, jl_any_type,
jl_any_type, jl_function_type),
0, 1);
jl_tupleset(jl_task_type->types, 0, (jl_value_t*)jl_task_type);
jl_task_type->fptr = jl_f_task;
jl_current_task = (jl_task_t*)allocobj(sizeof(jl_task_t));
jl_current_task->type = (jl_value_t*)jl_task_type;
#ifdef COPY_STACKS
jl_current_task->stackbase = (char *)stack + ssize;
jl_current_task->ssize = 0; // size of saved piece
jl_current_task->bufsz = 0;
#else
jl_current_task->stack = stack;
jl_current_task->ssize = ssize;
#endif
jl_current_task->stkbuf = NULL;
jl_current_task->parent = jl_current_task;
jl_current_task->current_module = jl_current_module;
jl_current_task->last = jl_current_task;
jl_current_task->tls = NULL;
jl_current_task->consumers = NULL;
jl_current_task->done = 0;
jl_current_task->runnable = 1;
jl_current_task->start = NULL;
jl_current_task->result = NULL;
jl_current_task->donenotify = NULL;
jl_current_task->exception = NULL;
jl_current_task->eh = NULL;
#ifdef JL_GC_MARKSWEEP
jl_current_task->gcstack = NULL;
#endif
jl_root_task = jl_current_task;
jl_exception_in_transit = (jl_value_t*)jl_null;
jl_task_arg_in_transit = (jl_value_t*)jl_null;
jl_unprotect_stack_func = jl_new_closure(jl_unprotect_stack, (jl_value_t*)jl_null, NULL);
}