Hi,
my colleague Brian has posted the instructions to set up
an AArch64 virtual machine running ubuntu on top of qemu:
http://rzycki.blogspot.com/2014/08/using-qemu-to-run-ubuntu-arm-64-bit.html
We are using this setup to bootstrap gcc on aarch64.
Sebastian
On Fri, Apr 3, 2015 at 1:10 PM, Jeff Law wrote:
> On 04/03/2015 09:41 AM, Diego Novillo wrote:
>>
>> On Fri, Apr 3, 2015 at 11:35 AM, Jeff Law wrote:
>> I was hesitant to offer this option, but it's certainly a good
>> starting point. The representation encodes CFG, SSA, attributes,
>> declarati
On Tue, Apr 7, 2015 at 3:33 AM, Richard Biener
wrote:
>> Having an IR that is more readable than LLVM's would be nice.
>
> I still like the idea of using C + extensions most.
+1
> As well as making the
> -fdump-tree-XXX dumps (more) valid C (+ extensions). Cut & pasting
> from dump files to gen
We also needed to adjust the gcov_version in autofdo/gcov.cc to read
0x1 for dev branches of gcc (instead of the current 0x3430372a for
some released version of GCC):
-DEFINE_uint64(gcov_version, 0x3430372a,
+DEFINE_uint64(gcov_version, 0x1,
Sebastian
On Tue, Apr 21, 2015 at 3:33 PM, Aditya K w
15 at 3:53 PM, Dehao Chen wrote:
> That's correct. For trunk, gcov_version is 0x1. We defined this as a
> flag so that you can actually change it via --gcov_version=0x1 instead
> of changing the code.
>
> Dehao
>
> On Tue, Apr 21, 2015 at 1:47 PM, Sebastian Pop wr
Segher Boessenkool wrote:
> On Tue, Sep 08, 2015 at 06:39:19PM +, Aditya K wrote:
> > IIUC, in the haifa-sched.c, the default scheduling algorithm seems to be
> > top-down (before reload).
> > Is there a way to schedule the other way (bottom up), or both ways?
> >
> > As a use case for bottom
On Fri, Nov 20, 2015 at 9:31 AM, David Edelsohn wrote:
> Sebastian,
>
> I have tried to build GCC with Graphite and ISL on AIX and encountered
> two problems:
>
> (1) isl/ctx.h
>
> typedef enum {
> isl_stat_error = -1,
> isl_stat_ok = 0,
> } isl_stat;
>
> GCC complains about the co
Thanks David for reporting these problems.
On Fri, Nov 20, 2015 at 9:31 AM, David Edelsohn wrote:
> (2) All of the graphite*.c files include ISL headers first. This
> order is not supported by GCC development and creates conflicts for
> types and definitions provided / overridden by GCC headers,
On Fri, Nov 20, 2015 at 10:23 AM, Sven Verdoolaege wrote:
> On Fri, Nov 20, 2015 at 10:14:47AM -0600, Sebastian Pop wrote:
>> On Fri, Nov 20, 2015 at 9:31 AM, David Edelsohn wrote:
>> > Sebastian,
>> >
>> > I have tried to build GCC with Graphite and ISL on A
On Fri, Nov 20, 2015 at 10:43 AM, David Edelsohn wrote:
> On Fri, Nov 20, 2015 at 11:28 AM, Sebastian Pop wrote:
>> Thanks David for reporting these problems.
>>
>> On Fri, Nov 20, 2015 at 9:31 AM, David Edelsohn wrote:
>>> (2) All of the graphite*.c files in
On Fri, Oct 12, 2018 at 2:14 PM Marc Glisse wrote:
> On Fri, 12 Oct 2018, Thomas Schwinge wrote:
>
> > Hmm, and without any OpenACC/OpenMP etc., actually the same problem is
> > also present when running the following code through the vectorizer:
> >
> >for (int tmp = 0; tmp < N_J * N_I; ++tm
e a matrix multiplication loop
To: s...@gcc.gnu.org
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=14741
--- Comment #18 from Sebastian Pop ---
On my laptop ARM Exynos5 at 1.6GHz I get this:
gfortran -ffast-math -O3 t.f90
./a.out
192.7510.2399826
gfortran -ffast-math -O3
:24 AM, Sebastian Pop wrote:
>>
>> Hi Jeff,
>>
>> let's start with getting this bug fixed.
>
> So what do you need? Just making the tiling factor won't solve the problem
> AFAICT. As I've mentioned, I'm already over-booked on other things and
&g
, Sebastian Pop wrote:
> For this testcase, it looks like the scop detection pass should be fixed:
> it currently discards the interesting loop nest. I can help figuring out what
> is needed to be fixed, though I cannot send patches to fix the problem.
>
> On Thu, Jul 18, 2013 at 11:
Daniel Berlin wrote:
> Thus, it is algorithmically unsound in it's current form :)
> Again, this is *only* the piece that attempts to convert loops
> to perfect nests.
> This is in fact, not terribly surprising, since the algorithm used was the
> result of
> Sebastian and I sitting at my whiteboa
Diego Novillo wrote:
> Richard Henderson wrote on 06/08/06 16:36:
>
> > As folks have pointed out down-thread wrt multi-dimensional arrays,
> > I think this is a rather poor idea. Both for components and arrays.
> >
> Yeah, multi-dimensional arrays are a problem. I'm not sure I see the
> flatte
ot the
> initial source code level, of course ;-)) - RTL, GIMPLE, GENERIC?
Any.
> 3. Are there any attempts to provide a C backend, so far?
>
Yes, gcc2c from sun.com, though this is a dead project for more than 3
years now.
Sebastian Pop
Steven Bosscher wrote:
> 2. Probably GIMPLE, but you can't express all of GIMPLE in ANSI C
> (with GCC extensions you can probably express most of it though).
Theoretically you can express all of GIMPLE in ANSI C,
practically it would require some engineering,
pragmatically it is worthless for GCC
Diego Novillo wrote:
> Roberto COSTA wrote on 06/12/06 03:50:
>
> > Every so often CIL looks to poke in the works of the mailing list, but I
> > haven't been able to track the current status of the discussion on the
> > topic.
> >
> We have started work on a bytecode representation that will initi
Diego Novillo wrote:
> > The document in which Mark has announced the LTO briefly mentions
> > that CIL was not retained for dumping the IR, without giving an
> > explicit reason, so I think that we need a clear position from the
> > FSF whether such a backend is accepted to be part of GCC.
> >
Roberto COSTA wrote:
> Ori Bernstein wrote:
> >On Mon, 12 Jun 2006 09:50:13 +0200, Roberto COSTA <[EMAIL PROTECTED]>
> >said:
> >
> >
> >>Hello,
> >>
> >>I'm working for an R&D organization of STMicroelectronics. Within our
> >>team we have decided to write a gcc back-end that produces CIL binar
kernel coder wrote:
> is there any way in gdb to step backward.
>
not yet, and if this feature is implemented it should be quite
restricted, think about undoing side effects, as disk read/write...
But you can put a breakpoint before the current point, and then run
again gdb on your program.
Daniel Jacobowitz wrote:
> It doesn't have an actual reverse debugging implementation yet - but
> it's been proposed.
>
Here it is, but I don't know the exact current status of the proposal:
http://sourceware.org/ml/gdb/2006-01/msg00013.html
Here is the documentation for the data dependence analysis.
@node Dependency analysis
@section Data Dependency Analysis
@cindex Data Dependency Analysis
The code for the data dependence analysis can be found in
@file{tree-data-ref.c} and its interface and data structures are
described in @file{t
Joe Buck wrote:
> On Wed, Aug 30, 2006 at 06:52:59PM +0200, Basile STARYNKEVITCH wrote:
> > Le Wed, Aug 30, 2006 at 06:36:19PM +0200, basile écrivait/wrote:
> > >
> > > Maybe some of your are aware of MyGCC http://mygcc.free.fr/ which
> > > seems to be an extended GCC to add some kind of static an
Sebastian Pop wrote:
> In my opinion the patch needs major rework and improvements to be
> included in trunk.
Here is my short review of the mygcc patch that lists some possible
improvements and things that have to be redesigned:
http://gcc.gnu.org/ml/gcc-patches/2006-08/msg00616.html
Daniel Berlin wrote:
> >As some few people might already know, the GGCC (globalgcc) project is
> >just starting (partly funded within the ITEA framework by french,
> >spanish, swedish public money) - its kick off meeting is next week in
> >Paris.
> >
> >GGCC aims to provide a (GPL opensource) exten
Ira Rosen wrote:
>
> > Here is the documentation for the data dependence analysis.
>
> I can add a description of data-refs creation/analysis if it is useful.
>
That's a good idea, thanks.
Sebastian
Thank you, the documentation looks good.
Ira Rosen wrote:
>
> @item @code{first_location_in_loop}: Provides information about the first
> location accessed by the data reference in the loop and about the access
> function used to represent evolution relative to this location. This data
> is used
Basile STARYNKEVITCH wrote:
>
> How does one get the source location (e.g. start and end filename,
> linenumber, ...) of a tree node;
You can use the same code as in tree-vectorizer.h:
#ifdef USE_MAPPED_LOCATION
typedef source_location LOC;
#define UNKNOWN_LOC UNKNOWN_LOCATION
#define EXP
Hi,
On 10/23/06, Zdenek Dvorak <[EMAIL PROTECTED]> wrote:
Hello,
for project http://gcc.gnu.org/wiki/PreservingLoops, I am considering
introducing a tree LOOP_HEADER with single argument N (number of
iterations of the loop), that would be present in IL at the beginning of
header of each loop.
> > quite a lot at the moment). To keep the information valid, we need
> > to prevent optimizations from destroying it (e.g., if the number
> > is n_1 = n_2 - 1, and this is the last use of n_1, we do not want
> > DCE to remove it); this is easy to achieve if n_1 would be the
> > argume
> You are proposing to complete the ssa representation such that
> foreach_ssa_uses also iterates over the niter information (a bit like vrp
> modifies the ssa chains with its extra assert information). Wouldn't it
> be possible to not insert this niter information in the representation of
> the
On 11/13/06, Ferad Zyulkyarov <[EMAIL PROTECTED]> wrote:
Hi,
May you point me out some sources about writing new #pragma directives
in GCC. I looked at the internet for something to start from but
unfortunately I could not find anything.
google("site:gcc.gnu.org inurl:gcc-patches pragma")
http
On 11/15/06, Sashan Govender <[EMAIL PROTECTED]> wrote:
On 11/15/06, Daniel Berlin <[EMAIL PROTECTED]> wrote:
> On 11/14/06, Sashan Govender <[EMAIL PROTECTED]> wrote:
> > Hi
> >
> > I was looking at the vectorizer
> > (http://gcc.gnu.org/projects/tree-ssa/vectorization.html) and noticed
> > that
On 11/15/06, Steven Bosscher <[EMAIL PROTECTED]> wrote:
On 11/15/06, Sebastian Pop <[EMAIL PROTECTED]> wrote:
> There is a ddg in this patch if somebody wants the classic Allen&Kennedy
> way to look at the dependences:
>
http://gcc.gnu.org/wiki/OptimizationCourse
On Oct 29, 2007 10:49 AM, Dorit Nuzman <[EMAIL PROTECTED]> wrote:
> I wonder if it's versioning-for-aliasing (run-time dependence testing) that
> was responsible for a lot of the new vectorizable loops
>
It is then possible that the code size noticeably increased. Toon
could you provide more data
Hi,
In a recent update of the page http://gcc.gnu.org/wiki/Graphite I left
the "Testing Lambda and Graphite frameworks" part in the open tasks.
One of the subitems of this task is:
"Add expect scripts for comparing outputs of testcases compiled with
different options. For instance compare output
On Nov 28, 2007 6:36 PM, Janis Johnson <[EMAIL PROTECTED]> wrote:
>
> On Wed, 2007-11-28 at 15:00 -0600, Sebastian Pop wrote:
> > Hi,
> >
> > In a recent update of the page http://gcc.gnu.org/wiki/Graphite I left
> > the "Testing Lambda and Graphite frame
On Dec 7, 2007 8:28 AM, Emmanuel Fleury <[EMAIL PROTECTED]> wrote:
> Is anyone planning to go at CC'08 or COCV'08 ?
I was planning, but my paper at ESOP'08 was rejected, so I won't go there ;-)
Sebastian
Please stop spamming my gcc@gcc.gnu.org email box.
All the messages that you sent are just off-topic for this mailing list.
Please STOP sending emails.
Thank you,
Sebastian Pop
On Dec 12, 2007 4:42 PM, J.C. Pizarro <[EMAIL PROTECTED]> wrote:
>
> On 2007/12/12, Jonathan Wakely <[
Hi,
I've run a build for spec cpu2006 with -O3 -ftree-parallelize-loops=16
and interestingly there were some fails that I will investigate later.
So I'm just reporting these, and asking for somebody who could fix
the link options for autopar. I'm attaching a patch, not sure it will build.
Before
> I've run a build for spec cpu2006 with -O3 -ftree-parallelize-loops=16
This is on amd64-linux.
le without -ftree-loop-linear
>
Could you verify that the attached patch fixes also this problem?
Thanks again,
Sebastian
2007-12-15 Sebastian Pop <[EMAIL PROTECTED]>
* lambda-code.c (can_duplicate_iv): New.
(cannot_convert_modify_to_perfect_nest): New.
(cannot_convert_bb_to_perfect_
On Dec 16, 2007 4:24 AM, Toon Moene <[EMAIL PROTECTED]> wrote:
> Here are, in addition, the numbers for compiling and
> running HIRLAM with -ftree-loop-distribution (after applying your patch,
> obviously).
>
> In short, almost 1900 more loops are vectorized, but that's of course
>
Hi,
one more leak, this time in alias analysis that initializes an obstak
without freeing it. This is with the testcase of
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=23821
valgrind --leak-check=full cc1 -O2 pr23821.c
==16661== 9,244 bytes in 68 blocks are definitely lost in loss record 2 of 5
Hi,
When a loop is vectorized, some statements are removed from the basic
blocks, but the vectorizer information attached to these BBs is never
freed. This is because the attached information is freed by walking
the statements of the basic blocks: see tree-vectorizer.c:1750, but
the transformed c
On Feb 6, 2008 9:02 PM, Richard Kenner <[EMAIL PROTECTED]> wrote:
> Which would be more interesting: a tutorial on the Ada language itself or
> on the "demands" it places on GCC?
I would say that both tutorials sound interesting ;-)
When I first heard a tutorial on the Ada language, I found it ve
2008/2/7 Tobias Grosser <[EMAIL PROTECTED]>:
> 2. Which loops are part of a SCoP:
>
> At the moment we detect the loops, which are part of a SCoP like this:
>
> FORALL_BB_IN_SCOP(bb)
> {
> VEC_loops_add(bb->loop_father);
> }
>
> This seems incorrect if we look at this SCoP:
>
> h #loop0
> |
> a
On Mon, Mar 3, 2008 at 3:08 PM, Richard Guenther <[EMAIL PROTECTED]> wrote:
> I am aware of the following merge candidates: the LTO branch, the
> incremental compiler branch, the selective scheduling branch, the
> YARA branch and of course the tuples branch. Please announce those
> I forgot so
On Wed, Apr 16, 2008 at 10:44 AM, Andrew Pinski <[EMAIL PROTECTED]> wrote:
> Huh??? Spu support is in gcc 4.3.0.
>
Ok, GCC4.3 can compile for Cell, but what is the status of libGOMP on
Cell? Is there an efficient port of libGOMP for Cell? I assume that
the linux port could be used for Cell, bu
On Thu, Apr 17, 2008 at 10:36 PM, Andrew Pinski <[EMAIL PROTECTED]> wrote:
> Correct. I was just trying to correct the idea that spu support was
> not committed to the FSF GCC. Considering I am a maintainer of it
> too, I don't want people to get the wrong thought there.
>
Ok, I got an email
On Fri, Apr 18, 2008 at 3:32 AM, Jakub Jelinek <[EMAIL PROTECTED]> wrote:
> 3- Delay the end of stage 1 till mid June or so. I don't see the need to
> rush out with 4.4 release, when it would have only limited advantages over
> 4.3 to offer. Having IRA, Tuples, OpenMP3 (what other branches mig
On Fri, May 9, 2008 at 2:09 AM, Sandeep Maram <[EMAIL PROTECTED]> wrote:
> i_23 is the loop iterator of loop_2 . i_22 is the loop iterator of loop_1.
>
> How can I rename i_23 as i_22?
>
In lambda-code.c:1858 you have some code that does a similar renaming:
FOR_EACH_IMM_USE_STMT (stmt, imm_iter,
Hi,
> So the statement
> j_12 = D.1190_11 + j_24;
> is now present in loop_b, but I am unable to create the phi node for
> it in loop_b. I tried to do so using
> for (phi = phi_nodes (loop_a->header);
> phi;)
>{
> next = PHI_CHAIN (phi);
> create_phi_node (SSA_NAME_VAR (PHI_RES
AMD Opteron 8354 "Barcelona B3" processors
and 16GB of RAM to the GCC Compile Farm
project for use by free software developers. Hosting is donated
by http://www.inria.fr/saclay/";>INRIA Saclay.
Thanks,
Sebastian Pop
--
AMD - GNU Tools
On Fri, May 23, 2008 at 8:03 PM, Gerald Pfeifer <[EMAIL PROTECTED]> wrote:
> On Fri, 23 May 2008, Sebastian Pop wrote:
>> AMD Developer Central has generously donated two bi-quad core
>> machines with the latest AMD Opteron 8354 "Barcelona B3" processors
>> an
ops.
>
This was also the case before: we needed a map between the old
induction variable and the new ones.
Sebastian Pop
--
AMD - GNU Tools
pe not years).
Sebastian Pop
--
AMD - GNU Tools
Hi,
I put the scripts that we are using to test performance regressions of GCC on
git://repo.or.cz/gcc-perf-regression-tester.git and I've wrote a small
intro page
http://gcc.gnu.org/wiki/PerfRegressionTester in the hope that these scripts will
be useful to other people.
I've been thinking to ins
On Fri, Aug 12, 2011 at 12:50, Jack Howarth wrote:
> On Fri, Aug 12, 2011 at 07:35:24PM +0200, Sven Verdoolaege wrote:
>> On Fri, Aug 12, 2011 at 05:02:18PM +, Joseph S. Myers wrote:
>> > On Fri, 12 Aug 2011, Sebastian Pop wrote:
>> > > +@item Integer
Zack Weinberg wrote:
>
> and report (a) the numbers reported by the "time" command,
real0m7.819s
user0m4.442s
sys 0m0.513s
> (b) what sort of machine this is and how old, and
x86_64-unknown-linux-gnu, AMD Athlon(tm) 64 Processor 3700+
> (c) whether or not you would be willing to
Daniel Berlin wrote:
> On Thu, 2005-05-12 at 10:01 -0600, Zan Lynx wrote:
> > I'm not subscribed to the list (please CC replies to me) and this isn't
> > a real bug report, just a sort of quick check to see if its a known
> > problem.
> >
> > When I compiled openssl-0.9.7g using -O3 and -ftree-loo
Daniel Berlin wrote:
>
> Does -fno-tree-ch fix it? (i'm just curious)
>
No. It still ICEs.
Scott Robert Ladd wrote:
>
> My conclusion is the composite switches like -O2 are good only for
> general-purpose code. Anyone explicitly interested in squeezing out the
> most performance needs to do analysis and use application-specific switches.
>
Probably this situation is created by the fac
Robert Dewar wrote:
> Yes, absolutely, a compiler should generate warnings as much as possible when
> it is making these kind of assujmptions.
Then, you will like the following kind of patches:
Index: tree-data-ref.c
===
RCS file: /c
Robert van Engelen wrote:
>
> 1. After reading the paper, we concluded that the scalar evolutions are
> actually a restricted polynomial form of chains of recurrences by
> Bachmann and Zima [6,8]. Is this true? Or is there an essential
> difference with multi-variate chains of recurrences [7]?
DJ Delorie wrote:
>
> > Then, you will like the following kind of patches:
> >
> > + warning (0, "%H undefined behavior if loop runs for more than %qE
> > iterations",
> > + find_loop_location (loop), estimation);
>
> I think we would like them better if you could choose to silenc
Robert Dewar wrote:
>
> As with all warnings, you have to run this over a large test suite
> of real applications to find out whether there are too many false
> positives.
I don't really see what a false positive could be in this case. In
the patch that I have proposed, the warning is triggered
Robert Dewar wrote:
>
> and that is called a false positive if in fact the loop does
> not overrun. this sounds very dubious to me
The problem is that the compiler has no other information about the
number of iterations in the loop, otherwise it wouldn't spend cycles
on computing such estimations
Michael Veksler wrote:
> This is problematic:
> 1. I am not sure it will turn the warning off.
So you don't want a warning that cannot be turned off simply by
modifying the code. Then, I withdraw the patch that I have proposed
to implement the warning.
Hi,
On Thu, Jul 23, 2009 at 10:55, Jack Howarth wrote:
> Is it known yet whether the changes in cloog/ppl will require
> new soversions of those libraries or might the new cloog/ppl
> libraries be backward compatible with current gcc 4.4.x (ie have
> the same soversion number but a higher compati
On Mon, Aug 10, 2009 at 04:22, Rainer Emrich wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> I build my gcc windows versions (*-pc-cygwin, *-pc-mingw32, *-w64-mingw32)
> using
> static build libraries gmp, mpfr, mpc, ppl and cloog. Configuration and
> building
> of gcc is really easy
Hi,
On Thu, Aug 13, 2009 at 04:02, Eric Fisher wrote:
> The error is reported in build2_stat, by
>
> gcc_assert (POINTER_TYPE_P (tt) && POINTER_TYPE_P (TREE_TYPE (arg0))
> && INTEGRAL_TYPE_P (TREE_TYPE (arg1))
> && useless_type_conversion_p (sizetype, TREE_TYPE (arg1)
Hi,
> Seems that use info is not updated.
>
You should put a TODO_update_ssa in the flags of prefetching pass.
With the attached patch I don't see an error.
Also, why don't you use trunk for your developments?
Sebastian
diff --git a/gcc/tree-flow.h b/gcc/tree-flow.h
index 1d2e69a..1320b5a 10064
Hi Ian,
On Tue, Nov 10, 2009 at 17:21, Ian Lance Taylor wrote:
> For the last year and a half I've been working on a gcc frontend for
> Go, a new experimental systems programming language designed by a
> small group at Google. We've just open sourced it. You can read more
> about it at http://g
Hi Toon,
On Mon, Nov 30, 2009 at 13:51, Toon Moene wrote:
> Sebastian,
>
> I saw you updated the Graphite Wiki page, and I wondered if there are any
> concrete plans on loop fusion.
>
> The reason I ask is because in Fortran (as of Fortran 90) one often sees
> assignments like:
>
> REAL, ALLOCATA
On Fri, Dec 4, 2009 at 09:41, Toon Moene wrote:
> I wonder if Graphite can do this one (or is planned to be able to):
>
> Another loop optimization that suggests itself
> is the following, trying to eliminate unnecessary
> loop constructs:
> \begin{verbatim}
> SUBROUTINE SUB(A, B, C, N, M)
>
On Fri, Dec 4, 2009 at 10:39, Tobias Grosser wrote:
> I do not believe this is already possible for arbitrary N.
>
> You would have to write a scattering function like this
>
> s0 = i+n*(j-1)
>
> What is
>
> s= i + n*j - n
> ^^^ Here is a product that is not affine linear.
Yes this is affi
On Fri, Dec 4, 2009 at 10:44, Cédric Bastoul wrote:
> I see no way to do this with affine scattering. We would need
> polynomial functions like Armin Grosslinger is doing, see
> http://www.infosun.fim.uni-passau.de/cl/publications/docs/MIP-0803.pdf
> but I think that's too slow at the moment...
I
On Fri, Dec 4, 2009 at 11:08, Cédric Bastoul wrote:
> We usually call this case (parameter times IV) "fully parametric".
> Armin Grosslinger looked at it before finding a more general solution,
I don't want the more general solution: IV * IV doesn't commonly
happen, but parameter * IV does, and o
On Wed, Jan 13, 2010 at 14:55, Rainer Emrich wrote:
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> IMHO it would be a godd idea to add the following two configure options to ppl
> configure:
> --with-gmp-include=DIR GMP include directory
> --with-gmp-lib=DIR GMP lib directory
>
> On
On Tue, Feb 9, 2010 at 12:34, Cristianno Martins
wrote:
> Hi,
>
> Thanks for the fast reply. Only one more thing: is there some way that
> I could force it to be signed??
I guess that you should wait the fixes from Tobias and Ramakrishna to
CLooG and Graphite to have the type of the IV exposed by
on was whether options like --with-cloog should cause configure
> to exit as failed when they can't be satisfied rather than proceeding?
> Does a failure to meet the required gmp/mpfr/mpc version requirements
> behave the same way or do they abort the configure process?
>
Hi,
While working on the tree-if-conv.c, I realized that the copy
of the contents of a non scalar variable are not correctly done.
The copy assignment triggers this error:
error: virtual SSA name for non-VOP decl
while verifying SSA_NAME _ifc_.2005_46 in statement
# .MEM_394 = VDEF <.MEM_475>
On Tue, Apr 13, 2010 at 13:14, Sebastian Pop wrote:
> Hi,
>
> While working on the tree-if-conv.c, I realized that the copy
> of the contents of a non scalar variable are not correctly done.
> The copy assignment triggers this error:
>
> error: virtual SSA name for non-VOP d
On Tue, Apr 13, 2010 at 14:42, Jakub Jelinek wrote:
> if (!is_gimple_reg (var))
>
> you shouldn't create SSA name and change the lhs of the stmt.
>
This worked well. Thanks Jakub!
Sebastian
Hi,
If you like maths, a short book "Scheduling and Automatic Parallelization"
by Alain Darte, Yves Robert, and Frederic Vivien, not publicized as much
as the books proposed by Vladimir, provides more formal background
than what you can find in classical compiler literature.
I would also recommen
On 4/23/07, Diego Novillo <[EMAIL PROTECTED]> wrote:
[EMAIL PROTECTED] wrote on 04/23/07 14:40:
> Any references?
Yes, at the last HiPEAC conference Grigori Fursin presented their
interactive compilation interface, which could be used for this.
http://gcc-ici.sourceforge.net/
That work is pa
Hi,
Antoine Eiche <[EMAIL PROTECTED]> wrote:
Why can I not do "foo(a + i * x)" then I can do "foo(i * x)" ou "foo(a + i)" ?*
[...]
When a try to compile a program gcc answer:
"
tab.c:22: erreur: invalid operand to binary operator
i_28 * 4;
tab.c:22: erreur interne du compilateur: verify_stm
On 6/13/07, Revital1 Eres <[EMAIL PROTECTED]> wrote:
Hello,
I have two ssa vars (i0 and i1 in the following example); what is the
sequence to generate a new phi node corresponding to i3 -
if (...)
i0 = exp1
else
i1 = exp2
i3 = PHI(i0 , i1);
From tree-vectorizer.c,
/* 1.1
On 6/18/07, Dorit Nuzman <[EMAIL PROTECTED]> wrote:
> I can hand you more than the testcases i've given so far. There is
> tons of code out there that would benefit from straight line
Interesting. I wasn't aware of this potential. Please do send some of this
code. thanks!
I'm thinking about
On 9/4/07, Mark Mitchell <[EMAIL PROTECTED]> wrote:
> We are closing in on Stage 3, previously announced for September 10th.
> At this point, I'm not aware of any reason to delay that date. Are
> there any Stage 2 patches that people don't think will be submitted by
> that point?
>
I still plan t
On 10/24/07, Diego Novillo <[EMAIL PROTECTED]> wrote:
> We are also thinking about lowering GIMPLE a bit further and delay
> the transition into RTL.
Diego, can you be more specific about what parts you think have to be
lowered more from GIMPLE?
Together with Richard Guenther, we're planing to se
Hi Tobias,
On Wed, Aug 20, 2008 at 4:45 PM, Tobias Grosser
<[EMAIL PROTECTED]> wrote:
> So even if Google Summer of Code has finished. I do not want to say
> "Goodbye", but "Hello" to you.
> I am looking forward to work with you on gcc and graphite!
>
I would like to say a big thank you for your
On Tue, Sep 2, 2008 at 6:00 AM, Jakub Jelinek <[EMAIL PROTECTED]> wrote:
> The trunk is now in stage3 phase, so only bugfixes, documentation changes
> and new ports are allowed at this point. As an exception the GRAPHITE
> branch, which has been AFAIK mostly approved already but missed the deadlin
On Tue, Sep 2, 2008 at 8:42 PM, Tobias Grosser
<[EMAIL PROTECTED]> wrote:
> It seems this code is already there, but the check for
> "check_effective_target_fgraphite" fails. I attached a patch. Now the
> graphite test cases are only executed, if graphite is available.
>
The patch looks good: the
On Wed, Sep 3, 2008 at 1:19 PM, Andrew Pinski <[EMAIL PROTECTED]> wrote:
> Maybe it is better to error out if -fgraphite is used even without
> optimization if the compiler does not have the required libraries.
>
Patch attached.
Sebastian
* toplev.c (process_options): Fail and warn when graphit
On Wed, Sep 3, 2008 at 1:24 PM, Steve Kargl
<[EMAIL PROTECTED]> wrote:
> I think that this is sensible considering that cloog is only
> available through a git repository. Requiring people to install
> git to build cloog is somewhat un-user-friendly.
I will prepare a cloog.tar.gz and will put it
ROW'09 EasyChair online submission website:
http://www.easychair.org/conferences/?conf=grow09
Organizers:
Paul H.J. Kelly, Imperial College of London, UK
Sebastian Pop, AMD, USA
Program Committee:
Albert Cohen, INRIA, France
Grigori Fursin, INRIA, France
Benedict Gaster, AMD, US
1 - 100 of 187 matches
Mail list logo
