Cross Reference: /external/sqlite/dist/sqlite3.c

Lines Matching defs:nField
11089 ** Note that aSortOrder[] and aColl[] have nField+1 slots.  There
11090 ** are nField slots for the columns of an index then one extra slot
11096   u16 nField;         /* Number of key columns in the index */
11122   u16 nField;         /* Number of entries in apMem[] */
13927   i16 nField;           /* Number of fields in the header */
13962   /* 2*nField extra array elements allocated for aType[], beyond the one
13963   ** static element declared in the structure.  nField total array slots for
13964   ** aType[] and nField+1 array slots for aOffset[] */
52250     if( pIdxKey->nField==0 ){
61781           assert( pRec->pKeyInfo->nField+pRec->pKeyInfo->nXField==nCol );
61797     pRec->nField = p->iVal+1;
62185     int nCol = pRec->pKeyInfo->nField+pRec->pKeyInfo->nXField;
63258       sqlite3_snprintf(nTemp, zTemp, "k(%d", pKeyInfo->nField);
63260       for(j=0; j<pKeyInfo->nField; j++){
65324   nByte = ROUND8(sizeof(UnpackedRecord)) + sizeof(Mem)*(pKeyInfo->nField+1);
65337   p->nField = pKeyInfo->nField + 1;
65364   while( idx<szHdr && u<p->nField && d<=nKey ){
65376   assert( u<=pKeyInfo->nField + 1 );
65377   p->nField = u;
65419   assert( pKeyInfo->nField+pKeyInfo->nXField>=pPKey2->nField || CORRUPT_DB );
65421   assert( pKeyInfo->nField>0 );
65456   }while( idx1<szHdr1 && i<pPKey2->nField );
65696   assert( pPKey2->pKeyInfo->nField+pPKey2->pKeyInfo->nXField>=pPKey2->nField 
65699   assert( pPKey2->pKeyInfo->nField>0 );
65828   }while( idx1<(unsigned)szHdr1 && i<pPKey2->nField && d1<=(unsigned)nKey1 );
65928   }else if( pPKey2->nField>1 ){
65985         if( pPKey2->nField>1 ){
66030   if( (p->pKeyInfo->nField + p->pKeyInfo->nXField)<=13 ){
68099   int nField,           /* Number of fields in the table or index */
68126       ROUND8(sizeof(VdbeCursor)) + 2*sizeof(u32)*nField + 
68138     pCx->nField = nField;
68141           &pMem->z[ROUND8(sizeof(VdbeCursor))+2*sizeof(u32)*nField];
70103     assert( i<pKeyInfo->nField );
70358   assert( p2<pC->nField );
70360   aOffset = aType + pC->nField;
70635   int nField;            /* Number of fields in the record */
70660   nField = pOp->p1;
70662   assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem-p->nCursor)+1 );
70663   pData0 = &aMem[nField];
70664   nField = pOp->p2;
70665   pLast = &pData0[nField-1];
71289   int nField;
71309   nField = 0;
71348     nField = pKeyInfo->nField+pKeyInfo->nXField;
71350     nField = pOp->p4.i;
71353   assert( nField>=0 );
71354   testcase( nField==0 );  /* Table with INTEGER PRIMARY KEY and nothing else */
71355   pCur = allocateCursor(p, pOp->p1, nField, iDb, 1);
71594   int nField;
71663     nField = pOp->p4.i;
71665     assert( nField>0 );
71667     r.nField = (u16)nField;
71684     { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
71844     r.nField = (u16)pOp->p4.i;
71846     for(ii=0; ii<r.nField; ii++){
71868     for(ii=0; ii<r.nField; ii++){
72793   r.nField = (u16)pOp->p3;
72797   { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
72905   r.nField = (u16)pOp->p4.i;
72915   { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
74629       p->iOffset = pC->aType[p->iCol + pC->nField];
75422     r2->nField = nKeyCol;
101966     memset(pKI->aSortOrder, 0, pKI->nField); /* Makes OP_Jump below testable */
102406     p->nField = (u16)N;
112825   iCol = pRec->nField - 1;
112827   assert( pRec->nField>0 && iCol<pIdx->nSampleCol );