Andrew Morton | 16d6926 | 2008-07-25 19:44:36 -0700 | [diff] [blame] | 1 | #include <linux/mm.h> |
Matt Mackall | 30992c9 | 2006-01-08 01:01:43 -0800 | [diff] [blame] | 2 | #include <linux/slab.h> |
| 3 | #include <linux/string.h> |
Gideon Israel Dsouza | 3b32123 | 2014-04-07 15:37:26 -0700 | [diff] [blame] | 4 | #include <linux/compiler.h> |
Paul Gortmaker | b95f1b31 | 2011-10-16 02:01:52 -0400 | [diff] [blame] | 5 | #include <linux/export.h> |
Davi Arnaut | 96840aa | 2006-03-24 03:18:42 -0800 | [diff] [blame] | 6 | #include <linux/err.h> |
Adrian Bunk | 3b8f14b | 2008-07-26 15:22:28 -0700 | [diff] [blame] | 7 | #include <linux/sched.h> |
Al Viro | eb36c58 | 2012-05-30 20:17:35 -0400 | [diff] [blame] | 8 | #include <linux/security.h> |
Shaohua Li | 9800339 | 2013-02-22 16:34:35 -0800 | [diff] [blame] | 9 | #include <linux/swap.h> |
Shaohua Li | 33806f0 | 2013-02-22 16:34:37 -0800 | [diff] [blame] | 10 | #include <linux/swapops.h> |
Jerome Marchand | 00619bc | 2013-11-12 15:08:31 -0800 | [diff] [blame] | 11 | #include <linux/mman.h> |
| 12 | #include <linux/hugetlb.h> |
Al Viro | 39f1f78 | 2014-05-06 14:02:53 -0400 | [diff] [blame] | 13 | #include <linux/vmalloc.h> |
Jerome Marchand | 00619bc | 2013-11-12 15:08:31 -0800 | [diff] [blame] | 14 | |
Andrzej Hajda | a4bb1e4 | 2015-02-13 14:36:24 -0800 | [diff] [blame] | 15 | #include <asm/sections.h> |
Davi Arnaut | 96840aa | 2006-03-24 03:18:42 -0800 | [diff] [blame] | 16 | #include <asm/uaccess.h> |
Matt Mackall | 30992c9 | 2006-01-08 01:01:43 -0800 | [diff] [blame] | 17 | |
Namhyung Kim | 6038def | 2011-05-24 17:11:22 -0700 | [diff] [blame] | 18 | #include "internal.h" |
| 19 | |
Andrzej Hajda | a4bb1e4 | 2015-02-13 14:36:24 -0800 | [diff] [blame] | 20 | static inline int is_kernel_rodata(unsigned long addr) |
| 21 | { |
| 22 | return addr >= (unsigned long)__start_rodata && |
| 23 | addr < (unsigned long)__end_rodata; |
| 24 | } |
| 25 | |
| 26 | /** |
| 27 | * kfree_const - conditionally free memory |
| 28 | * @x: pointer to the memory |
| 29 | * |
| 30 | * Function calls kfree only if @x is not in .rodata section. |
| 31 | */ |
| 32 | void kfree_const(const void *x) |
| 33 | { |
| 34 | if (!is_kernel_rodata((unsigned long)x)) |
| 35 | kfree(x); |
| 36 | } |
| 37 | EXPORT_SYMBOL(kfree_const); |
| 38 | |
Matt Mackall | 30992c9 | 2006-01-08 01:01:43 -0800 | [diff] [blame] | 39 | /** |
Matt Mackall | 30992c9 | 2006-01-08 01:01:43 -0800 | [diff] [blame] | 40 | * kstrdup - allocate space for and copy an existing string |
Matt Mackall | 30992c9 | 2006-01-08 01:01:43 -0800 | [diff] [blame] | 41 | * @s: the string to duplicate |
| 42 | * @gfp: the GFP mask used in the kmalloc() call when allocating memory |
| 43 | */ |
| 44 | char *kstrdup(const char *s, gfp_t gfp) |
| 45 | { |
| 46 | size_t len; |
| 47 | char *buf; |
| 48 | |
| 49 | if (!s) |
| 50 | return NULL; |
| 51 | |
| 52 | len = strlen(s) + 1; |
Christoph Hellwig | 1d2c8ee | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 53 | buf = kmalloc_track_caller(len, gfp); |
Matt Mackall | 30992c9 | 2006-01-08 01:01:43 -0800 | [diff] [blame] | 54 | if (buf) |
| 55 | memcpy(buf, s, len); |
| 56 | return buf; |
| 57 | } |
| 58 | EXPORT_SYMBOL(kstrdup); |
Davi Arnaut | 96840aa | 2006-03-24 03:18:42 -0800 | [diff] [blame] | 59 | |
Alexey Dobriyan | 1a2f67b | 2006-09-30 23:27:20 -0700 | [diff] [blame] | 60 | /** |
Andrzej Hajda | a4bb1e4 | 2015-02-13 14:36:24 -0800 | [diff] [blame] | 61 | * kstrdup_const - conditionally duplicate an existing const string |
| 62 | * @s: the string to duplicate |
| 63 | * @gfp: the GFP mask used in the kmalloc() call when allocating memory |
| 64 | * |
| 65 | * Function returns source string if it is in .rodata section otherwise it |
| 66 | * fallbacks to kstrdup. |
| 67 | * Strings allocated by kstrdup_const should be freed by kfree_const. |
| 68 | */ |
| 69 | const char *kstrdup_const(const char *s, gfp_t gfp) |
| 70 | { |
| 71 | if (is_kernel_rodata((unsigned long)s)) |
| 72 | return s; |
| 73 | |
| 74 | return kstrdup(s, gfp); |
| 75 | } |
| 76 | EXPORT_SYMBOL(kstrdup_const); |
| 77 | |
| 78 | /** |
Jeremy Fitzhardinge | 1e66df3 | 2007-07-17 18:37:02 -0700 | [diff] [blame] | 79 | * kstrndup - allocate space for and copy an existing string |
| 80 | * @s: the string to duplicate |
| 81 | * @max: read at most @max chars from @s |
| 82 | * @gfp: the GFP mask used in the kmalloc() call when allocating memory |
| 83 | */ |
| 84 | char *kstrndup(const char *s, size_t max, gfp_t gfp) |
| 85 | { |
| 86 | size_t len; |
| 87 | char *buf; |
| 88 | |
| 89 | if (!s) |
| 90 | return NULL; |
| 91 | |
| 92 | len = strnlen(s, max); |
| 93 | buf = kmalloc_track_caller(len+1, gfp); |
| 94 | if (buf) { |
| 95 | memcpy(buf, s, len); |
| 96 | buf[len] = '\0'; |
| 97 | } |
| 98 | return buf; |
| 99 | } |
| 100 | EXPORT_SYMBOL(kstrndup); |
| 101 | |
| 102 | /** |
Alexey Dobriyan | 1a2f67b | 2006-09-30 23:27:20 -0700 | [diff] [blame] | 103 | * kmemdup - duplicate region of memory |
| 104 | * |
| 105 | * @src: memory region to duplicate |
| 106 | * @len: memory region length |
| 107 | * @gfp: GFP mask to use |
| 108 | */ |
| 109 | void *kmemdup(const void *src, size_t len, gfp_t gfp) |
| 110 | { |
| 111 | void *p; |
| 112 | |
Christoph Hellwig | 1d2c8ee | 2006-10-04 02:15:25 -0700 | [diff] [blame] | 113 | p = kmalloc_track_caller(len, gfp); |
Alexey Dobriyan | 1a2f67b | 2006-09-30 23:27:20 -0700 | [diff] [blame] | 114 | if (p) |
| 115 | memcpy(p, src, len); |
| 116 | return p; |
| 117 | } |
| 118 | EXPORT_SYMBOL(kmemdup); |
| 119 | |
Christoph Lameter | ef2ad80 | 2007-07-17 04:03:21 -0700 | [diff] [blame] | 120 | /** |
Li Zefan | 610a77e | 2009-03-31 15:23:16 -0700 | [diff] [blame] | 121 | * memdup_user - duplicate memory region from user space |
| 122 | * |
| 123 | * @src: source address in user space |
| 124 | * @len: number of bytes to copy |
| 125 | * |
| 126 | * Returns an ERR_PTR() on failure. |
| 127 | */ |
| 128 | void *memdup_user(const void __user *src, size_t len) |
| 129 | { |
| 130 | void *p; |
| 131 | |
| 132 | /* |
| 133 | * Always use GFP_KERNEL, since copy_from_user() can sleep and |
| 134 | * cause pagefault, which makes it pointless to use GFP_NOFS |
| 135 | * or GFP_ATOMIC. |
| 136 | */ |
| 137 | p = kmalloc_track_caller(len, GFP_KERNEL); |
| 138 | if (!p) |
| 139 | return ERR_PTR(-ENOMEM); |
| 140 | |
| 141 | if (copy_from_user(p, src, len)) { |
| 142 | kfree(p); |
| 143 | return ERR_PTR(-EFAULT); |
| 144 | } |
| 145 | |
| 146 | return p; |
| 147 | } |
| 148 | EXPORT_SYMBOL(memdup_user); |
| 149 | |
Davi Arnaut | 96840aa | 2006-03-24 03:18:42 -0800 | [diff] [blame] | 150 | /* |
| 151 | * strndup_user - duplicate an existing string from user space |
Davi Arnaut | 96840aa | 2006-03-24 03:18:42 -0800 | [diff] [blame] | 152 | * @s: The string to duplicate |
| 153 | * @n: Maximum number of bytes to copy, including the trailing NUL. |
| 154 | */ |
| 155 | char *strndup_user(const char __user *s, long n) |
| 156 | { |
| 157 | char *p; |
| 158 | long length; |
| 159 | |
| 160 | length = strnlen_user(s, n); |
| 161 | |
| 162 | if (!length) |
| 163 | return ERR_PTR(-EFAULT); |
| 164 | |
| 165 | if (length > n) |
| 166 | return ERR_PTR(-EINVAL); |
| 167 | |
Julia Lawall | 90d7404 | 2010-08-09 17:18:26 -0700 | [diff] [blame] | 168 | p = memdup_user(s, length); |
Davi Arnaut | 96840aa | 2006-03-24 03:18:42 -0800 | [diff] [blame] | 169 | |
Julia Lawall | 90d7404 | 2010-08-09 17:18:26 -0700 | [diff] [blame] | 170 | if (IS_ERR(p)) |
| 171 | return p; |
Davi Arnaut | 96840aa | 2006-03-24 03:18:42 -0800 | [diff] [blame] | 172 | |
| 173 | p[length - 1] = '\0'; |
| 174 | |
| 175 | return p; |
| 176 | } |
| 177 | EXPORT_SYMBOL(strndup_user); |
Andrew Morton | 16d6926 | 2008-07-25 19:44:36 -0700 | [diff] [blame] | 178 | |
Namhyung Kim | 6038def | 2011-05-24 17:11:22 -0700 | [diff] [blame] | 179 | void __vma_link_list(struct mm_struct *mm, struct vm_area_struct *vma, |
| 180 | struct vm_area_struct *prev, struct rb_node *rb_parent) |
| 181 | { |
| 182 | struct vm_area_struct *next; |
| 183 | |
| 184 | vma->vm_prev = prev; |
| 185 | if (prev) { |
| 186 | next = prev->vm_next; |
| 187 | prev->vm_next = vma; |
| 188 | } else { |
| 189 | mm->mmap = vma; |
| 190 | if (rb_parent) |
| 191 | next = rb_entry(rb_parent, |
| 192 | struct vm_area_struct, vm_rb); |
| 193 | else |
| 194 | next = NULL; |
| 195 | } |
| 196 | vma->vm_next = next; |
| 197 | if (next) |
| 198 | next->vm_prev = vma; |
| 199 | } |
| 200 | |
Siddhesh Poyarekar | b764375 | 2012-03-21 16:34:04 -0700 | [diff] [blame] | 201 | /* Check if the vma is being used as a stack by this task */ |
| 202 | static int vm_is_stack_for_task(struct task_struct *t, |
| 203 | struct vm_area_struct *vma) |
| 204 | { |
| 205 | return (vma->vm_start <= KSTK_ESP(t) && vma->vm_end >= KSTK_ESP(t)); |
| 206 | } |
| 207 | |
| 208 | /* |
| 209 | * Check if the vma is being used as a stack. |
| 210 | * If is_group is non-zero, check in the entire thread group or else |
Oleg Nesterov | 58cb654 | 2014-10-09 15:25:54 -0700 | [diff] [blame] | 211 | * just check in the current task. Returns the task_struct of the task |
| 212 | * that the vma is stack for. Must be called under rcu_read_lock(). |
Siddhesh Poyarekar | b764375 | 2012-03-21 16:34:04 -0700 | [diff] [blame] | 213 | */ |
Oleg Nesterov | 58cb654 | 2014-10-09 15:25:54 -0700 | [diff] [blame] | 214 | struct task_struct *task_of_stack(struct task_struct *task, |
| 215 | struct vm_area_struct *vma, bool in_group) |
Siddhesh Poyarekar | b764375 | 2012-03-21 16:34:04 -0700 | [diff] [blame] | 216 | { |
Siddhesh Poyarekar | b764375 | 2012-03-21 16:34:04 -0700 | [diff] [blame] | 217 | if (vm_is_stack_for_task(task, vma)) |
Oleg Nesterov | 58cb654 | 2014-10-09 15:25:54 -0700 | [diff] [blame] | 218 | return task; |
Siddhesh Poyarekar | b764375 | 2012-03-21 16:34:04 -0700 | [diff] [blame] | 219 | |
| 220 | if (in_group) { |
| 221 | struct task_struct *t; |
Siddhesh Poyarekar | b764375 | 2012-03-21 16:34:04 -0700 | [diff] [blame] | 222 | |
Oleg Nesterov | 4449a51 | 2014-08-08 14:19:17 -0700 | [diff] [blame] | 223 | for_each_thread(task, t) { |
Oleg Nesterov | 58cb654 | 2014-10-09 15:25:54 -0700 | [diff] [blame] | 224 | if (vm_is_stack_for_task(t, vma)) |
| 225 | return t; |
Oleg Nesterov | 4449a51 | 2014-08-08 14:19:17 -0700 | [diff] [blame] | 226 | } |
Siddhesh Poyarekar | b764375 | 2012-03-21 16:34:04 -0700 | [diff] [blame] | 227 | } |
| 228 | |
Oleg Nesterov | 58cb654 | 2014-10-09 15:25:54 -0700 | [diff] [blame] | 229 | return NULL; |
Siddhesh Poyarekar | b764375 | 2012-03-21 16:34:04 -0700 | [diff] [blame] | 230 | } |
| 231 | |
David Howells | efc1a3b | 2010-01-15 17:01:35 -0800 | [diff] [blame] | 232 | #if defined(CONFIG_MMU) && !defined(HAVE_ARCH_PICK_MMAP_LAYOUT) |
Andrew Morton | 16d6926 | 2008-07-25 19:44:36 -0700 | [diff] [blame] | 233 | void arch_pick_mmap_layout(struct mm_struct *mm) |
| 234 | { |
| 235 | mm->mmap_base = TASK_UNMAPPED_BASE; |
| 236 | mm->get_unmapped_area = arch_get_unmapped_area; |
Andrew Morton | 16d6926 | 2008-07-25 19:44:36 -0700 | [diff] [blame] | 237 | } |
| 238 | #endif |
Rusty Russell | 912985d | 2008-08-12 17:52:52 -0500 | [diff] [blame] | 239 | |
Xiao Guangrong | 45888a0 | 2010-08-22 19:08:57 +0800 | [diff] [blame] | 240 | /* |
| 241 | * Like get_user_pages_fast() except its IRQ-safe in that it won't fall |
| 242 | * back to the regular GUP. |
Lucas De Marchi | 25985ed | 2011-03-30 22:57:33 -0300 | [diff] [blame] | 243 | * If the architecture not support this function, simply return with no |
Xiao Guangrong | 45888a0 | 2010-08-22 19:08:57 +0800 | [diff] [blame] | 244 | * page pinned |
| 245 | */ |
Gideon Israel Dsouza | 3b32123 | 2014-04-07 15:37:26 -0700 | [diff] [blame] | 246 | int __weak __get_user_pages_fast(unsigned long start, |
Xiao Guangrong | 45888a0 | 2010-08-22 19:08:57 +0800 | [diff] [blame] | 247 | int nr_pages, int write, struct page **pages) |
| 248 | { |
| 249 | return 0; |
| 250 | } |
| 251 | EXPORT_SYMBOL_GPL(__get_user_pages_fast); |
| 252 | |
Andy Grover | 9de100d | 2009-04-13 14:40:05 -0700 | [diff] [blame] | 253 | /** |
| 254 | * get_user_pages_fast() - pin user pages in memory |
| 255 | * @start: starting user address |
| 256 | * @nr_pages: number of pages from start to pin |
| 257 | * @write: whether pages will be written to |
| 258 | * @pages: array that receives pointers to the pages pinned. |
| 259 | * Should be at least nr_pages long. |
| 260 | * |
Andy Grover | 9de100d | 2009-04-13 14:40:05 -0700 | [diff] [blame] | 261 | * Returns number of pages pinned. This may be fewer than the number |
| 262 | * requested. If nr_pages is 0 or negative, returns 0. If no pages |
| 263 | * were pinned, returns -errno. |
Nick Piggin | d2bf6be | 2009-06-16 15:31:39 -0700 | [diff] [blame] | 264 | * |
| 265 | * get_user_pages_fast provides equivalent functionality to get_user_pages, |
| 266 | * operating on current and current->mm, with force=0 and vma=NULL. However |
| 267 | * unlike get_user_pages, it must be called without mmap_sem held. |
| 268 | * |
| 269 | * get_user_pages_fast may take mmap_sem and page table locks, so no |
| 270 | * assumptions can be made about lack of locking. get_user_pages_fast is to be |
| 271 | * implemented in a way that is advantageous (vs get_user_pages()) when the |
| 272 | * user memory area is already faulted in and present in ptes. However if the |
| 273 | * pages have to be faulted in, it may turn out to be slightly slower so |
| 274 | * callers need to carefully consider what to use. On many architectures, |
| 275 | * get_user_pages_fast simply falls back to get_user_pages. |
Andy Grover | 9de100d | 2009-04-13 14:40:05 -0700 | [diff] [blame] | 276 | */ |
Gideon Israel Dsouza | 3b32123 | 2014-04-07 15:37:26 -0700 | [diff] [blame] | 277 | int __weak get_user_pages_fast(unsigned long start, |
Rusty Russell | 912985d | 2008-08-12 17:52:52 -0500 | [diff] [blame] | 278 | int nr_pages, int write, struct page **pages) |
| 279 | { |
| 280 | struct mm_struct *mm = current->mm; |
Andrea Arcangeli | a7b7807 | 2015-02-11 15:27:23 -0800 | [diff] [blame] | 281 | return get_user_pages_unlocked(current, mm, start, nr_pages, |
| 282 | write, 0, pages); |
Rusty Russell | 912985d | 2008-08-12 17:52:52 -0500 | [diff] [blame] | 283 | } |
| 284 | EXPORT_SYMBOL_GPL(get_user_pages_fast); |
Eduard - Gabriel Munteanu | ca2b84cb | 2009-03-23 15:12:24 +0200 | [diff] [blame] | 285 | |
Al Viro | eb36c58 | 2012-05-30 20:17:35 -0400 | [diff] [blame] | 286 | unsigned long vm_mmap_pgoff(struct file *file, unsigned long addr, |
| 287 | unsigned long len, unsigned long prot, |
| 288 | unsigned long flag, unsigned long pgoff) |
| 289 | { |
| 290 | unsigned long ret; |
| 291 | struct mm_struct *mm = current->mm; |
Michel Lespinasse | 41badc1 | 2013-02-22 16:32:47 -0800 | [diff] [blame] | 292 | unsigned long populate; |
Al Viro | eb36c58 | 2012-05-30 20:17:35 -0400 | [diff] [blame] | 293 | |
| 294 | ret = security_mmap_file(file, prot, flag); |
| 295 | if (!ret) { |
| 296 | down_write(&mm->mmap_sem); |
Michel Lespinasse | bebeb3d | 2013-02-22 16:32:37 -0800 | [diff] [blame] | 297 | ret = do_mmap_pgoff(file, addr, len, prot, flag, pgoff, |
| 298 | &populate); |
Al Viro | eb36c58 | 2012-05-30 20:17:35 -0400 | [diff] [blame] | 299 | up_write(&mm->mmap_sem); |
Michel Lespinasse | 41badc1 | 2013-02-22 16:32:47 -0800 | [diff] [blame] | 300 | if (populate) |
| 301 | mm_populate(ret, populate); |
Al Viro | eb36c58 | 2012-05-30 20:17:35 -0400 | [diff] [blame] | 302 | } |
| 303 | return ret; |
| 304 | } |
| 305 | |
| 306 | unsigned long vm_mmap(struct file *file, unsigned long addr, |
| 307 | unsigned long len, unsigned long prot, |
| 308 | unsigned long flag, unsigned long offset) |
| 309 | { |
| 310 | if (unlikely(offset + PAGE_ALIGN(len) < offset)) |
| 311 | return -EINVAL; |
| 312 | if (unlikely(offset & ~PAGE_MASK)) |
| 313 | return -EINVAL; |
| 314 | |
| 315 | return vm_mmap_pgoff(file, addr, len, prot, flag, offset >> PAGE_SHIFT); |
| 316 | } |
| 317 | EXPORT_SYMBOL(vm_mmap); |
| 318 | |
Al Viro | 39f1f78 | 2014-05-06 14:02:53 -0400 | [diff] [blame] | 319 | void kvfree(const void *addr) |
| 320 | { |
| 321 | if (is_vmalloc_addr(addr)) |
| 322 | vfree(addr); |
| 323 | else |
| 324 | kfree(addr); |
| 325 | } |
| 326 | EXPORT_SYMBOL(kvfree); |
| 327 | |
Shaohua Li | 9800339 | 2013-02-22 16:34:35 -0800 | [diff] [blame] | 328 | struct address_space *page_mapping(struct page *page) |
| 329 | { |
| 330 | struct address_space *mapping = page->mapping; |
| 331 | |
Mikulas Patocka | 03e5ac2 | 2014-01-14 17:56:40 -0800 | [diff] [blame] | 332 | /* This happens if someone calls flush_dcache_page on slab page */ |
| 333 | if (unlikely(PageSlab(page))) |
| 334 | return NULL; |
| 335 | |
Shaohua Li | 33806f0 | 2013-02-22 16:34:37 -0800 | [diff] [blame] | 336 | if (unlikely(PageSwapCache(page))) { |
| 337 | swp_entry_t entry; |
| 338 | |
| 339 | entry.val = page_private(page); |
| 340 | mapping = swap_address_space(entry); |
Joonsoo Kim | d2cf5ad | 2013-09-11 14:21:29 -0700 | [diff] [blame] | 341 | } else if ((unsigned long)mapping & PAGE_MAPPING_ANON) |
Shaohua Li | 9800339 | 2013-02-22 16:34:35 -0800 | [diff] [blame] | 342 | mapping = NULL; |
| 343 | return mapping; |
| 344 | } |
| 345 | |
Jerome Marchand | 49f0ce5 | 2014-01-21 15:49:14 -0800 | [diff] [blame] | 346 | int overcommit_ratio_handler(struct ctl_table *table, int write, |
| 347 | void __user *buffer, size_t *lenp, |
| 348 | loff_t *ppos) |
| 349 | { |
| 350 | int ret; |
| 351 | |
| 352 | ret = proc_dointvec(table, write, buffer, lenp, ppos); |
| 353 | if (ret == 0 && write) |
| 354 | sysctl_overcommit_kbytes = 0; |
| 355 | return ret; |
| 356 | } |
| 357 | |
| 358 | int overcommit_kbytes_handler(struct ctl_table *table, int write, |
| 359 | void __user *buffer, size_t *lenp, |
| 360 | loff_t *ppos) |
| 361 | { |
| 362 | int ret; |
| 363 | |
| 364 | ret = proc_doulongvec_minmax(table, write, buffer, lenp, ppos); |
| 365 | if (ret == 0 && write) |
| 366 | sysctl_overcommit_ratio = 0; |
| 367 | return ret; |
| 368 | } |
| 369 | |
Jerome Marchand | 00619bc | 2013-11-12 15:08:31 -0800 | [diff] [blame] | 370 | /* |
| 371 | * Committed memory limit enforced when OVERCOMMIT_NEVER policy is used |
| 372 | */ |
| 373 | unsigned long vm_commit_limit(void) |
| 374 | { |
Jerome Marchand | 49f0ce5 | 2014-01-21 15:49:14 -0800 | [diff] [blame] | 375 | unsigned long allowed; |
| 376 | |
| 377 | if (sysctl_overcommit_kbytes) |
| 378 | allowed = sysctl_overcommit_kbytes >> (PAGE_SHIFT - 10); |
| 379 | else |
| 380 | allowed = ((totalram_pages - hugetlb_total_pages()) |
| 381 | * sysctl_overcommit_ratio / 100); |
| 382 | allowed += total_swap_pages; |
| 383 | |
| 384 | return allowed; |
Jerome Marchand | 00619bc | 2013-11-12 15:08:31 -0800 | [diff] [blame] | 385 | } |
| 386 | |
William Roberts | a909025 | 2014-02-11 10:11:59 -0800 | [diff] [blame] | 387 | /** |
| 388 | * get_cmdline() - copy the cmdline value to a buffer. |
| 389 | * @task: the task whose cmdline value to copy. |
| 390 | * @buffer: the buffer to copy to. |
| 391 | * @buflen: the length of the buffer. Larger cmdline values are truncated |
| 392 | * to this length. |
| 393 | * Returns the size of the cmdline field copied. Note that the copy does |
| 394 | * not guarantee an ending NULL byte. |
| 395 | */ |
| 396 | int get_cmdline(struct task_struct *task, char *buffer, int buflen) |
| 397 | { |
| 398 | int res = 0; |
| 399 | unsigned int len; |
| 400 | struct mm_struct *mm = get_task_mm(task); |
| 401 | if (!mm) |
| 402 | goto out; |
| 403 | if (!mm->arg_end) |
| 404 | goto out_mm; /* Shh! No looking before we're done */ |
| 405 | |
| 406 | len = mm->arg_end - mm->arg_start; |
| 407 | |
| 408 | if (len > buflen) |
| 409 | len = buflen; |
| 410 | |
| 411 | res = access_process_vm(task, mm->arg_start, buffer, len, 0); |
| 412 | |
| 413 | /* |
| 414 | * If the nul at the end of args has been overwritten, then |
| 415 | * assume application is using setproctitle(3). |
| 416 | */ |
| 417 | if (res > 0 && buffer[res-1] != '\0' && len < buflen) { |
| 418 | len = strnlen(buffer, res); |
| 419 | if (len < res) { |
| 420 | res = len; |
| 421 | } else { |
| 422 | len = mm->env_end - mm->env_start; |
| 423 | if (len > buflen - res) |
| 424 | len = buflen - res; |
| 425 | res += access_process_vm(task, mm->env_start, |
| 426 | buffer+res, len, 0); |
| 427 | res = strnlen(buffer, res); |
| 428 | } |
| 429 | } |
| 430 | out_mm: |
| 431 | mmput(mm); |
| 432 | out: |
| 433 | return res; |
| 434 | } |