search for: retval6

...[#uses=1] %tmp3 = load i32* %res ; <i32> [#uses=1] %tmp4 = call i32 (i8*, ...)* @printf( i8* %tmp2, i32 %tmp3 ) ; <i32> [#uses=0] store i32 0, i32* %tmp %tmp5 = load i32* %tmp ; <i32> [#uses=1] store i32 %tmp5, i32* %retval br label %return return: ; preds = %entry %retval6 = load i32* %retval ; <i32> [#uses=1] ret i32 %retval6 } declare i32 @printf(i8*, ...) <<---tailcall.ll --->> x86Shell:> llvm-as < tailcall.ll | llc -tailcallopt | gcc -x assembler - x86Shell:> ./a.out if you have got any questions regarding tail call stuff i wo...

...i32> [#uses=1] > %tmp4 = call i32 (i8*, ...)* @printf( i8* %tmp2, i32 %tmp3 ) ; > <i32> [#uses=0] > store i32 0, i32* %tmp > %tmp5 = load i32* %tmp ; <i32> [#uses=1] > store i32 %tmp5, i32* %retval > br label %return > > return: ; preds = %entry > %retval6 = load i32* %retval ; <i32> [#uses=1] > ret i32 %retval6 > } > > declare i32 @printf(i8*, ...) > <<---tailcall.ll --->> > > x86Shell:> llvm-as < tailcall.ll | llc -tailcallopt | gcc -x > assembler - > x86Shell:> ./a.out > > if you have...

...; preds = %loop-replace %11 = load i32* @sum, align 4 store i32 %11, i32* %0, align 4 %12 = load i32* %0, align 4 store i32 %12, i32* %retval, align 4 br label %return fun main return return: ; preds = %bb5 %retval6 = load i32* %retval ret i32 %retval6 fun 1_subloop_0 new-entry new-entry: call void @showPlace() %1 = bitcast i8* %0 to i64* %2 = getelementptr i64* %1, i64 0 %j_val = load i64* %2, align 8 call void @showValue(i64 %j_val) %3 = trunc i64 %j_val to i32 %4 = inttoptr i64 %j_...

Hi Jo, On 2007-12-24, at 14:43, Joachim Durchholz wrote: > I'm in a very preliminary phase of a language project which requires > some specific optimizations to be reasonably efficient. > > LLVM already looks very good; I'd just like to know whether I can > push these optimizations through LLVM to the JIT phase (which, as > far as I understand the docs, is a

Hi all, I'm in a very preliminary phase of a language project which requires some specific optimizations to be reasonably efficient. LLVM already looks very good; I'd just like to know whether I can push these optimizations through LLVM to the JIT phase (which, as far as I understand the docs, is a pretty powerful part of LLVM). The optimizations that I need to get to work are: *

Hi, All I want to implement DSWP Which is used for parallelization of loops. For this purpose, the loop was replaced with a new basic block in main function. And new functions were created and basic blocks of Loop assigned to them.I have checked blocks and branches for Succ and Pred relation and I have not found any problems. However I get the following error: * **opt: