swift-mirror/lib/IRGen/GenPoly.cpp

//===--- GenPoly.cpp - Swift IR Generation for Polymorphism ---------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2015 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See http://swift.org/LICENSE.txt for license information
// See http://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
//
//  This file implements IR generation for polymorphic operations in Swift.
//
//===----------------------------------------------------------------------===//

#include "swift/AST/ASTContext.h"
#include "swift/AST/Types.h"
#include "swift/AST/Decl.h"
#include "swift/SIL/SILInstruction.h"
#include "swift/SIL/SILModule.h"
#include "swift/SIL/SILType.h"
#include "llvm/IR/DerivedTypes.h"

#include "ASTVisitor.h"
#include "Explosion.h"
#include "IRGenFunction.h"
#include "IRGenModule.h"
#include "LoadableTypeInfo.h"
#include "TypeVisitor.h"
#include "GenTuple.h"
#include "GenPoly.h"

using namespace swift;
using namespace irgen;

/// Ways in which we can test two types differ by abstraction.
enum class AbstractionDifference : bool {
  Memory,
  Explosion
};

/// Answer the differs-by-abstraction question for the given
/// function types.  See the comment below.
bool irgen::differsByAbstractionAsFunction(IRGenModule &IGM,
                                           CanAnyFunctionType origTy,
                                           CanAnyFunctionType substTy,
                                           ExplosionKind explosionLevel,
                                           unsigned uncurryLevel) {
  assert(origTy->isCanonical());
  assert(substTy->isCanonical());

  // Note that our type-system does not allow types to differ by
  // polymorphism.

  while (true) {
    // Arguments will be exploded.
    if (differsByAbstractionInExplosion(IGM, CanType(origTy->getInput()),
                                        CanType(substTy->getInput()),
                                        explosionLevel))
      return true;

    // Stop processing things as arguments if we're out of uncurryings.
    if (uncurryLevel == 0) break;

    uncurryLevel--;
    origTy = cast<AnyFunctionType>(CanType(origTy->getResult()));
    substTy = cast<AnyFunctionType>(CanType(substTy->getResult()));

    // Fast path.
    if (origTy == substTy) return false;
  }

  // For the result, consider whether it will be passed in memory or
  // exploded.
  CanType origResult = CanType(origTy->getResult());
  CanType substResult = CanType(substTy->getResult());
  if (origResult == substResult) return false;

  auto requiresIndirectResult = [&](CanType type) {
    return IGM.requiresIndirectResult(SILType::getPrimitiveObjectType(type),
                                      explosionLevel);
  };

  // If the abstract type isn't passed indirectly, the substituted
  // type won't be, either.
  if (!requiresIndirectResult(origResult)) {
    assert(!requiresIndirectResult(substResult));
    // In this case, we must consider whether the exploded difference
    // will matter.
    return differsByAbstractionInExplosion(IGM, origResult, substResult,
                                           explosionLevel);
  }

  // Otherwise, if the substituted type isn't passed indirectly,
  // we've got a mismatch.
  if (!requiresIndirectResult(substResult))
    return true;

  // Otherwise, we're passing indirectly, so use memory rules.
  return differsByAbstractionInMemory(IGM, origResult, substResult);
}

/// If the given type is actually returned indirectly according to the
/// ABI, is that semantically equivalent to an @out parameter?
static bool isReturnedOwned(IRGenModule &IGM, SILResultInfo result) {
  switch (result.getConvention()) {
  case ResultConvention::Owned: return true;
  case ResultConvention::Autoreleased: return false;
  case ResultConvention::Unowned:
    return result.getSILType().isTrivial(*IGM.SILMod);
  }
  llvm_unreachable("bad result convention");
}

static bool differsByAbstractionAsFunction(IRGenModule &IGM,
                                           CanSILFunctionType origTy,
                                           CanSILFunctionType substTy,
                                           ExplosionKind explosionLevel) {
  if (origTy->hasIndirectResult()) {
    SILType substResultType = substTy->getSemanticResultSILType();
    if (!substTy->hasIndirectResult()) {
      if (!IGM.requiresIndirectResult(substResultType, explosionLevel))
        return true;
      if (!isReturnedOwned(IGM, substTy->getResult()))
        return true;
    }
    if (differsByAbstractionInMemory(IGM, origTy->getIndirectResult().getType(),
                                     substResultType.getSwiftRValueType()))
      return true;
  } else {
    assert(!substTy->hasIndirectResult());
    if (differsByAbstractionInExplosion(IGM, origTy->getResult().getType(),
                                        substTy->getResult().getType(),
                                        explosionLevel))
      return true;
  }

  auto origParams = origTy->getParametersWithoutIndirectResult();
  auto substParams = substTy->getParametersWithoutIndirectResult();
  if (origParams.size() != substParams.size())
    return true;
  for (unsigned i : indices(origParams)) {
    auto origParam = origParams[i];
    auto substParam = origParams[i];

    // FIXME: we might reasonably decide under the ABI to pass
    // something indirectly despite the formal SIL convention.
    if (origParam.getConvention() != substParam.getConvention())
      return true;
    if (origParam.isIndirect()) {
      if (differsByAbstractionInMemory(IGM, origParam.getType(),
                                       substParam.getType()))
        return true;
    } else {
      if (differsByAbstractionInExplosion(IGM, origParam.getType(),
                                          substParam.getType(), explosionLevel))
        return true;
    }
  }

  return false;
}

/// Does the representation of the first type "differ by abstraction"
/// from the second type, which is the result of applying a
/// substitution to it?
///
/// Because we support rich value types, and because we don't want to
/// always coerce value types into a universal representation (as a
/// dynamically-typed language would have to), the representation of a
/// type with an abstract component may differ from the representation
/// of a type that's fully concrete.
///
/// The fundamental cause of this complication is function types.  For
/// example, a function that returns an Int will return it directly in
/// a register, but a function that returns an abstracted type T will
/// return it indirectly (via a hidden out-parameter); a similar rule
/// applies to parameters.
///
/// This difference then propagates through other structural types,
/// creating a set of general rules for translating values.
///
/// The following is a complete list of the canonical type forms
/// which can contain generic parameters:
///   - generic parameters, e.g. T
///   - tuples, e.g. (T, Int)
///   - functions, e.g. T -> Int
///   - l-values, e.g. [inout] T
///   - generic bindings, e.g. Vector<T>
///   - metatypes ?
///
/// Given a type T and a substitution S, T "differs by
/// abstraction" under S if, informally, its representation
/// is different from that of S(T).
///
/// Note S(T) == T if T is not dependent.  Note also that some
/// substitutions don't cause a change in representation: e.g.
/// if T := U -> Int and S := (T=>Printable), the substitution
/// doesn't change representation because an existential type
/// like Printable is always passed indirectly.
///
/// More formally, T differs by abstraction under S if:
///   - T == (T_1, ..., T_k) and T_i differs by abstraction under S
///     for some i;
///   - T == [inout] U and U differs by abstraction under S;
///   - T == U -> V and either
///       - U differs by abstraction as an argument under S or
///       - V differs by abstraction as a result under S; or
///   - T == U.class and U is dependent but S(U) is not.
/// T differs by abstraction as an argument under S if:
///   - T differs by abstraction under S; or
///   - T is a generic parameter and S(T) is not passed indirectly; or
///   - T == (T_1, ..., T_k) and T_i differs by abstraction as
///     an argument under S for some i.
/// T differs by abstraction as a result under S if:
///   - T differs by abstraction under S or
///   - T is returned indirectly but S(T) is not.
///
/// ** Variables **
///
/// All accessors to a variable must agree on its representation.
/// This is generally okay, because most accesses to a variable
/// are direct accesses, i.e. occur in code where its declaration
/// is known, and that declaration determines its abstraction.
///
/// For example, suppose we have a generic type:
///   class Producer<T> {
///     var f : () -> T
///   }
/// Code that accesses Producer<Int>.f directly will know how the
/// functions stored there are meant to be abstracted because the
/// declaration of 'f' spells it out.  They will know that they
/// cannot store a () -> Int function in that variable; it must
/// first be "thunked" so that it returns indirectly.
///
/// The same rule applies to local variables, which are contained
/// and declared in the context of a possibly-generic function.
///
/// There is (currently) one way in which a variable can be accessed
/// indirectly, without knowledge of how it was originally declared,
/// and that is when it is passed [inout].  A variable cannot be
/// passed directly by reference when the target l-value type
/// differs by abstraction from the variable's type.  However, the
/// mechanics and relatively weak guarantees of [inout] make it
/// legal to instead pass a properly-abstracted temporary variable,
/// thunking the current value as it's passed in and "un-thunking"
/// it on the way out.  Of course, that ain't free.
///
/// In the functions below, parameters named \c orig refer to the type T in the
/// definition -- substitution has been performed on this type. Parameters named
/// \c subst refer to a type after substitution, i.e. S(T).
namespace {
  class DiffersByAbstraction
      : public SubstTypeVisitor<DiffersByAbstraction, bool> {
    IRGenModule &IGM;
    ExplosionKind ExplosionLevel;
    AbstractionDifference DiffKind;
  public:
    DiffersByAbstraction(IRGenModule &IGM, ExplosionKind explosionLevel,
                         AbstractionDifference kind)
      : IGM(IGM), ExplosionLevel(explosionLevel), DiffKind(kind) {}

    bool visit(CanType origTy, CanType substTy) {
      if (origTy == substTy) return false;
      return super::visit(origTy, substTy);
    }

    bool visitLeafType(CanType origTy, CanType substTy) {
      // The check in visit should make this impossible.
      llvm_unreachable("difference with leaf types");
    }

    // We assume that all reference storage types have equivalent
    // representation.  This may not be true.
    bool visitReferenceStorageType(CanReferenceStorageType origTy,
                                   CanReferenceStorageType substTy) {
      return false;
    }
        
    CanType getArchetypeReprType(CanArchetypeType a) {
      if (Type super = a->getSuperclass())
        return CanType(super);
      return CanType(IGM.Context.TheObjCPointerType);
    }

    bool visitArchetypeType(CanArchetypeType origTy, CanType substTy) {
      // Archetypes vary by what we're considering this for.

      if (origTy->requiresClass()) {
        // Class archetypes are represented as some refcounted
        // pointer type that needs to be bitcast.
        return origTy != substTy;
      }
      
      // Archetypes are laid out in memory in the same way as a
      // concrete type would be.
      if (DiffKind == AbstractionDifference::Memory) return false;

      auto substType = SILType::getPrimitiveObjectType(substTy);

      // For function arguments, consider whether the substituted type
      // is passed indirectly under the abstract-call convention.
      // We only ever care about the abstract-call convention.
      return !IGM.isSingleIndirectValue(substType, ExplosionLevel);
    }

    bool visitArrayType(CanArrayType origTy, CanArrayType substTy) {
      return visit(origTy.getBaseType(), substTy.getBaseType());
    }

    bool visitBoundGenericType(CanBoundGenericType origTy,
                               CanBoundGenericType substTy) {
      assert(origTy->getDecl() == substTy->getDecl());

      // Bound generic types with reference semantics will never
      // differ by abstraction.  Bound generic types with value
      // semantics might someday, if we want things like Optional<T>
      // to have an efficient representation.  For now, though, they
      // don't.
      return false;
    }

    /// Functions use a more complicated algorithm which calls back
    /// into this.
    bool visitAnyFunctionType(CanAnyFunctionType origTy,
                              CanAnyFunctionType substTy) {
      return differsByAbstractionAsFunction(IGM, origTy, substTy,
                                            ExplosionKind::Minimal,
                                            /*uncurry*/ 0);
    }

    bool visitSILFunctionType(CanSILFunctionType origTy,
                              CanSILFunctionType substTy) {
      llvm_unreachable("unimplemented! will be subsumed anyway");
    }

    // L-values go by the object type;  note that we ask the ordinary
    // question, not the argument question.
    bool visitLValueType(CanLValueType origTy, CanLValueType substTy) {
      return differsByAbstractionInMemory(IGM,
                                          origTy.getObjectType(),
                                          substTy.getObjectType());
    }

    bool visitMetatypeType(CanMetatypeType origTy, CanMetatypeType substTy) {
      // Metatypes can differ by abstraction if the substitution
      // reveals that the type is actually not a class type.
      return (IGM.isTrivialMetatype(substTy) &&
              !IGM.isTrivialMetatype(origTy));
    }

    /// Whether we're checking for memory or for an explosion, tuples
    /// are considered element-wise.
    ///
    /// TODO: unless the original tuple contains a variadic explosion,
    /// in which case that portion of the tuple is passed indirectly
    /// in an explosion!
    bool visitTupleType(CanTupleType origTy, CanTupleType substTy) {
      assert(origTy->getNumElements() == substTy->getNumElements());
      for (unsigned i = 0, e = origTy->getNumElements(); i != e; ++i)
        if (visit(origTy.getElementType(i), substTy.getElementType(i)))
          return true;
      return false;
    }
  };
}

bool irgen::differsByAbstractionInMemory(IRGenModule &IGM,
                                         CanType origTy, CanType substTy) {
  return DiffersByAbstraction(IGM, ExplosionKind::Minimal,
                              AbstractionDifference::Memory)
           .visit(origTy, substTy);
}

bool irgen::differsByAbstractionInExplosion(IRGenModule &IGM,
                                            CanType origTy, CanType substTy,
                                            ExplosionKind explosionLevel) {
  return DiffersByAbstraction(IGM, explosionLevel,
                              AbstractionDifference::Explosion)
           .visit(origTy, substTy);
}

/// A class for testing whether a type directly stores an archetype.
struct EmbedsArchetype : irgen::DeclVisitor<EmbedsArchetype, bool>,
                         CanTypeVisitor<EmbedsArchetype, bool> {
  IRGenModule &IGM;
  EmbedsArchetype(IRGenModule &IGM) : IGM(IGM) {}

  using irgen::DeclVisitor<EmbedsArchetype, bool>::visit;
  using CanTypeVisitor<EmbedsArchetype, bool>::visit;

  bool visitTupleType(CanTupleType type) {
    for (auto eltType : type.getElementTypes())
      if (visit(eltType))
        return true;
    return false;
  }
  bool visitArchetypeType(CanArchetypeType type) {
    return true;
  }
  bool visitBoundGenericType(CanBoundGenericType type) {
    return visit(type->getDecl());
  }
#define FOR_NOMINAL_TYPE(Kind)                     \
  bool visit##Kind##Type(Can##Kind##Type type) {   \
    return visit##Kind##Decl(type->getDecl());     \
  }
  FOR_NOMINAL_TYPE(Protocol)
  FOR_NOMINAL_TYPE(Struct)
  FOR_NOMINAL_TYPE(Class)
  FOR_NOMINAL_TYPE(Enum)
#undef FOR_NOMINAL_TYPE

  bool visitArrayType(CanArrayType type) {
    return visit(type.getBaseType());
  }

  // All these types are leaves, in the sense that they don't directly
  // store any other types.
  bool visitBuiltinType(CanBuiltinType type) { return false; }
  bool visitMetatypeType(CanMetatypeType type) { return false; }
  bool visitModuleType(CanModuleType type) { return false; }
  bool visitAnyFunctionType(CanAnyFunctionType type) { return false; }
  bool visitSILFunctionType(CanSILFunctionType type) { return false; }

  bool visitLValueType(CanLValueType type) { return false; }
  bool visitProtocolCompositionType(CanProtocolCompositionType type) {
    return false;
  }
  bool visitReferenceStorageType(CanReferenceStorageType type) {
    return visit(type.getReferentType());
  }
  bool visitGenericTypeParamType(CanGenericTypeParamType type) {
    // FIXME: These might map down to an archetype.
    return false;
  }
  bool visitDependentMemberType(CanDependentMemberType type) {
    // FIXME: These might map down to an archetype.
    return false;
  }
  bool visitProtocolDecl(ProtocolDecl *decl) { return false; }
  bool visitClassDecl(ClassDecl *decl) { return false; }
  bool visitStructDecl(StructDecl *decl) {
    if (IGM.isResilient(decl, ResilienceScope::Local)) return true;
    return visitMembers(decl->getMembers());
  }
  bool visitEnumDecl(EnumDecl *decl) {
    if (IGM.isResilient(decl, ResilienceScope::Local)) return true;
    return visitMembers(decl->getMembers());
  }
  bool visitVarDecl(VarDecl *var) {
    if (var->isComputed()) return false;
    return visit(var->getType()->getCanonicalType());
  }
  bool visitEnumElementDecl(EnumElementDecl *decl) {
    return visit(decl->getType()->getCanonicalType());
  }
  bool visitDecl(Decl *decl) { return false; }

  bool visitMembers(ArrayRef<Decl*> members) {
    for (auto member : members)
      if (visit(member))
        return true;
    return false;
  }
};

namespace {
  /// A CRTP class for translating substituted explosions into
  /// unsubstituted ones, or in other words, emitting them at a higher
  /// (less concrete) abstraction level.
  class ReemitAsUnsubstituted : public SubstTypeVisitor<ReemitAsUnsubstituted> {
    IRGenFunction &IGF;
    ArrayRef<Substitution> Subs;
    Explosion &In;
    Explosion &Out;
  public:
    ReemitAsUnsubstituted(IRGenFunction &IGF, ArrayRef<Substitution> subs,
                          Explosion &in, Explosion &out)
      : IGF(IGF), Subs(subs), In(in), Out(out) {
    }

    void visitLeafType(CanType origTy, CanType substTy) {
      assert(origTy == substTy);
      auto &ti = IGF.getTypeInfo(getLoweredType(origTy, origTy));
      if (ti.isLoadable()) {
        cast<LoadableTypeInfo>(ti).reexplode(IGF, In, Out);
      } else {
        Out.add(In.claimNext());
      }
    }

    void visitArchetypeType(CanArchetypeType origTy, CanType substTy) {
      // For class protocols, bitcast to the archetype class pointer
      // representation.
      if (origTy->requiresClass()) {
        llvm::Value *inValue = In.claimNext();
        auto origStorageType = IGF.IGM.getStorageTypeForLowered(origTy);
        auto addr = IGF.Builder.CreateBitCast(inValue,
                                              origStorageType,
                                              "substitution.class_bound");
        Out.add(addr);
        return;
      }

      auto loweredTy = getLoweredType(origTy, substTy);
      
      // Handle the not-unlikely case that the input is a single
      // indirect value.
      if (IGF.IGM.isSingleIndirectValue(loweredTy, In.getKind())) {
        llvm::Value *inValue = In.claimNext();
        auto addr = IGF.Builder.CreateBitCast(inValue,
                                              IGF.IGM.OpaquePtrTy,
                                              "substitution.reinterpret");
        Out.add(addr);
        return;
      }

      // Otherwise, we need to make a temporary.
      // FIXME: this temporary has to get cleaned up!
      auto &substTI = IGF.getTypeInfo(loweredTy);
      auto addr = substTI.allocateStack(IGF, "substitution.temp").getAddress();

      // Initialize into it.
      initIntoTemporary(substTy, substTI, addr);

      // Cast to the expected pointer type.
      addr = IGF.Builder.CreateBitCast(addr, IGF.IGM.OpaquePtrTy, "temp.cast");

      // Add that to the output explosion.
      Out.add(addr.getAddress());
    }

    void initIntoTemporary(CanType substTy, const TypeInfo &substTI,
                           Address dest) {
      // This is really easy if the substituted type is loadable.
      if (substTI.isLoadable()) {
        cast<LoadableTypeInfo>(substTI).initialize(IGF, In, dest);

      // Otherwise, if it's a tuple, we need to unexplode it.
      } else if (auto tupleTy = dyn_cast<TupleType>(substTy)) {
        auto nextIndex = 0;
        for (auto eltType : tupleTy.getElementTypes()) {
          auto index = nextIndex++;
          auto &eltTI = IGF.getTypeInfoForUnlowered(eltType);
          if (eltTI.isKnownEmpty()) continue;

          auto eltAddr = projectTupleElementAddress(IGF, dest,
                                SILType::getPrimitiveObjectType(tupleTy),
                                                    index);
          initIntoTemporary(eltType, eltTI, eltAddr);
        }

      // Otherwise, just copy over.
      } else {
        Address src = substTI.getAddressForPointer(In.claimNext());
        substTI.initializeWithTake(IGF, dest, src);
      }
    }

    void visitArrayType(CanArrayType origTy, CanArrayType substTy) {
      llvm_unreachable("remapping values of array type");
    }

    void visitBoundGenericType(CanBoundGenericType origTy,
                               CanBoundGenericType substTy) {
      assert(origTy->getDecl() == substTy->getDecl());

      // If the base type has reference semantics, we can just copy
      // that reference into the output explosion.
      if (origTy->hasReferenceSemantics())
        return In.transferInto(Out, 1);

      auto origSILTy = getLoweredType(origTy, origTy);
      auto substSILTy = getLoweredType(origTy, substTy);

      // Otherwise, this gets more complicated.
      // Handle the easy cases where one or both of the arguments are
      // represented using single indirect pointers
      auto *origIndirect = IGF.IGM.isSingleIndirectValue(origSILTy, In.getKind());
      auto *substIndirect = IGF.IGM.isSingleIndirectValue(substSILTy, In.getKind());
      
      // Bitcast between address-only instantiations.
      if (origIndirect && substIndirect) {
        llvm::Value *inValue = In.claimNext();
        auto addr = IGF.Builder.CreateBitCast(inValue, origIndirect);
        Out.add(addr);
        return;
      }
      
      // Substitute a loadable instantiation for an address-only one by emitting
      // to a temporary.
      if (origIndirect && !substIndirect) {
        auto &substTI = IGF.getTypeInfo(substSILTy);
        auto addr = substTI.allocateStack(IGF, "substitution.temp").getAddress();
        initIntoTemporary(substTy, substTI, addr);
        addr = IGF.Builder.CreateBitCast(addr, origIndirect);
        Out.add(addr.getAddress());
        return;
      }
      
      // FIXME: This is my first shot at implementing this, but it doesn't
      // handle cases which actually need remapping.
      if (EmbedsArchetype(IGF.IGM).visitBoundGenericType(origTy))
        IGF.unimplemented(SourceLoc(),
              "remapping bound generic value types with archetype members");
      
      auto n = IGF.IGM.getExplosionSize(origSILTy, In.getKind());
      In.transferInto(Out, n);
    }

    void visitAnyFunctionType(CanAnyFunctionType origTy,
                              CanAnyFunctionType substTy) {
      if (differsByAbstractionAsFunction(IGF.IGM, origTy, substTy,
                                         ExplosionKind::Minimal,
                                         /*uncurry*/ 0))
        IGF.unimplemented(SourceLoc(), "remapping bound function type");
      In.transferInto(Out, 2);
    }

    void visitSILFunctionType(CanSILFunctionType origTy,
                              CanSILFunctionType substTy) {
      if (differsByAbstractionAsFunction(IGF.IGM, origTy, substTy,
                                         ExplosionKind::Minimal)) {
        IGF.unimplemented(SourceLoc(), "remapping bound SIL function type");
      }
      In.transferInto(Out, 1 + (origTy->isThin() ? 0 : 1));
    }

    void visitLValueType(CanLValueType origTy, CanLValueType substTy) {
      CanType origObjectTy = origTy.getObjectType();
      CanType substObjectTy = substTy.getObjectType();
      if (differsByAbstractionInMemory(IGF.IGM, origObjectTy, substObjectTy))
        IGF.unimplemented(SourceLoc(), "remapping l-values");

      llvm::Value *substMV = In.claimNext();
      if (origObjectTy == substObjectTy)
        return Out.add(substMV);

      // A bitcast will be sufficient.
      auto &origObjectTI = IGF.IGM.getTypeInfoForUnlowered(origObjectTy);
      auto origPtrTy = origObjectTI.getStorageType()->getPointerTo();

      auto substValue = substMV;
      auto origValue =
        IGF.Builder.CreateBitCast(substValue, origPtrTy,
                                  substValue->getName() + ".reinterpret");
      Out.add(origValue);
    }

    void visitMetatypeType(CanMetatypeType origTy, CanMetatypeType substTy) {
      CanType origInstanceTy = origTy.getInstanceType();
      CanType substInstanceTy = substTy.getInstanceType();

      // The only metatypes with non-trivial representations are those
      // for archetypes and class types.  A type can't lose the class
      // nature under substitution, so if the substituted type is
      // trivial, the original type either must also be or must be an
      // archetype.
      if (IGF.IGM.isTrivialMetatype(substTy)) {
        assert(IGF.IGM.isTrivialMetatype(origTy) ||
               isa<ArchetypeType>(origInstanceTy));
        if (isa<ArchetypeType>(origInstanceTy))
          Out.add(IGF.emitTypeMetadataRef(substInstanceTy));
        return;
      }

      // Otherwise, the original type is either a class type or an
      // archetype, and in either case it has a non-trivial representation.
      assert(!IGF.IGM.isTrivialMetatype(origTy));
      In.transferInto(Out, 1);
    }

    void visitTupleType(CanTupleType origTy, CanTupleType substTy) {
      assert(origTy->getNumElements() == substTy->getNumElements());
      for (unsigned i = 0, e = origTy->getNumElements(); i != e; ++i) {
        visit(origTy.getElementType(i), substTy.getElementType(i));
      }
    }

    void visitReferenceStorageType(CanReferenceStorageType origTy,
                                   CanReferenceStorageType substTy) {
      auto origLoweredTy = getLoweredType(origTy, origTy);
      unsigned count = IGF.IGM.getExplosionSize(origLoweredTy, Out.getKind());
      In.transferInto(Out, count);
    }

  private:
    SILType getLoweredType(CanType orig, CanType subst) {
      return IGF.IGM.SILMod->Types.getLoweredType(subst); // FIXME
    }
  };
}

/// Given a substituted explosion, re-emit it as an unsubstituted one.
///
/// For example, given an explosion which begins with the
/// representation of an (Int, Float), consume that and produce the
/// representation of an (Int, T).
///
/// The substitutions must carry origTy to substTy.
void irgen::reemitAsUnsubstituted(IRGenFunction &IGF,
                                  CanType expectedTy, CanType substTy,
                                  ArrayRef<Substitution> subs,
                                  Explosion &in, Explosion &out) {
  ReemitAsUnsubstituted(IGF, subs, in, out).visit(expectedTy, substTy);
}

namespace {
  /// A CRTP class for translating unsubstituted explosions into
  /// substituted ones, or in other words, emitting them at a lower
  /// (more concrete) abstraction level.
  class ReemitAsSubstituted : public SubstTypeVisitor<ReemitAsSubstituted> {
    IRGenFunction &IGF;
    ArrayRef<Substitution> Subs;
    Explosion &In;
    Explosion &Out;
  public:
    ReemitAsSubstituted(IRGenFunction &IGF, ArrayRef<Substitution> subs,
                        Explosion &in, Explosion &out)
      : IGF(IGF), Subs(subs), In(in), Out(out) {
      assert(in.getKind() == out.getKind());
    }

    void visitLeafType(CanType origTy, CanType substTy) {
      assert(origTy == substTy);
      auto loweredTy = getLoweredType(origTy, origTy);
      In.transferInto(Out, IGF.IGM.getExplosionSize(loweredTy, In.getKind()));
    }

    /// The unsubstituted type is an archetype.  In explosion terms,
    /// that makes it a single pointer-to-opaque.
    void visitArchetypeType(CanArchetypeType origTy, CanType substTy) {
      auto loweredTy = getLoweredType(origTy, substTy);
      auto &substTI = IGF.getTypeInfo(loweredTy);

      llvm::Value *inValue = In.claimNext();
      auto inAddr = IGF.Builder.CreateBitCast(inValue,
                                    substTI.getStorageType()->getPointerTo(),
                                              "substitution.reinterpret");

      // If the substituted type is still a single indirect value,
      // just pass it on without reinterpretation.
      if (IGF.IGM.isSingleIndirectValue(loweredTy, In.getKind())) {
        Out.add(inAddr);
        return;
      }

      // Otherwise, load as a take.
      cast<LoadableTypeInfo>(substTI).loadAsTake(IGF,
                                   substTI.getAddressForPointer(inAddr), Out);
    }

    void visitArrayType(CanArrayType origTy, CanArrayType substTy) {
      llvm_unreachable("remapping values of array type");
    }

    void visitBoundGenericType(CanBoundGenericType origTy,
                               CanBoundGenericType substTy) {
      assert(origTy->getDecl() == substTy->getDecl());

      // If the base type has reference semantics, we can just copy
      // that reference into the output explosion.
      if (origTy->hasReferenceSemantics())
        return In.transferInto(Out, 1);

      // Otherwise, this gets more complicated.
      if (EmbedsArchetype(IGF.IGM).visitBoundGenericType(origTy))
        IGF.unimplemented(SourceLoc(),
               "remapping bound generic value types with archetype members");

      // FIXME: This is my first shot at implementing this, but it doesn't
      // handle cases which actually need remapping.
      auto loweredTy = getLoweredType(origTy, substTy);
      auto n = IGF.IGM.getExplosionSize(loweredTy, In.getKind());
      In.transferInto(Out, n);
    }

    void visitAnyFunctionType(CanAnyFunctionType origTy,
                              CanAnyFunctionType substTy) {
      if (differsByAbstractionAsFunction(IGF.IGM, origTy, substTy,
                                         ExplosionKind::Minimal,
                                         /*uncurry*/ 0))
        IGF.unimplemented(SourceLoc(), "remapping bound function type");
      In.transferInto(Out, 2);
    }

    void visitSILFunctionType(CanSILFunctionType origTy,
                              CanSILFunctionType substTy) {
      llvm_unreachable("unimplemented! will be subsumed anyway");
    }

    void visitLValueType(CanLValueType origTy, CanLValueType substTy) {
      CanType origObjectTy = origTy.getObjectType();
      CanType substObjectTy = substTy.getObjectType();
      if (differsByAbstractionInMemory(IGF.IGM, origObjectTy, substObjectTy))
        IGF.unimplemented(SourceLoc(), "remapping l-values");

      llvm::Value *origMV = In.claimNext();
      if (origObjectTy == substObjectTy)
        return Out.add(origMV);

      // A bitcast will be sufficient.
      auto &substObjectTI = IGF.IGM.getTypeInfoForUnlowered(substObjectTy);
      auto substPtrTy = substObjectTI.getStorageType()->getPointerTo();

      auto substValue =
        IGF.Builder.CreateBitCast(origMV, substPtrTy,
                                  origMV->getName() + ".reinterpret");
      Out.add(substValue);
    }

    void visitMetatypeType(CanMetatypeType origTy, CanMetatypeType substTy) {
      CanType origInstanceTy = origTy.getInstanceType();

      // The only metatypes with non-trivial representations are those
      // for archetypes and class types.  A type can't lose the class
      // nature under substitution, so if the substituted type is
      // trivial, the original type either must also be or must be an
      // archetype.
      if (IGF.IGM.isTrivialMetatype(substTy)) {
        assert(IGF.IGM.isTrivialMetatype(origTy) ||
               isa<ArchetypeType>(origInstanceTy));
        if (isa<ArchetypeType>(origInstanceTy))
          In.markClaimed(1);
        return;
      }

      // Otherwise, the original type is either a class type or an
      // archetype, and in either case it has a non-trivial representation.
      assert(!IGF.IGM.isTrivialMetatype(origTy));
      In.transferInto(Out, 1);
    }

    void visitTupleType(CanTupleType origTy, CanTupleType substTy) {
      assert(origTy->getNumElements() == substTy->getNumElements());
      for (unsigned i = 0, e = origTy->getNumElements(); i != e; ++i) {
        visit(origTy.getElementType(i), substTy.getElementType(i));
      }
    }

    void visitReferenceStorageType(CanReferenceStorageType origTy,
                                   CanReferenceStorageType substTy) {
      auto loweredTy = getLoweredType(origTy, substTy);
      auto count = IGF.IGM.getExplosionSize(loweredTy, Out.getKind());
      In.transferInto(Out, count);
    }

  private:
    SILType getLoweredType(CanType orig, CanType subst) {
      return IGF.IGM.SILMod->Types.getLoweredType(subst); // FIXME
    }
  };
}

/// Given an unsubstituted explosion, re-emit it as a substituted one.
///
/// For example, given an explosion which begins with the
/// representation of an (Int, T), consume that and produce the
/// representation of an (Int, Float).
///
/// The substitutions must carry origTy to substTy.
void irgen::reemitAsSubstituted(IRGenFunction &IGF,
                                CanType origTy, CanType substTy,
                                ArrayRef<Substitution> subs,
                                Explosion &in, Explosion &out) {
  ReemitAsSubstituted(IGF, subs, in, out).visit(origTy, substTy);
}

llvm::Value *
IRGenFunction::emitSuperToClassArchetypeConversion(llvm::Value *super,
                                                   SILType destType,
                                                   CheckedCastMode mode) {
  assert(destType.is<ArchetypeType>() && "expected archetype type");
  assert(destType.castTo<ArchetypeType>()->requiresClass()
         && "expected class archetype type");

  // Cast the super pointer to i8* for the runtime call.
  super = Builder.CreateBitCast(super, IGM.Int8PtrTy);

  // Retrieve the metadata.
  llvm::Value *metadataRef = emitTypeMetadataRef(destType);
  if (metadataRef->getType() != IGM.Int8PtrTy)
    metadataRef = Builder.CreateBitCast(metadataRef, IGM.Int8PtrTy);

  // Call the (unconditional) dynamic cast.
  llvm::Value *castFn;
  switch (mode) {
  case CheckedCastMode::Unconditional:
    castFn = IGM.getDynamicCastUnconditionalFn();
    break;
  case CheckedCastMode::Conditional:
    castFn = IGM.getDynamicCastFn();
    break;
  }
  
  auto call
    = Builder.CreateCall2(castFn, super, metadataRef);
  
  // FIXME: Eventually, we may want to throw.
  call->setDoesNotThrow();
  
  // Bitcast the result to the archetype's representation type.
  auto &destTI = getTypeInfo(destType);
  llvm::Value *cast = Builder.CreateBitCast(call, destTI.StorageType);

  return cast;
}