Re: [PATCH] Patch to improve device tree structure

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 




On Sun, 23 Nov 2014 17:22:22 -0800
, Gaurav Minocha <gaurav.minocha.os@xxxxxxxxx>
 wrote:
> On Tue, Nov 18, 2014 at 7:10 AM, Grant Likely <grant.likely@xxxxxxxxxx> wrote:
> > On Sun, 16 Nov 2014 20:52:56 -0800
> > , Gaurav Minocha <gaurav.minocha.os@xxxxxxxxx>
> >  wrote:
> >> This patch improves the implementation of device tree structure.
> >>
> >> Traditional child and sibling linked list in device tree structure
> >> is removed and is replaced by list_head (i.e. circular doubly linked
> >>  list) already available in Linux kernel.
> >>
> >> Signed-off-by: Gaurav Minocha <gaurav.minocha.os@xxxxxxxxx>
> >
> > Hi Gaurav,
> >
> > So, after you've done this work, I need to you rebase it (and of course
> > it is non-trivial) onto linux-next. I've already got a patch queued up
> > which gets rid of the of_allnodes/allnext list which will have conflicts
> > with this patch.
> >
> 
> I am using http://git.kernel.org/pub/scm/linux/kernel/git/glikely/linux.git
> There is no branch linux-next in it. Also, I believe http://git.secretlab.ca/
> is not up yet. Please correct.

The branch is devicetree/next. That is the branch that gets pulled into
linux-next every day.

git.secretlab.ca is now gone. I'm not going to resurrect it.

> >> -#define NO_OF_NODES 3
> >> -static struct device_node *nodes[NO_OF_NODES];
> >> -static int last_node_index;
> >> +#define MAX_NODES 50
> >> +
> >> +static int no_of_nodes;
> >>  static bool selftest_live_tree;
> >> +static struct device_node* nodes[MAX_NODES];
> >
> > I think it's time to rework this structure. Instead of a static list,
> > the code should figure out how many entries it needs and then kzalloc()
> > the region.
> 
> Ok.

For now I would like to you focus on this change and on making the
unittests independent of OF_DYNAMIC. Frank had some good comments. I'd
like to think on it some more before proceeding. The only time that the
single linked list is a problem is when unflattening the tree, but even
that can be mitigated by reordering it after unflatting has completed
instead of trying to keep it in order all the time.

The biggest question is whether or not we can switch to RCU operations.
It isn't necessary to use list_head to switch to RCU, but RCU is a lot
better understood when list_head is used.

So, work on OF_DYNAMIC for now and we'll revisit list_head later.

g.
--
To unsubscribe from this list: send the line "unsubscribe devicetree" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at  http://vger.kernel.org/majordomo-info.html




[Index of Archives]     [Device Tree Compilter]     [Device Tree Spec]     [Linux Driver Backports]     [Video for Linux]     [Linux USB Devel]     [Linux PCI Devel]     [Linux Audio Users]     [Linux Kernel]     [Linux SCSI]     [XFree86]     [Yosemite Backpacking]
  Powered by Linux