Displaying 4 results from an estimated 4 matches for "endprocedure".
2011 Jul 05
3
[LLVMdev] optimizer returning wrong variable?
...om the c interface it looks ok to me
but the optimizer is returning the wrong variable
I don't know what to do to avoid it?
source language input
Procedure TRU(a,b)
Protected x,y,c
Repeat
y=0
Repeat
c+x+y
y+1
Until y >= b
x+1
Until x >= a
ProcedureReturn c
EndProcedure
output generated via the c Interface
define i32 @TRU(i32 %a, i32 %b) {
Entry:
%a1 = alloca i32
store i32 %a, i32* %a1
%b2 = alloca i32
store i32 %b, i32* %b2
%c = alloca i32
store i32 0, i32* %c
%x = alloca i32
store i32 0, i32* %x
%y = alloca i32
store i32 0, i32* %y
br l...
2011 Jul 05
0
[LLVMdev] optimizer returning wrong variable?
...y seeing different behaviour for any particular set of
inputs on some target?
Nick
>
> source language input
>
> Procedure TRU(a,b)
> Protected x,y,c
> Repeat
> y=0
> Repeat
> c+x+y
> y+1
> Until y >= b
> x+1
> Until x >= a
> ProcedureReturn c
> EndProcedure
>
> output generated via the c Interface
>
> define i32 @TRU(i32 %a, i32 %b) {
> Entry:
> %a1 = alloca i32
> store i32 %a, i32* %a1
> %b2 = alloca i32
> store i32 %b, i32* %b2
> %c = alloca i32
> store i32 0, i32* %c
> %x = alloca i32
> store i32 0, i32* %x
&g...
2011 Jun 18
1
[LLVMdev] loop only executes once
...,ElseBB)//
//Ewhile
LLVMPositionBuilderAtEnd(Builder, EWhileBB)
CR = LLVMBuildLoad(Builder,C,"CR")//
//ProcedureReturn C
LLVMBuildRet(Builder, CR)
//Don't forget to free the builder.
LLVMDisposeBuilder(Builder)
//Return the function ref
ProcedureReturn Fib2
EndProcedure
--
Andrew Ferguson
2013 Apr 29
0
[LLVMdev] GSOC Proposal: Implement Decoupled Software Pipeline
...%%%%%%% DSWP Algorithm %%%%%%%%%%%%
DSWP_Procedure(L)
G = build_dependence_graph(L);
SCCs = find_SCCs(G)
If (|SCCs| == 1)
return ;
EndIf
DAG_SCC = coalesce_SCCs(G, SCCs)
P = TPP_algorithm(DAG_SCC, L)
If (|P| == 1)
return ;
EndIf
split_code_into_loops(L, P)
insert_necessary_flows(L,P)
EndProcedure
%%%%%%%% DSWP Algorithm %%%%%%%%%%%%
This procedure receive as input the loop L in an intermediate representation
and modifies it as a side-effect. The first step in the algorithm is construct
the Program Dependence Graph (PDG)[2], this is a graph that represents all
data, memory and control depen...