Lines Matching defs:e_node
30 struct e_node {
44 sizeof(struct e_node), 0,
137 rb_entry(node, struct e_node, start.node));
167 static inline bool rb_insert_count(struct rb_root *root, struct e_node *e)
175 struct e_node *k =
176 rb_entry(parent = *p, struct e_node, count.node);
200 static inline bool rb_insert_start(struct rb_root *root, struct e_node *e)
207 struct e_node *k;
211 k = rb_entry(parent, struct e_node, start.node);
234 struct e_node *e, *e0 = NULL;
252 e = rb_entry(n, struct e_node, start.node);
268 e = rb_entry(n, struct e_node, start.node);
320 e = rb_entry(n, struct e_node, count.node);
325 struct e_node *e2;
328 e2 = rb_entry(n, struct e_node, count.node);
365 struct e_node *e, *e3;
375 e = rb_entry(n, struct e_node, start.node);
395 e3 = rb_entry(n3, struct e_node, start.node);
421 n3 ? rb_entry(n3, struct e_node, count.node)->count.key :
436 e3 = rb_entry(n3, struct e_node, count.node);
466 e = rb_entry(rb_last(&wnd->count_tree), struct e_node,
897 struct e_node *e;
906 e = rb_entry(n, struct e_node, start.node);
933 struct e_node *e;
943 e = rb_entry(n, struct e_node, start.node);
995 const struct e_node *e;
1042 e = rb_entry(cr, struct e_node, start.node);
1057 e = pr ? rb_entry(pr, struct e_node, start.node) : NULL;
1088 e = rb_entry(rb_first(&wnd->count_tree), struct e_node, count.node);