Lines Matching refs:nKey
14909 sqlite3_int64 nKey; /* Size of pKey for indexes. PRIMARY KEY for tabs */ member
65028 i64 nKey; /* The key for INTKEY tables, or nPayload otherwise */
65089 i64 nKey; /* Size of pKey, or last integer key */
66130 if( p->pgnoRoot==pgnoRoot && (isClearTable || p->info.nKey==iRow) ){
66248 pCur->nKey = sqlite3BtreeIntegerKey(pCur);
66257 pCur->nKey = sqlite3BtreePayloadSize(pCur);
66258 pKey = sqlite3Malloc( pCur->nKey + 9 + 8 );
66260 rc = sqlite3BtreePayload(pCur, 0, (int)pCur->nKey, pKey);
66262 memset(((u8*)pKey)+pCur->nKey, 0, 9+8);
66389 i64 nKey, /* Integer key for tables. Size of pKey for indices */
66398 assert( nKey==(i64)(int)nKey );
66401 sqlite3VdbeRecordUnpack(pKeyInfo, (int)nKey, pKey, pIdxKey);
66410 rc = sqlite3BtreeTableMoveto(pCur, nKey, bias, pRes);
66434 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &skipNext);
66761 pInfo->nSize = 4 + getVarint(&pCell[4], (u64*)&pInfo->nKey);
66819 pInfo->nKey = *(i64*)&iKey;
66856 pInfo->nKey = nPayload;
70169 if( a->nKey!=b->nKey ) return 0;
70220 return pCur->info.nKey;
71063 if( pCur->info.nKey==intKey ){
71067 if( pCur->info.nKey<intKey ){
71076 if( pCur->info.nKey+1==intKey ){
71081 if( pCur->info.nKey==intKey ){
71155 pCur->info.nKey = nCellKey;
71312 nCell = (int)pCur->info.nKey;
72221 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
72223 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
72224 nSrc = nPayload = (int)pX->nKey;
72278 assert( info.nKey==pX->nKey );
73855 sz = 4 + putVarint(&pCell[4], info.nKey);
74441 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
74450 assert( pX->nKey==pCur->info.nKey );
74459 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
74475 rc = sqlite3BtreeTableMoveto(pCur, pX->nKey,
74502 rc = btreeMoveto(pCur, pX->pKey, pX->nKey,
74514 if( pCur->info.nKey==pX->nKey ){
74517 x2.nData = pX->nKey;
74528 assert( pPage->intKey || pX->nKey>=0 || (flags & BTREE_PREFORMAT) );
74540 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
74652 pCur->pKey = sqlite3Malloc( pX->nKey );
74656 memcpy(pCur->pKey, pX->pKey, pX->nKey);
74660 pCur->nKey = pX->nKey;
74877 invalidateIncrblobCursors(p, pCur->pgnoRoot, pCur->info.nKey, 0);
75869 if( keyCanBeEqual ? (info.nKey > maxKey) : (info.nKey >= maxKey) ){
75870 checkAppendMsg(pCheck, "Rowid %lld out of order", info.nKey);
75872 maxKey = info.nKey;
83200 int nKey, /* Size of the binary record */
83216 while( idx<szHdr && d<=(u32)nKey ){
83229 if( d>(u32)nKey && u ){
83364 int nKey, const void *pKey, /* The record to verify */
83375 assert( nKey>=0 );
83376 assert( szHdr<=(u32)nKey );
86250 int nKey,
86258 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, pRet);
91975 x.nKey = pKey->u.i;
91991 sqlite3VdbePreUpdateHook(p,pC,SQLITE_INSERT,zDb,pTab,x.nKey,pOp->p2,-1);
92002 if( pOp->p5 & OPFLAG_LASTROWID ) db->lastRowid = x.nKey;
92027 zDb, pTab->zName, x.nKey);
92721 x.nKey = pIn2->n;
96047 int nKey; /* Number of bytes in key */
96400 pReadr->nKey = (int)nRec;
97336 pReadr1->aKey, pReadr1->nKey, pReadr2->aKey, pReadr2->nKey
97587 int nKey = pReader->nKey;
97593 if( (iEof + nKey + sqlite3VarintLen(nKey))>(iStart + pIncr->mxSz) ) break;
97596 vdbePmaWriteVarint(&writer, nKey);
97597 vdbePmaWriteBlob(&writer, pReader->aKey, nKey);
97757 pTask, &bCached, p1->aKey, p1->nKey, p2->aKey, p2->nKey
98379 *pnKey = pReader->nKey;
98393 void *pKey; int nKey; /* Sorter key to copy into pOut */
98397 pKey = vdbeSorterRowkey(pSorter, &nKey);
98398 if( sqlite3VdbeMemClearAndResize(pOut, nKey) ){
98401 pOut->n = nKey;
98403 memcpy(pOut->z, pKey, nKey);
98434 void *pKey; int nKey; /* Sorter key to compare pVal with */
98447 pKey = vdbeSorterRowkey(pSorter, &nKey);
98448 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, r2);
115289 static int isDupColumn(Index *pIdx, int nKey, Index *pPk, int iCol){
115291 assert( nKey<=pIdx->nColumn );
115299 for(i=0; i<nKey; i++){
118512 int nKey = pIdx->nKeyCol;
118516 pKey = sqlite3KeyInfoAlloc(pParse->db, nKey, nCol-nKey);
119474 i16 nKey; /* Number of memory cells in the row key */
119705 nKey = nPk; /* OP_Found will use an unpacked key */
119721 nKey = 0; /* Zero tells OP_Found to use a composite key */
119727 nKey = 1; /* OP_DeferredSeek always uses a single rowid */
119757 assert( nKey==nPk ); /* OP_Found will use an unpacked key */
119760 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, addrBypass, iKey, nKey);
119770 assert( nKey==0 ); /* OP_Found will use a composite key */
119774 assert( nKey==1 );
119797 iKey, nKey, count, OE_Default, eOnePass, aiCurOnePass[1]);
133320 int nKey; /* Number of PK columns for table pTab (>=1) */
133915 int nKey; /* Number of sorting key columns, including OP_Sequence */
133921 nKey = nExpr - pSort->nOBSat + bSeq;
133931 pOp->p2 = nKey + nData;
134216 int nKey = 1;
134221 nKey = pPk->nKeyCol;
134223 for(k=0; k<nKey; k++){
134235 pSort->aDefer[nDefer].nKey = nKey;
134585 int nKey;
134591 nKey = pSO->nExpr;
134593 r2 = sqlite3GetTempRange(pParse, nKey+2);
134594 r3 = r2+nKey+1;
134608 for(i=0; i<nKey; i++){
134613 sqlite3VdbeAddOp2(v, OP_Sequence, iParm, r2+nKey);
134614 sqlite3VdbeAddOp3(v, OP_MakeRecord, r2, nKey+2, r1);
134615 sqlite3VdbeAddOp4Int(v, OP_IdxInsert, iParm, r1, r2, nKey+2);
134618 sqlite3ReleaseTempRange(pParse, r2, nKey+2);
134808 int nKey; /* Number of key columns in sorter record */
134828 nRefKey = MAX(nRefKey, pSort->aDefer[i].nKey);
134845 nKey = pOrderBy->nExpr - pSort->nOBSat;
134853 nKey+1+nColumn+nRefKey);
134866 for(i=0, iCol=nKey+bSeq-1; i<nColumn; i++){
134880 int nKey = pSort->aDefer[i].nKey;
134890 assert( sqlite3PrimaryKeyIndex(pTab)->nKeyCol==nKey );
134891 for(k=0; k<nKey; k++){
134895 sqlite3VdbeAddOp4Int(v, OP_SeekGE, iCsr, iJmp+2, regKey, nKey);
134896 sqlite3VdbeAddOp4Int(v, OP_IdxLE, iCsr, iJmp+3, regKey, nKey);
134923 sqlite3VdbeAddOp3(v, OP_Column, iSortTab, nKey+bSeq, regRow);
142739 int nKey = 0; /* Number of elements in regKey for WITHOUT ROWID */
143108 nKey = nPk;
143184 nKey = nPk;
143227 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, labelBreak, regKey,nKey);
143381 sqlite3VdbeAddOp4Int(v, OP_NotFound,iDataCur,labelContinue,regKey,nKey);
143426 sqlite3VdbeAddOp4Int(v, OP_NotFound,iDataCur,labelContinue,regKey,nKey);
172258 void *pKey; int nKey; /* Key associated with this element */
172280 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
172281 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
172310 #define fts3HashKeysize(E) ((E)->nKey)
173879 int nKey;
173892 else if( isFts4 && fts3IsSpecialColumn(z, &nKey, &zVal) ){
173913 if( nKey==pOp->nOpt && !sqlite3_strnicmp(z, pOp->zOpt, pOp->nOpt) ){
179745 int nKey = pKey->n;
179750 assert( nKey==4 );
179752 nKey += 1+sqlite3Fts3ReadInt(&zInput[nKey+1], &nNear);
179760 cNext = zInput[nKey];
179771 *pnConsumed = (int)((zInput - z) + nKey);
180696 static int fts3StrHash(const void *pKey, int nKey){
180699 if( nKey<=0 ) nKey = (int) strlen(z);
180700 while( nKey > 0 ){
180702 nKey--;
180714 static int fts3BinHash(const void *pKey, int nKey){
180717 while( nKey-- > 0 ){
180808 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
180822 int nKey,
180835 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
180884 int nKey
180892 h = (*xHash)(pKey,nKey);
180894 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
180902 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
180905 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
180927 int nKey, /* Number of bytes in the key */
180939 hraw = (*xHash)(pKey, nKey);
180942 elem = fts3FindElementByHash(pH,pKey,nKey,h);
180963 new_elem->pKey = fts3HashMalloc( nKey );
180968 memcpy((void*)new_elem->pKey, pKey, nKey);
180972 new_elem->nKey = nKey;
184593 int nKey = fts3HashKeysize(pE);
184594 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
187116 int nKey, /* Number of bytes in nKey */
187170 if( fts3TermCmp(zKey, nKey, reader.term.a, reader.term.n)<=0 ){
187896 int nKey = pCsr->nTerm;
187897 rc = fts3IncrmergeLoad(p, iAbsLevel, iIdx-1, zKey, nKey, pWriter);
192365 static int jsonLabelCompare(JsonNode *pNode, const char *zKey, u32 nKey){
192368 if( pNode->n!=nKey ) return 0;
192369 return strncmp(pNode->u.zJContent, zKey, nKey)==0;
192371 if( pNode->n!=nKey+2 ) return 0;
192372 return strncmp(pNode->u.zJContent+1, zKey, nKey)==0;
192395 u32 i, j, nKey;
192406 nKey = i-1;
192416 nKey = i;
192418 if( nKey==0 ){
192425 if( jsonLabelCompare(pRoot+j, zKey, nKey) ){
192441 iLabel = jsonParseAddNode(pParse, JSON_STRING, nKey, zKey);
192865 u32 nKey;
192870 nKey = pPatch[i].n;
192877 if( pTarget[j].n==nKey && strncmp(pTarget[j].u.zJContent,zKey,nKey)==0 ){
192902 jsonParseAddNode(pParse, JSON_STRING, nKey, zKey);
222425 int nKey; /* Length of key in bytes */
222621 && p->nKey==nToken
222651 p->nKey = nToken;
222819 || (pIter->nKey+1>=nTerm && 0==memcmp(fts5EntryKey(pIter), pTerm, nTerm))
222859 assert( p->nKey+1==(int)strlen(zKey) );
222860 if( nTerm==p->nKey+1 && memcmp(zKey, pTerm, nTerm)==0 ) break;