|
| 1 | +package dotty.tools.dotc |
| 2 | +package transform |
| 3 | + |
| 4 | +import ast.{Trees, tpd} |
| 5 | +import core._, core.Decorators._ |
| 6 | +import Contexts._, Trees._, Types._, StdNames._, Symbols._ |
| 7 | +import DenotTransformers._, TreeTransforms._, Phases.Phase |
| 8 | +import TypeErasure.ErasedValueType, ValueClasses._ |
| 9 | + |
| 10 | +/** This phase erases arrays of value classes to their runtime representation. |
| 11 | + * |
| 12 | + * For a value class V whose erased underlying type is U, an array of V has type |
| 13 | + * Array[V] before Erasure and Array[ErasedValueType(V, U)] afterwards. This phase |
| 14 | + * replaces this type by VCXArray where X is "U" if U is a primitive type and is "Object" |
| 15 | + * otherwise. |
| 16 | + */ |
| 17 | +class VCArrays extends MiniPhaseTransform with InfoTransformer { |
| 18 | + import tpd._ |
| 19 | + |
| 20 | + override def phaseName: String = "vcArrays" |
| 21 | + |
| 22 | + override def transformInfo(tp: Type, sym: Symbol)(implicit ctx: Context): Type = |
| 23 | + eraseVCArrays(tp) |
| 24 | + |
| 25 | + private def eraseVCArrays(tp: Type)(implicit ctx: Context): Type = tp match { |
| 26 | + case JavaArrayType(ErasedValueType(cls, _)) => |
| 27 | + defn.vcArrayOf(cls).typeRef |
| 28 | + case tp: MethodType => |
| 29 | + val paramTypes = tp.paramTypes.mapConserve(eraseVCArrays) |
| 30 | + val retType = eraseVCArrays(tp.resultType) |
| 31 | + tp.derivedMethodType(tp.paramNames, paramTypes, retType) |
| 32 | + case _ => |
| 33 | + tp |
| 34 | + } |
| 35 | + |
| 36 | + private def transformTypeOfTree(tree: Tree)(implicit ctx: Context): Tree = |
| 37 | + tree.withType(eraseVCArrays(tree.tpe)) |
| 38 | + |
| 39 | + override def transformValDef(tree: ValDef)(implicit ctx: Context, info: TransformerInfo): Tree = { |
| 40 | + val tpt1 = transformTypeOfTree(tree.tpt) |
| 41 | + cpy.ValDef(tree)(tpt = tpt1) |
| 42 | + } |
| 43 | + override def transformDefDef(tree: DefDef)(implicit ctx: Context, info: TransformerInfo): Tree = { |
| 44 | + val tpt1 = transformTypeOfTree(tree.tpt) |
| 45 | + cpy.DefDef(tree)(tpt = tpt1) |
| 46 | + } |
| 47 | + |
| 48 | + override def transformTypeApply(tree: TypeApply)(implicit ctx: Context, info: TransformerInfo): Tree = |
| 49 | + tree match { |
| 50 | + case TypeApply(sel @ Select(_, _), _) if (sel.symbol == defn.newRefArrayMethod) => |
| 51 | + // Preserve the semi-erased type of the array so that we can properly transform |
| 52 | + // it in transformApply |
| 53 | + tree |
| 54 | + case TypeApply(fun, args) => |
| 55 | + val tree1 = cpy.TypeApply(tree)(fun, args.map(transformTypeOfTree(_))) |
| 56 | + transformTypeOfTree(tree1) |
| 57 | + } |
| 58 | + |
| 59 | + override def transformSeqLiteral(tree: SeqLiteral)(implicit ctx: Context, info: TransformerInfo): Tree = |
| 60 | + tree.tpe match { |
| 61 | + // [arg1, arg2, ...] => new VCXArray([V.evt2u$(arg1), V.evt2u$(arg2), ...]) |
| 62 | + case JavaArrayType(ErasedValueType(cls, _)) => |
| 63 | + val evt2uMethod = ref(evt2u(cls)) |
| 64 | + val underlyingArray = JavaSeqLiteral(tree.elems.map(evt2uMethod.appliedTo(_))) |
| 65 | + val mod = cls.companionModule |
| 66 | + New(defn.vcArrayOf(cls).typeRef, List(underlyingArray, ref(mod))) |
| 67 | + case _ => |
| 68 | + tree |
| 69 | + } |
| 70 | + |
| 71 | + override def transformApply(tree: Apply)(implicit ctx: Context, info: TransformerInfo): Tree = { |
| 72 | + tree match { |
| 73 | + // newRefArray[ErasedValueType(V, U)[]](args) => New VCXArray(newXArray(args), V) |
| 74 | + case Apply(ta @ TypeApply(sel @ Select(_,_), List(targ)), args) |
| 75 | + if (sel.symbol == defn.newRefArrayMethod) => |
| 76 | + targ.tpe match { |
| 77 | + case JavaArrayType(ErasedValueType(cls, underlying)) => |
| 78 | + val mod = cls.companionModule |
| 79 | + New(defn.vcArrayOf(cls).typeRef, |
| 80 | + List(newArray(TypeTree(underlying), tree.pos).appliedToArgs(args), |
| 81 | + ref(mod))) |
| 82 | + case _ => |
| 83 | + tree |
| 84 | + } |
| 85 | + // array.[]update(idx, elem) => array.arr().[]update(idx, elem) |
| 86 | + case Apply(Select(array, nme.primitive.arrayUpdate), List(idx, elem)) => |
| 87 | + elem.tpe.widen match { |
| 88 | + case ErasedValueType(cls, _) => |
| 89 | + array.select(nme.ARR).appliedToNone |
| 90 | + .select(nme.primitive.arrayUpdate).appliedTo(idx, ref(evt2u(cls)).appliedTo(elem)) |
| 91 | + case _ => |
| 92 | + tree |
| 93 | + } |
| 94 | + // array.[]apply(idx) => array.arr().[]apply(idx) |
| 95 | + case Apply(Select(array, nme.primitive.arrayApply), List(idx)) => |
| 96 | + tree.tpe.widen match { |
| 97 | + case ErasedValueType(cls, _) => |
| 98 | + ref(u2evt(cls)).appliedTo(array.select(nme.ARR).appliedToNone |
| 99 | + .select(nme.primitive.arrayApply).appliedTo(idx)) |
| 100 | + case _ => |
| 101 | + tree |
| 102 | + } |
| 103 | + // array.[]length() => array.arr().[]length() |
| 104 | + case Apply(Select(array, nme.primitive.arrayLength), Nil) |
| 105 | + if (array.tpe <:< defn.VCArrayPrototypeType) => |
| 106 | + array.select(nme.ARR).appliedToNone |
| 107 | + .select(nme.primitive.arrayLength).appliedToNone |
| 108 | + case _ => |
| 109 | + tree |
| 110 | + } |
| 111 | + } |
| 112 | +} |
0 commit comments