The Perl and Raku Conference 2025: Greenville, South Carolina - June 27-29 Learn more

/* pdlapi.c - functions for manipulating pdl structs */
#include "pdl.h" /* Data structure declarations */
#define PDL_IN_CORE
#include "pdlcore.h" /* Core declarations */
extern Core PDL; /* for PDL_TYPENAME */
/* CORE21 incorporate error in here if no vtable function */
#define VTABLE_OR_DEFAULT(errcall, trans, is_fwd, func, default_func) \
do { \
pdl_transvtable *vtable = (trans)->vtable; \
PDLDEBUG_f(printf("VTOD call " #func "(trans=%p/%s)\n", trans, vtable->name)); \
PDL_Indx i, istart = is_fwd ? vtable->nparents : 0, iend = is_fwd ? vtable->npdls : vtable->nparents; \
if (is_fwd) \
for (i = istart; i < iend; i++) \
if (trans->pdls[i]->trans_parent == trans) \
PDL_ENSURE_ALLOCATED(trans->pdls[i]); \
PDL_Indx ncheck = iend - istart + 1; \
PDL_BITFIELD_ENT had_badflag[PDL_BITFIELD_SIZE(ncheck)]; \
PDL_BITFIELD_ZEROISE(had_badflag, ncheck); \
for (i = istart; i < iend; i++) \
if ((trans)->pdls[i] && (trans)->pdls[i]->state & PDL_BADVAL) \
PDL_BITFIELD_SET(had_badflag, i-istart); \
PDLDEBUG_f(printf("had_badflag bitfield: 0b"); for (i = iend-istart; i >= 0; i--) { printf("%d", PDL_BITFIELD_ISSET(had_badflag, i)); } printf("\n");); \
errcall(PDL_err, (vtable->func \
? vtable->func \
: pdl_ ## default_func)(trans)); \
for (i = istart; i < iend; i++) { \
pdl *child = (trans)->pdls[i]; \
PDLDEBUG_f(printf("VTOD " #func " child=%p turning off datachanged, before=", child); pdl_dump_flags_fixspace(child->state, 0, PDL_FLAGS_PDL)); \
if (is_fwd) child->state &= ~PDL_PARENTDATACHANGED; \
if (child && \
!!(child->state & PDL_BADVAL) != !!PDL_BITFIELD_ISSET(had_badflag, i-istart) \
) \
pdl_propagate_badflag_dir(child, !!(child->state & PDL_BADVAL), is_fwd, 1); \
} \
} while (0)
#define READDATA(trans) VTABLE_OR_DEFAULT(PDL_ACCUMERROR, trans, 1, readdata, readdata_affine)
#define WRITEDATA(trans) VTABLE_OR_DEFAULT(PDL_ACCUMERROR, trans, 0, writebackdata, writebackdata_affine)
#define REDODIMS(errcall, trans) do { \
pdl_transvtable *vtable = (trans)->vtable; \
if (vtable->redodims) { \
PDL_Indx creating[vtable->npdls]; \
pdl **pdls = (trans)->pdls; \
PDL_Indx i; \
for (i=0; i<vtable->npdls; i++) \
creating[i] = (vtable->par_flags[i] & PDL_PARAM_ISCREAT) && \
PDL_DIMS_FROM_TRANS(trans,pdls[i]); \
errcall(PDL_err, pdl_dim_checks( \
vtable, pdls, \
NULL, trans->broadcast.nimpl, creating, \
(trans)->ind_sizes, 1)); \
} \
if ((trans)->dims_redone) { \
FREETRANS(trans, 0); \
if (PDL_err.error) return PDL_err; \
(trans)->dims_redone = 0; \
} \
errcall(PDL_err, (vtable->redodims \
? vtable->redodims \
: pdl_redodims_default)(trans)); \
PDL_Indx i; \
for (i = 0; i < vtable->ninds; i++) \
if (trans->ind_sizes[i] < 0) \
PDL_ACCUMERROR(PDL_err, pdl_make_error(PDL_EUSERERROR, \
"%s: RedoDims gave size < 0 for dim %s", \
trans->vtable->name, trans->vtable->ind_names[i])); \
if (PDL_err.error) errcall(PDL_err, PDL_err); \
for (i = vtable->nparents; i < vtable->npdls; i++) { \
pdl *child = (trans)->pdls[i]; \
PDLDEBUG_f(printf("REDODIMS child=%p turning off dimschanged, before=", child); pdl_dump_flags_fixspace(child->state, 0, PDL_FLAGS_PDL)); \
child->state &= ~PDL_PARENTDIMSCHANGED; \
} \
} while (0)
#define FREETRANS(trans, destroy) \
if (trans->vtable->freetrans) { \
PDLDEBUG_f(printf("call freetrans\n")); \
PDL_ACCUMERROR(PDL_err, trans->vtable->freetrans(trans, destroy)); \
/* ignore error for now as need to still free rest */ \
if (destroy) PDL_CLRMAGIC(trans); \
}
#define CHANGED(...) \
PDL_ACCUMERROR(PDL_err, pdl_changed(__VA_ARGS__))
extern Core PDL;
pdl_error pdl__make_physical_recprotect(pdl *it, int recurse_count);
pdl_error pdl__make_physvaffine_recprotect(pdl *it, int recurse_count);
/* Make sure transformation is done */
pdl_error pdl__ensure_trans(pdl_trans *trans, int what, char inputs_only, int recurse_count)
{
pdl_error PDL_err = {0, NULL, 0};
PDLDEBUG_f(printf("pdl__ensure_trans %p what=", trans); pdl_dump_flags_fixspace(what, 0, PDL_FLAGS_PDL));
PDL_TR_CHKMAGIC(trans);
pdl_transvtable *vtable = trans->vtable;
if (trans->flags & PDL_ITRANS_ISAFFINE) {
if (!(vtable->nparents == 1 && vtable->npdls == 2))
return pdl_make_error_simple(PDL_EUSERERROR, "Affine trans other than 1 input 1 output");
return pdl__make_physical_recprotect(trans->pdls[1], recurse_count+1);
}
PDL_Indx j, flag=what, par_pvaf=0, j_end = inputs_only ? vtable->nparents : vtable->npdls;
for (j=0; j<j_end; j++) {
if (vtable->par_flags[j] & PDL_PARAM_ISPHYS)
PDL_RETERROR(PDL_err, pdl__make_physical_recprotect(trans->pdls[j], recurse_count+1));
else {
PDL_RETERROR(PDL_err, pdl__make_physvaffine_recprotect(trans->pdls[j], recurse_count+1));
if (PDL_VAFFOK(trans->pdls[j])) par_pvaf++;
}
}
for (j=vtable->nparents; j<vtable->npdls; j++)
flag |= trans->pdls[j]->state & PDL_ANYCHANGED;
PDLDEBUG_f(printf("pdl__ensure_trans after accum, par_pvaf=%"IND_FLAG" flag=", par_pvaf); pdl_dump_flags_fixspace(flag, 0, PDL_FLAGS_PDL));
if (par_pvaf || flag & PDL_PARENTDIMSCHANGED)
REDODIMS(PDL_RETERROR, trans); /* CORE21 change to make_physdims_recetc */
if (flag & PDL_ANYCHANGED)
READDATA(trans);
return PDL_err;
}
pdl *pdl_null(void) {
PDLDEBUG_f(printf("pdl_null\n"));
return pdl_pdlnew();
}
pdl *pdl_scalar(PDL_Anyval anyval) {
PDLDEBUG_f(printf("pdl_scalar type=%d val=", anyval.type); pdl_dump_anyval(anyval); printf("\n"););
pdl *it = pdl_pdlnew();
if (!it) return it;
it->datatype = anyval.type;
it->broadcastids[0] = it->ndims = 0; /* 0 dims in a scalar */
pdl_resize_defaultincs(it);
pdl_error PDL_err = pdl_allocdata(it);
if (PDL_err.error) { pdl_destroy(it); return NULL; }
it->value = anyval.value;
it->state &= ~(PDL_NOMYDIMS); /* has dims */
return it;
}
pdl_error pdl__converttypei_new_recprotect(pdl *PARENT, pdl *CHILD, pdl_datatypes totype, pdl_datatypes force_intype, int recurse_count);
pdl_error pdl__get_convertedpdl_recprotect(pdl *old, pdl **retval, pdl_datatypes type, char switch_sense, int recurse_count) {
pdl_error PDL_err = {0, NULL, 0};
PDL_RECURSE_CHECK(recurse_count);
PDLDEBUG_f(printf("pdl_get_convertedpdl switch_sense=%d\n", (int)switch_sense));
if (old->datatype == type) { *retval = old; return PDL_err; }
char was_flowing = (old->state & PDL_DATAFLOW_F);
pdl *it = pdl_pdlnew();
if (!it) return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
if (switch_sense) {
PDL_err = pdl__converttypei_new_recprotect(it, old, old->datatype, type, recurse_count + 1);
if (PDL_err.error) { pdl_destroy(it); return PDL_err; }
PDL_err = pdl_setdims(it, old->dims, old->ndims);
if (!PDL_err.error && switch_sense > 1 && old->data) { /* NULL data = unallocated "zeroes" */
PDLDEBUG_f(printf("pdl_get_convertedpdl back-pump because inplace\n"));
PDL_err = pdl__make_physical_recprotect(it, recurse_count + 1);
if (!PDL_err.error) WRITEDATA(old->trans_parent);
}
} else
PDL_err = pdl__converttypei_new_recprotect(old, it, type, old->datatype, recurse_count + 1);
if (PDL_err.error) { pdl_destroy(it); return PDL_err; }
if (was_flowing)
it->state |= PDL_DATAFLOW_F;
*retval = it;
return PDL_err;
}
pdl *pdl_get_convertedpdl(pdl *old, pdl_datatypes type) {
pdl *retval;
pdl_error PDL_err = pdl__get_convertedpdl_recprotect(old, &retval, type, 0, 0);
return PDL_err.error ? NULL : retval;
}
pdl_error pdl_allocdata(pdl *it) {
pdl_error PDL_err = {0, NULL, 0};
PDLDEBUG_f(printf("pdl_allocdata %p, %"IND_FLAG", %d\n",it, it->nvals,
it->datatype));
if (it->nvals < 0)
return pdl_make_error(PDL_EUSERERROR, "Tried to allocdata with %"IND_FLAG" values", it->nvals);
PDL_Indx nbytes = it->nvals * pdl_howbig(it->datatype);
PDL_Indx ncurr = it->nbytes;
if (ncurr == nbytes)
return PDL_err; /* Nothing to be done */
if (it->state & PDL_DONTTOUCHDATA)
return pdl_make_error_simple(PDL_EUSERERROR, "Trying to touch data of an untouchable (mmapped?) pdl");
char was_useheap = (ncurr > sizeof(it->value)),
will_useheap = (nbytes > sizeof(it->value));
if (!was_useheap && !will_useheap) {
it->data = &it->value;
} else if (!will_useheap) {
/* was heap, now not */
void *data_old = it->data;
memmove(it->data = &it->value, data_old, PDLMIN(ncurr, nbytes));
SvREFCNT_dec((SV*)it->datasv);
it->datasv = NULL;
} else {
/* now change to be heap */
if (it->datasv == NULL)
it->datasv = newSVpvn("", 0);
(void)SvGROW((SV*)it->datasv, nbytes);
SvCUR_set((SV*)it->datasv, nbytes);
if (it->data && !was_useheap)
memmove(SvPV_nolen((SV*)it->datasv), it->data, PDLMIN(ncurr, nbytes));
it->data = SvPV_nolen((SV*)it->datasv);
}
if (nbytes > ncurr) memset(it->data + ncurr, 0, nbytes - ncurr);
it->nbytes = nbytes;
it->state |= PDL_ALLOCATED;
PDLDEBUG_f(pdl_dump(it));
return PDL_err;
}
pdl* pdl_pdlnew(void) {
pdl *it = (pdl*) malloc(sizeof(pdl));
if (!it) return it;
memset(it, 0, sizeof(pdl));
it->magicno = PDL_MAGICNO;
it->datatype = PDL_D;
it->trans_parent = NULL;
it->vafftrans = NULL;
it->data = it->datasv = it->sv = NULL;
it->has_badvalue = 0;
it->state = PDL_NOMYDIMS;
it->dims = it->def_dims;
it->nbytes = it->nvals = it->dims[0] = 0;
it->dimincs = it->def_dimincs;
it->dimincs[0] = 1;
it->nbroadcastids = 1;
it->broadcastids = it->def_broadcastids;
it->broadcastids[0] = it->ndims = 1;
it->trans_children = it->def_trans_children;
it->ntrans_children_allocated = PDL_NCHILDREN;
it->ntrans_children = 0;
it->magic = 0;
it->hdrsv = 0;
PDLDEBUG_f(printf("pdl_pdlnew %p (size=%zu)\n",it,sizeof(pdl)));
return it;
}
void pdl_vafftrans_free(pdl *it)
{
if (it->vafftrans && it->vafftrans->incs)
free(it->vafftrans->incs);
if (it->vafftrans)
free(it->vafftrans);
it->vafftrans=0;
it->state &= ~PDL_OPT_VAFFTRANSOK;
}
pdl_error pdl_vafftrans_alloc(pdl *it)
{
pdl_error PDL_err = {0, NULL, 0};
if (!it->vafftrans) {
it->vafftrans = malloc(sizeof(*(it->vafftrans)));
if (!it->vafftrans) return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
it->vafftrans->incs = 0;
it->vafftrans->ndims = 0;
}
if (!it->vafftrans->incs || it->vafftrans->ndims < it->ndims ) {
if (it->vafftrans->incs) free(it->vafftrans->incs);
it->vafftrans->incs = malloc(sizeof(*(it->vafftrans->incs))
* (size_t)it->ndims);
if (!it->vafftrans->incs) return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
it->vafftrans->ndims = it->ndims;
}
return PDL_err;
}
/* Recursive! */
void pdl_vafftrans_remove(pdl * it, char this_one)
{
PDLDEBUG_f(printf("pdl_vafftrans_remove: %p, this_one=%d\n", it, (int)this_one));
PDL_Indx i, j;
for (i = 0; i < it->ntrans_children_allocated; i++) {
pdl_trans *t = it->trans_children[i];
if (!t || !(t->flags & PDL_ITRANS_ISAFFINE)) continue;
for (j=t->vtable->nparents; j<t->vtable->npdls; j++)
pdl_vafftrans_remove(t->pdls[j], 1);
}
if (this_one) pdl_vafftrans_free(it);
}
/* Explicit free. Do not use, use destroy instead, which causes this
to be called when the time is right */
pdl_error pdl__free(pdl *it) {
pdl_error PDL_err = {0, NULL, 0};
PDLDEBUG_f(printf("pdl__free %p\n",it));
PDL_CHKMAGIC(it);
/* now check if magic is still there */
if (pdl__ismagic(it))
PDLDEBUG_f(printf("%p is still magic\n",it);pdl__print_magic(it));
it->magicno = 0x42424245;
if (it->dims != it->def_dims) free(it->dims);
if (it->dimincs != it->def_dimincs) free(it->dimincs);
if (it->broadcastids != it->def_broadcastids) free(it->broadcastids);
if (it->trans_children != it->def_trans_children) free(it->trans_children);
if (it->vafftrans) {
pdl_vafftrans_free(it);
}
/* Call special freeing magic, if exists */
if (PDL_ISMAGIC(it)) {
pdl__call_magic(it, PDL_MAGIC_DELETEDATA);
pdl__magic_free(it);
}
if (it->datasv) {
PDLDEBUG_f(printf("SvREFCNT_dec datasv=%p\n",it->datasv));
SvREFCNT_dec(it->datasv);
it->data=0;
}
if (it->hdrsv) {
PDLDEBUG_f(printf("SvREFCNT_dec hdrsv=%p\n",it->hdrsv));
SvREFCNT_dec(it->hdrsv);
it->hdrsv = 0;
}
free(it);
PDLDEBUG_f(printf("pdl__free end %p\n",it));
return PDL_err;
}
/* NULL out the pdl from the trans's inputs, and the trans from the
pdl's trans_children */
void pdl__remove_pdl_as_trans_input(pdl *it,pdl_trans *trans, PDL_Indx param_ind)
{
pdl_transvtable *vtable = trans->vtable;
PDLDEBUG_f(printf("pdl__remove_pdl_as_trans_input(%s=%p, pdl=%p, param_ind=%td): \n",
vtable->name, trans, it, param_ind));
PDL_Indx trans_children_index = trans->ind_sizes[vtable->ninds + param_ind];
if (it->trans_children[trans_children_index] != trans) {
/* this might be due to a croak when performing the trans; so
warn only for now, otherwise we leave trans undestructed ! */
pdl_pdl_warn("Child not found for pdl %p, trans %p=%s\n",it, trans, vtable->name);
return;
}
it->trans_children[trans_children_index] = NULL;
it->ntrans_children--;
if (trans_children_index < it->first_trans_child_available)
it->first_trans_child_available = trans_children_index;
}
/* NULL out the trans's nth pdl in/output, and this trans as pdl's
trans_parent */
void pdl__remove_pdl_as_trans_output(pdl *it, pdl_trans *trans, PDL_Indx nth)
{
PDLDEBUG_f(printf("pdl__remove_pdl_as_trans_output from %p (%s=%p): %"IND_FLAG"\n",
it, trans->vtable->name, trans, nth));
trans->pdls[nth] = 0;
if (it->trans_parent != trans) return; /* only do rest if trans is parent */
it->trans_parent = 0;
PDLDEBUG_f(printf("pdl__remove_pdl_as_trans_output turning off MYDIMS_TRANS and ANYCHANGED, was: "); pdl_dump_flags_fixspace(it->state, 0, PDL_FLAGS_PDL));
it->state &= ~(PDL_MYDIMS_TRANS | PDL_ANYCHANGED);
}
pdl_error pdl_trans_finaldestroy(pdl_trans *trans)
{
pdl_error PDL_err = {0, NULL, 0};
PDLDEBUG_f(printf("pdl_trans_finaldestroy %p\n", trans));
FREETRANS(trans, 1);
if (trans->vtable->flags & PDL_TRANS_DO_BROADCAST)
pdl_freebroadcaststruct(&trans->broadcast);
trans->vtable = 0; /* Make sure no-one uses this */
PDLDEBUG_f(printf("call free\n"));
if (trans->params) free(trans->params);
free(trans->ind_sizes);
free(trans->inc_sizes);
free(trans);
return PDL_err;
}
pdl_error pdl__destroy_recprotect(pdl *it, int recurse_count);
pdl_error pdl_destroytransform(pdl_trans *trans, int ensure, int recurse_count)
{
pdl_error PDL_err = {0, NULL, 0};
PDL_TR_CHKMAGIC(trans);
PDL_Indx j;
pdl_transvtable *vtable = trans->vtable;
if (!vtable)
return pdl_make_error(PDL_EFATAL, "ZERO VTABLE DESTTRAN 0x%p %d\n",trans,ensure);
char ismutual = (trans->flags & PDL_ITRANS_DO_DATAFLOW_ANY);
PDLDEBUG_f(printf("pdl_destroytransform %s=%p (ensure=%d ismutual=%d)\n",
vtable->name,trans,ensure,(int)ismutual));
if (ensure)
PDL_ACCUMERROR(PDL_err, pdl__ensure_trans(trans, ismutual ? 0 : PDL_PARENTDIMSCHANGED, 0, recurse_count+1));
pdl *destbuffer[vtable->npdls];
int ndest = 0;
for (j=0; j<vtable->nparents; j++) {
pdl *parent = trans->pdls[j];
if (!parent) continue;
PDL_CHKMAGIC(parent);
pdl__remove_pdl_as_trans_input(parent,trans,j);
if (!(parent->state & PDL_DESTROYING) && !parent->sv) {
parent->state |= PDL_DESTROYING; /* so no mark twice */
destbuffer[ndest++] = parent;
}
}
for (j=vtable->nparents; j<vtable->npdls; j++) {
pdl *child = trans->pdls[j];
PDL_CHKMAGIC(child);
pdl__remove_pdl_as_trans_output(child,trans,j);
if (ismutual && child->vafftrans) pdl_vafftrans_remove(child, 1);
if ((!(child->state & PDL_DESTROYING) && !child->sv) ||
(vtable->par_flags[j] & PDL_PARAM_ISTEMP)) {
child->state |= PDL_DESTROYING; /* so no mark twice */
destbuffer[ndest++] = child;
}
}
PDL_ACCUMERROR(PDL_err, pdl_trans_finaldestroy(trans));
for (j=0; j<ndest; j++) {
destbuffer[j]->state &= ~PDL_DESTROYING; /* safe, set by us */
PDL_ACCUMERROR(PDL_err, pdl__destroy_recprotect(destbuffer[j], recurse_count+1));
}
PDLDEBUG_f(printf("pdl_destroytransform leaving %p\n", trans));
return PDL_err;
}
/*
A ndarray may be
- a parent of something - just ensure & destroy
- a child of something - just ensure & destroy
- parent of two pdls which both propagate backwards - mustn't destroy.
- both parent and child at same time, to something that propagates.
Therefore, simple rules:
- allowed to destroy if
1. a parent with max. 1 backwards propagating transformation
2. a child with no trans_children
When an ndarray is destroyed, it must tell its trans_children and/or
parent.
*/
pdl_error pdl__destroy_recprotect(pdl *it, int recurse_count) {
pdl_error PDL_err = {0, NULL, 0};
int nback=0,nback2=0,nforw=0,nforw2=0;
int nafn=0;
PDL_CHKMAGIC(it);
PDLDEBUG_f(printf("pdl_destroy: ");pdl_dump(it));
if (it->state & PDL_DESTROYING) {
PDLDEBUG_f(printf(" already destroying, returning\n"));
return PDL_err;
}
it->state |= PDL_DESTROYING;
/* Clear the sv field so that there will be no dangling ptrs */
if (it->sv) {
mg_free((SV *)it->sv);
sv_setiv(it->sv, 0);
it->sv = NULL;
}
/* 1. count the trans_children that do flow */
PDL_Indx i;
for (i = 0; i < it->ntrans_children_allocated; i++) {
pdl_trans *curt = it->trans_children[i];
if (!curt) continue;
PDL_TR_CHKMAGIC(curt);
if (curt->flags & PDL_ITRANS_DO_DATAFLOW_F) {
nforw++;
/* where more than two inputs must always be soft-destroyed */
if (curt->vtable->nparents > 1) nforw2++;
}
if (curt->flags & PDL_ITRANS_DO_DATAFLOW_B) {
nback++;
/* where more than two in relationship must always be soft-destroyed */
if (curt->vtable->npdls > 2) nback2++;
}
if ((curt->flags & PDL_ITRANS_ISAFFINE) && !(curt->pdls[1]->state & PDL_ALLOCATED))
nafn++;
}
char soft_destroy = 0;
PDLDEBUG_f(printf(" nba(%d, %d), nforw(%d, %d), tra(%p=%s), nafn(%d)\n",
nback, nback2, nforw, nforw2, it->trans_parent, it->trans_parent?it->trans_parent->vtable->name:"", nafn));
if (nback2 > 0) { PDLDEBUG_f(printf(" soft_destroy: nback2=%d\n", nback2)); soft_destroy = 1; }
if (nback > 1) { PDLDEBUG_f(printf(" soft_destroy: nback=%d\n", nback)); soft_destroy = 1; }
if (it->trans_parent && nforw) { PDLDEBUG_f(printf(" soft_destroy: has parent and nforw=%d\n", nforw)); soft_destroy = 1; }
if (nforw2 > 0) { PDLDEBUG_f(printf(" soft_destroy: nforw2=%d\n", nforw2)); soft_destroy = 1; }
/* Also, we do not wish to destroy if the trans_children would be larger
* than the parent and are currently not allocated (e.g. lags).
* Because this is too much work to check, we refrain from destroying
* for now if there is an affine child that is not allocated
*/
if (nafn) { PDLDEBUG_f(printf(" soft_destroy: nafn=%d\n", nafn)); soft_destroy = 1; }
if (pdl__magic_isundestroyable(it)) {
PDLDEBUG_f(printf(" not destroying as magic %p\n", it));
soft_destroy = 1;
}
if (soft_destroy) {
it->state &= ~PDL_DESTROYING;
return PDL_err;
}
for (i = 0; i < it->ntrans_children_allocated; i++) {
pdl_trans *t = it->trans_children[i];
if (!t) continue;
PDL_RETERROR(PDL_err, pdl_destroytransform(t, 1, recurse_count+1));
}
pdl_trans *trans = it->trans_parent;
if (trans)
/* Ensure only if there are other children! */
PDL_RETERROR(PDL_err, pdl_destroytransform(trans,
trans->vtable->npdls - trans->vtable->nparents > 1, recurse_count+1));
/* Here, this is a child but has no children - fall through to hard_destroy */
PDL_RETERROR(PDL_err, pdl__free(it));
PDLDEBUG_f(printf("pdl_destroy end %p\n",it));
return PDL_err;
}
pdl_error pdl_destroy(pdl *it) {
return pdl__destroy_recprotect(it, 0);
}
/* Straight copy, no dataflow */
pdl *pdl_hard_copy(pdl *src) {
PDLDEBUG_f(printf("pdl_hard_copy (src=%p): ", src));
pdl *it = pdl_pdlnew();
if (!it) return it;
pdl_error PDL_err = {0, NULL, 0};
PDL_RETERROR2(PDL_err, pdl_affine_new(src, it, 0, src->dims, src->ndims, src->dimincs, src->ndims), pdl_destroy(it); return NULL;);
PDLDEBUG_f(printf("pdl_hard_copy (src=%p): ", src);pdl_dump(it));
it->sv = (void *)1; /* stop sever from tidying it up */
PDL_RETERROR2(PDL_err, pdl_sever(it), pdl_destroy(it); return NULL;);
it->sv = NULL; /* destroyable again */
return it;
}
/* Reallocate this PDL to have ndims dimensions. */
pdl_error pdl_reallocdims(pdl *it, PDL_Indx ndims) {
pdl_error PDL_err = {0, NULL, 0};
if (it->ndims < ndims) { /* Need to realloc for more */
if (it->dims != it->def_dims) free(it->dims);
if (it->dimincs != it->def_dimincs) free(it->dimincs);
if (ndims>PDL_NDIMS) { /* Need to malloc */
if (!(it->dims = malloc(ndims*sizeof(*(it->dims)))))
return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
if (!(it->dimincs = malloc(ndims*sizeof(*(it->dimincs))))) {
free(it->dims);
return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
}
}
else {
it->dims = it->def_dims;
it->dimincs = it->def_dimincs;
}
}
it->ndims = ndims;
return PDL_err;
}
/* Reallocate n broadcastids. Set the new extra ones to the end */
pdl_error pdl_reallocbroadcastids(pdl *it, PDL_Indx n) {
pdl_error PDL_err = {0, NULL, 0};
PDL_Indx i;
PDL_Indx *olds; PDL_Indx nold;
if (n <= it->nbroadcastids) {
it->nbroadcastids = n;
it->broadcastids[n-1] = it->ndims;
return PDL_err;
}
nold = it->nbroadcastids; olds = it->broadcastids;
if (n > PDL_NBROADCASTIDS) {
it->broadcastids = malloc(sizeof(*(it->broadcastids))*n);
if (!it->broadcastids) return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
} else {
it->broadcastids = it->def_broadcastids;
}
it->nbroadcastids = n;
if (it->broadcastids != olds) {
for (i=0; i<nold && i<n; i++)
it->broadcastids[i] = olds[i];
}
if (olds != it->def_broadcastids) { free(olds); }
for (i=nold; i<it->nbroadcastids; i++) {
it->broadcastids[i] = it->ndims;
}
return PDL_err;
}
/* Recalculate default increments */
void pdl_resize_defaultincs(pdl *it) {
PDL_Indx inc = 1, i = 0;
for (i=0; i<it->ndims; i++) {
it->dimincs[i] = inc; inc *= it->dims[i];
}
if (it->nvals != inc) /* Need to realloc only if nvals changed */
it->state &= ~PDL_ALLOCATED;
it->nvals = inc;
}
/* Init dims & incs - if *incs is NULL ignored (but space is always same for both) */
pdl_error pdl_setdims(pdl* it, PDL_Indx * dims, PDL_Indx ndims) {
pdl_error PDL_err = {0, NULL, 0};
PDLDEBUG_f(printf("pdl_setdims %p: ", it);pdl_print_iarr(dims, ndims);printf("\n"));
if (it->trans_parent)
return pdl_make_error(PDL_EUSERERROR,
"setdims called on %p but has trans_parent %s",
it, it->trans_parent->vtable->name
);
PDL_Indx i, old_nvals = it->nvals, new_nvals = 1;
for (i=0; i<ndims; i++) new_nvals *= dims[i];
int what = (old_nvals == new_nvals) ? 0 : PDL_PARENTDATACHANGED;
if ((it->state & PDL_NOMYDIMS) || ndims != it->ndims)
what |= PDL_PARENTDIMSCHANGED;
else
for (i=0; i<ndims; i++)
if (dims[i] != it->dims[i]) { what |= PDL_PARENTDIMSCHANGED; break; }
if (!what) { PDLDEBUG_f(printf("pdl_setdims NOOP\n")); return PDL_err; }
PDL_RETERROR(PDL_err, pdl_reallocdims(it,ndims));
for (i=0; i<ndims; i++) it->dims[i] = dims[i];
pdl_resize_defaultincs(it);
PDL_RETERROR(PDL_err, pdl_reallocbroadcastids(it,1));
it->broadcastids[0] = ndims;
it->state &= ~PDL_NOMYDIMS;
CHANGED(it,what,0);
return PDL_err;
}
/* This is *not* careful! */
pdl_error pdl_setdims_careful(pdl *it)
{
pdl_error PDL_err = {0, NULL, 0};
pdl_resize_defaultincs(it);
PDL_err = pdl_reallocbroadcastids(it,1); /* XXX For now */
return PDL_err;
}
/*CORE21 unused*/
PDL_Anyval pdl_get_offs(pdl *it, PDL_Indx offs) {
PDL_Anyval result = { PDL_INVALID, {0} };
ANYVAL_FROM_CTYPE_OFFSET(result, it->datatype, it->data, offs);
return result;
}
pdl_error pdl__add_pdl_as_trans_input(pdl *it,pdl_trans *trans, PDL_Indx param_ind)
{
pdl_error PDL_err = {0, NULL, 0};
pdl_transvtable *vtable = trans->vtable;
PDLDEBUG_f(printf("pdl__add_pdl_as_trans_input add to %p trans=%s param_ind=%td\n", it, vtable->name, param_ind));
PDL_Indx i, trans_children_index = 0;
for (trans_children_index = it->first_trans_child_available; trans_children_index < it->ntrans_children_allocated; trans_children_index++)
if (!it->trans_children[trans_children_index]) break;
if (trans_children_index >= it->ntrans_children_allocated) {
if (it->trans_children == it->def_trans_children) {
it->trans_children = malloc(
sizeof(pdl_trans*) * (it->ntrans_children_allocated += PDL_NCHILDREN)
);
if (!it->trans_children) return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
for (i = 0; i < PDL_NCHILDREN; i++)
it->trans_children[i] = it->def_trans_children[i];
for (; i < it->ntrans_children_allocated; i++)
it->trans_children[i] = NULL;
} else {
it->trans_children = realloc(it->trans_children,
sizeof(pdl_trans*) * (it->ntrans_children_allocated += PDL_NCHILDREN)
);
if (!it->trans_children) return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
for (i = trans_children_index+1; i < it->ntrans_children_allocated; i++)
it->trans_children[i] = NULL;
}
}
if (trans_children_index > it->first_trans_child_available)
it->first_trans_child_available = trans_children_index;
it->ntrans_children++;
trans->ind_sizes[vtable->ninds + param_ind] = trans_children_index;
it->trans_children[trans_children_index] = trans;
return PDL_err;
}
pdl_error pdl_prealloc_trans_children(pdl *it, PDL_Indx howmany) {
pdl_error PDL_err = {0, NULL, 0};
PDL_Indx i, oldval = it->ntrans_children_allocated;
if (howmany > oldval) {
if (it->trans_children == it->def_trans_children) {
it->trans_children = malloc(
sizeof(pdl_trans*) * (it->ntrans_children_allocated = howmany)
);
if (!it->trans_children) return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
for (i = 0; i < PDL_NCHILDREN; i++)
it->trans_children[i] = it->def_trans_children[i];
} else {
it->trans_children = realloc(it->trans_children,
sizeof(pdl_trans*) * (it->ntrans_children_allocated = howmany)
);
if (!it->trans_children) return pdl_make_error_simple(PDL_EFATAL, "Out of Memory\n");
}
for (i = oldval; i < howmany; i++)
it->trans_children[i] = NULL;
}
return PDL_err;
}
pdl_error pdl__make_physdims_recprotect(pdl *it, int recurse_count) {
pdl_error PDL_err = {0, NULL, 0};
PDL_RECURSE_CHECK(recurse_count);
if (!it) return pdl_make_error_simple(PDL_EFATAL, "make_physdims called with NULL");
PDLDEBUG_f(printf("make_physdims %p state=", it);pdl_dump_flags_fixspace(it->state, 0, PDL_FLAGS_PDL));
PDL_CHKMAGIC(it);
if (!(it->state & PDL_PARENTDIMSCHANGED)) {
PDLDEBUG_f(printf("make_physdims exit (NOP) %p\n", it));
return PDL_err;
}
pdl_trans *trans = it->trans_parent;
PDLDEBUG_f(printf("make_physdims %p TRANS: ",it);pdl_dump_trans_fixspace(trans,3));
PDL_Indx i;
for (i=0; i<trans->vtable->nparents; i++)
if (trans->pdls[i]->state & PDL_PARENTDIMSCHANGED)
PDL_RETERROR(PDL_err, pdl__make_physdims_recprotect(trans->pdls[i], recurse_count+1));
PDLDEBUG_f(printf("make_physdims: calling redodims trans=%p on pdl=%p\n", trans, it));
REDODIMS(PDL_RETERROR, trans);
PDLDEBUG_f(printf("make_physdims exit pdl=%p\n", it));
return PDL_err;
}
pdl_error pdl_make_physdims(pdl *it) {
return pdl__make_physdims_recprotect(it, 0);
}
static inline char _trans_forward_only(pdl *p) {
pdl_trans *tp = p->trans_parent;
return !!(tp && (tp->flags & PDL_ITRANS_DO_DATAFLOW_ANY) == PDL_ITRANS_DO_DATAFLOW_F);
}
static inline pdl_error pdl_trans_flow_null_checks(pdl_trans *trans, char *disable_back) {
pdl_error PDL_err = {0, NULL, 0};
PDL_Indx i;
pdl_transvtable *vtable = trans->vtable;
char input_forward_only = 0;
for (i=0; i<vtable->nparents; i++) {
pdl *parent = trans->pdls[i];
if (_trans_forward_only(parent))
input_forward_only = 1;
if (parent->state & PDL_NOMYDIMS && !(vtable->par_flags[i] & PDL_PARAM_ALLOW_NULL))
return pdl_make_error(PDL_EUSERERROR,
"Error in %s: input parameter '%s' is null",
vtable->name, vtable->par_names[i]
);
}
for (; i<vtable->npdls; i++) {
pdl *child = trans->pdls[i];
if (_trans_forward_only(child))
return pdl_make_error(PDL_EUSERERROR, "%s: cannot output to parameter '%s' with inward but no backward flow", vtable->name, vtable->par_names[i]);
if (child->state & PDL_NOMYDIMS && !(vtable->par_flags[i] & PDL_PARAM_ISCREAT))
return pdl_make_error(PDL_EUSERERROR,
"Error in %s: io parameter '%s' is null",
vtable->name, vtable->par_names[i]
);
}
*disable_back = input_forward_only;
return PDL_err;
}
/* Called with a filled pdl_trans struct.
* Sets the parent and trans fields of the ndarrays correctly,
* creating families and the like if necessary.
* Alternatively may just execute transformation
* that would require families but is not dataflowed.
*/
pdl_error pdl_make_trans_mutual(pdl_trans *trans)
{
pdl_error PDL_err = {0, NULL, 0};
PDLDEBUG_f(printf("make_trans_mutual ");pdl_dump_trans_fixspace(trans,0));
pdl_transvtable *vtable = trans->vtable;
pdl **pdls = trans->pdls;
PDL_Indx i, npdls=vtable->npdls, nparents=vtable->nparents;
PDL_TR_CHKMAGIC(trans);
char disable_back = 0, inputs_bad = 0;
for (i=0; i<npdls; i++) {
pdl *pdl = pdls[i];
if ((vtable->par_flags[i] & (PDL_PARAM_ISOUT|PDL_PARAM_ISTEMP)) ||
!(pdl->state & PDL_BADVAL)) continue;
inputs_bad = trans->bvalflag = 1;
break;
}
if (trans->bvalflag && (vtable->flags & PDL_TRANS_BADIGNORE)) {
pdl_pdl_warn("WARNING: %s does not handle bad values", vtable->name);
trans->bvalflag = 0; /* but still return true */
}
PDL_err = pdl_trans_flow_null_checks(trans, &disable_back);
if (PDL_err.error) {
PDL_ACCUMERROR(PDL_err, pdl_trans_finaldestroy(trans));
return PDL_err;
}
for (i=0; i<nparents; i++) {
pdl *parent = pdls[i];
PDL_RETERROR(PDL_err, pdl__add_pdl_as_trans_input(parent,trans,i));
if (parent->state & PDL_DATAFLOW_F) {
parent->state &= ~PDL_DATAFLOW_F;
trans->flags |= PDL_ITRANS_DO_DATAFLOW_F;
}
}
char dataflow = !!(trans->flags & PDL_ITRANS_DO_DATAFLOW_ANY);
PDLDEBUG_f(printf("make_trans_mutual dataflow=%d disable_back=%d\n", (int)dataflow, (int)disable_back));
if (dataflow && disable_back)
trans->flags &= ~PDL_ITRANS_DO_DATAFLOW_B;
PDL_BITFIELD_ENT wasnull[PDL_BITFIELD_SIZE(npdls)];
PDL_BITFIELD_ZEROISE(wasnull, npdls);
for (i=nparents; i<npdls; i++) {
pdl *child = pdls[i];
if (child->state & PDL_NOMYDIMS) PDL_BITFIELD_SET(wasnull, i);
PDLDEBUG_f(printf("make_trans_mutual child=%p wasnull[%"IND_FLAG"]=%d\n", child, i, PDL_BITFIELD_ISSET(wasnull, i)));
if (dataflow) {
/* This is because for "+=" (a = a + b) we must check for
previous parent transformations and mutate if they exist
if no dataflow. */
PDLDEBUG_f(printf("make_trans_mutual turning on allchanged, before="); pdl_dump_flags_fixspace(child->state, 0, PDL_FLAGS_PDL));
child->state |= PDL_PARENTDIMSCHANGED | ((trans->flags & PDL_ITRANS_ISAFFINE) ? 0 : PDL_PARENTDATACHANGED);
PDLDEBUG_f(printf("make_trans_mutual after change="); pdl_dump_flags_fixspace(child->state, 0, PDL_FLAGS_PDL));
}
if (!child->trans_parent || PDL_BITFIELD_ISSET(wasnull, i)) child->trans_parent = trans;
if (PDL_BITFIELD_ISSET(wasnull, i))
child->state = (child->state & ~PDL_NOMYDIMS) | PDL_MYDIMS_TRANS;
}
if (inputs_bad)
for (i=nparents; i<npdls; i++)
pdl_propagate_badflag_dir(pdls[i], 1, 1, 1);
if (!dataflow) {
PDL_ACCUMERROR(PDL_err, pdl__ensure_trans(trans, PDL_PARENTDIMSCHANGED, 0, 0));
if (PDL_err.error)
PDLDEBUG_f(printf("make_trans_mutual got error in ensure, not calling CHANGED on children\n"));
else
for (i=vtable->nparents; i<vtable->npdls; i++) {
pdl *child = trans->pdls[i];
char isvaffine = !!PDL_VAFFOK(child);
PDLDEBUG_f(printf("make_trans_mutual isvaffine=%d wasnull=%d\n", (int)isvaffine, PDL_BITFIELD_ISSET(wasnull, i)));
if (!isvaffine || PDL_BITFIELD_ISSET(wasnull, i))
CHANGED(child, PDL_BITFIELD_ISSET(wasnull, i) ? PDL_PARENTDIMSCHANGED : PDL_PARENTDATACHANGED, 0);
if (isvaffine)
CHANGED(child->vafftrans->from,PDL_PARENTDATACHANGED,0);
}
PDL_ACCUMERROR(PDL_err, pdl_destroytransform(trans,0,0));
}
PDLDEBUG_f(printf("make_trans_mutual exit %p\n",trans));
return PDL_err;
} /* pdl_make_trans_mutual() */
pdl_error pdl_redodims_default(pdl_trans *trans) {
pdl_error PDL_err = {0, NULL, 0};
PDLDEBUG_f(printf("pdl_redodims_default ");pdl_dump_trans_fixspace(trans,0));
pdl_transvtable *vtable = trans->vtable;
if (vtable->flags & PDL_TRANS_DO_BROADCAST) {
PDL_Indx creating[vtable->npdls], i, j;
pdl **pdls = trans->pdls;
for (i=0; i<vtable->npdls; i++)
creating[i] = (vtable->par_flags[i] & PDL_PARAM_ISCREAT) &&
PDL_DIMS_FROM_TRANS(trans,pdls[i]);
PDL_RETERROR(PDL_err, pdl_initbroadcaststruct(2, pdls,
vtable->par_realdims, creating, vtable->npdls, vtable,
&trans->broadcast, NULL, NULL,
NULL, vtable->flags & PDL_TRANS_NO_PARALLEL));
PDL_RETERROR(PDL_err, pdl_dim_checks(vtable, pdls, &trans->broadcast, trans->broadcast.nimpl, creating, trans->ind_sizes, 0));
for (i=0; i<vtable->npdls; i++) {
PDL_Indx ninds = vtable->par_realdims[i];
short flags = vtable->par_flags[i];
if (!creating[i]) continue;
PDL_Indx dims[PDLMAX(ninds+1, 1)];
for (j=0; j<ninds; j++)
dims[j] = trans->ind_sizes[PDL_IND_ID(vtable, i, j)];
if (flags & PDL_PARAM_ISTEMP)
dims[ninds] = 1;
PDL_RETERROR(PDL_err, pdl_broadcast_create_parameter(
&trans->broadcast,i,dims,
flags & PDL_PARAM_ISTEMP
));
}
for (i=0; i<vtable->npdls; i++) {
pdl *pdl = pdls[i];
for (j=0; j<vtable->par_realdims[i]; j++)
trans->inc_sizes[PDL_INC_ID(vtable,i,j)] =
(pdl->ndims <= j || pdl->dims[j] <= 1) ? 0 :
PDL_REPRINC(pdl,j);
}
}
pdl_hdr_childcopy(trans);
trans->dims_redone = 1;
return PDL_err;
}
pdl_error pdl__make_physical_recprotect(pdl *it, int recurse_count) {
pdl_error PDL_err = {0, NULL, 0};
PDL_RECURSE_CHECK(recurse_count);
PDLDEBUG_f(printf("make_physical %p\n",it));
pdl_trans *trans = it->trans_parent;
PDL_CHKMAGIC(it);
if (
!(it->state & PDL_ANYCHANGED) && /* unchanged and */
!(trans && !(it->state & PDL_ALLOCATED) && (trans->flags & PDL_ITRANS_ISAFFINE)) /* not pure vaffine in waiting */
) {
PDL_ENSURE_ALLOCATED(it);
} else {
if (!trans)
return pdl_make_error_simple(PDL_EFATAL, "PDL Not physical but doesn't have parent");
if (trans->flags & PDL_ITRANS_ISAFFINE) {
PDLDEBUG_f(printf("make_physical: affine\n"));
trans->pdls[1]->state |= PDL_PARENTDATACHANGED;
PDL_RETERROR(PDL_err, pdl__make_physvaffine_recprotect(it, recurse_count+1));
} else
PDL_RETERROR(PDL_err, pdl__ensure_trans(trans,0,1,recurse_count+1));
}
PDLDEBUG_f(printf("make_physical exiting: "); pdl_dump(it));
return PDL_err;
}
pdl_error pdl_make_physical(pdl *it) {
return pdl__make_physical_recprotect(it, 0);
}
/* recursing = 0 when heading upwards, 1 when it reaches top and starts going downwards */
pdl_error pdl_changed(pdl *it, int what, int recursing) {
pdl_error PDL_err = {0, NULL, 0};
PDL_Indx i, j;
PDLDEBUG_f(
printf("pdl_changed: entry for pdl %p recursing: %d, what=",it,recursing);
pdl_dump_flags_fixspace(what,0,PDL_FLAGS_PDL);
);
pdl_trans *trans = it->trans_parent;
if (recursing) {
PDLDEBUG_f(printf("pdl_changed: adding what to state except pure vaff, currently="); pdl_dump_flags_fixspace(it->state,0,PDL_FLAGS_PDL));
it->state |= !( /* neither */
((it->state & (PDL_OPT_VAFFTRANSOK|PDL_ALLOCATED)) == PDL_OPT_VAFFTRANSOK) || /* already pure vaff nor */
(trans && !(it->state & PDL_ALLOCATED) && (trans->flags & PDL_ITRANS_ISAFFINE)) /* pure vaffine in waiting */
) ? what : what & ~PDL_PARENTDATACHANGED;
if (pdl__ismagic(it)) pdl__call_magic(it,PDL_MAGIC_MARKCHANGED);
}
if (trans && !recursing && (trans->flags & PDL_ITRANS_DO_DATAFLOW_B)
&& (what & PDL_PARENTDATACHANGED)) {
if (it->vafftrans) {
if (it->state & PDL_ALLOCATED) {
PDLDEBUG_f(printf("pdl_changed: calling writebackdata_vaffine (pdl %p)\n",it));
PDL_ACCUMERROR(PDL_err, pdl_writebackdata_vaffine(it));
}
CHANGED(it->vafftrans->from,what,0);
} else {
PDLDEBUG_f(printf("pdl_changed: calling writebackdata from vtable, triggered by pdl %p, using trans %p\n",it,trans));
WRITEDATA(trans);
for (i=0; i<trans->vtable->nparents; i++) {
pdl *pdl = trans->pdls[i];
CHANGED(PDL_VAFFOK(pdl) ? pdl->vafftrans->from : pdl, what, 0);
}
}
} else {
PDL_Indx i;
for (i = 0; i < it->ntrans_children_allocated; i++) {
pdl_trans *trans = it->trans_children[i];
if (!trans || !(trans->flags & PDL_ITRANS_DO_DATAFLOW_F)) continue;
for (j=trans->vtable->nparents; j<trans->vtable->npdls; j++)
if (trans->pdls[j] != it && (trans->pdls[j]->state & what) != what)
CHANGED(trans->pdls[j],what,1);
}
}
PDLDEBUG_f(printf("pdl_changed: exiting for pdl %p\n", it));
return PDL_err;
}
/* pdl_make_physvaffine can be called on *any* pdl -- vaffine or not --
it will call make_physical as needed on those
this function is the right one to call in any case if you want to
make only those physical (i.e. allocating their own data, etc) which
have to be and leave those vaffine with updated dims, etc, that do
have an appropriate transformation of which they are a child.
should probably have been called make_physcareful to point out what
it really does
*/
pdl_error pdl__make_physvaffine_recprotect(pdl *it, int recurse_count)
{
pdl_error PDL_err = {0, NULL, 0};
PDL_Indx i,j;
PDLDEBUG_f(printf("make_physvaffine %p calling ",it)); PDL_RETERROR(PDL_err, pdl__make_physdims_recprotect(it, recurse_count+1));
if (!it->trans_parent || !(it->trans_parent->flags & PDL_ITRANS_ISAFFINE)) {
PDLDEBUG_f(printf("make_physvaffine handing off to make_physical %p\n",it));
return pdl__make_physical_recprotect(it, recurse_count+1);
}
if (!it->vafftrans || it->vafftrans->ndims < it->ndims) {
PDL_RETERROR(PDL_err, pdl_vafftrans_alloc(it));
for (i=0; i<it->ndims; i++) it->vafftrans->incs[i] = it->dimincs[i];
it->vafftrans->offs = 0;
pdl *current = it;
pdl_trans *t=it->trans_parent;
do {
if (!t->incs)
return pdl_make_error(PDL_EUSERERROR, "make_physvaffine: affine trans %p has NULL incs\n", t);
pdl *parent = t->pdls[0];
PDL_Indx incsleft[it->ndims];
/* For all dimensions of the childest ndarray */
for (i=0; i<it->ndims; i++) {
/* inc = the increment at the current stage */
PDL_Indx inc = it->vafftrans->incs[i], incsign = (inc >= 0 ? 1:-1), newinc = 0;
inc *= incsign;
/* For all dimensions of the current ndarray */
for (j=current->ndims-1; j>=0 && current->dimincs[j] != 0; j--) {
/* If the absolute value > this so */
/* we have a contribution from this dimension */
if (inc < current->dimincs[j]) continue;
/* We used this many of this dim */
PDL_Indx ninced = inc / current->dimincs[j];
newinc += t->incs[j]*ninced;
inc %= current->dimincs[j];
}
incsleft[i] = incsign*newinc;
}
for (i=0; i<it->ndims; i++) it->vafftrans->incs[i] = incsleft[i];
PDL_Indx offset_left = it->vafftrans->offs;
PDL_Indx newinc = 0;
for (j=current->ndims-1; j>=0 && current->dimincs[j] != 0; j--) {
PDL_Indx cur_offset = offset_left / current->dimincs[j];
offset_left -= cur_offset * current->dimincs[j];
newinc += t->incs[j]*cur_offset;
}
it->vafftrans->offs = newinc + t->offs;
t = (current = parent)->trans_parent;
} while (t && (t->flags & PDL_ITRANS_ISAFFINE) && !(current->state & PDL_ALLOCATED));
it->vafftrans->from = current;
it->state |= PDL_OPT_VAFFTRANSOK;
}
PDLDEBUG_f(printf("make_physvaffine %p, physicalising final parent=%p\n", it, it->vafftrans->from));
PDL_RETERROR(PDL_err, pdl__make_physical_recprotect(it->vafftrans->from, recurse_count+1));
if (it->state & PDL_PARENTDATACHANGED) {
char already_allocated = (it->state & PDL_ALLOCATED);
PDL_ENSURE_ALLOCATED(it);
PDL_RETERROR(PDL_err, pdl_readdata_vaffine(it));
PDLDEBUG_f(printf("make_physvaffine pdl=%p turning off datachanged and OPT_VAFFTRANSOK, before=", it); pdl_dump_flags_fixspace(it->state, 0, PDL_FLAGS_PDL));
it->state &= ~(PDL_PARENTDATACHANGED|PDL_OPT_VAFFTRANSOK);
if (!already_allocated) pdl_vafftrans_remove(it, 0);
}
PDLDEBUG_f(printf("make_physvaffine exit %p\n", it));
return PDL_err;
}
pdl_error pdl_make_physvaffine(pdl *it)
{
return pdl__make_physvaffine_recprotect(it, 0);
}
pdl_error pdl_set_datatype(pdl *a, pdl_datatypes datatype)
{
pdl_error PDL_err = {0, NULL, 0};
PDL_Indx i;
for (i = 0; i < a->ntrans_children_allocated; i++) {
if (a->trans_children[i])
return pdl_make_error_simple(PDL_EUSERERROR, "set_datatype: ndarray has child transform");
}
if (a->trans_parent)
PDL_RETERROR(PDL_err, pdl_destroytransform(a->trans_parent,1,0));
if (a->state & PDL_NOMYDIMS)
a->datatype = datatype;
else
PDL_RETERROR(PDL_err, pdl_converttype( a, datatype ));
return PDL_err;
}
pdl_error pdl_sever(pdl *src)
{
pdl_error PDL_err = {0, NULL, 0};
if (!src->trans_parent) return PDL_err;
PDL_RETERROR(PDL_err, pdl_make_physvaffine(src));
PDL_RETERROR(PDL_err, pdl_destroytransform(src->trans_parent,1,0));
return PDL_err;
}
/* this resembles the pdl_changed logic and maybe should be in that */
#define PDL_MAYBE_PROPAGATE_BADFLAG(t, newval, is_fwd) do { \
pdl_transvtable *vtable = (t)->vtable; \
PDL_Indx i, istart = is_fwd ? vtable->nparents : 0, iend = is_fwd ? vtable->npdls : vtable->nparents; \
for (i = istart; i < iend; i++) { \
pdl *tpdl = (t)->pdls[i]; \
/* make sure we propagate if changed */ \
if (!!newval != !!(tpdl->state & PDL_BADVAL)) \
pdl_propagate_badflag_dir(tpdl, newval, is_fwd, recurse_count + 1); \
} \
} while (0)
/* newval = 1 means set flag, 0 means clear it */
pdl_error pdl_propagate_badflag_dir(pdl *it, int newval, char is_fwd, int recurse_count) {
PDL_RECURSE_CHECK(recurse_count);
PDLDEBUG_f(printf("pdl_propagate_badflag_dir pdl=%p newval=%d is_fwd=%d already=%d\n", it, newval, (int)is_fwd, !!(it->state & PDL_BADVAL)));
pdl_error PDL_err = {0, NULL, 0};
if (newval)
it->state |= PDL_BADVAL;
else
it->state &= ~PDL_BADVAL;
pdl_trans *tp = it->trans_parent;
if (!is_fwd) {
if (tp)
PDL_MAYBE_PROPAGATE_BADFLAG(tp, newval, 0);
} else {
PDLDEBUG_f(printf("pdl_propagate_badflag_dir forward pdl state="); pdl_dump_flags_fixspace(it->state, 0, PDL_FLAGS_PDL));
PDL_Indx j;
if ((
(it->state & (PDL_OPT_VAFFTRANSOK|PDL_ALLOCATED)) == PDL_OPT_VAFFTRANSOK || /* pure vaff */
(tp && !(it->state & PDL_ALLOCATED) && (tp->flags & PDL_ITRANS_ISAFFINE)) /* pure vaffine in waiting */
) && newval) /* expansive - if slice gets badflag, whole does */
PDL_MAYBE_PROPAGATE_BADFLAG(tp, newval, 0);
for (j = 0; j < it->ntrans_children_allocated; j++) {
pdl_trans *trans = it->trans_children[j];
if (!trans) continue;
PDL_MAYBE_PROPAGATE_BADFLAG(trans, newval, 1);
}
}
return PDL_err;
}
void pdl_propagate_badflag(pdl *it, int newval) { /* CORE21 get rid */
return; /* nerfed as replaced with directional version */
}
/*CORE21 use pdl_error, replace fprintf*/
void pdl_propagate_badvalue( pdl *it ) {
PDL_Indx j;
for (j = 0; j < it->ntrans_children_allocated; j++) {
pdl_trans *trans = it->trans_children[j];
if (!trans) continue;
PDL_Indx i;
for ( i = trans->vtable->nparents; i < trans->vtable->npdls; i++ ) {
pdl *child = trans->pdls[i];
PDL_Anyval typedval;
ANYVAL_TO_ANYVAL_NEWTYPE(it->badvalue, typedval, child->datatype);
if (typedval.type < 0) {
fprintf(stderr, "propagate_badvalue: error making typedval\n");
return;
}
child->has_badvalue = 1;
child->badvalue = typedval;
/* make sure we propagate to grandchildren, etc */
pdl_propagate_badvalue( child );
} /* for: i */
}
} /* pdl_propagate_badvalue */
/*CORE21 unused*/
PDL_Anyval pdl_get_badvalue( pdl_datatypes datatype ) {
PDL_Anyval retval = { PDL_INVALID, {0} };
#define X(datatype, ctype, ppsym, ...) \
retval.type = datatype; retval.value.ppsym = PDL.bvals.ppsym;
PDL_GENERICSWITCH(PDL_TYPELIST_ALL, datatype, X, return retval)
#undef X
return retval;
}
/*CORE21 unused*/
PDL_Anyval pdl_get_pdl_badvalue( pdl *it ) {
if (it->has_badvalue && it->badvalue.type != it->datatype)
return (PDL_Anyval){ PDL_INVALID, {0} };
return it->has_badvalue ? it->badvalue : pdl_get_badvalue( it->datatype );
}
pdl_trans *pdl_create_trans(pdl_transvtable *vtable) {
size_t it_sz = sizeof(pdl_trans)+(sizeof(pdl *) * vtable->npdls);
pdl_trans *it = malloc(it_sz);
if (!it) return it;
memset(it, 0, it_sz);
PDL_TR_SETMAGIC(it);
if (vtable->structsize) {
it->params = malloc(vtable->structsize);
if (!it->params) return NULL;
memset(it->params, 0, vtable->structsize);
}
it->flags = vtable->iflags;
it->dims_redone = 0;
it->bvalflag = 0;
it->vtable = vtable;
PDL_CLRMAGIC(&it->broadcast);
it->broadcast.inds = 0;
it->broadcast.gflags = 0;
it->ind_sizes = (PDL_Indx *)malloc(sizeof(PDL_Indx) * (
vtable->ninds +
vtable->nparents /* CORE21 make separate member "trans_children_indices" */
));
if (!it->ind_sizes) return NULL;
int i; for (i=0; i<vtable->ninds + vtable->nparents; i++) it->ind_sizes[i] = -1;
it->inc_sizes = (PDL_Indx *)malloc(sizeof(PDL_Indx) * vtable->nind_ids);
if (!it->inc_sizes) return NULL;
for (i=0; i<vtable->nind_ids; i++) it->inc_sizes[i] = -1;
it->offs = -1;
it->incs = NULL;
it->__datatype = PDL_INVALID;
return it;
}
#define PDL_TYPE_ADJUST_FROM_SUPPLIED(type, f) ( \
/* opposite test/actions from convert, complex only */ \
((f) & PDL_PARAM_ISREAL && (type) < PDL_CF) ? PDLMAX(PDL_CF,(type)+PDL_CF-PDL_F) : \
((f) & PDL_PARAM_ISCOMPLEX && (type) >= PDL_CF) ? (type)-PDL_CF+PDL_F : \
(type))
#define PDL_TYPE_ADJUST_FROM_TRANS(ttype, f, par_type) ( \
((f) & PDL_PARAM_ISTYPED) ? \
(!((f) & PDL_PARAM_ISTPLUS) ? (par_type) : PDLMAX((par_type), (ttype))) : \
((f) & (PDL_PARAM_ISREAL|PDL_PARAM_ISNOTCOMPLEX) && (ttype) >= PDL_CF) ? \
(ttype) - PDL_CF + PDL_F : \
((f) & PDL_PARAM_ISCOMPLEX && (ttype) < PDL_CF) ? \
PDLMAX(PDL_CF, trans_dtype + PDL_CF - PDL_F) : \
(ttype))
static inline pdl_error pdl__transtype_select(
pdl_trans *trans, pdl_datatypes *retval
) {
pdl_error PDL_err = {0, NULL, 0};
*retval = PDL_INVALID;
pdl_transvtable *vtable = trans->vtable;
PDL_Indx i, nparents = vtable->nparents;
for (i=0; i<vtable->npdls; i++) {
pdl *pdl = trans->pdls[i];
if (i >= nparents && pdl->state & PDL_READONLY)
return pdl_make_error(PDL_EUSERERROR,
"%s error: output parameter %s is read-only",
vtable->name, vtable->par_names[i]);
if (pdl->state & PDL_NOMYDIMS)
continue;
short flags = vtable->par_flags[i];
pdl_datatypes dtype = pdl->datatype;
if (flags & PDL_PARAM_ISNOTREAL && dtype < PDL_CF)
return pdl_make_error(PDL_EUSERERROR,
"%s: ndarray %s must be complex, but is type %s",
vtable->name, vtable->par_names[i], PDL_TYPENAME(dtype));
if (flags & PDL_PARAM_ISNOTCOMPLEX && dtype >= PDL_CF)
return pdl_make_error(PDL_EUSERERROR,
"%s: ndarray %s must be real, but is type %s",
vtable->name, vtable->par_names[i], PDL_TYPENAME(dtype));
}
PDL_BITFIELD_ENT type_avail[PDL_BITFIELD_SIZE(PDL_NTYPES)];
PDL_BITFIELD_ZEROISE(type_avail, PDL_NTYPES);
pdl_datatypes last_dtype = PDL_INVALID;
for (i=0; vtable->gentypes[i] != PDL_INVALID; i++)
PDL_BITFIELD_SET(type_avail, last_dtype = vtable->gentypes[i]);
if (vtable->gentypes[0] == last_dtype) {
*retval = vtable->gentypes[0]; /* only one allowed type, use that */
return PDL_err;
}
char use_last_dtype = 0;
for (i=vtable->npdls-1; i>= 0; i--) {
pdl *pdl = trans->pdls[i];
short flags = vtable->par_flags[i];
if (!(pdl->state & PDL_NOMYDIMS) &&
!(flags & (PDL_PARAM_ISIGNORE|PDL_PARAM_ISTYPED|PDL_PARAM_ISCREATEALWAYS))
) {
pdl_datatypes new_transtype = PDL_TYPE_ADJUST_FROM_SUPPLIED(pdl->datatype, flags);
char newtype_is_avail = PDL_BITFIELD_ISSET(type_avail, new_transtype);
if (!newtype_is_avail && new_transtype > last_dtype)
use_last_dtype = 1;
if (new_transtype != PDL_INVALID && newtype_is_avail && *retval < new_transtype)
*retval = new_transtype;
}
if (i == nparents && *retval != PDL_INVALID) return PDL_err;
}
if (use_last_dtype || *retval == PDL_INVALID || !PDL_BITFIELD_ISSET(type_avail, *retval))
*retval = last_dtype;
return PDL_err;
}
#define PDL_HAS_OTHER_PARENT(p, t) \
((p)->trans_parent && (p)->trans_parent != (t))
pdl_error pdl__set_output_type_badvalue(pdl_trans *trans, int recurse_count) {
pdl_error PDL_err = {0, NULL, 0};
PDL_RECURSE_CHECK(recurse_count);
pdl_datatypes trans_dtype = trans->__datatype;
pdl_transvtable *vtable = trans->vtable;
pdl **pdls = trans->pdls;
PDL_Indx i;
char p2child_has_badvalue = (vtable->npdls == 2 && pdls[0]->has_badvalue
&& (vtable->par_flags[1] & PDL_PARAM_ISCREATEALWAYS));
PDL_Anyval parent_badvalue = p2child_has_badvalue ? pdls[0]->badvalue : (PDL_Anyval){PDL_INVALID, {0}};
for (i=0; i<vtable->npdls; i++) {
short flags = vtable->par_flags[i];
if (flags & PDL_PARAM_ISIGNORE) continue;
pdl *pdl = pdls[i];
if (!(pdl->state & PDL_NOMYDIMS) || PDL_HAS_OTHER_PARENT(pdl, trans)) continue;
pdl->badvalue = parent_badvalue;
pdl->has_badvalue = p2child_has_badvalue;
pdl->datatype = PDL_TYPE_ADJUST_FROM_TRANS(trans_dtype, flags, vtable->par_types[i]);
}
return PDL_err;
}
pdl_error pdl__type_convert(pdl_trans *trans, int recurse_count) {
pdl_error PDL_err = {0, NULL, 0};
PDL_RECURSE_CHECK(recurse_count);
pdl_datatypes trans_dtype = trans->__datatype;
pdl_transvtable *vtable = trans->vtable;
pdl **pdls = trans->pdls;
PDL_Indx i, nparents = vtable->nparents, nchildren = vtable->npdls - nparents;
PDL_Indx j, inplace_input_ind = -1, inplace_output_ind = -1;
PDL_BITFIELD_ENT is_inout[PDL_BITFIELD_SIZE(nchildren)];
PDL_BITFIELD_ZEROISE(is_inout, nchildren);
for (i=0; i < nchildren; i++) {
if (!(vtable->par_flags[i + nparents] & PDL_PARAM_ISCREAT)) {
PDL_BITFIELD_SET(is_inout, i);
continue;
}
pdl *child = trans->pdls[i + nparents];
for (j=0; j < nparents; j++) {
pdl *parent = trans->pdls[j];
if (parent != child) continue;
PDL_BITFIELD_SET(is_inout, i);
inplace_output_ind = nparents + i, inplace_input_ind = j;
break;
}
}
for (i=vtable->npdls-1; i>=0; i--) {
short flags = vtable->par_flags[i];
if (flags & PDL_PARAM_ISIGNORE) continue;
pdl *pdl = pdls[i];
if ((pdl->state & PDL_NOMYDIMS) && !PDL_HAS_OTHER_PARENT(pdl, trans)) continue;
pdl_datatypes new_dtype = PDL_TYPE_ADJUST_FROM_TRANS(trans_dtype, flags, vtable->par_types[i]);
if (new_dtype == pdl->datatype) continue;
PDLDEBUG_f(printf("pdl_type_coerce (%s) pdl=%"IND_FLAG" from %d to %d\n", vtable->name, i, pdl->datatype, new_dtype));
if (i >= nparents && PDL_HAS_OTHER_PARENT(pdl, trans))
return pdl_make_error(PDL_EUSERERROR,
"%s: cannot convert output ndarray %s from type %s to %s with parent",
vtable->name, vtable->par_names[i],
PDL_TYPENAME(pdl->datatype), PDL_TYPENAME(new_dtype));
PDL_RETERROR(PDL_err, pdl__get_convertedpdl_recprotect(
pdl, &pdl, new_dtype,
(i < nparents) ? 0 : 1 + PDL_BITFIELD_ISSET(is_inout, i-nparents),
recurse_count + 1
));
if (pdl->datatype != new_dtype)
return pdl_make_error_simple(PDL_EFATAL, "type not expected value after get_convertedpdl\n");
if (i == inplace_output_ind)
pdls[inplace_input_ind] = pdl;
pdls[i] = pdl;
}
return PDL_err;
}
pdl_error pdl__trans_check_pdls_actual(pdl_trans *trans);
pdl_error pdl__type_coerce_recprotect(pdl_trans *trans, int recurse_count) {
pdl_error PDL_err = {0, NULL, 0};
PDL_RECURSE_CHECK(recurse_count);
PDL_RETERROR(PDL_err, pdl__trans_check_pdls_actual(trans));
pdl_datatypes trans_dtype;
PDL_RETERROR(PDL_err, pdl__transtype_select(trans, &trans_dtype));
trans->__datatype = trans_dtype;
PDL_RETERROR(PDL_err, pdl__set_output_type_badvalue(trans, recurse_count+1));
PDL_RETERROR(PDL_err, pdl__type_convert(trans, recurse_count+1));
return PDL_err;
}
pdl_error pdl_type_coerce(pdl_trans *trans) {
return pdl__type_coerce_recprotect(trans, 0);
}
char pdl_trans_badflag_from_inputs(pdl_trans *trans) {
return 0; /* CORE21 get rid */
}
pdl_error pdl__trans_check_pdls_actual(pdl_trans *trans) {
pdl_error PDL_err = {0, NULL, 0};
PDL_Indx i;
pdl_transvtable *vtable = trans->vtable;
pdl **pdls = trans->pdls;
for (i=0; i<vtable->npdls; i++) {
if (vtable->par_flags[i] & PDL_PARAM_ISTEMP)
if (!(pdls[i] = pdl_pdlnew()))
return pdl_make_error_simple(PDL_EFATAL, "Error in pdlnew");
if (!pdls[i])
return pdl_make_error(PDL_EFATAL, "%s got NULL pointer on param %s", vtable->name, vtable->par_names[i]);
}
if (vtable->flags & PDL_TRANS_OUTPUT_OTHERPAR)
for (i = 0; i < vtable->npdls; i++)
if (!(trans->pdls[i]->state & PDL_NOMYDIMS) && trans->pdls[i]->ndims > vtable->par_realdims[i])
return pdl_make_error(PDL_EUSERERROR,
"Can't broadcast with output OtherPars but par '%s' has %"IND_FLAG" dims, > %"IND_FLAG"!",
vtable->par_names[i], trans->pdls[i]->ndims, vtable->par_realdims[i]
);
return PDL_err;
}
pdl_error pdl_trans_check_pdls(pdl_trans *trans) {
pdl_error PDL_err = {0, NULL, 0};
return PDL_err; /* CORE21 get rid */
}