| /linux/scripts/gdb/linux/ |
| H A D | rbtree.py | 89 def rb_prev(node): function
182 result = rb_prev(node)
|
| /linux/lib/ |
| H A D | rbtree.c | 495 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
522 EXPORT_SYMBOL(rb_prev);
|
| /linux/Documentation/translations/zh_CN/core-api/ |
| H A D | rbtree.rst | 168 struct rb_node *rb_prev(struct rb_node *node);
172 rb_next()或rb_prev()来获取下一个或上一个结点。当没有剩余的结点时，将返回NULL。
|
| /linux/tools/perf/ |
| H A D | builtin-annotate.c | 447 nd = rb_prev(nd); in hists__find_annotations()
491 next = rb_prev(nd); in hists__find_annotations()
536 next = rb_prev(nd); in hists__find_annotations()
|
| /linux/fs/jffs2/ |
| H A 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/fs/btrfs/ |
| H A D | extent_map.c | 123 parent = rb_prev(parent); in tree_insert()
181 prev = rb_prev(prev); in tree_search()
363 rb = rb_prev(&em->rb_node); in try_merge_map()
630 prev = rb_prev(&em->rb_node); in prev_extent_map()
|
| /linux/fs/ |
| H A D | mount.h | 204 ns->mnt_last_node = rb_prev(&mnt->mnt_node); in move_from_ns()
|
| /linux/tools/include/linux/ |
| H A D | rbtree.h | 54 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /linux/fs/ext4/ |
| H A D | block_validity.c | 101 node = rb_prev(new_node); in add_system_zone()
|
| /linux/include/linux/ |
| H A D | rbtree.h | 45 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /linux/net/netfilter/ |
| H A D | nft_set_rbtree.c | 238 struct rb_node *prev = rb_prev(&rbe->node); in nft_rbtree_gc_elem()
257 prev = rb_prev(prev); in nft_rbtree_gc_elem()
|
| /linux/kernel/locking/ |
| H A D | ww_mutex.h | 114 struct rb_node *n = rb_prev(&w->tree.entry); in __ww_waiter_prev()
|
| /linux/tools/lib/ |
| H A D | rbtree.c | 517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
|
| /linux/rust/kernel/ |
| H A D | rbtree.rs | 873 Direction::Prev => bindings::rb_prev(self.current.as_ptr()), in get_neighbor_raw()
1025 Direction::Prev => bindings::rb_prev(self.current.as_ptr()), in get_neighbor_raw()
|
| /linux/Documentation/core-api/ |
| H A 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/drivers/md/bcache/ |
| H A D | util.h | 523 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
|
| /linux/drivers/vfio/ |
| H A D | vfio_iommu_type1.c | 304 for (p = rb_prev(n); p; p = rb_prev(p)) { in vfio_dma_bitmap_alloc_all()
654 while ((prev = rb_prev(prev))) { in vpfn_pages()
1907 for (; n; n = rb_prev(n)) { in vfio_iommu_replay()
|
| /linux/fs/f2fs/ |
| H A D | extent_cache.c | 267 tmp_node = rb_prev(parent); in __lookup_extent_node_ret()
274 tmp_node = rb_prev(&en->rb_node); in __lookup_extent_node_ret()
|
| /linux/kernel/ |
| H A D | nstree.c | 124 prev = rb_prev(&node->ns_node); in ns_tree_node_add()
|
| /linux/drivers/platform/surface/aggregator/ |
| H A D | controller.c | 2587 for (n = rb_prev(n); n; n = rb_prev(n)) { in ssam_notifier_disable_registered()
|
| /linux/fs/ntfs3/ |
| H A 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/tools/perf/ui/ |
| H A D | browser.c | 162 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
|
| /linux/fs/nfs/blocklayout/ |
| H A D | extent_tree.c | 29 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
|
| /linux/block/ |
| H A D | elevator.c | 856 struct rb_node *rbprev = rb_prev(&rq->rb_node); in elv_rb_former_request()
|
| /linux/drivers/md/ |
| H A D | dm-writecache.c | 641 node = rb_prev(&e->rb_node); in writecache_find_entry()
837 struct rb_node *rb_node = rb_prev(&e->rb_node); in writecache_flush()
2019 node = rb_prev(&e->rb_node); in writecache_writeback()
|