Lines Matching refs:entry
114 // hash could be used to check if the entry has cached layout available
283 void ParagraphCache::updateTo(ParagraphImpl* paragraph, const Entry* entry) {
286 paragraph->fRuns = entry->fValue->fRuns;
287 paragraph->fClusters = entry->fValue->fClusters;
288 paragraph->fClustersIndexFromCodeUnit = entry->fValue->fClustersIndexFromCodeUnit;
289 paragraph->fCodeUnitProperties = entry->fValue->fCodeUnitProperties;
290 paragraph->fWords = entry->fValue->fWords;
291 paragraph->fBidiRegions = entry->fValue->fBidiRegions;
292 paragraph->fHasLineBreaks = entry->fValue->fHasLineBreaks;
293 paragraph->fHasWhitespacesInside = entry->fValue->fHasWhitespacesInside;
294 paragraph->fTrailingSpaces = entry->fValue->fTrailingSpaces;
301 paragraph->hash() = entry->fValue->fKey.hash();
347 std::unique_ptr<Entry>* entry = fLRUCacheMap.find(key);
349 if (entry && *entry) {
350 if (auto value = (*entry)->fValue.get()) {
400 std::unique_ptr<Entry>* entry = fLRUCacheMap.find(key);
401 if (!entry || !*entry) {
404 ParagraphCacheValue* value = (*entry)->fValue.get();
455 std::unique_ptr<Entry>* entry = fLRUCacheMap.find(key);
457 if (!entry) {
471 updateTo(paragraph, entry->get());
474 fLastCachedValue = entry->get()->fValue.get();
492 std::unique_ptr<Entry>* entry = fLRUCacheMap.find(key);
493 if (!entry) {
530 std::unique_ptr<Entry>* entry = fLRUCacheMap.find(key);
531 if (!entry) {