Lines Matching refs:name
39 struct property *build_property(char *name, struct data val,
46 new->name = name;
53 struct property *build_property_delete(char *name)
59 new->name = name;
119 struct node *name_node(struct node *node, char *name)
121 assert(node->name == NULL);
123 node->name = name;
163 delete_property_by_name(old_node, new_prop->name);
170 if (streq(old_prop->name, new_prop->name)) {
200 delete_node_by_name(old_node, new_child->name);
207 if (streq(old_child->name, new_child->name)) {
234 char *name;
248 xasprintf(&name, "fragment@%u",
252 name_node(node, name);
279 void delete_property_by_name(struct node *node, char *name)
284 if (streq(prop->name, name)) {
312 void delete_node_by_name(struct node *parent, char *name)
317 if (streq(node->name, name)) {
339 char *name, const void *data, int len,
345 p = get_property(node, name);
347 d = data_add_marker(p->val, type, name);
351 d = data_add_marker(empty_data, type, name);
353 p = build_property(name, d, NULL);
418 if (node->name[node->basenamelen] == '\0')
421 return node->name + node->basenamelen + 1;
429 if (streq(prop->name, propname))
506 if (streq(child->name, nodename))
529 if (p && strprefixeq(path, (size_t)(p - path), child->name))
531 else if (!p && streq(path, child->name))
729 return strcmp(a->name, b->name);
765 return strcmp(a->name, b->name);
811 static struct node *build_and_name_child_node(struct node *parent, char *name)
816 name_node(node, xstrdup(name));
822 static struct node *build_root_node(struct node *dt, char *name)
826 an = get_subnode(dt, name);
828 an = build_and_name_child_node(dt, name);
831 die("Could not build root node /%s\n", name);
870 an->name);
929 if (strchr(node->fullpath, ':') || strchr(prop->name, ':'))
933 node->fullpath, prop->name, m->offset);
999 /* allocate name array */
1004 compp[i] = wn->name;
1017 append_to_property(wn, prop->name, &value_32, sizeof(value_32), TYPE_UINT32);
1043 void generate_label_tree(struct dt_info *dti, char *name, bool allocph)
1047 generate_label_tree_internal(dti, build_root_node(dti->dt, name),
1051 void generate_fixups_tree(struct dt_info *dti, char *name)
1055 generate_fixups_tree_internal(dti, build_root_node(dti->dt, name),
1059 void generate_local_fixups_tree(struct dt_info *dti, char *name)
1063 generate_local_fixups_tree_internal(dti, build_root_node(dti->dt, name),