1 // SPDX-License-Identifier: GPL-2.0
4 * Anonymous Shared Memory Subsystem, ashmem
6 * Copyright (C) 2008 Google, Inc.
8 * Robert Love <rlove@google.com>
11 #define pr_fmt(fmt) "ashmem: " fmt
13 #include <linux/init.h>
14 #include <linux/export.h>
15 #include <linux/file.h>
17 #include <linux/falloc.h>
18 #include <linux/miscdevice.h>
19 #include <linux/security.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>
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)
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()
47 char name
[ASHMEM_FULL_NAME_LEN
];
48 struct list_head unpinned_list
;
51 unsigned long prot_mask
;
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'
68 struct list_head unpinned
;
69 struct ashmem_area
*asma
;
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
))
185 range
->pgstart
= start
;
187 range
->purged
= purged
;
189 list_add_tail(&range
->unpinned
, &prev_range
->unpinned
);
191 if (range_on_lru(range
))
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
))
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
;
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
;
248 ret
= generic_file_open(inode
, file
);
252 asma
= kmem_cache_zalloc(ashmem_area_cachep
, GFP_KERNEL
);
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
;
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
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
)
280 mutex_unlock(&ashmem_mutex
);
284 kmem_cache_free(ashmem_area_cachep
, asma
);
289 static ssize_t
ashmem_read_iter(struct kiocb
*iocb
, struct iov_iter
*iter
)
291 struct ashmem_area
*asma
= iocb
->ki_filp
->private_data
;
294 mutex_lock(&ashmem_mutex
);
296 /* If size is not set, or set to 0, always return EOF. */
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
);
315 asma
->file
->f_pos
= iocb
->ki_pos
;
317 mutex_unlock(&ashmem_mutex
);
321 static loff_t
ashmem_llseek(struct file
*file
, loff_t offset
, int origin
)
323 struct ashmem_area
*asma
= file
->private_data
;
326 mutex_lock(&ashmem_mutex
);
328 if (asma
->size
== 0) {
338 ret
= vfs_llseek(asma
->file
, offset
, origin
);
342 /** Copy f_pos from backing file, since f_ops->llseek() sets it */
343 file
->f_pos
= asma
->file
->f_pos
;
346 mutex_unlock(&ashmem_mutex
);
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
;
362 mutex_lock(&ashmem_mutex
);
364 /* user needs to SET_SIZE before mapping */
365 if (unlikely(!asma
->size
)) {
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))) {
376 vma
->vm_flags
&= ~calc_vm_may_flags(~asma
->prot_mask
);
379 char *name
= ASHMEM_NAME_DEF
;
382 if (asma
->name
[ASHMEM_NAME_PREFIX_LEN
] != '\0')
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
);
391 vmfile
->f_mode
|= FMODE_LSEEK
;
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
);
410 vma
->vm_file
= asma
->file
;
413 mutex_unlock(&ashmem_mutex
);
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'
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
))
441 if (!mutex_trylock(&ashmem_mutex
))
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
,
451 range
->purged
= ASHMEM_WAS_PURGED
;
454 freed
+= range_size(range
);
455 if (--sc
->nr_to_scan
<= 0)
458 mutex_unlock(&ashmem_mutex
);
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.
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
)
487 mutex_lock(&ashmem_mutex
);
489 /* the user can only remove, not add, protection bits */
490 if (unlikely((asma
->prot_mask
& prot
) != prot
)) {
495 /* does the application expect PROT_READ to imply PROT_EXEC? */
496 if ((prot
& PROT_READ
) && (current
->personality
& READ_IMPLIES_EXEC
))
499 asma
->prot_mask
= prot
;
502 mutex_unlock(&ashmem_mutex
);
506 static int set_name(struct ashmem_area
*asma
, void __user
*name
)
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
);
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
))
531 strcpy(asma
->name
+ ASHMEM_NAME_PREFIX_LEN
, local_name
);
533 mutex_unlock(&ashmem_mutex
);
537 static int get_name(struct ashmem_area
*asma
, void __user
*name
)
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
);
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
567 if (unlikely(copy_to_user(name
, local_name
, len
)))
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
))
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.
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
)) {
612 /* Case #2: We overlap from the start, so adjust it */
613 if (range
->pgstart
>= pgstart
) {
614 range_shrink(range
, pgend
+ 1, range
->pgend
);
618 /* Case #3: We overlap from the rear, so adjust it */
619 if (range
->pgend
<= pgend
) {
620 range_shrink(range
, range
->pgstart
,
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);
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
;
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
))
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
))
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
;
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
,
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
))
689 if (page_range_in_range(range
, pgstart
, pgend
)) {
690 ret
= ASHMEM_IS_UNPINNED
;
698 static int ashmem_pin_unpin(struct ashmem_area
*asma
, unsigned long cmd
,
701 struct ashmem_pin pin
;
702 size_t pgstart
, pgend
;
705 if (unlikely(!asma
->file
))
708 if (unlikely(copy_from_user(&pin
, p
, sizeof(pin
))))
711 /* per custom, you can pass zero for len to mean "everything onward" */
713 pin
.len
= PAGE_ALIGN(asma
->size
) - pin
.offset
;
715 if (unlikely((pin
.offset
| pin
.len
) & ~PAGE_MASK
))
718 if (unlikely(((__u32
)-1) - pin
.offset
< pin
.len
))
721 if (unlikely(PAGE_ALIGN(asma
->size
) < pin
.offset
+ pin
.len
))
724 pgstart
= pin
.offset
/ PAGE_SIZE
;
725 pgend
= pgstart
+ (pin
.len
/ PAGE_SIZE
) - 1;
727 mutex_lock(&ashmem_mutex
);
731 ret
= ashmem_pin(asma
, pgstart
, pgend
);
734 ret
= ashmem_unpin(asma
, pgstart
, pgend
);
736 case ASHMEM_GET_PIN_STATUS
:
737 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
);
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
);
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
);
830 static const struct file_operations ashmem_fops
= {
831 .owner
= THIS_MODULE
,
833 .release
= ashmem_release
,
834 .read_iter
= ashmem_read_iter
,
835 .llseek
= ashmem_llseek
,
837 .unlocked_ioctl
= ashmem_ioctl
,
839 .compat_ioctl
= compat_ashmem_ioctl
,
841 #ifdef CONFIG_PROC_FS
842 .show_fdinfo
= ashmem_show_fdinfo
,
846 static struct miscdevice ashmem_misc
= {
847 .minor
= MISC_DYNAMIC_MINOR
,
849 .fops
= &ashmem_fops
,
852 static int __init
ashmem_init(void)
856 ashmem_area_cachep
= kmem_cache_create("ashmem_area_cache",
857 sizeof(struct ashmem_area
),
859 if (unlikely(!ashmem_area_cachep
)) {
860 pr_err("failed to create slab cache\n");
864 ashmem_range_cachep
= kmem_cache_create("ashmem_range_cache",
865 sizeof(struct ashmem_range
),
867 if (unlikely(!ashmem_range_cachep
)) {
868 pr_err("failed to create slab cache\n");
872 ret
= misc_register(&ashmem_misc
);
874 pr_err("failed to register misc device!\n");
878 ret
= register_shrinker(&ashmem_shrinker
);
880 pr_err("failed to register shrinker!\n");
884 pr_info("initialized\n");
889 misc_deregister(&ashmem_misc
);
891 kmem_cache_destroy(ashmem_range_cachep
);
893 kmem_cache_destroy(ashmem_area_cachep
);
897 device_initcall(ashmem_init
);