| /illumos-gate/usr/src/lib/libsqlite/src/ |
| H A D | hash.c | 71 static int intHash(const void *pKey, int nKey){ in intHash() argument
72 return nKey ^ (nKey<<8) ^ (nKey>>8); in intHash()
82 static int ptrHash(const void *pKey, int nKey){
96 static int strHash(const void *pKey, int nKey){ in strHash() argument
107 static int binHash(const void *pKey, int nKey){ in binHash() argument
110 while( nKey-- > 0 ){ in binHash()
206 int nKey, in findElementGivenHash() argument
218 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){ in findElementGivenHash()
269 h = (*xHash)(pKey,nKey); in sqliteHashFind()
300 hraw = (*xHash)(pKey, nKey); in sqliteHashInsert()
[all …]
|
| H A D | btree_rb.c | 58 int nKey; member
121 int nKey; member
137 int nKey,
748 int nKey, in memRbtreeInsert() argument
785 pNode->nKey = nKey; in memRbtreeInsert()
822 pOp->nKey = pNode->nKey; in memRbtreeInsert()
838 pOp->nKey = pCur->pNode->nKey; in memRbtreeInsert()
874 int nKey, in memRbtreeMoveto() argument
945 pOp->nKey = pZ->nKey; in memRbtreeDelete()
972 pZ->nKey = pCur->pNode->nKey; in memRbtreeDelete()
[all …]
|
| H A D | btree.h | 71 int (*Moveto)(BtCursor*, const void *pKey, int nKey, int *pRes);
73 int (*Insert)(BtCursor*, const void *pKey, int nKey,
81 int (*KeyCompare)(BtCursor*, const void *pKey, int nKey,
121 #define sqliteBtreeMoveto(pCur, pKey, nKey, pRes)\ argument
122 (btCOps(pCur)->Moveto(pCur, pKey, nKey, pRes))
124 #define sqliteBtreeInsert(pCur, pKey, nKey, pData, nData) \ argument
125 (btCOps(pCur)->Insert(pCur, pKey, nKey, pData, nData))
133 #define sqliteBtreeKeyCompare(pCur, pKey, nKey, nIgnore, pRes)\ argument
134 (btCOps(pCur)->KeyCompare(pCur, pKey, nKey, nIgnore, pRes))
|
| H A D | hash.h | 53 void *pKey; int nKey; /* Key associated with this element */ member
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 | vdbeInt.h | 89 int nKey; /* Number of bytes in the key */ member
180 int nKey; /* Number of bytes in the key, including '\0' at end */ member
203 int nKey; /* Number of slots in aKey[] */ member
|
| H A D | attach.c | 98 int nKey; in sqliteAttach() local
102 nKey = strlen(zKey); in sqliteAttach()
105 nKey = 0; in sqliteAttach()
107 sqliteCodecAttach(db, db->nDb-1, zKey, nKey); in sqliteAttach()
|
| H A D | vdbe.c | 170 pElem->nKey = nKey; in AggInsert()
2715 nKey = pNos->n; in sqliteVdbeExec()
2716 assert( nKey >= 4 ); in sqliteVdbeExec()
2936 int nKey, iKey; in sqliteVdbeExec() local
2939 nKey = pNos->n; in sqliteVdbeExec()
2943 nKey = sizeof(int); in sqliteVdbeExec()
3448 int nKey = pTos->n; in sqliteVdbeExec() local
3452 assert( nKey >= 4 ); in sqliteVdbeExec()
3458 if( n==nKey in sqliteVdbeExec()
4493 int nKey; in sqliteVdbeExec() local
[all …]
|
| H A D | btree.c | 1348 n = nKey<nLocal ? nKey : nLocal; in fileBtreeKeyCompare()
1358 nKey -= n; in fileBtreeKeyCompare()
1361 while( nKey>0 && nLocal>0 ){ in fileBtreeKeyCompare()
1371 n = nKey<nLocal ? nKey : nLocal; in fileBtreeKeyCompare()
1381 nKey -= n; in fileBtreeKeyCompare()
1386 c = nLocal - nKey; in fileBtreeKeyCompare()
1917 const void *pKey, int nKey, /* The key */ in fillInCell() argument
1930 pCell->h.nKey = SWAB16(pBt, nKey & 0xffff); in fillInCell()
1931 pCell->h.nKeyHi = nKey >> 16; in fillInCell()
1941 nPayload = nKey; in fillInCell()
[all …]
|
| H A D | tclsqlite.c | 918 int nKey; in DbObjCmd() local
924 pKey = Tcl_GetByteArrayFromObj(objv[2], &nKey); in DbObjCmd()
926 rc = sqlite_rekey(pDb->db, pKey, nKey); in DbObjCmd()
1026 int nKey = 0; in DbMain() local
1061 pKey = Tcl_GetByteArrayFromObj(objv[objc-1], &nKey); in DbMain()
1089 p->db = sqlite_open_encrypted(zFile, pKey, nKey, 0, &zErrMsg); in DbMain()
|
| H A D | sqlite.h.in | 803 ** Open an encrypted SQLite database. If pKey==0 or nKey==0, this routine
812 int nKey, /* Number of bytes in the key */
827 const void *pKey, int nKey /* The new key */
|