| /PHP_5_3/ext/sqlite/libsqlite/src/ |
| H A D | attach.c | 98 int nKey; local
102 nKey = strlen(zKey);
105 nKey = 0;
107 sqliteCodecAttach(db, db->nDb-1, zKey, nKey);
|
| H A D | btree.c | 187 u16 nKey; /* Number of bytes in the key */ member in struct:CellHdr
200 #define NKEY(b,h) (SWAB16(b,h.nKey) + h.nKeyHi*65536)
1307 ** The external key is pKey and is nKey bytes long. The last nIgnore bytes
1316 ** *pRes==0 This means pCur==pKey for all nKey bytes
1328 int nKey, /* Number of bytes in pKey */
1343 n = nKey<nLocal ? nKey : nLocal;
1353 nKey -= n;
1356 while( nKey>0 && nLocal>0 ){
1366 n = nKey<nLoca
1325 fileBtreeKeyCompare( BtCursor *pCur, const void *pKey, int nKey, int nIgnore, int *pResult ) argument
1585 fileBtreeMoveto(BtCursor *pCur, const void *pKey, int nKey, int *pRes) argument
1909 fillInCell( Btree *pBt, Cell *pCell, const void *pKey, int nKey, const void *pData,int nData ) argument
2619 fileBtreeInsert( BtCursor *pCur, const void *pKey, int nKey, const void *pData, int nData ) argument
[all...] |
| H A D | btree_rb.c | 58 int nKey; member in struct:BtRollbackOp
121 int nKey; member in struct:BtRbNode
137 int nKey,
690 static int memRbtreeKeyCompare(RbtCursor* pCur, const void *pKey, int nKey, argument
698 if( (pCur->pNode->nKey - nIgnore) < 0 ){
701 *pRes = key_compare(pCur->pNode->pKey, pCur->pNode->nKey-nIgnore,
702 pKey, nKey);
738 * Insert a new record into the Rbtree. The key is given by (pKey,nKey)
748 int nKey,
781 memRbtreeMoveto( pCur, pKey, nKey,
745 memRbtreeInsert( RbtCursor* pCur, const void *pKey, int nKey, const void *pDataInput, int nData ) argument
871 memRbtreeMoveto( RbtCursor* pCur, const void *pKey, int nKey, int *pRes ) argument
[all...] |
| H A D | hash.c | 71 static int intHash(const void *pKey, int nKey){ argument
72 return nKey ^ (nKey<<8) ^ (nKey>>8);
82 static int ptrHash(const void *pKey, int nKey){
96 static int strHash(const void *pKey, int nKey){ argument
97 return sqliteHashNoCase((const char*)pKey, nKey);
107 static int binHash(const void *pKey, int nKey){ argument
110 while( nKey-- > 0 ){
179 int h = (*xHash)(elem->pKey, elem->nKey)
203 findElementGivenHash( const Hash *pH, const void *pKey, int nKey, int h ) argument
261 sqliteHashFind(const Hash *pH, const void *pKey, int nKey) argument
290 sqliteHashInsert(Hash *pH, const void *pKey, int nKey, void *data) argument
[all...] |
| H A D | hash.h | 53 void *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
59 ** SQLITE_HASH_INT nKey is used as the key and pKey is ignored.
61 ** SQLITE_HASH_POINTER pKey is used as the key and nKey is ignored.
63 ** SQLITE_HASH_STRING pKey points to a string that is nKey bytes long
67 ** SQLITE_HASH_BINARY pKey points to binary data nKey bytes long.
82 void *sqliteHashInsert(Hash*, const void *pKey, int nKey, void *pData);
83 void *sqliteHashFind(const Hash*, const void *pKey, int nKey);
102 #define sqliteHashKeysize(E) ((E)->nKey)
|
| H A D | vdbe.c | 156 static int AggInsert(Agg *p, char *zKey, int nKey){ argument
160 pElem = sqliteMalloc( sizeof(AggElem) + nKey +
164 memcpy(pElem->zKey, zKey, nKey);
165 pElem->nKey = nKey;
166 pOld = sqliteHashInsert(&p->hash, pElem->zKey, pElem->nKey, pElem);
2700 int nKey; /* Number of bytes in K */ local
2706 nKey = pNos->n;
2707 assert( nKey >= 4 );
2713 rc = sqliteBtreeMoveto(pCrsr, zKey, nKey
2927 int nKey, iKey; local
3439 int nKey = pTos->n; local
4484 int nKey; local
[all...] |
| H A D | vdbeInt.h | 89 int nKey; /* Number of bytes in the key */ member in struct:Sorter
180 int nKey; /* Number of bytes in the key, including '\0' at end */ member in struct:AggElem
203 int nKey; /* Number of slots in aKey[] */ member in struct:Keylist
|
| /PHP_5_3/ext/sqlite3/libsqlite/ |
| H A D | sqlite3.c | 4751 const void *pKey, int nKey /* The key */
4764 const void *pKey, int nKey /* The new key */
7345 const char *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
7352 SQLITE_PRIVATE void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
7353 SQLITE_PRIVATE void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
7372 /* #define sqliteHashKeysize(E) ((E)->nKey) // NOT USED */
8046 SQLITE_PRIVATE int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
21755 static unsigned int strHash(const char *z, int nKey){ argument
21757 assert( nKey>=0 );
21758 while( nKey >
21839 findElementGivenHash( const Hash *pH, const char *pKey, int nKey, unsigned int h ) argument
21903 sqlite3HashFind(const Hash *pH, const char *pKey, int nKey) argument
21933 sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data) argument
47047 i64 nKey; /* The key for INTKEY tables, or number of bytes in key */ member in struct:CellInfo
47090 i64 nKey; /* Size of pKey, or last integer key */ member in struct:BtCursor
48164 btreeMoveto( BtCursor *pCur, const void *pKey, i64 nKey, int bias, int *pRes ) argument
51353 u32 nKey; local
51551 u32 nKey; local
52751 fillInCell( MemPage *pPage, unsigned char *pCell, const void *pKey, i64 nKey, const void *pData,int nData, int nZero, int *pnSize ) argument
54182 sqlite3BtreeInsert( BtCursor *pCur, const void *pKey, i64 nKey, const void *pData, int nData, int nZero, int appendBias, int seekResult ) argument
60387 sqlite3VdbeRecordUnpack( KeyInfo *pKeyInfo, int nKey, const void *pKey, char *pSpace, int szSpace ) argument
63174 int nKey; member in struct:vdbeExecUnion::OP_IdxInsert_stack_vars
76703 int nKey; local
97089 int nKey; local
111738 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem
112931 int nKey; local
117302 int nKey = pKey->n; local
117969 fts3StrHash(const void *pKey, int nKey) argument
117987 fts3BinHash(const void *pKey, int nKey) argument
118092 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument
118175 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument
118197 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument
121081 int nKey = fts3HashKeysize(pE); local
[all...] |