search for: stackercompiler

...ource code referenced by the error messages - it looks to me like the code should compile cleanly, but it doesn't. I read through the documentation that I could find, and I don't see what I'm doing wrong. Any tips or pointers would be much appreciated. Lane $ make llvm[2]: Compiling StackerCompiler.cpp for Release build StackerCompiler.cpp: In member function 'llvm::Module* StackerCompiler::compile(const std::string&, bool, unsigned int, size_t)': StackerCompiler.cpp:159: error: no matching function for call to 'llvm::PointerType::get(const llvm::IntegerType*&)' /opt/s...

Hi Lalo, Its been a while since I've had a Stacker question! The answer is in the StackerCompiler::handle_while function in StackerCompiler.cpp in projects/Stacker/lib/compiler. Apparently the control value is only examined (not popped) for the "WHILE" operator. Take for example the prime.st sample program. The first thing it does is process the arguments with a WHILE loop: WHILE...

...iously done something wrong! In the following, note that "TheIndex" is a GlobalVariable of type "LongTy", "TheStack" is the [1024xint] array that I mentioned above. The BasicBlock variable bb is passed in from a higher level in the compiler's call sequence. void StackerCompiler::incr_stack_index( BasicBlock* bb ) { ConstantInt* ival = ConstantInt::get(Type::LongTy, 1); LoadInst* loadop = new LoadInst( TheIndex ); bb->getInstList().push_back( loadop ); BinaryOperator* addop = BinaryOperator::create( Instruction::Add, loadop, ival); bb-...

...s/Scalar/ADCE.cpp Index: lib/Transforms/Scalar/InstructionCombining.cpp Index: lib/Transforms/Scalar/LoopUnroll.cpp Index: lib/Transforms/Scalar/SCCP.cpp Index: lib/Transforms/Utils/CloneTrace.cpp Index: lib/VMCore/BasicBlock.cpp Index: lib/VMCore/Dominators.cpp Index: projects/Stacker/lib/compiler/StackerCompiler.cpp Index: projects/Stacker/lib/compiler/StackerCompiler.h Index: projects/Stacker/lib/runtime/stacker_rt.c Index: projects/Stacker/tools/stkrc/stkrc.cpp Index: projects/sample/include/sample.h Index: projects/sample/lib/sample/sample.c Index: projects/sample/tools/sample/main.c Index: test/Regress...

...t; // module with function Fibonacci and execute it with the JIT. > > // > > // This simple example shows as well 30% speed up with LLVM 1.3 > > // in comparison to gcc 3.3.3 at AMD Athlon XP 1500+ . > > // > > // (Modified from HowToUseJIT.cpp and Stacker/lib/compiler/StackerCompiler.cpp) > > // > > //===------------------------------------------------------------------------=== > > // Goal: > > // The goal of this snippet is to create in the memory > > // the LLVM module consisting of one function as follow: > > // > > // int fib(int...

...build quickly a small > // module with function Fibonacci and execute it with the JIT. > // > // This simple example shows as well 30% speed up with LLVM 1.3 > // in comparison to gcc 3.3.3 at AMD Athlon XP 1500+ . > // > // (Modified from HowToUseJIT.cpp and Stacker/lib/compiler/StackerCompiler.cpp) > // > //===------------------------------------------------------------------------=== > // Goal: > // The goal of this snippet is to create in the memory > // the LLVM module consisting of one function as follow: > // > // int fib(int x) { > // if(x<=2) retur...

...le with function Fibonacci and execute it with the JIT. >>>// >>>// This simple example shows as well 30% speed up with LLVM 1.3 >>>// in comparison to gcc 3.3.3 at AMD Athlon XP 1500+ . >>>// >>>// (Modified from HowToUseJIT.cpp and Stacker/lib/compiler/StackerCompiler.cpp) >>>// >>>//===------------------------------------------------------------------------=== >>>// Goal: >>>// The goal of this snippet is to create in the memory >>>// the LLVM module consisting of one function as follow: >>>// >>>...

...i and execute it with the JIT. > >>>// > >>>// This simple example shows as well 30% speed up with LLVM 1.3 > >>>// in comparison to gcc 3.3.3 at AMD Athlon XP 1500+ . > >>>// > >>>// (Modified from HowToUseJIT.cpp and Stacker/lib/compiler/StackerCompiler.cpp) > >>>// > >>>//===------------------------------------------------------------------------=== > >>>// Goal: > >>>// The goal of this snippet is to create in the memory > >>>// the LLVM module consisting of one function as follow: &g...

Hi LLVMers, the example attached I have used to prove that JIT and some visible optimizations are really invoked. Proved OK. I got 30% speed-up in comparison to gcc 3.3.3 on my Athlon XP 1500. Nice. P.S. guys, no fears, I don't plan to flood the cvs repository with my "brilliant" examples ;) --- Valery A.Khamenya -------------- next part -------------- An