Snapshot gcc-4.9-20140611 is now available on
ftp://gcc.gnu.org/pub/gcc/snapshots/4.9-20140611/
and on various mirrors, see http://gcc.gnu.org/mirrors.html for details.
This snapshot has been generated from the GCC 4.9 SVN branch
with the following options: svn://gcc.gnu.org/svn/gcc/branches
On 6/11/14, Prathamesh Kulkarni wrote:
> On 6/11/14, Richard Biener wrote:
>> On Wed, Jun 11, 2014 at 12:53 PM, Richard Biener
>> wrote:
>>> On Wed, Jun 11, 2014 at 10:51 AM, Richard Biener
>>> wrote:
On Tue, Jun 10, 2014 at 1:57 PM, Richard Biener
wrote:
> On Tue, Jun 10, 2014 a
On 6/11/14, Richard Biener wrote:
> On Wed, Jun 11, 2014 at 12:53 PM, Richard Biener
> wrote:
>> On Wed, Jun 11, 2014 at 10:51 AM, Richard Biener
>> wrote:
>>> On Tue, Jun 10, 2014 at 1:57 PM, Richard Biener
>>> wrote:
On Tue, Jun 10, 2014 at 1:06 PM, Prathamesh Kulkarni
wrote:
>
On Wed, Jun 11, 2014 at 12:53 PM, Richard Biener
wrote:
> On Wed, Jun 11, 2014 at 10:51 AM, Richard Biener
> wrote:
>> On Tue, Jun 10, 2014 at 1:57 PM, Richard Biener
>> wrote:
>>> On Tue, Jun 10, 2014 at 1:06 PM, Prathamesh Kulkarni
>>> wrote:
On Fri, Jun 6, 2014 at 7:18 PM, Richard Biene
It gives me great pleasure to announce that GCC has won the
ACM SIGPLAN Programming Languages Software Award
Congratulations to the entire GCC Community!
- David
Hi,
I have more info concerning my gnat_malloc problem.
I watched the code in gcc/ada/gcc-interface/trans.c and found the location
where malloc_decl tree is built.
In gigi ()function (trans.c:411), the ftype for malloc_decl is done this way :
ftype = build_function_type_list (ptr_void_type_no
On 06/10/2014 06:20 PM, Hebenstreit, Michael wrote:
Either something is broken on my web-access or the links on
https://gcc.gnu.org/install/prerequisites.html pointing to
ftp://gcc.gnu.org/pub/gcc/infrastructure/ are gone - can't find the files
anywhere else :(
Thanks for all your efforts
Mic
On Wed, Jun 11, 2014 at 10:51 AM, Richard Biener
wrote:
> On Tue, Jun 10, 2014 at 1:57 PM, Richard Biener
> wrote:
>> On Tue, Jun 10, 2014 at 1:06 PM, Prathamesh Kulkarni
>> wrote:
>>> On Fri, Jun 6, 2014 at 7:18 PM, Richard Biener
>>> wrote:
On Fri, Jun 6, 2014 at 12:02 PM, Richard Biener
On Wed, Jun 11, 2014 at 10:27 AM, Thomas Preud'homme
wrote:
>> From: Richard Biener [mailto:richard.guent...@gmail.com]
>> Sent: Wednesday, June 11, 2014 4:09 PM
>
>> >
>> > Oh I see. Doing it there would mean instead of two independent
>> > operations you'd do the best combination possible, is th
On Tue, Jun 10, 2014 at 1:57 PM, Richard Biener
wrote:
> On Tue, Jun 10, 2014 at 1:06 PM, Prathamesh Kulkarni
> wrote:
>> On Fri, Jun 6, 2014 at 7:18 PM, Richard Biener
>> wrote:
>>> On Fri, Jun 6, 2014 at 12:02 PM, Richard Biener
>>> wrote:
On Fri, Jun 6, 2014 at 11:02 AM, Prathamesh Kulk
> From: Richard Biener [mailto:richard.guent...@gmail.com]
> Sent: Wednesday, June 11, 2014 4:09 PM
> >
> > Oh I see. Doing it there would mean instead of two independent
> > operations you'd do the best combination possible, is that right?
>
> Yes (but probably it's not worth the trouble).
I un
On Wed, Jun 11, 2014 at 7:45 AM, Thomas Preud'homme
wrote:
>> From: Richard Biener [mailto:richard.guent...@gmail.com]
>> Sent: Tuesday, June 10, 2014 5:16 PM
>>
>
>> In general this is impossible to do. I don't have a good answer on
>> how to determine whether (unaligned) load + bswap is faster
12 matches
Mail list logo