Searched refs:pKey (Results 1 - 25 of 46) sorted by relevance

12

/external/chromium_org/third_party/sqlite/src/src/
H A Dhash.h62 const char *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
69 void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
70 void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
88 /* #define sqliteHashKey(E) ((E)->pKey) // NOT USED */
H A Dhash.c128 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size;
141 const char *pKey, /* The key we are searching for */
157 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){
200 ** that matches pKey,nKey. Return the data for this element if it is
203 void *sqlite3HashFind(const Hash *pH, const char *pKey, int nKey){ argument
208 assert( pKey!=0 );
211 h = strHash(pKey, nKey) % pH->htsize;
215 elem = findElementGivenHash(pH, pKey, nKey, h);
219 /* Insert an element into the hash table pH. The key is pKey,nKe
139 findElementGivenHash( const Hash *pH, const char *pKey, int nKey, unsigned int h ) argument
233 sqlite3HashInsert(Hash *pH, const char *pKey, int nKey, void *data) argument
[all...]
H A Dtest_wsd.c34 void *pKey; member in struct:ProcessLocalVar
66 for(pVar=pGlobal->aData[iHash]; pVar && pVar->pKey!=K; pVar=pVar->pNext);
73 pVar->pKey = K;
H A Dattach.c295 Expr *pKey /* Database key for encryption extension */
309 SQLITE_OK!=(rc = resolveAttachExpr(&sName, pKey))
335 sqlite3ExprCode(pParse, pKey, regArgs+2);
354 sqlite3ExprDelete(db, pKey);
382 ** ATTACH p AS pDbname KEY pKey
384 void sqlite3Attach(Parse *pParse, Expr *p, Expr *pDbname, Expr *pKey){ argument
398 codeAttach(pParse, SQLITE_ATTACH, &attach_func, p, p, pDbname, pKey);
H A Dbtree.h158 int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
H A DbtreeInt.h492 i64 nKey; /* Size of pKey, or last integer key */
493 void *pKey; /* Saved key that was cursor's last known position */ member in struct:BtCursor
522 ** in variables BtCursor.pKey and BtCursor.nKey. When a cursor is in
H A Dinsert.c1500 KeyInfo *pKey = sqlite3IndexKeyinfo(pParse, pIdx); local
1503 (char*)pKey, P4_KEYINFO_HANDOFF);
1624 KeyInfo *pKey; /* Key information for an index */ local
1802 pKey = sqlite3IndexKeyinfo(pParse, pSrcIdx);
1804 (char*)pKey, P4_KEYINFO_HANDOFF);
1806 pKey = sqlite3IndexKeyinfo(pParse, pDestIdx);
1808 (char*)pKey, P4_KEYINFO_HANDOFF);
H A Danalyze.c167 KeyInfo *pKey; local
171 pKey = sqlite3IndexKeyinfo(pParse, pIdx);
179 (char *)pKey, P4_KEYINFO_HANDOFF);
/external/chromium_org/third_party/sqlite/src/ext/fts1/
H A Dft_hash.h55 void *pKey; int nKey; /* Key associated with this element */ member in struct:HashElem
61 ** HASH_INT nKey is used as the key and pKey is ignored.
63 ** HASH_POINTER pKey is used as the key and nKey is ignored.
65 ** HASH_STRING pKey points to a string that is nKey bytes long
69 ** HASH_BINARY pKey points to binary data nKey bytes long.
84 void *HashInsert(Hash*, const void *pKey, int nKey, void *pData);
85 void *HashFind(const Hash*, const void *pKey, int nKey);
103 #define HashKey(E) ((E)->pKey)
H A Dfts1_hash.h55 void *pKey; int nKey; /* Key associated with this element */ member in struct:fts1HashElem
61 ** FTS1_HASH_STRING pKey points to a string that is nKey bytes long
65 ** FTS1_HASH_BINARY pKey points to binary data nKey bytes long.
77 void *sqlite3Fts1HashInsert(fts1Hash*, const void *pKey, int nKey, void *pData);
78 void *sqlite3Fts1HashFind(const fts1Hash*, const void *pKey, int nKey);
104 #define fts1HashKey(E) ((E)->pKey)
H A Dft_hash.c73 if( pH->copyKey && elem->pKey ){
74 pH->xFree(elem->pKey);
86 static int intHash(const void *pKey, int nKey){
98 static int ptrHash(const void *pKey, int nKey){
99 uptr x = Addr(pKey);
112 static int strHash(const void *pKey, int nKey){ argument
113 const char *z = (const char *)pKey;
130 static int binHash(const void *pKey, int nKey){ argument
132 const char *z = (const char *)pKey;
244 int h = (*xHash)(elem->pKey, ele
254 findElementGivenHash( const Hash *pH, const void *pKey, int nKey, int h ) argument
320 HashFind(const Hash *pH, const void *pKey, int nKey) argument
349 HashInsert(Hash *pH, const void *pKey, int nKey, void *data) argument
[all...]
H A Dfts1_hash.c80 if( pH->copyKey && elem->pKey ){
81 pH->xFree(elem->pKey);
92 static int strHash(const void *pKey, int nKey){ argument
93 const char *z = (const char *)pKey;
110 static int binHash(const void *pKey, int nKey){ argument
112 const char *z = (const char *)pKey;
202 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
214 const void *pKey, /* The key we are searching for */
228 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKe
212 findElementGivenHash( const fts1Hash *pH, const void *pKey, int nKey, int h ) argument
278 sqlite3Fts1HashFind(const fts1Hash *pH, const void *pKey, int nKey) argument
307 sqlite3Fts1HashInsert( fts1Hash *pH, const void *pKey, int nKey, void *data ) argument
[all...]
/external/chromium_org/third_party/sqlite/src/ext/fts2/
H A Dfts2_hash.h53 void *pKey; int nKey; /* Key associated with this element */ member in struct:fts2HashElem
59 ** FTS2_HASH_STRING pKey points to a string that is nKey bytes long
63 ** FTS2_HASH_BINARY pKey points to binary data nKey bytes long.
75 void *sqlite3Fts2HashInsert(fts2Hash*, const void *pKey, int nKey, void *pData);
76 void *sqlite3Fts2HashFind(const fts2Hash*, const void *pKey, int nKey);
102 #define fts2HashKey(E) ((E)->pKey)
H A Dfts2_hash.c85 if( pH->copyKey && elem->pKey ){
86 fts2HashFree(elem->pKey);
97 static int strHash(const void *pKey, int nKey){ argument
98 const char *z = (const char *)pKey;
115 static int binHash(const void *pKey, int nKey){ argument
117 const char *z = (const char *)pKey;
207 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
219 const void *pKey, /* The key we are searching for */
233 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKe
217 findElementGivenHash( const fts2Hash *pH, const void *pKey, int nKey, int h ) argument
283 sqlite3Fts2HashFind(const fts2Hash *pH, const void *pKey, int nKey) argument
312 sqlite3Fts2HashInsert( fts2Hash *pH, const void *pKey, int nKey, void *data ) argument
[all...]
/external/chromium_org/third_party/sqlite/src/ext/fts3/
H A Dfts3_hash.h53 void *pKey; int nKey; /* Key associated with this element */ member in struct:Fts3HashElem
59 ** FTS3_HASH_STRING pKey points to a string that is nKey bytes long
63 ** FTS3_HASH_BINARY pKey points to binary data nKey bytes long.
75 void *sqlite3Fts3HashInsert(Fts3Hash*, const void *pKey, int nKey, void *pData);
76 void *sqlite3Fts3HashFind(const Fts3Hash*, const void *pKey, int nKey);
104 #define fts3HashKey(E) ((E)->pKey)
H A Dfts3_hash.c85 if( pH->copyKey && elem->pKey ){
86 fts3HashFree(elem->pKey);
97 static int fts3StrHash(const void *pKey, int nKey){ argument
98 const char *z = (const char *)pKey;
115 static int fts3BinHash(const void *pKey, int nKey){ argument
117 const char *z = (const char *)pKey;
209 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
222 const void *pKey, /* The key we are searching for */
236 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKe
220 fts3FindElementByHash( const Fts3Hash *pH, const void *pKey, int nKey, int h ) argument
282 sqlite3Fts3HashFindElem( const Fts3Hash *pH, const void *pKey, int nKey ) argument
303 sqlite3Fts3HashFind(const Fts3Hash *pH, const void *pKey, int nKey) argument
325 sqlite3Fts3HashInsert( Fts3Hash *pH, const void *pKey, int nKey, void *data ) argument
[all...]
H A Dfts3_expr.c357 const struct Fts3Keyword *pKey = &aKeyword[ii]; local
359 if( (pKey->parenOnly & ~sqlite3_fts3_enable_parentheses)!=0 ){
363 if( nInput>=pKey->n && 0==memcmp(zInput, pKey->z, pKey->n) ){
365 int nKey = pKey->n;
369 if( pKey->eType==FTSQUERY_NEAR ){
391 pRet->eType = pKey->eType;
/external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/java/security/
H A DKeyStore_Impl1Test.java468 KeyStore.PrivateKeyEntry pKey = new KeyStore.PrivateKeyEntry(privKey,
480 kss[i].setEntry(aliases[j], pKey, pPath);
493 Key key = pKey.getPrivateKey();
538 kss[i].setEntry("ZZZ", pKey, pPath);
844 KeyStore.PrivateKeyEntry pKey = new KeyStore.PrivateKeyEntry(tkp
857 kss[i].setEntry(aliases[1], pKey, pp);
858 kss[i].setEntry(aliases[2], pKey, pp);
909 KeyStore.PrivateKeyEntry pKey = new KeyStore.PrivateKeyEntry(privKey, certs);
921 kss[i].setEntry(aliases[j], pKey, pp);
925 kss[i].entryInstanceOf(null, pKey
[all...]
H A DKeyStore_Impl3Test.java113 KeyStore.PrivateKeyEntry pKey = new KeyStore.PrivateKeyEntry(pk, certs);
126 kss[i].setEntry(aliases[1], pKey, pPath);
127 kss[i].setEntry(aliases[2], pKey, pPath);
H A DKSBuilder_ImplTest.java146 KeyStore.PrivateKeyEntry pKey = new KeyStore.PrivateKeyEntry(privKey,
160 ks.setEntry("aaa", pKey, pp[0]);
/external/valgrind/main/include/
H A Dpub_tool_wordfm.h147 /*OUT*/UWord* pKey, /*OUT*/UWord* pVal );
/external/chromium_org/third_party/icu/source/tools/toolutil/
H A Ducmstate.c206 char *line, char **pKey, char **pValue) {
240 *pKey=++s;
263 if(uprv_strcmp(*pKey, "uconv_class")==0) {
277 } else if(uprv_strcmp(*pKey, "mb_cur_max")==0) {
287 } else if(uprv_strcmp(*pKey, "mb_cur_min")==0) {
296 } else if(uprv_strcmp(*pKey, "icu:state")==0) {
317 } else if(uprv_strcmp(*pKey, "icu:base")==0) {
205 ucm_parseHeaderLine(UCMFile *ucm, char *line, char **pKey, char **pValue) argument
H A Ducm.h126 char *line, char **pKey, char **pValue);
/external/icu4c/tools/toolutil/
H A Ducmstate.c206 char *line, char **pKey, char **pValue) {
240 *pKey=++s;
263 if(uprv_strcmp(*pKey, "uconv_class")==0) {
277 } else if(uprv_strcmp(*pKey, "mb_cur_max")==0) {
287 } else if(uprv_strcmp(*pKey, "mb_cur_min")==0) {
296 } else if(uprv_strcmp(*pKey, "icu:state")==0) {
317 } else if(uprv_strcmp(*pKey, "icu:base")==0) {
205 ucm_parseHeaderLine(UCMFile *ucm, char *line, char **pKey, char **pValue) argument
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dorg.apache.commons.el_1.0.0.v201004212143.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 948 milliseconds

12