| /OK3568_Linux_fs/kernel/scripts/gdb/linux/ |
| H A D | rbtree.py | 77 def rb_prev(node): function
170 result = rb_prev(node)
|
| /OK3568_Linux_fs/kernel/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 | 1572 n = rb_prev(&entry->offset_index); in tree_search_offset()
1590 n = rb_prev(&entry->offset_index); in tree_search_offset()
1604 n = rb_prev(&entry->offset_index); in tree_search_offset()
2299 if (right_info && rb_prev(&right_info->offset_index)) in try_merge_free_space()
2300 left_info = rb_entry(rb_prev(&right_info->offset_index), in try_merge_free_space()
4114 n = rb_prev(&info->offset_index); in test_check_exists()
4121 n = rb_prev(&tmp->offset_index); in test_check_exists()
|
| /OK3568_Linux_fs/kernel/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 | 387 for (nd = pn; nd; nd = rb_prev(nd)) in browse_rb()
568 struct rb_node **__rb_link, *__rb_parent, *rb_prev; in find_vma_links() local
571 rb_prev = __rb_parent = NULL; in find_vma_links()
585 rb_prev = __rb_parent; in find_vma_links()
591 if (rb_prev) in find_vma_links()
592 *pprev = rb_entry(rb_prev, struct vm_area_struct, vm_rb); in find_vma_links()
|
| /OK3568_Linux_fs/u-boot/include/linux/ |
| H A D | rbtree.h | 57 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /OK3568_Linux_fs/u-boot/lib/ |
| H A D | rbtree.c | 467 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
494 EXPORT_SYMBOL(rb_prev);
|
| /OK3568_Linux_fs/kernel/tools/include/linux/ |
| H A D | rbtree.h | 54 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /OK3568_Linux_fs/kernel/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);
|
| /OK3568_Linux_fs/kernel/include/linux/ |
| H A D | rbtree.h | 55 extern struct rb_node *rb_prev(const struct rb_node *);
|
| /OK3568_Linux_fs/kernel/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)
|
| /OK3568_Linux_fs/kernel/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()
|
| /OK3568_Linux_fs/kernel/drivers/iommu/ |
| H A D | iova.c | 228 curr = rb_prev(curr); in __alloc_and_insert_iova_range()
279 prev = rb_prev(curr); in __alloc_and_insert_iova_best_fit()
280 for (; prev; curr = prev, prev = rb_prev(curr)) { in __alloc_and_insert_iova_best_fit()
|
| /OK3568_Linux_fs/kernel/fs/ext4/ |
| H A D | block_validity.c | 101 node = rb_prev(new_node); in add_system_zone()
|
| H 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()
|
| /OK3568_Linux_fs/kernel/tools/lib/ |
| H A D | rbtree.c | 517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
|
| /OK3568_Linux_fs/kernel/Documentation/core-api/ |
| H 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
|
| /OK3568_Linux_fs/kernel/fs/f2fs/ |
| H A D | extent_cache.c | 294 tmp_node = rb_prev(parent); in f2fs_lookup_rb_tree_ret()
301 tmp_node = rb_prev(&re->rb_node); in f2fs_lookup_rb_tree_ret()
|
| /OK3568_Linux_fs/kernel/block/ |
| H A D | elevator.c | 812 struct rb_node *rbprev = rb_prev(&rq->rb_node); in elv_rb_former_request()
|
| H A D | bfq-iosched.c | 897 struct rb_node *rbprev = rb_prev(&last->rb_node); in bfq_find_next_rq()
2276 rb_prev(&req->rb_node) && in bfq_request_merged()
2278 blk_rq_pos(container_of(rb_prev(&req->rb_node), in bfq_request_merged()
2450 node = rb_prev(&__bfqq->pos_node); in bfqq_find_close()
|
| /OK3568_Linux_fs/kernel/drivers/md/bcache/ |
| H A D | util.h | 543 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
|
| /OK3568_Linux_fs/kernel/drivers/vfio/ |
| H A D | vfio_iommu_type1.c | 270 for (p = rb_prev(n); p; p = rb_prev(p)) { in vfio_dma_bitmap_alloc_all()
1614 for (; n; n = rb_prev(n)) { in vfio_iommu_replay()
|
| /OK3568_Linux_fs/kernel/tools/perf/ui/ |
| H A D | browser.c | 162 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
|
| /OK3568_Linux_fs/kernel/fs/nfs/blocklayout/ |
| H A D | extent_tree.c | 28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
|
| /OK3568_Linux_fs/kernel/android/ |
| H A D | abi_gki_aarch64_hikey960 | 823 rb_prev
|