Lines Matching refs:nState
3879 unsigned nState; /* Number of current states */
3904 unsigned nState; /* Number of entries in aOp[] and aArg[] */
3911 for(i=0; i<pSet->nState; i++) if( pSet->aState[i]==newState ) return;
3912 pSet->aState[pSet->nState++] = (ReStateNumber)newState;
3998 if( pRe->nState<=(sizeof(aSpace)/(sizeof(aSpace[0])*2)) ){
4002 pToFree = sqlite3_malloc64( sizeof(ReStateNumber)*2*pRe->nState );
4006 aStateSet[1].aState = &aStateSet[0].aState[pRe->nState];
4008 pNext->nState = 0;
4010 while( c!=RE_EOF && pNext->nState>0 ){
4016 pNext->nState = 0;
4017 for(i=0; i<pThis->nState; i++){
4108 for(i=0; i<pNext->nState; i++){
4138 if( p->nAlloc<=p->nState && re_resize(p, p->nAlloc*2) ) return 0;
4139 for(i=p->nState; i>iBefore; i--){
4143 p->nState++;
4152 return re_insert(p, p->nState, op, arg);
4159 if( p->nState+N>=p->nAlloc && re_resize(p, p->nAlloc*2+N) ) return;
4160 memcpy(&p->aOp[p->nState], &p->aOp[iStart], N*sizeof(p->aOp[0]));
4161 memcpy(&p->aArg[p->nState], &p->aArg[iStart], N*sizeof(p->aArg[0]));
4162 p->nState += N;
4238 iStart = p->nState;
4242 iEnd = p->nState;
4248 p->aArg[iGoto] = p->nState - iGoto;
4263 iStart = p->nState;
4288 re_insert(p, iPrev, RE_OP_GOTO, p->nState - iPrev + 1);
4289 re_append(p, RE_OP_FORK, iPrev - p->nState + 1);
4294 re_append(p, RE_OP_FORK, iPrev - p->nState);
4299 re_insert(p, iPrev, RE_OP_FORK, p->nState - iPrev+1);
4324 sz = p->nState - iPrev;
4343 int iFirst = p->nState;
4367 p->aArg[iFirst] = p->nState - iFirst;
4573 for(i=0; (unsigned)i<pRe->nState; i++){