Displaying 5 results from an estimated 5 matches for "exit_bb".
2004 Aug 17
5
[LLVMdev] JIT API example (fibonacci)
...("arg<=2");
> >
> >
> > // Create the return instruction and add it
> > // to the basic block for true case:
> > true_bb->getInstList().push_back(new ReturnInst(One));
> >
> > // Create an exit block
> > BasicBlock* exit_bb = new BasicBlock("arg>2");
> >
> > {
> >
> > // create fib(x-1)
> > CallInst* CallFibX1;
> > {
> > // Create the sub instruction... does not insert...
> > Instruction *Sub
> > = BinaryOperator::create(Inst...
2004 Aug 17
0
[LLVMdev] JIT API example (fibonacci)
...lock* true_bb = new BasicBlock("arg<=2");
>
>
> // Create the return instruction and add it
> // to the basic block for true case:
> true_bb->getInstList().push_back(new ReturnInst(One));
>
> // Create an exit block
> BasicBlock* exit_bb = new BasicBlock("arg>2");
>
> {
>
> // create fib(x-1)
> CallInst* CallFibX1;
> {
> // Create the sub instruction... does not insert...
> Instruction *Sub
> = BinaryOperator::create(Instruction::Sub, &ArgX, One,
>...
2004 Aug 17
0
[LLVMdev] JIT API example (fibonacci)
...ot;);
>>>
>>>
>>> // Create the return instruction and add it
>>> // to the basic block for true case:
>>> true_bb->getInstList().push_back(new ReturnInst(One));
>>>
>>> // Create an exit block
>>> BasicBlock* exit_bb = new BasicBlock("arg>2");
>>>
>>> {
>>>
>>> // create fib(x-1)
>>> CallInst* CallFibX1;
>>> {
>>> // Create the sub instruction... does not insert...
>>> Instruction *Sub
>>> = BinaryO...
2004 Aug 18
1
[LLVMdev] JIT API example (fibonacci)
...;
> >>> // Create the return instruction and add it
> >>> // to the basic block for true case:
> >>> true_bb->getInstList().push_back(new ReturnInst(One));
> >>>
> >>> // Create an exit block
> >>> BasicBlock* exit_bb = new BasicBlock("arg>2");
> >>>
> >>> {
> >>>
> >>> // create fib(x-1)
> >>> CallInst* CallFibX1;
> >>> {
> >>> // Create the sub instruction... does not insert...
> >>> I...
2004 Aug 17
4
[LLVMdev] JIT API example (fibonacci)
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