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()
139 node->omit_if_unused = 1; in omit_node_if_unused()
146 node->is_referenced = 1; in reference_node()
157 old_node->deleted = 0; in merge_nodes()
160 for_each_label_withdel(new_node->labels, l) in merge_nodes()
161 add_label(&old_node->labels, l->label); in merge_nodes()
165 while (new_node->proplist) { in merge_nodes()
167 new_prop = new_node->proplist; in merge_nodes()
168 new_node->proplist = new_prop->next; in merge_nodes()
169 new_prop->next = NULL; in merge_nodes()
171 if (new_prop->deleted) { in merge_nodes()
172 delete_property_by_name(old_node, new_prop->name); in merge_nodes()
179 if (streq(old_prop->name, new_prop->name)) { in merge_nodes()
181 for_each_label_withdel(new_prop->labels, l) in merge_nodes()
182 add_label(&old_prop->labels, l->label); in merge_nodes()
184 old_prop->val = new_prop->val; in merge_nodes()
185 old_prop->deleted = 0; in merge_nodes()
197 /* Move the override child nodes into the primary node. If in merge_nodes()
199 while (new_node->children) { in merge_nodes()
201 new_child = new_node->children; in merge_nodes()
202 new_node->children = new_child->next_sibling; in merge_nodes()
203 new_child->parent = NULL; in merge_nodes()
204 new_child->next_sibling = NULL; in merge_nodes()
206 if (new_child->deleted) { in merge_nodes()
207 delete_node_by_name(old_node, new_child->name); in merge_nodes()
214 if (streq(old_child->name, new_child->name)) { in merge_nodes()
244 p = build_property("target-path", d); in add_orphan_node()
264 assert(first->next_sibling == NULL); in chain_node()
266 first->next_sibling = list; in chain_node()
274 prop->next = NULL; in add_property()
276 p = &node->proplist; in add_property()
278 p = &((*p)->next); in add_property()
285 struct property *prop = node->proplist; in delete_property_by_name()
288 if (streq(prop->name, name)) { in delete_property_by_name()
292 prop = prop->next; in delete_property_by_name()
298 prop->deleted = 1; in delete_property()
299 delete_labels(&prop->labels); in delete_property()
306 child->next_sibling = NULL; in add_child()
307 child->parent = parent; in add_child()
309 p = &parent->children; in add_child()
311 p = &((*p)->next_sibling); in add_child()
318 struct node *node = parent->children; in delete_node_by_name()
321 if (streq(node->name, name)) { in delete_node_by_name()
325 node = node->next_sibling; in delete_node_by_name()
334 node->deleted = 1; in delete_node()
339 delete_labels(&node->labels); in delete_node()
350 d = data_append_data(p->val, data, len); in append_to_property()
351 p->val = d; in append_to_property()
365 new->address = address; in build_reserve_entry()
366 new->size = size; in build_reserve_entry()
374 assert(first->next == NULL); in chain_reserve_entry()
376 first->next = list; in chain_reserve_entry()
385 new->next = NULL; in add_reserve_entry()
390 for (last = list; last->next; last = last->next) in add_reserve_entry()
393 last->next = new; in add_reserve_entry()
405 dti->dtsflags = dtsflags; in build_dt_info()
406 dti->reservelist = reservelist; in build_dt_info()
407 dti->dt = tree; in build_dt_info()
408 dti->boot_cpuid_phys = boot_cpuid_phys; in build_dt_info()
419 if (node->name[node->basenamelen] == '\0') in get_unitname()
422 return node->name + node->basenamelen + 1; in get_unitname()
430 if (streq(prop->name, propname)) in get_property()
438 assert(prop->val.len == sizeof(cell_t)); in propval_cell()
439 return fdt32_to_cpu(*((fdt32_t *)prop->val.val)); in propval_cell()
444 assert(prop->val.len / sizeof(cell_t) >= n); in propval_cell_n()
445 return fdt32_to_cpu(*((fdt32_t *)prop->val.val + n)); in propval_cell_n()
459 for_each_label(prop->labels, l) in get_property_by_label()
460 if (streq(l->label, label)) in get_property_by_label()
485 m = p->val.markers; in get_marker_label()
487 if (streq(m->ref, label)) in get_marker_label()
507 if (streq(child->name, nodename)) in get_subnode()
519 if (tree->deleted) in get_node_by_path()
530 if (p && (strlen(child->name) == p-path) && in get_node_by_path()
531 strprefixeq(path, p - path, child->name)) in get_node_by_path()
533 else if (!p && streq(path, child->name)) in get_node_by_path()
547 for_each_label(tree->labels, l) in get_node_by_label()
548 if (streq(l->label, label)) in get_node_by_label()
564 if ((phandle == 0) || (phandle == -1)) { in get_node_by_phandle()
569 if (tree->phandle == phandle) { in get_node_by_phandle()
570 if (tree->deleted) in get_node_by_phandle()
598 if ((node->phandle != 0) && (node->phandle != -1)) in get_node_phandle()
599 return node->phandle; in get_node_phandle()
604 node->phandle = phandle; in get_node_phandle()
619 * be dealing with a self-referencing phandle, which will be in get_node_phandle()
622 return node->phandle; in get_node_phandle()
635 bootcpu = cpus->children; in guess_boot_cpuid()
640 if (!reg || (reg->val.len != sizeof(uint32_t))) in guess_boot_cpuid()
655 if (a->address < b->address) in cmp_reserve_info()
656 return -1; in cmp_reserve_info()
657 else if (a->address > b->address) in cmp_reserve_info()
659 else if (a->size < b->size) in cmp_reserve_info()
660 return -1; in cmp_reserve_info()
661 else if (a->size > b->size) in cmp_reserve_info()
669 struct reserve_info *ri, **tbl; in sort_reserve_entries() local
672 for (ri = dti->reservelist; in sort_reserve_entries()
673 ri; in sort_reserve_entries()
674 ri = ri->next) in sort_reserve_entries()
682 for (ri = dti->reservelist; in sort_reserve_entries()
683 ri; in sort_reserve_entries()
684 ri = ri->next) in sort_reserve_entries()
685 tbl[i++] = ri; in sort_reserve_entries()
689 dti->reservelist = tbl[0]; in sort_reserve_entries()
690 for (i = 0; i < (n-1); i++) in sort_reserve_entries()
691 tbl[i]->next = tbl[i+1]; in sort_reserve_entries()
692 tbl[n-1]->next = NULL; in sort_reserve_entries()
704 return strcmp(a->name, b->name); in cmp_prop()
725 node->proplist = tbl[0]; in sort_properties()
726 for (i = 0; i < (n-1); i++) in sort_properties()
727 tbl[i]->next = tbl[i+1]; in sort_properties()
728 tbl[n-1]->next = NULL; in sort_properties()
740 return strcmp(a->name, b->name); in cmp_subnode()
761 node->children = tbl[0]; in sort_subnodes()
762 for (i = 0; i < (n-1); i++) in sort_subnodes()
763 tbl[i]->next_sibling = tbl[i+1]; in sort_subnodes()
764 tbl[n-1]->next_sibling = NULL; in sort_subnodes()
782 sort_node(dti->dt); in sort_tree()
815 if (node->labels) in any_label_tree()
829 struct node *dt = dti->dt; in generate_label_tree_internal()
835 if (node->labels) { in generate_label_tree_internal()
838 for_each_label(node->labels, l) { in generate_label_tree_internal()
841 p = get_property(an, l->label); in generate_label_tree_internal()
844 " exists in /%s", l->label, in generate_label_tree_internal()
845 an->name); in generate_label_tree_internal()
850 p = build_property(l->label, in generate_label_tree_internal()
851 data_copy_mem(node->fullpath, in generate_label_tree_internal()
852 strlen(node->fullpath) + 1)); in generate_label_tree_internal()
872 m = prop->val.markers; in any_fixup_tree()
874 if (!get_node_by_ref(dti->dt, m->ref)) in any_fixup_tree()
893 /* m->ref can only be a REF_PHANDLE, but check anyway */ in add_fixup_entry()
894 assert(m->type == REF_PHANDLE); in add_fixup_entry()
897 if (strchr(node->fullpath, ':') || strchr(prop->name, ':')) in add_fixup_entry()
901 node->fullpath, prop->name, m->offset); in add_fixup_entry()
902 append_to_property(fn, m->ref, entry, strlen(entry) + 1); in add_fixup_entry()
911 struct node *dt = dti->dt; in generate_fixups_tree_internal()
918 m = prop->val.markers; in generate_fixups_tree_internal()
920 refnode = get_node_by_ref(dt, m->ref); in generate_fixups_tree_internal()
937 m = prop->val.markers; in any_local_fixup_tree()
939 if (get_node_by_ref(dti->dt, m->ref)) in any_local_fixup_tree()
964 for (wn = node; wn; wn = wn->parent) in add_local_fixup_entry()
971 for (wn = node, i = depth - 1; wn; wn = wn->parent, i--) in add_local_fixup_entry()
972 compp[i] = wn->name; in add_local_fixup_entry()
984 value_32 = cpu_to_fdt32(m->offset); in add_local_fixup_entry()
985 append_to_property(wn, prop->name, &value_32, sizeof(value_32)); in add_local_fixup_entry()
992 struct node *dt = dti->dt; in generate_local_fixups_tree_internal()
999 m = prop->val.markers; in generate_local_fixups_tree_internal()
1001 refnode = get_node_by_ref(dt, m->ref); in generate_local_fixups_tree_internal()
1013 if (!any_label_tree(dti, dti->dt)) in generate_label_tree()
1015 generate_label_tree_internal(dti, build_root_node(dti->dt, name), in generate_label_tree()
1016 dti->dt, allocph); in generate_label_tree()
1021 if (!any_fixup_tree(dti, dti->dt)) in generate_fixups_tree()
1023 generate_fixups_tree_internal(dti, build_root_node(dti->dt, name), in generate_fixups_tree()
1024 dti->dt); in generate_fixups_tree()
1029 if (!any_local_fixup_tree(dti, dti->dt)) in generate_local_fixups_tree()
1031 generate_local_fixups_tree_internal(dti, build_root_node(dti->dt, name), in generate_local_fixups_tree()
1032 dti->dt); in generate_local_fixups_tree()