summaryrefslogtreecommitdiff
path: root/src/reflect/scala/reflect/runtime/TwoWayCache.scala
blob: 6c1ca5b571cd14e61a91c9bf7f947b746f61590c (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
package scala
package reflect
package runtime

import scala.collection.mutable.WeakHashMap
import java.lang.ref.WeakReference

/** A cache that maintains a bijection between Java reflection type `J`
 *  and Scala reflection type `S`.
 *
 *  The cache is two-way weak (i.e. is powered by weak references),
 *  so that neither Java artifacts prevent Scala artifacts from being garbage collected,
 *  nor the other way around.
 */
private[runtime] class TwoWayCache[J, S] {

  private val toScalaMap = new WeakHashMap[J, WeakReference[S]]
  private val toJavaMap = new WeakHashMap[S, WeakReference[J]]

  def enter(j: J, s: S) = synchronized {
    // debugInfo("cached: "+j+"/"+s)
    toScalaMap(j) = new WeakReference(s)
    toJavaMap(s) = new WeakReference(j)
  }

  private object SomeRef {
    def unapply[T](optRef: Option[WeakReference[T]]): Option[T] =
      if (optRef.nonEmpty) {
        Option(optRef.get.get)
      } else None
  }

  def toScala(key: J)(body: => S): S = synchronized {
    toScalaMap get key match {
      case SomeRef(v) =>
        v
      case _ =>
        val result = body
        enter(key, result)
        result
    }
  }

  def toJava(key: S)(body: => J): J = synchronized {
    toJavaMap get key match {
      case SomeRef(v) =>
        v
      case _ =>
        val result = body
        enter(result, key)
        result
    }
  }
}