Slashdot Mirror


GCC 4.0.0 Released

busfahrer writes "Version 4.0.0 of the GNU Compiler Collection has been released. You can read the changelog or you can download the source tarball. The new version finally features SSA for trees, allowing for a completely new optimization framework." The changelog is pretty lengthy, and there's updates for every language supported from Ada to Java in addition to the usual flavors of C.

5 of 680 comments (clear)

  1. Great Timing by LordRPI · · Score: 1, Redundant

    I guess they couldn't have Apple release it first under the Developer Tools for Tiger :)

  2. Re:What a coincidence by ergo98 · · Score: 0, Redundant

    Right...and it still isn't Visual Studio.NET 2005 - It's Visual Studio 2005. Microsoft dumped .NET from their naming system.

  3. Re:I am so happy!!! by hdparm · · Score: 0, Redundant

    What exactly happened in your childhood?

  4. Re:Objective-C++...? by norwoodites · · Score: 1, Redundant

    Actually someone is working on merging it. So you data is not update. See here.

  5. In LISP, good coding is already SSA trees by MonkeyBoyo · · Score: 0, Redundant

    In LISP code, whenever you see a SETQ (assignment) it cries out that the programmer may be lazy or not very good. Good coders know to bind values (LET) rather than change them (SETQ) and treat iteration as recursion.

    Of course functional languages have to bite the bullet when munging data structures (SET!). I have no idea how SSA representation handles such cases.

    In the pure functional sphere (e.g. Prolog) you have to treat changing an element in a data structure as making an altered clone of that data structure (though there good structural hacks so that altering 1 element in a 100000 element array does not cause the whole array to be cloned).

    Worse than functional languages are the linear logics. I'm sure they make a lot of "deep" sense, but there not only can each variable be only assigned once, but also it can only be read once.