Displaying 6 results from an estimated 6 matches for "memref_x".
2013 Aug 08
2
[LLVMdev] [Polly] Summary of some expensive compiler passes, especially PollyDependence
...4] ^= R(x[ 0]+x[12], 7); x[ 8] ^= R(x[ 4]+x[ 0], 9);
x[12] ^= R(x[ 8]+x[ 4],13); x[ 0] ^= R(x[12]+x[ 8],18);
....
x[14] ^= R(x[13]+x[12],13); x[15] ^= R(x[14]+x[13],18);
}
which would be translated into a serial of affine functions:
ReadAccess := { Stmt_for_body5[i0] -> MemRef_x[12] };
ReadAccess := { Stmt_for_body5[i0] -> MemRef_x[4] };
MustWriteAccess := { Stmt_for_body5[i0] -> MemRef_x[4] };
ReadAccess := { Stmt_for_body5[i0] -> MemRef_x[0] };
...
Consequently, the PollyDependence pass would produce very complex Read/Write/MayWr...
2013 Aug 08
0
[LLVMdev] [Polly] Summary of some expensive compiler passes, especially PollyDependence
...R(x[ 4]+x[ 0], 9);
> x[12] ^= R(x[ 8]+x[ 4],13); x[ 0] ^= R(x[12]+x[ 8],18);
> ....
> x[14] ^= R(x[13]+x[12],13); x[15] ^= R(x[14]+x[13],18);
> }
> which would be translated into a serial of affine functions:
> ReadAccess := { Stmt_for_body5[i0] -> MemRef_x[12] };
> ReadAccess := { Stmt_for_body5[i0] -> MemRef_x[4] };
> MustWriteAccess := { Stmt_for_body5[i0] -> MemRef_x[4] };
> ReadAccess := { Stmt_for_body5[i0] -> MemRef_x[0] };
> ...
> Consequently, the PollyDependence pass would produce...
2013 Aug 09
2
[LLVMdev] [Polly] Summary of some expensive compiler passes, especially PollyDependence
...gt; x[12] ^= R(x[ 8]+x[ 4],13); x[ 0] ^= R(x[12]+x[ 8],18);
>> ....
>> x[14] ^= R(x[13]+x[12],13); x[15] ^= R(x[14]+x[13],18);
>> }
>> which would be translated into a serial of affine functions:
>> ReadAccess := { Stmt_for_body5[i0] -> MemRef_x[12] };
>> ReadAccess := { Stmt_for_body5[i0] -> MemRef_x[4] };
>> MustWriteAccess := { Stmt_for_body5[i0] -> MemRef_x[4] };
>> ReadAccess := { Stmt_for_body5[i0] -> MemRef_x[0] };
>> ...
>> Consequently, the PollyDependence...
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
...d.reload >= 1 };
Scattering :=
[cond.reload] -> { Stmt_for_body16[i0, i1, i2, i3, i4, i5] -> scattering[0, i0, 0, i1, 0, i2, 0, i3, 0, i4, 0, i5, 0] };
ReadAccess :=
[cond.reload] -> { Stmt_for_body16[i0, i1, i2, i3, i4, i5] -> MemRef_X[0] };
MustWriteAccess :=
[cond.reload] -> { Stmt_for_body16[i0, i1, i2, i3, i4, i5] -> MemRef_X[0] };
}
Similarly, the scops result for "X[0]=0" would be:
$ polly-opt -basicaa -polly-prepare -polly-scops SingleAssign.preopt.ll -analyze
(*Note: y...
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