xfs_dir2_node.h 4.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118
  1. /*
  2. * Copyright (c) 2000 Silicon Graphics, Inc. All Rights Reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms of version 2 of the GNU General Public License as
  6. * published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it would be useful, but
  9. * WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
  11. *
  12. * Further, this software is distributed without any warranty that it is
  13. * free of the rightful claim of any third person regarding infringement
  14. * or the like. Any license provided herein, whether implied or
  15. * otherwise, applies only to this software file. Patent licenses, if
  16. * any, provided herein do not apply to combinations of this program with
  17. * other software, or any other product whatsoever.
  18. *
  19. * You should have received a copy of the GNU General Public License along
  20. * with this program; if not, write the Free Software Foundation, Inc., 59
  21. * Temple Place - Suite 330, Boston MA 02111-1307, USA.
  22. *
  23. * Contact information: Silicon Graphics, Inc., 1600 Amphitheatre Pkwy,
  24. * Mountain View, CA 94043, or:
  25. *
  26. * http://www.sgi.com
  27. *
  28. * For further information regarding this notice, see:
  29. *
  30. * http://oss.sgi.com/projects/GenInfo/SGIGPLNoticeExplan/
  31. */
  32. #ifndef __XFS_DIR2_NODE_H__
  33. #define __XFS_DIR2_NODE_H__
  34. /*
  35. * Directory version 2, btree node format structures
  36. */
  37. struct uio;
  38. struct xfs_dabuf;
  39. struct xfs_da_args;
  40. struct xfs_da_state;
  41. struct xfs_da_state_blk;
  42. struct xfs_inode;
  43. struct xfs_trans;
  44. /*
  45. * Offset of the freespace index.
  46. */
  47. #define XFS_DIR2_FREE_SPACE 2
  48. #define XFS_DIR2_FREE_OFFSET (XFS_DIR2_FREE_SPACE * XFS_DIR2_SPACE_SIZE)
  49. #define XFS_DIR2_FREE_FIRSTDB(mp) \
  50. XFS_DIR2_BYTE_TO_DB(mp, XFS_DIR2_FREE_OFFSET)
  51. #define XFS_DIR2_FREE_MAGIC 0x58443246 /* XD2F */
  52. typedef struct xfs_dir2_free_hdr {
  53. __uint32_t magic; /* XFS_DIR2_FREE_MAGIC */
  54. __int32_t firstdb; /* db of first entry */
  55. __int32_t nvalid; /* count of valid entries */
  56. __int32_t nused; /* count of used entries */
  57. } xfs_dir2_free_hdr_t;
  58. typedef struct xfs_dir2_free {
  59. xfs_dir2_free_hdr_t hdr; /* block header */
  60. xfs_dir2_data_off_t bests[1]; /* best free counts */
  61. /* unused entries are -1 */
  62. } xfs_dir2_free_t;
  63. #define XFS_DIR2_MAX_FREE_BESTS(mp) \
  64. (((mp)->m_dirblksize - (uint)sizeof(xfs_dir2_free_hdr_t)) / \
  65. (uint)sizeof(xfs_dir2_data_off_t))
  66. /*
  67. * Convert data space db to the corresponding free db.
  68. */
  69. #define XFS_DIR2_DB_TO_FDB(mp,db) xfs_dir2_db_to_fdb(mp, db)
  70. static inline xfs_dir2_db_t
  71. xfs_dir2_db_to_fdb(struct xfs_mount *mp, xfs_dir2_db_t db)
  72. {
  73. return (XFS_DIR2_FREE_FIRSTDB(mp) + (db) / XFS_DIR2_MAX_FREE_BESTS(mp));
  74. }
  75. /*
  76. * Convert data space db to the corresponding index in a free db.
  77. */
  78. #define XFS_DIR2_DB_TO_FDINDEX(mp,db) xfs_dir2_db_to_fdindex(mp, db)
  79. static inline int
  80. xfs_dir2_db_to_fdindex(struct xfs_mount *mp, xfs_dir2_db_t db)
  81. {
  82. return ((db) % XFS_DIR2_MAX_FREE_BESTS(mp));
  83. }
  84. extern void xfs_dir2_free_log_bests(struct xfs_trans *tp, struct xfs_dabuf *bp,
  85. int first, int last);
  86. extern int xfs_dir2_leaf_to_node(struct xfs_da_args *args,
  87. struct xfs_dabuf *lbp);
  88. extern xfs_dahash_t xfs_dir2_leafn_lasthash(struct xfs_dabuf *bp, int *count);
  89. extern int xfs_dir2_leafn_lookup_int(struct xfs_dabuf *bp,
  90. struct xfs_da_args *args, int *indexp,
  91. struct xfs_da_state *state);
  92. extern int xfs_dir2_leafn_order(struct xfs_dabuf *leaf1_bp,
  93. struct xfs_dabuf *leaf2_bp);
  94. extern int xfs_dir2_leafn_split(struct xfs_da_state *state,
  95. struct xfs_da_state_blk *oldblk,
  96. struct xfs_da_state_blk *newblk);
  97. extern int xfs_dir2_leafn_toosmall(struct xfs_da_state *state, int *action);
  98. extern void xfs_dir2_leafn_unbalance(struct xfs_da_state *state,
  99. struct xfs_da_state_blk *drop_blk,
  100. struct xfs_da_state_blk *save_blk);
  101. extern int xfs_dir2_node_addname(struct xfs_da_args *args);
  102. extern int xfs_dir2_node_lookup(struct xfs_da_args *args);
  103. extern int xfs_dir2_node_removename(struct xfs_da_args *args);
  104. extern int xfs_dir2_node_replace(struct xfs_da_args *args);
  105. extern int xfs_dir2_node_trim_free(struct xfs_da_args *args, xfs_fileoff_t fo,
  106. int *rvalp);
  107. #endif /* __XFS_DIR2_NODE_H__ */