radix-tree.h revision 329973
1362679Sdim/*- 2362679Sdim * Copyright (c) 2010 Isilon Systems, Inc. 3362679Sdim * Copyright (c) 2010 iX Systems, Inc. 4362679Sdim * Copyright (c) 2010 Panasas, Inc. 5362679Sdim * Copyright (c) 2013-2018 Mellanox Technologies, Ltd. 6362679Sdim * All rights reserved. 7362679Sdim * 8362679Sdim * Redistribution and use in source and binary forms, with or without 9362679Sdim * modification, are permitted provided that the following conditions 10362679Sdim * are met: 11362679Sdim * 1. Redistributions of source code must retain the above copyright 12362679Sdim * notice unmodified, this list of conditions, and the following 13362679Sdim * disclaimer. 14362679Sdim * 2. Redistributions in binary form must reproduce the above copyright 15362679Sdim * notice, this list of conditions and the following disclaimer in the 16362679Sdim * documentation and/or other materials provided with the distribution. 17362679Sdim * 18362679Sdim * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 19362679Sdim * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 20362679Sdim * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 21362679Sdim * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 22362679Sdim * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 23362679Sdim * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 24362679Sdim * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 25362679Sdim * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 26362679Sdim * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 27362679Sdim * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 28362679Sdim * 29362679Sdim * $FreeBSD: stable/11/sys/compat/linuxkpi/common/include/linux/radix-tree.h 329973 2018-02-25 10:37:07Z hselasky $ 30362679Sdim */ 31362679Sdim#ifndef _LINUX_RADIX_TREE_H_ 32362679Sdim#define _LINUX_RADIX_TREE_H_ 33362679Sdim 34362679Sdim#include <linux/types.h> 35362679Sdim 36362679Sdim#define RADIX_TREE_MAP_SHIFT 6 37362679Sdim#define RADIX_TREE_MAP_SIZE (1UL << RADIX_TREE_MAP_SHIFT) 38362679Sdim#define RADIX_TREE_MAP_MASK (RADIX_TREE_MAP_SIZE - 1UL) 39362679Sdim#define RADIX_TREE_MAX_HEIGHT \ 40362679Sdim howmany(sizeof(long) * NBBY, RADIX_TREE_MAP_SHIFT) 41362679Sdim 42362679Sdim#define RADIX_TREE_ENTRY_MASK 3UL 43362679Sdim#define RADIX_TREE_EXCEPTIONAL_ENTRY 2UL 44362679Sdim#define RADIX_TREE_EXCEPTIONAL_SHIFT 2 45362679Sdim 46362679Sdimstruct radix_tree_node { 47362679Sdim void *slots[RADIX_TREE_MAP_SIZE]; 48362679Sdim int count; 49362679Sdim}; 50362679Sdim 51362679Sdimstruct radix_tree_root { 52362679Sdim struct radix_tree_node *rnode; 53362679Sdim gfp_t gfp_mask; 54362679Sdim int height; 55362679Sdim}; 56362679Sdim 57362679Sdimstruct radix_tree_iter { 58362679Sdim unsigned long index; 59362679Sdim}; 60362679Sdim 61362679Sdim#define RADIX_TREE_INIT(mask) \ 62362679Sdim { .rnode = NULL, .gfp_mask = mask, .height = 0 }; 63362679Sdim#define INIT_RADIX_TREE(root, mask) \ 64362679Sdim { (root)->rnode = NULL; (root)->gfp_mask = mask; (root)->height = 0; } 65362679Sdim#define RADIX_TREE(name, mask) \ 66362679Sdim struct radix_tree_root name = RADIX_TREE_INIT(mask) 67 68#define radix_tree_for_each_slot(slot, root, iter, start) \ 69 for ((iter)->index = (start); \ 70 radix_tree_iter_find(root, iter, &(slot)); (iter)->index++) 71 72static inline int 73radix_tree_exception(void *arg) 74{ 75 return ((uintptr_t)arg & RADIX_TREE_ENTRY_MASK); 76} 77 78void *radix_tree_lookup(struct radix_tree_root *, unsigned long); 79void *radix_tree_delete(struct radix_tree_root *, unsigned long); 80int radix_tree_insert(struct radix_tree_root *, unsigned long, void *); 81bool radix_tree_iter_find(struct radix_tree_root *, struct radix_tree_iter *, void ***); 82 83#endif /* _LINUX_RADIX_TREE_H_ */ 84