Re: probabilistic approach to tinderboxing

2012-06-14 Thread Bjoern Michaelsen
On Thu, Jun 14, 2012 at 09:57:48AM -0500, Norbert Thiebaud wrote: > When you apply a series in sequence, at any point the result must be > buildable... > 1/ it is good practice > 2/ if that is not the case bisection is much harder ... but it has a lower importance than having the tip of master bui

Re: probabilistic approach to tinderboxing

2012-06-14 Thread Stephan Bergmann
On 06/14/2012 04:57 PM, Norbert Thiebaud wrote: On Thu, Jun 14, 2012 at 1:59 AM, Stephan Bergmann wrote: On 06/13/2012 03:00 PM, Norbert Thiebaud wrote: I think you are confusing buildability after each patch of a series has been applied in sequence (which is a desirable property indeed) vs.

Re: probabilistic approach to tinderboxing

2012-06-14 Thread Norbert Thiebaud
On Thu, Jun 14, 2012 at 1:59 AM, Stephan Bergmann wrote: > On 06/13/2012 03:00 PM, Norbert Thiebaud wrote: > > > I think you are confusing buildability after each patch of a series has been > applied in sequence (which is a desirable property indeed) vs. buildable > with each patch of a series app

Re: probabilistic approach to tinderboxing

2012-06-14 Thread Bjoern Michaelsen
Hi, On Thu, Jun 14, 2012 at 12:36:12PM +0200, Lubos Lunak wrote: > Where are we going to get these tinderboxes? The page for master lists 17 > tinderboxes, out of which only about 11 build regularly. Out of which there > are 4 linux-gcc tinderboxes, one linux-clang, 1(2?) macosx, 3 windows and

Re: probabilistic approach to tinderboxing

2012-06-14 Thread Lubos Lunak
On Tuesday 12 of June 2012, Bjoern Michaelsen wrote: > Hi all, > > this is a proposal to get as much focused tinderboxing as possible with > limited resources and unreliable build clients. This also assumes patches > under consideration to be independant (that is: without conflicts) and not > depen

Re: probabilistic approach to tinderboxing

2012-06-13 Thread Stephan Bergmann
On 06/13/2012 03:00 PM, Norbert Thiebaud wrote: On Wed, Jun 13, 2012 at 7:20 AM, Bjoern Michaelsen wrote: Well, I simplified a bit here. When using gerrit you would push one patch separate if it is independant and multiple patches as a series if they are dependant. gerrit handles that correct

Re: probabilistic approach to tinderboxing

2012-06-13 Thread Norbert Thiebaud
On Wed, Jun 13, 2012 at 8:53 AM, Bjoern Michaelsen wrote: > But we are doing that not now as pushes are atomic (or more precise: > ref-updates are), so tinderboxes wouldnt see a half-push. true. but just because we don't, doesn't mean we shouldn't > Also all patches in a > series have the same o

Re: probabilistic approach to tinderboxing

2012-06-13 Thread Bjoern Michaelsen
On Wed, Jun 13, 2012 at 08:00:12AM -0500, Norbert Thiebaud wrote: > Well... it _should_ be buildable at each step of the patch series... > if not, clean-it up, it is not yet 'published' in the git sens of the > term so you still have a chance to git rebase -i to fix things up. > > Building at each

Re: probabilistic approach to tinderboxing

2012-06-13 Thread Norbert Thiebaud
On Wed, Jun 13, 2012 at 7:20 AM, Bjoern Michaelsen wrote: > > Well, I simplified a bit here. When using gerrit you would push one patch > separate if it is independant and multiple patches as a series if they are > dependant. gerrit handles that correctly as a 'patch series'. I would not want > to

Re: probabilistic approach to tinderboxing

2012-06-13 Thread Bjoern Michaelsen
Hi, On Wed, Jun 13, 2012 at 02:03:31PM +0200, Eike Rathke wrote: > Maybe I misunderstood, but the independency and arbitrary order I see as > a problem. People do work in iterative steps.. so if we could at least > assure that patches by the same author are ordered correctly that might > work. We

Re: probabilistic approach to tinderboxing

2012-06-13 Thread Eike Rathke
Hi Bjoern, On Tuesday, 2012-06-12 16:45:06 +0200, Bjoern Michaelsen wrote: > This also assumes patches under consideration to be independant (that > is: without conflicts) and not dependant on a specific order. Maybe I misunderstood, but the independency and arbitrary order I see as a problem. P

Re: probabilistic approach to tinderboxing

2012-06-13 Thread Bjoern Michaelsen
On Tue, Jun 12, 2012 at 04:45:06PM +0200, Bjoern Michaelsen wrote: > After sending off the tinderbox with just this one patch, do: > > p-innocent(patch)/=p-innocent(testcase) > > for all patches in each tinderbox run with this patch (once for each run) ... and this should probably then be: >

Re: probabilistic approach to tinderboxing

2012-06-12 Thread Bjoern Michaelsen
On Tue, Jun 12, 2012 at 04:45:06PM +0200, Bjoern Michaelsen wrote: > After sending off the tinderbox with this patchset, do: >p-innocent(patch) *= p-innocent(testcase) > reducing the innocence of the patches without waiting for results. So we > assume > the patches of the set to be partially g

probabilistic approach to tinderboxing

2012-06-12 Thread Bjoern Michaelsen
Hi all, this is a proposal to get as much focused tinderboxing as possible with limited resources and unreliable build clients. This also assumes patches under consideration to be independant (that is: without conflicts) and not dependant on a specific order. gerrit allow us to have patches indepe