Lines Matching refs:nChild

163568   u8 nChild;              /* Number of children that must disable us */  member
164378     pTerm->nChild--;
164379     if( pTerm->nChild!=0 ) break;
167412   assert(   pWC->a[iParent].nChild <  UMXV(pWC->a[0].nChild) );
167413   pWC->a[iParent].nChild++;
167414   testcase( pWC->a[iParent].nChild == UMXV(pWC->a[0].nChild) );
168192     assert( pWC->a[idxTerm].nChild==0 );
168403    && pExpr->x.pSelect->pEList->nExpr <= UMXV(pTerm->nChild)
168407     assert( pTerm->nChild==0 );
168587       if( pWC->a[ii].nChild ){
168602          && pParent->nChild==1
247028   int nChild;                     /* Number of child nodes */  member
247113       for(ii=0; ii<p->nChild; ii++){
247378     for(i=0; i<p->nChild; i++){
247978   for(i=0; i<pNode->nChild; i++){
247993     for(i=0; i<pNode->nChild; i++){
248228   for(i=1; i<pNode->nChild; i++){
248249   for(i=0; i<pNode->nChild; i++){
248285     for(iChild=0; iChild<pAnd->nChild; iChild++){
248346   assert( pNode->nChild==2 );
248446     for(i=0; i<pNode->nChild && rc==SQLITE_OK; i++){
248460         if( pNode->nChild==nEof ) fts5ExprSetEof(pNode);
249160       assert( pNode->eType!=FTS5_EOF || pNode->nChild==0 );
249161       for(i=0; i<pNode->nChild; i++){
249224   int ii = p->nChild;
249226     int nByte = sizeof(Fts5ExprNode*) * pSub->nChild;
249227     memcpy(&p->apChild[p->nChild], pSub->apChild, nByte);
249228     p->nChild += pSub->nChild;
249231     p->apChild[p->nChild++] = pSub;
249233   for( ; ii<p->nChild; ii++){
249265     pRet->nChild = nTerm;
249316     int nChild = 0;               /* Number of children of returned node */  local
249333         nChild = 2;
249335         nChild = 2;
249336         if( pLeft->eType==eType ) nChild += pLeft->nChild-1;
249337         if( pRight->eType==eType ) nChild += pRight->nChild-1;
249340       nByte = SZ_FTS5EXPRNODE(nChild);
249425       pPrev = pLeft->apChild[pLeft->nChild-1];
249448         pLeft->apChild[pLeft->nChild-1] = pRight;
249591     for(i=0; zRet && i<pExpr->nChild; i++){
249672     for(i=0; i<pExpr->nChild; i++){
250059     for(i=0; i<pNode->nChild; i++){
250076       for(i=0; i<pNode->nChild; i++){
250088       for(i=0; i<pNode->nChild; i++){