Lines Matching defs:e2
354 Entry<T> e2 = new Entry<>(v2, (T) value);
357 return e2;
544 Entry<?> e2 = cache[home]; // victim, if we find the real guy
545 if (e2 == null) {
548 // assume !classValue.match(e2), but do not assert, because of races
556 // relocate colliding entry e2 (from cache[home]) to first empty slot
563 cache[pos2 & mask] = ((entryDislocation(cache, pos2, e2) < PROBE_LIMIT)
564 ? e2 // put e2 here if it fits
646 Entry<?> e2 = cache[i2 & mask];
647 if (e2 == null) break; // End of non-null run.
648 if (!e2.isLive()) continue; // Doomed anyway.
649 int dis2 = entryDislocation(cache, i2, e2);
650 if (dis2 == 0) continue; // e2 already optimally placed
653 // e2 can replace entry at cache[home1]
655 // Put e2 exactly where he belongs.
658 replacement = e2;
662 replacement = e2;
704 Entry<?> e2 = placeInCache(cache, home, e, false);
705 if (e2 == null) return; // done
707 // try to move e2 somewhere else in his probe range
708 int dis2 = entryDislocation(cache, home, e2);
711 if (placeInCache(cache, i2 & mask, e2, true) == null) {
716 // Note: At this point, e2 is just dropped from the cache.
723 Entry<?> e2 = overwrittenEntry(cache[pos]);
724 if (gently && e2 != null) {
729 return e2;
739 private <T> Entry<T> overwrittenEntry(Entry<T> e2) {
740 if (e2 == null) cacheLoad += 1;
741 else if (e2.isLive()) return e2;