Lines Matching refs:nField

12350   u16 nField;         /* Number of key columns in the index */  member
12376 u16 nField; /* Number of entries in apMem[] */ member
15315 i16 nField; /* Number of fields in the header */ member
55268 if( pIdxKey->nField==0 ){
66088 assert( pRec->pKeyInfo->nField+pRec->pKeyInfo->nXField==nCol );
66104 pRec->nField = p->iVal+1;
66622 int nCol = pRec->pKeyInfo->nField+pRec->pKeyInfo->nXField;
67785 sqlite3_snprintf(nTemp, zTemp, "k(%d", pKeyInfo->nField);
67787 for(j=0; j<pKeyInfo->nField; j++){
69947 nByte = ROUND8(sizeof(UnpackedRecord)) + sizeof(Mem)*(pKeyInfo->nField+1);
69960 p->nField = pKeyInfo->nField + 1;
69997 if( (++u)>=p->nField ) break;
69999 assert( u<=pKeyInfo->nField + 1 );
70000 p->nField = u;
70048 assert( pKeyInfo->nField+pKeyInfo->nXField>=pPKey2->nField || CORRUPT_DB );
70050 assert( pKeyInfo->nField>0 );
70085 }while( idx1<szHdr1 && i<pPKey2->nField );
70124 int nField = 0;
70136 nField++;
70138 assert( nField <= pKeyInfo->nField+pKeyInfo->nXField );
70380 assert( pPKey2->pKeyInfo->nField+pPKey2->pKeyInfo->nXField>=pPKey2->nField
70383 assert( pPKey2->pKeyInfo->nField>0 );
70514 }while( idx1<(unsigned)szHdr1 && i<pPKey2->nField && d1<=(unsigned)nKey1 );
70619 }else if( pPKey2->nField>1 ){
70669 if( pPKey2->nField>1 ){
70712 if( (p->pKeyInfo->nField + p->pKeyInfo->nXField)<=13 ){
72987 int nField, /* Number of fields in the table or index */
73014 ROUND8(sizeof(VdbeCursor)) + 2*sizeof(u32)*nField +
73026 pCx->nField = nField;
73027 pCx->aOffset = &pCx->aType[nField];
73030 &pMem->z[ROUND8(sizeof(VdbeCursor))+2*sizeof(u32)*nField];
75004 assert( i<pKeyInfo->nField );
75259 assert( p2<pC->nField );
75545 int nField; /* Number of fields in the record */
75570 nField = pOp->p1;
75572 assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem-p->nCursor)+1 );
75573 pData0 = &aMem[nField];
75574 nField = pOp->p2;
75575 pLast = &pData0[nField-1];
76194 int nField;
76226 nField = 0;
76265 nField = pKeyInfo->nField+pKeyInfo->nXField;
76267 nField = pOp->p4.i;
76270 assert( nField>=0 );
76271 testcase( nField==0 ); /* Table with INTEGER PRIMARY KEY and nothing else */
76272 pCur = allocateCursor(p, pOp->p1, nField, iDb, 1);
76552 int nField;
76635 nField = pOp->p4.i;
76637 assert( nField>0 );
76639 r.nField = (u16)nField;
76656 { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
76813 r.nField = (u16)pOp->p4.i;
76815 for(ii=0; ii<r.nField; ii++){
76838 for(ii=0; ii<pIdxKey->nField; ii++){
77767 r.nField = (u16)pOp->p3;
77771 { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
77886 r.nField = (u16)pOp->p4.i;
77896 { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
79676 p->iOffset = pC->aType[p->iCol + pC->nField];
80904 if( pTask->pSorter->pKeyInfo->nField>1 ){
80974 if( pTask->pSorter->pKeyInfo->nField>1 ){
81007 int nField, /* Number of key fields in each record */
81042 szKeyInfo = sizeof(KeyInfo) + (pCsr->pKeyInfo->nField-1)*sizeof(CollSeq*);
81053 if( nField && nWorker==0 ){
81054 pKeyInfo->nXField += (pKeyInfo->nField - nField);
81055 pKeyInfo->nField = nField;
81086 if( (pKeyInfo->nField+pKeyInfo->nXField)<13
81403 pTask->pUnpacked->nField = pTask->pSorter->pKeyInfo->nField;
82788 r2->nField = nKeyCol;
82790 assert( r2->nField==nKeyCol );
109190 memset(pKI->aSortOrder, 0, pKI->nField); /* Makes OP_Jump below testable */
109639 p->nField = (u16)N;
122366 int nField; /* Number of fields in pRec */
122374 assert( pRec->nField>0 && pRec->nField<=pIdx->nSampleCol );
122420 nField = pRec->nField;
122422 iSample = pIdx->nSample * nField;
122428 iSamp = iTest / nField;
122433 for(n=(iTest % nField) + 1; n<nField; n++){
122440 pRec->nField = n;
122445 }else if( res==0 && n<nField ){
122454 i = iSample / nField;
122464 assert( iCol==nField-1 );
122465 pRec->nField = nField;
122474 pRec->nField = iCol+1;
122484 pRec->nField = iCol;
122489 pRec->nField = nField;
122499 assert( iCol==nField-1 );
122528 pRec->nField = nField;
122765 testcase( pRec->nField!=pBuilder->nRecValid );
122766 pRec->nField = pBuilder->nRecValid;