250 void add_property(struct node *node, struct property *prop)  in add_property()  argument
254 	prop->next = NULL;  in add_property()
260 	*p = prop;  in add_property()
265 	struct property *prop = node->proplist;  in delete_property_by_name()  local
267 	while (prop) {  in delete_property_by_name()
268 		if (streq(prop->name, name)) {  in delete_property_by_name()
269 			delete_property(prop);  in delete_property_by_name()
272 		prop = prop->next;  in delete_property_by_name()
276 void delete_property(struct property *prop)  in delete_property()  argument
278 	prop->deleted = 1;  in delete_property()
279 	delete_labels(&prop->labels);  in delete_property()
311 	struct property *prop;  in delete_node()  local
317 	for_each_property(node, prop)  in delete_node()
318 		delete_property(prop);  in delete_node()
407 	struct property *prop;  in get_property()  local
409 	for_each_property(node, prop)  in get_property()
410 		if (streq(prop->name, propname))  in get_property()
411 			return prop;  in get_property()
416 cell_t propval_cell(struct property *prop)  in propval_cell()  argument
418 	assert(prop->val.len == sizeof(cell_t));  in propval_cell()
419 	return fdt32_to_cpu(*((fdt32_t *)prop->val.val));  in propval_cell()
422 cell_t propval_cell_n(struct property *prop, int n)  in propval_cell_n()  argument
424 	assert(prop->val.len / sizeof(cell_t) >= n);  in propval_cell_n()
425 	return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n));  in propval_cell_n()
431 	struct property *prop;  in get_property_by_label()  local
436 	for_each_property(tree, prop) {  in get_property_by_label()
439 		for_each_label(prop->labels, l)  in get_property_by_label()
441 				return prop;  in get_property_by_label()
445 		prop = get_property_by_label(c, label, node);  in get_property_by_label()
446 		if (prop)  in get_property_by_label()
447 			return prop;  in get_property_by_label()
455 				struct node **node, struct property **prop)  in get_marker_label()  argument
464 		*prop = p;  in get_marker_label()
472 		m = get_marker_label(c, label, node, prop);  in get_marker_label()
477 	*prop = NULL;  in get_marker_label()
690 	struct property *prop, **tbl;  in sort_properties()  local
692 	for_each_property_withdel(node, prop)  in sort_properties()
700 	for_each_property_withdel(node, prop)  in sort_properties()
701 		tbl[i++] = prop;  in sort_properties()
848 	struct property *prop;  in any_fixup_tree()  local
851 	for_each_property(node, prop) {  in any_fixup_tree()
852 		m = prop->val.markers;  in any_fixup_tree()
868 			    struct node *node, struct property *prop,  in add_fixup_entry()  argument
877 	if (strchr(node->fullpath, ':') || strchr(prop->name, ':'))  in add_fixup_entry()
881 			node->fullpath, prop->name, m->offset);  in add_fixup_entry()
893 	struct property *prop;  in generate_fixups_tree_internal()  local
897 	for_each_property(node, prop) {  in generate_fixups_tree_internal()
898 		m = prop->val.markers;  in generate_fixups_tree_internal()
902 				add_fixup_entry(dti, fn, node, prop, m);  in generate_fixups_tree_internal()
913 	struct property *prop;  in any_local_fixup_tree()  local
916 	for_each_property(node, prop) {  in any_local_fixup_tree()
917 		m = prop->val.markers;  in any_local_fixup_tree()
934 		struct property *prop, struct marker *m,  in add_local_fixup_entry()  argument
965 	append_to_property(wn, prop->name, &value_32, sizeof(value_32));  in add_local_fixup_entry()
974 	struct property *prop;  in generate_local_fixups_tree_internal()  local
978 	for_each_property(node, prop) {  in generate_local_fixups_tree_internal()
979 		m = prop->val.markers;  in generate_local_fixups_tree_internal()
983 				add_local_fixup_entry(dti, lfn, node, prop, m, refnode);  in generate_local_fixups_tree_internal()