// builtinops.cc
// code for builtinops.h

#include "builtinops.h"    // this module
#include "cc_type.h"       // Type, etc.
#include "cc_env.h"        // Env
#include "overload.h"      // getConversionOperators, OverloadResolver

using namespace sm;

// ------------------ CandidateSet -----------------
CandidateSet::~CandidateSet()
{}


// ------------------ PolymorphicCandidateSet -----------------
PolymorphicCandidateSet::PolymorphicCandidateSet(Variable *v)
  : poly(v)
{}

void PolymorphicCandidateSet::instantiateBinary(Env &env,
  OverloadResolver &resolver, OverloadableOp op, ArgumentInfo &lhsInfo, ArgumentInfo &rhsInfo)
{
  // polymorphic candidates are easy
  resolver.processCandidate(poly);
}


// ------------------ PredicateCandidateSet -----------------
STATICDEF Type const *PredicateCandidateSet::Inst::getKeyFn(Inst *ic)
{
  return ic->type;
}

STATICDEF unsigned PredicateCandidateSet::Inst::hashFn(Type const *t)
{
  return t->hashValue();
}

STATICDEF bool PredicateCandidateSet::Inst::equalFn(Type const *t1, Type const *t2)
{
  return t1->equals(t2);
}


PredicateCandidateSet::PredicateCandidateSet(SimpleTypeId retId, PreFilter r, PostFilter o)
  : instantiations(&Inst::getKeyFn,
                   &Inst::hashFn,
                   &Inst::equalFn),
    ambigInst(NULL),
    retAlgorithm(retId),
    pre(r),
    post(o),
    generation(0)
{}

PredicateCandidateSet::~PredicateCandidateSet()
{}



// get the set of types that 'info.type' can be converted to via a
// user-defined conversion operator, or by the identity conversion
void getConversionOperatorResults(Env &env, SObjList<Type> &dest, 
                                  ArgumentInfo &info)
{
  if (info.overloadSet.isNotEmpty()) {
    // 2005-02-25: I am not sure if this will really work, but I am
    // going to attempt to treat an overloaded function name as if
    // it could "convert" to all of the types of the overloaded names.
    SFOREACH_OBJLIST(Variable, info.overloadSet, iter) {
      dest.prepend(iter.data()->type);
    }
    dest.reverse();
    return;
  }

  Type *t = info.type;
  if (!t->asRval()->isCompoundType()) {
    // this is for when one of the arguments to an operator is not
    // of class type; we treat it similarly to a class that can only
    // convert to one type
    dest.append(t);
  }
  else {
    t = t->asRval();

    // get conops
    SObjList<Variable> const &convs = t->asCompoundType()->conversionOperators;

    // get return types
    dest.reverse();
    SFOREACH_OBJLIST(Variable, convs, iter) {
      dest.prepend(iter.data()->type->asFunctionTypeC()->retType);
    }
    dest.reverse();
  }
}

void PredicateCandidateSet::instantiateBinary(Env &env,
  OverloadResolver &resolver, OverloadableOp op, 
  ArgumentInfo &lhsInfo, ArgumentInfo &rhsInfo)
{
  // for this to overflow, I'd have to do 2^31 instantiations in a
  // single translation unit, which is very unlikely since the AST
  // that triggers that instantiation would have to be much larger
  // than 2^31 bytes
  generation++;

  // pattern candidate with correlated parameter types,
  // e.g. (13.6 para 14):
  //
  //   For every T, where T is a pointer to object type, there exist
  //   candidate operator functions of the form
  //     ptrdiff_t operator-(T, T);
  //
  // The essential idea here is to compute a set of types with
  // which to instantiate the above pattern.  Naively, we'd like
  // to instantiate it with all types, but of course that is not
  // practical.  Instead, we compute a finite set S of types such
  // that we get the same answer as we would have if we had
  // instantiated it with all types.  Note that if we compute S
  // correctly, it will be the case that any superset of S would
  // also work; we do not necessarily compute the minimal S.
  //
  // The core of the analysis is the least-upper-bound function
  // on types.  Given a pair of types, the LUB type
  // instantiation would win against all the other
  // instantiations the LUB dominates, in the final overload
  // analysis.  Thus we populate S with the LUBs of all pairs
  // of types the arguments' con-ops can yield.
  //
  // See also: convertibility.txt

  // collect all of the operator functions rettypes from lhs and rhs
  SObjList<Type> lhsRets, rhsRets;
  getConversionOperatorResults(env, lhsRets, lhsInfo);
  getConversionOperatorResults(env, rhsRets, rhsInfo);

  // consider all pairs of conversion results
  SFOREACH_OBJLIST_NC(Type, lhsRets, lhsIter) {
    Type *lhsRet = pre(lhsIter.data(), true /*isLeft*/);
    if (!lhsRet) continue;

    SFOREACH_OBJLIST_NC(Type, rhsRets, rhsIter) {
      Type *rhsRet = pre(rhsIter.data(), false /*isLeft*/);
      if (!rhsRet) continue;

      // compute LUB
      bool wasAmbig;
      Type *lub = computeLUB(env, lhsRet, rhsRet, wasAmbig);
      if (wasAmbig) {
        addAmbigCandidate(env, resolver, op);
      }
      else {
        if (!lub) {
          // 9/23/04: if either argument is "special" (like 0) I need
          // to relax the LUB rules
          if (rhsInfo.special == SE_ZERO && lhsRet->isPointerType()) {
            lub = lhsRet;
          }
          else if (lhsInfo.special == SE_ZERO && rhsRet->isPointerType()) {
            lub = rhsRet;
          }
        }

        if (lub && post(lub)) {
          // instantiate with this type
          instantiateCandidate(env, resolver, op, lub);
        }
      }
    }
  }
}


void PredicateCandidateSet::instantiateCandidate(Env &env,
  OverloadResolver &resolver, OverloadableOp op, Type *T)
{
  // have we already built an instantiated candidate?
  Inst *ic = instantiations.get(T);
  if (ic) {
    // did we already give it to this resolver?
    if (ic->generation == generation) {
      // yes, don't do so again
      OVERLOADTRACE("cset: already given to resolver: " << T->toString());
      return;
    }

    OVERLOADTRACE("cset: already instantiated: " << T->toString());
  }

  else {
    // need to make a new instantiaton
    ic = new Inst(T, makeNewCandidate(env, op, T));
    instantiations.add(T, ic);

    OVERLOADTRACE("cset: made new instantiation: " << T->toString() <<
                  " (hash=" << T->hashValue() << ")");
  }

  // give it to the resolver
  ic->generation = generation;
  resolver.processCandidate(ic->inst);
}


Variable *PredicateCandidateSet::makeNewCandidate(Env &env,
  OverloadableOp op, Type *T)
{
  Type *retType;
  if (isConcreteSimpleType(retAlgorithm)) {
    retType = env.getSimpleType(retAlgorithm);
  }
  else {
    // only non-concrete predicate set is for '?:'
    xassert(retAlgorithm == ST_PRET_FIRST);
    retType = T;
  }

  // parameters are symmetric
  return env.createBuiltinBinaryOp(retType, op, T, T);
}


// If any LUB is ambiguous, then the final overload analysis over the
// infinite set of instantiations would also have been ambiguous.
//
// But it's not so simple as yielding an error; see in/t0140.cc for an
// example of why.  What we need to do is yield a candidate that will
// be ambiguous unless it's beaten by a candidate that is better than
// any of the built-in instantiations (e.g. a member operator).
//
// I defer to the overload module to make such a candidate; here I
// just say what I want.
void PredicateCandidateSet::addAmbigCandidate(Env &env, OverloadResolver &resolver,
  OverloadableOp op)
{
  // it doesn't matter if I give this to the resolver more than once,
  // because it's already ambiguous

  if (!ambigInst) {
    Type *t_void = env.getSimpleType(ST_VOID);
    ambigInst = env.createBuiltinBinaryOp(t_void, op, t_void, t_void);
  }
  resolver.addAmbiguousBinaryCandidate(ambigInst);
}



// ------------------ AssignmentCandidateSet -----------------
bool isAssignmentOperator(OverloadableOp op)
{
  return OP_ASSIGN <= op && op <= OP_BITOREQ;
}


AssignmentCandidateSet::AssignmentCandidateSet(SimpleTypeId retId, PreFilter r, PostFilter o)
  : PredicateCandidateSet(retId, r, o)
{}


void AssignmentCandidateSet::instantiateBinary(Env &env,
  OverloadResolver &resolver, OverloadableOp op, 
  ArgumentInfo &lhsInfo, ArgumentInfo &/*rhsInfo*/)
{
  generation++;

  if (isAssignmentOperator(op) && lhsInfo.type->asRval()->isCompoundType()) {
    // 13.3.1.2p4b2: cannot use user-defined conversions to convert
    // the LHS of an assignment operator, so that means that if the
    // LHS is of class type, then a built-in candidate can't be used
    OVERLOADTRACE("cset: disabling conversion operators of LHS of operator" << toString(op));
    return;
  }

  // collect all of the operator functions rettypes
  SObjList<Type> lhsRets;
  getConversionOperatorResults(env, lhsRets, lhsInfo);

  // consider conversion results
  SFOREACH_OBJLIST_NC(Type, lhsRets, lhsIter) {
    Type *lhsRet = pre(lhsIter.data(), true /*isLeft*/);
    if (!lhsRet) continue;

    // the way the assignment built-ins work, we only need to
    // instantiate with the types to which the LHS convert, to
    // get a complete set (i.e. no additional instantiations
    // would change the answer)
    instantiateCandidate(env, resolver, op, lhsRet);
  }
}


Variable *AssignmentCandidateSet::makeNewCandidate(Env &env,
  OverloadableOp op, Type *T)
{
  // left parameter is a reference, and we need two versions,
  // one with volatile and one without
  //
  // update: now that I directly instantiate the LHS types,
  // without first stripping their volatile-ness, I don't need to
  // instantiate volatile versions of types that don't already
  // have volatile versions present

  xassert(retAlgorithm == ST_PRET_FIRST);

  Type *Tref = env.tfac.makeReferenceType(T);
  return env.createBuiltinBinaryOp(Tref, op, Tref, T);
}


// ------------------ ArrowStarCandidateSet -----------------
STATICDEF ArrowStarCandidateSet::TypePair const *
  ArrowStarCandidateSet::Inst::getKeyFn(Inst *ic)
{
  return &(ic->types);
}

STATICDEF unsigned ArrowStarCandidateSet::Inst::hashFn(TypePair const *p)
{
  return p->hashValue();
}

unsigned ArrowStarCandidateSet::TypePair::hashValue() const
{
  return lhsType->hashValue() * 1000 +
         rhsType->hashValue();
}

STATICDEF bool ArrowStarCandidateSet::Inst::equalFn
  (TypePair const *p1, TypePair const *p2)
{
  return p1->lhsType->equals(p2->lhsType) &&
         p1->rhsType->equals(p2->rhsType);
}


ArrowStarCandidateSet::ArrowStarCandidateSet()
  : instantiations(&Inst::getKeyFn,
                   &Inst::hashFn,
                   &Inst::equalFn),
    generation(0)
{}

ArrowStarCandidateSet::~ArrowStarCandidateSet()
{}


// goal: instantiate pattern
//   CV12 T& operator->* (CV1 C1 *, CV2 T C2::*);
// by finding instantiation pairs (C1,C2)
void ArrowStarCandidateSet::instantiateBinary(Env &env,
  OverloadResolver &resolver, OverloadableOp op, ArgumentInfo &lhsInfo, ArgumentInfo &rhsInfo)
{
  xassert(op == OP_ARROW_STAR);
  generation++;

  // these arrays record all pairs of types used to instantiate
  // the pattern, so that we ensure that no pair is instantiated
  // more than once
  ArrayStack<Type*> lhsInst, rhsInst;

  // collect all of the operator functions rettypes from lhs and rhs
  SObjList<Type> lhsRets, rhsRets;
  getConversionOperatorResults(env, lhsRets, lhsInfo);
  getConversionOperatorResults(env, rhsRets, rhsInfo);

  // consider all pairs of conversion results
  SFOREACH_OBJLIST_NC(Type, lhsRets, lhsIter) {
    Type *lhsRet = lhsIter.data();

    // expect 'lhsRet' to be of form 'class U cv1 *'; extract U
    if (!lhsRet->isPointer()) continue;
    Type *lhsUnder = lhsRet->asPointerType()->atType;
    if (!lhsUnder->isCompoundType()) continue;
    CompoundType *U = lhsUnder->asCompoundType();

    SFOREACH_OBJLIST_NC(Type, rhsRets, rhsIter) {
      Type *rhsRet = rhsIter.data();

      // expect 'rhsRet' to be of form 'T cv2 V::*'; extract V
      if (!rhsRet->isPointerToMemberType()) continue;
      PointerToMemberType *rhsPtm = rhsRet->asPointerToMemberType();
      CompoundType *V = rhsPtm->inClass();

      // Now, any possible instantiation C1 and C2 must have an
      // inheritance relation like
      //
      //                   V
      //                  /
      //                C2
      //               /
      //             C1
      //            /
      //           U
      //
      // Furthermore, the order on conversions will push C1 towards U
      // and C2 towards V.  Hence the only instantiation necessary
      // for the (U,V) pair is (U,V) itself; and that's only if U and
      // V are related by inheritance.

      if (!U->hasBaseClass(V)) {
        // necessary relationship between U and V doesn't hold
        continue;
      }

      // build operator's parameter types; they're essentially just
      // lhsRet and rhsRet, except I want to strip toplevel cv flags
      // before making the instance
      Type *lhsParam = env.tfac.setQualifiers(SL_UNKNOWN, CV_NONE, lhsRet, NULL /*syntax*/);
      Type *rhsParam = env.tfac.setQualifiers(SL_UNKNOWN, CV_NONE, rhsRet, NULL /*syntax*/);

      instantiateCandidate(env, resolver, lhsParam, rhsParam);
    }
  }
}


string ArrowStarCandidateSet::TypePair::asString() const
{
  return stringc << "(" << lhsType->toString()
                 << ", " << rhsType->toString() << ")";
}

// based on PredicateCandidateSet::instantiateCandidate
void ArrowStarCandidateSet::instantiateCandidate(Env &env,
  OverloadResolver &resolver, Type *lhsType, Type *rhsType)
{
  TypePair pair(lhsType, rhsType);

  // have we already built an instantiated candidate?
  Inst *ic = instantiations.get(&pair);
  if (ic) {
    // did we already give it to this resolver?
    if (ic->generation == generation) {
      // yes, don't do so again
      OVERLOADTRACE("->*set: already given to resolver: " << pair.asString());
      return;
    }

    OVERLOADTRACE("->*set: already instantiated: " << pair.asString());
  }

  else {
    // CV12 T& operator->* (CV1 C1*, CV2 T C2::*);
    // 
    // This is the only implementation of ST_PRET_PTM, but we don't need
    // the code to say what to do; I leave that code in existence, however, 
    // for uniformity.
    Type *retType = rhsType->getAtType();                         // CV2 T
    retType = env.tfac.applyCVToType(SL_UNKNOWN, lhsType->getAtType()->getCVFlags(),
                                     retType, NULL /*syntax*/);   // CV12 T
    retType = env.makeReferenceType(retType);                     // CV12 T&

    // need to make a new instantiaton
    ic = new Inst(pair,
      env.createBuiltinBinaryOp(retType, OP_ARROW_STAR, lhsType, rhsType));

    instantiations.add(&(ic->types), ic);

    OVERLOADTRACE("->*set: made new instantiation: " << pair.asString() <<
                  " (hash=" << pair.hashValue() << ")");
  }

  // give it to the resolver
  ic->generation = generation;
  resolver.processCandidate(ic->inst);
}


// ------------------- filters -------------------
Type *rvalFilter(Type *t, bool)
{
  return t->asRval();
}

Type *rvalIsPointer(Type *t, bool)
{
  // 13.3.1.5: functions that return 'T&' are regarded as
  // yielding 'T' for purposes of this analysis
  t = t->asRval();

  // only pointer types need consideration
  if (t->isPointer()) {
    return t;
  }
  else {
    return NULL;
  }
}

// we admit the pattern
//   T VQ &
// where T is a pointer to any type (para 19), or
// is an enumeration or pointer-to-member (para 20)
//
// we yield the T for instantiation
Type *para19_20filter(Type *t, bool)
{
  if (!t->isReference()) {
    return NULL;
  }
  t = t->asRval();
  if (t->isConst()) {
    return NULL;
  }

  if (t->isPointer() ||
      t->isEnumType() ||
      t->isPointerToMemberType()) {
    return t;
  }

  return NULL;
}

// same as above but with arithmetic types too
Type *para19_20_andArith_filter(Type *t, bool)
{
  if (!t->isReference()) {
    return NULL;
  }
  t = t->asRval();
  if (t->isConst()) {
    return NULL;
  }

  if (t->isPointer() ||
      t->isEnumType() ||
      t->isPointerToMemberType()) {
    return t;
  }

  // this is the change from above
  if (t->isSimpleType() &&
      isArithmeticType(t->asSimpleTypeC()->type)) {
    return t;
  }

  return NULL;
}


bool pointerToObject(Type *t)
{
  // the pre-filter already guarantees that only pointer types
  // can result from the LUB, but we need to ensure that
  // only pointer-to-object types are instantiated
  Type *at = t->asPointerType()->atType;
  if (at->isVoid() || at->isFunctionType()) {
    return false;    // don't instantiate with this one
  }
  else {
    return true;
  }
}

bool pointerOrEnum(Type *t)
{
  return t->isPointer() || t->isEnumType();
}

bool pointerOrEnumOrPTM(Type *t)
{
  return t->isPointer() || t->isEnumType() || t->isPointerToMemberType();
}

bool pointerOrPTM(Type *t)
{
  return t->isPointer() || t->isPointerToMemberType();
}

bool pointerToAny(Type *t)
{
  // the LUB will ensure this, actually, but it won't
  // hurt to check again
  return t->isPointer();
}

bool anyType(Type *)
{                  
  return true;
}


// EOF