Home
last modified time | relevance | path

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

/sqlite-3.40.0/ext/lsm1/lsm-test/
H A Dlsmtest1.c182 void *pKey1; int nKey1; /* Start key */ in testDbContents() local
187 testDatasourceEntry(pData, iKey1, &pKey2, &nKey1, 0, 0); in testDbContents()
188 pKey1 = testMalloc(nKey1+1); in testDbContents()
189 memcpy(pKey1, pKey2, nKey1+1); in testDbContents()
399 void *pKey1; int nKey1; /* Start key */ in testCompareDb() local
404 testDatasourceEntry(pData, iKey1, &pKey2, &nKey1, 0, 0); in testCompareDb()
405 pKey1 = testMalloc(nKey1+1); in testCompareDb()
406 memcpy(pKey1, pKey2, nKey1+1); 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
86 res = pCur->jump((const char *)pKey1, nKey1); in test_kc_delete_range()
100 res = memcmp(pKey, pKey1, MIN((size_t)nKey1, nKey)); in test_kc_delete_range()
101 assert( res>0 || (res==0 && nKey>nKey1) ); in test_kc_delete_range()
151 void *pKey1, int nKey1, /* Start of search */ in test_kc_scan() argument
161 res = pCur->jump((const char *)pKey1, nKey1); in test_kc_scan()
185 res = memcmp(pKey, pKey1, MIN((size_t)nKey1, nKey)); in test_kc_scan()
186 if( res<0 || (res==0 && (size_t)nKey1>nKey) ){ in test_kc_scan()
342 void *pKey1, int nKey1, /* Start of search */ in test_mdb_scan() argument
H A Dlsmtest_tdb.c111 void *pKey1, int nKey1, /* Start of search */ in test_leveldb_scan() argument
122 leveldb_iter_seek(iter, pKey1, nKey1); in test_leveldb_scan()
161 res = memcmp(k, pKey1, MIN(n, nKey1)); in test_leveldb_scan()
162 if( res==0 ) res = 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
469 sqlite3_bind_blob(pDb->pDeleteRange, 1, pKey1, nKey1, SQLITE_STATIC); in sql_delete_range()
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()
185 res = nKey1 - nKey2; in keyCompare()
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()
411 nCmp = MIN(n, nKey1); in bt_delete_range()
413 assert( res<0 || (res==0 && nKey1<=n) ); in bt_delete_range()
414 if( res==0 && nKey1==n ){ 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/misc/
H A Duint.c42 int nKey1, const void *pKey1, in uintCollFunc() argument
49 while( i<nKey1 && j<nKey2 ){ in uintCollFunc()
54 while( i<nKey1 && zA[i]=='0' ){ i++; } in uintCollFunc()
57 while( i+k<nKey1 && isdigit(zA[i+k]) in uintCollFunc()
61 if( i+k<nKey1 && isdigit(zA[i+k]) ){ in uintCollFunc()
78 return (nKey1 - i) - (nKey2 - j); in uintCollFunc()
H A Danycollseq.c27 int nKey1, const void *pKey1, in anyCollFunc() argument
31 n = nKey1<nKey2 ? nKey1 : nKey2; in anyCollFunc()
33 if( rc==0 ) rc = nKey1 - nKey2; in anyCollFunc()
H A Drot13.c83 int nKey1, const void *pKey1, in rot13CollFunc() argument
89 for(i=0; i<nKey1 && i<nKey2; i++){ in rot13CollFunc()
93 return nKey1 - nKey2; in rot13CollFunc()
H A Ddecimal.c415 int nKey1, const void *pKey1, in decimalCollFunc() argument
420 Decimal *pA = decimal_new(0, 0, nKey1, zA); in decimalCollFunc()
/sqlite-3.40.0/src/
H A Dvdbeaux.c4118 int nKey1, const void *pKey1, /* Left key */ in vdbeRecordCompareDebug() argument
4166 if( d1+(u64)serial_type1+2>(u64)nKey1 in vdbeRecordCompareDebug()
4530 int nKey1, const void *pKey1, /* Left key */ in sqlite3VdbeRecordCompareWithSkip() argument
4567 if( d1>(unsigned)nKey1 ){ in sqlite3VdbeRecordCompareWithSkip()
4642 if( (d1+mem1.n) > (unsigned)nKey1 in sqlite3VdbeRecordCompareWithSkip()
4672 testcase( (d1+nStr)==(unsigned)nKey1 ); in sqlite3VdbeRecordCompareWithSkip()
4674 if( (d1+nStr) > (unsigned)nKey1 ){ in sqlite3VdbeRecordCompareWithSkip()
4716 if( d1>(unsigned)nKey1 ) break; in sqlite3VdbeRecordCompareWithSkip()
4757 int nKey1, const void *pKey1, /* Left key */ in vdbeRecordCompareInt() argument
4852 int nKey1, const void *pKey1, /* Left key */ in vdbeRecordCompareString() argument
[all …]
H A Dmain.c994 int nKey1, const void *pKey1, in binCollFunc() argument
999 n = nKey1<nKey2 ? nKey1 : nKey2; in binCollFunc()
1006 rc = nKey1 - nKey2; in binCollFunc()
1017 int nKey1, const void *pKey1, in rtrimCollFunc() argument
1022 while( nKey1 && pK1[nKey1-1]==' ' ) nKey1--; 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()
1053 r = nKey1-nKey2; in nocaseCollatingFunc()
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
828 pTask, pbKey2Cached, pKey1, nKey1, pKey2, nKey2 in vdbeSorterCompareText()
848 const void *pKey1, int nKey1, /* Left side of comparison */ in vdbeSorterCompareInt() argument
898 pTask, pbKey2Cached, pKey1, nKey1, pKey2, nKey2 in vdbeSorterCompareInt()
H A Dtest1.c3196 int nKey1, const void *pKey1, in alignmentCollFunc() argument
3200 n = nKey1<nKey2 ? nKey1 : nKey2; in alignmentCollFunc()
3201 if( nKey1>0 && 1==(1&(SQLITE_PTR_TO_INT(pKey1))) ) unaligned_string_counter++; in alignmentCollFunc()
3205 rc = nKey1 - nKey2; 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()
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()
2140 eType1, pKey1, nKey1, eType2, pKey2, nKey2 in multiCursorDoCompare()