-
Notifications
You must be signed in to change notification settings - Fork 4
/
lookup.c
318 lines (270 loc) · 8.25 KB
/
lookup.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
/*
* Copyright (c) 1998-2017 Erez Zadok
* Copyright (c) 2009 Shrikar Archak
* Copyright (c) 2003-2017 Stony Brook University
* Copyright (c) 2003-2017 The Research Foundation of SUNY
* Copyright (c) 2018 Swapnil Ingle <[email protected]>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*/
#include "wrapfs.h"
/* The dentry cache is just so we have properly sized dentries */
static struct kmem_cache *wrapfs_dentry_cachep;
int wrapfs_init_dentry_cache(void)
{
wrapfs_dentry_cachep =
kmem_cache_create("wrapfs_dentry",
sizeof(struct wrapfs_dentry_info),
0, SLAB_RECLAIM_ACCOUNT, NULL);
return wrapfs_dentry_cachep ? 0 : -ENOMEM;
}
void wrapfs_destroy_dentry_cache(void)
{
if (wrapfs_dentry_cachep)
kmem_cache_destroy(wrapfs_dentry_cachep);
}
void free_dentry_private_data(struct dentry *dentry)
{
if (!dentry || !dentry->d_fsdata)
return;
kmem_cache_free(wrapfs_dentry_cachep, dentry->d_fsdata);
dentry->d_fsdata = NULL;
}
/* allocate new dentry private data */
int new_dentry_private_data(struct dentry *dentry)
{
struct wrapfs_dentry_info *info = WRAPFS_D(dentry);
/* use zalloc to init dentry_info.lower_path */
info = kmem_cache_zalloc(wrapfs_dentry_cachep, GFP_ATOMIC);
if (!info)
return -ENOMEM;
spin_lock_init(&info->lock);
dentry->d_fsdata = info;
return 0;
}
static int wrapfs_inode_test(struct inode *inode, void *candidate_lower_inode)
{
struct inode *current_lower_inode = wrapfs_lower_inode(inode);
if (current_lower_inode == (struct inode *)candidate_lower_inode)
return 1; /* found a match */
else
return 0; /* no match */
}
static int wrapfs_inode_set(struct inode *inode, void *lower_inode)
{
/* we do actual inode initialization in wrapfs_iget */
return 0;
}
struct inode *wrapfs_iget(struct super_block *sb, struct inode *lower_inode)
{
struct inode *inode; /* the new inode to return */
if (!igrab(lower_inode))
return ERR_PTR(-ESTALE);
inode = iget5_locked(sb, /* our superblock */
/*
* hashval: we use inode number, but we can
* also use "(unsigned long)lower_inode"
* instead.
*/
lower_inode->i_ino, /* hashval */
wrapfs_inode_test, /* inode comparison function */
wrapfs_inode_set, /* inode init function */
lower_inode); /* data passed to test+set fxns */
if (!inode) {
iput(lower_inode);
return ERR_PTR(-ENOMEM);
}
/* if found a cached inode, then just return it (after iput) */
if (!(inode->i_state & I_NEW)) {
iput(lower_inode);
return inode;
}
inode->i_ino = lower_inode->i_ino;
wrapfs_set_lower_inode(inode, lower_inode);
inode->i_version++;
/* use different set of inode ops for symlinks & directories */
if (S_ISDIR(lower_inode->i_mode))
inode->i_op = &wrapfs_dir_iops;
else if (S_ISLNK(lower_inode->i_mode))
inode->i_op = &wrapfs_symlink_iops;
else
inode->i_op = &wrapfs_main_iops;
/* use different set of file ops for directories */
if (S_ISDIR(lower_inode->i_mode))
inode->i_fop = &wrapfs_dir_fops;
else
inode->i_fop = &wrapfs_main_fops;
inode->i_mapping->a_ops = &wrapfs_aops;
inode->i_atime.tv_sec = 0;
inode->i_atime.tv_nsec = 0;
inode->i_mtime.tv_sec = 0;
inode->i_mtime.tv_nsec = 0;
inode->i_ctime.tv_sec = 0;
inode->i_ctime.tv_nsec = 0;
/* properly initialize special inodes */
if (S_ISBLK(lower_inode->i_mode) || S_ISCHR(lower_inode->i_mode) ||
S_ISFIFO(lower_inode->i_mode) || S_ISSOCK(lower_inode->i_mode))
init_special_inode(inode, lower_inode->i_mode,
lower_inode->i_rdev);
/* all well, copy inode attributes */
fsstack_copy_attr_all(inode, lower_inode);
fsstack_copy_inode_size(inode, lower_inode);
unlock_new_inode(inode);
return inode;
}
/*
* Helper interpose routine, called directly by ->lookup to handle
* spliced dentries.
*/
static struct dentry *__wrapfs_interpose(struct dentry *dentry,
struct super_block *sb,
struct path *lower_path)
{
struct inode *inode;
struct inode *lower_inode;
struct super_block *lower_sb;
struct dentry *ret_dentry;
lower_inode = d_inode(lower_path->dentry);
lower_sb = wrapfs_lower_super(sb);
/* check that the lower file system didn't cross a mount point */
if (lower_inode->i_sb != lower_sb) {
ret_dentry = ERR_PTR(-EXDEV);
goto out;
}
/*
* We allocate our new inode below by calling wrapfs_iget,
* which will initialize some of the new inode's fields
*/
/* inherit lower inode number for wrapfs's inode */
inode = wrapfs_iget(sb, lower_inode);
if (IS_ERR(inode)) {
ret_dentry = ERR_PTR(PTR_ERR(inode));
goto out;
}
ret_dentry = d_splice_alias(inode, dentry);
out:
return ret_dentry;
}
/*
* Connect a wrapfs inode dentry/inode with several lower ones. This is
* the classic stackable file system "vnode interposition" action.
*
* @dentry: wrapfs's dentry which interposes on lower one
* @sb: wrapfs's super_block
* @lower_path: the lower path (caller does path_get/put)
*/
int wrapfs_interpose(struct dentry *dentry, struct super_block *sb,
struct path *lower_path)
{
struct dentry *ret_dentry;
ret_dentry = __wrapfs_interpose(dentry, sb, lower_path);
return PTR_ERR(ret_dentry);
}
/*
* Main driver function for wrapfs's lookup.
*
* Returns: NULL (ok), ERR_PTR if an error occurred.
* Fills in lower_parent_path with <dentry,mnt> on success.
*/
static struct dentry *__wrapfs_lookup(struct dentry *dentry,
unsigned int flags,
struct path *lower_parent_path)
{
int err = 0;
struct vfsmount *lower_dir_mnt;
struct dentry *lower_dir_dentry = NULL;
struct dentry *lower_dentry;
const char *name;
struct path lower_path;
struct qstr this;
struct dentry *ret_dentry = NULL;
struct super_block *sb = dentry->d_sb;
/* must initialize dentry operations */
d_set_d_op(dentry, &wrapfs_dops);
if (IS_ROOT(dentry))
goto out;
name = dentry->d_name.name;
/* now start the actual lookup procedure */
lower_dir_dentry = lower_parent_path->dentry;
lower_dir_mnt = lower_parent_path->mnt;
mutex_lock(&(d_inode(lower_dir_dentry))->i_mutex);
lower_dentry = lookup_one_len(name, lower_dir_dentry,
dentry->d_name.len);
mutex_unlock(&(d_inode(lower_dir_dentry))->i_mutex);
if (IS_ERR(lower_dentry)) {
printk("%s: failed to get dentry\n", __func__);
err = -ENOENT;
goto out;
}
/* no error: handle positive dentries */
if (d_really_is_positive(lower_dentry)) {
if (wrapfs_is_blocked(WRAPFS_SB(sb), name,
d_inode(lower_dentry)->i_ino))
goto setup_lower;
lower_path.mnt = mntget(lower_dir_mnt);
lower_path.dentry = lower_dentry;
wrapfs_set_lower_path(dentry, &lower_path);
ret_dentry =
__wrapfs_interpose(dentry, dentry->d_sb, &lower_path);
if (IS_ERR(ret_dentry)) {
err = PTR_ERR(ret_dentry);
/* path_put underlying path on error */
wrapfs_put_reset_lower_path(dentry);
}
goto out;
}
this.name = name;
this.len = strlen(name);
this.hash = full_name_hash(this.name, this.len);
dput(lower_dentry);
/* instatiate a new negative dentry */
lower_dentry = d_lookup(lower_dir_dentry, &this);
if (lower_dentry)
goto setup_lower;
lower_dentry = d_alloc(lower_dir_dentry, &this);
if (!lower_dentry) {
err = -ENOMEM;
goto out;
}
d_add(lower_dentry, NULL); /* instantiate and hash */
setup_lower:
lower_path.dentry = lower_dentry;
lower_path.mnt = mntget(lower_dir_mnt);
wrapfs_set_lower_path(dentry, &lower_path);
out:
if (err)
return ERR_PTR(err);
return ret_dentry;
}
struct dentry *wrapfs_lookup(struct inode *dir, struct dentry *dentry,
unsigned int flags)
{
int err;
struct dentry *ret, *parent;
struct path lower_parent_path;
parent = dget_parent(dentry);
wrapfs_get_lower_path(parent, &lower_parent_path);
/* allocate dentry private data. We free it in ->d_release */
err = new_dentry_private_data(dentry);
if (err) {
ret = ERR_PTR(err);
goto out;
}
ret = __wrapfs_lookup(dentry, flags, &lower_parent_path);
if (IS_ERR(ret))
goto out;
if (ret)
dentry = ret;
if (d_inode(dentry))
fsstack_copy_attr_times(d_inode(dentry),
wrapfs_lower_inode(d_inode(dentry)));
/* update parent directory's atime */
fsstack_copy_attr_atime(d_inode(parent),
wrapfs_lower_inode(d_inode(parent)));
out:
wrapfs_put_lower_path(parent, &lower_parent_path);
dput(parent);
return ret;
}