[dataflow]: PATCH: worklist based dataflow solver

Kenneth Zadeck zadeck@naturalbridge.com
Tue Jan 9 20:27:00 GMT 2007


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.

kenny



More information about the Gcc-patches mailing list