Searched refs:Key (Results 1 - 25 of 258) sorted by last modified time

1234567891011

/external/webkit/Source/WebKit/android/jni/
H A DWebViewCore.cpp4520 static jboolean Key(JNIEnv* env, jobject obj, jint nativeClass, jint keyCode, function in namespace:android
5053 (void*) Key },
/external/webkit/Source/WebKit2/Shared/
H A DWebPreferencesStore.cpp38 const String& KeyLower##Key() \
116 #define DEFINE_STRING_DEFAULTS(KeyUpper, KeyLower, TypeName, Type, DefaultValue) defaults.set(WebPreferencesKey::KeyLower##Key(), DefaultValue);
129 #define DEFINE_BOOL_DEFAULTS(KeyUpper, KeyLower, TypeName, Type, DefaultValue) defaults.set(WebPreferencesKey::KeyLower##Key(), DefaultValue);
142 #define DEFINE_UINT32_DEFAULTS(KeyUpper, KeyLower, TypeName, Type, DefaultValue) defaults.set(WebPreferencesKey::KeyLower##Key(), DefaultValue);
155 #define DEFINE_DOUBLE_DEFAULTS(KeyUpper, KeyLower, TypeName, Type, DefaultValue) defaults.set(WebPreferencesKey::KeyLower##Key(), DefaultValue);
H A DWebPreferencesStore.h144 #define DECLARE_KEY_GETTERS(KeyUpper, KeyLower, TypeName, Type, DefaultValue) const String& KeyLower##Key();
/external/webkit/Source/WebKit2/UIProcess/
H A DWebPreferences.cpp91 if (!m_store.set##TypeName##ValueForKey(WebPreferencesKey::KeyLower##Key(), value)) \
93 update##TypeName##ValueForKey(WebPreferencesKey::KeyLower##Key(), value); \
99 return m_store.get##TypeName##ValueForKey(WebPreferencesKey::KeyLower##Key()); \
/external/webkit/Source/WebKit2/UIProcess/cf/
H A DWebPreferencesCF.cpp102 set##TypeName##ValueIfInUserDefaults(m_identifier, WebPreferencesKey::KeyLower##Key(), m_store);
/external/webkit/Source/WebKit2/UIProcess/mac/
H A DWebPreferencesMac.mm89 set##TypeName##ValueIfInUserDefaults(m_identifier, WebPreferencesKey::KeyLower##Key(), m_store);
/external/webkit/Source/WebKit2/WebProcess/WebPage/
H A DWebPage.cpp1400 #define INITIALIZE_SETTINGS(KeyUpper, KeyLower, TypeName, Type, DefaultValue) settings->set##KeyUpper(store.get##TypeName##ValueForKey(WebPreferencesKey::KeyLower##Key()));
/external/webkit/Tools/Scripts/
H A Dparse-malloc-history95 # --------------- Key: 213813, 84 bytes ---------
100 ($byteCount) = ($line =~ /Key: (?:\d+), (\d+) bytes/);
/external/webkit/Tools/TestResultServer/model/
H A Ddatastorefile.py60 data_keys = db.ListProperty(db.Key)
63 new_data_keys = db.ListProperty(db.Key)
/external/webkit/Source/WebCore/platform/graphics/qt/
H A DGraphicsLayerQt.cpp271 QPixmapCache::Key key;
/external/webkit/Source/JavaScriptCore/runtime/
H A DStructure.h298 inline StructureTransitionTable::Hash::Key StructureTransitionTable::keyForWeakGCMapFinalizer(void*, Structure* structure)
300 return Hash::Key(structure->m_nameInPrevious.get(), structure->m_attributesInPrevious);
H A DStructureTransitionTable.h44 typedef std::pair<RefPtr<StringImpl>, unsigned> Key; typedef in struct:JSC::StructureTransitionTable::Hash
45 static unsigned hash(const Key& p)
50 static bool equal(const Key& a, const Key& b)
73 static void* finalizerContextFor(Hash::Key)
78 static inline Hash::Key keyForFinalizer(void* context, Structure* structure)
84 typedef WeakGCMap<Hash::Key, Structure, WeakGCMapFinalizerCallback, Hash, HashTraits> TransitionMap;
86 static Hash::Key keyForWeakGCMapFinalizer(void* context, Structure*);
/external/webkit/Source/JavaScriptCore/wtf/
H A DHashTable.h67 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits>
69 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits>
71 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits>
74 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits>
75 void addIterator(const HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>*,
76 HashTableConstIterator<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>*);
78 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits>
79 void removeIterator(HashTableConstIterator<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>*);
83 template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits, typename KeyTraits>
84 inline void addIterator(const HashTable<Key, Valu
283 translate(Value& location, const Key&, const Value& value) argument
[all...]
/external/v8/src/
H A Dhashmap.h153 // Key not found nothing to remove.
296 template<class Key, class Value, class AllocationPolicy>
299 STATIC_ASSERT(sizeof(Key*) == sizeof(void*)); // NOLINT
302 Key* first;
333 Iterator find(Key* key, bool insert = false) {
H A Dheap.cc6806 Key& key = keys_[index + i];
6822 Key& key = keys_[index];
6834 Key& key = keys_[index + i];
6835 Key& key2 = keys_[index + i - 1];
6841 Key& key = keys_[index];
H A Dheap.h2270 struct Key { struct in class:v8::internal::KeyedLookupCache
2275 Key keys_[kLength];
2295 Key& key = keys_[index];
2305 Key& key = keys_[index];
2336 struct Key { struct in class:v8::internal::DescriptorLookupCache
2341 Key keys_[kLength];
H A Djsregexp.h391 typedef uc16 Key; typedef in class:v8::internal::DispatchTable::Config
H A Dobjects-inl.h2057 template<typename Shape, typename Key>
2058 int HashTable<Shape, Key>::ComputeCapacity(int at_least_space_for) {
2068 template<typename Shape, typename Key>
2069 int HashTable<Shape, Key>::FindEntry(Key key) {
2075 template<typename Shape, typename Key>
2076 int HashTable<Shape, Key>::FindEntry(Isolate* isolate, Key key) {
2078 uint32_t entry = FirstProbe(HashTable<Shape, Key>::Hash(key), capacity);
2183 template <typename Shape, typename Key>
[all...]
H A Dobjects.cc3670 // Key was not already in the dictionary, so add the entry.
3704 // Key wasn't in dictionary. Deletion is a success.
3707 // Key was in the dictionary. Remove it.
9950 template<typename Shape, typename Key>
9951 void Dictionary<Shape, Key>::Print(FILE* out) {
9952 int capacity = HashTable<Shape, Key>::Capacity();
9954 Object* k = HashTable<Shape, Key>::KeyAt(i);
9955 if (HashTable<Shape, Key>::IsKey(k)) {
9971 template<typename Shape, typename Key>
9972 void Dictionary<Shape, Key>
[all...]
H A Dobjects.h2663 // The hash table class is parameterized with a Shape and a Key.
2668 // static bool IsMatch(Key key, Object* other);
2670 // static uint32_t Hash(Key key);
2672 // static uint32_t HashForObject(Key key, Object* object);
2674 // static inline Object* AsObject(Key key);
2685 template<typename Key>
2689 static uint32_t Hash(Key key) { return 0; }
2690 static uint32_t SeededHash(Key key, uint32_t seed) {
2694 static uint32_t HashForObject(Key key, Object* object) { return 0; }
2695 static uint32_t SeededHashForObject(Key ke
[all...]
H A Dpreparse-data.cc125 Key key = { is_ascii, literal_bytes };
135 Vector<Key> symbol = symbol_keys_.AddBlock(1, key);
H A Dpreparse-data.h186 struct Key { struct in class:v8::internal::CompleteParserRecorder
209 Key* string1 = reinterpret_cast<Key*>(a);
210 Key* string2 = reinterpret_cast<Key*>(b);
223 Collector<Key> symbol_keys_;
H A Dprofile-generator.cc498 const CodeMap::CodeTreeConfig::Key CodeMap::CodeTreeConfig::kNoKey = NULL;
H A Dprofile-generator.h261 typedef Address Key; typedef in struct:v8::internal::CodeMap::CodeTreeConfig
263 static const Key kNoKey;
265 static int Compare(const Key& a, const Key& b) {
H A Dscopeinfo.cc404 Key& key = keys_[index];
424 Key& key = keys_[index];
451 Key& key = keys_[index];

Completed in 639 milliseconds

1234567891011