/kernel/linux/linux-5.10/scripts/gdb/linux/ |
H A D | rbtree.py | 77 def rb_prev(node): function 170 result = rb_prev(node)
|
/kernel/linux/linux-6.6/scripts/gdb/linux/ |
H A D | rbtree.py | 77 def rb_prev(node): function 170 result = rb_prev(node)
|
/kernel/linux/linux-5.10/fs/btrfs/ |
H A D | extent_map.c | 129 parent = rb_prev(parent); in tree_insert() 181 prev = rb_prev(prev); in __tree_search() 252 rb = rb_prev(&em->rb_node); in try_merge_map() 528 prev = rb_prev(&em->rb_node); in prev_extent_map()
|
H A D | free-space-cache.c | 1573 n = rb_prev(&entry->offset_index); in tree_search_offset() 1591 n = rb_prev(&entry->offset_index); in tree_search_offset() 1605 n = rb_prev(&entry->offset_index); in tree_search_offset() 2300 if (right_info && rb_prev(&right_info->offset_index)) in try_merge_free_space() 2301 left_info = rb_entry(rb_prev(&right_info->offset_index), in try_merge_free_space() 4115 n = rb_prev(&info->offset_index); in test_check_exists() 4122 n = rb_prev(&tmp->offset_index); in test_check_exists()
|
/kernel/linux/linux-5.10/mm/ |
H A D | nommu.c | 567 struct rb_node **p, *parent, *rb_prev; in add_vma_to_mm() local 586 parent = rb_prev = NULL; in add_vma_to_mm() 597 rb_prev = parent; in add_vma_to_mm() 602 rb_prev = parent; in add_vma_to_mm() 607 rb_prev = parent; in add_vma_to_mm() 618 if (rb_prev) in add_vma_to_mm() 619 prev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in add_vma_to_mm()
|
H A D | mmap.c | 375 for (nd = pn; nd; nd = rb_prev(nd)) in browse_rb() 538 struct rb_node **__rb_link, *__rb_parent, *rb_prev; in find_vma_links() local 541 rb_prev = __rb_parent = NULL; in find_vma_links() 555 rb_prev = __rb_parent; in find_vma_links() 561 if (rb_prev) in find_vma_links() 562 *pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in find_vma_links()
|
/kernel/linux/linux-5.10/include/linux/ |
H A D | rbtree.h | 55 extern struct rb_node *rb_prev(const struct rb_node *);
|
/kernel/linux/linux-5.10/tools/include/linux/ |
H A D | rbtree.h | 54 extern struct rb_node *rb_prev(const struct rb_node *);
|
/kernel/linux/linux-6.6/fs/btrfs/ |
H A 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()
|
H A 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()
|
/kernel/linux/linux-5.10/tools/perf/ |
H A D | builtin-annotate.c | 329 nd = rb_prev(nd); in hists__find_annotations() 366 next = rb_prev(nd); in hists__find_annotations()
|
/kernel/linux/linux-5.10/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)
|
/kernel/linux/linux-5.10/lib/ |
H A D | rbtree.c | 524 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function 551 EXPORT_SYMBOL(rb_prev); variable
|
/kernel/linux/linux-6.6/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)
|
/kernel/linux/linux-6.6/lib/ |
H A D | rbtree.c | 524 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function 551 EXPORT_SYMBOL(rb_prev); variable
|
/kernel/linux/linux-6.6/include/linux/ |
H A D | rbtree.h | 45 extern struct rb_node *rb_prev(const struct rb_node *);
|
/kernel/linux/linux-6.6/tools/include/linux/ |
H A D | rbtree.h | 54 extern struct rb_node *rb_prev(const struct rb_node *);
|
/kernel/linux/linux-6.6/tools/perf/ |
H A D | builtin-annotate.c | 356 nd = rb_prev(nd); in hists__find_annotations() 396 next = rb_prev(nd); in hists__find_annotations()
|
/kernel/linux/linux-5.10/fs/ext4/ |
H A D | block_validity.c | 101 node = rb_prev(new_node); in add_system_zone()
|
/kernel/linux/linux-6.6/fs/ext4/ |
H A D | block_validity.c | 101 node = rb_prev(new_node); in add_system_zone()
|
/kernel/linux/linux-6.6/kernel/locking/ |
H A D | ww_mutex.h | 114 struct rb_node *n = rb_prev(&w->tree.entry); in __ww_waiter_prev()
|
/kernel/linux/linux-5.10/net/netfilter/ |
H A D | nft_set_rbtree.c | 243 struct rb_node *prev = rb_prev(&rbe->node); in nft_rbtree_gc_elem() 262 prev = rb_prev(prev); in nft_rbtree_gc_elem()
|
/kernel/linux/linux-5.10/fs/f2fs/ |
H A D | extent_cache.c | 173 tmp_node = rb_prev(parent); in f2fs_lookup_rb_tree_ret() 180 tmp_node = rb_prev(&re->rb_node); in f2fs_lookup_rb_tree_ret()
|
/kernel/linux/linux-6.6/net/netfilter/ |
H A 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()
|
/kernel/linux/linux-5.10/tools/lib/ |
H A D | rbtree.c | 517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
|