1N/A/***********************************************************************
1N/A* *
1N/A* This software is part of the ast package *
1N/A* Copyright (c) 1982-2011 AT&T Intellectual Property *
1N/A* and is licensed under the *
1N/A* Common Public License, Version 1.0 *
1N/A* by AT&T Intellectual Property *
1N/A* *
1N/A* A copy of the License is available at *
1N/A* http://www.opensource.org/licenses/cpl1.0.txt *
1N/A* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
1N/A* *
1N/A* Information and Software Systems Research *
1N/A* AT&T Research *
1N/A* Florham Park NJ *
1N/A* *
1N/A* David Korn <dgk@research.att.com> *
1N/A* *
1N/A***********************************************************************/
1N/A#pragma prototyped
1N/A/*
1N/A * Array processing routines
1N/A *
1N/A * David Korn
1N/A * AT&T Labs
1N/A * dgk@research.att.com
1N/A *
1N/A */
1N/A
1N/A#include "defs.h"
1N/A#include <stak.h>
1N/A#include "name.h"
1N/A
1N/A#define NUMSIZE (4+(ARRAY_MAX>999)+(ARRAY_MAX>9999)+(ARRAY_MAX>99999))
1N/A#define is_associative(ap) array_assoc((Namarr_t*)(ap))
1N/A#define array_setbit(cp, n, b) (cp[n] |= (b))
1N/A#define array_clrbit(cp, n, b) (cp[n] &= ~(b))
1N/A#define array_isbit(cp, n, b) (cp[n] & (b))
1N/A#define NV_CHILD NV_EXPORT
1N/A#define ARRAY_CHILD 1
1N/A#define ARRAY_NOFREE 2
1N/A
1N/Astruct index_array
1N/A{
1N/A Namarr_t header;
1N/A void *xp; /* if set, subscripts will be converted */
1N/A int cur; /* index of current element */
1N/A int maxi; /* maximum index for array */
1N/A unsigned char *bits; /* bit array for child subscripts */
1N/A union Value val[1]; /* array of value holders */
1N/A};
1N/A
1N/Astruct assoc_array
1N/A{
1N/A Namarr_t header;
1N/A Namval_t *pos;
1N/A Namval_t *nextpos;
1N/A Namval_t *cur;
1N/A};
1N/A
1N/A#if SHOPT_FIXEDARRAY
1N/A struct fixed_array
1N/A {
1N/A unsigned char ndim;
1N/A unsigned char dim;
1N/A unsigned char level;
1N/A short size;
1N/A int nelem;
1N/A int curi;
1N/A int *max;
1N/A int *incr;
1N/A int *cur;
1N/A char *data;
1N/A };
1N/A# define array_fixed_data(ap) ((ap)?((struct fixed_array*)((ap)->fixed))->data:0)
1N/A static void array_fixed_setdata(Namval_t*,Namarr_t*,struct fixed_array*);
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A
1N/Astatic Namarr_t *array_scope(Namval_t *np, Namarr_t *ap, int flags)
1N/A{
1N/A Namarr_t *aq;
1N/A#if SHOPT_FIXEDARRAY
1N/A struct fixed_array *fp;
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A struct index_array *ar;
1N/A size_t size = ap->hdr.dsize;
1N/A if(size==0)
1N/A size = ap->hdr.disc->dsize;
1N/A if(!(aq=newof(NIL(Namarr_t*),Namarr_t,1,size-sizeof(Namarr_t))))
1N/A return(0);
1N/A memcpy(aq,ap,size);
1N/A aq->hdr.nofree &= ~1;
1N/A aq->hdr.nofree |= (flags&NV_RDONLY)?1:0;
1N/A if(is_associative(aq))
1N/A {
1N/A aq->scope = (void*)dtopen(&_Nvdisc,Dtoset);
1N/A dtview((Dt_t*)aq->scope,aq->table);
1N/A aq->table = (Dt_t*)aq->scope;
1N/A return(aq);
1N/A }
1N/A#if SHOPT_FIXEDARRAY
1N/A else if(fp = (struct fixed_array*)ap->fixed)
1N/A {
1N/A aq->scope = (void*)ap;
1N/A fp = (struct fixed_array*)(aq+1);
1N/A aq->fixed = (void*)fp;
1N/A fp->max = (int*)(fp+1);
1N/A fp->incr = fp->max+fp->ndim;
1N/A fp->cur = fp->incr+fp->ndim;
1N/A return(aq);
1N/A }
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A aq->scope = (void*)ap;
1N/A ar = (struct index_array*)aq;
1N/A memset(ar->val, 0, ar->maxi*sizeof(char*));
1N/A ar->bits = (unsigned char*)&ar->val[ar->maxi];
1N/A return(aq);
1N/A}
1N/A
1N/Astatic int array_unscope(Namval_t *np,Namarr_t *ap)
1N/A{
1N/A Namfun_t *fp;
1N/A if(!ap->scope)
1N/A return(0);
1N/A if(is_associative(ap))
1N/A (*ap->fun)(np, NIL(char*), NV_AFREE);
1N/A if((fp = nv_disc(np,(Namfun_t*)ap,NV_POP)) && !(fp->nofree&1))
1N/A free((void*)fp);
1N/A nv_delete(np,(Dt_t*)0,0);
1N/A return(1);
1N/A}
1N/A
1N/Astatic void array_syncsub(Namarr_t *ap, Namarr_t *aq)
1N/A{
1N/A ((struct index_array*)ap)->cur = ((struct index_array*)aq)->cur;
1N/A}
1N/A
1N/Astatic int array_covered(Namval_t *np, struct index_array *ap)
1N/A{
1N/A struct index_array *aq = (struct index_array*)ap->header.scope;
1N/A if(!ap->header.fun && aq)
1N/A#if SHOPT_FIXEDARRAY
1N/A return (ap->header.fixed || ((ap->cur<aq->maxi) && aq->val[ap->cur].cp));
1N/A#else
1N/A return ((ap->cur<aq->maxi) && aq->val[ap->cur].cp);
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A return(0);
1N/A}
1N/A
1N/A/*
1N/A * replace discipline with new one
1N/A */
1N/Astatic void array_setptr(register Namval_t *np, struct index_array *old, struct index_array *new)
1N/A{
1N/A register Namfun_t **fp = &np->nvfun;
1N/A while(*fp && *fp!= &old->header.hdr)
1N/A fp = &((*fp)->next);
1N/A if(*fp)
1N/A {
1N/A new->header.hdr.next = (*fp)->next;
1N/A *fp = &new->header.hdr;
1N/A }
1N/A else sfprintf(sfstderr,"discipline not replaced\n");
1N/A}
1N/A
1N/A/*
1N/A * Calculate the amount of space to be allocated to hold an
1N/A * indexed array into which <maxi> is a legal index. The number of
1N/A * elements that will actually fit into the array (> <maxi>
1N/A * but <= ARRAY_MAX) is returned.
1N/A *
1N/A */
1N/Astatic int arsize(struct index_array *ap, register int maxi)
1N/A{
1N/A if(ap && maxi < 2*ap->maxi)
1N/A maxi = 2*ap->maxi;
1N/A maxi = roundof(maxi,ARRAY_INCR);
1N/A return (maxi>ARRAY_MAX?ARRAY_MAX:maxi);
1N/A}
1N/A
1N/Astatic struct index_array *array_grow(Namval_t*, struct index_array*,int);
1N/A
1N/A/* return index of highest element of an array */
1N/Aint array_maxindex(Namval_t *np)
1N/A{
1N/A register struct index_array *ap = (struct index_array*)nv_arrayptr(np);
1N/A register int i = ap->maxi;
1N/A if(is_associative(ap))
1N/A return(-1);
1N/A while(i>0 && ap->val[--i].cp==0);
1N/A return(i+1);
1N/A}
1N/A
1N/Astatic union Value *array_getup(Namval_t *np, Namarr_t *arp, int update)
1N/A{
1N/A register struct index_array *ap = (struct index_array*)arp;
1N/A register union Value *up;
1N/A#if SHOPT_FIXEDARRAY
1N/A struct fixed_array *fp;
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A int nofree;
1N/A if(!arp)
1N/A return(&np->nvalue);
1N/A if(is_associative(ap))
1N/A {
1N/A Namval_t *mp;
1N/A mp = (Namval_t*)((*arp->fun)(np,NIL(char*),NV_ACURRENT));
1N/A if(mp)
1N/A {
1N/A nofree = nv_isattr(mp,NV_NOFREE);
1N/A up = &mp->nvalue;
1N/A }
1N/A else
1N/A return((union Value*)((*arp->fun)(np,NIL(char*),0)));
1N/A }
1N/A#if SHOPT_FIXEDARRAY
1N/A else if(fp = (struct fixed_array*)arp->fixed)
1N/A {
1N/A if(!fp->data)
1N/A array_fixed_setdata(np,arp,fp);
1N/A up = &np->nvalue;
1N/A up->cp = fp->data+fp->size*fp->curi;
1N/A }
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A else
1N/A {
1N/A if(ap->cur >= ap->maxi)
1N/A errormsg(SH_DICT,ERROR_exit(1),e_subscript,nv_name(np));
1N/A up = &(ap->val[ap->cur]);
1N/A nofree = array_isbit(ap->bits,ap->cur,ARRAY_NOFREE);
1N/A }
1N/A if(update)
1N/A {
1N/A if(nofree)
1N/A nv_onattr(np,NV_NOFREE);
1N/A else
1N/A nv_offattr(np,NV_NOFREE);
1N/A }
1N/A return(up);
1N/A}
1N/A
1N/Aint nv_arrayisset(Namval_t *np, Namarr_t *arp)
1N/A{
1N/A register struct index_array *ap = (struct index_array*)arp;
1N/A union Value *up;
1N/A if(is_associative(ap))
1N/A return((np = nv_opensub(np)) && !nv_isnull(np));
1N/A if(ap->cur >= ap->maxi)
1N/A return(0);
1N/A up = &(ap->val[ap->cur]);
1N/A if(up->cp==Empty)
1N/A {
1N/A Namfun_t *fp = &arp->hdr;
1N/A for(fp=fp->next; fp; fp = fp->next)
1N/A {
1N/A if(fp->disc && (fp->disc->getnum || fp->disc->getval))
1N/A return(1);
1N/A }
1N/A }
1N/A return(up->cp && up->cp!=Empty);
1N/A}
1N/A
1N/A/*
1N/A * Get the Value pointer for an array.
1N/A * Delete space as necessary if flag is ARRAY_DELETE
1N/A * After the lookup is done the last @ or * subscript is incremented
1N/A */
1N/Astatic Namval_t *array_find(Namval_t *np,Namarr_t *arp, int flag)
1N/A{
1N/A register struct index_array *ap = (struct index_array*)arp;
1N/A register union Value *up;
1N/A Namval_t *mp;
1N/A int wasundef;
1N/A#if SHOPT_FIXEDARRAY
1N/A struct fixed_array *fp=(struct fixed_array*)(arp->fixed);
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A if(flag&ARRAY_LOOKUP)
1N/A ap->header.nelem &= ~ARRAY_NOSCOPE;
1N/A else
1N/A ap->header.nelem |= ARRAY_NOSCOPE;
1N/A if(wasundef = ap->header.nelem&ARRAY_UNDEF)
1N/A {
1N/A ap->header.nelem &= ~ARRAY_UNDEF;
1N/A /* delete array is the same as delete array[@] */
1N/A if(flag&ARRAY_DELETE)
1N/A {
1N/A#if SHOPT_FIXEDARRAY
1N/A nv_putsub(np, NIL(char*), ARRAY_SCAN|ARRAY_NOSCOPE|(ap->header.fixed?(ARRAY_UNDEF|ARRAY_FIXED):0));
1N/A#else
1N/A nv_putsub(np, NIL(char*), ARRAY_SCAN|ARRAY_NOSCOPE);
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A ap->header.nelem |= ARRAY_SCAN;
1N/A }
1N/A else /* same as array[0] */
1N/A {
1N/A if(is_associative(ap))
1N/A (*ap->header.fun)(np,"0",flag==ARRAY_ASSIGN?NV_AADD:0);
1N/A#if SHOPT_FIXEDARRAY
1N/A else if(fp)
1N/A {
1N/A int n=fp->ndim;
1N/A fp->curi = 0;
1N/A while(--n>=0)
1N/A fp->cur[n] = 0;
1N/A }
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A else
1N/A ap->cur = 0;
1N/A }
1N/A }
1N/A if(is_associative(ap))
1N/A {
1N/A mp = (Namval_t*)((*arp->fun)(np,NIL(char*),NV_ACURRENT));
1N/A if(!mp)
1N/A up = (union Value*)&mp;
1N/A else if(nv_isarray(mp))
1N/A {
1N/A if(wasundef)
1N/A nv_putsub(mp,NIL(char*),ARRAY_UNDEF);
1N/A return(mp);
1N/A }
1N/A else
1N/A {
1N/A up = &mp->nvalue;
1N/A if(nv_isvtree(mp))
1N/A {
1N/A if(!up->cp && flag==ARRAY_ASSIGN)
1N/A {
1N/A nv_arraychild(np,mp,0);
1N/A ap->header.nelem++;
1N/A }
1N/A return(mp);
1N/A }
1N/A }
1N/A }
1N/A#if SHOPT_FIXEDARRAY
1N/A else if(fp)
1N/A {
1N/A char *data = array_fixed_data((Namarr_t*)ap->header.scope);
1N/A if(flag==ARRAY_ASSIGN && data==fp->data)
1N/A {
1N/A if(data)
1N/A {
1N/A fp->data = (char*)malloc(fp->nelem*fp->size);
1N/A memcpy(fp->data,data,fp->nelem*fp->size);
1N/A }
1N/A else
1N/A array_fixed_setdata(np,&ap->header,fp);
1N/A }
1N/A np->nvalue.cp = fp->data+fp->size*fp->curi;
1N/A return(np);
1N/A }
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A else
1N/A {
1N/A if(!(ap->header.nelem&ARRAY_SCAN) && ap->cur >= ap->maxi)
1N/A ap = array_grow(np, ap, (int)ap->cur);
1N/A if(ap->cur>=ap->maxi)
1N/A errormsg(SH_DICT,ERROR_exit(1),e_subscript,nv_name(np));
1N/A up = &(ap->val[ap->cur]);
1N/A if((!up->cp||up->cp==Empty) && nv_type(np) && nv_isvtree(np))
1N/A {
1N/A char *cp;
1N/A if(!ap->header.table)
1N/A ap->header.table = dtopen(&_Nvdisc,Dtoset);
1N/A sfprintf(sh.strbuf,"%d",ap->cur);
1N/A cp = sfstruse(sh.strbuf);
1N/A mp = nv_search(cp, ap->header.table, NV_ADD);
1N/A mp->nvenv = (char*)np;
1N/A nv_arraychild(np,mp,0);
1N/A }
1N/A if(up->np && array_isbit(ap->bits,ap->cur,ARRAY_CHILD))
1N/A {
1N/A if(wasundef && nv_isarray(up->np))
1N/A nv_putsub(up->np,NIL(char*),ARRAY_UNDEF);
1N/A return(up->np);
1N/A }
1N/A }
1N/A np->nvalue.cp = up->cp;
1N/A if(!up->cp)
1N/A {
1N/A char *xp = nv_setdisc(np,"get",np,(Namfun_t*)np);
1N/A if(flag!=ARRAY_ASSIGN)
1N/A return(xp && xp!=(char*)np?np:0);
1N/A if(!array_covered(np,ap))
1N/A ap->header.nelem++;
1N/A }
1N/A return(np);
1N/A}
1N/A
1N/A#if SHOPT_TYPEDEF
1N/Aint nv_arraysettype(Namval_t *np, Namval_t *tp, const char *sub, int flags)
1N/A{
1N/A Namval_t *nq;
1N/A char *av[2];
1N/A int rdonly = nv_isattr(np,NV_RDONLY);
1N/A int xtrace = sh_isoption(SH_XTRACE);
1N/A Namarr_t *ap = nv_arrayptr(np);
1N/A av[1] = 0;
1N/A sh.last_table = 0;
1N/A if(!ap->table)
1N/A ap->table = dtopen(&_Nvdisc,Dtoset);
1N/A if(nq = nv_search(sub, ap->table, NV_ADD))
1N/A {
1N/A if(!nq->nvfun && nq->nvalue.cp && *nq->nvalue.cp==0)
1N/A _nv_unset(nq,NV_RDONLY);
1N/A nv_arraychild(np,nq,0);
1N/A if(!nv_isattr(tp,NV_BINARY))
1N/A {
1N/A sfprintf(sh.strbuf,"%s=%s",nv_name(nq),nv_getval(np));
1N/A av[0] = strdup(sfstruse(sh.strbuf));
1N/A }
1N/A if(!nv_clone(tp,nq,flags|NV_NOFREE))
1N/A return(0);
1N/A ap->nelem |= ARRAY_SCAN;
1N/A if(!rdonly)
1N/A nv_offattr(nq,NV_RDONLY);
1N/A if(!nv_isattr(tp,NV_BINARY))
1N/A {
1N/A if(xtrace)
1N/A sh_offoption(SH_XTRACE);
1N/A ap->nelem &= ~ARRAY_SCAN;
1N/A sh_eval(sh_sfeval(av),0);
1N/A ap->nelem |= ARRAY_SCAN;
1N/A free((void*)av[0]);
1N/A if(xtrace)
1N/A sh_onoption(SH_XTRACE);
1N/A }
1N/A return(1);
1N/A }
1N/A return(0);
1N/A}
1N/A#endif /* SHOPT_TYPEDEF */
1N/A
1N/A
1N/Astatic Namfun_t *array_clone(Namval_t *np, Namval_t *mp, int flags, Namfun_t *fp)
1N/A{
1N/A Namarr_t *ap = (Namarr_t*)fp;
1N/A Namval_t *nq, *mq;
1N/A char *name, *sub=0;
1N/A int nelem, skipped=0;
1N/A Dt_t *otable=ap->table;
1N/A struct index_array *aq = (struct index_array*)ap, *ar;
1N/A Shell_t *shp = sh_getinterp();
1N/A if(flags&NV_MOVE)
1N/A {
1N/A if((flags&NV_COMVAR) && nv_putsub(np,NIL(char*),ARRAY_SCAN))
1N/A {
1N/A do
1N/A {
1N/A if(nq=nv_opensub(np))
1N/A nq->nvenv = (void*)mp;
1N/A }
1N/A while(nv_nextsub(np));
1N/A }
1N/A return(fp);
1N/A }
1N/A nelem = ap->nelem;
1N/A if(nelem&ARRAY_NOCLONE)
1N/A return(0);
1N/A if((flags&NV_TYPE) && !ap->scope)
1N/A {
1N/A ap = array_scope(np,ap,flags);
1N/A return(&ap->hdr);
1N/A }
1N/A ap = (Namarr_t*)nv_clone_disc(fp,0);
1N/A if(flags&NV_COMVAR)
1N/A {
1N/A ap->scope = 0;
1N/A ap->nelem = 0;
1N/A sh.prev_table = sh.last_table;
1N/A sh.prev_root = sh.last_root;
1N/A }
1N/A if(ap->table)
1N/A {
1N/A ap->table = dtopen(&_Nvdisc,Dtoset);
1N/A if(ap->scope && !(flags&NV_COMVAR))
1N/A {
1N/A ap->scope = ap->table;
1N/A dtview(ap->table, otable->view);
1N/A }
1N/A }
1N/A mp->nvfun = (Namfun_t*)ap;
1N/A mp->nvflag &= NV_MINIMAL;
1N/A mp->nvflag |= (np->nvflag&~(NV_MINIMAL|NV_NOFREE));
1N/A if(!(nelem&(ARRAY_SCAN|ARRAY_UNDEF)) && (sub=nv_getsub(np)))
1N/A sub = strdup(sub);
1N/A ar = (struct index_array*)ap;
1N/A if(!is_associative(ap))
1N/A ar->bits = (unsigned char*)&ar->val[ar->maxi];
1N/A if(!nv_putsub(np,NIL(char*),ARRAY_SCAN|((flags&NV_COMVAR)?0:ARRAY_NOSCOPE)))
1N/A {
1N/A if(ap->fun)
1N/A (*ap->fun)(np,(char*)np,0);
1N/A skipped=1;
1N/A goto skip;
1N/A }
1N/A do
1N/A {
1N/A name = nv_getsub(np);
1N/A nv_putsub(mp,name,ARRAY_ADD|ARRAY_NOSCOPE);
1N/A mq = 0;
1N/A if(nq=nv_opensub(np))
1N/A mq = nv_search(name,ap->table,NV_ADD);
1N/A if(nq && (((flags&NV_COMVAR) && nv_isvtree(nq)) || nv_isarray(nq)))
1N/A {
1N/A mq->nvalue.cp = 0;
1N/A if(!is_associative(ap))
1N/A ar->val[ar->cur].np = mq;
1N/A nv_clone(nq,mq,flags);
1N/A }
1N/A else if(flags&NV_ARRAY)
1N/A {
1N/A if((flags&NV_NOFREE) && !is_associative(ap))
1N/A array_setbit(aq->bits,aq->cur,ARRAY_NOFREE);
1N/A else if(nq && (flags&NV_NOFREE))
1N/A {
1N/A mq->nvalue = nq->nvalue;
1N/A nv_onattr(nq,NV_NOFREE);
1N/A }
1N/A }
1N/A else if(nv_isattr(np,NV_INTEGER))
1N/A {
1N/A Sfdouble_t d= nv_getnum(np);
1N/A if(!is_associative(ap))
1N/A ar->val[ar->cur].cp = 0;
1N/A nv_putval(mp,(char*)&d,NV_LDOUBLE);
1N/A }
1N/A else
1N/A {
1N/A if(!is_associative(ap))
1N/A ar->val[ar->cur].cp = 0;
1N/A nv_putval(mp,nv_getval(np),NV_RDONLY);
1N/A }
1N/A aq->header.nelem |= ARRAY_NOSCOPE;
1N/A }
1N/A while(nv_nextsub(np));
1N/Askip:
1N/A if(sub)
1N/A {
1N/A if(!skipped)
1N/A nv_putsub(np,sub,0L);
1N/A free((void*)sub);
1N/A }
1N/A aq->header.nelem = ap->nelem = nelem;
1N/A return(&ap->hdr);
1N/A}
1N/A
1N/Astatic char *array_getval(Namval_t *np, Namfun_t *disc)
1N/A{
1N/A register Namarr_t *aq,*ap = (Namarr_t*)disc;
1N/A register Namval_t *mp;
1N/A register char *cp=0;
1N/A if((mp=array_find(np,ap,ARRAY_LOOKUP))!=np)
1N/A {
1N/A if(!mp && !is_associative(ap) && (aq=(Namarr_t*)ap->scope))
1N/A {
1N/A array_syncsub(aq,ap);
1N/A if((mp=array_find(np,aq,ARRAY_LOOKUP))==np)
1N/A return(nv_getv(np,&aq->hdr));
1N/A }
1N/A if(mp)
1N/A {
1N/A cp = nv_getval(mp);
1N/A nv_offattr(mp,NV_EXPORT);
1N/A }
1N/A return(cp);
1N/A }
1N/A#if SHOPT_FIXEDARRAY
1N/A if(ap->fixed && nv_isattr(np,NV_INT16P) == NV_INT16)
1N/A np->nvalue.s = *np->nvalue.sp;
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A return(nv_getv(np,&ap->hdr));
1N/A}
1N/A
1N/Astatic Sfdouble_t array_getnum(Namval_t *np, Namfun_t *disc)
1N/A{
1N/A register Namarr_t *aq,*ap = (Namarr_t*)disc;
1N/A register Namval_t *mp;
1N/A if((mp=array_find(np,ap,ARRAY_LOOKUP))!=np)
1N/A {
1N/A if(!mp && !is_associative(ap) && (aq=(Namarr_t*)ap->scope))
1N/A {
1N/A array_syncsub(aq,ap);
1N/A if((mp=array_find(np,aq,ARRAY_LOOKUP))==np)
1N/A return(nv_getn(np,&aq->hdr));
1N/A }
1N/A return(mp?nv_getnum(mp):0);
1N/A }
1N/A return(nv_getn(np,&ap->hdr));
1N/A}
1N/A
1N/Astatic void array_putval(Namval_t *np, const char *string, int flags, Namfun_t *dp)
1N/A{
1N/A register Namarr_t *ap = (Namarr_t*)dp;
1N/A register union Value *up;
1N/A register Namval_t *mp;
1N/A register struct index_array *aq = (struct index_array*)ap;
1N/A int scan,nofree = nv_isattr(np,NV_NOFREE);
1N/A#if SHOPT_FIXEDARRAY
1N/A struct fixed_array *fp;
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A do
1N/A {
1N/A mp = array_find(np,ap,string?ARRAY_ASSIGN:ARRAY_DELETE);
1N/A scan = ap->nelem&ARRAY_SCAN;
1N/A if(mp && mp!=np)
1N/A {
1N/A if(!is_associative(ap) && string && !(flags&NV_APPEND) && !nv_type(np) && nv_isvtree(mp))
1N/A {
1N/A if(!nv_isattr(np,NV_NOFREE))
1N/A _nv_unset(mp,flags&NV_RDONLY);
1N/A array_clrbit(aq->bits,aq->cur,ARRAY_CHILD);
1N/A aq->val[aq->cur].cp = 0;
1N/A if(!nv_isattr(mp,NV_NOFREE))
1N/A nv_delete(mp,ap->table,0);
1N/A goto skip;
1N/A }
1N/A nv_putval(mp, string, flags);
1N/A if(string)
1N/A {
1N/A#if SHOPT_TYPEDEF
1N/A if(ap->hdr.type && ap->hdr.type!=nv_type(mp))
1N/A nv_arraysettype(np,ap->hdr.type,nv_getsub(np),0);
1N/A#endif /* SHOPT_TYPEDEF */
1N/A continue;
1N/A }
1N/A ap->nelem |= scan;
1N/A }
1N/A if(!string)
1N/A {
1N/A if(mp)
1N/A {
1N/A if(is_associative(ap))
1N/A {
1N/A (*ap->fun)(np,NIL(char*),NV_ADELETE);
1N/A np->nvalue.cp = 0;
1N/A }
1N/A else
1N/A {
1N/A if(mp!=np)
1N/A {
1N/A array_clrbit(aq->bits,aq->cur,ARRAY_CHILD);
1N/A aq->val[aq->cur].cp = 0;
1N/A nv_delete(mp,ap->table,0);
1N/A }
1N/A if(!array_covered(np,(struct index_array*)ap))
1N/A {
1N/A if(array_elem(ap))
1N/A ap->nelem--;
1N/A }
1N/A#if SHOPT_FIXEDARRAY
1N/A else if(fp=(struct fixed_array*)ap->fixed)
1N/A {
1N/A char *data = array_fixed_data((Namarr_t*)ap->scope);
1N/A int n = fp->size*fp->curi;
1N/A if(data)
1N/A {
1N/A memcpy(fp->data+n,data+n,fp->size);
1N/A continue;
1N/A }
1N/A }
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A }
1N/A }
1N/A if(array_elem(ap)==0 && (ap->nelem&ARRAY_SCAN))
1N/A {
1N/A if(is_associative(ap))
1N/A (*ap->fun)(np, NIL(char*), NV_AFREE);
1N/A else if(ap->table)
1N/A dtclose(ap->table);
1N/A nv_offattr(np,NV_ARRAY);
1N/A }
1N/A if(!mp || mp!=np || is_associative(ap))
1N/A continue;
1N/A }
1N/A skip:
1N/A /* prevent empty string from being deleted */
1N/A up = array_getup(np,ap,!nofree);
1N/A if(up->cp == Empty)
1N/A up->cp = 0;
1N/A#if SHOPT_FIXEDARRAY
1N/A if(nv_isarray(np) && !ap->fixed)
1N/A#else
1N/A if(nv_isarray(np))
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A np->nvalue.up = up;
1N/A nv_putv(np,string,flags,&ap->hdr);
1N/A#if SHOPT_FIXEDARRAY
1N/A if(!is_associative(ap) && !ap->fixed)
1N/A#else
1N/A if(!is_associative(ap))
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A {
1N/A if(string)
1N/A array_clrbit(aq->bits,aq->cur,ARRAY_NOFREE);
1N/A else if(mp==np)
1N/A aq->val[aq->cur].cp = 0;
1N/A }
1N/A#if SHOPT_TYPEDEF
1N/A if(string && ap->hdr.type && nv_isvtree(np))
1N/A nv_arraysettype(np,ap->hdr.type,nv_getsub(np),0);
1N/A#endif /* SHOPT_TYPEDEF */
1N/A }
1N/A while(!string && nv_nextsub(np));
1N/A if(ap)
1N/A ap->nelem &= ~ARRAY_NOSCOPE;
1N/A if(nofree)
1N/A nv_onattr(np,NV_NOFREE);
1N/A else
1N/A nv_offattr(np,NV_NOFREE);
1N/A if(!string && !nv_isattr(np,NV_ARRAY))
1N/A {
1N/A Namfun_t *nfp;
1N/A#if SHOPT_FIXEDARRAY
1N/A char *data = array_fixed_data((Namarr_t*)ap->scope);
1N/A fp = (struct fixed_array*)ap->fixed;
1N/A if(fp && (!ap->scope || data!=fp->data))
1N/A {
1N/A free((void*)fp->data);
1N/A if(data)
1N/A fp->data = data;
1N/A }
1N/A else
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A if(!is_associative(ap) && aq->xp)
1N/A {
1N/A _nv_unset(nv_namptr(aq->xp,0),NV_RDONLY);
1N/A free((void*)aq->xp);
1N/A }
1N/A if((nfp = nv_disc(np,(Namfun_t*)ap,NV_POP)) && !(nfp->nofree&1))
1N/A free((void*)nfp);
1N/A if(!nv_isnull(np))
1N/A {
1N/A nv_onattr(np,NV_NOFREE);
1N/A _nv_unset(np,flags);
1N/A }
1N/A if(np->nvalue.cp==Empty)
1N/A np->nvalue.cp = 0;
1N/A }
1N/A if(!string && (flags&NV_TYPE))
1N/A array_unscope(np,ap);
1N/A}
1N/A
1N/Astatic const Namdisc_t array_disc =
1N/A{
1N/A sizeof(Namarr_t),
1N/A array_putval,
1N/A array_getval,
1N/A array_getnum,
1N/A 0,
1N/A 0,
1N/A array_clone
1N/A};
1N/A
1N/Astatic void array_copytree(Namval_t *np, Namval_t *mp)
1N/A{
1N/A Namfun_t *fp = nv_disc(np,NULL,NV_POP);
1N/A nv_offattr(np,NV_ARRAY);
1N/A nv_clone(np,mp,0);
1N/A if(np->nvalue.cp && !nv_isattr(np,NV_NOFREE))
1N/A free((void*)np->nvalue.cp);
1N/A np->nvalue.cp = 0;
1N/A np->nvalue.up = &mp->nvalue;
1N/A fp->nofree &= ~1;
1N/A nv_disc(np,(Namfun_t*)fp, NV_FIRST);
1N/A fp->nofree |= 1;
1N/A nv_onattr(np,NV_ARRAY);
1N/A mp->nvenv = (char*)np;
1N/A}
1N/A
1N/A/*
1N/A * Increase the size of the indexed array of elements in <arp>
1N/A * so that <maxi> is a legal index. If <arp> is 0, an array
1N/A * of the required size is allocated. A pointer to the
1N/A * allocated Namarr_t structure is returned.
1N/A * <maxi> becomes the current index of the array.
1N/A */
1N/Astatic struct index_array *array_grow(Namval_t *np, register struct index_array *arp,int maxi)
1N/A{
1N/A register struct index_array *ap;
1N/A register int i;
1N/A register int newsize = arsize(arp,maxi+1);
1N/A if (maxi >= ARRAY_MAX)
1N/A errormsg(SH_DICT,ERROR_exit(1),e_subscript, fmtbase((long)maxi,10,0));
1N/A i = (newsize-1)*sizeof(union Value*)+newsize;
1N/A ap = new_of(struct index_array,i);
1N/A memset((void*)ap,0,sizeof(*ap)+i);
1N/A ap->maxi = newsize;
1N/A ap->cur = maxi;
1N/A ap->bits = (unsigned char*)&ap->val[newsize];
1N/A memset(ap->bits, 0, newsize);
1N/A if(arp)
1N/A {
1N/A ap->header = arp->header;
1N/A ap->header.hdr.dsize = sizeof(*ap) + i;
1N/A for(i=0;i < arp->maxi;i++)
1N/A ap->val[i].cp = arp->val[i].cp;
1N/A memcpy(ap->bits, arp->bits, arp->maxi);
1N/A array_setptr(np,arp,ap);
1N/A free((void*)arp);
1N/A }
1N/A else
1N/A {
1N/A Namval_t *mp=0;
1N/A ap->header.hdr.dsize = sizeof(*ap) + i;
1N/A i = 0;
1N/A ap->header.fun = 0;
1N/A if((nv_isnull(np)||np->nvalue.cp==Empty) && nv_isattr(np,NV_NOFREE))
1N/A {
1N/A i = ARRAY_TREE;
1N/A nv_offattr(np,NV_NOFREE);
1N/A }
1N/A if(np->nvalue.cp==Empty)
1N/A np->nvalue.cp=0;
1N/A if(nv_hasdisc(np,&array_disc) || nv_isvtree(np))
1N/A {
1N/A ap->header.table = dtopen(&_Nvdisc,Dtoset);
1N/A mp = nv_search("0", ap->header.table,NV_ADD);
1N/A if(mp && nv_isnull(mp))
1N/A {
1N/A Namfun_t *fp;
1N/A ap->val[0].np = mp;
1N/A array_setbit(ap->bits,0,ARRAY_CHILD);
1N/A for(fp=np->nvfun; fp && !fp->disc->readf; fp=fp->next);
1N/A if(fp && fp->disc && fp->disc->readf)
1N/A (*fp->disc->readf)(mp,(Sfio_t*)0,0,fp);
1N/A i++;
1N/A }
1N/A }
1N/A else if((ap->val[0].cp=np->nvalue.cp))
1N/A i++;
1N/A else if(nv_isattr(np,NV_INTEGER) && !nv_isnull(np))
1N/A {
1N/A Sfdouble_t d= nv_getnum(np);
1N/A i++;
1N/A }
1N/A ap->header.nelem = i;
1N/A ap->header.hdr.disc = &array_disc;
1N/A nv_disc(np,(Namfun_t*)ap, NV_FIRST);
1N/A nv_onattr(np,NV_ARRAY);
1N/A if(mp)
1N/A {
1N/A array_copytree(np,mp);
1N/A ap->header.hdr.nofree &= ~1;
1N/A }
1N/A }
1N/A for(;i < newsize;i++)
1N/A ap->val[i].cp = 0;
1N/A return(ap);
1N/A}
1N/A
1N/Aint nv_atypeindex(Namval_t *np, const char *tname)
1N/A{
1N/A Namval_t *tp;
1N/A int offset = staktell();
1N/A int n = strlen(tname)-1;
1N/A sfprintf(stkstd,"%s.%.*s%c",NV_CLASS,n,tname,0);
1N/A tp = nv_open(stakptr(offset), sh.var_tree, NV_NOADD|NV_VARNAME);
1N/A stakseek(offset);
1N/A if(tp)
1N/A {
1N/A struct index_array *ap = (struct index_array*)nv_arrayptr(np);
1N/A if(!nv_hasdisc(tp,&ENUM_disc))
1N/A errormsg(SH_DICT,ERROR_exit(1),e_notenum,tp->nvname);
1N/A if(!ap)
1N/A ap = array_grow(np,ap,1);
1N/A ap->xp = calloc(NV_MINSZ,1);
1N/A np = nv_namptr(ap->xp,0);
1N/A np->nvname = tp->nvname;
1N/A nv_onattr(np,NV_MINIMAL);
1N/A nv_clone(tp,np,NV_NOFREE);
1N/A nv_offattr(np,NV_RDONLY);
1N/A return(1);
1N/A }
1N/A errormsg(SH_DICT,ERROR_exit(1),e_unknowntype, n,tname);
1N/A return(0);
1N/A}
1N/A
1N/ANamarr_t *nv_arrayptr(register Namval_t *np)
1N/A{
1N/A if(nv_isattr(np,NV_ARRAY))
1N/A return((Namarr_t*)nv_hasdisc(np, &array_disc));
1N/A return(0);
1N/A}
1N/A
1N/A/*
1N/A * Verify that argument is an indexed array and convert to associative,
1N/A * freeing relevant storage
1N/A */
1N/Astatic Namarr_t *nv_changearray(Namval_t *np, void *(*fun)(Namval_t*,const char*,int))
1N/A{
1N/A register Namarr_t *ap;
1N/A char numbuff[NUMSIZE+1];
1N/A unsigned dot, digit, n;
1N/A union Value *up;
1N/A struct index_array *save_ap;
1N/A register char *string_index=&numbuff[NUMSIZE];
1N/A numbuff[NUMSIZE]='\0';
1N/A
1N/A if(!fun || !(ap = nv_arrayptr(np)) || is_associative(ap))
1N/A return(NIL(Namarr_t*));
1N/A
1N/A nv_stack(np,&ap->hdr);
1N/A save_ap = (struct index_array*)nv_stack(np,0);
1N/A ap = (Namarr_t*)((*fun)(np, NIL(char*), NV_AINIT));
1N/A ap->nelem = 0;
1N/A ap->fun = fun;
1N/A nv_onattr(np,NV_ARRAY);
1N/A
1N/A for(dot = 0; dot < (unsigned)save_ap->maxi; dot++)
1N/A {
1N/A if(save_ap->val[dot].cp)
1N/A {
1N/A if ((digit = dot)== 0)
1N/A *--string_index = '0';
1N/A else while( n = digit )
1N/A {
1N/A digit /= 10;
1N/A *--string_index = '0' + (n-10*digit);
1N/A }
1N/A nv_putsub(np, string_index, ARRAY_ADD);
1N/A up = (union Value*)((*ap->fun)(np,NIL(char*),0));
1N/A up->cp = save_ap->val[dot].cp;
1N/A save_ap->val[dot].cp = 0;
1N/A }
1N/A string_index = &numbuff[NUMSIZE];
1N/A }
1N/A free((void*)save_ap);
1N/A return(ap);
1N/A}
1N/A
1N/A/*
1N/A * set the associative array processing method for node <np> to <fun>
1N/A * The array pointer is returned if sucessful.
1N/A */
1N/ANamarr_t *nv_setarray(Namval_t *np, void *(*fun)(Namval_t*,const char*,int))
1N/A{
1N/A register Namarr_t *ap;
1N/A char *value=0;
1N/A Namfun_t *fp;
1N/A int nelem = 0;
1N/A if(fun && (ap = nv_arrayptr(np)))
1N/A {
1N/A /*
1N/A * if it's already an indexed array, convert to
1N/A * associative structure
1N/A */
1N/A if(!is_associative(ap))
1N/A ap = nv_changearray(np, fun);
1N/A return(ap);
1N/A }
1N/A if(nv_isnull(np) && nv_isattr(np,NV_NOFREE))
1N/A {
1N/A nelem = ARRAY_TREE;
1N/A nv_offattr(np,NV_NOFREE);
1N/A }
1N/A if(!(fp=nv_isvtree(np)))
1N/A value = nv_getval(np);
1N/A if(fun && !ap && (ap = (Namarr_t*)((*fun)(np, NIL(char*), NV_AINIT))))
1N/A {
1N/A /* check for preexisting initialization and save */
1N/A ap->nelem = nelem;
1N/A ap->fun = fun;
1N/A nv_onattr(np,NV_ARRAY);
1N/A if(fp || value)
1N/A {
1N/A nv_putsub(np, "0", ARRAY_ADD);
1N/A if(value)
1N/A nv_putval(np, value, 0);
1N/A else
1N/A {
1N/A Namval_t *mp = (Namval_t*)((*fun)(np,NIL(char*),NV_ACURRENT));
1N/A array_copytree(np,mp);
1N/A }
1N/A }
1N/A return(ap);
1N/A }
1N/A return(NIL(Namarr_t*));
1N/A}
1N/A
1N/A/*
1N/A * move parent subscript into child
1N/A */
1N/ANamval_t *nv_arraychild(Namval_t *np, Namval_t *nq, int c)
1N/A{
1N/A Namfun_t *fp;
1N/A register Namarr_t *ap = nv_arrayptr(np);
1N/A union Value *up;
1N/A Namval_t *tp;
1N/A if(!nq)
1N/A return(ap?array_find(np,ap, ARRAY_LOOKUP):0);
1N/A if(!ap)
1N/A {
1N/A nv_putsub(np, NIL(char*), ARRAY_FILL);
1N/A ap = nv_arrayptr(np);
1N/A }
1N/A if(!(up = array_getup(np,ap,0)))
1N/A return((Namval_t*)0);
1N/A np->nvalue.cp = up->cp;
1N/A if((tp=nv_type(np)) || c)
1N/A {
1N/A ap->nelem |= ARRAY_NOCLONE;
1N/A nq->nvenv = (char*)np;
1N/A if(c=='t')
1N/A nv_clone(tp,nq, 0);
1N/A else
1N/A nv_clone(np, nq, NV_NODISC);
1N/A nv_offattr(nq,NV_ARRAY);
1N/A ap->nelem &= ~ARRAY_NOCLONE;
1N/A }
1N/A nq->nvenv = (char*)np;
1N/A if((fp=nq->nvfun) && fp->disc && fp->disc->setdisc && (fp = nv_disc(nq,fp,NV_POP)))
1N/A free((void*)fp);
1N/A if(!ap->fun)
1N/A {
1N/A struct index_array *aq = (struct index_array*)ap;
1N/A array_setbit(aq->bits,aq->cur,ARRAY_CHILD);
1N/A if(c=='.' && !nq->nvalue.cp)
1N/A ap->nelem++;
1N/A up->np = nq;
1N/A }
1N/A if(c=='.')
1N/A nv_setvtree(nq);
1N/A return(nq);
1N/A}
1N/A
1N/A/*
1N/A * This routine sets subscript of <np> to the next element, if any.
1N/A * The return value is zero, if there are no more elements
1N/A * Otherwise, 1 is returned.
1N/A */
1N/Aint nv_nextsub(Namval_t *np)
1N/A{
1N/A register struct index_array *ap = (struct index_array*)nv_arrayptr(np);
1N/A register unsigned dot;
1N/A struct index_array *aq=0, *ar=0;
1N/A#if SHOPT_FIXEDARRAY
1N/A struct fixed_array *fp;
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A if(!ap || !(ap->header.nelem&ARRAY_SCAN))
1N/A return(0);
1N/A if(is_associative(ap))
1N/A {
1N/A Namval_t *nq;
1N/A if(nq=(*ap->header.fun)(np,NIL(char*),NV_ANEXT))
1N/A {
1N/A if(nv_isattr(nq,NV_CHILD))
1N/A nv_putsub(nq->nvalue.np,NIL(char*),ARRAY_UNDEF);
1N/A return(1);
1N/A }
1N/A ap->header.nelem &= ~(ARRAY_SCAN|ARRAY_NOCHILD);
1N/A return(0);
1N/A }
1N/A#if SHOPT_FIXEDARRAY
1N/A else if(fp = (struct fixed_array*)ap->header.fixed)
1N/A {
1N/A if(ap->header.nelem&ARRAY_FIXED)
1N/A {
1N/A if(++fp->curi < fp->nelem)
1N/A {
1N/A nv_putsub(np,0,fp->curi|ARRAY_FIXED|ARRAY_SCAN);
1N/A return(1);
1N/A }
1N/A ap->header.nelem &= ~ARRAY_FIXED;
1N/A return(0);
1N/A }
1N/A dot = fp->dim;
1N/A if((fp->cur[dot]+1) < fp->max[dot])
1N/A {
1N/A fp->cur[dot]++;
1N/A for(fp->curi=0,dot=0; dot < fp->ndim; dot++)
1N/A fp->curi += fp->incr[dot]*fp->cur[dot];
1N/A return(1);
1N/A }
1N/A if(fp->level)
1N/A {
1N/A dot= --fp->dim;
1N/A while((dot+1) < fp->ndim)
1N/A fp->cur[++dot] = 0;
1N/A fp->level--;
1N/A fp->curi = 0;
1N/A }
1N/A else
1N/A ap->header.nelem &= ~(ARRAY_SCAN|ARRAY_NOCHILD);
1N/A return(0);
1N/A }
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A if(!(ap->header.nelem&ARRAY_NOSCOPE))
1N/A ar = (struct index_array*)ap->header.scope;
1N/A for(dot=ap->cur+1; dot < (unsigned)ap->maxi; dot++)
1N/A {
1N/A aq = ap;
1N/A if(!ap->val[dot].cp && !(ap->header.nelem&ARRAY_NOSCOPE))
1N/A {
1N/A if(!(aq=ar) || dot>=(unsigned)aq->maxi)
1N/A continue;
1N/A }
1N/A if(aq->val[dot].cp)
1N/A {
1N/A ap->cur = dot;
1N/A if(array_isbit(aq->bits, dot,ARRAY_CHILD))
1N/A {
1N/A Namval_t *mp = aq->val[dot].np;
1N/A if((aq->header.nelem&ARRAY_NOCHILD) && nv_isvtree(mp) && !mp->nvfun->dsize)
1N/A continue;
1N/A if(nv_isarray(mp))
1N/A nv_putsub(mp,NIL(char*),ARRAY_SCAN);
1N/A }
1N/A return(1);
1N/A }
1N/A }
1N/A ap->header.nelem &= ~(ARRAY_SCAN|ARRAY_NOCHILD);
1N/A ap->cur = 0;
1N/A return(0);
1N/A}
1N/A
1N/A/*
1N/A * Set an array subscript for node <np> given the subscript <sp>
1N/A * An array is created if necessary.
1N/A * <mode> can be a number, plus or more of symbolic constants
1N/A * ARRAY_SCAN, ARRAY_UNDEF, ARRAY_ADD
1N/A * The node pointer is returned which can be NULL if <np> is
1N/A * not already array and the ARRAY_ADD bit of <mode> is not set.
1N/A * ARRAY_FILL sets the specified subscript to the empty string when
1N/A * ARRAY_ADD is specified and there is no value or sets all
1N/A * the elements up to the number specified if ARRAY_ADD is not specified
1N/A */
1N/ANamval_t *nv_putsub(Namval_t *np,register char *sp,register long mode)
1N/A{
1N/A register struct index_array *ap = (struct index_array*)nv_arrayptr(np);
1N/A register int size = (mode&ARRAY_MASK);
1N/A#if SHOPT_FIXEDARRAY
1N/A struct fixed_array *fp;
1N/A if(!ap || (!ap->header.fixed && !ap->header.fun))
1N/A#else
1N/A if(!ap || !ap->header.fun)
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A {
1N/A if(sp)
1N/A {
1N/A Shell_t *shp = sh_getinterp();
1N/A if(ap && ap->xp && !strmatch(sp,"+([0-9])"))
1N/A {
1N/A Namval_t *mp = nv_namptr(ap->xp,0);
1N/A nv_putval(mp, sp,0);
1N/A size = nv_getnum(mp);
1N/A }
1N/A else
1N/A size = (int)sh_arith(shp,(char*)sp);
1N/A }
1N/A if(size <0 && ap)
1N/A size += array_maxindex(np);
1N/A if(size >= ARRAY_MAX || (size < 0))
1N/A {
1N/A errormsg(SH_DICT,ERROR_exit(1),e_subscript, nv_name(np));
1N/A return(NIL(Namval_t*));
1N/A }
1N/A if(!ap || size>=ap->maxi)
1N/A {
1N/A if(size==0 && !(mode&ARRAY_FILL))
1N/A return(NIL(Namval_t*));
1N/A if(sh.subshell)
1N/A np = sh_assignok(np,1);
1N/A ap = array_grow(np, ap,size);
1N/A }
1N/A ap->header.nelem &= ~ARRAY_UNDEF;
1N/A ap->header.nelem |= (mode&(ARRAY_SCAN|ARRAY_NOCHILD|ARRAY_UNDEF|ARRAY_NOSCOPE));
1N/A#if 0
1N/A if(array_isbit(ap->bits,oldsize,ARRAY_CHILD))
1N/A mp = ap->val[oldsize].np;
1N/A if(size != oldsize && mp->nvalue.cp)
1N/A {
1N/A Namfun_t *nfp;
1N/A for(nfp=np->nvfun; nfp; nfp=nfp->next)
1N/A {
1N/A if(nfp->disc && nfp->disc->readf)
1N/A {
1N/A (*nfp->disc->readf)(mp,(Sfio_t*)0,0,nfp);
1N/A break;
1N/A }
1N/A }
1N/A }
1N/A#endif
1N/A ap->cur = size;
1N/A if((mode&ARRAY_SCAN) && (ap->cur--,!nv_nextsub(np)))
1N/A np = 0;
1N/A if(mode&(ARRAY_FILL|ARRAY_ADD))
1N/A {
1N/A if(!(mode&ARRAY_ADD))
1N/A {
1N/A int n;
1N/A if(mode&ARRAY_SETSUB)
1N/A {
1N/A for(n=0; n <= ap->maxi; n++)
1N/A ap->val[n].cp = 0;
1N/A ap->header.nelem = 0;
1N/A }
1N/A for(n=0; n <= size; n++)
1N/A {
1N/A if(!ap->val[n].cp)
1N/A {
1N/A ap->val[n].cp = Empty;
1N/A if(!array_covered(np,ap))
1N/A ap->header.nelem++;
1N/A }
1N/A }
1N/A if(n=ap->maxi-ap->maxi)
1N/A memset(&ap->val[size],0,n*sizeof(union Value));
1N/A }
1N/A else if(!ap->val[size].cp)
1N/A {
1N/A if(sh.subshell)
1N/A np = sh_assignok(np,1);
1N/A ap->val[size].cp = Empty;
1N/A if(!array_covered(np,ap))
1N/A ap->header.nelem++;
1N/A }
1N/A }
1N/A else if(!(mode&ARRAY_SCAN))
1N/A {
1N/A ap->header.nelem &= ~ARRAY_SCAN;
1N/A if(array_isbit(ap->bits,size,ARRAY_CHILD))
1N/A nv_putsub(ap->val[size].np,NIL(char*),ARRAY_UNDEF);
1N/A if(sp && !(mode&ARRAY_ADD) && !ap->val[size].cp)
1N/A np = 0;
1N/A }
1N/A return((Namval_t*)np);
1N/A }
1N/A#if SHOPT_FIXEDARRAY
1N/A if(fp=(struct fixed_array*)ap->header.fixed)
1N/A {
1N/A if(!fp->data)
1N/A return(np);
1N/A if(mode&ARRAY_UNDEF)
1N/A {
1N/A fp->dim = 0;
1N/A fp->curi = 0;
1N/A for(size=fp->ndim;--size>=0;)
1N/A fp->cur[size] = 0;
1N/A ap->header.nelem &= ~ARRAY_MASK;
1N/A if(mode&ARRAY_FIXED)
1N/A {
1N/A mode &= ~ARRAY_UNDEF;
1N/A ap->header.nelem |= (ARRAY_FIXED|fp->nelem);
1N/A }
1N/A else
1N/A ap->header.nelem |= fp->max[0];
1N/A }
1N/A else if(mode&ARRAY_FIXED)
1N/A {
1N/A size = (mode&ARRAY_MASK)&~(ARRAY_FIXED);
1N/A fp->curi = size;
1N/A for(fp->dim=0;size>0 && fp->dim<fp->ndim; fp->dim++)
1N/A {
1N/A fp->cur[fp->dim] = size/fp->incr[fp->dim];
1N/A size -= fp->incr[fp->dim]*fp->cur[fp->dim];
1N/A }
1N/A while(fp->dim < fp->ndim)
1N/A fp->cur[fp->dim++] = 0;
1N/A fp->dim = ap->header.nelem;
1N/A ap->header.nelem |= ARRAY_FIXED;
1N/A }
1N/A else if(fp->dim< fp->ndim)
1N/A {
1N/A fp->curi += (size-fp->cur[fp->dim])*fp->incr[fp->dim];
1N/A fp->cur[fp->dim] = size;
1N/A }
1N/A }
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A ap->header.nelem &= ~ARRAY_UNDEF;
1N/A if(!(mode&ARRAY_FILL))
1N/A ap->header.nelem &= ~ARRAY_SCAN;
1N/A ap->header.nelem |= (mode&(ARRAY_SCAN|ARRAY_NOCHILD|ARRAY_UNDEF|ARRAY_NOSCOPE));
1N/A#if SHOPT_FIXEDARRAY
1N/A if(fp)
1N/A return(np);
1N/A else
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A if(sp)
1N/A {
1N/A if(mode&ARRAY_SETSUB)
1N/A {
1N/A (*ap->header.fun)(np, sp, NV_ASETSUB);
1N/A return(np);
1N/A }
1N/A (*ap->header.fun)(np, sp, (mode&ARRAY_ADD)?NV_AADD:0);
1N/A if(!(mode&(ARRAY_SCAN|ARRAY_ADD)) && !(*ap->header.fun)(np,NIL(char*),NV_ACURRENT))
1N/A np = 0;
1N/A }
1N/A else if(mode&ARRAY_SCAN)
1N/A (*ap->header.fun)(np,(char*)np,0);
1N/A else if(mode&ARRAY_UNDEF)
1N/A (*ap->header.fun)(np, "",0);
1N/A if((mode&ARRAY_SCAN) && !nv_nextsub(np))
1N/A np = 0;
1N/A return(np);
1N/A}
1N/A
1N/A#if SHOPT_FIXEDARRAY
1N/Aint nv_arrfixed(Namval_t *np, Sfio_t *out, int flag, char *dim)
1N/A{
1N/A Namarr_t *ap = nv_arrayptr(np);
1N/A struct fixed_array *fp = (struct fixed_array*)ap->fixed;
1N/A int n;
1N/A if(flag)
1N/A {
1N/A if(out)
1N/A {
1N/A for(n=0; n < fp->dim; n++)
1N/A sfprintf(out,"[%d]",fp->cur[n]);
1N/A }
1N/A if(dim)
1N/A *dim = fp->dim;
1N/A return(fp->curi);
1N/A }
1N/A if(out)
1N/A {
1N/A for(n=0; n < fp->ndim; n++)
1N/A sfprintf(out,"[%d]",fp->max[n]);
1N/A }
1N/A fp->dim = 0;
1N/A return(fp->curi);
1N/A}
1N/A
1N/Astatic void array_fixed_setdata(Namval_t *np,Namarr_t* ap,struct fixed_array* fp)
1N/A{
1N/A int n = ap->nelem;
1N/A ap->nelem = 1;
1N/A fp->size = nv_datasize(np,0);
1N/A ap->nelem = n;
1N/A fp->data = (char*)calloc(fp->nelem,fp->size);
1N/A}
1N/A
1N/Astatic int array_fixed_init(Namval_t *np, char *sub, char *cp)
1N/A{
1N/A Shell_t *shp=sh_getinterp();
1N/A Namarr_t *ap;
1N/A struct fixed_array *fp;
1N/A int n=1,sz;
1N/A char *ep=cp;
1N/A while(*ep=='[')
1N/A {
1N/A ep = nv_endsubscript(np,ep,0);
1N/A n++;
1N/A }
1N/A if(*ep)
1N/A return(0);
1N/A sz = sizeof(struct fixed_array)+ 3*n*sizeof(int);
1N/A if(!(ap=newof(NIL(Namarr_t*),Namarr_t,1,sz)))
1N/A return(0);
1N/A ap->hdr.disc = &array_disc;
1N/A ap->hdr.dsize = sizeof(Namarr_t)+sz;
1N/A ap->hdr.nofree &= ~1;
1N/A fp = (struct fixed_array*)(ap+1);
1N/A ap->fixed = (void*)fp;
1N/A fp->ndim = n;
1N/A fp->max = (int*)(fp+1);
1N/A fp->incr = fp->max+n;
1N/A fp->cur = fp->incr+n;
1N/A fp->max[0] = (int)sh_arith(shp,(char*)sub);
1N/A for(n=1,ep=cp;*ep=='['; ep=cp)
1N/A {
1N/A cp = nv_endsubscript(np,ep,0);
1N/A cp[-1]=0;
1N/A fp->max[n++] = sz = (int)sh_arith(shp,(char*)ep+1);
1N/A if(sz<0)
1N/A {
1N/A free((void*)ap);
1N/A errormsg(SH_DICT,ERROR_exit(1),e_subscript, nv_name(np));
1N/A }
1N/A cp[-1] = ']';
1N/A }
1N/A nv_disc(np,(Namfun_t*)ap, NV_FIRST);
1N/A nv_onattr(np,NV_ARRAY|NV_NOFREE);
1N/A fp->incr[n=fp->ndim-1] = 1;
1N/A for(sz=1; --n>=0;)
1N/A sz = fp->incr[n] = sz*fp->max[n+1];
1N/A fp->nelem = sz*fp->max[0];
1N/A ap->nelem = fp->max[0];
1N/A return(1);
1N/A}
1N/A
1N/Astatic char *array_fixed(Namval_t *np, char *sub, char *cp,int mode)
1N/A{
1N/A Shell_t *shp=sh_getinterp();
1N/A Namarr_t *ap = nv_arrayptr(np);
1N/A struct fixed_array *fp = (struct fixed_array*)ap->fixed;
1N/A char *ep;
1N/A int size,n=0,sz;
1N/A if(!fp->data)
1N/A array_fixed_setdata(np,ap,fp);
1N/A ap->nelem &= ~ARRAY_UNDEF;
1N/A if(ap->nelem&ARRAY_FIXED)
1N/A {
1N/A ap->nelem &= ~ARRAY_FIXED;
1N/A n = fp->dim;
1N/A sz = fp->curi;
1N/A if(*sub==0)
1N/A goto skip;
1N/A }
1N/A else
1N/A fp->curi = 0;
1N/A size = (int)sh_arith(shp,(char*)sub);
1N/A if(size >= fp->max[n] || (size < 0))
1N/A errormsg(SH_DICT,ERROR_exit(1),e_subscript, nv_name(np));
1N/A fp->cur[n] = size;
1N/A *cp++ = ']';
1N/A sz = fp->curi + fp->cur[n]*fp->incr[n];
1N/A for(n++,ep=cp;*ep=='['; ep=cp,n++)
1N/A {
1N/A if(n >= fp->ndim)
1N/A errormsg(SH_DICT,ERROR_exit(1),e_subscript, nv_name(np));
1N/A cp = nv_endsubscript(np,ep,0);
1N/A cp[-1]=0;
1N/A size = (int)sh_arith(shp,(char*)ep+1);
1N/A if(size >= fp->max[n] || (size < 0))
1N/A errormsg(SH_DICT,ERROR_exit(1),e_subscript, nv_name(np));
1N/A fp->cur[n] = size;
1N/A cp[-1] = ']';
1N/A sz += fp->cur[n]*fp->incr[n];
1N/A }
1N/Askip:
1N/A fp->dim = n;
1N/A ap->nelem &= ~ARRAY_MASK;
1N/A ap->nelem |= fp->max[n];
1N/A while(n < fp->ndim)
1N/A fp->cur[n++] = 0;
1N/A fp->curi = sz;
1N/A return(cp-1);
1N/A}
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A
1N/A/*
1N/A * process an array subscript for node <np> given the subscript <cp>
1N/A * returns pointer to character after the subscript
1N/A */
1N/Achar *nv_endsubscript(Namval_t *np, register char *cp, int mode)
1N/A{
1N/A register int count=1, quoted=0, c;
1N/A register char *sp = cp+1;
1N/A /* first find matching ']' */
1N/A while(count>0 && (c= *++cp))
1N/A {
1N/A if(c=='\\' && (!(mode&NV_SUBQUOTE) || (c=cp[1])=='[' || c==']' || c=='\\' || c=='*' || c=='@'))
1N/A {
1N/A quoted=1;
1N/A cp++;
1N/A }
1N/A else if(c=='[')
1N/A count++;
1N/A else if(c==']')
1N/A count--;
1N/A }
1N/A *cp = 0;
1N/A if(quoted)
1N/A {
1N/A /* strip escape characters */
1N/A count = staktell();
1N/A stakwrite(sp,1+cp-sp);
1N/A sh_trim(sp=stakptr(count));
1N/A }
1N/A if(mode && np)
1N/A {
1N/A Namarr_t *ap = nv_arrayptr(np);
1N/A int scan = 0;
1N/A#if SHOPT_FIXEDARRAY
1N/A if((mode&NV_FARRAY) && !nv_isarray(np))
1N/A {
1N/A if(array_fixed_init(np,sp,cp+1))
1N/A {
1N/A *cp++ = c;
1N/A return(strchr(cp,0));
1N/A }
1N/A }
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A if(ap)
1N/A scan = ap->nelem&ARRAY_SCAN;
1N/A if((mode&NV_ASSIGN) && (cp[1]=='=' || cp[1]=='+'))
1N/A mode |= NV_ADD;
1N/A else if(ap && cp[1]=='.' && (mode&NV_FARRAY))
1N/A mode |= NV_ADD;
1N/A#if SHOPT_FIXEDARRAY
1N/A if(ap && ap->fixed)
1N/A cp = array_fixed(np,sp,cp,mode);
1N/A else
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A nv_putsub(np, sp, ((mode&NV_ADD)?ARRAY_ADD:0)|(cp[1]&&(mode&NV_ADD)?ARRAY_FILL:mode&ARRAY_FILL));
1N/A if(scan)
1N/A ap->nelem |= scan;
1N/A }
1N/A if(quoted)
1N/A stakseek(count);
1N/A *cp++ = c;
1N/A return(cp);
1N/A}
1N/A
1N/A
1N/ANamval_t *nv_opensub(Namval_t* np)
1N/A{
1N/A register struct index_array *ap = (struct index_array*)nv_arrayptr(np);
1N/A#if SHOPT_FIXEDARRAY
1N/A struct fixed_array *fp;
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A if(ap)
1N/A {
1N/A if(is_associative(ap))
1N/A return((Namval_t*)((*ap->header.fun)(np,NIL(char*),NV_ACURRENT)));
1N/A#if SHOPT_FIXEDARRAY
1N/A else if(!(fp=(struct fixed_array*)ap->header.fixed) && array_isbit(ap->bits,ap->cur,ARRAY_CHILD))
1N/A#else
1N/A else if(array_isbit(ap->bits,ap->cur,ARRAY_CHILD))
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A {
1N/A return(ap->val[ap->cur].np);
1N/A }
1N/A#if SHOPT_FIXEDARRAY
1N/A else if(fp)
1N/A {
1N/A int n = fp->dim;
1N/A if((fp->dim+1) < fp->ndim)
1N/A {
1N/A fp->dim++;
1N/A if(ap->header.nelem&ARRAY_SCAN)
1N/A {
1N/A while(++n < fp->ndim)
1N/A fp->cur[n] = 0;
1N/A fp->level++;
1N/A }
1N/A return(np);
1N/A }
1N/A }
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A }
1N/A return(NIL(Namval_t*));
1N/A}
1N/A
1N/Achar *nv_getsub(Namval_t* np)
1N/A{
1N/A static char numbuff[NUMSIZE];
1N/A register struct index_array *ap;
1N/A register unsigned dot, n;
1N/A register char *cp = &numbuff[NUMSIZE];
1N/A if(!np || !(ap = (struct index_array*)nv_arrayptr(np)))
1N/A return(NIL(char*));
1N/A if(is_associative(ap))
1N/A return((char*)((*ap->header.fun)(np,NIL(char*),NV_ANAME)));
1N/A if(ap->xp)
1N/A {
1N/A np = nv_namptr(ap->xp,0);
1N/A np->nvalue.s = ap->cur;
1N/A return(nv_getval(np));
1N/A }
1N/A if((dot = ap->cur)==0)
1N/A *--cp = '0';
1N/A else while(n=dot)
1N/A {
1N/A dot /= 10;
1N/A *--cp = '0' + (n-10*dot);
1N/A }
1N/A return(cp);
1N/A}
1N/A
1N/A/*
1N/A * If <np> is an indexed array node, the current subscript index
1N/A * returned, otherwise returns -1
1N/A */
1N/Aint nv_aindex(register Namval_t* np)
1N/A{
1N/A Namarr_t *ap = nv_arrayptr(np);
1N/A if(!ap)
1N/A return(0);
1N/A else if(is_associative(ap))
1N/A return(-1);
1N/A#if SHOPT_FIXEDARRAY
1N/A else if(ap->fixed)
1N/A return(-1);
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A return(((struct index_array*)(ap))->cur&ARRAY_MASK);
1N/A}
1N/A
1N/Aint nv_arraynsub(register Namarr_t* ap)
1N/A{
1N/A return(array_elem(ap));
1N/A}
1N/A
1N/Aint nv_aimax(register Namval_t* np)
1N/A{
1N/A struct index_array *ap = (struct index_array*)nv_arrayptr(np);
1N/A int sub = -1;
1N/A#if SHOPT_FIXEDARRAY
1N/A if(!ap || is_associative(&ap->header) || ap->header.fixed)
1N/A#else
1N/A if(!ap || is_associative(&ap->header))
1N/A#endif /* SHOPT_FIXEDARRAY */
1N/A return(-1);
1N/A sub = ap->maxi;
1N/A while(--sub>0 && ap->val[sub].cp==0);
1N/A return(sub);
1N/A}
1N/A
1N/A/*
1N/A * This is the default implementation for associative arrays
1N/A */
1N/Avoid *nv_associative(register Namval_t *np,const char *sp,int mode)
1N/A{
1N/A register struct assoc_array *ap = (struct assoc_array*)nv_arrayptr(np);
1N/A register int type;
1N/A switch(mode)
1N/A {
1N/A case NV_AINIT:
1N/A if(ap = (struct assoc_array*)calloc(1,sizeof(struct assoc_array)))
1N/A {
1N/A ap->header.table = dtopen(&_Nvdisc,Dtoset);
1N/A ap->cur = 0;
1N/A ap->pos = 0;
1N/A ap->header.hdr.disc = &array_disc;
1N/A nv_disc(np,(Namfun_t*)ap, NV_FIRST);
1N/A ap->header.hdr.dsize = sizeof(struct assoc_array);
1N/A ap->header.hdr.nofree &= ~1;
1N/A }
1N/A return((void*)ap);
1N/A case NV_ADELETE:
1N/A if(ap->cur)
1N/A {
1N/A if(!ap->header.scope || (Dt_t*)ap->header.scope==ap->header.table || !nv_search(ap->cur->nvname,(Dt_t*)ap->header.scope,0))
1N/A ap->header.nelem--;
1N/A _nv_unset(ap->cur,NV_RDONLY);
1N/A nv_delete(ap->cur,ap->header.table,0);
1N/A ap->cur = 0;
1N/A }
1N/A return((void*)ap);
1N/A case NV_AFREE:
1N/A ap->pos = 0;
1N/A if(ap->header.scope)
1N/A {
1N/A ap->header.table = dtview(ap->header.table,(Dt_t*)0);
1N/A dtclose(ap->header.scope);
1N/A ap->header.scope = 0;
1N/A }
1N/A else
1N/A dtclose(ap->header.table);
1N/A return((void*)ap);
1N/A case NV_ANEXT:
1N/A if(!ap->pos)
1N/A {
1N/A if((ap->header.nelem&ARRAY_NOSCOPE) && ap->header.scope && dtvnext(ap->header.table))
1N/A {
1N/A ap->header.scope = dtvnext(ap->header.table);
1N/A ap->header.table->view = 0;
1N/A }
1N/A if(!(ap->pos=ap->cur))
1N/A ap->pos = (Namval_t*)dtfirst(ap->header.table);
1N/A }
1N/A else
1N/A ap->pos = ap->nextpos;
1N/A for(;ap->cur=ap->pos; ap->pos=ap->nextpos)
1N/A {
1N/A ap->nextpos = (Namval_t*)dtnext(ap->header.table,ap->pos);
1N/A if(!nv_isnull(ap->cur))
1N/A {
1N/A if((ap->header.nelem&ARRAY_NOCHILD) && nv_isattr(ap->cur,NV_CHILD))
1N/A continue;
1N/A return((void*)ap);
1N/A }
1N/A }
1N/A if((ap->header.nelem&ARRAY_NOSCOPE) && ap->header.scope && !dtvnext(ap->header.table))
1N/A {
1N/A ap->header.table->view = (Dt_t*)ap->header.scope;
1N/A ap->header.scope = ap->header.table;
1N/A }
1N/A return(NIL(void*));
1N/A case NV_ASETSUB:
1N/A ap->cur = (Namval_t*)sp;
1N/A return((void*)ap->cur);
1N/A case NV_ACURRENT:
1N/A if(ap->cur)
1N/A ap->cur->nvenv = (char*)np;
1N/A return((void*)ap->cur);
1N/A case NV_ANAME:
1N/A if(ap->cur)
1N/A {
1N/A Shell_t *shp = sh_getinterp();
1N/A if(!shp->instance && nv_isnull(ap->cur))
1N/A return(NIL(void*));
1N/A return((void*)ap->cur->nvname);
1N/A }
1N/A return(NIL(void*));
1N/A default:
1N/A if(sp)
1N/A {
1N/A Namval_t *mp=0;
1N/A ap->cur = 0;
1N/A if(sp==(char*)np)
1N/A return(0);
1N/A type = nv_isattr(np,NV_PUBLIC&~(NV_ARRAY|NV_CHILD|NV_MINIMAL));
1N/A if(mode)
1N/A mode = NV_ADD|HASH_NOSCOPE;
1N/A else if(ap->header.nelem&ARRAY_NOSCOPE)
1N/A mode = HASH_NOSCOPE;
1N/A if(*sp==0 && sh_isoption(SH_XTRACE) && (mode&NV_ADD))
1N/A errormsg(SH_DICT,ERROR_warn(0),"adding empty subscript");
1N/A if(sh.subshell && (mp=nv_search(sp,ap->header.table,0)) && nv_isnull(mp))
1N/A ap->cur = mp;
1N/A if((mp || (mp=nv_search(sp,ap->header.table,mode))) && nv_isnull(mp) && (mode&NV_ADD))
1N/A {
1N/A nv_onattr(mp,type);
1N/A mp->nvenv = (char*)np;
1N/A if((mode&NV_ADD) && nv_type(np))
1N/A nv_arraychild(np,mp,0);
1N/A if(sh.subshell)
1N/A np = sh_assignok(np,1);
1N/A if(!ap->header.scope || !nv_search(sp,dtvnext(ap->header.table),0))
1N/A ap->header.nelem++;
1N/A if(nv_isnull(mp))
1N/A {
1N/A if(ap->header.nelem&ARRAY_TREE)
1N/A nv_setvtree(mp);
1N/A mp->nvalue.cp = Empty;
1N/A }
1N/A }
1N/A else if(ap->header.nelem&ARRAY_SCAN)
1N/A {
1N/A Namval_t fake;
1N/A fake.nvname = (char*)sp;
1N/A ap->pos = mp = (Namval_t*)dtprev(ap->header.table,&fake);
1N/A ap->nextpos = (Namval_t*)dtnext(ap->header.table,mp);
1N/A }
1N/A else if(!mp && *sp && mode==0)
1N/A mp = nv_search(sp,ap->header.table,NV_ADD|HASH_NOSCOPE);
1N/A np = mp;
1N/A if(ap->pos && ap->pos==np)
1N/A ap->header.nelem |= ARRAY_SCAN;
1N/A else if(!(ap->header.nelem&ARRAY_SCAN))
1N/A ap->pos = 0;
1N/A ap->cur = np;
1N/A }
1N/A if(ap->cur)
1N/A return((void*)(&ap->cur->nvalue));
1N/A else
1N/A return((void*)(&ap->cur));
1N/A }
1N/A}
1N/A
1N/A/*
1N/A * Assign values to an array
1N/A */
1N/Avoid nv_setvec(register Namval_t *np,int append,register int argc,register char *argv[])
1N/A{
1N/A int arg0=0;
1N/A struct index_array *ap=0,*aq;
1N/A if(nv_isarray(np))
1N/A {
1N/A ap = (struct index_array*)nv_arrayptr(np);
1N/A if(ap && is_associative(ap))
1N/A errormsg(SH_DICT,ERROR_exit(1),"cannot append index array to associative array %s",nv_name(np));
1N/A }
1N/A if(append)
1N/A {
1N/A if(ap)
1N/A {
1N/A if(!(aq = (struct index_array*)ap->header.scope))
1N/A aq = ap;
1N/A arg0 = ap->maxi;
1N/A while(--arg0>0 && ap->val[arg0].cp==0 && aq->val[arg0].cp==0);
1N/A arg0++;
1N/A }
1N/A else if(!nv_isnull(np))
1N/A arg0=1;
1N/A }
1N/A while(--argc >= 0)
1N/A {
1N/A nv_putsub(np,NIL(char*),(long)argc+arg0|ARRAY_FILL|ARRAY_ADD);
1N/A nv_putval(np,argv[argc],0);
1N/A }
1N/A}
1N/A