Welcome to the NetCologne GmbH open source mirroring service!

This machine mirrors various open-source projects. 20 Gbit/s uplink.

If there are any issues or you want another project mirrored, please contact mirror-service -=AT=- netcologne DOT de !

lib/codegen/CodeGenTypes.cpp

Go to the documentation of this file.

//===-- codegen/CodeGenTypes.cpp ------------------------------ -*- C++ -*-===//
//
// This file is distributed under the MIT license. See LICENSE.txt for details.
//
// Copyright (C) 2009-2010, Stephen Wilson
//
//===----------------------------------------------------------------------===//

#include "CGContext.h"
#include "CodeGen.h"
#include "CodeGenTypes.h"
#include "CommaRT.h"
#include "comma/ast/Decl.h"

#include "llvm/DerivedTypes.h"
#include "llvm/Target/TargetData.h"

using namespace comma;

using llvm::dyn_cast;
using llvm::cast;
using llvm::isa;

namespace {

uint64_t getArrayWidth(const llvm::APInt &low, const llvm::APInt &high,
                       bool isSigned)
{
    llvm::APInt lower(low);
    llvm::APInt upper(high);

    // Check if this is a null range.
    if (isSigned) {
        if (upper.slt(lower))
            return 0;
    }
    else {
        if (upper.ult(lower))
            return 0;
    }

    // Compute 'upper - lower + 1' to determine the number of elements in
    // this type.
    unsigned width = std::max(lower.getBitWidth(), upper.getBitWidth()) + 1;

    if (isSigned) {
        lower.sext(width);
        upper.sext(width);
    }
    else {
        lower.zext(width);
        upper.zext(width);
    }

    llvm::APInt range(upper);
    range -= lower;
    range++;

    // Ensure the range can fit in 64 bits.
    assert(range.getActiveBits() <= 64 && "Index too wide for array type!");
    return range.getZExtValue();
}

} // end anonymous namespace.

unsigned CodeGenTypes::getTypeAlignment(const llvm::Type *type) const
{
    return CG.getTargetData().getABITypeAlignment(type);
}

uint64_t CodeGenTypes::getTypeSize(const llvm::Type *type) const
{
    return CG.getTargetData().getTypeStoreSize(type);
}

const llvm::Type *CodeGenTypes::lowerType(const Type *type)
{
    switch (type->getKind()) {

    default:
        assert(false && "Cannot lower the given Type!");
        return 0;

    case Ast::AST_DomainType:
        return lowerDomainType(cast<DomainType>(type));

    case Ast::AST_EnumerationType:
    case Ast::AST_IntegerType:
        return lowerDiscreteType(cast<DiscreteType>(type));

    case Ast::AST_ArrayType:
        return lowerArrayType(cast<ArrayType>(type));

    case Ast::AST_RecordType:
        return lowerRecordType(cast<RecordType>(type));

    case Ast::AST_AccessType:
        return lowerAccessType(cast<AccessType>(type));

    case Ast::AST_IncompleteType:
        return lowerIncompleteType(cast<IncompleteType>(type));

    case Ast::AST_UniversalType:
        return lowerUniversalType(cast<UniversalType>(type));
    }
}

void CodeGenTypes::addInstanceRewrites(const DomainInstanceDecl *instance)
{
    const FunctorDecl *functor = instance->getDefiningFunctor();
    if (!functor)
        return;

    unsigned arity = functor->getArity();
    for (unsigned i = 0; i < arity; ++i) {
        const Type *key = functor->getFormalType(i);
        const Type *value = instance->getActualParamType(i);
        rewrites.insert(key, value);
    }
}

const DomainType *
CodeGenTypes::rewriteAbstractDecl(const AbstractDomainDecl *abstract)
{
    typedef RewriteMap::iterator iterator;
    iterator I = rewrites.begin(abstract->getType());
    assert(I != rewrites.end() && "Could not resolve abstract type!");
    return cast<DomainType>(*I);
}

const Type *CodeGenTypes::resolveType(const Type *type)
{
    if (const DomainType *domTy = dyn_cast<DomainType>(type)) {

        if (const AbstractDomainDecl *decl = domTy->getAbstractDecl())
            return resolveType(rewriteAbstractDecl(decl));

        const DomainInstanceDecl *instance;
        if (const PercentDecl *percent = domTy->getPercentDecl()) {
            // Ensure that the current context represents a particular instance
            // of the percent node and resolve the particular representation
            // associated with the instance.
            assert(percent->getDefinition() == context->getDefinition());
            ((void*)percent);
            instance = context;
        }
        else
            instance = domTy->getInstanceDecl();

        if (instance->isParameterized() && instance->isDependent()) {
            RewriteScope scope(rewrites);
            addInstanceRewrites(instance);
            return resolveType(instance->getRepresentationType());
        }
        else
            return resolveType(instance->getRepresentationType());
    }
    else if (const IncompleteType *IT = dyn_cast<IncompleteType>(type))
        return resolveType(IT->getCompleteType());

    return type;
}

const llvm::Type *CodeGenTypes::lowerDomainType(const DomainType *type)
{
    const llvm::Type *entry = 0;

    if (type->isAbstract())
        type = rewriteAbstractDecl(type->getAbstractDecl());

    if (const PercentDecl *percent = type->getPercentDecl()) {
        assert(percent->getDefinition() == context->getDefinition() &&
               "Inconsistent context for PercentDecl!");
        ((void*)percent);
        entry = lowerType(context->getRepresentationType());
    }
    else {
        const DomainInstanceDecl *instance = type->getInstanceDecl();
        if (instance->isParameterized()) {
            RewriteScope scope(rewrites);
            addInstanceRewrites(instance);
            entry = lowerType(instance->getRepresentationType());
        }
        else
            entry = lowerType(instance->getRepresentationType());
    }
    return entry;
}

const llvm::FunctionType *
CodeGenTypes::lowerSubroutine(const SubroutineDecl *decl)
{
    std::vector<const llvm::Type*> args;
    const llvm::Type *retTy = 0;

    if (const FunctionDecl *fdecl = dyn_cast<FunctionDecl>(decl)) {

        const Type *targetTy = fdecl->getReturnType();

        switch (getConvention(decl)) {

        case CC_Simple:
            // Standard return.
            retTy = lowerType(targetTy);
            break;

        case CC_Sret: {
            // Push a pointer to the returned object as an implicit first
            // parameter.
            const llvm::Type *sretTy = lowerType(fdecl->getReturnType());
            args.push_back(sretTy->getPointerTo());
            retTy = CG.getVoidTy();
            break;
        }

        case CC_Vstack:
            // The return value propagates on the vstack, hense a void return
            // type.
            retTy = CG.getVoidTy();
            break;
        }
    }
    else
        retTy = CG.getVoidTy();

    // Emit the implicit first "%" argument, unless this is an imported
    // subroutine using the C convention.
    //
    // FIXME: All imports currently use the C convention, hence the following
    // simplistic test.
    if (!decl->findPragma(pragma::Import))
        args.push_back(CG.getRuntime().getType<CommaRT::CRT_DomainInstance>());

    SubroutineDecl::const_param_iterator I = decl->begin_params();
    SubroutineDecl::const_param_iterator E = decl->end_params();
    for ( ; I != E; ++I) {
        const ParamValueDecl *param = *I;
        const Type *paramTy = resolveType(param->getType());
        const llvm::Type *loweredTy = lowerType(paramTy);

        if (const CompositeType *compTy = dyn_cast<CompositeType>(paramTy)) {
            // We never pass composite types by value, always by reference.
            // Therefore, the parameter mode does not change how we pass the
            // argument.
            args.push_back(loweredTy->getPointerTo());

            // If the parameter is an unconstrained array generate an implicit
            // second argument for the bounds.
            if (const ArrayType *arrTy = dyn_cast<ArrayType>(compTy)) {
                if (!compTy->isConstrained())
                    args.push_back(lowerArrayBounds(arrTy)->getPointerTo());
            }
        }
        else if (paramTy->isFatAccessType()) {
            // Fat pointers are passed by reference just like normal composite
            // values and are therefore indifferent to the mode.
            args.push_back(loweredTy->getPointerTo());
        }
        else {
            // If the argument mode is "out" or "in out", make the argument a
            // pointer-to type.
            PM::ParameterMode mode = param->getParameterMode();
            if (mode == PM::MODE_OUT or mode == PM::MODE_IN_OUT)
                loweredTy = loweredTy->getPointerTo();
            args.push_back(loweredTy);
        }
    }

    return llvm::FunctionType::get(retTy, args, false);
}

const llvm::IntegerType *CodeGenTypes::lowerDiscreteType(const DiscreteType *type)
{
    // FIXME: This should be fast enough that populating the type map would not
    // be advantageous.  However, no benchmarking has been done to substantiate
    // this claim.
    return getTypeForWidth(type->getSize());
}

const llvm::ArrayType *CodeGenTypes::lowerArrayType(const ArrayType *type)
{
    assert(type->getRank() == 1 &&
           "Cannot codegen multidimensional arrays yet!");

    const llvm::Type *elementTy = lowerType(type->getComponentType());

    // If the array is unconstrained, emit a variable length array type, which
    // in LLVM is represented as an array with zero elements.
    if (!type->isConstrained())
        return llvm::ArrayType::get(elementTy, 0);

    const DiscreteType *idxTy = type->getIndexType(0);

    // Compute the bounds for the index.  If the index is itself range
    // constrained use the bounds of the range, otherwise use the bounds of the
    // root type.
    llvm::APInt lowerBound(idxTy->getSize(), 0);
    llvm::APInt upperBound(idxTy->getSize(), 0);
    if (const IntegerType *subTy = dyn_cast<IntegerType>(idxTy)) {
        if (subTy->isConstrained()) {
            if (subTy->isStaticallyConstrained()) {
                const Range *range = subTy->getConstraint();
                lowerBound = range->getStaticLowerBound();
                upperBound = range->getStaticUpperBound();
            }
            else
                return llvm::ArrayType::get(elementTy, 0);
        }
        else {
            const IntegerType *rootTy = subTy->getRootType();
            rootTy->getLowerLimit(lowerBound);
            rootTy->getUpperLimit(upperBound);
        }
    }
    else {
        // FIXME: Use range constraints here.
        const EnumerationType *enumTy = cast<EnumerationType>(idxTy);
        assert(enumTy && "Unexpected array index type!");
        lowerBound = 0;
        upperBound = enumTy->getNumLiterals() - 1;
    }

    uint64_t numElems;
    numElems = getArrayWidth(lowerBound, upperBound, idxTy->isSigned());
    const llvm::ArrayType *result = llvm::ArrayType::get(elementTy, numElems);
    return result;
}

const llvm::StructType *CodeGenTypes::lowerRecordType(const RecordType *recTy)
{
    unsigned maxAlignment = 0;
    uint64_t currentOffset = 0;
    uint64_t requiredOffset = 0;
    unsigned currentIndex = 0;
    std::vector<const llvm::Type*> fields;

    const RecordDecl *recDecl = recTy->getDefiningDecl();
    for (unsigned i = 0; i < recDecl->numComponents(); ++i) {
        const ComponentDecl *componentDecl = recDecl->getComponent(i);
        const llvm::Type *componentTy = lowerType(componentDecl->getType());
        unsigned alignment = getTypeAlignment(componentTy);
        requiredOffset = llvm::TargetData::RoundUpAlignment(currentOffset,
                                                            alignment);
        maxAlignment = std::max(maxAlignment, alignment);

        // Output as many i8's as needed to bring the current offset upto the
        // required offset, then emit the actual field.
        while (currentOffset < requiredOffset) {
            fields.push_back(CG.getInt8Ty());
            currentOffset++;
            currentIndex++;
        }
        fields.push_back(componentTy);
        ComponentIndices[componentDecl] = currentIndex;
        currentOffset = requiredOffset + getTypeSize(componentTy);
        currentIndex++;
    }

    // Pad out the record if needed.
    requiredOffset = llvm::TargetData::RoundUpAlignment(currentOffset,
                                                        maxAlignment);
    while (currentOffset < requiredOffset) {
        fields.push_back(CG.getInt8Ty());
        currentOffset++;
    }

    const llvm::StructType *result;
    result = llvm::StructType::get(CG.getLLVMContext(), fields);
    return result;
}

const llvm::Type *CodeGenTypes::lowerIncompleteType(const IncompleteType *type)
{
    return lowerType(type->getCompleteType());
}

const llvm::PointerType *
CodeGenTypes::lowerThinAccessType(const AccessType *access)
{
    assert(access->isThinAccessType() && "Use lowerFatAccessType instead!");

    // Access types are the primary channel thru which circular data types are
    // constructed.  If we have not yet lowered this access type, construct a
    // PATypeHandle to an opaque type and immediately associate it with the
    // corresponding Comma type.  Once the target type of the access has been
    // lowered, resolve the handle and replace with the fully resolved type.
    //
    // FIXME: Since opaque types are always allocated anew (all opaque types are
    // unique) it might be better to try and be smart about when the pointee
    // type gets deferred.  In fact, we may be able to guarantee that cycles are
    // never introduced unless the pointee is an incomplete type.
    const llvm::Type *&entry = getLoweredType(access);
    if (entry)
        return llvm::cast<llvm::PointerType>(entry);

    llvm::PATypeHolder holder = llvm::OpaqueType::get(CG.getLLVMContext());
    const llvm::PointerType *barrier = llvm::PointerType::getUnqual(holder);

    entry = barrier;
    const llvm::Type *targetType = lowerType(access->getTargetType());

    // Refine the type holder and update the entry corresponding to this access
    // type in the type map.
    cast<llvm::OpaqueType>(holder.get())->refineAbstractTypeTo(targetType);
    const llvm::PointerType *result = holder.get()->getPointerTo();
    entry = result;

    return result;
}

const llvm::StructType *
CodeGenTypes::lowerFatAccessType(const AccessType *access)
{
    assert(access->isFatAccessType() && "Use lowerThinAccessType instead!");

    const llvm::Type *&entry = getLoweredType(access);
    if (entry)
        return llvm::cast<llvm::StructType>(entry);

    // Just as with thin access types, construct a barrier and obtain a pointer
    // to the target.
    llvm::PATypeHolder holder = llvm::OpaqueType::get(CG.getLLVMContext());
    const llvm::PointerType *barrier = llvm::PointerType::getUnqual(holder);

    entry = barrier;
    const llvm::Type *targetType = lowerType(access->getTargetType());

    // Refine the type holder and update the entry corresponding to this access
    // type in the type map.
    cast<llvm::OpaqueType>(holder.get())->refineAbstractTypeTo(targetType);
    const llvm::PointerType *pointerTy = holder.get()->getPointerTo();

    // The only kind of indefinite type supported ATM are array types.  Get the
    // corresponding bounds structure.
    const ArrayType *indefiniteTy = cast<ArrayType>(access->getTargetType());
    const llvm::StructType *boundsTy = lowerArrayBounds(indefiniteTy);

    // Build the fat pointer structure.
    std::vector<const llvm::Type*> elements;
    elements.push_back(pointerTy);
    elements.push_back(boundsTy);

    const llvm::StructType *result;
    result = llvm::StructType::get(CG.getLLVMContext(), elements);
    entry = result;
    return result;
}

const llvm::Type *CodeGenTypes::lowerAccessType(const AccessType *type)
{
    if (type->isThinAccessType())
        return lowerThinAccessType(type);
    else
        return lowerFatAccessType(type);
}

const llvm::Type *CodeGenTypes::lowerUniversalType(const UniversalType *type)
{
    if (type->isUniversalIntegerType()) {
        // One might think that we cannot lower a value of type
        // universal_integer since such a type morally has arbitrary precision.
        // However, in practice there is never a case where the value of such a
        // type is exceeds the capacity of the machine.  This is due several
        // facts:
        //
        //    - the language does not produce individual values of universal
        //      type that exceed the machines representational limits.
        //
        //    - universal types do not provide operations and so must always go
        //      thru fixed width arithmetic channels.
        //
        //    - Static expressions are evaluated and diagnosed at compile time.
        return CG.getIntPtrTy();
    }
    else {
        assert(false && "Cannot lower the given universal type.");
    }
    return 0;
}

unsigned CodeGenTypes::getComponentIndex(const ComponentDecl *component)
{
    ComponentIndexMap::iterator I = ComponentIndices.find(component);

    // Lookup can fail if the record type associated with this component has not
    // been lowered yet.
    if (I == ComponentIndices.end()) {
        lowerRecordType(component->getDeclRegion()->getType());
        I = ComponentIndices.find(component);
    }

    assert (I != ComponentIndices.end()  && "Component index does not exist!");
    return I->second;
}

const llvm::StructType *CodeGenTypes::lowerArrayBounds(const ArrayType *arrTy)
{
    std::vector<const llvm::Type*> elts;
    const ArrayType *baseTy = arrTy->getRootType();

    for (unsigned i = 0; i < baseTy->getRank(); ++i) {
        const llvm::Type *boundTy = lowerType(baseTy->getIndexType(i));
        elts.push_back(boundTy);
        elts.push_back(boundTy);
    }

    return CG.getStructTy(elts);
}

const llvm::StructType *
CodeGenTypes::lowerScalarBounds(const DiscreteType *type)
{
    std::vector<const llvm::Type*> elts;
    const llvm::Type *elemTy = lowerType(type);
    elts.push_back(elemTy);
    elts.push_back(elemTy);
    return CG.getStructTy(elts);
}

const llvm::StructType *CodeGenTypes::lowerRange(const Range *range)
{
    std::vector<const llvm::Type*> elts;
    const llvm::Type *elemTy = lowerType(range->getType());
    elts.push_back(elemTy);
    elts.push_back(elemTy);
    return CG.getStructTy(elts);
}

const llvm::IntegerType *CodeGenTypes::getTypeForWidth(unsigned numBits)
{
    // Promote the bit width to a power of two.
    if (numBits <= 1)
        return CG.getInt1Ty();
    if (numBits <= 8)
        return CG.getInt8Ty();
    else if (numBits <= 16)
        return CG.getInt16Ty();
    else if (numBits <= 32)
        return CG.getInt32Ty();
    else if (numBits <= 64)
        return CG.getInt64Ty();
    else {
        // FIXME: This should be a fatal error, not an assert.
        assert(false && "Bit size too large to codegen!");
        return 0;
    }
}

CodeGenTypes::CallConvention
CodeGenTypes::getConvention(const SubroutineDecl *decl)
{
    const FunctionDecl *fdecl = dyn_cast<FunctionDecl>(decl);

    // Although not strictly needed for procedures, claiming they follow the
    // simple convention is reasonable.
    if (!fdecl) return CC_Simple;

    const PrimaryType *targetTy;
    targetTy = dyn_cast<PrimaryType>(resolveType(fdecl->getReturnType()));

    // If this is not a primary type use the simple convention.
    if (!targetTy)
        return CC_Simple;

    // If the return type is a fat access type we always use the sret
    // convention.
    if (targetTy->isFatAccessType())
        return CC_Sret;

    // If composite and unconstrained we return on the vstack.
    if (targetTy->isCompositeType() && targetTy->isUnconstrained())
        return CC_Vstack;

    // If composite and constrained we use the sret convention.
    if (targetTy->isCompositeType())
        return CC_Sret;

    // Otherwise nothing special is needed.
    return CC_Simple;
}

---