On Sun, Mar 8, 2015 at 8:49 PM, Jeff Law wrote:
> On 03/08/15 12:13, Richard Biener wrote:
>>
>>
>> I see. This basically creates two loop latches and thus will make our
>> loop detection code turn the loop into a fake loop nest. Not sure if that
>> is a good idea.
>
> I'd have to sit down and p
The list of mirror sites seems to have a bug:
https://gcc.gnu.org/mirrors.html
The mirror for Australia is listed as:
http://mirrors-au.go-parts.com/gcc | ..., thanks to Dan Derebenskiy
(dderebens...@go-parts.com) at Go-Parts.
Going to the above site leads to a car parts seller.
How did this get
On 9 March 2015 at 13:04, Conrad S wrote:
> The list of mirror sites seems to have a bug:
> https://gcc.gnu.org/mirrors.html
>
> The mirror for Australia is listed as:
> http://mirrors-au.go-parts.com/gcc | ..., thanks to Dan Derebenskiy
> (dderebens...@go-parts.com) at Go-Parts.
>
> Going to the a
On 9 March 2015 at 23:08, Jonathan Wakely wrote:
>> How did this get into the mirror list?
>
> Because they said they would provide mirrors:
> https://gcc.gnu.org/ml/gcc/2014-06/msg00251.html
> https://gcc.gnu.org/ml/gcc/2014-07/msg00156.html
Upon closer inspection there's actually more junk in t
Conrad S writes:
> On 9 March 2015 at 23:08, Jonathan Wakely wrote:
> >> How did this get into the mirror list?
> >
> > Because they said they would provide mirrors:
> > https://gcc.gnu.org/ml/gcc/2014-06/msg00251.html
> > https://gcc.gnu.org/ml/gcc/2014-07/msg00156.html
>
> Upon closer inspecti
On 9 March 2015 at 13:12, Conrad S wrote:
> Upon closer inspection there's actually more junk in the mirror list site:
>
> Australia: http://mirrors-au.go-parts.com/gcc
> Russia: http://mirrors-ru.go-parts.com/gcc
> UK: http://mirrors-uk.go-parts.com/gcc/
> US: http://mirrors-usa.go-parts.com/gcc
>
On 9 March 2015 at 23:31, Jonathan Wakely wrote:
> They do get checked before being added. Did you check them before
> declaring them junk? :-)
Apologies. I incorrectly assumed that any mention of the "go-parts"
domain was link spam, based on the Australian mirror being broken.
On 03/09/15 05:40, Richard Biener wrote:
On Sun, Mar 8, 2015 at 8:49 PM, Jeff Law wrote:
On 03/08/15 12:13, Richard Biener wrote:
I see. This basically creates two loop latches and thus will make our
loop detection code turn the loop into a fake loop nest. Not sure if that
is a good idea.
w.r.t, https://gcc.gnu.org/wiki/Speedup_areas where we want to improve the
performance of splay trees.
The function `splay_tree_node splay_tree_lookup (splay_tree, splay_tree_key);'
updates the nodes every time a lookup is done.
IIUC, There are places where we call this function in a loop i.e.,
I was wondering whether GCC uses 6.5.16.1p3 of the C11 standard as a
license to perform certain optimizations. If so, could anyone provide me
an example program.
In particular, I am interested about the "then the overlap shall be
exact" part of 6.5.16.1p3:
If the value being stored in an o
On Mon, Mar 09, 2015 at 06:59:10PM +, vax mzn wrote:
> w.r.t, https://gcc.gnu.org/wiki/Speedup_areas where we want to improve the
> performance of splay trees.
>
> The function `splay_tree_node splay_tree_lookup (splay_tree, splay_tree_key);'
> updates the nodes every time a lookup is done.
>
> Date: Mon, 9 Mar 2015 15:26:26 -0400
> From: tbsau...@tbsaunde.org
> To: gcc@gcc.gnu.org
> Subject: Re: Proposal for adding splay_tree_find (to find elements without
> updating the nodes).
>
> On Mon, Mar 09, 2015 at 06:59:10PM +, vax mzn wrote:
>>
On Mon, Mar 9, 2015 at 7:59 PM, vax mzn wrote:
> w.r.t, https://gcc.gnu.org/wiki/Speedup_areas where we want to improve the
> performance of splay trees.
>
> The function `splay_tree_node splay_tree_lookup (splay_tree, splay_tree_key);'
> updates the nodes every time a lookup is done.
>
> IIUC, Th
Hi I'm doing an investigation trying to modify the generation of
prologues and epilogues for ARM cross compiler.
So far I could successfully add some lines to the prologue generation,
but Im having problems with some thing: How do you suggest is the best
way to emit an assembler line that makes a b
-Original Message-
From: Jeff Law [mailto:l...@redhat.com]
Sent: Monday, March 09, 2015 11:01 PM
To: Richard Biener
Cc: Ajit Kumar Agarwal; vmaka...@redhat.com; gcc@gcc.gnu.org; Vinod Kathail;
Shail Aditya Gupta; Vidhumouli Hunsigida; Nagaraju Mekala
Subject: Re: Proposal for path split
On 03/09/15 17:42, Marcos Díaz wrote:
Hi I'm doing an investigation trying to modify the generation of
prologues and epilogues for ARM cross compiler.
So far I could successfully add some lines to the prologue generation,
but Im having problems with some thing: How do you suggest is the best
way
On 2015-03-09 8:10 PM, Ajit Kumar Agarwal wrote:
-Original Message-
From: Jeff Law [mailto:l...@redhat.com]
Sent: Monday, March 09, 2015 11:01 PM
To: Richard Biener
Cc: Ajit Kumar Agarwal; vmaka...@redhat.com; gcc@gcc.gnu.org; Vinod Kathail;
Shail Aditya Gupta; Vidhumouli Hunsigida; N
> From: stevenb@gmail.com
> Date: Mon, 9 Mar 2015 23:59:52 +0100
> Subject: Re: Proposal for adding splay_tree_find (to find elements without
> updating the nodes).
> To: hiradi...@msn.com
> CC: gcc@gcc.gnu.org
>
> On Mon, Mar 9, 2015 at 7:59 PM, vax
==
GNU Tools Cauldron 2015
http://gcc.gnu.org/wiki/cauldron2015
Call for Abstracts and Participation
August 7 to 9,
Prague, Czech Republic
19 matches
Mail list logo
