Displaying 5 results from an estimated 5 matches for "kernel_gemm".
2017 Mar 12
2
What does it mean by a "DICompileUnit missing from llvm.dgs.cu" ? | Where is the error ?
On Sat, Mar 11, 2017, at 07:34 PM, David Blaikie via llvm-dev wrote:
> On Sat, Mar 11, 2017 at 3:10 AM SANJAY SRIVALLABH SINGAPURAM via llvm-dev
> <
> llvm-dev at lists.llvm.org> wrote:
>
> > Hello,
> >
> > One of my Julia programs failed to execute with the following error,
> > DICompileUnit not listed in llvm.dbg.cu
> > !11 = distinct
2013 May 03
2
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
...2)-640);c3<=-20*c2;c3+=32)
{
for
(c4=max(ceild(-c3-p_1-30,20),c2);c4<=min(min(floord(-c3,20),c2+31),p_0-1);c4++)
{
for (c5=max(c3,-20*c4-p_1+1);c5<=min(-20*c4,c3+31);c5++) {
Stmt_for_body3(c4,-20*c4-c5);
}
}
}
}
}
Stmt_entry_split();
:: kernel_gemm : for.cond1.preheader => for.end28
for (c2=0;c2<=1023;c2+=32) {
for (c3=0;c3<=1023;c3+=32) {
for (c4=c2;c4<=c2+31;c4++) {
for (c5=c3;c5<=c3+31;c5++) {
Stmt_for_body3(c4,c5);
}
}
}
}
for (c2=0;c2<=1023;c2+=32) {
for (c3=0;c3<=1023;c3+=32...
2013 May 03
0
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
Dear Tobias,
Thank you very much for your very helpful advice.
Yes, -debug-pass and -time-passes are two very useful and powerful options when evaluating the compile-time of each compiler pass. They are exactly what I need! With these options, I can step into details of the compile-time overhead of each pass. I have finished some preliminary testing based on two randomly selected files from
2013 May 02
2
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
On 04/30/2013 04:13 PM, Star Tan wrote:
> Hi all,
[...]
> How could I find out where the time is spent on between two adjacent Polly passes? Can anyone give me some advice?
Hi Star Tan,
I propose to do the performance analysis using the 'opt' tool and
optimizing LLVM-IR, instead of running it from within clang. For the
'opt' tool there are two commands that should help
2013 May 03
0
[LLVMdev] [Polly] GSoC Proposal: Reducing LLVM-Polly Compiling overhead
...>(c4=max(ceild(-c3-p_1-30,20),c2);c4<=min(min(floord(-c3,20),c2+31),p_0-1);c4++)
>{
> for (c5=max(c3,-20*c4-p_1+1);c5<=min(-20*c4,c3+31);c5++) {
> Stmt_for_body3(c4,-20*c4-c5);
> }
> }
> }
> }
>}
>Stmt_entry_split();
>:: kernel_gemm : for.cond1.preheader => for.end28
>for (c2=0;c2<=1023;c2+=32) {
> for (c3=0;c3<=1023;c3+=32) {
> for (c4=c2;c4<=c2+31;c4++) {
> for (c5=c3;c5<=c3+31;c5++) {
> Stmt_for_body3(c4,c5);
> }
> }
> }
>}
>for (c2=0;c2<=1023;c...