| /linux-4.1.27/fs/btrfs/ |
| D | extent_map.c | 124 parent = rb_prev(parent); in tree_insert()
176 prev = rb_prev(prev); in __tree_search()
231 rb = rb_prev(&em->rb_node); in try_merge_map()
|
| D | ordered-data.c | 116 test = rb_prev(prev); in __tree_search()
449 for (; n; n = rb_prev(n)) { in btrfs_get_logged_extents()
927 node = rb_prev(&ordered->rb_node); in btrfs_ordered_update_i_size()
941 for (; node; node = rb_prev(node)) { in btrfs_ordered_update_i_size()
|
| D | free-space-cache.c | 1545 n = rb_prev(&entry->offset_index); in tree_search_offset()
1563 n = rb_prev(&entry->offset_index); in tree_search_offset()
1577 n = rb_prev(&entry->offset_index); in tree_search_offset()
2127 if (right_info && rb_prev(&right_info->offset_index)) in try_merge_free_space()
2128 left_info = rb_entry(rb_prev(&right_info->offset_index), in try_merge_free_space()
3610 n = rb_prev(&info->offset_index); in test_check_exists()
3617 n = rb_prev(&info->offset_index); in test_check_exists()
|
| D | delayed-inode.c | 369 else if ((node = rb_prev(prev_node)) != NULL) { in __btrfs_lookup_delayed_item()
|
| D | extent_io.c | 317 prev = rb_prev(prev); in __etree_search()
372 other_node = rb_prev(&state->rb_node); in merge_state()
|
| D | inode.c | 6584 prev = rb_prev(&em->rb_node); in prev_extent_map()
|
| /linux-4.1.27/include/linux/ |
| D | rbtree.h | 67 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /linux-4.1.27/tools/perf/ |
| D | builtin-annotate.c | 132 nd = rb_prev(nd); in hists__find_annotations()
168 next = rb_prev(nd); in hists__find_annotations()
|
| /linux-4.1.27/mm/ |
| D | nommu.c | 745 struct rb_node **p, *parent, *rb_prev; in add_vma_to_mm() local
768 parent = rb_prev = NULL; in add_vma_to_mm()
779 rb_prev = parent; in add_vma_to_mm()
784 rb_prev = parent; in add_vma_to_mm()
789 rb_prev = parent; in add_vma_to_mm()
800 if (rb_prev) in add_vma_to_mm()
801 prev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in add_vma_to_mm()
|
| D | vmalloc.c | 334 tmp = rb_prev(&va->rb_node); in __insert_vmap_area()
488 free_vmap_cache = rb_prev(&va->rb_node); in __free_vmap_area()
2314 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node)); in pvm_find_next_prev()
2352 *pprev = node_to_va(rb_prev(&(*pnext)->rb_node)); in pvm_determine_end()
2486 prev = node_to_va(rb_prev(&next->rb_node)); in pcpu_get_vm_areas()
|
| D | mmap.c | 413 for (nd = pn; nd; nd = rb_prev(nd)) in browse_rb()
557 struct rb_node **__rb_link, *__rb_parent, *rb_prev; in find_vma_links() local
560 rb_prev = __rb_parent = NULL; in find_vma_links()
574 rb_prev = __rb_parent; in find_vma_links()
580 if (rb_prev) in find_vma_links()
581 *pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in find_vma_links()
|
| D | mempolicy.c | 2173 struct rb_node *prev = rb_prev(n); in sp_lookup()
|
| /linux-4.1.27/lib/ |
| D | rbtree.c | 476 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
503 EXPORT_SYMBOL(rb_prev);
|
| /linux-4.1.27/drivers/iommu/ |
| D | iova.c | 83 struct rb_node *prev_node = rb_prev(iovad->cached32_node); in __get_cached_rbnode()
169 curr = rb_prev(curr); in __alloc_and_insert_iova_range()
|
| /linux-4.1.27/tools/perf/tests/ |
| D | vmlinux-kallsyms.c | 155 nnd = backwards ? rb_prev(&pair->rb_node) : in test__vmlinux_matches_kallsyms()
|
| /linux-4.1.27/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-4.1.27/fs/ext4/ |
| D | block_validity.c | 97 node = rb_prev(new_node); in add_system_zone()
|
| D | extents_status.c | 419 node = rb_prev(&es->rb_node); in ext4_es_try_to_merge_left()
|
| D | mballoc.c | 4601 node = rb_prev(new_node); in ext4_mb_free_metadata()
|
| /linux-4.1.27/Documentation/ |
| D | rbtree.txt | 174 struct rb_node *rb_prev(struct rb_node *node);
179 node by calling rb_next() or rb_prev() on the current node. This will return
|
| /linux-4.1.27/fs/nfs/blocklayout/ |
| D | extent_tree.c | 27 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
|
| /linux-4.1.27/tools/perf/ui/ |
| D | browser.c | 134 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
|
| /linux-4.1.27/drivers/md/bcache/ |
| D | util.h | 558 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
|
| /linux-4.1.27/tools/perf/util/ |
| D | symbol.c | 425 for (n = rb_prev(n); n; n = rb_prev(n)) { in symbols__find_by_name()
|
| /linux-4.1.27/block/ |
| D | elevator.c | 1028 struct rb_node *rbprev = rb_prev(&rq->rb_node); in elv_rb_former_request()
|
| D | cfq-iosched.c | 1212 struct rb_node *rbprev = rb_prev(&last->rb_node); in cfq_find_next_rq()
2616 node = rb_prev(&__cfqq->p_node); in cfqq_close()
|
| /linux-4.1.27/tools/perf/ui/browsers/ |
| D | hists.c | 957 nd = rb_prev(nd); in hists__filter_prev_entries()
1064 nd = hists__filter_prev_entries(rb_prev(nd), in ui_browser__hists_seek()
|
| D | annotate.c | 712 nd = rb_prev(nd); in annotate_browser__run()
|
| /linux-4.1.27/fs/ext2/ |
| D | balloc.c | 316 n = rb_prev(&rsv->rsv_node); in search_reserve_window()
|
| /linux-4.1.27/fs/ext3/ |
| D | balloc.c | 324 n = rb_prev(&rsv->rsv_node); in search_reserve_window()
|
| /linux-4.1.27/kernel/events/ |
| D | uprobes.c | 1037 for (t = n; t; t = rb_prev(t)) { in build_probe_list()
|
| /linux-4.1.27/fs/f2fs/ |
| D | data.c | 472 node = rb_prev(&en->rb_node); in __try_back_merge()
|
| /linux-4.1.27/drivers/staging/lustre/lustre/osc/ |
| D | osc_cache.c | 164 return rb_extent(rb_prev(&ext->oe_node)); in prev_extent()
|