Linux Kernel  3.7.1
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
dir.h
Go to the documentation of this file.
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 
32 };
33 
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 
43  struct buffer_head *dl_dx_leaf_bh; /* Indexed leaf block */
44  struct ocfs2_dx_entry *dl_dx_entry; /* Target dx_entry in
45  * indexed leaf */
46  struct ocfs2_dx_hinfo dl_hinfo; /* Name hash results */
47 
48  struct buffer_head *dl_prev_leaf_bh;/* Previous entry in
49  * dir free space
50  * list. NULL if
51  * previous entry is
52  * dx root block. */
53 };
54 
56 
57 int ocfs2_find_entry(const char *name, int namelen,
58  struct inode *dir,
60 int ocfs2_delete_entry(handle_t *handle,
61  struct inode *dir,
63 int __ocfs2_add_entry(handle_t *handle,
64  struct inode *dir,
65  const char *name, int namelen,
66  struct inode *inode, u64 blkno,
67  struct buffer_head *parent_fe_bh,
69 static inline int ocfs2_add_entry(handle_t *handle,
70  struct dentry *dentry,
71  struct inode *inode, u64 blkno,
72  struct buffer_head *parent_fe_bh,
74 {
75  return __ocfs2_add_entry(handle, dentry->d_parent->d_inode,
76  dentry->d_name.name, dentry->d_name.len,
77  inode, blkno, parent_fe_bh, lookup);
78 }
79 int ocfs2_update_entry(struct inode *dir, handle_t *handle,
81  struct inode *new_entry_inode);
82 
83 int ocfs2_check_dir_for_entry(struct inode *dir,
84  const char *name,
85  int namelen);
86 int ocfs2_empty_dir(struct inode *inode);
87 
88 int ocfs2_find_files_on_disk(const char *name,
89  int namelen,
90  u64 *blkno,
91  struct inode *inode,
93 int ocfs2_lookup_ino_from_name(struct inode *dir, const char *name,
94  int namelen, u64 *blkno);
95 int ocfs2_readdir(struct file *filp, void *dirent, filldir_t filldir);
96 int ocfs2_dir_foreach(struct inode *inode, loff_t *f_pos, void *priv,
97  filldir_t filldir);
99  struct inode *dir,
100  struct buffer_head *parent_fe_bh,
101  const char *name,
102  int namelen,
104 struct ocfs2_alloc_context;
105 int ocfs2_fill_new_dir(struct ocfs2_super *osb,
106  handle_t *handle,
107  struct inode *parent,
108  struct inode *inode,
109  struct buffer_head *fe_bh,
110  struct ocfs2_alloc_context *data_ac,
111  struct ocfs2_alloc_context *meta_ac);
112 
113 int ocfs2_dx_dir_truncate(struct inode *dir, struct buffer_head *di_bh);
114 
116  void *data);
117 #endif /* OCFS2_DIR_H */