1 /* 2 * Copyright (c) 2015-2020 François Tigeot <ftigeot@wolfpond.org> 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice unmodified, this list of conditions, and the following 10 * disclaimer. 11 * 2. Redistributions in binary form must reproduce the above copyright 12 * notice, this list of conditions and the following disclaimer in the 13 * documentation and/or other materials provided with the distribution. 14 * 15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR 16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, 19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF 24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 25 */ 26 27 #ifndef _LINUX_FS_H_ 28 #define _LINUX_FS_H_ 29 30 #include <linux/wait_bit.h> 31 #include <linux/cache.h> 32 #include <linux/stat.h> 33 #include <linux/list.h> 34 #include <linux/llist.h> 35 #include <linux/radix-tree.h> 36 #include <linux/rbtree.h> 37 #include <linux/init.h> 38 #include <linux/pid.h> 39 #include <linux/bug.h> 40 #include <linux/mutex.h> 41 #include <linux/capability.h> 42 #include <linux/atomic.h> 43 #include <linux/shrinker.h> 44 #include <linux/lockdep.h> 45 #include <linux/workqueue.h> 46 #include <linux/uuid.h> 47 48 #include <sys/file.h> /* for struct file */ 49 #include <sys/vnode.h> /* for struct vnode */ 50 51 struct address_space; 52 53 struct poll_table_struct; 54 struct vm_area_struct; 55 56 struct inode; 57 58 static inline unsigned imajor(const struct inode *inode) 59 { 60 const struct vnode *vp = (const void *)inode; 61 62 return vp->v_umajor; 63 } 64 65 static inline unsigned iminor(const struct inode *inode) 66 { 67 const struct vnode *vp = (const void *)inode; 68 69 return vp->v_uminor; 70 } 71 72 struct file_operations { 73 struct module *owner; 74 int (*open) (struct inode *, struct file *); 75 int (*release) (struct inode *, struct file *); 76 long (*unlocked_ioctl) (struct file *, unsigned int, unsigned long); 77 int (*mmap) (struct file *, struct vm_area_struct *); 78 unsigned int (*poll) (struct file *, struct poll_table_struct *); 79 ssize_t (*read) (struct file *, char __user *, size_t, loff_t *); 80 loff_t (*llseek) (struct file *, loff_t, int); 81 }; 82 83 extern loff_t noop_llseek(struct file *file, loff_t offset, int whence); 84 85 static inline unsigned long 86 invalidate_mapping_pages(struct vm_object *obj, pgoff_t start, pgoff_t end) 87 { 88 int start_count, end_count, clean_only = 1; 89 90 /* 91 * XXX - resident_page_count no longer represents the 92 * number of pages that might be mapped. 93 * 94 * All current use cases ignore the return value. 95 */ 96 VM_OBJECT_LOCK(obj); 97 start_count = obj->resident_page_count; 98 /* Only non-dirty pages must be freed or invalidated */ 99 vm_object_page_remove(obj, start, end, clean_only); 100 end_count = obj->resident_page_count; 101 VM_OBJECT_UNLOCK(obj); 102 return (start_count - end_count); 103 } 104 105 int pagecache_write_begin(struct vm_object *obj, struct address_space *mapping, 106 loff_t pos, unsigned len, unsigned flags, struct page **pagep, void **fsdata); 107 108 int pagecache_write_end(struct vm_object *obj, struct address_space *mapping, 109 loff_t pos, unsigned len, unsigned copied, struct page *page, void *fsdata); 110 111 #endif /* _LINUX_FS_H_ */ 112