Searched refs:nKey (Results 1 - 25 of 30) sorted by relevance

12

/external/chromium_org/third_party/sqlite/src/src/
H A Dhash.h62 const char *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
69 void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
70 void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
89 /* #define sqliteHashKeysize(E) ((E)->nKey) // NOT USED */
H A Dhash.c55 static unsigned int strHash(const char *z, int nKey){ argument
57 assert( nKey>=0 );
58 while( nKey > 0 ){
60 nKey--;
128 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size;
142 int nKey, /* Bytes in key (not counting zero terminator) */
157 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){
200 ** that matches pKey,nKey
139 findElementGivenHash( const Hash *pH, const char *pKey, int nKey, unsigned int h ) argument
203 sqlite3HashFind(const Hash *pH, const char *pKey, int nKey) argument
233 sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data) argument
[all...]
H A Dattach.c159 int nKey; local
171 nKey = sqlite3_value_bytes(argv[2]);
173 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey);
178 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey);
179 if( nKey>0 || sqlite3BtreeGetReserve(db->aDb[0].pBt)>0 ){
180 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey);
H A DbtreeInt.h449 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */ member in struct:CellInfo
492 i64 nKey; /* Size of pKey, or last integer key */ member in struct:BtCursor
497 u8 validNKey; /* True if info.nKey is valid */
522 ** in variables BtCursor.pKey and BtCursor.nKey. When a cursor is in
H A Dvacuum.c172 int nKey; local
174 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey);
175 if( nKey ) db->nextPagesize = 0;
H A Dbtree.c477 if( p->isIncrblobHandle && (isClearTable || p->info.nKey==iRow) ){
562 ** Save the current cursor position in the variables BtCursor.nKey
575 rc = sqlite3BtreeKeySize(pCur, &pCur->nKey);
579 ** stores the integer key in pCur->nKey. In this case this value is
581 ** table, then malloc space for and store the pCur->nKey bytes of key
585 void *pKey = sqlite3Malloc( (int)pCur->nKey );
587 rc = sqlite3BtreeKey(pCur, 0, (int)pCur->nKey, pKey);
652 i64 nKey, /* Integer key for tables. Size of pKey for indices */
661 assert( nKey==(i64)(int)nKey );
649 btreeMoveto( BtCursor *pCur, const void *pKey, i64 nKey, int bias, int *pRes ) argument
3830 u32 nKey; local
4028 u32 nKey; local
5228 fillInCell( MemPage *pPage, unsigned char *pCell, const void *pKey, i64 nKey, const void *pData,int nData, int nZero, int *pnSize ) argument
6640 sqlite3BtreeInsert( BtCursor *pCur, const void *pKey, i64 nKey, const void *pData, int nData, int nZero, int appendBias, int seekResult ) argument
[all...]
H A Dbtree.h158 int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
H A Dtest_malloc.c752 int nKey = sizeof(int)*MALLOC_LOG_KEYINTS; local
754 memset(aKey, 0, nKey);
755 if( (sizeof(void*)*nFrame)<nKey ){
756 nKey = nFrame*sizeof(void*);
758 memcpy(aKey, aFrame, nKey);
H A Dsqlite.h.in4041 const void *pKey, int nKey /* The key */
4054 const void *pKey, int nKey /* The new key */
/external/chromium_org/third_party/sqlite/src/ext/fts1/
H A Dft_hash.h55 void *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
61 ** HASH_INT nKey is used as the key and pKey is ignored.
63 ** HASH_POINTER pKey is used as the key and nKey is ignored.
65 ** HASH_STRING pKey points to a string that is nKey bytes long
69 ** HASH_BINARY pKey points to binary data nKey bytes long.
84 void *HashInsert(Hash*, const void *pKey, int nKey, void *pData);
85 void *HashFind(const Hash*, const void *pKey, int nKey);
104 #define HashKeysize(E) ((E)->nKey)
H A Dfts1_hash.h55 void *pKey; int nKey; /* Key associated with this element */ member in struct:fts1HashElem
61 ** FTS1_HASH_STRING pKey points to a string that is nKey bytes long
65 ** FTS1_HASH_BINARY pKey points to binary data nKey bytes long.
77 void *sqlite3Fts1HashInsert(fts1Hash*, const void *pKey, int nKey, void *pData);
78 void *sqlite3Fts1HashFind(const fts1Hash*, const void *pKey, int nKey);
105 #define fts1HashKeysize(E) ((E)->nKey)
H A Dft_hash.c86 static int intHash(const void *pKey, int nKey){
87 return nKey ^ (nKey<<8) ^ (nKey>>8);
98 static int ptrHash(const void *pKey, int nKey){
112 static int strHash(const void *pKey, int nKey){ argument
115 if( nKey<=0 ) nKey = (int) strlen(z);
116 while( nKey > 0 ){
118 nKey
130 binHash(const void *pKey, int nKey) argument
254 findElementGivenHash( const Hash *pH, const void *pKey, int nKey, int h ) argument
320 HashFind(const Hash *pH, const void *pKey, int nKey) argument
349 HashInsert(Hash *pH, const void *pKey, int nKey, void *data) argument
[all...]
H A Dfts1_hash.c92 static int strHash(const void *pKey, int nKey){ argument
95 if( nKey<=0 ) nKey = (int) strlen(z);
96 while( nKey > 0 ){
98 nKey--;
110 static int binHash(const void *pKey, int nKey){ argument
113 while( nKey-- > 0 ){
202 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
215 int nKey,
228 if( (*xCompare)(elem->pKey,elem->nKey,pKe
212 findElementGivenHash( const fts1Hash *pH, const void *pKey, int nKey, int h ) argument
278 sqlite3Fts1HashFind(const fts1Hash *pH, const void *pKey, int nKey) argument
307 sqlite3Fts1HashInsert( fts1Hash *pH, const void *pKey, int nKey, void *data ) argument
[all...]
/external/chromium_org/third_party/sqlite/src/ext/fts2/
H A Dfts2_hash.h53 void *pKey; int nKey; /* Key associated with this element */ member in struct:fts2HashElem
59 ** FTS2_HASH_STRING pKey points to a string that is nKey bytes long
63 ** FTS2_HASH_BINARY pKey points to binary data nKey bytes long.
75 void *sqlite3Fts2HashInsert(fts2Hash*, const void *pKey, int nKey, void *pData);
76 void *sqlite3Fts2HashFind(const fts2Hash*, const void *pKey, int nKey);
103 #define fts2HashKeysize(E) ((E)->nKey)
H A Dfts2_hash.c97 static int strHash(const void *pKey, int nKey){ argument
100 if( nKey<=0 ) nKey = (int) strlen(z);
101 while( nKey > 0 ){
103 nKey--;
115 static int binHash(const void *pKey, int nKey){ argument
118 while( nKey-- > 0 ){
207 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
220 int nKey,
233 if( (*xCompare)(elem->pKey,elem->nKey,pKe
217 findElementGivenHash( const fts2Hash *pH, const void *pKey, int nKey, int h ) argument
283 sqlite3Fts2HashFind(const fts2Hash *pH, const void *pKey, int nKey) argument
312 sqlite3Fts2HashInsert( fts2Hash *pH, const void *pKey, int nKey, void *data ) argument
[all...]
/external/chromium_org/third_party/sqlite/src/ext/fts3/
H A Dfts3_hash.h53 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem
59 ** FTS3_HASH_STRING pKey points to a string that is nKey bytes long
63 ** FTS3_HASH_BINARY pKey points to binary data nKey bytes long.
75 void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
76 void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
105 #define fts3HashKeysize(E) ((E)->nKey)
H A Dfts3_hash.c97 static int fts3StrHash(const void *pKey, int nKey){ argument
100 if( nKey<=0 ) nKey = (int) strlen(z);
101 while( nKey > 0 ){
103 nKey--;
115 static int fts3BinHash(const void *pKey, int nKey){ argument
118 while( nKey-- > 0 ){
209 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
223 int nKey,
236 if( (*xCompare)(elem->pKey,elem->nKey,pKe
220 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument
303 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument
325 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument
[all...]
H A Dfts3_expr.c365 int nKey = pKey->n; local
370 assert( nKey==4 );
373 for(nKey=5; zInput[nKey]>='0' && zInput[nKey]<='9'; nKey++){
374 nNear = nNear * 10 + (zInput[nKey] - '0');
383 cNext = zInput[nKey];
394 *pnConsumed = (int)((zInput - z) + nKey);
H A Dfts3.c873 int nKey; local
886 else if( isFts4 && fts3IsSpecialColumn(z, &nKey, &zVal) ){
891 if( nKey==9 && 0==sqlite3_strnicmp(z, "matchinfo", 9) ){
898 }else if( nKey==8 && 0==sqlite3_strnicmp(z, "compress", 8) ){
901 }else if( nKey==10 && 0==sqlite3_strnicmp(z, "uncompress", 10) ){
/external/chromium_org/third_party/sqlite/amalgamation/
H A Dsqlite3.h4046 const void *pKey, int nKey /* The key */
4059 const void *pKey, int nKey /* The new key */
H A Dsqlite3.c4589 const void *pKey, int nKey /* The key */
4602 const void *pKey, int nKey /* The new key */
7100 const char *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
7107 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
7108 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
7127 /* #define sqliteHashKeysize(E) ((E)->nKey) // NOT USED */
7799 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
21441 static unsigned int strHash(const char *z, int nKey){ argument
21443 assert( nKey>=0 );
21444 while( nKey >
21525 findElementGivenHash( const Hash *pH, const char *pKey, int nKey, unsigned int h ) argument
21589 sqlite3HashFind(const Hash *pH, const char *pKey, int nKey) argument
21619 sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data) argument
46830 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */ member in struct:CellInfo
46873 i64 nKey; /* Size of pKey, or last integer key */ member in struct:BtCursor
47947 btreeMoveto( BtCursor *pCur, const void *pKey, i64 nKey, int bias, int *pRes ) argument
51128 u32 nKey; local
51326 u32 nKey; local
52526 fillInCell( MemPage *pPage, unsigned char *pCell, const void *pKey, i64 nKey, const void *pData,int nData, int nZero, int *pnSize ) argument
53938 sqlite3BtreeInsert( BtCursor *pCur, const void *pKey, i64 nKey, const void *pData, int nData, int nZero, int appendBias, int seekResult ) argument
60108 sqlite3VdbeRecordUnpack( KeyInfo *pKeyInfo, int nKey, const void *pKey, char *pSpace, int szSpace ) argument
62912 int nKey; member in struct:vdbeExecUnion::OP_IdxInsert_stack_vars
76381 int nKey; local
96744 int nKey; local
113121 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem
114113 int nKey; local
117780 int nKey = pKey->n; local
118446 fts3StrHash(const void *pKey, int nKey) argument
118464 fts3BinHash(const void *pKey, int nKey) argument
118569 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument
118652 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument
118674 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument
121347 int nKey = fts3HashKeysize(pE); local
[all...]
/external/sqlite/dist/orig/
H A Dsqlite3.h4366 const void *pKey, int nKey /* The key */
4379 const void *pKey, int nKey /* The new key */
H A Dsqlite3.c4916 const void *pKey, int nKey /* The key */
4929 const void *pKey, int nKey /* The new key */
7616 const char *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
7623 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
7624 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
7643 /* #define sqliteHashKeysize(E) ((E)->nKey) // NOT USED */
8332 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
22287 static unsigned int strHash(const char *z, int nKey){ argument
22289 assert( nKey>=0 );
22290 while( nKey >
22371 findElementGivenHash( const Hash *pH, const char *pKey, int nKey, unsigned int h ) argument
22435 sqlite3HashFind(const Hash *pH, const char *pKey, int nKey) argument
22465 sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data) argument
48894 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */ member in struct:CellInfo
48940 i64 nKey; /* Size of pKey, or last integer key */ member in struct:BtCursor
50011 btreeMoveto( BtCursor *pCur, const void *pKey, i64 nKey, int bias, int *pRes ) argument
53217 u32 nKey; local
53449 u32 nKey; local
54677 fillInCell( MemPage *pPage, unsigned char *pCell, const void *pKey, i64 nKey, const void *pData,int nData, int nZero, int *pnSize ) argument
56121 sqlite3BtreeInsert( BtCursor *pCur, const void *pKey, i64 nKey, const void *pData, int nData, int nZero, int appendBias, int seekResult ) argument
62400 sqlite3VdbeRecordUnpack( KeyInfo *pKeyInfo, int nKey, const void *pKey, UnpackedRecord *p ) argument
65267 int nKey; member in struct:vdbeExecUnion::OP_IdxInsert_stack_vars
71761 int nKey; /* Number of bytes in key */ member in struct:VdbeSorterIter
72489 void *pKey; int nKey; /* Sorter key to copy into pOut */ local
72518 void *pKey; int nKey; /* Sorter key to compare pVal with */ local
80559 int nKey; local
101286 int nKey; local
116373 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem
117735 int nKey; local
122721 int nKey = pKey->n; local
123397 fts3StrHash(const void *pKey, int nKey) argument
123415 fts3BinHash(const void *pKey, int nKey) argument
123520 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument
123603 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument
123625 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument
126628 int nKey = fts3HashKeysize(pE); local
[all...]
/external/sqlite/dist/
H A Dsqlite3.h4366 const void *pKey, int nKey /* The key */
4379 const void *pKey, int nKey /* The new key */
H A Dsqlite3.c4916 const void *pKey, int nKey /* The key */
4929 const void *pKey, int nKey /* The new key */
7616 const char *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
7623 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
7624 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
7643 /* #define sqliteHashKeysize(E) ((E)->nKey) // NOT USED */
8332 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
22287 static unsigned int strHash(const char *z, int nKey){ argument
22289 assert( nKey>=0 );
22290 while( nKey >
22371 findElementGivenHash( const Hash *pH, const char *pKey, int nKey, unsigned int h ) argument
22435 sqlite3HashFind(const Hash *pH, const char *pKey, int nKey) argument
22465 sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data) argument
48922 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */ member in struct:CellInfo
48968 i64 nKey; /* Size of pKey, or last integer key */ member in struct:BtCursor
50039 btreeMoveto( BtCursor *pCur, const void *pKey, i64 nKey, int bias, int *pRes ) argument
53245 u32 nKey; local
53477 u32 nKey; local
54705 fillInCell( MemPage *pPage, unsigned char *pCell, const void *pKey, i64 nKey, const void *pData,int nData, int nZero, int *pnSize ) argument
56149 sqlite3BtreeInsert( BtCursor *pCur, const void *pKey, i64 nKey, const void *pData, int nData, int nZero, int appendBias, int seekResult ) argument
62428 sqlite3VdbeRecordUnpack( KeyInfo *pKeyInfo, int nKey, const void *pKey, UnpackedRecord *p ) argument
65295 int nKey; member in struct:vdbeExecUnion::OP_IdxInsert_stack_vars
71789 int nKey; /* Number of bytes in key */ member in struct:VdbeSorterIter
72517 void *pKey; int nKey; /* Sorter key to copy into pOut */ local
72546 void *pKey; int nKey; /* Sorter key to compare pVal with */ local
80595 int nKey; local
101322 int nKey; local
116409 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem
117771 int nKey; local
122767 int nKey = pKey->n; local
123443 fts3StrHash(const void *pKey, int nKey) argument
123461 fts3BinHash(const void *pKey, int nKey) argument
123566 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument
123649 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument
123671 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument
126674 int nKey = fts3HashKeysize(pE); local
[all...]

Completed in 534 milliseconds

12