Home
last modified time | relevance | path

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

12

/external/chromium_org/third_party/sqlite/src/src/
Dhash.c55 static unsigned int strHash(const char *z, int nKey){ in strHash() argument
57 assert( nKey>=0 ); in strHash()
58 while( nKey > 0 ){ in strHash()
60 nKey--; in strHash()
128 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size; in rehash()
142 int nKey, /* Bytes in key (not counting zero terminator) */ in findElementGivenHash() argument
157 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){ in findElementGivenHash()
203 void *sqlite3HashFind(const Hash *pH, const char *pKey, int nKey){ in sqlite3HashFind() argument
209 assert( nKey>=0 ); in sqlite3HashFind()
211 h = strHash(pKey, nKey) % pH->htsize; in sqlite3HashFind()
[all …]
Dhash.h62 const char *pKey; int nKey; /* Key associated with this element */ member
69 void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
70 void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
Dattach.c159 int nKey; in attachFunc() local
171 nKey = sqlite3_value_bytes(argv[2]); in attachFunc()
173 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey); in attachFunc()
178 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey); in attachFunc()
179 if( nKey>0 || sqlite3BtreeGetReserve(db->aDb[0].pBt)>0 ){ in attachFunc()
180 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey); in attachFunc()
Dvacuum.c172 int nKey; in sqlite3RunVacuum() local
174 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey); in sqlite3RunVacuum()
175 if( nKey ) db->nextPagesize = 0; in sqlite3RunVacuum()
Dbtree.c477 if( p->isIncrblobHandle && (isClearTable || p->info.nKey==iRow) ){ in invalidateIncrblobCursors()
575 rc = sqlite3BtreeKeySize(pCur, &pCur->nKey); in saveCursorPosition()
585 void *pKey = sqlite3Malloc( (int)pCur->nKey ); in saveCursorPosition()
587 rc = sqlite3BtreeKey(pCur, 0, (int)pCur->nKey, pKey); in saveCursorPosition()
652 i64 nKey, /* Integer key for tables. Size of pKey for indices */ in btreeMoveto() argument
661 assert( nKey==(i64)(int)nKey ); in btreeMoveto()
662 pIdxKey = sqlite3VdbeRecordUnpack(pCur->pKeyInfo, (int)nKey, pKey, in btreeMoveto()
668 rc = sqlite3BtreeMovetoUnpacked(pCur, pIdxKey, nKey, bias, pRes); in btreeMoveto()
690 rc = btreeMoveto(pCur, pCur->pKey, pCur->nKey, 0, &pCur->skipNext); in btreeRestoreCursorPosition()
906 n += getVarint(&pCell[n], (u64*)&pInfo->nKey); in btreeParseCellPtr()
[all …]
DbtreeInt.h449 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */ member
492 i64 nKey; /* Size of pKey, or last integer key */ member
Dtest_malloc.c752 int nKey = sizeof(int)*MALLOC_LOG_KEYINTS; in test_memdebug_callback() local
754 memset(aKey, 0, nKey); in test_memdebug_callback()
755 if( (sizeof(void*)*nFrame)<nKey ){ in test_memdebug_callback()
756 nKey = nFrame*sizeof(void*); in test_memdebug_callback()
758 memcpy(aKey, aFrame, nKey); in test_memdebug_callback()
Dbtree.h158 int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
Dtclsqlite.c2489 int nKey; in DbObjCmd() local
2495 pKey = Tcl_GetByteArrayFromObj(objv[2], &nKey); in DbObjCmd()
2497 rc = sqlite3_rekey(pDb->db, pKey, nKey); in DbObjCmd()
2860 int nKey = 0; in DbMain() local
2899 pKey = Tcl_GetByteArrayFromObj(objv[i+1], &nKey); in DbMain()
2971 sqlite3_key(p->db, pKey, nKey); in DbMain()
/external/chromium_org/third_party/sqlite/src/ext/fts1/
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){ in strHash() argument
115 if( nKey<=0 ) nKey = (int) strlen(z); in strHash()
116 while( nKey > 0 ){ in strHash()
118 nKey--; in strHash()
130 static int binHash(const void *pKey, int nKey){ in binHash() argument
133 while( nKey-- > 0 ){ in binHash()
244 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1); in rehash()
[all …]
Dfts1_hash.c92 static int strHash(const void *pKey, int nKey){ in strHash() argument
95 if( nKey<=0 ) nKey = (int) strlen(z); in strHash()
96 while( nKey > 0 ){ in strHash()
98 nKey--; in strHash()
110 static int binHash(const void *pKey, int nKey){ in binHash() argument
113 while( nKey-- > 0 ){ in binHash()
202 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1); in rehash()
215 int nKey, in findElementGivenHash() argument
228 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in findElementGivenHash()
278 void *sqlite3Fts1HashFind(const fts1Hash *pH, const void *pKey, int nKey){ in sqlite3Fts1HashFind() argument
[all …]
Dft_hash.h55 void *pKey; int nKey; /* Key associated with this element */ member
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)
Dfts1_hash.h55 void *pKey; int nKey; /* Key associated with this element */ member
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)
/external/chromium_org/third_party/sqlite/src/ext/fts3/
Dfts3_hash.c97 static int fts3StrHash(const void *pKey, int nKey){ in fts3StrHash() argument
100 if( nKey<=0 ) nKey = (int) strlen(z); in fts3StrHash()
101 while( nKey > 0 ){ in fts3StrHash()
103 nKey--; in fts3StrHash()
115 static int fts3BinHash(const void *pKey, int nKey){ in fts3BinHash() argument
118 while( nKey-- > 0 ){ in fts3BinHash()
209 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1); in fts3Rehash()
223 int nKey, in fts3FindElementByHash() argument
236 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in fts3FindElementByHash()
285 int nKey in sqlite3Fts3HashFindElem() argument
[all …]
Dfts3_hash.h53 void *pKey; int nKey; /* Key associated with this element */ member
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)
Dfts3_expr.c365 int nKey = pKey->n; in getNextNode() local
370 assert( nKey==4 ); in getNextNode()
373 for(nKey=5; zInput[nKey]>='0' && zInput[nKey]<='9'; nKey++){ in getNextNode()
374 nNear = nNear * 10 + (zInput[nKey] - '0'); in getNextNode()
383 cNext = zInput[nKey]; in getNextNode()
394 *pnConsumed = (int)((zInput - z) + nKey); in getNextNode()
Dfts3.c873 int nKey; in fts3InitVtab() local
886 else if( isFts4 && fts3IsSpecialColumn(z, &nKey, &zVal) ){ in fts3InitVtab()
891 if( nKey==9 && 0==sqlite3_strnicmp(z, "matchinfo", 9) ){ in fts3InitVtab()
898 }else if( nKey==8 && 0==sqlite3_strnicmp(z, "compress", 8) ){ in fts3InitVtab()
901 }else if( nKey==10 && 0==sqlite3_strnicmp(z, "uncompress", 10) ){ in fts3InitVtab()
/external/chromium_org/third_party/sqlite/src/ext/fts2/
Dfts2_hash.c97 static int strHash(const void *pKey, int nKey){ in strHash() argument
100 if( nKey<=0 ) nKey = (int) strlen(z); in strHash()
101 while( nKey > 0 ){ in strHash()
103 nKey--; in strHash()
115 static int binHash(const void *pKey, int nKey){ in binHash() argument
118 while( nKey-- > 0 ){ in binHash()
207 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1); in rehash()
220 int nKey, in findElementGivenHash() argument
233 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in findElementGivenHash()
283 void *sqlite3Fts2HashFind(const fts2Hash *pH, const void *pKey, int nKey){ in sqlite3Fts2HashFind() argument
[all …]
Dfts2_hash.h53 void *pKey; int nKey; /* Key associated with this element */ member
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)
/external/sqlite/dist/
Dsqlite3.h4622 const void *pKey, int nKey /* The key */
4627 const void *pKey, int nKey /* The key */
4640 const void *pKey, int nKey /* The new key */
4645 const void *pKey, int nKey /* The new key */
Dsqlite3.c4737 const void *pKey, int nKey /* The key */
4742 const void *pKey, int nKey /* The key */
4755 const void *pKey, int nKey /* The new key */
4760 const void *pKey, int nKey /* The new key */
8159 const char *pKey; int nKey; /* Key associated with this element */ member
8166 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
8167 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
9005 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
23666 static unsigned int strHash(const char *z, int nKey){
23668 assert( nKey>=0 );
[all …]
/external/sqlite/dist/orig/
Dsqlite3.h4622 const void *pKey, int nKey /* The key */
4627 const void *pKey, int nKey /* The key */
4640 const void *pKey, int nKey /* The new key */
4645 const void *pKey, int nKey /* The new key */
Dsqlite3.c4737 const void *pKey, int nKey /* The key */
4742 const void *pKey, int nKey /* The key */
4755 const void *pKey, int nKey /* The new key */
4760 const void *pKey, int nKey /* The new key */
8159 const char *pKey; int nKey; /* Key associated with this element */ member
8166 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
8167 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
9005 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
23666 static unsigned int strHash(const char *z, int nKey){
23668 assert( nKey>=0 );
[all …]
/external/chromium_org/third_party/sqlite/amalgamation/
Dsqlite3.h4046 const void *pKey, int nKey /* The key */
4059 const void *pKey, int nKey /* The new key */
Dsqlite3.c4589 const void *pKey, int nKey /* The key */
4602 const void *pKey, int nKey /* The new key */
7085 const char *pKey; int nKey; /* Key associated with this element */ member
7092 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
7093 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
7784 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
21426 static unsigned int strHash(const char *z, int nKey){ in strHash() argument
21428 assert( nKey>=0 ); in strHash()
21429 while( nKey > 0 ){ in strHash()
21431 nKey--; in strHash()
[all …]

12