Lines Matching refs:maxi
48 int maxi; /* maximum index for array */
82 memset(ar->val, 0, ar->maxi*sizeof(char*));
108 return ((ap->cur<aq->maxi) && aq->val[ap->cur].cp);
130 * indexed array into which <maxi> is a legal index. The number of
131 * elements that will actually fit into the array (> <maxi>
135 static int arsize(struct index_array *ap, register int maxi)
137 if(ap && maxi < 2*ap->maxi)
138 maxi = 2*ap->maxi;
139 maxi = roundof(maxi,ARRAY_INCR);
140 return (maxi>ARRAY_MAX?ARRAY_MAX:maxi);
149 register int i = ap->maxi;
177 if(ap->cur >= ap->maxi)
198 if(ap->cur >= ap->maxi)
263 if(!(ap->header.nelem&ARRAY_SCAN) && ap->cur >= ap->maxi)
265 if(ap->cur>=ap->maxi)
397 ar->bits = (unsigned char*)&ar->val[ar->maxi];
634 * so that <maxi> is a legal index. If <arp> is 0, an array
637 * <maxi> becomes the current index of the array.
639 static struct index_array *array_grow(Namval_t *np, register struct index_array *arp,int maxi)
643 register int newsize = arsize(arp,maxi+1);
644 if (maxi >= ARRAY_MAX)
645 errormsg(SH_DICT,ERROR_exit(1),e_subscript, fmtbase((long)maxi,10,0));
649 ap->maxi = newsize;
650 ap->cur = maxi;
657 for(i=0;i < arp->maxi;i++)
659 memcpy(ap->bits, arp->bits, arp->maxi);
771 for(dot = 0; dot < (unsigned)save_ap->maxi; dot++)
912 for(dot=ap->cur+1; dot < (unsigned)ap->maxi; dot++)
917 if(!(aq=ar) || dot>=(unsigned)aq->maxi)
974 if(!ap || size>=ap->maxi)
1017 if(n=ap->maxi-ap->maxi)
1175 sub = ap->maxi;
1342 arg0 = ap->maxi;