Lines Matching defs:nField
18615 ** Note that aSortOrder[] and aColl[] have nField+1 slots. There
18616 ** are nField slots for the columns of an index then one extra slot
18649 ** pKeyInfo->nField.
18678 u16 nField; /* Number of entries in apMem[] */
23225 i16 nField; /* Number of fields in the header */
23228 u32 *aOffset; /* Pointer to aType[nField] */
23237 /* 2*nField extra array elements allocated for aType[], beyond the one
23238 ** static element declared in the structure. nField total array slots for
23239 ** aType[] and nField+1 array slots for aOffset[] */
71419 if( pIdxKey->nField==0 || pIdxKey->nField>pKeyInfo->nAllField ){
79963 r.nField = pX->nMem;
84247 pRec->nField = p->iVal+1;
89043 p->nField = pKeyInfo->nKeyField + 1;
89082 if( (++u)>=p->nField ) break;
89092 p->nField = u;
89140 assert( pKeyInfo->nAllField>=pPKey2->nField || CORRUPT_DB );
89193 }while( idx1<szHdr1 && i<pPKey2->nField );
89232 int nField = 0;
89244 nField++;
89246 assert( nField <= pKeyInfo->nAllField );
89584 assert( pPKey2->pKeyInfo->nAllField>=pPKey2->nField
89735 if( i==pPKey2->nField ) break;
89852 }else if( pPKey2->nField>1 ){
89917 if( pPKey2->nField>1 ){
90281 static void vdbeFreeUnpacked(sqlite3 *db, int nField, UnpackedRecord *p){
90285 for(i=0; i<nField; i++){
90342 assert( pCsr->nField==nRealCol
90343 || (pCsr->nField==nRealCol+1 && op==SQLITE_DELETE && iReg==-1)
90367 for(i=0; i<pCsr->nField; i++){
92554 if( iIdx>=p->pCsr->nField || iIdx<0 ){
92583 }else if( iIdx>=p->pUnpacked->nField ){
92677 if( iIdx>=p->pCsr->nField || iIdx<0 ){
92700 }else if( iIdx>=pUnpack->nField ){
92711 p->aNew = (Mem *)sqlite3DbMallocZero(db, sizeof(Mem) * p->pCsr->nField);
92717 assert( iIdx>=0 && iIdx<p->pCsr->nField );
93360 int nField, /* Number of fields in the table or index */
93386 ROUND8P(sizeof(VdbeCursor)) + 2*sizeof(u32)*nField +
93417 pCx->nField = nField;
93418 pCx->aOffset = &pCx->aType[nField];
93421 &pMem->z[ROUND8P(sizeof(VdbeCursor))+2*sizeof(u32)*nField];
96045 assert( p2<(u32)pC->nField
96048 assert( aOffset==pC->aType+pC->nField );
96505 int nField; /* Number of fields in the record */
96529 nField = pOp->p1;
96531 assert( nField>0 && pOp->p2>0 && pOp->p2+nField<=(p->nMem+1 - p->nCursor)+1 );
96532 pData0 = &aMem[nField];
96533 nField = pOp->p2;
96534 pLast = &pData0[nField-1];
96566 while( (pLast->flags & MEM_Null)!=0 && nField>pOp->p5 ){
96568 nField--;
97391 int nField;
97424 nField = 0;
97462 nField = pKeyInfo->nAllField;
97464 nField = pOp->p4.i;
97467 assert( nField>=0 );
97468 testcase( nField==0 ); /* Table with INTEGER PRIMARY KEY and nothing else */
97469 pCur = allocateCursor(p, pOp->p1, nField, CURTYPE_BTREE);
97513 pCx = allocateCursor(p, pOp->p1, pOrig->nField, CURTYPE_BTREE);
97590 if( pCx && !pCx->noReuse && ALWAYS(pOp->p2<=pCx->nField) ){
97852 int nField; /* Number of columns or fields in the key */
97955 nField = pOp->p4.i;
97957 assert( nField>0 );
97959 r.nField = (u16)nField;
97978 for(i=0; i<r.nField; i++){
98157 r.nField = (u16)pOp[1].p4.i;
98163 for(i=0; i<r.nField; i++){
98406 r.nField = (u16)pOp->p4.i;
98407 if( r.nField>0 ){
98412 for(ii=0; ii<r.nField; ii++){
98452 for(ii=0; ii<r.nField; ii++){
99649 r.nField = (u16)pOp->p3;
99831 r.nField = (u16)pOp->p4.i;
99843 for(i=0; i<r.nField; i++){
102374 p->iOffset = pC->aType[p->iCol + pC->nField];
103715 ** records being sorted. However, if the value passed as argument nField
103716 ** is non-zero and the sorter is able to guarantee a stable sort, nField
103731 int nField, /* Number of key fields in each record */
103779 if( nField && nWorker==0 ){
103780 pKeyInfo->nKeyField = nField;
104137 pTask->pUnpacked->nField = pTask->pSorter->pKeyInfo->nKeyField;
105552 r2->nField = nKeyCol;
105554 assert( r2->nField==nKeyCol );
109583 int nField /* Total number of columns in the vector */
109607 pRet->iTable = nField;
118374 int nField = 0; /* Number of non-virtual columns after drop */
118390 nField = pPk->nKeyCol;
118402 regOut = reg+1+nField;
118414 nField++;
118417 if( nField==0 ){
118421 nField = 1;
118423 sqlite3VdbeAddOp3(v, OP_MakeRecord, reg+1, nField, regRec);
163717 int nField; /* Number of fields in pRec */
163725 assert( pRec->nField>0 );
163773 nField = pIdx->nKeyCol;
163775 nField = pIdx->nColumn;
163777 nField = MIN(pRec->nField, nField);
163779 iSample = pIdx->nSample * nField;
163785 iSamp = iTest / nField;
163788 ** Specifically, the shortest prefix of at least (1 + iTest%nField)
163790 for(n=(iTest % nField) + 1; n<nField; n++){
163797 pRec->nField = n;
163802 }else if( res==0 && n<nField ){
163811 i = iSample / nField;
163821 assert( iCol==nField-1 );
163822 pRec->nField = nField;
163831 pRec->nField = iCol+1;
163841 pRec->nField = iCol;
163846 pRec->nField = nField;
163856 assert( iCol==nField-1 );
163881 aStat[1] = pIdx->aAvgEq[nField-1];
163884 /* Restore the pRec->nField value before returning. */
163885 pRec->nField = nField;
164126 testcase( pRec->nField!=pBuilder->nRecValid );
164127 pRec->nField = pBuilder->nRecValid;