Release Index

The table below provides an index into the information for all - releases.

The table below provides an overview of the planned upcoming releases.

- + + + + + + + + + + + + + +

Release	Description	Description	Status
0.1	Hello World, AST Construction, Build System	100%	Features Status
0.2	Turing Complete, JIT Execution	55%	Features Status
0.3	Front End Library, Interpreted Execution	1%	Features
0.4	Ruby Front End	0%	Features
0.5	Scheme Front End	0%	Features
0.6	Python Front End	0%	Features
0.9	Quality Enhancements, Pre-Beta Touchups	0%	Features

The table below provides a list of the releases already completed.

- - - - - - - - - - - -

Release	Description	Links
0.1	Hello World, AST Construction, Build System	Features Status

Release Status

Feature	Feature	Feature
Arithmetic Operators Done.	Control Flow Operators CallOp is done. - Select, Loop, and Switch are syntactically implemented but no code gen - yet.	Boolean Operators Done.	Integer Arithmetic Operators Done.	Boolean Arithmetic Operators Done.	Floating POint Arithmetic Operators + Done with the exception of math library calls.
Text Operators Not Started	Program Arguments Not Started	JIT Compilation Not Started	Control Flow Operators Done.	Block Nesting Done.	Aggregate Constants Done.
Text Operators Not Started.	Program Arguments Changed to argc/argv.	JIT Compilation Not Started.
Test Case Generator + 80% A few bugs remain.

Feature

Arithmetic Operators
Done.

Control Flow Operators
CallOp is done. - Select, Loop, and Switch are syntactically implemented but no code gen - yet.

Boolean Operators
Done.

Integer Arithmetic Operators
Done.

Boolean Arithmetic Operators
Done.

Floating POint Arithmetic Operators
+ Done with the exception of math library calls.

Text Operators
Not Started

Program Arguments
Not Started

JIT Compilation
Not Started

Control Flow Operators
Done.

Block Nesting
Done.

Aggregate Constants
Done.

Text Operators
Not Started.

Program Arguments
Changed to argc/argv.

JIT Compilation
Not Started.

Test Case Generator
+ 80% A few bugs remain.

Arithmetic Operators. Extend the AST - library to support all the arithmetic operators for integer and floating - point arithmetic. Provide LLVM code generation support for these +
Integer Operators. Extend the AST + library to support all the integer arithmetic operators + such as add, subtract, multiply, divide, modulo, increment, decrement, + bitwise operations, etc. Provide LLVM code generation support for these operators.
Boolean Operators. Extend the AST + library to support all the boolean operators such as and, or, not, and + the six comparison operators. Provide LLVM code generation support for these + operators.
Floating Point Operators. Extend the AST + library to support all the floating point arithmetic operators such as add, + subtract, multiply, divide, etc. Also include the operators that imply + library functions or LLVM intrinsics such as sqrt, power, etc. Provide LLVM + code generation support for these operators.
Control Flow Operators. Extend the AST library to support a set of control flow operators (if,while,for,switch) and provide LLVM code generation for them.
Boolean Operators. Extend the AST - library to provide boolean comparison operators and LLVM code generation for - them.
Block Nesting
Implement correct + code generation for nested blocks, block results, function results, return + operator, control flow operators with nested blocks, etc.
Aggregate Constants
Complete the + implementation of literal constants to include the aggregate constants for + pointers, arrays, vectors, structures and continuations. Also implement + literal constants for the missing simple types: enumerator, any, range, + octet, character, etc.
Text Operators. Extend the AST library to provide a complete set of operators for manipulating strings of text and the LLVM code generation for them.
Program Arguments. Extend the Runtime library to correctly pass an HLVM program's arguments as an HLVM array of text.
Test Case Generator. Write a test case + generator program that randomly generates test cases based on specifications + of operator complexity, type complexity, and size. Integrate this generator + with the dejagnu test framework to check a few random cases on each run of + the "check" target.
JIT Compilation. Extend the Runtime library to support just-in-time compilation and execution via LLVM's JIT facilities.

This is the second public release of the High Level Virtual Machine. This is a very early pre-release, version 0.2. That is, HLVM is not complete yet - and it doesn't do very much. The main goal for this release is to get HLVM - to be "Turing Complete".

+ and it doesn't do very much yet. The main goal for this release is to get + HLVM to be "Turing Complete".

New Features In HLVM 0.2

Here are the main things accomplished in this release:

Nothing yet
hlvm-gentestcase. This new tool will automatically generate XML + test cases for HLVM. This tool is incorporated into the test suite and will + randomly select 100 test cases of varying complexity and size.

Significant Changes in HLVM 0.2

There have been no changes since the last release.

Here are things that have changed since the last release:

Aliases Removed. The original intent behind aliases was to + support some kind of "typedef" feature and provide alternate names for + types. However, since every type in HLVM is required to have an explicit + name and type identification is done by name, the alias feature was + redundant and not well aligned with the other types. Consequently it has + been removed.

Platform Support

HLVM is known to work on the following platforms:

+ +

@@ -227,7 +231,6 @@ - @@ -270,57 +273,52 @@ - - + - - + - - + - - + - - + @@ -368,26 +366,28 @@ + - - - + + + + - + @@ -404,11 +404,11 @@ - + @@ -450,6 +450,8 @@ + + @@ -475,11 +477,6 @@ - - - - - @@ -524,6 +521,20 @@ + + + + + + + + + + + + + + @@ -589,11 +600,17 @@ - + + + + + - + + + @@ -629,10 +646,10 @@ - + From rspencer at reidspencer.com Tue Jul 4 03:31:44 2006 From: rspencer at reidspencer.com (rspencer at reidspencer.com) Date: Tue, 4 Jul 2006 01:31:44 -0700 Subject: [hlvm-commits] r381 - hlvm/AST Message-ID: <200607040831.k648VivD008324@server1.hlvm.org> Author: reid Date: 2006-07-04 01:31:44 -0700 (Tue, 04 Jul 2006) New Revision: 381 Log: Make the getContainingBundle method available on all nodes, not just Operators. Make sure getPointerTo sets the parent for each type it creates. Modified: hlvm/AST/AST.cpp hlvm/AST/Node.cpp hlvm/AST/Node.h hlvm/AST/Operator.cpp hlvm/AST/Operator.h Modified: hlvm/AST/AST.cpp =================================================================== --- hlvm/AST/AST.cpp 2006-07-04 06:57:22 UTC (rev 380) +++ hlvm/AST/AST.cpp 2006-07-04 08:31:44 UTC (rev 381) @@ -228,6 +228,7 @@ PointerType* PT = new PointerType(); PT->setElementType(Ty); PT->setName(ptr_name); + PT->setParent(Ty->getContainingBundle()); ast->types.insert(ptr_name,Ty); return PT; } Modified: hlvm/AST/Node.cpp =================================================================== --- hlvm/AST/Node.cpp 2006-07-04 06:57:22 UTC (rev 380) +++ hlvm/AST/Node.cpp 2006-07-04 08:31:44 UTC (rev 381) @@ -29,6 +29,7 @@ #include #include +#include #include #include #include @@ -50,6 +51,16 @@ return llvm::cast(last); } +Bundle* +Node::getContainingBundle() const +{ + Node* p = getParent(); + while (p && !p->is(BundleID)) p = p->getParent(); + if (!p) + return 0; + return llvm::cast(p); +} + void Node::insertChild(Node* child) { Modified: hlvm/AST/Node.h =================================================================== --- hlvm/AST/Node.h 2006-07-04 06:57:22 UTC (rev 380) +++ hlvm/AST/Node.h 2006-07-04 08:31:44 UTC (rev 381) @@ -39,6 +39,7 @@ class Type; class AST; +class Bundle; /// This enumeration is used to identify the various kinds of Abstract Syntax /// Tre nodes. Its organization is very specific and dependent on the class @@ -310,8 +311,12 @@ /// @name Accessors /// @{ public: + /// Get the AST root node that this Node is part of. inline AST* getRoot(); + /// Return the bundle that contains this Node. + Bundle* getContainingBundle() const; + /// Get the type of node inline NodeIDs getID() const { return NodeIDs(id); } Modified: hlvm/AST/Operator.cpp =================================================================== --- hlvm/AST/Operator.cpp 2006-07-04 06:57:22 UTC (rev 380) +++ hlvm/AST/Operator.cpp 2006-07-04 08:31:44 UTC (rev 381) @@ -42,18 +42,8 @@ { } -Bundle* -Operator::getContainingBundle() -{ - Node* p = getParent(); - while (p && !p->is(BundleID)) p = p->getParent(); - if (!p) - return 0; - return cast(p); -} - Function* -Operator::getContainingFunction() +Operator::getContainingFunction() const { Node* p = getParent(); while (p && !p->isFunction()) p = p->getParent(); @@ -63,7 +53,7 @@ } Block* -Operator::getContainingBlock() +Operator::getContainingBlock() const { Node* p = getParent(); while (p && !isa(p)) p = p->getParent(); @@ -73,7 +63,7 @@ } Operator* -Operator::getContainingLoop() +Operator::getContainingLoop() const { Node* p = getParent(); while (p && !p->isLoop()) p = p->getParent(); Modified: hlvm/AST/Operator.h =================================================================== --- hlvm/AST/Operator.h 2006-07-04 06:57:22 UTC (rev 380) +++ hlvm/AST/Operator.h 2006-07-04 08:31:44 UTC (rev 381) @@ -71,20 +71,16 @@ virtual Operator* getOperand(unsigned opnum) const = 0; /// Return the function containing this operator - Function* getContainingFunction(); + Function* getContainingFunction() const; /// Return the block containing this operator - Block* getContainingBlock(); + Block* getContainingBlock() const; /// Return the loop operator containing this operator. This can return /// any of the loop constructs (Loop, While, Unless, etc.) so its result /// type is Operator*. - Operator* getContainingLoop(); + Operator* getContainingLoop() const; - /// Return the bundle that contains the function that contains the block - /// that contains this operator. - Bundle* getContainingBundle(); - /// Determine if this is a classof some other type. static inline bool classof(const Operator*) { return true; } static inline bool classof(const Node* N) { return N->isOperator(); } From rspencer at reidspencer.com Tue Jul 4 03:32:30 2006 From: rspencer at reidspencer.com (rspencer at reidspencer.com) Date: Tue, 4 Jul 2006 01:32:30 -0700 Subject: [hlvm-commits] r382 - hlvm/Writer Message-ID: <200607040832.k648WU14008341@server1.hlvm.org> Author: reid Date: 2006-07-04 01:32:30 -0700 (Tue, 04 Jul 2006) New Revision: 382 Log: Fix a problem generating range literals. Negative values were being generated as unsigned quantities. This bug found by the test case generator. Modified: hlvm/Writer/XMLWriter.cpp Modified: hlvm/Writer/XMLWriter.cpp =================================================================== --- hlvm/Writer/XMLWriter.cpp 2006-07-04 08:31:44 UTC (rev 381) +++ hlvm/Writer/XMLWriter.cpp 2006-07-04 08:32:30 UTC (rev 382) @@ -90,6 +90,8 @@ { writeAttribute(name, t->getName()); } inline void writeAttribute(const char* name, uint64_t val) { writeAttribute(name, llvm::utostr(val)); } + inline void writeAttribute(const char* name, int64_t val) + { writeAttribute(name, llvm::itostr(val)); } inline void writeElement(const char* elem, const char* body) { xmlTextWriterWriteElement(writer, reinterpret_cast(elem), From rspencer at reidspencer.com Tue Jul 4 03:35:56 2006 From: rspencer at reidspencer.com (rspencer at reidspencer.com) Date: Tue, 4 Jul 2006 01:35:56 -0700 Subject: [hlvm-commits] r383 - tools/hlvm-gentestcase Message-ID: <200607040835.k648ZuRZ008368@server1.hlvm.org> Author: reid Date: 2006-07-04 01:35:56 -0700 (Tue, 04 Jul 2006) New Revision: 383 Log: Consolidate the code that dereferences a generated value into a new function, genValueOperator(). Fix range of generated values for ConstantInteger. Fix situations where random numbers in the range (0,1) were always generating 0. Modified: tools/hlvm-gentestcase/Generate.cpp Modified: tools/hlvm-gentestcase/Generate.cpp =================================================================== --- tools/hlvm-gentestcase/Generate.cpp 2006-07-04 08:32:30 UTC (rev 382) +++ tools/hlvm-gentestcase/Generate.cpp 2006-07-04 08:35:56 UTC (rev 383) @@ -53,10 +53,6 @@ cl::value_desc("num")); cl::opt - TypeComplexity("type-complexity", cl::desc("Specify complexity of types"), - cl::value_desc("0-20"), cl::init(10)); - -cl::opt Seed("seed", cl::desc("Specify random number generator seed"), cl::value_desc("num")); @@ -64,18 +60,18 @@ Size("size",cl::desc("Specify size of generated code"), cl::value_desc("num")); -hlvm::AST* ast = 0; -hlvm::URI* uri = 0; -hlvm::Bundle* bundle = 0; -hlvm::Program* program = 0; +AST* ast = 0; +URI* uri = 0; +Bundle* bundle = 0; +Program* program = 0; unsigned line = 0; -typedef std::vector ValueList; -typedef std::map TypeValueMap; +typedef std::vector ValueList; +typedef std::map TypeValueMap; TypeValueMap values; -typedef std::vector TypeList; +typedef std::vector TypeList; TypeList types; -inline hlvm::Locator* +inline Locator* getLocator() { return ast->new_Locator(uri,++line); @@ -103,8 +99,8 @@ return low; } -hlvm::Type* -genTypeLimited(unsigned limit) +Type* +genType(unsigned limit) { Type* result = 0; NodeIDs id = NodeIDs(randRange(FirstTypeID,LastTypeID)); @@ -150,15 +146,15 @@ { Locator* loc = getLocator(); std::string name = "int_" + utostr(line); - result = ast->new_IntegerType( - name,randRange(1,64,true),bool(randRange(0,1,true)),loc); + bool isSigned = randRange(0,Complexity+2,true) < (Complexity+2)/2; + result = ast->new_IntegerType(name,randRange(2,64,true),isSigned,loc); break; } case RangeTypeID: { Locator* loc = getLocator(); std::string name = "range_" + utostr(line); - int64_t limit = randRange(0LL,5000000000LL); + int64_t limit = randRange(0,8000000); result = ast->new_RangeType(name,-limit,limit,loc); break; } @@ -181,7 +177,7 @@ } case PointerTypeID: { - result = ast->getPointerTo(genTypeLimited(limit)); + result = ast->getPointerTo(genType(limit)); break; } case ArrayTypeID: @@ -189,7 +185,7 @@ Locator* loc = getLocator(); std::string name = "array_" + utostr(line); result = ast->new_ArrayType(name, - genTypeLimited(limit),randRange(1,Size),loc); + genType(limit),randRange(1,Size),loc); break; } case VectorTypeID: @@ -197,7 +193,7 @@ Locator* loc = getLocator(); std::string name = "vector_" + utostr(line); result = ast->new_VectorType( - name,genTypeLimited(limit),randRange(1,Size),loc); + name,genType(limit),randRange(1,Size),loc); break; } case OpaqueTypeID: @@ -211,7 +207,7 @@ unsigned numFields = randRange(1,Size,true); for (unsigned i = 0; i < numFields; ++i) { Field* fld = ast->new_Field(name+"_"+utostr(i), - genTypeLimited(limit),getLocator()); + genType(limit),getLocator()); S->addField(fld); } result = S; @@ -228,9 +224,9 @@ Type* genType() { - bool shouldGenNewType = randRange(0,20) < TypeComplexity; + bool shouldGenNewType = randRange(0,20) < Complexity; if (types.empty() || shouldGenNewType) { - Type* Ty = genTypeLimited(Complexity); + Type* Ty = genType(Complexity); types.push_back(Ty); return Ty; } @@ -238,7 +234,7 @@ } Value* -genValue(const hlvm::Type* Ty, bool is_constant = false) +genValue(const Type* Ty, bool is_constant = false) { if (!is_constant && randRange(0,Complexity) < Complexity/2) { // First look up an existing value in the map @@ -259,8 +255,9 @@ switch (id) { case BooleanTypeID: { + bool val = randRange(0,Complexity+2) < (Complexity+2)/2; C = ast->new_ConstantBoolean( - std::string("cbool_") + utostr(line), bool(randRange(0,1)), loc); + std::string("cbool_") + utostr(line), val, loc); break; } case CharacterTypeID: @@ -387,11 +384,16 @@ Locator* loc = getLocator(); std::string name = "cint_" + utostr(line); const IntegerType* IntTy = llvm::cast(Ty); - int64_t max = 1 << (IntTy->getBits() < 63 ? IntTy->getBits() : 63); - int64_t val = IntTy->isSigned() ? - randRange(int64_t(-max),int64_t(max-1)) : - randRange(int64_t(0),int64_t(max)); - std::string val_str( itostr(val) ); + unsigned bits = (IntTy->getBits() < 63 ? IntTy->getBits() : 63) - 1; + int64_t max = 1 << bits; + std::string val_str; + if (IntTy->isSigned()) { + int64_t val = randRange(int64_t(-max),int64_t(max-1)); + val_str = itostr(val); + } else { + uint64_t val = randRange(int64_t(0),int64_t(max),true); + val_str = utostr(val); + } C = ast->new_ConstantInteger(name,val_str,10,Ty,loc); break; } @@ -477,23 +479,37 @@ hlvmAssert(!"Invalid Type?"); } + // Give the constant a home + C->setParent(bundle); + + // Make it either an initialized variable or just the constant itself. Value* result = 0; - if (is_constant || (randRange(0,Complexity*Size) < (Complexity*Size)/2)) + if (is_constant || (randRange(0,Complexity+2) < (Complexity+2)/2)) result = C; else { - C->setParent(bundle); Variable* var = ast->new_Variable(C->getName()+"_var",C->getType(),loc); var->setIsConstant(false); var->setInitializer(C); + var->setParent(bundle); result = var; } - result->setParent(bundle); // Memoize the result values[result->getType()].push_back(result); return result; } +inline Operator* +genValueOperator(const Type *Ty, bool is_constant = false) +{ + Value* V = genValue(Ty,is_constant); + Operator* O = ast->new_ReferenceOp(V,getLocator()); + if (isa(V)) + O = ast->new_UnaryOp(O,getLocator()); + return O; +} + + CallOp* genCallTo(Function* F) { @@ -503,26 +519,18 @@ const SignatureType* sig = F->getSignature(); for (SignatureType::const_iterator I = sig->begin(), E = sig->end(); I != E; ++I) - { - Value* V = genValue((*I)->getType()); - hlvmAssert(isa(V) || isa(V)) ; - Operator* O = ast->new_ReferenceOp(V,getLocator()); - if (isa(V)) - args.push_back(O); - else - args.push_back(ast->new_UnaryOp(O,getLocator())); - } + args.push_back(genValueOperator((*I)->getType())); return ast->new_MultiOp(args,getLocator()); } -hlvm::Block* +Block* genBlock() { Block* B = ast->new_Block(getLocator()); return B; } -hlvm::Function* +Function* genFunction(Type* resultType, unsigned numArgs) { // Get the function name @@ -532,7 +540,7 @@ // Get the signature std::string sigName = name + "_type"; SignatureType* sig = ast->new_SignatureType(sigName,resultType,loc); - if (randRange(0,Complexity) <= int(Complexity/2)) + if (randRange(0,Complexity) <= int(Complexity/4)) sig->setIsVarArgs(true); for (unsigned i = 0; i < numArgs; ++i ) { @@ -540,6 +548,7 @@ Parameter* param = ast->new_Parameter(name,genType(),loc); sig->addParameter(param); } + sig->setParent(bundle); // Create the function and set its linkage LinkageKinds LK = LinkageKinds(randRange(ExternalLinkage,InternalLinkage)); @@ -553,10 +562,7 @@ B->setParent(F); // Get the function result and return instruction - Value* V = genValue(F->getResultType()); - Operator* O = ast->new_ReferenceOp(V,getLocator()); - if (isa(V)) - O = ast->new_UnaryOp(O,getLocator()); + Operator* O = genValueOperator(F->getResultType()); ResultOp* rslt = ast->new_UnaryOp(O,getLocator()); rslt->setParent(B); @@ -587,7 +593,7 @@ for (unsigned i = 0; i < Size; i++) { Type* result = genType(); Type* argTy = genType(); - unsigned numArgs = int(randRange(0,int(Complexity/5))); + unsigned numArgs = int(randRange(0,int(Complexity))); Function* F = genFunction(result,numArgs); F->setParent(bundle); CallOp* call = genCallTo(F); @@ -595,10 +601,7 @@ } // Get the function result and return instruction - Value* V = genValue(program->getResultType()); - Operator* O = ast->new_ReferenceOp(V,getLocator()); - if (isa(V)) - O = ast->new_UnaryOp(O,getLocator()); + Operator* O = genValueOperator(program->getResultType()); ResultOp* rslt = ast->new_UnaryOp(O,getLocator()); rslt->setParent(blk); From rspencer at reidspencer.com Tue Jul 4 14:07:17 2006 From: rspencer at reidspencer.com (rspencer at reidspencer.com) Date: Tue, 4 Jul 2006 12:07:17 -0700 Subject: [hlvm-commits] r384 - hlvm/AST Message-ID: <200607041907.k64J7HEH011916@server1.hlvm.org> Author: reid Date: 2006-07-04 12:07:16 -0700 (Tue, 04 Jul 2006) New Revision: 384 Log: Fix a nasty bug in getPointerTo where the registered type was the element type not the pointer type. This meant that no pointer types would ever be reused and caused numerous failures in the test case generator. A valuable bug to find. Modified: hlvm/AST/AST.cpp Modified: hlvm/AST/AST.cpp =================================================================== --- hlvm/AST/AST.cpp 2006-07-04 08:35:56 UTC (rev 383) +++ hlvm/AST/AST.cpp 2006-07-04 19:07:16 UTC (rev 384) @@ -229,7 +229,7 @@ PT->setElementType(Ty); PT->setName(ptr_name); PT->setParent(Ty->getContainingBundle()); - ast->types.insert(ptr_name,Ty); + ast->types.insert(ptr_name,PT); return PT; } From rspencer at reidspencer.com Tue Jul 4 14:21:59 2006 From: rspencer at reidspencer.com (rspencer at reidspencer.com) Date: Tue, 4 Jul 2006 12:21:59 -0700 Subject: [hlvm-commits] r385 - tools/hlvm-gentestcase Message-ID: <200607041921.k64JLx9B011974@server1.hlvm.org> Author: reid Date: 2006-07-04 12:21:59 -0700 (Tue, 04 Jul 2006) New Revision: 385 Log: Fix some problems with the range of generated integer constants. Modified: tools/hlvm-gentestcase/Generate.cpp Modified: tools/hlvm-gentestcase/Generate.cpp =================================================================== --- tools/hlvm-gentestcase/Generate.cpp 2006-07-04 19:07:16 UTC (rev 384) +++ tools/hlvm-gentestcase/Generate.cpp 2006-07-04 19:21:59 UTC (rev 385) @@ -147,7 +147,7 @@ Locator* loc = getLocator(); std::string name = "int_" + utostr(line); bool isSigned = randRange(0,Complexity+2,true) < (Complexity+2)/2; - result = ast->new_IntegerType(name,randRange(2,64,true),isSigned,loc); + result = ast->new_IntegerType(name,randRange(4,64,true),isSigned,loc); break; } case RangeTypeID: @@ -311,7 +311,7 @@ } case SInt8TypeID: { - int8_t val = int8_t(randRange(-128,127)); + int8_t val = int8_t(randRange(-127,127)); std::string val_str(itostr(val)); C = ast->new_ConstantInteger( std::string("cs8_")+utostr(line),val_str,10,Ty,loc); @@ -319,7 +319,7 @@ } case SInt16TypeID: { - int16_t val = int16_t(randRange(-32768,32767)); + int16_t val = int16_t(randRange(-32767,32767)); std::string val_str(itostr(val)); C = ast->new_ConstantInteger( std::string("cs16_")+utostr(line),val_str,10,Ty,loc); @@ -384,14 +384,14 @@ Locator* loc = getLocator(); std::string name = "cint_" + utostr(line); const IntegerType* IntTy = llvm::cast(Ty); - unsigned bits = (IntTy->getBits() < 63 ? IntTy->getBits() : 63) - 1; + unsigned bits = (IntTy->getBits() < 63 ? IntTy->getBits() : 63) - 2; int64_t max = 1 << bits; std::string val_str; if (IntTy->isSigned()) { int64_t val = randRange(int64_t(-max),int64_t(max-1)); val_str = itostr(val); } else { - uint64_t val = randRange(int64_t(0),int64_t(max),true); + uint64_t val = randRange(uint64_t(0),uint64_t(max),true); val_str = utostr(val); } C = ast->new_ConstantInteger(name,val_str,10,Ty,loc); @@ -518,8 +518,13 @@ args.push_back(O); const SignatureType* sig = F->getSignature(); for (SignatureType::const_iterator I = sig->begin(), E = sig->end(); - I != E; ++I) - args.push_back(genValueOperator((*I)->getType())); + I != E; ++I) + { + const Type* argTy = (*I)->getType(); + Operator* O = genValueOperator(argTy); + hlvmAssert(argTy == O->getType()); + args.push_back(O); + } return ast->new_MultiOp(args,getLocator()); } From rspencer at reidspencer.com Tue Jul 4 17:11:19 2006 From: rspencer at reidspencer.com (rspencer at reidspencer.com) Date: Tue, 4 Jul 2006 15:11:19 -0700 Subject

Release Index

Upcoming Releases

Completed Releases

Release Status

Release 0.2 Features (Turing Complete)

New Features In HLVM 0.2

Significant Changes in HLVM 0.2

Platform Support