From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 3625 invoked by alias); 20 May 2003 06:12:15 -0000 Mailing-List: contact gcc-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-owner@gcc.gnu.org Received: (qmail 3570 invoked from network); 20 May 2003 06:12:14 -0000 Received: from unknown (HELO its-mu-earth.its.rmit.edu.au) (131.170.2.10) by sources.redhat.com with SMTP; 20 May 2003 06:12:14 -0000 Received: from its-mn-inet1.its.rmit.edu.au (ems.rmit.edu.au [131.170.10.112]) by its-mu-earth.its.rmit.edu.au (8.10.1/8.10.1/ANTI-SPAM/ANTI-RELAY/EARTH) with ESMTP id h4K6CBC19030 for ; Tue, 20 May 2003 16:12:11 +1000 (EST) Received: from INET1-MTA by its-mn-inet1.its.rmit.edu.au with Novell_GroupWise; Tue, 20 May 2003 16:12:10 +1000 Message-Id: Date: Tue, 20 May 2003 06:40:00 -0000 From: "Marty Hauff" To: Cc: Subject: Re: [tree-ssa] Any good sources of documentation? Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: quoted-printable Content-Disposition: inline X-SW-Source: 2003-05/txt/msg01838.txt.bz2 Diego, Thanks for your response. There was an query posted by Matthieu Moy on 5/4= regarding "Where can I get the output of the front-end". In this query he= asked if there was a moment in the compilation at which we can see the who= le program in one single tree? The response suggested trying cgraph_finali= ze_compilation_unit (). From your response I am assuming that tree-ssa doe= s not parse the _whole_ program into one huge tree but rather parses each f= unction individually. I understand that this strategy uses far less memory= but could tree-ssa be modified to parse the whole program into a single tr= ee and if so would it break it? Specifically I am trying to use the compiler to give me information about w= hat hardware resources would be most useful for a given application. I can= 't use the mainline code because it converts to RTL (which is machine depen= dent) very early on and does most of its optimisations in the RTL. Ideally= I would like to receive an already optimised tree that can be analysed to = deduce an ideal hardware architecture. Do you think that tree-ssa is the t= ool for this????? Oh and by the way, I will be attempting to walk on water shortly after acco= mplishing all this..... Marty >>> Diego Novillo 19/05/03 23:23:14 >>> On Mon, 2003-05-19 at 04:22, Marty Hauff wrote: > I'm trying to find out how the tree-ssa branch performs its > compilation and optimisation. I've found the doxygen stuff on the web > but I need something a bit higher level at this stage. > Most documentation is in the source code itself. There is a high-level description of the optimization process in the project page (http://gcc.gnu.org/projects/tree-ssa/). After the GCC summit next week, I will post the tree SSA paper and slides in my home page. > Specifically I am looking to find a point during compilation where the > most optimisation has been done PRIOR to target specific processing > having been started. > tree-optimize.c:optimize_function_tree() > The main gcc branch is no good to me because it only does things on > a function by function basis. According to the docs, tree-ssa > processes the whole source _before_ generating rtl etc. (or have I got > this wrong?) >=20 Both mainline and tree-ssa operate in the same way. If you use -funit-at-a-time, then compilation proceeds in call graph order. Diego.