Searched refs:key (Results 26 - 43 of 43) sorted by last modified time

12

/system/core/libcutils/
H A Dmq.c230 static int pidHash(void* key) { argument
231 pid_t* pid = (pid_t*) key;
365 static bool peerProxyRemoveConnection(void* key, void* value, void* context) { argument
1017 // Add this proxy to the map. Make sure the key points to the stable memory
H A Dproperties.c34 int property_set(const char *key, const char *value) argument
36 return __system_property_set(key, value);
39 int property_get(const char *key, char *value, const char *default_value) argument
43 len = __system_property_get(key, value);
55 int property_list(void (*propfn)(const char *key, const char *value, void *cookie), argument
137 int property_get(const char *key, char *value, const char *default_value) argument
143 //ALOGV("PROPERTY GET [%s]\n", key);
155 if (strlen(key) >= PROPERTY_KEY_MAX) return -1;
160 strcpy(sendBuf+1, key);
198 // recvBuf[0], default_value, len, key, valu
204 property_set(const char *key, const char *value) argument
241 property_list(void (*propfn)(const char *key, const char *value, void *cookie), void *cookie) argument
260 property_get(const char *key, char *value, const char *default_value) argument
294 property_set(const char *key, const char *value) argument
324 property_list(void (*propfn)(const char *key, const char *value, void *cookie), void *cookie) argument
[all...]
H A Dstr_parms.c75 const char *key; member in struct:remove_ctxt
78 static bool remove_pair(void *key, void *value, void *context) argument
84 * - if key is not supplied, then we are removing all entries,
85 * so remove key and continue (i.e. return true)
86 * - if key is supplied and matches, then remove it and don't
88 * for key.
91 if (!ctxt->key) {
94 } else if (!strcmp(ctxt->key, key)) {
102 hashmapRemove(ctxt->str_parms->map, key);
108 str_parms_del(struct str_parms *str_parms, const char *key) argument
150 char *key; local
192 str_parms_add_str(struct str_parms *str_parms, const char *key, const char *value) argument
214 str_parms_add_int(struct str_parms *str_parms, const char *key, int value) argument
227 str_parms_add_float(struct str_parms *str_parms, const char *key, float value) argument
241 str_parms_get_str(struct str_parms *str_parms, const char *key, char *val, int len) argument
253 str_parms_get_int(struct str_parms *str_parms, const char *key, int *val) argument
269 str_parms_get_float(struct str_parms *str_parms, const char *key, float *val) argument
287 combine_strings(void *key, void *value, void *context) argument
321 dump_entry(void *key, void *value, void *context) argument
[all...]
/system/core/libmincrypt/
H A Drsa.c30 int RSA_e_f4_verify(const RSAPublicKey* key,
35 int RSA_e_3_verify(const RSAPublicKey *key,
40 int RSA_verify(const RSAPublicKey *key, argument
44 switch (key->exponent) {
46 return RSA_e_3_verify(key, signature, len, sha);
49 return RSA_e_f4_verify(key, signature, len, sha);
H A Drsa_e_3.c32 static void subM(const RSAPublicKey *key, uint32_t *a) { argument
35 for (i = 0; i < key->len; ++i) {
36 A += (uint64_t)a[i] - key->n[i];
43 static int geM(const RSAPublicKey *key, const uint32_t *a) { argument
45 for (i = key->len; i;) {
47 if (a[i] < key->n[i]) return 0;
48 if (a[i] > key->n[i]) return 1;
54 static void montMulAdd(const RSAPublicKey *key, argument
59 uint32_t d0 = (uint32_t)A * key->n0inv;
60 uint64_t B = (uint64_t)d0 * key
79 montMul(const RSAPublicKey *key, uint32_t* c, const uint32_t* a, const uint32_t* b) argument
95 modpow3(const RSAPublicKey *key, uint8_t* inout) argument
162 RSA_e_3_verify(const RSAPublicKey *key, const uint8_t *signature, const int len, const uint8_t *sha) argument
[all...]
H A Drsa_e_f4.c32 static void subM(const RSAPublicKey* key, argument
36 for (i = 0; i < key->len; ++i) {
37 A += (uint64_t)a[i] - key->n[i];
44 static int geM(const RSAPublicKey* key, argument
47 for (i = key->len; i;) {
49 if (a[i] < key->n[i]) return 0;
50 if (a[i] > key->n[i]) return 1;
56 static void montMulAdd(const RSAPublicKey* key, argument
61 uint32_t d0 = (uint32_t)A * key->n0inv;
62 uint64_t B = (uint64_t)d0 * key
81 montMul(const RSAPublicKey* key, uint32_t* c, const uint32_t* a, const uint32_t* b) argument
96 modpowF4(const RSAPublicKey* key, uint8_t* inout) argument
155 RSA_e_f4_verify(const RSAPublicKey* key, const uint8_t* signature, const int len, const uint8_t* sha) argument
[all...]
/system/core/libmincrypt/tools/
H A DDumpPublicKey.java35 * @param key to perform sanity checks on
36 * @return version number of key. Supported versions are:
37 * 1: 2048-bit key with e=3
38 * 2: 2048-bit key with e=65537
39 * @throws Exception if the key has the wrong size or public exponent
42 static int check(RSAPublicKey key) throws Exception { argument
43 BigInteger pubexp = key.getPublicExponent();
44 BigInteger modulus = key.getModulus();
65 * @param key to output
66 * @return a String representing this public key
70 print(RSAPublicKey key) argument
[all...]
/system/core/libpixelflinger/codeflinger/
H A DCodeCache.h36 virtual int compare_type(const AssemblyKeyBase& key) const = 0;
44 virtual int compare_type(const AssemblyKeyBase& key) const {
45 const T& rhs = static_cast<const AssemblyKey&>(key).mKey;
84 sp<Assembly> lookup(const AssemblyKeyBase& key) const;
86 int cache( const AssemblyKeyBase& key,
126 return lhs.key.mKey->compare_type(*(rhs.key.mKey));
/system/core/libpixelflinger/
H A Dscanline.cpp288 const AssemblyKey<needs_t>& key() const { return mKey; } function in class:android::ScanlineAssembly
383 const AssemblyKey<needs_t> key(c->state.needs);
384 sp<Assembly> assembly = gCodeCache.lookup(key);
402 err = gCodeCache.cache(a->key(), a);
/system/core/libpixelflinger/tests/codegen/
H A Dcodegen.cpp33 const AssemblyKey<needs_t>& key() const { return mKey; } function in class:ScanlineAssembly
/system/core/libpixelflinger/tinyutils/
H A DKeyedVector.h55 const VALUE& valueFor(const KEY& key) const;
58 ssize_t indexOfKey(const KEY& key) const;
64 VALUE& editValueFor(const KEY& key);
71 ssize_t add(const KEY& key, const VALUE& item);
72 ssize_t replaceValueFor(const KEY& key, const VALUE& item);
79 ssize_t removeItem(const KEY& key);
90 * valueFor() is called with a key that doesn't exist.
97 const VALUE& valueFor(const KEY& key) const;
111 ssize_t KeyedVector<KEY,VALUE>::indexOfKey(const KEY& key) const {
112 return mVector.indexOf( key_value_pair_t<KEY,VALUE>(key) );
133 editValueFor(const KEY& key) argument
145 add(const KEY& key, const VALUE& value) argument
150 replaceValueFor(const KEY& key, const VALUE& value) argument
166 removeItem(const KEY& key) argument
[all...]
H A DTypeHelpers.h206 * a key/value pair
211 KEY key; member in struct:android::key_value_pair_t
214 key_value_pair_t(const key_value_pair_t& o) : key(o.key), value(o.value) { }
215 key_value_pair_t(const KEY& k, const VALUE& v) : key(k), value(v) { }
216 key_value_pair_t(const KEY& k) : key(k) { }
218 return strictly_order_type(key, o.key);
/system/core/rootdir/etc/
H A Dinit.testmenu86 echo Got key -$c-
101 echo Got key -$c-
129 echo Got key -$c-
159 echo Got key -$c-
194 echo Got key -$c-
219 echo Got key -$c-
281 echo Got key -$c-
/system/core/toolbox/
H A Dgetprop.c9 static void record_prop(const char* key, const char* name, void* opaque) argument
13 snprintf(temp, sizeof temp, "[%s]: [%s]", key, name);
H A Dreadtty.c11 char key; member in struct:__anon485
26 char next_char(char key, char current) argument
31 if(key == map[i].key) {
38 return key;
41 char prev_char(char key, char current) argument
46 if(key == map[i].key) {
53 return key;
/system/extras/showslab/
H A Dshowslab.c243 * set_sort_func - return the slab_sort_func that matches the given key.
244 * On unrecognizable key, the call returns NULL.
246 static void * set_sort_func(char key) argument
248 switch (tolower(key)) {
/system/extras/tests/bionic/libc/common/
H A Dbench_pthread.c165 /* Used when creating the key */
176 pthread_key_t key; local
177 pthread_key_create(&key, key_destroy);
178 pthread_setspecific(key, (void*)(int)100);
182 BENCH(pthread_getspecific(key));
/system/media/camera/src/
H A Dcamera_metadata.c408 camera_metadata_buffer_entry_t key; local
409 key.tag = tag;
410 search_entry = bsearch(&key,

Completed in 2286 milliseconds

12