dir.h 3.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586
  1. /* -*- mode: c; c-basic-offset: 8; -*-
  2. * vim: noexpandtab sw=8 ts=8 sts=0:
  3. *
  4. * dir.h
  5. *
  6. * Function prototypes
  7. *
  8. * Copyright (C) 2002, 2004 Oracle. All rights reserved.
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2 of the License, or (at your option) any later version.
  14. *
  15. * This program is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU General Public
  21. * License along with this program; if not, write to the
  22. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  23. * Boston, MA 021110-1307, USA.
  24. */
  25. #ifndef OCFS2_DIR_H
  26. #define OCFS2_DIR_H
  27. struct buffer_head *ocfs2_find_entry(const char *name,
  28. int namelen,
  29. struct inode *dir,
  30. struct ocfs2_dir_entry **res_dir);
  31. int ocfs2_delete_entry(handle_t *handle,
  32. struct inode *dir,
  33. struct ocfs2_dir_entry *de_del,
  34. struct buffer_head *bh);
  35. int __ocfs2_add_entry(handle_t *handle,
  36. struct inode *dir,
  37. const char *name, int namelen,
  38. struct inode *inode, u64 blkno,
  39. struct buffer_head *parent_fe_bh,
  40. struct buffer_head *insert_bh);
  41. static inline int ocfs2_add_entry(handle_t *handle,
  42. struct dentry *dentry,
  43. struct inode *inode, u64 blkno,
  44. struct buffer_head *parent_fe_bh,
  45. struct buffer_head *insert_bh)
  46. {
  47. return __ocfs2_add_entry(handle, dentry->d_parent->d_inode,
  48. dentry->d_name.name, dentry->d_name.len,
  49. inode, blkno, parent_fe_bh, insert_bh);
  50. }
  51. int ocfs2_update_entry(struct inode *dir, handle_t *handle,
  52. struct buffer_head *de_bh, struct ocfs2_dir_entry *de,
  53. struct inode *new_entry_inode);
  54. int ocfs2_check_dir_for_entry(struct inode *dir,
  55. const char *name,
  56. int namelen);
  57. int ocfs2_empty_dir(struct inode *inode);
  58. int ocfs2_find_files_on_disk(const char *name,
  59. int namelen,
  60. u64 *blkno,
  61. struct inode *inode,
  62. struct buffer_head **dirent_bh,
  63. struct ocfs2_dir_entry **dirent);
  64. int ocfs2_lookup_ino_from_name(struct inode *dir, const char *name,
  65. int namelen, u64 *blkno);
  66. int ocfs2_readdir(struct file *filp, void *dirent, filldir_t filldir);
  67. int ocfs2_dir_foreach(struct inode *inode, loff_t *f_pos, void *priv,
  68. filldir_t filldir);
  69. int ocfs2_prepare_dir_for_insert(struct ocfs2_super *osb,
  70. struct inode *dir,
  71. struct buffer_head *parent_fe_bh,
  72. const char *name,
  73. int namelen,
  74. struct buffer_head **ret_de_bh);
  75. struct ocfs2_alloc_context;
  76. int ocfs2_fill_new_dir(struct ocfs2_super *osb,
  77. handle_t *handle,
  78. struct inode *parent,
  79. struct inode *inode,
  80. struct buffer_head *fe_bh,
  81. struct ocfs2_alloc_context *data_ac);
  82. #endif /* OCFS2_DIR_H */