Home
last modified time | relevance | path

Searched refs:rb_node_t (Results 1 – 6 of 6) sorted by relevance

/linux-2.4.37.9/include/linux/
Drbtree.h109 rb_node_t; typedef
121 extern void rb_insert_color(rb_node_t *, rb_root_t *);
122 extern void rb_erase(rb_node_t *, rb_root_t *);
125 extern rb_node_t *rb_next(rb_node_t *);
126 extern rb_node_t *rb_prev(rb_node_t *);
127 extern rb_node_t *rb_first(rb_root_t *);
128 extern rb_node_t *rb_last(rb_root_t *);
130 static inline void rb_link_node(rb_node_t * node, rb_node_t * parent, rb_node_t ** rb_link) in rb_link_node()
Dmm.h56 rb_node_t vm_rb;
/linux-2.4.37.9/lib/
Drbtree.c25 static void __rb_rotate_left(rb_node_t * node, rb_root_t * root) in __rb_rotate_left()
27 rb_node_t * right = node->rb_right; in __rb_rotate_left()
45 static void __rb_rotate_right(rb_node_t * node, rb_root_t * root) in __rb_rotate_right()
47 rb_node_t * left = node->rb_left; in __rb_rotate_right()
65 void rb_insert_color(rb_node_t * node, rb_root_t * root) in rb_insert_color()
67 rb_node_t * parent, * gparent; in rb_insert_color()
76 register rb_node_t * uncle = gparent->rb_right; in rb_insert_color()
89 register rb_node_t * tmp; in rb_insert_color()
101 register rb_node_t * uncle = gparent->rb_left; in rb_insert_color()
114 register rb_node_t * tmp; in rb_insert_color()
[all …]
/linux-2.4.37.9/mm/
Dmmap.c219 static int browse_rb(rb_node_t * rb_node) { in browse_rb()
251 rb_node_t *** rb_link, rb_node_t ** rb_parent) in find_vma_prepare()
254 rb_node_t ** __rb_link, * __rb_parent, * rb_prev; in find_vma_prepare()
286 rb_node_t * rb_parent) in __vma_link_list()
301 rb_node_t ** rb_link, rb_node_t * rb_parent) in __vma_link_rb()
333 rb_node_t ** rb_link, rb_node_t * rb_parent) in __vma_link()
341 rb_node_t ** rb_link, rb_node_t * rb_parent) in vma_link()
354 rb_node_t * rb_parent, unsigned long addr, unsigned long end, unsigned long vm_flags) in vma_merge()
404 rb_node_t ** rb_link, * rb_parent; in do_mmap_pgoff()
690 rb_node_t * rb_node; in find_vma()
[all …]
/linux-2.4.37.9/net/sched/
Dsch_htb.c174 rb_node_t *ptr[TC_HTB_NUMPRIO]; /* current class ptr */
182 rb_node_t node[TC_HTB_NUMPRIO]; /* node for self or feed tree */
183 rb_node_t pq_node; /* node for event queue */
225 rb_node_t *ptr[TC_HTB_MAXDEPTH][TC_HTB_NUMPRIO];
344 static void htb_next_rb_node(rb_node_t **n);
346 rb_node_t *n = (root)->rb_node; \
398 rb_node_t **p = &root->rb_node, *parent = NULL; in htb_add_to_id_tree()
431 rb_node_t **p = &q->wait_pq[cl->level].rb_node, *parent = NULL; in htb_add_to_wait_tree()
465 static void htb_next_rb_node(rb_node_t **n) in htb_next_rb_node()
467 rb_node_t *p; in htb_next_rb_node()
[all …]
Dsch_hfsc.c135 rb_node_t el_node; /* qdisc's eligible tree member */
137 rb_node_t vt_node; /* parent's vt_tree member */
139 rb_node_t cf_node; /* parent's cf_heap member */
233 rb_node_t **p = &cl->sched->eligible.rb_node; in eltree_insert()
234 rb_node_t *parent = NULL; in eltree_insert()
267 rb_node_t *n; in eltree_get_mindl()
283 rb_node_t *n; in eltree_get_minel()
298 rb_node_t **p = &cl->cl_parent->vt_tree.rb_node; in vttree_insert()
299 rb_node_t *parent = NULL; in vttree_insert()
331 rb_node_t *n; in vttree_firstfit()
[all …]