Searched refs:fHash (Results 1 – 3 of 3) sorted by relevance
41 return a.fHash == b.fHash &&48 if (a.fHash < b.fHash) {50 } else if (a.fHash > b.fHash) {72 fHash = hash; in computeHash()77 uint32_t fHash; // computed from the other fields variable150 mutable Entry* fHash[kHashCount]; variable
26 bzero(fHash, sizeof(fHash)); in SkTextureCache()55 bzero(fHash, sizeof(fHash)); in deleteAllCaches()112 Entry* entry = fHash[hashIndex]; in find()126 fHash[hashIndex] = entry; in find()154 fHash[key.getHashIndex()] = entry; in lock()247 if (entry == fHash[index]) { in purgeIfNecessary()248 fHash[index] = NULL; in purgeIfNecessary()353 if (fHash[i]) { in validate()354 size_t index = fHash[i]->getKey().getHashIndex(); in validate()356 index = fSorted.find(fHash[i]); in validate()
428 SkGlyphCache* fHash[HASH_COUNT]; member in SkGlyphCache_Globals444 memset(rec->fHash, 0, sizeof(rec->fHash)); in create_globals()493 SkGlyphCache** hash = globals.fHash; in VisitCache()562 SkASSERT(globals.fHash[index] != cache); in AttachCache()563 globals.fHash[index] = cache; in AttachCache()638 if (cache == globals->fHash[index]) { in InternalFreeCache()639 globals->fHash[index] = NULL; in InternalFreeCache()