void ENCONCAT(stack& s) {
SWAPD(s);
CONS(s);
CONCAT(s);
}
elem XmlRpc_DecodeValue(elem val)
{
elem t, x;
char *s, *s2;
int i, j;
char buf[5];
if(ELEM_STRINGP(val))return(val);
if(CAR(val)==SYM("i4"))
{
s=ELEM_TOSTRING(CADDR(val));
t=FIXNUM(atoi(s));
return(t);
}
if(CAR(val)==SYM("int"))
{
s=ELEM_TOSTRING(CADDR(val));
t=FIXNUM(atoi(s));
return(t);
}
if(CAR(val)==SYM("boolean"))
{
s=ELEM_TOSTRING(CADDR(val));
i=atoi(s);
t=MISC_TRUE;
if(!i)t=MISC_FALSE;
return(t);
}
if(CAR(val)==SYM("string"))
{
t=CADDR(val);
return(t);
}
if(CAR(val)==SYM("double"))
{
s=ELEM_TOSTRING(CADDR(val));
t=FLONUM(atof(s));
return(t);
}
if(CAR(val)==SYM("dateTime.iso8601"))
{
s=ELEM_TOSTRING(CADDR(val));
x=MISC_EOL;
memset(buf, 0, 5);
strncpy(buf, s, 4);
t=FIXNUM(atoi(buf));
x=CONS(t, x);
memset(buf, 0, 5);
strncpy(buf, s+4, 2);
t=FIXNUM(atoi(buf));
x=CONS(t, x);
strncpy(buf, s+6, 2);
t=FIXNUM(atoi(buf));
x=CONS(t, x);
strncpy(buf, s+9, 2);
t=FIXNUM(atoi(buf));
x=CONS(t, x);
strncpy(buf, s+12, 2);
t=FIXNUM(atoi(buf));
x=CONS(t, x);
strncpy(buf, s+15, 2);
t=FIXNUM(atoi(buf));
x=CONS(t, x);
x=TyFcn_NReverse(x);
x=CONS(SYM("date-time:"), x);
return(x);
}
if(CAR(val)==SYM("base64"))
{
s=ELEM_TOSTRING(CADDR(val));
i=strlen(s);
j=(i*3)/4;
t=VECTOR_NEWT(j, VECTOR_U8);
s2=TyFcn_ByteVectorBody(t);
kprint("recv mime %d->%d\n", i, j);
HttpNode_DecodeMime(s2, s, i);
return(t);
}
if(CAR(val)==SYM("struct"))
{
t=XmlRpc_DecodeStruct(val);
return(t);
}
if(CAR(val)==SYM("array"))
{
t=XmlRpc_DecodeArray(val);
return(t);
}
}
/**
* Creates a stretchy-list dotted pair
*/
SEXP NewList(void) {
SEXP s = CONS(R_NilValue, R_NilValue);
SETCAR(s, s);
return s;
}
static void
continuation_stack_push(ScmObj cont)
{
l_continuation_stack = CONS(cont, l_continuation_stack);
}
elem XmlRpc_EncodeValue(elem val)
{
char buf[256];
int i;
double x;
elem t;
char *s, *s2;
if(ELEM_STRINGP(val))
{
t=val;
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("string"), t);
return(t);
}
if(ELEM_FIXNUMP(val))
{
i=TOINT(val);
sprintf(buf, "%d", i);
t=STRING(buf);
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("i4"), t);
return(t);
}
if(ELEM_FLONUMP(val))
{
x=TOFLOAT(val);
sprintf(buf, "%g", x);
t=STRING(buf);
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("double"), t);
return(t);
}
if(ELEM_CONSP(val))
{
if(CAR(val)==SYM("date-time:"))
{
t=XmlRpc_EncodeDate(val);
return(t);
}
t=XmlRpc_EncodeArray(val);
return(t);
}
if(ELEM_ENVOBJP(val))
{
t=XmlRpc_EncodeStruct(val);
return(t);
}
if(ELEM_BYTEVECTORP(val))
{
s=TyFcn_ByteVectorBody(val);
i=VECTOR_LEN(val);
s2=kalloc(((i*4)/3)+5);
HttpNode_EncodeMime(s2, s, i);
kprint("send mime %d->%d\n", i, (i*4)/3);
t=STRING(s2);
kfree(s2);
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("base64"), t);
return(t);
}
if(val==MISC_TRUE)
{
t=STRING("1");
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("boolean"), t);
return(t);
}
if(val==MISC_FALSE)
{
t=STRING("0");
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("boolean"), t);
return(t);
}
if(val==MISC_NULL)
{
t=STRING("$null");
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("boolean"), t);
return(t);
}
t=STRING("$undefined");
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("string"), t);
return(t);
}
BIF_RETTYPE lists_reverse_2(BIF_ALIST_2)
{
Eterm list;
Eterm tmp_list;
Eterm result;
Eterm* hp;
Uint n;
int max_iter;
/*
* Handle legal and illegal non-lists quickly.
*/
if (is_nil(BIF_ARG_1)) {
BIF_RET(BIF_ARG_2);
} else if (is_not_list(BIF_ARG_1)) {
error:
BIF_ERROR(BIF_P, BADARG);
}
/*
* First use the rest of the remaning heap space.
*/
list = BIF_ARG_1;
result = BIF_ARG_2;
hp = HEAP_TOP(BIF_P);
n = HeapWordsLeft(BIF_P) / 2;
while (n != 0 && is_list(list)) {
Eterm* pair = list_val(list);
result = CONS(hp, CAR(pair), result);
list = CDR(pair);
hp += 2;
n--;
}
HEAP_TOP(BIF_P) = hp;
if (is_nil(list)) {
BIF_RET(result);
}
/*
* Calculate length of remaining list (up to a suitable limit).
*/
max_iter = CONTEXT_REDS * 40;
n = 0;
tmp_list = list;
while (max_iter-- > 0 && is_list(tmp_list)) {
tmp_list = CDR(list_val(tmp_list));
n++;
}
if (is_not_nil(tmp_list) && is_not_list(tmp_list)) {
goto error;
}
/*
* Now do one HAlloc() and continue reversing.
*/
hp = HAlloc(BIF_P, 2*n);
while (n != 0 && is_list(list)) {
Eterm* pair = list_val(list);
result = CONS(hp, CAR(pair), result);
list = CDR(pair);
hp += 2;
n--;
}
if (is_nil(list)) {
BIF_RET(result);
} else {
BUMP_ALL_REDS(BIF_P);
BIF_TRAP2(bif_export[BIF_lists_reverse_2], BIF_P, list, result);
}
}
static Eterm do_chksum(ChksumFun sumfun, Process *p, Eterm ioterm, int left,
void *sum, int *res, int *err)
{
Eterm *objp;
Eterm obj;
int c;
DECLARE_ESTACK(stack);
unsigned char *bytes = NULL;
int numbytes = 0;
*err = 0;
if (left <= 0 || is_nil(ioterm)) {
DESTROY_ESTACK(stack);
*res = 0;
return ioterm;
}
if(is_binary(ioterm)) {
Uint bitoffs;
Uint bitsize;
Uint size;
Eterm res_term = NIL;
unsigned char *bytes;
byte *temp_alloc = NULL;
ERTS_GET_BINARY_BYTES(ioterm, bytes, bitoffs, bitsize);
if (bitsize != 0) {
*res = 0;
*err = 1;
DESTROY_ESTACK(stack);
return NIL;
}
if (bitoffs != 0) {
bytes = erts_get_aligned_binary_bytes(ioterm, &temp_alloc);
/* The call to erts_get_aligned_binary_bytes cannot fail as
we'we already checked bitsize and that this is a binary */
}
size = binary_size(ioterm);
if (size > left) {
Eterm *hp;
ErlSubBin *sb;
Eterm orig;
Uint offset;
/* Split the binary in two parts, of which we
only process the first */
hp = HAlloc(p, ERL_SUB_BIN_SIZE);
sb = (ErlSubBin *) hp;
ERTS_GET_REAL_BIN(ioterm, orig, offset, bitoffs, bitsize);
sb->thing_word = HEADER_SUB_BIN;
sb->size = size - left;
sb->offs = offset + left;
sb->orig = orig;
sb->bitoffs = bitoffs;
sb->bitsize = bitsize;
sb->is_writable = 0;
res_term = make_binary(sb);
size = left;
}
(*sumfun)(sum, bytes, size);
*res = size;
DESTROY_ESTACK(stack);
erts_free_aligned_binary_bytes(temp_alloc);
return res_term;
}
if (!is_list(ioterm)) {
*res = 0;
*err = 1;
DESTROY_ESTACK(stack);
return NIL;
}
/* OK a list, needs to be processed in order, handling each flat list-level
as they occur, just like io_list_to_binary would */
*res = 0;
ESTACK_PUSH(stack,ioterm);
while (!ESTACK_ISEMPTY(stack) && left) {
ioterm = ESTACK_POP(stack);
if (is_nil(ioterm)) {
/* ignore empty lists */
continue;
}
if(is_list(ioterm)) {
L_Again: /* Restart with sublist, old listend was pushed on stack */
objp = list_val(ioterm);
obj = CAR(objp);
for(;;) { /* loop over one flat list of bytes and binaries
until sublist or list end is encountered */
if (is_byte(obj)) {
int bsize = 0;
for(;;) {
if (bsize >= numbytes) {
if (!bytes) {
bytes = erts_alloc(ERTS_ALC_T_TMP,
numbytes = 500);
} else {
if (numbytes > left) {
numbytes += left;
} else {
numbytes *= 2;
}
bytes = erts_realloc(ERTS_ALC_T_TMP, bytes,
numbytes);
}
}
bytes[bsize++] = (unsigned char) unsigned_val(obj);
--left;
ioterm = CDR(objp);
if (!is_list(ioterm)) {
break;
}
objp = list_val(ioterm);
obj = CAR(objp);
if (!is_byte(obj))
break;
if (!left) {
break;
}
}
(*sumfun)(sum, bytes, bsize);
*res += bsize;
} else if (is_nil(obj)) {
ioterm = CDR(objp);
if (!is_list(ioterm)) {
break;
}
objp = list_val(ioterm);
obj = CAR(objp);
} else if (is_list(obj)) {
/* push rest of list for later processing, start
again with sublist */
ESTACK_PUSH(stack,CDR(objp));
ioterm = obj;
goto L_Again;
} else if (is_binary(obj)) {
int sres, serr;
Eterm rest_term;
rest_term = do_chksum(sumfun, p, obj, left, sum, &sres,
&serr);
*res += sres;
if (serr != 0) {
*err = 1;
DESTROY_ESTACK(stack);
if (bytes != NULL)
erts_free(ERTS_ALC_T_TMP, bytes);
return NIL;
}
left -= sres;
if (rest_term != NIL) {
Eterm *hp;
hp = HAlloc(p, 2);
obj = CDR(objp);
ioterm = CONS(hp, rest_term, obj);
left = 0;
break;
}
ioterm = CDR(objp);
if (is_list(ioterm)) {
/* objp and obj need to be updated if
loop is to continue */
objp = list_val(ioterm);
obj = CAR(objp);
}
} else {
*err = 1;
DESTROY_ESTACK(stack);
if (bytes != NULL)
erts_free(ERTS_ALC_T_TMP, bytes);
return NIL;
}
if (!left || is_nil(ioterm) || !is_list(ioterm)) {
break;
}
} /* for(;;) */
} /* is_list(ioterm) */
if (!left) {
#ifdef ALLOW_BYTE_TAIL
if (is_byte(ioterm)) {
/* inproper list with byte tail*/
Eterm *hp;
hp = HAlloc(p, 2);
ioterm = CONS(hp, ioterm, NIL);
}
#else
;
#endif
} else if (!is_list(ioterm) && !is_nil(ioterm)) {
/* inproper list end */
#ifdef ALLOW_BYTE_TAIL
if (is_byte(ioterm)) {
unsigned char b[1];
b[0] = (unsigned char) unsigned_val(ioterm);
(*sumfun)(sum, b, 1);
++(*res);
--left;
ioterm = NIL;
} else
#endif
if is_binary(ioterm) {
int sres, serr;
ioterm = do_chksum(sumfun, p, ioterm, left, sum, &sres, &serr);
*res +=sres;
if (serr != 0) {
*err = 1;
DESTROY_ESTACK(stack);
if (bytes != NULL)
erts_free(ERTS_ALC_T_TMP, bytes);
return NIL;
}
left -= sres;
} else {
*err = 1;
DESTROY_ESTACK(stack);
if (bytes != NULL)
erts_free(ERTS_ALC_T_TMP, bytes);
return NIL;
}
}
} /* while left and not estack empty */
static byte* convert_environment(Process* p, Eterm env)
{
Eterm all;
Eterm* temp_heap;
Eterm* hp;
Uint heap_size;
int n;
Sint size;
byte* bytes;
int encoding = erts_get_native_filename_encoding();
if ((n = list_length(env)) < 0) {
return NULL;
}
heap_size = 2*(5*n+1);
temp_heap = hp = (Eterm *) erts_alloc(ERTS_ALC_T_TMP, heap_size*sizeof(Eterm));
bytes = NULL; /* Indicating error */
/*
* All errors below are handled by jumping to 'done', to ensure that the memory
* gets deallocated. Do NOT return directly from this function.
*/
all = CONS(hp, make_small(0), NIL);
hp += 2;
while(is_list(env)) {
Eterm tmp;
Eterm* tp;
tmp = CAR(list_val(env));
if (is_not_tuple_arity(tmp, 2)) {
goto done;
}
tp = tuple_val(tmp);
tmp = CONS(hp, make_small(0), NIL);
hp += 2;
if (tp[2] != am_false) {
tmp = CONS(hp, tp[2], tmp);
hp += 2;
}
tmp = CONS(hp, make_small('='), tmp);
hp += 2;
tmp = CONS(hp, tp[1], tmp);
hp += 2;
all = CONS(hp, tmp, all);
hp += 2;
env = CDR(list_val(env));
}
if (is_not_nil(env)) {
goto done;
}
if ((size = erts_native_filename_need(all,encoding)) < 0) {
goto done;
}
/*
* Put the result in a binary (no risk for a memory leak that way).
*/
(void) erts_new_heap_binary(p, NULL, size, &bytes);
erts_native_filename_put(all,encoding,bytes);
done:
erts_free(ERTS_ALC_T_TMP, temp_heap);
return bytes;
}
SEXP attribute_hidden do_system(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP tlist = R_NilValue;
int intern = 0;
checkArity(op, args);
if (!isValidStringF(CAR(args)))
error(_("non-empty character argument expected"));
intern = asLogical(CADR(args));
if (intern == NA_INTEGER)
error(_("'intern' must be logical and not NA"));
if (intern) { /* intern = TRUE */
FILE *fp;
char *x = "r", buf[INTERN_BUFSIZE];
const char *cmd;
int i, j, res;
SEXP tchar, rval;
PROTECT(tlist);
cmd = translateChar(STRING_ELT(CAR(args), 0));
errno = 0; /* precaution */
if(!(fp = R_popen(cmd, x)))
error(_("cannot popen '%s', probable reason '%s'"),
cmd, strerror(errno));
for (i = 0; fgets(buf, INTERN_BUFSIZE, fp); i++) {
int read = strlen(buf);
if(read >= INTERN_BUFSIZE - 1)
warning(_("line %d may be truncated in call to system(, intern = TRUE)"), i + 1);
if (read > 0 && buf[read-1] == '\n')
buf[read - 1] = '\0'; /* chop final CR */
tchar = mkChar(buf);
UNPROTECT(1);
PROTECT(tlist = CONS(tchar, tlist));
}
res = pclose(fp);
#ifdef HAVE_SYS_WAIT_H
if (WIFEXITED(res)) res = WEXITSTATUS(res);
else res = 0;
#else
/* assume that this is shifted if a multiple of 256 */
if ((res % 256) == 0) res = res/256;
#endif
if ((res & 0xff) == 127) {/* 127, aka -1 */
if (errno)
error(_("error in running command: '%s'"), strerror(errno));
else
error(_("error in running command"));
} else if (res) {
if (errno)
warningcall(R_NilValue,
_("running command '%s' had status %d and error message '%s'"),
cmd, res,
strerror(errno));
else
warningcall(R_NilValue,
_("running command '%s' had status %d"),
cmd, res);
}
rval = allocVector(STRSXP, i);
for (j = (i - 1); j >= 0; j--) {
SET_STRING_ELT(rval, j, CAR(tlist));
tlist = CDR(tlist);
}
if(res) {
setAttrib(rval, install("status"), ScalarInteger(res));
if(errno)
setAttrib(rval, install("errmsg"), mkString(strerror(errno)));
}
UNPROTECT(1);
return rval;
}
else { /* intern = FALSE */
#ifdef HAVE_AQUA
R_Busy(1);
#endif
tlist = allocVector(INTSXP, 1);
fflush(stdout);
INTEGER(tlist)[0] = R_system(translateChar(STRING_ELT(CAR(args), 0)));
#ifdef HAVE_AQUA
R_Busy(0);
#endif
R_Visible = 0;
return tlist;
}
}
static uim_lisp
make_arg_cons(const opt_args *arg)
{
return CONS(MAKE_SYM(arg->arg), MAKE_INT(arg->flag));
}
/* optimize speed 3, debug 3, space 0, safety 2 */
static cl_object L2interleave(cl_object V1, cl_object V2)
{
cl_object T0;
struct ecl_ihs_frame ihs;
const cl_object _ecl_debug_env = ECL_NIL;
const cl_env_ptr cl_env_copy = ecl_process_env();
cl_object value0;
ecl_cs_check(cl_env_copy,value0);
{
{
static const struct ecl_var_debug_info _ecl_descriptors[]={
{"COMMON-LISP-USER::LIST1",_ecl_object_loc}
,{"COMMON-LISP-USER::LIST2",_ecl_object_loc}};
const cl_index _ecl_debug_info_raw[]={
(cl_index)(ECL_NIL),(cl_index)(_ecl_descriptors),(cl_index)(&V1),(cl_index)(&V2)};
ecl_def_ct_vector(_ecl_debug_env,ecl_aet_index,_ecl_debug_info_raw,4,,);
ecl_ihs_push(cl_env_copy,&ihs,VV[1],_ecl_debug_env);
TTL:
{
cl_object V3; /* LET4 */
cl_object V4; /* LET5 */
cl_object V5; /* TEMP */
cl_object V6; /* A */
cl_object V7; /* B */
V3 = cl_copy_list(V1);
V4 = cl_copy_list(V2);
V5 = ECL_NIL;
V6 = V3;
V7 = V4;
{
static const struct ecl_var_debug_info _ecl_descriptors[]={
{"COMMON-LISP-USER::B",_ecl_object_loc}
,{"COMMON-LISP-USER::A",_ecl_object_loc}
,{"COMMON-LISP-USER::TEMP",_ecl_object_loc}
,{"COMMON-LISP-USER::LET5",_ecl_object_loc}
,{"COMMON-LISP-USER::LET4",_ecl_object_loc}};
const cl_index _ecl_debug_info_raw[]={
(cl_index)(_ecl_debug_env),(cl_index)(_ecl_descriptors),(cl_index)(&V7),(cl_index)(&V6),(cl_index)(&V5),(cl_index)(&V4),(cl_index)(&V3)};
ecl_def_ct_vector(_ecl_debug_env,ecl_aet_index,_ecl_debug_info_raw,7,,);
ihs.lex_env = _ecl_debug_env;
L7:;
if (!(ecl_equal(ECL_NIL,V6))) { goto L9; }
goto L8;
L9:;
{
cl_object V8;
V8 = V6;
{
static const struct ecl_var_debug_info _ecl_descriptors[]={
{"#:G5",_ecl_object_loc}};
const cl_index _ecl_debug_info_raw[]={
(cl_index)(_ecl_debug_env),(cl_index)(_ecl_descriptors),(cl_index)(&V8)};
ecl_def_ct_vector(_ecl_debug_env,ecl_aet_index,_ecl_debug_info_raw,3,,);
ihs.lex_env = _ecl_debug_env;
{
cl_object V9;
V9 = ecl_car(V8);
{
static const struct ecl_var_debug_info _ecl_descriptors[]={
{"#:G6",_ecl_object_loc}};
const cl_index _ecl_debug_info_raw[]={
(cl_index)(_ecl_debug_env),(cl_index)(_ecl_descriptors),(cl_index)(&V9)};
ecl_def_ct_vector(_ecl_debug_env,ecl_aet_index,_ecl_debug_info_raw,3,,);
ihs.lex_env = _ecl_debug_env;
V8 = ecl_cdr(V8);
V6 = V8;
T0 = V9;
}
ihs.lex_env = _ecl_debug_env;
}
}
ihs.lex_env = _ecl_debug_env;
}
V5 = CONS(T0,V5);
{
cl_object V8;
V8 = V7;
{
static const struct ecl_var_debug_info _ecl_descriptors[]={
{"#:G8",_ecl_object_loc}};
const cl_index _ecl_debug_info_raw[]={
(cl_index)(_ecl_debug_env),(cl_index)(_ecl_descriptors),(cl_index)(&V8)};
ecl_def_ct_vector(_ecl_debug_env,ecl_aet_index,_ecl_debug_info_raw,3,,);
ihs.lex_env = _ecl_debug_env;
{
cl_object V9;
V9 = ecl_car(V8);
{
static const struct ecl_var_debug_info _ecl_descriptors[]={
{"#:G9",_ecl_object_loc}};
const cl_index _ecl_debug_info_raw[]={
(cl_index)(_ecl_debug_env),(cl_index)(_ecl_descriptors),(cl_index)(&V9)};
ecl_def_ct_vector(_ecl_debug_env,ecl_aet_index,_ecl_debug_info_raw,3,,);
ihs.lex_env = _ecl_debug_env;
V8 = ecl_cdr(V8);
V7 = V8;
T0 = V9;
}
ihs.lex_env = _ecl_debug_env;
}
}
ihs.lex_env = _ecl_debug_env;
}
V5 = CONS(T0,V5);
goto L7;
L8:;
value0 = cl_reverse(V5);
ecl_ihs_pop(cl_env_copy);
return value0;
}
ihs.lex_env = _ecl_debug_env;
}
}
}
}
SEXP attribute_hidden
do_mapply(SEXP call, SEXP op, SEXP args, SEXP rho)
{
checkArity(op, args);
SEXP f = CAR(args), varyingArgs = CADR(args), constantArgs = CADDR(args);
int m, zero = 0;
R_xlen_t *lengths, *counters, longest = 0;
m = length(varyingArgs);
SEXP vnames = PROTECT(getAttrib(varyingArgs, R_NamesSymbol));
Rboolean named = CXXRCONSTRUCT(Rboolean, vnames != R_NilValue);
lengths = static_cast<R_xlen_t *>( CXXR_alloc(m, sizeof(R_xlen_t)));
for (int i = 0; i < m; i++) {
SEXP tmp1 = VECTOR_ELT(varyingArgs, i);
lengths[i] = xlength(tmp1);
if (isObject(tmp1)) { // possibly dispatch on length()
/* Cache the .Primitive: unclear caching is worthwhile. */
static SEXP length_op = NULL;
if (length_op == NULL) length_op = R_Primitive("length");
// DispatchOrEval() needs 'args' to be a pairlist
SEXP ans, tmp2 = PROTECT(list1(tmp1));
if (DispatchOrEval(call, length_op, "length", tmp2, rho, &ans, 0, 1))
lengths[i] = R_xlen_t( (TYPEOF(ans) == REALSXP ?
REAL(ans)[0] : asInteger(ans)));
UNPROTECT(1);
}
if (lengths[i] == 0) zero++;
if (lengths[i] > longest) longest = lengths[i];
}
if (zero && longest)
error(_("zero-length inputs cannot be mixed with those of non-zero length"));
counters = static_cast<R_xlen_t *>( CXXR_alloc(m, sizeof(R_xlen_t)));
memset(counters, 0, m * sizeof(R_xlen_t));
SEXP mindex = PROTECT(allocVector(VECSXP, m));
SEXP nindex = PROTECT(allocVector(VECSXP, m));
/* build a call like
f(dots[[1]][[4]], dots[[2]][[4]], dots[[3]][[4]], d=7)
*/
SEXP fcall = R_NilValue; // -Wall
if (constantArgs == R_NilValue)
;
else if (isVectorList(constantArgs))
fcall = VectorToPairList(constantArgs);
else
error(_("argument 'MoreArgs' of 'mapply' is not a list"));
PROTECT_INDEX fi;
PROTECT_WITH_INDEX(fcall, &fi);
Rboolean realIndx = CXXRCONSTRUCT(Rboolean, longest > INT_MAX);
SEXP Dots = install("dots");
for (int j = m - 1; j >= 0; j--) {
SET_VECTOR_ELT(mindex, j, ScalarInteger(j + 1));
SET_VECTOR_ELT(nindex, j, allocVector(realIndx ? REALSXP : INTSXP, 1));
SEXP tmp1 = PROTECT(lang3(R_Bracket2Symbol, Dots, VECTOR_ELT(mindex, j)));
SEXP tmp2 = PROTECT(lang3(R_Bracket2Symbol, tmp1, VECTOR_ELT(nindex, j)));
REPROTECT(fcall = CONS(tmp2, fcall), fi);
UNPROTECT(2);
if (named && CHAR(STRING_ELT(vnames, j))[0] != '\0')
SET_TAG(fcall, installTrChar(STRING_ELT(vnames, j)));
}
REPROTECT(fcall = LCONS(f, fcall), fi);
SEXP ans = PROTECT(allocVector(VECSXP, longest));
for (int i = 0; i < longest; i++) {
for (int j = 0; j < m; j++) {
counters[j] = (++counters[j] > lengths[j]) ? 1 : counters[j];
if (realIndx)
REAL(VECTOR_ELT(nindex, j))[0] = double( counters[j]);
else
INTEGER(VECTOR_ELT(nindex, j))[0] = int( counters[j]);
}
SEXP tmp = eval(fcall, rho);
if (NAMED(tmp))
tmp = duplicate(tmp);
SET_VECTOR_ELT(ans, i, tmp);
}
for (int j = 0; j < m; j++)
if (counters[j] != lengths[j])
warning(_("longer argument not a multiple of length of shorter"));
UNPROTECT(5);
return ans;
}
void protect_robj(SEXP robj){
R_References = CONS(robj, R_References);
SET_SYMVALUE(install("R.References"), R_References);
}
void SWONS(stack& s) {
SWAP(s);
CONS(s);
}
SEXP mutate_subtrees(SEXP sexp,
double p, double p_insert_delete,
SEXP function_symbol_list,
SEXP function_arities,
SEXP input_variable_list,
double constant_min, double constant_max,
double p_subtree, double p_constant,
int depth_max) {
// Rprintf("->\n"); // DEBUG
switch (TYPEOF(sexp)) { // switch for speed
case NILSXP:
return sexp; // do nothing with nils
case LANGSXP:
if (unif_rand() < p) { // mutate inner node with probability p
if (unif_rand() < p_insert_delete) { // replace with new subtree (insert)
// Rprintf("insert\n"); // DEBUG
SEXP new_subtree = PROTECT(initialize_expression_grow(function_symbol_list, function_arities,
input_variable_list,
constant_min, constant_max,
p_subtree, p_constant,
depth_max));
UNPROTECT(1);
return new_subtree;
} else { // replace with new leaf (delete)
// Rprintf("delete\n"); // DEBUG
SEXP new_leaf = PROTECT(initialize_expression_grow(function_symbol_list, function_arities,
input_variable_list,
constant_min, constant_max,
p_subtree, p_constant,
0));
UNPROTECT(1);
return new_leaf;
}
} else {
// Rprintf("pass\n"); // DEBUG
int function_arity = 0;
SEXP e;
PROTECT(e = R_NilValue);
for (SEXP iterator = CDR(sexp); !isNull(iterator); iterator = CDR(iterator)) { // recurse on actual parameters
function_arity++; // determine arity on the fly
SEXP mutated_parameter;
PROTECT(mutated_parameter = mutate_subtrees(CAR(iterator), p, p_insert_delete,
function_symbol_list, function_arities,
input_variable_list,
constant_min, constant_max,
p_subtree, p_constant,
depth_max));
PROTECT(e = CONS(mutated_parameter, e));
}
PROTECT(e = LCONS(CAR(sexp), e));
UNPROTECT(2 * function_arity + 2);
return e;
}
case LISTSXP:
error("mutate_subtrees: unexpected LISTSXP");
default: // base case
// Rprintf("default type %d\n", TYPEOF(sexp)); // DEBUG
// if (REALSXP == TYPEOF(sexp)) {
// Rprintf("real %f\n", REAL(sexp)[0]); // DEBUG
// }
// if (SYMSXP == TYPEOF(sexp)) {
// Rprintf("symbol %s\n", CHAR(PRINTNAME(sexp))); // DEBUG
// }
if (unif_rand() < p) { // mutate leaf with probability p
if (unif_rand() < p_insert_delete) { // replace with new subtree (insert)
// Rprintf("insert at default\n"); // DEBUG
SEXP new_subtree;
new_subtree = PROTECT(initialize_expression_grow(function_symbol_list, function_arities,
input_variable_list,
constant_min, constant_max,
p_subtree, p_constant,
depth_max));
UNPROTECT(1);
return new_subtree;
} else { // replace with new leaf (delete)
// Rprintf("delete at default\n"); // DEBUG
SEXP new_leaf;
new_leaf = PROTECT(initialize_expression_grow(function_symbol_list, function_arities,
input_variable_list,
constant_min, constant_max,
p_subtree, p_constant,
0));
UNPROTECT(1);
return new_leaf;
}
} else {
// Rprintf("pass at default\n"); // DEBUG
return sexp; // do nothing
}
}
}
LispObj *
Lisp_Require(LispBuiltin *builtin)
/*
require module &optional pathname
*/
{
char filename[1024], *ext;
int len;
LispObj *obj, *module, *pathname;
pathname = ARGUMENT(1);
module = ARGUMENT(0);
CHECK_STRING(module);
if (pathname != UNSPEC) {
if (PATHNAMEP(pathname))
pathname = CAR(pathname->data.pathname);
else {
CHECK_STRING(pathname);
}
}
else
pathname = module;
for (obj = MOD; CONSP(obj); obj = CDR(obj)) {
if (strcmp(THESTR(CAR(obj)), THESTR(module)) == 0)
return (module);
}
if (THESTR(pathname)[0] != '/') {
#ifdef LISPDIR
snprintf(filename, sizeof(filename), "%s", LISPDIR);
#else
getcwd(filename, sizeof(filename));
#endif
}
else
filename[0] = '\0';
*(filename + sizeof(filename) - 5) = '\0'; /* make sure there is place for ext */
len = strlen(filename);
if (!len || filename[len - 1] != '/') {
strcat(filename, "/");
++len;
}
snprintf(filename + len, sizeof(filename) - len - 5, "%s", THESTR(pathname));
ext = filename + strlen(filename);
#ifdef SHARED_MODULES
strcpy(ext, ".so");
if (access(filename, R_OK) == 0) {
LispModule *lisp_module;
char data[64];
int len;
if (lisp__data.module == NULL) {
/* export our own symbols */
if (dlopen(NULL, RTLD_LAZY | RTLD_GLOBAL) == NULL)
LispDestroy("%s: ", STRFUN(builtin), dlerror());
}
lisp_module = (LispModule*)LispMalloc(sizeof(LispModule));
if ((lisp_module->handle =
dlopen(filename, RTLD_LAZY | RTLD_GLOBAL)) == NULL)
LispDestroy("%s: dlopen: %s", STRFUN(builtin), dlerror());
snprintf(data, sizeof(data), "%sLispModuleData", THESTR(module));
if ((lisp_module->data =
(LispModuleData*)dlsym(lisp_module->handle, data)) == NULL) {
dlclose(lisp_module->handle);
LispDestroy("%s: cannot find LispModuleData for %s",
STRFUN(builtin), STROBJ(module));
}
LispMused(lisp_module);
lisp_module->next = lisp__data.module;
lisp__data.module = lisp_module;
if (lisp_module->data->load)
(lisp_module->data->load)();
if (MOD == NIL)
MOD = CONS(module, NIL);
else {
RPLACD(MOD, CONS(CAR(MOD), CDR(MOD)));
RPLACA(MOD, module);
}
LispSetVar(lisp__data.modules, MOD);
return (module);
}
#endif
strcpy(ext, ".lsp");
(void)LispLoadFile(STRING(filename), 0, 0, 0);
return (module);
}
static Eterm subtract(Process* p, Eterm A, Eterm B)
{
Eterm list;
Eterm* hp;
Uint need;
Eterm res;
Eterm small_vec[SMALL_VEC_SIZE]; /* Preallocated memory for small lists */
Eterm* vec_p;
Eterm* vp;
int i;
int n;
int m;
if ((n = erts_list_length(A)) < 0) {
BIF_ERROR(p, BADARG);
}
if ((m = erts_list_length(B)) < 0) {
BIF_ERROR(p, BADARG);
}
if (n == 0)
BIF_RET(NIL);
if (m == 0)
BIF_RET(A);
/* allocate element vector */
if (n <= SMALL_VEC_SIZE)
vec_p = small_vec;
else
vec_p = (Eterm*) erts_alloc(ERTS_ALC_T_TMP, n * sizeof(Eterm));
/* PUT ALL ELEMENTS IN VP */
vp = vec_p;
list = A;
i = n;
while(i--) {
Eterm* listp = list_val(list);
*vp++ = CAR(listp);
list = CDR(listp);
}
/* UNMARK ALL DELETED CELLS */
list = B;
m = 0; /* number of deleted elements */
while(is_list(list)) {
Eterm* listp = list_val(list);
Eterm elem = CAR(listp);
i = n;
vp = vec_p;
while(i--) {
if (is_value(*vp) && eq(*vp, elem)) {
*vp = THE_NON_VALUE;
m++;
break;
}
vp++;
}
list = CDR(listp);
}
if (m == n) /* All deleted ? */
res = NIL;
else if (m == 0) /* None deleted ? */
res = A;
else { /* REBUILD LIST */
res = NIL;
need = 2*(n - m);
hp = HAlloc(p, need);
vp = vec_p + n - 1;
while(vp >= vec_p) {
if (is_value(*vp)) {
res = CONS(hp, *vp, res);
hp += 2;
}
vp--;
}
}
if (vec_p != small_vec)
erts_free(ERTS_ALC_T_TMP, (void *) vec_p);
BIF_RET(res);
}
LispObj *
Lisp_PQgetvalue(LispBuiltin *builtin)
/*
pq-getvalue result tuple field &optional type-specifier
*/
{
char *string;
double real = 0.0;
PGresult *res;
int tuple, field, isint = 0, isreal = 0, integer;
LispObj *result, *otupple, *field_number, *type;
type = ARGUMENT(3);
field_number = ARGUMENT(2);
otupple = ARGUMENT(1);
result = ARGUMENT(0);
if (!CHECKO(result, PGresult_t))
LispDestroy("%s: cannot convert %s to PGresult*",
STRFUN(builtin), STROBJ(result));
res = (PGresult*)(result->data.opaque.data);
CHECK_INDEX(otupple);
tuple = FIXNUM_VALUE(otupple);
CHECK_INDEX(field_number);
field = FIXNUM_VALUE(field_number);
string = PQgetvalue(res, tuple, field);
if (type != UNSPEC) {
char *typestring;
CHECK_SYMBOL(type);
typestring = ATOMID(type);
if (strcmp(typestring, "INT16") == 0) {
integer = *(short*)string;
isint = 1;
goto simple_type;
}
else if (strcmp(typestring, "INT32") == 0) {
integer = *(int*)string;
isint = 1;
goto simple_type;
}
else if (strcmp(typestring, "FLOAT") == 0) {
real = *(float*)string;
isreal = 1;
goto simple_type;
}
else if (strcmp(typestring, "REAL") == 0) {
real = *(double*)string;
isreal = 1;
goto simple_type;
}
else if (strcmp(typestring, "PG-POLYGON") == 0)
goto polygon_type;
else if (strcmp(typestring, "STRING") != 0)
LispDestroy("%s: unknown type %s",
STRFUN(builtin), typestring);
}
simple_type:
return (isint ? INTEGER(integer) : isreal ? DFLOAT(real) :
(string ? STRING(string) : NIL));
polygon_type:
{
LispObj *poly, *box, *p = NIL, *cdr, *obj;
POLYGON *polygon;
int i, size;
size = PQgetlength(res, tuple, field);
polygon = (POLYGON*)(string - sizeof(int));
GCDisable();
/* get polygon->boundbox */
cdr = EVAL(CONS(ATOM("MAKE-PG-POINT"),
CONS(KEYWORD("X"),
CONS(REAL(polygon->boundbox.high.x),
CONS(KEYWORD("Y"),
CONS(REAL(polygon->boundbox.high.y), NIL))))));
obj = EVAL(CONS(ATOM("MAKE-PG-POINT"),
CONS(KEYWORD("X"),
CONS(REAL(polygon->boundbox.low.x),
CONS(KEYWORD("Y"),
CONS(REAL(polygon->boundbox.low.y), NIL))))));
box = EVAL(CONS(ATOM("MAKE-PG-BOX"),
CONS(KEYWORD("HIGH"),
CONS(cdr,
CONS(KEYWORD("LOW"),
CONS(obj, NIL))))));
/* get polygon->p values */
for (i = 0; i < polygon->npts; i++) {
obj = EVAL(CONS(ATOM("MAKE-PG-POINT"),
CONS(KEYWORD("X"),
CONS(REAL(polygon->p[i].x),
CONS(KEYWORD("Y"),
CONS(REAL(polygon->p[i].y), NIL))))));
if (i == 0)
p = cdr = CONS(obj, NIL);
else {
RPLACD(cdr, CONS(obj, NIL));
cdr = CDR(cdr);
}
}
/* make result */
poly = EVAL(CONS(ATOM("MAKE-PG-POLYGON"),
CONS(KEYWORD("SIZE"),
CONS(REAL(size),
CONS(KEYWORD("NUM-POINTS"),
CONS(REAL(polygon->npts),
CONS(KEYWORD("BOUNDBOX"),
CONS(box,
CONS(KEYWORD("POINTS"),
CONS(QUOTE(p), NIL))))))))));
GCEnable();
return (poly);
}
}
SEXP read_png(SEXP sFn, SEXP sNative, SEXP sInfo) {
SEXP res = R_NilValue, info_list = R_NilValue, info_tail = R_NilValue;
const char *fn;
char header[8];
int native = asInteger(sNative), info = (asInteger(sInfo) == 1);
FILE *f;
read_job_t rj;
png_structp png_ptr;
png_infop info_ptr;
if (TYPEOF(sFn) == RAWSXP) {
rj.data = (char*) RAW(sFn);
rj.len = LENGTH(sFn);
rj.ptr = 0;
rj.f = f = 0;
} else {
if (TYPEOF(sFn) != STRSXP || LENGTH(sFn) < 1) Rf_error("invalid filename");
fn = CHAR(STRING_ELT(sFn, 0));
f = fopen(fn, "rb");
if (!f) Rf_error("unable to open %s", fn);
if (fread(header, 1, 8, f) < 1 || png_sig_cmp((png_bytep) header, 0, 8)) {
fclose(f);
Rf_error("file is not in PNG format");
}
rj.f = f;
}
/* use our own error hanlding code and pass the fp so it can be closed on error */
png_ptr = png_create_read_struct(PNG_LIBPNG_VER_STRING, (png_voidp)&rj, user_error_fn, user_warning_fn);
if (!png_ptr) {
if (f) fclose(f);
Rf_error("unable to initialize libpng");
}
info_ptr = png_create_info_struct(png_ptr);
if (!info_ptr) {
if (f) fclose(f);
png_destroy_read_struct(&png_ptr, (png_infopp)NULL, (png_infopp)NULL);
Rf_error("unable to initialize libpng");
}
if (f) {
png_init_io(png_ptr, f);
png_set_sig_bytes(png_ptr, 8);
} else
png_set_read_fn(png_ptr, (png_voidp) &rj, user_read_data);
#define add_info(K, V) { info_tail = SETCDR(info_tail, CONS(V, R_NilValue)); SET_TAG(info_tail, install(K)); }
/* png_read_png(png_ptr, info_ptr, PNG_TRANSFORM_STRIP_16 | PNG_TRANSFORM_EXPAND, NULL); */
png_read_info(png_ptr, info_ptr);
{
png_uint_32 width, height;
png_bytepp row_pointers;
char *img_memory;
SEXP dim;
int bit_depth, color_type, interlace_type, compression_type, filter_method, rowbytes;
int need_swap = 0;
png_get_IHDR(png_ptr, info_ptr, &width, &height,
&bit_depth, &color_type, &interlace_type,
&compression_type, &filter_method);
rowbytes = png_get_rowbytes(png_ptr, info_ptr);
#if VERBOSE_INFO
Rprintf("png: %d x %d [%d], %d bytes, 0x%x, %d, %d\n", (int) width, (int) height, bit_depth, rowbytes,
color_type, interlace_type, compression_type, filter_method);
#endif
if (info) {
SEXP dv;
double d;
png_uint_32 rx, ry;
int ut, num_text = 0;
png_textp text_ptr;
info_tail = info_list = PROTECT(CONS((dv = allocVector(INTSXP, 2)), R_NilValue));
INTEGER(dv)[0] = (int) width;
INTEGER(dv)[1] = (int) height;
SET_TAG(info_list, install("dim"));
add_info("bit.depth", ScalarInteger(bit_depth));
switch(color_type) {
case PNG_COLOR_TYPE_GRAY: add_info("color.type", mkString("gray")); break;
case PNG_COLOR_TYPE_GRAY_ALPHA: add_info("color.type", mkString("gray + alpha")); break;
case PNG_COLOR_TYPE_PALETTE: add_info("color.type", mkString("palette")); break;
case PNG_COLOR_TYPE_RGB: add_info("color.type", mkString("RGB")); break;
case PNG_COLOR_TYPE_RGB_ALPHA: add_info("color.type", mkString("RGBA")); break;
default: add_info("color.type", ScalarInteger(color_type));
}
if (png_get_gAMA(png_ptr, info_ptr, &d)) add_info("gamma", ScalarReal(d));
#ifdef PNG_pHYs_SUPPORTED
if (png_get_pHYs(png_ptr, info_ptr, &rx, &ry, &ut)) {
if (ut == PNG_RESOLUTION_METER) {
dv = allocVector(REALSXP, 2);
REAL(dv)[0] = ((double)rx) / 39.37008;
REAL(dv)[1] = ((double)ry) / 39.37008;
add_info("dpi", dv);
} else if (ut == PNG_RESOLUTION_UNKNOWN)
add_info("asp", ScalarReal(rx / ry));
}
if (png_get_text(png_ptr, info_ptr, &text_ptr, &num_text)) {
SEXP txt_key, txt_val = PROTECT(allocVector(STRSXP, num_text));
if (num_text) {
int i;
setAttrib(txt_val, R_NamesSymbol, txt_key = allocVector(STRSXP, num_text));
for (i = 0; i < num_text; i++) {
SET_STRING_ELT(txt_val, i, text_ptr[i].text ? mkChar(text_ptr[i].text) : NA_STRING);
SET_STRING_ELT(txt_key, i, text_ptr[i].key ? mkChar(text_ptr[i].key) : NA_STRING);
}
}
add_info("text", txt_val);
UNPROTECT(1);
}
#endif
}
/* on little-endian machines it's all well, but on big-endian ones we'll have to swap */
#if ! defined (__BIG_ENDIAN__) && ! defined (__LITTLE_ENDIAN__) /* old compiler so have to use run-time check */
{
char bo[4] = { 1, 0, 0, 0 };
int bi;
memcpy(&bi, bo, 4);
if (bi != 1)
need_swap = 1;
}
#endif
#ifdef __BIG_ENDIAN__
need_swap = 1;
#endif
/*==== set any transforms that we desire: ====*/
/* palette->RGB - no discussion there */
if (color_type == PNG_COLOR_TYPE_PALETTE)
png_set_palette_to_rgb(png_ptr);
/* expand gray scale to 8 bits */
if (color_type == PNG_COLOR_TYPE_GRAY &&
bit_depth < 8) png_set_expand_gray_1_2_4_to_8(png_ptr);
/* this should not be necessary but it's in the docs to guarantee 8-bit */
if (bit_depth < 8)
png_set_packing(png_ptr);
/* convert tRNS chunk into alpha */
if (png_get_valid(png_ptr, info_ptr, PNG_INFO_tRNS))
png_set_tRNS_to_alpha(png_ptr);
/* native format doesn't allow for 16-bit so it needs to be truncated */
if (bit_depth == 16 && native) {
Rf_warning("Image uses 16-bit channels but R native format only supports 8-bit, truncating LSB.");
png_set_strip_16(png_ptr);
}
/* for native output we need to a) convert gray to RGB, b) add alpha */
if (native) {
if (color_type == PNG_COLOR_TYPE_GRAY || color_type == PNG_COLOR_TYPE_GRAY_ALPHA)
png_set_gray_to_rgb(png_ptr);
if (!(color_type & PNG_COLOR_MASK_ALPHA)) /* if there is no alpha, add it */
png_set_add_alpha(png_ptr, 0xFF, PNG_FILLER_AFTER);
}
#if 0 /* we use native (network) endianness since we read each byte anyway */
/* on little-endian machines we need to swap 16-bit values - this is the inverse of need_swap as used for R! */
if (!need_swap && bit_depth == 16)
png_set_swap(png_ptr);
#endif
/* PNG wants up to call png_set_interlace_handling so it can get ready to de-interlace images */
png_set_interlace_handling(png_ptr);
/* all transformations are in place, so it's time to update the info structure so we can allocate stuff */
png_read_update_info(png_ptr, info_ptr);
/* re-read some important bits from the updated structure */
rowbytes = png_get_rowbytes(png_ptr, info_ptr);
bit_depth = png_get_bit_depth(png_ptr, info_ptr);
color_type = png_get_color_type(png_ptr, info_ptr);
#if VERBOSE_INFO
Rprintf(" -filter-> %d-bits, %d bytes, 0x%x\n", bit_depth, rowbytes, color_type);
#endif
/* allocate data fro row pointers and the image using R's allocation */
row_pointers = (png_bytepp) R_alloc(height, sizeof(png_bytep));
img_memory = R_alloc(height, rowbytes);
{ /* populate the row pointers */
char *i_ptr = img_memory;
int i;
for (i = 0; i < height; i++, i_ptr += rowbytes)
row_pointers[i] = (png_bytep) i_ptr;
}
/* do the reading work */
png_read_image(png_ptr, row_pointers);
if (f) {
rj.f = 0;
fclose(f);
}
/* native output - vector of integers */
if (native) {
int pln = rowbytes / width;
if (pln < 1 || pln > 4) {
png_destroy_read_struct(&png_ptr, &info_ptr, (png_infopp)NULL);
Rf_error("native output for %d planes is not possible.", pln);
}
res = PROTECT(allocVector(INTSXP, width * height));
if (pln == 4) { /* 4 planes - efficient - just copy it all */
int y, *idata = INTEGER(res);
for (y = 0; y < height; idata += width, y++)
memcpy(idata, row_pointers[y], width * sizeof(int));
if (need_swap) {
int *ide = idata;
idata = INTEGER(res);
for (; idata < ide; idata++)
RX_swap32(*idata);
}
} else if (pln == 3) { /* RGB */
int x, y, *idata = INTEGER(res);
for (y = 0; y < height; y++)
for (x = 0; x < rowbytes; x += 3)
*(idata++) = R_RGB((unsigned int) row_pointers[y][x],
(unsigned int) row_pointers[y][x + 1],
(unsigned int) row_pointers[y][x + 2]);
} else if (pln == 2) { /* GA */
int x, y, *idata = INTEGER(res);
for (y = 0; y < height; y++)
for (x = 0; x < rowbytes; x += 2)
*(idata++) = R_RGBA((unsigned int) row_pointers[y][x],
(unsigned int) row_pointers[y][x],
(unsigned int) row_pointers[y][x],
(unsigned int) row_pointers[y][x + 1]);
} else { /* gray */
int x, y, *idata = INTEGER(res);
for (y = 0; y < height; y++)
for (x = 0; x < rowbytes; x++)
*(idata++) = R_RGB((unsigned int) row_pointers[y][x],
(unsigned int) row_pointers[y][x],
(unsigned int) row_pointers[y][x]);
}
dim = allocVector(INTSXP, 2);
INTEGER(dim)[0] = height;
INTEGER(dim)[1] = width;
setAttrib(res, R_DimSymbol, dim);
setAttrib(res, R_ClassSymbol, mkString("nativeRaster"));
setAttrib(res, install("channels"), ScalarInteger(pln));
UNPROTECT(1);
} else {
int x, y, p, pln = rowbytes / width, pls = width * height;
double * data;
if (bit_depth == 16) {
res = PROTECT(allocVector(REALSXP, (rowbytes * height) / 2));
pln /= 2;
} else
res = PROTECT(allocVector(REALSXP, rowbytes * height));
data = REAL(res);
if (bit_depth == 16)
for(y = 0; y < height; y++)
for (x = 0; x < width; x++)
for (p = 0; p < pln; p++)
data[y + x * height + p * pls] = ((double)(
(((unsigned int)(((unsigned char *)row_pointers[y])[2 * (x * pln + p)])) << 8) |
((unsigned int)(((unsigned char *)row_pointers[y])[2 * (x * pln + p) + 1]))
)) / 65535.0;
else
for(y = 0; y < height; y++)
for (x = 0; x < width; x++)
for (p = 0; p < pln; p++)
data[y + x * height + p * pls] = ((double)row_pointers[y][x * pln + p]) / 255.0;
dim = allocVector(INTSXP, (pln > 1) ? 3 : 2);
INTEGER(dim)[0] = height;
INTEGER(dim)[1] = width;
if (pln > 1)
INTEGER(dim)[2] = pln;
setAttrib(res, R_DimSymbol, dim);
UNPROTECT(1);
}
}
if (info) {
PROTECT(res);
setAttrib(res, install("info"), info_list);
UNPROTECT(2);
}
png_destroy_read_struct(&png_ptr, &info_ptr, (png_infopp)NULL);
return res;
}
static dd_ErrorType FaceEnumHelper(dd_MatrixPtr M, dd_rowset R, dd_rowset S)
{
dd_ErrorType err;
dd_rowset LL, ImL, RR, SS, Lbasis;
dd_rowrange iprev = 0;
dd_colrange dim;
dd_LPSolutionPtr lps = NULL;
set_initialize(&LL, M->rowsize);
set_initialize(&RR, M->rowsize);
set_initialize(&SS, M->rowsize);
set_copy(LL, M->linset);
set_copy(RR, R);
set_copy(SS, S);
/* note actual type of "value" is mpq_t (defined in cddmp.h) */
mytype value;
dd_init(value);
err = dd_NoError;
dd_boolean foo = dd_ExistsRestrictedFace(M, R, S, &err);
if (err != dd_NoError) {
#ifdef MOO
fprintf(stderr, "err from dd_ExistsRestrictedFace\n");
fprintf(stderr, "err = %d\n", err);
#endif /* MOO */
set_free(LL);
set_free(RR);
set_free(SS);
dd_clear(value);
return err;
}
if (foo) {
set_uni(M->linset, M->linset, R);
err = dd_NoError;
dd_FindRelativeInterior(M, &ImL, &Lbasis, &lps, &err);
if (err != dd_NoError) {
#ifdef MOO
fprintf(stderr, "err from dd_FindRelativeInterior\n");
fprintf(stderr, "err = %d\n", err);
#endif /* MOO */
dd_FreeLPSolution(lps);
set_free(ImL);
set_free(Lbasis);
set_free(LL);
set_free(RR);
set_free(SS);
dd_clear(value);
return err;
}
dim = M->colsize - set_card(Lbasis) - 1;
set_uni(M->linset, M->linset, ImL);
SEXP mydim, myactive, myrip;
PROTECT(mydim = ScalarInteger(dim));
PROTECT(myactive = rr_set_fwrite(M->linset));
int myd = (lps->d) - 2;
PROTECT(myrip = allocVector(STRSXP, myd));
for (int j = 1; j <= myd; j++) {
dd_set(value, lps->sol[j]);
char *zstr = NULL;
zstr = mpq_get_str(zstr, 10, value);
SET_STRING_ELT(myrip, j - 1, mkChar(zstr));
free(zstr);
}
REPROTECT(dimlist = CONS(mydim, dimlist), dimidx);
REPROTECT(riplist = CONS(myrip, riplist), ripidx);
REPROTECT(activelist = CONS(myactive, activelist), activeidx);
UNPROTECT(3);
dd_FreeLPSolution(lps);
set_free(ImL);
set_free(Lbasis);
if (dim > 0) {
for (int i = 1; i <= M->rowsize; i++) {
if ((! set_member(i, M->linset)) && (! set_member(i, S))) {
set_addelem(RR, i);
if (iprev) {
set_delelem(RR, iprev);
set_delelem(M->linset, iprev);
set_addelem(SS, iprev);
}
iprev = i;
err = FaceEnumHelper(M, RR, SS);
if (err != dd_NoError) {
#ifdef MOO
fprintf(stderr, "err from FaceEnumHelper\n");
fprintf(stderr, "err = %d\n", err);
#endif /* MOO */
set_copy(M->linset, LL);
set_free(LL);
set_free(RR);
set_free(SS);
dd_clear(value);
return err;
}
}
}
}
}
set_copy(M->linset, LL);
set_free(LL);
set_free(RR);
set_free(SS);
dd_clear(value);
return dd_NoError;
}
static Eterm
do_get_all(Process* c_p, TrapData* trap_data, Eterm res)
{
HashTable* hash_table;
Uint remaining;
Uint idx;
Uint max_iter;
Uint i;
Eterm* hp;
Uint heap_size;
struct copy_term {
Uint key_size;
Eterm* tuple_ptr;
} *copy_data;
hash_table = trap_data->table;
idx = trap_data->idx;
#if defined(DEBUG) || defined(VALGRIND)
max_iter = 50;
#else
max_iter = ERTS_BIF_REDS_LEFT(c_p);
#endif
remaining = trap_data->remaining < max_iter ?
trap_data->remaining : max_iter;
trap_data->remaining -= remaining;
copy_data = (struct copy_term *) erts_alloc(ERTS_ALC_T_TMP,
remaining *
sizeof(struct copy_term));
i = 0;
heap_size = (2 + 3) * remaining;
while (remaining != 0) {
Eterm term = hash_table->term[idx];
if (is_tuple(term)) {
Uint key_size;
Eterm* tup_val;
ASSERT(is_tuple_arity(term, 2));
tup_val = tuple_val(term);
key_size = size_object(tup_val[1]);
copy_data[i].key_size = key_size;
copy_data[i].tuple_ptr = tup_val;
heap_size += key_size;
i++;
remaining--;
}
idx++;
}
trap_data->idx = idx;
hp = HAlloc(c_p, heap_size);
remaining = i;
for (i = 0; i < remaining; i++) {
Eterm* tuple_ptr;
Uint key_size;
Eterm key;
Eterm tup;
tuple_ptr = copy_data[i].tuple_ptr;
key_size = copy_data[i].key_size;
key = copy_struct(tuple_ptr[1], key_size, &hp, &c_p->off_heap);
tup = TUPLE2(hp, key, tuple_ptr[2]);
hp += 3;
res = CONS(hp, tup, res);
hp += 2;
}
erts_free(ERTS_ALC_T_TMP, copy_data);
return res;
}
static Eterm pd_hash_put(Process *p, Eterm id, Eterm value)
{
unsigned int hval;
Eterm *hp;
Eterm tpl;
Eterm old;
Eterm tmp;
int needed;
int i = 0;
#ifdef DEBUG
Eterm *hp_limit;
#endif
if (p->dictionary == NULL) {
/* Create it */
array_put(&(p->dictionary), INITIAL_SIZE - 1, NIL);
p->dictionary->homeSize = INITIAL_SIZE;
}
hval = pd_hash_value(p->dictionary, id);
old = ARRAY_GET(p->dictionary, hval);
/*
* Calculate the number of heap words needed and garbage
* collect if necessary. (Might be a slight overestimation.)
*/
needed = 3; /* {Key,Value} tuple */
if (is_boxed(old)) {
/*
* We don't want to compare keys twice, so we'll always
* reserve the space for two CONS cells.
*/
needed += 2+2;
} else if (is_list(old)) {
i = 0;
for (tmp = old; tmp != NIL && !EQ(tuple_val(TCAR(tmp))[1], id); tmp = TCDR(tmp)) {
++i;
}
if (is_nil(tmp)) {
i = -1;
needed += 2;
} else {
needed += 2*(i+1);
}
}
if (HeapWordsLeft(p) < needed) {
Eterm root[3];
root[0] = id;
root[1] = value;
root[2] = old;
BUMP_REDS(p, erts_garbage_collect(p, needed, root, 3));
id = root[0];
value = root[1];
old = root[2];
}
#ifdef DEBUG
hp_limit = p->htop + needed;
#endif
/*
* Create the {Key,Value} tuple.
*/
hp = HeapOnlyAlloc(p, 3);
tpl = TUPLE2(hp, id, value);
/*
* Update the dictionary.
*/
if (is_nil(old)) {
array_put(&(p->dictionary), hval, tpl);
++(p->dictionary->numElements);
} else if (is_boxed(old)) {
ASSERT(is_tuple(old));
if (EQ(tuple_val(old)[1],id)) {
array_put(&(p->dictionary), hval, tpl);
return tuple_val(old)[2];
} else {
hp = HeapOnlyAlloc(p, 4);
tmp = CONS(hp, old, NIL);
hp += 2;
++(p->dictionary->numElements);
array_put(&(p->dictionary), hval, CONS(hp, tpl, tmp));
hp += 2;
ASSERT(hp <= hp_limit);
}
} else if (is_list(old)) {
if (i == -1) {
/*
* New key. Simply prepend the tuple to the beginning of the list.
*/
hp = HeapOnlyAlloc(p, 2);
array_put(&(p->dictionary), hval, CONS(hp, tpl, old));
hp += 2;
ASSERT(hp <= hp_limit);
++(p->dictionary->numElements);
} else {
/*
* i = Number of CDRs to skip to reach the changed element in the list.
*
* Replace old value in list. To avoid pointers from the old generation
* to the new, we must rebuild the list from the beginning up to and
* including the changed element.
*/
Eterm nlist;
int j;
hp = HeapOnlyAlloc(p, (i+1)*2);
/* Find the list element to change. */
for (j = 0, nlist = old; j < i; j++, nlist = TCDR(nlist)) {
;
}
ASSERT(EQ(tuple_val(TCAR(nlist))[1], id));
nlist = TCDR(nlist); /* Unchanged part of list. */
/* Rebuild list before the updated element. */
for (tmp = old; i-- > 0; tmp = TCDR(tmp)) {
nlist = CONS(hp, TCAR(tmp), nlist);
hp += 2;
}
ASSERT(EQ(tuple_val(TCAR(tmp))[1], id));
/* Put the updated element first in the new list. */
nlist = CONS(hp, tpl, nlist);
hp += 2;
ASSERT(hp <= hp_limit);
array_put(&(p->dictionary), hval, nlist);
return tuple_val(TCAR(tmp))[2];
}
} else {
#ifdef DEBUG
erts_fprintf(stderr,
"Process dictionary for process %T is broken, trying to "
"display term found in line %d:\n"
"%T\n", p->common.id, __LINE__, old);
#endif
erl_exit(1, "Damaged process dictionary found during put/2.");
}
if (HASH_RANGE(p->dictionary) <= p->dictionary->numElements) {
grow(p);
}
return am_undefined;
}
elem XmlRpc_EncodeStruct(elem obj)
{
elem lst, cur;
elem t, t2, x;
x=MISC_EOL;
lst=TyObj_SlotNames(obj);
cur=lst;
while(ELEM_CONSP(cur))
{
t2=MISC_EOL;
t=TyObj_GetSlot(obj, CAR(cur));
t=XmlRpc_EncodeValue(t);
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("value"), t);
t2=CONS(t, t2);
t=STRING(ELEM_TOSYMBOL(CAR(cur)));
t=CONS(t, MISC_EOL);
t=CONS(MISC_EOL, t);
t=CONS(SYM("name"), t);
t2=CONS(t, t2);
t2=CONS(MISC_EOL, t2);
t2=CONS(SYM("member"), t2);
x=CONS(t2, x);
cur=CDR(cur);
}
x=CONS(MISC_EOL, x);
x=CONS(SYM("struct"), x);
return(x);
}
static void shrink(Process *p, Eterm* ret)
{
unsigned int range = HASH_RANGE(p->dictionary);
unsigned int steps = (range*3) / 10;
Eterm hi, lo, tmp;
unsigned int i;
Eterm *hp;
#ifdef DEBUG
Eterm *hp_limit;
#endif
if (range - steps < INITIAL_SIZE) {
steps = range - INITIAL_SIZE;
}
for (i = 0; i < steps; ++i) {
ProcDict *pd = p->dictionary;
if (pd->splitPosition == 0) {
pd->homeSize /= 2;
pd->splitPosition = pd->homeSize;
}
--(pd->splitPosition);
hi = ARRAY_GET(pd, (pd->splitPosition + pd->homeSize));
lo = ARRAY_GET(pd, pd->splitPosition);
if (hi != NIL) {
if (lo == NIL) {
array_put(&(p->dictionary), pd->splitPosition, hi);
} else {
int needed = 4;
if (is_list(hi) && is_list(lo)) {
needed = 2*erts_list_length(hi);
}
if (HeapWordsLeft(p) < needed) {
BUMP_REDS(p, erts_garbage_collect(p, needed, ret, 1));
hi = pd->data[(pd->splitPosition + pd->homeSize)];
lo = pd->data[pd->splitPosition];
}
#ifdef DEBUG
hp_limit = p->htop + needed;
#endif
if (is_tuple(lo)) {
if (is_tuple(hi)) {
hp = HeapOnlyAlloc(p, 4);
tmp = CONS(hp, hi, NIL);
hp += 2;
array_put(&(p->dictionary), pd->splitPosition,
CONS(hp,lo,tmp));
hp += 2;
ASSERT(hp <= hp_limit);
} else { /* hi is a list */
hp = HeapOnlyAlloc(p, 2);
array_put(&(p->dictionary), pd->splitPosition,
CONS(hp, lo, hi));
hp += 2;
ASSERT(hp <= hp_limit);
}
} else { /* lo is a list */
if (is_tuple(hi)) {
hp = HeapOnlyAlloc(p, 2);
array_put(&(p->dictionary), pd->splitPosition,
CONS(hp, hi, lo));
hp += 2;
ASSERT(hp <= hp_limit);
} else { /* Two lists */
hp = HeapOnlyAlloc(p, needed);
for (tmp = hi; tmp != NIL; tmp = TCDR(tmp)) {
lo = CONS(hp, TCAR(tmp), lo);
hp += 2;
}
ASSERT(hp <= hp_limit);
array_put(&(p->dictionary), pd->splitPosition, lo);
}
}
}
}
array_put(&(p->dictionary), (pd->splitPosition + pd->homeSize), NIL);
}
if (HASH_RANGE(p->dictionary) <= (p->dictionary->size / 4)) {
array_shrink(&(p->dictionary), (HASH_RANGE(p->dictionary) * 3) / 2);
}
}
elem XmlRpc_EncodeResponse(elem val)
{
elem t, x;
t=XmlRpc_EncodeValue(val);
x=CONS(t, MISC_EOL);
x=CONS(MISC_EOL, x);
x=CONS(SYM("value"), x);
x=CONS(x, MISC_EOL);
x=CONS(MISC_EOL, x);
x=CONS(SYM("param"), x);
x=CONS(x, MISC_EOL);
x=CONS(MISC_EOL, x);
x=CONS(SYM("params"), x);
x=CONS(x, MISC_EOL);
x=CONS(MISC_EOL, x);
x=CONS(SYM("methodResponse"), x);
return(x);
}
static void grow(Process *p)
{
unsigned int i,j;
unsigned int steps = p->dictionary->homeSize / 5;
Eterm l1,l2;
Eterm l;
Eterm *hp;
unsigned int pos;
unsigned int homeSize;
int needed = 0;
ProcDict *pd;
#ifdef DEBUG
Eterm *hp_limit;
#endif
HDEBUGF(("grow: steps = %d", steps));
if (steps == 0)
steps = 1;
/* Dont grow over MAX_HASH */
if ((MAX_HASH - steps) <= HASH_RANGE(p->dictionary)) {
return;
}
/*
* Calculate total number of heap words needed, and garbage collect
* if necessary.
*/
pd = p->dictionary;
pos = pd->splitPosition;
homeSize = pd->homeSize;
for (i = 0; i < steps; ++i) {
if (pos == homeSize) {
homeSize *= 2;
pos = 0;
}
l = ARRAY_GET(pd, pos);
pos++;
if (is_not_tuple(l)) {
while (l != NIL) {
needed += 2;
l = TCDR(l);
}
}
}
if (HeapWordsLeft(p) < needed) {
BUMP_REDS(p, erts_garbage_collect(p, needed, 0, 0));
}
#ifdef DEBUG
hp_limit = p->htop + needed;
#endif
/*
* Now grow.
*/
for (i = 0; i < steps; ++i) {
ProcDict *pd = p->dictionary;
if (pd->splitPosition == pd->homeSize) {
pd->homeSize *= 2;
pd->splitPosition = 0;
}
pos = pd->splitPosition;
++pd->splitPosition; /* For the hashes */
l = ARRAY_GET(pd, pos);
if (is_tuple(l)) {
if (pd_hash_value(pd, tuple_val(l)[1]) != pos) {
array_put(&(p->dictionary), pos +
p->dictionary->homeSize, l);
array_put(&(p->dictionary), pos, NIL);
}
} else {
l2 = NIL;
l1 = l;
for (j = 0; l1 != NIL; l1 = TCDR(l1))
j += 2;
hp = HeapOnlyAlloc(p, j);
while (l != NIL) {
if (pd_hash_value(pd, tuple_val(TCAR(l))[1]) == pos)
l1 = CONS(hp, TCAR(l), l1);
else
l2 = CONS(hp, TCAR(l), l2);
hp += 2;
l = TCDR(l);
}
if (l1 != NIL && TCDR(l1) == NIL)
l1 = TCAR(l1);
if (l2 != NIL && TCDR(l2) == NIL)
l2 = TCAR(l2);
ASSERT(hp <= hp_limit);
/* After array_put pd is no longer valid */
array_put(&(p->dictionary), pos, l1);
array_put(&(p->dictionary), pos +
p->dictionary->homeSize, l2);
}
}
#ifdef HARDDEBUG
dictionary_dump(p->dictionary,CERR);
#endif
}
static ERTS_INLINE int
prepare_crash_dump(int secs)
{
#define NUFBUF (3)
int i;
char env[21]; /* enough to hold any 64-bit integer */
size_t envsz;
DeclareTmpHeapNoproc(heap,NUFBUF);
Port *heart_port;
Eterm *hp = heap;
Eterm list = NIL;
int has_heart = 0;
UseTmpHeapNoproc(NUFBUF);
if (ERTS_PREPARED_CRASH_DUMP)
return 0; /* We have already been called */
heart_port = erts_get_heart_port();
/* Positive secs means an alarm must be set
* 0 or negative means no alarm
*
* Set alarm before we try to write to a port
* we don't want to hang on a port write with
* no alarm.
*
*/
if (secs >= 0) {
alarm((unsigned int)secs);
}
/* close all viable sockets via emergency close callbacks.
* Specifically we want to close epmd sockets.
*/
erts_emergency_close_ports();
if (heart_port) {
has_heart = 1;
list = CONS(hp, make_small(8), list); hp += 2;
/* send to heart port, CMD = 8, i.e. prepare crash dump =o */
erts_port_output(NULL, ERTS_PORT_SIG_FLG_FORCE_IMM_CALL, heart_port,
heart_port->common.id, list, NULL);
}
/* Make sure we have a fd for our crashdump file. */
close(crashdump_companion_cube_fd);
envsz = sizeof(env);
i = erts_sys_getenv__("ERL_CRASH_DUMP_NICE", env, &envsz);
if (i >= 0) {
int nice_val;
nice_val = i != 0 ? 0 : atoi(env);
if (nice_val > 39) {
nice_val = 39;
}
erts_silence_warn_unused_result(nice(nice_val));
}
UnUseTmpHeapNoproc(NUFBUF);
#undef NUFBUF
return has_heart;
}
static BIF_RETTYPE append(Process* p, Eterm A, Eterm B)
{
Eterm list;
Eterm copy;
Eterm last;
Eterm* hp = NULL;
Sint i;
list = A;
if (is_nil(list)) {
BIF_RET(B);
}
if (is_not_list(list)) {
BIF_ERROR(p, BADARG);
}
/* optimistic append on heap first */
if ((i = HeapWordsLeft(p) / 2) < 4) {
goto list_tail;
}
hp = HEAP_TOP(p);
copy = last = CONS(hp, CAR(list_val(list)), make_list(hp+2));
list = CDR(list_val(list));
hp += 2;
i -= 2; /* don't use the last 2 words (extra i--;) */
while(i-- && is_list(list)) {
Eterm* listp = list_val(list);
last = CONS(hp, CAR(listp), make_list(hp+2));
list = CDR(listp);
hp += 2;
}
/* A is proper and B is NIL return A as-is, don't update HTOP */
if (is_nil(list) && is_nil(B)) {
BIF_RET(A);
}
if (is_nil(list)) {
HEAP_TOP(p) = hp;
CDR(list_val(last)) = B;
BIF_RET(copy);
}
list_tail:
if ((i = erts_list_length(list)) < 0) {
BIF_ERROR(p, BADARG);
}
/* remaining list was proper and B is NIL */
if (is_nil(B)) {
BIF_RET(A);
}
if (hp) {
/* Note: fall through case, already written
* on the heap.
* The last 2 words of the heap is not written yet
*/
Eterm *hp_save = hp;
ASSERT(i != 0);
HEAP_TOP(p) = hp + 2;
if (i == 1) {
hp[0] = CAR(list_val(list));
hp[1] = B;
BIF_RET(copy);
}
hp = HAlloc(p, 2*(i - 1));
last = CONS(hp_save, CAR(list_val(list)), make_list(hp));
} else {
hp = HAlloc(p, 2*i);
copy = last = CONS(hp, CAR(list_val(list)), make_list(hp+2));
hp += 2;
}
list = CDR(list_val(list));
i--;
ASSERT(i > -1);
while(i--) {
Eterm* listp = list_val(list);
last = CONS(hp, CAR(listp), make_list(hp+2));
list = CDR(listp);
hp += 2;
}
CDR(list_val(last)) = B;
BIF_RET(copy);
}
/* This is a primitive SPECIALSXP with internal argument matching */
SEXP attribute_hidden do_rep(SEXP call, SEXP op, SEXP args, SEXP rho)
{
SEXP ans, x, times = R_NilValue /* -Wall */;
int each = 1, nprotect = 3;
R_xlen_t i, lx, len = NA_INTEGER, nt;
static SEXP do_rep_formals = NULL;
/* includes factors, POSIX[cl]t, Date */
if (DispatchOrEval(call, op, R_RepCharSXP, args, rho, &ans, 0, 0))
return(ans);
/* This has evaluated all the non-missing arguments into ans */
PROTECT(args = ans);
/* This is a primitive, and we have not dispatched to a method
so we manage the argument matching ourselves. We pretend this is
rep(x, times, length.out, each, ...)
*/
if (do_rep_formals == NULL) {
do_rep_formals = CONS(R_NilValue, list4(R_NilValue, R_NilValue, R_NilValue, R_NilValue));
R_PreserveObject(do_rep_formals);
SET_TAG(do_rep_formals, R_XSymbol);
SET_TAG(CDR(do_rep_formals), install("times"));
SET_TAG(CDDR(do_rep_formals), R_LengthOutSymbol);
SET_TAG(CDR(CDDR(do_rep_formals)), install("each"));
SET_TAG(CDDR(CDDR(do_rep_formals)), R_DotsSymbol);
}
PROTECT(args = matchArgs(do_rep_formals, args, call));
x = CAR(args);
/* supported in R 2.15.x */
if (TYPEOF(x) == LISTSXP)
errorcall(call, "replication of pairlists is defunct");
lx = xlength(x);
double slen = asReal(CADDR(args));
if (R_FINITE(slen)) {
if(slen < 0)
errorcall(call, _("invalid '%s' argument"), "length.out");
len = (R_xlen_t) slen;
} else {
len = asInteger(CADDR(args));
if(len != NA_INTEGER && len < 0)
errorcall(call, _("invalid '%s' argument"), "length.out");
}
if(length(CADDR(args)) != 1)
warningcall(call, _("first element used of '%s' argument"),
"length.out");
each = asInteger(CADDDR(args));
if(each != NA_INTEGER && each < 0)
errorcall(call, _("invalid '%s' argument"), "each");
if(length(CADDDR(args)) != 1)
warningcall(call, _("first element used of '%s' argument"), "each");
if(each == NA_INTEGER) each = 1;
if(lx == 0) {
if(len > 0 && x == R_NilValue)
warningcall(call, "'x' is NULL so the result will be NULL");
SEXP a;
PROTECT(a = duplicate(x));
if(len != NA_INTEGER && len > 0) a = xlengthgets(a, len);
UNPROTECT(3);
return a;
}
if (!isVector(x))
errorcall(call, "attempt to replicate an object of type '%s'",
type2char(TYPEOF(x)));
/* So now we know x is a vector of positive length. We need to
replicate it, and its names if it has them. */
/* First find the final length using 'times' and 'each' */
if(len != NA_INTEGER) { /* takes precedence over times */
nt = 1;
} else {
R_xlen_t sum = 0;
if(CADR(args) == R_MissingArg) PROTECT(times = ScalarInteger(1));
else PROTECT(times = coerceVector(CADR(args), INTSXP));
nprotect++;
nt = XLENGTH(times);
if(nt != 1 && nt != lx * each)
errorcall(call, _("invalid '%s' argument"), "times");
if(nt == 1) {
int it = INTEGER(times)[0];
if (it == NA_INTEGER || it < 0)
errorcall(call, _("invalid '%s' argument"), "times");
len = lx * it * each;
} else {
for(i = 0; i < nt; i++) {
int it = INTEGER(times)[i];
if (it == NA_INTEGER || it < 0)
errorcall(call, _("invalid '%s' argument"), "times");
sum += it;
}
len = sum;
}
}
if(len > 0 && each == 0)
errorcall(call, _("invalid '%s' argument"), "each");
SEXP xn = getNamesAttrib(x);
PROTECT(ans = rep4(x, times, len, each, nt));
if (length(xn) > 0)
setAttrib(ans, R_NamesSymbol, rep4(xn, times, len, each, nt));
#ifdef _S4_rep_keepClass
if(IS_S4_OBJECT(x)) { /* e.g. contains = "list" */
setAttrib(ans, R_ClassSymbol, getClassAttrib(x));
SET_S4_OBJECT(ans);
}
#endif
UNPROTECT(nprotect);
return ans;
}
SEXP attribute_hidden matchPositionalArgsCreateEnv(SEXP formals, SEXP *supplied, int nsupplied, SEXP call, SEXP rho, SEXP* outActuals)
{
SEXP *s;
SEXP f, a;
SEXP actuals = R_NilValue;
SEXP newrho = PROTECT(NewEnvironmentNR(rho));
SEXP *endSupplied = supplied + nsupplied;
for (f = formals, s = supplied, a = actuals ; f != R_NilValue ; f = CDR(f), s++) {
if (TAG(f) == R_DotsSymbol) {
/* pack all remaining arguments into ... */
SEXP *rs = endSupplied - 1;
SEXP dotsContent = R_NilValue;
for(; rs >= s; rs--) {
dotsContent = CONS(*rs, dotsContent); /* FIXME: enabling refcnt? */
}
SEXP dots = CONS_NR(dotsContent, R_NilValue);
SET_TAG(dots, R_DotsSymbol);
if (dotsContent != R_NilValue) {
SET_TYPEOF(dotsContent, DOTSXP);
} else {
SET_MISSING(dots, 1);
}
if (a == R_NilValue) {
PROTECT(actuals = dots);
} else {
SETCDR(a, dots);
ENABLE_REFCNT(a); /* dots are part of a protected list */
}
a = dots;
f = CDR(f);
s = endSupplied;
/* falls through into noMoreSupplied branch below */
}
if (s == endSupplied) {
/* possibly fewer supplied arguments than formals */
SEXP ds;
for(; f != R_NilValue ; f = CDR(f), a = ds) {
ds = CONS_NR(R_MissingArg, R_NilValue);
SET_TAG(ds, TAG(f));
if (a == R_NilValue) {
PROTECT(actuals = ds);
} else {
SETCDR(a, ds);
ENABLE_REFCNT(a); /* ds is part of a protected list */
}
SEXP fdefault = CAR(f);
if (fdefault != R_MissingArg) {
SET_MISSING(ds, 2);
SETCAR(ds, mkPROMISEorConst(fdefault, newrho));
} else {
SET_MISSING(ds, 1);
}
}
break;
}
/* normal case, the next supplied arg is available */
SEXP arg = CONS_NR(*s, R_NilValue);
SET_TAG(arg, TAG(f));
if (a == R_NilValue) {
PROTECT(actuals = arg);
} else {
SETCDR(a, arg);
ENABLE_REFCNT(a);
}
a = arg;
}
if (s < endSupplied) {
/* some arguments are not used */
SEXP *rs = endSupplied - 1;
SEXP unusedForError = R_NilValue;
for(; rs >= s; rs--) {
SEXP rsValue = *rs;
if (TYPEOF(rsValue) == PROMSXP) {
rsValue = PREXPR(rsValue);
}
unusedForError = CONS(rsValue, unusedForError);
}
PROTECT(unusedForError); /* needed? */
errorcall(call /* R_GlobalContext->call */,
ngettext("unused argument %s",
"unused arguments %s",
(unsigned long) length(unusedForError)),
CHAR(STRING_ELT(deparse1line(unusedForError, 0), 0)) + 4);
/* '+ 4' is to remove 'list' from 'list(badTag1,...)' */
UNPROTECT(1);
}
if (a != R_NilValue) {
ENABLE_REFCNT(a);
}
SET_FRAME(newrho, actuals);
ENABLE_REFCNT(newrho);
UNPROTECT(1); /* newrho */
if (actuals != R_NilValue) {
UNPROTECT(1); /* actuals */
}
*outActuals = actuals;
return(newrho);
}
