rbtree.h revision 1.8
1 1.8 riastrad /* $NetBSD: rbtree.h,v 1.8 2021/12/19 01:48:30 riastradh Exp $ */ 2 1.2 riastrad 3 1.2 riastrad /*- 4 1.2 riastrad * Copyright (c) 2013 The NetBSD Foundation, Inc. 5 1.2 riastrad * All rights reserved. 6 1.2 riastrad * 7 1.2 riastrad * This code is derived from software contributed to The NetBSD Foundation 8 1.2 riastrad * by Taylor R. Campbell. 9 1.2 riastrad * 10 1.2 riastrad * Redistribution and use in source and binary forms, with or without 11 1.2 riastrad * modification, are permitted provided that the following conditions 12 1.2 riastrad * are met: 13 1.2 riastrad * 1. Redistributions of source code must retain the above copyright 14 1.2 riastrad * notice, this list of conditions and the following disclaimer. 15 1.2 riastrad * 2. Redistributions in binary form must reproduce the above copyright 16 1.2 riastrad * notice, this list of conditions and the following disclaimer in the 17 1.2 riastrad * documentation and/or other materials provided with the distribution. 18 1.2 riastrad * 19 1.2 riastrad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 20 1.2 riastrad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 21 1.2 riastrad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 22 1.2 riastrad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 23 1.2 riastrad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 24 1.2 riastrad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 25 1.2 riastrad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 26 1.2 riastrad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 27 1.2 riastrad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 28 1.2 riastrad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 29 1.2 riastrad * POSSIBILITY OF SUCH DAMAGE. 30 1.2 riastrad */ 31 1.2 riastrad 32 1.2 riastrad #ifndef _LINUX_RBTREE_H_ 33 1.2 riastrad #define _LINUX_RBTREE_H_ 34 1.2 riastrad 35 1.3 riastrad #include <sys/rbtree.h> 36 1.3 riastrad 37 1.3 riastrad struct rb_root { 38 1.3 riastrad struct rb_tree rbr_tree; 39 1.3 riastrad }; 40 1.3 riastrad 41 1.4 riastrad struct rb_root_cached { 42 1.8 riastrad struct rb_root rb_root; /* Linux API name */ 43 1.4 riastrad }; 44 1.4 riastrad 45 1.3 riastrad static inline bool 46 1.3 riastrad RB_EMPTY_ROOT(struct rb_root *root) 47 1.3 riastrad { 48 1.3 riastrad 49 1.3 riastrad return RB_TREE_MIN(&root->rbr_tree) == NULL; 50 1.3 riastrad } 51 1.3 riastrad 52 1.5 riastrad static inline void 53 1.6 riastrad rb_erase(struct rb_node *rbnode, struct rb_root *root) 54 1.5 riastrad { 55 1.5 riastrad struct rb_tree *tree = &root->rbr_tree; 56 1.5 riastrad void *node = (char *)rbnode - tree->rbt_ops->rbto_node_offset; 57 1.5 riastrad 58 1.5 riastrad rb_tree_remove_node(tree, node); 59 1.5 riastrad } 60 1.5 riastrad 61 1.5 riastrad static inline void 62 1.6 riastrad rb_erase_cached(struct rb_node *rbnode, struct rb_root_cached *root) 63 1.5 riastrad { 64 1.8 riastrad rb_erase(rbnode, &root->rb_root); 65 1.5 riastrad } 66 1.5 riastrad 67 1.7 riastrad /* 68 1.7 riastrad * XXX This is not actually postorder, but I can't fathom why you would 69 1.7 riastrad * want postorder for an ordered tree; different insertion orders lead 70 1.7 riastrad * to different traversal orders. 71 1.7 riastrad */ 72 1.7 riastrad #define rbtree_postorder_for_each_entry_safe(NODE, TMP, ROOT, FIELD) \ 73 1.7 riastrad for ((NODE) = RB_TREE_MIN(&(ROOT)->rbr_tree); \ 74 1.7 riastrad ((NODE) != NULL && \ 75 1.7 riastrad ((TMP) = rb_tree_iterate(&(ROOT)->rbr_tree, (NODE), \ 76 1.7 riastrad RB_DIR_RIGHT))); \ 77 1.7 riastrad (NODE) = (TMP)) 78 1.7 riastrad 79 1.2 riastrad #endif /* _LINUX_RBTREE_H_ */ 80
Indexes created Mon Sep 22 05:09:51 GMT 2025