Blame view
fs/libfs.c
25.3 KB
1da177e4c
|
1 2 3 4 5 6 7 |
/* * fs/libfs.c * Library for filesystems writers. */ #include <linux/module.h> #include <linux/pagemap.h> |
5a0e3ad6a
|
8 |
#include <linux/slab.h> |
1da177e4c
|
9 10 |
#include <linux/mount.h> #include <linux/vfs.h> |
7bb46a673
|
11 |
#include <linux/quotaops.h> |
7cf34c761
|
12 |
#include <linux/mutex.h> |
2596110a3
|
13 |
#include <linux/exportfs.h> |
d5aacad54
|
14 15 |
#include <linux/writeback.h> #include <linux/buffer_head.h> |
7cf34c761
|
16 |
|
1da177e4c
|
17 |
#include <asm/uaccess.h> |
da5029563
|
18 19 20 21 |
static inline int simple_positive(struct dentry *dentry) { return dentry->d_inode && !d_unhashed(dentry); } |
1da177e4c
|
22 23 24 25 26 27 28 29 |
int simple_getattr(struct vfsmount *mnt, struct dentry *dentry, struct kstat *stat) { struct inode *inode = dentry->d_inode; generic_fillattr(inode, stat); stat->blocks = inode->i_mapping->nrpages << (PAGE_CACHE_SHIFT - 9); return 0; } |
726c33422
|
30 |
int simple_statfs(struct dentry *dentry, struct kstatfs *buf) |
1da177e4c
|
31 |
{ |
726c33422
|
32 |
buf->f_type = dentry->d_sb->s_magic; |
1da177e4c
|
33 34 35 36 37 38 39 40 41 |
buf->f_bsize = PAGE_CACHE_SIZE; buf->f_namelen = NAME_MAX; return 0; } /* * Retaining negative dentries for an in-memory filesystem just wastes * memory and lookup time: arrange for them to be deleted immediately. */ |
fe15ce446
|
42 |
static int simple_delete_dentry(const struct dentry *dentry) |
1da177e4c
|
43 44 45 46 47 48 49 50 51 52 |
{ return 1; } /* * Lookup the data. This is trivial - if the dentry didn't already * exist, we know it is negative. Set d_op to delete negative dentries. */ struct dentry *simple_lookup(struct inode *dir, struct dentry *dentry, struct nameidata *nd) { |
3ba13d179
|
53 |
static const struct dentry_operations simple_dentry_operations = { |
1da177e4c
|
54 55 56 57 58 |
.d_delete = simple_delete_dentry, }; if (dentry->d_name.len > NAME_MAX) return ERR_PTR(-ENAMETOOLONG); |
fb045adb9
|
59 |
d_set_d_op(dentry, &simple_dentry_operations); |
1da177e4c
|
60 61 62 |
d_add(dentry, NULL); return NULL; } |
1da177e4c
|
63 64 65 |
int dcache_dir_open(struct inode *inode, struct file *file) { static struct qstr cursor_name = {.len = 1, .name = "."}; |
0f7fc9e4d
|
66 |
file->private_data = d_alloc(file->f_path.dentry, &cursor_name); |
1da177e4c
|
67 68 69 70 71 72 73 74 75 76 77 78 |
return file->private_data ? 0 : -ENOMEM; } int dcache_dir_close(struct inode *inode, struct file *file) { dput(file->private_data); return 0; } loff_t dcache_dir_lseek(struct file *file, loff_t offset, int origin) { |
2fd6b7f50
|
79 80 |
struct dentry *dentry = file->f_path.dentry; mutex_lock(&dentry->d_inode->i_mutex); |
1da177e4c
|
81 82 83 84 85 86 87 |
switch (origin) { case 1: offset += file->f_pos; case 0: if (offset >= 0) break; default: |
2fd6b7f50
|
88 |
mutex_unlock(&dentry->d_inode->i_mutex); |
1da177e4c
|
89 90 91 92 93 94 95 96 |
return -EINVAL; } if (offset != file->f_pos) { file->f_pos = offset; if (file->f_pos >= 2) { struct list_head *p; struct dentry *cursor = file->private_data; loff_t n = file->f_pos - 2; |
2fd6b7f50
|
97 98 |
spin_lock(&dentry->d_lock); /* d_lock not required for cursor */ |
5160ee6fc
|
99 |
list_del(&cursor->d_u.d_child); |
2fd6b7f50
|
100 101 |
p = dentry->d_subdirs.next; while (n && p != &dentry->d_subdirs) { |
1da177e4c
|
102 |
struct dentry *next; |
5160ee6fc
|
103 |
next = list_entry(p, struct dentry, d_u.d_child); |
2fd6b7f50
|
104 |
spin_lock_nested(&next->d_lock, DENTRY_D_LOCK_NESTED); |
da5029563
|
105 |
if (simple_positive(next)) |
1da177e4c
|
106 |
n--; |
da5029563
|
107 |
spin_unlock(&next->d_lock); |
1da177e4c
|
108 109 |
p = p->next; } |
5160ee6fc
|
110 |
list_add_tail(&cursor->d_u.d_child, p); |
2fd6b7f50
|
111 |
spin_unlock(&dentry->d_lock); |
1da177e4c
|
112 113 |
} } |
2fd6b7f50
|
114 |
mutex_unlock(&dentry->d_inode->i_mutex); |
1da177e4c
|
115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 |
return offset; } /* Relationship between i_mode and the DT_xxx types */ static inline unsigned char dt_type(struct inode *inode) { return (inode->i_mode >> 12) & 15; } /* * Directory is locked and all positive dentries in it are safe, since * for ramfs-type trees they can't go away without unlink() or rmdir(), * both impossible due to the lock on directory. */ int dcache_readdir(struct file * filp, void * dirent, filldir_t filldir) { |
0f7fc9e4d
|
132 |
struct dentry *dentry = filp->f_path.dentry; |
1da177e4c
|
133 |
struct dentry *cursor = filp->private_data; |
5160ee6fc
|
134 |
struct list_head *p, *q = &cursor->d_u.d_child; |
1da177e4c
|
135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 |
ino_t ino; int i = filp->f_pos; switch (i) { case 0: ino = dentry->d_inode->i_ino; if (filldir(dirent, ".", 1, i, ino, DT_DIR) < 0) break; filp->f_pos++; i++; /* fallthrough */ case 1: ino = parent_ino(dentry); if (filldir(dirent, "..", 2, i, ino, DT_DIR) < 0) break; filp->f_pos++; i++; /* fallthrough */ default: |
2fd6b7f50
|
154 |
spin_lock(&dentry->d_lock); |
1bfba4e8e
|
155 156 |
if (filp->f_pos == 2) list_move(q, &dentry->d_subdirs); |
1da177e4c
|
157 158 |
for (p=q->next; p != &dentry->d_subdirs; p=p->next) { struct dentry *next; |
5160ee6fc
|
159 |
next = list_entry(p, struct dentry, d_u.d_child); |
da5029563
|
160 161 162 |
spin_lock_nested(&next->d_lock, DENTRY_D_LOCK_NESTED); if (!simple_positive(next)) { spin_unlock(&next->d_lock); |
1da177e4c
|
163 |
continue; |
da5029563
|
164 |
} |
1da177e4c
|
165 |
|
da5029563
|
166 |
spin_unlock(&next->d_lock); |
2fd6b7f50
|
167 |
spin_unlock(&dentry->d_lock); |
0f8952c2f
|
168 169 170 171 |
if (filldir(dirent, next->d_name.name, next->d_name.len, filp->f_pos, next->d_inode->i_ino, dt_type(next->d_inode)) < 0) |
1da177e4c
|
172 |
return 0; |
2fd6b7f50
|
173 174 |
spin_lock(&dentry->d_lock); spin_lock_nested(&next->d_lock, DENTRY_D_LOCK_NESTED); |
1da177e4c
|
175 |
/* next is still alive */ |
1bfba4e8e
|
176 |
list_move(q, p); |
2fd6b7f50
|
177 |
spin_unlock(&next->d_lock); |
1da177e4c
|
178 179 180 |
p = q; filp->f_pos++; } |
2fd6b7f50
|
181 |
spin_unlock(&dentry->d_lock); |
1da177e4c
|
182 183 184 185 186 187 188 189 |
} return 0; } ssize_t generic_read_dir(struct file *filp, char __user *buf, size_t siz, loff_t *ppos) { return -EISDIR; } |
4b6f5d20b
|
190 |
const struct file_operations simple_dir_operations = { |
1da177e4c
|
191 192 193 194 195 |
.open = dcache_dir_open, .release = dcache_dir_close, .llseek = dcache_dir_lseek, .read = generic_read_dir, .readdir = dcache_readdir, |
1b061d924
|
196 |
.fsync = noop_fsync, |
1da177e4c
|
197 |
}; |
92e1d5be9
|
198 |
const struct inode_operations simple_dir_inode_operations = { |
1da177e4c
|
199 200 |
.lookup = simple_lookup, }; |
759b9775c
|
201 202 203 |
static const struct super_operations simple_super_operations = { .statfs = simple_statfs, }; |
1da177e4c
|
204 205 206 207 |
/* * Common helper for pseudo-filesystems (sockfs, pipefs, bdev - stuff that * will never be mountable) */ |
51139adac
|
208 |
struct dentry *mount_pseudo(struct file_system_type *fs_type, char *name, |
c74a1cbb3
|
209 210 |
const struct super_operations *ops, const struct dentry_operations *dops, unsigned long magic) |
1da177e4c
|
211 212 |
{ struct super_block *s = sget(fs_type, NULL, set_anon_super, NULL); |
1da177e4c
|
213 214 215 216 217 |
struct dentry *dentry; struct inode *root; struct qstr d_name = {.name = name, .len = strlen(name)}; if (IS_ERR(s)) |
51139adac
|
218 |
return ERR_CAST(s); |
1da177e4c
|
219 220 |
s->s_flags = MS_NOUSER; |
89a4eb4b6
|
221 |
s->s_maxbytes = MAX_LFS_FILESIZE; |
3971e1a91
|
222 223 |
s->s_blocksize = PAGE_SIZE; s->s_blocksize_bits = PAGE_SHIFT; |
1da177e4c
|
224 |
s->s_magic = magic; |
759b9775c
|
225 |
s->s_op = ops ? ops : &simple_super_operations; |
1da177e4c
|
226 227 228 229 |
s->s_time_gran = 1; root = new_inode(s); if (!root) goto Enomem; |
1a1c9bb43
|
230 231 232 233 234 235 |
/* * since this is the first inode, make it number 1. New inodes created * after this must take care not to collide with it (by passing * max_reserved of 1 to iunique). */ root->i_ino = 1; |
1da177e4c
|
236 |
root->i_mode = S_IFDIR | S_IRUSR | S_IWUSR; |
1da177e4c
|
237 238 239 240 241 242 243 244 245 246 |
root->i_atime = root->i_mtime = root->i_ctime = CURRENT_TIME; dentry = d_alloc(NULL, &d_name); if (!dentry) { iput(root); goto Enomem; } dentry->d_sb = s; dentry->d_parent = dentry; d_instantiate(dentry, root); s->s_root = dentry; |
c74a1cbb3
|
247 |
s->s_d_op = dops; |
1da177e4c
|
248 |
s->s_flags |= MS_ACTIVE; |
51139adac
|
249 |
return dget(s->s_root); |
1da177e4c
|
250 251 |
Enomem: |
6f5bbff9a
|
252 |
deactivate_locked_super(s); |
51139adac
|
253 |
return ERR_PTR(-ENOMEM); |
1da177e4c
|
254 255 256 257 258 259 260 |
} int simple_link(struct dentry *old_dentry, struct inode *dir, struct dentry *dentry) { struct inode *inode = old_dentry->d_inode; inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME; |
d8c76e6f4
|
261 |
inc_nlink(inode); |
7de9c6ee3
|
262 |
ihold(inode); |
1da177e4c
|
263 264 265 266 |
dget(dentry); d_instantiate(dentry, inode); return 0; } |
1da177e4c
|
267 268 269 270 |
int simple_empty(struct dentry *dentry) { struct dentry *child; int ret = 0; |
2fd6b7f50
|
271 |
spin_lock(&dentry->d_lock); |
da5029563
|
272 273 274 275 |
list_for_each_entry(child, &dentry->d_subdirs, d_u.d_child) { spin_lock_nested(&child->d_lock, DENTRY_D_LOCK_NESTED); if (simple_positive(child)) { spin_unlock(&child->d_lock); |
1da177e4c
|
276 |
goto out; |
da5029563
|
277 278 279 |
} spin_unlock(&child->d_lock); } |
1da177e4c
|
280 281 |
ret = 1; out: |
2fd6b7f50
|
282 |
spin_unlock(&dentry->d_lock); |
1da177e4c
|
283 284 285 286 287 288 289 290 |
return ret; } int simple_unlink(struct inode *dir, struct dentry *dentry) { struct inode *inode = dentry->d_inode; inode->i_ctime = dir->i_ctime = dir->i_mtime = CURRENT_TIME; |
9a53c3a78
|
291 |
drop_nlink(inode); |
1da177e4c
|
292 293 294 295 296 297 298 299 |
dput(dentry); return 0; } int simple_rmdir(struct inode *dir, struct dentry *dentry) { if (!simple_empty(dentry)) return -ENOTEMPTY; |
9a53c3a78
|
300 |
drop_nlink(dentry->d_inode); |
1da177e4c
|
301 |
simple_unlink(dir, dentry); |
9a53c3a78
|
302 |
drop_nlink(dir); |
1da177e4c
|
303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 |
return 0; } int simple_rename(struct inode *old_dir, struct dentry *old_dentry, struct inode *new_dir, struct dentry *new_dentry) { struct inode *inode = old_dentry->d_inode; int they_are_dirs = S_ISDIR(old_dentry->d_inode->i_mode); if (!simple_empty(new_dentry)) return -ENOTEMPTY; if (new_dentry->d_inode) { simple_unlink(new_dir, new_dentry); if (they_are_dirs) |
9a53c3a78
|
318 |
drop_nlink(old_dir); |
1da177e4c
|
319 |
} else if (they_are_dirs) { |
9a53c3a78
|
320 |
drop_nlink(old_dir); |
d8c76e6f4
|
321 |
inc_nlink(new_dir); |
1da177e4c
|
322 323 324 325 326 327 328 |
} old_dir->i_ctime = old_dir->i_mtime = new_dir->i_ctime = new_dir->i_mtime = inode->i_ctime = CURRENT_TIME; return 0; } |
7bb46a673
|
329 |
/** |
eef2380c1
|
330 |
* simple_setattr - setattr for simple filesystem |
7bb46a673
|
331 332 333 334 335 |
* @dentry: dentry * @iattr: iattr structure * * Returns 0 on success, -error on failure. * |
eef2380c1
|
336 337 338 339 340 341 |
* simple_setattr is a simple ->setattr implementation without a proper * implementation of size changes. * * It can either be used for in-memory filesystems or special files * on simple regular filesystems. Anything that needs to change on-disk * or wire state on size changes needs its own setattr method. |
7bb46a673
|
342 343 344 345 346 |
*/ int simple_setattr(struct dentry *dentry, struct iattr *iattr) { struct inode *inode = dentry->d_inode; int error; |
eef2380c1
|
347 |
WARN_ON_ONCE(inode->i_op->truncate); |
7bb46a673
|
348 349 350 |
error = inode_change_ok(inode, iattr); if (error) return error; |
2c27c65ed
|
351 352 |
if (iattr->ia_valid & ATTR_SIZE) truncate_setsize(inode, iattr->ia_size); |
6a1a90ad1
|
353 |
setattr_copy(inode, iattr); |
eef2380c1
|
354 355 |
mark_inode_dirty(inode); return 0; |
7bb46a673
|
356 357 |
} EXPORT_SYMBOL(simple_setattr); |
1da177e4c
|
358 359 |
int simple_readpage(struct file *file, struct page *page) { |
c0d92cbc5
|
360 |
clear_highpage(page); |
1da177e4c
|
361 362 |
flush_dcache_page(page); SetPageUptodate(page); |
1da177e4c
|
363 364 365 |
unlock_page(page); return 0; } |
afddba49d
|
366 367 368 369 370 371 |
int simple_write_begin(struct file *file, struct address_space *mapping, loff_t pos, unsigned len, unsigned flags, struct page **pagep, void **fsdata) { struct page *page; pgoff_t index; |
afddba49d
|
372 373 |
index = pos >> PAGE_CACHE_SHIFT; |
afddba49d
|
374 |
|
54566b2c1
|
375 |
page = grab_cache_page_write_begin(mapping, index, flags); |
afddba49d
|
376 377 378 379 |
if (!page) return -ENOMEM; *pagep = page; |
193cf4b99
|
380 381 382 383 384 385 |
if (!PageUptodate(page) && (len != PAGE_CACHE_SIZE)) { unsigned from = pos & (PAGE_CACHE_SIZE - 1); zero_user_segments(page, 0, from, from + len, PAGE_CACHE_SIZE); } return 0; |
afddba49d
|
386 |
} |
ad2a722f1
|
387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 |
/** * simple_write_end - .write_end helper for non-block-device FSes * @available: See .write_end of address_space_operations * @file: " * @mapping: " * @pos: " * @len: " * @copied: " * @page: " * @fsdata: " * * simple_write_end does the minimum needed for updating a page after writing is * done. It has the same API signature as the .write_end of * address_space_operations vector. So it can just be set onto .write_end for * FSes that don't need any other processing. i_mutex is assumed to be held. * Block based filesystems should use generic_write_end(). * NOTE: Even though i_size might get updated by this function, mark_inode_dirty * is not called, so a filesystem that actually does store data in .write_inode * should extend on what's done here with a call to mark_inode_dirty() in the * case that i_size has changed. */ |
afddba49d
|
408 409 410 411 |
int simple_write_end(struct file *file, struct address_space *mapping, loff_t pos, unsigned len, unsigned copied, struct page *page, void *fsdata) { |
ad2a722f1
|
412 413 |
struct inode *inode = page->mapping->host; loff_t last_pos = pos + copied; |
afddba49d
|
414 415 416 |
/* zero the stale part of the page if we did a short copy */ if (copied < len) { |
ad2a722f1
|
417 418 419 |
unsigned from = pos & (PAGE_CACHE_SIZE - 1); zero_user(page, from + copied, len - copied); |
afddba49d
|
420 |
} |
ad2a722f1
|
421 422 423 424 425 426 427 428 |
if (!PageUptodate(page)) SetPageUptodate(page); /* * No need to use i_size_read() here, the i_size * cannot change under us because we hold the i_mutex. */ if (last_pos > inode->i_size) i_size_write(inode, last_pos); |
afddba49d
|
429 |
|
ad2a722f1
|
430 |
set_page_dirty(page); |
afddba49d
|
431 432 433 434 435 |
unlock_page(page); page_cache_release(page); return copied; } |
1a1c9bb43
|
436 437 438 439 440 |
/* * the inodes created here are not hashed. If you use iunique to generate * unique inode values later for this filesystem, then you must take care * to pass it an appropriate max_reserved value to avoid collisions. */ |
7d683a099
|
441 442 |
int simple_fill_super(struct super_block *s, unsigned long magic, struct tree_descr *files) |
1da177e4c
|
443 |
{ |
1da177e4c
|
444 445 446 447 448 449 450 451 |
struct inode *inode; struct dentry *root; struct dentry *dentry; int i; s->s_blocksize = PAGE_CACHE_SIZE; s->s_blocksize_bits = PAGE_CACHE_SHIFT; s->s_magic = magic; |
759b9775c
|
452 |
s->s_op = &simple_super_operations; |
1da177e4c
|
453 454 455 456 457 |
s->s_time_gran = 1; inode = new_inode(s); if (!inode) return -ENOMEM; |
1a1c9bb43
|
458 459 460 461 462 |
/* * because the root inode is 1, the files array must not contain an * entry at index 1 */ inode->i_ino = 1; |
1da177e4c
|
463 |
inode->i_mode = S_IFDIR | 0755; |
1da177e4c
|
464 465 466 |
inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME; inode->i_op = &simple_dir_inode_operations; inode->i_fop = &simple_dir_operations; |
7656f328f
|
467 |
inode->i_nlink = 2; |
1da177e4c
|
468 469 470 471 472 473 474 475 |
root = d_alloc_root(inode); if (!root) { iput(inode); return -ENOMEM; } for (i = 0; !files->name || files->name[0]; i++, files++) { if (!files->name) continue; |
1a1c9bb43
|
476 477 478 479 480 481 482 |
/* warn if it tries to conflict with the root inode */ if (unlikely(i == 1)) printk(KERN_WARNING "%s: %s passed in a files array" "with an index of 1! ", __func__, s->s_type->name); |
1da177e4c
|
483 484 485 486 487 488 489 |
dentry = d_alloc_name(root, files->name); if (!dentry) goto out; inode = new_inode(s); if (!inode) goto out; inode->i_mode = S_IFREG | files->mode; |
1da177e4c
|
490 491 492 493 494 495 496 497 498 499 500 501 502 503 |
inode->i_atime = inode->i_mtime = inode->i_ctime = CURRENT_TIME; inode->i_fop = files->ops; inode->i_ino = i; d_add(dentry, inode); } s->s_root = root; return 0; out: d_genocide(root); dput(root); return -ENOMEM; } static DEFINE_SPINLOCK(pin_fs_lock); |
1f5ce9e93
|
504 |
int simple_pin_fs(struct file_system_type *type, struct vfsmount **mount, int *count) |
1da177e4c
|
505 506 507 508 509 |
{ struct vfsmount *mnt = NULL; spin_lock(&pin_fs_lock); if (unlikely(!*mount)) { spin_unlock(&pin_fs_lock); |
1f5ce9e93
|
510 |
mnt = vfs_kern_mount(type, 0, type->name, NULL); |
1da177e4c
|
511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 |
if (IS_ERR(mnt)) return PTR_ERR(mnt); spin_lock(&pin_fs_lock); if (!*mount) *mount = mnt; } mntget(*mount); ++*count; spin_unlock(&pin_fs_lock); mntput(mnt); return 0; } void simple_release_fs(struct vfsmount **mount, int *count) { struct vfsmount *mnt; spin_lock(&pin_fs_lock); mnt = *mount; if (!--*count) *mount = NULL; spin_unlock(&pin_fs_lock); mntput(mnt); } |
6d1029b56
|
534 535 536 537 538 539 540 541 542 543 544 545 546 547 |
/** * simple_read_from_buffer - copy data from the buffer to user space * @to: the user space buffer to read to * @count: the maximum number of bytes to read * @ppos: the current position in the buffer * @from: the buffer to read from * @available: the size of the buffer * * The simple_read_from_buffer() function reads up to @count bytes from the * buffer @from at offset @ppos into the user space address starting at @to. * * On success, the number of bytes read is returned and the offset @ppos is * advanced by this number, or negative value is returned on error. **/ |
1da177e4c
|
548 549 550 551 |
ssize_t simple_read_from_buffer(void __user *to, size_t count, loff_t *ppos, const void *from, size_t available) { loff_t pos = *ppos; |
14be27460
|
552 |
size_t ret; |
1da177e4c
|
553 554 |
if (pos < 0) return -EINVAL; |
14be27460
|
555 |
if (pos >= available || !count) |
1da177e4c
|
556 557 558 |
return 0; if (count > available - pos) count = available - pos; |
14be27460
|
559 560 |
ret = copy_to_user(to, from + pos, count); if (ret == count) |
1da177e4c
|
561 |
return -EFAULT; |
14be27460
|
562 |
count -= ret; |
1da177e4c
|
563 564 565 |
*ppos = pos + count; return count; } |
6d1029b56
|
566 |
/** |
6a727b43b
|
567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 |
* simple_write_to_buffer - copy data from user space to the buffer * @to: the buffer to write to * @available: the size of the buffer * @ppos: the current position in the buffer * @from: the user space buffer to read from * @count: the maximum number of bytes to read * * The simple_write_to_buffer() function reads up to @count bytes from the user * space address starting at @from into the buffer @to at offset @ppos. * * On success, the number of bytes written is returned and the offset @ppos is * advanced by this number, or negative value is returned on error. **/ ssize_t simple_write_to_buffer(void *to, size_t available, loff_t *ppos, const void __user *from, size_t count) { loff_t pos = *ppos; size_t res; if (pos < 0) return -EINVAL; if (pos >= available || !count) return 0; if (count > available - pos) count = available - pos; res = copy_from_user(to + pos, from, count); if (res == count) return -EFAULT; count -= res; *ppos = pos + count; return count; } /** |
6d1029b56
|
601 602 603 604 605 606 607 608 609 610 611 612 613 |
* memory_read_from_buffer - copy data from the buffer * @to: the kernel space buffer to read to * @count: the maximum number of bytes to read * @ppos: the current position in the buffer * @from: the buffer to read from * @available: the size of the buffer * * The memory_read_from_buffer() function reads up to @count bytes from the * buffer @from at offset @ppos into the kernel space address starting at @to. * * On success, the number of bytes read is returned and the offset @ppos is * advanced by this number, or negative value is returned on error. **/ |
93b071139
|
614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 |
ssize_t memory_read_from_buffer(void *to, size_t count, loff_t *ppos, const void *from, size_t available) { loff_t pos = *ppos; if (pos < 0) return -EINVAL; if (pos >= available) return 0; if (count > available - pos) count = available - pos; memcpy(to, from + pos, count); *ppos = pos + count; return count; } |
1da177e4c
|
630 631 632 633 634 635 |
/* * Transaction based IO. * The file expects a single write which triggers the transaction, and then * possibly a read which collects the result - which is stored in a * file-local buffer. */ |
76791ab2d
|
636 637 638 639 640 641 642 643 644 645 646 647 648 649 |
void simple_transaction_set(struct file *file, size_t n) { struct simple_transaction_argresp *ar = file->private_data; BUG_ON(n > SIMPLE_TRANSACTION_LIMIT); /* * The barrier ensures that ar->size will really remain zero until * ar->data is ready for reading. */ smp_mb(); ar->size = n; } |
1da177e4c
|
650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 |
char *simple_transaction_get(struct file *file, const char __user *buf, size_t size) { struct simple_transaction_argresp *ar; static DEFINE_SPINLOCK(simple_transaction_lock); if (size > SIMPLE_TRANSACTION_LIMIT - 1) return ERR_PTR(-EFBIG); ar = (struct simple_transaction_argresp *)get_zeroed_page(GFP_KERNEL); if (!ar) return ERR_PTR(-ENOMEM); spin_lock(&simple_transaction_lock); /* only one write allowed per open */ if (file->private_data) { spin_unlock(&simple_transaction_lock); free_page((unsigned long)ar); return ERR_PTR(-EBUSY); } file->private_data = ar; spin_unlock(&simple_transaction_lock); if (copy_from_user(ar->data, buf, size)) return ERR_PTR(-EFAULT); return ar->data; } ssize_t simple_transaction_read(struct file *file, char __user *buf, size_t size, loff_t *pos) { struct simple_transaction_argresp *ar = file->private_data; if (!ar) return 0; return simple_read_from_buffer(buf, size, pos, ar->data, ar->size); } int simple_transaction_release(struct inode *inode, struct file *file) { free_page((unsigned long)file->private_data); return 0; } |
acaefc25d
|
695 696 697 |
/* Simple attribute files */ struct simple_attr { |
8b88b0998
|
698 699 |
int (*get)(void *, u64 *); int (*set)(void *, u64); |
acaefc25d
|
700 701 702 703 704 |
char get_buf[24]; /* enough to store a u64 and " \0" */ char set_buf[24]; void *data; const char *fmt; /* format for read operation */ |
7cf34c761
|
705 |
struct mutex mutex; /* protects access to these buffers */ |
acaefc25d
|
706 707 708 709 710 |
}; /* simple_attr_open is called by an actual attribute open file operation * to set the attribute specific access operations. */ int simple_attr_open(struct inode *inode, struct file *file, |
8b88b0998
|
711 |
int (*get)(void *, u64 *), int (*set)(void *, u64), |
acaefc25d
|
712 713 714 715 716 717 718 719 720 721 |
const char *fmt) { struct simple_attr *attr; attr = kmalloc(sizeof(*attr), GFP_KERNEL); if (!attr) return -ENOMEM; attr->get = get; attr->set = set; |
8e18e2941
|
722 |
attr->data = inode->i_private; |
acaefc25d
|
723 |
attr->fmt = fmt; |
7cf34c761
|
724 |
mutex_init(&attr->mutex); |
acaefc25d
|
725 726 727 728 729 |
file->private_data = attr; return nonseekable_open(inode, file); } |
74bedc4d5
|
730 |
int simple_attr_release(struct inode *inode, struct file *file) |
acaefc25d
|
731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 |
{ kfree(file->private_data); return 0; } /* read from the buffer that is filled with the get function */ ssize_t simple_attr_read(struct file *file, char __user *buf, size_t len, loff_t *ppos) { struct simple_attr *attr; size_t size; ssize_t ret; attr = file->private_data; if (!attr->get) return -EACCES; |
9261303ab
|
748 749 750 |
ret = mutex_lock_interruptible(&attr->mutex); if (ret) return ret; |
8b88b0998
|
751 |
if (*ppos) { /* continued read */ |
acaefc25d
|
752 |
size = strlen(attr->get_buf); |
8b88b0998
|
753 754 755 756 757 |
} else { /* first read */ u64 val; ret = attr->get(attr->data, &val); if (ret) goto out; |
acaefc25d
|
758 |
size = scnprintf(attr->get_buf, sizeof(attr->get_buf), |
8b88b0998
|
759 760 |
attr->fmt, (unsigned long long)val); } |
acaefc25d
|
761 762 |
ret = simple_read_from_buffer(buf, len, ppos, attr->get_buf, size); |
8b88b0998
|
763 |
out: |
7cf34c761
|
764 |
mutex_unlock(&attr->mutex); |
acaefc25d
|
765 766 767 768 769 770 771 772 773 774 775 776 777 |
return ret; } /* interpret the buffer as a number to call the set function with */ ssize_t simple_attr_write(struct file *file, const char __user *buf, size_t len, loff_t *ppos) { struct simple_attr *attr; u64 val; size_t size; ssize_t ret; attr = file->private_data; |
acaefc25d
|
778 779 |
if (!attr->set) return -EACCES; |
9261303ab
|
780 781 782 |
ret = mutex_lock_interruptible(&attr->mutex); if (ret) return ret; |
acaefc25d
|
783 784 785 786 |
ret = -EFAULT; size = min(sizeof(attr->set_buf) - 1, len); if (copy_from_user(attr->set_buf, buf, size)) goto out; |
acaefc25d
|
787 788 |
attr->set_buf[size] = '\0'; val = simple_strtol(attr->set_buf, NULL, 0); |
05cc0cee6
|
789 790 791 |
ret = attr->set(attr->data, val); if (ret == 0) ret = len; /* on success, claim we got the whole input */ |
acaefc25d
|
792 |
out: |
7cf34c761
|
793 |
mutex_unlock(&attr->mutex); |
acaefc25d
|
794 795 |
return ret; } |
2596110a3
|
796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 |
/** * generic_fh_to_dentry - generic helper for the fh_to_dentry export operation * @sb: filesystem to do the file handle conversion on * @fid: file handle to convert * @fh_len: length of the file handle in bytes * @fh_type: type of file handle * @get_inode: filesystem callback to retrieve inode * * This function decodes @fid as long as it has one of the well-known * Linux filehandle types and calls @get_inode on it to retrieve the * inode for the object specified in the file handle. */ struct dentry *generic_fh_to_dentry(struct super_block *sb, struct fid *fid, int fh_len, int fh_type, struct inode *(*get_inode) (struct super_block *sb, u64 ino, u32 gen)) { struct inode *inode = NULL; if (fh_len < 2) return NULL; switch (fh_type) { case FILEID_INO32_GEN: case FILEID_INO32_GEN_PARENT: inode = get_inode(sb, fid->i32.ino, fid->i32.gen); break; } |
4ea3ada29
|
823 |
return d_obtain_alias(inode); |
2596110a3
|
824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 |
} EXPORT_SYMBOL_GPL(generic_fh_to_dentry); /** * generic_fh_to_dentry - generic helper for the fh_to_parent export operation * @sb: filesystem to do the file handle conversion on * @fid: file handle to convert * @fh_len: length of the file handle in bytes * @fh_type: type of file handle * @get_inode: filesystem callback to retrieve inode * * This function decodes @fid as long as it has one of the well-known * Linux filehandle types and calls @get_inode on it to retrieve the * inode for the _parent_ object specified in the file handle if it * is specified in the file handle, or NULL otherwise. */ struct dentry *generic_fh_to_parent(struct super_block *sb, struct fid *fid, int fh_len, int fh_type, struct inode *(*get_inode) (struct super_block *sb, u64 ino, u32 gen)) { struct inode *inode = NULL; if (fh_len <= 2) return NULL; switch (fh_type) { case FILEID_INO32_GEN_PARENT: inode = get_inode(sb, fid->i32.parent_ino, (fh_len > 3 ? fid->i32.parent_gen : 0)); break; } |
4ea3ada29
|
855 |
return d_obtain_alias(inode); |
2596110a3
|
856 857 |
} EXPORT_SYMBOL_GPL(generic_fh_to_parent); |
1b061d924
|
858 859 860 861 862 863 864 865 866 867 |
/** * generic_file_fsync - generic fsync implementation for simple filesystems * @file: file to synchronize * @datasync: only synchronize essential metadata if true * * This is a generic implementation of the fsync method for simple * filesystems which track all non-inode metadata in the buffers list * hanging off the address_space structure. */ int generic_file_fsync(struct file *file, int datasync) |
d5aacad54
|
868 |
{ |
7ea808591
|
869 |
struct inode *inode = file->f_mapping->host; |
d5aacad54
|
870 871 872 873 874 875 876 877 |
int err; int ret; ret = sync_mapping_buffers(inode->i_mapping); if (!(inode->i_state & I_DIRTY)) return ret; if (datasync && !(inode->i_state & I_DIRTY_DATASYNC)) return ret; |
c37650161
|
878 |
err = sync_inode_metadata(inode, 1); |
d5aacad54
|
879 880 881 882 |
if (ret == 0) ret = err; return ret; } |
1b061d924
|
883 |
EXPORT_SYMBOL(generic_file_fsync); |
30ca22c70
|
884 885 886 887 888 889 890 891 892 893 894 895 |
/** * generic_check_addressable - Check addressability of file system * @blocksize_bits: log of file system block size * @num_blocks: number of blocks in file system * * Determine whether a file system with @num_blocks blocks (and a * block size of 2**@blocksize_bits) is addressable by the sector_t * and page cache of the system. Return 0 if so and -EFBIG otherwise. */ int generic_check_addressable(unsigned blocksize_bits, u64 num_blocks) { u64 last_fs_block = num_blocks - 1; |
a33f13efe
|
896 897 |
u64 last_fs_page = last_fs_block >> (PAGE_CACHE_SHIFT - blocksize_bits); |
30ca22c70
|
898 899 900 901 902 903 |
if (unlikely(num_blocks == 0)) return 0; if ((blocksize_bits < 9) || (blocksize_bits > PAGE_CACHE_SHIFT)) return -EINVAL; |
a33f13efe
|
904 905 |
if ((last_fs_block > (sector_t)(~0ULL) >> (blocksize_bits - 9)) || (last_fs_page > (pgoff_t)(~0ULL))) { |
30ca22c70
|
906 907 908 909 910 |
return -EFBIG; } return 0; } EXPORT_SYMBOL(generic_check_addressable); |
1b061d924
|
911 912 913 914 915 916 917 |
/* * No-op implementation of ->fsync for in-memory filesystems. */ int noop_fsync(struct file *file, int datasync) { return 0; } |
d5aacad54
|
918 |
|
1da177e4c
|
919 920 921 922 923 |
EXPORT_SYMBOL(dcache_dir_close); EXPORT_SYMBOL(dcache_dir_lseek); EXPORT_SYMBOL(dcache_dir_open); EXPORT_SYMBOL(dcache_readdir); EXPORT_SYMBOL(generic_read_dir); |
51139adac
|
924 |
EXPORT_SYMBOL(mount_pseudo); |
afddba49d
|
925 926 |
EXPORT_SYMBOL(simple_write_begin); EXPORT_SYMBOL(simple_write_end); |
1da177e4c
|
927 928 929 |
EXPORT_SYMBOL(simple_dir_inode_operations); EXPORT_SYMBOL(simple_dir_operations); EXPORT_SYMBOL(simple_empty); |
1da177e4c
|
930 931 932 933 934 |
EXPORT_SYMBOL(simple_fill_super); EXPORT_SYMBOL(simple_getattr); EXPORT_SYMBOL(simple_link); EXPORT_SYMBOL(simple_lookup); EXPORT_SYMBOL(simple_pin_fs); |
1da177e4c
|
935 936 937 938 939 |
EXPORT_SYMBOL(simple_readpage); EXPORT_SYMBOL(simple_release_fs); EXPORT_SYMBOL(simple_rename); EXPORT_SYMBOL(simple_rmdir); EXPORT_SYMBOL(simple_statfs); |
1b061d924
|
940 |
EXPORT_SYMBOL(noop_fsync); |
1da177e4c
|
941 942 |
EXPORT_SYMBOL(simple_unlink); EXPORT_SYMBOL(simple_read_from_buffer); |
6a727b43b
|
943 |
EXPORT_SYMBOL(simple_write_to_buffer); |
93b071139
|
944 |
EXPORT_SYMBOL(memory_read_from_buffer); |
76791ab2d
|
945 |
EXPORT_SYMBOL(simple_transaction_set); |
1da177e4c
|
946 947 948 |
EXPORT_SYMBOL(simple_transaction_get); EXPORT_SYMBOL(simple_transaction_read); EXPORT_SYMBOL(simple_transaction_release); |
acaefc25d
|
949 |
EXPORT_SYMBOL_GPL(simple_attr_open); |
74bedc4d5
|
950 |
EXPORT_SYMBOL_GPL(simple_attr_release); |
acaefc25d
|
951 952 |
EXPORT_SYMBOL_GPL(simple_attr_read); EXPORT_SYMBOL_GPL(simple_attr_write); |