Home
last modified time | relevance | path

Searched refs:rb_last (Results 1 – 25 of 28) sorted by relevance

12

/Linux-v4.19/tools/include/linux/
Drbtree.h69 extern struct rb_node *rb_last(const struct rb_root *);
/Linux-v4.19/include/linux/
Drbtree.h85 extern struct rb_node *rb_last(const struct rb_root *);
Dskbuff.h3180 #define skb_rb_last(root) rb_to_skb(rb_last(root))
/Linux-v4.19/lib/
Drbtree.c515 struct rb_node *rb_last(const struct rb_root *root) in rb_last() function
526 EXPORT_SYMBOL(rb_last);
Drbtree_test.c227 WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1); in check()
/Linux-v4.19/fs/jffs2/
Dnodelist.h339 struct rb_node *node = rb_last(root); in frag_last()
360 #define tn_last(list) rb_entry(rb_last(list), struct jffs2_tmp_dnode_info, rb)
/Linux-v4.19/tools/perf/ui/gtk/
Dhists.c99 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_flat()
222 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_graph()
/Linux-v4.19/tools/lib/
Drbtree.c425 struct rb_node *rb_last(const struct rb_root *root) in rb_last() function
/Linux-v4.19/tools/perf/ui/browsers/
Dannotate.c336 browser->curr_hot = rb_last(&browser->entries); in annotate_browser__calc_percent()
708 nd = rb_last(&browser->entries); in annotate_browser__run()
Dhists.c1856 nd = rb_hierarchy_last(rb_last(browser->entries)); in ui_browser__hists_seek()
/Linux-v4.19/fs/ocfs2/
Duptodate.c151 while ((node = rb_last(root)) != NULL) { in ocfs2_purge_copied_metadata_tree()
Dreservations.c287 while ((node = rb_last(&resmap->m_reservations)) != NULL) { in ocfs2_resmap_clear_all_resv()
Drefcounttree.c542 while ((node = rb_last(root)) != NULL) { in ocfs2_purge_refcount_trees()
/Linux-v4.19/fs/btrfs/
Dinode-map.c285 n = rb_last(&ctl->free_space_offset); in recalculate_thresholds()
Dfree-space-cache.c2532 while ((node = rb_last(&ctl->free_space_offset)) != NULL) { in __btrfs_remove_free_space_cache_locked()
/Linux-v4.19/Documentation/
Drbtree.txt175 struct rb_node *rb_last(struct rb_root *tree);
179 To start iterating, call rb_first() or rb_last() with a pointer to the root
/Linux-v4.19/drivers/md/bcache/
Dutil.h539 container_of_or_null(rb_last(root), type, member)
/Linux-v4.19/tools/perf/ui/
Dbrowser.c152 nd = rb_last(root); in ui_browser__rb_tree_seek()
/Linux-v4.19/tools/perf/util/
Dmap.c298 struct rb_node *nd = rb_last(symbols); in map__fixup_end()
Dsymbol.c368 struct rb_node *n = rb_last(symbols); in symbols__last()
Dhist.c1801 node = rb_last(&he->hroot_out); in rb_hierarchy_last()
/Linux-v4.19/drivers/mtd/
Dmtdswap.c94 #define MTDSWAP_ECNT_MAX(rbroot) (rb_entry(rb_last(rbroot), struct swap_eb, \
/Linux-v4.19/drivers/mtd/ubi/
Dwl.c359 last = rb_entry(rb_last(root), struct ubi_wl_entry, u.rb); in find_mean_wl_entry()
/Linux-v4.19/net/sched/
Dsch_hfsc.c681 n = rb_last(&cl->cl_parent->vt_tree); in init_vf()
/Linux-v4.19/fs/ceph/
Dcaps.c1006 return rb_first(&ci->i_caps) == rb_last(&ci->i_caps); in __ceph_is_single_caps()

12