On Thu, May 01, 2014 at 09:13:51AM -0700, Simon Glass wrote: > Hi, > > On 22 March 2014 08:07, Simon Glass <[email protected]> wrote: > > Given a set of nodes and properties, find the regions of the device tree > > which describe those parts. > > > > A test is provided which builds a tree while tracking where the regions > > should be, then calls fdt_first/next_region() to make sure that it agrees. > > > > Further tests will come as part of fdtgrep. > > > > Signed-off-by: Simon Glass <[email protected]> > > Have I sent this to the right place? Any comments?
Sorry. I know you've resent this several times, and I've been
procrastinating about it since forever.
Basically, I'm just not convinced. For all your efforts to explain
the rationale, it just seems like a really ad-hoc set of flags and
conditions that doesn't seem to form a coherent whole.
From the lack of other responses, I'm assuming there's not really
anyone else who sees it as a compelling feature either.
So, sorry. For the forseeable future, you'll need to leave this
implemented in your own code, using but outside of libfdt itself.
--
David Gibson | I'll have my music baroque, and my code
david AT gibson.dropbear.id.au | minimalist, thank you. NOT _the_ _other_
| _way_ _around_!
http://www.ozlabs.org/~dgibson
pgpwMQH5NxjFP.pgp
Description: PGP signature
