Lines Matching refs:tree

3 The Linux usage model for device tree data
7 This article describes how Linux uses the device tree.  An overview of
8 the device tree data format can be found on the device tree usage page
19 Structurally, the DT is a tree, or acyclic graph with named nodes, and
22 links from one node to another outside of the natural tree structure.
25 is defined for how data should appear in the tree to describe typical
100 perfectly by the device tree in a consistent and reliable manner.
110 table and selects the machine_desc which best matches the device tree
112 property in the root device tree node, and comparing it with the
202 several times with different helper callbacks to parse device tree
204 the device tree and uses the helpers to extract information required
212 scanning of the device tree after selecting the correct machine_desc
251 tree and children of simple memory mapped bus nodes.
254 device tree for the NVIDIA Tegra board.
320 However, looking at the tree, it is not immediately obvious what kind
331 The trick is that the kernel starts at the root of the tree and looks
335 of the tree is either directly attached to the processor bus, or is a
350 tree.  Therefore, if a DT node is at the root of the tree, then it
354 to kick off discovery of devices at the root of the tree.  The
356 tree, there is no need to provide a starting node (the first NULL), a
378 device tree support code reflects that and makes the above example