| /Linux-v5.4/scripts/gdb/linux/ |
| D | rbtree.py | 77 def rb_prev(node): function
170 result = rb_prev(node)
|
| /Linux-v5.4/fs/btrfs/ |
| D | extent_map.c | 129 parent = rb_prev(parent); in tree_insert()
181 prev = rb_prev(prev); in __tree_search()
237 rb = rb_prev(&em->rb_node); in try_merge_map()
513 prev = rb_prev(&em->rb_node); in prev_extent_map()
|
| D | ordered-data.c | 106 test = rb_prev(prev); in __tree_search()
862 node = rb_prev(&ordered->rb_node); in btrfs_ordered_update_i_size()
876 for (; node; node = rb_prev(node)) { in btrfs_ordered_update_i_size()
|
| D | free-space-cache.c | 1551 n = rb_prev(&entry->offset_index); in tree_search_offset()
1569 n = rb_prev(&entry->offset_index); in tree_search_offset()
1583 n = rb_prev(&entry->offset_index); in tree_search_offset()
2175 if (right_info && rb_prev(&right_info->offset_index)) in try_merge_free_space()
2176 left_info = rb_entry(rb_prev(&right_info->offset_index), in try_merge_free_space()
3697 n = rb_prev(&info->offset_index); in test_check_exists()
3704 n = rb_prev(&tmp->offset_index); in test_check_exists()
|
| /Linux-v5.4/mm/ |
| D | nommu.c | 586 struct rb_node **p, *parent, *rb_prev; in add_vma_to_mm() local
605 parent = rb_prev = NULL; in add_vma_to_mm()
616 rb_prev = parent; in add_vma_to_mm()
621 rb_prev = parent; in add_vma_to_mm()
626 rb_prev = parent; in add_vma_to_mm()
637 if (rb_prev) in add_vma_to_mm()
638 prev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in add_vma_to_mm()
|
| D | mmap.c | 373 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()
|
| /Linux-v5.4/tools/include/linux/ |
| D | rbtree.h | 54 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /Linux-v5.4/include/linux/ |
| D | rbtree.h | 55 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /Linux-v5.4/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-v5.4/tools/perf/ |
| D | builtin-annotate.c | 331 nd = rb_prev(nd); in hists__find_annotations()
368 next = rb_prev(nd); in hists__find_annotations()
|
| /Linux-v5.4/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-v5.4/fs/ext4/ |
| D | block_validity.c | 108 node = rb_prev(new_node); in add_system_zone()
|
| D | extents_status.c | 535 node = rb_prev(&es->rb_node); in ext4_es_try_to_merge_left()
1011 node = rb_prev(&es->rb_node); in init_rsvd()
1195 node = rb_prev(&es->rb_node); in get_rsvd()
|
| /Linux-v5.4/drivers/gpu/drm/ |
| D | drm_mm.c | 372 return rb_hole_size_to_node(rb_prev(&node->rb_hole_size)); in next_hole()
378 return rb_hole_addr_to_node(rb_prev(&node->rb_hole_addr)); in next_hole()
|
| /Linux-v5.4/fs/f2fs/ |
| D | extent_cache.c | 150 tmp_node = rb_prev(parent); in f2fs_lookup_rb_tree_ret()
157 tmp_node = rb_prev(&re->rb_node); in f2fs_lookup_rb_tree_ret()
|
| /Linux-v5.4/tools/lib/ |
| D | rbtree.c | 517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
|
| /Linux-v5.4/Documentation/ |
| D | rbtree.txt | 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-v5.4/block/ |
| D | elevator.c | 815 struct rb_node *rbprev = rb_prev(&rq->rb_node); in elv_rb_former_request()
|
| D | bfq-iosched.c | 891 struct rb_node *rbprev = rb_prev(&last->rb_node); in bfq_find_next_rq()
2263 rb_prev(&req->rb_node) && in bfq_request_merged()
2265 blk_rq_pos(container_of(rb_prev(&req->rb_node), in bfq_request_merged()
2437 node = rb_prev(&__bfqq->pos_node); in bfqq_find_close()
|
| D | bfq-wf2q.c | 356 next = rb_prev(&entity->rb_node); in bfq_idle_extract()
|
| /Linux-v5.4/drivers/md/bcache/ |
| D | util.h | 543 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
|
| /Linux-v5.4/tools/perf/ui/ |
| D | browser.c | 162 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
|
| /Linux-v5.4/fs/nfs/blocklayout/ |
| D | extent_tree.c | 28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
|
| /Linux-v5.4/drivers/md/ |
| D | dm-writecache.c | 568 node = rb_prev(&e->rb_node); in writecache_find_entry()
742 struct rb_node *rb_node = rb_prev(&e->rb_node); in writecache_flush()
1613 node = rb_prev(&e->rb_node); in writecache_writeback()
|
| /Linux-v5.4/tools/perf/ui/browsers/ |
| D | annotate.c | 713 nd = rb_prev(nd); in annotate_browser__run()
|
