Lines Matching refs:leaf
124 struct posix_msg_tree_node *leaf; in msg_insert() local
129 leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node); in msg_insert()
131 if (likely(leaf->priority == msg->m_type)) in msg_insert()
133 else if (msg->m_type < leaf->priority) in msg_insert()
139 leaf = info->node_cache; in msg_insert()
142 leaf = kmalloc(sizeof(*leaf), GFP_ATOMIC); in msg_insert()
143 if (!leaf) in msg_insert()
145 INIT_LIST_HEAD(&leaf->msg_list); in msg_insert()
147 leaf->priority = msg->m_type; in msg_insert()
148 rb_link_node(&leaf->rb_node, parent, p); in msg_insert()
149 rb_insert_color(&leaf->rb_node, &info->msg_tree); in msg_insert()
153 list_add_tail(&msg->m_list, &leaf->msg_list); in msg_insert()
160 struct posix_msg_tree_node *leaf; in msg_get() local
183 leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node); in msg_get()
184 if (unlikely(list_empty(&leaf->msg_list))) { in msg_get()
188 rb_erase(&leaf->rb_node, &info->msg_tree); in msg_get()
190 kfree(leaf); in msg_get()
192 info->node_cache = leaf; in msg_get()
196 msg = list_first_entry(&leaf->msg_list, in msg_get()
199 if (list_empty(&leaf->msg_list)) { in msg_get()
200 rb_erase(&leaf->rb_node, &info->msg_tree); in msg_get()
202 kfree(leaf); in msg_get()
204 info->node_cache = leaf; in msg_get()