Displaying 6 results from an estimated 6 matches for "callfibx2".
Did you mean:
callfibx1
2004 Aug 17
5
[LLVMdev] JIT API example (fibonacci)
...gt; >
> > exit_bb->getInstList().push_back(Sub);
> >
> > CallFibX1 = new CallInst(FibF, Sub, "fib(x-1)");
> > exit_bb->getInstList().push_back(CallFibX1);
> >
> > }
> >
> > // create fib(x-2)
> > CallInst* CallFibX2;
> > {
> > // Create the sub instruction... does not insert...
> > Instruction * Sub
> > = BinaryOperator::create(Instruction::Sub, &ArgX, Two,
> > "arg");
> >
> > exit_bb->getInstList().push_back(Sub);
> > CallFibX...
2004 Aug 17
0
[LLVMdev] JIT API example (fibonacci)
...> "arg");
>
> exit_bb->getInstList().push_back(Sub);
>
> CallFibX1 = new CallInst(FibF, Sub, "fib(x-1)");
> exit_bb->getInstList().push_back(CallFibX1);
>
> }
>
> // create fib(x-2)
> CallInst* CallFibX2;
> {
> // Create the sub instruction... does not insert...
> Instruction * Sub
> = BinaryOperator::create(Instruction::Sub, &ArgX, Two,
> "arg");
>
> exit_bb->getInstList().push_back(Sub);
> CallFibX2 = new CallInst(FibF, Sub, "fib(x...
2004 Aug 17
0
[LLVMdev] JIT API example (fibonacci)
...exit_bb->getInstList().push_back(Sub);
>>>
>>> CallFibX1 = new CallInst(FibF, Sub, "fib(x-1)");
>>> exit_bb->getInstList().push_back(CallFibX1);
>>>
>>> }
>>>
>>> // create fib(x-2)
>>> CallInst* CallFibX2;
>>> {
>>> // Create the sub instruction... does not insert...
>>> Instruction * Sub
>>> = BinaryOperator::create(Instruction::Sub, &ArgX, Two,
>>> "arg");
>>>
>>> exit_bb->getInstList().push_back(Sub);
>...
2004 Aug 18
1
[LLVMdev] JIT API example (fibonacci)
...);
> >>>
> >>> CallFibX1 = new CallInst(FibF, Sub, "fib(x-1)");
> >>> exit_bb->getInstList().push_back(CallFibX1);
> >>>
> >>> }
> >>>
> >>> // create fib(x-2)
> >>> CallInst* CallFibX2;
> >>> {
> >>> // Create the sub instruction... does not insert...
> >>> Instruction * Sub
> >>> = BinaryOperator::create(Instruction::Sub, &ArgX, Two,
> >>> "arg");
> >>>
> >>> exit_bb->...
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
2007 Nov 25
2
[LLVMdev] Fibonacci example in OCaml
..." bb in
ignore(build_cond_br condinst retbb recursebb bb);
ignore(build_ret one retb);
let sub = build_sub argx one "arg" recurseb in
let callfibx1 = build_call fibf [|sub|] "fibx1" recurseb in
let sub = build_sub argx two "arg" recurseb in
let callfibx2 = build_call fibf [|sub|] "fibx2" recurseb in
let sum = build_add callfibx1 callfibx2 "addresult" recurseb in
build_ret sum recurseb;
fibf
let main filename =
let m = create_module filename in
let puts =
declare_function "puts"
(function...