| /Linux-v6.6/scripts/gdb/linux/ |
| D | rbtree.py | 77 def rb_prev(node): function
170 result = rb_prev(node)
|
| /Linux-v6.6/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-v6.6/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-v6.6/fs/btrfs/ |
| D | extent_map.c | 119 parent = rb_prev(parent); in tree_insert()
177 prev = rb_prev(prev); in __tree_search()
248 rb = rb_prev(&em->rb_node); in try_merge_map()
538 prev = rb_prev(&em->rb_node); in prev_extent_map()
|
| D | ordered-data.c | 103 test = rb_prev(prev); in __tree_search()
1050 prev = rb_prev(cur); in btrfs_lookup_first_ordered_range()
|
| D | free-space-cache.c | 1750 n = rb_prev(&entry->offset_index); in tree_search_offset()
1768 n = rb_prev(&entry->offset_index); in tree_search_offset()
1782 n = rb_prev(&entry->offset_index); in tree_search_offset()
2466 right_prev = rb_prev(&right_info->offset_index); in try_merge_free_space()
4291 n = rb_prev(&info->offset_index); in test_check_exists()
4298 n = rb_prev(&tmp->offset_index); in test_check_exists()
|
| /Linux-v6.6/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-v6.6/tools/perf/ |
| D | builtin-annotate.c | 356 nd = rb_prev(nd); in hists__find_annotations()
396 next = rb_prev(nd); in hists__find_annotations()
|
| /Linux-v6.6/tools/include/linux/ |
| D | rbtree.h | 54 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /Linux-v6.6/include/linux/ |
| D | rbtree.h | 45 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /Linux-v6.6/kernel/locking/ |
| D | ww_mutex.h | 114 struct rb_node *n = rb_prev(&w->tree.entry); in __ww_waiter_prev()
|
| /Linux-v6.6/fs/ext4/ |
| D | block_validity.c | 101 node = rb_prev(new_node); in add_system_zone()
|
| D | extents_status.c | 559 node = rb_prev(&es->rb_node); in ext4_es_try_to_merge_left()
1065 node = rb_prev(&es->rb_node); in init_rsvd()
1249 node = rb_prev(&es->rb_node); in get_rsvd()
|
| /Linux-v6.6/net/netfilter/ |
| D | nft_set_rbtree.c | 241 struct rb_node *prev = rb_prev(&rbe->node); in nft_rbtree_gc_elem()
260 prev = rb_prev(prev); in nft_rbtree_gc_elem()
|
| /Linux-v6.6/tools/lib/ |
| D | rbtree.c | 517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
|
| /Linux-v6.6/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-v6.6/fs/f2fs/ |
| D | extent_cache.c | 256 tmp_node = rb_prev(parent); in __lookup_extent_node_ret()
263 tmp_node = rb_prev(&en->rb_node); in __lookup_extent_node_ret()
|
| /Linux-v6.6/drivers/md/bcache/ |
| D | util.h | 524 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
|
| /Linux-v6.6/block/ |
| D | elevator.c | 796 struct rb_node *rbprev = rb_prev(&rq->rb_node); in elv_rb_former_request()
|
| /Linux-v6.6/tools/perf/ui/ |
| D | browser.c | 162 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
|
| /Linux-v6.6/fs/nfs/blocklayout/ |
| D | extent_tree.c | 28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
|
| /Linux-v6.6/drivers/platform/surface/aggregator/ |
| D | controller.c | 2548 for (n = rb_prev(n); n; n = rb_prev(n)) { in ssam_notifier_disable_registered()
|
| /Linux-v6.6/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-v6.6/drivers/iommu/ |
| D | iova.c | 207 curr = rb_prev(curr); in __alloc_and_insert_iova_range()
|
| /Linux-v6.6/drivers/vfio/ |
| D | vfio_iommu_type1.c | 296 for (p = rb_prev(n); p; p = rb_prev(p)) { in vfio_dma_bitmap_alloc_all()
1780 for (; n; n = rb_prev(n)) { in vfio_iommu_replay()
|
