On 14 April 2010 23:34, Basile Starynkevitch wrote:
>
> And my personal preference on GCC licensing would be more a Linux-kernel
> like GPL with copyright belonging to authors employee (I don't feel a SCO
> like issue as a major threat today; it might have been ten years ago). That
> is much easie
Quoting Gerald Pfeifer :
This has been forwarded to the steering committee (thanks, David)
and the FSF and we are pushing to get it addressed.
What is the current status on this?
As we go into phase 1 of gcc 4.6, we are likely to fall back on
code/documentation consistency unless/until we hav
I would like to give my opinion as a volunteer contributor on several
of the points you raised.
On 14 April 2010 16:23, Grigori Fursin wrote:
>
> * Need to encourage cleanup/infrastructure work on GCC and provide
> stable/flexible/extensible APIs (the question is how to encourage such
> infrastru
Hello There,
I was trying to get the code from svn : svn checkout
svn://gcc.gnu.org/svn/gcc/trunk SomeLocalDir
Since *svn* protocol doesn't work for me, I am trying to use 'http' instead..on
the gcc web it says:
"""
if you are behind a firewall that does not allow the svn protocol through, yo
On 15 April 2010 10:04, Singh, Neeraj K wrote:
>
> But, I don't have the value for http-proxy-host and http-proxy-port-any clue
> what this should be?
The web proxy at your site. If you don't have a web proxy, don't use
them. If you do have a web proxy, you can probably find the details in
your b
The calculate branch probabilities algorithm (1) in the Wu Larus paper
also evenly distributes branch probabilities when number of outgoing
edges is > 2, e.g. switch cases implemented as jump tables.
Are they any known heuristics to generate better branch probabilities
in this case?
-Origina
On Thu, Apr 15, 2010 at 1:11 PM, Rahul Kharche wrote:
> The calculate branch probabilities algorithm (1) in the Wu Larus paper
> also evenly distributes branch probabilities when number of outgoing
> edges is > 2, e.g. switch cases implemented as jump tables.
>
> Are they any known heuristics to g
On Thu, Apr 15, 2010 at 10:26:16AM +0200, Manuel López-Ibáñez wrote:
> On 14 April 2010 23:34, Basile Starynkevitch wrote:
> >
> > And my personal preference on GCC licensing would be more a Linux-kernel
> > like GPL with copyright belonging to authors employee (I don't feel a SCO
> > like issue a
On 04/15/2010 12:57 PM, Basile Starynkevitch wrote:
>
> Of course I do know about gcj. But I never met any person using it,
> and I don't know about any person or project really using it (as an
> example, I am not sure than any Debian or Fedora package is compiled
> with gcj into a native executab
On Thu, Apr 15, 2010 at 2:03 PM, Andrew Haley wrote:
> On 04/15/2010 12:57 PM, Basile Starynkevitch wrote:
>>
>> Of course I do know about gcj. But I never met any person using it,
>> and I don't know about any person or project really using it (as an
>> example, I am not sure than any Debian or F
On 04/15/2010 01:07 PM, Steven Bosscher wrote:
> On Thu, Apr 15, 2010 at 2:03 PM, Andrew Haley wrote:
>> On 04/15/2010 12:57 PM, Basile Starynkevitch wrote:
>>>
>>> Of course I do know about gcj. But I never met any person using it,
>>> and I don't know about any person or project really using it
Hello,
I'd like first to thank you for the upcoming 4.5 release. I'm really
looking forward to updating.
I'm also interested in the DragonEgg project
(http://dragonegg.llvm.org/) that aims to use llvm as a GCC backed.
DragonEgg in its actual state needs a patch applied to GCC in order to
f
On Thu, Apr 15, 2010 at 2:17 PM, Amine Khaldi wrote:
> Hello,
>
> I'd like first to thank you for the upcoming 4.5 release. I'm really looking
> forward to updating.
>
> I'm also interested in the DragonEgg project (http://dragonegg.llvm.org/)
> that aims to use llvm as a GCC backed.
>
> DragonEgg
>>What is the problem you're trying to solve?
Generally speaking I was looking for a better logic based on estimated
branch probability to decide between using binary search tree and jump
table implementation of a switch case.
One interesting test case is where the gross structure of a function
i
The other case I'm working on is to selectively apply tailcall
optimization when optimizing for size. Clearly tail call optimiztion
is desirable along frequently executed edges. Otherwise we found
tailcall optimization generates a sicall_epilogue for each tailcall
which has a significant impact on
Hi all,
I have applied a proposal "EFI extension of Binutils" at GNU of GSoC.
According
to comment of GNU's mentor, there is no mentor in GNU interesting in it and
suggest me to post the application at GCC mailing list.
If someone interested in it, could you offer some comment on it or
ev
> On Thu, Apr 15, 2010 at 1:11 PM, Rahul Kharche wrote:
> > The calculate branch probabilities algorithm (1) in the Wu Larus paper
> > also evenly distributes branch probabilities when number of outgoing
> > edges is > 2, e.g. switch cases implemented as jump tables.
> >
> > Are they any known heu
Snapshot gcc-4.5-20100415 is now available on
ftp://gcc.gnu.org/pub/gcc/snapshots/4.5-20100415/
and on various mirrors, see http://gcc.gnu.org/mirrors.html for details.
This snapshot has been generated from the GCC 4.5 SVN branch
with the following options: svn://gcc.gnu.org/svn/gcc/branches
On Linux/x86-64, "make check" gave me
make[6]: *** No rule to make target `check-lto', needed by `check'.
Where does it come from?
--
H.J.
19 matches
Mail list logo
