Lines Matching defs:leaf
196 struct posix_msg_tree_node *leaf;
202 leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node);
204 if (likely(leaf->priority == msg->m_type))
206 else if (msg->m_type < leaf->priority) {
213 leaf = info->node_cache;
216 leaf = kmalloc(sizeof(*leaf), GFP_ATOMIC);
217 if (!leaf)
219 INIT_LIST_HEAD(&leaf->msg_list);
221 leaf->priority = msg->m_type;
224 info->msg_tree_rightmost = &leaf->rb_node;
226 rb_link_node(&leaf->rb_node, parent, p);
227 rb_insert_color(&leaf->rb_node, &info->msg_tree);
231 list_add_tail(&msg->m_list, &leaf->msg_list);
235 static inline void msg_tree_erase(struct posix_msg_tree_node *leaf,
238 struct rb_node *node = &leaf->rb_node;
245 kfree(leaf);
247 info->node_cache = leaf;
253 struct posix_msg_tree_node *leaf;
272 leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node);
273 if (unlikely(list_empty(&leaf->msg_list))) {
275 "empty leaf node but we haven't implemented "
276 "lazy leaf delete!\n");
277 msg_tree_erase(leaf, info);
280 msg = list_first_entry(&leaf->msg_list,
283 if (list_empty(&leaf->msg_list)) {
284 msg_tree_erase(leaf, info);