| /external/chromium_org/third_party/sqlite/src/src/ |
| hash.c | 55 static unsigned int strHash(const char *z, int nKey){
57 assert( nKey>=0 );
58 while( nKey > 0 ){
60 nKey--;
128 unsigned int h = strHash(elem->pKey, elem->nKey) % new_size;
142 int nKey, /* Bytes in key (not counting zero terminator) */
157 if( elem->nKey==nKey && sqlite3StrNICmp(elem->pKey,pKey,nKey)==0 ){
200 ** that matches pKey,nKey. Return the data for this element if it i
[all...] |
| hash.h | 62 const char *pKey; int nKey; /* Key associated with this element */
69 void *sqlite3HashInsert(Hash*, const char *pKey, int nKey, void *pData);
70 void *sqlite3HashFind(const Hash*, const char *pKey, int nKey);
89 /* #define sqliteHashKeysize(E) ((E)->nKey) // NOT USED */
|
| attach.c | 159 int nKey;
171 nKey = sqlite3_value_bytes(argv[2]);
173 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey);
178 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey);
179 if( nKey>0 || sqlite3BtreeGetReserve(db->aDb[0].pBt)>0 ){
180 rc = sqlite3CodecAttach(db, db->nDb-1, zKey, nKey);
|
| vacuum.c | 172 int nKey;
174 sqlite3CodecGetKey(db, 0, (void**)&zKey, &nKey);
175 if( nKey ) db->nextPagesize = 0;
|
| btree.h | 158 int sqlite3BtreeInsert(BtCursor*, const void *pKey, i64 nKey,
|
| test_malloc.c | 752 int nKey = sizeof(int)*MALLOC_LOG_KEYINTS;
754 memset(aKey, 0, nKey);
755 if( (sizeof(void*)*nFrame)<nKey ){
756 nKey = nFrame*sizeof(void*);
758 memcpy(aKey, aFrame, nKey);
[all...] |
| btree.c | 477 if( p->isIncrblobHandle && (isClearTable || p->info.nKey==iRow) ){
562 ** Save the current cursor position in the variables BtCursor.nKey
575 rc = sqlite3BtreeKeySize(pCur, &pCur->nKey);
579 ** stores the integer key in pCur->nKey. In this case this value is
581 ** table, then malloc space for and store the pCur->nKey bytes of key
585 void *pKey = sqlite3Malloc( (int)pCur->nKey );
587 rc = sqlite3BtreeKey(pCur, 0, (int)pCur->nKey, pKey);
652 i64 nKey, /* Integer key for tables. Size of pKey for indices */
661 assert( nKey==(i64)(int)nKey );
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts1/ |
| ft_hash.h | 55 void *pKey; int nKey; /* Key associated with this element */
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);
104 #define HashKeysize(E) ((E)->nKey)
|
| ft_hash.c | 86 static int intHash(const void *pKey, int nKey){
87 return nKey ^ (nKey<<8) ^ (nKey>>8);
98 static int ptrHash(const void *pKey, int nKey){
112 static int strHash(const void *pKey, int nKey){
115 if( nKey<=0 ) nKey = (int) strlen(z);
116 while( nKey > 0 ){
118 nKey--
[all...] |
| fts1_hash.h | 55 void *pKey; int nKey; /* Key associated with this element */
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);
105 #define fts1HashKeysize(E) ((E)->nKey)
|
| fts1_hash.c | 92 static int strHash(const void *pKey, int nKey){
95 if( nKey<=0 ) nKey = (int) strlen(z);
96 while( nKey > 0 ){
98 nKey--;
110 static int binHash(const void *pKey, int nKey){
113 while( nKey-- > 0 ){
202 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
215 int nKey,
228 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
[all...] |
| /external/lzma/CPP/7zip/UI/Common/ |
| ArchiveCommandLine.cpp | 53 namespace NKey {
641 if (parser[NKey::kUpdate].ThereIs)
642 ParseUpdateCommandString(options, parser[NKey::kUpdate].PostStrings,
644 if (parser[NKey::kWorkingDir].ThereIs)
646 const UString &postString = parser[NKey::kWorkingDir].PostStrings[0];
652 options.SfxMode = parser[NKey::kSfx].ThereIs;
654 options.SfxModule = parser[NKey::kSfx].PostStrings[0];
656 if (parser[NKey::kVolume].ThereIs)
658 const UStringVector &sv = parser[NKey::kVolume].PostStrings;
671 if (parser[NKey::kProperty].ThereIs)
[all...] |
| /external/chromium_org/third_party/sqlite/src/ext/fts3/ |
| fts3_hash.c | 97 static int fts3StrHash(const void *pKey, int nKey){
100 if( nKey<=0 ) nKey = (int) strlen(z);
101 while( nKey > 0 ){
103 nKey--;
115 static int fts3BinHash(const void *pKey, int nKey){
118 while( nKey-- > 0 ){
209 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
223 int nKey,
236 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
[all...] |
| fts3_hash.h | 53 void *pKey; int nKey; /* Key associated with this element */
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);
105 #define fts3HashKeysize(E) ((E)->nKey)
|
| fts3_expr.c | 365 int nKey = pKey->n;
370 assert( nKey==4 );
373 for(nKey=5; zInput[nKey]>='0' && zInput[nKey]<='9'; nKey++){
374 nNear = nNear * 10 + (zInput[nKey] - '0');
383 cNext = zInput[nKey];
394 *pnConsumed = (int)((zInput - z) + nKey);
|
| /external/chromium_org/third_party/sqlite/src/ext/fts2/ |
| fts2_hash.h | 53 void *pKey; int nKey; /* Key associated with this element */
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);
103 #define fts2HashKeysize(E) ((E)->nKey)
|
| fts2_hash.c | 97 static int strHash(const void *pKey, int nKey){
100 if( nKey<=0 ) nKey = (int) strlen(z);
101 while( nKey > 0 ){
103 nKey--;
115 static int binHash(const void *pKey, int nKey){
118 while( nKey-- > 0 ){
207 int h = (*xHash)(elem->pKey, elem->nKey) & (new_size-1);
220 int nKey,
233 if( (*xCompare)(elem->pKey,elem->nKey,pKey,nKey)==0 ){
[all...] |
| /external/lzma/CPP/7zip/Bundles/LzmaCon/ |
| LzmaAlone.cpp | 47 namespace NKey {
189 if(parser[NKey::kHelp1].ThereIs || parser[NKey::kHelp2].ThereIs)
203 if(parser[NKey::kDict].ThereIs)
206 if (!GetNumber(parser[NKey::kDict].PostStrings[0], dicLog))
212 if (parser[NKey::kMatchFinder].ThereIs)
213 mf = parser[NKey::kMatchFinder].PostStrings[0];
218 if (parser[NKey::kMultiThread].ThereIs)
221 const UString &s = parser[NKey::kMultiThread].PostStrings[0];
253 bool stdInMode = parser[NKey::kStdIn].ThereIs;
[all...] |
| /external/chromium_org/third_party/boringssl/src/crypto/cipher/ |
| derive_key.c | 74 unsigned niv, nkey, addmd = 0; local
78 nkey = type->key_len;
81 assert(nkey <= EVP_MAX_KEY_LENGTH);
85 return nkey;
119 if (nkey) {
121 if (nkey == 0 || i == mds) {
127 nkey--;
144 if (nkey == 0 && niv == 0) {
|
| /external/openssl/crypto/evp/ |
| evp_key.c | 121 int niv,nkey,addmd=0; local
124 nkey=type->key_len;
126 OPENSSL_assert(nkey <= EVP_MAX_KEY_LENGTH);
129 if (data == NULL) return(nkey);
157 if (nkey)
161 if (nkey == 0) break;
165 nkey--;
181 if ((nkey == 0) && (niv == 0)) break;
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| ACBTree.m | 254 NSInteger i, nkey;
268 nkey = tsb.numkeys - 1;
289 self.keys[i] = tsb.keys[nkey];
315 self.keys[i] = tsb.keys[nkey];
409 NSInteger nkey;
413 nkey = t1.numkeys-1;
414 [t0 insinnode:t1.keys[nkey] value:t1.btNodes[nkey]];
415 [t1 delfrmnode:t1.keys[nkey]];
416 nkey--
[all...] |
| /external/ltrace/ |
| dict.c | 71 char nkey[clone_data->target->keys.elt_size]; local
73 memmove(nkey, key, sizeof(nkey));
74 else if (clone_data->clone_key(&nkey, key, clone_data->data) < 0)
84 clone_data->dtor_key(&nkey, clone_data->data);
88 if (dict_insert(clone_data->target, nkey, nvalue) < 0) {
|
| /external/wpa_supplicant_8/src/drivers/ |
| driver_ndis.c | 986 NDIS_802_11_KEY *nkey; local
1013 nkey = os_zalloc(len);
1014 if (nkey == NULL)
1017 nkey->Length = len;
1018 nkey->KeyIndex = key_idx;
1020 nkey->KeyIndex |= 1 << 31;
1022 nkey->KeyIndex |= 1 << 30;
1024 nkey->KeyIndex |= 1 << 29;
1025 nkey->KeyLength = key_len;
1026 os_memcpy(nkey->BSSID, bssid, ETH_ALEN)
[all...] |
| /external/chromium_org/chrome/common/net/ |
| x509_certificate_model_unittest.cc | 90 "notcrit\nKey ID: BC F7 30 D1 3C C0 F2 79 FA EF 9F C9 6C 5C 93 F3\n8A "
134 "notcrit\nKey ID: 59 BC D9 69 F7 B0 65 BB C8 34 C5 D2 C2 EF 17 78\nA6 "
140 "notcrit\nKey ID: 8A FC 14 1B 3D A3 59 67 A5 3B E1 73 92 A6 62 91\n7F "
160 "critical\nSigning\nNon-repudiation\nKey Encipherment\n"
|
| /hardware/qcom/media/mm-core/inc/ |
| OMX_Component.h | 248 OMX_U8 nKey[128];
288 OMX_U8 nKey [128];
|
