Lines Matching defs:nField
10311 u16 nField; /* Number of entries in aColl[] */
10332 u16 nField; /* Number of entries in apMem[] */
12882 int nField; /* Number of fields in the header */
60276 int nField, nByte;
60278 nField = ((KeyInfo*)zP4)->nField;
60279 nByte = sizeof(*pKeyInfo) + (nField-1)*sizeof(pKeyInfo->aColl[0]) + nField;
60284 memcpy((char*)pKeyInfo, zP4, nByte - nField);
60287 pKeyInfo->aSortOrder = (unsigned char*)&pKeyInfo->aColl[nField];
60288 memcpy(pKeyInfo->aSortOrder, aSortOrder, nField);
60402 sqlite3_snprintf(nTemp, zTemp, "keyinfo(%d", pKeyInfo->nField);
60404 for(j=0; j<pKeyInfo->nField; j++){
62407 nByte = ROUND8(sizeof(UnpackedRecord)) + sizeof(Mem)*(pKeyInfo->nField+1);
62419 p->nField = pKeyInfo->nField + 1;
62446 while( idx<szHdr && u<p->nField && d<=nKey ){
62458 assert( u<=pKeyInfo->nField + 1 );
62459 p->nField = u;
62487 int nField;
62510 nField = pKeyInfo->nField;
62511 while( idx1<szHdr1 && i<pPKey2->nField ){
62525 i<nField ? pKeyInfo->aColl[i] : 0);
62530 if( pKeyInfo->aSortOrder && i<nField && pKeyInfo->aSortOrder[i] ){
62539 if( (pPKey2->flags & UNPACKED_PREFIX_SEARCH) && i==(pPKey2->nField-1) ){
64554 int nField, /* Number of fields in the table or index */
64583 2*nField*sizeof(u32);
64594 pCx->nField = nField;
64595 if( nField ){
64600 &pMem->z[ROUND8(sizeof(VdbeCursor))+2*nField*sizeof(u32)];
65108 int nField; /* number of fields in the record */
65138 int nField; /* Number of fields in the record */
65180 int nField;
65203 int nField;
65222 u16 nField;
66818 assert( u.ak.i<u.ak.pKeyInfo->nField );
67041 int nField; /* number of fields in the record */
67078 ** the number of columns is stored in the VdbeCursor.nField element.
67133 u.an.nField = u.an.pC->nField;
67134 assert( u.an.p2<u.an.nField );
67145 u.an.pC->aOffset = u.an.aOffset = &u.an.aType[u.an.nField];
67191 ** to get u.an.nField type values. u.an.offset is an upper bound on this. But
67192 ** u.an.nField might be significantly less than the true number of columns
67193 ** in the table, and in that case, 5*u.an.nField+3 might be smaller than u.an.offset.
67198 ** On systems that cannot tolerate large memory allocations, u.an.nField*5+3
67199 ** will likely be much smaller since u.an.nField will likely be less than
67203 u.an.len = u.an.nField*5 + 3;
67229 for(u.an.i=0; u.an.i<u.an.nField; u.an.i++){
67246 /* If u.an.i is less that u.an.nField, then there are less fields in this
67379 int nField; /* Number of fields in the record */
67404 u.ap.nField = pOp->p1;
67406 assert( u.ap.nField>0 && pOp->p2>0 && pOp->p2+u.ap.nField<=p->nMem+1 );
67407 u.ap.pData0 = &aMem[u.ap.nField];
67408 u.ap.nField = pOp->p2;
67409 u.ap.pLast = &u.ap.pData0[u.ap.nField-1];
68012 int nField;
68027 u.ax.nField = 0;
68065 u.ax.nField = u.ax.pKeyInfo->nField+1;
68067 u.ax.nField = pOp->p4.i;
68070 u.ax.pCur = allocateCursor(p, pOp->p1, u.ax.nField, u.ax.iDb, 1);
68296 int nField;
68371 u.bb.nField = pOp->p4.i;
68373 assert( u.bb.nField>0 );
68375 u.bb.r.nField = (u16)u.bb.nField;
68392 { int i; for(i=0; i<u.bb.r.nField; i++) assert( memIsValid(&u.bb.r.aMem[i]) ); }
68521 u.bd.r.nField = (u16)pOp->p4.i;
68524 { int i; for(i=0; i<u.bd.r.nField; i++) assert( memIsValid(&u.bd.r.aMem[i]) ); }
68588 u16 nField;
68609 u.be.nField = u.be.pCx->pKeyInfo->nField;
68610 for(u.be.ii=0; u.be.ii<u.be.nField; u.be.ii++){
68617 assert( (u.be.aMx[u.be.nField].flags & MEM_Null)==0 );
68622 u.be.r.nField = u.be.nField + 1;
68626 { int i; for(i=0; i<u.be.r.nField; i++) assert( memIsValid(&u.be.r.aMem[i]) ); }
69505 u.bs.r.nField = (u16)pOp->p3;
69509 { int i; for(i=0; i<u.bs.r.nField; i++) assert( memIsValid(&u.bs.r.aMem[i]) ); }
69601 u.bu.r.nField = (u16)pOp->p4.i;
69609 { int i; for(i=0; i<u.bu.r.nField; i++) assert( memIsValid(&u.bu.r.aMem[i]) ); }
71993 r2->nField = pKeyInfo->nField;
71994 assert( r2->nField>0 );
71995 for(i=0; i<r2->nField; i++){
76086 keyInfo.nField = 1;
85038 pKey->nField = (u16)nCol;
95306 pInfo->nField = (u16)nExpr;
96416 pKeyInfo->nField = (u16)nCol;
96796 pKeyMerge->nField = (u16)nOrderBy;
96836 pKeyDup->nField = (u16)nExpr;
