Lines Matching defs:nField
17967 ** Note that aSortOrder[] and aColl[] have nField+1 slots. There
17968 ** are nField slots for the columns of an index then one extra slot
18001 ** pKeyInfo->nField.
18030 u16 nField; /* Number of entries in apMem[] */
22528 i16 nField; /* Number of fields in the header */
22531 u32 *aOffset; /* Pointer to aType[nField] */
22539 /* 2*nField extra array elements allocated for aType[], beyond the one
22540 ** static element declared in the structure. nField total array slots for
22541 ** aType[] and nField+1 array slots for aOffset[] */
69446 if( pIdxKey->nField==0 || pIdxKey->nField>pKeyInfo->nAllField ){
77755 r.nField = pX->nMem;
81974 pRec->nField = p->iVal+1;
86587 p->nField = pKeyInfo->nKeyField + 1;
86626 if( (++u)>=p->nField ) break;
86636 p->nField = u;
86684 assert( pKeyInfo->nAllField>=pPKey2->nField || CORRUPT_DB );
86728 }while( idx1<szHdr1 && i<pPKey2->nField );
86767 int nField = 0;
86779 nField++;
86781 assert( nField <= pKeyInfo->nAllField );
87107 assert( pPKey2->pKeyInfo->nAllField>=pPKey2->nField
87247 if( i==pPKey2->nField ) break;
87364 }else if( pPKey2->nField>1 ){
87429 if( pPKey2->nField>1 ){
87777 static void vdbeFreeUnpacked(sqlite3 *db, int nField, UnpackedRecord *p){
87781 for(i=0; i<nField; i++){
87828 assert( pCsr->nField==pTab->nCol
87829 || (pCsr->nField==pTab->nCol+1 && op==SQLITE_DELETE && iReg==-1)
87853 for(i=0; i<pCsr->nField; i++){
89844 if( iIdx>=p->pCsr->nField || iIdx<0 ){
89873 }else if( iIdx>=p->pUnpacked->nField ){
89946 if( iIdx>=p->pCsr->nField || iIdx<0 ){
89969 }else if( iIdx>=pUnpack->nField ){
89980 p->aNew = (Mem *)sqlite3DbMallocZero(db, sizeof(Mem) * p->pCsr->nField);
89986 assert( iIdx>=0 && iIdx<p->pCsr->nField );
90513 int nField, /* Number of fields in the table or index */
90539 ROUND8P(sizeof(VdbeCursor)) + 2*sizeof(u32)*nField +
90570 pCx->nField = nField;
90571 pCx->aOffset = &pCx->aType[nField];
90574 &pMem->z[ROUND8P(sizeof(VdbeCursor))+2*sizeof(u32)*nField];
93193 assert( p2<(u32)pC->nField
93196 assert( aOffset==pC->aType+pC->nField );
93646 int nField; /* Number of fields in the record */
93670 nField = pOp->p1;
93672 assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem+1 - p->nCursor)+1 );
93673 pData0 = &aMem[nField];
93674 nField = pOp->p2;
93675 pLast = &pData0[nField-1];
93707 while( (pLast->flags & MEM_Null)!=0 && nField>pOp->p5 ){
93709 nField--;
94523 int nField;
94556 nField = 0;
94594 nField = pKeyInfo->nAllField;
94596 nField = pOp->p4.i;
94599 assert( nField>=0 );
94600 testcase( nField==0 ); /* Table with INTEGER PRIMARY KEY and nothing else */
94601 pCur = allocateCursor(p, pOp->p1, nField, CURTYPE_BTREE);
94645 pCx = allocateCursor(p, pOp->p1, pOrig->nField, CURTYPE_BTREE);
94722 if( pCx && !pCx->noReuse && ALWAYS(pOp->p2<=pCx->nField) ){
94983 int nField; /* Number of columns or fields in the key */
95086 nField = pOp->p4.i;
95088 assert( nField>0 );
95090 r.nField = (u16)nField;
95109 for(i=0; i<r.nField; i++){
95288 r.nField = (u16)pOp[1].p4.i;
95294 for(i=0; i<r.nField; i++){
95536 r.nField = (u16)pOp->p4.i;
95537 if( r.nField>0 ){
95542 for(ii=0; ii<r.nField; ii++){
95582 for(ii=0; ii<r.nField; ii++){
96752 r.nField = (u16)pOp->p3;
96934 r.nField = (u16)pOp->p4.i;
96946 for(i=0; i<r.nField; i++){
99349 p->iOffset = pC->aType[p->iCol + pC->nField];
100690 ** records being sorted. However, if the value passed as argument nField
100691 ** is non-zero and the sorter is able to guarantee a stable sort, nField
100706 int nField, /* Number of key fields in each record */
100754 if( nField && nWorker==0 ){
100755 pKeyInfo->nKeyField = nField;
101112 pTask->pUnpacked->nField = pTask->pSorter->pKeyInfo->nKeyField;
102527 r2->nField = nKeyCol;
102529 assert( r2->nField==nKeyCol );
106309 int nField /* Total number of columns in the vector */
106332 pRet->iTable = nField;
114529 int nField = 0; /* Number of non-virtual columns after drop */
114545 nField = pPk->nKeyCol;
114557 regOut = reg+1+nField;
114564 nField++;
114567 if( nField==0 ){
114571 nField = 1;
114573 sqlite3VdbeAddOp3(v, OP_MakeRecord, reg+1, nField, regRec);
157997 int nField; /* Number of fields in pRec */
158005 assert( pRec->nField>0 );
158051 nField = MIN(pRec->nField, pIdx->nSample);
158053 iSample = pIdx->nSample * nField;
158059 iSamp = iTest / nField;
158062 ** Specifically, the shortest prefix of at least (1 + iTest%nField)
158064 for(n=(iTest % nField) + 1; n<nField; n++){
158071 pRec->nField = n;
158076 }else if( res==0 && n<nField ){
158085 i = iSample / nField;
158095 assert( iCol==nField-1 );
158096 pRec->nField = nField;
158105 pRec->nField = iCol+1;
158115 pRec->nField = iCol;
158120 pRec->nField = nField;
158130 assert( iCol==nField-1 );
158155 aStat[1] = pIdx->aAvgEq[nField-1];
158158 /* Restore the pRec->nField value before returning. */
158159 pRec->nField = nField;
158400 testcase( pRec->nField!=pBuilder->nRecValid );
158401 pRec->nField = pBuilder->nRecValid;