Home
last modified time | relevance | path

Searched refs:nKey2 (Results 1 – 20 of 20) sorted by relevance

/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest1.c183 void *pKey2; int nKey2; /* Final key */ in testDbContents() local
190 testDatasourceEntry(pData, iKey2, &pKey2, &nKey2, 0, 0); in testDbContents()
193 testScanCompare(pDb2, pDb, 0, 0, 0, pKey2, nKey2, &rc); in testDbContents()
195 testScanCompare(pDb2, pDb, 0, pKey1, nKey1, pKey2, nKey2, &rc); in testDbContents()
197 testScanCompare(pDb2, pDb, 1, 0, 0, pKey2, nKey2, &rc); in testDbContents()
400 void *pKey2; int nKey2; /* Final key */ in testCompareDb() local
407 testDatasourceEntry(pData, iKey2, &pKey2, &nKey2, 0, 0); in testCompareDb()
450 void *pKey2; int nKey2; in doDataTest2() local
462 testDatasourceEntry(pData, i+2000000, &pKey2, &nKey2, 0, 0); in doDataTest2()
464 testDeleteRange(pDb, pKey1, nKey1, pKey2, nKey2, &rc); in doDataTest2()
[all …]
H A Dlsmtest_tdb.c112 void *pKey2, int nKey2, /* End of search */ in test_leveldb_scan() argument
128 leveldb_iter_seek(iter, pKey2, nKey2); in test_leveldb_scan()
136 res = memcmp(k, pKey2, MIN(n, nKey2)); in test_leveldb_scan()
137 if( res==0 ) res = n - nKey2; in test_leveldb_scan()
156 res = memcmp(k, pKey2, MIN(n, nKey2)); in test_leveldb_scan()
157 if( res==0 ) res = 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_tdb2.cc79 void *pKey2, int nKey2 in test_kc_delete_range() argument
106 res = memcmp(pKey, pKey2, MIN((size_t)nKey2, nKey)); in test_kc_delete_range()
107 if( res>0 || (res==0 && (size_t)nKey2<nKey) ){ in test_kc_delete_range()
152 void *pKey2, int nKey2, /* End of search */ in test_kc_scan() argument
167 res = pCur->jump_back((const char *)pKey2, nKey2); in test_kc_scan()
179 res = memcmp(pKey, pKey2, MIN((size_t)nKey2, nKey)); in test_kc_scan()
180 if( res>0 || (res==0 && (size_t)nKey2<nKey) ){ in test_kc_scan()
343 void *pKey2, int nKey2, /* End of search */ in test_mdb_scan() argument
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()
185 res = nKey1 - nKey2; in keyCompare()
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
421 nCmp = MIN(n, nKey2); in bt_delete_range()
423 if( res<0 || (res==0 && nKey2<=n) ) break; 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/misc/
H A Duint.c43 int nKey2, const void *pKey2 in uintCollFunc() argument
49 while( i<nKey1 && j<nKey2 ){ in uintCollFunc()
55 while( j<nKey2 && zB[j]=='0' ){ j++; } in uintCollFunc()
58 && j+k<nKey2 && isdigit(zB[j+k]) ){ in uintCollFunc()
63 }else if( j+k<nKey2 && isdigit(zB[j+k]) ){ in uintCollFunc()
78 return (nKey1 - i) - (nKey2 - j); in uintCollFunc()
H A Danycollseq.c28 int nKey2, const void *pKey2 in anyCollFunc() argument
31 n = nKey1<nKey2 ? nKey1 : nKey2; in anyCollFunc()
33 if( rc==0 ) rc = nKey1 - nKey2; in anyCollFunc()
H A Drot13.c84 int nKey2, const void *pKey2 in rot13CollFunc() argument
89 for(i=0; i<nKey1 && i<nKey2; i++){ in rot13CollFunc()
93 return nKey1 - nKey2; in rot13CollFunc()
H A Ddecimal.c416 int nKey2, const void *pKey2 in decimalCollFunc() argument
421 Decimal *pB = decimal_new(0, 0, nKey2, zB); in decimalCollFunc()
/sqlite-3.40.0/ext/lsm1/
H A Dlsm_vtab.c131 u32 nKey2; /* Length of the loop termination key */ member
384 u32 len = pCur->nKey2; in lsm1Next()
388 if( c==0 ) c = nVal - pCur->nKey2; in lsm1Next()
776 pCur->nKey2 = lsm1PutVarint64(aKey, (sqlite3_uint64)v); in lsm1Filter()
777 pCur->pKey2 = sqlite3_malloc( pCur->nKey2 ); in lsm1Filter()
779 memcpy(pCur->pKey2, aKey, pCur->nKey2); in lsm1Filter()
781 pCur->nKey2 = sqlite3_value_bytes(argv[1]); in lsm1Filter()
782 pCur->pKey2 = sqlite3_malloc( pCur->nKey2 ); in lsm1Filter()
928 int nKey, nKey2; in lsm1Update() local
946 lsm1KeyFromValue(p->keyType, argv[1], pSpace, &pKey2, &nKey2); in lsm1Update()
[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()
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()
2140 eType1, pKey1, nKey1, eType2, pKey2, nKey2 in multiCursorDoCompare()
/sqlite-3.40.0/src/
H A Dmain.c995 int nKey2, const void *pKey2 in binCollFunc() argument
999 n = nKey1<nKey2 ? nKey1 : nKey2; in binCollFunc()
1006 rc = nKey1 - nKey2; in binCollFunc()
1018 int nKey2, const void *pKey2 in rtrimCollFunc() argument
1023 while( nKey2 && pK2[nKey2-1]==' ' ) nKey2--; 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()
1053 r = nKey1-nKey2; in nocaseCollatingFunc()
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
828 pTask, pbKey2Cached, pKey1, nKey1, pKey2, nKey2 in vdbeSorterCompareText()
849 const void *pKey2, int nKey2 /* Right side of comparison */ in vdbeSorterCompareInt() argument
898 pTask, pbKey2Cached, pKey1, nKey1, pKey2, nKey2 in vdbeSorterCompareInt()
H A Dtest1.c3197 int nKey2, const void *pKey2 in alignmentCollFunc() argument
3200 n = nKey1<nKey2 ? nKey1 : nKey2; in alignmentCollFunc()
3202 if( nKey2>0 && 1==(1&(SQLITE_PTR_TO_INT(pKey2))) ) unaligned_string_counter++; in alignmentCollFunc()
3205 rc = nKey1 - nKey2; in alignmentCollFunc()