On Wed, 19 Feb 2014 08:54:57 -0600, Rob Herring wrote:
> On Wed, Feb 19, 2014 at 8:14 AM, Grant Likely wrote:
> > From: Kevin Hao
> >
> > In the current implementation of __of_match_node(), it will compare
> > each given match entry against all the node's compatible strings
> > with
On Wed, Feb 19, 2014 at 8:14 AM, Grant Likely wrote:
> From: Kevin Hao
>
> In the current implementation of __of_match_node(), it will compare
> each given match entry against all the node's compatible strings
> with of_device_is_compatible().
>
> To achieve multiple compatible strings per node
From: Kevin Hao
In the current implementation of __of_match_node(), it will compare
each given match entry against all the node's compatible strings
with of_device_is_compatible().
To achieve multiple compatible strings per node with ordering from
specific to generic, this requires given
From: Kevin Hao haoke...@gmail.com
In the current implementation of __of_match_node(), it will compare
each given match entry against all the node's compatible strings
with of_device_is_compatible().
To achieve multiple compatible strings per node with ordering from
specific to generic, this
On Wed, Feb 19, 2014 at 8:14 AM, Grant Likely grant.lik...@linaro.org wrote:
From: Kevin Hao haoke...@gmail.com
In the current implementation of __of_match_node(), it will compare
each given match entry against all the node's compatible strings
with of_device_is_compatible().
To achieve
On Wed, 19 Feb 2014 08:54:57 -0600, Rob Herring robherri...@gmail.com wrote:
On Wed, Feb 19, 2014 at 8:14 AM, Grant Likely grant.lik...@linaro.org wrote:
From: Kevin Hao haoke...@gmail.com
In the current implementation of __of_match_node(), it will compare
each given match entry against
6 matches
Mail list logo