249 void add_property(struct node *node, struct property *prop)  in add_property()  argument
253 	prop->next = NULL;  in add_property()
259 	*p = prop;  in add_property()
264 	struct property *prop = node->proplist;  in delete_property_by_name()  local
266 	while (prop) {  in delete_property_by_name()
267 		if (streq(prop->name, name)) {  in delete_property_by_name()
268 			delete_property(prop);  in delete_property_by_name()
271 		prop = prop->next;  in delete_property_by_name()
275 void delete_property(struct property *prop)  in delete_property()  argument
277 	prop->deleted = 1;  in delete_property()
278 	delete_labels(&prop->labels);  in delete_property()
310 	struct property *prop;  in delete_node()  local
316 	for_each_property(node, prop)  in delete_node()
317 		delete_property(prop);  in delete_node()
406 	struct property *prop;  in get_property()  local
408 	for_each_property(node, prop)  in get_property()
409 		if (streq(prop->name, propname))  in get_property()
410 			return prop;  in get_property()
415 cell_t propval_cell(struct property *prop)  in propval_cell()  argument
417 	assert(prop->val.len == sizeof(cell_t));  in propval_cell()
418 	return fdt32_to_cpu(*((fdt32_t *)prop->val.val));  in propval_cell()
421 cell_t propval_cell_n(struct property *prop, int n)  in propval_cell_n()  argument
423 	assert(prop->val.len / sizeof(cell_t) >= n);  in propval_cell_n()
424 	return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n));  in propval_cell_n()
430 	struct property *prop;  in get_property_by_label()  local
435 	for_each_property(tree, prop) {  in get_property_by_label()
438 		for_each_label(prop->labels, l)  in get_property_by_label()
440 				return prop;  in get_property_by_label()
444 		prop = get_property_by_label(c, label, node);  in get_property_by_label()
445 		if (prop)  in get_property_by_label()
446 			return prop;  in get_property_by_label()
454 				struct node **node, struct property **prop)  in get_marker_label()  argument
463 		*prop = p;  in get_marker_label()
471 		m = get_marker_label(c, label, node, prop);  in get_marker_label()
476 	*prop = NULL;  in get_marker_label()
686 	struct property *prop, **tbl;  in sort_properties()  local
688 	for_each_property_withdel(node, prop)  in sort_properties()
696 	for_each_property_withdel(node, prop)  in sort_properties()
697 		tbl[i++] = prop;  in sort_properties()
844 	struct property *prop;  in any_fixup_tree()  local
847 	for_each_property(node, prop) {  in any_fixup_tree()
848 		m = prop->val.markers;  in any_fixup_tree()
864 			    struct node *node, struct property *prop,  in add_fixup_entry()  argument
873 	if (strchr(node->fullpath, ':') || strchr(prop->name, ':'))  in add_fixup_entry()
877 			node->fullpath, prop->name, m->offset);  in add_fixup_entry()
889 	struct property *prop;  in generate_fixups_tree_internal()  local
893 	for_each_property(node, prop) {  in generate_fixups_tree_internal()
894 		m = prop->val.markers;  in generate_fixups_tree_internal()
898 				add_fixup_entry(dti, fn, node, prop, m);  in generate_fixups_tree_internal()
909 	struct property *prop;  in any_local_fixup_tree()  local
912 	for_each_property(node, prop) {  in any_local_fixup_tree()
913 		m = prop->val.markers;  in any_local_fixup_tree()
930 		struct property *prop, struct marker *m,  in add_local_fixup_entry()  argument
961 	append_to_property(wn, prop->name, &value_32, sizeof(value_32));  in add_local_fixup_entry()
970 	struct property *prop;  in generate_local_fixups_tree_internal()  local
974 	for_each_property(node, prop) {  in generate_local_fixups_tree_internal()
975 		m = prop->val.markers;  in generate_local_fixups_tree_internal()
979 				add_local_fixup_entry(dti, lfn, node, prop, m, refnode);  in generate_local_fixups_tree_internal()