1 // SPDX-License-Identifier: GPL-2.0-or-later
19 		if (streq(new->label, label)) {  in add_label()
20 			new->deleted = 0;  in add_label()
26 	new->label = label;  in add_label()
27 	new->next = *labels;  in add_label()
36 		label->deleted = 1;  in delete_labels()
46 	new->name = name;  in build_property()
47 	new->val = val;  in build_property()
48 	new->srcpos = srcpos_copy(srcpos);  in build_property()
59 	new->name = name;  in build_property_delete()
60 	new->deleted = 1;  in build_property_delete()
67 	assert(first->next == NULL);  in chain_property()
69 	first->next = list;  in chain_property()
80 		next = p->next;  in reverse_properties()
81 		p->next = head;  in reverse_properties()
96 	new->proplist = reverse_properties(proplist);  in build_node()
97 	new->children = children;  in build_node()
98 	new->srcpos = srcpos_copy(srcpos);  in build_node()
101 		child->parent = new;  in build_node()
113 	new->deleted = 1;  in build_node_delete()
114 	new->srcpos = srcpos_copy(srcpos);  in build_node_delete()
121 	assert(node->name == NULL);  in name_node()
123 	node->name = name;  in name_node()
130 	node->omit_if_unused = 1;  in omit_node_if_unused()
137 	node->is_referenced = 1;  in reference_node()
148 	old_node->deleted = 0;  in merge_nodes()
151 	for_each_label_withdel(new_node->labels, l)  in merge_nodes()
152 		add_label(&old_node->labels, l->label);  in merge_nodes()
156 	while (new_node->proplist) {  in merge_nodes()
158 		new_prop = new_node->proplist;  in merge_nodes()
159 		new_node->proplist = new_prop->next;  in merge_nodes()
160 		new_prop->next = NULL;  in merge_nodes()
162 		if (new_prop->deleted) {  in merge_nodes()
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()
172 				for_each_label_withdel(new_prop->labels, l)  in merge_nodes()
173 					add_label(&old_prop->labels, l->label);  in merge_nodes()
175 				old_prop->val = new_prop->val;  in merge_nodes()
176 				old_prop->deleted = 0;  in merge_nodes()
177 				free(old_prop->srcpos);  in merge_nodes()
178 				old_prop->srcpos = new_prop->srcpos;  in merge_nodes()
190 	/* Move the override child nodes into the primary node.  If  in merge_nodes()
192 	while (new_node->children) {  in merge_nodes()
194 		new_child = new_node->children;  in merge_nodes()
195 		new_node->children = new_child->next_sibling;  in merge_nodes()
196 		new_child->parent = NULL;  in merge_nodes()
197 		new_child->next_sibling = NULL;  in merge_nodes()
199 		if (new_child->deleted) {  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()
219 	old_node->srcpos = srcpos_extend(old_node->srcpos, new_node->srcpos);  in merge_nodes()
240 		p = build_property("target-path", d, NULL);  in add_orphan_node()
260 	assert(first->next_sibling == NULL);  in chain_node()
262 	first->next_sibling = list;  in chain_node()
270 	prop->next = NULL;  in add_property()
272 	p = &node->proplist;  in add_property()
274 		p = &((*p)->next);  in add_property()
281 	struct property *prop = node->proplist;  in delete_property_by_name()
284 		if (streq(prop->name, name)) {  in delete_property_by_name()
288 		prop = prop->next;  in delete_property_by_name()
294 	prop->deleted = 1;  in delete_property()
295 	delete_labels(&prop->labels);  in delete_property()
302 	child->next_sibling = NULL;  in add_child()
303 	child->parent = parent;  in add_child()
305 	p = &parent->children;  in add_child()
307 		p = &((*p)->next_sibling);  in add_child()
314 	struct node *node = parent->children;  in delete_node_by_name()
317 		if (streq(node->name, name)) {  in delete_node_by_name()
321 		node = node->next_sibling;  in delete_node_by_name()
330 	node->deleted = 1;  in delete_node()
335 	delete_labels(&node->labels);  in delete_node()
347 		d = data_add_marker(p->val, type, name);  in append_to_property()
349 		p->val = d;  in append_to_property()
364 	new->address = address;  in build_reserve_entry()
365 	new->size = size;  in build_reserve_entry()
373 	assert(first->next == NULL);  in chain_reserve_entry()
375 	first->next = list;  in chain_reserve_entry()
384 	new->next = NULL;  in add_reserve_entry()
389 	for (last = list; last->next; last = last->next)  in add_reserve_entry()
392 	last->next = new;  in add_reserve_entry()
404 	dti->dtsflags = dtsflags;  in build_dt_info()
405 	dti->reservelist = reservelist;  in build_dt_info()
406 	dti->dt = tree;  in build_dt_info()
407 	dti->boot_cpuid_phys = boot_cpuid_phys;  in build_dt_info()
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()
437 	assert(prop->val.len == sizeof(cell_t));  in propval_cell()
438 	return fdt32_to_cpu(*((fdt32_t *)prop->val.val));  in propval_cell()
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()
458 		for_each_label(prop->labels, l)  in get_property_by_label()
459 			if (streq(l->label, label))  in get_property_by_label()
484 		m = p->val.markers;  in get_marker_label()
486 			if (streq(m->ref, label))  in get_marker_label()
506 		if (streq(child->name, nodename))  in get_subnode()
518 		if (tree->deleted)  in get_node_by_path()
529 		if (p && strprefixeq(path, (size_t)(p - path), child->name))  in get_node_by_path()
531 		else if (!p && streq(path, child->name))  in get_node_by_path()
545 	for_each_label(tree->labels, l)  in get_node_by_label()
546 		if (streq(l->label, label))  in get_node_by_label()
567 	if (tree->phandle == phandle) {  in get_node_by_phandle()
568 		if (tree->deleted)  in get_node_by_phandle()
597 	if (phandle_is_valid(node->phandle))  in get_node_phandle()
598 		return node->phandle;  in get_node_phandle()
603 	node->phandle = phandle;  in get_node_phandle()
617 	 * be dealing with a self-referencing phandle, which will be  in get_node_phandle()
620 	return node->phandle;  in get_node_phandle()
633 	bootcpu = cpus->children;  in guess_boot_cpuid()
638 	if (!reg || (reg->val.len != sizeof(uint32_t)))  in guess_boot_cpuid()
653 	if (a->address < b->address)  in cmp_reserve_info()
654 		return -1;  in cmp_reserve_info()
655 	else if (a->address > b->address)  in cmp_reserve_info()
657 	else if (a->size < b->size)  in cmp_reserve_info()
658 		return -1;  in cmp_reserve_info()
659 	else if (a->size > b->size)  in cmp_reserve_info()
667 	struct reserve_info *ri, **tbl;  in sort_reserve_entries()  local
670 	for (ri = dti->reservelist;  in sort_reserve_entries()
671 	     ri;  in sort_reserve_entries()
672 	     ri = ri->next)  in sort_reserve_entries()
680 	for (ri = dti->reservelist;  in sort_reserve_entries()
681 	     ri;  in sort_reserve_entries()
682 	     ri = ri->next)  in sort_reserve_entries()
683 		tbl[i++] = ri;  in sort_reserve_entries()
687 	dti->reservelist = tbl[0];  in sort_reserve_entries()
688 	for (i = 0; i < (n-1); i++)  in sort_reserve_entries()
689 		tbl[i]->next = tbl[i+1];  in sort_reserve_entries()
690 	tbl[n-1]->next = NULL;  in sort_reserve_entries()
702 	return strcmp(a->name, b->name);  in cmp_prop()
723 	node->proplist = tbl[0];  in sort_properties()
724 	for (i = 0; i < (n-1); i++)  in sort_properties()
725 		tbl[i]->next = tbl[i+1];  in sort_properties()
726 	tbl[n-1]->next = NULL;  in sort_properties()
738 	return strcmp(a->name, b->name);  in cmp_subnode()
759 	node->children = tbl[0];  in sort_subnodes()
760 	for (i = 0; i < (n-1); i++)  in sort_subnodes()
761 		tbl[i]->next_sibling = tbl[i+1];  in sort_subnodes()
762 	tbl[n-1]->next_sibling = NULL;  in sort_subnodes()
780 	sort_node(dti->dt);  in sort_tree()
813 	if (node->labels)  in any_label_tree()
827 	struct node *dt = dti->dt;  in generate_label_tree_internal()
833 	if (node->labels) {  in generate_label_tree_internal()
836 		for_each_label(node->labels, l) {  in generate_label_tree_internal()
839 			p = get_property(an, l->label);  in generate_label_tree_internal()
842 					" exists in /%s", l->label,  in generate_label_tree_internal()
843 					an->name);  in generate_label_tree_internal()
848 			p = build_property(l->label,  in generate_label_tree_internal()
849 				data_copy_escape_string(node->fullpath,  in generate_label_tree_internal()
850 						strlen(node->fullpath)),  in generate_label_tree_internal()
871 		m = prop->val.markers;  in any_fixup_tree()
873 			if (!get_node_by_ref(dti->dt, m->ref))  in any_fixup_tree()
892 	/* m->ref can only be a REF_PHANDLE, but check anyway */  in add_fixup_entry()
893 	assert(m->type == REF_PHANDLE);  in add_fixup_entry()
896 	if (strchr(node->fullpath, ':') || strchr(prop->name, ':'))  in add_fixup_entry()
900 			node->fullpath, prop->name, m->offset);  in add_fixup_entry()
901 	append_to_property(fn, m->ref, entry, strlen(entry) + 1, TYPE_STRING);  in add_fixup_entry()
910 	struct node *dt = dti->dt;  in generate_fixups_tree_internal()
917 		m = prop->val.markers;  in generate_fixups_tree_internal()
919 			refnode = get_node_by_ref(dt, m->ref);  in generate_fixups_tree_internal()
936 		m = prop->val.markers;  in any_local_fixup_tree()
938 			if (get_node_by_ref(dti->dt, m->ref))  in any_local_fixup_tree()
963 	for (wn = node; wn; wn = wn->parent)  in add_local_fixup_entry()
970 	for (wn = node, i = depth - 1; wn; wn = wn->parent, i--)  in add_local_fixup_entry()
971 		compp[i] = wn->name;  in add_local_fixup_entry()
983 	value_32 = cpu_to_fdt32(m->offset);  in add_local_fixup_entry()
984 	append_to_property(wn, prop->name, &value_32, sizeof(value_32), TYPE_UINT32);  in add_local_fixup_entry()
991 	struct node *dt = dti->dt;  in generate_local_fixups_tree_internal()
998 		m = prop->val.markers;  in generate_local_fixups_tree_internal()
1000 			refnode = get_node_by_ref(dt, m->ref);  in generate_local_fixups_tree_internal()
1012 	if (!any_label_tree(dti, dti->dt))  in generate_label_tree()
1014 	generate_label_tree_internal(dti, build_root_node(dti->dt, name),  in generate_label_tree()
1015 				     dti->dt, allocph);  in generate_label_tree()
1020 	if (!any_fixup_tree(dti, dti->dt))  in generate_fixups_tree()
1022 	generate_fixups_tree_internal(dti, build_root_node(dti->dt, name),  in generate_fixups_tree()
1023 				      dti->dt);  in generate_fixups_tree()
1028 	if (!any_local_fixup_tree(dti, dti->dt))  in generate_local_fixups_tree()
1030 	generate_local_fixups_tree_internal(dti, build_root_node(dti->dt, name),  in generate_local_fixups_tree()
1031 					    dti->dt);  in generate_local_fixups_tree()