dir.h revision 4ed8a6bb083bfcc21f1ed66a474b03c0386e4b34 
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
26#ifndef OCFS2_DIR_H
27#define OCFS2_DIR_H
28
29struct ocfs2_dx_hinfo {
30	u32	major_hash;
31	u32	minor_hash;
32};
33
34struct ocfs2_dir_lookup_result {
35	struct buffer_head		*dl_leaf_bh;	/* Unindexed leaf
36							 * block */
37	struct ocfs2_dir_entry		*dl_entry;	/* Target dirent in
38							 * unindexed leaf */
39
40	struct buffer_head		*dl_dx_root_bh;	/* Root of indexed
41							 * tree */
42	struct buffer_head		*dl_dx_leaf_bh;	/* Indexed leaf block */
43	struct ocfs2_dx_entry		*dl_dx_entry;	/* Target dx_entry in
44							 * indexed leaf */
45	struct ocfs2_dx_hinfo		dl_hinfo;	/* Name hash results */
46};
47void ocfs2_free_dir_lookup_result(struct ocfs2_dir_lookup_result *res);
48
49int ocfs2_find_entry(const char *name, int namelen,
50		     struct inode *dir,
51		     struct ocfs2_dir_lookup_result *lookup);
52int ocfs2_delete_entry(handle_t *handle,
53		       struct inode *dir,
54		       struct ocfs2_dir_lookup_result *res);
55int __ocfs2_add_entry(handle_t *handle,
56		      struct inode *dir,
57		      const char *name, int namelen,
58		      struct inode *inode, u64 blkno,
59		      struct buffer_head *parent_fe_bh,
60		      struct ocfs2_dir_lookup_result *lookup);
61static inline int ocfs2_add_entry(handle_t *handle,
62				  struct dentry *dentry,
63				  struct inode *inode, u64 blkno,
64				  struct buffer_head *parent_fe_bh,
65				  struct ocfs2_dir_lookup_result *lookup)
66{
67	return __ocfs2_add_entry(handle, dentry->d_parent->d_inode,
68				 dentry->d_name.name, dentry->d_name.len,
69				 inode, blkno, parent_fe_bh, lookup);
70}
71int ocfs2_update_entry(struct inode *dir, handle_t *handle,
72		       struct ocfs2_dir_lookup_result *res,
73		       struct inode *new_entry_inode);
74
75int ocfs2_check_dir_for_entry(struct inode *dir,
76			      const char *name,
77			      int namelen);
78int ocfs2_empty_dir(struct inode *inode);
79
80int ocfs2_find_files_on_disk(const char *name,
81			     int namelen,
82			     u64 *blkno,
83			     struct inode *inode,
84			     struct ocfs2_dir_lookup_result *res);
85int ocfs2_lookup_ino_from_name(struct inode *dir, const char *name,
86			       int namelen, u64 *blkno);
87int ocfs2_readdir(struct file *filp, void *dirent, filldir_t filldir);
88int ocfs2_dir_foreach(struct inode *inode, loff_t *f_pos, void *priv,
89		      filldir_t filldir);
90int ocfs2_prepare_dir_for_insert(struct ocfs2_super *osb,
91				 struct inode *dir,
92				 struct buffer_head *parent_fe_bh,
93				 const char *name,
94				 int namelen,
95				 struct ocfs2_dir_lookup_result *lookup);
96struct ocfs2_alloc_context;
97int ocfs2_fill_new_dir(struct ocfs2_super *osb,
98		       handle_t *handle,
99		       struct inode *parent,
100		       struct inode *inode,
101		       struct buffer_head *fe_bh,
102		       struct ocfs2_alloc_context *data_ac,
103		       struct ocfs2_alloc_context *meta_ac);
104
105int ocfs2_dx_dir_truncate(struct inode *dir, struct buffer_head *di_bh);
106
107struct ocfs2_dir_block_trailer *ocfs2_dir_trailer_from_size(int blocksize,
108							    void *data);
109#endif /* OCFS2_DIR_H */
110