radix-tree.h revision 1.4
1 1.4 riastrad /* $NetBSD: radix-tree.h,v 1.4 2021/12/19 01:35:18 riastradh Exp $ */ 2 1.2 riastrad 3 1.2 riastrad /*- 4 1.2 riastrad * Copyright (c) 2018 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_RADIX_TREE_H_ 33 1.2 riastrad #define _LINUX_RADIX_TREE_H_ 34 1.2 riastrad 35 1.2 riastrad #include <linux/gfp.h> 36 1.2 riastrad 37 1.2 riastrad #define INIT_RADIX_TREE linux_INIT_RADIX_TREE 38 1.2 riastrad #define radix_tree_delete linux_radix_tree_delete 39 1.2 riastrad #define radix_tree_deref_slot linux_radix_tree_deref_slot 40 1.2 riastrad #define radix_tree_empty linux_radix_tree_empty 41 1.2 riastrad #define radix_tree_exception linux_radix_tree_exception 42 1.2 riastrad #define radix_tree_insert linux_radix_tree_insert 43 1.2 riastrad #define radix_tree_iter_init linux_radix_tree_iter_init 44 1.2 riastrad #define radix_tree_lookup linux_radix_tree_lookup 45 1.2 riastrad #define radix_tree_next_chunk linux_radix_tree_next_chunk 46 1.2 riastrad #define radix_tree_next_slot linux_radix_tree_next_slot 47 1.2 riastrad 48 1.2 riastrad struct radix_tree_root { 49 1.2 riastrad }; 50 1.2 riastrad 51 1.2 riastrad struct radix_tree_iter { 52 1.2 riastrad }; 53 1.2 riastrad 54 1.2 riastrad void INIT_RADIX_TREE(struct radix_tree_root *, gfp_t); 55 1.2 riastrad 56 1.4 riastrad int radix_tree_insert(struct radix_tree_root *, unsigned long, void *); 57 1.2 riastrad void radix_tree_iter_delete(struct radix_tree_root *, 58 1.2 riastrad struct radix_tree_iter *, void **); 59 1.3 riastrad void * radix_tree_delete(struct radix_tree_root *, unsigned long); 60 1.2 riastrad 61 1.2 riastrad bool radix_tree_empty(struct radix_tree_root *); 62 1.2 riastrad void * radix_tree_lookup(const struct radix_tree_root *, unsigned long); 63 1.2 riastrad bool radix_tree_exception(void *); 64 1.2 riastrad void * radix_tree_deref_slot(void **); 65 1.2 riastrad 66 1.2 riastrad void ** radix_tree_iter_init(struct radix_tree_iter *, unsigned long); 67 1.2 riastrad void ** radix_tree_next_chunk(const struct radix_tree_root *, 68 1.2 riastrad struct radix_tree_iter *, unsigned); 69 1.2 riastrad void ** radix_tree_next_slot(void **, struct radix_tree_iter *, unsigned); 70 1.2 riastrad 71 1.2 riastrad #define radix_tree_for_each_slot(N, T, I, S) \ 72 1.2 riastrad for ((N) = radix_tree_iter_init((I), (S)); \ 73 1.2 riastrad (N) || ((N) = radix_tree_next_chunk((T), (I), 0)); \ 74 1.2 riastrad (N) = radix_tree_next_slot((N), (I), 0)) 75 1.2 riastrad 76 1.2 riastrad #endif /* _LINUX_RADIX_TREE_H_ */ 77
Indexes created Sun Sep 21 20:09:37 GMT 2025