Searched refs:rb_first (Results 1 - 25 of 161) sorted by relevance

1234567

/linux-master/net/ceph/
H A Ddebugfs.c69 for (n = rb_first(&map->pg_pools); n; n = rb_next(n)) {
92 for (n = rb_first(&map->pg_temp); n; n = rb_next(n)) {
103 for (n = rb_first(&map->primary_temp); n; n = rb_next(n)) {
110 for (n = rb_first(&map->pg_upmap); n; n = rb_next(n)) {
121 for (n = rb_first(&map->pg_upmap_items); n; n = rb_next(n)) {
160 for (rp = rb_first(&monc->generic_request_tree); rp; rp = rb_next(rp)) {
239 for (n = rb_first(&osd->o_requests); n; n = rb_next(n)) {
265 for (n = rb_first(&osd->o_linger_requests); n; n = rb_next(n)) {
326 for (n = rb_first(&osd->o_backoffs_by_id); n; n = rb_next(n)) {
352 for (n = rb_first(
[all...]
/linux-master/tools/perf/util/
H A Drb_resort.h96 for (nd = rb_first(entries); nd; nd = rb_next(nd)) { \
128 for (__nd = rb_first(&__name->entries); \
H A Dcallchain.c426 n = rb_first(&node->rb_root_in);
457 n = rb_first(&node->rb_root_in);
488 n = rb_first(&node->rb_root_in);
553 n = rb_first(&new->rb_root_in);
1054 n = rb_first(&src->rb_root_in);
1299 n = rb_first(&node->rb_root_in);
1507 n = rb_first(&node->rb_root_in);
1532 n = rb_first(&node->rb_root_in);
1759 struct rb_node *rb_node = rb_first(root);
/linux-master/scripts/gdb/linux/
H A Drbtree.py13 def rb_first(root): function
110 result = rb_first(root)
/linux-master/arch/powerpc/kernel/
H A Deeh_cache.c103 n = rb_first(&cache->rb_root);
218 n = rb_first(&pci_io_addr_cache_root.rb_root);
270 for (n = rb_first(&pci_io_addr_cache_root.rb_root); n; n = rb_next(n)) {
/linux-master/lib/
H A Drbtree_test.c197 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {
223 for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {
295 for (node = rb_first(&root.rb_root); node; node = rb_next(node))
309 node = rb_first(&root.rb_root);
H A Drbtree.c466 struct rb_node *rb_first(const struct rb_root *root) function
477 EXPORT_SYMBOL(rb_first); variable
/linux-master/fs/proc/
H A Dnommu.c86 for (p = rb_first(&nommu_region_tree); p; p = rb_next(p))
/linux-master/kernel/trace/
H A Dtrace_stat.c188 node = rb_first(&session->stat_root);
203 return rb_first(&session->stat_root);
/linux-master/tools/perf/ui/gtk/
H A Dhists.c101 bool has_single_node = (rb_first(root) == rb_last(root));
103 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
165 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
224 bool has_single_node = (rb_first(root) == rb_last(root));
226 for (nd = rb_first(root); nd; nd = rb_next(nd)) {
/linux-master/fs/ocfs2/
H A Dreservations.c83 node = rb_first(&resmap->m_reservations);
138 node = rb_first(&resmap->m_reservations);
363 node = rb_first(&resmap->m_reservations);
522 next = rb_first(root);
/linux-master/tools/perf/ui/browsers/
H A Dmap.c120 for (nd = rb_first(mb.b.entries); nd; nd = rb_next(nd)) {
/linux-master/drivers/base/regmap/
H A Dregcache-rbtree.c148 for (node = rb_first(&rbtree_ctx->root); node != NULL;
225 next = rb_first(&rbtree_ctx->root);
478 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) {
520 for (node = rb_first(&rbtree_ctx->root); node; node = rb_next(node)) {
/linux-master/drivers/android/
H A Dbinder_alloc.c358 for (n = rb_first(&alloc->allocated_buffers); n; n = rb_next(n)) {
367 for (n = rb_first(&alloc->free_buffers); n; n = rb_next(n)) {
407 for (n = rb_first(&alloc->allocated_buffers); n != NULL;
899 while ((n = rb_first(&alloc->allocated_buffers))) {
968 for (n = rb_first(&alloc->allocated_buffers); n; n = rb_next(n)) {
1027 for (n = rb_first(&alloc->allocated_buffers); n != NULL; n = rb_next(n))
/linux-master/fs/btrfs/
H A Dref-verify.c242 while ((n = rb_first(&be->roots))) {
248 while((n = rb_first(&be->refs))) {
639 for (n = rb_first(&be->refs); n; n = rb_next(n)) {
647 for (n = rb_first(&be->roots); n; n = rb_next(n)) {
909 while ((n = rb_first(&fs_info->block_tree))) {
/linux-master/drivers/infiniband/hw/mlx4/
H A Dcm.c549 while (rb_first(sl_id_map)) {
551 rb_entry(rb_first(sl_id_map),
560 nd = rb_first(sl_id_map);
/linux-master/net/netfilter/
H A Dnf_conncount.c468 for (node = rb_first(root); node != NULL; node = rb_next(node)) {
483 node = rb_first(root);
575 while ((node = rb_first(r)) != NULL) {
/linux-master/fs/jffs2/
H A Dnodelist.h329 struct rb_node *node = rb_first(root);
361 #define tn_first(list) rb_entry(rb_first(list), struct jffs2_tmp_dnode_info, rb)
/linux-master/tools/perf/tests/
H A Dhists_cumulate.c216 for (node = rb_first(root), i = 0;
238 cnode = rb_entry(rb_first(root), struct callchain_node, rb_node);
/linux-master/fs/xfs/scrub/
H A Dbitmap.c62 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \
336 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \
/linux-master/tools/include/linux/
H A Drbtree.h55 extern struct rb_node *rb_first(const struct rb_root *);
126 /* Same as rb_first(), but O(1) */
/linux-master/kernel/power/
H A Dwakelock.c46 for (node = rb_first(&wakelocks_tree); node; node = rb_next(node)) {
/linux-master/include/linux/
H A Drbtree.h46 extern struct rb_node *rb_first(const struct rb_root *);
105 /* Same as rb_first(), but O(1) */
/linux-master/tools/perf/ui/stdio/
H A Dhist.c125 node = rb_first(root);
230 node = rb_first(root);
311 struct rb_node *rb_node = rb_first(tree);
362 struct rb_node *rb_node = rb_first(tree);
/linux-master/security/keys/
H A Dgc.c222 cursor = rb_first(&key_serial_tree);

Completed in 244 milliseconds

1234567