266 void add_property(struct node *node, struct property *prop)  in add_property()  argument
270 	prop->next = NULL;  in add_property()
276 	*p = prop;  in add_property()
281 	struct property *prop = node->proplist;  in delete_property_by_name()  local
283 	while (prop) {  in delete_property_by_name()
284 		if (streq(prop->name, name)) {  in delete_property_by_name()
285 			delete_property(prop);  in delete_property_by_name()
288 		prop = prop->next;  in delete_property_by_name()
292 void delete_property(struct property *prop)  in delete_property()  argument
294 	prop->deleted = 1;  in delete_property()
295 	delete_labels(&prop->labels);  in delete_property()
327 	struct property *prop;  in delete_node()  local
333 	for_each_property(node, prop)  in delete_node()
334 		delete_property(prop);  in delete_node()
426 	struct property *prop;  in get_property()  local
428 	for_each_property(node, prop)  in get_property()
429 		if (streq(prop->name, propname))  in get_property()
430 			return prop;  in get_property()
435 cell_t propval_cell(struct property *prop)  in propval_cell()  argument
437 	assert(prop->val.len == sizeof(cell_t));  in propval_cell()
438 	return fdt32_to_cpu(*((fdt32_t *)prop->val.val));  in propval_cell()
441 cell_t propval_cell_n(struct property *prop, int n)  in propval_cell_n()  argument
443 	assert(prop->val.len / sizeof(cell_t) >= n);  in propval_cell_n()
444 	return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n));  in propval_cell_n()
450 	struct property *prop;  in get_property_by_label()  local
455 	for_each_property(tree, prop) {  in get_property_by_label()
458 		for_each_label(prop->labels, l)  in get_property_by_label()
460 				return prop;  in get_property_by_label()
464 		prop = get_property_by_label(c, label, node);  in get_property_by_label()
465 		if (prop)  in get_property_by_label()
466 			return prop;  in get_property_by_label()
474 				struct node **node, struct property **prop)  in get_marker_label()  argument
483 		*prop = p;  in get_marker_label()
491 		m = get_marker_label(c, label, node, prop);  in get_marker_label()
496 	*prop = NULL;  in get_marker_label()
708 	struct property *prop, **tbl;  in sort_properties()  local
710 	for_each_property_withdel(node, prop)  in sort_properties()
718 	for_each_property_withdel(node, prop)  in sort_properties()
719 		tbl[i++] = prop;  in sort_properties()
867 	struct property *prop;  in any_fixup_tree()  local
870 	for_each_property(node, prop) {  in any_fixup_tree()
871 		m = prop->val.markers;  in any_fixup_tree()
887 			    struct node *node, struct property *prop,  in add_fixup_entry()  argument
896 	if (strchr(node->fullpath, ':') || strchr(prop->name, ':'))  in add_fixup_entry()
900 			node->fullpath, prop->name, m->offset);  in add_fixup_entry()
912 	struct property *prop;  in generate_fixups_tree_internal()  local
916 	for_each_property(node, prop) {  in generate_fixups_tree_internal()
917 		m = prop->val.markers;  in generate_fixups_tree_internal()
921 				add_fixup_entry(dti, fn, node, prop, m);  in generate_fixups_tree_internal()
932 	struct property *prop;  in any_local_fixup_tree()  local
935 	for_each_property(node, prop) {  in any_local_fixup_tree()
936 		m = prop->val.markers;  in any_local_fixup_tree()
953 		struct property *prop, struct marker *m,  in add_local_fixup_entry()  argument
984 	append_to_property(wn, prop->name, &value_32, sizeof(value_32), TYPE_UINT32);  in add_local_fixup_entry()
993 	struct property *prop;  in generate_local_fixups_tree_internal()  local
997 	for_each_property(node, prop) {  in generate_local_fixups_tree_internal()
998 		m = prop->val.markers;  in generate_local_fixups_tree_internal()
1002 				add_local_fixup_entry(dti, lfn, node, prop, m, refnode);  in generate_local_fixups_tree_internal()