Lines Matching refs:nKey
4707 const void *pKey, int nKey /* The key */
4720 const void *pKey, int nKey /* The new key */
6102 void *pKey; int nKey; /* Key associated with this element */ member
6131 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const void *pKey, int nKey, void *pData);
6132 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const void *pKey, int nKey);
6133 SQLITE_PRIVATE HashElem *sqlite3HashFindElem(const Hash*, const void *pKey, int nKey);
6152 #define sqliteHashKeysize(E) ((E)->nKey)
6711 i64 nKey,
6716 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
17041 static int intHash(const void *pKey, int nKey){
17042 return nKey ^ (nKey<<8) ^ (nKey>>8);
17053 static int ptrHash(const void *pKey, int nKey){
17067 static int strHash(const void *pKey, int nKey){ in strHash() argument
17070 if( nKey<=0 ) nKey = strlen(z); in strHash()
17071 while( nKey > 0 ){ in strHash()
17073 nKey--; in strHash()
17085 static int binHash(const void *pKey, int nKey){ in binHash() argument
17088 while( nKey-- > 0 ){ in binHash()
17213 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1); in rehash()
17226 int nKey, in findElementGivenHash() argument
17239 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in findElementGivenHash()
17290 SQLITE_PRIVATE HashElem *sqlite3HashFindElem(const Hash *pH, const void *pKey, int nKey){ in sqlite3HashFindElem() argument
17298 h = (*xHash)(pKey,nKey); in sqlite3HashFindElem()
17299 elem = findElementGivenHash(pH,pKey,nKey, h % pH->htsize); in sqlite3HashFindElem()
17307 SQLITE_PRIVATE void *sqlite3HashFind(const Hash *pH, const void *pKey, int nKey){ in sqlite3HashFind() argument
17309 elem = sqlite3HashFindElem(pH, pKey, nKey); in sqlite3HashFind()
17328 SQLITE_PRIVATE void *sqlite3HashInsert(Hash *pH, const void *pKey, int nKey, void *data){ in sqlite3HashInsert() argument
17338 hraw = (*xHash)(pKey, nKey); in sqlite3HashInsert()
17341 elem = findElementGivenHash(pH,pKey,nKey,h); in sqlite3HashInsert()
17351 assert(nKey==elem->nKey); in sqlite3HashInsert()
17360 new_elem->pKey = sqlite3_malloc( nKey ); in sqlite3HashInsert()
17365 memcpy((void*)new_elem->pKey, pKey, nKey); in sqlite3HashInsert()
17369 new_elem->nKey = nKey; in sqlite3HashInsert()
29491 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */ member
29528 i64 nKey; /* Size of pKey, or last integer key */ member
30329 rc = sqlite3BtreeKeySize(pCur, &pCur->nKey); in saveCursorPosition()
30338 void *pKey = sqlite3_malloc(pCur->nKey); in saveCursorPosition()
30340 rc = sqlite3BtreeKey(pCur, 0, pCur->nKey, pKey); in saveCursorPosition()
30417 rc = sqlite3BtreeMoveto(pCur, pCur->pKey, 0, pCur->nKey, 0, &pCur->skip); in sqlite3BtreeRestoreOrClearCursorPosition()
30596 n += getVarint(&pCell[n], (u64 *)&pInfo->nKey); in sqlite3BtreeParseCellPtr()
30600 pInfo->nKey = x; in sqlite3BtreeParseCellPtr()
30682 assert( (info.nData+(pPage->intKey?0:info.nKey))==info.nPayload ); in ptrmapPutOvflPtr()
30683 if( (info.nData+(pPage->intKey?0:info.nKey))>info.nLocal ){ in ptrmapPutOvflPtr()
32938 *pSize = pCur->info.nKey; in sqlite3BtreeKeySize()
33126 u32 nKey; in accessPayload() local
33139 nKey = (pPage->intKey ? 0 : pCur->info.nKey); in accessPayload()
33142 offset += nKey; in accessPayload()
33144 if( offset+amt > nKey+pCur->info.nData ){ in accessPayload()
33326 u32 nKey; in fetchPayload() local
33338 nKey = 0; in fetchPayload()
33340 nKey = pCur->info.nKey; in fetchPayload()
33343 aPayload += nKey; in fetchPayload()
33344 nLocal = pCur->info.nLocal - nKey; in fetchPayload()
33347 if( nLocal>nKey ){ in fetchPayload()
33348 nLocal = nKey; in fetchPayload()
33645 i64 nKey, /* Size of pKey. Or the key for tables */ in sqlite3BtreeMoveto() argument
33658 if( pCur->info.nKey==nKey ){ in sqlite3BtreeMoveto()
33662 if( pCur->atLast && pCur->info.nKey<nKey ){ in sqlite3BtreeMoveto()
33690 pUnKey = sqlite3VdbeRecordUnpack(pCur->pKeyInfo, nKey, pKey, in sqlite3BtreeMoveto()
33727 if( nCellKey==nKey ){ in sqlite3BtreeMoveto()
33729 }else if( nCellKey<nKey ){ in sqlite3BtreeMoveto()
33732 assert( nCellKey>nKey ); in sqlite3BtreeMoveto()
33738 nCellKey = pCur->info.nKey; in sqlite3BtreeMoveto()
33754 pCur->info.nKey = nCellKey; in sqlite3BtreeMoveto()
33771 pCur->info.nKey = nCellKey; in sqlite3BtreeMoveto()
34354 const void *pKey, i64 nKey, /* The key */ in fillInCell() argument
34384 nHeader += putVarint(&pCell[nHeader], *(u64*)&nKey); in fillInCell()
34387 assert( info.nKey==nKey ); in fillInCell()
34397 nPayload += nKey; in fillInCell()
34399 nSrc = nKey; in fillInCell()
34663 assert( (info.nData+(pPage->intKey?0:info.nKey))==info.nPayload ); in insertCell()
34664 if( (info.nData+(pPage->intKey?0:info.nKey))>info.nLocal ){ in insertCell()
34795 rc = fillInCell(pParent, parentCell, 0, info.nKey, 0, 0, 0, &parentSize); in balance_quick()
35336 fillInCell(pParent, pCell, 0, info.nKey, 0, 0, 0, &sz); in balance_nonroot()
35677 const void *pKey, i64 nKey, /* The key of the new record */ in sqlite3BtreeInsert() argument
35712 SQLITE_OK!=(rc = sqlite3BtreeMoveto(pCur, pKey, 0, nKey, appendBias, &loc)) in sqlite3BtreeInsert()
35718 assert( pPage->intKey || nKey>=0 ); in sqlite3BtreeInsert()
35721 pCur->pgnoRoot, nKey, nData, pPage->pgno, in sqlite3BtreeInsert()
35727 rc = fillInCell(pPage, newCell, pKey, nKey, pData, nData, nZero, &szNew); in sqlite3BtreeInsert()
36577 if( !pPage->intKey ) sz += info.nKey; in checkTreePage()
40601 int nKey, /* Size of the binary record */ in sqlite3VdbeRecordUnpack() argument
40634 if( d>=nKey && sqlite3VdbeSerialTypeLen(serial_type)>0 ) break; in sqlite3VdbeRecordUnpack()
40813 int nKey, const u8 *pKey, /* The key to compare */ in sqlite3VdbeIdxKeyCompare() argument
40838 pRec = sqlite3VdbeRecordUnpack(pC->pKeyInfo, nKey, pKey, in sqlite3VdbeIdxKeyCompare()
45181 int nKey; /* Number of bytes in K */ in sqlite3VdbeExec() local
45189 nKey = pK->n; in sqlite3VdbeExec()
45192 len = nKey-szRowid; in sqlite3VdbeExec()
45905 int nKey = pIn2->n; in sqlite3VdbeExec() local
45907 rc = sqlite3BtreeInsert(pCrsr, zKey, nKey, "", 0, 0, pOp->p3); in sqlite3VdbeExec()
52363 int nKey; in attachFunc() local
52375 nKey = sqlite3_value_bytes(argv[2]); in attachFunc()
52377 sqlite3CodecAttach(db, db->nDb-1, zKey, nKey); in attachFunc()
52382 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey); in attachFunc()
52383 sqlite3CodecAttach(db, db->nDb-1, zKey, nKey); in attachFunc()
79348 void *pKey; int nKey; /* Key associated with this element */ member
79370 SQLITE_PRIVATE void *sqlite3Fts3HashInsert(fts3Hash*, const void *pKey, int nKey, void *pData);
79371 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const fts3Hash*, const void *pKey, int nKey);
79398 #define fts3HashKeysize(E) ((E)->nKey)
85770 static int fts3StrHash(const void *pKey, int nKey){ in fts3StrHash() argument
85773 if( nKey<=0 ) nKey = (int) strlen(z); in fts3StrHash()
85774 while( nKey > 0 ){ in fts3StrHash()
85776 nKey--; in fts3StrHash()
85788 static int fts3BinHash(const void *pKey, int nKey){ in fts3BinHash() argument
85791 while( nKey-- > 0 ){ in fts3BinHash()
85880 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1); in fts3Rehash()
85893 int nKey, in fts3FindElementByHash() argument
85906 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in fts3FindElementByHash()
85956 SQLITE_PRIVATE void *sqlite3Fts3HashFind(const fts3Hash *pH, const void *pKey, int nKey){ in sqlite3Fts3HashFind() argument
85964 h = (*xHash)(pKey,nKey); in sqlite3Fts3HashFind()
85966 elem = fts3FindElementByHash(pH,pKey,nKey, h & (pH->htsize-1)); in sqlite3Fts3HashFind()
85988 int nKey, /* Number of bytes in the key */ in sqlite3Fts3HashInsert() argument
86000 hraw = (*xHash)(pKey, nKey); in sqlite3Fts3HashInsert()
86003 elem = fts3FindElementByHash(pH,pKey,nKey,h); in sqlite3Fts3HashInsert()
86017 new_elem->pKey = fts3HashMalloc( nKey ); in sqlite3Fts3HashInsert()
86022 memcpy((void*)new_elem->pKey, pKey, nKey); in sqlite3Fts3HashInsert()
86026 new_elem->nKey = nKey; in sqlite3Fts3HashInsert()