Lines Matching +full:ri +full:- +full:override
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
33 if (streq(new->label, label)) { in add_label()
34 new->deleted = 0; in add_label()
40 new->label = label; in add_label()
41 new->next = *labels; in add_label()
50 label->deleted = 1; in delete_labels()
59 new->name = name; in build_property()
60 new->val = val; in build_property()
71 new->name = name; in build_property_delete()
72 new->deleted = 1; in build_property_delete()
79 assert(first->next == NULL); in chain_property()
81 first->next = list; in chain_property()
92 next = p->next; in reverse_properties()
93 p->next = head; in reverse_properties()
107 new->proplist = reverse_properties(proplist); in build_node()
108 new->children = children; in build_node()
111 child->parent = new; in build_node()
123 new->deleted = 1; in build_node_delete()
130 assert(node->name == NULL); in name_node()
132 node->name = name; in name_node()
143 old_node->deleted = 0; in merge_nodes()
146 for_each_label_withdel(new_node->labels, l) in merge_nodes()
147 add_label(&old_node->labels, l->label); in merge_nodes()
151 while (new_node->proplist) { in merge_nodes()
153 new_prop = new_node->proplist; in merge_nodes()
154 new_node->proplist = new_prop->next; in merge_nodes()
155 new_prop->next = NULL; in merge_nodes()
157 if (new_prop->deleted) { in merge_nodes()
158 delete_property_by_name(old_node, new_prop->name); in merge_nodes()
165 if (streq(old_prop->name, new_prop->name)) { in merge_nodes()
167 for_each_label_withdel(new_prop->labels, l) in merge_nodes()
168 add_label(&old_prop->labels, l->label); in merge_nodes()
170 old_prop->val = new_prop->val; in merge_nodes()
171 old_prop->deleted = 0; in merge_nodes()
183 /* Move the override child nodes into the primary node. If in merge_nodes()
185 while (new_node->children) { in merge_nodes()
187 new_child = new_node->children; in merge_nodes()
188 new_node->children = new_child->next_sibling; in merge_nodes()
189 new_child->parent = NULL; in merge_nodes()
190 new_child->next_sibling = NULL; in merge_nodes()
192 if (new_child->deleted) { in merge_nodes()
193 delete_node_by_name(old_node, new_child->name); in merge_nodes()
200 if (streq(old_child->name, new_child->name)) { in merge_nodes()
243 assert(first->next_sibling == NULL); in chain_node()
245 first->next_sibling = list; in chain_node()
253 prop->next = NULL; in add_property()
255 p = &node->proplist; in add_property()
257 p = &((*p)->next); in add_property()
264 struct property *prop = node->proplist; in delete_property_by_name()
267 if (streq(prop->name, name)) { in delete_property_by_name()
271 prop = prop->next; in delete_property_by_name()
277 prop->deleted = 1; in delete_property()
278 delete_labels(&prop->labels); in delete_property()
285 child->next_sibling = NULL; in add_child()
286 child->parent = parent; in add_child()
288 p = &parent->children; in add_child()
290 p = &((*p)->next_sibling); in add_child()
297 struct node *node = parent->children; in delete_node_by_name()
300 if (streq(node->name, name)) { in delete_node_by_name()
304 node = node->next_sibling; in delete_node_by_name()
313 node->deleted = 1; in delete_node()
318 delete_labels(&node->labels); in delete_node()
329 d = data_append_data(p->val, data, len); in append_to_property()
330 p->val = d; in append_to_property()
344 new->address = address; in build_reserve_entry()
345 new->size = size; in build_reserve_entry()
353 assert(first->next == NULL); in chain_reserve_entry()
355 first->next = list; in chain_reserve_entry()
364 new->next = NULL; in add_reserve_entry()
369 for (last = list; last->next; last = last->next) in add_reserve_entry()
372 last->next = new; in add_reserve_entry()
384 dti->dtsflags = dtsflags; in build_dt_info()
385 dti->reservelist = reservelist; in build_dt_info()
386 dti->dt = tree; in build_dt_info()
387 dti->boot_cpuid_phys = boot_cpuid_phys; in build_dt_info()
398 if (node->name[node->basenamelen] == '\0') in get_unitname()
401 return node->name + node->basenamelen + 1; in get_unitname()
409 if (streq(prop->name, propname)) in get_property()
417 assert(prop->val.len == sizeof(cell_t)); in propval_cell()
418 return fdt32_to_cpu(*((fdt32_t *)prop->val.val)); in propval_cell()
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()
438 for_each_label(prop->labels, l) in get_property_by_label()
439 if (streq(l->label, label)) in get_property_by_label()
464 m = p->val.markers; in get_marker_label()
466 if (streq(m->ref, label)) in get_marker_label()
486 if (streq(child->name, nodename)) in get_subnode()
498 if (tree->deleted) in get_node_by_path()
509 if (p && (strlen(child->name) == p-path) && in get_node_by_path()
510 strneq(path, child->name, p-path)) in get_node_by_path()
512 else if (!p && streq(path, child->name)) in get_node_by_path()
526 for_each_label(tree->labels, l) in get_node_by_label()
527 if (streq(l->label, label)) in get_node_by_label()
543 assert((phandle != 0) && (phandle != -1)); in get_node_by_phandle()
545 if (tree->phandle == phandle) { in get_node_by_phandle()
546 if (tree->deleted) in get_node_by_phandle()
574 if ((node->phandle != 0) && (node->phandle != -1)) in get_node_phandle()
575 return node->phandle; in get_node_phandle()
580 node->phandle = phandle; in get_node_phandle()
595 * be dealing with a self-referencing phandle, which will be in get_node_phandle()
598 return node->phandle; in get_node_phandle()
611 bootcpu = cpus->children; in guess_boot_cpuid()
616 if (!reg || (reg->val.len != sizeof(uint32_t))) in guess_boot_cpuid()
631 if (a->address < b->address) in cmp_reserve_info()
632 return -1; in cmp_reserve_info()
633 else if (a->address > b->address) in cmp_reserve_info()
635 else if (a->size < b->size) in cmp_reserve_info()
636 return -1; in cmp_reserve_info()
637 else if (a->size > b->size) in cmp_reserve_info()
645 struct reserve_info *ri, **tbl; in sort_reserve_entries() local
648 for (ri = dti->reservelist; in sort_reserve_entries()
649 ri; in sort_reserve_entries()
650 ri = ri->next) in sort_reserve_entries()
658 for (ri = dti->reservelist; in sort_reserve_entries()
659 ri; in sort_reserve_entries()
660 ri = ri->next) in sort_reserve_entries()
661 tbl[i++] = ri; in sort_reserve_entries()
665 dti->reservelist = tbl[0]; in sort_reserve_entries()
666 for (i = 0; i < (n-1); i++) in sort_reserve_entries()
667 tbl[i]->next = tbl[i+1]; in sort_reserve_entries()
668 tbl[n-1]->next = NULL; in sort_reserve_entries()
680 return strcmp(a->name, b->name); in cmp_prop()
701 node->proplist = tbl[0]; in sort_properties()
702 for (i = 0; i < (n-1); i++) in sort_properties()
703 tbl[i]->next = tbl[i+1]; in sort_properties()
704 tbl[n-1]->next = NULL; in sort_properties()
716 return strcmp(a->name, b->name); in cmp_subnode()
737 node->children = tbl[0]; in sort_subnodes()
738 for (i = 0; i < (n-1); i++) in sort_subnodes()
739 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
740 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
758 sort_node(dti->dt); in sort_tree()
791 if (node->labels) in any_label_tree()
805 struct node *dt = dti->dt; in generate_label_tree_internal()
811 if (node->labels) { in generate_label_tree_internal()
814 for_each_label(node->labels, l) { in generate_label_tree_internal()
817 p = get_property(an, l->label); in generate_label_tree_internal()
820 " exists in /%s", l->label, in generate_label_tree_internal()
821 an->name); in generate_label_tree_internal()
826 p = build_property(l->label, in generate_label_tree_internal()
827 data_copy_mem(node->fullpath, in generate_label_tree_internal()
828 strlen(node->fullpath) + 1)); in generate_label_tree_internal()
848 m = prop->val.markers; in any_fixup_tree()
850 if (!get_node_by_ref(dti->dt, m->ref)) in any_fixup_tree()
869 /* m->ref can only be a REF_PHANDLE, but check anyway */ in add_fixup_entry()
870 assert(m->type == REF_PHANDLE); in add_fixup_entry()
873 if (strchr(node->fullpath, ':') || strchr(prop->name, ':')) in add_fixup_entry()
877 node->fullpath, prop->name, m->offset); in add_fixup_entry()
878 append_to_property(fn, m->ref, entry, strlen(entry) + 1); in add_fixup_entry()
887 struct node *dt = dti->dt; in generate_fixups_tree_internal()
894 m = prop->val.markers; in generate_fixups_tree_internal()
896 refnode = get_node_by_ref(dt, m->ref); in generate_fixups_tree_internal()
913 m = prop->val.markers; in any_local_fixup_tree()
915 if (get_node_by_ref(dti->dt, m->ref)) in any_local_fixup_tree()
940 for (wn = node; wn; wn = wn->parent) in add_local_fixup_entry()
947 for (wn = node, i = depth - 1; wn; wn = wn->parent, i--) in add_local_fixup_entry()
948 compp[i] = wn->name; in add_local_fixup_entry()
960 value_32 = cpu_to_fdt32(m->offset); in add_local_fixup_entry()
961 append_to_property(wn, prop->name, &value_32, sizeof(value_32)); in add_local_fixup_entry()
968 struct node *dt = dti->dt; in generate_local_fixups_tree_internal()
975 m = prop->val.markers; in generate_local_fixups_tree_internal()
977 refnode = get_node_by_ref(dt, m->ref); in generate_local_fixups_tree_internal()
989 if (!any_label_tree(dti, dti->dt)) in generate_label_tree()
991 generate_label_tree_internal(dti, build_root_node(dti->dt, name), in generate_label_tree()
992 dti->dt, allocph); in generate_label_tree()
997 if (!any_fixup_tree(dti, dti->dt)) in generate_fixups_tree()
999 generate_fixups_tree_internal(dti, build_root_node(dti->dt, name), in generate_fixups_tree()
1000 dti->dt); in generate_fixups_tree()
1005 if (!any_local_fixup_tree(dti, dti->dt)) in generate_local_fixups_tree()
1007 generate_local_fixups_tree_internal(dti, build_root_node(dti->dt, name), in generate_local_fixups_tree()
1008 dti->dt); in generate_local_fixups_tree()