Lines Matching refs:nField
12343 ** Note that aSortOrder[] and aColl[] have nField+1 slots. There
12344 ** are nField slots for the columns of an index then one extra slot
12350 u16 nField; /* Number of key columns in the index */
12376 u16 nField; /* Number of entries in apMem[] */
15315 i16 nField; /* Number of fields in the header */
15350 u32 *aOffset; /* Pointer to aType[nField] */
15352 /* 2*nField extra array elements allocated for aType[], beyond the one
15353 ** static element declared in the structure. nField total array slots for
15354 ** aType[] and nField+1 array slots for aOffset[] */
55286 if( pIdxKey->nField==0 ){
66106 assert( pRec->pKeyInfo->nField+pRec->pKeyInfo->nXField==nCol );
66122 pRec->nField = p->iVal+1;
66640 int nCol = pRec->pKeyInfo->nField+pRec->pKeyInfo->nXField;
67803 sqlite3_snprintf(nTemp, zTemp, "k(%d", pKeyInfo->nField);
67805 for(j=0; j<pKeyInfo->nField; j++){
69965 nByte = ROUND8(sizeof(UnpackedRecord)) + sizeof(Mem)*(pKeyInfo->nField+1);
69978 p->nField = pKeyInfo->nField + 1;
70015 if( (++u)>=p->nField ) break;
70017 assert( u<=pKeyInfo->nField + 1 );
70018 p->nField = u;
70066 assert( pKeyInfo->nField+pKeyInfo->nXField>=pPKey2->nField || CORRUPT_DB );
70068 assert( pKeyInfo->nField>0 );
70103 }while( idx1<szHdr1 && i<pPKey2->nField );
70130 ** limit given by pKeyInfo->nField + pKeyInfo->nXField.
70135 ** that the KeyInfo.nField or KeyInfo.nXField values were computed
70142 int nField = 0;
70154 nField++;
70156 assert( nField <= pKeyInfo->nField+pKeyInfo->nXField );
70398 assert( pPKey2->pKeyInfo->nField+pPKey2->pKeyInfo->nXField>=pPKey2->nField
70401 assert( pPKey2->pKeyInfo->nField>0 );
70532 }while( idx1<(unsigned)szHdr1 && i<pPKey2->nField && d1<=(unsigned)nKey1 );
70637 }else if( pPKey2->nField>1 ){
70687 if( pPKey2->nField>1 ){
70730 if( (p->pKeyInfo->nField + p->pKeyInfo->nXField)<=13 ){
73005 int nField, /* Number of fields in the table or index */
73032 ROUND8(sizeof(VdbeCursor)) + 2*sizeof(u32)*nField +
73044 pCx->nField = nField;
73045 pCx->aOffset = &pCx->aType[nField];
73048 &pMem->z[ROUND8(sizeof(VdbeCursor))+2*sizeof(u32)*nField];
75022 assert( i<pKeyInfo->nField );
75277 assert( p2<pC->nField );
75563 int nField; /* Number of fields in the record */
75588 nField = pOp->p1;
75590 assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem-p->nCursor)+1 );
75591 pData0 = &aMem[nField];
75592 nField = pOp->p2;
75593 pLast = &pData0[nField-1];
76212 int nField;
76244 nField = 0;
76283 nField = pKeyInfo->nField+pKeyInfo->nXField;
76285 nField = pOp->p4.i;
76288 assert( nField>=0 );
76289 testcase( nField==0 ); /* Table with INTEGER PRIMARY KEY and nothing else */
76290 pCur = allocateCursor(p, pOp->p1, nField, iDb, 1);
76570 int nField;
76653 nField = pOp->p4.i;
76655 assert( nField>0 );
76657 r.nField = (u16)nField;
76674 { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
76831 r.nField = (u16)pOp->p4.i;
76833 for(ii=0; ii<r.nField; ii++){
76856 for(ii=0; ii<pIdxKey->nField; ii++){
77785 r.nField = (u16)pOp->p3;
77789 { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
77904 r.nField = (u16)pOp->p4.i;
77914 { int i; for(i=0; i<r.nField; i++) assert( memIsValid(&r.aMem[i]) ); }
79694 p->iOffset = pC->aType[p->iCol + pC->nField];
80922 if( pTask->pSorter->pKeyInfo->nField>1 ){
80992 if( pTask->pSorter->pKeyInfo->nField>1 ){
81007 ** Usually, the sorter module uses the value of (pCsr->pKeyInfo->nField)
81009 ** records being sorted. However, if the value passed as argument nField
81010 ** is non-zero and the sorter is able to guarantee a stable sort, nField
81025 int nField, /* Number of key fields in each record */
81060 szKeyInfo = sizeof(KeyInfo) + (pCsr->pKeyInfo->nField-1)*sizeof(CollSeq*);
81071 if( nField && nWorker==0 ){
81072 pKeyInfo->nXField += (pKeyInfo->nField - nField);
81073 pKeyInfo->nField = nField;
81104 if( (pKeyInfo->nField+pKeyInfo->nXField)<13
81421 pTask->pUnpacked->nField = pTask->pSorter->pKeyInfo->nField;
82806 r2->nField = nKeyCol;
82808 assert( r2->nField==nKeyCol );
109208 memset(pKI->aSortOrder, 0, pKI->nField); /* Makes OP_Jump below testable */
109657 p->nField = (u16)N;
122384 int nField; /* Number of fields in pRec */
122392 assert( pRec->nField>0 && pRec->nField<=pIdx->nSampleCol );
122438 nField = pRec->nField;
122440 iSample = pIdx->nSample * nField;
122446 iSamp = iTest / nField;
122449 ** Specifically, the shortest prefix of at least (1 + iTest%nField)
122451 for(n=(iTest % nField) + 1; n<nField; n++){
122458 pRec->nField = n;
122463 }else if( res==0 && n<nField ){
122472 i = iSample / nField;
122482 assert( iCol==nField-1 );
122483 pRec->nField = nField;
122492 pRec->nField = iCol+1;
122502 pRec->nField = iCol;
122507 pRec->nField = nField;
122517 assert( iCol==nField-1 );
122545 /* Restore the pRec->nField value before returning. */
122546 pRec->nField = nField;
122783 testcase( pRec->nField!=pBuilder->nRecValid );
122784 pRec->nField = pBuilder->nRecValid;