| /sqlite-3.40.0/ext/lsm1/lsm-test/ |
| H A D | lsmtest_tdb2.cc | 60 int test_kc_write(TestDb *pDb, void *pKey, int nKey, void *pVal, int nVal){ in test_kc_write()
68 int test_kc_delete(TestDb *pDb, void *pKey, int nKey){ in test_kc_delete()
92 const char *pKey; size_t nKey; in test_kc_delete_range() local
122 void *pKey, in test_kc_fetch()
153 void (*xCallback)(void *pCtx, void *pKey, int nKey, void *pVal, int nVal) in test_kc_scan()
174 const char *pKey; size_t nKey; in test_kc_scan() local
259 int test_mdb_write(TestDb *pDb, void *pKey, int nKey, void *pVal, int nVal){ in test_mdb_write()
284 int test_mdb_delete(TestDb *pDb, void *pKey, int nKey){ in test_mdb_delete()
307 void *pKey, in test_mdb_fetch()
344 void (*xCallback)(void *pCtx, void *pKey, int nKey, void *pVal, int nVal) in test_mdb_scan()
|
| H A D | lsmtest_tdb.c | 65 void *pKey, in test_leveldb_write()
85 void *pKey, in test_leveldb_fetch()
240 void *pKey, in kc_write()
248 static int kc_delete(TestDb *pTestDb, void *pKey, int nKey){ in kc_delete()
262 void *pKey, in kc_fetch()
326 void *pKey, in mdb_write()
340 void *pKey, in mdb_fetch()
444 void *pKey, in sql_write()
477 void *pKey, in sql_fetch()
533 void *pKey; int nKey; in sql_scan() local
[all …]
|
| H A D | lsmtest6.c | 86 void *pKey, int nKey, in testOomFetch()
125 void *pKey, int nKey, in testOomWrite()
160 void *pKey; int nKey; in testOomFetchData() local
185 void *pKey; int nKey; in testOomWriteData() local
195 const void *pKey, int nKey, in testOomScan()
433 void *pKey; int nKey; in setup_populate_db2() local
|
| H A D | lsmtest2.c | 24 void *pKey, int nKey, in scanCksumDb()
46 void *pKey, int nKey, in scanCountDb()
394 void *pKey; int nKey; in crash_test2() local
|
| H A D | lsmtest1.c | 109 void *pKey; int nKey; /* Database key to query for */ in testDatasourceFetch() local
173 void *pKey; int nKey; /* Database key to insert */ in testDbContents() local
208 void *pKey; int nKey; /* Database key to query for */ in testDbContents() local
419 void *pKey; int nKey; in testCompareDb() local
|
| H A D | lsmtest3.c | 99 void *pKey; int nKey; in testWriteDatasource() local
109 void *pKey; int nKey; in testDeleteDatasource() local
|
| H A D | lsmtest_main.c | 32 void *pKey, int nKey, /* Key to query database for */ in testFetch()
53 void *pKey, int nKey, /* Key to query database for */ in testWrite()
67 void *pKey, int nKey, /* Key to query database for */ in testDelete()
141 void *pKey, int nKey, in testFetchCompare()
194 void *pKey, int nKey, in scanCompareCb()
733 void *pKey; int nKey; /* Database key to query for */ in do_speed_test2() local
1436 void *pKey; int nKey; /* Database key to insert */ in do_insert() local
|
| H A D | lsmtest7.c | 24 const void *pKey; in do_test_api1_lsm() local
|
| H A D | lsmtest_tdb3.c | 570 void *pKey, in test_lsm_write()
593 static int test_lsm_delete(TestDb *pTestDb, void *pKey, int nKey){ in test_lsm_delete()
609 void *pKey, in test_lsm_fetch()
699 const void *pKey; int nKey; in test_lsm_scan() local
|
| /sqlite-3.40.0/ext/fts3/ |
| H A D | fts3_hash.c | 97 static int fts3StrHash(const void *pKey, int nKey){ in fts3StrHash()
115 static int fts3BinHash(const void *pKey, int nKey){ in fts3BinHash()
222 const void *pKey, /* The key we are searching for */ in fts3FindElementByHash()
284 const void *pKey, in sqlite3Fts3HashFindElem()
303 void *sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey){ in sqlite3Fts3HashFind()
327 const void *pKey, /* The key */ in sqlite3Fts3HashInsert()
|
| H A D | fts3_hash.h | 53 void *pKey; int nKey; /* Key associated with this element */ member
|
| /sqlite-3.40.0/ext/fts1/ |
| H A D | ft_hash.c | 112 static int strHash(const void *pKey, int nKey){ in strHash()
130 static int binHash(const void *pKey, int nKey){ in binHash()
256 const void *pKey, /* The key we are searching for */ in findElementGivenHash()
320 void *HashFind(const Hash *pH, const void *pKey, int nKey){ in HashFind()
349 void *HashInsert(Hash *pH, const void *pKey, int nKey, void *data){ in HashInsert()
|
| H A D | fts1_hash.c | 92 static int strHash(const void *pKey, int nKey){ in strHash()
110 static int binHash(const void *pKey, int nKey){ in binHash()
214 const void *pKey, /* The key we are searching for */ in findElementGivenHash()
278 void *sqlite3Fts1HashFind(const fts1Hash *pH, const void *pKey, int nKey){ in sqlite3Fts1HashFind()
309 const void *pKey, /* The key */ in sqlite3Fts1HashInsert()
|
| H A D | ft_hash.h | 55 void *pKey; int nKey; /* Key associated with this element */ member
|
| H A D | fts1_hash.h | 55 void *pKey; int nKey; /* Key associated with this element */ member
|
| /sqlite-3.40.0/ext/fts2/ |
| H A D | fts2_hash.c | 99 static int strHash(const void *pKey, int nKey){ in strHash()
117 static int binHash(const void *pKey, int nKey){ in binHash()
221 const void *pKey, /* The key we are searching for */ in findElementGivenHash()
285 void *sqlite3Fts2HashFind(const fts2Hash *pH, const void *pKey, int nKey){ in sqlite3Fts2HashFind()
316 const void *pKey, /* The key */ in sqlite3Fts2HashInsert()
|
| H A D | fts2_hash.h | 53 void *pKey; int nKey; /* Key associated with this element */ member
|
| /sqlite-3.40.0/src/ |
| H A D | hash.c | 149 const char *pKey, /* The key we are searching for */ in findElementWithHash()
217 void *sqlite3HashFind(const Hash *pH, const char *pKey){ in sqlite3HashFind()
237 void *sqlite3HashInsert(Hash *pH, const char *pKey, void *data){ in sqlite3HashInsert()
|
| H A D | attach.c | 336 Expr *pKey /* Database key for encryption extension */ in codeAttach()
421 void sqlite3Attach(Parse *pParse, Expr *p, Expr *pDbname, Expr *pKey){ in sqlite3Attach()
|
| H A D | test_wsd.c | 34 void *pKey; member
|
| H A D | hash.h | 62 const char *pKey; /* Key associated with this element */ member
|
| H A D | btree.h | 305 const void *pKey; /* Key content for indexes. NULL for tables */ member
|
| /sqlite-3.40.0/ext/lsm1/ |
| H A D | lsm_tree.c | 611 TreeKey *pKey = pCsr->pSave; in treeCursorRestore() local
732 void *pKey, int nKey, /* Key data */ in newTreeKey()
1408 TreeKey *pKey = treeShmptr(db, pNode->aiKeyPtr[iCell]); in treeNextIsEndDelete() local
1430 TreeKey *pKey = treeShmptr(db, pNode->aiKeyPtr[iCell]); in treePrevIsStartDelete() local
1444 void *pKey, /* Pointer to key data */ in treeInsertEntry()
1576 void *pKey, /* Pointer to key data */ in lsmTreeInsert()
1855 TreeKey *pKey; in lsmTreeDelete() local
1949 static int treeCsrCompare(TreeCursor *pCsr, void *pKey, int nKey, int *pRc){ in treeCsrCompare()
1976 int lsmTreeCursorSeek(TreeCursor *pCsr, void *pKey, int nKey, int *pRes){ in lsmTreeCursorSeek()
2243 TreeKey *pKey = (TreeKey *)treeShmptrUnsafe(pCsr->pDb, in lsmTreeCursorFlags() local
[all …]
|
| H A D | lsm_sorted.c | 171 void *pKey; member
527 u8 *pKey; in pageGetKey() local
1132 void *pKey; in sortedSplitkey() local
1403 void *pKey, in assertSeekResult()
1995 void *pKey = 0; in multiCursorGetKey() local
2711 void *pKey; in multiCursorCacheKey() local
3129 void *pKey; in lsmMCursorValid() local
3282 void *pKey; in lsmMCursorKey() local
3581 void *pKey, in mergeWorkerBtreeWrite()
4172 void *pKey; in mergeRangeDeletes() local
[all …]
|
| H A D | lsm_main.c | 660 const void *pKey, int nKey, /* Key to write or delete */ in doWriteOp()
721 const void *pKey, int nKey, /* Key to write or delete */ in lsm_insert()
730 int lsm_delete(lsm_db *db, const void *pKey, int nKey){ in lsm_delete()
806 int lsm_csr_seek(lsm_cursor *pCsr, const void *pKey, int nKey, int eSeek){ in lsm_csr_seek()
|