| /illumos-gate/usr/src/lib/libsqlite/src/ |
| H A D | hash.h | 56 void *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
62 ** SQLITE_HASH_INT nKey is used as the key and pKey is ignored.
64 ** SQLITE_HASH_POINTER pKey is used as the key and nKey is ignored.
66 ** SQLITE_HASH_STRING pKey points to a string that is nKey bytes long
70 ** SQLITE_HASH_BINARY pKey points to binary data nKey bytes long.
85 void *sqliteHashInsert(Hash*, const void *pKey, int nKey, void *pData);
86 void *sqliteHashFind(const Hash*, const void *pKey, int nKey);
105 #define sqliteHashKeysize(E) ((E)->nKey)
|
| H A D | hash.c | 74 static int intHash(const void *pKey, int nKey){ argument
75 return nKey ^ (nKey<<8) ^ (nKey>>8);
85 static int ptrHash(const void *pKey, int nKey){
99 static int strHash(const void *pKey, int nKey){ argument
100 return sqliteHashNoCase((const char*)pKey, nKey);
110 static int binHash(const void *pKey, int nKey){ argument
113 while( nKey-- > 0 ){
182 int h = (*xHash)(elem->pKey, elem->nKey)
206 findElementGivenHash( const Hash *pH, const void *pKey, int nKey, int h ) argument
264 sqliteHashFind(const Hash *pH, const void *pKey, int nKey) argument
293 sqliteHashInsert(Hash *pH, const void *pKey, int nKey, void *data) argument
[all...] |
| H A D | btree.h | 74 int (*Moveto)(BtCursor*, const void *pKey, int nKey, int *pRes);
76 int (*Insert)(BtCursor*, const void *pKey, int nKey,
84 int (*KeyCompare)(BtCursor*, const void *pKey, int nKey,
124 #define sqliteBtreeMoveto(pCur, pKey, nKey, pRes)\
125 (btCOps(pCur)->Moveto(pCur, pKey, nKey, pRes))
127 #define sqliteBtreeInsert(pCur, pKey, nKey, pData, nData) \
128 (btCOps(pCur)->Insert(pCur, pKey, nKey, pData, nData))
136 #define sqliteBtreeKeyCompare(pCur, pKey, nKey, nIgnore, pRes)\
137 (btCOps(pCur)->KeyCompare(pCur, pKey, nKey, nIgnore, pRes))
|
| H A D | btree_rb.c | 61 int nKey; member in struct:BtRollbackOp
124 int nKey; member in struct:BtRbNode
140 int nKey,
693 static int memRbtreeKeyCompare(RbtCursor* pCur, const void *pKey, int nKey, argument
701 if( (pCur->pNode->nKey - nIgnore) < 0 ){
704 *pRes = key_compare(pCur->pNode->pKey, pCur->pNode->nKey-nIgnore,
705 pKey, nKey);
741 * Insert a new record into the Rbtree. The key is given by (pKey,nKey)
751 int nKey,
784 memRbtreeMoveto( pCur, pKey, nKey,
748 memRbtreeInsert( RbtCursor* pCur, const void *pKey, int nKey, const void *pDataInput, int nData ) argument
874 memRbtreeMoveto( RbtCursor* pCur, const void *pKey, int nKey, int *pRes ) argument
[all...] |
| H A D | vdbeInt.h | 92 int nKey; /* Number of bytes in the key */ member in struct:Sorter
183 int nKey; /* Number of bytes in the key, including '\0' at end */ member in struct:AggElem
206 int nKey; /* Number of slots in aKey[] */ member in struct:Keylist
|
| H A D | attach.c | 101 int nKey; local
105 nKey = strlen(zKey);
108 nKey = 0;
110 sqliteCodecAttach(db, db->nDb-1, zKey, nKey);
|
| H A D | vdbe.c | 163 static int AggInsert(Agg *p, char *zKey, int nKey){ argument
167 pElem = sqliteMalloc( sizeof(AggElem) + nKey +
171 memcpy(pElem->zKey, zKey, nKey);
172 pElem->nKey = nKey;
173 pOld = sqliteHashInsert(&p->hash, pElem->zKey, pElem->nKey, pElem);
2711 int nKey; /* Number of bytes in K */ local
2717 nKey = pNos->n;
2718 assert( nKey >= 4 );
2724 rc = sqliteBtreeMoveto(pCrsr, zKey, nKey
2938 int nKey, iKey; local
3450 int nKey = pTos->n; local
4495 int nKey; local
[all...] |
| H A D | tclsqlite.c | 921 int nKey; local
927 pKey = Tcl_GetByteArrayFromObj(objv[2], &nKey);
929 rc = sqlite_rekey(pDb->db, pKey, nKey);
1029 int nKey = 0; local
1064 pKey = Tcl_GetByteArrayFromObj(objv[objc-1], &nKey);
1092 p->db = sqlite_open_encrypted(zFile, pKey, nKey, 0, &zErrMsg);
|
| H A D | btree.c | 194 u16 nKey; /* Number of bytes in the key */ member in struct:CellHdr
207 #define NKEY(b,h) (SWAB16(b,h.nKey) + h.nKeyHi*65536)
1314 ** The external key is pKey and is nKey bytes long. The last nIgnore bytes
1323 ** *pRes==0 This means pCur==pKey for all nKey bytes
1335 int nKey, /* Number of bytes in pKey */
1350 n = nKey<nLocal ? nKey : nLocal;
1360 nKey -= n;
1363 while( nKey>0 && nLocal>0 ){
1373 n = nKey<nLoca
1332 fileBtreeKeyCompare( BtCursor *pCur, const void *pKey, int nKey, int nIgnore, int *pResult ) argument
1592 fileBtreeMoveto(BtCursor *pCur, const void *pKey, int nKey, int *pRes) argument
1916 fillInCell( Btree *pBt, Cell *pCell, const void *pKey, int nKey, const void *pData,int nData ) argument
2627 fileBtreeInsert( BtCursor *pCur, const void *pKey, int nKey, const void *pData, int nData ) argument
[all...] |