/external/skia/include/gpu/ |
H A D | GrKey.h | 17 explicit GrKey(Hash hash) : fHash(hash) {} 19 intptr_t getHash() const { return fHash; } 22 return fHash < rh.fHash || (fHash == rh.fHash && this->lt(rh)); 25 return fHash == rh.fHash && this->eq(rh); 33 const Hash fHash; member in class:GrKey
|
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrMurmur3HashKey.h | 29 fHash = 0; 39 fHash = SkChecksum::Murmur3(fData, KEY_SIZE_IN_BYTES); 46 if (fHash != other.fHash) { 55 return fHash; 64 uint32_t fHash; member in class:GrMurmur3HashKey
|
H A D | GrFontScaler.cpp | 18 GrFontDescKey::GrFontDescKey(const SkDescriptor& desc) : fHash(desc.getChecksum()) {
|
/external/chromium_org/third_party/skia/include/gpu/ |
H A D | GrFontScaler.h | 31 Hash getHash() const { return fHash; } 34 return fHash < rh.fHash || (fHash == rh.fHash && this->lt(rh)); 37 return fHash == rh.fHash && this->eq(rh); 50 const Hash fHash; member in class:GrFontDescKey
|
H A D | GrBinHashKey.h | 30 fHash = 0; 54 fHash = hash; 59 if (fHash != key.fHash) { 84 return fHash; 93 uint32_t fHash; member in class:GrBinHashKey
|
/external/skia/src/gpu/ |
H A D | GrBinHashKey.h | 30 fHash = 0; 54 fHash = hash; 59 if (fHash != key.fHash) { 84 return fHash; 93 uint32_t fHash; member in class:GrBinHashKey
|
H A D | GrTMultiMap.h | 35 SkASSERT(fHash.count() == 0); 39 ValueList* list = fHash.find(key); 50 fHash.add(SkNEW_ARGS(ValueList, (value))); 57 ValueList* list = fHash.find(key); 76 fHash.remove(key); 84 ValueList* list = fHash.find(key); 93 ValueList* list = fHash.find(key); 106 SkTDynamicHash<ValueList, Key> fHash; member in class:GrTMultiMap
|
H A D | GrTHashTable.h | 58 void clearHash() { sk_bzero(fHash, sizeof(fHash)); } 77 mutable T* fHash[kHashCount]; member in class:GrTHashTable 127 T* elem = fHash[hashIndex]; 148 fHash[hashIndex] = fSorted[index]; 167 fHash[hash2Index(key.getHash())] = elem; 174 if (fHash[index] == elem) { 175 fHash[index] = NULL;
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTMultiMap.h | 35 SkASSERT(fHash.count() == 0); 39 ValueList* list = fHash.find(key); 50 fHash.add(SkNEW_ARGS(ValueList, (value))); 57 ValueList* list = fHash.find(key); 76 fHash.remove(key); 84 ValueList* list = fHash.find(key); 93 ValueList* list = fHash.find(key); 106 SkTDynamicHash<ValueList, Key> fHash; member in class:SkTMultiMap
|
H A D | SkTDynamicHash.h | 35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { 40 SkASSERT(fCurrentIndex <= fHash->fCapacity); 41 return fCurrentIndex == fHash->fCapacity; 54 T* current() const { return fHash->fArray[fCurrentIndex]; } 56 SkTDynamicHash* fHash; member in class:SkTDynamicHash::Iter 62 explicit ConstIter(const SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { 67 SkASSERT(fCurrentIndex <= fHash->fCapacity); 68 return fCurrentIndex == fHash->fCapacity; 81 const T* current() const { return fHash->fArray[fCurrentIndex]; } 83 const SkTDynamicHash* fHash; member in class:SkTDynamicHash::ConstIter [all...] |
H A D | SkResourceCache.h | 37 uint32_t hash() const { return fHash; } 53 uint32_t fHash; member in struct:SkResourceCache::Key 210 Hash* fHash; member in class:SkResourceCache
|
H A D | SkPictureFlat.h | 386 SkASSERT(fHash.count() == fIndexedData.count()); 387 return fHash.count(); 429 const SkFlatData* found = fHash.find(*toReplace); 442 // findAndReturnMutableFlat already called fHash.add(), so we just clean up the old entry. 443 fHash.remove(*found); 510 SkFlatData* candidate = fHash.find(scratch); 516 fHash.add(detached); 561 // All SkFlatData* stored in fIndexedData and fHash are owned by the controller. 570 SkTDynamicHash<SkFlatData, SkFlatData, SkFlatData::HashTraits> fHash; member in class:SkFlatDictionary
|
H A D | SkResourceCache.cpp | 26 // 2 is fCount32 and fHash 29 fHash = SkChecksum::Murmur3(this->as32() + 2, (fCount32 - 2) << 2); 43 fHash = new Hash; 185 delete fHash; 191 Rec* rec = fHash->find(key); 207 Rec* existing = fHash->find(rec->getKey()); 214 fHash->add(rec); 225 fHash->remove(rec->getKey());
|
/external/skia/src/core/ |
H A D | SkTDynamicHash.h | 35 explicit Iter(SkTDynamicHash* hash) : fHash(hash), fCurrentIndex(-1) { 40 SkASSERT(fCurrentIndex <= fHash->fCapacity); 41 return fCurrentIndex == fHash->fCapacity; 54 T* current() const { return fHash->fArray[fCurrentIndex]; } 56 SkTDynamicHash* fHash; member in class:SkTDynamicHash::Iter
|
H A D | SkScaledImageCache.cpp | 67 fHash = compute_hash(&fGenID, 7); 85 const uint32_t* a = &fHash; 86 const uint32_t* b = &other.fHash; 95 uint32_t fHash; member in struct:SkScaledImageCache::Key 119 static uint32_t Hash(const Key& key) { return key.fHash; } 164 fHash = new Hash; 166 fHash = NULL; 313 delete fHash; 335 Rec* rec = fHash->find(key); 424 SkASSERT(fHash); [all...] |
H A D | SkPictureFlat.h | 383 SkASSERT(fHash.count() == fIndexedData.count()); 384 return fHash.count(); 426 const SkFlatData* found = fHash.find(*toReplace); 439 // findAndReturnMutableFlat already called fHash.add(), so we just clean up the old entry. 440 fHash.remove(*found); 507 SkFlatData* candidate = fHash.find(scratch); 513 fHash.add(detached); 558 // All SkFlatData* stored in fIndexedData and fHash are owned by the controller. 567 SkTDynamicHash<SkFlatData, SkFlatData, SkFlatData::HashTraits> fHash; member in class:SkFlatDictionary
|
H A D | SkScaledImageCache.h | 182 Hash* fHash; member in class:SkScaledImageCache
|
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | uspoof_conf.h | 74 UHashtable *fHash; // Key: UnicodeString Value: SPUString member in class:SPUStringPool
|
H A D | tznames_impl.cpp | 381 fHash = NULL; 391 fHash = uhash_open(uhash_hashUChars /* keyHash */, 401 if (fHash != NULL) { 402 uhash_close(fHash); 403 fHash = NULL; 421 pooledString = static_cast<UChar *>(uhash_get(fHash, s)); 446 uhash_put(fHash, destString, destString, &status); 462 pooledString = static_cast<UChar *>(uhash_get(fHash, s)); 465 uhash_put(fHash, ncs, ncs, &status); 485 uhash_close(fHash); [all...] |
H A D | uspoof_conf.cpp | 73 SPUStringPool::SPUStringPool(UErrorCode &status) : fVec(NULL), fHash(NULL) { 75 fHash = uhash_open(uhash_hashUnicodeString, // key hash function 89 uhash_close(fHash); 130 SPUString *hashedString = static_cast<SPUString *>(uhash_get(fHash, src)); 135 uhash_put(fHash, src, hashedString, &status);
|
H A D | tznames_impl.h | 64 UHashtable *fHash; member in class:ZNStringPool
|
/external/icu/icu4c/source/i18n/ |
H A D | uspoof_conf.h | 74 UHashtable *fHash; // Key: UnicodeString Value: SPUString member in class:SPUStringPool
|
H A D | tznames_impl.cpp | 381 fHash = NULL; 391 fHash = uhash_open(uhash_hashUChars /* keyHash */, 401 if (fHash != NULL) { 402 uhash_close(fHash); 403 fHash = NULL; 421 pooledString = static_cast<UChar *>(uhash_get(fHash, s)); 446 uhash_put(fHash, destString, destString, &status); 462 pooledString = static_cast<UChar *>(uhash_get(fHash, s)); 465 uhash_put(fHash, ncs, ncs, &status); 485 uhash_close(fHash); [all...] |
H A D | uspoof_conf.cpp | 73 SPUStringPool::SPUStringPool(UErrorCode &status) : fVec(NULL), fHash(NULL) { 75 fHash = uhash_open(uhash_hashUnicodeString, // key hash function 89 uhash_close(fHash); 130 SPUString *hashedString = static_cast<SPUString *>(uhash_get(fHash, src)); 135 uhash_put(fHash, src, hashedString, &status);
|
H A D | tznames_impl.h | 64 UHashtable *fHash; member in class:ZNStringPool
|