radix-tree.h 2.5 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
  1. /*
  2. * Copyright (C) 2001 Momchil Velikov
  3. * Portions Copyright (C) 2001 Christoph Hellwig
  4. *
  5. * This program is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU General Public License as
  7. * published by the Free Software Foundation; either version 2, or (at
  8. * your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful, but
  11. * WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * 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., 675 Mass Ave, Cambridge, MA 02139, USA.
  18. */
  19. #ifndef _LINUX_RADIX_TREE_H
  20. #define _LINUX_RADIX_TREE_H
  21. #include <linux/sched.h>
  22. #include <linux/preempt.h>
  23. #include <linux/types.h>
  24. #define RADIX_TREE_MAX_TAGS 2
  25. /* root tags are stored in gfp_mask, shifted by __GFP_BITS_SHIFT */
  26. struct radix_tree_root {
  27. unsigned int height;
  28. gfp_t gfp_mask;
  29. struct radix_tree_node *rnode;
  30. };
  31. #define RADIX_TREE_INIT(mask) { \
  32. .height = 0, \
  33. .gfp_mask = (mask), \
  34. .rnode = NULL, \
  35. }
  36. #define RADIX_TREE(name, mask) \
  37. struct radix_tree_root name = RADIX_TREE_INIT(mask)
  38. #define INIT_RADIX_TREE(root, mask) \
  39. do { \
  40. (root)->height = 0; \
  41. (root)->gfp_mask = (mask); \
  42. (root)->rnode = NULL; \
  43. } while (0)
  44. int radix_tree_insert(struct radix_tree_root *, unsigned long, void *);
  45. void *radix_tree_lookup(struct radix_tree_root *, unsigned long);
  46. void **radix_tree_lookup_slot(struct radix_tree_root *, unsigned long);
  47. void *radix_tree_delete(struct radix_tree_root *, unsigned long);
  48. unsigned int
  49. radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
  50. unsigned long first_index, unsigned int max_items);
  51. int radix_tree_preload(gfp_t gfp_mask);
  52. void radix_tree_init(void);
  53. void *radix_tree_tag_set(struct radix_tree_root *root,
  54. unsigned long index, unsigned int tag);
  55. void *radix_tree_tag_clear(struct radix_tree_root *root,
  56. unsigned long index, unsigned int tag);
  57. int radix_tree_tag_get(struct radix_tree_root *root,
  58. unsigned long index, unsigned int tag);
  59. unsigned int
  60. radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results,
  61. unsigned long first_index, unsigned int max_items,
  62. unsigned int tag);
  63. int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag);
  64. static inline void radix_tree_preload_end(void)
  65. {
  66. preempt_enable();
  67. }
  68. #endif /* _LINUX_RADIX_TREE_H */