btree.h 2.2 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
  1. /*
  2. * btree.h - NILFS B-tree.
  3. *
  4. * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
  5. *
  6. * This program is free software; you can redistribute it and/or modify
  7. * it under the terms of the GNU General Public License as published by
  8. * the Free Software Foundation; either version 2 of the License, or
  9. * (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  14. * GNU General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  19. *
  20. * Written by Koji Sato <koji@osrg.net>.
  21. */
  22. #ifndef _NILFS_BTREE_H
  23. #define _NILFS_BTREE_H
  24. #include <linux/types.h>
  25. #include <linux/buffer_head.h>
  26. #include <linux/list.h>
  27. #include <linux/nilfs2_fs.h>
  28. #include "btnode.h"
  29. #include "bmap.h"
  30. struct nilfs_btree;
  31. struct nilfs_btree_path;
  32. /**
  33. * struct nilfs_btree - B-tree structure
  34. * @bt_bmap: bmap base structure
  35. */
  36. struct nilfs_btree {
  37. struct nilfs_bmap bt_bmap;
  38. };
  39. #define NILFS_BTREE_ROOT_SIZE NILFS_BMAP_SIZE
  40. #define NILFS_BTREE_ROOT_NCHILDREN_MAX \
  41. ((NILFS_BTREE_ROOT_SIZE - sizeof(struct nilfs_btree_node)) / \
  42. (sizeof(__le64 /* dkey */) + sizeof(__le64 /* dptr */)))
  43. #define NILFS_BTREE_ROOT_NCHILDREN_MIN 0
  44. #define NILFS_BTREE_NODE_EXTRA_PAD_SIZE (sizeof(__le64))
  45. #define NILFS_BTREE_NODE_NCHILDREN_MAX(nodesize) \
  46. (((nodesize) - sizeof(struct nilfs_btree_node) - \
  47. NILFS_BTREE_NODE_EXTRA_PAD_SIZE) / \
  48. (sizeof(__le64 /* dkey */) + sizeof(__le64 /* dptr */)))
  49. #define NILFS_BTREE_NODE_NCHILDREN_MIN(nodesize) \
  50. ((NILFS_BTREE_NODE_NCHILDREN_MAX(nodesize) - 1) / 2 + 1)
  51. #define NILFS_BTREE_KEY_MIN ((__u64)0)
  52. #define NILFS_BTREE_KEY_MAX (~(__u64)0)
  53. int nilfs_btree_path_cache_init(void);
  54. void nilfs_btree_path_cache_destroy(void);
  55. int nilfs_btree_init(struct nilfs_bmap *);
  56. int nilfs_btree_convert_and_insert(struct nilfs_bmap *, __u64, __u64,
  57. const __u64 *, const __u64 *, int);
  58. void nilfs_btree_init_gc(struct nilfs_bmap *);
  59. #endif /* _NILFS_BTREE_H */