Home
last modified time | relevance | path

Searched refs:pKey1 (Results 1 – 24 of 24) sorted by relevance

/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest1.c182 void *pKey1; int nKey1; /* Start key */ in testDbContents() local
188 pKey1 = testMalloc(nKey1+1); in testDbContents()
189 memcpy(pKey1, pKey2, nKey1+1); in testDbContents()
200 testFree(pKey1); in testDbContents()
399 void *pKey1; int nKey1; /* Start key */ in testCompareDb() local
405 pKey1 = testMalloc(nKey1+1); in testCompareDb()
406 memcpy(pKey1, pKey2, nKey1+1); in testCompareDb()
415 testFree(pKey1); in testCompareDb()
449 void *pKey1; int nKey1; in doDataTest2() local
461 pKey1 = testMallocCopy(pKey1, nKey1); in doDataTest2()
[all …]
H A Dlsmtest_tdb2.cc78 void *pKey1, int nKey1, in test_kc_delete_range() argument
85 if( pKey1 ){ in test_kc_delete_range()
86 res = pCur->jump((const char *)pKey1, nKey1); in test_kc_delete_range()
99 if( pKey1 ){ in test_kc_delete_range()
100 res = memcmp(pKey, pKey1, MIN((size_t)nKey1, nKey)); in test_kc_delete_range()
151 void *pKey1, int nKey1, /* Start of search */ in test_kc_scan() argument
160 if( pKey1 ){ in test_kc_scan()
161 res = pCur->jump((const char *)pKey1, nKey1); in test_kc_scan()
184 }else if( bReverse!=0 && pKey1 ){ in test_kc_scan()
185 res = memcmp(pKey, pKey1, MIN((size_t)nKey1, nKey)); in test_kc_scan()
[all …]
H A Dlsmtest_tdb.c111 void *pKey1, int nKey1, /* Start of search */ in test_leveldb_scan() argument
121 if( pKey1 ){ in test_leveldb_scan()
122 leveldb_iter_seek(iter, pKey1, nKey1); in test_leveldb_scan()
160 if( bReverse!=0 && pKey1 ){ in test_leveldb_scan()
161 res = memcmp(k, pKey1, MIN(n, nKey1)); in test_leveldb_scan()
254 void *pKey1, int nKey1, in kc_delete_range() argument
257 return test_kc_delete_range(pTestDb, pKey1, nKey1, pKey2, nKey2); in kc_delete_range()
465 void *pKey1, int nKey1, in sql_delete_range() argument
804 TestDb *pDb, void *pKey1, int nKey1, void *pKey2, int nKey2 in tdb_delete_range() argument
817 void *pKey1, int nKey1, /* Start of search */ in tdb_scan() argument
[all …]
H A Dlsmtest_main.c78 void *pKey1, int nKey1, in testDeleteRange() argument
84 *pRc = rc = tdb_delete_range(pDb, pKey1, nKey1, pKey2, nKey2); in testDeleteRange()
173 void *pKey1; int nKey1; member
181 static int keyCompare(void *pKey1, int nKey1, void *pKey2, int nKey2){ in keyCompare() argument
183 res = memcmp(pKey1, pKey2, MIN(nKey1, nKey2)); in keyCompare()
244 if( p->pKey1 && ( in scanCompareCb()
245 (memcmp(p->pKey1, pKey, MIN(p->nKey1, nKey))>0) in scanCompareCb()
246 || (memcmp(p->pKey1, pKey, MIN(p->nKey1, nKey))==0 && p->nKey1>nKey) in scanCompareCb()
266 void *pKey1, int nKey1, in testScanCompare() argument
281 res1.nKey1 = nKey1; res1.pKey1 = pKey1; in testScanCompare()
[all …]
H A Dlsmtest_tdb.h56 int tdb_delete_range(TestDb *, void *pKey1, int nKey1, void *pKey2, int nKey2);
122 void *pKey1, int nKey1, /* Start of search */
H A Dlsmtest_tdb4.c385 void *pKey1, int nKey1, in bt_delete_range() argument
404 rc = sqlite4BtCsrSeek(pCsr, pKey1, nKey1, BT_SEEK_GE); in bt_delete_range()
412 res = memcmp(pKey1, pK, nCmp); in bt_delete_range()
H A Dlsmtest_tdb3.c600 void *pKey1, int nKey1, in test_lsm_delete_range() argument
604 return lsm_delete_range(pDb->db, pKey1, nKey1, pKey2, nKey2); in test_lsm_delete_range()
/sqlite-3.40.0/ext/fts1/
H A Dft_hash.c89 static int intCompare(const void *pKey1, int n1, const void *pKey2, int n2){
102 static int ptrCompare(const void *pKey1, int n1, const void *pKey2, int n2){
103 if( pKey1==pKey2 ) return 0;
104 if( pKey1<pKey2 ) return -1;
122 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in strCompare() argument
124 return strncmp((const char*)pKey1,(const char*)pKey2,n1); in strCompare()
138 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in binCompare() argument
140 return memcmp(pKey1,pKey2,n1); in binCompare()
H A Dfts1_hash.c102 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in strCompare() argument
104 return strncmp((const char*)pKey1,(const char*)pKey2,n1); in strCompare()
118 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in binCompare() argument
120 return memcmp(pKey1,pKey2,n1); in binCompare()
/sqlite-3.40.0/ext/fts3/
H A Dfts3_hash.c107 static int fts3StrCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in fts3StrCompare() argument
109 return strncmp((const char*)pKey1,(const char*)pKey2,n1); in fts3StrCompare()
123 static int fts3BinCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in fts3BinCompare() argument
125 return memcmp(pKey1,pKey2,n1); in fts3BinCompare()
/sqlite-3.40.0/ext/fts2/
H A Dfts2_hash.c109 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in strCompare() argument
111 return strncmp((const char*)pKey1,(const char*)pKey2,n1); in strCompare()
125 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){ in binCompare() argument
127 return memcmp(pKey1,pKey2,n1); in binCompare()
/sqlite-3.40.0/ext/misc/
H A Danycollseq.c27 int nKey1, const void *pKey1, in anyCollFunc() argument
32 rc = memcmp(pKey1, pKey2, n); in anyCollFunc()
H A Duint.c42 int nKey1, const void *pKey1, in uintCollFunc() argument
45 const unsigned char *zA = (const unsigned char*)pKey1; in uintCollFunc()
H A Drot13.c83 int nKey1, const void *pKey1, in rot13CollFunc() argument
86 const char *zA = (const char*)pKey1; in rot13CollFunc()
H A Ddecimal.c415 int nKey1, const void *pKey1, in decimalCollFunc() argument
418 const unsigned char *zA = (const unsigned char*)pKey1; in decimalCollFunc()
/sqlite-3.40.0/src/
H A Dvdbeaux.c4118 int nKey1, const void *pKey1, /* Left key */ in vdbeRecordCompareDebug() argument
4127 const unsigned char *aKey1 = (const unsigned char *)pKey1; in vdbeRecordCompareDebug()
4530 int nKey1, const void *pKey1, /* Left key */ in sqlite3VdbeRecordCompareWithSkip() argument
4740 int nKey1, const void *pKey1, /* Left key */ in sqlite3VdbeRecordCompare() argument
4757 int nKey1, const void *pKey1, /* Left key */ in vdbeRecordCompareInt() argument
4760 const u8 *aKey = &((const u8*)pKey1)[*(const u8*)pKey1 & 0x3F]; in vdbeRecordCompareInt()
4761 int serial_type = ((const u8*)pKey1)[1]; in vdbeRecordCompareInt()
4769 assert( (*(u8*)pKey1)<=0x3F || CORRUPT_DB ); in vdbeRecordCompareInt()
4852 int nKey1, const void *pKey1, /* Left key */ in vdbeRecordCompareString() argument
4855 const u8 *aKey1 = (const u8*)pKey1; in vdbeRecordCompareString()
[all …]
H A Dvdbesort.c760 const void *pKey1, int nKey1, /* Left side of comparison */ in vdbeSorterCompareTail() argument
768 return sqlite3VdbeRecordCompareWithSkip(nKey1, pKey1, r2, 1); in vdbeSorterCompareTail()
787 const void *pKey1, int nKey1, /* Left side of comparison */ in vdbeSorterCompare() argument
795 return sqlite3VdbeRecordCompare(nKey1, pKey1, r2); in vdbeSorterCompare()
806 const void *pKey1, int nKey1, /* Left side of comparison */ in vdbeSorterCompareText() argument
809 const u8 * const p1 = (const u8 * const)pKey1; in vdbeSorterCompareText()
828 pTask, pbKey2Cached, pKey1, nKey1, pKey2, nKey2 in vdbeSorterCompareText()
848 const void *pKey1, int nKey1, /* Left side of comparison */ in vdbeSorterCompareInt() argument
851 const u8 * const p1 = (const u8 * const)pKey1; in vdbeSorterCompareInt()
898 pTask, pbKey2Cached, pKey1, nKey1, pKey2, nKey2 in vdbeSorterCompareInt()
H A Dmain.c994 int nKey1, const void *pKey1, in binCollFunc() argument
1003 assert( pKey1 && pKey2 ); in binCollFunc()
1004 rc = memcmp(pKey1, pKey2, n); in binCollFunc()
1017 int nKey1, const void *pKey1, in rtrimCollFunc() argument
1020 const u8 *pK1 = (const u8*)pKey1; in rtrimCollFunc()
1024 return binCollFunc(pUser, nKey1, pKey1, nKey2, pKey2); in rtrimCollFunc()
1046 int nKey1, const void *pKey1, in nocaseCollatingFunc() argument
1050 (const char *)pKey1, (const char *)pKey2, (nKey1<nKey2)?nKey1:nKey2); in nocaseCollatingFunc()
H A Dtest1.c3196 int nKey1, const void *pKey1, in alignmentCollFunc() argument
3201 if( nKey1>0 && 1==(1&(SQLITE_PTR_TO_INT(pKey1))) ) unaligned_string_counter++; in alignmentCollFunc()
3203 rc = memcmp(pKey1, pKey2, n); in alignmentCollFunc()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_main.c739 const void *pKey1, int nKey1, /* Lower bound of range to delete */ in lsm_delete_range() argument
743 if( db->xCmp((void *)pKey1, nKey1, (void *)pKey2, nKey2)<0 ){ in lsm_delete_range()
744 rc = doWriteOp(db, 1, pKey1, nKey1, pKey2, nKey2); in lsm_delete_range()
H A Dlsm.h530 const void *pKey1, int nKey1, const void *pKey2, int nKey2
H A Dlsm_tree.c1798 void *pKey1, int nKey1, /* Start of range */ in lsmTreeDelete() argument
1807 assert( treeKeycmp(pKey1, nKey1, pKey2, nKey2)<0 ); in lsmTreeDelete()
1814 printf("%d delete %s .. %s\n", nCall, (char *)pKey1, (char *)pKey2); in lsmTreeDelete()
1830 lsmTreeCursorSeek(&csr, pKey1, nKey1, &res); in lsmTreeDelete()
1892 rc = treeInsertEntry(db, LSM_START_DELETE, pKey1, nKey1, 0, -1); in lsmTreeDelete()
H A DlsmInt.h641 int lsmTreeDelete(lsm_db *db, void *pKey1, int nKey1, void *pKey2, int nKey2);
H A Dlsm_sorted.c2115 void *pKey1; int nKey1; int eType1; in multiCursorDoCompare() local
2128 multiCursorGetKey(pCsr, i1, &eType1, &pKey1, &nKey1); in multiCursorDoCompare()
2131 if( pKey1==0 ){ in multiCursorDoCompare()
2140 eType1, pKey1, nKey1, eType2, pKey2, nKey2 in multiCursorDoCompare()