I am configuring `libiberty', but during `libiberty'
configure on DJGPP (without a working vfork), configure
reports that I have a working vfork. This is a bug in
configure.ac.
Samuel Lauber
--
_
Web-based SMS services available at
> As originally proposed here:
> http://gcc.gnu.org/ml/gcc/2005-01/msg00031.html
>
> I propose switching the ChangeLogs to use year-based names rather than
> numeric indexes.
>
> Specifically, I propose adding these files:
>
> ChangeLog-1997: from last part of ChangeLog.0
> ChangeLog-1998:
I compiled unexec.c from Emacs 21.3 with -O2, and I got the
error from GNU as on line 1498:
Fatal error: C_EFCN symbol out of scope
I'm on the x86. This only happens if all three of the
following are satisfied
1) -gcoff debugging information is being generated
2) -funit-at-a-time is on
3)
> > I compiled unexec.c from Emacs 21.3 with -O2, and I got the error
> > from GNU as on line 1498:
> >
> > Fatal error: C_EFCN symbol out of scope
> >
> > I'm on the x86. This only happens if all three of the following
> > are satisfied
> >
> > 1) -gcoff debugging information is being generate
The gccinstall info says that `make uninstall' would open
a can of worms. I don't get it. Why?
Samuel Lauber
--
_
Web-based SMS services available at http://www.operamail.com.
From your mailbox to local or overseas cell phones.
Powere
I know that Bohem's GC is used in the Java runtime for GCC. However, the
compiler proper itself can _really_ cramp people's avalible RAM (for those who
don't belive me and have Windows w/ DJGPP, change all the memory controls
from `auto' to the highest value and just try to compile libiberty/re
Perhaps then a scheme in which the compiler
1) compresses all tree structures (this would be a good project)
2) after each pass, all internal structures are freed unless doing so would
create a dead pointer (maybe an -Om option like -Os but saves compilation
memory?)
3) dosen't use memory in
>> if gcc uses more memory than physically available it spends a
>> _very_ long time swapping
>
> Swapping, what's that? Here's $20, go buy a gigabyte.
You don't know whay swapping is? Shifting memory over from physical RAM
to the hard drive when not in use, and putting it back in RAM when in
>> if gcc uses more memory than physically available it spends a
>> _very_ long time swapping
>
> Swapping, what's that? Here's $20, go buy a gigabyte.
You don't know whay swapping is? Shifting memory over from physical RAM
to the hard drive when not in use, and putting it back in RAM when in
>> if gcc uses more memory than physically available it spends a
>> _very_ long time swapping
>
> Swapping, what's that? Here's $20, go buy a gigabyte.
You don't know whay swapping is? Shifting memory over from physical RAM
to the hard drive when not in use, and putting it back in RAM when in
Would it be possible to have a -fpack-bools option that packs booleans into
the smallest form possible (8 booleans -> 1 8-bit reg, etc.) into a register
(or memory, as the case may be)?
Samuel Lauber
--
___
Surf the Web in a faster, safer and easier way
> Unless you are using an architecture with btst, bset, bclr instructions.
Pretty much any architechure that could be called a binary computer has
something like that ;-)
Samuel Lauber
--
___
Surf the Web in a faster, safer and easier way:
Download Ope
> If this were being done at the level of register allocation, why would
> one need a user visible option? 'Just' rearrange the register file to look
> like a set of single bit registers overlaid on a more conventional register
> file.
As someone pointed out, this might change semantics (read: scr
I am experimenting with the FORTH langauge, and I would like a front-end to
be added to GCC. I think I can get most of the parts down, but how can I
generate a tree that can be used in the code-generator?
Samuel Lauber
--
___
Surf the Web in a faster,
> There are a few diffciulties here, particularly with addressing the
> open stack in an efficient way.
>
> This problem is probably going to get a little off-topic for this
> group, and it may be better to discuss this on comp.lang.forth.
I wasn't asking about the langauge implementation. What I
The GCC manual says that
``Eventually there may be a way of asking the compiler to choose a register
automatacally...''
Would it be possible to implement it? My idea is: add a builtin function
__builtin_choose_register(HINTS)
with the property
a) it is special in that the return value is `
The GCC manual says that
``Eventually there may be a way of asking the compiler to choose a register
automatacally...''
Would it be possible to implement it? My idea is: add a builtin function
__builtin_choose_register(HINTS)
with the property
a) it is special in that the return value is `
> > The documentation for -fvisibility=hidden suggets that this switch is
> > useful for shared libraries, to make things smaller and faster. It
> > doesn't seem to be appropriate for object libraries.
> It's done *exactly* so that we catch this bug in your configury.
I don't know about you, but
There has been a lot of work recently on making GCC output faster code. But
GCC isn't very fast. On my slow 750MHz Linux box (which the PIII in it is now
R.I.P), it took a whole night to compile 3.4.3. On my fast iBook G4 laptop,
to compile just one source file in Perl made me wait long enough f
> Hello,
>
> I have a question about a valid C code. I am trying to compile
> the following code in MacOSX (*). I don't understand what the
> problem is ? Could someone please explain me what is going on ?
> Since I declare the variable with extern I should not need to pass
> -fno-common,
> Hello,
>
> I have a question about a valid C code. I am trying to compile
> the following code in MacOSX (*). I don't understand what the
> problem is ? Could someone please explain me what is going on ?
> Since I declare the variable with extern I should not need to pass
> -fno-common,
> int bar [ 4 * 256 ] = { 0,1,2, ... };
>
> I did not changed nor any compiler option, neither any
> declaration. I still cannot see the difference in between those
> two, since the declaration is exactly the same. The only difference
> being a default initialization.
There is a more subtl
> >> Intel already handed icc + performace libs to apple, but from my
> >> experience icc doesn't create any faster code then gcc. Is there
> >> any *recent* benchmark that shows otherwise?
>
> Define "recent".
>
> >> I know that heavy math code is likely to perform better on icc but
> >> this i
> > I'd put this more simply...
> >
> > On Monday, June 6, 2005, at 02:06 PM, Mathieu Malaterre wrote:
> >>I have a question about a valid C code. I am trying to
> >> compile the following code in MacOSX (*). I don't understand
> >> what the problem is?
> >
> > You must use -fno-common when
> Sigh. #2 doesn't work as the compiler can synthesize common
> variables that you can't control, and when it does this, things
> won't work. Forcing people to use -single_module strikes me as
> wrong.
I don't know why it was set up like that. Come to think of it, this would
probably be a rea
> I have this x86-64 ABI testsuite I worked on lately again (after some
> years lingering around, it was first written when we did the port on
> simulators still). It currently lies on cvs.x86-64.org in the 'abitest'
> module, for the curious (it has anoncvs too).
> I would like to somehow integra
> > > Agreed. But keep in mind that it is not necessary to reply: once the
bug is
> > > open and confirmed, the last comment "wins", in a way. If the
bugmaster
> > > wanted to close it, he would just do it, so an objection in a comment
does
> > > not make the bug invalid per se.
> >
> > But an o
Would it be possible for the GCC webpage to have a RSS feed for the news?
Samuel Lauber
--
___
Surf the Web in a faster, safer and easier way:
Download Opera 8 at http://www.opera.com
I think Intel's confusing numbering system has confused
you. All ix86 processors, if the expression
x in first ix86 < x in second ix86
holds true, then second ix86 is compatible. The i586 is
NOT the Pentium. Nor is the i686. But the i686 was one of
the first Intel processors with built-in F
__Way__ to close to the LGPL. The LGPL in effect, says the
GPL with that kind exception (letting people link this
with there program regardless of whether the license is
GPL-compatible). I think that those exceptions in
`libgcc' are conflicting with one of the sections of the
GPL that preven
This is _not_ a bug. This is _C_, not C++. ISO C99
requires a diagnostic for it. I think what's going on is
that the compiler is warning about a return with a value
in function returning void in foo(), but baz() is trying
to return a value from a function that never returned
anything. This
> Hello
>
> I ponder about writing a "i386 16bit realmode" gcc backend as my master
> thesis - which would be usefull for generating 16-bit bios code needed
> by the virtual machine developed at my university.
>
> Having never programmed any compiler-related stuff and having a strict
> deadline
> Regressions that cause ICE's on invalid code often go unnoticed in the
> testsuite, since regular errors and ICE's both match { dg-error "" }.
> See for example g++.dg/parse/error16.C which ICE's since yesterday,
> but the testsuite still reports "PASS":
>
>Executing on host:
> /Work/reich
I am thinking of including a front-end for INTERCAL for
GCC. INTERCAL is an estoric programming langauge that was
created in 1972 with the goal of having nothing in common
with other langauges (see http://catb.org/~esr/intercal).
There is a C implementation of INTERCAL (called C-INTERCAL)
th
> > I am thinking of including a front-end for INTERCAL for GCC. INTERCAL
> > is an estoric programming langauge that was created in 1972 with the
> > goal of having nothing in common with other langauges (see
> > http://catb.org/~esr/intercal). There is a C implementation of
> > INTERCAL (calle
> > (2) -> Some of us would like DO .1 <- #0
> >
> > to be translated into movl $0, v1
v1 is the name of a variable. Needed because the manual
says that each variable namespace (meshes, spots, tails,
what-have-yous, hybrids) has 65535 variables!!! I don't
know of any machine that has 65535+655
36 matches
Mail list logo