sqlite3.c - OpenGrok cross reference for /PHP-5.6/ext/sqlite3/libsqlite/sqlite3.c

Lines Matching refs:nField
11670   u16 nField;         /* Number of key columns in the index */  member
11696   u16 nField;         /* Number of entries in apMem[] */  member
14570   i16 nField;           /* Number of fields in the header */  member
53782     if( pIdxKey->nField==0 ){
64199           assert( pRec->pKeyInfo->nField+pRec->pKeyInfo->nXField==nCol );
64215     pRec->nField = p->iVal+1;
64733     int nCol = pRec->pKeyInfo->nField+pRec->pKeyInfo->nXField;
65836       sqlite3_snprintf(nTemp, zTemp, "k(%d", pKeyInfo->nField);
65838       for(j=0; j<pKeyInfo->nField; j++){
67981   nByte = ROUND8(sizeof(UnpackedRecord)) + sizeof(Mem)*(pKeyInfo->nField+1);
67994   p->nField = pKeyInfo->nField + 1;
68031     if( (++u)>=p->nField ) break;
68033   assert( u<=pKeyInfo->nField + 1 );
68034   p->nField = u;
68081   assert( pKeyInfo->nField+pKeyInfo->nXField>=pPKey2->nField || CORRUPT_DB );
68083   assert( pKeyInfo->nField>0 );
68118   }while( idx1<szHdr1 && i<pPKey2->nField );
68157   int nField = 0;
68169     nField++;
68171   assert( nField <= pKeyInfo->nField+pKeyInfo->nXField );
68413   assert( pPKey2->pKeyInfo->nField+pPKey2->pKeyInfo->nXField>=pPKey2->nField 
68416   assert( pPKey2->pKeyInfo->nField>0 );
68543   }while( idx1<(unsigned)szHdr1 && i<pPKey2->nField && d1<=(unsigned)nKey1 );
68648   }else if( pPKey2->nField>1 ){
68698         if( pPKey2->nField>1 ){
68741   if( (p->pKeyInfo->nField + p->pKeyInfo->nXField)<=13 ){
70920   int nField,           /* Number of fields in the table or index */
70947       ROUND8(sizeof(VdbeCursor)) + 2*sizeof(u32)*nField + 
70959     pCx->nField = nField;
70960     pCx->aOffset = &pCx->aType[nField];
70963           &pMem->z[ROUND8(sizeof(VdbeCursor))+2*sizeof(u32)*nField];
72901     assert( i<pKeyInfo->nField );
73156   assert( p2<pC->nField );
73442   int nField;            /* Number of fields in the record */
73467   nField = pOp->p1;
73469   assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem-p->nCursor)+1 );
73470   pData0 = &aMem[nField];
73471   nField = pOp->p2;
73472   pLast = &pData0[nField-1];
74102   int nField;
74134   nField = 0;
74173     nField = pKeyInfo->nField+pKeyInfo->nXField;
74175     nField = pOp->p4.i;
74178   assert( nField>=0 );
74179   testcase( nField==0 );  /* Table with INTEGER PRIMARY KEY and nothing else */
74180   pCur = allocateCursor(p, pOp->p1, nField, iDb, 1);
74440   int nField;
74523     nField = pOp->p4.i;
74525     assert( nField>0 );
74527     r.nField = (u16)nField;
74544     { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
74701     r.nField = (u16)pOp->p4.i;
74703     for(ii=0; ii<r.nField; ii++){
74726     for(ii=0; ii<pIdxKey->nField; ii++){
75642   r.nField = (u16)pOp->p3;
75646   { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
75761   r.nField = (u16)pOp->p4.i;
75771   { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
77499       p->iOffset = pC->aType[p->iCol + pC->nField];
78724     if( pTask->pSorter->pKeyInfo->nField>1 ){
78794     if( pTask->pSorter->pKeyInfo->nField>1 ){
78827   int nField,                     /* Number of key fields in each record */
78862   szKeyInfo = sizeof(KeyInfo) + (pCsr->pKeyInfo->nField-1)*sizeof(CollSeq*);
78873     if( nField && nWorker==0 ){
78874       pKeyInfo->nXField += (pKeyInfo->nField - nField);
78875       pKeyInfo->nField = nField;
78906     if( (pKeyInfo->nField+pKeyInfo->nXField)<13 
79223     pTask->pUnpacked->nField = pTask->pSorter->pKeyInfo->nField;
80608     r2->nField = nKeyCol;
80610   assert( r2->nField==nKeyCol );
107010     memset(pKI->aSortOrder, 0, pKI->nField); /* Makes OP_Jump below testable */
107452     p->nField = (u16)N;
118229   int nField;                 /* Number of fields in pRec */
118237   assert( pRec->nField>0 && pRec->nField<=pIdx->nSampleCol );
118283   nField = pRec->nField;
118285   iSample = pIdx->nSample * nField;
118291     iSamp = iTest / nField;
118296       for(n=(iTest % nField) + 1; n<nField; n++){
118303     pRec->nField = n;
118308     }else if( res==0 && n<nField ){
118317   i = iSample / nField;
118327       assert( iCol==nField-1 );
118328       pRec->nField = nField;
118337       pRec->nField = iCol+1;
118347         pRec->nField = iCol;
118352         pRec->nField = nField;
118362     assert( iCol==nField-1 );
118391   pRec->nField = nField;
118614         testcase( pRec->nField!=pBuilder->nRecValid );
118615         pRec->nField = pBuilder->nRecValid;