/
eval.c
8005 lines (7181 loc) · 229 KB
/
eval.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
/*
* R : A Computer Language for Statistical Data Analysis
* Copyright (C) 1998--2017 The R Core Team.
* Copyright (C) 1995, 1996 Robert Gentleman and Ross Ihaka
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, a copy is available at
* https://www.R-project.org/Licenses/
*/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#define R_USE_SIGNALS 1
#include <Defn.h>
#include <Internal.h>
#include <Rinterface.h>
#include <Fileio.h>
#include <R_ext/Print.h>
static SEXP bcEval(SEXP, SEXP, Rboolean);
/* BC_PROFILING needs to be enabled at build time. It is not enabled
by default as enabling it disables the more efficient threaded code
implementation of the byte code interpreter. */
#ifdef BC_PROFILING
static Rboolean bc_profiling = FALSE;
#endif
static int R_Profiling = 0;
#ifdef R_PROFILING
/* BDR 2000-07-15
Profiling is now controlled by the R function Rprof(), and should
have negligible cost when not enabled.
*/
/* A simple mechanism for profiling R code. When R_PROFILING is
enabled, eval will write out the call stack every PROFSAMPLE
microseconds using the SIGPROF handler triggered by timer signals
from the ITIMER_PROF timer. Since this is the same timer used by C
profiling, the two cannot be used together. Output is written to
the file PROFOUTNAME. This is a plain text file. The first line
of the file contains the value of PROFSAMPLE. The remaining lines
each give the call stack found at a sampling point with the inner
most function first.
To enable profiling, recompile eval.c with R_PROFILING defined. It
would be possible to selectively turn profiling on and off from R
and to specify the file name from R as well, but for now I won't
bother.
The stack is traced by walking back along the context stack, just
like the traceback creation in jump_to_toplevel. One drawback of
this approach is that it does not show BUILTIN's since they don't
get a context. With recent changes to pos.to.env it seems possible
to insert a context around BUILTIN calls to that they show up in
the trace. Since there is a cost in establishing these contexts,
they are only inserted when profiling is enabled. [BDR: we have since
also added contexts for the BUILTIN calls to foreign code.]
One possible advantage of not tracing BUILTIN's is that then
profiling adds no cost when the timer is turned off. This would be
useful if we want to allow profiling to be turned on and off from
within R.
One thing that makes interpreting profiling output tricky is lazy
evaluation. When an expression f(g(x)) is profiled, lazy
evaluation will cause g to be called inside the call to f, so it
will appear as if g is called by f.
L. T. */
#ifdef Win32
# define WIN32_LEAN_AND_MEAN 1
# include <windows.h> /* for CreateEvent, SetEvent */
# include <process.h> /* for _beginthread, _endthread */
#else
# ifdef HAVE_SYS_TIME_H
# include <sys/time.h>
# endif
# include <signal.h>
#endif /* not Win32 */
static FILE *R_ProfileOutfile = NULL;
static int R_Mem_Profiling=0;
static int R_GC_Profiling = 0; /* indicates GC profiling */
static int R_Line_Profiling = 0; /* indicates line profiling, and also counts the filenames seen (+1) */
static char **R_Srcfiles; /* an array of pointers into the filename buffer */
static size_t R_Srcfile_bufcount; /* how big is the array above? */
static SEXP R_Srcfiles_buffer = NULL; /* a big RAWSXP to use as a buffer for filenames and pointers to them */
static int R_Profiling_Error; /* record errors here */
#ifdef Win32
HANDLE MainThread;
HANDLE ProfileEvent;
#endif /* Win32 */
/* Careful here! These functions are called asynchronously, maybe in the middle of GC,
so don't do any allocations */
/* This does a linear search through the previously recorded filenames. If
this one is new, we try to add it. FIXME: if there are eventually
too many files for an efficient linear search, do hashing. */
static int getFilenum(const char* filename) {
int fnum;
for (fnum = 0; fnum < R_Line_Profiling-1
&& strcmp(filename, R_Srcfiles[fnum]); fnum++);
if (fnum == R_Line_Profiling-1) {
size_t len = strlen(filename);
if (fnum >= R_Srcfile_bufcount) { /* too many files */
R_Profiling_Error = 1;
return 0;
}
if (R_Srcfiles[fnum] - (char*)RAW(R_Srcfiles_buffer) + len + 1 > length(R_Srcfiles_buffer)) {
/* out of space in the buffer */
R_Profiling_Error = 2;
return 0;
}
strcpy(R_Srcfiles[fnum], filename);
R_Srcfiles[fnum+1] = R_Srcfiles[fnum] + len + 1;
*(R_Srcfiles[fnum+1]) = '\0';
R_Line_Profiling++;
}
return fnum + 1;
}
/* These, together with sprintf/strcat, are not safe -- we should be
using snprintf and such and computing needed sizes, but these
settings are better than what we had. LT */
#define PROFBUFSIZ 10500
#define PROFITEMMAX 500
#define PROFLINEMAX (PROFBUFSIZ - PROFITEMMAX)
/* It would also be better to flush the buffer when it gets full,
even if the line isn't complete. But this isn't possible if we rely
on writing all line profiling files first. With these sizes
hitting the limit is fairly unlikely, but if we do then the output
file is wrong. Maybe writing an overflow marker of some sort would
be better. LT */
static void lineprof(char* buf, SEXP srcref)
{
size_t len;
if (srcref && !isNull(srcref) && (len = strlen(buf)) < PROFLINEMAX) {
int fnum, line = asInteger(srcref);
SEXP srcfile = getAttrib(srcref, R_SrcfileSymbol);
const char *filename;
if (!srcfile || TYPEOF(srcfile) != ENVSXP) return;
srcfile = findVar(install("filename"), srcfile);
if (TYPEOF(srcfile) != STRSXP || !length(srcfile)) return;
filename = CHAR(STRING_ELT(srcfile, 0));
if ((fnum = getFilenum(filename)))
snprintf(buf+len, PROFBUFSIZ - len, "%d#%d ", fnum, line);
}
}
/* FIXME: This should be done wih a proper configure test, also making
sure that the pthreads library is linked in. LT */
#ifndef Win32
#if (defined(__APPLE__) || defined(_REENTRANT) || defined(HAVE_OPENMP)) && \
! defined(HAVE_PTHREAD)
# define HAVE_PTHREAD
#endif
#ifdef HAVE_PTHREAD
# include <pthread.h>
static pthread_t R_profiled_thread;
# endif
#endif
static void doprof(int sig) /* sig is ignored in Windows */
{
RCNTXT *cptr;
char buf[PROFBUFSIZ];
size_t bigv, smallv, nodes;
size_t len;
int prevnum = R_Line_Profiling;
buf[0] = '\0';
#ifdef Win32
SuspendThread(MainThread);
#elif defined(HAVE_PTHREAD)
if (! pthread_equal(pthread_self(), R_profiled_thread)) {
pthread_kill(R_profiled_thread, sig);
return;
}
#endif /* Win32 */
if (R_Mem_Profiling){
get_current_mem(&smallv, &bigv, &nodes);
if((len = strlen(buf)) < PROFLINEMAX)
snprintf(buf+len, PROFBUFSIZ - len,
":%lu:%lu:%lu:%lu:",
(unsigned long) smallv, (unsigned long) bigv,
(unsigned long) nodes, get_duplicate_counter());
reset_duplicate_counter();
}
if (R_GC_Profiling && R_gc_running())
strcat(buf, "\"<GC>\" ");
if (R_Line_Profiling)
lineprof(buf, R_getCurrentSrcref());
for (cptr = R_GlobalContext; cptr; cptr = cptr->nextcontext) {
if ((cptr->callflag & (CTXT_FUNCTION | CTXT_BUILTIN))
&& TYPEOF(cptr->call) == LANGSXP) {
SEXP fun = CAR(cptr->call);
if(strlen(buf) < PROFLINEMAX) {
strcat(buf, "\"");
char itembuf[PROFITEMMAX];
if (TYPEOF(fun) == SYMSXP) {
snprintf(itembuf, PROFITEMMAX-1, "%s", CHAR(PRINTNAME(fun)));
} else if ((CAR(fun) == R_DoubleColonSymbol ||
CAR(fun) == R_TripleColonSymbol ||
CAR(fun) == R_DollarSymbol) &&
TYPEOF(CADR(fun)) == SYMSXP &&
TYPEOF(CADDR(fun)) == SYMSXP) {
/* Function accessed via ::, :::, or $. Both args must be
symbols. It is possible to use strings with these
functions, as in "base"::"list", but that's a very rare
case so we won't bother handling it. */
snprintf(itembuf, PROFITEMMAX-1, "%s%s%s",
CHAR(PRINTNAME(CADR(fun))),
CHAR(PRINTNAME(CAR(fun))),
CHAR(PRINTNAME(CADDR(fun))));
} else if (CAR(fun) == R_Bracket2Symbol &&
TYPEOF(CADR(fun)) == SYMSXP &&
((TYPEOF(CADDR(fun)) == SYMSXP ||
TYPEOF(CADDR(fun)) == STRSXP ||
TYPEOF(CADDR(fun)) == INTSXP ||
TYPEOF(CADDR(fun)) == REALSXP) &&
length(CADDR(fun)) > 0)) {
/* Function accessed via [[. The first arg must be a symbol
and the second can be a symbol, string, integer, or
real. */
SEXP arg1 = CADR(fun);
SEXP arg2 = CADDR(fun);
char arg2buf[PROFITEMMAX-5];
if (TYPEOF(arg2) == SYMSXP) {
snprintf(arg2buf, PROFITEMMAX-6, "%s", CHAR(PRINTNAME(arg2)));
} else if (TYPEOF(arg2) == STRSXP) {
snprintf(arg2buf, PROFITEMMAX-6, "\"%s\"", CHAR(STRING_ELT(arg2, 0)));
} else if (TYPEOF(arg2) == INTSXP) {
snprintf(arg2buf, PROFITEMMAX-6, "%d", INTEGER(arg2)[0]);
} else if (TYPEOF(arg2) == REALSXP) {
snprintf(arg2buf, PROFITEMMAX-6, "%.0f", REAL(arg2)[0]);
} else {
/* Shouldn't get here, but just in case. */
arg2buf[0] = '\0';
}
snprintf(itembuf, PROFITEMMAX-1, "%s[[%s]]",
CHAR(PRINTNAME(arg1)),
arg2buf);
} else {
sprintf(itembuf, "<Anonymous>");
}
strcat(buf, itembuf);
strcat(buf, "\" ");
if (R_Line_Profiling) {
if (cptr->srcref == R_InBCInterpreter)
lineprof(buf,
R_findBCInterpreterSrcref(cptr));
else
lineprof(buf, cptr->srcref);
}
}
}
}
/* I believe it would be slightly safer to place this _after_ the
next two bits, along with the signal() call. LT */
#ifdef Win32
ResumeThread(MainThread);
#endif /* Win32 */
for (int i = prevnum; i < R_Line_Profiling; i++)
fprintf(R_ProfileOutfile, "#File %d: %s\n", i, R_Srcfiles[i-1]);
if(strlen(buf))
fprintf(R_ProfileOutfile, "%s\n", buf);
#ifndef Win32
signal(SIGPROF, doprof);
#endif /* not Win32 */
}
#ifdef Win32
/* Profiling thread main function */
static void __cdecl ProfileThread(void *pwait)
{
int wait = *((int *)pwait);
SetThreadPriority(GetCurrentThread(), THREAD_PRIORITY_HIGHEST);
while(WaitForSingleObject(ProfileEvent, wait) != WAIT_OBJECT_0) {
doprof(0);
}
}
#else /* not Win32 */
static void doprof_null(int sig)
{
signal(SIGPROF, doprof_null);
}
#endif /* not Win32 */
static void R_EndProfiling(void)
{
#ifdef Win32
SetEvent(ProfileEvent);
CloseHandle(MainThread);
#else /* not Win32 */
struct itimerval itv;
itv.it_interval.tv_sec = 0;
itv.it_interval.tv_usec = 0;
itv.it_value.tv_sec = 0;
itv.it_value.tv_usec = 0;
setitimer(ITIMER_PROF, &itv, NULL);
signal(SIGPROF, doprof_null);
#endif /* not Win32 */
if(R_ProfileOutfile) fclose(R_ProfileOutfile);
R_ProfileOutfile = NULL;
R_Profiling = 0;
if (R_Srcfiles_buffer) {
R_ReleaseObject(R_Srcfiles_buffer);
R_Srcfiles_buffer = NULL;
}
if (R_Profiling_Error)
warning(_("source files skipped by Rprof; please increase '%s'"),
R_Profiling_Error == 1 ? "numfiles" : "bufsize");
}
static void R_InitProfiling(SEXP filename, int append, double dinterval,
int mem_profiling, int gc_profiling,
int line_profiling, int numfiles, int bufsize)
{
#ifndef Win32
struct itimerval itv;
#else
int wait;
HANDLE Proc = GetCurrentProcess();
#endif
int interval;
interval = (int)(1e6 * dinterval + 0.5);
if(R_ProfileOutfile != NULL) R_EndProfiling();
R_ProfileOutfile = RC_fopen(filename, append ? "a" : "w", TRUE);
if (R_ProfileOutfile == NULL)
error(_("Rprof: cannot open profile file '%s'"),
translateChar(filename));
if(mem_profiling)
fprintf(R_ProfileOutfile, "memory profiling: ");
if(gc_profiling)
fprintf(R_ProfileOutfile, "GC profiling: ");
if(line_profiling)
fprintf(R_ProfileOutfile, "line profiling: ");
fprintf(R_ProfileOutfile, "sample.interval=%d\n", interval);
R_Mem_Profiling=mem_profiling;
if (mem_profiling)
reset_duplicate_counter();
R_Profiling_Error = 0;
R_Line_Profiling = line_profiling;
R_GC_Profiling = gc_profiling;
if (line_profiling) {
/* Allocate a big RAW vector to use as a buffer. The first len1 bytes are an array of pointers
to strings; the actual strings are stored in the second len2 bytes. */
R_Srcfile_bufcount = numfiles;
size_t len1 = R_Srcfile_bufcount*sizeof(char *), len2 = bufsize;
R_PreserveObject( R_Srcfiles_buffer = Rf_allocVector(RAWSXP, len1 + len2) );
// memset(RAW(R_Srcfiles_buffer), 0, len1+len2);
R_Srcfiles = (char **) RAW(R_Srcfiles_buffer);
R_Srcfiles[0] = (char *)RAW(R_Srcfiles_buffer) + len1;
*(R_Srcfiles[0]) = '\0';
}
#ifdef Win32
/* need to duplicate to make a real handle */
DuplicateHandle(Proc, GetCurrentThread(), Proc, &MainThread,
0, FALSE, DUPLICATE_SAME_ACCESS);
wait = interval/1000;
if(!(ProfileEvent = CreateEvent(NULL, FALSE, FALSE, NULL)) ||
(_beginthread(ProfileThread, 0, &wait) == -1))
R_Suicide("unable to create profiling thread");
Sleep(wait/2); /* suspend this thread to ensure that the other one starts */
#else /* not Win32 */
#ifdef HAVE_PTHREAD
R_profiled_thread = pthread_self();
#endif
signal(SIGPROF, doprof);
itv.it_interval.tv_sec = 0;
itv.it_interval.tv_usec = interval;
itv.it_value.tv_sec = 0;
itv.it_value.tv_usec = interval;
if (setitimer(ITIMER_PROF, &itv, NULL) == -1)
R_Suicide("setting profile timer failed");
#endif /* not Win32 */
R_Profiling = 1;
}
SEXP do_Rprof(SEXP args)
{
SEXP filename;
int append_mode, mem_profiling, gc_profiling, line_profiling;
double dinterval;
int numfiles, bufsize;
#ifdef BC_PROFILING
if (bc_profiling) {
warning("cannot use R profiling while byte code profiling");
return R_NilValue;
}
#endif
if (!isString(filename = CAR(args)) || (LENGTH(filename)) != 1)
error(_("invalid '%s' argument"), "filename");
args = CDR(args);
append_mode = asLogical(CAR(args)); args = CDR(args);
dinterval = asReal(CAR(args)); args = CDR(args);
mem_profiling = asLogical(CAR(args)); args = CDR(args);
gc_profiling = asLogical(CAR(args)); args = CDR(args);
line_profiling = asLogical(CAR(args)); args = CDR(args);
numfiles = asInteger(CAR(args)); args = CDR(args);
if (numfiles < 0)
error(_("invalid '%s' argument"), "numfiles");
bufsize = asInteger(CAR(args));
if (bufsize < 0)
error(_("invalid '%s' argument"), "bufsize");
filename = STRING_ELT(filename, 0);
if (LENGTH(filename))
R_InitProfiling(filename, append_mode, dinterval, mem_profiling,
gc_profiling, line_profiling, numfiles, bufsize);
else
R_EndProfiling();
return R_NilValue;
}
#else /* not R_PROFILING */
SEXP do_Rprof(SEXP args)
{
error(_("R profiling is not available on this system"));
return R_NilValue; /* -Wall */
}
#endif /* not R_PROFILING */
/* NEEDED: A fixup is needed in browser, because it can trap errors,
* and currently does not reset the limit to the right value. */
void attribute_hidden check_stack_balance(SEXP op, int save)
{
if(save == R_PPStackTop) return;
REprintf("Warning: stack imbalance in '%s', %d then %d\n",
PRIMNAME(op), save, R_PPStackTop);
}
static SEXP forcePromise(SEXP e)
{
if (PRVALUE(e) == R_UnboundValue) {
RPRSTACK prstack;
SEXP val;
if(PRSEEN(e)) {
if (PRSEEN(e) == 1)
errorcall(R_GlobalContext->call,
_("promise already under evaluation: recursive default argument reference or earlier problems?"));
else {
/* set PRSEEN to 1 to avoid infinite recursion */
SET_PRSEEN(e, 1);
warningcall(R_GlobalContext->call,
_("restarting interrupted promise evaluation"));
}
}
/* Mark the promise as under evaluation and push it on a stack
that can be used to unmark pending promises if a jump out
of the evaluation occurs. */
SET_PRSEEN(e, 1);
prstack.promise = e;
prstack.next = R_PendingPromises;
R_PendingPromises = &prstack;
val = eval(PRCODE(e), PRENV(e));
/* Pop the stack, unmark the promise and set its value field.
Also set the environment to R_NilValue to allow GC to
reclaim the promise environment; this is also useful for
fancy games with delayedAssign() */
R_PendingPromises = prstack.next;
SET_PRSEEN(e, 0);
SET_PRVALUE(e, val);
ENSURE_NAMEDMAX(val);
SET_PRENV(e, R_NilValue);
}
return PRVALUE(e);
}
/* Return value of "e" evaluated in "rho". */
/* some places, e.g. deparse2buff, call this with a promise and rho = NULL */
SEXP eval(SEXP e, SEXP rho)
{
SEXP op, tmp;
static int evalcount = 0;
R_Visible = TRUE;
/* this is needed even for self-evaluating objects or something like
'while (TRUE) NULL' will not be interruptable */
if (++evalcount > 1000) { /* was 100 before 2.8.0 */
R_CheckUserInterrupt();
#ifndef IMMEDIATE_FINALIZERS
/* finalizers are run here since this should only be called at
points where running arbitrary code should be safe */
R_RunPendingFinalizers();
#endif
evalcount = 0 ;
}
/* handle self-evaluating objects with minimal overhead */
switch (TYPEOF(e)) {
case NILSXP:
case LISTSXP:
case LGLSXP:
case INTSXP:
case REALSXP:
case STRSXP:
case CPLXSXP:
case RAWSXP:
case S4SXP:
case SPECIALSXP:
case BUILTINSXP:
case ENVSXP:
case CLOSXP:
case VECSXP:
case EXTPTRSXP:
case WEAKREFSXP:
case EXPRSXP:
/* Make sure constants in expressions are NAMED before being
used as values. Setting NAMED to NAMEDMAX makes sure weird calls
to replacement functions won't modify constants in
expressions. */
ENSURE_NAMEDMAX(e);
return e;
default: break;
}
int bcintactivesave = R_BCIntActive;
R_BCIntActive = 0;
if (!rho)
error("'rho' cannot be C NULL: detected in C-level eval");
if (!isEnvironment(rho))
error("'rho' must be an environment not %s: detected in C-level eval",
type2char(TYPEOF(rho)));
/* Save the current srcref context. */
SEXP srcrefsave = R_Srcref;
/* The use of depthsave below is necessary because of the
possibility of non-local returns from evaluation. Without this
an "expression too complex error" is quite likely. */
int depthsave = R_EvalDepth++;
/* We need to explicit set a NULL call here to circumvent attempts
to deparse the call in the error-handler */
if (R_EvalDepth > R_Expressions) {
R_Expressions = R_Expressions_keep + 500;
errorcall(R_NilValue,
_("evaluation nested too deeply: infinite recursion / options(expressions=)?"));
}
R_CheckStack();
tmp = R_NilValue; /* -Wall */
#ifdef Win32
/* This is an inlined version of Rwin_fpreset (src/gnuwin/extra.c)
and resets the precision, rounding and exception modes of a ix86
fpu.
*/
__asm__ ( "fninit" );
#endif
switch (TYPEOF(e)) {
case BCODESXP:
tmp = bcEval(e, rho, TRUE);
break;
case SYMSXP:
if (e == R_DotsSymbol)
error(_("'...' used in an incorrect context"));
if( DDVAL(e) )
tmp = ddfindVar(e,rho);
else
tmp = findVar(e, rho);
if (tmp == R_UnboundValue)
error(_("object '%s' not found"), EncodeChar(PRINTNAME(e)));
/* if ..d is missing then ddfindVar will signal */
else if (tmp == R_MissingArg && !DDVAL(e) ) {
const char *n = CHAR(PRINTNAME(e));
if(*n) error(_("argument \"%s\" is missing, with no default"),
CHAR(PRINTNAME(e)));
else error(_("argument is missing, with no default"));
}
else if (TYPEOF(tmp) == PROMSXP) {
if (PRVALUE(tmp) == R_UnboundValue) {
/* not sure the PROTECT is needed here but keep it to
be on the safe side. */
PROTECT(tmp);
tmp = forcePromise(tmp);
UNPROTECT(1);
}
else tmp = PRVALUE(tmp);
ENSURE_NAMEDMAX(tmp);
}
else ENSURE_NAMED(tmp); /* should not really be needed - LT */
break;
case PROMSXP:
if (PRVALUE(e) == R_UnboundValue)
/* We could just unconditionally use the return value from
forcePromise; the test avoids the function call if the
promise is already evaluated. */
forcePromise(e);
tmp = PRVALUE(e);
/* This does _not_ change the value of NAMED on the value tmp,
in contrast to the handling of promises bound to symbols in
the SYMSXP case above. The reason is that one (typically
the only) place promises appear in source code is as
wrappers for the RHS value in replacement function calls for
complex assignment expression created in applydefine(). If
the RHS value is freshly created it will have NAMED = 0 and
we want it to stay that way or a BUILTIN or SPECIAL
replacement function might have to duplicate the value
before inserting it to avoid creating cycles. (Closure
replacement functions will get the value via the SYMSXP case
from evaluating their 'value' argument so the value will
end up getting duplicated if NAMED > 1.) LT */
break;
case LANGSXP:
if (TYPEOF(CAR(e)) == SYMSXP) {
/* This will throw an error if the function is not found */
SEXP ecall = e;
/* This picks the correct/better error expression for
replacement calls running in the AST interpreter. */
if (R_GlobalContext != NULL &&
(R_GlobalContext->callflag == CTXT_CCODE))
ecall = R_GlobalContext->call;
PROTECT(op = findFun3(CAR(e), rho, ecall));
} else
PROTECT(op = eval(CAR(e), rho));
if(RTRACE(op) && R_current_trace_state()) {
Rprintf("trace: ");
PrintValue(e);
}
if (TYPEOF(op) == SPECIALSXP) {
int save = R_PPStackTop, flag = PRIMPRINT(op);
const void *vmax = vmaxget();
PROTECT(e);
R_Visible = flag != 1;
tmp = PRIMFUN(op) (e, op, CDR(e), rho);
#ifdef CHECK_VISIBILITY
if(flag < 2 && R_Visible == flag) {
char *nm = PRIMNAME(op);
if(strcmp(nm, "for")
&& strcmp(nm, "repeat") && strcmp(nm, "while")
&& strcmp(nm, "[[<-") && strcmp(nm, "on.exit"))
printf("vis: special %s\n", nm);
}
#endif
if (flag < 2) R_Visible = flag != 1;
UNPROTECT(1);
check_stack_balance(op, save);
vmaxset(vmax);
}
else if (TYPEOF(op) == BUILTINSXP) {
int save = R_PPStackTop, flag = PRIMPRINT(op);
const void *vmax = vmaxget();
RCNTXT cntxt;
PROTECT(tmp = evalList(CDR(e), rho, e, 0));
if (flag < 2) R_Visible = flag != 1;
/* We used to insert a context only if profiling,
but helps for tracebacks on .C etc. */
if (R_Profiling || (PPINFO(op).kind == PP_FOREIGN)) {
SEXP oldref = R_Srcref;
begincontext(&cntxt, CTXT_BUILTIN, e,
R_BaseEnv, R_BaseEnv, R_NilValue, R_NilValue);
R_Srcref = NULL;
tmp = PRIMFUN(op) (e, op, tmp, rho);
R_Srcref = oldref;
endcontext(&cntxt);
} else {
tmp = PRIMFUN(op) (e, op, tmp, rho);
}
#ifdef CHECK_VISIBILITY
if(flag < 2 && R_Visible == flag) {
char *nm = PRIMNAME(op);
printf("vis: builtin %s\n", nm);
}
#endif
if (flag < 2) R_Visible = flag != 1;
UNPROTECT(1);
check_stack_balance(op, save);
vmaxset(vmax);
}
else if (TYPEOF(op) == CLOSXP) {
SEXP pargs = promiseArgs(CDR(e), rho);
PROTECT(pargs);
tmp = applyClosure(e, op, pargs, rho, R_NilValue);
#ifdef ADJUST_ENVIR_REFCNTS
unpromiseArgs(pargs);
#endif
UNPROTECT(1);
}
else
error(_("attempt to apply non-function"));
UNPROTECT(1);
break;
case DOTSXP:
error(_("'...' used in an incorrect context"));
default:
UNIMPLEMENTED_TYPE("eval", e);
}
R_EvalDepth = depthsave;
R_Srcref = srcrefsave;
R_BCIntActive = bcintactivesave;
return (tmp);
}
attribute_hidden
void SrcrefPrompt(const char * prefix, SEXP srcref)
{
/* If we have a valid srcref, use it */
if (srcref && srcref != R_NilValue) {
if (TYPEOF(srcref) == VECSXP) srcref = VECTOR_ELT(srcref, 0);
SEXP srcfile = getAttrib(srcref, R_SrcfileSymbol);
if (TYPEOF(srcfile) == ENVSXP) {
SEXP filename = findVar(install("filename"), srcfile);
if (isString(filename) && length(filename)) {
Rprintf(_("%s at %s#%d: "), prefix,
CHAR(STRING_ELT(filename, 0)),
asInteger(srcref));
return;
}
}
}
/* default: */
Rprintf("%s: ", prefix);
}
/* JIT support */
typedef unsigned long R_exprhash_t;
static R_exprhash_t hash(unsigned char *str, int n, R_exprhash_t hash)
{
// djb2 from http://www.cse.yorku.ca/~oz/hash.html
// (modified for n-byte lengths)
int i;
for(i = 0; i < n; i++)
hash = ((hash << 5) + hash) + str[i]; /* hash * 33 + c */
return hash;
}
#define HASH(x, h) hash((unsigned char *) &x, sizeof(x), h)
static R_exprhash_t hashexpr1(SEXP e, R_exprhash_t h)
{
#define SKIP_NONSCALAR if (len != 1) break /* non-scalars hashed by address */
int len = length(e);
int type = TYPEOF(e);
h = HASH(type, h);
h = HASH(len, h);
switch(type) {
case LANGSXP:
case LISTSXP:
/**** safer to only follow while CDR is LANGSXP/LISTSXP */
for (; e != R_NilValue; e = CDR(e))
h = hashexpr1(CAR(e), h);
return h;
case LGLSXP:
SKIP_NONSCALAR;
for (int i = 0; i < len; i++) {
int ival = LOGICAL(e)[i];
h = HASH(ival, h);
}
return h;
case INTSXP:
SKIP_NONSCALAR;
for (int i = 0; i < len; i++) {
int ival = INTEGER(e)[i];
h = HASH(ival, h);
}
return h;
case REALSXP:
SKIP_NONSCALAR;
for (int i = 0; i < len; i++) {
double dval = REAL(e)[i];
h = HASH(dval, h);
}
return h;
case STRSXP:
SKIP_NONSCALAR;
for (int i = 0; i < len; i++) {
SEXP cval = STRING_ELT(e, i);
h = hash((unsigned char *) CHAR(cval), LENGTH(cval), h);
}
return h;
}
return HASH(e, h);
#undef SKIP_NONSCALAR
}
static R_INLINE SEXP getSrcref(SEXP srcrefs, int ind);
static R_exprhash_t hashsrcref(SEXP e, R_exprhash_t h)
{
if (TYPEOF(e) == INTSXP && LENGTH(e) >= 6) {
for(int i = 0; i < 6; i++) {
int ival = INTEGER(e)[i];
h = HASH(ival, h);
}
/* FIXME: update this when deep-comparison of srcref is available */
SEXP srcfile = getAttrib(e, R_SrcfileSymbol);
h = HASH(srcfile, h);
}
return h;
}
#undef HASH
static R_exprhash_t hashexpr(SEXP e)
{
return hashexpr1(e, 5381);
}
static R_exprhash_t hashfun(SEXP f)
{
R_exprhash_t h = hashexpr(BODY(f));
if (getAttrib(BODY(f), R_SrcrefSymbol) == R_NilValue)
h = hashsrcref(getAttrib(f, R_SrcrefSymbol), h);
return h;
}
static void loadCompilerNamespace(void)
{
SEXP fun, arg, expr;
PROTECT(fun = install("getNamespace"));
PROTECT(arg = mkString("compiler"));
PROTECT(expr = lang2(fun, arg));
eval(expr, R_GlobalEnv);
UNPROTECT(3);
}
static void checkCompilerOptions(int jitEnabled)
{
int old_visible = R_Visible;
SEXP packsym, funsym, call, fcall, arg;
packsym = install("compiler");
funsym = install("checkCompilerOptions");
PROTECT(arg = ScalarInteger(jitEnabled));
PROTECT(fcall = lang3(R_TripleColonSymbol, packsym, funsym));
PROTECT(call = lang2(fcall, arg));
eval(call, R_GlobalEnv);
UNPROTECT(3);
R_Visible = old_visible;
}
static SEXP R_IfSymbol = NULL;
static SEXP R_ForSymbol = NULL;
static SEXP R_WhileSymbol = NULL;
static SEXP R_RepeatSymbol = NULL;
#define JIT_CACHE_SIZE 1024
static SEXP JIT_cache = NULL;
static R_exprhash_t JIT_cache_hashes[JIT_CACHE_SIZE];
/**** allow MIN_JIT_SCORE, or both, to be changed by environment variables? */
static int MIN_JIT_SCORE = 50;
#define LOOP_JIT_SCORE MIN_JIT_SCORE
static struct { unsigned long count, envcount, bdcount; } jit_info = {0, 0, 0};
void attribute_hidden R_init_jit_enabled(void)
{
/* Need to force the lazy loading promise to avoid recursive
promise evaluation when JIT is enabled. Might be better to do
this in baseloader.R. */
eval(install(".ArgsEnv"), R_BaseEnv);
int val = 3; /* turn JIT on by default */
char *enable = getenv("R_ENABLE_JIT");
if (enable != NULL)
val = atoi(enable);
if (val) {
loadCompilerNamespace();
checkCompilerOptions(val);
}
R_jit_enabled = val;
if (R_compile_pkgs <= 0) {
char *compile = getenv("_R_COMPILE_PKGS_");
if (compile != NULL) {
int val = atoi(compile);
if (val > 0)
R_compile_pkgs = TRUE;
else
R_compile_pkgs = FALSE;
}
}
if (R_disable_bytecode <= 0) {
char *disable = getenv("R_DISABLE_BYTECODE");
if (disable != NULL) {
int val = atoi(disable);
if (val > 0)
R_disable_bytecode = TRUE;
else
R_disable_bytecode = FALSE;
}
}
/* -1 ... duplicate constants on LDCONST and PUSHCONSTARG, no checking
0 ... no checking (no duplication for >= 0) [DEFAULT]
1 ... check at error, session exit and reclamation
2 ... check also at full GC
3 ... check also at partial GC
4 ... check also at .Call
5 ... (very) verbose report on modified constants
*/
if (R_check_constants <= 1) {
char *check = getenv("R_CHECK_CONSTANTS");
if (check != NULL)
R_check_constants = atoi(check);
}
/* initialize JIT variables */
R_IfSymbol = install("if");
R_ForSymbol = install("for");
R_WhileSymbol = install("while");
R_RepeatSymbol = install("repeat");
R_PreserveObject(JIT_cache = allocVector(VECSXP, JIT_CACHE_SIZE));
}
static int JIT_score(SEXP e)
{
if (TYPEOF(e) == LANGSXP) {
SEXP fun = CAR(e);
if (fun == R_IfSymbol) {
int cons = JIT_score(CADR(e));
int alt = JIT_score(CADDR(e));
return cons > alt ? cons : alt;
}
else if (fun == R_ForSymbol ||
fun == R_WhileSymbol ||
fun == R_RepeatSymbol)