blob: 2eebbe9fc05e6f1044a340bf7c808c6b709dc389 [file] [log] [blame]
/* LLVM LOCAL begin (ENTIRE FILE!) */
/* Internal interfaces between the LLVM backend components
Copyright (C) 2005, 2006, 2007 Free Software Foundation, Inc.
Contributed by Chris Lattner (sabre@nondot.org)
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING. If not, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA
02111-1307, USA. */
//===----------------------------------------------------------------------===//
// This is a C++ header file that defines the internal interfaces shared among
// the llvm-*.cpp files.
//===----------------------------------------------------------------------===//
#ifndef LLVM_INTERNAL_H
#define LLVM_INTERNAL_H
#include <vector>
#include <cassert>
#include <map>
#include <string>
#include "llvm/CallingConv.h"
#include "llvm/Intrinsics.h"
#include "llvm/ADT/IndexedMap.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/SetVector.h"
#include "llvm/System/DataTypes.h"
#include "llvm/Support/IRBuilder.h"
#include "llvm/Support/MathExtras.h"
#include "llvm/Support/TargetFolder.h"
#include "llvm/Support/raw_os_ostream.h"
extern "C" {
#include "llvm.h"
}
namespace llvm {
class Module;
class GlobalVariable;
class Function;
class GlobalValue;
class BasicBlock;
class Instruction;
class AllocaInst;
class BranchInst;
class Value;
class Constant;
class ConstantInt;
class Type;
class FunctionType;
class TargetMachine;
class TargetData;
class DebugInfo;
}
using namespace llvm;
typedef IRBuilder<true, TargetFolder> LLVMBuilder;
typedef SmallPtrSet<union tree_node *, 16> treeset;
/// TheModule - This is the current global module that we are compiling into.
///
extern llvm::Module *TheModule;
/// TheDebugInfo - This object is responsible for gather all debug information.
/// If its value is NULL then no debug information should be gathered.
extern llvm::DebugInfo *TheDebugInfo;
/// TheTarget - The current target being compiled for.
///
extern llvm::TargetMachine *TheTarget;
/// TheFolder - The constant folder to use.
extern TargetFolder *TheFolder;
/// getTargetData - Return the current TargetData object from TheTarget.
const TargetData &getTargetData();
/// AttributeUsedGlobals - The list of globals that are marked attribute(used).
extern SmallSetVector<Constant *,32> AttributeUsedGlobals;
extern Constant* ConvertMetadataStringToGV(const char* str);
/// AddAnnotateAttrsToGlobal - Adds decls that have a
/// annotate attribute to a vector to be emitted later.
extern void AddAnnotateAttrsToGlobal(GlobalValue *GV, union tree_node* decl);
void changeLLVMConstant(Constant *Old, Constant *New);
void readLLVMTypesStringTable();
void writeLLVMTypesStringTable();
void readLLVMValues();
void writeLLVMValues();
void readLLVMTypeUsers();
void writeLLVMTypeUsers();
void eraseLocalLLVMValues();
void clearTargetBuiltinCache();
const char* extractRegisterName(union tree_node*);
void handleVisibility(union tree_node* decl, GlobalValue *GV);
struct StructTypeConversionInfo;
/// Return true if and only if field no. N from struct type T is a padding
/// element added to match llvm struct type size and gcc struct type size.
bool isPaddingElement(union tree_node*, unsigned N);
/// TypeConverter - Implement the converter from GCC types to LLVM types.
///
class TypeConverter {
/// ConvertingStruct - If we are converting a RECORD or UNION to an LLVM type
/// we set this flag to true.
bool ConvertingStruct;
/// PointersToReresolve - When ConvertingStruct is true, we handling of
/// POINTER_TYPE, REFERENCE_TYPE, and BLOCK_POINTER_TYPE is changed to return
/// opaque*'s instead of recursively calling ConvertType. When this happens,
/// we add the POINTER_TYPE to this list.
///
std::vector<tree_node*> PointersToReresolve;
public:
TypeConverter() : ConvertingStruct(false) {}
const Type *ConvertType(tree_node *type);
/// GCCTypeOverlapsWithLLVMTypePadding - Return true if the specified GCC type
/// has any data that overlaps with structure padding in the specified LLVM
/// type.
static bool GCCTypeOverlapsWithLLVMTypePadding(tree_node *t, const Type *Ty);
/// ConvertFunctionType - Convert the specified FUNCTION_TYPE or METHOD_TYPE
/// tree to an LLVM type. This does the same thing that ConvertType does, but
/// it also returns the function's LLVM calling convention and attributes.
const FunctionType *ConvertFunctionType(tree_node *type,
tree_node *decl,
tree_node *static_chain,
CallingConv::ID &CallingConv,
AttrListPtr &PAL);
/// ConvertArgListToFnType - Given a DECL_ARGUMENTS list on an GCC tree,
/// return the LLVM type corresponding to the function. This is useful for
/// turning "T foo(...)" functions into "T foo(void)" functions.
const FunctionType *ConvertArgListToFnType(tree_node *type,
tree_node *arglist,
tree_node *static_chain,
CallingConv::ID &CallingConv,
AttrListPtr &PAL);
private:
const Type *ConvertRECORD(tree_node *type, tree_node *orig_type);
const Type *ConvertUNION(tree_node *type, tree_node *orig_type);
bool DecodeStructFields(tree_node *Field, StructTypeConversionInfo &Info);
void DecodeStructBitField(tree_node *Field, StructTypeConversionInfo &Info);
void SelectUnionMember(tree_node *type, StructTypeConversionInfo &Info);
};
extern TypeConverter *TheTypeConverter;
/// ConvertType - Convert the specified tree type to an LLVM type.
///
inline const Type *ConvertType(tree_node *type) {
return TheTypeConverter->ConvertType(type);
}
/// getINTEGER_CSTVal - Return the specified INTEGER_CST value as a uint64_t.
///
uint64_t getINTEGER_CSTVal(tree_node *exp);
/// isInt64 - Return true if t is an INTEGER_CST that fits in a 64 bit integer.
/// If Unsigned is false, returns whether it fits in a int64_t. If Unsigned is
/// true, returns whether the value is non-negative and fits in a uint64_t.
/// Always returns false for overflowed constants.
bool isInt64(tree_node *t, bool Unsigned);
/// getInt64 - Extract the value of an INTEGER_CST as a 64 bit integer. If
/// Unsigned is false, the value must fit in a int64_t. If Unsigned is true,
/// the value must be non-negative and fit in a uint64_t. Must not be used on
/// overflowed constants. These conditions can be checked by calling isInt64.
uint64_t getInt64(tree_node *t, bool Unsigned);
/// getPointerAlignment - Return the alignment in bytes of exp, a pointer valued
/// expression, or 1 if the alignment is not known.
unsigned int getPointerAlignment(tree_node *exp);
/// isPassedByInvisibleReference - Return true if the specified type should be
/// passed by 'invisible reference'. In other words, instead of passing the
/// thing by value, pass the address of a temporary.
bool isPassedByInvisibleReference(tree_node *type);
/// isSequentialCompatible - Return true if the specified gcc array or pointer
/// type and the corresponding LLVM SequentialType lay out their components
/// identically in memory, so doing a GEP accesses the right memory location.
/// We assume that objects without a known size do not.
bool isSequentialCompatible(tree_node *type);
/// isBitfield - Returns whether to treat the specified field as a bitfield.
bool isBitfield(tree_node *field_decl);
/// getDeclaredType - Get the declared type for the specified field, and
/// not the shrunk-to-fit type that GCC gives us in TREE_TYPE.
tree_node *getDeclaredType(tree_node *field_decl);
/// ValidateRegisterVariable - Check that a static "asm" variable is
/// well-formed. If not, emit error messages and return true. If so, return
/// false.
bool ValidateRegisterVariable(tree_node *decl);
/// MemRef - This struct holds the information needed for a memory access:
/// a pointer to the memory, its alignment and whether the access is volatile.
struct MemRef {
Value *Ptr;
bool Volatile;
private:
unsigned char LogAlign;
public:
MemRef() : Ptr(0), Volatile(false), LogAlign(0) {}
MemRef(Value *P, uint32_t A, bool V) : Ptr(P), Volatile(V) {
// Forbid alignment 0 along with non-power-of-2 alignment values.
assert(isPowerOf2_32(A) && "Alignment not a power of 2!");
LogAlign = Log2_32(A);
}
uint32_t getAlignment() const {
return 1U << LogAlign;
}
};
/// LValue - This struct represents an lvalue in the program. In particular,
/// the Ptr member indicates the memory that the lvalue lives in. Alignment
/// is the alignment of the memory (in bytes).If this is a bitfield reference,
/// BitStart indicates the first bit in the memory that is part of the field
/// and BitSize indicates the extent.
///
/// "LValue" is intended to be a light-weight object passed around by-value.
struct LValue {
Value *Ptr;
unsigned char BitStart;
unsigned char BitSize;
private:
unsigned char LogAlign;
public:
LValue() : Ptr(0), BitStart(255), BitSize(255), LogAlign(0) {}
LValue(Value *P, uint32_t A) : Ptr(P), BitStart(255), BitSize(255) {
// Forbid alignment 0 along with non-power-of-2 alignment values.
assert(isPowerOf2_32(A) && "Alignment not a power of 2!");
LogAlign = Log2_32(A);
}
LValue(Value *P, uint32_t A, unsigned BSt, unsigned BSi)
: Ptr(P), BitStart(BSt), BitSize(BSi) {
assert(BitStart == BSt && BitSize == BSi &&
"Bit values larger than 256?");
// Forbid alignment 0 along with non-power-of-2 alignment values.
assert(isPowerOf2_32(A) && "Alignment not a power of 2!");
LogAlign = Log2_32(A);
}
uint32_t getAlignment() const {
return 1U << LogAlign;
}
bool isBitfield() const { return BitStart != 255; }
};
/// TreeToLLVM - An instance of this class is created and used to convert the
/// body of each function to LLVM.
///
class TreeToLLVM {
// State that is initialized when the function starts.
const TargetData &TD;
tree_node *FnDecl;
Function *Fn;
BasicBlock *ReturnBB;
BasicBlock *UnwindBB;
unsigned ReturnOffset;
// Lexical BLOCKS that we have previously seen and processed.
treeset SeenBlocks;
// State that changes as the function is emitted.
/// Builder - Instruction creator, the location to insert into is always the
/// same as &Fn->back().
LLVMBuilder Builder;
// AllocaInsertionPoint - Place to insert alloca instructions. Lazily created
// and managed by CreateTemporary.
Instruction *AllocaInsertionPoint;
/// UniquedValues - Values defined using a no-op bitcast in order to make them
/// unique. These can be simplified once the function has been emitted.
std::vector<BitCastInst *> UniquedValues;
/// GreatestAlignment - The largest alignment seen on a variable declaration.
/// With stack realignment the TargetMachine's frame info won't be sufficient
/// to determine the greatest stack alignment.
unsigned GreatestAlignment;
/// SeenVLA - Whether or not we have a VLA in the current function. This
/// and dynamic stack realignment currently conflict so we'll use this to
/// warn later.
tree_node *SeenVLA;
//===---------------------- Exception Handling --------------------------===//
/// LandingPads - The landing pad for a given EH region.
IndexedMap<BasicBlock *> LandingPads;
/// PostPads - The post landing pad for a given EH region.
IndexedMap<BasicBlock *> PostPads;
/// CatchAll - Language specific catch-all object.
GlobalVariable *CatchAll;
/// ExceptionValue - Is the local to receive the current exception.
Value *ExceptionValue;
/// ExceptionSelectorValue - Is the local to receive the current exception
/// selector.
Value *ExceptionSelectorValue;
/// FuncEHException - Function used to receive the exception.
Function *FuncEHException;
/// FuncEHSelector - Function used to receive the exception selector.
Function *FuncEHSelector;
/// FuncEHGetTypeID - Function used to return type id for give typeinfo.
Function *FuncEHGetTypeID;
public:
TreeToLLVM(tree_node *fndecl);
~TreeToLLVM();
/// getFUNCTION_DECL - Return the FUNCTION_DECL node for the current function
/// being compiled.
tree_node *getFUNCTION_DECL() const { return FnDecl; }
/// EmitFunction - Convert 'fndecl' to LLVM code.
Function *EmitFunction();
/// EmitLV - Convert the specified l-value tree node to LLVM code, returning
/// the address of the result.
LValue EmitLV(tree_node *exp);
/// getIndirectGotoBlock - Get (and potentially lazily create) the indirect
/// goto block.
BasicBlock *getIndirectGotoBlock();
void TODO(tree_node *exp = 0);
/// CastToType - Cast the specified value to the specified type if it is
/// not already that type.
Value *CastToType(unsigned opcode, Value *V, const Type *Ty);
Value *CastToType(unsigned opcode, Value *V, tree_node *type) {
return CastToType(opcode, V, ConvertType(type));
}
/// CastToAnyType - Cast the specified value to the specified type regardless
/// of the types involved. This is an inferred cast.
Value *CastToAnyType (Value *V, bool VSigned, const Type* Ty, bool TySigned);
/// CastToUIntType - Cast the specified value to the specified type assuming
/// that V's type and Ty are integral types. This arbitrates between BitCast,
/// Trunc and ZExt.
Value *CastToUIntType(Value *V, const Type* Ty);
/// CastToSIntType - Cast the specified value to the specified type assuming
/// that V's type and Ty are integral types. This arbitrates between BitCast,
/// Trunc and SExt.
Value *CastToSIntType(Value *V, const Type* Ty);
/// CastToFPType - Cast the specified value to the specified type assuming
/// that V's type and Ty are floating point types. This arbitrates between
/// BitCast, FPTrunc and FPExt.
Value *CastToFPType(Value *V, const Type* Ty);
/// NOOPCastToType - Insert a BitCast from V to Ty if needed. This is just a
/// convenience function for CastToType(Instruction::BitCast, V, Ty);
Value *BitCastToType(Value *V, const Type *Ty);
/// CreateTemporary - Create a new alloca instruction of the specified type,
/// inserting it into the entry block and returning it. The resulting
/// instruction's type is a pointer to the specified type.
AllocaInst *CreateTemporary(const Type *Ty, unsigned align=0);
/// CreateTempLoc - Like CreateTemporary, but returns a MemRef.
MemRef CreateTempLoc(const Type *Ty);
/// EmitAggregateCopy - Copy the elements from SrcLoc to DestLoc, using the
/// GCC type specified by GCCType to know which elements to copy.
void EmitAggregateCopy(MemRef DestLoc, MemRef SrcLoc, tree_node *GCCType);
// 'desired' and 'grand' are GCC BLOCK nodes, representing lexical
// blocks. Assumes we're in the 'grand' context; push contexts
// until we reach the 'desired' context.
void push_regions(tree_node *desired, tree_node *grand);
// Given a GCC lexical context (BLOCK or FUNCTION_DECL), make it the
// new current BLOCK/context/scope. Emit any local variables found
// in the new context. Note that the variable emission order must be
// consistent with and without debug info; otherwise, the register
// allocation would change with -g, and users dislike that.
void switchLexicalBlock(tree_node *exp);
/// StartFunctionBody - Start the emission of 'FnDecl', outputing all
/// declarations for parameters and setting things up.
void StartFunctionBody();
private: // Helper functions.
// Walk over the lexical BLOCK() tree of the given FUNCTION_DECL;
// set the BLOCK_NUMBER() fields to the depth of each block, and
// add every var or type encountered in the BLOCK_VARS() lists to
// the given set.
void setLexicalBlockDepths(tree_node *t, treeset &s, unsigned level);
/// FinishFunctionBody - Once the body of the function has been emitted, this
/// cleans up and returns the result function.
Function *FinishFunctionBody();
/// Emit - Convert the specified tree node to LLVM code. If the node is an
/// expression that fits into an LLVM scalar value, the result is returned. If
/// the result is an aggregate, it is stored into the location specified by
/// DestLoc.
Value *Emit(tree_node *exp, const MemRef *DestLoc);
/// EmitBlock - Add the specified basic block to the end of the function. If
/// the previous block falls through into it, add an explicit branch.
void EmitBlock(BasicBlock *BB);
/// EmitAggregateZero - Zero the elements of DestLoc.
///
void EmitAggregateZero(MemRef DestLoc, tree_node *GCCType);
/// EmitMemCpy/EmitMemMove/EmitMemSet - Emit an llvm.memcpy/llvm.memmove or
/// llvm.memset call with the specified operands. Returns DestPtr bitcast
/// to i8*.
Value *EmitMemCpy(Value *DestPtr, Value *SrcPtr, Value *Size, unsigned Align);
Value *EmitMemMove(Value *DestPtr, Value *SrcPtr, Value *Size, unsigned Align);
Value *EmitMemSet(Value *DestPtr, Value *SrcVal, Value *Size, unsigned Align);
/// EmitLandingPads - Emit EH landing pads.
void EmitLandingPads();
/// EmitPostPads - Emit EH post landing pads.
void EmitPostPads();
/// EmitUnwindBlock - Emit the lazily created EH unwind block.
void EmitUnwindBlock();
/// EmitDebugInfo - Return true if debug info is to be emitted for current
/// function.
bool EmitDebugInfo();
private: // Helpers for exception handling.
/// CreateExceptionValues - Create values used internally by exception
/// handling.
void CreateExceptionValues();
/// getPostPad - Return the post landing pad for the given exception handling
/// region, creating it if necessary.
BasicBlock *getPostPad(unsigned RegionNo);
private:
void EmitAutomaticVariableDecl(tree_node *decl);
/// isNoopCast - Return true if a cast from V to Ty does not change any bits.
///
static bool isNoopCast(Value *V, const Type *Ty);
void HandleMultiplyDefinedGimpleTemporary(tree_node *var);
/// EmitAnnotateIntrinsic - Emits call to annotate attr intrinsic
void EmitAnnotateIntrinsic(Value *V, tree_node *decl);
/// EmitTypeGcroot - Emits call to make type a gcroot
void EmitTypeGcroot(Value *V, tree_node *decl);
private:
// Emit* - These are delegates from Emit, and have the same parameter
// characteristics.
// Control flow.
Value *EmitLABEL_EXPR(tree_node *exp);
Value *EmitGOTO_EXPR(tree_node *exp);
Value *EmitRETURN_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitCOND_EXPR(tree_node *exp);
Value *EmitSWITCH_EXPR(tree_node *exp);
// Expressions.
Value *EmitLoadOfLValue(tree_node *exp, const MemRef *DestLoc);
Value *EmitOBJ_TYPE_REF(tree_node *exp, const MemRef *DestLoc);
Value *EmitADDR_EXPR(tree_node *exp);
Value *EmitOBJ_TYPE_REF(tree_node *exp);
Value *EmitCALL_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitCallOf(Value *Callee, tree_node *exp, const MemRef *DestLoc,
const AttrListPtr &PAL);
Value *EmitMODIFY_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitFP16Conversion(tree_node *fromty, tree_node *toty, Value *V);
Value *EmitNOP_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitCONVERT_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitVIEW_CONVERT_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitNEGATE_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitCONJ_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitABS_EXPR(tree_node *exp);
Value *EmitBIT_NOT_EXPR(tree_node *exp);
Value *EmitTRUTH_NOT_EXPR(tree_node *exp);
Value *EmitEXACT_DIV_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitCompare(tree_node *exp, unsigned UIPred, unsigned SIPred,
unsigned FPPred, const Type *DestTy = 0);
Value *EmitBinOp(tree_node *exp, const MemRef *DestLoc, unsigned Opc);
Value *EmitPtrBinOp(tree_node *exp, unsigned Opc);
Value *EmitTruthOp(tree_node *exp, unsigned Opc);
Value *EmitShiftOp(tree_node *exp, const MemRef *DestLoc, unsigned Opc);
Value *EmitRotateOp(tree_node *exp, unsigned Opc1, unsigned Opc2);
Value *EmitMinMaxExpr(tree_node *exp, unsigned UIPred, unsigned SIPred,
unsigned Opc);
Value *EmitFLOOR_MOD_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitCEIL_DIV_EXPR(tree_node *exp);
Value *EmitFLOOR_DIV_EXPR(tree_node *exp);
Value *EmitROUND_DIV_EXPR(tree_node *exp);
Value *EmitFieldAnnotation(Value *FieldPtr, tree_node *FieldDecl);
// Exception Handling.
Value *EmitEXC_PTR_EXPR(tree_node *exp);
Value *EmitFILTER_EXPR(tree_node *exp);
Value *EmitRESX_EXPR(tree_node *exp);
// Inline Assembly and Register Variables.
Value *EmitASM_EXPR(tree_node *exp);
Value *EmitReadOfRegisterVariable(tree_node *vardecl, const MemRef *DestLoc);
void EmitModifyOfRegisterVariable(tree_node *vardecl, Value *RHS);
Value *EmitMoveOfRegVariableToRightReg(Instruction *I, tree_node *decl);
// Helpers for Builtin Function Expansion.
void EmitMemoryBarrier(bool ll, bool ls, bool sl, bool ss, bool device);
Value *BuildVector(const std::vector<Value*> &Elts);
Value *BuildVector(Value *Elt, ...);
Value *BuildVectorShuffle(Value *InVec1, Value *InVec2, ...);
Value *BuildBinaryAtomicBuiltin(tree_node *exp, Intrinsic::ID id);
Value *BuildCmpAndSwapAtomicBuiltin(tree_node *exp, tree_node *type,
bool isBool);
// Builtin Function Expansion.
bool EmitBuiltinCall(tree_node *exp, tree_node *fndecl,
const MemRef *DestLoc, Value *&Result);
bool EmitFrontendExpandedBuiltinCall(tree_node *exp, tree_node *fndecl,
const MemRef *DestLoc, Value *&Result);
bool EmitBuiltinUnaryOp(Value *InVal, Value *&Result, Intrinsic::ID Id);
Value *EmitBuiltinSQRT(tree_node *exp);
Value *EmitBuiltinPOWI(tree_node *exp);
Value *EmitBuiltinPOW(tree_node *exp);
bool EmitBuiltinConstantP(tree_node *exp, Value *&Result);
bool EmitBuiltinAlloca(tree_node *exp, Value *&Result);
bool EmitBuiltinExpect(tree_node *exp, const MemRef *DestLoc, Value *&Result);
bool EmitBuiltinExtendPointer(tree_node *exp, Value *&Result);
bool EmitBuiltinVAStart(tree_node *exp);
bool EmitBuiltinVAEnd(tree_node *exp);
bool EmitBuiltinVACopy(tree_node *exp);
bool EmitBuiltinMemCopy(tree_node *exp, Value *&Result,
bool isMemMove, bool SizeCheck);
bool EmitBuiltinMemSet(tree_node *exp, Value *&Result, bool SizeCheck);
bool EmitBuiltinBZero(tree_node *exp, Value *&Result);
bool EmitBuiltinPrefetch(tree_node *exp);
bool EmitBuiltinReturnAddr(tree_node *exp, Value *&Result, bool isFrame);
bool EmitBuiltinExtractReturnAddr(tree_node *exp, Value *&Result);
bool EmitBuiltinFrobReturnAddr(tree_node *exp, Value *&Result);
bool EmitBuiltinStackSave(tree_node *exp, Value *&Result);
bool EmitBuiltinStackRestore(tree_node *exp);
bool EmitBuiltinDwarfCFA(tree_node *exp, Value *&Result);
bool EmitBuiltinDwarfSPColumn(tree_node *exp, Value *&Result);
bool EmitBuiltinEHReturnDataRegno(tree_node *exp, Value *&Result);
bool EmitBuiltinEHReturn(tree_node *exp, Value *&Result);
bool EmitBuiltinInitDwarfRegSizes(tree_node *exp, Value *&Result);
bool EmitBuiltinUnwindInit(tree_node *exp, Value *&Result);
bool EmitBuiltinInitTrampoline(tree_node *exp, Value *&Result);
// Complex Math Expressions.
void EmitLoadFromComplex(Value *&Real, Value *&Imag, MemRef SrcComplex);
void EmitStoreToComplex(MemRef DestComplex, Value *Real, Value *Imag);
void EmitCOMPLEX_CST(tree_node *exp, const MemRef *DestLoc);
void EmitCOMPLEX_EXPR(tree_node *exp, const MemRef *DestLoc);
Value *EmitComplexBinOp(tree_node *exp, const MemRef *DestLoc);
// L-Value Expressions.
LValue EmitLV_ARRAY_REF(tree_node *exp);
LValue EmitLV_BIT_FIELD_REF(tree_node *exp);
LValue EmitLV_COMPONENT_REF(tree_node *exp);
LValue EmitLV_DECL(tree_node *exp);
LValue EmitLV_EXC_PTR_EXPR(tree_node *exp);
LValue EmitLV_FILTER_EXPR(tree_node *exp);
LValue EmitLV_INDIRECT_REF(tree_node *exp);
LValue EmitLV_VIEW_CONVERT_EXPR(tree_node *exp);
LValue EmitLV_WITH_SIZE_EXPR(tree_node *exp);
LValue EmitLV_XXXXPART_EXPR(tree_node *exp, unsigned Idx);
// Constant Expressions.
Value *EmitINTEGER_CST(tree_node *exp);
Value *EmitREAL_CST(tree_node *exp);
Value *EmitCONSTRUCTOR(tree_node *exp, const MemRef *DestLoc);
// Optional target defined builtin intrinsic expanding function.
bool TargetIntrinsicLower(tree_node *exp,
unsigned FnCode,
const MemRef *DestLoc,
Value *&Result,
const Type *ResultType,
std::vector<Value*> &Ops);
public:
// Helper for taking the address of a label.
Constant *EmitLV_LABEL_DECL(tree_node *exp);
};
/// TheTreeToLLVM - Keep track of the current function being compiled.
extern TreeToLLVM *TheTreeToLLVM;
/// TreeConstantToLLVM - An instance of this class is created and used to
/// convert tree constant values to LLVM. This is primarily for things like
/// global variable initializers.
///
class TreeConstantToLLVM {
public:
// Constant Expressions
static Constant *Convert(tree_node *exp);
static Constant *ConvertINTEGER_CST(tree_node *exp);
static Constant *ConvertREAL_CST(tree_node *exp);
static Constant *ConvertVECTOR_CST(tree_node *exp);
static Constant *ConvertSTRING_CST(tree_node *exp);
static Constant *ConvertCOMPLEX_CST(tree_node *exp);
static Constant *ConvertNOP_EXPR(tree_node *exp);
static Constant *ConvertCONVERT_EXPR(tree_node *exp);
static Constant *ConvertBinOp_CST(tree_node *exp);
static Constant *ConvertCONSTRUCTOR(tree_node *exp);
static Constant *ConvertArrayCONSTRUCTOR(tree_node *exp);
static Constant *ConvertRecordCONSTRUCTOR(tree_node *exp);
static Constant *ConvertUnionCONSTRUCTOR(tree_node *exp);
// Constant Expression l-values.
static Constant *EmitLV(tree_node *exp);
static Constant *EmitLV_Decl(tree_node *exp);
static Constant *EmitLV_LABEL_DECL(tree_node *exp);
static Constant *EmitLV_COMPLEX_CST(tree_node *exp);
static Constant *EmitLV_STRING_CST(tree_node *exp);
static Constant *EmitLV_COMPONENT_REF(tree_node *exp);
static Constant *EmitLV_ARRAY_REF(tree_node *exp);
};
#endif /* LLVM_INTERNAL_H */
/* LLVM LOCAL end (ENTIRE FILE!) */