3 * Anonymous Shared Memory Subsystem, ashmem
5 * Copyright (C) 2008 Google, Inc.
7 * Robert Love <rlove@google.com>
9 * This software is licensed under the terms of the GNU General Public
10 * License version 2, as published by the Free Software Foundation, and
11 * may be copied, distributed, and modified under those terms.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
19 #define pr_fmt(fmt) "ashmem: " fmt
21 #include <linux/init.h>
22 #include <linux/export.h>
23 #include <linux/file.h>
25 #include <linux/falloc.h>
26 #include <linux/miscdevice.h>
27 #include <linux/security.h>
29 #include <linux/mman.h>
30 #include <linux/uaccess.h>
31 #include <linux/personality.h>
32 #include <linux/bitops.h>
33 #include <linux/mutex.h>
34 #include <linux/shmem_fs.h>
37 #define ASHMEM_NAME_PREFIX "dev/ashmem/"
38 #define ASHMEM_NAME_PREFIX_LEN (sizeof(ASHMEM_NAME_PREFIX) - 1)
39 #define ASHMEM_FULL_NAME_LEN (ASHMEM_NAME_LEN + ASHMEM_NAME_PREFIX_LEN)
42 * struct ashmem_area - The anonymous shared memory area
43 * @name: The optional name in /proc/pid/maps
44 * @unpinned_list: The list of all ashmem areas
45 * @file: The shmem-based backing file
46 * @size: The size of the mapping, in bytes
47 * @prot_mask: The allowed protection bits, as vm_flags
49 * The lifecycle of this structure is from our parent file's open() until
50 * its release(). It is also protected by 'ashmem_mutex'
52 * Warning: Mappings do NOT pin this structure; It dies on close()
55 char name
[ASHMEM_FULL_NAME_LEN
];
56 struct list_head unpinned_list
;
59 unsigned long prot_mask
;
63 * struct ashmem_range - A range of unpinned/evictable pages
64 * @lru: The entry in the LRU list
65 * @unpinned: The entry in its area's unpinned list
66 * @asma: The associated anonymous shared memory area.
67 * @pgstart: The starting page (inclusive)
68 * @pgend: The ending page (inclusive)
69 * @purged: The purge status (ASHMEM_NOT or ASHMEM_WAS_PURGED)
71 * The lifecycle of this structure is from unpin to pin.
72 * It is protected by 'ashmem_mutex'
76 struct list_head unpinned
;
77 struct ashmem_area
*asma
;
83 /* LRU list of unpinned pages, protected by ashmem_mutex */
84 static LIST_HEAD(ashmem_lru_list
);
87 * long lru_count - The count of pages on our LRU list.
89 * This is protected by ashmem_mutex.
91 static unsigned long lru_count
;
94 * ashmem_mutex - protects the list of and each individual ashmem_area
96 * Lock Ordering: ashmex_mutex -> i_mutex -> i_alloc_sem
98 static DEFINE_MUTEX(ashmem_mutex
);
100 static struct kmem_cache
*ashmem_area_cachep __read_mostly
;
101 static struct kmem_cache
*ashmem_range_cachep __read_mostly
;
103 static inline unsigned long range_size(struct ashmem_range
*range
)
105 return range
->pgend
- range
->pgstart
+ 1;
108 static inline bool range_on_lru(struct ashmem_range
*range
)
110 return range
->purged
== ASHMEM_NOT_PURGED
;
113 static inline bool page_range_subsumes_range(struct ashmem_range
*range
,
114 size_t start
, size_t end
)
116 return (range
->pgstart
>= start
) && (range
->pgend
<= end
);
119 static inline bool page_range_subsumed_by_range(struct ashmem_range
*range
,
120 size_t start
, size_t end
)
122 return (range
->pgstart
<= start
) && (range
->pgend
>= end
);
125 static inline bool page_in_range(struct ashmem_range
*range
, size_t page
)
127 return (range
->pgstart
<= page
) && (range
->pgend
>= page
);
130 static inline bool page_range_in_range(struct ashmem_range
*range
,
131 size_t start
, size_t end
)
133 return page_in_range(range
, start
) || page_in_range(range
, end
) ||
134 page_range_subsumes_range(range
, start
, end
);
137 static inline bool range_before_page(struct ashmem_range
*range
, size_t page
)
139 return range
->pgend
< page
;
142 #define PROT_MASK (PROT_EXEC | PROT_READ | PROT_WRITE)
145 * lru_add() - Adds a range of memory to the LRU list
146 * @range: The memory range being added.
148 * The range is first added to the end (tail) of the LRU list.
149 * After this, the size of the range is added to @lru_count
151 static inline void lru_add(struct ashmem_range
*range
)
153 list_add_tail(&range
->lru
, &ashmem_lru_list
);
154 lru_count
+= range_size(range
);
158 * lru_del() - Removes a range of memory from the LRU list
159 * @range: The memory range being removed
161 * The range is first deleted from the LRU list.
162 * After this, the size of the range is removed from @lru_count
164 static inline void lru_del(struct ashmem_range
*range
)
166 list_del(&range
->lru
);
167 lru_count
-= range_size(range
);
171 * range_alloc() - Allocates and initializes a new ashmem_range structure
172 * @asma: The associated ashmem_area
173 * @prev_range: The previous ashmem_range in the sorted asma->unpinned list
174 * @purged: Initial purge status (ASMEM_NOT_PURGED or ASHMEM_WAS_PURGED)
175 * @start: The starting page (inclusive)
176 * @end: The ending page (inclusive)
178 * This function is protected by ashmem_mutex.
180 * Return: 0 if successful, or -ENOMEM if there is an error
182 static int range_alloc(struct ashmem_area
*asma
,
183 struct ashmem_range
*prev_range
, unsigned int purged
,
184 size_t start
, size_t end
)
186 struct ashmem_range
*range
;
188 range
= kmem_cache_zalloc(ashmem_range_cachep
, GFP_KERNEL
);
189 if (unlikely(!range
))
193 range
->pgstart
= start
;
195 range
->purged
= purged
;
197 list_add_tail(&range
->unpinned
, &prev_range
->unpinned
);
199 if (range_on_lru(range
))
206 * range_del() - Deletes and dealloctes an ashmem_range structure
207 * @range: The associated ashmem_range that has previously been allocated
209 static void range_del(struct ashmem_range
*range
)
211 list_del(&range
->unpinned
);
212 if (range_on_lru(range
))
214 kmem_cache_free(ashmem_range_cachep
, range
);
218 * range_shrink() - Shrinks an ashmem_range
219 * @range: The associated ashmem_range being shrunk
220 * @start: The starting byte of the new range
221 * @end: The ending byte of the new range
223 * This does not modify the data inside the existing range in any way - It
224 * simply shrinks the boundaries of the range.
226 * Theoretically, with a little tweaking, this could eventually be changed
227 * to range_resize, and expand the lru_count if the new range is larger.
229 static inline void range_shrink(struct ashmem_range
*range
,
230 size_t start
, size_t end
)
232 size_t pre
= range_size(range
);
234 range
->pgstart
= start
;
237 if (range_on_lru(range
))
238 lru_count
-= pre
- range_size(range
);
242 * ashmem_open() - Opens an Anonymous Shared Memory structure
243 * @inode: The backing file's index node(?)
244 * @file: The backing file
246 * Please note that the ashmem_area is not returned by this function - It is
247 * instead written to "file->private_data".
249 * Return: 0 if successful, or another code if unsuccessful.
251 static int ashmem_open(struct inode
*inode
, struct file
*file
)
253 struct ashmem_area
*asma
;
256 ret
= generic_file_open(inode
, file
);
260 asma
= kmem_cache_zalloc(ashmem_area_cachep
, GFP_KERNEL
);
264 INIT_LIST_HEAD(&asma
->unpinned_list
);
265 memcpy(asma
->name
, ASHMEM_NAME_PREFIX
, ASHMEM_NAME_PREFIX_LEN
);
266 asma
->prot_mask
= PROT_MASK
;
267 file
->private_data
= asma
;
273 * ashmem_release() - Releases an Anonymous Shared Memory structure
274 * @ignored: The backing file's Index Node(?) - It is ignored here.
275 * @file: The backing file
277 * Return: 0 if successful. If it is anything else, go have a coffee and
280 static int ashmem_release(struct inode
*ignored
, struct file
*file
)
282 struct ashmem_area
*asma
= file
->private_data
;
283 struct ashmem_range
*range
, *next
;
285 mutex_lock(&ashmem_mutex
);
286 list_for_each_entry_safe(range
, next
, &asma
->unpinned_list
, unpinned
)
288 mutex_unlock(&ashmem_mutex
);
292 kmem_cache_free(ashmem_area_cachep
, asma
);
297 static ssize_t
ashmem_read_iter(struct kiocb
*iocb
, struct iov_iter
*iter
)
299 struct ashmem_area
*asma
= iocb
->ki_filp
->private_data
;
302 mutex_lock(&ashmem_mutex
);
304 /* If size is not set, or set to 0, always return EOF. */
314 * asma and asma->file are used outside the lock here. We assume
315 * once asma->file is set it will never be changed, and will not
316 * be destroyed until all references to the file are dropped and
317 * ashmem_release is called.
319 mutex_unlock(&ashmem_mutex
);
320 ret
= vfs_iter_read(asma
->file
, iter
, &iocb
->ki_pos
, 0);
321 mutex_lock(&ashmem_mutex
);
323 asma
->file
->f_pos
= iocb
->ki_pos
;
325 mutex_unlock(&ashmem_mutex
);
329 static loff_t
ashmem_llseek(struct file
*file
, loff_t offset
, int origin
)
331 struct ashmem_area
*asma
= file
->private_data
;
334 mutex_lock(&ashmem_mutex
);
336 if (asma
->size
== 0) {
337 mutex_unlock(&ashmem_mutex
);
342 mutex_unlock(&ashmem_mutex
);
346 mutex_unlock(&ashmem_mutex
);
348 ret
= vfs_llseek(asma
->file
, offset
, origin
);
352 /** Copy f_pos from backing file, since f_ops->llseek() sets it */
353 file
->f_pos
= asma
->file
->f_pos
;
357 static inline vm_flags_t
calc_vm_may_flags(unsigned long prot
)
359 return _calc_vm_trans(prot
, PROT_READ
, VM_MAYREAD
) |
360 _calc_vm_trans(prot
, PROT_WRITE
, VM_MAYWRITE
) |
361 _calc_vm_trans(prot
, PROT_EXEC
, VM_MAYEXEC
);
364 static int ashmem_mmap(struct file
*file
, struct vm_area_struct
*vma
)
366 struct ashmem_area
*asma
= file
->private_data
;
369 mutex_lock(&ashmem_mutex
);
371 /* user needs to SET_SIZE before mapping */
372 if (unlikely(!asma
->size
)) {
377 /* requested protection bits must match our allowed protection mask */
378 if (unlikely((vma
->vm_flags
& ~calc_vm_prot_bits(asma
->prot_mask
, 0)) &
379 calc_vm_prot_bits(PROT_MASK
, 0))) {
383 vma
->vm_flags
&= ~calc_vm_may_flags(~asma
->prot_mask
);
386 char *name
= ASHMEM_NAME_DEF
;
389 if (asma
->name
[ASHMEM_NAME_PREFIX_LEN
] != '\0')
392 /* ... and allocate the backing shmem file */
393 vmfile
= shmem_file_setup(name
, asma
->size
, vma
->vm_flags
);
394 if (IS_ERR(vmfile
)) {
395 ret
= PTR_ERR(vmfile
);
398 vmfile
->f_mode
|= FMODE_LSEEK
;
401 get_file(asma
->file
);
403 if (vma
->vm_flags
& VM_SHARED
)
404 shmem_set_file(vma
, asma
->file
);
408 vma
->vm_file
= asma
->file
;
412 mutex_unlock(&ashmem_mutex
);
417 * ashmem_shrink - our cache shrinker, called from mm/vmscan.c
419 * 'nr_to_scan' is the number of objects to scan for freeing.
421 * 'gfp_mask' is the mask of the allocation that got us into this mess.
423 * Return value is the number of objects freed or -1 if we cannot
424 * proceed without risk of deadlock (due to gfp_mask).
426 * We approximate LRU via least-recently-unpinned, jettisoning unpinned partial
427 * chunks of ashmem regions LRU-wise one-at-a-time until we hit 'nr_to_scan'
431 ashmem_shrink_scan(struct shrinker
*shrink
, struct shrink_control
*sc
)
433 struct ashmem_range
*range
, *next
;
434 unsigned long freed
= 0;
436 /* We might recurse into filesystem code, so bail out if necessary */
437 if (!(sc
->gfp_mask
& __GFP_FS
))
440 if (!mutex_trylock(&ashmem_mutex
))
443 list_for_each_entry_safe(range
, next
, &ashmem_lru_list
, lru
) {
444 loff_t start
= range
->pgstart
* PAGE_SIZE
;
445 loff_t end
= (range
->pgend
+ 1) * PAGE_SIZE
;
447 range
->asma
->file
->f_op
->fallocate(range
->asma
->file
,
448 FALLOC_FL_PUNCH_HOLE
| FALLOC_FL_KEEP_SIZE
,
450 range
->purged
= ASHMEM_WAS_PURGED
;
453 freed
+= range_size(range
);
454 if (--sc
->nr_to_scan
<= 0)
457 mutex_unlock(&ashmem_mutex
);
462 ashmem_shrink_count(struct shrinker
*shrink
, struct shrink_control
*sc
)
465 * note that lru_count is count of pages on the lru, not a count of
466 * objects on the list. This means the scan function needs to return the
467 * number of pages freed, not the number of objects scanned.
472 static struct shrinker ashmem_shrinker
= {
473 .count_objects
= ashmem_shrink_count
,
474 .scan_objects
= ashmem_shrink_scan
,
476 * XXX (dchinner): I wish people would comment on why they need on
477 * significant changes to the default value here
479 .seeks
= DEFAULT_SEEKS
* 4,
482 static int set_prot_mask(struct ashmem_area
*asma
, unsigned long prot
)
486 mutex_lock(&ashmem_mutex
);
488 /* the user can only remove, not add, protection bits */
489 if (unlikely((asma
->prot_mask
& prot
) != prot
)) {
494 /* does the application expect PROT_READ to imply PROT_EXEC? */
495 if ((prot
& PROT_READ
) && (current
->personality
& READ_IMPLIES_EXEC
))
498 asma
->prot_mask
= prot
;
501 mutex_unlock(&ashmem_mutex
);
505 static int set_name(struct ashmem_area
*asma
, void __user
*name
)
509 char local_name
[ASHMEM_NAME_LEN
];
512 * Holding the ashmem_mutex while doing a copy_from_user might cause
513 * an data abort which would try to access mmap_sem. If another
514 * thread has invoked ashmem_mmap then it will be holding the
515 * semaphore and will be waiting for ashmem_mutex, there by leading to
516 * deadlock. We'll release the mutex and take the name to a local
517 * variable that does not need protection and later copy the local
518 * variable to the structure member with lock held.
520 len
= strncpy_from_user(local_name
, name
, ASHMEM_NAME_LEN
);
523 if (len
== ASHMEM_NAME_LEN
)
524 local_name
[ASHMEM_NAME_LEN
- 1] = '\0';
525 mutex_lock(&ashmem_mutex
);
526 /* cannot change an existing mapping's name */
527 if (unlikely(asma
->file
))
530 strcpy(asma
->name
+ ASHMEM_NAME_PREFIX_LEN
, local_name
);
532 mutex_unlock(&ashmem_mutex
);
536 static int get_name(struct ashmem_area
*asma
, void __user
*name
)
541 * Have a local variable to which we'll copy the content
542 * from asma with the lock held. Later we can copy this to the user
543 * space safely without holding any locks. So even if we proceed to
544 * wait for mmap_sem, it won't lead to deadlock.
546 char local_name
[ASHMEM_NAME_LEN
];
548 mutex_lock(&ashmem_mutex
);
549 if (asma
->name
[ASHMEM_NAME_PREFIX_LEN
] != '\0') {
551 * Copying only `len', instead of ASHMEM_NAME_LEN, bytes
552 * prevents us from revealing one user's stack to another.
554 len
= strlen(asma
->name
+ ASHMEM_NAME_PREFIX_LEN
) + 1;
555 memcpy(local_name
, asma
->name
+ ASHMEM_NAME_PREFIX_LEN
, len
);
557 len
= sizeof(ASHMEM_NAME_DEF
);
558 memcpy(local_name
, ASHMEM_NAME_DEF
, len
);
560 mutex_unlock(&ashmem_mutex
);
563 * Now we are just copying from the stack variable to userland
566 if (unlikely(copy_to_user(name
, local_name
, len
)))
572 * ashmem_pin - pin the given ashmem region, returning whether it was
573 * previously purged (ASHMEM_WAS_PURGED) or not (ASHMEM_NOT_PURGED).
575 * Caller must hold ashmem_mutex.
577 static int ashmem_pin(struct ashmem_area
*asma
, size_t pgstart
, size_t pgend
)
579 struct ashmem_range
*range
, *next
;
580 int ret
= ASHMEM_NOT_PURGED
;
582 list_for_each_entry_safe(range
, next
, &asma
->unpinned_list
, unpinned
) {
583 /* moved past last applicable page; we can short circuit */
584 if (range_before_page(range
, pgstart
))
588 * The user can ask us to pin pages that span multiple ranges,
589 * or to pin pages that aren't even unpinned, so this is messy.
592 * 1. The requested range subsumes an existing range, so we
593 * just remove the entire matching range.
594 * 2. The requested range overlaps the start of an existing
595 * range, so we just update that range.
596 * 3. The requested range overlaps the end of an existing
597 * range, so we just update that range.
598 * 4. The requested range punches a hole in an existing range,
599 * so we have to update one side of the range and then
600 * create a new range for the other side.
602 if (page_range_in_range(range
, pgstart
, pgend
)) {
603 ret
|= range
->purged
;
605 /* Case #1: Easy. Just nuke the whole thing. */
606 if (page_range_subsumes_range(range
, pgstart
, pgend
)) {
611 /* Case #2: We overlap from the start, so adjust it */
612 if (range
->pgstart
>= pgstart
) {
613 range_shrink(range
, pgend
+ 1, range
->pgend
);
617 /* Case #3: We overlap from the rear, so adjust it */
618 if (range
->pgend
<= pgend
) {
619 range_shrink(range
, range
->pgstart
,
625 * Case #4: We eat a chunk out of the middle. A bit
626 * more complicated, we allocate a new range for the
627 * second half and adjust the first chunk's endpoint.
629 range_alloc(asma
, range
, range
->purged
,
630 pgend
+ 1, range
->pgend
);
631 range_shrink(range
, range
->pgstart
, pgstart
- 1);
640 * ashmem_unpin - unpin the given range of pages. Returns zero on success.
642 * Caller must hold ashmem_mutex.
644 static int ashmem_unpin(struct ashmem_area
*asma
, size_t pgstart
, size_t pgend
)
646 struct ashmem_range
*range
, *next
;
647 unsigned int purged
= ASHMEM_NOT_PURGED
;
650 list_for_each_entry_safe(range
, next
, &asma
->unpinned_list
, unpinned
) {
651 /* short circuit: this is our insertion point */
652 if (range_before_page(range
, pgstart
))
656 * The user can ask us to unpin pages that are already entirely
657 * or partially pinned. We handle those two cases here.
659 if (page_range_subsumed_by_range(range
, pgstart
, pgend
))
661 if (page_range_in_range(range
, pgstart
, pgend
)) {
662 pgstart
= min(range
->pgstart
, pgstart
);
663 pgend
= max(range
->pgend
, pgend
);
664 purged
|= range
->purged
;
670 return range_alloc(asma
, range
, purged
, pgstart
, pgend
);
674 * ashmem_get_pin_status - Returns ASHMEM_IS_UNPINNED if _any_ pages in the
675 * given interval are unpinned and ASHMEM_IS_PINNED otherwise.
677 * Caller must hold ashmem_mutex.
679 static int ashmem_get_pin_status(struct ashmem_area
*asma
, size_t pgstart
,
682 struct ashmem_range
*range
;
683 int ret
= ASHMEM_IS_PINNED
;
685 list_for_each_entry(range
, &asma
->unpinned_list
, unpinned
) {
686 if (range_before_page(range
, pgstart
))
688 if (page_range_in_range(range
, pgstart
, pgend
)) {
689 ret
= ASHMEM_IS_UNPINNED
;
697 static int ashmem_pin_unpin(struct ashmem_area
*asma
, unsigned long cmd
,
700 struct ashmem_pin pin
;
701 size_t pgstart
, pgend
;
704 if (unlikely(copy_from_user(&pin
, p
, sizeof(pin
))))
707 mutex_lock(&ashmem_mutex
);
709 if (unlikely(!asma
->file
))
712 /* per custom, you can pass zero for len to mean "everything onward" */
714 pin
.len
= PAGE_ALIGN(asma
->size
) - pin
.offset
;
716 if (unlikely((pin
.offset
| pin
.len
) & ~PAGE_MASK
))
719 if (unlikely(((__u32
)-1) - pin
.offset
< pin
.len
))
722 if (unlikely(PAGE_ALIGN(asma
->size
) < pin
.offset
+ pin
.len
))
725 pgstart
= pin
.offset
/ PAGE_SIZE
;
726 pgend
= pgstart
+ (pin
.len
/ PAGE_SIZE
) - 1;
730 ret
= ashmem_pin(asma
, pgstart
, pgend
);
733 ret
= ashmem_unpin(asma
, pgstart
, pgend
);
735 case ASHMEM_GET_PIN_STATUS
:
736 ret
= ashmem_get_pin_status(asma
, pgstart
, pgend
);
741 mutex_unlock(&ashmem_mutex
);
746 static long ashmem_ioctl(struct file
*file
, unsigned int cmd
, unsigned long arg
)
748 struct ashmem_area
*asma
= file
->private_data
;
752 case ASHMEM_SET_NAME
:
753 ret
= set_name(asma
, (void __user
*)arg
);
755 case ASHMEM_GET_NAME
:
756 ret
= get_name(asma
, (void __user
*)arg
);
758 case ASHMEM_SET_SIZE
:
760 mutex_lock(&ashmem_mutex
);
763 asma
->size
= (size_t)arg
;
765 mutex_unlock(&ashmem_mutex
);
767 case ASHMEM_GET_SIZE
:
770 case ASHMEM_SET_PROT_MASK
:
771 ret
= set_prot_mask(asma
, arg
);
773 case ASHMEM_GET_PROT_MASK
:
774 ret
= asma
->prot_mask
;
778 case ASHMEM_GET_PIN_STATUS
:
779 ret
= ashmem_pin_unpin(asma
, cmd
, (void __user
*)arg
);
781 case ASHMEM_PURGE_ALL_CACHES
:
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
);
797 /* support of 32bit userspace on 64bit platforms */
799 static long compat_ashmem_ioctl(struct file
*file
, unsigned int cmd
,
803 case COMPAT_ASHMEM_SET_SIZE
:
804 cmd
= ASHMEM_SET_SIZE
;
806 case COMPAT_ASHMEM_SET_PROT_MASK
:
807 cmd
= ASHMEM_SET_PROT_MASK
;
810 return ashmem_ioctl(file
, cmd
, arg
);
814 static const struct file_operations ashmem_fops
= {
815 .owner
= THIS_MODULE
,
817 .release
= ashmem_release
,
818 .read_iter
= ashmem_read_iter
,
819 .llseek
= ashmem_llseek
,
821 .unlocked_ioctl
= ashmem_ioctl
,
823 .compat_ioctl
= compat_ashmem_ioctl
,
827 static struct miscdevice ashmem_misc
= {
828 .minor
= MISC_DYNAMIC_MINOR
,
830 .fops
= &ashmem_fops
,
833 static int __init
ashmem_init(void)
837 ashmem_area_cachep
= kmem_cache_create("ashmem_area_cache",
838 sizeof(struct ashmem_area
),
840 if (unlikely(!ashmem_area_cachep
)) {
841 pr_err("failed to create slab cache\n");
845 ashmem_range_cachep
= kmem_cache_create("ashmem_range_cache",
846 sizeof(struct ashmem_range
),
848 if (unlikely(!ashmem_range_cachep
)) {
849 pr_err("failed to create slab cache\n");
853 ret
= misc_register(&ashmem_misc
);
855 pr_err("failed to register misc device!\n");
859 register_shrinker(&ashmem_shrinker
);
861 pr_info("initialized\n");
866 kmem_cache_destroy(ashmem_range_cachep
);
868 kmem_cache_destroy(ashmem_area_cachep
);
872 device_initcall(ashmem_init
);