Home
last modified time | relevance | path

Searched refs:nKey (Results 1 – 25 of 49) sorted by relevance

12

/sqlite-3.40.0/ext/fts1/
H A Dft_hash.c87 return nKey ^ (nKey<<8) ^ (nKey>>8);
115 if( nKey<=0 ) nKey = (int) strlen(z); in strHash()
116 while( nKey > 0 ){ in strHash()
118 nKey--; in strHash()
133 while( nKey-- > 0 ){ in binHash()
257 int nKey, in findElementGivenHash() argument
270 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in findElementGivenHash()
328 h = (*xHash)(pKey,nKey); in HashFind()
359 hraw = (*xHash)(pKey, nKey); in HashInsert()
376 new_elem->pKey = pH->xMalloc( nKey ); in HashInsert()
[all …]
H A Dfts1_hash.c92 static int strHash(const void *pKey, int nKey){ in strHash() argument
95 if( nKey<=0 ) nKey = (int) strlen(z); in strHash()
96 while( nKey > 0 ){ in strHash()
98 nKey--; in strHash()
113 while( nKey-- > 0 ){ in binHash()
215 int nKey, in findElementGivenHash() argument
228 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in findElementGivenHash()
286 h = (*xHash)(pKey,nKey); in sqlite3Fts1HashFind()
322 hraw = (*xHash)(pKey, nKey); in sqlite3Fts1HashInsert()
339 new_elem->pKey = pH->xMalloc( nKey ); in sqlite3Fts1HashInsert()
[all …]
H A Dft_hash.h55 void *pKey; int nKey; /* Key associated with this element */ member
84 void *HashInsert(Hash*, const void *pKey, int nKey, void *pData);
85 void *HashFind(const Hash*, const void *pKey, int nKey);
104 #define HashKeysize(E) ((E)->nKey)
H A Dfts1_hash.h55 void *pKey; int nKey; /* Key associated with this element */ member
77 void *sqlite3Fts1HashInsert(fts1Hash*, const void *pKey, int nKey, void *pData);
78 void *sqlite3Fts1HashFind(const fts1Hash*, const void *pKey, int nKey);
105 #define fts1HashKeysize(E) ((E)->nKey)
/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest_tdb2.cc72 ok = pKcDb->db->remove((const char *)pKey, nKey); in test_kc_delete()
92 const char *pKey; size_t nKey; in test_kc_delete_range() local
95 pKey = pCur->get(&nKey, &pVal, &nVal); in test_kc_delete_range()
101 assert( res>0 || (res==0 && nKey>nKey1) ); in test_kc_delete_range()
123 int nKey, in test_kc_fetch() argument
174 const char *pKey; size_t nKey; in test_kc_scan() local
176 pKey = pCur->get(&nKey, &pVal, &nVal); in test_kc_scan()
268 key.mv_size = nKey; in test_mdb_write()
290 key.mv_size = nKey; in test_mdb_delete()
308 int nKey, in test_mdb_fetch() argument
[all …]
H A Dlsmtest_tdb.c66 int nKey, in test_leveldb_write() argument
86 int nKey, in test_leveldb_fetch() argument
241 int nKey, in kc_write() argument
249 return test_kc_delete(pTestDb, pKey, nKey); in kc_delete()
263 int nKey, in kc_fetch() argument
327 int nKey, in mdb_write() argument
341 int nKey, in mdb_fetch() argument
445 int nKey, in sql_write() argument
478 int nKey, in sql_fetch() argument
533 void *pKey; int nKey; in sql_scan() local
[all …]
H A Dlsmtest6.c86 void *pKey, int nKey, in testOomFetch() argument
105 testOomAssert(pOom, rc!=LSM_OK || (n==nKey && memcmp(pKey, p, nKey)==0) ); in testOomFetch()
125 void *pKey, int nKey, in testOomWrite() argument
148 int nKey = strlen(zKey); in testOomFetchStr() local
160 void *pKey; int nKey; in testOomFetchData() local
173 int nKey = strlen(zKey); in testOomWriteStr() local
185 void *pKey; int nKey; in testOomWriteData() local
195 const void *pKey, int nKey, in testOomScan() argument
351 int nKey = strlen(zKey); in lsmWriteStr() local
433 void *pKey; int nKey; in setup_populate_db2() local
[all …]
H A Dlsmtest_main.c43 rc = tdb_fetch(pDb, pKey, nKey, &pDbVal, &nDbVal); in testFetch()
61 rc = tdb_write(pDb, pKey, nKey, pVal, nVal); in testWrite()
72 *pRc = rc = tdb_delete(pDb, pKey, nKey); in testDelete()
141 void *pKey, int nKey, in testFetchCompare() argument
194 void *pKey, int nKey, in scanCompareCb() argument
213 testFetch(p->pDb, pKey, nKey, pVal, nVal, &rc); in scanCompareCb()
219 for(i=0; i<nKey; i++){ in scanCompareCb()
229 if( nKey<(int)sizeof(p->aPrevKey) ){ in scanCompareCb()
239 p->nPrevKey = nKey; in scanCompareCb()
246 || (memcmp(p->pKey1, pKey, MIN(p->nKey1, nKey))==0 && p->nKey1>nKey) in scanCompareCb()
[all …]
H A Dlsmtest1.c109 void *pKey; int nKey; /* Database key to query for */ in testDatasourceFetch() local
112 testDatasourceEntry(pData, iKey, &pKey, &nKey, &pVal, &nVal); in testDatasourceFetch()
113 testFetch(pDb, pKey, nKey, pVal, nVal, pRc); in testDatasourceFetch()
173 void *pKey; int nKey; /* Database key to insert */ in testDbContents() local
175 testDatasourceEntry(pData, j, &pKey, &nKey, &pVal, &nVal); in testDbContents()
176 rc = tdb_write(pDb2, pKey, nKey, pVal, nVal); in testDbContents()
223 testFetch(pDb, pKey, nKey, pVal, nVal, &rc); in testDbContents()
247 void *pCtx, void *pKey, int nKey, void *pVal, int nVal
419 void *pKey; int nKey; in testCompareDb() local
420 testDatasourceEntry(pData, i, &pKey, &nKey, 0, 0); in testCompareDb()
[all …]
H A Dlsmtest_datasource.c27 int nKey = 0; in testDatasourceEntry() local
31 nKey = (int)( testPrngValue((u32)iData) % nRange ) + p->nMinKey; in testDatasourceEntry()
32 testPrngString((u32)iData, p->aKey, nKey); in testDatasourceEntry()
36 nKey = sprintf(p->aKey, "%012d", iData); in testDatasourceEntry()
40 *pnKey = nKey; in testDatasourceEntry()
H A Dlsmtest3.c99 void *pKey; int nKey; in testWriteDatasource() local
101 testDatasourceEntry(pData, i, &pKey, &nKey, &pVal, &nVal); in testWriteDatasource()
102 testWrite(pDb, pKey, nKey, pVal, nVal, pRc); in testWriteDatasource()
109 void *pKey; int nKey; in testDeleteDatasource() local
110 testDatasourceEntry(pData, i, &pKey, &nKey, 0, 0); in testDeleteDatasource()
111 testDelete(pDb, pKey, nKey, pRc); in testDeleteDatasource()
H A Dlsmtest2.c24 void *pKey, int nKey, in scanCksumDb() argument
31 for(i=0; i<nKey; i++){ in scanCksumDb()
46 void *pKey, int nKey, in scanCountDb() argument
53 unused_parameter(nKey); in scanCountDb()
394 void *pKey; int nKey; in crash_test2() local
397 testDatasourceEntry(pData, 100+iIns, &pKey, &nKey, &pVal, &nVal); in crash_test2()
398 testrc = tdb_write(pDb, pKey, nKey, pVal, nVal); in crash_test2()
H A Dlsmtest5.c69 int nKey; /* Size of key space (N) */ member
111 for(iMax=0; n<pParam->nKey; iMax++){ in dbMaxLevel()
119 void *pKey, int nKey, /* Database key. Unused. */ in dbCksum() argument
128 unused_parameter(nKey); in dbCksum()
216 assert( iKey>=0 && iKey<pParam->nKey ); in dbWriteOperation()
539 iKey = (testPrngValue(iPrng++) % p->param.nKey); in mt1Main()
551 iKey = (testPrngValue(iPrng++) % p->param.nKey); in mt1Main()
590 zSystem, p->param.nFanout, p->param.nKey, in do_test_mt1()
H A Dlsmtest_tdb.h46 int tdb_write(TestDb *pDb, void *pKey, int nKey, void *pVal, int nVal);
51 int tdb_delete(TestDb *pDb, void *pKey, int nKey);
63 int tdb_fetch(TestDb *pDb, void *pKey, int nKey, void **ppVal, int *pnVal);
124 void (*xCallback)(void *pCtx, void *pKey, int nKey, void *pVal, int nVal)
H A Dlsmtest_tdb3.c571 int nKey, in test_lsm_write() argument
588 rc = lsm_insert(pDb->db, pKey, nKey, pVal, nVal); in test_lsm_write()
595 return lsm_delete(pDb->db, pKey, nKey); in test_lsm_delete()
610 int nKey, in test_lsm_fetch() argument
627 rc = lsm_csr_seek(csr, pKey, nKey, LSM_SEEK_EQ); in test_lsm_fetch()
699 const void *pKey; int nKey; in test_lsm_scan() local
703 lsm_csr_key(csr, &pKey, &nKey); in test_lsm_scan()
707 cmp = memcmp(pFirst, pKey, MIN(nKey, nFirst)); in test_lsm_scan()
708 if( cmp>0 || (cmp==0 && nFirst>nKey) ) break; in test_lsm_scan()
710 cmp = memcmp(pLast, pKey, MIN(nKey, nLast)); in test_lsm_scan()
[all …]
/sqlite-3.40.0/ext/fts3/
H A Dfts3_hash.c100 if( nKey<=0 ) nKey = (int) strlen(z); in fts3StrHash()
101 while( nKey > 0 ){ in fts3StrHash()
103 nKey--; in fts3StrHash()
118 while( nKey-- > 0 ){ in fts3BinHash()
223 int nKey, in fts3FindElementByHash() argument
236 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in fts3FindElementByHash()
285 int nKey in sqlite3Fts3HashFindElem() argument
293 h = (*xHash)(pKey,nKey); in sqlite3Fts3HashFindElem()
340 hraw = (*xHash)(pKey, nKey); in sqlite3Fts3HashInsert()
364 new_elem->pKey = fts3HashMalloc( nKey ); in sqlite3Fts3HashInsert()
[all …]
H A Dfts3_hash.h53 void *pKey; int nKey; /* Key associated with this element */ member
75 void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
76 void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
105 #define fts3HashKeysize(E) ((E)->nKey)
/sqlite-3.40.0/ext/fts2/
H A Dfts2_hash.c99 static int strHash(const void *pKey, int nKey){ in strHash() argument
102 if( nKey<=0 ) nKey = (int) strlen(z); in strHash()
103 while( nKey > 0 ){ in strHash()
105 nKey--; in strHash()
120 while( nKey-- > 0 ){ in binHash()
222 int nKey, in findElementGivenHash() argument
235 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in findElementGivenHash()
293 h = (*xHash)(pKey,nKey); in sqlite3Fts2HashFind()
329 hraw = (*xHash)(pKey, nKey); in sqlite3Fts2HashInsert()
346 new_elem->pKey = fts2HashMalloc( nKey ); in sqlite3Fts2HashInsert()
[all …]
H A Dfts2_hash.h53 void *pKey; int nKey; /* Key associated with this element */ member
75 void *sqlite3Fts2HashInsert(fts2Hash*, const void *pKey, int nKey, void *pData);
76 void *sqlite3Fts2HashFind(const fts2Hash*, const void *pKey, int nKey);
103 #define fts2HashKeysize(E) ((E)->nKey)
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_sorted.c172 int nKey; member
560 int nKey; in pageGetKeyCopy() local
1404 int nKey, in assertSeekResult() argument
2057 nKey = pCsr->pBtCsr->nKey; in multiCursorGetKey()
2064 nKey = pPtr->nKey; in multiCursorGetKey()
2712 int nKey; in multiCursorCacheKey() local
3362 int nKey; in mergeWorkerPageOffset() local
3582 int nKey in mergeWorkerBtreeWrite() argument
4253 && 0==pDb->xCmp(pPtr->pKey, pPtr->nKey, pKey, nKey) in mergeWorkerStep()
5745 if( nKey>nKeyWidth ) nKeyWidth = nKey; in infoPageDump()
[all …]
H A Dlsm_log.c681 nReq = 1 + lsmVarintLen32(nKey) + 8 + nKey; in lsmLogWrite()
704 a += lsmVarintPut32(a, nKey); in lsmLogWrite()
713 memcpy(a, pKey, nKey); in lsmLogWrite()
714 a += nKey; in lsmLogWrite()
1025 int nKey; in lsmLogRecover() local
1028 logReaderVarint(&reader, &buf1, &nKey, &rc); in lsmLogRecover()
1034 bEof = logRequireCksum(&reader, nKey+nVal); in lsmLogRecover()
1038 logReaderBlob(&reader, &buf1, nKey, 0, &rc); in lsmLogRecover()
1052 int nKey; u8 *aKey; in lsmLogRecover() local
1053 logReaderVarint(&reader, &buf1, &nKey, &rc); in lsmLogRecover()
[all …]
H A Dlsm_tree.c358 nReq = sizeof(TreeKey) + pRet->nKey; in treeShmkey()
732 void *pKey, int nKey, /* Key data */ in newTreeKey() argument
747 p->nKey = nKey; in newTreeKey()
751 n = nRem = nKey; in newTreeKey()
1471 rc = lsmTreeCursorSeek(&csr, pKey, nKey, &res); in treeInsertEntry()
1955 cmp = treeKeycmp(TKV_KEY(p), p->nKey, pKey, nKey); in treeCsrCompare()
2013 res = treeKeycmp((void *)&pTreeKey[1], pTreeKey->nKey, pKey, nKey); in lsmTreeCursorSeek()
2030 res = treeKeycmp((void *)&pTreeKey[1], pTreeKey->nKey, pKey, nKey); in lsmTreeCursorSeek()
2121 assert( rc||treeKeycmp(TKV_KEY(pK2),pK2->nKey,TKV_KEY(pK1),pK1->nKey)>=0 ); in lsmTreeCursorNext()
2189 assert( rc || treeKeycmp(TKV_KEY(pK2),pK2->nKey,TKV_KEY(pK1),pK1->nKey)<0 ); in lsmTreeCursorPrev()
[all …]
H A Dlsm_main.c660 const void *pKey, int nKey, /* Key to write or delete */ in doWriteOp() argument
673 rc = lsmLogWrite(pDb, eType, (void *)pKey, nKey, (void *)pVal, nVal); in doWriteOp()
691 rc = lsmTreeDelete(pDb, (void *)pKey, nKey, (void *)pVal, nVal); in doWriteOp()
693 rc = lsmTreeInsert(pDb, (void *)pKey, nKey, (void *)pVal, nVal); in doWriteOp()
721 const void *pKey, int nKey, /* Key to write or delete */ in lsm_insert() argument
724 return doWriteOp(db, 0, pKey, nKey, pVal, nVal); in lsm_insert()
730 int lsm_delete(lsm_db *db, const void *pKey, int nKey){ in lsm_delete() argument
731 return doWriteOp(db, 0, pKey, nKey, 0, -1); in lsm_delete()
806 int lsm_csr_seek(lsm_cursor *pCsr, const void *pKey, int nKey, int eSeek){ in lsm_csr_seek() argument
807 return lsmMCursorSeek((MultiCursor *)pCsr, 0, (void *)pKey, nKey, eSeek); in lsm_csr_seek()
H A Dlsm.h514 int lsm_insert(lsm_db*, const void *pKey, int nKey, const void *pVal, int nVal);
520 int lsm_delete(lsm_db *, const void *pKey, int nKey);
605 int lsm_csr_seek(lsm_cursor *pCsr, const void *pKey, int nKey, int eSeek);
664 int lsm_csr_cmp(lsm_cursor *pCsr, const void *pKey, int nKey, int *piRes);
/sqlite-3.40.0/src/
H A Dvdbesort.c707 pReadr->nKey = (int)nRec; in vdbePmaReaderNext()
1644 pReadr1->aKey, pReadr1->nKey, pReadr2->aKey, pReadr2->nKey in vdbeMergeEngineStep()
1895 int nKey = pReader->nKey; in vdbeIncrPopulate() local
1901 if( (iEof + nKey + sqlite3VarintLen(nKey))>(iStart + pIncr->mxSz) ) break; in vdbeIncrPopulate()
1904 vdbePmaWriteVarint(&writer, nKey); in vdbeIncrPopulate()
2065 pTask, &bCached, p1->aKey, p1->nKey, p2->aKey, p2->nKey in vdbeMergeEngineCompare()
2687 *pnKey = pReader->nKey; in vdbeSorterRowkey()
2705 pKey = vdbeSorterRowkey(pSorter, &nKey); in sqlite3VdbeSorterRowkey()
2709 pOut->n = nKey; in sqlite3VdbeSorterRowkey()
2711 memcpy(pOut->z, pKey, nKey); in sqlite3VdbeSorterRowkey()
[all …]

12