1/* SPDX-License-Identifier: GPL-2.0-or-later */
2/*
3 * dir.h
4 *
5 * Function prototypes
6 *
7 * Copyright (C) 2002, 2004 Oracle.  All rights reserved.
8 */
9
10#ifndef OCFS2_DIR_H
11#define OCFS2_DIR_H
12
13struct ocfs2_dx_hinfo {
14	u32	major_hash;
15	u32	minor_hash;
16};
17
18struct ocfs2_dir_lookup_result {
19	struct buffer_head		*dl_leaf_bh;	/* Unindexed leaf
20							 * block */
21	struct ocfs2_dir_entry		*dl_entry;	/* Target dirent in
22							 * unindexed leaf */
23
24	struct buffer_head		*dl_dx_root_bh;	/* Root of indexed
25							 * tree */
26
27	struct buffer_head		*dl_dx_leaf_bh;	/* Indexed leaf block */
28	struct ocfs2_dx_entry		*dl_dx_entry;	/* Target dx_entry in
29							 * indexed leaf */
30	struct ocfs2_dx_hinfo		dl_hinfo;	/* Name hash results */
31
32	struct buffer_head		*dl_prev_leaf_bh;/* Previous entry in
33							  * dir free space
34							  * list. NULL if
35							  * previous entry is
36							  * dx root block. */
37};
38
39void ocfs2_free_dir_lookup_result(struct ocfs2_dir_lookup_result *res);
40
41int ocfs2_find_entry(const char *name, int namelen,
42		     struct inode *dir,
43		     struct ocfs2_dir_lookup_result *lookup);
44int ocfs2_delete_entry(handle_t *handle,
45		       struct inode *dir,
46		       struct ocfs2_dir_lookup_result *res);
47int __ocfs2_add_entry(handle_t *handle,
48		      struct inode *dir,
49		      const char *name, int namelen,
50		      struct inode *inode, u64 blkno,
51		      struct buffer_head *parent_fe_bh,
52		      struct ocfs2_dir_lookup_result *lookup);
53static inline int ocfs2_add_entry(handle_t *handle,
54				  struct dentry *dentry,
55				  struct inode *inode, u64 blkno,
56				  struct buffer_head *parent_fe_bh,
57				  struct ocfs2_dir_lookup_result *lookup)
58{
59	return __ocfs2_add_entry(handle, d_inode(dentry->d_parent),
60				 dentry->d_name.name, dentry->d_name.len,
61				 inode, blkno, parent_fe_bh, lookup);
62}
63int ocfs2_update_entry(struct inode *dir, handle_t *handle,
64		       struct ocfs2_dir_lookup_result *res,
65		       struct inode *new_entry_inode);
66
67int ocfs2_check_dir_for_entry(struct inode *dir,
68			      const char *name,
69			      int namelen);
70int ocfs2_empty_dir(struct inode *inode);
71
72int ocfs2_find_files_on_disk(const char *name,
73			     int namelen,
74			     u64 *blkno,
75			     struct inode *inode,
76			     struct ocfs2_dir_lookup_result *res);
77int ocfs2_lookup_ino_from_name(struct inode *dir, const char *name,
78			       int namelen, u64 *blkno);
79int ocfs2_readdir(struct file *file, struct dir_context *ctx);
80int ocfs2_dir_foreach(struct inode *inode, struct dir_context *ctx);
81int ocfs2_prepare_dir_for_insert(struct ocfs2_super *osb,
82				 struct inode *dir,
83				 struct buffer_head *parent_fe_bh,
84				 const char *name,
85				 int namelen,
86				 struct ocfs2_dir_lookup_result *lookup);
87struct ocfs2_alloc_context;
88int ocfs2_fill_new_dir(struct ocfs2_super *osb,
89		       handle_t *handle,
90		       struct inode *parent,
91		       struct inode *inode,
92		       struct buffer_head *fe_bh,
93		       struct ocfs2_alloc_context *data_ac,
94		       struct ocfs2_alloc_context *meta_ac);
95
96int ocfs2_dx_dir_truncate(struct inode *dir, struct buffer_head *di_bh);
97
98struct ocfs2_dir_block_trailer *ocfs2_dir_trailer_from_size(int blocksize,
99							    void *data);
100#endif /* OCFS2_DIR_H */
101