Displaying 20 results from an estimated 400 matches similar to: "[LLVMdev] [Polly] Aliasing problems escalation (WAS: Re: [DragonEgg] [Polly] Should we expect DragonEgg to produce identical LLVM IR for identical GIMPLE?)"
2013 Jan 02
0
[LLVMdev] [DragonEgg] [Polly] Should we expect DragonEgg to produce identical LLVM IR for identical GIMPLE?
Hi Duncan & Tobi,
Thanks a lot for your interest, and for pointing out differences in GIMPLE
I missed.
Attached is simplified test case. Is it good?
Tobi, regarding runtime alias analysis: in KernelGen we already do it along
with runtime values substitution. For example:
<------------------ __kernelgen_main_loop_17: compile started
--------------------->
Integer args substituted:
2013 Jan 02
2
[LLVMdev] [DragonEgg] [Polly] Should we expect DragonEgg to produce identical LLVM IR for identical GIMPLE?
On 01/01/2013 02:45 PM, Duncan Sands wrote:
> Hi Dmitry,
>
>>
>> In our compiler we use a modified version LLVM Polly, which is very
>> sensitive to
>> proper code generation. Among the number of limitations, the loop region
>> (enclosed by phi node on induction variable and branch) is required to
>> be free
>> of additional memory-dependent
2013 Jan 04
0
[LLVMdev] [Polly] Aliasing problems escalation (WAS: Re: [DragonEgg] [Polly] Should we expect DragonEgg to produce identical LLVM IR for identical GIMPLE?)
PS: Another possibility is to do link-time optimization, since at that point the
optimizers are capable of finding out if that global is used anywhere else or
not.
2006 Jul 12
2
string-length limitations
Hi,
I'm attempting to "glm" a formula - something that's not caused problems in
the past. I've used formulas of the form
formula( "dependant-variable~independant-variables" )
where the independant variable string is of the form:
"indvar1+indvar2+...+indvarN"
Now, however, our independant variable strings are quite long (hundreds of
2013 Aug 08
0
[LLVMdev] [Polly] Summary of some expensive compiler passes, especially PollyDependence
On 08/08/2013 01:29 AM, Star Tan wrote:
> Hi all,
>
>
> I have summarized the top 10 compiler passes for Polly when compiling LLVM test-ssuite. Results can be viewed on:
> https://gist.github.com/tanstar/581bcea1e4e03498f935/raw/f6a4ec4e8565f7a7bbdb924cd59fcf145caac039/Polly-top10
>
>
> Based on the comparison between "clang -O3" and "polly -O3"
2013 Aug 09
2
[LLVMdev] [Polly] Summary of some expensive compiler passes, especially PollyDependence
At 2013-08-08 22:28:33,"Tobias Grosser" <tobias at grosser.es> wrote:
>On 08/08/2013 01:29 AM, Star Tan wrote:
>> Hi all,
>>
>>
>> I have summarized the top 10 compiler passes for Polly when compiling LLVM test-ssuite. Results can be viewed on:
>>
2013 Aug 08
2
[LLVMdev] [Polly] Summary of some expensive compiler passes, especially PollyDependence
Hi all,
I have summarized the top 10 compiler passes for Polly when compiling LLVM test-ssuite. Results can be viewed on:
https://gist.github.com/tanstar/581bcea1e4e03498f935/raw/f6a4ec4e8565f7a7bbdb924cd59fcf145caac039/Polly-top10
Based on the comparison between "clang -O3" and "polly -O3" listed on:
2014 Dec 31
0
[PATCH 2/2] nvc0: regenerate rnndb headers
The headers hadn't been regenerated in a long time and had seen a number
of manual modifications. A few changes:
- remove nvc0_2d entirely, use the nv50 header which has the nvc0
values too
- remove 3ddefs, it's identical to the nv50 file
- move macros out into a separate file
Also the upstream rnndb changed the overall chip naming convention; this
was fixed up manually in the
2013 Jul 28
0
[LLVMdev] [Polly] Analysis of the expensive compile-time overhead of Polly Dependence pass
On 07/28/2013 06:52 AM, Star Tan wrote:
> Hi Tobias,
>
> I tried to investigated the problem related to ScopInfo, but I need your
> help on handling some problems about ISL and SCEV.
I copied the list as the discussion may be helpful for others.
@Sven, no need to read all. Just search for your name.
[..]
>>The interesting observation is, that Polly introduces three parameters
2013 Jul 31
1
[LLVMdev] [Polly] Analysis of the expensive compile-time overhead of Polly Dependence pass
Hi Tobias and Sven,
Thanks for your discussion and suggestion.
@Sven: ISL actually allows users to have different identifiers with the same name. The problem that we have discussed is caused by incorrect usage of isl_space in Polly, so please do not worry about ISL library. You can skip the following information related to Polly implementation.
@Tobias and Polly developers:
I have attached
2013 Aug 17
2
[LLVMdev] [Polly] Analysis of extra compile-time overhead for simple nested loops
At 2013-08-16 22:32:30,"Tobias Grosser" <tobias at grosser.es> wrote:
>>
>> Yes, I have changed the original code to the form you suggested:
>> for (i
>> for (j
>> ...
>> x=1
>
>Sorry, I meant
> x[0] +=
>
It is interesting that Polly would run much faster if we change the
2016 Oct 16
10
[PATCH 1/5] hwdefs: update nvc0_3d, add gm107_texture for new TIC format
These are copied directly from the mesa repository.
Signed-off-by: Ilia Mirkin <imirkin at alum.mit.edu>
---
src/hwdefs/gm107_texture.xml.h | 365 +++++++++++++++++
src/hwdefs/nvc0_3d.xml.h | 867 +++++++++++++++++++++++++----------------
2 files changed, 892 insertions(+), 340 deletions(-)
create mode 100644 src/hwdefs/gm107_texture.xml.h
diff --git
2009 Apr 24
2
[PATCH] Blackfin: cleanup astat/cc/hardware loop asm clobbers
Most asm statements clobber ASTAT bits (shifts, maxes, etc...) but do
declare the register as clobbered. Same thing with CC in a few places.
Some places make an attempt at clobbering some hardware loop registers,
but it's very incomplete compared with how many asm statements actually
use hardware loops.
Signed-off-by: Mike Frysinger <vapier at gentoo.org>
---
libspeex/bfin.h
2014 Dec 31
2
[PATCH 1/2] nv50: regenerate rnndb headers
The headers hadn't been regenerated in a long time, and there were a few
minor divergences. Among other things, rnndb has changed naming to
G80/etc, for now I've not tackled switching that over and manually
replaced the nvidia codenames back to the chip ids. However no other
modifications of the headergen'd headers was done.
Signed-off-by: Ilia Mirkin <imirkin at alum.mit.edu>
2019 May 29
2
Basic block merging
Under certain circumstances, my compiler outputs basic blocks having the
same function:
bb_97: ; preds = %bb_1
%476 = getelementptr inbounds %LMtop.I0.ARType, %LMtop.I0.ARType* %0, i64
0, i32 6
%477 = bitcast i8** %476 to %LBstd.Cprocess.CRType**
%478 = load %LBstd.Cprocess.CRType*, %LBstd.Cprocess.CRType** %477, align
8
%479 = getelementptr
2013 Mar 06
1
need help using read.fortran
Hello kind and R-knowledgeable souls!
I am trying to use read.fortran to read in old datasets in 80-column-card format
with no separators between variables (just 80 columns of solid digits).
I comprehend the instructions for specifying the columns for each variable, but
I can't understand how to assign the variable names after reading the help pages
for read.fortran, read.fwf and
2008 Oct 20
1
[LLVMdev] mixed bc file
I have a question with llvm-gcc and llvm-gfortran.
Is it possible that llvm-ld can combine different bc files compiled from C programme and Fortran Programme together?
For example:
Compile a c program into llvm bc file by the task:
# llvm-gcc -emit-llvm test.c -c -o test.bc
and then compile a fortran program into llvm bc file by the task:
# llvm-gfortran -emit-llvm testf.f -c -o testf.bc
And
2019 May 29
3
Basic block merging
Am Mi., 29. Mai 2019 um 13:31 Uhr schrieb Shawn Landden via llvm-dev
<llvm-dev at lists.llvm.org>:
>
> On Wed, May 29, 2019 at 10:49 AM David Jones via llvm-dev
> <llvm-dev at lists.llvm.org> wrote:
> >
> > Under certain circumstances, my compiler outputs basic blocks having the same function:
> >
> > bb_97: ;
2023 Dec 04
1
Fit NLE - was: computer algebra in R
Fit NLE - was: [R] computer algebra in R
Original post:
https://stat.ethz.ch/pipermail/r-help/2023-November/478619.html
Dear Kornad,
I think I have started to understand what you try to achieve. The problem is to fit a NLE and compute the parameters of the NL-Eq. I have included the R Help-list back in the loop, as I am not an expert in optimization.
Goal:
y ~ I0 + IHD * hd + ID * d;
where:
y
2016 Aug 05
0
Extracting the names of the variables that creates loop-carried dependencies
Hi Michael,
Thanks for your answer. Checking the indexes looks as an another
straightforward approach to identify the actual loop-carried dependencies.
What is not clear to me still is how it looks like the code to extract the
ScopArrayInfo pointer from the user part.
Miguel
On 08/05/2016 02:32 PM, Michael Kruse wrote:
> I just realized this is a crossposting llvm-dev/polly-dev. It has