Lines Matching refs:prop
270 void add_property(struct node *node, struct property *prop) in add_property() argument
274 prop->next = NULL; in add_property()
280 *p = prop; in add_property()
285 struct property *prop = node->proplist; in delete_property_by_name() local
287 while (prop) { in delete_property_by_name()
288 if (streq(prop->name, name)) { in delete_property_by_name()
289 delete_property(prop); in delete_property_by_name()
292 prop = prop->next; in delete_property_by_name()
296 void delete_property(struct property *prop) in delete_property() argument
298 prop->deleted = 1; in delete_property()
299 delete_labels(&prop->labels); in delete_property()
331 struct property *prop; in delete_node() local
337 for_each_property(node, prop) in delete_node()
338 delete_property(prop); in delete_node()
427 struct property *prop; in get_property() local
429 for_each_property(node, prop) in get_property()
430 if (streq(prop->name, propname)) in get_property()
431 return prop; in get_property()
436 cell_t propval_cell(struct property *prop) in propval_cell() argument
438 assert(prop->val.len == sizeof(cell_t)); in propval_cell()
439 return fdt32_to_cpu(*((fdt32_t *)prop->val.val)); in propval_cell()
442 cell_t propval_cell_n(struct property *prop, int n) in propval_cell_n() argument
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()
451 struct property *prop; in get_property_by_label() local
456 for_each_property(tree, prop) { in get_property_by_label()
459 for_each_label(prop->labels, l) in get_property_by_label()
461 return prop; in get_property_by_label()
465 prop = get_property_by_label(c, label, node); in get_property_by_label()
466 if (prop) in get_property_by_label()
467 return prop; in get_property_by_label()
475 struct node **node, struct property **prop) in get_marker_label() argument
484 *prop = p; in get_marker_label()
492 m = get_marker_label(c, label, node, prop); in get_marker_label()
497 *prop = NULL; in get_marker_label()
736 struct property *prop, **tbl; in sort_properties() local
738 for_each_property_withdel(node, prop) in sort_properties()
746 for_each_property_withdel(node, prop) in sort_properties()
747 tbl[i++] = prop; in sort_properties()
894 struct property *prop; in any_fixup_tree() local
897 for_each_property(node, prop) { in any_fixup_tree()
898 m = prop->val.markers; in any_fixup_tree()
914 struct node *node, struct property *prop, in add_fixup_entry() argument
923 if (strchr(node->fullpath, ':') || strchr(prop->name, ':')) in add_fixup_entry()
927 node->fullpath, prop->name, m->offset); in add_fixup_entry()
939 struct property *prop; in generate_fixups_tree_internal() local
943 for_each_property(node, prop) { in generate_fixups_tree_internal()
944 m = prop->val.markers; in generate_fixups_tree_internal()
948 add_fixup_entry(dti, fn, node, prop, m); in generate_fixups_tree_internal()
959 struct property *prop; in any_local_fixup_tree() local
962 for_each_property(node, prop) { in any_local_fixup_tree()
963 m = prop->val.markers; in any_local_fixup_tree()
980 struct property *prop, struct marker *m, in add_local_fixup_entry() argument
1011 append_to_property(wn, prop->name, &value_32, sizeof(value_32)); in add_local_fixup_entry()
1020 struct property *prop; in generate_local_fixups_tree_internal() local
1024 for_each_property(node, prop) { in generate_local_fixups_tree_internal()
1025 m = prop->val.markers; in generate_local_fixups_tree_internal()
1029 add_local_fixup_entry(dti, lfn, node, prop, m, refnode); in generate_local_fixups_tree_internal()