untarring gcc-g++-3.4.4.tar.gz / bz2
Hi All, Don't know if you can help, but every time I untar the gcc-g++-3.4.4.tar package (after bunzipping or gunzipping it) I get the following error: x gcc-3.4.4 /libstdc++-v3/testsuite/27_io/basic_istream/extractors_arithmetic/char/11.cc, 2022 bytes, 4 tape blocks x gcc-3.4.4 /libstdc++-v3/testsuite/27_io/basic_istream/extractors_arithmetic/char/12.cc, 2756 bytes, 6 tape blocks x gcc-3.4.4 /libstdc++-v3/testsuite/27_io/basic_istream/extractors_arithmetic/char/13.cc, 2316 bytes, 5 tape blocks tar: directory checksum error I get this error if I use the individual package (gcc-g++-3.4.4.tar) or the entire package (gcc-3.4.4.tar.gz). It's always at the same point, and also occurs regardless of the compression (bz2 or gzip) I am downloading from the ftp mirror, mirror.ac.uk, and the md5 checksum on the packages matches. I'm using Solaris 9 (SunOS5.9) on an ultrasparc. Is the package actually broken? or am I doing something wrong? Cheers, Mike == Michael Hobbs ANM Technical Ext. 8965 == Associated New Media & Loot Ltd. http://www.loot.com http://www.anm.co.uk http://www.dailymail.co.uk http://www.mailonsunday.co.uk http://www.thisislondon.co.uk http://www.thisismoney.com http://www.thisistravel.co.uk http://www.homesandproperty.co.uk http://www.jobsite.co.uk http://www.londonjobs.co.uk http://www.cityjobs.co.uk http://www.ukplus.co.uk http://www.metro.co.uk Part of Associated Newspapers Ltd. This e-mail and any attached files are intended for the named addressee only. It contains information which may be confidential and legally privileged and also protected by copyright. Unless you are the named addressee (or authorised to receive for the addressee) you may not copy or use it, or disclose it to anyone else. If you received it in error please notify the sender immediately and then delete it from your system. Please be advised that the views and opinions expressed in this e-mail may not reflect the views and opinions of Associated Newspapers Limited or any of its subsidiary companies. We make every effort to keep our network free from viruses. However, you do need to check this e-mail and any attachments to it for viruses as we can take no responsibility for any computer virus which may be transferred by way of this e-mail. Use of this or any other e-mail facility signifies consent to any interception we might lawfully carry out to prevent abuse of these facilities.
Re: untarring gcc-g++-3.4.4.tar.gz / bz2
Sorry for bothering you all, this is sorted - My version of tar was too old. :o) Thanks! Mike == Hi All, Don't know if you can help, but every time I untar the gcc-g++-3.4.4.tar package (after bunzipping or gunzipping it) I get the following error: x gcc-3.4.4 /libstdc++-v3/testsuite/27_io/basic_istream/extractors_arithmetic/char/11.cc, 2022 bytes, 4 tape blocks x gcc-3.4.4 /libstdc++-v3/testsuite/27_io/basic_istream/extractors_arithmetic/char/12.cc, 2756 bytes, 6 tape blocks x gcc-3.4.4 /libstdc++-v3/testsuite/27_io/basic_istream/extractors_arithmetic/char/13.cc, 2316 bytes, 5 tape blocks tar: directory checksum error I get this error if I use the individual package (gcc-g++-3.4.4.tar) or the entire package (gcc-3.4.4.tar.gz). It's always at the same point, and also occurs regardless of the compression (bz2 or gzip) I am downloading from the ftp mirror, mirror.ac.uk, and the md5 checksum on the packages matches. I'm using Solaris 9 (SunOS5.9) on an ultrasparc. Is the package actually broken? or am I doing something wrong? Cheers, Mike == Michael Hobbs ANM Technical Ext. 8965 == Associated New Media & Loot Ltd. http://www.loot.com http://www.anm.co.uk http://www.dailymail.co.uk http://www.mailonsunday.co.uk http://www.thisislondon.co.uk http://www.thisismoney.com http://www.thisistravel.co.uk http://www.homesandproperty.co.uk http://www.jobsite.co.uk http://www.londonjobs.co.uk http://www.cityjobs.co.uk http://www.ukplus.co.uk http://www.metro.co.uk Part of Associated Newspapers Ltd. This e-mail and any attached files are intended for the named addressee only. It contains information which may be confidential and legally privileged and also protected by copyright. Unless you are the named addressee (or authorised to receive for the addressee) you may not copy or use it, or disclose it to anyone else. If you received it in error please notify the sender immediately and then delete it from your system. Please be advised that the views and opinions expressed in this e-mail may not reflect the views and opinions of Associated Newspapers Limited or any of its subsidiary companies. We make every effort to keep our network free from viruses. However, you do need to check this e-mail and any attachments to it for viruses as we can take no responsibility for any computer virus which may be transferred by way of this e-mail. Use of this or any other e-mail facility signifies consent to any interception we might lawfully carry out to prevent abuse of these facilities.
RE: How can I build gcc on my Windows PC?
Original Message >From: Björn Haase >Sent: 07 August 2005 08:41 > David Nowak wrote >> Do I need a c compiler to build gcc on my Windows PC? If so, where >> can I get one? I downloaded both MinGW and Cygwin, but neither seems >> to have a c compiler. Please help me. Thank you. > > Cygwin *includes* working gcc binaries. Probably you simply missed to > choose the right checkboxes during installation. Very likely. David, the compiler isn't included by default; you need to expand the 'Devel' category and select gcc (and any optional languages you want) when you're running the cygwin setup. > BTW: Maybe your question is probably better posted on the gcc-help list. To elaborate, questions about getting your cygwin installation up-and-running would be most welcome on the main cygwin list (see http://cygwin.com/lists.html); more general questions to do with programming and the compiler itself will get the best responses from the gcc-help list. cheers, DaveK -- Can't think of a witty .sigline today
[GCC 4.2 Project] Omega data dependence test
Hi, first, this is a real project proposal for GCC 4.2, not a joke, although I have to confess that I have had fun to "filer la metaphore" from http://gcc.gnu.org/wiki/Sample%20Project%20Page You can find the same proposal at http://gcc.gnu.org/wiki/Omega%20data%20dependence%20test Have fun, Sebastian Omega data dependence test We propose a Practical Oracle Program (POP) for exactly solving Integer Linear Programs (ILP): an adaptation of Bill Pugh's Omega solver (BOP) that is experimentally known to be fast for small problems, but is also known to be exponential in general. Another choice of POP that will probably be submitted for a future release is Paul Feautrier's Parametric Integer Programming (PIP), that is known to have a good behavior for larger problems, but still is an exponential Oracle. In general, we like POPs to be expressive enough for being able to solve a broad range of problems: it is this exponential worst case fear that gives POPs their mystic traits, but we will try to "demystify the mystified". In this first step, we're proposing a formulation of the data dependence tests as queries to BOP, and a flag that tests the validity of the current Banerjee Analyzer for Data-dependences (BAD) against the predictions of BOP. The regression flag is not enabled by default, such that the POP will never be executed for normal uses of the compiler. Personnel * Sebastian Pop * Daniel Berlin Delivery Date This project will be ready for the first stage of GCC-4.2. Benefits * Bug masters will have a tool for checking the correctness of the dependence analysis. * The flag will allow users to report bugs in the implementations of these two solvers. Dependencies None for the moment. Modifications Required Adding some new files, a flag, and some code in tree-data-ref.c that formulates the data dependence problem as a constraint system in a format that BOP understands. More fun (take a seat, laugh a bit) The rest is just science fiction, so if you're the Release Manager (RM) of GCC, you can skip all the rest, unless you want to have more fun on the [Oracular Optimizations|Sample Project Page], and see a practical implementation of a meta-POP. So what happens next? Based on queries to a POP, we will be able to propose several flags to test the regressions of our heuristics with respect to optimal behavior: the current analyzers and optimization decisions will be compared to the results of the exactly solved problem as predicted by the POP. This kind of costly regression flags will be used by Super Enthusiasts of Betacompilers (SEB) such as the gentoo-ers, BSD-ers, or system embedd-ers, that have nothing else to do than recompiling the world, whatever the price, whatever the time they have to spend, in the hope that they'll obtain a faster code. In a further future, when GCC will finally have a proper intermediate representation that can be stored to disk and then loaded back to memory, we will transform the SEB into GCC contributors. The plan is to propose the integration of a delta debugger (DD) into GCC such that the regression flags will directly output a reduced pattern that will show the regression. A pattern-zilla will collect the optimal solution and a testcase that show the weakness of a heuristic function. SEB will act at a first meta-level as a POP for the code of the compiler itself. And for ending the induction, I'll let your imagination to come up with ideas of how to implement the next meta-level. I have to acknowledge that Kenneth Zadeck has pushed me into all this, and thus the first step of the induction was initiated by Kenny.
Question about std templates
hello to all anyone know if is possible to add a member to a template of standard library? for example I wish to add a member: int reference_system; to standard template valarray thank you Stefano
Re: Question about std templates
stefano luceri wrote: hello to all anyone know if is possible to add a member to a template of standard library? you'd have to modify the library source files, and then you'd end up with a non-standard library nathan -- Nathan Sidwell:: http://www.codesourcery.com :: CodeSourcery LLC [EMAIL PROTECTED]:: http://www.planetfall.pwp.blueyonder.co.uk
re: [GCC 4.2 Project] Omega data dependence test
Sebastian Pop wrote: > [http://gcc.gnu.org/wiki/Omega%20data%20dependence%20test] > ... I can't understand a word of the proposal. Mabe you were trying to be funny, but it ended up being obscure. If the average gcc developer can understand it, then it doesn't matter that I can't, but I have a feeling others might find it hard to read, too. But this part caught my eye: In a further future, when GCC will finally have a proper intermediate representation that can be stored to disk and then loaded back to memory, we will transform the SEB into GCC contributors. The plan is to propose the integration of a delta debugger (DD) into GCC such that the regression flags will directly output a reduced pattern that will show the regression. A pattern-zilla will collect the optimal solution and a testcase that show the weakness of a heuristic function. Since I started playing with delta debugging for tracking down ICEs, I've been thinking it might be nice to have an option to gcc to perform delta debugging automatically if an ICE occurs, and have it automatically submit the minimized testcase. Sounds like you're talking about something similar, but not for ICEs. I wish I understood your proposal better. - Dan -- Trying to get a job as a c++ developer? See http://kegel.com/academy/getting-hired.html
re: [GCC 4.2 Project] Omega data dependence test
On Mon, 2005-08-08 at 08:40 -0700, Dan Kegel wrote: > Sebastian Pop wrote: > > Since I started playing with delta debugging for > tracking down ICEs, I've been thinking it might > be nice to have an option to gcc to perform > delta debugging automatically if an ICE occurs, > and have it automatically submit the minimized > testcase. Sounds like you're talking about something > similar, but not for ICEs. I wish I understood your > proposal better. If we wrote our IR in a sane form, we could do delta debugging in a sane way, instead of line-wise. IE remove entire basic blocks at a time, etc. > - Dan >
RE: [GCC 4.2 Project] Omega data dependence test
Original Message >From: Dan Kegel >Sent: 08 August 2005 16:41 > Sebastian Pop wrote: > > [http://gcc.gnu.org/wiki/Omega%20data%20dependence%20test] > > ... > I can't understand a word of the proposal. Well, I'll pitch in, because I also wasn't sure at first whether it was for real and what it was about, but I think I know now. Did you google "bill pugh omega solver" and do some background reading? It didn't take me too long to get the basic gist of what they're proposing (or at any rate, to _think_ I had got it!). IIUIC, they want to use a linear-algorithm solver to verify the data-dependence analyses performed by the Bannerjee analyzer by recomputing the results from an alternative formulation so as to have a 'second opinion' to compare the output of gcc's current analyses against.[*] > Mabe you were trying to be funny, but it ended up being obscure. Although the last paragraph was purely tongue-in-cheek humour, the rest looks genuine. But by the time it gets to the bit about SEB and POP, I think it's just referring to Seb Pop! > If the average gcc developer can understand it, then > it doesn't matter that I can't, but I have a feeling > others might find it hard to read, too. The more esoteric fields of compiler design just _are_ incredibly dense, theoretical, and hard-to-comprehend without spending a few years at university studying them. Unfortunately, that's just the way it is. cheers, DaveK [*] - To a first approximation. ;) -- Can't think of a witty .sigline today
Re: GCC 4.0.1 - iostream: No such file or dir....
Mike Stump wrote: Sorry about this. What criteria is there for posting to gcc vs gcc-help? If you want to contribute to the source code of gcc, the compiler, then those contributions go to gcc. If one is using gcc, those issues go to gcc-help. Ok Thank you Chris
Re: [patch] Fix i386-mingw32 build failure
On Sat, Aug 06, 2005 at 01:37:44PM +0200, FX Coudert wrote: >PING ** 2 > >Attached patch fixes PR bootstrap/22259 (right now, a simple ./configure >&& make build fails on i386-mingw32). It creates a special case for >in-tree as, collect-ld and nm scripts: since mingw32 cannot spawn shell >scripts, it copies $(ORIGINAL_AS_FOR_TARGET), $(ORIGINAL_LD_FOR_TARGET) >and $(ORIGINAL_NM_FOR_TARGET) in the tree. > >There has been discussion on whether this is the best way to do things >(see thread from >http://gcc.gnu.org/ml/gcc-patches/2005-07/msg01193.html), but nobody >suggested another patch that actually makes build possible on >i386-mingw32. And, from what I have understood, none of the mingw >maintainers have anything against the patch, but they can't approve it. > >Can someone with approval privilege over the build system look at this, >and OK it? (it's a very simple patch) Did you read all of the discussion about this the last time this came up? The consensus seemed to be that this was not the way to fix the problem. I suggested that modifying pex-* functions to understand #! scripts might be the best way to deal with this. I will do this eventually, but if you want to take a crack at it, please feel free. cgf
Re: [GCC 4.2 Project] Omega data dependence test
Dan Kegel wrote: > Sebastian Pop wrote: > > [http://gcc.gnu.org/wiki/Omega%20data%20dependence%20test] > > ... > I can't understand a word of the proposal. > Mabe you were trying to be funny, but it ended up being obscure. I'm sorry. This was not my intent. > If the average gcc developer can understand it, then > it doesn't matter that I can't, but I have a feeling > others might find it hard to read, too. > I'll try to explain again the goal of the project in a shorter version. I have implemented a data dependence analysis, and I want to validate the results that it produces. For this, I'm proposing to compute the same information using another algorithm, and finally do a diff. The second implementation of the data dependence analysis is using the Omega solver. However, this solver is known to be exponential on some cases (not all the cases, and in practice when used for basic data dependence problems it is fast). So the only option we have is to not expose this solver to our users, but use it for debugging and improving the compiler. This was also the purpose of the long term "plans": we can use this kind of expensive yet exact analyzers to detect deficiencies in the compiler, and report bugs. > But this part caught my eye: > > > In a further future, when GCC will finally have a proper > > intermediate representation that can be stored to disk and then > > loaded back to memory, we will transform the SEB into GCC > > contributors. The plan is to propose the integration of a delta > > debugger (DD) into GCC such that the regression flags will directly > > output a reduced pattern that will show the regression. A > > pattern-zilla will collect the optimal solution and a testcase that > > show the weakness of a heuristic function. > > Since I started playing with delta debugging for > tracking down ICEs, I've been thinking it might > be nice to have an option to gcc to perform > delta debugging automatically if an ICE occurs, > and have it automatically submit the minimized > testcase. Exactly. For example, it will be possible to replace the fancy_abort with a DD. Another thing that users of the compiler want is an automatic variable renaming, such that the testcase that they provide does not reveal parts of their projects. All these can be integrated in GCC once we have this intermediate representation dump to disk. > Sounds like you're talking about something > similar, but not for ICEs. I wish I understood your > proposal better. As Daniel Berlin has pointed out, a smarter DD can be implemented directly in the compiler. What is guiding the current DDs is a fail to a test: the ICE. The same thing can be implemented in the compiler, and you can have as an objective to minimize the size of the representation while still preserving a feature of the original program. This feature can be, for example, a regression with respect to an optimal solution. So clearly you have two paths for detecting regressions: either you evaluate a run of the produced code on some machine and for a given input data (something like Anthony's regression hunting), or you attack the results of the heuristic functions with an exact solver, as written by Mark in the oracular optimization page. Sebastian
Re: [GCC 4.2 Project] Omega data dependence test
Dave Korn wrote: > > Well, I'll pitch in, because I also wasn't sure at first whether it was > for real and what it was about, but I think I know now. Did you google > "bill pugh omega solver" and do some background reading? It didn't take me > too long to get the basic gist of what they're proposing (or at any rate, to > _think_ I had got it!). > > IIUIC, they want to use a linear-algorithm solver to verify the Omega is not linear: it has a worst case exponential time. It however does solves systems of linear (in)equalities, or just linear constraint systems. > data-dependence analyses performed by the Bannerjee analyzer by recomputing > the results from an alternative formulation so as to have a 'second opinion' > to compare the output of gcc's current analyses against.[*] > Yes.
Re: Question about std templates
On 8/8/05, stefano luceri <[EMAIL PROTECTED]> wrote: > hello to all > > anyone know if is possible to add a member to a template of standard > library? Have you considered using public or private inheritance from the STL container? -- Rakshasa Nyaa?
Old machine cluster for GCC compile/testing
Hi, FSF France has received in donation 9 Dell poweredge 1550 bi processor 1U machines with one 18GB SCSI disk and 1GB RAM, processors total 19.5 GHz distributed as follows: - 3 bi pentium III 1.25 GHz - 6 bi pentium III 1.00 GHz The machines are about four years old, so of course there may be hardware problems in the coming years, but we might also be able to get cheap parts on the used market (or from other donations). An offer has been made for hosting those 9 1U machines in Paris provided low use of external bandwidth, so this would be useable for a GCC compile farm. FSF France has to say yes or no to the hosting offer by friday 12Aug2005 17:00 UTC (end of this week), if we do not set up some compile/compute-farm like project FSF France will allocate these machines to other tasks. FYI 31 other machines of this type were also donated and have been allocated to various projects. So I'm asking for project proposals, that is to say people that think that their volunteer time to work on these old machine (scripts, compiling, ... under the limit of minimal external bandwidth use) is of some significant benefit to some free software project. Project participants would get ssh access to the machines at the beginning of september 2005. The machines are currently installed with ubuntu 5.04, but this could change if needed (and expertise provided). Feel free to pass this offer to projects that are related to GCC, like free software compiled with GCC that come with a useful test suite and where volunteer are willing to help. Discussions are welcome on this list. Sincerely, Laurent PS: sorry for the short notice, I wasn't aware until recently that there was a time limit on the hosting offer. We might be able to get another hosting offer, but I prefer not count on it.
Re: [GCC 4.2 Project] Omega data dependence test
On Mon, Aug 08, 2005 at 08:35:31PM +0200, Sebastian Pop wrote: > I'll try to explain again the goal of the project in a shorter > version. I have implemented a data dependence analysis, and I want to > validate the results that it produces. For this, I'm proposing to > compute the same information using another algorithm, and finally do a > diff. > > The second implementation of the data dependence analysis is using the > Omega solver. However, this solver is known to be exponential on some > cases (not all the cases, and in practice when used for basic data > dependence problems it is fast). So the only option we have is to not > expose this solver to our users, but use it for debugging and > improving the compiler. Algorithms that are sometimes exponential can still be used if there is a cutoff mechanism, to abort the algorithm if it exceeds a budget. This assumes that we can then fall back to an algorithm that might produce inferior results, but will produce something usable in reasonable time. For example, binary decision diagrams are commonly used in digital logic optimization and formal verification, even though they can require exponential space.
Re: does -fstack-protector work for gcc 4.1 on Darwin 8?
On 4 Aug 2005, Richard Henderson whispered secretively: > On Wed, Aug 03, 2005 at 09:39:13PM -0400, Jack Howarth wrote: >> Do you think I should be able to build gcc itself with the >> -fstack-protector flag and what is the most appropriate way to >> achieve that (ie brute force using a CFLAG or some configure >> flag)? > > Considering that I don't think that self-building with > -fstack-protector will ever be common, I don't think we > ought to spend too many brain cells on this. It was always possible with the SSP implementation, FWIW. (This was useful to get a libgcc compiled with -fstack-protector, although it's true that changing the TCFLAGS in gcc/Makefile also lets you do that.) > The only way to bootstrap with -fstack-protector without > existing support in libc is to use a top-level bootstrap. ... which is reasonable, I think. (This was also true of SSP.) -- `Tor employs several thousand editors who they keep in dank subterranean editing facilities not unlike Moria' -- James Nicoll
Re: [patch] Fix i386-mingw32 build failure
Christopher Faylor wrote: >The consensus seemed to be that this was not the way to fix the problem. The consensus also seemed to be that it was just an aspect of a larger problem that no good solution had been proposed to solve yet. >I suggested that modifying pex-* functions to understand #! scripts >might be the best way to deal with this. It seems to be a rather convoluted and complicated way of tricking the newly built compiler driver to run a specific version of a program. Especially since the #! hack currently used in the Makefile might get replaced by some other hack. Ross Ridge
