Home
last modified time | relevance | path

Searched refs:name_node (Results 1 – 13 of 13) sorted by relevance

/openbmc/linux/scripts/dtc/
H A Dfstree.c57 newchild = name_node(newchild, xstrdup(de->d_name)); in read_fstree()
73 tree = name_node(tree, ""); in dt_from_fs()
H A Ddtc-parser.y163 $$ = name_node($2, "");
181 name_node(build_node(NULL, NULL, NULL),
572 $$ = name_node($2, $1);
576 $$ = name_node(build_node_delete(&@$), $2);
H A Dlivetree.c119 struct node *name_node(struct node *node, char *name) in name_node() function
250 name_node(new_node, "__overlay__"); in add_orphan_node()
252 name_node(node, name); in add_orphan_node()
816 name_node(node, xstrdup(name)); in build_and_name_child_node()
H A Ddtc.h272 struct node *name_node(struct node *node, char *name);
/openbmc/u-boot/scripts/dtc/
H A Dfstree.c71 newchild = name_node(newchild, xstrdup(de->d_name)); in read_fstree()
87 tree = name_node(tree, ""); in dt_from_fs()
H A Ddtc-parser.y163 $$ = name_node($2, "");
178 $$ = add_orphan_node(name_node(build_node(NULL, NULL), ""), $2, $1);
520 $$ = name_node($2, $1);
524 $$ = name_node(build_node_delete(), $2);
H A Dlivetree.c128 struct node *name_node(struct node *node, char *name) in name_node() function
234 name_node(new_node, "__overlay__"); in add_orphan_node()
236 name_node(node, name); in add_orphan_node()
771 name_node(node, xstrdup(name)); in build_and_name_child_node()
H A Ddtc.h204 struct node *name_node(struct node *node, char *name);
/openbmc/linux/net/core/
H A Ddev.c257 struct netdev_name_node *name_node; in netdev_name_node_alloc() local
259 name_node = kmalloc(sizeof(*name_node), GFP_KERNEL); in netdev_name_node_alloc()
260 if (!name_node) in netdev_name_node_alloc()
262 INIT_HLIST_NODE(&name_node->hlist); in netdev_name_node_alloc()
263 name_node->dev = dev; in netdev_name_node_alloc()
264 name_node->name = name; in netdev_name_node_alloc()
265 return name_node; in netdev_name_node_alloc()
271 struct netdev_name_node *name_node; in netdev_name_node_head_alloc() local
273 name_node = netdev_name_node_alloc(dev, dev->name); in netdev_name_node_head_alloc()
274 if (!name_node) in netdev_name_node_head_alloc()
[all …]
H A Ddev.h66 list_for_each_entry((namenode), &(dev)->name_node->list, list)
68 list_for_each_entry_safe((namenode), (next), &(dev)->name_node->list, \
H A Drtnetlink.c1056 struct netdev_name_node *name_node; in rtnl_prop_list_size() local
1059 if (list_empty(&dev->name_node->list)) in rtnl_prop_list_size()
1062 list_for_each_entry(name_node, &dev->name_node->list, list) in rtnl_prop_list_size()
1720 struct netdev_name_node *name_node; in rtnl_fill_alt_ifnames() local
1723 list_for_each_entry(name_node, &dev->name_node->list, list) { in rtnl_fill_alt_ifnames()
1724 if (nla_put_string(skb, IFLA_ALT_IFNAME, name_node->name)) in rtnl_fill_alt_ifnames()
/openbmc/linux/drivers/md/
H A Ddm-ioctl.c45 struct rb_node name_node; member
94 struct hash_cell *hc = container_of(n, struct hash_cell, name_node); in __get_name_cell()
131 rb_erase(&hc->name_node, &name_rb_tree); in __unlink_name()
155 struct hash_cell *hc = container_of(*n, struct hash_cell, name_node); in __link_name()
161 n = c >= 0 ? &hc->name_node.rb_left : &hc->name_node.rb_right; in __link_name()
164 rb_link_node(&new_hc->name_node, parent, n); in __link_name()
165 rb_insert_color(&new_hc->name_node, &name_rb_tree); in __link_name()
350 hc = container_of(n, struct hash_cell, name_node); in dm_hash_remove_all()
607 hc = container_of(n, struct hash_cell, name_node); in list_devices()
634 hc = container_of(n, struct hash_cell, name_node); in list_devices()
/openbmc/linux/include/linux/
H A Dnetdevice.h2069 struct netdev_name_node *name_node; member