Displaying 3 results from an estimated 3 matches for "stmt_for_cond_for_end31_crit_edge".
2013 Aug 16
0
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
On 08/16/2013 02:42 AM, Star Tan wrote:
> At 2013-08-16 12:44:02,"Tobias Grosser" <tobias at grosser.es> wrote:
>> Hi,
>>
>> I tried to reproduce your findings, but could not do so.
>
>
> Sorry, I did not put all code in my previous email because the code seems a little too long and complicated.
> You can refer to the detailed C code and LLVM IR
2013 Aug 17
2
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
...[i0] -> MemRef_x_1_lcssa_reg2mem[0] };
MustWriteAccess :=
[cond.reload] -> { Stmt_for_inc29[i0] -> MemRef_x_1_lcssa_lcssa_reg2mem[0] };
MustWriteAccess :=
[cond.reload] -> { Stmt_for_inc29[i0] -> MemRef_x_018_reg2mem[0] };
Stmt_for_cond_for_end31_crit_edge
Domain :=
[cond.reload] -> { Stmt_for_cond_for_end31_crit_edge[] };
Scattering :=
[cond.reload] -> { Stmt_for_cond_for_end31_crit_edge[] -> scattering[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] };
ReadAccess :=...
2013 Aug 16
2
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
At 2013-08-16 12:44:02,"Tobias Grosser" <tobias at grosser.es> wrote:
>Hi,
>
>I tried to reproduce your findings, but could not do so.
Sorry, I did not put all code in my previous email because the code seems a little too long and complicated.
You can refer to the detailed C code and LLVM IR code on http://llvm.org/bugs/show_bug.cgi?id=16843
There are four attachments