| /titanic_50/usr/src/lib/libsqlite/src/ |
| H A D | hash.c | 62 if( pH->copyKey && elem->pKey ){ in sqliteHashClear()
63 sqliteFree(elem->pKey); in sqliteHashClear()
74 static int intHash(const void *pKey, int nKey){ in intHash() argument
85 static int ptrHash(const void *pKey, int nKey){
86 uptr x = Addr(pKey);
99 static int strHash(const void *pKey, int nKey){ in strHash() argument
100 return sqliteHashNoCase((const char*)pKey, nKey); in strHash()
110 static int binHash(const void *pKey, int nKey){ in binHash() argument
112 const char *z = (const char *)pKey; in binHash()
182 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1); in rehash()
[all …]
|
| H A D | btree_rb.c | 62 void *pKey; member
125 void *pKey; member
139 const void *pKey,
693 static int memRbtreeKeyCompare(RbtCursor* pCur, const void *pKey, int nKey, in memRbtreeKeyCompare() argument
704 *pRes = key_compare(pCur->pNode->pKey, pCur->pNode->nKey-nIgnore, in memRbtreeKeyCompare()
705 pKey, nKey); in memRbtreeKeyCompare()
750 const void *pKey, in memRbtreeInsert() argument
784 memRbtreeMoveto( pCur, pKey, nKey, &match); in memRbtreeInsert()
789 pNode->pKey = sqliteMallocRaw(nKey); in memRbtreeInsert()
791 memcpy(pNode->pKey, pKey, nKey); in memRbtreeInsert()
[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)\ argument
125 (btCOps(pCur)->Moveto(pCur, pKey, nKey, pRes))
127 #define sqliteBtreeInsert(pCur, pKey, nKey, pData, nData) \ argument
128 (btCOps(pCur)->Insert(pCur, pKey, nKey, pData, nData))
136 #define sqliteBtreeKeyCompare(pCur, pKey, nKey, nIgnore, pRes)\ argument
137 (btCOps(pCur)->KeyCompare(pCur, pKey, nKey, nIgnore, pRes))
|
| H A D | hash.h | 56 void *pKey; int nKey; /* Key associated with this element */ member
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 | attach.c | 29 void sqliteAttach(Parse *pParse, Token *pFilename, Token *pDbname, Token *pKey){ in sqliteAttach() argument
102 if( pKey && pKey->z && pKey->n ){ in sqliteAttach()
103 sqliteSetNString(&zKey, pKey->z, pKey->n, 0); in sqliteAttach()
|
| H A D | tclsqlite.c | 922 void *pKey; in DbObjCmd() local
927 pKey = Tcl_GetByteArrayFromObj(objv[2], &nKey); in DbObjCmd()
929 rc = sqlite_rekey(pDb->db, pKey, nKey); in DbObjCmd()
1028 void *pKey = 0; in DbMain() local
1064 pKey = Tcl_GetByteArrayFromObj(objv[objc-1], &nKey); in DbMain()
1092 p->db = sqlite_open_encrypted(zFile, pKey, nKey, 0, &zErrMsg); in DbMain()
|
| H A D | btree.c | 1334 const void *pKey, /* Key to compare against entry that pCur points to */ in fileBtreeKeyCompare() argument
1343 const char *zKey = (const char*)pKey; in fileBtreeKeyCompare()
1592 int fileBtreeMoveto(BtCursor *pCur, const void *pKey, int nKey, int *pRes){ in fileBtreeMoveto() argument
1607 rc = fileBtreeKeyCompare(pCur, pKey, nKey, 0, &c); in fileBtreeMoveto()
1919 const void *pKey, int nKey, /* The key */ in fillInCell() argument
1941 pPayload = pKey; in fillInCell()
1942 pKey = 0; in fillInCell()
2629 const void *pKey, int nKey, /* The key of the new record */ in fileBtreeInsert() argument
2653 rc = fileBtreeMoveto(pCur, pKey, nKey, &loc); in fileBtreeInsert()
2659 rc = fillInCell(pBt, &newCell, pKey, nKey, pData, nData); in fileBtreeInsert()
|
| H A D | sqlite.h.in | 806 ** Open an encrypted SQLite database. If pKey==0 or nKey==0, this routine
814 const void *pKey, /* Pointer to the key */
830 const void *pKey, int nKey /* The new key */
|
| /titanic_50/usr/src/lib/libkmf/libkmf/common/ |
| H A D | pk11keys.c | 183 const KMF_X509_SPKI *pKey, in PKCS_CreatePublicKey() argument
218 (KMF_OID *)&pKey->algorithm.algorithm); in PKCS_CreatePublicKey()
222 mrReturn = ExtractSPKIData(pKey, AlgorithmId, KeyParts, &uNumKeyParts); in PKCS_CreatePublicKey()
360 const KMF_X509_SPKI *pKey, in PKCS_AcquirePublicKeyHandle() argument
377 mrReturn = PKCS_CreatePublicKey(pKey, ckSession, &ckKeyHandle); in PKCS_AcquirePublicKeyHandle()
|
| /titanic_50/usr/src/lib/libkmf/ber_der/common/ |
| H A D | clasn1.c | 2478 const KMF_X509_SPKI *pKey, in ExtractSPKIData() argument
2488 if (pKeyParts == NULL || uNumKeyParts == NULL || pKey == NULL) in ExtractSPKIData()
2497 (char *)pKey->algorithm.parameters.Data; in ExtractSPKIData()
2498 PubKeyParams.bv_len = pKey->algorithm.parameters.Length; in ExtractSPKIData()
2520 PubKeyData.bv_val = (char *)pKey->subjectPublicKey.Data; in ExtractSPKIData()
2521 PubKeyData.bv_len = pKey->subjectPublicKey.Length; in ExtractSPKIData()
2542 (KMF_DATA *)&pKey->algorithm.parameters); in ExtractSPKIData()
2545 (KMF_DATA *)&pKey->subjectPublicKey); in ExtractSPKIData()
2555 PubKeyData.bv_val = (char *)pKey->subjectPublicKey.Data; in ExtractSPKIData()
2556 PubKeyData.bv_len = pKey->subjectPublicKey.Length; in ExtractSPKIData()
|
| /titanic_50/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, in KMFPK11_EncodePubKeyData() argument
796 if (pKey == NULL || pKey->keyp == CK_INVALID_HANDLE) in KMFPK11_EncodePubKeyData()
806 switch (pKey->keyalg) { in KMFPK11_EncodePubKeyData()
818 (CK_OBJECT_HANDLE)pKey->keyp, rsaTemplate, 4); in KMFPK11_EncodePubKeyData()
842 (CK_OBJECT_HANDLE)pKey->keyp, rsaTemplate, 4); in KMFPK11_EncodePubKeyData()
900 (CK_OBJECT_HANDLE)pKey->keyp, dsaTemplate, 6); in KMFPK11_EncodePubKeyData()
945 (CK_OBJECT_HANDLE)pKey->keyp, dsaTemplate, 6); in KMFPK11_EncodePubKeyData()
1030 (CK_OBJECT_HANDLE)pKey->keyp, in KMFPK11_EncodePubKeyData()
1076 if (pKey->keyalg != KMF_ECDSA) in KMFPK11_EncodePubKeyData()
1082 if (pKey->keyalg != KMF_ECDSA) in KMFPK11_EncodePubKeyData()
|