blob: 2dd33b6df1044e64b785a6193bc30b84ddf9d1c5 [file] [log] [blame]
Todd Kjos076072a2017-04-21 14:32:11 -07001/*
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>
Sherry Yang5828d702017-07-29 13:24:11 -070024#include <linux/list_lru.h>
Todd Kjos076072a2017-04-21 14:32:11 -070025
Sherry Yang5828d702017-07-29 13:24:11 -070026extern struct list_lru binder_alloc_lru;
Todd Kjos076072a2017-04-21 14:32:11 -070027struct 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;
Sherry Yang7ffd4942017-08-03 11:33:53 -070062 void *data;
Todd Kjos076072a2017-04-21 14:32:11 -070063};
64
65/**
Sherry Yang5828d702017-07-29 13:24:11 -070066 * 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/**
Todd Kjos076072a2017-04-21 14:32:11 -070078 * 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
Sherry Yang5828d702017-07-29 13:24:11 -070092 * @pages: array of binder_lru_page
Todd Kjos076072a2017-04-21 14:32:11 -070093 * @buffer_size: size of address space specified via mmap
94 * @pid: pid for associated binder_proc (invariant after init)
95 *
96 * Bookkeeping structure for per-proc address space management for binder
97 * buffers. It is normally initialized during binder_init() and binder_mmap()
98 * calls. The address space is used for both user-visible buffers and for
99 * struct binder_buffer objects used to track the user buffers
100 */
101struct binder_alloc {
102 struct mutex mutex;
Todd Kjos076072a2017-04-21 14:32:11 -0700103 struct vm_area_struct *vma;
104 struct mm_struct *vma_vm_mm;
105 void *buffer;
106 ptrdiff_t user_buffer_offset;
107 struct list_head buffers;
108 struct rb_root free_buffers;
109 struct rb_root allocated_buffers;
110 size_t free_async_space;
Sherry Yang5828d702017-07-29 13:24:11 -0700111 struct binder_lru_page *pages;
Todd Kjos076072a2017-04-21 14:32:11 -0700112 size_t buffer_size;
113 uint32_t buffer_free;
114 int pid;
115};
116
Sherry Yang435416b2017-06-22 14:37:45 -0700117#ifdef CONFIG_ANDROID_BINDER_IPC_SELFTEST
118void binder_selftest_alloc(struct binder_alloc *alloc);
119#else
120static inline void binder_selftest_alloc(struct binder_alloc *alloc) {}
121#endif
Sherry Yang5828d702017-07-29 13:24:11 -0700122enum lru_status binder_alloc_free_page(struct list_head *item,
123 struct list_lru_one *lru,
124 spinlock_t *lock, void *cb_arg);
Todd Kjos076072a2017-04-21 14:32:11 -0700125extern struct binder_buffer *binder_alloc_new_buf(struct binder_alloc *alloc,
126 size_t data_size,
127 size_t offsets_size,
128 size_t extra_buffers_size,
129 int is_async);
130extern void binder_alloc_init(struct binder_alloc *alloc);
Sherry Yang5828d702017-07-29 13:24:11 -0700131void binder_alloc_shrinker_init(void);
Todd Kjos076072a2017-04-21 14:32:11 -0700132extern void binder_alloc_vma_close(struct binder_alloc *alloc);
133extern struct binder_buffer *
134binder_alloc_prepare_to_free(struct binder_alloc *alloc,
135 uintptr_t user_ptr);
136extern void binder_alloc_free_buf(struct binder_alloc *alloc,
137 struct binder_buffer *buffer);
138extern int binder_alloc_mmap_handler(struct binder_alloc *alloc,
139 struct vm_area_struct *vma);
140extern void binder_alloc_deferred_release(struct binder_alloc *alloc);
141extern int binder_alloc_get_allocated_count(struct binder_alloc *alloc);
142extern void binder_alloc_print_allocated(struct seq_file *m,
143 struct binder_alloc *alloc);
Sherry Yang91004422017-08-22 17:26:57 -0700144void binder_alloc_print_pages(struct seq_file *m,
145 struct binder_alloc *alloc);
Todd Kjos076072a2017-04-21 14:32:11 -0700146
147/**
148 * binder_alloc_get_free_async_space() - get free space available for async
149 * @alloc: binder_alloc for this proc
150 *
151 * Return: the bytes remaining in the address-space for async transactions
152 */
153static inline size_t
154binder_alloc_get_free_async_space(struct binder_alloc *alloc)
155{
156 size_t free_async_space;
157
158 mutex_lock(&alloc->mutex);
159 free_async_space = alloc->free_async_space;
160 mutex_unlock(&alloc->mutex);
161 return free_async_space;
162}
163
164/**
165 * binder_alloc_get_user_buffer_offset() - get offset between kernel/user addrs
166 * @alloc: binder_alloc for this proc
167 *
168 * Return: the offset between kernel and user-space addresses to use for
169 * virtual address conversion
170 */
171static inline ptrdiff_t
172binder_alloc_get_user_buffer_offset(struct binder_alloc *alloc)
173{
174 /*
175 * user_buffer_offset is constant if vma is set and
176 * undefined if vma is not set. It is possible to
177 * get here with !alloc->vma if the target process
178 * is dying while a transaction is being initiated.
179 * Returning the old value is ok in this case and
180 * the transaction will fail.
181 */
182 return alloc->user_buffer_offset;
183}
184
185#endif /* _LINUX_BINDER_ALLOC_H */
186