Home
last modified time | relevance | path

Searched refs:rb_prev (Results 1 – 25 of 53) sorted by relevance

123

/openbmc/linux/scripts/gdb/linux/
H A Drbtree.py77 def rb_prev(node): function
170 result = rb_prev(node)
/openbmc/u-boot/include/linux/
H A Drbtree.h56 extern struct rb_node *rb_prev(const struct rb_node *);
/openbmc/u-boot/lib/
H A Drbtree.c466 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
493 EXPORT_SYMBOL(rb_prev);
/openbmc/linux/lib/
H A Drbtree.c524 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
551 EXPORT_SYMBOL(rb_prev);
/openbmc/linux/Documentation/translations/zh_CN/core-api/
H A Drbtree.rst168 struct rb_node *rb_prev(struct rb_node *node);
172 rb_next()或rb_prev()来获取下一个或上一个结点。当没有剩余的结点时，将返回NULL。
/openbmc/linux/fs/btrfs/
H A Dextent_map.c119 parent = rb_prev(parent); in tree_insert()
177 prev = rb_prev(prev); in __tree_search()
248 rb = rb_prev(&em->rb_node); in try_merge_map()
538 prev = rb_prev(&em->rb_node); in prev_extent_map()
H A Dordered-data.c103 test = rb_prev(prev); in __tree_search()
1053 prev = rb_prev(cur); in btrfs_lookup_first_ordered_range()
H A Dfree-space-cache.c1750 n = rb_prev(&entry->offset_index); in tree_search_offset()
1768 n = rb_prev(&entry->offset_index); in tree_search_offset()
1782 n = rb_prev(&entry->offset_index); in tree_search_offset()
2466 right_prev = rb_prev(&right_info->offset_index); in try_merge_free_space()
4291 n = rb_prev(&info->offset_index); in test_check_exists()
4298 n = rb_prev(&tmp->offset_index); in test_check_exists()
/openbmc/linux/fs/jffs2/
H A Dnodelist.h348 #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)
/openbmc/linux/tools/perf/
H A Dbuiltin-annotate.c356 nd = rb_prev(nd); in hists__find_annotations()
396 next = rb_prev(nd); in hists__find_annotations()
/openbmc/linux/tools/include/linux/
H A Drbtree.h54 extern struct rb_node *rb_prev(const struct rb_node *);
/openbmc/linux/include/linux/
H A Drbtree.h45 extern struct rb_node *rb_prev(const struct rb_node *);
/openbmc/linux/fs/ext4/
H A Dblock_validity.c101 node = rb_prev(new_node); in add_system_zone()
H A Dextents_status.c573 node = rb_prev(&es->rb_node); in ext4_es_try_to_merge_left()
1091 node = rb_prev(&es->rb_node); in init_rsvd()
1275 node = rb_prev(&es->rb_node); in get_rsvd()
/openbmc/linux/kernel/locking/
H A Dww_mutex.h114 struct rb_node *n = rb_prev(&w->tree.entry); in __ww_waiter_prev()
/openbmc/linux/net/netfilter/
H A Dnft_set_rbtree.c241 struct rb_node *prev = rb_prev(&rbe->node); in nft_rbtree_gc_elem()
260 prev = rb_prev(prev); in nft_rbtree_gc_elem()
/openbmc/linux/tools/lib/
H A Drbtree.c517 struct rb_node *rb_prev(const struct rb_node *node) in rb_prev() function
/openbmc/linux/Documentation/core-api/
H A Drbtree.rst177 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
/openbmc/linux/fs/f2fs/
H A Dextent_cache.c245 tmp_node = rb_prev(parent); in __lookup_extent_node_ret()
252 tmp_node = rb_prev(&en->rb_node); in __lookup_extent_node_ret()
/openbmc/linux/drivers/md/bcache/
H A Dutil.h524 container_of_or_null(rb_prev(&(ptr)->member), typeof(*ptr), member)
/openbmc/linux/fs/nfs/blocklayout/
H A Dextent_tree.c28 struct rb_node *node = rb_prev(&be->be_node); in ext_tree_prev()
/openbmc/linux/tools/perf/ui/
H A Dbrowser.c162 nd = rb_prev(nd); in ui_browser__rb_tree_seek()
/openbmc/linux/block/
H A Delevator.c796 struct rb_node *rbprev = rb_prev(&rq->rb_node); in elv_rb_former_request()
/openbmc/linux/fs/ntfs3/
H A Dbitmap.c327 n = rb_prev(n); in wnd_add_free_ext()
428 } else if (rb_prev(&e->count.node)) { in wnd_remove_free_ext()
/openbmc/linux/drivers/platform/surface/aggregator/
H A Dcontroller.c2548 for (n = rb_prev(n); n; n = rb_prev(n)) { in ssam_notifier_disable_registered()

123