| /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);
104 #define sqliteHashKey(E) ((E)->pKey)
|
| H A D | hash.c | 62 if( pH->copyKey && elem->pKey ){
63 sqliteFree(elem->pKey);
74 static int intHash(const void *pKey, int nKey){ argument
85 static int ptrHash(const void *pKey, int nKey){
86 uptr x = Addr(pKey);
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
112 const char *z = (const char *)pKey;
182 int h = (*xHash)(elem->pKey, ele
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 | 53 * ROLLBACK_INSERT -> Need to insert (pKey, pData) into table iTab.
54 * ROLLBACK_DELETE -> Need to delete the record (pKey) into table iTab.
62 void *pKey; member in struct:BtRollbackOp
125 void *pKey; member in struct:BtRbNode
139 const void *pKey,
693 static int memRbtreeKeyCompare(RbtCursor* pCur, const void *pKey, int nKey, argument
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)
750 const void *pKey,
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 | attach.c | 29 void sqliteAttach(Parse *pParse, Token *pFilename, Token *pDbname, Token *pKey){ argument
102 if( pKey && pKey->z && pKey->n ){
103 sqliteSetNString(&zKey, pKey->z, pKey->n, 0);
|
| H A D | tclsqlite.c | 922 void *pKey; local
927 pKey = Tcl_GetByteArrayFromObj(objv[2], &nKey);
929 rc = sqlite_rekey(pDb->db, pKey, nKey);
1028 void *pKey = 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 | 1314 ** The external key is pKey and is nKey bytes long. The last nIgnore bytes
1321 ** *pRes<0 This means pCur<pKey
1323 ** *pRes==0 This means pCur==pKey for all nKey bytes
1325 ** *pRes>0 This means pCur>pKey
1334 const void *pKey, /* Key to compare against entry that pCur points to */
1335 int nKey, /* Number of bytes in pKey */
1343 const char *zKey = (const char*)pKey;
1568 /* Move the cursor so that it points to an entry near pKey.
1582 ** is smaller than pKey or if the table is empty
1586 ** exactly matches pKey
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...] |
| /illumos-gate/usr/src/lib/libkmf/libkmf/common/ |
| H A D | pk11keys.c | 183 const KMF_X509_SPKI *pKey,
218 (KMF_OID *)&pKey->algorithm.algorithm);
222 mrReturn = ExtractSPKIData(pKey, AlgorithmId, KeyParts, &uNumKeyParts);
360 const KMF_X509_SPKI *pKey,
377 mrReturn = PKCS_CreatePublicKey(pKey, ckSession, &ckKeyHandle);
182 PKCS_CreatePublicKey( const KMF_X509_SPKI *pKey, CK_SESSION_HANDLE ckSession, CK_OBJECT_HANDLE *pckPublicKey) argument
359 PKCS_AcquirePublicKeyHandle(CK_SESSION_HANDLE ckSession, const KMF_X509_SPKI *pKey, CK_KEY_TYPE ckRequestedKeyType, CK_OBJECT_HANDLE *pckKeyHandle) argument
|
| /illumos-gate/usr/src/lib/libkmf/ber_der/common/ |
| H A D | clasn1.c | 2478 const KMF_X509_SPKI *pKey,
2488 if (pKeyParts == NULL || uNumKeyParts == NULL || pKey == NULL)
2497 (char *)pKey->algorithm.parameters.Data;
2498 PubKeyParams.bv_len = pKey->algorithm.parameters.Length;
2520 PubKeyData.bv_val = (char *)pKey->subjectPublicKey.Data;
2521 PubKeyData.bv_len = pKey->subjectPublicKey.Length;
2542 (KMF_DATA *)&pKey->algorithm.parameters);
2545 (KMF_DATA *)&pKey->subjectPublicKey);
2555 PubKeyData.bv_val = (char *)pKey->subjectPublicKey.Data;
2556 PubKeyData.bv_len = pKey
2477 ExtractSPKIData( const KMF_X509_SPKI *pKey, KMF_ALGORITHM_INDEX AlgorithmId, KMF_DATA *pKeyParts, uint32_t *uNumKeyParts) argument
[all...] |
| /illumos-gate/usr/src/lib/libkmf/plugins/kmf_pkcs11/common/ |
| H A D | pkcs11_spi.c | 771 KMFPK11_EncodePubKeyData(KMF_HANDLE_T handle, KMF_KEY_HANDLE *pKey, argument
796 if (pKey == NULL || pKey->keyp == CK_INVALID_HANDLE)
806 switch (pKey->keyalg) {
818 (CK_OBJECT_HANDLE)pKey->keyp, rsaTemplate, 4);
842 (CK_OBJECT_HANDLE)pKey->keyp, rsaTemplate, 4);
900 (CK_OBJECT_HANDLE)pKey->keyp, dsaTemplate, 6);
945 (CK_OBJECT_HANDLE)pKey->keyp, dsaTemplate, 6);
1030 (CK_OBJECT_HANDLE)pKey->keyp,
1076 if (pKey
[all...] |