39 struct property *build_property(char *name, struct data val,  in build_property()  argument
46 	new->name = name;  in build_property()
53 struct property *build_property_delete(char *name)  in build_property_delete()  argument
59 	new->name = name;  in build_property_delete()
119 struct node *name_node(struct node *node, char *name)  in name_node()  argument
121 	assert(node->name == NULL);  in name_node()
123 	node->name = name;  in name_node()
163 			delete_property_by_name(old_node, new_prop->name);  in merge_nodes()
170 			if (streq(old_prop->name, new_prop->name)) {  in merge_nodes()
200 			delete_node_by_name(old_node, new_child->name);  in merge_nodes()
207 			if (streq(old_child->name, new_child->name)) {  in merge_nodes()
234 	char *name;  in add_orphan_node()  local
248 	xasprintf(&name, "fragment@%u",  in add_orphan_node()
252 	name_node(node, name);  in add_orphan_node()
279 void delete_property_by_name(struct node *node, char *name)  in delete_property_by_name()  argument
284 		if (streq(prop->name, name)) {  in delete_property_by_name()
312 void delete_node_by_name(struct node *parent, char *name)  in delete_node_by_name()  argument
317 		if (streq(node->name, name)) {  in delete_node_by_name()
339 			char *name, const void *data, int len,  in append_to_property()  argument
345 	p = get_property(node, name);  in append_to_property()
347 		d = data_add_marker(p->val, type, name);  in append_to_property()
351 		d = data_add_marker(empty_data, type, name);  in append_to_property()
353 		p = build_property(name, d, NULL);  in append_to_property()
418 	if (node->name[node->basenamelen] == '\0')  in get_unitname()
421 		return node->name + node->basenamelen + 1;  in get_unitname()
429 		if (streq(prop->name, propname))  in get_property()
506 		if (streq(child->name, nodename))  in get_subnode()
529 		if (p && (strlen(child->name) == p-path) &&  in get_node_by_path()
530 		    strprefixeq(path, p - path, child->name))  in get_node_by_path()
532 		else if (!p && streq(path, child->name))  in get_node_by_path()
703 	return strcmp(a->name, b->name);  in cmp_prop()
739 	return strcmp(a->name, b->name);  in cmp_subnode()
785 static struct node *build_and_name_child_node(struct node *parent, char *name)  in build_and_name_child_node()  argument
790 	name_node(node, xstrdup(name));  in build_and_name_child_node()
796 static struct node *build_root_node(struct node *dt, char *name)  in build_root_node()  argument
800 	an = get_subnode(dt, name);  in build_root_node()
802 		an = build_and_name_child_node(dt, name);  in build_root_node()
805 		die("Could not build root node /%s\n", name);  in build_root_node()
844 					an->name);  in generate_label_tree_internal()
897 	if (strchr(node->fullpath, ':') || strchr(prop->name, ':'))  in add_fixup_entry()
901 			node->fullpath, prop->name, m->offset);  in add_fixup_entry()
972 		compp[i] = wn->name;  in add_local_fixup_entry()
985 	append_to_property(wn, prop->name, &value_32, sizeof(value_32), TYPE_UINT32);  in add_local_fixup_entry()
1011 void generate_label_tree(struct dt_info *dti, char *name, bool allocph)  in generate_label_tree()  argument
1015 	generate_label_tree_internal(dti, build_root_node(dti->dt, name),  in generate_label_tree()
1019 void generate_fixups_tree(struct dt_info *dti, char *name)  in generate_fixups_tree()  argument
1023 	generate_fixups_tree_internal(dti, build_root_node(dti->dt, name),  in generate_fixups_tree()
1027 void generate_local_fixups_tree(struct dt_info *dti, char *name)  in generate_local_fixups_tree()  argument
1031 	generate_local_fixups_tree_internal(dti, build_root_node(dti->dt, name),  in generate_local_fixups_tree()