include/linux/libfdt.h

26  * Add all supernodes of a matching node/property, useful for creating a
34 /* Add all subnodes of a matching node */
40 /* Indicates what an fdt part is (node, property, value) */
45 #define FDT_NODE_HAS_PROP		(1 << 4)	/* node contains prop */
64 	int offset;		/* Offset of node */
66 	int included;		/* 1 if we included this node, 0 if not */
73 	char *end;			/* Pointer to end of full node path */
74 	int nextoffset;			/* Next node offset to check */
79 	struct fdt_subnode_stack stack[FDT_MAX_DEPTH];	/* node stack */
107  * For eaxample "/" means to include the root node, all root properties
110  * it prevents the root node from changing at all Any change to non-excluded
128  * @inc:	List of node paths to included
129  * @inc_count:	Number of node paths in list
156  * possible to grep for a node and get all the properties associated with
157  * that node. Trees can be subsetted easily, by specifying the nodes that
179  * provided by the caller. This function is called for each node and
185  *		if its containing node is included
188  * included if its containing node is included - this is the case where
192  * containing node to be included since it is not valid to have a property
193  * that is not in a node.
195  * Using the information provided, the inclusion of a node can be controlled
196  * either by a node name or its compatible string, or any other property
199  * As an example, including node "/" means to include the root node and all
201  * which there is none for the root node), and another flag includes
206  * root node from changing at all. Any change to non-excluded properties,
235  *		@offset: Offset of this node / property
237  *		@data: Pointer to data (node name, property name, compatible