Lines Matching +full:bool +full:- +full:property

20  *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307
60 extern int auto_label_aliases;	/* auto generate labels -> aliases */
73 #define ALIGN(x, a)	(((x) + (a) - 1) & ~((a) - 1))
99 	for (; (m); (m) = (m)->next)
102 		if ((m)->type == (t))
126 bool data_is_one_string(struct data d);
135 	bool deleted;
144 struct property {  struct
145 	bool deleted;
149 	struct property *next;  argument
155 	bool deleted;
157 	struct property *proplist;  argument
172 	bool omit_if_unused, is_referenced;
176 	for ((l) = (l0); (l); (l) = (l)->next)
180 		if (!(l)->deleted)
183 	for ((p) = (n)->proplist; (p); (p) = (p)->next)
187 		if (!(p)->deleted)
190 	for ((c) = (n)->children; (c); (c) = (c)->next_sibling)
194 		if (!(c)->deleted)
199 struct property *build_property(char *name, struct data val);
200 struct property *build_property_delete(char *name);
201 struct property *chain_property(struct property *first, struct property *list);
202 struct property *reverse_properties(struct property *first);
204 struct node *build_node(struct property *proplist, struct node *children);
213 void add_property(struct node *node, struct property *prop);
215 void delete_property(struct property *prop);
223 struct property *get_property(struct node *node, const char *propname);
224 cell_t propval_cell(struct property *prop);
225 cell_t propval_cell_n(struct property *prop, int n);
226 struct property *get_property_by_label(struct node *tree, const char *label,
229 				struct node **node, struct property **prop);
261 	const char *outname;		/* filename being written to, "-" for stdout */
265 #define DTSF_V1		0x0001	/* /dts-v1/ */
272 void generate_label_tree(struct dt_info *dti, char *name, bool allocph);
278 void parse_checks_option(bool warn, bool error, const char *arg);
279 void process_checks(bool force, struct dt_info *dti);