Cross Reference: /osnet-11/usr/src/lib/libshell/common/sh/array.c

Lines Matching defs:maxi
48         int		maxi;   /* maximum index for array */
115 	memset(ar->val, 0, ar->maxi*sizeof(char*));
116 	ar->bits =  (unsigned char*)&ar->val[ar->maxi];
143 		return (ap->header.fixed || ((ap->cur<aq->maxi) && aq->val[ap->cur].cp));
145 		return ((ap->cur<aq->maxi) && aq->val[ap->cur].cp);
168  *   indexed array into which <maxi> is a legal index.  The number of
169  *   elements that will actually fit into the array (> <maxi>
173 static int	arsize(struct index_array *ap, register int maxi)
175 	if(ap && maxi < 2*ap->maxi)
176 		maxi = 2*ap->maxi;
177 	maxi = roundof(maxi,ARRAY_INCR);
178 	return (maxi>ARRAY_MAX?ARRAY_MAX:maxi);
187 	register int i = ap->maxi;
227 		if(ap->cur >= ap->maxi)
248 	if(ap->cur >= ap->maxi)
356 		if(!(ap->header.nelem&ARRAY_SCAN) && ap->cur >= ap->maxi)
358 		if(ap->cur>=ap->maxi)
490 		ar->bits = (unsigned char*)&ar->val[ar->maxi];
774  *        so that <maxi> is a legal index.  If <arp> is 0, an array
777  *        <maxi> becomes the current index of the array.
779 static struct index_array *array_grow(Namval_t *np, register struct index_array *arp,int maxi)
783 	register int newsize = arsize(arp,maxi+1);
784 	if (maxi >= ARRAY_MAX)
785 		errormsg(SH_DICT,ERROR_exit(1),e_subscript, fmtbase((long)maxi,10,0));
789 	ap->maxi = newsize;
790 	ap->cur = maxi;
797 		for(i=0;i < arp->maxi;i++)
799 		memcpy(ap->bits, arp->bits, arp->maxi);
911 	for(dot = 0; dot < (unsigned)save_ap->maxi; dot++)
1091 	for(dot=ap->cur+1; dot <  (unsigned)ap->maxi; dot++)
1096 			if(!(aq=ar) || dot>=(unsigned)aq->maxi)
1159 		if(!ap || size>=ap->maxi)
1195 					for(n=0; n <= ap->maxi; n++)
1208 				if(n=ap->maxi-ap->maxi)
1597 	sub = ap->maxi;
1764 			arg0 = ap->maxi;