Loading...
1/*
2 * Copyright (C) 2017 Google, Inc.
3 *
4 * This software is licensed under the terms of the GNU General Public
5 * License version 2, as published by the Free Software Foundation, and
6 * may be copied, distributed, and modified under those terms.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
12 *
13 */
14
15#ifndef _LINUX_BINDER_ALLOC_H
16#define _LINUX_BINDER_ALLOC_H
17
18#include <linux/rbtree.h>
19#include <linux/list.h>
20#include <linux/mm.h>
21#include <linux/rtmutex.h>
22#include <linux/vmalloc.h>
23#include <linux/slab.h>
24#include <linux/list_lru.h>
25
26extern struct list_lru binder_alloc_lru;
27struct binder_transaction;
28
29/**
30 * struct binder_buffer - buffer used for binder transactions
31 * @entry: entry alloc->buffers
32 * @rb_node: node for allocated_buffers/free_buffers rb trees
33 * @free: true if buffer is free
34 * @allow_user_free: describe the second member of struct blah,
35 * @async_transaction: describe the second member of struct blah,
36 * @debug_id: describe the second member of struct blah,
37 * @transaction: describe the second member of struct blah,
38 * @target_node: describe the second member of struct blah,
39 * @data_size: describe the second member of struct blah,
40 * @offsets_size: describe the second member of struct blah,
41 * @extra_buffers_size: describe the second member of struct blah,
42 * @data:i describe the second member of struct blah,
43 *
44 * Bookkeeping structure for binder transaction buffers
45 */
46struct binder_buffer {
47 struct list_head entry; /* free and allocated entries by address */
48 struct rb_node rb_node; /* free entry by size or allocated entry */
49 /* by address */
50 unsigned free:1;
51 unsigned allow_user_free:1;
52 unsigned async_transaction:1;
53 unsigned free_in_progress:1;
54 unsigned debug_id:28;
55
56 struct binder_transaction *transaction;
57
58 struct binder_node *target_node;
59 size_t data_size;
60 size_t offsets_size;
61 size_t extra_buffers_size;
62 void *data;
63};
64
65/**
66 * struct binder_lru_page - page object used for binder shrinker
67 * @page_ptr: pointer to physical page in mmap'd space
68 * @lru: entry in binder_alloc_lru
69 * @alloc: binder_alloc for a proc
70 */
71struct binder_lru_page {
72 struct list_head lru;
73 struct page *page_ptr;
74 struct binder_alloc *alloc;
75};
76
77/**
78 * struct binder_alloc - per-binder proc state for binder allocator
79 * @vma: vm_area_struct passed to mmap_handler
80 * (invarient after mmap)
81 * @tsk: tid for task that called init for this proc
82 * (invariant after init)
83 * @vma_vm_mm: copy of vma->vm_mm (invarient after mmap)
84 * @buffer: base of per-proc address space mapped via mmap
85 * @user_buffer_offset: offset between user and kernel VAs for buffer
86 * @buffers: list of all buffers for this proc
87 * @free_buffers: rb tree of buffers available for allocation
88 * sorted by size
89 * @allocated_buffers: rb tree of allocated buffers sorted by address
90 * @free_async_space: VA space available for async buffers. This is
91 * initialized at mmap time to 1/2 the full VA space
92 * @pages: array of binder_lru_page
93 * @buffer_size: size of address space specified via mmap
94 * @pid: pid for associated binder_proc (invariant after init)
95 * @pages_high: high watermark of offset in @pages
96 *
97 * Bookkeeping structure for per-proc address space management for binder
98 * buffers. It is normally initialized during binder_init() and binder_mmap()
99 * calls. The address space is used for both user-visible buffers and for
100 * struct binder_buffer objects used to track the user buffers
101 */
102struct binder_alloc {
103 struct mutex mutex;
104 struct vm_area_struct *vma;
105 struct mm_struct *vma_vm_mm;
106 void *buffer;
107 ptrdiff_t user_buffer_offset;
108 struct list_head buffers;
109 struct rb_root free_buffers;
110 struct rb_root allocated_buffers;
111 size_t free_async_space;
112 struct binder_lru_page *pages;
113 size_t buffer_size;
114 uint32_t buffer_free;
115 int pid;
116 size_t pages_high;
117};
118
119#ifdef CONFIG_ANDROID_BINDER_IPC_SELFTEST
120void binder_selftest_alloc(struct binder_alloc *alloc);
121#else
122static inline void binder_selftest_alloc(struct binder_alloc *alloc) {}
123#endif
124enum lru_status binder_alloc_free_page(struct list_head *item,
125 struct list_lru_one *lru,
126 spinlock_t *lock, void *cb_arg);
127extern struct binder_buffer *binder_alloc_new_buf(struct binder_alloc *alloc,
128 size_t data_size,
129 size_t offsets_size,
130 size_t extra_buffers_size,
131 int is_async);
132extern void binder_alloc_init(struct binder_alloc *alloc);
133extern int binder_alloc_shrinker_init(void);
134extern void binder_alloc_vma_close(struct binder_alloc *alloc);
135extern struct binder_buffer *
136binder_alloc_prepare_to_free(struct binder_alloc *alloc,
137 uintptr_t user_ptr);
138extern void binder_alloc_free_buf(struct binder_alloc *alloc,
139 struct binder_buffer *buffer);
140extern int binder_alloc_mmap_handler(struct binder_alloc *alloc,
141 struct vm_area_struct *vma);
142extern void binder_alloc_deferred_release(struct binder_alloc *alloc);
143extern int binder_alloc_get_allocated_count(struct binder_alloc *alloc);
144extern void binder_alloc_print_allocated(struct seq_file *m,
145 struct binder_alloc *alloc);
146void binder_alloc_print_pages(struct seq_file *m,
147 struct binder_alloc *alloc);
148
149/**
150 * binder_alloc_get_free_async_space() - get free space available for async
151 * @alloc: binder_alloc for this proc
152 *
153 * Return: the bytes remaining in the address-space for async transactions
154 */
155static inline size_t
156binder_alloc_get_free_async_space(struct binder_alloc *alloc)
157{
158 size_t free_async_space;
159
160 mutex_lock(&alloc->mutex);
161 free_async_space = alloc->free_async_space;
162 mutex_unlock(&alloc->mutex);
163 return free_async_space;
164}
165
166/**
167 * binder_alloc_get_user_buffer_offset() - get offset between kernel/user addrs
168 * @alloc: binder_alloc for this proc
169 *
170 * Return: the offset between kernel and user-space addresses to use for
171 * virtual address conversion
172 */
173static inline ptrdiff_t
174binder_alloc_get_user_buffer_offset(struct binder_alloc *alloc)
175{
176 /*
177 * user_buffer_offset is constant if vma is set and
178 * undefined if vma is not set. It is possible to
179 * get here with !alloc->vma if the target process
180 * is dying while a transaction is being initiated.
181 * Returning the old value is ok in this case and
182 * the transaction will fail.
183 */
184 return alloc->user_buffer_offset;
185}
186
187#endif /* _LINUX_BINDER_ALLOC_H */
188
1/* SPDX-License-Identifier: GPL-2.0-only */
2/*
3 * Copyright (C) 2017 Google, Inc.
4 */
5
6#ifndef _LINUX_BINDER_ALLOC_H
7#define _LINUX_BINDER_ALLOC_H
8
9#include <linux/rbtree.h>
10#include <linux/list.h>
11#include <linux/mm.h>
12#include <linux/spinlock.h>
13#include <linux/vmalloc.h>
14#include <linux/slab.h>
15#include <linux/list_lru.h>
16#include <uapi/linux/android/binder.h>
17
18extern struct list_lru binder_freelist;
19struct binder_transaction;
20
21/**
22 * struct binder_buffer - buffer used for binder transactions
23 * @entry: entry alloc->buffers
24 * @rb_node: node for allocated_buffers/free_buffers rb trees
25 * @free: %true if buffer is free
26 * @clear_on_free: %true if buffer must be zeroed after use
27 * @allow_user_free: %true if user is allowed to free buffer
28 * @async_transaction: %true if buffer is in use for an async txn
29 * @oneway_spam_suspect: %true if total async allocate size just exceed
30 * spamming detect threshold
31 * @debug_id: unique ID for debugging
32 * @transaction: pointer to associated struct binder_transaction
33 * @target_node: struct binder_node associated with this buffer
34 * @data_size: size of @transaction data
35 * @offsets_size: size of array of offsets
36 * @extra_buffers_size: size of space for other objects (like sg lists)
37 * @user_data: user pointer to base of buffer space
38 * @pid: pid to attribute the buffer to (caller)
39 *
40 * Bookkeeping structure for binder transaction buffers
41 */
42struct binder_buffer {
43 struct list_head entry; /* free and allocated entries by address */
44 struct rb_node rb_node; /* free entry by size or allocated entry */
45 /* by address */
46 unsigned free:1;
47 unsigned clear_on_free:1;
48 unsigned allow_user_free:1;
49 unsigned async_transaction:1;
50 unsigned oneway_spam_suspect:1;
51 unsigned debug_id:27;
52 struct binder_transaction *transaction;
53 struct binder_node *target_node;
54 size_t data_size;
55 size_t offsets_size;
56 size_t extra_buffers_size;
57 unsigned long user_data;
58 int pid;
59};
60
61/**
62 * struct binder_lru_page - page object used for binder shrinker
63 * @page_ptr: pointer to physical page in mmap'd space
64 * @lru: entry in binder_freelist
65 * @alloc: binder_alloc for a proc
66 */
67struct binder_lru_page {
68 struct list_head lru;
69 struct page *page_ptr;
70 struct binder_alloc *alloc;
71};
72
73/**
74 * struct binder_alloc - per-binder proc state for binder allocator
75 * @lock: protects binder_alloc fields
76 * @vma: vm_area_struct passed to mmap_handler
77 * (invariant after mmap)
78 * @mm: copy of task->mm (invariant after open)
79 * @buffer: base of per-proc address space mapped via mmap
80 * @buffers: list of all buffers for this proc
81 * @free_buffers: rb tree of buffers available for allocation
82 * sorted by size
83 * @allocated_buffers: rb tree of allocated buffers sorted by address
84 * @free_async_space: VA space available for async buffers. This is
85 * initialized at mmap time to 1/2 the full VA space
86 * @pages: array of binder_lru_page
87 * @buffer_size: size of address space specified via mmap
88 * @pid: pid for associated binder_proc (invariant after init)
89 * @pages_high: high watermark of offset in @pages
90 * @oneway_spam_detected: %true if oneway spam detection fired, clear that
91 * flag once the async buffer has returned to a healthy state
92 *
93 * Bookkeeping structure for per-proc address space management for binder
94 * buffers. It is normally initialized during binder_init() and binder_mmap()
95 * calls. The address space is used for both user-visible buffers and for
96 * struct binder_buffer objects used to track the user buffers
97 */
98struct binder_alloc {
99 spinlock_t lock;
100 struct vm_area_struct *vma;
101 struct mm_struct *mm;
102 unsigned long buffer;
103 struct list_head buffers;
104 struct rb_root free_buffers;
105 struct rb_root allocated_buffers;
106 size_t free_async_space;
107 struct binder_lru_page *pages;
108 size_t buffer_size;
109 int pid;
110 size_t pages_high;
111 bool oneway_spam_detected;
112};
113
114#ifdef CONFIG_ANDROID_BINDER_IPC_SELFTEST
115void binder_selftest_alloc(struct binder_alloc *alloc);
116#else
117static inline void binder_selftest_alloc(struct binder_alloc *alloc) {}
118#endif
119enum lru_status binder_alloc_free_page(struct list_head *item,
120 struct list_lru_one *lru,
121 spinlock_t *lock, void *cb_arg);
122struct binder_buffer *binder_alloc_new_buf(struct binder_alloc *alloc,
123 size_t data_size,
124 size_t offsets_size,
125 size_t extra_buffers_size,
126 int is_async);
127void binder_alloc_init(struct binder_alloc *alloc);
128int binder_alloc_shrinker_init(void);
129void binder_alloc_shrinker_exit(void);
130void binder_alloc_vma_close(struct binder_alloc *alloc);
131struct binder_buffer *
132binder_alloc_prepare_to_free(struct binder_alloc *alloc,
133 unsigned long user_ptr);
134void binder_alloc_free_buf(struct binder_alloc *alloc,
135 struct binder_buffer *buffer);
136int binder_alloc_mmap_handler(struct binder_alloc *alloc,
137 struct vm_area_struct *vma);
138void binder_alloc_deferred_release(struct binder_alloc *alloc);
139int binder_alloc_get_allocated_count(struct binder_alloc *alloc);
140void binder_alloc_print_allocated(struct seq_file *m,
141 struct binder_alloc *alloc);
142void binder_alloc_print_pages(struct seq_file *m,
143 struct binder_alloc *alloc);
144
145/**
146 * binder_alloc_get_free_async_space() - get free space available for async
147 * @alloc: binder_alloc for this proc
148 *
149 * Return: the bytes remaining in the address-space for async transactions
150 */
151static inline size_t
152binder_alloc_get_free_async_space(struct binder_alloc *alloc)
153{
154 size_t free_async_space;
155
156 spin_lock(&alloc->lock);
157 free_async_space = alloc->free_async_space;
158 spin_unlock(&alloc->lock);
159 return free_async_space;
160}
161
162unsigned long
163binder_alloc_copy_user_to_buffer(struct binder_alloc *alloc,
164 struct binder_buffer *buffer,
165 binder_size_t buffer_offset,
166 const void __user *from,
167 size_t bytes);
168
169int binder_alloc_copy_to_buffer(struct binder_alloc *alloc,
170 struct binder_buffer *buffer,
171 binder_size_t buffer_offset,
172 void *src,
173 size_t bytes);
174
175int binder_alloc_copy_from_buffer(struct binder_alloc *alloc,
176 void *dest,
177 struct binder_buffer *buffer,
178 binder_size_t buffer_offset,
179 size_t bytes);
180
181#endif /* _LINUX_BINDER_ALLOC_H */
182