Lines Matching defs:nField
9752 u16 nField; /* Number of entries in aColl[] */
9773 u16 nField; /* Number of entries in apMem[] */
12263 int nField; /* Number of fields in the header */
57858 int nField, nByte;
57860 nField = ((KeyInfo*)zP4)->nField;
57861 nByte = sizeof(*pKeyInfo) + (nField-1)*sizeof(pKeyInfo->aColl[0]) + nField;
57866 memcpy((char*)pKeyInfo, zP4, nByte - nField);
57869 pKeyInfo->aSortOrder = (unsigned char*)&pKeyInfo->aColl[nField];
57870 memcpy(pKeyInfo->aSortOrder, aSortOrder, nField);
57985 sqlite3_snprintf(nTemp, zTemp, "keyinfo(%d", pKeyInfo->nField);
57987 for(j=0; j<pKeyInfo->nField; j++){
59954 nByte = ROUND8(sizeof(UnpackedRecord)) + sizeof(Mem)*(pKeyInfo->nField+1);
59964 p->nField = pKeyInfo->nField + 1;
59970 while( idx<szHdr && u<p->nField && d<=nKey ){
59982 assert( u<=pKeyInfo->nField + 1 );
59983 p->nField = u;
59996 for(i=0, pMem=p->aMem; i<p->nField; i++, pMem++){
60043 int nField;
60069 nField = pKeyInfo->nField;
60070 while( idx1<szHdr1 && i<pPKey2->nField ){
60084 i<nField ? pKeyInfo->aColl[i] : 0);
60089 if( pKeyInfo->aSortOrder && i<nField && pKeyInfo->aSortOrder[i] ){
60098 if( (pPKey2->flags & UNPACKED_PREFIX_SEARCH) && i==(pPKey2->nField-1) ){
62007 int nField, /* Number of fields in the table or index */
62036 2*nField*sizeof(u32);
62047 pCx->nField = nField;
62048 if( nField ){
62053 &pMem->z[ROUND8(sizeof(VdbeCursor))+2*nField*sizeof(u32)];
62557 int nField; /* number of fields in the record */
62586 int nField; /* Number of fields in the record */
62628 int nField;
62648 int nField;
62666 u16 nField;
64222 assert( u.aj.i<u.aj.pKeyInfo->nField );
64428 int nField; /* number of fields in the record */
64465 ** the number of columns is stored in the VdbeCursor.nField element.
64519 u.am.nField = u.am.pC->nField;
64520 assert( u.am.p2<u.am.nField );
64531 u.am.pC->aOffset = u.am.aOffset = &u.am.aType[u.am.nField];
64577 ** to get u.am.nField type values. u.am.offset is an upper bound on this. But
64578 ** u.am.nField might be significantly less than the true number of columns
64579 ** in the table, and in that case, 5*u.am.nField+3 might be smaller than u.am.offset.
64584 ** On systems that cannot tolerate large memory allocations, u.am.nField*5+3
64585 ** will likely be much smaller since u.am.nField will likely be less than
64589 u.am.len = u.am.nField*5 + 3;
64615 for(u.am.i=0; u.am.i<u.am.nField; u.am.i++){
64626 /* If u.am.i is less that u.am.nField, then there are less fields in this
64759 int nField; /* Number of fields in the record */
64784 u.ao.nField = pOp->p1;
64786 assert( u.ao.nField>0 && pOp->p2>0 && pOp->p2+u.ao.nField<=p->nMem+1 );
64787 u.ao.pData0 = &aMem[u.ao.nField];
64788 u.ao.nField = pOp->p2;
64789 u.ao.pLast = &u.ao.pData0[u.ao.nField-1];
65370 int nField;
65385 u.aw.nField = 0;
65423 u.aw.nField = u.aw.pKeyInfo->nField+1;
65425 u.aw.nField = pOp->p4.i;
65428 u.aw.pCur = allocateCursor(p, pOp->p1, u.aw.nField, u.aw.iDb, 1);
65631 int nField;
65706 u.az.nField = pOp->p4.i;
65708 assert( u.az.nField>0 );
65710 u.az.r.nField = (u16)u.az.nField;
65727 { int i; for(i=0; i<u.az.r.nField; i++) assert( memIsValid(&u.az.r.aMem[i]) ); }
65855 u.bb.r.nField = (u16)pOp->p4.i;
65858 { int i; for(i=0; i<u.bb.r.nField; i++) assert( memIsValid(&u.bb.r.aMem[i]) ); }
65922 u16 nField;
65943 u.bc.nField = u.bc.pCx->pKeyInfo->nField;
65944 for(u.bc.ii=0; u.bc.ii<u.bc.nField; u.bc.ii++){
65951 assert( (u.bc.aMx[u.bc.nField].flags & MEM_Null)==0 );
65956 u.bc.r.nField = u.bc.nField + 1;
65960 { int i; for(i=0; i<u.bc.r.nField; i++) assert( memIsValid(&u.bc.r.aMem[i]) ); }
66764 u.bo.r.nField = (u16)pOp->p3;
66768 { int i; for(i=0; i<u.bo.r.nField; i++) assert( memIsValid(&u.bo.r.aMem[i]) ); }
66860 u.bq.r.nField = (u16)pOp->p4.i;
66868 { int i; for(i=0; i<u.bq.r.nField; i++) assert( memIsValid(&u.bq.r.aMem[i]) ); }
72377 keyInfo.nField = 1;
80588 pKey->nField = (u16)nCol;
90680 pInfo->nField = (u16)nExpr;
91768 pKeyInfo->nField = (u16)nCol;
92148 pKeyMerge->nField = (u16)nOrderBy;
92188 pKeyDup->nField = (u16)nExpr;