Lines Matching refs:nKey
15015 sqlite3_int64 nKey; /* Size of pKey for indexes. PRIMARY KEY for tabs */ member
63781 i64 nKey; /* The key for INTKEY tables, or nPayload otherwise */
63842 i64 nKey; /* Size of pKey, or last integer key */
64869 if( p->pgnoRoot==pgnoRoot && (isClearTable || p->info.nKey==iRow) ){
64987 pCur->nKey = sqlite3BtreeIntegerKey(pCur);
64996 pCur->nKey = sqlite3BtreePayloadSize(pCur);
64997 pKey = sqlite3Malloc( pCur->nKey + 9 + 8 );
64999 rc = sqlite3BtreePayload(pCur, 0, (int)pCur->nKey, pKey);
65001 memset(((u8*)pKey)+pCur->nKey, 0, 9+8);
65128 i64 nKey, /* Integer key for tables. Size of pKey for indices */
65137 assert( nKey==(i64)(int)nKey );
65140 sqlite3VdbeRecordUnpack(pKeyInfo, (int)nKey, pKey, pIdxKey);
65148 rc = sqlite3BtreeMovetoUnpacked(pCur, pIdxKey, nKey, bias, pRes);
65175 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &skipNext);
65484 pInfo->nSize = 4 + getVarint(&pCell[4], (u64*)&pInfo->nKey);
65542 pInfo->nKey = *(i64*)&iKey;
65579 pInfo->nKey = nPayload;
68855 if( a->nKey!=b->nKey ) return 0;
68906 return pCur->info.nKey;
69756 if( pCur->info.nKey==intKey ){
69760 if( pCur->info.nKey<intKey ){
69769 if( pCur->info.nKey+1==intKey ){
69774 if( pCur->info.nKey==intKey ){
69857 pCur->info.nKey = nCellKey;
69907 nCell = (int)pCur->info.nKey;
70813 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
70815 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
70816 nSrc = nPayload = (int)pX->nKey;
70870 assert( info.nKey==pX->nKey );
72438 sz = 4 + putVarint(&pCell[4], info.nKey);
73008 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
73016 assert( pX->nKey==pCur->info.nKey );
73025 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
73041 rc = sqlite3BtreeMovetoUnpacked(pCur, 0, pX->nKey, flags!=0, &loc);
73070 rc = btreeMoveto(pCur, pX->pKey, pX->nKey, flags!=0, &loc);
73081 if( pCur->info.nKey==pX->nKey ){
73084 x2.nData = pX->nKey;
73096 assert( pPage->intKey || pX->nKey>=0 );
73104 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
73199 pCur->pKey = sqlite3Malloc( pX->nKey );
73203 memcpy(pCur->pKey, pX->pKey, pX->nKey);
73207 pCur->nKey = pX->nKey;
73310 invalidateIncrblobCursors(p, pCur->pgnoRoot, pCur->info.nKey, 0);
74298 if( keyCanBeEqual ? (info.nKey > maxKey) : (info.nKey >= maxKey) ){
74299 checkAppendMsg(pCheck, "Rowid %lld out of order", info.nKey);
74301 maxKey = info.nKey;
81546 int nKey, /* Size of the binary record */
81562 while( idx<szHdr && d<=(u32)nKey ){
81575 if( d>(u32)nKey && u ){
81710 int nKey, const void *pKey, /* The record to verify */
81721 assert( nKey>=0 );
81722 assert( szHdr<=(u32)nKey );
84582 int nKey,
84590 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, pRet);
90016 x.nKey = pKey->u.i;
90032 sqlite3VdbePreUpdateHook(p, pC, SQLITE_INSERT, zDb, pTab, x.nKey,pOp->p2);
90043 if( pOp->p5 & OPFLAG_LASTROWID ) db->lastRowid = x.nKey;
90067 zDb, pTab->zName, x.nKey);
90736 x.nKey = pIn2->n;
94011 int nKey; /* Number of bytes in key */
94364 pReadr->nKey = (int)nRec;
95296 pReadr1->aKey, pReadr1->nKey, pReadr2->aKey, pReadr2->nKey
95547 int nKey = pReader->nKey;
95553 if( (iEof + nKey + sqlite3VarintLen(nKey))>(iStart + pIncr->mxSz) ) break;
95556 vdbePmaWriteVarint(&writer, nKey);
95557 vdbePmaWriteBlob(&writer, pReader->aKey, nKey);
95716 pTask, &bCached, p1->aKey, p1->nKey, p2->aKey, p2->nKey
96338 *pnKey = pReader->nKey;
96352 void *pKey; int nKey; /* Sorter key to copy into pOut */
96356 pKey = vdbeSorterRowkey(pSorter, &nKey);
96357 if( sqlite3VdbeMemClearAndResize(pOut, nKey) ){
96360 pOut->n = nKey;
96362 memcpy(pOut->z, pKey, nKey);
96393 void *pKey; int nKey; /* Sorter key to compare pVal with */
96406 pKey = vdbeSorterRowkey(pSorter, &nKey);
96407 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, r2);
111976 static int isDupColumn(Index *pIdx, int nKey, Index *pPk, int iCol){
111978 assert( nKey<=pIdx->nColumn );
111986 for(i=0; i<nKey; i++){
115032 int nKey = pIdx->nKeyCol;
115036 pKey = sqlite3KeyInfoAlloc(pParse->db, nKey, nCol-nKey);
115941 i16 nKey; /* Number of memory cells in the row key */
116165 nKey = nPk; /* OP_Found will use an unpacked key */
116180 nKey = 0; /* Zero tells OP_Found to use a composite key */
116186 nKey = 1; /* OP_DeferredSeek always uses a single rowid */
116223 assert( nKey==nPk ); /* OP_Found will use an unpacked key */
116226 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, addrBypass, iKey, nKey);
116236 assert( nKey==0 ); /* OP_Found will use a composite key */
116240 assert( nKey==1 );
116263 iKey, nKey, count, OE_Default, eOnePass, aiCurOnePass[1]);
128914 int nKey; /* Number of PK columns for table pTab (>=1) */
129506 int nKey; /* Number of sorting key columns, including OP_Sequence */
129512 nKey = nExpr - pSort->nOBSat + bSeq;
129522 pOp->p2 = nKey + nData;
129677 int nKey = 1;
129682 nKey = pPk->nKeyCol;
129684 for(k=0; k<nKey; k++){
129695 pSort->aDefer[nDefer].nKey = nKey;
130067 int nKey;
130073 nKey = pSO->nExpr;
130075 r2 = sqlite3GetTempRange(pParse, nKey+2);
130076 r3 = r2+nKey+1;
130090 for(i=0; i<nKey; i++){
130095 sqlite3VdbeAddOp2(v, OP_Sequence, iParm, r2+nKey);
130096 sqlite3VdbeAddOp3(v, OP_MakeRecord, r2, nKey+2, r1);
130097 sqlite3VdbeAddOp4Int(v, OP_IdxInsert, iParm, r1, r2, nKey+2);
130100 sqlite3ReleaseTempRange(pParse, r2, nKey+2);
130290 int nKey; /* Number of key columns in sorter record */
130310 nRefKey = MAX(nRefKey, pSort->aDefer[i].nKey);
130327 nKey = pOrderBy->nExpr - pSort->nOBSat;
130335 nKey+1+nColumn+nRefKey);
130348 for(i=0, iCol=nKey+bSeq-1; i<nColumn; i++){
130362 int nKey = pSort->aDefer[i].nKey;
130372 assert( sqlite3PrimaryKeyIndex(pTab)->nKeyCol==nKey );
130373 for(k=0; k<nKey; k++){
130377 sqlite3VdbeAddOp4Int(v, OP_SeekGE, iCsr, iJmp+2, regKey, nKey);
130378 sqlite3VdbeAddOp4Int(v, OP_IdxLE, iCsr, iJmp+3, regKey, nKey);
130405 sqlite3VdbeAddOp3(v, OP_Column, iSortTab, nKey+bSeq, regRow);
137232 int nKey = 0; /* Number of elements in regKey for WITHOUT ROWID */
137635 nKey = nPk;
137672 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, labelBreak, regKey,nKey);
137794 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, labelContinue,regKey,nKey);
137838 sqlite3VdbeAddOp4Int(v, OP_NotFound,iDataCur,labelContinue,regKey,nKey);
165657 void *pKey; int nKey; /* Key associated with this element */
165679 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
165680 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
165709 #define fts3HashKeysize(E) ((E)->nKey)
167279 int nKey;
167292 else if( isFts4 && fts3IsSpecialColumn(z, &nKey, &zVal) ){
167313 if( nKey==pOp->nOpt && !sqlite3_strnicmp(z, pOp->zOpt, pOp->nOpt) ){
173119 int nKey = pKey->n;
173124 assert( nKey==4 );
173126 nKey += 1+sqlite3Fts3ReadInt(&zInput[nKey+1], &nNear);
173134 cNext = zInput[nKey];
173145 *pnConsumed = (int)((zInput - z) + nKey);
174065 static int fts3StrHash(const void *pKey, int nKey){
174068 if( nKey<=0 ) nKey = (int) strlen(z);
174069 while( nKey > 0 ){
174071 nKey--;
174083 static int fts3BinHash(const void *pKey, int nKey){
174086 while( nKey-- > 0 ){
174177 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
174191 int nKey,
174204 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
174253 int nKey
174261 h = (*xHash)(pKey,nKey);
174263 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
174271 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
174274 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
174296 int nKey, /* Number of bytes in the key */
174308 hraw = (*xHash)(pKey, nKey);
174311 elem = fts3FindElementByHash(pH,pKey,nKey,h);
174332 new_elem->pKey = fts3HashMalloc( nKey );
174337 memcpy((void*)new_elem->pKey, pKey, nKey);
174341 new_elem->nKey = nKey;
177951 int nKey = fts3HashKeysize(pE);
177952 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
180460 int nKey, /* Number of bytes in nKey */
180514 if( fts3TermCmp(zKey, nKey, reader.term.a, reader.term.n)<=0 ){
181237 int nKey = pCsr->nTerm;
181238 rc = fts3IncrmergeLoad(p, iAbsLevel, iIdx-1, zKey, nKey, pWriter);
185652 static int jsonLabelCompare(JsonNode *pNode, const char *zKey, u32 nKey){
185654 if( pNode->n!=nKey ) return 0;
185655 return strncmp(pNode->u.zJContent, zKey, nKey)==0;
185657 if( pNode->n!=nKey+2 ) return 0;
185658 return strncmp(pNode->u.zJContent+1, zKey, nKey)==0;
185681 u32 i, j, nKey;
185692 nKey = i-1;
185702 nKey = i;
185704 if( nKey==0 ){
185711 if( jsonLabelCompare(pRoot+j, zKey, nKey) ){
185726 iLabel = jsonParseAddNode(pParse, JSON_STRING, nKey, zKey);
186140 u32 nKey;
186144 nKey = pPatch[i].n;
186151 if( pTarget[j].n==nKey && strncmp(pTarget[j].u.zJContent,zKey,nKey)==0 ){
186170 jsonParseAddNode(pParse, JSON_STRING, nKey, zKey);
214957 int nKey; /* Length of key in bytes */
215153 && p->nKey==nToken
215183 p->nKey = nToken;
215351 || (pIter->nKey+1>=nTerm && 0==memcmp(fts5EntryKey(pIter), pTerm, nTerm))
215391 assert( p->nKey+1==(int)strlen(zKey) );
215392 if( nTerm==p->nKey+1 && memcmp(zKey, pTerm, nTerm)==0 ) break;