Cross Reference: /ast/src/cmd/ksh93/sh/array.c

Lines Matching defs:maxi
48         int		maxi;   /* maximum index for array */
116 	memset(ar->val, 0, ar->maxi*sizeof(char*));
117 	ar->bits =  (unsigned char*)&ar->val[ar->maxi];
144 		return (ap->header.fixed || ((ap->cur<aq->maxi) && aq->val[ap->cur].cp));
146 		return ((ap->cur<aq->maxi) && aq->val[ap->cur].cp);
169  *   indexed array into which <maxi> is a legal index.  The number of
170  *   elements that will actually fit into the array (> <maxi>
174 static int	arsize(struct index_array *ap, register int maxi)
176 	if(ap && maxi < 2*ap->maxi)
177 		maxi = 2*ap->maxi;
178 	maxi = roundof(maxi,ARRAY_INCR);
179 	return (maxi>ARRAY_MAX?ARRAY_MAX:maxi);
188 	register int i = ap->maxi;
231 		if(ap->cur >= ap->maxi)
252 	if(ap->cur >= ap->maxi)
367 		if(!(ap->header.nelem&ARRAY_SCAN) && ap->cur >= ap->maxi)
369 		if(ap->cur>=ap->maxi)
501 		ar->bits = (unsigned char*)&ar->val[ar->maxi];
810  *        so that <maxi> is a legal index.  If <arp> is 0, an array
813  *        <maxi> becomes the current index of the array.
815 static struct index_array *array_grow(Namval_t *np, register struct index_array *arp,int maxi)
819 	register int newsize = arsize(arp,maxi+1);
820 	if (maxi >= ARRAY_MAX)
821 		errormsg(SH_DICT,ERROR_exit(1),e_subscript, fmtbase((long)maxi,10,0));
825 	ap->maxi = newsize;
826 	ap->cur = maxi;
833 		for(i=0;i < arp->maxi;i++)
838 		memcpy(ap->bits, arp->bits, arp->maxi);
951 	for(dot = 0; dot < (unsigned)save_ap->maxi; dot++)
1127 	for(dot=ap->cur+1; dot <  (unsigned)ap->maxi; dot++)
1132 			if(!(aq=ar) || dot>=(unsigned)aq->maxi)
1200 		if(!ap || size>=ap->maxi)
1236 					for(n=0; n <= ap->maxi; n++)
1249 				if(n=ap->maxi-ap->maxi)
1659 	sub = ap->maxi;
1826 			arg0 = ap->maxi;