Home
last modified time | relevance | path

Searched refs:ns_tree_node (Results 1 – 5 of 5) sorted by relevance

/linux/include/linux/ns/
H A Dnstree_types.h31 struct ns_tree_node { struct
49 struct ns_tree_node ns_unified_node;
50 struct ns_tree_node ns_tree_node; member
51 struct ns_tree_node ns_owner_node;
/linux/include/linux/
H A Dnstree.h25 void ns_tree_node_init(struct ns_tree_node *node);
27 bool ns_tree_node_empty(const struct ns_tree_node *node);
28 struct rb_node *ns_tree_node_add(struct ns_tree_node *node,
31 void ns_tree_node_del(struct ns_tree_node *node, struct ns_tree_root *root);
94 #define ns_tree_active(__ns) (!RB_EMPTY_NODE(&to_ns_common(__ns)->ns_tree_node.ns_node))
H A Dns_common.h39 .ns_tree_node.ns_list_entry = LIST_HEAD_INIT(nsname.ns.ns_tree_node.ns_list_entry), \
/linux/kernel/
H A Dnstree.c73 void ns_tree_node_init(struct ns_tree_node *node) in ns_tree_node_init()
97 bool ns_tree_node_empty(const struct ns_tree_node *node) in ns_tree_node_empty()
114 struct rb_node *ns_tree_node_add(struct ns_tree_node *node, in ns_tree_node_add()
130 struct ns_tree_node *prev_node; in ns_tree_node_add()
131 prev_node = rb_entry(prev, struct ns_tree_node, ns_node); in ns_tree_node_add()
145 void ns_tree_node_del(struct ns_tree_node *node, struct ns_tree_root *root) in ns_tree_node_del()
156 return rb_entry(node, struct ns_common, ns_tree_node.ns_node); in node_to_ns()
207 node = ns_tree_node_add(&ns->ns_tree_node, ns_tree, ns_cmp); in __ns_tree_add_raw()
238 VFS_WARN_ON_ONCE(ns_tree_node_empty(&ns->ns_tree_node)); in __ns_tree_remove()
239 VFS_WARN_ON_ONCE(list_empty(&ns->ns_tree_node.ns_list_entry)); in __ns_tree_remove()
[all …]
H A Dnscommon.c65 ns_tree_node_init(&ns->ns_tree_node); in __ns_common_init()