HomeSort by relevance Sort by last modified time
    Searched defs:nKey (Results 1 - 17 of 17) sorted by null

  /external/chromium_org/third_party/sqlite/src/src/
hash.h 62 const char *pKey; int nKey; /* Key associated with this element */
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 */
vacuum.c 172 int nKey;
174 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey);
175 if( nKey ) db->nextPagesize = 0;
attach.c 159 int nKey;
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);
btreeInt.h 449 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */
492 i64 nKey; /* Size of pKey, or last integer key */
497 u8 validNKey; /* True if info.nKey is valid */
522 ** in variables BtCursor.pKey and BtCursor.nKey. When a cursor is in
test_malloc.c 752 int nKey = sizeof(int)*MALLOC_LOG_KEYINTS;
754 memset(aKey, 0, nKey);
755 if( (sizeof(void*)*nFrame)<nKey ){
756 nKey = nFrame*sizeof(void*);
758 memcpy(aKey, aFrame, nKey);
    [all...]
vdbe.c     [all...]
tclsqlite.c     [all...]
btree.c 477 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 );
    [all...]
test1.c 669 int nKey;
677 nKey = strlen(zKey);
679 sqlite3_key(db, zKey, nKey);
697 int nKey;
705 nKey = strlen(zKey);
707 sqlite3_rekey(db, zKey, nKey);
    [all...]
  /external/chromium_org/third_party/sqlite/src/ext/fts1/
ft_hash.h 55 void *pKey; int nKey; /* Key associated with this element */
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)
fts1_hash.h 55 void *pKey; int nKey; /* Key associated with this element */
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)
  /external/chromium_org/third_party/sqlite/src/ext/fts2/
fts2_hash.h 53 void *pKey; int nKey; /* Key associated with this element */
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)
  /external/chromium_org/third_party/sqlite/src/ext/fts3/
fts3_hash.h 53 void *pKey; int nKey; /* Key associated with this element */
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)
fts3_expr.c 365 int nKey = pKey->n;
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);
fts3.c 873 int nKey;
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) ){
    [all...]
fts3_write.c     [all...]
  /external/chromium_org/third_party/sqlite/amalgamation/
sqlite3.c     [all...]

Completed in 115 milliseconds