/linux-6.12.1/scripts/gdb/linux/ |
D | rbtree.py | 89 def rb_prev(node): function 182 result = rb_prev(node)
|
/linux-6.12.1/Documentation/translations/zh_CN/core-api/ |
D | rbtree.rst | 168 struct rb_node *rb_prev(struct rb_node *node); 172 rb_next()或rb_prev()来获取下一个或上一个结点。当没有剩余的结点时,将返回NULL。
|
/linux-6.12.1/lib/ |
D | rbtree.c | 524 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function 551 EXPORT_SYMBOL(rb_prev);
|
/linux-6.12.1/tools/perf/ |
D | builtin-annotate.c | 445 nd = rb_prev(nd); in hists__find_annotations() 489 next = rb_prev(nd); in hists__find_annotations() 534 next = rb_prev(nd); in hists__find_annotations()
|
/linux-6.12.1/fs/btrfs/ |
D | extent_map.c | 120 parent = rb_prev(parent); in tree_insert() 178 prev = rb_prev(prev); in __tree_search() 361 rb = rb_prev(&em->rb_node); in try_merge_map() 635 prev = rb_prev(&em->rb_node); in prev_extent_map()
|
D | ordered-data.c | 103 test = rb_prev(prev); in __tree_search() 1112 prev = rb_prev(cur); in btrfs_lookup_first_ordered_range()
|
D | free-space-cache.c | 1752 n = rb_prev(&entry->offset_index); in tree_search_offset() 1770 n = rb_prev(&entry->offset_index); in tree_search_offset() 1784 n = rb_prev(&entry->offset_index); in tree_search_offset() 2468 right_prev = rb_prev(&right_info->offset_index); in try_merge_free_space() 4295 n = rb_prev(&info->offset_index); in test_check_exists() 4302 n = rb_prev(&tmp->offset_index); in test_check_exists()
|
/linux-6.12.1/fs/jffs2/ |
D | nodelist.h | 348 #define frag_prev(frag) rb_entry(rb_prev(&(frag)->rb), struct jffs2_node_frag, rb) 355 #define tn_prev(tn) rb_entry(rb_prev(&(tn)->rb), struct jffs2_tmp_dnode_info, rb)
|
/linux-6.12.1/tools/include/linux/ |
D | rbtree.h | 54 extern struct rb_node *rb_prev(const struct rb_node *);
|
/linux-6.12.1/include/linux/ |
D | rbtree.h | 45 extern struct rb_node *rb_prev(const struct rb_node *);
|
/linux-6.12.1/net/netfilter/ |
D | nft_set_rbtree.c | 240 struct rb_node *prev = rb_prev(&rbe->node); in nft_rbtree_gc_elem() 259 prev = rb_prev(prev); in nft_rbtree_gc_elem()
|
/linux-6.12.1/kernel/locking/ |
D | ww_mutex.h | 114 struct rb_node *n = rb_prev(&w->tree.entry); in __ww_waiter_prev()
|
/linux-6.12.1/fs/ext4/ |
D | block_validity.c | 101 node = rb_prev(new_node); in add_system_zone()
|
D | extents_status.c | 575 node = rb_prev(&es->rb_node); in ext4_es_try_to_merge_left() 1109 node = rb_prev(&es->rb_node); in init_rsvd() 1291 node = rb_prev(&es->rb_node); in get_rsvd()
|
/linux-6.12.1/tools/lib/ |
D | rbtree.c | 517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
|
/linux-6.12.1/Documentation/core-api/ |
D | rbtree.rst | 177 struct rb_node *rb_prev(struct rb_node *node); 182 node by calling rb_next() or rb_prev() on the current node. This will return
|
/linux-6.12.1/drivers/md/bcache/ |
D | util.h | 460 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
|
/linux-6.12.1/fs/f2fs/ |
D | extent_cache.c | 234 tmp_node = rb_prev(parent); in __lookup_extent_node_ret() 241 tmp_node = rb_prev(&en->rb_node); in __lookup_extent_node_ret()
|
/linux-6.12.1/block/ |
D | elevator.c | 779 struct rb_node *rbprev = rb_prev(&rq->rb_node); in elv_rb_former_request()
|
/linux-6.12.1/drivers/platform/surface/aggregator/ |
D | controller.c | 2587 for (n = rb_prev(n); n; n = rb_prev(n)) { in ssam_notifier_disable_registered()
|
/linux-6.12.1/fs/ntfs3/ |
D | bitmap.c | 327 n = rb_prev(n); in wnd_add_free_ext() 428 } else if (rb_prev(&e->count.node)) { in wnd_remove_free_ext()
|
/linux-6.12.1/fs/nfs/blocklayout/ |
D | extent_tree.c | 28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
|
/linux-6.12.1/tools/perf/ui/ |
D | browser.c | 162 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
|
/linux-6.12.1/drivers/gpu/drm/ |
D | drm_mm.c | 422 return rb_hole_size_to_node(rb_prev(&node->rb_hole_size)); in DECLARE_NEXT_HOLE_ADDR()
|
/linux-6.12.1/rust/kernel/ |
D | rbtree.rs | 879 Direction::Prev => bindings::rb_prev(self.current.as_ptr()), in get_neighbor_raw()
|