include/linux/mm.h

/* */
This source file includes following definitions.
get_free_page
expand_stack
find_vma
find_vma_intersection
   1 #ifndef _LINUX_MM_H
   2 #define _LINUX_MM_H
   3 
   4 #include <linux/sched.h>
   5 #include <linux/errno.h>
   6 #include <linux/kernel.h>
   7 #include <linux/string.h>
   8 
   9 extern unsigned long high_memory;
  10 
  11 #include <asm/page.h>
  12 
  13 #ifdef __KERNEL__
  14 
  15 #define VERIFY_READ 0
  16 #define VERIFY_WRITE 1
  17 
  18 extern int verify_area(int, const void *, unsigned long);
  19 
  20 /*
  21  * Linux kernel virtual memory manager primitives.
  22  * The idea being to have a "virtual" mm in the same way
  23  * we have a virtual fs - giving a cleaner interface to the
  24  * mm details, and allowing different kinds of memory mappings
  25  * (from shared memory to executable loading to arbitrary
  26  * mmap() functions).
  27  */
  28 
  29 /*
  30  * This struct defines a memory VMM memory area. There is one of these
  31  * per VM-area/task.  A VM area is any part of the process virtual memory
  32  * space that has a special rule for the page-fault handlers (ie a shared
  33  * library, the executable area etc).
  34  */
  35 struct vm_area_struct {
  36         struct mm_struct * vm_mm;       /* VM area parameters */
  37         unsigned long vm_start;
  38         unsigned long vm_end;
  39         pgprot_t vm_page_prot;
  40         unsigned short vm_flags;
  41 /* AVL tree of VM areas per task, sorted by address */
  42         short vm_avl_height;
  43         struct vm_area_struct * vm_avl_left;
  44         struct vm_area_struct * vm_avl_right;
  45 /* linked list of VM areas per task, sorted by address */
  46         struct vm_area_struct * vm_next;
  47 /* for areas with inode, the circular list inode->i_mmap */
  48 /* for shm areas, the circular list of attaches */
  49 /* otherwise unused */
  50         struct vm_area_struct * vm_next_share;
  51         struct vm_area_struct * vm_prev_share;
  52 /* more */
  53         struct vm_operations_struct * vm_ops;
  54         unsigned long vm_offset;
  55         struct inode * vm_inode;
  56         unsigned long vm_pte;                   /* shared mem */
  57 };
  58 
  59 /*
  60  * vm_flags..
  61  */
  62 #define VM_READ         0x0001  /* currently active flags */
  63 #define VM_WRITE        0x0002
  64 #define VM_EXEC         0x0004
  65 #define VM_SHARED       0x0008
  66 
  67 #define VM_MAYREAD      0x0010  /* limits for mprotect() etc */
  68 #define VM_MAYWRITE     0x0020
  69 #define VM_MAYEXEC      0x0040
  70 #define VM_MAYSHARE     0x0080
  71 
  72 #define VM_GROWSDOWN    0x0100  /* general info on the segment */
  73 #define VM_GROWSUP      0x0200
  74 #define VM_SHM          0x0400  /* shared memory area, don't swap out */
  75 #define VM_DENYWRITE    0x0800  /* ETXTBSY on write attempts.. */
  76 
  77 #define VM_EXECUTABLE   0x1000
  78 #define VM_LOCKED       0x2000
  79 
  80 #define VM_STACK_FLAGS  0x0177
  81 
  82 /*
  83  * mapping from the currently active vm_flags protection bits (the
  84  * low four bits) to a page protection mask..
  85  */
  86 extern pgprot_t protection_map[16];
  87 
  88 
  89 /*
  90  * These are the virtual MM functions - opening of an area, closing and
  91  * unmapping it (needed to keep files on disk up-to-date etc), pointer
  92  * to the functions called when a no-page or a wp-page exception occurs. 
  93  */
  94 struct vm_operations_struct {
  95         void (*open)(struct vm_area_struct * area);
  96         void (*close)(struct vm_area_struct * area);
  97         void (*unmap)(struct vm_area_struct *area, unsigned long, size_t);
  98         void (*protect)(struct vm_area_struct *area, unsigned long, size_t, unsigned int newprot);
  99         int (*sync)(struct vm_area_struct *area, unsigned long, size_t, unsigned int flags);
 100         void (*advise)(struct vm_area_struct *area, unsigned long, size_t, unsigned int advise);
 101         unsigned long (*nopage)(struct vm_area_struct * area, unsigned long address, int write_access);
 102         unsigned long (*wppage)(struct vm_area_struct * area, unsigned long address,
 103                 unsigned long page);
 104         int (*swapout)(struct vm_area_struct *,  unsigned long, pte_t *);
 105         pte_t (*swapin)(struct vm_area_struct *, unsigned long, unsigned long);
 106 };
 107 
 108 /*
 109  * Try to keep the most commonly accessed fields in single cache lines
 110  * here (16 bytes or greater).  This ordering should be particularly
 111  * beneficial on 32-bit processors.
 112  *
 113  * The first line is data used in linear searches (eg. clock algorithm
 114  * scans).  The second line is data used in page searches through the
 115  * page-cache.  -- sct 
 116  */
 117 typedef struct page {
 118         unsigned int count;
 119         unsigned dirty:16,
 120                  age:8,
 121                  uptodate:1,
 122                  error:1,
 123                  referenced:1,
 124                  locked:1,
 125                  free_after:1,
 126                  dma:1,
 127                  unused:1,
 128                  reserved:1;
 129         struct wait_queue *wait;
 130         struct page *next;
 131 
 132         struct page *next_hash;
 133         unsigned long offset;
 134         struct inode *inode;
 135         struct page *write_list;
 136 
 137         struct page *prev;
 138         struct page *prev_hash;
 139         struct buffer_head * buffers;
 140 } mem_map_t;
 141 
 142 extern mem_map_t * mem_map;
 143 
 144 /*
 145  * This is timing-critical - most of the time in getting a new page
 146  * goes to clearing the page. If you want a page without the clearing
 147  * overhead, just use __get_free_page() directly..
 148  */
 149 #define __get_free_page(priority) __get_free_pages((priority),0,0)
 150 #define __get_dma_pages(priority, order) __get_free_pages((priority),(order),1)
 151 extern unsigned long __get_free_pages(int priority, unsigned long gfporder, int dma);
 152 
 153 extern inline unsigned long get_free_page(int priority)
     /*  */
 154 {
 155         unsigned long page;
 156 
 157         page = __get_free_page(priority);
 158         if (page)
 159                 memset((void *) page, 0, PAGE_SIZE);
 160         return page;
 161 }
 162 
 163 /* memory.c & swap.c*/
 164 
 165 #define free_page(addr) free_pages((addr),0)
 166 extern void free_pages(unsigned long addr, unsigned long order);
 167 
 168 extern void show_free_areas(void);
 169 extern unsigned long put_dirty_page(struct task_struct * tsk,unsigned long page,
 170         unsigned long address);
 171 
 172 extern void free_page_tables(struct task_struct * tsk);
 173 extern void clear_page_tables(struct task_struct * tsk);
 174 extern int new_page_tables(struct task_struct * tsk);
 175 extern int copy_page_tables(struct task_struct * to);
 176 
 177 extern int zap_page_range(struct mm_struct *mm, unsigned long address, unsigned long size);
 178 extern int copy_page_range(struct mm_struct *dst, struct mm_struct *src, struct vm_area_struct *vma);
 179 extern int remap_page_range(unsigned long from, unsigned long to, unsigned long size, pgprot_t prot);
 180 extern int zeromap_page_range(unsigned long from, unsigned long size, pgprot_t prot);
 181 
 182 extern void vmtruncate(struct inode * inode, unsigned long offset);
 183 extern void handle_mm_fault(struct vm_area_struct *vma, unsigned long address, int write_access);
 184 extern void do_wp_page(struct task_struct * tsk, struct vm_area_struct * vma, unsigned long address, int write_access);
 185 extern void do_no_page(struct task_struct * tsk, struct vm_area_struct * vma, unsigned long address, int write_access);
 186 
 187 extern unsigned long paging_init(unsigned long start_mem, unsigned long end_mem);
 188 extern void mem_init(unsigned long start_mem, unsigned long end_mem);
 189 extern void show_mem(void);
 190 extern void oom(struct task_struct * tsk);
 191 extern void si_meminfo(struct sysinfo * val);
 192 
 193 /* vmalloc.c */
 194 
 195 extern void * vmalloc(unsigned long size);
 196 extern void * vremap(unsigned long offset, unsigned long size);
 197 extern void vfree(void * addr);
 198 extern int vread(char *buf, char *addr, int count);
 199 
 200 /* mmap.c */
 201 extern unsigned long do_mmap(struct file * file, unsigned long addr, unsigned long len,
 202         unsigned long prot, unsigned long flags, unsigned long off);
 203 extern void merge_segments(struct task_struct *, unsigned long, unsigned long);
 204 extern void insert_vm_struct(struct task_struct *, struct vm_area_struct *);
 205 extern void remove_shared_vm_struct(struct vm_area_struct *);
 206 extern void build_mmap_avl(struct mm_struct *);
 207 extern void exit_mmap(struct mm_struct *);
 208 extern int do_munmap(unsigned long, size_t);
 209 extern unsigned long get_unmapped_area(unsigned long, unsigned long);
 210 
 211 /* filemap.c */
 212 extern unsigned long page_unuse(unsigned long);
 213 extern int shrink_mmap(int, int);
 214 extern void truncate_inode_pages(struct inode *, unsigned long);
 215 
 216 #define GFP_BUFFER      0x00
 217 #define GFP_ATOMIC      0x01
 218 #define GFP_USER        0x02
 219 #define GFP_KERNEL      0x03
 220 #define GFP_NOBUFFER    0x04
 221 #define GFP_NFS         0x05
 222 
 223 /* Flag - indicates that the buffer will be suitable for DMA.  Ignored on some
 224    platforms, used as appropriate on others */
 225 
 226 #define GFP_DMA         0x80
 227 
 228 #define GFP_LEVEL_MASK 0xf
 229 
 230 /* vma is the first one with  address < vma->vm_end,
 231  * and even  address < vma->vm_start. Have to extend vma. */
 232 static inline int expand_stack(struct vm_area_struct * vma, unsigned long address)
     /*  */
 233 {
 234         unsigned long grow;
 235 
 236         address &= PAGE_MASK;
 237         if (vma->vm_end - address > current->rlim[RLIMIT_STACK].rlim_cur)
 238                 return -ENOMEM;
 239         grow = vma->vm_start - address;
 240         vma->vm_start = address;
 241         vma->vm_offset -= grow;
 242         vma->vm_mm->total_vm += grow >> PAGE_SHIFT;
 243         if (vma->vm_flags & VM_LOCKED)
 244                 vma->vm_mm->locked_vm += grow >> PAGE_SHIFT;
 245         return 0;
 246 }
 247 
 248 #define avl_empty       (struct vm_area_struct *) NULL
 249 
 250 /* Look up the first VMA which satisfies  addr < vm_end,  NULL if none. */
 251 static inline struct vm_area_struct * find_vma (struct task_struct * task, unsigned long addr)
     /*  */
 252 {
 253         struct vm_area_struct * result = NULL;
 254         struct vm_area_struct * tree;
 255 
 256         if (!task->mm)
 257                 return NULL;
 258         for (tree = task->mm->mmap_avl ; ; ) {
 259                 if (tree == avl_empty)
 260                         return result;
 261                 if (tree->vm_end > addr) {
 262                         if (tree->vm_start <= addr)
 263                                 return tree;
 264                         result = tree;
 265                         tree = tree->vm_avl_left;
 266                 } else
 267                         tree = tree->vm_avl_right;
 268         }
 269 }
 270 
 271 /* Look up the first VMA which intersects the interval start_addr..end_addr-1,
 272    NULL if none.  Assume start_addr < end_addr. */
 273 static inline struct vm_area_struct * find_vma_intersection (struct task_struct * task, unsigned long start_addr, unsigned long end_addr)
     /*  */
 274 {
 275         struct vm_area_struct * vma;
 276 
 277         vma = find_vma(task,start_addr);
 278         if (!vma || end_addr <= vma->vm_start)
 279                 return NULL;
 280         return vma;
 281 }
 282 
 283 #endif /* __KERNEL__ */
 284 
 285 #endif
/* */
root/include/linux/mm.h

INCLUDED FROM

DEFINITIONS
