Re: [bitbake-devel] an idea about parallel doing do_patch

["Mikko Rapeli" <mikko.rapeli@bmw.de>]

Hi,

On Mon, Sep 07, 2020 at 01:27:29AM -0700, zhangyifan46 via lists.openembedded.org wrote:
> In our peoject,we have suffered a lot from long duration of do_patch of linux kernel(3000+ patches). I found that one do_patch task uses only one process. So I modify a llittle do do_patch task. Here is my idea:
> 1.analyse the patches,only getting the modified files of each patch.
> 2.cluster all patches according to the files modified( patch no.1 modifies file A,B ,patch no.2 modifies file A, patch no.3 modifies file C,then we cluster patch no.1 and no.2 as  a group, patch no.3 as another group) , here I use union-find to do the cluster
> 3.assign one group on one process
> But I met the problem of probabilistic missing patches.
> Anyone has any comments about my idea?

I think having large patch sets in meta layers and applied with bitbake are not the
right solution. I would create a custom git repo and branch for large forks/branches
like this.

Possibly it could also be possible to apply patches with git through mbox files, but
I don't think this will much faster than bitbake.

Hope this helps,

-Mikko

>