| /linux/scripts/gdb/linux/ |
| H A D | rbtree.py | 41 def rb_last(root): function
142 result = rb_last(root)
|
| /linux/rust/helpers/ |
| H A D | rbtree.c | 19 return rb_last(root); in rust_helper_rb_last()
|
| /linux/Documentation/translations/zh_CN/core-api/ |
| H A D | rbtree.rst | 166 struct rb_node *rb_last(struct rb_root *tree);
170 要开始迭代，需要使用一个指向树根的指针调用rb_first()或rb_last()，它将返回一个指向
|
| /linux/fs/jffs2/ |
| H A D | nodelist.h | 339 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/tools/include/linux/ |
| H A D | rbtree.h | 56 extern struct rb_node *rb_last(const struct rb_root *);
|
| /linux/tools/perf/ui/gtk/ |
| H A D | hists.c | 101 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/drivers/gpu/ |
| H A D | buddy.c | 120 return rbtree_get_free_block(rb_last(root)); in rbtree_last_free_block()
319 struct rb_node *iter = rb_last(&mm->free_trees[tree][i]); in __force_merge()
1204 iter = rb_last(root); in __alloc_contig_try_harder()
|
| /linux/rust/kernel/ |
| H A D | rbtree.rs | 279 let current = unsafe { bindings::rb_last(root) }; in cursor_back_mut()
294 let current = unsafe { bindings::rb_last(root) }; in cursor_back()
|
| /linux/tools/lib/ |
| H A D | rbtree.c | 474 struct rb_node *rb_last(const struct rb_root *root) in rb_last() function
|
| /linux/fs/ocfs2/ |
| H A D | uptodate.c | 135 while ((node = rb_last(root)) != NULL) { in ocfs2_purge_copied_metadata_tree()
|
| /linux/net/netfilter/ |
| H A D | nft_set_rbtree.c | 1062 node = rb_last(&priv->root); in nft_rbtree_commit()
1163 node = rb_last(&priv->root); in nft_rbtree_adjust_maxsize()
|
| /linux/lib/ |
| H A D | rbtree_test.c | 213 WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1); in check()
|
| /linux/tools/perf/ui/browsers/ |
| H A D | annotate.c | 379 browser->curr_hot = rb_last(&browser->entries); in annotate_browser__calc_percent()
946 nd = rb_last(&browser->entries); in annotate_browser__run()
|
| H A D | hists.c | 1972 nd = rb_hierarchy_last(rb_last(browser->entries)); in ui_browser__hists_seek()
|
| /linux/drivers/md/bcache/ |
| H A D | util.h | 517 container_of_or_null(rb_last(root), type, member)
|
| /linux/tools/perf/util/ |
| H A D | map.c | 332 struct rb_node *nd = rb_last(&symbols->rb_root); in map__fixup_end()
|
| H A D | symbol.c | 472 struct rb_node *n = rb_last(&symbols->rb_root); in symbols__last()
|
| H A D | hist.c | 2166 node = rb_last(&he->hroot_out.rb_root); in rb_hierarchy_last()
|
| /linux/fs/ntfs3/ |
| H A D | bitmap.c | 319 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/tools/perf/ui/ |
| H A D | browser.c | 151 nd = rb_last(root); in ui_browser__rb_tree_seek()
|
| /linux/net/sched/ |
| H A D | sch_hfsc.c | 688 n = rb_last(&cl->cl_parent->vt_tree); in init_vf()
|
| /linux/fs/btrfs/ |
| H A D | free-space-cache.c | 70 while ((node = rb_last(&ctl->free_space_offset)) != NULL) { in __btrfs_remove_free_space_cache()
|
| H A D | block-group.c | 4757 while ((n = rb_last(&info->block_group_cache_tree.rb_root)) != NULL) { in btrfs_free_block_groups()
|
| H A D | extent-tree.c | 2189 n = rb_last(root); in find_middle()
|
| /linux/drivers/gpu/drm/amd/amdkfd/ |
| H A D | kfd_svm.c | 2849 rb_node = rb_last(&p->svms.objects.rb_root); in svm_range_get_range_boundaries()
|