/Linux-v4.19/fs/btrfs/ |
D | extent_map.c | 125 parent = rb_prev(parent); in tree_insert() 177 prev = rb_prev(prev); in __tree_search() 232 rb = rb_prev(&em->rb_node); in try_merge_map() 472 prev = rb_prev(&em->rb_node); in prev_extent_map()
|
D | ordered-data.c | 103 test = rb_prev(prev); in __tree_search() 883 node = rb_prev(&ordered->rb_node); in btrfs_ordered_update_i_size() 897 for (; node; node = rb_prev(node)) { in btrfs_ordered_update_i_size()
|
D | free-space-cache.c | 1525 n = rb_prev(&entry->offset_index); in tree_search_offset() 1543 n = rb_prev(&entry->offset_index); in tree_search_offset() 1557 n = rb_prev(&entry->offset_index); in tree_search_offset() 2136 if (right_info && rb_prev(&right_info->offset_index)) in try_merge_free_space() 2137 left_info = rb_entry(rb_prev(&right_info->offset_index), in try_merge_free_space() 3650 n = rb_prev(&info->offset_index); in test_check_exists() 3657 n = rb_prev(&tmp->offset_index); in test_check_exists()
|
/Linux-v4.19/tools/include/linux/ |
D | rbtree.h | 67 extern struct rb_node *rb_prev(const struct rb_node *);
|
/Linux-v4.19/mm/ |
D | nommu.c | 659 struct rb_node **p, *parent, *rb_prev; in add_vma_to_mm() local 678 parent = rb_prev = NULL; in add_vma_to_mm() 689 rb_prev = parent; in add_vma_to_mm() 694 rb_prev = parent; in add_vma_to_mm() 699 rb_prev = parent; in add_vma_to_mm() 710 if (rb_prev) in add_vma_to_mm() 711 prev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in add_vma_to_mm()
|
D | vmalloc.c | 385 tmp = rb_prev(&va->rb_node); in __insert_vmap_area() 564 free_vmap_cache = rb_prev(&va->rb_node); in __free_vmap_area() 2398 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node)); in pvm_find_next_prev() 2436 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node)); in pvm_determine_end() 2566 prev = node_to_va(rb_prev(&next->rb_node)); in pcpu_get_vm_areas()
|
D | mmap.c | 339 for (nd = pn; nd; nd = rb_prev(nd)) in browse_rb() 503 struct rb_node **__rb_link, *__rb_parent, *rb_prev; in find_vma_links() local 506 rb_prev = __rb_parent = NULL; in find_vma_links() 520 rb_prev = __rb_parent; in find_vma_links() 526 if (rb_prev) in find_vma_links() 527 *pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in find_vma_links()
|
/Linux-v4.19/include/linux/ |
D | rbtree.h | 83 extern struct rb_node *rb_prev(const struct rb_node *);
|
/Linux-v4.19/lib/ |
D | rbtree.c | 560 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function 587 EXPORT_SYMBOL(rb_prev);
|
/Linux-v4.19/tools/perf/ |
D | builtin-annotate.c | 327 nd = rb_prev(nd); in hists__find_annotations() 364 next = rb_prev(nd); in hists__find_annotations()
|
/Linux-v4.19/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-v4.19/fs/ext4/ |
D | block_validity.c | 98 node = rb_prev(new_node); in add_system_zone()
|
/Linux-v4.19/drivers/gpu/drm/ |
D | drm_mm.c | 382 return rb_hole_size_to_node(rb_prev(&node->rb_hole_size)); in next_hole() 388 return rb_hole_addr_to_node(rb_prev(&node->rb_hole_addr)); in next_hole()
|
/Linux-v4.19/fs/f2fs/ |
D | extent_cache.c | 144 tmp_node = rb_prev(parent); in f2fs_lookup_rb_tree_ret() 151 tmp_node = rb_prev(&re->rb_node); in f2fs_lookup_rb_tree_ret()
|
/Linux-v4.19/tools/lib/ |
D | rbtree.c | 468 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
|
/Linux-v4.19/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-v4.19/drivers/md/bcache/ |
D | util.h | 545 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
|
/Linux-v4.19/tools/perf/ui/ |
D | browser.c | 163 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
|
/Linux-v4.19/fs/nfs/blocklayout/ |
D | extent_tree.c | 28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
|
/Linux-v4.19/drivers/gpu/drm/i915/ |
D | intel_breadcrumbs.c | 486 completed = rb_prev(completed); in __intel_engine_add_wait()
|
/Linux-v4.19/drivers/md/ |
D | dm-writecache.c | 574 node = rb_prev(&e->rb_node); in writecache_find_entry() 747 struct rb_node *rb_node = rb_prev(&e->rb_node); in writecache_flush() 1612 node = rb_prev(&e->rb_node); in writecache_writeback()
|
/Linux-v4.19/block/ |
D | bfq-iosched.c | 841 struct rb_node *rbprev = rb_prev(&last->rb_node); in bfq_find_next_rq() 1884 rb_prev(&req->rb_node) && in bfq_request_merged() 1886 blk_rq_pos(container_of(rb_prev(&req->rb_node), in bfq_request_merged() 2045 node = rb_prev(&__bfqq->pos_node); in bfqq_find_close()
|
/Linux-v4.19/drivers/iommu/ |
D | iova.c | 199 curr = rb_prev(curr); in __alloc_and_insert_iova_range()
|
/Linux-v4.19/tools/perf/util/ |
D | symbol.c | 465 for (n = rb_prev(n); n; n = rb_prev(n)) { in symbols__find_by_name()
|
/Linux-v4.19/tools/perf/ui/browsers/ |
D | annotate.c | 706 nd = rb_prev(nd); in annotate_browser__run()
|