Home
last modified time | relevance | path

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

/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest1.c183 void *pKey2; int nKey2; /* Final key */ in testDbContents() local
187 testDatasourceEntry(pData, iKey1, &pKey2, &nKey1, 0, 0); in testDbContents()
189 memcpy(pKey1, pKey2, nKey1+1); in testDbContents()
190 testDatasourceEntry(pData, iKey2, &pKey2, &nKey2, 0, 0); in testDbContents()
400 void *pKey2; int nKey2; /* Final key */ in testCompareDb() local
404 testDatasourceEntry(pData, iKey1, &pKey2, &nKey1, 0, 0); in testCompareDb()
406 memcpy(pKey1, pKey2, nKey1+1); in testCompareDb()
407 testDatasourceEntry(pData, iKey2, &pKey2, &nKey2, 0, 0); in testCompareDb()
450 void *pKey2; int nKey2; in doDataTest2() local
464 testDeleteRange(pDb, pKey1, nKey1, pKey2, nKey2, &rc); in doDataTest2()
[all …]
H A Dlsmtest_tdb2.cc79 void *pKey2, int nKey2 in test_kc_delete_range() argument
105 if( pKey2 ){ in test_kc_delete_range()
106 res = memcmp(pKey, pKey2, MIN((size_t)nKey2, nKey)); in test_kc_delete_range()
152 void *pKey2, int nKey2, /* End of search */ in test_kc_scan() argument
166 if( pKey2 ){ in test_kc_scan()
167 res = pCur->jump_back((const char *)pKey2, nKey2); in test_kc_scan()
178 if( bReverse==0 && pKey2 ){ in test_kc_scan()
179 res = memcmp(pKey, pKey2, MIN((size_t)nKey2, nKey)); in test_kc_scan()
343 void *pKey2, int nKey2, /* End of search */ in test_mdb_scan() argument
H A Dlsmtest_tdb.c112 void *pKey2, int nKey2, /* End of search */ in test_leveldb_scan() argument
127 if( pKey2 ){ in test_leveldb_scan()
128 leveldb_iter_seek(iter, pKey2, nKey2); in test_leveldb_scan()
136 res = memcmp(k, pKey2, MIN(n, nKey2)); in test_leveldb_scan()
155 if( bReverse==0 && pKey2 ){ in test_leveldb_scan()
156 res = memcmp(k, pKey2, MIN(n, nKey2)); in test_leveldb_scan()
255 void *pKey2, int nKey2 in kc_delete_range() argument
466 void *pKey2, int nKey2 in sql_delete_range() argument
804 TestDb *pDb, void *pKey1, int nKey1, void *pKey2, int nKey2 in tdb_delete_range() argument
818 void *pKey2, int nKey2, /* End of search */ in tdb_scan() argument
[all …]
H A Dlsmtest_main.c79 void *pKey2, int nKey2, in testDeleteRange() argument
84 *pRc = rc = tdb_delete_range(pDb, pKey1, nKey1, pKey2, nKey2); in testDeleteRange()
174 void *pKey2; int nKey2; 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()
250 if( p->pKey2 && ( in scanCompareCb()
251 (memcmp(p->pKey2, pKey, MIN(p->nKey2, nKey))<0) in scanCompareCb()
252 || (memcmp(p->pKey2, pKey, MIN(p->nKey2, nKey))==0 && p->nKey2<nKey) in scanCompareCb()
267 void *pKey2, int nKey2, in testScanCompare() argument
282 res1.nKey2 = nKey2; res1.pKey2 = pKey2; in testScanCompare()
[all …]
H A Dlsmtest_tdb.h56 int tdb_delete_range(TestDb *, void *pKey1, int nKey1, void *pKey2, int nKey2);
123 void *pKey2, int nKey2, /* End of search */
H A Dlsmtest_tdb4.c386 void *pKey2, int nKey2 in bt_delete_range() argument
422 res = memcmp(pKey2, pK, nCmp); in bt_delete_range()
H A Dlsmtest_tdb3.c601 void *pKey2, int nKey2 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/lsm1/
H A Dlsm_vtab.c354 sqlite3_free(pCur->pKey2); in lsm1Close()
378 if( pCur->pKey2 && pCur->atEof==0 ){ in lsm1Next()
387 c = memcmp(pVal, pCur->pKey2, len); in lsm1Next()
755 sqlite3_free(pCur->pKey2); in lsm1Filter()
756 pCur->pKey2 = 0; in lsm1Filter()
777 pCur->pKey2 = sqlite3_malloc( pCur->nKey2 ); in lsm1Filter()
778 if( pCur->pKey2==0 ) return SQLITE_NOMEM; in lsm1Filter()
779 memcpy(pCur->pKey2, aKey, pCur->nKey2); in lsm1Filter()
782 pCur->pKey2 = sqlite3_malloc( pCur->nKey2 ); in lsm1Filter()
783 if( pCur->pKey2==0 ) return SQLITE_NOMEM; in lsm1Filter()
[all …]
H A Dlsm_main.c740 const void *pKey2, int nKey2 /* Upper 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.c1799 void *pKey2, int nKey2 /* End 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()
1839 if( treeKeycmp(pDel, nDel, pKey2, nKey2)<0 ) bDone = 0; in lsmTreeDelete()
1898 rc = treeInsertEntry(db, LSM_END_DELETE, pKey2, nKey2, 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.c2116 void *pKey2; int nKey2; int eType2; in multiCursorDoCompare() local
2129 multiCursorGetKey(pCsr, i2, &eType2, &pKey2, &nKey2); in multiCursorDoCompare()
2133 }else if( pKey2==0 ){ in multiCursorDoCompare()
2140 eType1, pKey1, nKey1, eType2, pKey2, nKey2 in multiCursorDoCompare()
/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.c28 int nKey2, const void *pKey2 in anyCollFunc() argument
32 rc = memcmp(pKey1, pKey2, n); in anyCollFunc()
H A Duint.c43 int nKey2, const void *pKey2 in uintCollFunc() argument
46 const unsigned char *zB = (const unsigned char*)pKey2; in uintCollFunc()
H A Drot13.c84 int nKey2, const void *pKey2 in rot13CollFunc() argument
87 const char *zB = (const char*)pKey2; in rot13CollFunc()
H A Ddecimal.c416 int nKey2, const void *pKey2 in decimalCollFunc() argument
419 const unsigned char *zB = (const unsigned char*)pKey2; in decimalCollFunc()
/sqlite-3.40.0/src/
H A Dvdbesort.c761 const void *pKey2, int nKey2 /* Right side of comparison */ in vdbeSorterCompareTail() argument
765 sqlite3VdbeRecordUnpack(pTask->pSorter->pKeyInfo, nKey2, pKey2, r2); in vdbeSorterCompareTail()
788 const void *pKey2, int nKey2 /* Right side of comparison */ in vdbeSorterCompare() argument
792 sqlite3VdbeRecordUnpack(pTask->pSorter->pKeyInfo, nKey2, pKey2, r2); in vdbeSorterCompare()
807 const void *pKey2, int nKey2 /* Right side of comparison */ in vdbeSorterCompareText() argument
810 const u8 * const p2 = (const u8 * const)pKey2; in vdbeSorterCompareText()
828 pTask, pbKey2Cached, pKey1, nKey1, pKey2, nKey2 in vdbeSorterCompareText()
849 const void *pKey2, int nKey2 /* Right side of comparison */ in vdbeSorterCompareInt() argument
852 const u8 * const p2 = (const u8 * const)pKey2; in vdbeSorterCompareInt()
898 pTask, pbKey2Cached, pKey1, nKey1, pKey2, nKey2 in vdbeSorterCompareInt()
H A Dmain.c995 int nKey2, const void *pKey2 in binCollFunc() argument
1003 assert( pKey1 && pKey2 ); in binCollFunc()
1004 rc = memcmp(pKey1, pKey2, n); in binCollFunc()
1018 int nKey2, const void *pKey2 in rtrimCollFunc() argument
1021 const u8 *pK2 = (const u8*)pKey2; in rtrimCollFunc()
1024 return binCollFunc(pUser, nKey1, pKey1, nKey2, pKey2); in rtrimCollFunc()
1047 int nKey2, const void *pKey2 in nocaseCollatingFunc() argument
1050 (const char *)pKey1, (const char *)pKey2, (nKey1<nKey2)?nKey1:nKey2); in nocaseCollatingFunc()
H A Dtest1.c3197 int nKey2, const void *pKey2 in alignmentCollFunc() argument
3202 if( nKey2>0 && 1==(1&(SQLITE_PTR_TO_INT(pKey2))) ) unaligned_string_counter++; in alignmentCollFunc()
3203 rc = memcmp(pKey1, pKey2, n); in alignmentCollFunc()