xtensa: support DMA buffers in high memory
[cris-mirror.git] / drivers / staging / android / ashmem.c
blobbbdc53b686dd19503796ed8fdfd97fd01596195f
1 // SPDX-License-Identifier: GPL-2.0
2 /* mm/ashmem.c
4 * Anonymous Shared Memory Subsystem, ashmem
6 * Copyright (C) 2008 Google, Inc.
8 * Robert Love <rlove@google.com>
9 */
11 #define pr_fmt(fmt) "ashmem: " fmt
13 #include <linux/init.h>
14 #include <linux/export.h>
15 #include <linux/file.h>
16 #include <linux/fs.h>
17 #include <linux/falloc.h>
18 #include <linux/miscdevice.h>
19 #include <linux/security.h>
20 #include <linux/mm.h>
21 #include <linux/mman.h>
22 #include <linux/uaccess.h>
23 #include <linux/personality.h>
24 #include <linux/bitops.h>
25 #include <linux/mutex.h>
26 #include <linux/shmem_fs.h>
27 #include "ashmem.h"
29 #define ASHMEM_NAME_PREFIX "dev/ashmem/"
30 #define ASHMEM_NAME_PREFIX_LEN (sizeof(ASHMEM_NAME_PREFIX) - 1)
31 #define ASHMEM_FULL_NAME_LEN (ASHMEM_NAME_LEN + ASHMEM_NAME_PREFIX_LEN)
33 /**
34 * struct ashmem_area - The anonymous shared memory area
35 * @name: The optional name in /proc/pid/maps
36 * @unpinned_list: The list of all ashmem areas
37 * @file: The shmem-based backing file
38 * @size: The size of the mapping, in bytes
39 * @prot_mask: The allowed protection bits, as vm_flags
41 * The lifecycle of this structure is from our parent file's open() until
42 * its release(). It is also protected by 'ashmem_mutex'
44 * Warning: Mappings do NOT pin this structure; It dies on close()
46 struct ashmem_area {
47 char name[ASHMEM_FULL_NAME_LEN];
48 struct list_head unpinned_list;
49 struct file *file;
50 size_t size;
51 unsigned long prot_mask;
54 /**
55 * struct ashmem_range - A range of unpinned/evictable pages
56 * @lru: The entry in the LRU list
57 * @unpinned: The entry in its area's unpinned list
58 * @asma: The associated anonymous shared memory area.
59 * @pgstart: The starting page (inclusive)
60 * @pgend: The ending page (inclusive)
61 * @purged: The purge status (ASHMEM_NOT or ASHMEM_WAS_PURGED)
63 * The lifecycle of this structure is from unpin to pin.
64 * It is protected by 'ashmem_mutex'
66 struct ashmem_range {
67 struct list_head lru;
68 struct list_head unpinned;
69 struct ashmem_area *asma;
70 size_t pgstart;
71 size_t pgend;
72 unsigned int purged;
75 /* LRU list of unpinned pages, protected by ashmem_mutex */
76 static LIST_HEAD(ashmem_lru_list);
79 * long lru_count - The count of pages on our LRU list.
81 * This is protected by ashmem_mutex.
83 static unsigned long lru_count;
86 * ashmem_mutex - protects the list of and each individual ashmem_area
88 * Lock Ordering: ashmex_mutex -> i_mutex -> i_alloc_sem
90 static DEFINE_MUTEX(ashmem_mutex);
92 static struct kmem_cache *ashmem_area_cachep __read_mostly;
93 static struct kmem_cache *ashmem_range_cachep __read_mostly;
95 static inline unsigned long range_size(struct ashmem_range *range)
97 return range->pgend - range->pgstart + 1;
100 static inline bool range_on_lru(struct ashmem_range *range)
102 return range->purged == ASHMEM_NOT_PURGED;
105 static inline bool page_range_subsumes_range(struct ashmem_range *range,
106 size_t start, size_t end)
108 return (range->pgstart >= start) && (range->pgend <= end);
111 static inline bool page_range_subsumed_by_range(struct ashmem_range *range,
112 size_t start, size_t end)
114 return (range->pgstart <= start) && (range->pgend >= end);
117 static inline bool page_in_range(struct ashmem_range *range, size_t page)
119 return (range->pgstart <= page) && (range->pgend >= page);
122 static inline bool page_range_in_range(struct ashmem_range *range,
123 size_t start, size_t end)
125 return page_in_range(range, start) || page_in_range(range, end) ||
126 page_range_subsumes_range(range, start, end);
129 static inline bool range_before_page(struct ashmem_range *range, size_t page)
131 return range->pgend < page;
134 #define PROT_MASK (PROT_EXEC | PROT_READ | PROT_WRITE)
137 * lru_add() - Adds a range of memory to the LRU list
138 * @range: The memory range being added.
140 * The range is first added to the end (tail) of the LRU list.
141 * After this, the size of the range is added to @lru_count
143 static inline void lru_add(struct ashmem_range *range)
145 list_add_tail(&range->lru, &ashmem_lru_list);
146 lru_count += range_size(range);
150 * lru_del() - Removes a range of memory from the LRU list
151 * @range: The memory range being removed
153 * The range is first deleted from the LRU list.
154 * After this, the size of the range is removed from @lru_count
156 static inline void lru_del(struct ashmem_range *range)
158 list_del(&range->lru);
159 lru_count -= range_size(range);
163 * range_alloc() - Allocates and initializes a new ashmem_range structure
164 * @asma: The associated ashmem_area
165 * @prev_range: The previous ashmem_range in the sorted asma->unpinned list
166 * @purged: Initial purge status (ASMEM_NOT_PURGED or ASHMEM_WAS_PURGED)
167 * @start: The starting page (inclusive)
168 * @end: The ending page (inclusive)
170 * This function is protected by ashmem_mutex.
172 * Return: 0 if successful, or -ENOMEM if there is an error
174 static int range_alloc(struct ashmem_area *asma,
175 struct ashmem_range *prev_range, unsigned int purged,
176 size_t start, size_t end)
178 struct ashmem_range *range;
180 range = kmem_cache_zalloc(ashmem_range_cachep, GFP_KERNEL);
181 if (unlikely(!range))
182 return -ENOMEM;
184 range->asma = asma;
185 range->pgstart = start;
186 range->pgend = end;
187 range->purged = purged;
189 list_add_tail(&range->unpinned, &prev_range->unpinned);
191 if (range_on_lru(range))
192 lru_add(range);
194 return 0;
198 * range_del() - Deletes and dealloctes an ashmem_range structure
199 * @range: The associated ashmem_range that has previously been allocated
201 static void range_del(struct ashmem_range *range)
203 list_del(&range->unpinned);
204 if (range_on_lru(range))
205 lru_del(range);
206 kmem_cache_free(ashmem_range_cachep, range);
210 * range_shrink() - Shrinks an ashmem_range
211 * @range: The associated ashmem_range being shrunk
212 * @start: The starting byte of the new range
213 * @end: The ending byte of the new range
215 * This does not modify the data inside the existing range in any way - It
216 * simply shrinks the boundaries of the range.
218 * Theoretically, with a little tweaking, this could eventually be changed
219 * to range_resize, and expand the lru_count if the new range is larger.
221 static inline void range_shrink(struct ashmem_range *range,
222 size_t start, size_t end)
224 size_t pre = range_size(range);
226 range->pgstart = start;
227 range->pgend = end;
229 if (range_on_lru(range))
230 lru_count -= pre - range_size(range);
234 * ashmem_open() - Opens an Anonymous Shared Memory structure
235 * @inode: The backing file's index node(?)
236 * @file: The backing file
238 * Please note that the ashmem_area is not returned by this function - It is
239 * instead written to "file->private_data".
241 * Return: 0 if successful, or another code if unsuccessful.
243 static int ashmem_open(struct inode *inode, struct file *file)
245 struct ashmem_area *asma;
246 int ret;
248 ret = generic_file_open(inode, file);
249 if (unlikely(ret))
250 return ret;
252 asma = kmem_cache_zalloc(ashmem_area_cachep, GFP_KERNEL);
253 if (unlikely(!asma))
254 return -ENOMEM;
256 INIT_LIST_HEAD(&asma->unpinned_list);
257 memcpy(asma->name, ASHMEM_NAME_PREFIX, ASHMEM_NAME_PREFIX_LEN);
258 asma->prot_mask = PROT_MASK;
259 file->private_data = asma;
261 return 0;
265 * ashmem_release() - Releases an Anonymous Shared Memory structure
266 * @ignored: The backing file's Index Node(?) - It is ignored here.
267 * @file: The backing file
269 * Return: 0 if successful. If it is anything else, go have a coffee and
270 * try again.
272 static int ashmem_release(struct inode *ignored, struct file *file)
274 struct ashmem_area *asma = file->private_data;
275 struct ashmem_range *range, *next;
277 mutex_lock(&ashmem_mutex);
278 list_for_each_entry_safe(range, next, &asma->unpinned_list, unpinned)
279 range_del(range);
280 mutex_unlock(&ashmem_mutex);
282 if (asma->file)
283 fput(asma->file);
284 kmem_cache_free(ashmem_area_cachep, asma);
286 return 0;
289 static ssize_t ashmem_read_iter(struct kiocb *iocb, struct iov_iter *iter)
291 struct ashmem_area *asma = iocb->ki_filp->private_data;
292 int ret = 0;
294 mutex_lock(&ashmem_mutex);
296 /* If size is not set, or set to 0, always return EOF. */
297 if (asma->size == 0)
298 goto out_unlock;
300 if (!asma->file) {
301 ret = -EBADF;
302 goto out_unlock;
306 * asma and asma->file are used outside the lock here. We assume
307 * once asma->file is set it will never be changed, and will not
308 * be destroyed until all references to the file are dropped and
309 * ashmem_release is called.
311 mutex_unlock(&ashmem_mutex);
312 ret = vfs_iter_read(asma->file, iter, &iocb->ki_pos, 0);
313 mutex_lock(&ashmem_mutex);
314 if (ret > 0)
315 asma->file->f_pos = iocb->ki_pos;
316 out_unlock:
317 mutex_unlock(&ashmem_mutex);
318 return ret;
321 static loff_t ashmem_llseek(struct file *file, loff_t offset, int origin)
323 struct ashmem_area *asma = file->private_data;
324 int ret;
326 mutex_lock(&ashmem_mutex);
328 if (asma->size == 0) {
329 ret = -EINVAL;
330 goto out;
333 if (!asma->file) {
334 ret = -EBADF;
335 goto out;
338 ret = vfs_llseek(asma->file, offset, origin);
339 if (ret < 0)
340 goto out;
342 /** Copy f_pos from backing file, since f_ops->llseek() sets it */
343 file->f_pos = asma->file->f_pos;
345 out:
346 mutex_unlock(&ashmem_mutex);
347 return ret;
350 static inline vm_flags_t calc_vm_may_flags(unsigned long prot)
352 return _calc_vm_trans(prot, PROT_READ, VM_MAYREAD) |
353 _calc_vm_trans(prot, PROT_WRITE, VM_MAYWRITE) |
354 _calc_vm_trans(prot, PROT_EXEC, VM_MAYEXEC);
357 static int ashmem_mmap(struct file *file, struct vm_area_struct *vma)
359 struct ashmem_area *asma = file->private_data;
360 int ret = 0;
362 mutex_lock(&ashmem_mutex);
364 /* user needs to SET_SIZE before mapping */
365 if (unlikely(!asma->size)) {
366 ret = -EINVAL;
367 goto out;
370 /* requested protection bits must match our allowed protection mask */
371 if (unlikely((vma->vm_flags & ~calc_vm_prot_bits(asma->prot_mask, 0)) &
372 calc_vm_prot_bits(PROT_MASK, 0))) {
373 ret = -EPERM;
374 goto out;
376 vma->vm_flags &= ~calc_vm_may_flags(~asma->prot_mask);
378 if (!asma->file) {
379 char *name = ASHMEM_NAME_DEF;
380 struct file *vmfile;
382 if (asma->name[ASHMEM_NAME_PREFIX_LEN] != '\0')
383 name = asma->name;
385 /* ... and allocate the backing shmem file */
386 vmfile = shmem_file_setup(name, asma->size, vma->vm_flags);
387 if (IS_ERR(vmfile)) {
388 ret = PTR_ERR(vmfile);
389 goto out;
391 vmfile->f_mode |= FMODE_LSEEK;
392 asma->file = vmfile;
394 get_file(asma->file);
397 * XXX - Reworked to use shmem_zero_setup() instead of
398 * shmem_set_file while we're in staging. -jstultz
400 if (vma->vm_flags & VM_SHARED) {
401 ret = shmem_zero_setup(vma);
402 if (ret) {
403 fput(asma->file);
404 goto out;
408 if (vma->vm_file)
409 fput(vma->vm_file);
410 vma->vm_file = asma->file;
412 out:
413 mutex_unlock(&ashmem_mutex);
414 return ret;
418 * ashmem_shrink - our cache shrinker, called from mm/vmscan.c
420 * 'nr_to_scan' is the number of objects to scan for freeing.
422 * 'gfp_mask' is the mask of the allocation that got us into this mess.
424 * Return value is the number of objects freed or -1 if we cannot
425 * proceed without risk of deadlock (due to gfp_mask).
427 * We approximate LRU via least-recently-unpinned, jettisoning unpinned partial
428 * chunks of ashmem regions LRU-wise one-at-a-time until we hit 'nr_to_scan'
429 * pages freed.
431 static unsigned long
432 ashmem_shrink_scan(struct shrinker *shrink, struct shrink_control *sc)
434 struct ashmem_range *range, *next;
435 unsigned long freed = 0;
437 /* We might recurse into filesystem code, so bail out if necessary */
438 if (!(sc->gfp_mask & __GFP_FS))
439 return SHRINK_STOP;
441 if (!mutex_trylock(&ashmem_mutex))
442 return -1;
444 list_for_each_entry_safe(range, next, &ashmem_lru_list, lru) {
445 loff_t start = range->pgstart * PAGE_SIZE;
446 loff_t end = (range->pgend + 1) * PAGE_SIZE;
448 vfs_fallocate(range->asma->file,
449 FALLOC_FL_PUNCH_HOLE | FALLOC_FL_KEEP_SIZE,
450 start, end - start);
451 range->purged = ASHMEM_WAS_PURGED;
452 lru_del(range);
454 freed += range_size(range);
455 if (--sc->nr_to_scan <= 0)
456 break;
458 mutex_unlock(&ashmem_mutex);
459 return freed;
462 static unsigned long
463 ashmem_shrink_count(struct shrinker *shrink, struct shrink_control *sc)
466 * note that lru_count is count of pages on the lru, not a count of
467 * objects on the list. This means the scan function needs to return the
468 * number of pages freed, not the number of objects scanned.
470 return lru_count;
473 static struct shrinker ashmem_shrinker = {
474 .count_objects = ashmem_shrink_count,
475 .scan_objects = ashmem_shrink_scan,
477 * XXX (dchinner): I wish people would comment on why they need on
478 * significant changes to the default value here
480 .seeks = DEFAULT_SEEKS * 4,
483 static int set_prot_mask(struct ashmem_area *asma, unsigned long prot)
485 int ret = 0;
487 mutex_lock(&ashmem_mutex);
489 /* the user can only remove, not add, protection bits */
490 if (unlikely((asma->prot_mask & prot) != prot)) {
491 ret = -EINVAL;
492 goto out;
495 /* does the application expect PROT_READ to imply PROT_EXEC? */
496 if ((prot & PROT_READ) && (current->personality & READ_IMPLIES_EXEC))
497 prot |= PROT_EXEC;
499 asma->prot_mask = prot;
501 out:
502 mutex_unlock(&ashmem_mutex);
503 return ret;
506 static int set_name(struct ashmem_area *asma, void __user *name)
508 int len;
509 int ret = 0;
510 char local_name[ASHMEM_NAME_LEN];
513 * Holding the ashmem_mutex while doing a copy_from_user might cause
514 * an data abort which would try to access mmap_sem. If another
515 * thread has invoked ashmem_mmap then it will be holding the
516 * semaphore and will be waiting for ashmem_mutex, there by leading to
517 * deadlock. We'll release the mutex and take the name to a local
518 * variable that does not need protection and later copy the local
519 * variable to the structure member with lock held.
521 len = strncpy_from_user(local_name, name, ASHMEM_NAME_LEN);
522 if (len < 0)
523 return len;
524 if (len == ASHMEM_NAME_LEN)
525 local_name[ASHMEM_NAME_LEN - 1] = '\0';
526 mutex_lock(&ashmem_mutex);
527 /* cannot change an existing mapping's name */
528 if (unlikely(asma->file))
529 ret = -EINVAL;
530 else
531 strcpy(asma->name + ASHMEM_NAME_PREFIX_LEN, local_name);
533 mutex_unlock(&ashmem_mutex);
534 return ret;
537 static int get_name(struct ashmem_area *asma, void __user *name)
539 int ret = 0;
540 size_t len;
542 * Have a local variable to which we'll copy the content
543 * from asma with the lock held. Later we can copy this to the user
544 * space safely without holding any locks. So even if we proceed to
545 * wait for mmap_sem, it won't lead to deadlock.
547 char local_name[ASHMEM_NAME_LEN];
549 mutex_lock(&ashmem_mutex);
550 if (asma->name[ASHMEM_NAME_PREFIX_LEN] != '\0') {
552 * Copying only `len', instead of ASHMEM_NAME_LEN, bytes
553 * prevents us from revealing one user's stack to another.
555 len = strlen(asma->name + ASHMEM_NAME_PREFIX_LEN) + 1;
556 memcpy(local_name, asma->name + ASHMEM_NAME_PREFIX_LEN, len);
557 } else {
558 len = sizeof(ASHMEM_NAME_DEF);
559 memcpy(local_name, ASHMEM_NAME_DEF, len);
561 mutex_unlock(&ashmem_mutex);
564 * Now we are just copying from the stack variable to userland
565 * No lock held
567 if (unlikely(copy_to_user(name, local_name, len)))
568 ret = -EFAULT;
569 return ret;
573 * ashmem_pin - pin the given ashmem region, returning whether it was
574 * previously purged (ASHMEM_WAS_PURGED) or not (ASHMEM_NOT_PURGED).
576 * Caller must hold ashmem_mutex.
578 static int ashmem_pin(struct ashmem_area *asma, size_t pgstart, size_t pgend)
580 struct ashmem_range *range, *next;
581 int ret = ASHMEM_NOT_PURGED;
583 list_for_each_entry_safe(range, next, &asma->unpinned_list, unpinned) {
584 /* moved past last applicable page; we can short circuit */
585 if (range_before_page(range, pgstart))
586 break;
589 * The user can ask us to pin pages that span multiple ranges,
590 * or to pin pages that aren't even unpinned, so this is messy.
592 * Four cases:
593 * 1. The requested range subsumes an existing range, so we
594 * just remove the entire matching range.
595 * 2. The requested range overlaps the start of an existing
596 * range, so we just update that range.
597 * 3. The requested range overlaps the end of an existing
598 * range, so we just update that range.
599 * 4. The requested range punches a hole in an existing range,
600 * so we have to update one side of the range and then
601 * create a new range for the other side.
603 if (page_range_in_range(range, pgstart, pgend)) {
604 ret |= range->purged;
606 /* Case #1: Easy. Just nuke the whole thing. */
607 if (page_range_subsumes_range(range, pgstart, pgend)) {
608 range_del(range);
609 continue;
612 /* Case #2: We overlap from the start, so adjust it */
613 if (range->pgstart >= pgstart) {
614 range_shrink(range, pgend + 1, range->pgend);
615 continue;
618 /* Case #3: We overlap from the rear, so adjust it */
619 if (range->pgend <= pgend) {
620 range_shrink(range, range->pgstart,
621 pgstart - 1);
622 continue;
626 * Case #4: We eat a chunk out of the middle. A bit
627 * more complicated, we allocate a new range for the
628 * second half and adjust the first chunk's endpoint.
630 range_alloc(asma, range, range->purged,
631 pgend + 1, range->pgend);
632 range_shrink(range, range->pgstart, pgstart - 1);
633 break;
637 return ret;
641 * ashmem_unpin - unpin the given range of pages. Returns zero on success.
643 * Caller must hold ashmem_mutex.
645 static int ashmem_unpin(struct ashmem_area *asma, size_t pgstart, size_t pgend)
647 struct ashmem_range *range, *next;
648 unsigned int purged = ASHMEM_NOT_PURGED;
650 restart:
651 list_for_each_entry_safe(range, next, &asma->unpinned_list, unpinned) {
652 /* short circuit: this is our insertion point */
653 if (range_before_page(range, pgstart))
654 break;
657 * The user can ask us to unpin pages that are already entirely
658 * or partially pinned. We handle those two cases here.
660 if (page_range_subsumed_by_range(range, pgstart, pgend))
661 return 0;
662 if (page_range_in_range(range, pgstart, pgend)) {
663 pgstart = min(range->pgstart, pgstart);
664 pgend = max(range->pgend, pgend);
665 purged |= range->purged;
666 range_del(range);
667 goto restart;
671 return range_alloc(asma, range, purged, pgstart, pgend);
675 * ashmem_get_pin_status - Returns ASHMEM_IS_UNPINNED if _any_ pages in the
676 * given interval are unpinned and ASHMEM_IS_PINNED otherwise.
678 * Caller must hold ashmem_mutex.
680 static int ashmem_get_pin_status(struct ashmem_area *asma, size_t pgstart,
681 size_t pgend)
683 struct ashmem_range *range;
684 int ret = ASHMEM_IS_PINNED;
686 list_for_each_entry(range, &asma->unpinned_list, unpinned) {
687 if (range_before_page(range, pgstart))
688 break;
689 if (page_range_in_range(range, pgstart, pgend)) {
690 ret = ASHMEM_IS_UNPINNED;
691 break;
695 return ret;
698 static int ashmem_pin_unpin(struct ashmem_area *asma, unsigned long cmd,
699 void __user *p)
701 struct ashmem_pin pin;
702 size_t pgstart, pgend;
703 int ret = -EINVAL;
705 if (unlikely(!asma->file))
706 return -EINVAL;
708 if (unlikely(copy_from_user(&pin, p, sizeof(pin))))
709 return -EFAULT;
711 /* per custom, you can pass zero for len to mean "everything onward" */
712 if (!pin.len)
713 pin.len = PAGE_ALIGN(asma->size) - pin.offset;
715 if (unlikely((pin.offset | pin.len) & ~PAGE_MASK))
716 return -EINVAL;
718 if (unlikely(((__u32)-1) - pin.offset < pin.len))
719 return -EINVAL;
721 if (unlikely(PAGE_ALIGN(asma->size) < pin.offset + pin.len))
722 return -EINVAL;
724 pgstart = pin.offset / PAGE_SIZE;
725 pgend = pgstart + (pin.len / PAGE_SIZE) - 1;
727 mutex_lock(&ashmem_mutex);
729 switch (cmd) {
730 case ASHMEM_PIN:
731 ret = ashmem_pin(asma, pgstart, pgend);
732 break;
733 case ASHMEM_UNPIN:
734 ret = ashmem_unpin(asma, pgstart, pgend);
735 break;
736 case ASHMEM_GET_PIN_STATUS:
737 ret = ashmem_get_pin_status(asma, pgstart, pgend);
738 break;
741 mutex_unlock(&ashmem_mutex);
743 return ret;
746 static long ashmem_ioctl(struct file *file, unsigned int cmd, unsigned long arg)
748 struct ashmem_area *asma = file->private_data;
749 long ret = -ENOTTY;
751 switch (cmd) {
752 case ASHMEM_SET_NAME:
753 ret = set_name(asma, (void __user *)arg);
754 break;
755 case ASHMEM_GET_NAME:
756 ret = get_name(asma, (void __user *)arg);
757 break;
758 case ASHMEM_SET_SIZE:
759 ret = -EINVAL;
760 mutex_lock(&ashmem_mutex);
761 if (!asma->file) {
762 ret = 0;
763 asma->size = (size_t)arg;
765 mutex_unlock(&ashmem_mutex);
766 break;
767 case ASHMEM_GET_SIZE:
768 ret = asma->size;
769 break;
770 case ASHMEM_SET_PROT_MASK:
771 ret = set_prot_mask(asma, arg);
772 break;
773 case ASHMEM_GET_PROT_MASK:
774 ret = asma->prot_mask;
775 break;
776 case ASHMEM_PIN:
777 case ASHMEM_UNPIN:
778 case ASHMEM_GET_PIN_STATUS:
779 ret = ashmem_pin_unpin(asma, cmd, (void __user *)arg);
780 break;
781 case ASHMEM_PURGE_ALL_CACHES:
782 ret = -EPERM;
783 if (capable(CAP_SYS_ADMIN)) {
784 struct shrink_control sc = {
785 .gfp_mask = GFP_KERNEL,
786 .nr_to_scan = LONG_MAX,
788 ret = ashmem_shrink_count(&ashmem_shrinker, &sc);
789 ashmem_shrink_scan(&ashmem_shrinker, &sc);
791 break;
794 return ret;
797 /* support of 32bit userspace on 64bit platforms */
798 #ifdef CONFIG_COMPAT
799 static long compat_ashmem_ioctl(struct file *file, unsigned int cmd,
800 unsigned long arg)
802 switch (cmd) {
803 case COMPAT_ASHMEM_SET_SIZE:
804 cmd = ASHMEM_SET_SIZE;
805 break;
806 case COMPAT_ASHMEM_SET_PROT_MASK:
807 cmd = ASHMEM_SET_PROT_MASK;
808 break;
810 return ashmem_ioctl(file, cmd, arg);
812 #endif
813 #ifdef CONFIG_PROC_FS
814 static void ashmem_show_fdinfo(struct seq_file *m, struct file *file)
816 struct ashmem_area *asma = file->private_data;
818 mutex_lock(&ashmem_mutex);
820 if (asma->file)
821 seq_printf(m, "inode:\t%ld\n", file_inode(asma->file)->i_ino);
823 if (asma->name[ASHMEM_NAME_PREFIX_LEN] != '\0')
824 seq_printf(m, "name:\t%s\n",
825 asma->name + ASHMEM_NAME_PREFIX_LEN);
827 mutex_unlock(&ashmem_mutex);
829 #endif
830 static const struct file_operations ashmem_fops = {
831 .owner = THIS_MODULE,
832 .open = ashmem_open,
833 .release = ashmem_release,
834 .read_iter = ashmem_read_iter,
835 .llseek = ashmem_llseek,
836 .mmap = ashmem_mmap,
837 .unlocked_ioctl = ashmem_ioctl,
838 #ifdef CONFIG_COMPAT
839 .compat_ioctl = compat_ashmem_ioctl,
840 #endif
841 #ifdef CONFIG_PROC_FS
842 .show_fdinfo = ashmem_show_fdinfo,
843 #endif
846 static struct miscdevice ashmem_misc = {
847 .minor = MISC_DYNAMIC_MINOR,
848 .name = "ashmem",
849 .fops = &ashmem_fops,
852 static int __init ashmem_init(void)
854 int ret = -ENOMEM;
856 ashmem_area_cachep = kmem_cache_create("ashmem_area_cache",
857 sizeof(struct ashmem_area),
858 0, 0, NULL);
859 if (unlikely(!ashmem_area_cachep)) {
860 pr_err("failed to create slab cache\n");
861 goto out;
864 ashmem_range_cachep = kmem_cache_create("ashmem_range_cache",
865 sizeof(struct ashmem_range),
866 0, 0, NULL);
867 if (unlikely(!ashmem_range_cachep)) {
868 pr_err("failed to create slab cache\n");
869 goto out_free1;
872 ret = misc_register(&ashmem_misc);
873 if (unlikely(ret)) {
874 pr_err("failed to register misc device!\n");
875 goto out_free2;
878 ret = register_shrinker(&ashmem_shrinker);
879 if (ret) {
880 pr_err("failed to register shrinker!\n");
881 goto out_demisc;
884 pr_info("initialized\n");
886 return 0;
888 out_demisc:
889 misc_deregister(&ashmem_misc);
890 out_free2:
891 kmem_cache_destroy(ashmem_range_cachep);
892 out_free1:
893 kmem_cache_destroy(ashmem_area_cachep);
894 out:
895 return ret;
897 device_initcall(ashmem_init);