This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: [dataflow]: PATCH: worklist based dataflow solver


On 1/10/07, Seongbae Park <seongbae.park@gmail.com> wrote:
On 1/9/07, Daniel Berlin <dberlin@dberlin.org> wrote:
> On 1/9/07, Kenneth Zadeck <zadeck@naturalbridge.com> wrote:
> > Daniel Berlin wrote:
> > > On 1/9/07, Seongbae Park <seongbae.park@gmail.com> wrote:
> > >> This patch cuts the time spent in dataflow solver in half, when
> > >> compiling top 5 largest files for building cc1. For one analysis
> > >> (reaching store problem used during dse),
> > >> traversing in the order of the reverse postorder of inverted CFG
> > >> for the forward problems reduces the block visit count by 90%.
> > >> The worklist based algorithm reduces it by couple % further.
> > >
> > > That's pretty funny. We originally changed the algorithm to what it is
> > > now because it was faster for the problems it was solving.
> > > Oh well.
> > trust but verify.
> I did.
> I ran the numbers myself back then.
> Of course, i may have misread them what with having the lantern
> running out of oil and all that.

If requested, I can produce the number of block visit count.
--

No need on my account. Heck, i'm gonna switch tree-ssa-pre.c over to using one of the new inverted CFG orderings. :)


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]