Home
last modified time | relevance | path

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

/linux-6.1.9/scripts/dtc/
Dfstree.c57 newchild = name_node(newchild, xstrdup(de->d_name)); in read_fstree()
73 tree = name_node(tree, ""); in dt_from_fs()
Ddtc-parser.y157 $$ = name_node($2, "");
173 name_node(build_node(NULL, NULL, NULL),
554 $$ = name_node($2, $1);
558 $$ = name_node(build_node_delete(&@$), $2);
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()
789 name_node(node, xstrdup(name)); in build_and_name_child_node()
Ddtc.h272 struct node *name_node(struct node *node, char *name);
/linux-6.1.9/net/core/
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 …]
Drtnetlink.c1020 struct netdev_name_node *name_node; in rtnl_prop_list_size() local
1023 if (list_empty(&dev->name_node->list)) in rtnl_prop_list_size()
1026 list_for_each_entry(name_node, &dev->name_node->list, list) in rtnl_prop_list_size()
1669 struct netdev_name_node *name_node; in rtnl_fill_alt_ifnames() local
1672 list_for_each_entry(name_node, &dev->name_node->list, list) { in rtnl_fill_alt_ifnames()
1673 if (nla_put_string(skb, IFLA_ALT_IFNAME, name_node->name)) in rtnl_fill_alt_ifnames()
/linux-6.1.9/drivers/md/
Ddm-ioctl.c42 struct rb_node name_node; member
89 struct hash_cell *hc = container_of(n, struct hash_cell, name_node); in __get_name_cell()
122 rb_erase(&hc->name_node, &name_rb_tree); in __unlink_name()
146 struct hash_cell *hc = container_of(*n, struct hash_cell, name_node); in __link_name()
150 n = c >= 0 ? &hc->name_node.rb_left : &hc->name_node.rb_right; in __link_name()
153 rb_link_node(&new_hc->name_node, parent, n); in __link_name()
154 rb_insert_color(&new_hc->name_node, &name_rb_tree); in __link_name()
333 hc = container_of(n, struct hash_cell, name_node); in dm_hash_remove_all()
589 hc = container_of(n, struct hash_cell, name_node); in list_devices()
615 hc = container_of(n, struct hash_cell, name_node); in list_devices()
/linux-6.1.9/include/linux/
Dnetdevice.h2015 struct netdev_name_node *name_node; member