| /linux/scripts/gdb/linux/ |
| A D | rbtree.py | 77 def rb_prev(node): function
170 result = rb_prev(node)
|
| /linux/fs/btrfs/ |
| 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()
531 prev = rb_prev(&em->rb_node); in prev_extent_map()
|
| A D | free-space-cache.c | 1640 n = rb_prev(&entry->offset_index); in tree_search_offset()
1658 n = rb_prev(&entry->offset_index); in tree_search_offset()
1672 n = rb_prev(&entry->offset_index); in tree_search_offset()
2304 if (right_info && rb_prev(&right_info->offset_index)) in try_merge_free_space()
2305 left_info = rb_entry(rb_prev(&right_info->offset_index), in try_merge_free_space()
4127 n = rb_prev(&info->offset_index); in test_check_exists()
4134 n = rb_prev(&tmp->offset_index); in test_check_exists()
|
| A D | ordered-data.c | 100 test = rb_prev(prev); in __tree_search()
982 prev = rb_prev(cur); in btrfs_lookup_first_ordered_range()
|
| /linux/mm/ |
| A D | nommu.c | 556 struct rb_node **p, *parent, *rb_prev; in add_vma_to_mm() local
575 parent = rb_prev = NULL; in add_vma_to_mm()
586 rb_prev = parent; in add_vma_to_mm()
591 rb_prev = parent; in add_vma_to_mm()
596 rb_prev = parent; in add_vma_to_mm()
607 if (rb_prev) in add_vma_to_mm()
608 prev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in add_vma_to_mm()
|
| A D | mmap.c | 370 for (nd = pn; nd; nd = rb_prev(nd)) in browse_rb()
533 struct rb_node **__rb_link, *__rb_parent, *rb_prev; in find_vma_links() local
537 rb_prev = __rb_parent = NULL; in find_vma_links()
551 rb_prev = __rb_parent; in find_vma_links()
557 if (rb_prev) in find_vma_links()
558 *pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in find_vma_links()
|
| /linux/lib/ |
| A D | rbtree.c | 524 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
551 EXPORT_SYMBOL(rb_prev);
|
| A D | lib.a | 3 …�rb_insert_color�rb_erase�__rb_insert_augmented�rb_first�rb_last�rb_next�rb_prev�rb_replace_node�r…
|
| /linux/fs/jffs2/ |
| 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/perf/ |
| A D | builtin-annotate.c | 329 nd = rb_prev(nd); in hists__find_annotations()
366 next = rb_prev(nd); in hists__find_annotations()
|
| /linux/tools/include/linux/ |
| A D | rbtree.h | 54 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /linux/include/linux/ |
| A D | rbtree.h | 45 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /linux/fs/ext4/ |
| A D | block_validity.c | 101 node = rb_prev(new_node); in add_system_zone()
|
| A D | extents_status.c | 544 node = rb_prev(&es->rb_node); in ext4_es_try_to_merge_left()
1029 node = rb_prev(&es->rb_node); in init_rsvd()
1213 node = rb_prev(&es->rb_node); in get_rsvd()
|
| /linux/kernel/locking/ |
| A D | ww_mutex.h | 114 struct rb_node *n = rb_prev(&w->tree_entry); in __ww_waiter_prev()
|
| /linux/fs/f2fs/ |
| 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()
|
| /linux/tools/lib/ |
| A D | rbtree.c | 517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
|
| /linux/Documentation/core-api/ |
| 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/ |
| A D | util.h | 524 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
|
| /linux/fs/ntfs3/ |
| A D | bitmap.c | 331 n = rb_prev(n); in wnd_add_free_ext()
432 } else if (rb_prev(&e->count.node)) { in wnd_remove_free_ext()
|
| /linux/drivers/platform/surface/aggregator/ |
| A D | controller.c | 2529 for (n = rb_prev(n); n; n = rb_prev(n)) { in ssam_notifier_disable_registered()
|
| /linux/block/ |
| A D | elevator.c | 829 struct rb_node *rbprev = rb_prev(&rq->rb_node); in elv_rb_former_request()
|
| /linux/fs/nfs/blocklayout/ |
| A D | extent_tree.c | 28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
|
| /linux/tools/perf/ui/ |
| A D | browser.c | 162 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
|
| /linux/drivers/md/ |
| A D | dm-writecache.c | 643 node = rb_prev(&e->rb_node); in writecache_find_entry()
837 struct rb_node *rb_node = rb_prev(&e->rb_node); in writecache_flush()
1996 node = rb_prev(&e->rb_node); in writecache_writeback()
|