HomeSort by relevance Sort by last modified time
    Searched refs:pKey (Results 1 - 25 of 128) sorted by null

1 2 3 4 5 6

  /frameworks/compile/mclinker/include/mcld/ADT/
HashTable.h 71 entry_type* insert(const key_type& pKey, bool& pExist);
74 size_type erase(const key_type& pKey);
77 /// find - finds an element with key pKey
79 iterator find(const key_type& pKey);
81 /// find - finds an element with key pKey, constant version
83 const_iterator find(const key_type& pKey) const;
85 size_type count(const key_type& pKey) const;
105 chain_iterator begin(const key_type& pKey);
106 chain_iterator end(const key_type& pKey);
107 const_chain_iterator begin(const key_type& pKey) const
    [all...]
StringHash.h 30 uint32_t operator()(const llvm::StringRef pKey) const {
42 uint32_t operator()(const llvm::StringRef pKey) const {
47 for (unsigned int i = 0; i < pKey.size(); ++i) {
48 hash_val = hash_val * a + pKey[i];
61 uint32_t operator()(const llvm::StringRef pKey) const {
64 for (unsigned int i = 0; i < pKey.size(); ++i) {
65 hash_val ^= ((hash_val << 5) + pKey[i] + (hash_val >> 2));
77 uint32_t operator()(const llvm::StringRef pKey) const {
88 for (unsigned int i = 0; i < pKey.size(); ++i) {
89 hash_val = (hash_val << OneEighth) + pKey[i]
    [all...]
HashEntryFactory.h 25 entry_type* produce(const key_type& pKey) {
26 return HashEntryTy::Create(pKey);
HashEntry.h 44 explicit HashEntry(const KeyType& pKey);
58 bool compare(const key_type& pKey);
76 HashEntryTy* produce(const key_type& pKey);
HashBase.h 100 unsigned int lookUpBucketFor(const key_type& pKey);
102 /// findKey - finds an element with key pKey
104 int findKey(const key_type& pKey) const;
StringEntry.h 53 explicit StringEntry(const key_type& pKey);
96 explicit StringEntry(const key_type& pKey);
119 StringEntry<DataType>* produce(const key_type& pKey);
HashIterator.h 31 ChainIteratorBase(HashTableImplTy* pTable, const key_type& pKey)
33 m_HashValue = pTable->hash()(pKey);
41 if (bucket.Entry->compare(pKey)) {
271 const typename IteratorBase::key_type& pKey,
273 : IteratorBase(pTable, pKey) {}
  /frameworks/compile/mclinker/include/mcld/Support/
UniqueGCFactory.h 40 DataType* find(const KeyType& pKey) {
41 typename KeyMap::iterator dataIter = f_KeyMap.find(pKey);
47 const DataType* find(const KeyType& pKey) const {
48 typename KeyMap::const_iterator dataIter = f_KeyMap.find(pKey);
54 DataType* produce(const KeyType& pKey, bool& pExist) {
55 typename KeyMap::iterator dataIter = f_KeyMap.find(pKey);
62 f_KeyMap.insert(std::make_pair(pKey, data));
67 DataType* produce(const KeyType& pKey, const DataType& pValue, bool& pExist) {
68 typename KeyMap::iterator dataIter = f_KeyMap.find(pKey);
75 f_KeyMap.insert(std::make_pair(pKey, data))
    [all...]
  /frameworks/compile/mclinker/include/mcld/Target/
KeyEntryMap.h 55 /// lookUp - look up the entry mapping to pKey
56 const EntryType* lookUp(const KeyType& pKey) const;
57 EntryType* lookUp(const KeyType& pKey);
59 /// lookUpFirstEntry - look up the first entry mapping to pKey
60 const EntryType* lookUpFirstEntry(const KeyType& pKey) const;
61 EntryType* lookUpFirstEntry(const KeyType& pKey);
63 /// lookUpSecondEntry - look up the second entry mapping to pKey
64 const EntryType* lookUpSecondEntry(const KeyType& pKey) const;
65 EntryType* lookUpSecondEntry(const KeyType& pKey);
67 void record(const KeyType& pKey, EntryType& pEntry)
    [all...]
GNULDBackend.h 496 size_t operator()(const LDSymbol* pKey) const {
497 return (unsigned((uintptr_t)pKey) >> 4) ^
498 (unsigned((uintptr_t)pKey) >> 9);
  /frameworks/compile/mclinker/include/mcld/LD/
SectionSymbolSet.h 56 size_t operator()(const LDSection* pKey) const {
57 return (unsigned((uintptr_t)pKey) >> 4) ^
58 (unsigned((uintptr_t)pKey) >> 9);
Archive.h 58 size_t operator()(uint32_t pKey) const {
59 pKey ^= pKey >> 16;
60 pKey *= 0x85ebca6b;
61 pKey ^= pKey >> 13;
62 pKey *= 0xc2b2ae35;
63 pKey ^= pKey >> 16;
64 return pKey;
    [all...]
ResolveInfo.h 79 static ResolveInfo* Create(const key_type& pKey);
192 bool compare(const key_type& pKey);
  /external/pdfium/core/src/fxcrt/
fx_basic_maps.cpp 450 _CompactString* pKey = (_CompactString*)m_Buffer.GetAt(i);
451 if (pKey->m_CompactLen != 0xfe) {
463 _CompactString* pKey = (_CompactString*)m_Buffer.GetAt(index);
464 rKey = _CompactStringGet(pKey);
465 rValue = *(void**)(pKey + 1);
469 pKey = (_CompactString*)m_Buffer.GetAt(index);
470 if (pKey->m_CompactLen != 0xfe) {
484 _CompactString* pKey = (_CompactString*)m_Buffer.GetAt(index);
485 FX_LPVOID rValue = *(void**)(pKey + 1);
489 pKey = (_CompactString*)m_Buffer.GetAt(index)
    [all...]
  /frameworks/wilhelm/src/itf/
IMetadataExtraction.c 72 SLuint32 index, SLuint32 keySize, SLMetadataInfo *pKey)
76 if (NULL == pKey) {
83 index, keySize, pKey);
147 SLuint32 keySize, const void *pKey, SLuint32 keyEncoding,
152 if (NULL == pKey || NULL == pValueLangCountry || (filterMask & ~(SL_METADATA_FILTER_KEY |
159 thiz->mKey = pKey;
  /frameworks/compile/mclinker/lib/LD/
ResolveInfo.cpp 213 bool ResolveInfo::compare(const ResolveInfo::key_type& pKey) {
215 if (length != pKey.size())
217 return (std::memcmp(m_Name, pKey.data(), length) == 0);
236 ResolveInfo* ResolveInfo::Create(const ResolveInfo::key_type& pKey) {
238 static_cast<ResolveInfo*>(malloc(sizeof(ResolveInfo) + pKey.size() + 1));
243 std::memcpy(info->m_Name, pKey.data(), pKey.size());
244 info->m_Name[pKey.size()] = '\0';
246 info->m_BitField |= (pKey.size() << ResolveInfo::NAME_LENGTH_OFFSET);
  /frameworks/compile/mclinker/lib/ADT/
StringEntry.cpp 19 StringEntry<llvm::StringRef>::StringEntry(const StringEntry::key_type& pKey) {
  /frameworks/compile/mclinker/unittests/
HashTableTest.cpp 47 size_t operator()(const int* pKey) const {
48 return (unsigned((uintptr_t)pKey) >> 4) ^ (unsigned((uintptr_t)pKey) >> 9);
53 size_t operator()(int pKey) const { return pKey; }
57 size_t operator()(int pKey) const { return pKey % 3; }
283 size_t operator()(int pKey) const { return 10; }
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
locationapi.h 53 STDMETHOD_(HRESULT,GetValue)(THIS_ REFPROPERTYKEY pKey,PROPVARIANT *pValue) PURE;
63 #define ILocationReport_GetValue(This,pKey,pValue) (This)->lpVtbl->GetValue(This,pKey,pValue)
80 STDMETHOD_(HRESULT,GetValue)(THIS_ REFPROPERTYKEY pKey,PROPVARIANT *pValue) PURE;
99 #define ICivicAddressReport_GetValue(This,pKey,pValue) (This)->lpVtbl->GetValue(This,pKey,pValue)
  /external/apache-harmony/security/src/test/impl/java/org/apache/harmony/security/tests/java/security/
KeyStore_Impl1Test.java 465 KeyStore.PrivateKeyEntry pKey = new KeyStore.PrivateKeyEntry(privKey,
477 kss[i].setEntry(aliases[j], pKey, pPath);
490 Key key = pKey.getPrivateKey();
535 kss[i].setEntry("ZZZ", pKey, pPath);
    [all...]
KeyStore_Impl3Test.java 113 KeyStore.PrivateKeyEntry pKey = new KeyStore.PrivateKeyEntry(pk, certs);
126 kss[i].setEntry(aliases[1], pKey, pPath);
127 kss[i].setEntry(aliases[2], pKey, pPath);
  /frameworks/wilhelm/src/android/
AudioPlayer_to_android.h 92 * input pointers != NULL (pItemCount, pKeySize, pKey, pValueSize, pValue)
104 SLuint32 index, SLuint32 size, SLMetadataInfo *pKey);
  /external/valgrind/include/
pub_tool_wordfm.h 145 /*OUT*/UWord* pKey, /*OUT*/UWord* pVal );
  /external/icu/icu4c/source/tools/toolutil/
ucmstate.c 206 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) {
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.apache.commons.el_1.0.0.v201004212143.jar 

Completed in 460 milliseconds

1 2 3 4 5 6