~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

TOMOYO Linux Cross Reference
Linux/include/linux/rbtree.h

Version: ~ [ linux-5.13-rc7 ] ~ [ linux-5.12.12 ] ~ [ linux-5.11.22 ] ~ [ linux-5.10.45 ] ~ [ linux-5.9.16 ] ~ [ linux-5.8.18 ] ~ [ linux-5.7.19 ] ~ [ linux-5.6.19 ] ~ [ linux-5.5.19 ] ~ [ linux-5.4.127 ] ~ [ linux-5.3.18 ] ~ [ linux-5.2.21 ] ~ [ linux-5.1.21 ] ~ [ linux-5.0.21 ] ~ [ linux-4.20.17 ] ~ [ linux-4.19.195 ] ~ [ linux-4.18.20 ] ~ [ linux-4.17.19 ] ~ [ linux-4.16.18 ] ~ [ linux-4.15.18 ] ~ [ linux-4.14.237 ] ~ [ linux-4.13.16 ] ~ [ linux-4.12.14 ] ~ [ linux-4.11.12 ] ~ [ linux-4.10.17 ] ~ [ linux-4.9.273 ] ~ [ linux-4.8.17 ] ~ [ linux-4.7.10 ] ~ [ linux-4.6.7 ] ~ [ linux-4.5.7 ] ~ [ linux-4.4.273 ] ~ [ linux-4.3.6 ] ~ [ linux-4.2.8 ] ~ [ linux-4.1.52 ] ~ [ linux-4.0.9 ] ~ [ linux-3.18.140 ] ~ [ linux-3.16.85 ] ~ [ linux-3.14.79 ] ~ [ linux-3.12.74 ] ~ [ linux-3.10.108 ] ~ [ linux-2.6.32.71 ] ~ [ linux-2.6.0 ] ~ [ linux-2.4.37.11 ] ~ [ unix-v6-master ] ~ [ ccs-tools-1.8.5 ] ~ [ policy-sample ] ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

  1 /*
  2   Red Black Trees
  3   (C) 1999  Andrea Arcangeli <andrea@suse.de>
  4   
  5   This program is free software; you can redistribute it and/or modify
  6   it under the terms of the GNU General Public License as published by
  7   the Free Software Foundation; either version 2 of the License, or
  8   (at your option) any later version.
  9 
 10   This program is distributed in the hope that it will be useful,
 11   but WITHOUT ANY WARRANTY; without even the implied warranty of
 12   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 13   GNU General Public License for more details.
 14 
 15   You should have received a copy of the GNU General Public License
 16   along with this program; if not, write to the Free Software
 17   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 18 
 19   linux/include/linux/rbtree.h
 20 
 21   To use rbtrees you'll have to implement your own insert and search cores.
 22   This will avoid us to use callbacks and to drop drammatically performances.
 23   I know it's not the cleaner way,  but in C (not in C++) to get
 24   performances and genericity...
 25 
 26   Some example of insert and search follows here. The search is a plain
 27   normal search over an ordered tree. The insert instead must be implemented
 28   int two steps: as first thing the code must insert the element in
 29   order as a red leaf in the tree, then the support library function
 30   rb_insert_color() must be called. Such function will do the
 31   not trivial work to rebalance the rbtree if necessary.
 32 
 33 -----------------------------------------------------------------------
 34 static inline struct page * rb_search_page_cache(struct inode * inode,
 35                                                  unsigned long offset)
 36 {
 37         rb_node_t * n = inode->i_rb_page_cache.rb_node;
 38         struct page * page;
 39 
 40         while (n)
 41         {
 42                 page = rb_entry(n, struct page, rb_page_cache);
 43 
 44                 if (offset < page->offset)
 45                         n = n->rb_left;
 46                 else if (offset > page->offset)
 47                         n = n->rb_right;
 48                 else
 49                         return page;
 50         }
 51         return NULL;
 52 }
 53 
 54 static inline struct page * __rb_insert_page_cache(struct inode * inode,
 55                                                    unsigned long offset,
 56                                                    rb_node_t * node)
 57 {
 58         rb_node_t ** p = &inode->i_rb_page_cache.rb_node;
 59         rb_node_t * parent = NULL;
 60         struct page * page;
 61 
 62         while (*p)
 63         {
 64                 parent = *p;
 65                 page = rb_entry(parent, struct page, rb_page_cache);
 66 
 67                 if (offset < page->offset)
 68                         p = &(*p)->rb_left;
 69                 else if (offset > page->offset)
 70                         p = &(*p)->rb_right;
 71                 else
 72                         return page;
 73         }
 74 
 75         rb_link_node(node, parent, p);
 76 
 77         return NULL;
 78 }
 79 
 80 static inline struct page * rb_insert_page_cache(struct inode * inode,
 81                                                  unsigned long offset,
 82                                                  rb_node_t * node)
 83 {
 84         struct page * ret;
 85         if ((ret = __rb_insert_page_cache(inode, offset, node)))
 86                 goto out;
 87         rb_insert_color(node, &inode->i_rb_page_cache);
 88  out:
 89         return ret;
 90 }
 91 -----------------------------------------------------------------------
 92 */
 93 
 94 #ifndef _LINUX_RBTREE_H
 95 #define _LINUX_RBTREE_H
 96 
 97 #include <linux/kernel.h>
 98 #include <linux/stddef.h>
 99 
100 typedef struct rb_node_s
101 {
102         struct rb_node_s * rb_parent;
103         int rb_color;
104 #define RB_RED          0
105 #define RB_BLACK        1
106         struct rb_node_s * rb_right;
107         struct rb_node_s * rb_left;
108 }
109 rb_node_t;
110 
111 typedef struct rb_root_s
112 {
113         struct rb_node_s * rb_node;
114 }
115 rb_root_t;
116 
117 #define RB_ROOT (rb_root_t) { NULL, }
118 #define rb_entry(ptr, type, member)                                     \
119         ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))
120 
121 extern void rb_insert_color(rb_node_t *, rb_root_t *);
122 extern void rb_erase(rb_node_t *, rb_root_t *);
123 
124 /* Find logical next and previous nodes in a tree */
125 extern rb_node_t *rb_next(rb_node_t *);
126 extern rb_node_t *rb_prev(rb_node_t *);
127 extern rb_node_t *rb_first(rb_root_t *);
128 extern rb_node_t *rb_last(rb_root_t *);
129 
130 static inline void rb_link_node(rb_node_t * node, rb_node_t * parent, rb_node_t ** rb_link)
131 {
132         node->rb_parent = parent;
133         node->rb_color = RB_RED;
134         node->rb_left = node->rb_right = NULL;
135 
136         *rb_link = node;
137 }
138 
139 #endif  /* _LINUX_RBTREE_H */
140 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

kernel.org | git.kernel.org | LWN.net | Project Home | Wiki (Japanese) | Wiki (English) | SVN repository | Mail admin

Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.

osdn.jp