| /linux/scripts/gdb/linux/ |
| H A D | rbtree.py | 89 def rb_prev(node): function
182 result = rb_prev(node)
|
| /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/net/netfilter/ |
| H A D | nft_set_rbtree.c | 216 struct rb_node *prev = rb_prev(&rbe->node); in nft_rbtree_gc_elem()
230 prev = rb_prev(prev); in nft_rbtree_gc_elem()
265 node = rb_prev(&rbe->node); in nft_rbtree_prev_active()
1081 node = rb_prev(node); in nft_rbtree_commit()
|
| /linux/tools/perf/ |
| H A D | builtin-annotate.c | 435 nd = rb_prev(nd); in hists__find_annotations()
479 next = rb_prev(nd); in hists__find_annotations()
524 next = rb_prev(nd); in hists__find_annotations()
|
| /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()
375 rb = rb_prev(&em->rb_node); in try_merge_map()
642 prev = rb_prev(&em->rb_node); in prev_extent_map()
|
| H A D | free-space-cache.c | 1746 n = rb_prev(&entry->offset_index); in tree_search_offset()
1764 n = rb_prev(&entry->offset_index); in tree_search_offset()
1778 n = rb_prev(&entry->offset_index); in tree_search_offset()
2464 right_prev = rb_prev(&right_info->offset_index); in try_merge_free_space()
4347 n = rb_prev(&info->offset_index); in test_check_exists()
4354 n = rb_prev(&tmp->offset_index); in test_check_exists()
|
| /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/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()
|
| H A D | mballoc.c | 4435 tmp = rb_prev(&right_pa->pa_node.inode_node); in ext4_mb_pa_adjust_overlap()
4447 iter = rb_prev(iter)) { in ext4_mb_pa_adjust_overlap()
4924 tmp = rb_prev(&tmp_pa->pa_node.inode_node); in ext4_mb_use_preallocated()
4946 for (iter = &tmp_pa->pa_node.inode_node;; iter = rb_prev(iter)) { in ext4_mb_use_preallocated()
6408 node = rb_prev(&entry->efd_node); in ext4_try_merge_freed_extent_prev()
|
| /linux/drivers/gpu/ |
| H A D | buddy.c | 326 iter = rb_prev(iter); in __force_merge()
349 iter = rb_prev(iter); in __force_merge()
1250 iter = rb_prev(iter); in __alloc_contig_try_harder()
|
| /linux/rust/kernel/ |
| H A D | rbtree.rs | 876 Direction::Prev => bindings::rb_prev(self.current.as_ptr()), in get_neighbor_raw()
1028 Direction::Prev => bindings::rb_prev(self.current.as_ptr()), in get_neighbor_raw()
|
| /linux/tools/lib/ |
| H A D | rbtree.c | 517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
|
| /linux/drivers/md/bcache/ |
| H A D | util.h | 523 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
|
| /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/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/kernel/ |
| H A D | nstree.c | 124 prev = rb_prev(&node->ns_node); in ns_tree_node_add()
|
| /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 | 872 struct rb_node *rbprev = rb_prev(&rq->rb_node); in elv_rb_former_request()
|
| H A D | bfq-wf2q.c | 361 next = rb_prev(&entity->rb_node); in bfq_idle_extract()
|
| H A D | bfq-iosched.c | 1022 struct rb_node *rbprev = rb_prev(&last->rb_node); in bfq_find_next_rq()
2502 rb_prev(&req->rb_node) && in bfq_request_merged()
2504 blk_rq_pos(container_of(rb_prev(&req->rb_node), in bfq_request_merged()
2708 node = rb_prev(&__bfqq->pos_node); in bfqq_find_close()
|
| /linux/tools/perf/ui/browsers/ |
| H A D | annotate.c | 944 nd = rb_prev(nd); in annotate_browser__run()
|
| /linux/tools/perf/util/ |
| H A D | callchain.c | 1648 chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); in callchain_cursor__copy()
|
| /linux/tools/objtool/ |
| H A D | elf.c | 534 pnode = rb_prev(&sym->node); in elf_add_symbol()
|