Lines Matching refs:nKey
4751 const void *pKey, int nKey /* The key */
4764 const void *pKey, int nKey /* The new key */
7345 const char *pKey; int nKey; /* Key associated with this element */ member
7352 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
7353 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
8046 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
21755 static unsigned int strHash(const char *z, int nKey){ in strHash() argument
21757 assert( nKey>=0 ); in strHash()
21758 while( nKey > 0 ){ in strHash()
21760 nKey--; in strHash()
21828 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size; in rehash()
21842 int nKey, /* Bytes in key (not counting zero terminator) */ in findElementGivenHash() argument
21857 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){ in findElementGivenHash()
21903 SQLITE_PRIVATE void *sqlite3HashFind(const Hash *pH, const char *pKey, int nKey){ in sqlite3HashFind() argument
21909 assert( nKey>=0 ); in sqlite3HashFind()
21911 h = strHash(pKey, nKey) % pH->htsize; in sqlite3HashFind()
21915 elem = findElementGivenHash(pH, pKey, nKey, h); in sqlite3HashFind()
21933 SQLITE_PRIVATE void *sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data){ in sqlite3HashInsert() argument
21940 assert( nKey>=0 ); in sqlite3HashInsert()
21942 h = strHash(pKey, nKey) % pH->htsize; in sqlite3HashInsert()
21946 elem = findElementGivenHash(pH,pKey,nKey,h); in sqlite3HashInsert()
21954 assert(nKey==elem->nKey); in sqlite3HashInsert()
21962 new_elem->nKey = nKey; in sqlite3HashInsert()
21968 h = strHash(pKey, nKey) % pH->htsize; in sqlite3HashInsert()
47047 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */
47090 i64 nKey; /* Size of pKey, or last integer key */
47992 if( p->isIncrblobHandle && (isClearTable || p->info.nKey==iRow) ){
48090 rc = sqlite3BtreeKeySize(pCur, &pCur->nKey);
48100 void *pKey = sqlite3Malloc( (int)pCur->nKey );
48102 rc = sqlite3BtreeKey(pCur, 0, (int)pCur->nKey, pKey);
48167 i64 nKey, /* Integer key for tables. Size of pKey for indices */
48176 assert( nKey==(i64)(int)nKey );
48177 pIdxKey = sqlite3VdbeRecordUnpack(pCur->pKeyInfo, (int)nKey, pKey,
48183 rc = sqlite3BtreeMovetoUnpacked(pCur, pIdxKey, nKey, bias, pRes);
48205 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &pCur->skipNext);
48429 n += getVarint(&pCell[n], (u64*)&pInfo->nKey);
48434 pInfo->nKey = nPayload;
48563 assert( (info.nData+(pPage->intKey?0:info.nKey))==info.nPayload );
51183 *pSize = pCur->info.nKey;
51353 u32 nKey;
51365 nKey = (pPage->intKey ? 0 : (int)pCur->info.nKey);
51367 if( NEVER(offset+amt > nKey+pCur->info.nData)
51551 u32 nKey;
51566 nKey = 0;
51568 nKey = (int)pCur->info.nKey;
51571 aPayload += nKey;
51572 nLocal = pCur->info.nLocal - nKey;
51575 assert( nLocal<=nKey );
51947 if( pCur->info.nKey==intKey ){
51951 if( pCur->atLast && pCur->info.nKey<intKey ){
52013 pCur->info.nKey = nCellKey;
52043 nCell = (int)pCur->info.nKey;
52754 const void *pKey, i64 nKey, /* The key */
52789 nHeader += putVarint(&pCell[nHeader], *(u64*)&nKey);
52792 assert( info.nKey==nKey );
52802 if( NEVER(nKey>0x7fffffff || pKey==0) ){
52805 nPayload += (int)nKey;
52807 nSrc = (int)nKey;
53789 sz = 4 + putVarint(&pCell[4], info.nKey);
54184 const void *pKey, i64 nKey, /* The key of the new record */
54220 invalidateIncrblobCursors(p, nKey, 0);
54237 rc = btreeMoveto(pCur, pKey, nKey, appendBias, &loc);
54243 assert( pPage->intKey || nKey>=0 );
54247 pCur->pgnoRoot, nKey, nData, pPage->pgno,
54253 rc = fillInCell(pPage, newCell, pKey, nKey, pData, nData, nZero, &szNew);
54349 invalidateIncrblobCursors(p, pCur->info.nKey, 0);
55174 if( !pPage->intKey ) sz += (int)info.nKey;
55177 else if( i==0 ) nMinKey = nMaxKey = info.nKey;
55179 if( info.nKey <= nMaxKey ){
55181 "Rowid %lld out of order (previous was %lld)", info.nKey, nMaxKey);
55183 nMaxKey = info.nKey;
60389 int nKey, /* Size of the binary record */
60428 while( idx<szHdr && u<p->nField && d<=nKey ){
63174 int nKey;
67183 int nKey;
67197 u.bn.nKey = pIn2->n;
67199 rc = sqlite3BtreeInsert(u.bn.pCrsr, u.bn.zKey, u.bn.nKey, "", 0, 0, pOp->p3,
76703 int nKey;
76715 nKey = sqlite3_value_bytes(argv[2]);
76717 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey);
76722 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey);
76723 if( nKey>0 || sqlite3BtreeGetReserve(db->aDb[0].pBt)>0 ){
76724 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey);
97089 int nKey;
97091 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey);
97092 if( nKey ) db->nextPagesize = 0;
111738 void *pKey; int nKey; /* Key associated with this element */
111760 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
111761 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
111790 #define fts3HashKeysize(E) ((E)->nKey)
112931 int nKey;
112944 else if( isFts4 && fts3IsSpecialColumn(z, &nKey, &zVal) ){
112963 if( nKey==pOp->nOpt && !sqlite3_strnicmp(z, pOp->zOpt, pOp->nOpt) ){
117302 int nKey = pKey->n;
117307 assert( nKey==4 );
117310 for(nKey=5; zInput[nKey]>='0' && zInput[nKey]<='9'; nKey++){
117311 nNear = nNear * 10 + (zInput[nKey] - '0');
117320 cNext = zInput[nKey];
117331 *pnConsumed = (int)((zInput - z) + nKey);
117969 static int fts3StrHash(const void *pKey, int nKey){
117972 if( nKey<=0 ) nKey = (int) strlen(z);
117973 while( nKey > 0 ){
117975 nKey--;
117987 static int fts3BinHash(const void *pKey, int nKey){
117990 while( nKey-- > 0 ){
118081 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
118095 int nKey,
118108 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
118157 int nKey
118165 h = (*xHash)(pKey,nKey);
118167 return fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1));
118175 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){
118178 pElem = sqlite3Fts3HashFindElem(pH, pKey, nKey);
118200 int nKey, /* Number of bytes in the key */
118212 hraw = (*xHash)(pKey, nKey);
118215 elem = fts3FindElementByHash(pH,pKey,nKey,h);
118236 new_elem->pKey = fts3HashMalloc( nKey );
118241 memcpy((void*)new_elem->pKey, pKey, nKey);
118245 new_elem->nKey = nKey;
121081 int nKey = fts3HashKeysize(pE);
121082 if( nTerm==0 || (nKey>=nTerm && 0==memcmp(zKey, zTerm, nTerm)) ){
