Searched refs:rb_node (Results 1 - 16 of 16) sorted by relevance

/external/kernel-headers/original/linux/
H A Drbtree.h37 struct rb_node * n = inode->i_rb_page_cache.rb_node;
56 struct rb_node * node)
58 struct rb_node ** p = &inode->i_rb_page_cache.rb_node;
59 struct rb_node * parent = NULL;
82 struct rb_node * node)
100 struct rb_node struct
105 struct rb_node *rb_right;
106 struct rb_node *rb_lef
112 struct rb_node *rb_node; member in struct:rb_root
[all...]
H A Dmempolicy.h125 struct rb_node nd;
H A Dkey.h122 struct rb_node serial_node;
H A Dblkdev.h59 struct rb_node rb_node; member in struct:cfq_io_context
H A Dmm.h70 struct rb_node vm_rb;
926 struct rb_node **, struct rb_node *);
H A Dext3_fs.h714 struct rb_node *curr_node;
/external/blktrace/
H A Drbtree.h37 struct rb_node * n = inode->i_rb_page_cache.rb_node;
56 struct rb_node * node)
58 struct rb_node ** p = &inode->i_rb_page_cache.rb_node;
59 struct rb_node * parent = NULL;
82 struct rb_node * node)
99 struct rb_node struct
104 struct rb_node *rb_right;
105 struct rb_node *rb_lef
110 struct rb_node *rb_node; member in struct:rb_root
[all...]
H A Drbtree.c25 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
27 struct rb_node *right = node->rb_right;
28 struct rb_node *parent = rb_parent(node);
44 root->rb_node = right;
48 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root)
50 struct rb_node *left = node->rb_left;
51 struct rb_node *parent = rb_parent(node);
67 root->rb_node = left;
71 void rb_insert_color(struct rb_node *node, struct rb_root *root)
73 struct rb_node *paren
[all...]
H A Dblkparse.c226 struct rb_node rb_node; member in struct:trace
246 struct rb_node rb_node; member in struct:io_track
782 rb_erase(&t->rb_node, &pci->rb_last);
791 rb_erase(&t->rb_node, &rb_sort_root);
799 struct rb_node **p = &root->rb_node;
800 struct rb_node *parent = NULL;
806 __t = rb_entry(parent, struct trace, rb_node);
[all...]
H A Dblkiomon.c46 struct rb_node node;
52 struct rb_node **node_ptr;
53 struct rb_node *parent;
63 struct rb_node node;
177 struct rb_node **p = &(dstat_tree[dstat_curr].rb_node);
178 struct rb_node *parent = NULL;
/external/blktrace/btt/
H A Ddip_rb.c27 struct rb_node *parent = NULL;
28 struct rb_node **p = &root->rb_node;
33 __iop = rb_entry(parent, struct io, rb_node);
44 rb_link_node(&iop->rb_node, parent, p);
45 rb_insert_color(&iop->rb_node, root);
52 struct rb_node *n = root->rb_node;
55 __iop = rb_entry(n, struct io, rb_node);
67 void rb_foreach(struct rb_node *
[all...]
H A Dproc.c26 struct rb_node rb_node; member in struct:pn_info
36 static void __foreach(struct rb_node *n, void (*f)(struct p_info *, void *),
41 f(rb_entry(n, struct pn_info, rb_node)->pip, arg);
46 static void __destroy(struct rb_node *n, int free_name, int free_pip)
49 struct pn_info *pnp = rb_entry(n, struct pn_info, rb_node);
68 struct rb_node *n = root_pid.rb_node;
71 this = rb_entry(n, struct pn_info, rb_node);
87 struct rb_node *
[all...]
H A Dseek.c25 struct rb_node rb_node; member in struct:seek_bkt
65 struct rb_node *parent = NULL;
66 struct rb_node **p = &root->rb_node;
70 sbp = rb_entry(parent, struct seek_bkt, rb_node);
85 rb_link_node(&sbp->rb_node, parent, p);
86 rb_insert_color(&sbp->rb_node, root);
89 static void __destroy(struct rb_node *n)
92 struct seek_bkt *sbp = rb_entry(n, struct seek_bkt, rb_node);
[all...]
H A Ddevs.c34 static void __destroy(struct rb_node *n)
37 struct io *iop = rb_entry(n, struct io, rb_node);
50 __destroy(roots[i].rb_node);
H A Dglobals.h152 struct rb_node rb_node; member in struct:io
225 void rb_foreach(struct rb_node *n, struct io *iop,
H A Dinlines.h298 rb_erase(&iop->rb_node, __get_root(iop->dip, iop->type));
306 rb_foreach(__get_root(dip, type)->rb_node, iop, fnc, head);

Completed in 223 milliseconds