On Fri, 2013-08-16 at 11:41 +0100, Richard Purdie wrote:
> On Thu, 2013-08-15 at 10:43 +0100, Phil Blundell wrote:
> > I don't think there's currently any straightforward way
> > for package.bbclass to generate the recursive dependency chain for an
> > arbitrary recipe.
>
> Bitbake itself has that information and I suspect we should share it to
> tasks. The exact form of that would be the harder thing to determine...
If it's something that bitbake already computes (or could compute
cheaply) then you could just arrange for it to add it to the datastore
as something like ${BB_COMPUTED_DEPENDS} before running each task. Just
a flat textual list of recipes, de-duped but in arbitrary order, would
probably be good enough for all the use-cases we've talked about so far.
I guess the question is whether you need to do anything clever with
selecting the dependencies for particular tasks, or whether you could
just take the dependencies for all tasks that the recipe defines and
collapse them into a single list. I think probably the latter.
If it's expensive to compute then I guess there'd need to be some sort
of bb.cooker.get_recursive_dependencies() kind of function that tasks
can call when they want the information.
p.
_______________________________________________
Openembedded-core mailing list
Openembedded-core@lists.openembedded.org
http://lists.openembedded.org/mailman/listinfo/openembedded-core
