Lines Matching refs:nKey
16742 sqlite3_int64 nKey; /* Size of pKey for indexes. PRIMARY KEY for tabs */ member
70997 i64 nKey; /* The key for INTKEY tables, or nPayload otherwise */ member
71064 i64 nKey; /* Size of pKey, or last integer key */ member
72157 if( p->pgnoRoot==pgnoRoot && (isClearTable || p->info.nKey==iRow) ){
72275 pCur->nKey = sqlite3BtreeIntegerKey(pCur);
72284 pCur->nKey = sqlite3BtreePayloadSize(pCur);
72285 pKey = sqlite3Malloc( ((i64)pCur->nKey) + 9 + 8 );
72287 rc = sqlite3BtreePayload(pCur, 0, (int)pCur->nKey, pKey);
72289 memset(((u8*)pKey)+pCur->nKey, 0, 9+8);
72416 i64 nKey, /* Integer key for tables. Size of pKey for indices */
72425 assert( nKey==(i64)(int)nKey );
72428 sqlite3VdbeRecordUnpack(pKeyInfo, (int)nKey, pKey, pIdxKey);
72437 rc = sqlite3BtreeTableMoveto(pCur, nKey, bias, pRes);
72461 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &skipNext);
72806 pInfo->nSize = 4 + getVarint(&pCell[4], (u64*)&pInfo->nKey);
72882 pInfo->nKey = *(i64*)&iKey;
72921 pInfo->nKey = nPayload;
76395 if( a->nKey!=b->nKey ) return 0;
76446 return pCur->info.nKey;
77310 if( pCur->info.nKey==intKey ){
77314 if( pCur->info.nKey<intKey ){
77324 if( pCur->info.nKey+1==intKey ){
77329 if( pCur->info.nKey==intKey ){
77402 pCur->info.nKey = nCellKey;
77660 nCell = (int)pCur->info.nKey;
78592 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
78594 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
78595 nSrc = nPayload = (int)pX->nKey;
78652 assert( info.nKey==pX->nKey );
80336 sz = 4 + putVarint(&pCell[4], info.nKey);
80960 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
80969 assert( pX->nKey==pCur->info.nKey );
80978 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
80994 rc = sqlite3BtreeTableMoveto(pCur, pX->nKey,
81021 rc = btreeMoveto(pCur, pX->pKey, pX->nKey,
81033 if( pCur->info.nKey==pX->nKey ){
81036 x2.nData = (int)pX->nKey; assert( pX->nKey<=0x7fffffff );
81046 assert( pPage->intKey || pX->nKey>=0 || (flags & BTREE_PREFORMAT) );
81059 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
81176 pCur->pKey = sqlite3Malloc( pX->nKey );
81180 memcpy(pCur->pKey, pX->pKey, pX->nKey);
81184 pCur->nKey = pX->nKey;
81420 invalidateIncrblobCursors(p, pCur->pgnoRoot, pCur->info.nKey, 0);
82466 if( keyCanBeEqual ? (info.nKey > maxKey) : (info.nKey >= maxKey) ){
82467 checkAppendMsg(pCheck, "Rowid %lld out of order", info.nKey);
82469 maxKey = info.nKey;
90136 int nKey, /* Size of the binary record */
90152 while( idx<szHdr && d<=(u32)nKey ){
90166 if( d>(u32)nKey && u ){
90311 int nKey, const void *pKey, /* The record to verify */
90322 assert( nKey>=0 );
90323 assert( szHdr<=(u32)nKey );
93618 int nKey,
93626 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, pRet);
100057 x.nKey = pKey->u.i;
100073 sqlite3VdbePreUpdateHook(p,pC,SQLITE_INSERT,zDb,pTab,x.nKey,pOp->p2,-1);
100086 if( pOp->p5 & OPFLAG_LASTROWID ) db->lastRowid = x.nKey;
100114 zDb, pTab->zName, x.nKey);
100843 x.nKey = pIn2->n;
104456 int nKey; /* Number of bytes in key */
104810 pReadr->nKey = (int)nRec;
105753 pReadr1->aKey, pReadr1->nKey, pReadr2->aKey, pReadr2->nKey
106004 int nKey = pReader->nKey;
106010 if( (iEof + nKey + sqlite3VarintLen(nKey))>(iStart + pIncr->mxSz) ) break;
106013 vdbePmaWriteVarint(&writer, nKey);
106014 vdbePmaWriteBlob(&writer, pReader->aKey, nKey);
106174 pTask, &bCached, p1->aKey, p1->nKey, p2->aKey, p2->nKey
106796 *pnKey = pReader->nKey;
106810 void *pKey; int nKey; /* Sorter key to copy into pOut */
106814 pKey = vdbeSorterRowkey(pSorter, &nKey);
106815 if( sqlite3VdbeMemClearAndResize(pOut, nKey) ){
106818 pOut->n = nKey;
106820 memcpy(pOut->z, pKey, nKey);
106851 void *pKey; int nKey; /* Sorter key to compare pVal with */
106864 pKey = vdbeSorterRowkey(pSorter, &nKey);
106865 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, r2);
125263 static int isDupColumn(Index *pIdx, int nKey, Index *pPk, int iCol){
125265 assert( nKey<=pIdx->nColumn );
125273 for(i=0; i<nKey; i++){
128644 int nKey = pIdx->nKeyCol;
128648 pKey = sqlite3KeyInfoAlloc(pParse->db, nKey, nCol-nKey);
129663 i16 nKey; /* Number of memory cells in the row key */
129905 nKey = nPk; /* OP_Found will use an unpacked key */
129921 nKey = 0; /* Zero tells OP_Found to use a composite key */
129927 nKey = 1; /* OP_DeferredSeek always uses a single rowid */
129957 assert( nKey==nPk ); /* OP_Found will use an unpacked key */
129960 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, addrBypass, iKey, nKey);
129970 assert( nKey==0 ); /* OP_Found will use a composite key */
129974 assert( nKey==1 );
129997 iKey, nKey, count, OE_Default, eOnePass, aiCurOnePass[1]);
144903 int nKey; /* Number of PK columns for table pTab (>=1) */
145631 int nKey; /* Number of sorting key columns, including OP_Sequence */
145637 nKey = nExpr - pSort->nOBSat + bSeq;
145647 pOp->p2 = nKey + nData;
145935 int nKey = 1;
145940 nKey = pPk->nKeyCol;
145942 for(k=0; k<nKey; k++){
145954 pSort->aDefer[nDefer].nKey = nKey;
146320 int nKey;
146326 nKey = pSO->nExpr;
146328 r2 = sqlite3GetTempRange(pParse, nKey+2);
146329 r3 = r2+nKey+1;
146343 for(i=0; i<nKey; i++){
146348 sqlite3VdbeAddOp2(v, OP_Sequence, iParm, r2+nKey);
146349 sqlite3VdbeAddOp3(v, OP_MakeRecord, r2, nKey+2, r1);
146350 sqlite3VdbeAddOp4Int(v, OP_IdxInsert, iParm, r1, r2, nKey+2);
146353 sqlite3ReleaseTempRange(pParse, r2, nKey+2);
146544 int nKey; /* Number of key columns in sorter record */
146554 nKey = pOrderBy->nExpr - pSort->nOBSat;
146555 if( pSort->nOBSat==0 || nKey==1 ){
146561 "USE TEMP B-TREE FOR LAST %d TERMS OF ORDER BY", nKey
146581 nRefKey = MAX(nRefKey, pSort->aDefer[i].nKey);
146608 nKey+1+nColumn+nRefKey);
146624 for(i=0, iCol=nKey+bSeq-1; i<nColumn; i++){
146638 int nKey = pSort->aDefer[i].nKey;
146648 assert( sqlite3PrimaryKeyIndex(pTab)->nKeyCol==nKey );
146649 for(k=0; k<nKey; k++){
146653 sqlite3VdbeAddOp4Int(v, OP_SeekGE, iCsr, iJmp+2, regKey, nKey);
146654 sqlite3VdbeAddOp4Int(v, OP_IdxLE, iCsr, iJmp+3, regKey, nKey);
146682 sqlite3VdbeAddOp3(v, OP_Column, iSortTab, nKey+bSeq, regRow);
151670 int nKey; /* Key columns to be skipped */
151679 nKey = 0;
151684 nKey = pF->pFExpr->pLeft->x.pList->nExpr;
151685 if( ALWAYS(!pF->bOBUnique) ) nKey++;
151689 sqlite3VdbeAddOp3(v, OP_Column, pF->iOBTab, nKey+j, regAgg+j);
151693 int iBaseCol = nKey + nArg + (pF->bOBPayload==0 && pF->bOBUnique==0);
155769 int nKey = 0; /* Number of elements in regKey for WITHOUT ROWID */
156142 nKey = nPk;
156228 nKey = nPk;
156273 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, labelBreak, regKey,nKey);
156430 sqlite3VdbeAddOp4Int(v, OP_NotFound,iDataCur,labelContinue,regKey,nKey);
156475 sqlite3VdbeAddOp4Int(v, OP_NotFound,iDataCur,labelContinue,regKey,nKey);
188676 void *pKey; int nKey; /* Key associated with this element */
188698 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
188699 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
188728 #define fts3HashKeysize(E) ((E)->nKey)
190321 int nKey;
190334 else if( isFts4 && fts3IsSpecialColumn(z, &nKey, &zVal) ){
190355 if( nKey==pOp->nOpt && !sqlite3_strnicmp(z, pOp->zOpt, pOp->nOpt) ){
196316 int nKey = pKey->n;
196321 assert( nKey==4 );
196323 nKey += 1+sqlite3Fts3ReadInt(&zInput[nKey+1], &nNear);
196331 cNext = zInput[nKey];
196342 *pnConsumed = (int)((zInput - z) + nKey);
197266 static int fts3StrHash(const void *pKey, int nKey){
197269 if( nKey<=0 ) nKey = (int) strlen(z);
197270 while( nKey > 0 ){
197272 nKey--;
197284 static int fts3BinHash(const void *pKey, int nKey){
197287 while( nKey-- > 0 ){
197378 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
197392 int nKey,
197405 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
197454 int nKey
197462 h = (*xHash)(pKey,nKey);
197464 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
197472 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
197475 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
197497 int nKey, /* Number of bytes in the key */
197509 hraw = (*xHash)(pKey, nKey);
197512 elem = fts3FindElementByHash(pH,pKey,nKey,h);
197533 new_elem->pKey = fts3HashMalloc( nKey );
197538 memcpy((void*)new_elem->pKey, pKey, nKey);
197542 new_elem->nKey = nKey;
201162 int nKey = fts3HashKeysize(pE);
201163 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
203701 int nKey, /* Number of bytes in nKey */
203755 if( fts3TermCmp(zKey, nKey, reader.term.a, reader.term.n)<=0 ){
204482 int nKey = pCsr->nTerm;
204483 rc = fts3IncrmergeLoad(p, iAbsLevel, iIdx-1, zKey, nKey, pWriter);
210795 u32 i, j, k, nKey, sz, n, iEnd, rc;
210828 nKey = i-1;
210834 testcase( nKey==0 );
210835 rawKey = memchr(zKey, '\\', nKey)==0;
210839 nKey = i;
210840 if( nKey==0 ){
210859 if( jsonLabelCompare(zKey, nKey, rawKey, zLabel, sz, rawLabel) ){
210884 jsonBlobAppendNode(&ix, rawKey?JSONB_TEXTRAW:JSONB_TEXT5, nKey, 0);
210888 && jsonBlobMakeEditable(pParse, ix.nBlob+nKey+v.nBlob)
210891 nIns = ix.nBlob + nKey + v.nBlob;
210898 memcpy(&pParse->aBlob[k], zKey, nKey);
210899 k += nKey;
243734 int nKey; /* Length of key in bytes */
243845 iHash = fts5HashKey(nNew, (u8*)fts5EntryKey(p), p->nKey);
243929 && p->nKey==nToken+1
243959 p->nKey = nToken+1;
244080 int nMin = MIN(p1->nKey, p2->nKey);
244084 cmp = p1->nKey - p2->nKey;
244130 || (pIter->nKey>=nTerm && 0==memcmp(fts5EntryKey(pIter), pTerm, nTerm))
244169 if( nTerm==p->nKey && memcmp(zKey, pTerm, nTerm)==0 ) break;
244241 int nTerm = p->nKey;