This is the mail archive of the
mailing list for the GCC project.
Re: Reorder some tree codes
On Mon, 20 Dec 2004, Daniel Jacobowitz wrote:
On Mon, Dec 20, 2004 at 07:53:43AM -0800, Mark Mitchell wrote:
I'm sympathetic to the idea that it would be cooler to improve the
middle end so that it did this optimization itself, but I don't know how
hard that would be. Does anyone have an idea about that? (The
documentation issue remains in this case, in that someone might reorder
the codes, and then we have a performance degradation, if it's no longer
possible to collapse the checks into a range check.)
Are we sure that it doesn't already do this?
The easy way to find out is to keep the reordering in tree.def without the
in_range checks in tree.h.
Nathan, had you ever tried it that way to see if it produces the desired