Re: email-based regression search server

[Phil Edwards <phil at jaj dot com>]

Two minor updates:


On Mon, Feb 03, 2003 at 06:21:18PM -0500, Phil Edwards wrote:
> As a side effect of running the autocrasher, I have a couple month's worth
> of cc1 and cc1plus, from daily builds of various branches.  (Right now they
> number about 150 compilers.)  Good part is you get an answer quickly, bad
> part is that it can't look further back than the start of December 2002.
> Earlier ones got lost in a disk crash.

...but have since been rebuilt on the requests of those that have decided
to give it a try.  It can search each day on the trunk back to the start
of October 2002 (assuming the tree built on that day).


> The assumption is that the code used to compile but now does not, and the
> search will try to find when the compiler started exiting with a non-zero
> value.  Not meeting that assumption will give amusingly useless results.

It can now also look for the opposite situation:  the input code was broken,
but now compiles.  (I don't know of an example.)

Input test code that worked, then broke, then worked, then broke, etc, will
naturally drive the hunter nuts.  Like you'd expect with a binary search.


Phil

-- 
I would therefore like to posit that computing's central challenge, viz. "How
not to make a mess of it," has /not/ been met.
                                                 - Edsger Dijkstra, 1930-2002