This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [PATCH]: PA long unconditional branch generation (PR10062)
- From: "John David Anglin" <dave at hiauly1 dot hia dot nrc dot ca>
- To: dave at hiauly1 dot hia dot nrc dot ca (John David Anglin)
- Cc: mark at codesourcery dot com, gcc-patches at gcc dot gnu dot org, china at thewrittenword dot com
- Date: Thu, 20 Mar 2003 19:01:46 -0500 (EST)
- Subject: Re: [PATCH]: PA long unconditional branch generation (PR10062)
> Without inlining, the length of the compare chain is 29. The default
> inlining requires in excess of 768MB of virtual memory to compile
> the testcase in the PR. Clearly, the default inlining parameters
> need to be tweaked to keep the compilation with reasonable bounds
> but I'm not sure how to do this. Possibly, the throttling algorithm
> is broken. It would also be nice to use a jump table.
I should note that once the size of a function exceeds ~240KB we need
to use long calls and branches. These sequences are substantially
longer and less efficient. So, we probably lose more than we gain
at that point.
Dave
--
J. David Anglin dave dot anglin at nrc-cnrc dot gc dot ca
National Research Council of Canada (613) 990-0752 (FAX: 952-6602)