From mboxrd@z Thu Jan  1 00:00:00 1970
From: =?iso-8859-1?Q?N=E9lio?= Laranjeiro <nelio.laranjeiro@6wind.com>
Subject: Re: git trees organization
Date: Thu, 14 Sep 2017 11:11:56 +0200
Message-ID: <20170914091156.GB2160@autoinstall.dev.6wind.com>
References: <2737351.pD9poAUtZC@xps> <20170913145402.GA2481@6wind.com>
 <CAOaVG150jLnm=RcqRmmCUUO8cUw3+k+0QmqH1Txp4S3poCX9Pw@mail.gmail.com>
 <5858182.HmkBWfGZLK@xps>
Mime-Version: 1.0
Content-Type: text/plain; charset=iso-8859-1
Content-Transfer-Encoding: 8bit
Cc: Stephen Hemminger <stephen@networkplumber.org>,
 Adrien Mazarguil <adrien.mazarguil@6wind.com>,
 Ferruh Yigit <ferruh.yigit@intel.com>,
 Bruce Richardson <bruce.richardson@intel.com>, dev@dpdk.org,
 techboard@dpdk.org
To: Thomas Monjalon <thomas@monjalon.net>
Return-path: <dev-bounces@dpdk.org>
Received: from mail-wm0-f41.google.com (mail-wm0-f41.google.com [74.125.82.41])
 by dpdk.org (Postfix) with ESMTP id 45F7D1AEF0
 for <dev@dpdk.org>; Thu, 14 Sep 2017 11:12:08 +0200 (CEST)
Received: by mail-wm0-f41.google.com with SMTP id i189so8477101wmf.1
 for <dev@dpdk.org>; Thu, 14 Sep 2017 02:12:07 -0700 (PDT)
Content-Disposition: inline
In-Reply-To: <5858182.HmkBWfGZLK@xps>
List-Id: DPDK patches and discussions <dev.dpdk.org>
List-Unsubscribe: <http://dpdk.org/ml/options/dev>,
 <mailto:dev-request@dpdk.org?subject=unsubscribe>
List-Archive: <http://dpdk.org/ml/archives/dev/>
List-Post: <mailto:dev@dpdk.org>
List-Help: <mailto:dev-request@dpdk.org?subject=help>
List-Subscribe: <http://dpdk.org/ml/listinfo/dev>,
 <mailto:dev-request@dpdk.org?subject=subscribe>
Errors-To: dev-bounces@dpdk.org
Sender: "dev" <dev-bounces@dpdk.org>

On Thu, Sep 14, 2017 at 10:22:23AM +0200, Thomas Monjalon wrote:
> 14/09/2017 04:25, Stephen Hemminger:
> > Bisecting a tree with lots of subtree merges is terrible. That is why Linus
> > rebases and doesn't directly take linux-next
> 
> I agree, bisecting with subtree merges is not pleasant at all.
> That's why I chose the rebase method until now.

I don't see what is un-pleasant, if we start a bisect what we expect is to
find the commit introducing the issue, bisect is able to do it even on large
tree with a lot of merges.  Moreover, the probability the issue will be
searched in a specific section within its own subtree is high which also means
locally it will be linear, is not it equivalent to the actual situation?

> Adrien mentioned some drawbacks with the rebase method.
> Ferruh mentioned some drawbacks and some advantages of rebase.
> Stephen mentioned another advantage of rebase.
> Such decisions are really difficult.
> One thing is sure: there will be always someone unhappy,
> no matter the decision :)
> 
> When we want to take such decision or re-consider it,
> we ask the techboard to vote...

-- 
Nélio Laranjeiro
6WIND