Lines Matching refs:nKey
5459 const void *pKey, int nKey /* The key */
5464 const void *pKey, int nKey /* The key */
5477 const void *pKey, int nKey /* The new key */
5482 const void *pKey, int nKey /* The new key */
12529 sqlite3_int64 nKey; /* Size of pKey for indexes. PRIMARY KEY for tabs */ member
58674 i64 nKey; /* The key for INTKEY tables, or nPayload otherwise */
58717 i64 nKey; /* Size of pKey, or last integer key */
59722 if( p->pgnoRoot==pgnoRoot && (isClearTable || p->info.nKey==iRow) ){
59838 pCur->nKey = sqlite3BtreeIntegerKey(pCur);
59842 pCur->nKey = sqlite3BtreePayloadSize(pCur);
59843 pKey = sqlite3Malloc( pCur->nKey );
59845 rc = sqlite3BtreePayload(pCur, 0, (int)pCur->nKey, pKey);
59970 i64 nKey, /* Integer key for tables. Size of pKey for indices */
59978 assert( nKey==(i64)(int)nKey );
59981 sqlite3VdbeRecordUnpack(pCur->pKeyInfo, (int)nKey, pKey, pIdxKey);
59989 rc = sqlite3BtreeMovetoUnpacked(pCur, pIdxKey, nKey, bias, pRes);
60013 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &skipNext);
60300 pInfo->nSize = 4 + getVarint(&pCell[4], (u64*)&pInfo->nKey);
60358 pInfo->nKey = *(i64*)&iKey;
60395 pInfo->nKey = nPayload;
63571 return pCur->info.nKey;
64366 if( pCur->info.nKey==intKey ){
64370 if( pCur->info.nKey<intKey ){
64379 if( pCur->info.nKey+1==intKey && !pCur->skipNext ){
64385 if( pCur->info.nKey==intKey ){
64461 pCur->info.nKey = nCellKey;
64510 nCell = (int)pCur->info.nKey;
65423 nHeader += putVarint(&pCell[nHeader], *(u64*)&pX->nKey);
65425 assert( pX->nKey<=0x7fffffff && pX->pKey!=0 );
65426 nSrc = nPayload = (int)pX->nKey;
65469 assert( info.nKey==pX->nKey );
66880 sz = 4 + putVarint(&pCell[4], info.nKey);
67324 invalidateIncrblobCursors(p, pCur->pgnoRoot, pX->nKey, 0);
67329 ((pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey) );
67334 if( (pCur->curFlags&BTCF_ValidNKey)!=0 && pX->nKey==pCur->info.nKey ){
67337 rc = sqlite3BtreeMovetoUnpacked(pCur, 0, pX->nKey, flags!=0, &loc);
67353 rc = btreeMoveto(pCur, pX->pKey, pX->nKey, flags!=0, &loc);
67360 assert( pPage->intKey || pX->nKey>=0 );
67364 pCur->pgnoRoot, pX->nKey, pX->nData, pPage->pgno,
67452 pCur->pKey = sqlite3Malloc( pX->nKey );
67456 memcpy(pCur->pKey, pX->pKey, pX->nKey);
67460 pCur->nKey = pX->nKey;
67558 invalidateIncrblobCursors(p, pCur->pgnoRoot, pCur->info.nKey, 0);
68529 if( keyCanBeEqual ? (info.nKey > maxKey) : (info.nKey >= maxKey) ){
68530 checkAppendMsg(pCheck, "Rowid %lld out of order", info.nKey);
68532 maxKey = info.nKey;
75136 int nKey, /* Size of the binary record */
75152 while( idx<szHdr && d<=nKey ){
75287 int nKey, const void *pKey, /* The record to verify */
75298 assert( nKey>=0 );
75299 assert( szHdr<=(u32)nKey );
77943 int nKey,
77951 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, pRet);
82945 x.nKey = pKey->u.i;
82948 x.nKey = pOp->p3;
82968 sqlite3VdbePreUpdateHook(p, pC, SQLITE_INSERT, zDb, pTab, x.nKey, pOp->p2);
82974 if( pOp->p5 & OPFLAG_LASTROWID ) db->lastRowid = x.nKey;
82999 db->xUpdateCallback(db->pUpdateArg, op, zDb, pTab->zName, x.nKey);
83681 x.nKey = pIn2->n;
86555 int nKey; /* Number of bytes in key */
86908 pReadr->nKey = (int)nRec;
87845 pReadr1->aKey, pReadr1->nKey, pReadr2->aKey, pReadr2->nKey
88089 int nKey = pReader->nKey;
88095 if( (iEof + nKey + sqlite3VarintLen(nKey))>(iStart + pIncr->mxSz) ) break;
88098 vdbePmaWriteVarint(&writer, nKey);
88099 vdbePmaWriteBlob(&writer, pReader->aKey, nKey);
88258 pTask, &bCached, p1->aKey, p1->nKey, p2->aKey, p2->nKey
88870 *pnKey = pReader->nKey;
88884 void *pKey; int nKey; /* Sorter key to copy into pOut */
88888 pKey = vdbeSorterRowkey(pSorter, &nKey);
88889 if( sqlite3VdbeMemClearAndResize(pOut, nKey) ){
88892 pOut->n = nKey;
88894 memcpy(pOut->z, pKey, nKey);
88925 void *pKey; int nKey; /* Sorter key to compare pVal with */
88938 pKey = vdbeSorterRowkey(pSorter, &nKey);
88939 sqlite3VdbeRecordUnpack(pKeyInfo, nKey, pKey, r2);
99213 int nKey;
99225 nKey = sqlite3_value_bytes(argv[2]);
99227 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey);
99232 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey);
99233 if( nKey || sqlite3BtreeGetOptimalReserve(db->aDb[0].pBt)>0 ){
99234 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey);
104254 int nKey = pIdx->nKeyCol;
104258 pKey = sqlite3KeyInfoAlloc(pParse->db, nKey, nCol-nKey);
105071 i16 nKey; /* Number of memory cells in the row key */
105277 nKey = nPk; /* OP_Found will use an unpacked key */
105292 nKey = 0; /* Zero tells OP_Found to use a composite key */
105298 nKey = 1; /* OP_Seek always uses a single rowid */
105333 assert( nKey==nPk ); /* OP_Found will use an unpacked key */
105336 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, addrBypass, iKey, nKey);
105342 assert( nKey==0 ); /* OP_Found will use a composite key */
105346 assert( nKey==1 );
105366 iKey, nKey, count, OE_Default, eOnePass, aiCurOnePass[1]);
117272 int nKey; /* Number of sorting key columns, including OP_Sequence */
117277 nKey = nExpr - pSort->nOBSat + bSeq;
117287 pOp->p2 = nKey + nData;
117691 int nKey;
117697 nKey = pSO->nExpr;
117699 r2 = sqlite3GetTempRange(pParse, nKey+2);
117700 r3 = r2+nKey+1;
117714 for(i=0; i<nKey; i++){
117719 sqlite3VdbeAddOp2(v, OP_Sequence, iParm, r2+nKey);
117720 sqlite3VdbeAddOp3(v, OP_MakeRecord, r2, nKey+2, r1);
117721 sqlite3VdbeAddOp4Int(v, OP_IdxInsert, iParm, r1, r2, nKey+2);
117724 sqlite3ReleaseTempRange(pParse, r2, nKey+2);
117957 int nKey;
117980 nKey = pOrderBy->nExpr - pSort->nOBSat;
117987 sqlite3VdbeAddOp3(v, OP_OpenPseudo, iSortTab, regSortOut, nKey+1+nSortData);
118000 for(i=0, iCol=nKey+bSeq; i<nSortData; i++){
124041 int nKey = 0; /* Number of elements in regKey for WITHOUT ROWID */
124349 nKey = nPk;
124384 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, labelBreak, regKey, nKey);
124495 sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, labelContinue,regKey,nKey);
124531 addr1 = sqlite3VdbeAddOp4Int(v, OP_NotFound, iDataCur, 0, regKey, nKey);
124980 int nKey;
124982 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey);
124983 if( nKey ) db->nextPagesize = 0;
145622 void *pKey; int nKey; /* Key associated with this element */
145644 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
145645 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
145674 #define fts3HashKeysize(E) ((E)->nKey)
147155 int nKey;
147168 else if( isFts4 && fts3IsSpecialColumn(z, &nKey, &zVal) ){
147189 if( nKey==pOp->nOpt && !sqlite3_strnicmp(z, pOp->zOpt, pOp->nOpt) ){
152914 int nKey = pKey->n;
152919 assert( nKey==4 );
152922 for(nKey=5; zInput[nKey]>='0' && zInput[nKey]<='9'; nKey++){
152923 nNear = nNear * 10 + (zInput[nKey] - '0');
152932 cNext = zInput[nKey];
152943 *pnConsumed = (int)((zInput - z) + nKey);
153881 static int fts3StrHash(const void *pKey, int nKey){
153884 if( nKey<=0 ) nKey = (int) strlen(z);
153885 while( nKey > 0 ){
153887 nKey--;
153899 static int fts3BinHash(const void *pKey, int nKey){
153902 while( nKey-- > 0 ){
153993 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
154007 int nKey,
154020 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
154069 int nKey
154077 h = (*xHash)(pKey,nKey);
154079 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
154087 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
154090 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
154112 int nKey, /* Number of bytes in the key */
154124 hraw = (*xHash)(pKey, nKey);
154127 elem = fts3FindElementByHash(pH,pKey,nKey,h);
154148 new_elem->pKey = fts3HashMalloc( nKey );
154153 memcpy((void*)new_elem->pKey, pKey, nKey);
154157 new_elem->nKey = nKey;
157750 int nKey = fts3HashKeysize(pE);
157751 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
160232 int nKey, /* Number of bytes in nKey */
160282 if( fts3TermCmp(zKey, nKey, reader.term.a, reader.term.n)<=0 ){
160965 int nKey = pCsr->nTerm;
160966 rc = fts3IncrmergeLoad(p, iAbsLevel, iIdx-1, zKey, nKey, pWriter);
180603 static int jsonLabelCompare(JsonNode *pNode, const char *zKey, u32 nKey){
180605 if( pNode->n!=nKey ) return 0;
180606 return strncmp(pNode->u.zJContent, zKey, nKey)==0;
180608 if( pNode->n!=nKey+2 ) return 0;
180609 return strncmp(pNode->u.zJContent+1, zKey, nKey)==0;
180632 u32 i, j, nKey;
180642 nKey = i-1;
180652 nKey = i;
180654 if( nKey==0 ){
180661 if( jsonLabelCompare(pRoot+j, zKey, nKey) ){
181059 u32 nKey;
181063 nKey = pPatch[i].n;
181070 if( pTarget[j].n==nKey && strncmp(pTarget[j].u.zJContent,zKey,nKey)==0 ){
181089 jsonParseAddNode(pParse, JSON_STRING, nKey, zKey);
189645 int nKey; /* Length of key in bytes */
189829 && p->nKey==nToken
189859 p->nKey = nToken;