Searched refs:rb_entry (Results 1 - 25 of 259) sorted by relevance

1234567891011

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/samba-3.5.8/lib/util/
H A Drbtree.h42 page = rb_entry(n, struct page, rb_page_cache);
65 page = rb_entry(parent, struct page, rb_page_cache);
113 #define rb_entry(ptr, type, member) container_of(ptr, type, member)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/fs/btrfs/
H A Dextent_map.c88 entry = rb_entry(parent, struct extent_map, rb_node);
100 entry = rb_entry(node, struct extent_map, rb_node);
122 entry = rb_entry(n, struct extent_map, rb_node);
140 prev_entry = rb_entry(prev, struct extent_map, rb_node);
147 prev_entry = rb_entry(prev, struct extent_map, rb_node);
150 prev_entry = rb_entry(prev, struct extent_map, rb_node);
206 merge = rb_entry(rb, struct extent_map, rb_node);
220 merge = rb_entry(rb, struct extent_map, rb_node);
269 merge = rb_entry(rb, struct extent_map, rb_node);
282 merge = rb_entry(r
[all...]
H A Dfree-space-cache.c67 info = rb_entry(parent, struct btrfs_free_space, offset_index);
124 entry = rb_entry(n, struct btrfs_free_space, offset_index);
148 entry = rb_entry(n, struct btrfs_free_space, offset_index);
165 prev = rb_entry(n, struct btrfs_free_space,
185 entry = rb_entry(n, struct btrfs_free_space,
202 prev = rb_entry(n, struct btrfs_free_space,
232 entry = rb_entry(n, struct btrfs_free_space, offset_index);
386 entry = rb_entry(node, struct btrfs_free_space, offset_index);
466 bitmap_info = rb_entry(next, struct btrfs_free_space,
623 left_info = rb_entry(rb_pre
[all...]
H A Dref-cache.c85 entry = rb_entry(parent, struct btrfs_leaf_ref, rb_node);
95 entry = rb_entry(node, struct btrfs_leaf_ref, rb_node);
107 entry = rb_entry(n, struct btrfs_leaf_ref, rb_node);
169 ref = rb_entry(rb, struct btrfs_leaf_ref, rb_node);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/fs/btrfs/
H A Dextent_map.c88 entry = rb_entry(parent, struct extent_map, rb_node);
100 entry = rb_entry(node, struct extent_map, rb_node);
122 entry = rb_entry(n, struct extent_map, rb_node);
140 prev_entry = rb_entry(prev, struct extent_map, rb_node);
147 prev_entry = rb_entry(prev, struct extent_map, rb_node);
150 prev_entry = rb_entry(prev, struct extent_map, rb_node);
206 merge = rb_entry(rb, struct extent_map, rb_node);
220 merge = rb_entry(rb, struct extent_map, rb_node);
269 merge = rb_entry(rb, struct extent_map, rb_node);
282 merge = rb_entry(r
[all...]
H A Dfree-space-cache.c67 info = rb_entry(parent, struct btrfs_free_space, offset_index);
124 entry = rb_entry(n, struct btrfs_free_space, offset_index);
148 entry = rb_entry(n, struct btrfs_free_space, offset_index);
165 prev = rb_entry(n, struct btrfs_free_space,
185 entry = rb_entry(n, struct btrfs_free_space,
202 prev = rb_entry(n, struct btrfs_free_space,
232 entry = rb_entry(n, struct btrfs_free_space, offset_index);
386 entry = rb_entry(node, struct btrfs_free_space, offset_index);
466 bitmap_info = rb_entry(next, struct btrfs_free_space,
623 left_info = rb_entry(rb_pre
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/samba-3.5.8/lib/util/
H A Drbtree.h42 page = rb_entry(n, struct page, rb_page_cache);
65 page = rb_entry(parent, struct page, rb_page_cache);
113 #define rb_entry(ptr, type, member) container_of(ptr, type, member)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/samba-3.5.8/lib/util/
H A Drbtree.h42 page = rb_entry(n, struct page, rb_page_cache);
65 page = rb_entry(parent, struct page, rb_page_cache);
113 #define rb_entry(ptr, type, member) container_of(ptr, type, member)
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/tools/perf/util/
H A Dstrlist.h47 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
55 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
H A Dstrlist.c50 sn = rb_entry(parent, struct str_node, rb_node);
115 sn = rb_entry(parent, struct str_node, rb_node);
179 pos = rb_entry(next, struct str_node, rb_node);
193 struct str_node *pos = rb_entry(nd, struct str_node, rb_node);
H A Dmap.c83 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
93 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
237 struct map *pos = rb_entry(next, struct map, rb_node);
274 struct map *pos = rb_entry(next, struct map, rb_node);
312 struct map *pos = rb_entry(nd, struct map, rb_node);
332 struct map *pos = rb_entry(nd, struct map, rb_node);
394 struct map *pos = rb_entry(next, struct map, rb_node);
459 struct map *map = rb_entry(nd, struct map, rb_node);
506 m = rb_entry(parent, struct map, rb_node);
530 m = rb_entry(paren
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/tools/perf/util/
H A Dstrlist.h47 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
55 return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;
H A Dstrlist.c50 sn = rb_entry(parent, struct str_node, rb_node);
115 sn = rb_entry(parent, struct str_node, rb_node);
179 pos = rb_entry(next, struct str_node, rb_node);
193 struct str_node *pos = rb_entry(nd, struct str_node, rb_node);
H A Dmap.c83 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
93 struct symbol *sym = rb_entry(nd, struct symbol, rb_node);
237 struct map *pos = rb_entry(next, struct map, rb_node);
274 struct map *pos = rb_entry(next, struct map, rb_node);
312 struct map *pos = rb_entry(nd, struct map, rb_node);
332 struct map *pos = rb_entry(nd, struct map, rb_node);
394 struct map *pos = rb_entry(next, struct map, rb_node);
459 struct map *map = rb_entry(nd, struct map, rb_node);
506 m = rb_entry(parent, struct map, rb_node);
530 m = rb_entry(paren
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/fs/jffs2/
H A Dnodelist.h329 return rb_entry(node, struct jffs2_node_frag, rb);
339 return rb_entry(node, struct jffs2_node_frag, rb);
342 #define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb)
343 #define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
344 #define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)
345 #define frag_left(frag) rb_entry((frag)->rb.rb_left, struct jffs2_node_frag, rb)
346 #define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb)
349 #define tn_next(tn) rb_entry(rb_next(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
350 #define tn_prev(tn) rb_entry(rb_prev(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
351 #define tn_parent(tn) rb_entry(rb_paren
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/fs/jffs2/
H A Dnodelist.h329 return rb_entry(node, struct jffs2_node_frag, rb);
339 return rb_entry(node, struct jffs2_node_frag, rb);
342 #define frag_next(frag) rb_entry(rb_next(&(frag)->rb), struct jffs2_node_frag, rb)
343 #define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb)
344 #define frag_parent(frag) rb_entry(rb_parent(&(frag)->rb), struct jffs2_node_frag, rb)
345 #define frag_left(frag) rb_entry((frag)->rb.rb_left, struct jffs2_node_frag, rb)
346 #define frag_right(frag) rb_entry((frag)->rb.rb_right, struct jffs2_node_frag, rb)
349 #define tn_next(tn) rb_entry(rb_next(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
350 #define tn_prev(tn) rb_entry(rb_prev(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
351 #define tn_parent(tn) rb_entry(rb_paren
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/fs/ext4/
H A Dblock_validity.c69 entry = rb_entry(parent, struct ext4_system_zone, node);
80 new_entry = rb_entry(new_node, struct ext4_system_zone,
102 entry = rb_entry(node, struct ext4_system_zone, node);
114 entry = rb_entry(node, struct ext4_system_zone, node);
133 entry = rb_entry(node, struct ext4_system_zone, node);
206 entry = rb_entry(n, struct ext4_system_zone, node);
237 entry = rb_entry(n, struct ext4_system_zone, node);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/fs/ext4/
H A Dblock_validity.c69 entry = rb_entry(parent, struct ext4_system_zone, node);
80 new_entry = rb_entry(new_node, struct ext4_system_zone,
102 entry = rb_entry(node, struct ext4_system_zone, node);
114 entry = rb_entry(node, struct ext4_system_zone, node);
133 entry = rb_entry(node, struct ext4_system_zone, node);
206 entry = rb_entry(n, struct ext4_system_zone, node);
237 entry = rb_entry(n, struct ext4_system_zone, node);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/security/keys/
H A Dproc.c99 struct key *key = rb_entry(n, struct key, serial_node);
119 struct key *key = rb_entry(n, struct key, serial_node);
142 minkey = rb_entry(n, struct key, serial_node);
165 struct key *key = rb_entry(n, struct key, serial_node);
189 struct key *key = rb_entry(_p, struct key, serial_node);
277 struct key_user *user = rb_entry(n, struct key_user, node);
337 struct key_user *user = rb_entry(_p, struct key_user, node);
H A Dgc.c156 xkey = rb_entry(rb, struct key, serial_node);
166 key = rb_entry(rb, struct key, serial_node);
191 key = rb_entry(rb, struct key, serial_node);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/security/keys/
H A Dproc.c99 struct key *key = rb_entry(n, struct key, serial_node);
119 struct key *key = rb_entry(n, struct key, serial_node);
142 minkey = rb_entry(n, struct key, serial_node);
165 struct key *key = rb_entry(n, struct key, serial_node);
189 struct key *key = rb_entry(_p, struct key, serial_node);
277 struct key_user *user = rb_entry(n, struct key_user, node);
337 struct key_user *user = rb_entry(_p, struct key_user, node);
H A Dgc.c156 xkey = rb_entry(rb, struct key, serial_node);
166 key = rb_entry(rb, struct key, serial_node);
191 key = rb_entry(rb, struct key, serial_node);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/tools/perf/
H A Dbuiltin-test.c124 sym = rb_entry(nd, struct symbol, rb_node);
149 struct symbol *next = rb_entry(nnd, struct symbol, rb_node);
171 struct map *pos = rb_entry(nd, struct map, rb_node), *pair;
191 struct map *pos = rb_entry(nd, struct map, rb_node), *pair;
213 struct map *pos = rb_entry(nd, struct map, rb_node);
H A Dbuiltin-diff.c74 iter = rb_entry(parent, struct hist_entry, rb_node);
92 struct hist_entry *n = rb_entry(next, struct hist_entry, rb_node);
115 struct hist_entry *iter = rb_entry(n, struct hist_entry, rb_node);
134 struct hist_entry *pos = rb_entry(nd, struct hist_entry, rb_node);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/tools/perf/
H A Dbuiltin-test.c124 sym = rb_entry(nd, struct symbol, rb_node);
149 struct symbol *next = rb_entry(nnd, struct symbol, rb_node);
171 struct map *pos = rb_entry(nd, struct map, rb_node), *pair;
191 struct map *pos = rb_entry(nd, struct map, rb_node), *pair;
213 struct map *pos = rb_entry(nd, struct map, rb_node);

Completed in 401 milliseconds

1234567891011