-
Notifications
You must be signed in to change notification settings - Fork 306
/
util.c
1949 lines (1726 loc) · 50.4 KB
/
util.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) 1995, 1996 Robert Gentleman and Ross Ihaka
* Copyright (C) 1997--2012 The R Core Team
*
* 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
* http://www.r-project.org/Licenses/
*/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#define R_USE_SIGNALS 1
#include <Defn.h>
#include <ctype.h> /* for isspace */
#undef COMPILING_R
#define imax2(x, y) ((x < y) ? y : x)
#include <Print.h>
#ifdef HAVE_UNISTD_H
#include <unistd.h>
#endif
#ifdef Win32
void R_UTF8fixslash(char *s);
static void R_wfixslash(wchar_t *s);
#endif
#ifdef __cplusplus
#include "Clinkage.h"
extern "C" {
#endif
void F77_SYMBOL(rwarnc)(char *msg, int *nchar);
void F77_SYMBOL(rexitc)(char *msg, int *nchar);
#ifdef __cplusplus
}
#endif
/* Many small functions are included from ../include/Rinlinedfuns.h */
Rboolean tsConform(SEXP x, SEXP y)
{
if ((x = getAttrib(x, R_TspSymbol)) != R_NilValue &&
(y = getAttrib(y, R_TspSymbol)) != R_NilValue) {
/* tspgets should enforce this, but prior to 2.4.0
had INTEGER() here */
if(TYPEOF(x) == REALSXP && TYPEOF(y) == REALSXP)
return REAL(x)[0] == REAL(x)[0] &&
REAL(x)[1] == REAL(x)[1] &&
REAL(x)[2] == REAL(x)[2];
/* else fall through */
}
return FALSE;
}
int nrows(SEXP s)
{
SEXP t;
if (isVector(s) || isList(s)) {
t = getAttrib(s, R_DimSymbol);
if (t == R_NilValue) return LENGTH(s);
return INTEGER(t)[0];
}
else if (isFrame(s)) {
return nrows(CAR(s));
}
else error(_("object is not a matrix"));
return -1;
}
int ncols(SEXP s)
{
SEXP t;
if (isVector(s) || isList(s)) {
t = getAttrib(s, R_DimSymbol);
if (t == R_NilValue) return 1;
if (LENGTH(t) >= 2) return INTEGER(t)[1];
/* This is a 1D (or possibly 0D array) */
return 1;
}
else if (isFrame(s)) {
return length(s);
}
else error(_("object is not a matrix"));
return -1;/*NOTREACHED*/
}
const static char type_msg[] = "invalid type passed to internal function\n";
void internalTypeCheck(SEXP call, SEXP s, SEXPTYPE type)
{
if (TYPEOF(s) != type) {
if (call)
errorcall(call, type_msg);
else
error(type_msg);
}
}
const static char * const truenames[] = {
"T",
"True",
"TRUE",
"true",
(char *) NULL,
};
const static char * const falsenames[] = {
"F",
"False",
"FALSE",
"false",
(char *) NULL,
};
SEXP asChar(SEXP x)
{
if (XLENGTH(x) >= 1) {
if (isVectorAtomic(x)) {
int w, d, e, wi, di, ei;
char buf[MAXELTSIZE]; /* probably 100 would suffice */
switch (TYPEOF(x)) {
case LGLSXP:
if (LOGICAL(x)[0] == NA_LOGICAL)
return NA_STRING;
if (LOGICAL(x)[0])
sprintf(buf, "T");
else
sprintf(buf, "F");
return mkChar(buf);
case INTSXP:
if (INTEGER(x)[0] == NA_INTEGER)
return NA_STRING;
sprintf(buf, "%d", INTEGER(x)[0]);
return mkChar(buf);
case REALSXP:
PrintDefaults();
formatReal(REAL(x), 1, &w, &d, &e, 0);
return mkChar(EncodeReal(REAL(x)[0], w, d, e, OutDec));
case CPLXSXP:
PrintDefaults();
formatComplex(COMPLEX(x), 1, &w, &d, &e, &wi, &di, &ei, 0);
return mkChar(EncodeComplex(COMPLEX(x)[0], w, d, e, wi, di, ei, OutDec));
case STRSXP:
return STRING_ELT(x, 0);
default:
return NA_STRING;
}
} else if(TYPEOF(x) == CHARSXP) {
return x;
} else if(TYPEOF(x) == SYMSXP)
return PRINTNAME(x);
}
return NA_STRING;
}
Rboolean isUnordered(SEXP s)
{
return (TYPEOF(s) == INTSXP
&& inherits(s, "factor")
&& !inherits(s, "ordered"));
}
Rboolean isOrdered(SEXP s)
{
return (TYPEOF(s) == INTSXP
&& inherits(s, "factor")
&& inherits(s, "ordered"));
}
const static struct {
const char * const str;
const int type;
}
TypeTable[] = {
{ "NULL", NILSXP }, /* real types */
{ "symbol", SYMSXP },
{ "pairlist", LISTSXP },
{ "closure", CLOSXP },
{ "environment", ENVSXP },
{ "promise", PROMSXP },
{ "language", LANGSXP },
{ "special", SPECIALSXP },
{ "builtin", BUILTINSXP },
{ "char", CHARSXP },
{ "logical", LGLSXP },
{ "integer", INTSXP },
{ "double", REALSXP }, /*- "real", for R <= 0.61.x */
{ "complex", CPLXSXP },
{ "character", STRSXP },
{ "...", DOTSXP },
{ "any", ANYSXP },
{ "expression", EXPRSXP },
{ "list", VECSXP },
{ "externalptr", EXTPTRSXP },
{ "bytecode", BCODESXP },
{ "weakref", WEAKREFSXP },
{ "raw", RAWSXP },
{ "S4", S4SXP },
/* aliases : */
{ "numeric", REALSXP },
{ "name", SYMSXP },
{ (char *)NULL, -1 }
};
SEXPTYPE str2type(const char *s)
{
int i;
for (i = 0; TypeTable[i].str; i++) {
if (!strcmp(s, TypeTable[i].str))
return (SEXPTYPE) TypeTable[i].type;
}
/* SEXPTYPE is an unsigned int, so the compiler warns us w/o the cast. */
return (SEXPTYPE) -1;
}
SEXP type2str(SEXPTYPE t)
{
int i;
for (i = 0; TypeTable[i].str; i++) {
if (TypeTable[i].type == t)
return mkChar(TypeTable[i].str);
}
error(_("type %d is unimplemented in '%s'"), t, "type2str");
return R_NilValue; /* for -Wall */
}
const char *type2char(SEXPTYPE t)
{
int i;
for (i = 0; TypeTable[i].str; i++) {
if (TypeTable[i].type == t)
return TypeTable[i].str;
}
error(_("type %d is unimplemented in '%s'"), t, "type2char");
return ""; /* for -Wall */
}
SEXP type2symbol(SEXPTYPE t)
{
int i;
/* for efficiency, a hash table set up to index TypeTable, and
with TypeTable pointing to both the
character string and to the symbol would be better */
for (i = 0; TypeTable[i].str; i++) {
if (TypeTable[i].type == t)
return install((const char *)&TypeTable[i].str);
}
error(_("type %d is unimplemented in '%s'"), t, "type2symbol");
return R_NilValue; /* for -Wall */
}
void UNIMPLEMENTED_TYPEt(const char *s, SEXPTYPE t)
{
int i;
for (i = 0; TypeTable[i].str; i++) {
if (TypeTable[i].type == t)
error(_("unimplemented type '%s' in '%s'\n"), TypeTable[i].str, s);
}
error(_("unimplemented type (%d) in '%s'\n"), t, s);
}
void UNIMPLEMENTED_TYPE(const char *s, SEXP x)
{
UNIMPLEMENTED_TYPEt(s, TYPEOF(x));
}
# include <R_ext/Riconv.h>
# include <sys/param.h>
# include <errno.h>
/* Previous versions of R (< 2.3.0) assumed wchar_t was in Unicode
(and it commonly is). These functions do not. */
# ifdef WORDS_BIGENDIAN
static const char UCS2ENC[] = "UCS-2BE";
# else
static const char UCS2ENC[] = "UCS-2LE";
# endif
/*
* out=NULL returns the number of the MBCS chars
*/
/* Note: this does not terminate out, as all current uses are to look
* at 'out' a wchar at a time, and sometimes just one char.
*/
size_t mbcsToUcs2(const char *in, ucs2_t *out, int nout, int enc)
{
void *cd = NULL ;
const char *i_buf;
char *o_buf;
size_t i_len, o_len, status, wc_len;
/* out length */
wc_len = (enc == CE_UTF8)? utf8towcs(NULL, in, 0) : mbstowcs(NULL, in, 0);
if (out == NULL || (int)wc_len < 0) return wc_len;
if ((void*)-1 == (cd = Riconv_open(UCS2ENC, (enc == CE_UTF8) ? "UTF-8": "")))
return (size_t) -1;
i_buf = (char *)in;
i_len = strlen(in); /* not including terminator */
o_buf = (char *)out;
o_len = ((size_t) nout) * sizeof(ucs2_t);
status = Riconv(cd, &i_buf, (size_t *)&i_len, &o_buf, (size_t *)&o_len);
int serrno = errno;
Riconv_close(cd);
if (status == (size_t)-1) {
switch(serrno){
case EINVAL:
return (size_t) -2;
case EILSEQ:
return (size_t) -1;
case E2BIG:
break;
default:
errno = EILSEQ;
return (size_t) -1;
}
}
return wc_len; /* status would be better? */
}
#include <wctype.h>
/* This one is not in Rinternals.h, but is used in internet module */
Rboolean isBlankString(const char *s)
{
if(mbcslocale) {
wchar_t wc; size_t used; mbstate_t mb_st;
mbs_init(&mb_st);
while( (used = Mbrtowc(&wc, s, MB_CUR_MAX, &mb_st)) ) {
if(!iswspace((wint_t) wc)) return FALSE;
s += used;
}
} else
while (*s)
if (!isspace((int)*s++)) return FALSE;
return TRUE;
}
Rboolean StringBlank(SEXP x)
{
if (x == R_NilValue) return TRUE;
else return CHAR(x)[0] == '\0';
}
/* Function to test whether a string is a true value */
Rboolean StringTrue(const char *name)
{
int i;
for (i = 0; truenames[i]; i++)
if (!strcmp(name, truenames[i]))
return TRUE;
return FALSE;
}
Rboolean StringFalse(const char *name)
{
int i;
for (i = 0; falsenames[i]; i++)
if (!strcmp(name, falsenames[i]))
return TRUE;
return FALSE;
}
/* used in bind.c and options.c */
SEXP attribute_hidden EnsureString(SEXP s)
{
switch(TYPEOF(s)) {
case SYMSXP:
s = PRINTNAME(s);
break;
case STRSXP:
s = STRING_ELT(s, 0);
break;
case CHARSXP:
break;
case NILSXP:
s = R_BlankString;
break;
default:
error(_("invalid tag in name extraction"));
}
return s;
}
/* used in modules */
void Rf_checkArityCall(SEXP op, SEXP args, SEXP call)
{
if (PRIMARITY(op) >= 0 && PRIMARITY(op) != length(args)) {
if (PRIMINTERNAL(op))
error(ngettext("%d argument passed to .Internal(%s) which requires %d",
"%d arguments passed to .Internal(%s) which requires %d",
(unsigned long) length(args)),
length(args), PRIMNAME(op), PRIMARITY(op));
else
errorcall(call,
ngettext("%d argument passed to '%s' which requires %d",
"%d arguments passed to '%s' which requires %d",
(unsigned long) length(args)),
length(args), PRIMNAME(op), PRIMARITY(op));
}
}
void attribute_hidden Rf_check1arg(SEXP arg, SEXP call, const char *formal)
{
SEXP tag = TAG(arg);
const char *supplied;
size_t ns;
if (tag == R_NilValue) return;
supplied = CHAR(PRINTNAME(tag)); ns = strlen(supplied);
if (ns > strlen(formal) || strncmp(supplied, formal, ns))
errorcall(call, _("supplied argument name '%s' does not match '%s'"),
supplied, formal);
}
SEXP nthcdr(SEXP s, int n)
{
if (isList(s) || isLanguage(s) || isFrame(s) || TYPEOF(s) == DOTSXP ) {
while( n-- > 0 ) {
if (s == R_NilValue)
error(_("'nthcdr' list shorter than %d"), n);
s = CDR(s);
}
return s;
}
else error(_("'nthcdr' needs a list to CDR down"));
return R_NilValue;/* for -Wall */
}
/* This is a primitive (with no arguments) */
SEXP attribute_hidden do_nargs(SEXP call, SEXP op, SEXP args, SEXP rho)
{
RCNTXT *cptr;
int nargs = NA_INTEGER;
checkArity(op, args);
for (cptr = R_GlobalContext; cptr != NULL; cptr = cptr->nextcontext) {
if ((cptr->callflag & CTXT_FUNCTION) && cptr->cloenv == rho) {
nargs = length(cptr->promargs);
break;
}
}
return ScalarInteger(nargs);
}
/* formerly used in subscript.c, in Utils.h */
void attribute_hidden setIVector(int * vec, int len, int val)
{
for (int i = 0; i < len; i++) vec[i] = val;
}
/* unused in R, in Utils.h, apparently used in Rcpp */
void attribute_hidden setRVector(double * vec, int len, double val)
{
for (int i = 0; i < len; i++) vec[i] = val;
}
/* unused in R, in Rinternals.h */
void setSVector(SEXP * vec, int len, SEXP val)
{
for (int i = 0; i < len; i++) vec[i] = val;
}
Rboolean isFree(SEXP val)
{
SEXP t;
for (t = R_FreeSEXP; t != R_NilValue; t = CAR(t))
if (val == t)
return TRUE;
return FALSE;
}
/* Debugging functions (hence the d-prefix). */
/* These are intended to be called interactively from */
/* a debugger such as gdb, so you don't have to remember */
/* the names of the data structure components. */
int dtype(SEXP q)
{
return((int)TYPEOF(q));
}
SEXP dcar(SEXP l)
{
return(CAR(l));
}
SEXP dcdr(SEXP l)
{
return(CDR(l));
}
static void isort_with_index(int *x, int *indx, int n)
{
int i, j, h, iv, v;
for (h = 1; h <= n / 9; h = 3 * h + 1);
for (; h > 0; h /= 3)
for (i = h; i < n; i++) {
v = x[i]; iv = indx[i];
j = i;
while (j >= h && x[j - h] > v)
{ x[j] = x[j - h]; indx[j] = indx[j-h]; j -= h; }
x[j] = v; indx[j] = iv;
}
}
/* merge(xinds, yinds, all.x, all.y) */
/* xinds, yinds are along x and y rows matching into the (numeric)
common indices, with 0 for non-matches.
all.x and all.y are boolean.
The return value is a list with 4 elements (xi, yi, x.alone, y.alone),
which are index vectors for rows of x or y.
*/
SEXP attribute_hidden do_merge(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP xi, yi, ansx, ansy, ans, x_lone, y_lone;
int nx = 0, ny = 0, i, j, k, nans = 0, nx_lone = 0, ny_lone = 0;
int all_x = 0, all_y = 0, ll = 0/* "= 0" : for -Wall */;
int *ix, *iy, tmp, nnx, nny, i0, j0;
const char *nms[] = {"xi", "yi", "x.alone", "y.alone", ""};
checkArity(op, args);
xi = CAR(args);
if ( !isInteger(xi) || !(nx = LENGTH(xi)) )
error(_("invalid '%s' argument"), "xinds");
yi = CADR(args);
if ( !isInteger(yi) || !(ny = LENGTH(yi)) )
error(_("invalid '%s' argument"), "yinds");
if(!LENGTH(ans = CADDR(args)) || NA_LOGICAL == (all_x = asLogical(ans)))
error(_("'all.x' must be TRUE or FALSE"));
if(!LENGTH(ans = CADDDR(args))|| NA_LOGICAL == (all_y = asLogical(ans)))
error(_("'all.y' must be TRUE or FALSE"));
/* 0. sort the indices */
ix = (int *) R_alloc((size_t) nx, sizeof(int));
iy = (int *) R_alloc((size_t) ny, sizeof(int));
for(i = 0; i < nx; i++) ix[i] = i+1;
for(i = 0; i < ny; i++) iy[i] = i+1;
isort_with_index(INTEGER(xi), ix, nx);
isort_with_index(INTEGER(yi), iy, ny);
/* 1. determine result sizes */
for (i = 0; i < nx; i++) if (INTEGER(xi)[i] > 0) break; nx_lone = i;
for (i = 0; i < ny; i++) if (INTEGER(yi)[i] > 0) break; ny_lone = i;
for (i = nx_lone, j = ny_lone; i < nx; i = nnx, j = nny) {
tmp = INTEGER(xi)[i];
for(nnx = i; nnx < nx; nnx++) if(INTEGER(xi)[nnx] != tmp) break;
/* the next is not in theory necessary,
since we have the common values only */
for(; j < ny; j++) if(INTEGER(yi)[j] >= tmp) break;
for(nny = j; nny < ny; nny++) if(INTEGER(yi)[nny] != tmp) break;
/* printf("i %d nnx %d j %d nny %d\n", i, nnx, j, nny); */
nans += (nnx-i)*(nny-j);
}
/* 2. allocate and store result components */
PROTECT(ans = mkNamed(VECSXP, nms));
ansx = allocVector(INTSXP, nans); SET_VECTOR_ELT(ans, 0, ansx);
ansy = allocVector(INTSXP, nans); SET_VECTOR_ELT(ans, 1, ansy);
if(all_x) {
x_lone = allocVector(INTSXP, nx_lone);
SET_VECTOR_ELT(ans, 2, x_lone);
for (i = 0, ll = 0; i < nx_lone; i++)
INTEGER(x_lone)[ll++] = ix[i];
}
if(all_y) {
y_lone = allocVector(INTSXP, ny_lone);
SET_VECTOR_ELT(ans, 3, y_lone);
for (i = 0, ll = 0; i < ny_lone; i++)
INTEGER(y_lone)[ll++] = iy[i];
}
for (i = nx_lone, j = ny_lone, k = 0; i < nx; i = nnx, j = nny) {
tmp = INTEGER(xi)[i];
for(nnx = i; nnx < nx; nnx++) if(INTEGER(xi)[nnx] != tmp) break;
for(; j < ny; j++) if(INTEGER(yi)[j] >= tmp) break;
for(nny = j; nny < ny; nny++) if(INTEGER(yi)[nny] != tmp) break;
for(i0 = i; i0 < nnx; i0++)
for(j0 = j; j0 < nny; j0++) {
INTEGER(ansx)[k] = ix[i0];
INTEGER(ansy)[k++] = iy[j0];
}
}
UNPROTECT(1);
return ans;
}
/* Functions for getting and setting the working directory. */
#ifdef Win32
# define WIN32_LEAN_AND_MEAN 1
# include <windows.h>
#endif
SEXP static intern_getwd(void)
{
SEXP rval = R_NilValue;
char buf[PATH_MAX+1];
#ifdef Win32
{
wchar_t wbuf[PATH_MAX+1];
int res = GetCurrentDirectoryW(PATH_MAX, wbuf);
if(res > 0) {
wcstoutf8(buf, wbuf, PATH_MAX+1);
R_UTF8fixslash(buf);
PROTECT(rval = allocVector(STRSXP, 1));
SET_STRING_ELT(rval, 0, mkCharCE(buf, CE_UTF8));
UNPROTECT(1);
}
}
#else
char *res = getcwd(buf, PATH_MAX); /* can return NULL */
if(res) rval = mkString(buf);
#endif
return(rval);
}
SEXP attribute_hidden do_getwd(SEXP call, SEXP op, SEXP args, SEXP rho)
{
checkArity(op, args);
return(intern_getwd());
}
#if defined(Win32) && defined(_MSC_VER)
# include <direct.h> /* for chdir, via io.h */
#endif
SEXP attribute_hidden do_setwd(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP s = R_NilValue, wd = R_NilValue; /* -Wall */
checkArity(op, args);
if (!isPairList(args) || !isValidString(s = CAR(args)))
error(_("character argument expected"));
if (STRING_ELT(s, 0) == NA_STRING)
error(_("missing value is invalid"));
/* get current directory to return */
wd = intern_getwd();
#ifdef Win32
{
const wchar_t *path = filenameToWchar(STRING_ELT(s, 0), TRUE);
if(_wchdir(path) < 0)
error(_("cannot change working directory"));
}
#else
{
const char *path
= R_ExpandFileName(translateChar(STRING_ELT(s, 0)));
if(chdir(path) < 0)
error(_("cannot change working directory"));
}
#endif
return(wd);
}
/* remove portion of path before file separator if one exists */
#ifdef Win32
SEXP attribute_hidden do_basename(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP ans, s = R_NilValue; /* -Wall */
char sp[PATH_MAX];
wchar_t buf[PATH_MAX], *p;
const wchar_t *pp;
int i, n;
checkArity(op, args);
if (TYPEOF(s = CAR(args)) != STRSXP)
error(_("a character vector argument expected"));
PROTECT(ans = allocVector(STRSXP, n = LENGTH(s)));
for(i = 0; i < n; i++) {
if (STRING_ELT(s, i) == NA_STRING)
SET_STRING_ELT(ans, i, NA_STRING);
else {
pp = filenameToWchar(STRING_ELT(s, i), TRUE);
if (wcslen(pp) > PATH_MAX - 1) error(_("path too long"));
wcscpy(buf, pp);
R_wfixslash(buf);
/* remove trailing file separator(s) */
if (*buf) {
p = buf + wcslen(buf) - 1;
while (p >= buf && *p == L'/') *(p--) = L'\0';
}
if ((p = wcsrchr(buf, L'/'))) p++; else p = buf;
memset(sp, 0, PATH_MAX); /* safety */
wcstoutf8(sp, p, 4*wcslen(p) + 1);
SET_STRING_ELT(ans, i, mkCharCE(sp, CE_UTF8));
}
}
UNPROTECT(1);
return(ans);
}
#else
SEXP attribute_hidden do_basename(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP ans, s = R_NilValue; /* -Wall */
char buf[PATH_MAX], *p, fsp = FILESEP[0];
const char *pp;
int i, n;
checkArity(op, args);
if (TYPEOF(s = CAR(args)) != STRSXP)
error(_("a character vector argument expected"));
PROTECT(ans = allocVector(STRSXP, n = LENGTH(s)));
for(i = 0; i < n; i++) {
if (STRING_ELT(s, i) == NA_STRING)
SET_STRING_ELT(ans, i, NA_STRING);
else {
pp = R_ExpandFileName(translateChar(STRING_ELT(s, i)));
if (strlen(pp) > PATH_MAX - 1)
error(_("path too long"));
strcpy (buf, pp);
if (*buf) {
p = buf + strlen(buf) - 1;
while (p >= buf && *p == fsp) *(p--) = '\0';
}
if ((p = Rf_strrchr(buf, fsp)))
p++;
else
p = buf;
SET_STRING_ELT(ans, i, mkChar(p));
}
}
UNPROTECT(1);
return(ans);
}
#endif
/* remove portion of path after last file separator if one exists, else
return "."
*/
#ifdef Win32
SEXP attribute_hidden do_dirname(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP ans, s = R_NilValue; /* -Wall */
wchar_t buf[PATH_MAX], *p;
const wchar_t *pp;
char sp[PATH_MAX];
int i, n;
checkArity(op, args);
if (TYPEOF(s = CAR(args)) != STRSXP)
error(_("a character vector argument expected"));
PROTECT(ans = allocVector(STRSXP, n = LENGTH(s)));
for(i = 0; i < n; i++) {
if (STRING_ELT(s, i) == NA_STRING)
SET_STRING_ELT(ans, i, NA_STRING);
else {
pp = filenameToWchar(STRING_ELT(s, i), TRUE);
if (wcslen(pp) > PATH_MAX - 1)
error(_("path too long"));
wcscpy (buf, pp);
R_wfixslash(buf);
/* remove trailing file separator(s) */
while ( *(p = buf + wcslen(buf) - 1) == L'/' && p > buf
&& (p > buf+2 || *(p-1) != L':')) *p = L'\0';
p = wcsrchr(buf, L'/');
if(p == NULL) wcscpy(buf, L".");
else {
while(p > buf && *p == L'/'
/* this covers both drives and network shares */
&& (p > buf+2 || *(p-1) != L':')) --p;
p[1] = L'\0';
}
memset(sp, 0, PATH_MAX);
wcstoutf8(sp, buf, 4*wcslen(buf)+1);
SET_STRING_ELT(ans, i, mkCharCE(sp, CE_UTF8));
}
}
UNPROTECT(1);
return(ans);
}
#else
SEXP attribute_hidden do_dirname(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP ans, s = R_NilValue; /* -Wall */
char buf[PATH_MAX], *p, fsp = FILESEP[0];
const char *pp;
int i, n;
checkArity(op, args);
if (TYPEOF(s = CAR(args)) != STRSXP)
error(_("a character vector argument expected"));
PROTECT(ans = allocVector(STRSXP, n = LENGTH(s)));
for(i = 0; i < n; i++) {
if (STRING_ELT(s, i) == NA_STRING)
SET_STRING_ELT(ans, i, NA_STRING);
else {
pp = R_ExpandFileName(translateChar(STRING_ELT(s, i)));
if (strlen(pp) > PATH_MAX - 1)
error(_("path too long"));
strcpy (buf, pp);
/* remove trailing file separator(s) */
while ( *(p = buf + strlen(buf) - 1) == fsp && p > buf) *p = '\0';
p = Rf_strrchr(buf, fsp);
if(p == NULL)
strcpy(buf, ".");
else {
while(p > buf && *p == fsp) --p;
p[1] = '\0';
}
SET_STRING_ELT(ans, i, mkChar(buf));
}
}
UNPROTECT(1);
return(ans);
}
#endif
#ifndef Win32 /* Windows version is in src/gnuwin32/extra.c */
#ifndef HAVE_DECL_REALPATH
extern char *realpath(const char *path, char *resolved_path);
#endif
SEXP attribute_hidden do_normalizepath(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP ans, paths = CAR(args);
int i, n = LENGTH(paths);
const char *path;
char abspath[PATH_MAX+1];
checkArity(op, args);
if (!isString(paths))
error(_("'path' must be a character vector"));
int mustWork = asLogical(CADDR(args)); /* 1, NA_LOGICAL or 0 */
/* Does any platform not have this? */
#ifdef HAVE_REALPATH
PROTECT(ans = allocVector(STRSXP, n));
for (i = 0; i < n; i++) {
path = translateChar(STRING_ELT(paths, i));
char *res = realpath(path, abspath);
if (res)
SET_STRING_ELT(ans, i, mkChar(abspath));
else {
SET_STRING_ELT(ans, i, STRING_ELT(paths, i));
/* and report the problem */
if (mustWork == 1)
error("path[%d]=\"%s\": %s", i+1, path, strerror(errno));
else if (mustWork == NA_LOGICAL)
warning("path[%d]=\"%s\": %s", i+1, path, strerror(errno));
}
}
#else
Rboolean OK;
warning("this platform does not have realpath so the results may not be canonical");
PROTECT(ans = allocVector(STRSXP, n));
for (i = 0; i < n; i++) {
path = translateChar(STRING_ELT(paths, i));
OK = strlen(path) <= PATH_MAX;
if (OK) {
if (path[0] == '/') strncpy(abspath, path, PATH_MAX);
else {
OK = getcwd(abspath, PATH_MAX) != NULL;
OK = OK && (strlen(path) + strlen(abspath) + 1 <= PATH_MAX);
if (OK) {strcat(abspath, "/"); strcat(abspath, path);}
}
}
/* we need to check that this exists */
if (OK) OK = (access(abspath, 0 /* F_OK */) == 0);
if (OK) SET_STRING_ELT(ans, i, mkChar(abspath));
else {
SET_STRING_ELT(ans, i, STRING_ELT(paths, i));
/* and report the problem */
if (mustWork == 1)
error("path[%d]=\"%s\": %s", i+1, path, strerror(errno));
else if (mustWork == NA_LOGICAL)
warning("path[%d]=\"%s\": %s", i+1, path, strerror(errno));
}
}
#endif
UNPROTECT(1);
return ans;
}
#endif
/* encodeString(x, w, quote, justify) */
SEXP attribute_hidden do_encodeString(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP ans, x, s;
R_xlen_t i, len;
int w, quote = 0, justify, na;
const char *cs;
Rboolean findWidth;
checkArity(op, args);
if (TYPEOF(x = CAR(args)) != STRSXP)
error(_("a character vector argument expected"));
if(isNull(CADR(args))) w = NA_INTEGER;
else {
w = asInteger(CADR(args));
if(w != NA_INTEGER && w < 0)
error(_("invalid '%s' value"), "width");
}
findWidth = (w == NA_INTEGER);
s = CADDR(args);
if(LENGTH(s) != 1 || TYPEOF(s) != STRSXP)
error(_("invalid '%s' value"), "quote");
cs = translateChar(STRING_ELT(s, 0));
if(strlen(cs) > 0) quote = cs[0];
if(strlen(cs) > 1)
warning(_("only the first character of 'quote' will be used"));
justify = asInteger(CADDDR(args));
if(justify == NA_INTEGER || justify < 0 || justify > 3)
error(_("invalid '%s' value"), "justify");
if(justify == 3) w = 0;
na = asLogical(CAD4R(args));
if(na == NA_LOGICAL) error(_("invalid '%s' value"), "na.encode");
len = XLENGTH(x);
if(findWidth && justify < 3) {
w = 0;
for(i = 0; i < len; i++) {
s = STRING_ELT(x, i);
if(na || s != NA_STRING)
w = imax2(w, Rstrlen(s, quote));
}
if(quote) w +=2; /* for surrounding quotes */
}
PROTECT(ans = duplicate(x));
for(i = 0; i < len; i++) {
s = STRING_ELT(x, i);
if(na || s != NA_STRING)
SET_STRING_ELT(ans, i, mkChar(EncodeString(s, w, quote, (Rprt_adj) justify)));
}
UNPROTECT(1);
return ans;
}
SEXP attribute_hidden do_encoding(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP ans, x;
R_xlen_t i, n;
char *tmp;
checkArity(op, args);
if (TYPEOF(x = CAR(args)) != STRSXP)
error(_("a character vector argument expected"));
n = XLENGTH(x);
PROTECT(ans = allocVector(STRSXP, n));
for (i = 0; i < n; i++) {
if(IS_BYTES(STRING_ELT(x, i))) tmp = "bytes";