Re: Common subexpression analysis (summary)

igor!voltaire!davidm@uunet.UU.NET (David Moore)
Mon, 13 Jul 1992 17:20:28 GMT

          From comp.compilers
Related articles
Common subexpression analysis (summary) mernst@theory.lcs.mit.edu (1992-06-26)
Re: Common subexpression analysis (summary) buzzard@eng.umd.edu (1992-07-07)
Re: Common subexpression analysis (summary) Bruce.Hoult@bbs.actrix.gen.nz (1992-07-13)
Re: Common subexpression analysis (summary) igor!voltaire!davidm@uunet.UU.NET (1992-07-13)
Re: Common subexpression analysis (summary) Dik.Winter@cwi.nl (1992-07-13)
Re: Common subexpression analysis (summary) preston@dawn.cs.rice.edu (1992-07-12)
| List of all articles for this month |
Newsgroups: comp.compilers
From: igor!voltaire!davidm@uunet.UU.NET (David Moore)
Organization: Compilers Central
Date: Mon, 13 Jul 1992 17:20:28 GMT
References: 92-06-135 92-07-021
Keywords: optimize

buzzard@eng.umd.edu (Sean Barrett) writes:
>Recently I noticed a cute little optimization thing; [slightly
>complicated example follows]


A simpler example of where this is useful is in a common
Fortran idiom for finding a maximum in an array:


j=1
                do i=1,N
                    if(a(i).gt.a(j))j=i
                end do


Knowledgable Fortran programmers will put the comparison value
in a scalar, but I have seen this code in some benchmarks which
are said to be taken from real code.
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.