Displaying 5 results from an estimated 5 matches for "true_bb".
2004 Aug 17
5
[LLVMdev] JIT API example (fibonacci)
...ce symbolic name for fun.
> >
> > SetCondInst* CondInst
> > = new SetCondInst( Instruction::SetLE,
> > &ArgX, Two );
> >
> > BB->getInstList().push_back(CondInst);
> >
> > // Create the true_block
> > BasicBlock* 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
> >...
2004 Aug 17
0
[LLVMdev] JIT API example (fibonacci)
...AnArg"); // Give it a nice symbolic name for fun.
>
> SetCondInst* CondInst
> = new SetCondInst( Instruction::SetLE,
> &ArgX, Two );
>
> BB->getInstList().push_back(CondInst);
>
> // Create the true_block
> BasicBlock* 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...
2004 Aug 17
0
[LLVMdev] JIT API example (fibonacci)
...fun.
>>>
>>> SetCondInst* CondInst
>>> = new SetCondInst( Instruction::SetLE,
>>> &ArgX, Two );
>>>
>>> BB->getInstList().push_back(CondInst);
>>>
>>> // Create the true_block
>>> BasicBlock* 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 exi...
2004 Aug 18
1
[LLVMdev] JIT API example (fibonacci)
...etCondInst* CondInst
> >>> = new SetCondInst( Instruction::SetLE,
> >>> &ArgX, Two );
> >>>
> >>> BB->getInstList().push_back(CondInst);
> >>>
> >>> // Create the true_block
> >>> BasicBlock* 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));
> >>>
&g...
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