Searched refs:key (Results 51 - 75 of 403) sorted by last modified time

1234567891011>>

/frameworks/native/include/utils/
H A DGenerationCache.h32 virtual void operator()(EntryKey& key, EntryValue& value) = 0;
38 key(e.key), value(e.value),
40 Entry(const EntryKey& key, const EntryValue& value) : argument
41 key(key), value(value) { }
43 EntryKey key; member in struct:android::Entry
69 bool contains(const K& key) const;
73 const V& get(const K& key);
74 bool put(const K& key, cons
150 get(const K& key) argument
163 put(const K& key, const V& value) argument
180 remove(const K& key) argument
[all...]
H A DKeyedVector.h68 const VALUE& valueFor(const KEY& key) const;
71 ssize_t indexOfKey(const KEY& key) const;
78 VALUE& editValueFor(const KEY& key);
85 ssize_t add(const KEY& key, const VALUE& item);
86 ssize_t replaceValueFor(const KEY& key, const VALUE& item);
93 ssize_t removeItem(const KEY& key);
111 * valueFor() is called with a key that doesn't exist.
118 const VALUE& valueFor(const KEY& key) const;
137 ssize_t KeyedVector<KEY,VALUE>::indexOfKey(const KEY& key) const {
138 return mVector.indexOf( key_value_pair_t<KEY,VALUE>(key) );
[all...]
H A DPropertyMap.h28 * Provides a mechanism for passing around string-based property key / value pairs
34 * key = value
37 * The '=' separates the key from the value.
38 * The key and value may not contain whitespace.
58 * Replaces the property with the same key if it is already present.
60 void addProperty(const String8& key, const String8& value);
62 /* Returns true if the property map contains the specified key. */
63 bool hasProperty(const String8& key) const;
66 * Returns true and sets outValue if the key was found and its value was parsed successfully.
69 bool tryGetProperty(const String8& key, String
[all...]
H A DTypeHelpers.h223 * a key/value pair
231 KEY key; member in struct:android::key_value_pair_t
234 key_value_pair_t(const key_value_pair_t& o) : key(o.key), value(o.value) { }
235 key_value_pair_t(const KEY& k, const VALUE& v) : key(k), value(v) { }
236 key_value_pair_t(const KEY& k) : key(k) { }
238 return strictly_order_type(key, o.key);
241 return key;
269 hash_t hash_type(const TKey& key);
[all...]
/frameworks/native/libs/utils/
H A DBasicHashtable.cpp110 const void* __restrict__ key) const {
121 if (compareBucketKey(bucket, key)) {
138 && compareBucketKey(bucket, key)) {
H A DBlobCache.cpp54 void BlobCache::set(const void* key, size_t keySize, const void* value, argument
57 ALOGV("set: not caching because the key is too large: %d (limit: %d)",
67 ALOGV("set: not caching because the combined key/value size is too "
80 sp<Blob> dummyKey(new Blob(key, keySize, false));
87 sp<Blob> keyBlob(new Blob(key, keySize, true));
96 ALOGV("set: not caching new key/value pair because the "
105 ALOGV("set: created new cache entry with %d byte key and %d byte value",
126 ALOGV("set: updated existing cache entry with %d byte key and %d byte "
133 size_t BlobCache::get(const void* key, size_t keySize, void* value, argument
136 ALOGV("get: not searching because the key i
346 CacheEntry(const sp<Blob>& key, const sp<Blob>& value) argument
[all...]
H A DPropertyMap.cpp50 void PropertyMap::addProperty(const String8& key, const String8& value) { argument
51 mProperties.add(key, value);
54 bool PropertyMap::hasProperty(const String8& key) const {
55 return mProperties.indexOfKey(key) >= 0;
58 bool PropertyMap::tryGetProperty(const String8& key, String8& outValue) const { argument
59 ssize_t index = mProperties.indexOfKey(key);
68 bool PropertyMap::tryGetProperty(const String8& key, bool& outValue) const { argument
70 if (!tryGetProperty(key, intValue)) {
78 bool PropertyMap::tryGetProperty(const String8& key, int32_t& outValue) const { argument
80 if (! tryGetProperty(key, stringValu
95 tryGetProperty(const String8& key, float& outValue) const argument
[all...]
/frameworks/native/libs/utils/tests/
H A DBasicHashtable_test.cpp123 const TKey& key, const TValue& value) {
124 return h.add(hash_type(key), key_value_pair_t<TKey, TValue>(key, value));
129 ssize_t index, const TKey& key) {
130 return h.find(index, hash_type(key), key);
135 const TKey& key) {
136 ssize_t index = find(h, -1, key);
145 static void getKeyValue(const TEntry& entry, int* key, int* value);
147 template <> void getKeyValue(const SimpleEntry& entry, int* key, in argument
122 add(BasicHashtable<TKey, key_value_pair_t<TKey, TValue> >& h, const TKey& key, const TValue& value) argument
128 find(BasicHashtable<TKey, key_value_pair_t<TKey, TValue> >& h, ssize_t index, const TKey& key) argument
134 remove(BasicHashtable<TKey, key_value_pair_t<TKey, TValue> >& h, const TKey& key) argument
152 getKeyValue(const ComplexEntry& entry, int* key, int* value) argument
166 int key, value; local
[all...]
H A DBlobCache_test.cpp117 char key[MAX_KEY_SIZE+1]; local
120 key[i] = 'a';
122 mBC->set(key, MAX_KEY_SIZE+1, "bbbb", 4);
123 ASSERT_EQ(size_t(0), mBC->get(key, MAX_KEY_SIZE+1, buf, 4));
153 char key[MAX_KEY_SIZE];
156 key[i] = 'a';
162 mBC->set(key, MAX_KEY_SIZE, buf, MAX_VALUE_SIZE);
163 ASSERT_EQ(size_t(0), mBC->get(key, MAX_KEY_SIZE, NULL, 0));
167 char key[MAX_KEY_SIZE];
170 key[
[all...]
/frameworks/native/opengl/include/EGL/
H A Deglext.h266 typedef void (*EGLSetBlobFuncANDROID) (const void* key, EGLsizeiANDROID keySize, const void* value, EGLsizeiANDROID valueSize);
267 typedef EGLsizeiANDROID (*EGLGetBlobFuncANDROID) (const void* key, EGLsizeiANDROID keySize, void* value, EGLsizeiANDROID valueSize);
/frameworks/native/opengl/libagl/
H A Degl.cpp90 // The TLS key has been created by another thread, but the value for
775 GLint key; member in struct:android::config_pair_t
785 GLint key; member in struct:android::config_management_t
1113 static int binarySearch(T const sortedArray[], int first, int last, EGLint key) argument
1117 if (key > sortedArray[mid].key) {
1119 } else if (key < sortedArray[mid].key) {
1501 config_defaults[j].key) < 0)
1507 config_defaults[j].key,
[all...]
/frameworks/native/opengl/libs/EGL/
H A Degl_cache.cpp61 static void setBlob(const void* key, EGLsizeiANDROID keySize, argument
63 egl_cache_t::get()->setBlob(key, keySize, value, valueSize);
66 static EGLsizeiANDROID getBlob(const void* key, EGLsizeiANDROID keySize, argument
68 return egl_cache_t::get()->getBlob(key, keySize, value, valueSize);
135 void egl_cache_t::setBlob(const void* key, EGLsizeiANDROID keySize, argument
146 bc->set(key, keySize, value, valueSize);
174 EGLsizeiANDROID egl_cache_t::getBlob(const void* key, EGLsizeiANDROID keySize, argument
185 return bc->get(key, keySize, value, valueSize);
H A Degl_cache.h52 // setBlob attempts to insert a new key/value blob pair into the cache.
55 void setBlob(const void* key, EGLsizeiANDROID keySize, const void* value,
58 // getBlob attempts to retrieve the value blob associated with a given key
61 EGLsizeiANDROID getBlob(const void* key, EGLsizeiANDROID keySize,
78 // key/value blob pairs. If the BlobCache object has not yet been created,
99 // mBlobCache is the cache in which the key/value blob pairs are stored. It
112 // pending. Each time a key/value pair is inserted into the cache via
H A Dtrace.cpp59 GLenumString key = {e, ""}; local
61 &key, g_enumnames,
/frameworks/native/services/sensorservice/
H A DBatteryService.cpp65 Info key(uid, handle);
66 ssize_t index = mActivations.indexOf(key);
68 index = mActivations.add(key);
/frameworks/compile/libbcc/include/bcc/ExecutionEngine/
H A DSymbolResolvers.h82 const SymbolMap key = { pName, NULL }; local
85 ::bsearch(&key, Subclass::SymbolArray,
/frameworks/compile/libbcc/include/bcc/Renderscript/
H A DRSInfo.h90 // Pragma is a key-value pair.
91 StringIndexTy key; member in struct:bcc::rsinfo::PragmaItem
/frameworks/compile/libbcc/lib/Renderscript/
H A DRSInfoExtractor.cpp205 // Pragma is actually a key-value pair. The value can be an empty string while
206 // the key cannot.
210 llvm::StringRef key = getStringFromOperand(node->getOperand(0)); local
212 if (key.empty()) {
213 ALOGW("%s contains pragma metadata with empty key (skip)!",
217 writeString(key, result->mStringPool, &cur_string_pool_offset),
219 } // key.empty()
H A DRSInfoReader.cpp73 const char *key = pInfo.getStringFromPool(pItem.key); local
76 if (key == NULL) {
77 ALOGE("Invalid string index %d for key in RS pragma list.", pItem.key);
86 pResult.push(std::make_pair(key, value));
H A DRSInfoWriter.cpp63 pResult.key = pInfo.getStringIdxInPool(pItem->first);
66 if (pResult.key == rsinfo::gInvalidStringIndex) {
67 ALOGE("RS pragma list contains invalid string '%s' for key.", pItem->first);
/frameworks/compile/libbcc/runtime/
H A DMakefile68 "$(foreach key,$(AvailableIn.$(fn)),$($(key).Dir))";)
74 @$(foreach key,$(PlatformKeys),\
75 printf " %s - from '%s'\n" $($(key).Name) $($(key).Path);\
76 printf " %s\n" "$($(key).Description)";\
77 printf " Configurations: %s\n\n" "$($(key).Configs)";)
197 $(foreach key,$(SubDirKeys),\
198 $(call PerPlatformConfigArchSubDir_template,$(key)))
229 $(foreach key,
[all...]
/frameworks/compile/libbcc/runtime/make/
H A Dlib_info.mk17 AvailableArchs := $(sort $(foreach key,$(SubDirKeys),\
18 $($(key).OnlyArchs)))
20 AvailableFunctions := $(sort $(foreach key,$(SubDirKeys),\
21 $(basename $($(key).ObjNames))))
24 $(foreach key,$(SubDirKeys),\
25 $(if $(call strneq,,$(strip $($(key).OnlyArchs) $($(key).OnlyConfigs))),,\
26 $(basename $($(key).ObjNames)))))
29 $(foreach key,$(SubDirKeys),\
30 $(if $(call strneq,,$($(key)
[all...]
H A Dlib_platforms.mk20 # Construct the variable key for this directory.
H A Dlib_util.mk5 # Function: GetCNAVar variable-name platform-key config arch
30 $(foreach key,$(AvailableIn.$(3)),\
31 $(if $(and $(call streq,Optimized,$($(key).Implementation)),\
32 $(call contains,$($(key).OnlyConfigs),$(1)),\
33 $(call contains,$($(key).OnlyArchs),$(2))),$(key),)))
35 $(foreach key,$(AvailableIn.$(3)),\
36 $(if $(and $(call streq,Optimized,$($(key).Implementation)),\
37 $(call contains,$($(key).OnlyConfigs),$(1))),$(key),)))
[all...]
H A Dsubdir.mk33 # Construct the variable key for this directory.

Completed in 2697 milliseconds

1234567891011>>