Home
last modified time | relevance | path

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

12

/Linux-v6.6/scripts/gdb/linux/
Drbtree.py29 def rb_last(root): function
130 result = rb_last(root)
/Linux-v6.6/Documentation/translations/zh_CN/core-api/
Drbtree.rst166 struct rb_node *rb_last(struct rb_root *tree);
170 要开始迭代,需要使用一个指向树根的指针调用rb_first()或rb_last(),它将返回一个指向
/Linux-v6.6/lib/
Drbtree.c479 struct rb_node *rb_last(const struct rb_root *root) in rb_last() function
490 EXPORT_SYMBOL(rb_last);
Drbtree_test.c212 WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1); in check()
/Linux-v6.6/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-v6.6/include/linux/
Drbtree.h47 extern struct rb_node *rb_last(const struct rb_root *);
Dkvm_host.h1092 iter->node = rb_last(&slots->gfn_tree); in kvm_memslot_iter_start()
/Linux-v6.6/tools/include/linux/
Drbtree.h56 extern struct rb_node *rb_last(const struct rb_root *);
/Linux-v6.6/tools/perf/ui/gtk/
Dhists.c101 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_flat()
224 bool has_single_node = (rb_first(root) == rb_last(root)); in perf_gtk__add_callchain_graph()
/Linux-v6.6/kernel/locking/
Dww_mutex.h123 struct rb_node *n = rb_last(&lock->rtmutex.waiters.rb_root); in __ww_waiter_last()
/Linux-v6.6/tools/lib/
Drbtree.c474 struct rb_node *rb_last(const struct rb_root *root) in rb_last() function
/Linux-v6.6/fs/ocfs2/
Duptodate.c135 while ((node = rb_last(root)) != NULL) { in ocfs2_purge_copied_metadata_tree()
Dreservations.c272 while ((node = rb_last(&resmap->m_reservations)) != NULL) { in ocfs2_resmap_clear_all_resv()
/Linux-v6.6/tools/perf/ui/browsers/
Dannotate.c348 browser->curr_hot = rb_last(&browser->entries); in annotate_browser__calc_percent()
767 nd = rb_last(&browser->entries); in annotate_browser__run()
/Linux-v6.6/Documentation/core-api/
Drbtree.rst175 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-v6.6/arch/s390/kvm/
Dkvm-s390.h230 node = rb_last(&slots->gfn_tree); in kvm_s390_get_gfn_end()
/Linux-v6.6/drivers/md/bcache/
Dutil.h518 container_of_or_null(rb_last(root), type, member)
/Linux-v6.6/tools/perf/util/
Dmap.c334 struct rb_node *nd = rb_last(&symbols->rb_root); in map__fixup_end()
Dsymbol.c425 struct rb_node *n = rb_last(&symbols->rb_root); in symbols__last()
Dhist.c2022 node = rb_last(&he->hroot_out.rb_root); in rb_hierarchy_last()
/Linux-v6.6/tools/perf/ui/
Dbrowser.c151 nd = rb_last(root); in ui_browser__rb_tree_seek()
/Linux-v6.6/fs/ntfs3/
Dbitmap.c319 n = rb_last(&wnd->count_tree); in wnd_add_free_ext()
466 e = rb_entry(rb_last(&wnd->count_tree), struct e_node, in wnd_remove_free_ext()
/Linux-v6.6/drivers/mtd/
Dmtdswap.c81 #define MTDSWAP_ECNT_MAX(rbroot) (rb_entry(rb_last(rbroot), struct swap_eb, \
/Linux-v6.6/net/sched/
Dsch_hfsc.c680 n = rb_last(&cl->cl_parent->vt_tree); in init_vf()
/Linux-v6.6/drivers/mtd/ubi/
Dwl.c359 last = rb_entry(rb_last(root), struct ubi_wl_entry, u.rb); in find_mean_wl_entry()

12