]>
Commit | Line | Data |
---|---|---|
9c92ab61 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
355b0502 GKH |
2 | /* binder.c |
3 | * | |
4 | * Android IPC Subsystem | |
5 | * | |
6 | * Copyright (C) 2007-2008 Google, Inc. | |
355b0502 GKH |
7 | */ |
8 | ||
9630fe88 TK |
9 | /* |
10 | * Locking overview | |
11 | * | |
12 | * There are 3 main spinlocks which must be acquired in the | |
13 | * order shown: | |
14 | * | |
15 | * 1) proc->outer_lock : protects binder_ref | |
16 | * binder_proc_lock() and binder_proc_unlock() are | |
17 | * used to acq/rel. | |
18 | * 2) node->lock : protects most fields of binder_node. | |
19 | * binder_node_lock() and binder_node_unlock() are | |
20 | * used to acq/rel | |
21 | * 3) proc->inner_lock : protects the thread and node lists | |
1b77e9dc MC |
22 | * (proc->threads, proc->waiting_threads, proc->nodes) |
23 | * and all todo lists associated with the binder_proc | |
24 | * (proc->todo, thread->todo, proc->delivered_death and | |
25 | * node->async_todo), as well as thread->transaction_stack | |
9630fe88 TK |
26 | * binder_inner_proc_lock() and binder_inner_proc_unlock() |
27 | * are used to acq/rel | |
28 | * | |
29 | * Any lock under procA must never be nested under any lock at the same | |
30 | * level or below on procB. | |
31 | * | |
32 | * Functions that require a lock held on entry indicate which lock | |
33 | * in the suffix of the function name: | |
34 | * | |
35 | * foo_olocked() : requires node->outer_lock | |
36 | * foo_nlocked() : requires node->lock | |
37 | * foo_ilocked() : requires proc->inner_lock | |
38 | * foo_oilocked(): requires proc->outer_lock and proc->inner_lock | |
39 | * foo_nilocked(): requires node->lock and proc->inner_lock | |
40 | * ... | |
41 | */ | |
42 | ||
56b468fc AS |
43 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
44 | ||
355b0502 GKH |
45 | #include <linux/fdtable.h> |
46 | #include <linux/file.h> | |
e2610b26 | 47 | #include <linux/freezer.h> |
355b0502 GKH |
48 | #include <linux/fs.h> |
49 | #include <linux/list.h> | |
50 | #include <linux/miscdevice.h> | |
355b0502 GKH |
51 | #include <linux/module.h> |
52 | #include <linux/mutex.h> | |
53 | #include <linux/nsproxy.h> | |
54 | #include <linux/poll.h> | |
16b66554 | 55 | #include <linux/debugfs.h> |
355b0502 | 56 | #include <linux/rbtree.h> |
3f07c014 | 57 | #include <linux/sched/signal.h> |
6e84f315 | 58 | #include <linux/sched/mm.h> |
5249f488 | 59 | #include <linux/seq_file.h> |
51d8a7ec | 60 | #include <linux/string.h> |
355b0502 | 61 | #include <linux/uaccess.h> |
17cf22c3 | 62 | #include <linux/pid_namespace.h> |
79af7307 | 63 | #include <linux/security.h> |
9630fe88 | 64 | #include <linux/spinlock.h> |
128f3804 | 65 | #include <linux/ratelimit.h> |
44d8047f | 66 | #include <linux/syscalls.h> |
80cd7956 | 67 | #include <linux/task_work.h> |
990be747 | 68 | #include <linux/sizes.h> |
355b0502 | 69 | |
9246a4a9 | 70 | #include <uapi/linux/android/binder.h> |
51d8a7ec | 71 | #include <uapi/linux/android/binderfs.h> |
f371a7c1 GR |
72 | |
73 | #include <asm/cacheflush.h> | |
74 | ||
0c972a05 | 75 | #include "binder_alloc.h" |
3ad20fe3 | 76 | #include "binder_internal.h" |
975a1ac9 | 77 | #include "binder_trace.h" |
355b0502 | 78 | |
c44b1231 | 79 | static HLIST_HEAD(binder_deferred_list); |
355b0502 GKH |
80 | static DEFINE_MUTEX(binder_deferred_lock); |
81 | ||
ac4812c5 | 82 | static HLIST_HEAD(binder_devices); |
355b0502 | 83 | static HLIST_HEAD(binder_procs); |
c44b1231 TK |
84 | static DEFINE_MUTEX(binder_procs_lock); |
85 | ||
355b0502 | 86 | static HLIST_HEAD(binder_dead_nodes); |
c44b1231 | 87 | static DEFINE_SPINLOCK(binder_dead_nodes_lock); |
355b0502 | 88 | |
16b66554 AH |
89 | static struct dentry *binder_debugfs_dir_entry_root; |
90 | static struct dentry *binder_debugfs_dir_entry_proc; | |
656a800a | 91 | static atomic_t binder_last_id; |
355b0502 | 92 | |
c13e0a52 YL |
93 | static int proc_show(struct seq_file *m, void *unused); |
94 | DEFINE_SHOW_ATTRIBUTE(proc); | |
355b0502 | 95 | |
355b0502 GKH |
96 | #define FORBIDDEN_MMAP_FLAGS (VM_WRITE) |
97 | ||
355b0502 GKH |
98 | enum { |
99 | BINDER_DEBUG_USER_ERROR = 1U << 0, | |
100 | BINDER_DEBUG_FAILED_TRANSACTION = 1U << 1, | |
101 | BINDER_DEBUG_DEAD_TRANSACTION = 1U << 2, | |
102 | BINDER_DEBUG_OPEN_CLOSE = 1U << 3, | |
103 | BINDER_DEBUG_DEAD_BINDER = 1U << 4, | |
104 | BINDER_DEBUG_DEATH_NOTIFICATION = 1U << 5, | |
105 | BINDER_DEBUG_READ_WRITE = 1U << 6, | |
106 | BINDER_DEBUG_USER_REFS = 1U << 7, | |
107 | BINDER_DEBUG_THREADS = 1U << 8, | |
108 | BINDER_DEBUG_TRANSACTION = 1U << 9, | |
109 | BINDER_DEBUG_TRANSACTION_COMPLETE = 1U << 10, | |
110 | BINDER_DEBUG_FREE_BUFFER = 1U << 11, | |
111 | BINDER_DEBUG_INTERNAL_REFS = 1U << 12, | |
19c98724 | 112 | BINDER_DEBUG_PRIORITY_CAP = 1U << 13, |
9630fe88 | 113 | BINDER_DEBUG_SPINLOCKS = 1U << 14, |
355b0502 GKH |
114 | }; |
115 | static uint32_t binder_debug_mask = BINDER_DEBUG_USER_ERROR | | |
116 | BINDER_DEBUG_FAILED_TRANSACTION | BINDER_DEBUG_DEAD_TRANSACTION; | |
21d02ddf | 117 | module_param_named(debug_mask, binder_debug_mask, uint, 0644); |
355b0502 | 118 | |
ca2864c6 | 119 | char *binder_devices_param = CONFIG_ANDROID_BINDER_DEVICES; |
ac4812c5 MC |
120 | module_param_named(devices, binder_devices_param, charp, 0444); |
121 | ||
355b0502 GKH |
122 | static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait); |
123 | static int binder_stop_on_user_error; | |
124 | ||
125 | static int binder_set_stop_on_user_error(const char *val, | |
e4dca7b7 | 126 | const struct kernel_param *kp) |
355b0502 GKH |
127 | { |
128 | int ret; | |
10f62861 | 129 | |
355b0502 GKH |
130 | ret = param_set_int(val, kp); |
131 | if (binder_stop_on_user_error < 2) | |
132 | wake_up(&binder_user_error_wait); | |
133 | return ret; | |
134 | } | |
135 | module_param_call(stop_on_user_error, binder_set_stop_on_user_error, | |
21d02ddf | 136 | param_get_int, &binder_stop_on_user_error, 0644); |
355b0502 GKH |
137 | |
138 | #define binder_debug(mask, x...) \ | |
139 | do { \ | |
140 | if (binder_debug_mask & mask) \ | |
128f3804 | 141 | pr_info_ratelimited(x); \ |
355b0502 GKH |
142 | } while (0) |
143 | ||
144 | #define binder_user_error(x...) \ | |
145 | do { \ | |
146 | if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) \ | |
128f3804 | 147 | pr_info_ratelimited(x); \ |
355b0502 GKH |
148 | if (binder_stop_on_user_error) \ |
149 | binder_stop_on_user_error = 2; \ | |
150 | } while (0) | |
151 | ||
feba3900 MC |
152 | #define to_flat_binder_object(hdr) \ |
153 | container_of(hdr, struct flat_binder_object, hdr) | |
154 | ||
155 | #define to_binder_fd_object(hdr) container_of(hdr, struct binder_fd_object, hdr) | |
156 | ||
7980240b MC |
157 | #define to_binder_buffer_object(hdr) \ |
158 | container_of(hdr, struct binder_buffer_object, hdr) | |
159 | ||
def95c73 MC |
160 | #define to_binder_fd_array_object(hdr) \ |
161 | container_of(hdr, struct binder_fd_array_object, hdr) | |
162 | ||
355b0502 GKH |
163 | enum binder_stat_types { |
164 | BINDER_STAT_PROC, | |
165 | BINDER_STAT_THREAD, | |
166 | BINDER_STAT_NODE, | |
167 | BINDER_STAT_REF, | |
168 | BINDER_STAT_DEATH, | |
169 | BINDER_STAT_TRANSACTION, | |
170 | BINDER_STAT_TRANSACTION_COMPLETE, | |
171 | BINDER_STAT_COUNT | |
172 | }; | |
173 | ||
174 | struct binder_stats { | |
0953c797 BJS |
175 | atomic_t br[_IOC_NR(BR_FAILED_REPLY) + 1]; |
176 | atomic_t bc[_IOC_NR(BC_REPLY_SG) + 1]; | |
177 | atomic_t obj_created[BINDER_STAT_COUNT]; | |
178 | atomic_t obj_deleted[BINDER_STAT_COUNT]; | |
355b0502 GKH |
179 | }; |
180 | ||
181 | static struct binder_stats binder_stats; | |
182 | ||
183 | static inline void binder_stats_deleted(enum binder_stat_types type) | |
184 | { | |
0953c797 | 185 | atomic_inc(&binder_stats.obj_deleted[type]); |
355b0502 GKH |
186 | } |
187 | ||
188 | static inline void binder_stats_created(enum binder_stat_types type) | |
189 | { | |
0953c797 | 190 | atomic_inc(&binder_stats.obj_created[type]); |
355b0502 GKH |
191 | } |
192 | ||
03e2e07e HV |
193 | struct binder_transaction_log binder_transaction_log; |
194 | struct binder_transaction_log binder_transaction_log_failed; | |
355b0502 GKH |
195 | |
196 | static struct binder_transaction_log_entry *binder_transaction_log_add( | |
197 | struct binder_transaction_log *log) | |
198 | { | |
199 | struct binder_transaction_log_entry *e; | |
d99c7333 | 200 | unsigned int cur = atomic_inc_return(&log->cur); |
10f62861 | 201 | |
d99c7333 | 202 | if (cur >= ARRAY_SIZE(log->entry)) |
197410ad | 203 | log->full = true; |
d99c7333 TK |
204 | e = &log->entry[cur % ARRAY_SIZE(log->entry)]; |
205 | WRITE_ONCE(e->debug_id_done, 0); | |
206 | /* | |
207 | * write-barrier to synchronize access to e->debug_id_done. | |
208 | * We make sure the initialized 0 value is seen before | |
209 | * memset() other fields are zeroed by memset. | |
210 | */ | |
211 | smp_wmb(); | |
212 | memset(e, 0, sizeof(*e)); | |
355b0502 GKH |
213 | return e; |
214 | } | |
215 | ||
72196393 TK |
216 | /** |
217 | * struct binder_work - work enqueued on a worklist | |
218 | * @entry: node enqueued on list | |
219 | * @type: type of work to be performed | |
220 | * | |
221 | * There are separate work lists for proc, thread, and node (async). | |
222 | */ | |
355b0502 GKH |
223 | struct binder_work { |
224 | struct list_head entry; | |
72196393 | 225 | |
355b0502 GKH |
226 | enum { |
227 | BINDER_WORK_TRANSACTION = 1, | |
228 | BINDER_WORK_TRANSACTION_COMPLETE, | |
26549d17 | 229 | BINDER_WORK_RETURN_ERROR, |
355b0502 GKH |
230 | BINDER_WORK_NODE, |
231 | BINDER_WORK_DEAD_BINDER, | |
232 | BINDER_WORK_DEAD_BINDER_AND_CLEAR, | |
233 | BINDER_WORK_CLEAR_DEATH_NOTIFICATION, | |
234 | } type; | |
235 | }; | |
236 | ||
26549d17 TK |
237 | struct binder_error { |
238 | struct binder_work work; | |
239 | uint32_t cmd; | |
240 | }; | |
241 | ||
9630fe88 TK |
242 | /** |
243 | * struct binder_node - binder node bookkeeping | |
244 | * @debug_id: unique ID for debugging | |
245 | * (invariant after initialized) | |
246 | * @lock: lock for node fields | |
247 | * @work: worklist element for node work | |
72196393 | 248 | * (protected by @proc->inner_lock) |
9630fe88 | 249 | * @rb_node: element for proc->nodes tree |
da0fa9e4 | 250 | * (protected by @proc->inner_lock) |
9630fe88 TK |
251 | * @dead_node: element for binder_dead_nodes list |
252 | * (protected by binder_dead_nodes_lock) | |
253 | * @proc: binder_proc that owns this node | |
254 | * (invariant after initialized) | |
255 | * @refs: list of references on this node | |
673068ee | 256 | * (protected by @lock) |
9630fe88 TK |
257 | * @internal_strong_refs: used to take strong references when |
258 | * initiating a transaction | |
ed29721e TK |
259 | * (protected by @proc->inner_lock if @proc |
260 | * and by @lock) | |
9630fe88 | 261 | * @local_weak_refs: weak user refs from local process |
ed29721e TK |
262 | * (protected by @proc->inner_lock if @proc |
263 | * and by @lock) | |
9630fe88 | 264 | * @local_strong_refs: strong user refs from local process |
ed29721e TK |
265 | * (protected by @proc->inner_lock if @proc |
266 | * and by @lock) | |
9630fe88 | 267 | * @tmp_refs: temporary kernel refs |
ed29721e TK |
268 | * (protected by @proc->inner_lock while @proc |
269 | * is valid, and by binder_dead_nodes_lock | |
270 | * if @proc is NULL. During inc/dec and node release | |
271 | * it is also protected by @lock to provide safety | |
272 | * as the node dies and @proc becomes NULL) | |
9630fe88 TK |
273 | * @ptr: userspace pointer for node |
274 | * (invariant, no lock needed) | |
275 | * @cookie: userspace cookie for node | |
276 | * (invariant, no lock needed) | |
277 | * @has_strong_ref: userspace notified of strong ref | |
ed29721e TK |
278 | * (protected by @proc->inner_lock if @proc |
279 | * and by @lock) | |
9630fe88 | 280 | * @pending_strong_ref: userspace has acked notification of strong ref |
ed29721e TK |
281 | * (protected by @proc->inner_lock if @proc |
282 | * and by @lock) | |
9630fe88 | 283 | * @has_weak_ref: userspace notified of weak ref |
ed29721e TK |
284 | * (protected by @proc->inner_lock if @proc |
285 | * and by @lock) | |
9630fe88 | 286 | * @pending_weak_ref: userspace has acked notification of weak ref |
ed29721e TK |
287 | * (protected by @proc->inner_lock if @proc |
288 | * and by @lock) | |
9630fe88 | 289 | * @has_async_transaction: async transaction to node in progress |
673068ee | 290 | * (protected by @lock) |
9630fe88 TK |
291 | * @accept_fds: file descriptor operations supported for node |
292 | * (invariant after initialized) | |
293 | * @min_priority: minimum scheduling priority | |
294 | * (invariant after initialized) | |
ec74136d TK |
295 | * @txn_security_ctx: require sender's security context |
296 | * (invariant after initialized) | |
9630fe88 | 297 | * @async_todo: list of async work items |
72196393 | 298 | * (protected by @proc->inner_lock) |
9630fe88 TK |
299 | * |
300 | * Bookkeeping structure for binder nodes. | |
301 | */ | |
355b0502 GKH |
302 | struct binder_node { |
303 | int debug_id; | |
9630fe88 | 304 | spinlock_t lock; |
355b0502 GKH |
305 | struct binder_work work; |
306 | union { | |
307 | struct rb_node rb_node; | |
308 | struct hlist_node dead_node; | |
309 | }; | |
310 | struct binder_proc *proc; | |
311 | struct hlist_head refs; | |
312 | int internal_strong_refs; | |
313 | int local_weak_refs; | |
314 | int local_strong_refs; | |
adc18842 | 315 | int tmp_refs; |
da49889d AH |
316 | binder_uintptr_t ptr; |
317 | binder_uintptr_t cookie; | |
ed29721e TK |
318 | struct { |
319 | /* | |
320 | * bitfield elements protected by | |
321 | * proc inner_lock | |
322 | */ | |
323 | u8 has_strong_ref:1; | |
324 | u8 pending_strong_ref:1; | |
325 | u8 has_weak_ref:1; | |
326 | u8 pending_weak_ref:1; | |
327 | }; | |
328 | struct { | |
329 | /* | |
330 | * invariant after initialization | |
331 | */ | |
332 | u8 accept_fds:1; | |
ec74136d | 333 | u8 txn_security_ctx:1; |
ed29721e TK |
334 | u8 min_priority; |
335 | }; | |
336 | bool has_async_transaction; | |
355b0502 GKH |
337 | struct list_head async_todo; |
338 | }; | |
339 | ||
340 | struct binder_ref_death { | |
72196393 TK |
341 | /** |
342 | * @work: worklist element for death notifications | |
343 | * (protected by inner_lock of the proc that | |
344 | * this ref belongs to) | |
345 | */ | |
355b0502 | 346 | struct binder_work work; |
da49889d | 347 | binder_uintptr_t cookie; |
355b0502 GKH |
348 | }; |
349 | ||
372e3147 TK |
350 | /** |
351 | * struct binder_ref_data - binder_ref counts and id | |
352 | * @debug_id: unique ID for the ref | |
353 | * @desc: unique userspace handle for ref | |
354 | * @strong: strong ref count (debugging only if not locked) | |
355 | * @weak: weak ref count (debugging only if not locked) | |
356 | * | |
357 | * Structure to hold ref count and ref id information. Since | |
358 | * the actual ref can only be accessed with a lock, this structure | |
359 | * is used to return information about the ref to callers of | |
360 | * ref inc/dec functions. | |
361 | */ | |
362 | struct binder_ref_data { | |
363 | int debug_id; | |
364 | uint32_t desc; | |
365 | int strong; | |
366 | int weak; | |
367 | }; | |
368 | ||
369 | /** | |
370 | * struct binder_ref - struct to track references on nodes | |
371 | * @data: binder_ref_data containing id, handle, and current refcounts | |
372 | * @rb_node_desc: node for lookup by @data.desc in proc's rb_tree | |
373 | * @rb_node_node: node for lookup by @node in proc's rb_tree | |
374 | * @node_entry: list entry for node->refs list in target node | |
673068ee | 375 | * (protected by @node->lock) |
372e3147 TK |
376 | * @proc: binder_proc containing ref |
377 | * @node: binder_node of target node. When cleaning up a | |
378 | * ref for deletion in binder_cleanup_ref, a non-NULL | |
379 | * @node indicates the node must be freed | |
380 | * @death: pointer to death notification (ref_death) if requested | |
ab51ec6b | 381 | * (protected by @node->lock) |
372e3147 TK |
382 | * |
383 | * Structure to track references from procA to target node (on procB). This | |
384 | * structure is unsafe to access without holding @proc->outer_lock. | |
385 | */ | |
355b0502 GKH |
386 | struct binder_ref { |
387 | /* Lookups needed: */ | |
388 | /* node + proc => ref (transaction) */ | |
389 | /* desc + proc => ref (transaction, inc/dec ref) */ | |
390 | /* node => refs + procs (proc exit) */ | |
372e3147 | 391 | struct binder_ref_data data; |
355b0502 GKH |
392 | struct rb_node rb_node_desc; |
393 | struct rb_node rb_node_node; | |
394 | struct hlist_node node_entry; | |
395 | struct binder_proc *proc; | |
396 | struct binder_node *node; | |
355b0502 GKH |
397 | struct binder_ref_death *death; |
398 | }; | |
399 | ||
355b0502 | 400 | enum binder_deferred_state { |
44d8047f TK |
401 | BINDER_DEFERRED_FLUSH = 0x01, |
402 | BINDER_DEFERRED_RELEASE = 0x02, | |
355b0502 GKH |
403 | }; |
404 | ||
9630fe88 TK |
405 | /** |
406 | * struct binder_proc - binder process bookkeeping | |
407 | * @proc_node: element for binder_procs list | |
408 | * @threads: rbtree of binder_threads in this proc | |
7bd7b0e6 | 409 | * (protected by @inner_lock) |
9630fe88 TK |
410 | * @nodes: rbtree of binder nodes associated with |
411 | * this proc ordered by node->ptr | |
da0fa9e4 | 412 | * (protected by @inner_lock) |
9630fe88 | 413 | * @refs_by_desc: rbtree of refs ordered by ref->desc |
2c1838dc | 414 | * (protected by @outer_lock) |
9630fe88 | 415 | * @refs_by_node: rbtree of refs ordered by ref->node |
2c1838dc | 416 | * (protected by @outer_lock) |
1b77e9dc MC |
417 | * @waiting_threads: threads currently waiting for proc work |
418 | * (protected by @inner_lock) | |
9630fe88 TK |
419 | * @pid PID of group_leader of process |
420 | * (invariant after initialized) | |
421 | * @tsk task_struct for group_leader of process | |
422 | * (invariant after initialized) | |
9630fe88 TK |
423 | * @deferred_work_node: element for binder_deferred_list |
424 | * (protected by binder_deferred_lock) | |
425 | * @deferred_work: bitmap of deferred work to perform | |
426 | * (protected by binder_deferred_lock) | |
427 | * @is_dead: process is dead and awaiting free | |
428 | * when outstanding transactions are cleaned up | |
7bd7b0e6 | 429 | * (protected by @inner_lock) |
9630fe88 | 430 | * @todo: list of work for this process |
72196393 | 431 | * (protected by @inner_lock) |
9630fe88 TK |
432 | * @stats: per-process binder statistics |
433 | * (atomics, no lock needed) | |
434 | * @delivered_death: list of delivered death notification | |
72196393 | 435 | * (protected by @inner_lock) |
9630fe88 | 436 | * @max_threads: cap on number of binder threads |
b3e68612 | 437 | * (protected by @inner_lock) |
9630fe88 TK |
438 | * @requested_threads: number of binder threads requested but not |
439 | * yet started. In current implementation, can | |
440 | * only be 0 or 1. | |
b3e68612 | 441 | * (protected by @inner_lock) |
9630fe88 | 442 | * @requested_threads_started: number binder threads started |
b3e68612 | 443 | * (protected by @inner_lock) |
9630fe88 | 444 | * @tmp_ref: temporary reference to indicate proc is in use |
7bd7b0e6 | 445 | * (protected by @inner_lock) |
9630fe88 TK |
446 | * @default_priority: default scheduler priority |
447 | * (invariant after initialized) | |
448 | * @debugfs_entry: debugfs node | |
449 | * @alloc: binder allocator bookkeeping | |
450 | * @context: binder_context for this proc | |
451 | * (invariant after initialized) | |
452 | * @inner_lock: can nest under outer_lock and/or node lock | |
453 | * @outer_lock: no nesting under innor or node lock | |
454 | * Lock order: 1) outer, 2) node, 3) inner | |
4feb80fa | 455 | * @binderfs_entry: process-specific binderfs log file |
9630fe88 TK |
456 | * |
457 | * Bookkeeping structure for binder processes | |
458 | */ | |
355b0502 GKH |
459 | struct binder_proc { |
460 | struct hlist_node proc_node; | |
461 | struct rb_root threads; | |
462 | struct rb_root nodes; | |
463 | struct rb_root refs_by_desc; | |
464 | struct rb_root refs_by_node; | |
1b77e9dc | 465 | struct list_head waiting_threads; |
355b0502 | 466 | int pid; |
355b0502 | 467 | struct task_struct *tsk; |
355b0502 GKH |
468 | struct hlist_node deferred_work_node; |
469 | int deferred_work; | |
7a4408c6 | 470 | bool is_dead; |
355b0502 | 471 | |
355b0502 | 472 | struct list_head todo; |
355b0502 GKH |
473 | struct binder_stats stats; |
474 | struct list_head delivered_death; | |
475 | int max_threads; | |
476 | int requested_threads; | |
477 | int requested_threads_started; | |
7a4408c6 | 478 | int tmp_ref; |
355b0502 | 479 | long default_priority; |
16b66554 | 480 | struct dentry *debugfs_entry; |
fdfb4a99 | 481 | struct binder_alloc alloc; |
342e5c90 | 482 | struct binder_context *context; |
9630fe88 TK |
483 | spinlock_t inner_lock; |
484 | spinlock_t outer_lock; | |
4feb80fa | 485 | struct dentry *binderfs_entry; |
355b0502 GKH |
486 | }; |
487 | ||
488 | enum { | |
489 | BINDER_LOOPER_STATE_REGISTERED = 0x01, | |
490 | BINDER_LOOPER_STATE_ENTERED = 0x02, | |
491 | BINDER_LOOPER_STATE_EXITED = 0x04, | |
492 | BINDER_LOOPER_STATE_INVALID = 0x08, | |
493 | BINDER_LOOPER_STATE_WAITING = 0x10, | |
1b77e9dc | 494 | BINDER_LOOPER_STATE_POLL = 0x20, |
355b0502 GKH |
495 | }; |
496 | ||
9630fe88 TK |
497 | /** |
498 | * struct binder_thread - binder thread bookkeeping | |
499 | * @proc: binder process for this thread | |
500 | * (invariant after initialization) | |
501 | * @rb_node: element for proc->threads rbtree | |
7bd7b0e6 | 502 | * (protected by @proc->inner_lock) |
1b77e9dc MC |
503 | * @waiting_thread_node: element for @proc->waiting_threads list |
504 | * (protected by @proc->inner_lock) | |
9630fe88 TK |
505 | * @pid: PID for this thread |
506 | * (invariant after initialization) | |
507 | * @looper: bitmap of looping state | |
508 | * (only accessed by this thread) | |
509 | * @looper_needs_return: looping thread needs to exit driver | |
510 | * (no lock needed) | |
511 | * @transaction_stack: stack of in-progress transactions for this thread | |
0b89d69a | 512 | * (protected by @proc->inner_lock) |
9630fe88 | 513 | * @todo: list of work to do for this thread |
72196393 | 514 | * (protected by @proc->inner_lock) |
148ade2c MC |
515 | * @process_todo: whether work in @todo should be processed |
516 | * (protected by @proc->inner_lock) | |
9630fe88 TK |
517 | * @return_error: transaction errors reported by this thread |
518 | * (only accessed by this thread) | |
519 | * @reply_error: transaction errors reported by target thread | |
0b89d69a | 520 | * (protected by @proc->inner_lock) |
9630fe88 TK |
521 | * @wait: wait queue for thread work |
522 | * @stats: per-thread statistics | |
523 | * (atomics, no lock needed) | |
524 | * @tmp_ref: temporary reference to indicate thread is in use | |
525 | * (atomic since @proc->inner_lock cannot | |
526 | * always be acquired) | |
527 | * @is_dead: thread is dead and awaiting free | |
528 | * when outstanding transactions are cleaned up | |
7bd7b0e6 | 529 | * (protected by @proc->inner_lock) |
9630fe88 TK |
530 | * |
531 | * Bookkeeping structure for binder threads. | |
532 | */ | |
355b0502 GKH |
533 | struct binder_thread { |
534 | struct binder_proc *proc; | |
535 | struct rb_node rb_node; | |
1b77e9dc | 536 | struct list_head waiting_thread_node; |
355b0502 | 537 | int pid; |
08dabcee TK |
538 | int looper; /* only modified by this thread */ |
539 | bool looper_need_return; /* can be written by other thread */ | |
355b0502 GKH |
540 | struct binder_transaction *transaction_stack; |
541 | struct list_head todo; | |
148ade2c | 542 | bool process_todo; |
26549d17 TK |
543 | struct binder_error return_error; |
544 | struct binder_error reply_error; | |
355b0502 GKH |
545 | wait_queue_head_t wait; |
546 | struct binder_stats stats; | |
7a4408c6 TK |
547 | atomic_t tmp_ref; |
548 | bool is_dead; | |
355b0502 GKH |
549 | }; |
550 | ||
44d8047f TK |
551 | /** |
552 | * struct binder_txn_fd_fixup - transaction fd fixup list element | |
553 | * @fixup_entry: list entry | |
554 | * @file: struct file to be associated with new fd | |
555 | * @offset: offset in buffer data to this fixup | |
556 | * | |
557 | * List element for fd fixups in a transaction. Since file | |
558 | * descriptors need to be allocated in the context of the | |
559 | * target process, we pass each fd to be processed in this | |
560 | * struct. | |
561 | */ | |
562 | struct binder_txn_fd_fixup { | |
563 | struct list_head fixup_entry; | |
564 | struct file *file; | |
565 | size_t offset; | |
566 | }; | |
567 | ||
355b0502 GKH |
568 | struct binder_transaction { |
569 | int debug_id; | |
570 | struct binder_work work; | |
571 | struct binder_thread *from; | |
572 | struct binder_transaction *from_parent; | |
573 | struct binder_proc *to_proc; | |
574 | struct binder_thread *to_thread; | |
575 | struct binder_transaction *to_parent; | |
576 | unsigned need_reply:1; | |
577 | /* unsigned is_dead:1; */ /* not used at the moment */ | |
578 | ||
579 | struct binder_buffer *buffer; | |
580 | unsigned int code; | |
581 | unsigned int flags; | |
582 | long priority; | |
583 | long saved_priority; | |
4a2ebb93 | 584 | kuid_t sender_euid; |
44d8047f | 585 | struct list_head fd_fixups; |
ec74136d | 586 | binder_uintptr_t security_ctx; |
7a4408c6 TK |
587 | /** |
588 | * @lock: protects @from, @to_proc, and @to_thread | |
589 | * | |
590 | * @from, @to_proc, and @to_thread can be set to NULL | |
591 | * during thread teardown | |
592 | */ | |
593 | spinlock_t lock; | |
355b0502 GKH |
594 | }; |
595 | ||
7a67a393 TK |
596 | /** |
597 | * struct binder_object - union of flat binder object types | |
598 | * @hdr: generic object header | |
599 | * @fbo: binder object (nodes and refs) | |
600 | * @fdo: file descriptor object | |
601 | * @bbo: binder buffer pointer | |
602 | * @fdao: file descriptor array | |
603 | * | |
604 | * Used for type-independent object copies | |
605 | */ | |
606 | struct binder_object { | |
607 | union { | |
608 | struct binder_object_header hdr; | |
609 | struct flat_binder_object fbo; | |
610 | struct binder_fd_object fdo; | |
611 | struct binder_buffer_object bbo; | |
612 | struct binder_fd_array_object fdao; | |
613 | }; | |
614 | }; | |
615 | ||
9630fe88 TK |
616 | /** |
617 | * binder_proc_lock() - Acquire outer lock for given binder_proc | |
618 | * @proc: struct binder_proc to acquire | |
619 | * | |
620 | * Acquires proc->outer_lock. Used to protect binder_ref | |
621 | * structures associated with the given proc. | |
622 | */ | |
623 | #define binder_proc_lock(proc) _binder_proc_lock(proc, __LINE__) | |
624 | static void | |
625 | _binder_proc_lock(struct binder_proc *proc, int line) | |
324fa64c | 626 | __acquires(&proc->outer_lock) |
9630fe88 TK |
627 | { |
628 | binder_debug(BINDER_DEBUG_SPINLOCKS, | |
629 | "%s: line=%d\n", __func__, line); | |
630 | spin_lock(&proc->outer_lock); | |
631 | } | |
632 | ||
633 | /** | |
634 | * binder_proc_unlock() - Release spinlock for given binder_proc | |
635 | * @proc: struct binder_proc to acquire | |
636 | * | |
637 | * Release lock acquired via binder_proc_lock() | |
638 | */ | |
639 | #define binder_proc_unlock(_proc) _binder_proc_unlock(_proc, __LINE__) | |
640 | static void | |
641 | _binder_proc_unlock(struct binder_proc *proc, int line) | |
324fa64c | 642 | __releases(&proc->outer_lock) |
9630fe88 TK |
643 | { |
644 | binder_debug(BINDER_DEBUG_SPINLOCKS, | |
645 | "%s: line=%d\n", __func__, line); | |
646 | spin_unlock(&proc->outer_lock); | |
647 | } | |
648 | ||
649 | /** | |
650 | * binder_inner_proc_lock() - Acquire inner lock for given binder_proc | |
651 | * @proc: struct binder_proc to acquire | |
652 | * | |
653 | * Acquires proc->inner_lock. Used to protect todo lists | |
654 | */ | |
655 | #define binder_inner_proc_lock(proc) _binder_inner_proc_lock(proc, __LINE__) | |
656 | static void | |
657 | _binder_inner_proc_lock(struct binder_proc *proc, int line) | |
324fa64c | 658 | __acquires(&proc->inner_lock) |
9630fe88 TK |
659 | { |
660 | binder_debug(BINDER_DEBUG_SPINLOCKS, | |
661 | "%s: line=%d\n", __func__, line); | |
662 | spin_lock(&proc->inner_lock); | |
663 | } | |
664 | ||
665 | /** | |
666 | * binder_inner_proc_unlock() - Release inner lock for given binder_proc | |
667 | * @proc: struct binder_proc to acquire | |
668 | * | |
669 | * Release lock acquired via binder_inner_proc_lock() | |
670 | */ | |
671 | #define binder_inner_proc_unlock(proc) _binder_inner_proc_unlock(proc, __LINE__) | |
672 | static void | |
673 | _binder_inner_proc_unlock(struct binder_proc *proc, int line) | |
324fa64c | 674 | __releases(&proc->inner_lock) |
9630fe88 TK |
675 | { |
676 | binder_debug(BINDER_DEBUG_SPINLOCKS, | |
677 | "%s: line=%d\n", __func__, line); | |
678 | spin_unlock(&proc->inner_lock); | |
679 | } | |
680 | ||
681 | /** | |
682 | * binder_node_lock() - Acquire spinlock for given binder_node | |
683 | * @node: struct binder_node to acquire | |
684 | * | |
685 | * Acquires node->lock. Used to protect binder_node fields | |
686 | */ | |
687 | #define binder_node_lock(node) _binder_node_lock(node, __LINE__) | |
688 | static void | |
689 | _binder_node_lock(struct binder_node *node, int line) | |
324fa64c | 690 | __acquires(&node->lock) |
9630fe88 TK |
691 | { |
692 | binder_debug(BINDER_DEBUG_SPINLOCKS, | |
693 | "%s: line=%d\n", __func__, line); | |
694 | spin_lock(&node->lock); | |
695 | } | |
696 | ||
697 | /** | |
698 | * binder_node_unlock() - Release spinlock for given binder_proc | |
699 | * @node: struct binder_node to acquire | |
700 | * | |
701 | * Release lock acquired via binder_node_lock() | |
702 | */ | |
703 | #define binder_node_unlock(node) _binder_node_unlock(node, __LINE__) | |
704 | static void | |
705 | _binder_node_unlock(struct binder_node *node, int line) | |
324fa64c | 706 | __releases(&node->lock) |
9630fe88 TK |
707 | { |
708 | binder_debug(BINDER_DEBUG_SPINLOCKS, | |
709 | "%s: line=%d\n", __func__, line); | |
710 | spin_unlock(&node->lock); | |
711 | } | |
712 | ||
673068ee TK |
713 | /** |
714 | * binder_node_inner_lock() - Acquire node and inner locks | |
715 | * @node: struct binder_node to acquire | |
716 | * | |
717 | * Acquires node->lock. If node->proc also acquires | |
718 | * proc->inner_lock. Used to protect binder_node fields | |
719 | */ | |
720 | #define binder_node_inner_lock(node) _binder_node_inner_lock(node, __LINE__) | |
721 | static void | |
722 | _binder_node_inner_lock(struct binder_node *node, int line) | |
324fa64c | 723 | __acquires(&node->lock) __acquires(&node->proc->inner_lock) |
673068ee TK |
724 | { |
725 | binder_debug(BINDER_DEBUG_SPINLOCKS, | |
726 | "%s: line=%d\n", __func__, line); | |
727 | spin_lock(&node->lock); | |
728 | if (node->proc) | |
729 | binder_inner_proc_lock(node->proc); | |
324fa64c TK |
730 | else |
731 | /* annotation for sparse */ | |
732 | __acquire(&node->proc->inner_lock); | |
673068ee TK |
733 | } |
734 | ||
735 | /** | |
736 | * binder_node_unlock() - Release node and inner locks | |
737 | * @node: struct binder_node to acquire | |
738 | * | |
739 | * Release lock acquired via binder_node_lock() | |
740 | */ | |
741 | #define binder_node_inner_unlock(node) _binder_node_inner_unlock(node, __LINE__) | |
742 | static void | |
743 | _binder_node_inner_unlock(struct binder_node *node, int line) | |
324fa64c | 744 | __releases(&node->lock) __releases(&node->proc->inner_lock) |
673068ee TK |
745 | { |
746 | struct binder_proc *proc = node->proc; | |
747 | ||
748 | binder_debug(BINDER_DEBUG_SPINLOCKS, | |
749 | "%s: line=%d\n", __func__, line); | |
750 | if (proc) | |
751 | binder_inner_proc_unlock(proc); | |
324fa64c TK |
752 | else |
753 | /* annotation for sparse */ | |
754 | __release(&node->proc->inner_lock); | |
673068ee TK |
755 | spin_unlock(&node->lock); |
756 | } | |
757 | ||
72196393 TK |
758 | static bool binder_worklist_empty_ilocked(struct list_head *list) |
759 | { | |
760 | return list_empty(list); | |
761 | } | |
762 | ||
763 | /** | |
764 | * binder_worklist_empty() - Check if no items on the work list | |
765 | * @proc: binder_proc associated with list | |
766 | * @list: list to check | |
767 | * | |
768 | * Return: true if there are no items on list, else false | |
769 | */ | |
770 | static bool binder_worklist_empty(struct binder_proc *proc, | |
771 | struct list_head *list) | |
772 | { | |
773 | bool ret; | |
774 | ||
775 | binder_inner_proc_lock(proc); | |
776 | ret = binder_worklist_empty_ilocked(list); | |
777 | binder_inner_proc_unlock(proc); | |
778 | return ret; | |
779 | } | |
780 | ||
148ade2c MC |
781 | /** |
782 | * binder_enqueue_work_ilocked() - Add an item to the work list | |
783 | * @work: struct binder_work to add to list | |
784 | * @target_list: list to add work to | |
785 | * | |
786 | * Adds the work to the specified list. Asserts that work | |
787 | * is not already on a list. | |
788 | * | |
789 | * Requires the proc->inner_lock to be held. | |
790 | */ | |
72196393 TK |
791 | static void |
792 | binder_enqueue_work_ilocked(struct binder_work *work, | |
793 | struct list_head *target_list) | |
794 | { | |
795 | BUG_ON(target_list == NULL); | |
796 | BUG_ON(work->entry.next && !list_empty(&work->entry)); | |
797 | list_add_tail(&work->entry, target_list); | |
798 | } | |
799 | ||
800 | /** | |
148ade2c MC |
801 | * binder_enqueue_deferred_thread_work_ilocked() - Add deferred thread work |
802 | * @thread: thread to queue work to | |
72196393 | 803 | * @work: struct binder_work to add to list |
72196393 | 804 | * |
148ade2c MC |
805 | * Adds the work to the todo list of the thread. Doesn't set the process_todo |
806 | * flag, which means that (if it wasn't already set) the thread will go to | |
807 | * sleep without handling this work when it calls read. | |
808 | * | |
809 | * Requires the proc->inner_lock to be held. | |
72196393 TK |
810 | */ |
811 | static void | |
148ade2c MC |
812 | binder_enqueue_deferred_thread_work_ilocked(struct binder_thread *thread, |
813 | struct binder_work *work) | |
72196393 | 814 | { |
44b73962 | 815 | WARN_ON(!list_empty(&thread->waiting_thread_node)); |
148ade2c MC |
816 | binder_enqueue_work_ilocked(work, &thread->todo); |
817 | } | |
818 | ||
819 | /** | |
820 | * binder_enqueue_thread_work_ilocked() - Add an item to the thread work list | |
821 | * @thread: thread to queue work to | |
822 | * @work: struct binder_work to add to list | |
823 | * | |
824 | * Adds the work to the todo list of the thread, and enables processing | |
825 | * of the todo queue. | |
826 | * | |
827 | * Requires the proc->inner_lock to be held. | |
828 | */ | |
829 | static void | |
830 | binder_enqueue_thread_work_ilocked(struct binder_thread *thread, | |
831 | struct binder_work *work) | |
832 | { | |
44b73962 | 833 | WARN_ON(!list_empty(&thread->waiting_thread_node)); |
148ade2c MC |
834 | binder_enqueue_work_ilocked(work, &thread->todo); |
835 | thread->process_todo = true; | |
836 | } | |
837 | ||
838 | /** | |
839 | * binder_enqueue_thread_work() - Add an item to the thread work list | |
840 | * @thread: thread to queue work to | |
841 | * @work: struct binder_work to add to list | |
842 | * | |
843 | * Adds the work to the todo list of the thread, and enables processing | |
844 | * of the todo queue. | |
845 | */ | |
846 | static void | |
847 | binder_enqueue_thread_work(struct binder_thread *thread, | |
848 | struct binder_work *work) | |
849 | { | |
850 | binder_inner_proc_lock(thread->proc); | |
851 | binder_enqueue_thread_work_ilocked(thread, work); | |
852 | binder_inner_proc_unlock(thread->proc); | |
72196393 TK |
853 | } |
854 | ||
855 | static void | |
856 | binder_dequeue_work_ilocked(struct binder_work *work) | |
857 | { | |
858 | list_del_init(&work->entry); | |
859 | } | |
860 | ||
861 | /** | |
862 | * binder_dequeue_work() - Removes an item from the work list | |
863 | * @proc: binder_proc associated with list | |
864 | * @work: struct binder_work to remove from list | |
865 | * | |
866 | * Removes the specified work item from whatever list it is on. | |
867 | * Can safely be called if work is not on any list. | |
868 | */ | |
869 | static void | |
870 | binder_dequeue_work(struct binder_proc *proc, struct binder_work *work) | |
871 | { | |
872 | binder_inner_proc_lock(proc); | |
873 | binder_dequeue_work_ilocked(work); | |
874 | binder_inner_proc_unlock(proc); | |
875 | } | |
876 | ||
877 | static struct binder_work *binder_dequeue_work_head_ilocked( | |
878 | struct list_head *list) | |
879 | { | |
880 | struct binder_work *w; | |
881 | ||
882 | w = list_first_entry_or_null(list, struct binder_work, entry); | |
883 | if (w) | |
884 | list_del_init(&w->entry); | |
885 | return w; | |
886 | } | |
887 | ||
888 | /** | |
889 | * binder_dequeue_work_head() - Dequeues the item at head of list | |
890 | * @proc: binder_proc associated with list | |
891 | * @list: list to dequeue head | |
892 | * | |
893 | * Removes the head of the list if there are items on the list | |
894 | * | |
895 | * Return: pointer dequeued binder_work, NULL if list was empty | |
896 | */ | |
897 | static struct binder_work *binder_dequeue_work_head( | |
898 | struct binder_proc *proc, | |
899 | struct list_head *list) | |
900 | { | |
901 | struct binder_work *w; | |
902 | ||
903 | binder_inner_proc_lock(proc); | |
904 | w = binder_dequeue_work_head_ilocked(list); | |
905 | binder_inner_proc_unlock(proc); | |
906 | return w; | |
907 | } | |
908 | ||
355b0502 GKH |
909 | static void |
910 | binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer); | |
7a4408c6 TK |
911 | static void binder_free_thread(struct binder_thread *thread); |
912 | static void binder_free_proc(struct binder_proc *proc); | |
da0fa9e4 | 913 | static void binder_inc_node_tmpref_ilocked(struct binder_node *node); |
355b0502 | 914 | |
1b77e9dc MC |
915 | static bool binder_has_work_ilocked(struct binder_thread *thread, |
916 | bool do_proc_work) | |
917 | { | |
148ade2c | 918 | return thread->process_todo || |
1b77e9dc MC |
919 | thread->looper_need_return || |
920 | (do_proc_work && | |
921 | !binder_worklist_empty_ilocked(&thread->proc->todo)); | |
922 | } | |
923 | ||
924 | static bool binder_has_work(struct binder_thread *thread, bool do_proc_work) | |
925 | { | |
926 | bool has_work; | |
927 | ||
928 | binder_inner_proc_lock(thread->proc); | |
929 | has_work = binder_has_work_ilocked(thread, do_proc_work); | |
930 | binder_inner_proc_unlock(thread->proc); | |
931 | ||
932 | return has_work; | |
933 | } | |
934 | ||
935 | static bool binder_available_for_proc_work_ilocked(struct binder_thread *thread) | |
936 | { | |
937 | return !thread->transaction_stack && | |
938 | binder_worklist_empty_ilocked(&thread->todo) && | |
939 | (thread->looper & (BINDER_LOOPER_STATE_ENTERED | | |
940 | BINDER_LOOPER_STATE_REGISTERED)); | |
941 | } | |
942 | ||
943 | static void binder_wakeup_poll_threads_ilocked(struct binder_proc *proc, | |
944 | bool sync) | |
945 | { | |
946 | struct rb_node *n; | |
947 | struct binder_thread *thread; | |
948 | ||
949 | for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) { | |
950 | thread = rb_entry(n, struct binder_thread, rb_node); | |
951 | if (thread->looper & BINDER_LOOPER_STATE_POLL && | |
952 | binder_available_for_proc_work_ilocked(thread)) { | |
953 | if (sync) | |
954 | wake_up_interruptible_sync(&thread->wait); | |
955 | else | |
956 | wake_up_interruptible(&thread->wait); | |
957 | } | |
958 | } | |
959 | } | |
960 | ||
408c68b1 MC |
961 | /** |
962 | * binder_select_thread_ilocked() - selects a thread for doing proc work. | |
963 | * @proc: process to select a thread from | |
964 | * | |
965 | * Note that calling this function moves the thread off the waiting_threads | |
966 | * list, so it can only be woken up by the caller of this function, or a | |
967 | * signal. Therefore, callers *should* always wake up the thread this function | |
968 | * returns. | |
969 | * | |
970 | * Return: If there's a thread currently waiting for process work, | |
971 | * returns that thread. Otherwise returns NULL. | |
972 | */ | |
973 | static struct binder_thread * | |
974 | binder_select_thread_ilocked(struct binder_proc *proc) | |
1b77e9dc MC |
975 | { |
976 | struct binder_thread *thread; | |
977 | ||
858b2719 | 978 | assert_spin_locked(&proc->inner_lock); |
1b77e9dc MC |
979 | thread = list_first_entry_or_null(&proc->waiting_threads, |
980 | struct binder_thread, | |
981 | waiting_thread_node); | |
982 | ||
408c68b1 | 983 | if (thread) |
1b77e9dc | 984 | list_del_init(&thread->waiting_thread_node); |
408c68b1 MC |
985 | |
986 | return thread; | |
987 | } | |
988 | ||
989 | /** | |
990 | * binder_wakeup_thread_ilocked() - wakes up a thread for doing proc work. | |
991 | * @proc: process to wake up a thread in | |
992 | * @thread: specific thread to wake-up (may be NULL) | |
993 | * @sync: whether to do a synchronous wake-up | |
994 | * | |
995 | * This function wakes up a thread in the @proc process. | |
996 | * The caller may provide a specific thread to wake-up in | |
997 | * the @thread parameter. If @thread is NULL, this function | |
998 | * will wake up threads that have called poll(). | |
999 | * | |
1000 | * Note that for this function to work as expected, callers | |
1001 | * should first call binder_select_thread() to find a thread | |
1002 | * to handle the work (if they don't have a thread already), | |
1003 | * and pass the result into the @thread parameter. | |
1004 | */ | |
1005 | static void binder_wakeup_thread_ilocked(struct binder_proc *proc, | |
1006 | struct binder_thread *thread, | |
1007 | bool sync) | |
1008 | { | |
858b2719 | 1009 | assert_spin_locked(&proc->inner_lock); |
408c68b1 MC |
1010 | |
1011 | if (thread) { | |
1b77e9dc MC |
1012 | if (sync) |
1013 | wake_up_interruptible_sync(&thread->wait); | |
1014 | else | |
1015 | wake_up_interruptible(&thread->wait); | |
1016 | return; | |
1017 | } | |
1018 | ||
1019 | /* Didn't find a thread waiting for proc work; this can happen | |
1020 | * in two scenarios: | |
1021 | * 1. All threads are busy handling transactions | |
1022 | * In that case, one of those threads should call back into | |
1023 | * the kernel driver soon and pick up this work. | |
1024 | * 2. Threads are using the (e)poll interface, in which case | |
1025 | * they may be blocked on the waitqueue without having been | |
1026 | * added to waiting_threads. For this case, we just iterate | |
1027 | * over all threads not handling transaction work, and | |
1028 | * wake them all up. We wake all because we don't know whether | |
1029 | * a thread that called into (e)poll is handling non-binder | |
1030 | * work currently. | |
1031 | */ | |
1032 | binder_wakeup_poll_threads_ilocked(proc, sync); | |
1033 | } | |
1034 | ||
408c68b1 MC |
1035 | static void binder_wakeup_proc_ilocked(struct binder_proc *proc) |
1036 | { | |
1037 | struct binder_thread *thread = binder_select_thread_ilocked(proc); | |
1038 | ||
1039 | binder_wakeup_thread_ilocked(proc, thread, /* sync = */false); | |
1040 | } | |
1041 | ||
355b0502 GKH |
1042 | static void binder_set_nice(long nice) |
1043 | { | |
1044 | long min_nice; | |
10f62861 | 1045 | |
355b0502 GKH |
1046 | if (can_nice(current, nice)) { |
1047 | set_user_nice(current, nice); | |
1048 | return; | |
1049 | } | |
c3643b69 | 1050 | min_nice = rlimit_to_nice(rlimit(RLIMIT_NICE)); |
355b0502 | 1051 | binder_debug(BINDER_DEBUG_PRIORITY_CAP, |
56b468fc AS |
1052 | "%d: nice value %ld not allowed use %ld instead\n", |
1053 | current->pid, nice, min_nice); | |
355b0502 | 1054 | set_user_nice(current, min_nice); |
8698a745 | 1055 | if (min_nice <= MAX_NICE) |
355b0502 | 1056 | return; |
56b468fc | 1057 | binder_user_error("%d RLIMIT_NICE not set\n", current->pid); |
355b0502 GKH |
1058 | } |
1059 | ||
da0fa9e4 TK |
1060 | static struct binder_node *binder_get_node_ilocked(struct binder_proc *proc, |
1061 | binder_uintptr_t ptr) | |
355b0502 GKH |
1062 | { |
1063 | struct rb_node *n = proc->nodes.rb_node; | |
1064 | struct binder_node *node; | |
1065 | ||
858b2719 | 1066 | assert_spin_locked(&proc->inner_lock); |
da0fa9e4 | 1067 | |
355b0502 GKH |
1068 | while (n) { |
1069 | node = rb_entry(n, struct binder_node, rb_node); | |
1070 | ||
1071 | if (ptr < node->ptr) | |
1072 | n = n->rb_left; | |
1073 | else if (ptr > node->ptr) | |
1074 | n = n->rb_right; | |
adc18842 TK |
1075 | else { |
1076 | /* | |
1077 | * take an implicit weak reference | |
1078 | * to ensure node stays alive until | |
1079 | * call to binder_put_node() | |
1080 | */ | |
da0fa9e4 | 1081 | binder_inc_node_tmpref_ilocked(node); |
355b0502 | 1082 | return node; |
adc18842 | 1083 | } |
355b0502 GKH |
1084 | } |
1085 | return NULL; | |
1086 | } | |
1087 | ||
da0fa9e4 TK |
1088 | static struct binder_node *binder_get_node(struct binder_proc *proc, |
1089 | binder_uintptr_t ptr) | |
1090 | { | |
1091 | struct binder_node *node; | |
1092 | ||
1093 | binder_inner_proc_lock(proc); | |
1094 | node = binder_get_node_ilocked(proc, ptr); | |
1095 | binder_inner_proc_unlock(proc); | |
1096 | return node; | |
1097 | } | |
1098 | ||
1099 | static struct binder_node *binder_init_node_ilocked( | |
1100 | struct binder_proc *proc, | |
1101 | struct binder_node *new_node, | |
1102 | struct flat_binder_object *fp) | |
355b0502 GKH |
1103 | { |
1104 | struct rb_node **p = &proc->nodes.rb_node; | |
1105 | struct rb_node *parent = NULL; | |
1106 | struct binder_node *node; | |
673068ee TK |
1107 | binder_uintptr_t ptr = fp ? fp->binder : 0; |
1108 | binder_uintptr_t cookie = fp ? fp->cookie : 0; | |
1109 | __u32 flags = fp ? fp->flags : 0; | |
355b0502 | 1110 | |
858b2719 MC |
1111 | assert_spin_locked(&proc->inner_lock); |
1112 | ||
355b0502 | 1113 | while (*p) { |
da0fa9e4 | 1114 | |
355b0502 GKH |
1115 | parent = *p; |
1116 | node = rb_entry(parent, struct binder_node, rb_node); | |
1117 | ||
1118 | if (ptr < node->ptr) | |
1119 | p = &(*p)->rb_left; | |
1120 | else if (ptr > node->ptr) | |
1121 | p = &(*p)->rb_right; | |
da0fa9e4 TK |
1122 | else { |
1123 | /* | |
1124 | * A matching node is already in | |
1125 | * the rb tree. Abandon the init | |
1126 | * and return it. | |
1127 | */ | |
1128 | binder_inc_node_tmpref_ilocked(node); | |
1129 | return node; | |
1130 | } | |
355b0502 | 1131 | } |
da0fa9e4 | 1132 | node = new_node; |
355b0502 | 1133 | binder_stats_created(BINDER_STAT_NODE); |
adc18842 | 1134 | node->tmp_refs++; |
355b0502 GKH |
1135 | rb_link_node(&node->rb_node, parent, p); |
1136 | rb_insert_color(&node->rb_node, &proc->nodes); | |
656a800a | 1137 | node->debug_id = atomic_inc_return(&binder_last_id); |
355b0502 GKH |
1138 | node->proc = proc; |
1139 | node->ptr = ptr; | |
1140 | node->cookie = cookie; | |
1141 | node->work.type = BINDER_WORK_NODE; | |
673068ee TK |
1142 | node->min_priority = flags & FLAT_BINDER_FLAG_PRIORITY_MASK; |
1143 | node->accept_fds = !!(flags & FLAT_BINDER_FLAG_ACCEPTS_FDS); | |
ec74136d | 1144 | node->txn_security_ctx = !!(flags & FLAT_BINDER_FLAG_TXN_SECURITY_CTX); |
9630fe88 | 1145 | spin_lock_init(&node->lock); |
355b0502 GKH |
1146 | INIT_LIST_HEAD(&node->work.entry); |
1147 | INIT_LIST_HEAD(&node->async_todo); | |
1148 | binder_debug(BINDER_DEBUG_INTERNAL_REFS, | |
da49889d | 1149 | "%d:%d node %d u%016llx c%016llx created\n", |
355b0502 | 1150 | proc->pid, current->pid, node->debug_id, |
da49889d | 1151 | (u64)node->ptr, (u64)node->cookie); |
da0fa9e4 TK |
1152 | |
1153 | return node; | |
1154 | } | |
1155 | ||
1156 | static struct binder_node *binder_new_node(struct binder_proc *proc, | |
1157 | struct flat_binder_object *fp) | |
1158 | { | |
1159 | struct binder_node *node; | |
1160 | struct binder_node *new_node = kzalloc(sizeof(*node), GFP_KERNEL); | |
1161 | ||
1162 | if (!new_node) | |
1163 | return NULL; | |
1164 | binder_inner_proc_lock(proc); | |
1165 | node = binder_init_node_ilocked(proc, new_node, fp); | |
1166 | binder_inner_proc_unlock(proc); | |
1167 | if (node != new_node) | |
1168 | /* | |
1169 | * The node was already added by another thread | |
1170 | */ | |
1171 | kfree(new_node); | |
1172 | ||
355b0502 GKH |
1173 | return node; |
1174 | } | |
1175 | ||
ed29721e | 1176 | static void binder_free_node(struct binder_node *node) |
355b0502 | 1177 | { |
ed29721e TK |
1178 | kfree(node); |
1179 | binder_stats_deleted(BINDER_STAT_NODE); | |
1180 | } | |
1181 | ||
673068ee TK |
1182 | static int binder_inc_node_nilocked(struct binder_node *node, int strong, |
1183 | int internal, | |
1184 | struct list_head *target_list) | |
ed29721e | 1185 | { |
673068ee TK |
1186 | struct binder_proc *proc = node->proc; |
1187 | ||
858b2719 | 1188 | assert_spin_locked(&node->lock); |
673068ee | 1189 | if (proc) |
858b2719 | 1190 | assert_spin_locked(&proc->inner_lock); |
355b0502 GKH |
1191 | if (strong) { |
1192 | if (internal) { | |
1193 | if (target_list == NULL && | |
1194 | node->internal_strong_refs == 0 && | |
342e5c90 MC |
1195 | !(node->proc && |
1196 | node == node->proc->context->binder_context_mgr_node && | |
1197 | node->has_strong_ref)) { | |
56b468fc AS |
1198 | pr_err("invalid inc strong node for %d\n", |
1199 | node->debug_id); | |
355b0502 GKH |
1200 | return -EINVAL; |
1201 | } | |
1202 | node->internal_strong_refs++; | |
1203 | } else | |
1204 | node->local_strong_refs++; | |
1205 | if (!node->has_strong_ref && target_list) { | |
44b73962 SY |
1206 | struct binder_thread *thread = container_of(target_list, |
1207 | struct binder_thread, todo); | |
72196393 | 1208 | binder_dequeue_work_ilocked(&node->work); |
44b73962 SY |
1209 | BUG_ON(&thread->todo != target_list); |
1210 | binder_enqueue_deferred_thread_work_ilocked(thread, | |
1211 | &node->work); | |
355b0502 GKH |
1212 | } |
1213 | } else { | |
1214 | if (!internal) | |
1215 | node->local_weak_refs++; | |
1216 | if (!node->has_weak_ref && list_empty(&node->work.entry)) { | |
1217 | if (target_list == NULL) { | |
56b468fc AS |
1218 | pr_err("invalid inc weak node for %d\n", |
1219 | node->debug_id); | |
355b0502 GKH |
1220 | return -EINVAL; |
1221 | } | |
148ade2c MC |
1222 | /* |
1223 | * See comment above | |
1224 | */ | |
72196393 | 1225 | binder_enqueue_work_ilocked(&node->work, target_list); |
355b0502 GKH |
1226 | } |
1227 | } | |
1228 | return 0; | |
1229 | } | |
1230 | ||
ed29721e TK |
1231 | static int binder_inc_node(struct binder_node *node, int strong, int internal, |
1232 | struct list_head *target_list) | |
1233 | { | |
1234 | int ret; | |
1235 | ||
673068ee TK |
1236 | binder_node_inner_lock(node); |
1237 | ret = binder_inc_node_nilocked(node, strong, internal, target_list); | |
1238 | binder_node_inner_unlock(node); | |
ed29721e TK |
1239 | |
1240 | return ret; | |
1241 | } | |
1242 | ||
673068ee TK |
1243 | static bool binder_dec_node_nilocked(struct binder_node *node, |
1244 | int strong, int internal) | |
355b0502 | 1245 | { |
ed29721e TK |
1246 | struct binder_proc *proc = node->proc; |
1247 | ||
858b2719 | 1248 | assert_spin_locked(&node->lock); |
ed29721e | 1249 | if (proc) |
858b2719 | 1250 | assert_spin_locked(&proc->inner_lock); |
355b0502 GKH |
1251 | if (strong) { |
1252 | if (internal) | |
1253 | node->internal_strong_refs--; | |
1254 | else | |
1255 | node->local_strong_refs--; | |
1256 | if (node->local_strong_refs || node->internal_strong_refs) | |
ed29721e | 1257 | return false; |
355b0502 GKH |
1258 | } else { |
1259 | if (!internal) | |
1260 | node->local_weak_refs--; | |
adc18842 TK |
1261 | if (node->local_weak_refs || node->tmp_refs || |
1262 | !hlist_empty(&node->refs)) | |
ed29721e | 1263 | return false; |
355b0502 | 1264 | } |
ed29721e TK |
1265 | |
1266 | if (proc && (node->has_strong_ref || node->has_weak_ref)) { | |
355b0502 | 1267 | if (list_empty(&node->work.entry)) { |
72196393 | 1268 | binder_enqueue_work_ilocked(&node->work, &proc->todo); |
408c68b1 | 1269 | binder_wakeup_proc_ilocked(proc); |
355b0502 GKH |
1270 | } |
1271 | } else { | |
1272 | if (hlist_empty(&node->refs) && !node->local_strong_refs && | |
adc18842 | 1273 | !node->local_weak_refs && !node->tmp_refs) { |
ed29721e | 1274 | if (proc) { |
72196393 TK |
1275 | binder_dequeue_work_ilocked(&node->work); |
1276 | rb_erase(&node->rb_node, &proc->nodes); | |
355b0502 | 1277 | binder_debug(BINDER_DEBUG_INTERNAL_REFS, |
56b468fc | 1278 | "refless node %d deleted\n", |
355b0502 GKH |
1279 | node->debug_id); |
1280 | } else { | |
72196393 | 1281 | BUG_ON(!list_empty(&node->work.entry)); |
c44b1231 | 1282 | spin_lock(&binder_dead_nodes_lock); |
ed29721e TK |
1283 | /* |
1284 | * tmp_refs could have changed so | |
1285 | * check it again | |
1286 | */ | |
1287 | if (node->tmp_refs) { | |
1288 | spin_unlock(&binder_dead_nodes_lock); | |
1289 | return false; | |
1290 | } | |
355b0502 | 1291 | hlist_del(&node->dead_node); |
c44b1231 | 1292 | spin_unlock(&binder_dead_nodes_lock); |
355b0502 | 1293 | binder_debug(BINDER_DEBUG_INTERNAL_REFS, |
56b468fc | 1294 | "dead node %d deleted\n", |
355b0502 GKH |
1295 | node->debug_id); |
1296 | } | |
ed29721e | 1297 | return true; |
355b0502 GKH |
1298 | } |
1299 | } | |
ed29721e TK |
1300 | return false; |
1301 | } | |
355b0502 | 1302 | |
ed29721e TK |
1303 | static void binder_dec_node(struct binder_node *node, int strong, int internal) |
1304 | { | |
1305 | bool free_node; | |
1306 | ||
673068ee TK |
1307 | binder_node_inner_lock(node); |
1308 | free_node = binder_dec_node_nilocked(node, strong, internal); | |
1309 | binder_node_inner_unlock(node); | |
ed29721e TK |
1310 | if (free_node) |
1311 | binder_free_node(node); | |
1312 | } | |
1313 | ||
1314 | static void binder_inc_node_tmpref_ilocked(struct binder_node *node) | |
1315 | { | |
1316 | /* | |
1317 | * No call to binder_inc_node() is needed since we | |
1318 | * don't need to inform userspace of any changes to | |
1319 | * tmp_refs | |
1320 | */ | |
1321 | node->tmp_refs++; | |
355b0502 GKH |
1322 | } |
1323 | ||
adc18842 TK |
1324 | /** |
1325 | * binder_inc_node_tmpref() - take a temporary reference on node | |
1326 | * @node: node to reference | |
1327 | * | |
1328 | * Take reference on node to prevent the node from being freed | |
ed29721e TK |
1329 | * while referenced only by a local variable. The inner lock is |
1330 | * needed to serialize with the node work on the queue (which | |
1331 | * isn't needed after the node is dead). If the node is dead | |
1332 | * (node->proc is NULL), use binder_dead_nodes_lock to protect | |
1333 | * node->tmp_refs against dead-node-only cases where the node | |
1334 | * lock cannot be acquired (eg traversing the dead node list to | |
1335 | * print nodes) | |
adc18842 TK |
1336 | */ |
1337 | static void binder_inc_node_tmpref(struct binder_node *node) | |
1338 | { | |
673068ee | 1339 | binder_node_lock(node); |
ed29721e TK |
1340 | if (node->proc) |
1341 | binder_inner_proc_lock(node->proc); | |
1342 | else | |
1343 | spin_lock(&binder_dead_nodes_lock); | |
1344 | binder_inc_node_tmpref_ilocked(node); | |
1345 | if (node->proc) | |
1346 | binder_inner_proc_unlock(node->proc); | |
1347 | else | |
1348 | spin_unlock(&binder_dead_nodes_lock); | |
673068ee | 1349 | binder_node_unlock(node); |
adc18842 TK |
1350 | } |
1351 | ||
1352 | /** | |
1353 | * binder_dec_node_tmpref() - remove a temporary reference on node | |
1354 | * @node: node to reference | |
1355 | * | |
1356 | * Release temporary reference on node taken via binder_inc_node_tmpref() | |
1357 | */ | |
1358 | static void binder_dec_node_tmpref(struct binder_node *node) | |
1359 | { | |
ed29721e TK |
1360 | bool free_node; |
1361 | ||
673068ee TK |
1362 | binder_node_inner_lock(node); |
1363 | if (!node->proc) | |
ed29721e | 1364 | spin_lock(&binder_dead_nodes_lock); |
324fa64c TK |
1365 | else |
1366 | __acquire(&binder_dead_nodes_lock); | |
adc18842 TK |
1367 | node->tmp_refs--; |
1368 | BUG_ON(node->tmp_refs < 0); | |
ed29721e TK |
1369 | if (!node->proc) |
1370 | spin_unlock(&binder_dead_nodes_lock); | |
324fa64c TK |
1371 | else |
1372 | __release(&binder_dead_nodes_lock); | |
adc18842 TK |
1373 | /* |
1374 | * Call binder_dec_node() to check if all refcounts are 0 | |
1375 | * and cleanup is needed. Calling with strong=0 and internal=1 | |
1376 | * causes no actual reference to be released in binder_dec_node(). | |
1377 | * If that changes, a change is needed here too. | |
1378 | */ | |
673068ee TK |
1379 | free_node = binder_dec_node_nilocked(node, 0, 1); |
1380 | binder_node_inner_unlock(node); | |
ed29721e TK |
1381 | if (free_node) |
1382 | binder_free_node(node); | |
adc18842 TK |
1383 | } |
1384 | ||
1385 | static void binder_put_node(struct binder_node *node) | |
1386 | { | |
1387 | binder_dec_node_tmpref(node); | |
1388 | } | |
355b0502 | 1389 | |
2c1838dc TK |
1390 | static struct binder_ref *binder_get_ref_olocked(struct binder_proc *proc, |
1391 | u32 desc, bool need_strong_ref) | |
355b0502 GKH |
1392 | { |
1393 | struct rb_node *n = proc->refs_by_desc.rb_node; | |
1394 | struct binder_ref *ref; | |
1395 | ||
1396 | while (n) { | |
1397 | ref = rb_entry(n, struct binder_ref, rb_node_desc); | |
1398 | ||
372e3147 | 1399 | if (desc < ref->data.desc) { |
355b0502 | 1400 | n = n->rb_left; |
372e3147 | 1401 | } else if (desc > ref->data.desc) { |
355b0502 | 1402 | n = n->rb_right; |
372e3147 | 1403 | } else if (need_strong_ref && !ref->data.strong) { |
0a3ffab9 AH |
1404 | binder_user_error("tried to use weak ref as strong ref\n"); |
1405 | return NULL; | |
1406 | } else { | |
355b0502 | 1407 | return ref; |
0a3ffab9 | 1408 | } |
355b0502 GKH |
1409 | } |
1410 | return NULL; | |
1411 | } | |
1412 | ||
372e3147 | 1413 | /** |
2c1838dc | 1414 | * binder_get_ref_for_node_olocked() - get the ref associated with given node |
372e3147 TK |
1415 | * @proc: binder_proc that owns the ref |
1416 | * @node: binder_node of target | |
1417 | * @new_ref: newly allocated binder_ref to be initialized or %NULL | |
1418 | * | |
1419 | * Look up the ref for the given node and return it if it exists | |
1420 | * | |
1421 | * If it doesn't exist and the caller provides a newly allocated | |
1422 | * ref, initialize the fields of the newly allocated ref and insert | |
1423 | * into the given proc rb_trees and node refs list. | |
1424 | * | |
1425 | * Return: the ref for node. It is possible that another thread | |
1426 | * allocated/initialized the ref first in which case the | |
1427 | * returned ref would be different than the passed-in | |
1428 | * new_ref. new_ref must be kfree'd by the caller in | |
1429 | * this case. | |
1430 | */ | |
2c1838dc TK |
1431 | static struct binder_ref *binder_get_ref_for_node_olocked( |
1432 | struct binder_proc *proc, | |
1433 | struct binder_node *node, | |
1434 | struct binder_ref *new_ref) | |
355b0502 | 1435 | { |
372e3147 | 1436 | struct binder_context *context = proc->context; |
355b0502 GKH |
1437 | struct rb_node **p = &proc->refs_by_node.rb_node; |
1438 | struct rb_node *parent = NULL; | |
372e3147 TK |
1439 | struct binder_ref *ref; |
1440 | struct rb_node *n; | |
355b0502 GKH |
1441 | |
1442 | while (*p) { | |
1443 | parent = *p; | |
1444 | ref = rb_entry(parent, struct binder_ref, rb_node_node); | |
1445 | ||
1446 | if (node < ref->node) | |
1447 | p = &(*p)->rb_left; | |
1448 | else if (node > ref->node) | |
1449 | p = &(*p)->rb_right; | |
1450 | else | |
1451 | return ref; | |
1452 | } | |
372e3147 | 1453 | if (!new_ref) |
355b0502 | 1454 | return NULL; |
372e3147 | 1455 | |
355b0502 | 1456 | binder_stats_created(BINDER_STAT_REF); |
372e3147 | 1457 | new_ref->data.debug_id = atomic_inc_return(&binder_last_id); |
355b0502 GKH |
1458 | new_ref->proc = proc; |
1459 | new_ref->node = node; | |
1460 | rb_link_node(&new_ref->rb_node_node, parent, p); | |
1461 | rb_insert_color(&new_ref->rb_node_node, &proc->refs_by_node); | |
1462 | ||
372e3147 | 1463 | new_ref->data.desc = (node == context->binder_context_mgr_node) ? 0 : 1; |
355b0502 GKH |
1464 | for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) { |
1465 | ref = rb_entry(n, struct binder_ref, rb_node_desc); | |
372e3147 | 1466 | if (ref->data.desc > new_ref->data.desc) |
355b0502 | 1467 | break; |
372e3147 | 1468 | new_ref->data.desc = ref->data.desc + 1; |
355b0502 GKH |
1469 | } |
1470 | ||
1471 | p = &proc->refs_by_desc.rb_node; | |
1472 | while (*p) { | |
1473 | parent = *p; | |
1474 | ref = rb_entry(parent, struct binder_ref, rb_node_desc); | |
1475 | ||
372e3147 | 1476 | if (new_ref->data.desc < ref->data.desc) |
355b0502 | 1477 | p = &(*p)->rb_left; |
372e3147 | 1478 | else if (new_ref->data.desc > ref->data.desc) |
355b0502 GKH |
1479 | p = &(*p)->rb_right; |
1480 | else | |
1481 | BUG(); | |
1482 | } | |
1483 | rb_link_node(&new_ref->rb_node_desc, parent, p); | |
1484 | rb_insert_color(&new_ref->rb_node_desc, &proc->refs_by_desc); | |
673068ee TK |
1485 | |
1486 | binder_node_lock(node); | |
e4cffcf4 | 1487 | hlist_add_head(&new_ref->node_entry, &node->refs); |
355b0502 | 1488 | |
e4cffcf4 TK |
1489 | binder_debug(BINDER_DEBUG_INTERNAL_REFS, |
1490 | "%d new ref %d desc %d for node %d\n", | |
372e3147 | 1491 | proc->pid, new_ref->data.debug_id, new_ref->data.desc, |
e4cffcf4 | 1492 | node->debug_id); |
673068ee | 1493 | binder_node_unlock(node); |
355b0502 GKH |
1494 | return new_ref; |
1495 | } | |
1496 | ||
2c1838dc | 1497 | static void binder_cleanup_ref_olocked(struct binder_ref *ref) |
355b0502 | 1498 | { |
ed29721e | 1499 | bool delete_node = false; |
ed29721e | 1500 | |
355b0502 | 1501 | binder_debug(BINDER_DEBUG_INTERNAL_REFS, |
56b468fc | 1502 | "%d delete ref %d desc %d for node %d\n", |
372e3147 | 1503 | ref->proc->pid, ref->data.debug_id, ref->data.desc, |
56b468fc | 1504 | ref->node->debug_id); |
355b0502 GKH |
1505 | |
1506 | rb_erase(&ref->rb_node_desc, &ref->proc->refs_by_desc); | |
1507 | rb_erase(&ref->rb_node_node, &ref->proc->refs_by_node); | |
372e3147 | 1508 | |
673068ee | 1509 | binder_node_inner_lock(ref->node); |
372e3147 | 1510 | if (ref->data.strong) |
673068ee | 1511 | binder_dec_node_nilocked(ref->node, 1, 1); |
372e3147 | 1512 | |
355b0502 | 1513 | hlist_del(&ref->node_entry); |
673068ee TK |
1514 | delete_node = binder_dec_node_nilocked(ref->node, 0, 1); |
1515 | binder_node_inner_unlock(ref->node); | |
ed29721e TK |
1516 | /* |
1517 | * Clear ref->node unless we want the caller to free the node | |
1518 | */ | |
1519 | if (!delete_node) { | |
1520 | /* | |
1521 | * The caller uses ref->node to determine | |
1522 | * whether the node needs to be freed. Clear | |
1523 | * it since the node is still alive. | |
1524 | */ | |
1525 | ref->node = NULL; | |
1526 | } | |
372e3147 | 1527 | |
355b0502 GKH |
1528 | if (ref->death) { |
1529 | binder_debug(BINDER_DEBUG_DEAD_BINDER, | |
56b468fc | 1530 | "%d delete ref %d desc %d has death notification\n", |
372e3147 TK |
1531 | ref->proc->pid, ref->data.debug_id, |
1532 | ref->data.desc); | |
72196393 | 1533 | binder_dequeue_work(ref->proc, &ref->death->work); |
355b0502 GKH |
1534 | binder_stats_deleted(BINDER_STAT_DEATH); |
1535 | } | |
355b0502 GKH |
1536 | binder_stats_deleted(BINDER_STAT_REF); |
1537 | } | |
1538 | ||
372e3147 | 1539 | /** |
2c1838dc | 1540 | * binder_inc_ref_olocked() - increment the ref for given handle |
372e3147 TK |
1541 | * @ref: ref to be incremented |
1542 | * @strong: if true, strong increment, else weak | |
1543 | * @target_list: list to queue node work on | |
1544 | * | |
2c1838dc | 1545 | * Increment the ref. @ref->proc->outer_lock must be held on entry |
372e3147 TK |
1546 | * |
1547 | * Return: 0, if successful, else errno | |
1548 | */ | |
2c1838dc TK |
1549 | static int binder_inc_ref_olocked(struct binder_ref *ref, int strong, |
1550 | struct list_head *target_list) | |
355b0502 GKH |
1551 | { |
1552 | int ret; | |
10f62861 | 1553 | |
355b0502 | 1554 | if (strong) { |
372e3147 | 1555 | if (ref->data.strong == 0) { |
355b0502 GKH |
1556 | ret = binder_inc_node(ref->node, 1, 1, target_list); |
1557 | if (ret) | |
1558 | return ret; | |
1559 | } | |
372e3147 | 1560 | ref->data.strong++; |
355b0502 | 1561 | } else { |
372e3147 | 1562 | if (ref->data.weak == 0) { |
355b0502 GKH |
1563 | ret = binder_inc_node(ref->node, 0, 1, target_list); |
1564 | if (ret) | |
1565 | return ret; | |
1566 | } | |
372e3147 | 1567 | ref->data.weak++; |
355b0502 GKH |
1568 | } |
1569 | return 0; | |
1570 | } | |
1571 | ||
372e3147 TK |
1572 | /** |
1573 | * binder_dec_ref() - dec the ref for given handle | |
1574 | * @ref: ref to be decremented | |
1575 | * @strong: if true, strong decrement, else weak | |
1576 | * | |
1577 | * Decrement the ref. | |
1578 | * | |
372e3147 TK |
1579 | * Return: true if ref is cleaned up and ready to be freed |
1580 | */ | |
2c1838dc | 1581 | static bool binder_dec_ref_olocked(struct binder_ref *ref, int strong) |
355b0502 GKH |
1582 | { |
1583 | if (strong) { | |
372e3147 | 1584 | if (ref->data.strong == 0) { |
56b468fc | 1585 | binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n", |
372e3147 TK |
1586 | ref->proc->pid, ref->data.debug_id, |
1587 | ref->data.desc, ref->data.strong, | |
1588 | ref->data.weak); | |
1589 | return false; | |
355b0502 | 1590 | } |
372e3147 | 1591 | ref->data.strong--; |
ed29721e TK |
1592 | if (ref->data.strong == 0) |
1593 | binder_dec_node(ref->node, strong, 1); | |
355b0502 | 1594 | } else { |
372e3147 | 1595 | if (ref->data.weak == 0) { |
56b468fc | 1596 | binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n", |
372e3147 TK |
1597 | ref->proc->pid, ref->data.debug_id, |
1598 | ref->data.desc, ref->data.strong, | |
1599 | ref->data.weak); | |
1600 | return false; | |
355b0502 | 1601 | } |
372e3147 | 1602 | ref->data.weak--; |
355b0502 | 1603 | } |
372e3147 | 1604 | if (ref->data.strong == 0 && ref->data.weak == 0) { |
2c1838dc | 1605 | binder_cleanup_ref_olocked(ref); |
372e3147 TK |
1606 | return true; |
1607 | } | |
1608 | return false; | |
1609 | } | |
1610 | ||
1611 | /** | |
1612 | * binder_get_node_from_ref() - get the node from the given proc/desc | |
1613 | * @proc: proc containing the ref | |
1614 | * @desc: the handle associated with the ref | |
1615 | * @need_strong_ref: if true, only return node if ref is strong | |
1616 | * @rdata: the id/refcount data for the ref | |
1617 | * | |
1618 | * Given a proc and ref handle, return the associated binder_node | |
1619 | * | |
1620 | * Return: a binder_node or NULL if not found or not strong when strong required | |
1621 | */ | |
1622 | static struct binder_node *binder_get_node_from_ref( | |
1623 | struct binder_proc *proc, | |
1624 | u32 desc, bool need_strong_ref, | |
1625 | struct binder_ref_data *rdata) | |
1626 | { | |
1627 | struct binder_node *node; | |
1628 | struct binder_ref *ref; | |
1629 | ||
2c1838dc TK |
1630 | binder_proc_lock(proc); |
1631 | ref = binder_get_ref_olocked(proc, desc, need_strong_ref); | |
372e3147 TK |
1632 | if (!ref) |
1633 | goto err_no_ref; | |
1634 | node = ref->node; | |
adc18842 TK |
1635 | /* |
1636 | * Take an implicit reference on the node to ensure | |
1637 | * it stays alive until the call to binder_put_node() | |
1638 | */ | |
1639 | binder_inc_node_tmpref(node); | |
372e3147 TK |
1640 | if (rdata) |
1641 | *rdata = ref->data; | |
2c1838dc | 1642 | binder_proc_unlock(proc); |
372e3147 TK |
1643 | |
1644 | return node; | |
1645 | ||
1646 | err_no_ref: | |
2c1838dc | 1647 | binder_proc_unlock(proc); |
372e3147 TK |
1648 | return NULL; |
1649 | } | |
1650 | ||
1651 | /** | |
1652 | * binder_free_ref() - free the binder_ref | |
1653 | * @ref: ref to free | |
1654 | * | |
ed29721e TK |
1655 | * Free the binder_ref. Free the binder_node indicated by ref->node |
1656 | * (if non-NULL) and the binder_ref_death indicated by ref->death. | |
372e3147 TK |
1657 | */ |
1658 | static void binder_free_ref(struct binder_ref *ref) | |
1659 | { | |
ed29721e TK |
1660 | if (ref->node) |
1661 | binder_free_node(ref->node); | |
372e3147 TK |
1662 | kfree(ref->death); |
1663 | kfree(ref); | |
1664 | } | |
1665 | ||
1666 | /** | |
1667 | * binder_update_ref_for_handle() - inc/dec the ref for given handle | |
1668 | * @proc: proc containing the ref | |
1669 | * @desc: the handle associated with the ref | |
1670 | * @increment: true=inc reference, false=dec reference | |
1671 | * @strong: true=strong reference, false=weak reference | |
1672 | * @rdata: the id/refcount data for the ref | |
1673 | * | |
1674 | * Given a proc and ref handle, increment or decrement the ref | |
1675 | * according to "increment" arg. | |
1676 | * | |
1677 | * Return: 0 if successful, else errno | |
1678 | */ | |
1679 | static int binder_update_ref_for_handle(struct binder_proc *proc, | |
1680 | uint32_t desc, bool increment, bool strong, | |
1681 | struct binder_ref_data *rdata) | |
1682 | { | |
1683 | int ret = 0; | |
1684 | struct binder_ref *ref; | |
1685 | bool delete_ref = false; | |
1686 | ||
2c1838dc TK |
1687 | binder_proc_lock(proc); |
1688 | ref = binder_get_ref_olocked(proc, desc, strong); | |
372e3147 TK |
1689 | if (!ref) { |
1690 | ret = -EINVAL; | |
1691 | goto err_no_ref; | |
1692 | } | |
1693 | if (increment) | |
2c1838dc | 1694 | ret = binder_inc_ref_olocked(ref, strong, NULL); |
372e3147 | 1695 | else |
2c1838dc | 1696 | delete_ref = binder_dec_ref_olocked(ref, strong); |
372e3147 TK |
1697 | |
1698 | if (rdata) | |
1699 | *rdata = ref->data; | |
2c1838dc | 1700 | binder_proc_unlock(proc); |
372e3147 TK |
1701 | |
1702 | if (delete_ref) | |
1703 | binder_free_ref(ref); | |
1704 | return ret; | |
1705 | ||
1706 | err_no_ref: | |
2c1838dc | 1707 | binder_proc_unlock(proc); |
372e3147 TK |
1708 | return ret; |
1709 | } | |
1710 | ||
1711 | /** | |
1712 | * binder_dec_ref_for_handle() - dec the ref for given handle | |
1713 | * @proc: proc containing the ref | |
1714 | * @desc: the handle associated with the ref | |
1715 | * @strong: true=strong reference, false=weak reference | |
1716 | * @rdata: the id/refcount data for the ref | |
1717 | * | |
1718 | * Just calls binder_update_ref_for_handle() to decrement the ref. | |
1719 | * | |
1720 | * Return: 0 if successful, else errno | |
1721 | */ | |
1722 | static int binder_dec_ref_for_handle(struct binder_proc *proc, | |
1723 | uint32_t desc, bool strong, struct binder_ref_data *rdata) | |
1724 | { | |
1725 | return binder_update_ref_for_handle(proc, desc, false, strong, rdata); | |
1726 | } | |
1727 | ||
1728 | ||
1729 | /** | |
1730 | * binder_inc_ref_for_node() - increment the ref for given proc/node | |
1731 | * @proc: proc containing the ref | |
1732 | * @node: target node | |
1733 | * @strong: true=strong reference, false=weak reference | |
1734 | * @target_list: worklist to use if node is incremented | |
1735 | * @rdata: the id/refcount data for the ref | |
1736 | * | |
1737 | * Given a proc and node, increment the ref. Create the ref if it | |
1738 | * doesn't already exist | |
1739 | * | |
1740 | * Return: 0 if successful, else errno | |
1741 | */ | |
1742 | static int binder_inc_ref_for_node(struct binder_proc *proc, | |
1743 | struct binder_node *node, | |
1744 | bool strong, | |
1745 | struct list_head *target_list, | |
1746 | struct binder_ref_data *rdata) | |
1747 | { | |
1748 | struct binder_ref *ref; | |
1749 | struct binder_ref *new_ref = NULL; | |
1750 | int ret = 0; | |
1751 | ||
2c1838dc TK |
1752 | binder_proc_lock(proc); |
1753 | ref = binder_get_ref_for_node_olocked(proc, node, NULL); | |
372e3147 | 1754 | if (!ref) { |
2c1838dc | 1755 | binder_proc_unlock(proc); |
372e3147 TK |
1756 | new_ref = kzalloc(sizeof(*ref), GFP_KERNEL); |
1757 | if (!new_ref) | |
1758 | return -ENOMEM; | |
2c1838dc TK |
1759 | binder_proc_lock(proc); |
1760 | ref = binder_get_ref_for_node_olocked(proc, node, new_ref); | |
372e3147 | 1761 | } |
2c1838dc | 1762 | ret = binder_inc_ref_olocked(ref, strong, target_list); |
372e3147 | 1763 | *rdata = ref->data; |
2c1838dc | 1764 | binder_proc_unlock(proc); |
372e3147 TK |
1765 | if (new_ref && ref != new_ref) |
1766 | /* | |
1767 | * Another thread created the ref first so | |
1768 | * free the one we allocated | |
1769 | */ | |
1770 | kfree(new_ref); | |
1771 | return ret; | |
355b0502 GKH |
1772 | } |
1773 | ||
0b89d69a MC |
1774 | static void binder_pop_transaction_ilocked(struct binder_thread *target_thread, |
1775 | struct binder_transaction *t) | |
355b0502 | 1776 | { |
b6d282ce | 1777 | BUG_ON(!target_thread); |
858b2719 | 1778 | assert_spin_locked(&target_thread->proc->inner_lock); |
b6d282ce TK |
1779 | BUG_ON(target_thread->transaction_stack != t); |
1780 | BUG_ON(target_thread->transaction_stack->from != target_thread); | |
1781 | target_thread->transaction_stack = | |
1782 | target_thread->transaction_stack->from_parent; | |
1783 | t->from = NULL; | |
1784 | } | |
1785 | ||
7a4408c6 TK |
1786 | /** |
1787 | * binder_thread_dec_tmpref() - decrement thread->tmp_ref | |
1788 | * @thread: thread to decrement | |
1789 | * | |
1790 | * A thread needs to be kept alive while being used to create or | |
1791 | * handle a transaction. binder_get_txn_from() is used to safely | |
1792 | * extract t->from from a binder_transaction and keep the thread | |
1793 | * indicated by t->from from being freed. When done with that | |
1794 | * binder_thread, this function is called to decrement the | |
1795 | * tmp_ref and free if appropriate (thread has been released | |
1796 | * and no transaction being processed by the driver) | |
1797 | */ | |
1798 | static void binder_thread_dec_tmpref(struct binder_thread *thread) | |
1799 | { | |
1800 | /* | |
1801 | * atomic is used to protect the counter value while | |
1802 | * it cannot reach zero or thread->is_dead is false | |
7a4408c6 | 1803 | */ |
7bd7b0e6 | 1804 | binder_inner_proc_lock(thread->proc); |
7a4408c6 TK |
1805 | atomic_dec(&thread->tmp_ref); |
1806 | if (thread->is_dead && !atomic_read(&thread->tmp_ref)) { | |
7bd7b0e6 | 1807 | binder_inner_proc_unlock(thread->proc); |
7a4408c6 TK |
1808 | binder_free_thread(thread); |
1809 | return; | |
1810 | } | |
7bd7b0e6 | 1811 | binder_inner_proc_unlock(thread->proc); |
7a4408c6 TK |
1812 | } |
1813 | ||
1814 | /** | |
1815 | * binder_proc_dec_tmpref() - decrement proc->tmp_ref | |
1816 | * @proc: proc to decrement | |
1817 | * | |
1818 | * A binder_proc needs to be kept alive while being used to create or | |
1819 | * handle a transaction. proc->tmp_ref is incremented when | |
1820 | * creating a new transaction or the binder_proc is currently in-use | |
1821 | * by threads that are being released. When done with the binder_proc, | |
1822 | * this function is called to decrement the counter and free the | |
1823 | * proc if appropriate (proc has been released, all threads have | |
1824 | * been released and not currenly in-use to process a transaction). | |
1825 | */ | |
1826 | static void binder_proc_dec_tmpref(struct binder_proc *proc) | |
1827 | { | |
7bd7b0e6 | 1828 | binder_inner_proc_lock(proc); |
7a4408c6 TK |
1829 | proc->tmp_ref--; |
1830 | if (proc->is_dead && RB_EMPTY_ROOT(&proc->threads) && | |
1831 | !proc->tmp_ref) { | |
7bd7b0e6 | 1832 | binder_inner_proc_unlock(proc); |
7a4408c6 TK |
1833 | binder_free_proc(proc); |
1834 | return; | |
1835 | } | |
7bd7b0e6 | 1836 | binder_inner_proc_unlock(proc); |
7a4408c6 TK |
1837 | } |
1838 | ||
1839 | /** | |
1840 | * binder_get_txn_from() - safely extract the "from" thread in transaction | |
1841 | * @t: binder transaction for t->from | |
1842 | * | |
1843 | * Atomically return the "from" thread and increment the tmp_ref | |
1844 | * count for the thread to ensure it stays alive until | |
1845 | * binder_thread_dec_tmpref() is called. | |
1846 | * | |
1847 | * Return: the value of t->from | |
1848 | */ | |
1849 | static struct binder_thread *binder_get_txn_from( | |
1850 | struct binder_transaction *t) | |
1851 | { | |
1852 | struct binder_thread *from; | |
1853 | ||
1854 | spin_lock(&t->lock); | |
1855 | from = t->from; | |
1856 | if (from) | |
1857 | atomic_inc(&from->tmp_ref); | |
1858 | spin_unlock(&t->lock); | |
1859 | return from; | |
1860 | } | |
1861 | ||
0b89d69a MC |
1862 | /** |
1863 | * binder_get_txn_from_and_acq_inner() - get t->from and acquire inner lock | |
1864 | * @t: binder transaction for t->from | |
1865 | * | |
1866 | * Same as binder_get_txn_from() except it also acquires the proc->inner_lock | |
1867 | * to guarantee that the thread cannot be released while operating on it. | |
1868 | * The caller must call binder_inner_proc_unlock() to release the inner lock | |
1869 | * as well as call binder_dec_thread_txn() to release the reference. | |
1870 | * | |
1871 | * Return: the value of t->from | |
1872 | */ | |
1873 | static struct binder_thread *binder_get_txn_from_and_acq_inner( | |
1874 | struct binder_transaction *t) | |
324fa64c | 1875 | __acquires(&t->from->proc->inner_lock) |
0b89d69a MC |
1876 | { |
1877 | struct binder_thread *from; | |
1878 | ||
1879 | from = binder_get_txn_from(t); | |
324fa64c TK |
1880 | if (!from) { |
1881 | __acquire(&from->proc->inner_lock); | |
0b89d69a | 1882 | return NULL; |
324fa64c | 1883 | } |
0b89d69a MC |
1884 | binder_inner_proc_lock(from->proc); |
1885 | if (t->from) { | |
1886 | BUG_ON(from != t->from); | |
1887 | return from; | |
1888 | } | |
1889 | binder_inner_proc_unlock(from->proc); | |
324fa64c | 1890 | __acquire(&from->proc->inner_lock); |
0b89d69a MC |
1891 | binder_thread_dec_tmpref(from); |
1892 | return NULL; | |
1893 | } | |
1894 | ||
44d8047f TK |
1895 | /** |
1896 | * binder_free_txn_fixups() - free unprocessed fd fixups | |
1897 | * @t: binder transaction for t->from | |
1898 | * | |
1899 | * If the transaction is being torn down prior to being | |
1900 | * processed by the target process, free all of the | |
1901 | * fd fixups and fput the file structs. It is safe to | |
1902 | * call this function after the fixups have been | |
1903 | * processed -- in that case, the list will be empty. | |
1904 | */ | |
1905 | static void binder_free_txn_fixups(struct binder_transaction *t) | |
1906 | { | |
1907 | struct binder_txn_fd_fixup *fixup, *tmp; | |
1908 | ||
1909 | list_for_each_entry_safe(fixup, tmp, &t->fd_fixups, fixup_entry) { | |
1910 | fput(fixup->file); | |
1911 | list_del(&fixup->fixup_entry); | |
1912 | kfree(fixup); | |
1913 | } | |
1914 | } | |
1915 | ||
b6d282ce TK |
1916 | static void binder_free_transaction(struct binder_transaction *t) |
1917 | { | |
a370003c TK |
1918 | struct binder_proc *target_proc = t->to_proc; |
1919 | ||
1920 | if (target_proc) { | |
1921 | binder_inner_proc_lock(target_proc); | |
1922 | if (t->buffer) | |
1923 | t->buffer->transaction = NULL; | |
1924 | binder_inner_proc_unlock(target_proc); | |
1925 | } | |
1926 | /* | |
1927 | * If the transaction has no target_proc, then | |
1928 | * t->buffer->transaction has already been cleared. | |
1929 | */ | |
44d8047f | 1930 | binder_free_txn_fixups(t); |
355b0502 GKH |
1931 | kfree(t); |
1932 | binder_stats_deleted(BINDER_STAT_TRANSACTION); | |
1933 | } | |
1934 | ||
1935 | static void binder_send_failed_reply(struct binder_transaction *t, | |
1936 | uint32_t error_code) | |
1937 | { | |
1938 | struct binder_thread *target_thread; | |
d4ec15e1 | 1939 | struct binder_transaction *next; |
10f62861 | 1940 | |
355b0502 GKH |
1941 | BUG_ON(t->flags & TF_ONE_WAY); |
1942 | while (1) { | |
0b89d69a | 1943 | target_thread = binder_get_txn_from_and_acq_inner(t); |
355b0502 | 1944 | if (target_thread) { |
26549d17 TK |
1945 | binder_debug(BINDER_DEBUG_FAILED_TRANSACTION, |
1946 | "send failed reply for transaction %d to %d:%d\n", | |
1947 | t->debug_id, | |
1948 | target_thread->proc->pid, | |
1949 | target_thread->pid); | |
1950 | ||
0b89d69a | 1951 | binder_pop_transaction_ilocked(target_thread, t); |
26549d17 TK |
1952 | if (target_thread->reply_error.cmd == BR_OK) { |
1953 | target_thread->reply_error.cmd = error_code; | |
148ade2c MC |
1954 | binder_enqueue_thread_work_ilocked( |
1955 | target_thread, | |
1956 | &target_thread->reply_error.work); | |
355b0502 GKH |
1957 | wake_up_interruptible(&target_thread->wait); |
1958 | } else { | |
e46a3b3b TK |
1959 | /* |
1960 | * Cannot get here for normal operation, but | |
1961 | * we can if multiple synchronous transactions | |
1962 | * are sent without blocking for responses. | |
1963 | * Just ignore the 2nd error in this case. | |
1964 | */ | |
1965 | pr_warn("Unexpected reply error: %u\n", | |
1966 | target_thread->reply_error.cmd); | |
355b0502 | 1967 | } |
0b89d69a | 1968 | binder_inner_proc_unlock(target_thread->proc); |
7a4408c6 | 1969 | binder_thread_dec_tmpref(target_thread); |
26549d17 | 1970 | binder_free_transaction(t); |
355b0502 | 1971 | return; |
d4ec15e1 | 1972 | } |
72b93c79 | 1973 | __release(&target_thread->proc->inner_lock); |
d4ec15e1 LT |
1974 | next = t->from_parent; |
1975 | ||
1976 | binder_debug(BINDER_DEBUG_FAILED_TRANSACTION, | |
1977 | "send failed reply for transaction %d, target dead\n", | |
1978 | t->debug_id); | |
1979 | ||
b6d282ce | 1980 | binder_free_transaction(t); |
d4ec15e1 | 1981 | if (next == NULL) { |
355b0502 | 1982 | binder_debug(BINDER_DEBUG_DEAD_BINDER, |
d4ec15e1 LT |
1983 | "reply failed, no target thread at root\n"); |
1984 | return; | |
355b0502 | 1985 | } |
d4ec15e1 LT |
1986 | t = next; |
1987 | binder_debug(BINDER_DEBUG_DEAD_BINDER, | |
1988 | "reply failed, no target thread -- retry %d\n", | |
1989 | t->debug_id); | |
355b0502 GKH |
1990 | } |
1991 | } | |
1992 | ||
fb2c4452 MC |
1993 | /** |
1994 | * binder_cleanup_transaction() - cleans up undelivered transaction | |
1995 | * @t: transaction that needs to be cleaned up | |
1996 | * @reason: reason the transaction wasn't delivered | |
1997 | * @error_code: error to return to caller (if synchronous call) | |
1998 | */ | |
1999 | static void binder_cleanup_transaction(struct binder_transaction *t, | |
2000 | const char *reason, | |
2001 | uint32_t error_code) | |
2002 | { | |
2003 | if (t->buffer->target_node && !(t->flags & TF_ONE_WAY)) { | |
2004 | binder_send_failed_reply(t, error_code); | |
2005 | } else { | |
2006 | binder_debug(BINDER_DEBUG_DEAD_TRANSACTION, | |
2007 | "undelivered transaction %d, %s\n", | |
2008 | t->debug_id, reason); | |
2009 | binder_free_transaction(t); | |
2010 | } | |
2011 | } | |
2012 | ||
feba3900 | 2013 | /** |
7a67a393 TK |
2014 | * binder_get_object() - gets object and checks for valid metadata |
2015 | * @proc: binder_proc owning the buffer | |
feba3900 | 2016 | * @buffer: binder_buffer that we're parsing. |
7a67a393 TK |
2017 | * @offset: offset in the @buffer at which to validate an object. |
2018 | * @object: struct binder_object to read into | |
feba3900 MC |
2019 | * |
2020 | * Return: If there's a valid metadata object at @offset in @buffer, the | |
7a67a393 TK |
2021 | * size of that object. Otherwise, it returns zero. The object |
2022 | * is read into the struct binder_object pointed to by @object. | |
feba3900 | 2023 | */ |
7a67a393 TK |
2024 | static size_t binder_get_object(struct binder_proc *proc, |
2025 | struct binder_buffer *buffer, | |
2026 | unsigned long offset, | |
2027 | struct binder_object *object) | |
feba3900 | 2028 | { |
7a67a393 | 2029 | size_t read_size; |
feba3900 MC |
2030 | struct binder_object_header *hdr; |
2031 | size_t object_size = 0; | |
2032 | ||
7a67a393 | 2033 | read_size = min_t(size_t, sizeof(*object), buffer->data_size - offset); |
5997da82 | 2034 | if (offset > buffer->data_size || read_size < sizeof(*hdr) || |
bb4a2e48 TK |
2035 | binder_alloc_copy_from_buffer(&proc->alloc, object, buffer, |
2036 | offset, read_size)) | |
feba3900 MC |
2037 | return 0; |
2038 | ||
7a67a393 TK |
2039 | /* Ok, now see if we read a complete object. */ |
2040 | hdr = &object->hdr; | |
feba3900 MC |
2041 | switch (hdr->type) { |
2042 | case BINDER_TYPE_BINDER: | |
2043 | case BINDER_TYPE_WEAK_BINDER: | |
2044 | case BINDER_TYPE_HANDLE: | |
2045 | case BINDER_TYPE_WEAK_HANDLE: | |
2046 | object_size = sizeof(struct flat_binder_object); | |
2047 | break; | |
2048 | case BINDER_TYPE_FD: | |
2049 | object_size = sizeof(struct binder_fd_object); | |
2050 | break; | |
7980240b MC |
2051 | case BINDER_TYPE_PTR: |
2052 | object_size = sizeof(struct binder_buffer_object); | |
2053 | break; | |
def95c73 MC |
2054 | case BINDER_TYPE_FDA: |
2055 | object_size = sizeof(struct binder_fd_array_object); | |
2056 | break; | |
feba3900 MC |
2057 | default: |
2058 | return 0; | |
2059 | } | |
2060 | if (offset <= buffer->data_size - object_size && | |
2061 | buffer->data_size >= object_size) | |
2062 | return object_size; | |
2063 | else | |
2064 | return 0; | |
2065 | } | |
2066 | ||
7980240b MC |
2067 | /** |
2068 | * binder_validate_ptr() - validates binder_buffer_object in a binder_buffer. | |
db6b0b81 | 2069 | * @proc: binder_proc owning the buffer |
7980240b | 2070 | * @b: binder_buffer containing the object |
db6b0b81 | 2071 | * @object: struct binder_object to read into |
7980240b MC |
2072 | * @index: index in offset array at which the binder_buffer_object is |
2073 | * located | |
db6b0b81 TK |
2074 | * @start_offset: points to the start of the offset array |
2075 | * @object_offsetp: offset of @object read from @b | |
7980240b MC |
2076 | * @num_valid: the number of valid offsets in the offset array |
2077 | * | |
2078 | * Return: If @index is within the valid range of the offset array | |
2079 | * described by @start and @num_valid, and if there's a valid | |
2080 | * binder_buffer_object at the offset found in index @index | |
2081 | * of the offset array, that object is returned. Otherwise, | |
2082 | * %NULL is returned. | |
2083 | * Note that the offset found in index @index itself is not | |
2084 | * verified; this function assumes that @num_valid elements | |
2085 | * from @start were previously verified to have valid offsets. | |
db6b0b81 TK |
2086 | * If @object_offsetp is non-NULL, then the offset within |
2087 | * @b is written to it. | |
7980240b | 2088 | */ |
db6b0b81 TK |
2089 | static struct binder_buffer_object *binder_validate_ptr( |
2090 | struct binder_proc *proc, | |
2091 | struct binder_buffer *b, | |
2092 | struct binder_object *object, | |
2093 | binder_size_t index, | |
2094 | binder_size_t start_offset, | |
2095 | binder_size_t *object_offsetp, | |
2096 | binder_size_t num_valid) | |
7980240b | 2097 | { |
db6b0b81 TK |
2098 | size_t object_size; |
2099 | binder_size_t object_offset; | |
2100 | unsigned long buffer_offset; | |
7980240b MC |
2101 | |
2102 | if (index >= num_valid) | |
2103 | return NULL; | |
2104 | ||
db6b0b81 | 2105 | buffer_offset = start_offset + sizeof(binder_size_t) * index; |
bb4a2e48 TK |
2106 | if (binder_alloc_copy_from_buffer(&proc->alloc, &object_offset, |
2107 | b, buffer_offset, | |
2108 | sizeof(object_offset))) | |
2109 | return NULL; | |
db6b0b81 TK |
2110 | object_size = binder_get_object(proc, b, object_offset, object); |
2111 | if (!object_size || object->hdr.type != BINDER_TYPE_PTR) | |
7980240b | 2112 | return NULL; |
db6b0b81 TK |
2113 | if (object_offsetp) |
2114 | *object_offsetp = object_offset; | |
7980240b | 2115 | |
db6b0b81 | 2116 | return &object->bbo; |
7980240b MC |
2117 | } |
2118 | ||
2119 | /** | |
2120 | * binder_validate_fixup() - validates pointer/fd fixups happen in order. | |
db6b0b81 | 2121 | * @proc: binder_proc owning the buffer |
7980240b | 2122 | * @b: transaction buffer |
db6b0b81 TK |
2123 | * @objects_start_offset: offset to start of objects buffer |
2124 | * @buffer_obj_offset: offset to binder_buffer_object in which to fix up | |
2125 | * @fixup_offset: start offset in @buffer to fix up | |
2126 | * @last_obj_offset: offset to last binder_buffer_object that we fixed | |
2127 | * @last_min_offset: minimum fixup offset in object at @last_obj_offset | |
7980240b MC |
2128 | * |
2129 | * Return: %true if a fixup in buffer @buffer at offset @offset is | |
2130 | * allowed. | |
2131 | * | |
2132 | * For safety reasons, we only allow fixups inside a buffer to happen | |
2133 | * at increasing offsets; additionally, we only allow fixup on the last | |
2134 | * buffer object that was verified, or one of its parents. | |
2135 | * | |
2136 | * Example of what is allowed: | |
2137 | * | |
2138 | * A | |
2139 | * B (parent = A, offset = 0) | |
2140 | * C (parent = A, offset = 16) | |
2141 | * D (parent = C, offset = 0) | |
2142 | * E (parent = A, offset = 32) // min_offset is 16 (C.parent_offset) | |
2143 | * | |
2144 | * Examples of what is not allowed: | |
2145 | * | |
2146 | * Decreasing offsets within the same parent: | |
2147 | * A | |
2148 | * C (parent = A, offset = 16) | |
2149 | * B (parent = A, offset = 0) // decreasing offset within A | |
2150 | * | |
2151 | * Referring to a parent that wasn't the last object or any of its parents: | |
2152 | * A | |
2153 | * B (parent = A, offset = 0) | |
2154 | * C (parent = A, offset = 0) | |
2155 | * C (parent = A, offset = 16) | |
2156 | * D (parent = B, offset = 0) // B is not A or any of A's parents | |
2157 | */ | |
db6b0b81 TK |
2158 | static bool binder_validate_fixup(struct binder_proc *proc, |
2159 | struct binder_buffer *b, | |
2160 | binder_size_t objects_start_offset, | |
2161 | binder_size_t buffer_obj_offset, | |
7980240b | 2162 | binder_size_t fixup_offset, |
db6b0b81 | 2163 | binder_size_t last_obj_offset, |
7980240b MC |
2164 | binder_size_t last_min_offset) |
2165 | { | |
db6b0b81 | 2166 | if (!last_obj_offset) { |
7980240b MC |
2167 | /* Nothing to fix up in */ |
2168 | return false; | |
2169 | } | |
2170 | ||
db6b0b81 TK |
2171 | while (last_obj_offset != buffer_obj_offset) { |
2172 | unsigned long buffer_offset; | |
2173 | struct binder_object last_object; | |
2174 | struct binder_buffer_object *last_bbo; | |
2175 | size_t object_size = binder_get_object(proc, b, last_obj_offset, | |
2176 | &last_object); | |
2177 | if (object_size != sizeof(*last_bbo)) | |
2178 | return false; | |
2179 | ||
2180 | last_bbo = &last_object.bbo; | |
7980240b MC |
2181 | /* |
2182 | * Safe to retrieve the parent of last_obj, since it | |
2183 | * was already previously verified by the driver. | |
2184 | */ | |
db6b0b81 | 2185 | if ((last_bbo->flags & BINDER_BUFFER_FLAG_HAS_PARENT) == 0) |
7980240b | 2186 | return false; |
db6b0b81 TK |
2187 | last_min_offset = last_bbo->parent_offset + sizeof(uintptr_t); |
2188 | buffer_offset = objects_start_offset + | |
bb4a2e48 TK |
2189 | sizeof(binder_size_t) * last_bbo->parent; |
2190 | if (binder_alloc_copy_from_buffer(&proc->alloc, | |
2191 | &last_obj_offset, | |
2192 | b, buffer_offset, | |
2193 | sizeof(last_obj_offset))) | |
2194 | return false; | |
7980240b MC |
2195 | } |
2196 | return (fixup_offset >= last_min_offset); | |
2197 | } | |
2198 | ||
80cd7956 TK |
2199 | /** |
2200 | * struct binder_task_work_cb - for deferred close | |
2201 | * | |
2202 | * @twork: callback_head for task work | |
2203 | * @fd: fd to close | |
2204 | * | |
2205 | * Structure to pass task work to be handled after | |
2206 | * returning from binder_ioctl() via task_work_add(). | |
2207 | */ | |
2208 | struct binder_task_work_cb { | |
2209 | struct callback_head twork; | |
2210 | struct file *file; | |
2211 | }; | |
2212 | ||
2213 | /** | |
2214 | * binder_do_fd_close() - close list of file descriptors | |
2215 | * @twork: callback head for task work | |
2216 | * | |
2217 | * It is not safe to call ksys_close() during the binder_ioctl() | |
2218 | * function if there is a chance that binder's own file descriptor | |
2219 | * might be closed. This is to meet the requirements for using | |
2220 | * fdget() (see comments for __fget_light()). Therefore use | |
2221 | * task_work_add() to schedule the close operation once we have | |
2222 | * returned from binder_ioctl(). This function is a callback | |
2223 | * for that mechanism and does the actual ksys_close() on the | |
2224 | * given file descriptor. | |
2225 | */ | |
2226 | static void binder_do_fd_close(struct callback_head *twork) | |
2227 | { | |
2228 | struct binder_task_work_cb *twcb = container_of(twork, | |
2229 | struct binder_task_work_cb, twork); | |
2230 | ||
2231 | fput(twcb->file); | |
2232 | kfree(twcb); | |
2233 | } | |
2234 | ||
2235 | /** | |
2236 | * binder_deferred_fd_close() - schedule a close for the given file-descriptor | |
2237 | * @fd: file-descriptor to close | |
2238 | * | |
2239 | * See comments in binder_do_fd_close(). This function is used to schedule | |
2240 | * a file-descriptor to be closed after returning from binder_ioctl(). | |
2241 | */ | |
2242 | static void binder_deferred_fd_close(int fd) | |
2243 | { | |
2244 | struct binder_task_work_cb *twcb; | |
2245 | ||
2246 | twcb = kzalloc(sizeof(*twcb), GFP_KERNEL); | |
2247 | if (!twcb) | |
2248 | return; | |
2249 | init_task_work(&twcb->twork, binder_do_fd_close); | |
2250 | __close_fd_get_file(fd, &twcb->file); | |
6e802a4b JA |
2251 | if (twcb->file) { |
2252 | filp_close(twcb->file, current->files); | |
80cd7956 | 2253 | task_work_add(current, &twcb->twork, true); |
6e802a4b | 2254 | } else { |
80cd7956 | 2255 | kfree(twcb); |
6e802a4b | 2256 | } |
80cd7956 TK |
2257 | } |
2258 | ||
355b0502 GKH |
2259 | static void binder_transaction_buffer_release(struct binder_proc *proc, |
2260 | struct binder_buffer *buffer, | |
bde4a19f TK |
2261 | binder_size_t failed_at, |
2262 | bool is_failure) | |
355b0502 | 2263 | { |
355b0502 | 2264 | int debug_id = buffer->debug_id; |
bde4a19f | 2265 | binder_size_t off_start_offset, buffer_offset, off_end_offset; |
355b0502 GKH |
2266 | |
2267 | binder_debug(BINDER_DEBUG_TRANSACTION, | |
bde4a19f | 2268 | "%d buffer release %d, size %zd-%zd, failed at %llx\n", |
355b0502 | 2269 | proc->pid, buffer->debug_id, |
bde4a19f TK |
2270 | buffer->data_size, buffer->offsets_size, |
2271 | (unsigned long long)failed_at); | |
355b0502 GKH |
2272 | |
2273 | if (buffer->target_node) | |
2274 | binder_dec_node(buffer->target_node, 1, 0); | |
2275 | ||
db6b0b81 | 2276 | off_start_offset = ALIGN(buffer->data_size, sizeof(void *)); |
bde4a19f TK |
2277 | off_end_offset = is_failure ? failed_at : |
2278 | off_start_offset + buffer->offsets_size; | |
2279 | for (buffer_offset = off_start_offset; buffer_offset < off_end_offset; | |
2280 | buffer_offset += sizeof(binder_size_t)) { | |
feba3900 | 2281 | struct binder_object_header *hdr; |
bb4a2e48 | 2282 | size_t object_size = 0; |
7a67a393 | 2283 | struct binder_object object; |
8ced0c62 | 2284 | binder_size_t object_offset; |
8ced0c62 | 2285 | |
bb4a2e48 TK |
2286 | if (!binder_alloc_copy_from_buffer(&proc->alloc, &object_offset, |
2287 | buffer, buffer_offset, | |
2288 | sizeof(object_offset))) | |
2289 | object_size = binder_get_object(proc, buffer, | |
2290 | object_offset, &object); | |
feba3900 MC |
2291 | if (object_size == 0) { |
2292 | pr_err("transaction release %d bad object at offset %lld, size %zd\n", | |
8ced0c62 | 2293 | debug_id, (u64)object_offset, buffer->data_size); |
355b0502 GKH |
2294 | continue; |
2295 | } | |
7a67a393 | 2296 | hdr = &object.hdr; |
feba3900 | 2297 | switch (hdr->type) { |
355b0502 GKH |
2298 | case BINDER_TYPE_BINDER: |
2299 | case BINDER_TYPE_WEAK_BINDER: { | |
feba3900 MC |
2300 | struct flat_binder_object *fp; |
2301 | struct binder_node *node; | |
10f62861 | 2302 | |
feba3900 MC |
2303 | fp = to_flat_binder_object(hdr); |
2304 | node = binder_get_node(proc, fp->binder); | |
355b0502 | 2305 | if (node == NULL) { |
da49889d AH |
2306 | pr_err("transaction release %d bad node %016llx\n", |
2307 | debug_id, (u64)fp->binder); | |
355b0502 GKH |
2308 | break; |
2309 | } | |
2310 | binder_debug(BINDER_DEBUG_TRANSACTION, | |
da49889d AH |
2311 | " node %d u%016llx\n", |
2312 | node->debug_id, (u64)node->ptr); | |
feba3900 MC |
2313 | binder_dec_node(node, hdr->type == BINDER_TYPE_BINDER, |
2314 | 0); | |
adc18842 | 2315 | binder_put_node(node); |
355b0502 GKH |
2316 | } break; |
2317 | case BINDER_TYPE_HANDLE: | |
2318 | case BINDER_TYPE_WEAK_HANDLE: { | |
feba3900 | 2319 | struct flat_binder_object *fp; |
372e3147 TK |
2320 | struct binder_ref_data rdata; |
2321 | int ret; | |
0a3ffab9 | 2322 | |
feba3900 | 2323 | fp = to_flat_binder_object(hdr); |
372e3147 TK |
2324 | ret = binder_dec_ref_for_handle(proc, fp->handle, |
2325 | hdr->type == BINDER_TYPE_HANDLE, &rdata); | |
2326 | ||
2327 | if (ret) { | |
2328 | pr_err("transaction release %d bad handle %d, ret = %d\n", | |
2329 | debug_id, fp->handle, ret); | |
355b0502 GKH |
2330 | break; |
2331 | } | |
2332 | binder_debug(BINDER_DEBUG_TRANSACTION, | |
372e3147 TK |
2333 | " ref %d desc %d\n", |
2334 | rdata.debug_id, rdata.desc); | |
355b0502 GKH |
2335 | } break; |
2336 | ||
feba3900 | 2337 | case BINDER_TYPE_FD: { |
44d8047f TK |
2338 | /* |
2339 | * No need to close the file here since user-space | |
2340 | * closes it for for successfully delivered | |
2341 | * transactions. For transactions that weren't | |
2342 | * delivered, the new fd was never allocated so | |
2343 | * there is no need to close and the fput on the | |
2344 | * file is done when the transaction is torn | |
2345 | * down. | |
2346 | */ | |
feba3900 | 2347 | } break; |
7980240b MC |
2348 | case BINDER_TYPE_PTR: |
2349 | /* | |
2350 | * Nothing to do here, this will get cleaned up when the | |
2351 | * transaction buffer gets freed | |
2352 | */ | |
2353 | break; | |
def95c73 MC |
2354 | case BINDER_TYPE_FDA: { |
2355 | struct binder_fd_array_object *fda; | |
2356 | struct binder_buffer_object *parent; | |
db6b0b81 | 2357 | struct binder_object ptr_object; |
bde4a19f | 2358 | binder_size_t fda_offset; |
def95c73 MC |
2359 | size_t fd_index; |
2360 | binder_size_t fd_buf_size; | |
bde4a19f | 2361 | binder_size_t num_valid; |
def95c73 | 2362 | |
44d8047f TK |
2363 | if (proc->tsk != current->group_leader) { |
2364 | /* | |
2365 | * Nothing to do if running in sender context | |
2366 | * The fd fixups have not been applied so no | |
2367 | * fds need to be closed. | |
2368 | */ | |
2369 | continue; | |
2370 | } | |
2371 | ||
bde4a19f TK |
2372 | num_valid = (buffer_offset - off_start_offset) / |
2373 | sizeof(binder_size_t); | |
def95c73 | 2374 | fda = to_binder_fd_array_object(hdr); |
db6b0b81 TK |
2375 | parent = binder_validate_ptr(proc, buffer, &ptr_object, |
2376 | fda->parent, | |
2377 | off_start_offset, | |
2378 | NULL, | |
bde4a19f | 2379 | num_valid); |
def95c73 | 2380 | if (!parent) { |
f7f84fde | 2381 | pr_err("transaction release %d bad parent offset\n", |
def95c73 MC |
2382 | debug_id); |
2383 | continue; | |
2384 | } | |
def95c73 MC |
2385 | fd_buf_size = sizeof(u32) * fda->num_fds; |
2386 | if (fda->num_fds >= SIZE_MAX / sizeof(u32)) { | |
2387 | pr_err("transaction release %d invalid number of fds (%lld)\n", | |
2388 | debug_id, (u64)fda->num_fds); | |
2389 | continue; | |
2390 | } | |
2391 | if (fd_buf_size > parent->length || | |
2392 | fda->parent_offset > parent->length - fd_buf_size) { | |
2393 | /* No space for all file descriptors here. */ | |
2394 | pr_err("transaction release %d not enough space for %lld fds in buffer\n", | |
2395 | debug_id, (u64)fda->num_fds); | |
2396 | continue; | |
2397 | } | |
bde4a19f TK |
2398 | /* |
2399 | * the source data for binder_buffer_object is visible | |
2400 | * to user-space and the @buffer element is the user | |
2401 | * pointer to the buffer_object containing the fd_array. | |
2402 | * Convert the address to an offset relative to | |
2403 | * the base of the transaction buffer. | |
2404 | */ | |
2405 | fda_offset = | |
2406 | (parent->buffer - (uintptr_t)buffer->user_data) + | |
2407 | fda->parent_offset; | |
8ced0c62 TK |
2408 | for (fd_index = 0; fd_index < fda->num_fds; |
2409 | fd_index++) { | |
2410 | u32 fd; | |
bb4a2e48 | 2411 | int err; |
bde4a19f TK |
2412 | binder_size_t offset = fda_offset + |
2413 | fd_index * sizeof(fd); | |
8ced0c62 | 2414 | |
bb4a2e48 TK |
2415 | err = binder_alloc_copy_from_buffer( |
2416 | &proc->alloc, &fd, buffer, | |
2417 | offset, sizeof(fd)); | |
2418 | WARN_ON(err); | |
2419 | if (!err) | |
2420 | binder_deferred_fd_close(fd); | |
8ced0c62 | 2421 | } |
def95c73 | 2422 | } break; |
355b0502 | 2423 | default: |
64dcfe6b | 2424 | pr_err("transaction release %d bad object type %x\n", |
feba3900 | 2425 | debug_id, hdr->type); |
355b0502 GKH |
2426 | break; |
2427 | } | |
2428 | } | |
2429 | } | |
2430 | ||
a056af42 MC |
2431 | static int binder_translate_binder(struct flat_binder_object *fp, |
2432 | struct binder_transaction *t, | |
2433 | struct binder_thread *thread) | |
2434 | { | |
2435 | struct binder_node *node; | |
a056af42 MC |
2436 | struct binder_proc *proc = thread->proc; |
2437 | struct binder_proc *target_proc = t->to_proc; | |
372e3147 | 2438 | struct binder_ref_data rdata; |
adc18842 | 2439 | int ret = 0; |
a056af42 MC |
2440 | |
2441 | node = binder_get_node(proc, fp->binder); | |
2442 | if (!node) { | |
673068ee | 2443 | node = binder_new_node(proc, fp); |
a056af42 MC |
2444 | if (!node) |
2445 | return -ENOMEM; | |
a056af42 MC |
2446 | } |
2447 | if (fp->cookie != node->cookie) { | |
2448 | binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n", | |
2449 | proc->pid, thread->pid, (u64)fp->binder, | |
2450 | node->debug_id, (u64)fp->cookie, | |
2451 | (u64)node->cookie); | |
adc18842 TK |
2452 | ret = -EINVAL; |
2453 | goto done; | |
2454 | } | |
2455 | if (security_binder_transfer_binder(proc->tsk, target_proc->tsk)) { | |
2456 | ret = -EPERM; | |
2457 | goto done; | |
a056af42 | 2458 | } |
a056af42 | 2459 | |
372e3147 TK |
2460 | ret = binder_inc_ref_for_node(target_proc, node, |
2461 | fp->hdr.type == BINDER_TYPE_BINDER, | |
2462 | &thread->todo, &rdata); | |
2463 | if (ret) | |
adc18842 | 2464 | goto done; |
a056af42 MC |
2465 | |
2466 | if (fp->hdr.type == BINDER_TYPE_BINDER) | |
2467 | fp->hdr.type = BINDER_TYPE_HANDLE; | |
2468 | else | |
2469 | fp->hdr.type = BINDER_TYPE_WEAK_HANDLE; | |
2470 | fp->binder = 0; | |
372e3147 | 2471 | fp->handle = rdata.desc; |
a056af42 | 2472 | fp->cookie = 0; |
a056af42 | 2473 | |
372e3147 | 2474 | trace_binder_transaction_node_to_ref(t, node, &rdata); |
a056af42 MC |
2475 | binder_debug(BINDER_DEBUG_TRANSACTION, |
2476 | " node %d u%016llx -> ref %d desc %d\n", | |
2477 | node->debug_id, (u64)node->ptr, | |
372e3147 | 2478 | rdata.debug_id, rdata.desc); |
adc18842 TK |
2479 | done: |
2480 | binder_put_node(node); | |
2481 | return ret; | |
a056af42 MC |
2482 | } |
2483 | ||
2484 | static int binder_translate_handle(struct flat_binder_object *fp, | |
2485 | struct binder_transaction *t, | |
2486 | struct binder_thread *thread) | |
2487 | { | |
a056af42 MC |
2488 | struct binder_proc *proc = thread->proc; |
2489 | struct binder_proc *target_proc = t->to_proc; | |
372e3147 TK |
2490 | struct binder_node *node; |
2491 | struct binder_ref_data src_rdata; | |
adc18842 | 2492 | int ret = 0; |
a056af42 | 2493 | |
372e3147 TK |
2494 | node = binder_get_node_from_ref(proc, fp->handle, |
2495 | fp->hdr.type == BINDER_TYPE_HANDLE, &src_rdata); | |
2496 | if (!node) { | |
a056af42 MC |
2497 | binder_user_error("%d:%d got transaction with invalid handle, %d\n", |
2498 | proc->pid, thread->pid, fp->handle); | |
2499 | return -EINVAL; | |
2500 | } | |
adc18842 TK |
2501 | if (security_binder_transfer_binder(proc->tsk, target_proc->tsk)) { |
2502 | ret = -EPERM; | |
2503 | goto done; | |
2504 | } | |
a056af42 | 2505 | |
673068ee | 2506 | binder_node_lock(node); |
372e3147 | 2507 | if (node->proc == target_proc) { |
a056af42 MC |
2508 | if (fp->hdr.type == BINDER_TYPE_HANDLE) |
2509 | fp->hdr.type = BINDER_TYPE_BINDER; | |
2510 | else | |
2511 | fp->hdr.type = BINDER_TYPE_WEAK_BINDER; | |
372e3147 TK |
2512 | fp->binder = node->ptr; |
2513 | fp->cookie = node->cookie; | |
673068ee TK |
2514 | if (node->proc) |
2515 | binder_inner_proc_lock(node->proc); | |
324fa64c TK |
2516 | else |
2517 | __acquire(&node->proc->inner_lock); | |
673068ee TK |
2518 | binder_inc_node_nilocked(node, |
2519 | fp->hdr.type == BINDER_TYPE_BINDER, | |
2520 | 0, NULL); | |
2521 | if (node->proc) | |
2522 | binder_inner_proc_unlock(node->proc); | |
324fa64c TK |
2523 | else |
2524 | __release(&node->proc->inner_lock); | |
372e3147 | 2525 | trace_binder_transaction_ref_to_node(t, node, &src_rdata); |
a056af42 MC |
2526 | binder_debug(BINDER_DEBUG_TRANSACTION, |
2527 | " ref %d desc %d -> node %d u%016llx\n", | |
372e3147 TK |
2528 | src_rdata.debug_id, src_rdata.desc, node->debug_id, |
2529 | (u64)node->ptr); | |
673068ee | 2530 | binder_node_unlock(node); |
a056af42 | 2531 | } else { |
372e3147 | 2532 | struct binder_ref_data dest_rdata; |
a056af42 | 2533 | |
673068ee | 2534 | binder_node_unlock(node); |
372e3147 TK |
2535 | ret = binder_inc_ref_for_node(target_proc, node, |
2536 | fp->hdr.type == BINDER_TYPE_HANDLE, | |
2537 | NULL, &dest_rdata); | |
2538 | if (ret) | |
adc18842 | 2539 | goto done; |
a056af42 MC |
2540 | |
2541 | fp->binder = 0; | |
372e3147 | 2542 | fp->handle = dest_rdata.desc; |
a056af42 | 2543 | fp->cookie = 0; |
372e3147 TK |
2544 | trace_binder_transaction_ref_to_ref(t, node, &src_rdata, |
2545 | &dest_rdata); | |
a056af42 MC |
2546 | binder_debug(BINDER_DEBUG_TRANSACTION, |
2547 | " ref %d desc %d -> ref %d desc %d (node %d)\n", | |
372e3147 TK |
2548 | src_rdata.debug_id, src_rdata.desc, |
2549 | dest_rdata.debug_id, dest_rdata.desc, | |
2550 | node->debug_id); | |
a056af42 | 2551 | } |
adc18842 TK |
2552 | done: |
2553 | binder_put_node(node); | |
2554 | return ret; | |
a056af42 MC |
2555 | } |
2556 | ||
8ced0c62 | 2557 | static int binder_translate_fd(u32 fd, binder_size_t fd_offset, |
a056af42 MC |
2558 | struct binder_transaction *t, |
2559 | struct binder_thread *thread, | |
2560 | struct binder_transaction *in_reply_to) | |
2561 | { | |
2562 | struct binder_proc *proc = thread->proc; | |
2563 | struct binder_proc *target_proc = t->to_proc; | |
44d8047f | 2564 | struct binder_txn_fd_fixup *fixup; |
a056af42 | 2565 | struct file *file; |
44d8047f | 2566 | int ret = 0; |
a056af42 MC |
2567 | bool target_allows_fd; |
2568 | ||
2569 | if (in_reply_to) | |
2570 | target_allows_fd = !!(in_reply_to->flags & TF_ACCEPT_FDS); | |
2571 | else | |
2572 | target_allows_fd = t->buffer->target_node->accept_fds; | |
2573 | if (!target_allows_fd) { | |
2574 | binder_user_error("%d:%d got %s with fd, %d, but target does not allow fds\n", | |
2575 | proc->pid, thread->pid, | |
2576 | in_reply_to ? "reply" : "transaction", | |
2577 | fd); | |
2578 | ret = -EPERM; | |
2579 | goto err_fd_not_accepted; | |
2580 | } | |
2581 | ||
2582 | file = fget(fd); | |
2583 | if (!file) { | |
2584 | binder_user_error("%d:%d got transaction with invalid fd, %d\n", | |
2585 | proc->pid, thread->pid, fd); | |
2586 | ret = -EBADF; | |
2587 | goto err_fget; | |
2588 | } | |
2589 | ret = security_binder_transfer_file(proc->tsk, target_proc->tsk, file); | |
2590 | if (ret < 0) { | |
2591 | ret = -EPERM; | |
2592 | goto err_security; | |
2593 | } | |
2594 | ||
44d8047f TK |
2595 | /* |
2596 | * Add fixup record for this transaction. The allocation | |
2597 | * of the fd in the target needs to be done from a | |
2598 | * target thread. | |
2599 | */ | |
2600 | fixup = kzalloc(sizeof(*fixup), GFP_KERNEL); | |
2601 | if (!fixup) { | |
a056af42 | 2602 | ret = -ENOMEM; |
44d8047f | 2603 | goto err_alloc; |
a056af42 | 2604 | } |
44d8047f | 2605 | fixup->file = file; |
8ced0c62 | 2606 | fixup->offset = fd_offset; |
44d8047f TK |
2607 | trace_binder_transaction_fd_send(t, fd, fixup->offset); |
2608 | list_add_tail(&fixup->fixup_entry, &t->fd_fixups); | |
a056af42 | 2609 | |
44d8047f | 2610 | return ret; |
a056af42 | 2611 | |
44d8047f | 2612 | err_alloc: |
a056af42 MC |
2613 | err_security: |
2614 | fput(file); | |
2615 | err_fget: | |
2616 | err_fd_not_accepted: | |
2617 | return ret; | |
2618 | } | |
2619 | ||
def95c73 MC |
2620 | static int binder_translate_fd_array(struct binder_fd_array_object *fda, |
2621 | struct binder_buffer_object *parent, | |
2622 | struct binder_transaction *t, | |
2623 | struct binder_thread *thread, | |
2624 | struct binder_transaction *in_reply_to) | |
2625 | { | |
44d8047f | 2626 | binder_size_t fdi, fd_buf_size; |
bde4a19f | 2627 | binder_size_t fda_offset; |
def95c73 MC |
2628 | struct binder_proc *proc = thread->proc; |
2629 | struct binder_proc *target_proc = t->to_proc; | |
2630 | ||
2631 | fd_buf_size = sizeof(u32) * fda->num_fds; | |
2632 | if (fda->num_fds >= SIZE_MAX / sizeof(u32)) { | |
2633 | binder_user_error("%d:%d got transaction with invalid number of fds (%lld)\n", | |
2634 | proc->pid, thread->pid, (u64)fda->num_fds); | |
2635 | return -EINVAL; | |
2636 | } | |
2637 | if (fd_buf_size > parent->length || | |
2638 | fda->parent_offset > parent->length - fd_buf_size) { | |
2639 | /* No space for all file descriptors here. */ | |
2640 | binder_user_error("%d:%d not enough space to store %lld fds in buffer\n", | |
2641 | proc->pid, thread->pid, (u64)fda->num_fds); | |
2642 | return -EINVAL; | |
2643 | } | |
bde4a19f TK |
2644 | /* |
2645 | * the source data for binder_buffer_object is visible | |
2646 | * to user-space and the @buffer element is the user | |
2647 | * pointer to the buffer_object containing the fd_array. | |
2648 | * Convert the address to an offset relative to | |
2649 | * the base of the transaction buffer. | |
2650 | */ | |
2651 | fda_offset = (parent->buffer - (uintptr_t)t->buffer->user_data) + | |
2652 | fda->parent_offset; | |
2653 | if (!IS_ALIGNED((unsigned long)fda_offset, sizeof(u32))) { | |
def95c73 MC |
2654 | binder_user_error("%d:%d parent offset not aligned correctly.\n", |
2655 | proc->pid, thread->pid); | |
2656 | return -EINVAL; | |
2657 | } | |
2658 | for (fdi = 0; fdi < fda->num_fds; fdi++) { | |
8ced0c62 TK |
2659 | u32 fd; |
2660 | int ret; | |
bde4a19f | 2661 | binder_size_t offset = fda_offset + fdi * sizeof(fd); |
8ced0c62 | 2662 | |
bb4a2e48 TK |
2663 | ret = binder_alloc_copy_from_buffer(&target_proc->alloc, |
2664 | &fd, t->buffer, | |
2665 | offset, sizeof(fd)); | |
2666 | if (!ret) | |
2667 | ret = binder_translate_fd(fd, offset, t, thread, | |
2668 | in_reply_to); | |
44d8047f TK |
2669 | if (ret < 0) |
2670 | return ret; | |
def95c73 MC |
2671 | } |
2672 | return 0; | |
def95c73 MC |
2673 | } |
2674 | ||
7980240b MC |
2675 | static int binder_fixup_parent(struct binder_transaction *t, |
2676 | struct binder_thread *thread, | |
2677 | struct binder_buffer_object *bp, | |
db6b0b81 | 2678 | binder_size_t off_start_offset, |
7980240b | 2679 | binder_size_t num_valid, |
db6b0b81 | 2680 | binder_size_t last_fixup_obj_off, |
7980240b MC |
2681 | binder_size_t last_fixup_min_off) |
2682 | { | |
2683 | struct binder_buffer_object *parent; | |
7980240b MC |
2684 | struct binder_buffer *b = t->buffer; |
2685 | struct binder_proc *proc = thread->proc; | |
2686 | struct binder_proc *target_proc = t->to_proc; | |
db6b0b81 TK |
2687 | struct binder_object object; |
2688 | binder_size_t buffer_offset; | |
2689 | binder_size_t parent_offset; | |
7980240b MC |
2690 | |
2691 | if (!(bp->flags & BINDER_BUFFER_FLAG_HAS_PARENT)) | |
2692 | return 0; | |
2693 | ||
db6b0b81 TK |
2694 | parent = binder_validate_ptr(target_proc, b, &object, bp->parent, |
2695 | off_start_offset, &parent_offset, | |
2696 | num_valid); | |
7980240b MC |
2697 | if (!parent) { |
2698 | binder_user_error("%d:%d got transaction with invalid parent offset or type\n", | |
2699 | proc->pid, thread->pid); | |
2700 | return -EINVAL; | |
2701 | } | |
2702 | ||
db6b0b81 TK |
2703 | if (!binder_validate_fixup(target_proc, b, off_start_offset, |
2704 | parent_offset, bp->parent_offset, | |
2705 | last_fixup_obj_off, | |
7980240b MC |
2706 | last_fixup_min_off)) { |
2707 | binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n", | |
2708 | proc->pid, thread->pid); | |
2709 | return -EINVAL; | |
2710 | } | |
2711 | ||
2712 | if (parent->length < sizeof(binder_uintptr_t) || | |
2713 | bp->parent_offset > parent->length - sizeof(binder_uintptr_t)) { | |
2714 | /* No space for a pointer here! */ | |
2715 | binder_user_error("%d:%d got transaction with invalid parent offset\n", | |
2716 | proc->pid, thread->pid); | |
2717 | return -EINVAL; | |
2718 | } | |
db6b0b81 | 2719 | buffer_offset = bp->parent_offset + |
bde4a19f | 2720 | (uintptr_t)parent->buffer - (uintptr_t)b->user_data; |
bb4a2e48 TK |
2721 | if (binder_alloc_copy_to_buffer(&target_proc->alloc, b, buffer_offset, |
2722 | &bp->buffer, sizeof(bp->buffer))) { | |
2723 | binder_user_error("%d:%d got transaction with invalid parent offset\n", | |
2724 | proc->pid, thread->pid); | |
2725 | return -EINVAL; | |
2726 | } | |
7980240b MC |
2727 | |
2728 | return 0; | |
2729 | } | |
2730 | ||
408c68b1 MC |
2731 | /** |
2732 | * binder_proc_transaction() - sends a transaction to a process and wakes it up | |
2733 | * @t: transaction to send | |
2734 | * @proc: process to send the transaction to | |
2735 | * @thread: thread in @proc to send the transaction to (may be NULL) | |
2736 | * | |
2737 | * This function queues a transaction to the specified process. It will try | |
2738 | * to find a thread in the target process to handle the transaction and | |
2739 | * wake it up. If no thread is found, the work is queued to the proc | |
2740 | * waitqueue. | |
2741 | * | |
2742 | * If the @thread parameter is not NULL, the transaction is always queued | |
2743 | * to the waitlist of that specific thread. | |
2744 | * | |
2745 | * Return: true if the transactions was successfully queued | |
2746 | * false if the target process or thread is dead | |
2747 | */ | |
2748 | static bool binder_proc_transaction(struct binder_transaction *t, | |
2749 | struct binder_proc *proc, | |
2750 | struct binder_thread *thread) | |
2751 | { | |
408c68b1 MC |
2752 | struct binder_node *node = t->buffer->target_node; |
2753 | bool oneway = !!(t->flags & TF_ONE_WAY); | |
148ade2c | 2754 | bool pending_async = false; |
408c68b1 MC |
2755 | |
2756 | BUG_ON(!node); | |
2757 | binder_node_lock(node); | |
2758 | if (oneway) { | |
2759 | BUG_ON(thread); | |
8df5b949 | 2760 | if (node->has_async_transaction) |
148ade2c | 2761 | pending_async = true; |
8df5b949 | 2762 | else |
197410ad | 2763 | node->has_async_transaction = true; |
408c68b1 MC |
2764 | } |
2765 | ||
2766 | binder_inner_proc_lock(proc); | |
2767 | ||
2768 | if (proc->is_dead || (thread && thread->is_dead)) { | |
2769 | binder_inner_proc_unlock(proc); | |
2770 | binder_node_unlock(node); | |
2771 | return false; | |
2772 | } | |
2773 | ||
148ade2c | 2774 | if (!thread && !pending_async) |
408c68b1 MC |
2775 | thread = binder_select_thread_ilocked(proc); |
2776 | ||
2777 | if (thread) | |
148ade2c MC |
2778 | binder_enqueue_thread_work_ilocked(thread, &t->work); |
2779 | else if (!pending_async) | |
2780 | binder_enqueue_work_ilocked(&t->work, &proc->todo); | |
408c68b1 | 2781 | else |
148ade2c | 2782 | binder_enqueue_work_ilocked(&t->work, &node->async_todo); |
408c68b1 | 2783 | |
148ade2c | 2784 | if (!pending_async) |
408c68b1 MC |
2785 | binder_wakeup_thread_ilocked(proc, thread, !oneway /* sync */); |
2786 | ||
2787 | binder_inner_proc_unlock(proc); | |
2788 | binder_node_unlock(node); | |
2789 | ||
2790 | return true; | |
2791 | } | |
2792 | ||
512cf465 TK |
2793 | /** |
2794 | * binder_get_node_refs_for_txn() - Get required refs on node for txn | |
2795 | * @node: struct binder_node for which to get refs | |
2796 | * @proc: returns @node->proc if valid | |
2797 | * @error: if no @proc then returns BR_DEAD_REPLY | |
2798 | * | |
2799 | * User-space normally keeps the node alive when creating a transaction | |
2800 | * since it has a reference to the target. The local strong ref keeps it | |
2801 | * alive if the sending process dies before the target process processes | |
2802 | * the transaction. If the source process is malicious or has a reference | |
2803 | * counting bug, relying on the local strong ref can fail. | |
2804 | * | |
2805 | * Since user-space can cause the local strong ref to go away, we also take | |
2806 | * a tmpref on the node to ensure it survives while we are constructing | |
2807 | * the transaction. We also need a tmpref on the proc while we are | |
2808 | * constructing the transaction, so we take that here as well. | |
2809 | * | |
2810 | * Return: The target_node with refs taken or NULL if no @node->proc is NULL. | |
2811 | * Also sets @proc if valid. If the @node->proc is NULL indicating that the | |
2812 | * target proc has died, @error is set to BR_DEAD_REPLY | |
2813 | */ | |
2814 | static struct binder_node *binder_get_node_refs_for_txn( | |
2815 | struct binder_node *node, | |
2816 | struct binder_proc **procp, | |
2817 | uint32_t *error) | |
2818 | { | |
2819 | struct binder_node *target_node = NULL; | |
2820 | ||
2821 | binder_node_inner_lock(node); | |
2822 | if (node->proc) { | |
2823 | target_node = node; | |
2824 | binder_inc_node_nilocked(node, 1, 0, NULL); | |
2825 | binder_inc_node_tmpref_ilocked(node); | |
2826 | node->proc->tmp_ref++; | |
2827 | *procp = node->proc; | |
2828 | } else | |
2829 | *error = BR_DEAD_REPLY; | |
2830 | binder_node_inner_unlock(node); | |
2831 | ||
2832 | return target_node; | |
2833 | } | |
2834 | ||
355b0502 GKH |
2835 | static void binder_transaction(struct binder_proc *proc, |
2836 | struct binder_thread *thread, | |
4bfac80a MC |
2837 | struct binder_transaction_data *tr, int reply, |
2838 | binder_size_t extra_buffers_size) | |
355b0502 | 2839 | { |
a056af42 | 2840 | int ret; |
355b0502 | 2841 | struct binder_transaction *t; |
44b73962 | 2842 | struct binder_work *w; |
355b0502 | 2843 | struct binder_work *tcomplete; |
bde4a19f TK |
2844 | binder_size_t buffer_offset = 0; |
2845 | binder_size_t off_start_offset, off_end_offset; | |
212265e5 | 2846 | binder_size_t off_min; |
bde4a19f | 2847 | binder_size_t sg_buf_offset, sg_buf_end_offset; |
7a4408c6 | 2848 | struct binder_proc *target_proc = NULL; |
355b0502 GKH |
2849 | struct binder_thread *target_thread = NULL; |
2850 | struct binder_node *target_node = NULL; | |
355b0502 GKH |
2851 | struct binder_transaction *in_reply_to = NULL; |
2852 | struct binder_transaction_log_entry *e; | |
57ada2fb TK |
2853 | uint32_t return_error = 0; |
2854 | uint32_t return_error_param = 0; | |
2855 | uint32_t return_error_line = 0; | |
db6b0b81 | 2856 | binder_size_t last_fixup_obj_off = 0; |
7980240b | 2857 | binder_size_t last_fixup_min_off = 0; |
342e5c90 | 2858 | struct binder_context *context = proc->context; |
d99c7333 | 2859 | int t_debug_id = atomic_inc_return(&binder_last_id); |
ec74136d TK |
2860 | char *secctx = NULL; |
2861 | u32 secctx_sz = 0; | |
355b0502 GKH |
2862 | |
2863 | e = binder_transaction_log_add(&binder_transaction_log); | |
d99c7333 | 2864 | e->debug_id = t_debug_id; |
355b0502 GKH |
2865 | e->call_type = reply ? 2 : !!(tr->flags & TF_ONE_WAY); |
2866 | e->from_proc = proc->pid; | |
2867 | e->from_thread = thread->pid; | |
2868 | e->target_handle = tr->target.handle; | |
2869 | e->data_size = tr->data_size; | |
2870 | e->offsets_size = tr->offsets_size; | |
51d8a7ec | 2871 | strscpy(e->context_name, proc->context->name, BINDERFS_MAX_NAME); |
355b0502 GKH |
2872 | |
2873 | if (reply) { | |
0b89d69a | 2874 | binder_inner_proc_lock(proc); |
355b0502 GKH |
2875 | in_reply_to = thread->transaction_stack; |
2876 | if (in_reply_to == NULL) { | |
0b89d69a | 2877 | binder_inner_proc_unlock(proc); |
56b468fc | 2878 | binder_user_error("%d:%d got reply transaction with no transaction stack\n", |
355b0502 GKH |
2879 | proc->pid, thread->pid); |
2880 | return_error = BR_FAILED_REPLY; | |
57ada2fb TK |
2881 | return_error_param = -EPROTO; |
2882 | return_error_line = __LINE__; | |
355b0502 GKH |
2883 | goto err_empty_call_stack; |
2884 | } | |
355b0502 | 2885 | if (in_reply_to->to_thread != thread) { |
7a4408c6 | 2886 | spin_lock(&in_reply_to->lock); |
56b468fc | 2887 | binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n", |
355b0502 GKH |
2888 | proc->pid, thread->pid, in_reply_to->debug_id, |
2889 | in_reply_to->to_proc ? | |
2890 | in_reply_to->to_proc->pid : 0, | |
2891 | in_reply_to->to_thread ? | |
2892 | in_reply_to->to_thread->pid : 0); | |
7a4408c6 | 2893 | spin_unlock(&in_reply_to->lock); |
0b89d69a | 2894 | binder_inner_proc_unlock(proc); |
355b0502 | 2895 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
2896 | return_error_param = -EPROTO; |
2897 | return_error_line = __LINE__; | |
355b0502 GKH |
2898 | in_reply_to = NULL; |
2899 | goto err_bad_call_stack; | |
2900 | } | |
2901 | thread->transaction_stack = in_reply_to->to_parent; | |
0b89d69a MC |
2902 | binder_inner_proc_unlock(proc); |
2903 | binder_set_nice(in_reply_to->saved_priority); | |
2904 | target_thread = binder_get_txn_from_and_acq_inner(in_reply_to); | |
355b0502 | 2905 | if (target_thread == NULL) { |
324fa64c TK |
2906 | /* annotation for sparse */ |
2907 | __release(&target_thread->proc->inner_lock); | |
355b0502 | 2908 | return_error = BR_DEAD_REPLY; |
57ada2fb | 2909 | return_error_line = __LINE__; |
355b0502 GKH |
2910 | goto err_dead_binder; |
2911 | } | |
2912 | if (target_thread->transaction_stack != in_reply_to) { | |
56b468fc | 2913 | binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n", |
355b0502 GKH |
2914 | proc->pid, thread->pid, |
2915 | target_thread->transaction_stack ? | |
2916 | target_thread->transaction_stack->debug_id : 0, | |
2917 | in_reply_to->debug_id); | |
0b89d69a | 2918 | binder_inner_proc_unlock(target_thread->proc); |
355b0502 | 2919 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
2920 | return_error_param = -EPROTO; |
2921 | return_error_line = __LINE__; | |
355b0502 GKH |
2922 | in_reply_to = NULL; |
2923 | target_thread = NULL; | |
2924 | goto err_dead_binder; | |
2925 | } | |
2926 | target_proc = target_thread->proc; | |
7a4408c6 | 2927 | target_proc->tmp_ref++; |
0b89d69a | 2928 | binder_inner_proc_unlock(target_thread->proc); |
355b0502 GKH |
2929 | } else { |
2930 | if (tr->target.handle) { | |
2931 | struct binder_ref *ref; | |
10f62861 | 2932 | |
eb34983b TK |
2933 | /* |
2934 | * There must already be a strong ref | |
2935 | * on this node. If so, do a strong | |
2936 | * increment on the node to ensure it | |
2937 | * stays alive until the transaction is | |
2938 | * done. | |
2939 | */ | |
2c1838dc TK |
2940 | binder_proc_lock(proc); |
2941 | ref = binder_get_ref_olocked(proc, tr->target.handle, | |
2942 | true); | |
eb34983b | 2943 | if (ref) { |
512cf465 TK |
2944 | target_node = binder_get_node_refs_for_txn( |
2945 | ref->node, &target_proc, | |
2946 | &return_error); | |
2947 | } else { | |
56b468fc | 2948 | binder_user_error("%d:%d got transaction to invalid handle\n", |
512cf465 | 2949 | proc->pid, thread->pid); |
355b0502 | 2950 | return_error = BR_FAILED_REPLY; |
355b0502 | 2951 | } |
512cf465 | 2952 | binder_proc_unlock(proc); |
355b0502 | 2953 | } else { |
c44b1231 | 2954 | mutex_lock(&context->context_mgr_node_lock); |
342e5c90 | 2955 | target_node = context->binder_context_mgr_node; |
512cf465 TK |
2956 | if (target_node) |
2957 | target_node = binder_get_node_refs_for_txn( | |
2958 | target_node, &target_proc, | |
2959 | &return_error); | |
2960 | else | |
355b0502 | 2961 | return_error = BR_DEAD_REPLY; |
c44b1231 | 2962 | mutex_unlock(&context->context_mgr_node_lock); |
49ed9694 | 2963 | if (target_node && target_proc->pid == proc->pid) { |
7aa135fc MC |
2964 | binder_user_error("%d:%d got transaction to context manager from process owning it\n", |
2965 | proc->pid, thread->pid); | |
2966 | return_error = BR_FAILED_REPLY; | |
2967 | return_error_param = -EINVAL; | |
2968 | return_error_line = __LINE__; | |
2969 | goto err_invalid_target_handle; | |
2970 | } | |
355b0502 | 2971 | } |
512cf465 TK |
2972 | if (!target_node) { |
2973 | /* | |
2974 | * return_error is set above | |
2975 | */ | |
2976 | return_error_param = -EINVAL; | |
57ada2fb | 2977 | return_error_line = __LINE__; |
355b0502 GKH |
2978 | goto err_dead_binder; |
2979 | } | |
512cf465 | 2980 | e->to_node = target_node->debug_id; |
4b836a14 JH |
2981 | if (WARN_ON(proc == target_proc)) { |
2982 | return_error = BR_FAILED_REPLY; | |
2983 | return_error_param = -EINVAL; | |
2984 | return_error_line = __LINE__; | |
2985 | goto err_invalid_target_handle; | |
2986 | } | |
79af7307 SS |
2987 | if (security_binder_transaction(proc->tsk, |
2988 | target_proc->tsk) < 0) { | |
2989 | return_error = BR_FAILED_REPLY; | |
57ada2fb TK |
2990 | return_error_param = -EPERM; |
2991 | return_error_line = __LINE__; | |
79af7307 SS |
2992 | goto err_invalid_target_handle; |
2993 | } | |
0b89d69a | 2994 | binder_inner_proc_lock(proc); |
44b73962 SY |
2995 | |
2996 | w = list_first_entry_or_null(&thread->todo, | |
2997 | struct binder_work, entry); | |
2998 | if (!(tr->flags & TF_ONE_WAY) && w && | |
2999 | w->type == BINDER_WORK_TRANSACTION) { | |
3000 | /* | |
3001 | * Do not allow new outgoing transaction from a | |
3002 | * thread that has a transaction at the head of | |
3003 | * its todo list. Only need to check the head | |
3004 | * because binder_select_thread_ilocked picks a | |
3005 | * thread from proc->waiting_threads to enqueue | |
3006 | * the transaction, and nothing is queued to the | |
3007 | * todo list while the thread is on waiting_threads. | |
3008 | */ | |
3009 | binder_user_error("%d:%d new transaction not allowed when there is a transaction on thread todo\n", | |
3010 | proc->pid, thread->pid); | |
3011 | binder_inner_proc_unlock(proc); | |
3012 | return_error = BR_FAILED_REPLY; | |
3013 | return_error_param = -EPROTO; | |
3014 | return_error_line = __LINE__; | |
3015 | goto err_bad_todo_list; | |
3016 | } | |
3017 | ||
355b0502 GKH |
3018 | if (!(tr->flags & TF_ONE_WAY) && thread->transaction_stack) { |
3019 | struct binder_transaction *tmp; | |
10f62861 | 3020 | |
355b0502 GKH |
3021 | tmp = thread->transaction_stack; |
3022 | if (tmp->to_thread != thread) { | |
7a4408c6 | 3023 | spin_lock(&tmp->lock); |
56b468fc | 3024 | binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n", |
355b0502 GKH |
3025 | proc->pid, thread->pid, tmp->debug_id, |
3026 | tmp->to_proc ? tmp->to_proc->pid : 0, | |
3027 | tmp->to_thread ? | |
3028 | tmp->to_thread->pid : 0); | |
7a4408c6 | 3029 | spin_unlock(&tmp->lock); |
0b89d69a | 3030 | binder_inner_proc_unlock(proc); |
355b0502 | 3031 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
3032 | return_error_param = -EPROTO; |
3033 | return_error_line = __LINE__; | |
355b0502 GKH |
3034 | goto err_bad_call_stack; |
3035 | } | |
3036 | while (tmp) { | |
7a4408c6 TK |
3037 | struct binder_thread *from; |
3038 | ||
3039 | spin_lock(&tmp->lock); | |
3040 | from = tmp->from; | |
3041 | if (from && from->proc == target_proc) { | |
3042 | atomic_inc(&from->tmp_ref); | |
3043 | target_thread = from; | |
3044 | spin_unlock(&tmp->lock); | |
3045 | break; | |
3046 | } | |
3047 | spin_unlock(&tmp->lock); | |
355b0502 GKH |
3048 | tmp = tmp->from_parent; |
3049 | } | |
3050 | } | |
0b89d69a | 3051 | binder_inner_proc_unlock(proc); |
355b0502 | 3052 | } |
408c68b1 | 3053 | if (target_thread) |
355b0502 | 3054 | e->to_thread = target_thread->pid; |
355b0502 GKH |
3055 | e->to_proc = target_proc->pid; |
3056 | ||
3057 | /* TODO: reuse incoming transaction for reply */ | |
3058 | t = kzalloc(sizeof(*t), GFP_KERNEL); | |
3059 | if (t == NULL) { | |
3060 | return_error = BR_FAILED_REPLY; | |
57ada2fb TK |
3061 | return_error_param = -ENOMEM; |
3062 | return_error_line = __LINE__; | |
355b0502 GKH |
3063 | goto err_alloc_t_failed; |
3064 | } | |
44d8047f | 3065 | INIT_LIST_HEAD(&t->fd_fixups); |
355b0502 | 3066 | binder_stats_created(BINDER_STAT_TRANSACTION); |
7a4408c6 | 3067 | spin_lock_init(&t->lock); |
355b0502 GKH |
3068 | |
3069 | tcomplete = kzalloc(sizeof(*tcomplete), GFP_KERNEL); | |
3070 | if (tcomplete == NULL) { | |
3071 | return_error = BR_FAILED_REPLY; | |
57ada2fb TK |
3072 | return_error_param = -ENOMEM; |
3073 | return_error_line = __LINE__; | |
355b0502 GKH |
3074 | goto err_alloc_tcomplete_failed; |
3075 | } | |
3076 | binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE); | |
3077 | ||
d99c7333 | 3078 | t->debug_id = t_debug_id; |
355b0502 GKH |
3079 | |
3080 | if (reply) | |
3081 | binder_debug(BINDER_DEBUG_TRANSACTION, | |
4bfac80a | 3082 | "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld-%lld\n", |
355b0502 GKH |
3083 | proc->pid, thread->pid, t->debug_id, |
3084 | target_proc->pid, target_thread->pid, | |
da49889d AH |
3085 | (u64)tr->data.ptr.buffer, |
3086 | (u64)tr->data.ptr.offsets, | |
4bfac80a MC |
3087 | (u64)tr->data_size, (u64)tr->offsets_size, |
3088 | (u64)extra_buffers_size); | |
355b0502 GKH |
3089 | else |
3090 | binder_debug(BINDER_DEBUG_TRANSACTION, | |
4bfac80a | 3091 | "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld-%lld\n", |
355b0502 GKH |
3092 | proc->pid, thread->pid, t->debug_id, |
3093 | target_proc->pid, target_node->debug_id, | |
da49889d AH |
3094 | (u64)tr->data.ptr.buffer, |
3095 | (u64)tr->data.ptr.offsets, | |
4bfac80a MC |
3096 | (u64)tr->data_size, (u64)tr->offsets_size, |
3097 | (u64)extra_buffers_size); | |
355b0502 GKH |
3098 | |
3099 | if (!reply && !(tr->flags & TF_ONE_WAY)) | |
3100 | t->from = thread; | |
3101 | else | |
3102 | t->from = NULL; | |
57bab7cb | 3103 | t->sender_euid = task_euid(proc->tsk); |
355b0502 GKH |
3104 | t->to_proc = target_proc; |
3105 | t->to_thread = target_thread; | |
3106 | t->code = tr->code; | |
3107 | t->flags = tr->flags; | |
3108 | t->priority = task_nice(current); | |
975a1ac9 | 3109 | |
ec74136d TK |
3110 | if (target_node && target_node->txn_security_ctx) { |
3111 | u32 secid; | |
0b050950 | 3112 | size_t added_size; |
ec74136d TK |
3113 | |
3114 | security_task_getsecid(proc->tsk, &secid); | |
3115 | ret = security_secid_to_secctx(secid, &secctx, &secctx_sz); | |
3116 | if (ret) { | |
3117 | return_error = BR_FAILED_REPLY; | |
3118 | return_error_param = ret; | |
3119 | return_error_line = __LINE__; | |
3120 | goto err_get_secctx_failed; | |
3121 | } | |
0b050950 TK |
3122 | added_size = ALIGN(secctx_sz, sizeof(u64)); |
3123 | extra_buffers_size += added_size; | |
3124 | if (extra_buffers_size < added_size) { | |
3125 | /* integer overflow of extra_buffers_size */ | |
3126 | return_error = BR_FAILED_REPLY; | |
3127 | return_error_param = EINVAL; | |
3128 | return_error_line = __LINE__; | |
3129 | goto err_bad_extra_size; | |
3130 | } | |
ec74136d TK |
3131 | } |
3132 | ||
975a1ac9 AH |
3133 | trace_binder_transaction(reply, t, target_node); |
3134 | ||
19c98724 | 3135 | t->buffer = binder_alloc_new_buf(&target_proc->alloc, tr->data_size, |
4bfac80a MC |
3136 | tr->offsets_size, extra_buffers_size, |
3137 | !reply && (t->flags & TF_ONE_WAY)); | |
57ada2fb TK |
3138 | if (IS_ERR(t->buffer)) { |
3139 | /* | |
3140 | * -ESRCH indicates VMA cleared. The target is dying. | |
3141 | */ | |
3142 | return_error_param = PTR_ERR(t->buffer); | |
3143 | return_error = return_error_param == -ESRCH ? | |
3144 | BR_DEAD_REPLY : BR_FAILED_REPLY; | |
3145 | return_error_line = __LINE__; | |
3146 | t->buffer = NULL; | |
355b0502 GKH |
3147 | goto err_binder_alloc_buf_failed; |
3148 | } | |
ec74136d | 3149 | if (secctx) { |
bb4a2e48 | 3150 | int err; |
ec74136d TK |
3151 | size_t buf_offset = ALIGN(tr->data_size, sizeof(void *)) + |
3152 | ALIGN(tr->offsets_size, sizeof(void *)) + | |
3153 | ALIGN(extra_buffers_size, sizeof(void *)) - | |
3154 | ALIGN(secctx_sz, sizeof(u64)); | |
ec74136d | 3155 | |
bde4a19f | 3156 | t->security_ctx = (uintptr_t)t->buffer->user_data + buf_offset; |
bb4a2e48 TK |
3157 | err = binder_alloc_copy_to_buffer(&target_proc->alloc, |
3158 | t->buffer, buf_offset, | |
3159 | secctx, secctx_sz); | |
3160 | if (err) { | |
3161 | t->security_ctx = 0; | |
3162 | WARN_ON(1); | |
3163 | } | |
ec74136d TK |
3164 | security_release_secctx(secctx, secctx_sz); |
3165 | secctx = NULL; | |
3166 | } | |
355b0502 GKH |
3167 | t->buffer->debug_id = t->debug_id; |
3168 | t->buffer->transaction = t; | |
3169 | t->buffer->target_node = target_node; | |
975a1ac9 | 3170 | trace_binder_transaction_alloc_buf(t->buffer); |
355b0502 | 3171 | |
1a7c3d9b TK |
3172 | if (binder_alloc_copy_user_to_buffer( |
3173 | &target_proc->alloc, | |
3174 | t->buffer, 0, | |
3175 | (const void __user *) | |
3176 | (uintptr_t)tr->data.ptr.buffer, | |
3177 | tr->data_size)) { | |
56b468fc AS |
3178 | binder_user_error("%d:%d got transaction with invalid data ptr\n", |
3179 | proc->pid, thread->pid); | |
355b0502 | 3180 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
3181 | return_error_param = -EFAULT; |
3182 | return_error_line = __LINE__; | |
355b0502 GKH |
3183 | goto err_copy_data_failed; |
3184 | } | |
1a7c3d9b TK |
3185 | if (binder_alloc_copy_user_to_buffer( |
3186 | &target_proc->alloc, | |
3187 | t->buffer, | |
3188 | ALIGN(tr->data_size, sizeof(void *)), | |
3189 | (const void __user *) | |
3190 | (uintptr_t)tr->data.ptr.offsets, | |
3191 | tr->offsets_size)) { | |
56b468fc AS |
3192 | binder_user_error("%d:%d got transaction with invalid offsets ptr\n", |
3193 | proc->pid, thread->pid); | |
355b0502 | 3194 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
3195 | return_error_param = -EFAULT; |
3196 | return_error_line = __LINE__; | |
355b0502 GKH |
3197 | goto err_copy_data_failed; |
3198 | } | |
da49889d AH |
3199 | if (!IS_ALIGNED(tr->offsets_size, sizeof(binder_size_t))) { |
3200 | binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n", | |
3201 | proc->pid, thread->pid, (u64)tr->offsets_size); | |
355b0502 | 3202 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
3203 | return_error_param = -EINVAL; |
3204 | return_error_line = __LINE__; | |
355b0502 GKH |
3205 | goto err_bad_offset; |
3206 | } | |
7980240b MC |
3207 | if (!IS_ALIGNED(extra_buffers_size, sizeof(u64))) { |
3208 | binder_user_error("%d:%d got transaction with unaligned buffers size, %lld\n", | |
3209 | proc->pid, thread->pid, | |
3210 | (u64)extra_buffers_size); | |
3211 | return_error = BR_FAILED_REPLY; | |
57ada2fb TK |
3212 | return_error_param = -EINVAL; |
3213 | return_error_line = __LINE__; | |
7980240b MC |
3214 | goto err_bad_offset; |
3215 | } | |
bde4a19f TK |
3216 | off_start_offset = ALIGN(tr->data_size, sizeof(void *)); |
3217 | buffer_offset = off_start_offset; | |
3218 | off_end_offset = off_start_offset + tr->offsets_size; | |
3219 | sg_buf_offset = ALIGN(off_end_offset, sizeof(void *)); | |
a5658706 MC |
3220 | sg_buf_end_offset = sg_buf_offset + extra_buffers_size - |
3221 | ALIGN(secctx_sz, sizeof(u64)); | |
212265e5 | 3222 | off_min = 0; |
bde4a19f TK |
3223 | for (buffer_offset = off_start_offset; buffer_offset < off_end_offset; |
3224 | buffer_offset += sizeof(binder_size_t)) { | |
feba3900 | 3225 | struct binder_object_header *hdr; |
8ced0c62 | 3226 | size_t object_size; |
7a67a393 | 3227 | struct binder_object object; |
8ced0c62 | 3228 | binder_size_t object_offset; |
8ced0c62 | 3229 | |
bb4a2e48 TK |
3230 | if (binder_alloc_copy_from_buffer(&target_proc->alloc, |
3231 | &object_offset, | |
3232 | t->buffer, | |
3233 | buffer_offset, | |
3234 | sizeof(object_offset))) { | |
3235 | return_error = BR_FAILED_REPLY; | |
3236 | return_error_param = -EINVAL; | |
3237 | return_error_line = __LINE__; | |
3238 | goto err_bad_offset; | |
3239 | } | |
7a67a393 TK |
3240 | object_size = binder_get_object(target_proc, t->buffer, |
3241 | object_offset, &object); | |
8ced0c62 | 3242 | if (object_size == 0 || object_offset < off_min) { |
feba3900 | 3243 | binder_user_error("%d:%d got transaction with invalid offset (%lld, min %lld max %lld) or object.\n", |
8ced0c62 TK |
3244 | proc->pid, thread->pid, |
3245 | (u64)object_offset, | |
212265e5 | 3246 | (u64)off_min, |
feba3900 | 3247 | (u64)t->buffer->data_size); |
355b0502 | 3248 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
3249 | return_error_param = -EINVAL; |
3250 | return_error_line = __LINE__; | |
355b0502 GKH |
3251 | goto err_bad_offset; |
3252 | } | |
feba3900 | 3253 | |
7a67a393 | 3254 | hdr = &object.hdr; |
8ced0c62 | 3255 | off_min = object_offset + object_size; |
feba3900 | 3256 | switch (hdr->type) { |
355b0502 GKH |
3257 | case BINDER_TYPE_BINDER: |
3258 | case BINDER_TYPE_WEAK_BINDER: { | |
feba3900 | 3259 | struct flat_binder_object *fp; |
10f62861 | 3260 | |
feba3900 | 3261 | fp = to_flat_binder_object(hdr); |
a056af42 | 3262 | ret = binder_translate_binder(fp, t, thread); |
bb4a2e48 TK |
3263 | |
3264 | if (ret < 0 || | |
3265 | binder_alloc_copy_to_buffer(&target_proc->alloc, | |
3266 | t->buffer, | |
3267 | object_offset, | |
3268 | fp, sizeof(*fp))) { | |
355b0502 | 3269 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
3270 | return_error_param = ret; |
3271 | return_error_line = __LINE__; | |
a056af42 | 3272 | goto err_translate_failed; |
355b0502 | 3273 | } |
355b0502 GKH |
3274 | } break; |
3275 | case BINDER_TYPE_HANDLE: | |
3276 | case BINDER_TYPE_WEAK_HANDLE: { | |
feba3900 | 3277 | struct flat_binder_object *fp; |
0a3ffab9 | 3278 | |
feba3900 | 3279 | fp = to_flat_binder_object(hdr); |
a056af42 | 3280 | ret = binder_translate_handle(fp, t, thread); |
bb4a2e48 TK |
3281 | if (ret < 0 || |
3282 | binder_alloc_copy_to_buffer(&target_proc->alloc, | |
3283 | t->buffer, | |
3284 | object_offset, | |
3285 | fp, sizeof(*fp))) { | |
79af7307 | 3286 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
3287 | return_error_param = ret; |
3288 | return_error_line = __LINE__; | |
a056af42 | 3289 | goto err_translate_failed; |
355b0502 GKH |
3290 | } |
3291 | } break; | |
3292 | ||
3293 | case BINDER_TYPE_FD: { | |
feba3900 | 3294 | struct binder_fd_object *fp = to_binder_fd_object(hdr); |
8ced0c62 TK |
3295 | binder_size_t fd_offset = object_offset + |
3296 | (uintptr_t)&fp->fd - (uintptr_t)fp; | |
3297 | int ret = binder_translate_fd(fp->fd, fd_offset, t, | |
3298 | thread, in_reply_to); | |
355b0502 | 3299 | |
bb4a2e48 TK |
3300 | fp->pad_binder = 0; |
3301 | if (ret < 0 || | |
3302 | binder_alloc_copy_to_buffer(&target_proc->alloc, | |
3303 | t->buffer, | |
3304 | object_offset, | |
3305 | fp, sizeof(*fp))) { | |
355b0502 | 3306 | return_error = BR_FAILED_REPLY; |
44d8047f | 3307 | return_error_param = ret; |
57ada2fb | 3308 | return_error_line = __LINE__; |
a056af42 | 3309 | goto err_translate_failed; |
355b0502 | 3310 | } |
355b0502 | 3311 | } break; |
def95c73 | 3312 | case BINDER_TYPE_FDA: { |
db6b0b81 TK |
3313 | struct binder_object ptr_object; |
3314 | binder_size_t parent_offset; | |
def95c73 MC |
3315 | struct binder_fd_array_object *fda = |
3316 | to_binder_fd_array_object(hdr); | |
16981742 | 3317 | size_t num_valid = (buffer_offset - off_start_offset) / |
bde4a19f | 3318 | sizeof(binder_size_t); |
def95c73 | 3319 | struct binder_buffer_object *parent = |
db6b0b81 TK |
3320 | binder_validate_ptr(target_proc, t->buffer, |
3321 | &ptr_object, fda->parent, | |
3322 | off_start_offset, | |
3323 | &parent_offset, | |
bde4a19f | 3324 | num_valid); |
def95c73 MC |
3325 | if (!parent) { |
3326 | binder_user_error("%d:%d got transaction with invalid parent offset or type\n", | |
3327 | proc->pid, thread->pid); | |
3328 | return_error = BR_FAILED_REPLY; | |
57ada2fb TK |
3329 | return_error_param = -EINVAL; |
3330 | return_error_line = __LINE__; | |
def95c73 MC |
3331 | goto err_bad_parent; |
3332 | } | |
db6b0b81 TK |
3333 | if (!binder_validate_fixup(target_proc, t->buffer, |
3334 | off_start_offset, | |
3335 | parent_offset, | |
3336 | fda->parent_offset, | |
3337 | last_fixup_obj_off, | |
def95c73 MC |
3338 | last_fixup_min_off)) { |
3339 | binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n", | |
3340 | proc->pid, thread->pid); | |
3341 | return_error = BR_FAILED_REPLY; | |
57ada2fb TK |
3342 | return_error_param = -EINVAL; |
3343 | return_error_line = __LINE__; | |
def95c73 MC |
3344 | goto err_bad_parent; |
3345 | } | |
3346 | ret = binder_translate_fd_array(fda, parent, t, thread, | |
3347 | in_reply_to); | |
3348 | if (ret < 0) { | |
3349 | return_error = BR_FAILED_REPLY; | |
57ada2fb TK |
3350 | return_error_param = ret; |
3351 | return_error_line = __LINE__; | |
def95c73 MC |
3352 | goto err_translate_failed; |
3353 | } | |
db6b0b81 | 3354 | last_fixup_obj_off = parent_offset; |
def95c73 MC |
3355 | last_fixup_min_off = |
3356 | fda->parent_offset + sizeof(u32) * fda->num_fds; | |
3357 | } break; | |
7980240b MC |
3358 | case BINDER_TYPE_PTR: { |
3359 | struct binder_buffer_object *bp = | |
3360 | to_binder_buffer_object(hdr); | |
bde4a19f TK |
3361 | size_t buf_left = sg_buf_end_offset - sg_buf_offset; |
3362 | size_t num_valid; | |
7980240b MC |
3363 | |
3364 | if (bp->length > buf_left) { | |
3365 | binder_user_error("%d:%d got transaction with too large buffer\n", | |
3366 | proc->pid, thread->pid); | |
3367 | return_error = BR_FAILED_REPLY; | |
57ada2fb TK |
3368 | return_error_param = -EINVAL; |
3369 | return_error_line = __LINE__; | |
7980240b MC |
3370 | goto err_bad_offset; |
3371 | } | |
1a7c3d9b TK |
3372 | if (binder_alloc_copy_user_to_buffer( |
3373 | &target_proc->alloc, | |
3374 | t->buffer, | |
3375 | sg_buf_offset, | |
3376 | (const void __user *) | |
3377 | (uintptr_t)bp->buffer, | |
3378 | bp->length)) { | |
7980240b MC |
3379 | binder_user_error("%d:%d got transaction with invalid offsets ptr\n", |
3380 | proc->pid, thread->pid); | |
57ada2fb | 3381 | return_error_param = -EFAULT; |
7980240b | 3382 | return_error = BR_FAILED_REPLY; |
57ada2fb | 3383 | return_error_line = __LINE__; |
7980240b MC |
3384 | goto err_copy_data_failed; |
3385 | } | |
3386 | /* Fixup buffer pointer to target proc address space */ | |
bde4a19f TK |
3387 | bp->buffer = (uintptr_t) |
3388 | t->buffer->user_data + sg_buf_offset; | |
3389 | sg_buf_offset += ALIGN(bp->length, sizeof(u64)); | |
7980240b | 3390 | |
16981742 | 3391 | num_valid = (buffer_offset - off_start_offset) / |
bde4a19f | 3392 | sizeof(binder_size_t); |
db6b0b81 TK |
3393 | ret = binder_fixup_parent(t, thread, bp, |
3394 | off_start_offset, | |
bde4a19f | 3395 | num_valid, |
db6b0b81 | 3396 | last_fixup_obj_off, |
7980240b | 3397 | last_fixup_min_off); |
bb4a2e48 TK |
3398 | if (ret < 0 || |
3399 | binder_alloc_copy_to_buffer(&target_proc->alloc, | |
3400 | t->buffer, | |
3401 | object_offset, | |
3402 | bp, sizeof(*bp))) { | |
7980240b | 3403 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
3404 | return_error_param = ret; |
3405 | return_error_line = __LINE__; | |
7980240b MC |
3406 | goto err_translate_failed; |
3407 | } | |
db6b0b81 | 3408 | last_fixup_obj_off = object_offset; |
7980240b MC |
3409 | last_fixup_min_off = 0; |
3410 | } break; | |
355b0502 | 3411 | default: |
64dcfe6b | 3412 | binder_user_error("%d:%d got transaction with invalid object type, %x\n", |
feba3900 | 3413 | proc->pid, thread->pid, hdr->type); |
355b0502 | 3414 | return_error = BR_FAILED_REPLY; |
57ada2fb TK |
3415 | return_error_param = -EINVAL; |
3416 | return_error_line = __LINE__; | |
355b0502 GKH |
3417 | goto err_bad_object_type; |
3418 | } | |
3419 | } | |
ccae6f67 | 3420 | tcomplete->type = BINDER_WORK_TRANSACTION_COMPLETE; |
673068ee | 3421 | t->work.type = BINDER_WORK_TRANSACTION; |
ccae6f67 | 3422 | |
355b0502 | 3423 | if (reply) { |
148ade2c | 3424 | binder_enqueue_thread_work(thread, tcomplete); |
0b89d69a MC |
3425 | binder_inner_proc_lock(target_proc); |
3426 | if (target_thread->is_dead) { | |
3427 | binder_inner_proc_unlock(target_proc); | |
7a4408c6 | 3428 | goto err_dead_proc_or_thread; |
0b89d69a | 3429 | } |
355b0502 | 3430 | BUG_ON(t->buffer->async_transaction != 0); |
0b89d69a | 3431 | binder_pop_transaction_ilocked(target_thread, in_reply_to); |
148ade2c | 3432 | binder_enqueue_thread_work_ilocked(target_thread, &t->work); |
0b89d69a | 3433 | binder_inner_proc_unlock(target_proc); |
408c68b1 | 3434 | wake_up_interruptible_sync(&target_thread->wait); |
b6d282ce | 3435 | binder_free_transaction(in_reply_to); |
355b0502 GKH |
3436 | } else if (!(t->flags & TF_ONE_WAY)) { |
3437 | BUG_ON(t->buffer->async_transaction != 0); | |
0b89d69a | 3438 | binder_inner_proc_lock(proc); |
148ade2c MC |
3439 | /* |
3440 | * Defer the TRANSACTION_COMPLETE, so we don't return to | |
3441 | * userspace immediately; this allows the target process to | |
3442 | * immediately start processing this transaction, reducing | |
3443 | * latency. We will then return the TRANSACTION_COMPLETE when | |
3444 | * the target replies (or there is an error). | |
3445 | */ | |
3446 | binder_enqueue_deferred_thread_work_ilocked(thread, tcomplete); | |
355b0502 GKH |
3447 | t->need_reply = 1; |
3448 | t->from_parent = thread->transaction_stack; | |
3449 | thread->transaction_stack = t; | |
0b89d69a | 3450 | binder_inner_proc_unlock(proc); |
408c68b1 | 3451 | if (!binder_proc_transaction(t, target_proc, target_thread)) { |
0b89d69a MC |
3452 | binder_inner_proc_lock(proc); |
3453 | binder_pop_transaction_ilocked(thread, t); | |
3454 | binder_inner_proc_unlock(proc); | |
7a4408c6 TK |
3455 | goto err_dead_proc_or_thread; |
3456 | } | |
355b0502 GKH |
3457 | } else { |
3458 | BUG_ON(target_node == NULL); | |
3459 | BUG_ON(t->buffer->async_transaction != 1); | |
148ade2c | 3460 | binder_enqueue_thread_work(thread, tcomplete); |
408c68b1 | 3461 | if (!binder_proc_transaction(t, target_proc, NULL)) |
7a4408c6 | 3462 | goto err_dead_proc_or_thread; |
00b40d61 | 3463 | } |
7a4408c6 TK |
3464 | if (target_thread) |
3465 | binder_thread_dec_tmpref(target_thread); | |
3466 | binder_proc_dec_tmpref(target_proc); | |
512cf465 TK |
3467 | if (target_node) |
3468 | binder_dec_node_tmpref(target_node); | |
d99c7333 TK |
3469 | /* |
3470 | * write barrier to synchronize with initialization | |
3471 | * of log entry | |
3472 | */ | |
3473 | smp_wmb(); | |
3474 | WRITE_ONCE(e->debug_id_done, t_debug_id); | |
355b0502 GKH |
3475 | return; |
3476 | ||
7a4408c6 TK |
3477 | err_dead_proc_or_thread: |
3478 | return_error = BR_DEAD_REPLY; | |
3479 | return_error_line = __LINE__; | |
d53bebdf | 3480 | binder_dequeue_work(proc, tcomplete); |
a056af42 | 3481 | err_translate_failed: |
355b0502 GKH |
3482 | err_bad_object_type: |
3483 | err_bad_offset: | |
def95c73 | 3484 | err_bad_parent: |
355b0502 | 3485 | err_copy_data_failed: |
44d8047f | 3486 | binder_free_txn_fixups(t); |
975a1ac9 | 3487 | trace_binder_transaction_failed_buffer_release(t->buffer); |
bde4a19f TK |
3488 | binder_transaction_buffer_release(target_proc, t->buffer, |
3489 | buffer_offset, true); | |
512cf465 TK |
3490 | if (target_node) |
3491 | binder_dec_node_tmpref(target_node); | |
eb34983b | 3492 | target_node = NULL; |
355b0502 | 3493 | t->buffer->transaction = NULL; |
19c98724 | 3494 | binder_alloc_free_buf(&target_proc->alloc, t->buffer); |
355b0502 | 3495 | err_binder_alloc_buf_failed: |
0b050950 | 3496 | err_bad_extra_size: |
ec74136d TK |
3497 | if (secctx) |
3498 | security_release_secctx(secctx, secctx_sz); | |
3499 | err_get_secctx_failed: | |
355b0502 GKH |
3500 | kfree(tcomplete); |
3501 | binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE); | |
3502 | err_alloc_tcomplete_failed: | |
3503 | kfree(t); | |
3504 | binder_stats_deleted(BINDER_STAT_TRANSACTION); | |
3505 | err_alloc_t_failed: | |
44b73962 | 3506 | err_bad_todo_list: |
355b0502 GKH |
3507 | err_bad_call_stack: |
3508 | err_empty_call_stack: | |
3509 | err_dead_binder: | |
3510 | err_invalid_target_handle: | |
7a4408c6 TK |
3511 | if (target_thread) |
3512 | binder_thread_dec_tmpref(target_thread); | |
3513 | if (target_proc) | |
3514 | binder_proc_dec_tmpref(target_proc); | |
512cf465 | 3515 | if (target_node) { |
eb34983b | 3516 | binder_dec_node(target_node, 1, 0); |
512cf465 TK |
3517 | binder_dec_node_tmpref(target_node); |
3518 | } | |
eb34983b | 3519 | |
355b0502 | 3520 | binder_debug(BINDER_DEBUG_FAILED_TRANSACTION, |
57ada2fb TK |
3521 | "%d:%d transaction failed %d/%d, size %lld-%lld line %d\n", |
3522 | proc->pid, thread->pid, return_error, return_error_param, | |
3523 | (u64)tr->data_size, (u64)tr->offsets_size, | |
3524 | return_error_line); | |
355b0502 GKH |
3525 | |
3526 | { | |
3527 | struct binder_transaction_log_entry *fe; | |
10f62861 | 3528 | |
57ada2fb TK |
3529 | e->return_error = return_error; |
3530 | e->return_error_param = return_error_param; | |
3531 | e->return_error_line = return_error_line; | |
355b0502 GKH |
3532 | fe = binder_transaction_log_add(&binder_transaction_log_failed); |
3533 | *fe = *e; | |
d99c7333 TK |
3534 | /* |
3535 | * write barrier to synchronize with initialization | |
3536 | * of log entry | |
3537 | */ | |
3538 | smp_wmb(); | |
3539 | WRITE_ONCE(e->debug_id_done, t_debug_id); | |
3540 | WRITE_ONCE(fe->debug_id_done, t_debug_id); | |
355b0502 GKH |
3541 | } |
3542 | ||
26549d17 | 3543 | BUG_ON(thread->return_error.cmd != BR_OK); |
355b0502 | 3544 | if (in_reply_to) { |
26549d17 | 3545 | thread->return_error.cmd = BR_TRANSACTION_COMPLETE; |
148ade2c | 3546 | binder_enqueue_thread_work(thread, &thread->return_error.work); |
355b0502 | 3547 | binder_send_failed_reply(in_reply_to, return_error); |
26549d17 TK |
3548 | } else { |
3549 | thread->return_error.cmd = return_error; | |
148ade2c | 3550 | binder_enqueue_thread_work(thread, &thread->return_error.work); |
26549d17 | 3551 | } |
355b0502 GKH |
3552 | } |
3553 | ||
44d8047f TK |
3554 | /** |
3555 | * binder_free_buf() - free the specified buffer | |
3556 | * @proc: binder proc that owns buffer | |
3557 | * @buffer: buffer to be freed | |
3558 | * | |
3559 | * If buffer for an async transaction, enqueue the next async | |
3560 | * transaction from the node. | |
3561 | * | |
3562 | * Cleanup buffer and free it. | |
3563 | */ | |
f4608ce9 | 3564 | static void |
44d8047f TK |
3565 | binder_free_buf(struct binder_proc *proc, struct binder_buffer *buffer) |
3566 | { | |
a370003c | 3567 | binder_inner_proc_lock(proc); |
44d8047f TK |
3568 | if (buffer->transaction) { |
3569 | buffer->transaction->buffer = NULL; | |
3570 | buffer->transaction = NULL; | |
3571 | } | |
a370003c | 3572 | binder_inner_proc_unlock(proc); |
44d8047f TK |
3573 | if (buffer->async_transaction && buffer->target_node) { |
3574 | struct binder_node *buf_node; | |
3575 | struct binder_work *w; | |
3576 | ||
3577 | buf_node = buffer->target_node; | |
3578 | binder_node_inner_lock(buf_node); | |
3579 | BUG_ON(!buf_node->has_async_transaction); | |
3580 | BUG_ON(buf_node->proc != proc); | |
3581 | w = binder_dequeue_work_head_ilocked( | |
3582 | &buf_node->async_todo); | |
3583 | if (!w) { | |
3584 | buf_node->has_async_transaction = false; | |
3585 | } else { | |
3586 | binder_enqueue_work_ilocked( | |
3587 | w, &proc->todo); | |
3588 | binder_wakeup_proc_ilocked(proc); | |
3589 | } | |
3590 | binder_node_inner_unlock(buf_node); | |
3591 | } | |
3592 | trace_binder_transaction_buffer_release(buffer); | |
bde4a19f | 3593 | binder_transaction_buffer_release(proc, buffer, 0, false); |
44d8047f TK |
3594 | binder_alloc_free_buf(&proc->alloc, buffer); |
3595 | } | |
3596 | ||
fb07ebc3 BP |
3597 | static int binder_thread_write(struct binder_proc *proc, |
3598 | struct binder_thread *thread, | |
da49889d AH |
3599 | binder_uintptr_t binder_buffer, size_t size, |
3600 | binder_size_t *consumed) | |
355b0502 GKH |
3601 | { |
3602 | uint32_t cmd; | |
342e5c90 | 3603 | struct binder_context *context = proc->context; |
da49889d | 3604 | void __user *buffer = (void __user *)(uintptr_t)binder_buffer; |
355b0502 GKH |
3605 | void __user *ptr = buffer + *consumed; |
3606 | void __user *end = buffer + size; | |
3607 | ||
26549d17 | 3608 | while (ptr < end && thread->return_error.cmd == BR_OK) { |
372e3147 TK |
3609 | int ret; |
3610 | ||
355b0502 GKH |
3611 | if (get_user(cmd, (uint32_t __user *)ptr)) |
3612 | return -EFAULT; | |
3613 | ptr += sizeof(uint32_t); | |
975a1ac9 | 3614 | trace_binder_command(cmd); |
355b0502 | 3615 | if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.bc)) { |
0953c797 BJS |
3616 | atomic_inc(&binder_stats.bc[_IOC_NR(cmd)]); |
3617 | atomic_inc(&proc->stats.bc[_IOC_NR(cmd)]); | |
3618 | atomic_inc(&thread->stats.bc[_IOC_NR(cmd)]); | |
355b0502 GKH |
3619 | } |
3620 | switch (cmd) { | |
3621 | case BC_INCREFS: | |
3622 | case BC_ACQUIRE: | |
3623 | case BC_RELEASE: | |
3624 | case BC_DECREFS: { | |
3625 | uint32_t target; | |
355b0502 | 3626 | const char *debug_string; |
372e3147 TK |
3627 | bool strong = cmd == BC_ACQUIRE || cmd == BC_RELEASE; |
3628 | bool increment = cmd == BC_INCREFS || cmd == BC_ACQUIRE; | |
3629 | struct binder_ref_data rdata; | |
355b0502 GKH |
3630 | |
3631 | if (get_user(target, (uint32_t __user *)ptr)) | |
3632 | return -EFAULT; | |
c44b1231 | 3633 | |
355b0502 | 3634 | ptr += sizeof(uint32_t); |
372e3147 TK |
3635 | ret = -1; |
3636 | if (increment && !target) { | |
c44b1231 | 3637 | struct binder_node *ctx_mgr_node; |
c44b1231 TK |
3638 | mutex_lock(&context->context_mgr_node_lock); |
3639 | ctx_mgr_node = context->binder_context_mgr_node; | |
4b836a14 JH |
3640 | if (ctx_mgr_node) { |
3641 | if (ctx_mgr_node->proc == proc) { | |
3642 | binder_user_error("%d:%d context manager tried to acquire desc 0\n", | |
3643 | proc->pid, thread->pid); | |
3644 | mutex_unlock(&context->context_mgr_node_lock); | |
3645 | return -EINVAL; | |
3646 | } | |
372e3147 TK |
3647 | ret = binder_inc_ref_for_node( |
3648 | proc, ctx_mgr_node, | |
3649 | strong, NULL, &rdata); | |
4b836a14 | 3650 | } |
c44b1231 TK |
3651 | mutex_unlock(&context->context_mgr_node_lock); |
3652 | } | |
372e3147 TK |
3653 | if (ret) |
3654 | ret = binder_update_ref_for_handle( | |
3655 | proc, target, increment, strong, | |
3656 | &rdata); | |
3657 | if (!ret && rdata.desc != target) { | |
3658 | binder_user_error("%d:%d tried to acquire reference to desc %d, got %d instead\n", | |
3659 | proc->pid, thread->pid, | |
3660 | target, rdata.desc); | |
355b0502 GKH |
3661 | } |
3662 | switch (cmd) { | |
3663 | case BC_INCREFS: | |
3664 | debug_string = "IncRefs"; | |
355b0502 GKH |
3665 | break; |
3666 | case BC_ACQUIRE: | |
3667 | debug_string = "Acquire"; | |
355b0502 GKH |
3668 | break; |
3669 | case BC_RELEASE: | |
3670 | debug_string = "Release"; | |
355b0502 GKH |
3671 | break; |
3672 | case BC_DECREFS: | |
3673 | default: | |
3674 | debug_string = "DecRefs"; | |
372e3147 TK |
3675 | break; |
3676 | } | |
3677 | if (ret) { | |
3678 | binder_user_error("%d:%d %s %d refcount change on invalid ref %d ret %d\n", | |
3679 | proc->pid, thread->pid, debug_string, | |
3680 | strong, target, ret); | |
355b0502 GKH |
3681 | break; |
3682 | } | |
3683 | binder_debug(BINDER_DEBUG_USER_REFS, | |
372e3147 TK |
3684 | "%d:%d %s ref %d desc %d s %d w %d\n", |
3685 | proc->pid, thread->pid, debug_string, | |
3686 | rdata.debug_id, rdata.desc, rdata.strong, | |
3687 | rdata.weak); | |
355b0502 GKH |
3688 | break; |
3689 | } | |
3690 | case BC_INCREFS_DONE: | |
3691 | case BC_ACQUIRE_DONE: { | |
da49889d AH |
3692 | binder_uintptr_t node_ptr; |
3693 | binder_uintptr_t cookie; | |
355b0502 | 3694 | struct binder_node *node; |
673068ee | 3695 | bool free_node; |
355b0502 | 3696 | |
da49889d | 3697 | if (get_user(node_ptr, (binder_uintptr_t __user *)ptr)) |
355b0502 | 3698 | return -EFAULT; |
da49889d AH |
3699 | ptr += sizeof(binder_uintptr_t); |
3700 | if (get_user(cookie, (binder_uintptr_t __user *)ptr)) | |
355b0502 | 3701 | return -EFAULT; |
da49889d | 3702 | ptr += sizeof(binder_uintptr_t); |
355b0502 GKH |
3703 | node = binder_get_node(proc, node_ptr); |
3704 | if (node == NULL) { | |
da49889d | 3705 | binder_user_error("%d:%d %s u%016llx no match\n", |
355b0502 GKH |
3706 | proc->pid, thread->pid, |
3707 | cmd == BC_INCREFS_DONE ? | |
3708 | "BC_INCREFS_DONE" : | |
3709 | "BC_ACQUIRE_DONE", | |
da49889d | 3710 | (u64)node_ptr); |
355b0502 GKH |
3711 | break; |
3712 | } | |
3713 | if (cookie != node->cookie) { | |
da49889d | 3714 | binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n", |
355b0502 GKH |
3715 | proc->pid, thread->pid, |
3716 | cmd == BC_INCREFS_DONE ? | |
3717 | "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE", | |
da49889d AH |
3718 | (u64)node_ptr, node->debug_id, |
3719 | (u64)cookie, (u64)node->cookie); | |
adc18842 | 3720 | binder_put_node(node); |
355b0502 GKH |
3721 | break; |
3722 | } | |
673068ee | 3723 | binder_node_inner_lock(node); |
355b0502 GKH |
3724 | if (cmd == BC_ACQUIRE_DONE) { |
3725 | if (node->pending_strong_ref == 0) { | |
56b468fc | 3726 | binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n", |
355b0502 GKH |
3727 | proc->pid, thread->pid, |
3728 | node->debug_id); | |
673068ee | 3729 | binder_node_inner_unlock(node); |
adc18842 | 3730 | binder_put_node(node); |
355b0502 GKH |
3731 | break; |
3732 | } | |
3733 | node->pending_strong_ref = 0; | |
3734 | } else { | |
3735 | if (node->pending_weak_ref == 0) { | |
56b468fc | 3736 | binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n", |
355b0502 GKH |
3737 | proc->pid, thread->pid, |
3738 | node->debug_id); | |
673068ee | 3739 | binder_node_inner_unlock(node); |
adc18842 | 3740 | binder_put_node(node); |
355b0502 GKH |
3741 | break; |
3742 | } | |
3743 | node->pending_weak_ref = 0; | |
3744 | } | |
673068ee TK |
3745 | free_node = binder_dec_node_nilocked(node, |
3746 | cmd == BC_ACQUIRE_DONE, 0); | |
3747 | WARN_ON(free_node); | |
355b0502 | 3748 | binder_debug(BINDER_DEBUG_USER_REFS, |
adc18842 | 3749 | "%d:%d %s node %d ls %d lw %d tr %d\n", |
355b0502 GKH |
3750 | proc->pid, thread->pid, |
3751 | cmd == BC_INCREFS_DONE ? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE", | |
adc18842 TK |
3752 | node->debug_id, node->local_strong_refs, |
3753 | node->local_weak_refs, node->tmp_refs); | |
673068ee | 3754 | binder_node_inner_unlock(node); |
adc18842 | 3755 | binder_put_node(node); |
355b0502 GKH |
3756 | break; |
3757 | } | |
3758 | case BC_ATTEMPT_ACQUIRE: | |
56b468fc | 3759 | pr_err("BC_ATTEMPT_ACQUIRE not supported\n"); |
355b0502 GKH |
3760 | return -EINVAL; |
3761 | case BC_ACQUIRE_RESULT: | |
56b468fc | 3762 | pr_err("BC_ACQUIRE_RESULT not supported\n"); |
355b0502 GKH |
3763 | return -EINVAL; |
3764 | ||
3765 | case BC_FREE_BUFFER: { | |
da49889d | 3766 | binder_uintptr_t data_ptr; |
355b0502 GKH |
3767 | struct binder_buffer *buffer; |
3768 | ||
da49889d | 3769 | if (get_user(data_ptr, (binder_uintptr_t __user *)ptr)) |
355b0502 | 3770 | return -EFAULT; |
da49889d | 3771 | ptr += sizeof(binder_uintptr_t); |
355b0502 | 3772 | |
53d311cf TK |
3773 | buffer = binder_alloc_prepare_to_free(&proc->alloc, |
3774 | data_ptr); | |
7bada55a TK |
3775 | if (IS_ERR_OR_NULL(buffer)) { |
3776 | if (PTR_ERR(buffer) == -EPERM) { | |
3777 | binder_user_error( | |
3778 | "%d:%d BC_FREE_BUFFER u%016llx matched unreturned or currently freeing buffer\n", | |
3779 | proc->pid, thread->pid, | |
3780 | (u64)data_ptr); | |
3781 | } else { | |
3782 | binder_user_error( | |
3783 | "%d:%d BC_FREE_BUFFER u%016llx no match\n", | |
3784 | proc->pid, thread->pid, | |
3785 | (u64)data_ptr); | |
3786 | } | |
355b0502 GKH |
3787 | break; |
3788 | } | |
3789 | binder_debug(BINDER_DEBUG_FREE_BUFFER, | |
da49889d AH |
3790 | "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n", |
3791 | proc->pid, thread->pid, (u64)data_ptr, | |
3792 | buffer->debug_id, | |
355b0502 | 3793 | buffer->transaction ? "active" : "finished"); |
44d8047f | 3794 | binder_free_buf(proc, buffer); |
355b0502 GKH |
3795 | break; |
3796 | } | |
3797 | ||
7980240b MC |
3798 | case BC_TRANSACTION_SG: |
3799 | case BC_REPLY_SG: { | |
3800 | struct binder_transaction_data_sg tr; | |
3801 | ||
3802 | if (copy_from_user(&tr, ptr, sizeof(tr))) | |
3803 | return -EFAULT; | |
3804 | ptr += sizeof(tr); | |
3805 | binder_transaction(proc, thread, &tr.transaction_data, | |
3806 | cmd == BC_REPLY_SG, tr.buffers_size); | |
3807 | break; | |
3808 | } | |
355b0502 GKH |
3809 | case BC_TRANSACTION: |
3810 | case BC_REPLY: { | |
3811 | struct binder_transaction_data tr; | |
3812 | ||
3813 | if (copy_from_user(&tr, ptr, sizeof(tr))) | |
3814 | return -EFAULT; | |
3815 | ptr += sizeof(tr); | |
4bfac80a MC |
3816 | binder_transaction(proc, thread, &tr, |
3817 | cmd == BC_REPLY, 0); | |
355b0502 GKH |
3818 | break; |
3819 | } | |
3820 | ||
3821 | case BC_REGISTER_LOOPER: | |
3822 | binder_debug(BINDER_DEBUG_THREADS, | |
56b468fc | 3823 | "%d:%d BC_REGISTER_LOOPER\n", |
355b0502 | 3824 | proc->pid, thread->pid); |
b3e68612 | 3825 | binder_inner_proc_lock(proc); |
355b0502 GKH |
3826 | if (thread->looper & BINDER_LOOPER_STATE_ENTERED) { |
3827 | thread->looper |= BINDER_LOOPER_STATE_INVALID; | |
56b468fc | 3828 | binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n", |
355b0502 GKH |
3829 | proc->pid, thread->pid); |
3830 | } else if (proc->requested_threads == 0) { | |
3831 | thread->looper |= BINDER_LOOPER_STATE_INVALID; | |
56b468fc | 3832 | binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n", |
355b0502 GKH |
3833 | proc->pid, thread->pid); |
3834 | } else { | |
3835 | proc->requested_threads--; | |
3836 | proc->requested_threads_started++; | |
3837 | } | |
3838 | thread->looper |= BINDER_LOOPER_STATE_REGISTERED; | |
b3e68612 | 3839 | binder_inner_proc_unlock(proc); |
355b0502 GKH |
3840 | break; |
3841 | case BC_ENTER_LOOPER: | |
3842 | binder_debug(BINDER_DEBUG_THREADS, | |
56b468fc | 3843 | "%d:%d BC_ENTER_LOOPER\n", |
355b0502 GKH |
3844 | proc->pid, thread->pid); |
3845 | if (thread->looper & BINDER_LOOPER_STATE_REGISTERED) { | |
3846 | thread->looper |= BINDER_LOOPER_STATE_INVALID; | |
56b468fc | 3847 | binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n", |
355b0502 GKH |
3848 | proc->pid, thread->pid); |
3849 | } | |
3850 | thread->looper |= BINDER_LOOPER_STATE_ENTERED; | |
3851 | break; | |
3852 | case BC_EXIT_LOOPER: | |
3853 | binder_debug(BINDER_DEBUG_THREADS, | |
56b468fc | 3854 | "%d:%d BC_EXIT_LOOPER\n", |
355b0502 GKH |
3855 | proc->pid, thread->pid); |
3856 | thread->looper |= BINDER_LOOPER_STATE_EXITED; | |
3857 | break; | |
3858 | ||
3859 | case BC_REQUEST_DEATH_NOTIFICATION: | |
3860 | case BC_CLEAR_DEATH_NOTIFICATION: { | |
3861 | uint32_t target; | |
da49889d | 3862 | binder_uintptr_t cookie; |
355b0502 | 3863 | struct binder_ref *ref; |
2c1838dc | 3864 | struct binder_ref_death *death = NULL; |
355b0502 GKH |
3865 | |
3866 | if (get_user(target, (uint32_t __user *)ptr)) | |
3867 | return -EFAULT; | |
3868 | ptr += sizeof(uint32_t); | |
da49889d | 3869 | if (get_user(cookie, (binder_uintptr_t __user *)ptr)) |
355b0502 | 3870 | return -EFAULT; |
da49889d | 3871 | ptr += sizeof(binder_uintptr_t); |
2c1838dc TK |
3872 | if (cmd == BC_REQUEST_DEATH_NOTIFICATION) { |
3873 | /* | |
3874 | * Allocate memory for death notification | |
3875 | * before taking lock | |
3876 | */ | |
3877 | death = kzalloc(sizeof(*death), GFP_KERNEL); | |
3878 | if (death == NULL) { | |
3879 | WARN_ON(thread->return_error.cmd != | |
3880 | BR_OK); | |
3881 | thread->return_error.cmd = BR_ERROR; | |
148ade2c MC |
3882 | binder_enqueue_thread_work( |
3883 | thread, | |
3884 | &thread->return_error.work); | |
2c1838dc TK |
3885 | binder_debug( |
3886 | BINDER_DEBUG_FAILED_TRANSACTION, | |
3887 | "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n", | |
3888 | proc->pid, thread->pid); | |
3889 | break; | |
3890 | } | |
3891 | } | |
3892 | binder_proc_lock(proc); | |
3893 | ref = binder_get_ref_olocked(proc, target, false); | |
355b0502 | 3894 | if (ref == NULL) { |
56b468fc | 3895 | binder_user_error("%d:%d %s invalid ref %d\n", |
355b0502 GKH |
3896 | proc->pid, thread->pid, |
3897 | cmd == BC_REQUEST_DEATH_NOTIFICATION ? | |
3898 | "BC_REQUEST_DEATH_NOTIFICATION" : | |
3899 | "BC_CLEAR_DEATH_NOTIFICATION", | |
3900 | target); | |
2c1838dc TK |
3901 | binder_proc_unlock(proc); |
3902 | kfree(death); | |
355b0502 GKH |
3903 | break; |
3904 | } | |
3905 | ||
3906 | binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION, | |
da49889d | 3907 | "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n", |
355b0502 GKH |
3908 | proc->pid, thread->pid, |
3909 | cmd == BC_REQUEST_DEATH_NOTIFICATION ? | |
3910 | "BC_REQUEST_DEATH_NOTIFICATION" : | |
3911 | "BC_CLEAR_DEATH_NOTIFICATION", | |
372e3147 TK |
3912 | (u64)cookie, ref->data.debug_id, |
3913 | ref->data.desc, ref->data.strong, | |
3914 | ref->data.weak, ref->node->debug_id); | |
355b0502 | 3915 | |
ab51ec6b | 3916 | binder_node_lock(ref->node); |
355b0502 GKH |
3917 | if (cmd == BC_REQUEST_DEATH_NOTIFICATION) { |
3918 | if (ref->death) { | |
56b468fc | 3919 | binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n", |
355b0502 | 3920 | proc->pid, thread->pid); |
ab51ec6b | 3921 | binder_node_unlock(ref->node); |
2c1838dc TK |
3922 | binder_proc_unlock(proc); |
3923 | kfree(death); | |
355b0502 GKH |
3924 | break; |
3925 | } | |
3926 | binder_stats_created(BINDER_STAT_DEATH); | |
3927 | INIT_LIST_HEAD(&death->work.entry); | |
3928 | death->cookie = cookie; | |
3929 | ref->death = death; | |
3930 | if (ref->node->proc == NULL) { | |
3931 | ref->death->work.type = BINDER_WORK_DEAD_BINDER; | |
bb74562a MC |
3932 | |
3933 | binder_inner_proc_lock(proc); | |
3934 | binder_enqueue_work_ilocked( | |
3935 | &ref->death->work, &proc->todo); | |
3936 | binder_wakeup_proc_ilocked(proc); | |
3937 | binder_inner_proc_unlock(proc); | |
355b0502 GKH |
3938 | } |
3939 | } else { | |
3940 | if (ref->death == NULL) { | |
56b468fc | 3941 | binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n", |
355b0502 | 3942 | proc->pid, thread->pid); |
673068ee | 3943 | binder_node_unlock(ref->node); |
2c1838dc | 3944 | binder_proc_unlock(proc); |
355b0502 GKH |
3945 | break; |
3946 | } | |
3947 | death = ref->death; | |
3948 | if (death->cookie != cookie) { | |
da49889d | 3949 | binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n", |
355b0502 | 3950 | proc->pid, thread->pid, |
da49889d AH |
3951 | (u64)death->cookie, |
3952 | (u64)cookie); | |
673068ee | 3953 | binder_node_unlock(ref->node); |
2c1838dc | 3954 | binder_proc_unlock(proc); |
355b0502 GKH |
3955 | break; |
3956 | } | |
3957 | ref->death = NULL; | |
72196393 | 3958 | binder_inner_proc_lock(proc); |
355b0502 GKH |
3959 | if (list_empty(&death->work.entry)) { |
3960 | death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION; | |
72196393 TK |
3961 | if (thread->looper & |
3962 | (BINDER_LOOPER_STATE_REGISTERED | | |
3963 | BINDER_LOOPER_STATE_ENTERED)) | |
148ade2c MC |
3964 | binder_enqueue_thread_work_ilocked( |
3965 | thread, | |
3966 | &death->work); | |
72196393 TK |
3967 | else { |
3968 | binder_enqueue_work_ilocked( | |
3969 | &death->work, | |
3970 | &proc->todo); | |
1b77e9dc | 3971 | binder_wakeup_proc_ilocked( |
408c68b1 | 3972 | proc); |
355b0502 GKH |
3973 | } |
3974 | } else { | |
3975 | BUG_ON(death->work.type != BINDER_WORK_DEAD_BINDER); | |
3976 | death->work.type = BINDER_WORK_DEAD_BINDER_AND_CLEAR; | |
3977 | } | |
72196393 | 3978 | binder_inner_proc_unlock(proc); |
355b0502 | 3979 | } |
ab51ec6b | 3980 | binder_node_unlock(ref->node); |
2c1838dc | 3981 | binder_proc_unlock(proc); |
355b0502 GKH |
3982 | } break; |
3983 | case BC_DEAD_BINDER_DONE: { | |
3984 | struct binder_work *w; | |
da49889d | 3985 | binder_uintptr_t cookie; |
355b0502 | 3986 | struct binder_ref_death *death = NULL; |
10f62861 | 3987 | |
da49889d | 3988 | if (get_user(cookie, (binder_uintptr_t __user *)ptr)) |
355b0502 GKH |
3989 | return -EFAULT; |
3990 | ||
7a64cd88 | 3991 | ptr += sizeof(cookie); |
72196393 TK |
3992 | binder_inner_proc_lock(proc); |
3993 | list_for_each_entry(w, &proc->delivered_death, | |
3994 | entry) { | |
3995 | struct binder_ref_death *tmp_death = | |
3996 | container_of(w, | |
3997 | struct binder_ref_death, | |
3998 | work); | |
10f62861 | 3999 | |
355b0502 GKH |
4000 | if (tmp_death->cookie == cookie) { |
4001 | death = tmp_death; | |
4002 | break; | |
4003 | } | |
4004 | } | |
4005 | binder_debug(BINDER_DEBUG_DEAD_BINDER, | |
8ca86f16 | 4006 | "%d:%d BC_DEAD_BINDER_DONE %016llx found %pK\n", |
da49889d AH |
4007 | proc->pid, thread->pid, (u64)cookie, |
4008 | death); | |
355b0502 | 4009 | if (death == NULL) { |
da49889d AH |
4010 | binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n", |
4011 | proc->pid, thread->pid, (u64)cookie); | |
72196393 | 4012 | binder_inner_proc_unlock(proc); |
355b0502 GKH |
4013 | break; |
4014 | } | |
72196393 | 4015 | binder_dequeue_work_ilocked(&death->work); |
355b0502 GKH |
4016 | if (death->work.type == BINDER_WORK_DEAD_BINDER_AND_CLEAR) { |
4017 | death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION; | |
72196393 TK |
4018 | if (thread->looper & |
4019 | (BINDER_LOOPER_STATE_REGISTERED | | |
4020 | BINDER_LOOPER_STATE_ENTERED)) | |
148ade2c MC |
4021 | binder_enqueue_thread_work_ilocked( |
4022 | thread, &death->work); | |
72196393 TK |
4023 | else { |
4024 | binder_enqueue_work_ilocked( | |
4025 | &death->work, | |
4026 | &proc->todo); | |
408c68b1 | 4027 | binder_wakeup_proc_ilocked(proc); |
355b0502 GKH |
4028 | } |
4029 | } | |
72196393 | 4030 | binder_inner_proc_unlock(proc); |
355b0502 GKH |
4031 | } break; |
4032 | ||
4033 | default: | |
56b468fc | 4034 | pr_err("%d:%d unknown command %d\n", |
355b0502 GKH |
4035 | proc->pid, thread->pid, cmd); |
4036 | return -EINVAL; | |
4037 | } | |
4038 | *consumed = ptr - buffer; | |
4039 | } | |
4040 | return 0; | |
4041 | } | |
4042 | ||
fb07ebc3 BP |
4043 | static void binder_stat_br(struct binder_proc *proc, |
4044 | struct binder_thread *thread, uint32_t cmd) | |
355b0502 | 4045 | { |
975a1ac9 | 4046 | trace_binder_return(cmd); |
355b0502 | 4047 | if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.br)) { |
0953c797 BJS |
4048 | atomic_inc(&binder_stats.br[_IOC_NR(cmd)]); |
4049 | atomic_inc(&proc->stats.br[_IOC_NR(cmd)]); | |
4050 | atomic_inc(&thread->stats.br[_IOC_NR(cmd)]); | |
355b0502 GKH |
4051 | } |
4052 | } | |
4053 | ||
26b47d8a TK |
4054 | static int binder_put_node_cmd(struct binder_proc *proc, |
4055 | struct binder_thread *thread, | |
4056 | void __user **ptrp, | |
4057 | binder_uintptr_t node_ptr, | |
4058 | binder_uintptr_t node_cookie, | |
4059 | int node_debug_id, | |
4060 | uint32_t cmd, const char *cmd_name) | |
4061 | { | |
4062 | void __user *ptr = *ptrp; | |
4063 | ||
4064 | if (put_user(cmd, (uint32_t __user *)ptr)) | |
4065 | return -EFAULT; | |
4066 | ptr += sizeof(uint32_t); | |
4067 | ||
4068 | if (put_user(node_ptr, (binder_uintptr_t __user *)ptr)) | |
4069 | return -EFAULT; | |
4070 | ptr += sizeof(binder_uintptr_t); | |
4071 | ||
4072 | if (put_user(node_cookie, (binder_uintptr_t __user *)ptr)) | |
4073 | return -EFAULT; | |
4074 | ptr += sizeof(binder_uintptr_t); | |
4075 | ||
4076 | binder_stat_br(proc, thread, cmd); | |
4077 | binder_debug(BINDER_DEBUG_USER_REFS, "%d:%d %s %d u%016llx c%016llx\n", | |
4078 | proc->pid, thread->pid, cmd_name, node_debug_id, | |
4079 | (u64)node_ptr, (u64)node_cookie); | |
4080 | ||
4081 | *ptrp = ptr; | |
4082 | return 0; | |
4083 | } | |
4084 | ||
1b77e9dc MC |
4085 | static int binder_wait_for_work(struct binder_thread *thread, |
4086 | bool do_proc_work) | |
4087 | { | |
4088 | DEFINE_WAIT(wait); | |
4089 | struct binder_proc *proc = thread->proc; | |
4090 | int ret = 0; | |
4091 | ||
4092 | freezer_do_not_count(); | |
4093 | binder_inner_proc_lock(proc); | |
4094 | for (;;) { | |
4095 | prepare_to_wait(&thread->wait, &wait, TASK_INTERRUPTIBLE); | |
4096 | if (binder_has_work_ilocked(thread, do_proc_work)) | |
4097 | break; | |
4098 | if (do_proc_work) | |
4099 | list_add(&thread->waiting_thread_node, | |
4100 | &proc->waiting_threads); | |
4101 | binder_inner_proc_unlock(proc); | |
4102 | schedule(); | |
4103 | binder_inner_proc_lock(proc); | |
4104 | list_del_init(&thread->waiting_thread_node); | |
4105 | if (signal_pending(current)) { | |
4106 | ret = -ERESTARTSYS; | |
4107 | break; | |
4108 | } | |
4109 | } | |
4110 | finish_wait(&thread->wait, &wait); | |
4111 | binder_inner_proc_unlock(proc); | |
4112 | freezer_count(); | |
4113 | ||
4114 | return ret; | |
4115 | } | |
4116 | ||
44d8047f TK |
4117 | /** |
4118 | * binder_apply_fd_fixups() - finish fd translation | |
8ced0c62 | 4119 | * @proc: binder_proc associated @t->buffer |
44d8047f TK |
4120 | * @t: binder transaction with list of fd fixups |
4121 | * | |
4122 | * Now that we are in the context of the transaction target | |
4123 | * process, we can allocate and install fds. Process the | |
4124 | * list of fds to translate and fixup the buffer with the | |
4125 | * new fds. | |
4126 | * | |
4127 | * If we fail to allocate an fd, then free the resources by | |
4128 | * fput'ing files that have not been processed and ksys_close'ing | |
4129 | * any fds that have already been allocated. | |
4130 | */ | |
8ced0c62 TK |
4131 | static int binder_apply_fd_fixups(struct binder_proc *proc, |
4132 | struct binder_transaction *t) | |
44d8047f TK |
4133 | { |
4134 | struct binder_txn_fd_fixup *fixup, *tmp; | |
4135 | int ret = 0; | |
4136 | ||
4137 | list_for_each_entry(fixup, &t->fd_fixups, fixup_entry) { | |
4138 | int fd = get_unused_fd_flags(O_CLOEXEC); | |
44d8047f TK |
4139 | |
4140 | if (fd < 0) { | |
4141 | binder_debug(BINDER_DEBUG_TRANSACTION, | |
4142 | "failed fd fixup txn %d fd %d\n", | |
4143 | t->debug_id, fd); | |
4144 | ret = -ENOMEM; | |
4145 | break; | |
4146 | } | |
4147 | binder_debug(BINDER_DEBUG_TRANSACTION, | |
4148 | "fd fixup txn %d fd %d\n", | |
4149 | t->debug_id, fd); | |
4150 | trace_binder_transaction_fd_recv(t, fd, fixup->offset); | |
4151 | fd_install(fd, fixup->file); | |
4152 | fixup->file = NULL; | |
bb4a2e48 TK |
4153 | if (binder_alloc_copy_to_buffer(&proc->alloc, t->buffer, |
4154 | fixup->offset, &fd, | |
4155 | sizeof(u32))) { | |
4156 | ret = -EINVAL; | |
4157 | break; | |
4158 | } | |
44d8047f TK |
4159 | } |
4160 | list_for_each_entry_safe(fixup, tmp, &t->fd_fixups, fixup_entry) { | |
4161 | if (fixup->file) { | |
4162 | fput(fixup->file); | |
4163 | } else if (ret) { | |
8ced0c62 | 4164 | u32 fd; |
bb4a2e48 TK |
4165 | int err; |
4166 | ||
4167 | err = binder_alloc_copy_from_buffer(&proc->alloc, &fd, | |
4168 | t->buffer, | |
4169 | fixup->offset, | |
4170 | sizeof(fd)); | |
4171 | WARN_ON(err); | |
4172 | if (!err) | |
4173 | binder_deferred_fd_close(fd); | |
44d8047f TK |
4174 | } |
4175 | list_del(&fixup->fixup_entry); | |
4176 | kfree(fixup); | |
4177 | } | |
4178 | ||
4179 | return ret; | |
4180 | } | |
4181 | ||
355b0502 GKH |
4182 | static int binder_thread_read(struct binder_proc *proc, |
4183 | struct binder_thread *thread, | |
da49889d AH |
4184 | binder_uintptr_t binder_buffer, size_t size, |
4185 | binder_size_t *consumed, int non_block) | |
355b0502 | 4186 | { |
da49889d | 4187 | void __user *buffer = (void __user *)(uintptr_t)binder_buffer; |
355b0502 GKH |
4188 | void __user *ptr = buffer + *consumed; |
4189 | void __user *end = buffer + size; | |
4190 | ||
4191 | int ret = 0; | |
4192 | int wait_for_proc_work; | |
4193 | ||
4194 | if (*consumed == 0) { | |
4195 | if (put_user(BR_NOOP, (uint32_t __user *)ptr)) | |
4196 | return -EFAULT; | |
4197 | ptr += sizeof(uint32_t); | |
4198 | } | |
4199 | ||
4200 | retry: | |
0b89d69a | 4201 | binder_inner_proc_lock(proc); |
1b77e9dc | 4202 | wait_for_proc_work = binder_available_for_proc_work_ilocked(thread); |
0b89d69a | 4203 | binder_inner_proc_unlock(proc); |
355b0502 | 4204 | |
355b0502 | 4205 | thread->looper |= BINDER_LOOPER_STATE_WAITING; |
975a1ac9 | 4206 | |
975a1ac9 AH |
4207 | trace_binder_wait_for_work(wait_for_proc_work, |
4208 | !!thread->transaction_stack, | |
72196393 | 4209 | !binder_worklist_empty(proc, &thread->todo)); |
355b0502 GKH |
4210 | if (wait_for_proc_work) { |
4211 | if (!(thread->looper & (BINDER_LOOPER_STATE_REGISTERED | | |
4212 | BINDER_LOOPER_STATE_ENTERED))) { | |
56b468fc | 4213 | binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n", |
355b0502 GKH |
4214 | proc->pid, thread->pid, thread->looper); |
4215 | wait_event_interruptible(binder_user_error_wait, | |
4216 | binder_stop_on_user_error < 2); | |
4217 | } | |
4218 | binder_set_nice(proc->default_priority); | |
1b77e9dc MC |
4219 | } |
4220 | ||
4221 | if (non_block) { | |
4222 | if (!binder_has_work(thread, wait_for_proc_work)) | |
4223 | ret = -EAGAIN; | |
355b0502 | 4224 | } else { |
1b77e9dc | 4225 | ret = binder_wait_for_work(thread, wait_for_proc_work); |
355b0502 | 4226 | } |
975a1ac9 | 4227 | |
355b0502 GKH |
4228 | thread->looper &= ~BINDER_LOOPER_STATE_WAITING; |
4229 | ||
4230 | if (ret) | |
4231 | return ret; | |
4232 | ||
4233 | while (1) { | |
4234 | uint32_t cmd; | |
ec74136d TK |
4235 | struct binder_transaction_data_secctx tr; |
4236 | struct binder_transaction_data *trd = &tr.transaction_data; | |
72196393 TK |
4237 | struct binder_work *w = NULL; |
4238 | struct list_head *list = NULL; | |
355b0502 | 4239 | struct binder_transaction *t = NULL; |
7a4408c6 | 4240 | struct binder_thread *t_from; |
ec74136d | 4241 | size_t trsize = sizeof(*trd); |
355b0502 | 4242 | |
ed29721e | 4243 | binder_inner_proc_lock(proc); |
72196393 TK |
4244 | if (!binder_worklist_empty_ilocked(&thread->todo)) |
4245 | list = &thread->todo; | |
4246 | else if (!binder_worklist_empty_ilocked(&proc->todo) && | |
4247 | wait_for_proc_work) | |
4248 | list = &proc->todo; | |
4249 | else { | |
4250 | binder_inner_proc_unlock(proc); | |
4251 | ||
395262a9 | 4252 | /* no data added */ |
08dabcee | 4253 | if (ptr - buffer == 4 && !thread->looper_need_return) |
355b0502 GKH |
4254 | goto retry; |
4255 | break; | |
4256 | } | |
4257 | ||
ed29721e TK |
4258 | if (end - ptr < sizeof(tr) + 4) { |
4259 | binder_inner_proc_unlock(proc); | |
355b0502 | 4260 | break; |
ed29721e | 4261 | } |
72196393 | 4262 | w = binder_dequeue_work_head_ilocked(list); |
148ade2c MC |
4263 | if (binder_worklist_empty_ilocked(&thread->todo)) |
4264 | thread->process_todo = false; | |
355b0502 GKH |
4265 | |
4266 | switch (w->type) { | |
4267 | case BINDER_WORK_TRANSACTION: { | |
ed29721e | 4268 | binder_inner_proc_unlock(proc); |
355b0502 GKH |
4269 | t = container_of(w, struct binder_transaction, work); |
4270 | } break; | |
26549d17 TK |
4271 | case BINDER_WORK_RETURN_ERROR: { |
4272 | struct binder_error *e = container_of( | |
4273 | w, struct binder_error, work); | |
4274 | ||
4275 | WARN_ON(e->cmd == BR_OK); | |
ed29721e | 4276 | binder_inner_proc_unlock(proc); |
26549d17 TK |
4277 | if (put_user(e->cmd, (uint32_t __user *)ptr)) |
4278 | return -EFAULT; | |
838d5565 | 4279 | cmd = e->cmd; |
26549d17 TK |
4280 | e->cmd = BR_OK; |
4281 | ptr += sizeof(uint32_t); | |
4282 | ||
838d5565 | 4283 | binder_stat_br(proc, thread, cmd); |
26549d17 | 4284 | } break; |
355b0502 | 4285 | case BINDER_WORK_TRANSACTION_COMPLETE: { |
ed29721e | 4286 | binder_inner_proc_unlock(proc); |
355b0502 | 4287 | cmd = BR_TRANSACTION_COMPLETE; |
1909a671 TK |
4288 | kfree(w); |
4289 | binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE); | |
355b0502 GKH |
4290 | if (put_user(cmd, (uint32_t __user *)ptr)) |
4291 | return -EFAULT; | |
4292 | ptr += sizeof(uint32_t); | |
4293 | ||
4294 | binder_stat_br(proc, thread, cmd); | |
4295 | binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE, | |
56b468fc | 4296 | "%d:%d BR_TRANSACTION_COMPLETE\n", |
355b0502 | 4297 | proc->pid, thread->pid); |
355b0502 GKH |
4298 | } break; |
4299 | case BINDER_WORK_NODE: { | |
4300 | struct binder_node *node = container_of(w, struct binder_node, work); | |
26b47d8a TK |
4301 | int strong, weak; |
4302 | binder_uintptr_t node_ptr = node->ptr; | |
4303 | binder_uintptr_t node_cookie = node->cookie; | |
4304 | int node_debug_id = node->debug_id; | |
4305 | int has_weak_ref; | |
4306 | int has_strong_ref; | |
4307 | void __user *orig_ptr = ptr; | |
4308 | ||
4309 | BUG_ON(proc != node->proc); | |
4310 | strong = node->internal_strong_refs || | |
4311 | node->local_strong_refs; | |
4312 | weak = !hlist_empty(&node->refs) || | |
adc18842 TK |
4313 | node->local_weak_refs || |
4314 | node->tmp_refs || strong; | |
26b47d8a TK |
4315 | has_strong_ref = node->has_strong_ref; |
4316 | has_weak_ref = node->has_weak_ref; | |
4317 | ||
4318 | if (weak && !has_weak_ref) { | |
355b0502 GKH |
4319 | node->has_weak_ref = 1; |
4320 | node->pending_weak_ref = 1; | |
4321 | node->local_weak_refs++; | |
26b47d8a TK |
4322 | } |
4323 | if (strong && !has_strong_ref) { | |
355b0502 GKH |
4324 | node->has_strong_ref = 1; |
4325 | node->pending_strong_ref = 1; | |
4326 | node->local_strong_refs++; | |
26b47d8a TK |
4327 | } |
4328 | if (!strong && has_strong_ref) | |
355b0502 | 4329 | node->has_strong_ref = 0; |
26b47d8a | 4330 | if (!weak && has_weak_ref) |
355b0502 | 4331 | node->has_weak_ref = 0; |
26b47d8a TK |
4332 | if (!weak && !strong) { |
4333 | binder_debug(BINDER_DEBUG_INTERNAL_REFS, | |
4334 | "%d:%d node %d u%016llx c%016llx deleted\n", | |
4335 | proc->pid, thread->pid, | |
4336 | node_debug_id, | |
4337 | (u64)node_ptr, | |
4338 | (u64)node_cookie); | |
4339 | rb_erase(&node->rb_node, &proc->nodes); | |
ed29721e | 4340 | binder_inner_proc_unlock(proc); |
673068ee TK |
4341 | binder_node_lock(node); |
4342 | /* | |
4343 | * Acquire the node lock before freeing the | |
4344 | * node to serialize with other threads that | |
4345 | * may have been holding the node lock while | |
4346 | * decrementing this node (avoids race where | |
4347 | * this thread frees while the other thread | |
4348 | * is unlocking the node after the final | |
4349 | * decrement) | |
4350 | */ | |
4351 | binder_node_unlock(node); | |
ed29721e TK |
4352 | binder_free_node(node); |
4353 | } else | |
4354 | binder_inner_proc_unlock(proc); | |
4355 | ||
26b47d8a TK |
4356 | if (weak && !has_weak_ref) |
4357 | ret = binder_put_node_cmd( | |
4358 | proc, thread, &ptr, node_ptr, | |
4359 | node_cookie, node_debug_id, | |
4360 | BR_INCREFS, "BR_INCREFS"); | |
4361 | if (!ret && strong && !has_strong_ref) | |
4362 | ret = binder_put_node_cmd( | |
4363 | proc, thread, &ptr, node_ptr, | |
4364 | node_cookie, node_debug_id, | |
4365 | BR_ACQUIRE, "BR_ACQUIRE"); | |
4366 | if (!ret && !strong && has_strong_ref) | |
4367 | ret = binder_put_node_cmd( | |
4368 | proc, thread, &ptr, node_ptr, | |
4369 | node_cookie, node_debug_id, | |
4370 | BR_RELEASE, "BR_RELEASE"); | |
4371 | if (!ret && !weak && has_weak_ref) | |
4372 | ret = binder_put_node_cmd( | |
4373 | proc, thread, &ptr, node_ptr, | |
4374 | node_cookie, node_debug_id, | |
4375 | BR_DECREFS, "BR_DECREFS"); | |
4376 | if (orig_ptr == ptr) | |
4377 | binder_debug(BINDER_DEBUG_INTERNAL_REFS, | |
4378 | "%d:%d node %d u%016llx c%016llx state unchanged\n", | |
4379 | proc->pid, thread->pid, | |
4380 | node_debug_id, | |
4381 | (u64)node_ptr, | |
4382 | (u64)node_cookie); | |
4383 | if (ret) | |
4384 | return ret; | |
355b0502 GKH |
4385 | } break; |
4386 | case BINDER_WORK_DEAD_BINDER: | |
4387 | case BINDER_WORK_DEAD_BINDER_AND_CLEAR: | |
4388 | case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: { | |
4389 | struct binder_ref_death *death; | |
4390 | uint32_t cmd; | |
ab51ec6b | 4391 | binder_uintptr_t cookie; |
355b0502 GKH |
4392 | |
4393 | death = container_of(w, struct binder_ref_death, work); | |
4394 | if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) | |
4395 | cmd = BR_CLEAR_DEATH_NOTIFICATION_DONE; | |
4396 | else | |
4397 | cmd = BR_DEAD_BINDER; | |
ab51ec6b MC |
4398 | cookie = death->cookie; |
4399 | ||
355b0502 | 4400 | binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION, |
da49889d | 4401 | "%d:%d %s %016llx\n", |
355b0502 GKH |
4402 | proc->pid, thread->pid, |
4403 | cmd == BR_DEAD_BINDER ? | |
4404 | "BR_DEAD_BINDER" : | |
4405 | "BR_CLEAR_DEATH_NOTIFICATION_DONE", | |
ab51ec6b | 4406 | (u64)cookie); |
355b0502 | 4407 | if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) { |
ab51ec6b | 4408 | binder_inner_proc_unlock(proc); |
355b0502 GKH |
4409 | kfree(death); |
4410 | binder_stats_deleted(BINDER_STAT_DEATH); | |
ed29721e | 4411 | } else { |
72196393 TK |
4412 | binder_enqueue_work_ilocked( |
4413 | w, &proc->delivered_death); | |
ed29721e TK |
4414 | binder_inner_proc_unlock(proc); |
4415 | } | |
ab51ec6b MC |
4416 | if (put_user(cmd, (uint32_t __user *)ptr)) |
4417 | return -EFAULT; | |
4418 | ptr += sizeof(uint32_t); | |
4419 | if (put_user(cookie, | |
4420 | (binder_uintptr_t __user *)ptr)) | |
4421 | return -EFAULT; | |
4422 | ptr += sizeof(binder_uintptr_t); | |
4423 | binder_stat_br(proc, thread, cmd); | |
355b0502 GKH |
4424 | if (cmd == BR_DEAD_BINDER) |
4425 | goto done; /* DEAD_BINDER notifications can cause transactions */ | |
4426 | } break; | |
324fa64c TK |
4427 | default: |
4428 | binder_inner_proc_unlock(proc); | |
4429 | pr_err("%d:%d: bad work type %d\n", | |
4430 | proc->pid, thread->pid, w->type); | |
4431 | break; | |
355b0502 GKH |
4432 | } |
4433 | ||
4434 | if (!t) | |
4435 | continue; | |
4436 | ||
4437 | BUG_ON(t->buffer == NULL); | |
4438 | if (t->buffer->target_node) { | |
4439 | struct binder_node *target_node = t->buffer->target_node; | |
10f62861 | 4440 | |
ec74136d TK |
4441 | trd->target.ptr = target_node->ptr; |
4442 | trd->cookie = target_node->cookie; | |
355b0502 GKH |
4443 | t->saved_priority = task_nice(current); |
4444 | if (t->priority < target_node->min_priority && | |
4445 | !(t->flags & TF_ONE_WAY)) | |
4446 | binder_set_nice(t->priority); | |
4447 | else if (!(t->flags & TF_ONE_WAY) || | |
4448 | t->saved_priority > target_node->min_priority) | |
4449 | binder_set_nice(target_node->min_priority); | |
4450 | cmd = BR_TRANSACTION; | |
4451 | } else { | |
ec74136d TK |
4452 | trd->target.ptr = 0; |
4453 | trd->cookie = 0; | |
355b0502 GKH |
4454 | cmd = BR_REPLY; |
4455 | } | |
ec74136d TK |
4456 | trd->code = t->code; |
4457 | trd->flags = t->flags; | |
4458 | trd->sender_euid = from_kuid(current_user_ns(), t->sender_euid); | |
355b0502 | 4459 | |
7a4408c6 TK |
4460 | t_from = binder_get_txn_from(t); |
4461 | if (t_from) { | |
4462 | struct task_struct *sender = t_from->proc->tsk; | |
10f62861 | 4463 | |
ec74136d TK |
4464 | trd->sender_pid = |
4465 | task_tgid_nr_ns(sender, | |
4466 | task_active_pid_ns(current)); | |
355b0502 | 4467 | } else { |
ec74136d | 4468 | trd->sender_pid = 0; |
355b0502 GKH |
4469 | } |
4470 | ||
8ced0c62 | 4471 | ret = binder_apply_fd_fixups(proc, t); |
44d8047f TK |
4472 | if (ret) { |
4473 | struct binder_buffer *buffer = t->buffer; | |
4474 | bool oneway = !!(t->flags & TF_ONE_WAY); | |
4475 | int tid = t->debug_id; | |
4476 | ||
4477 | if (t_from) | |
4478 | binder_thread_dec_tmpref(t_from); | |
4479 | buffer->transaction = NULL; | |
4480 | binder_cleanup_transaction(t, "fd fixups failed", | |
4481 | BR_FAILED_REPLY); | |
4482 | binder_free_buf(proc, buffer); | |
4483 | binder_debug(BINDER_DEBUG_FAILED_TRANSACTION, | |
4484 | "%d:%d %stransaction %d fd fixups failed %d/%d, line %d\n", | |
4485 | proc->pid, thread->pid, | |
4486 | oneway ? "async " : | |
4487 | (cmd == BR_REPLY ? "reply " : ""), | |
4488 | tid, BR_FAILED_REPLY, ret, __LINE__); | |
4489 | if (cmd == BR_REPLY) { | |
4490 | cmd = BR_FAILED_REPLY; | |
4491 | if (put_user(cmd, (uint32_t __user *)ptr)) | |
4492 | return -EFAULT; | |
4493 | ptr += sizeof(uint32_t); | |
4494 | binder_stat_br(proc, thread, cmd); | |
4495 | break; | |
4496 | } | |
4497 | continue; | |
4498 | } | |
ec74136d TK |
4499 | trd->data_size = t->buffer->data_size; |
4500 | trd->offsets_size = t->buffer->offsets_size; | |
bde4a19f | 4501 | trd->data.ptr.buffer = (uintptr_t)t->buffer->user_data; |
ec74136d | 4502 | trd->data.ptr.offsets = trd->data.ptr.buffer + |
355b0502 GKH |
4503 | ALIGN(t->buffer->data_size, |
4504 | sizeof(void *)); | |
4505 | ||
ec74136d TK |
4506 | tr.secctx = t->security_ctx; |
4507 | if (t->security_ctx) { | |
4508 | cmd = BR_TRANSACTION_SEC_CTX; | |
4509 | trsize = sizeof(tr); | |
4510 | } | |
7a4408c6 TK |
4511 | if (put_user(cmd, (uint32_t __user *)ptr)) { |
4512 | if (t_from) | |
4513 | binder_thread_dec_tmpref(t_from); | |
fb2c4452 MC |
4514 | |
4515 | binder_cleanup_transaction(t, "put_user failed", | |
4516 | BR_FAILED_REPLY); | |
4517 | ||
355b0502 | 4518 | return -EFAULT; |
7a4408c6 | 4519 | } |
355b0502 | 4520 | ptr += sizeof(uint32_t); |
ec74136d | 4521 | if (copy_to_user(ptr, &tr, trsize)) { |
7a4408c6 TK |
4522 | if (t_from) |
4523 | binder_thread_dec_tmpref(t_from); | |
fb2c4452 MC |
4524 | |
4525 | binder_cleanup_transaction(t, "copy_to_user failed", | |
4526 | BR_FAILED_REPLY); | |
4527 | ||
355b0502 | 4528 | return -EFAULT; |
7a4408c6 | 4529 | } |
ec74136d | 4530 | ptr += trsize; |
355b0502 | 4531 | |
975a1ac9 | 4532 | trace_binder_transaction_received(t); |
355b0502 GKH |
4533 | binder_stat_br(proc, thread, cmd); |
4534 | binder_debug(BINDER_DEBUG_TRANSACTION, | |
da49889d | 4535 | "%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n", |
355b0502 GKH |
4536 | proc->pid, thread->pid, |
4537 | (cmd == BR_TRANSACTION) ? "BR_TRANSACTION" : | |
ec74136d TK |
4538 | (cmd == BR_TRANSACTION_SEC_CTX) ? |
4539 | "BR_TRANSACTION_SEC_CTX" : "BR_REPLY", | |
7a4408c6 TK |
4540 | t->debug_id, t_from ? t_from->proc->pid : 0, |
4541 | t_from ? t_from->pid : 0, cmd, | |
355b0502 | 4542 | t->buffer->data_size, t->buffer->offsets_size, |
ec74136d TK |
4543 | (u64)trd->data.ptr.buffer, |
4544 | (u64)trd->data.ptr.offsets); | |
355b0502 | 4545 | |
7a4408c6 TK |
4546 | if (t_from) |
4547 | binder_thread_dec_tmpref(t_from); | |
355b0502 | 4548 | t->buffer->allow_user_free = 1; |
ec74136d | 4549 | if (cmd != BR_REPLY && !(t->flags & TF_ONE_WAY)) { |
0b89d69a | 4550 | binder_inner_proc_lock(thread->proc); |
355b0502 GKH |
4551 | t->to_parent = thread->transaction_stack; |
4552 | t->to_thread = thread; | |
4553 | thread->transaction_stack = t; | |
0b89d69a | 4554 | binder_inner_proc_unlock(thread->proc); |
355b0502 | 4555 | } else { |
b6d282ce | 4556 | binder_free_transaction(t); |
355b0502 GKH |
4557 | } |
4558 | break; | |
4559 | } | |
4560 | ||
4561 | done: | |
4562 | ||
4563 | *consumed = ptr - buffer; | |
b3e68612 | 4564 | binder_inner_proc_lock(proc); |
1b77e9dc MC |
4565 | if (proc->requested_threads == 0 && |
4566 | list_empty(&thread->proc->waiting_threads) && | |
355b0502 GKH |
4567 | proc->requested_threads_started < proc->max_threads && |
4568 | (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | | |
4569 | BINDER_LOOPER_STATE_ENTERED)) /* the user-space code fails to */ | |
4570 | /*spawn a new thread if we leave this out */) { | |
4571 | proc->requested_threads++; | |
b3e68612 | 4572 | binder_inner_proc_unlock(proc); |
355b0502 | 4573 | binder_debug(BINDER_DEBUG_THREADS, |
56b468fc | 4574 | "%d:%d BR_SPAWN_LOOPER\n", |
355b0502 GKH |
4575 | proc->pid, thread->pid); |
4576 | if (put_user(BR_SPAWN_LOOPER, (uint32_t __user *)buffer)) | |
4577 | return -EFAULT; | |
89334ab4 | 4578 | binder_stat_br(proc, thread, BR_SPAWN_LOOPER); |
b3e68612 TK |
4579 | } else |
4580 | binder_inner_proc_unlock(proc); | |
355b0502 GKH |
4581 | return 0; |
4582 | } | |
4583 | ||
72196393 TK |
4584 | static void binder_release_work(struct binder_proc *proc, |
4585 | struct list_head *list) | |
355b0502 GKH |
4586 | { |
4587 | struct binder_work *w; | |
10f62861 | 4588 | |
72196393 TK |
4589 | while (1) { |
4590 | w = binder_dequeue_work_head(proc, list); | |
4591 | if (!w) | |
4592 | return; | |
4593 | ||
355b0502 GKH |
4594 | switch (w->type) { |
4595 | case BINDER_WORK_TRANSACTION: { | |
4596 | struct binder_transaction *t; | |
4597 | ||
4598 | t = container_of(w, struct binder_transaction, work); | |
fb2c4452 MC |
4599 | |
4600 | binder_cleanup_transaction(t, "process died.", | |
4601 | BR_DEAD_REPLY); | |
355b0502 | 4602 | } break; |
26549d17 TK |
4603 | case BINDER_WORK_RETURN_ERROR: { |
4604 | struct binder_error *e = container_of( | |
4605 | w, struct binder_error, work); | |
4606 | ||
4607 | binder_debug(BINDER_DEBUG_DEAD_TRANSACTION, | |
4608 | "undelivered TRANSACTION_ERROR: %u\n", | |
4609 | e->cmd); | |
4610 | } break; | |
355b0502 | 4611 | case BINDER_WORK_TRANSACTION_COMPLETE: { |
675d66b0 | 4612 | binder_debug(BINDER_DEBUG_DEAD_TRANSACTION, |
56b468fc | 4613 | "undelivered TRANSACTION_COMPLETE\n"); |
355b0502 GKH |
4614 | kfree(w); |
4615 | binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE); | |
4616 | } break; | |
675d66b0 AH |
4617 | case BINDER_WORK_DEAD_BINDER_AND_CLEAR: |
4618 | case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: { | |
4619 | struct binder_ref_death *death; | |
4620 | ||
4621 | death = container_of(w, struct binder_ref_death, work); | |
4622 | binder_debug(BINDER_DEBUG_DEAD_TRANSACTION, | |
da49889d AH |
4623 | "undelivered death notification, %016llx\n", |
4624 | (u64)death->cookie); | |
675d66b0 AH |
4625 | kfree(death); |
4626 | binder_stats_deleted(BINDER_STAT_DEATH); | |
4627 | } break; | |
355b0502 | 4628 | default: |
56b468fc | 4629 | pr_err("unexpected work type, %d, not freed\n", |
675d66b0 | 4630 | w->type); |
355b0502 GKH |
4631 | break; |
4632 | } | |
4633 | } | |
4634 | ||
4635 | } | |
4636 | ||
7bd7b0e6 TK |
4637 | static struct binder_thread *binder_get_thread_ilocked( |
4638 | struct binder_proc *proc, struct binder_thread *new_thread) | |
355b0502 GKH |
4639 | { |
4640 | struct binder_thread *thread = NULL; | |
4641 | struct rb_node *parent = NULL; | |
4642 | struct rb_node **p = &proc->threads.rb_node; | |
4643 | ||
4644 | while (*p) { | |
4645 | parent = *p; | |
4646 | thread = rb_entry(parent, struct binder_thread, rb_node); | |
4647 | ||
4648 | if (current->pid < thread->pid) | |
4649 | p = &(*p)->rb_left; | |
4650 | else if (current->pid > thread->pid) | |
4651 | p = &(*p)->rb_right; | |
4652 | else | |
7bd7b0e6 | 4653 | return thread; |
355b0502 | 4654 | } |
7bd7b0e6 TK |
4655 | if (!new_thread) |
4656 | return NULL; | |
4657 | thread = new_thread; | |
4658 | binder_stats_created(BINDER_STAT_THREAD); | |
4659 | thread->proc = proc; | |
4660 | thread->pid = current->pid; | |
4661 | atomic_set(&thread->tmp_ref, 0); | |
4662 | init_waitqueue_head(&thread->wait); | |
4663 | INIT_LIST_HEAD(&thread->todo); | |
4664 | rb_link_node(&thread->rb_node, parent, p); | |
4665 | rb_insert_color(&thread->rb_node, &proc->threads); | |
4666 | thread->looper_need_return = true; | |
4667 | thread->return_error.work.type = BINDER_WORK_RETURN_ERROR; | |
4668 | thread->return_error.cmd = BR_OK; | |
4669 | thread->reply_error.work.type = BINDER_WORK_RETURN_ERROR; | |
4670 | thread->reply_error.cmd = BR_OK; | |
1b77e9dc | 4671 | INIT_LIST_HEAD(&new_thread->waiting_thread_node); |
7bd7b0e6 TK |
4672 | return thread; |
4673 | } | |
4674 | ||
4675 | static struct binder_thread *binder_get_thread(struct binder_proc *proc) | |
4676 | { | |
4677 | struct binder_thread *thread; | |
4678 | struct binder_thread *new_thread; | |
4679 | ||
4680 | binder_inner_proc_lock(proc); | |
4681 | thread = binder_get_thread_ilocked(proc, NULL); | |
4682 | binder_inner_proc_unlock(proc); | |
4683 | if (!thread) { | |
4684 | new_thread = kzalloc(sizeof(*thread), GFP_KERNEL); | |
4685 | if (new_thread == NULL) | |
355b0502 | 4686 | return NULL; |
7bd7b0e6 TK |
4687 | binder_inner_proc_lock(proc); |
4688 | thread = binder_get_thread_ilocked(proc, new_thread); | |
4689 | binder_inner_proc_unlock(proc); | |
4690 | if (thread != new_thread) | |
4691 | kfree(new_thread); | |
355b0502 GKH |
4692 | } |
4693 | return thread; | |
4694 | } | |
4695 | ||
7a4408c6 TK |
4696 | static void binder_free_proc(struct binder_proc *proc) |
4697 | { | |
d35d3660 TK |
4698 | struct binder_device *device; |
4699 | ||
7a4408c6 TK |
4700 | BUG_ON(!list_empty(&proc->todo)); |
4701 | BUG_ON(!list_empty(&proc->delivered_death)); | |
d35d3660 TK |
4702 | device = container_of(proc->context, struct binder_device, context); |
4703 | if (refcount_dec_and_test(&device->ref)) { | |
4704 | kfree(proc->context->name); | |
4705 | kfree(device); | |
4706 | } | |
7a4408c6 TK |
4707 | binder_alloc_deferred_release(&proc->alloc); |
4708 | put_task_struct(proc->tsk); | |
4709 | binder_stats_deleted(BINDER_STAT_PROC); | |
4710 | kfree(proc); | |
4711 | } | |
4712 | ||
4713 | static void binder_free_thread(struct binder_thread *thread) | |
4714 | { | |
4715 | BUG_ON(!list_empty(&thread->todo)); | |
4716 | binder_stats_deleted(BINDER_STAT_THREAD); | |
4717 | binder_proc_dec_tmpref(thread->proc); | |
4718 | kfree(thread); | |
4719 | } | |
4720 | ||
4721 | static int binder_thread_release(struct binder_proc *proc, | |
4722 | struct binder_thread *thread) | |
355b0502 GKH |
4723 | { |
4724 | struct binder_transaction *t; | |
4725 | struct binder_transaction *send_reply = NULL; | |
4726 | int active_transactions = 0; | |
7a4408c6 | 4727 | struct binder_transaction *last_t = NULL; |
355b0502 | 4728 | |
7bd7b0e6 | 4729 | binder_inner_proc_lock(thread->proc); |
7a4408c6 TK |
4730 | /* |
4731 | * take a ref on the proc so it survives | |
4732 | * after we remove this thread from proc->threads. | |
4733 | * The corresponding dec is when we actually | |
4734 | * free the thread in binder_free_thread() | |
4735 | */ | |
4736 | proc->tmp_ref++; | |
4737 | /* | |
4738 | * take a ref on this thread to ensure it | |
4739 | * survives while we are releasing it | |
4740 | */ | |
4741 | atomic_inc(&thread->tmp_ref); | |
355b0502 GKH |
4742 | rb_erase(&thread->rb_node, &proc->threads); |
4743 | t = thread->transaction_stack; | |
7a4408c6 TK |
4744 | if (t) { |
4745 | spin_lock(&t->lock); | |
4746 | if (t->to_thread == thread) | |
4747 | send_reply = t; | |
324fa64c TK |
4748 | } else { |
4749 | __acquire(&t->lock); | |
7a4408c6 TK |
4750 | } |
4751 | thread->is_dead = true; | |
4752 | ||
355b0502 | 4753 | while (t) { |
7a4408c6 | 4754 | last_t = t; |
355b0502 GKH |
4755 | active_transactions++; |
4756 | binder_debug(BINDER_DEBUG_DEAD_TRANSACTION, | |
56b468fc AS |
4757 | "release %d:%d transaction %d %s, still active\n", |
4758 | proc->pid, thread->pid, | |
355b0502 GKH |
4759 | t->debug_id, |
4760 | (t->to_thread == thread) ? "in" : "out"); | |
4761 | ||
4762 | if (t->to_thread == thread) { | |
4763 | t->to_proc = NULL; | |
4764 | t->to_thread = NULL; | |
4765 | if (t->buffer) { | |
4766 | t->buffer->transaction = NULL; | |
4767 | t->buffer = NULL; | |
4768 | } | |
4769 | t = t->to_parent; | |
4770 | } else if (t->from == thread) { | |
4771 | t->from = NULL; | |
4772 | t = t->from_parent; | |
4773 | } else | |
4774 | BUG(); | |
7a4408c6 TK |
4775 | spin_unlock(&last_t->lock); |
4776 | if (t) | |
4777 | spin_lock(&t->lock); | |
324fa64c TK |
4778 | else |
4779 | __acquire(&t->lock); | |
355b0502 | 4780 | } |
324fa64c TK |
4781 | /* annotation for sparse, lock not acquired in last iteration above */ |
4782 | __release(&t->lock); | |
f5cb779b MC |
4783 | |
4784 | /* | |
4785 | * If this thread used poll, make sure we remove the waitqueue | |
4786 | * from any epoll data structures holding it with POLLFREE. | |
4787 | * waitqueue_active() is safe to use here because we're holding | |
4788 | * the inner lock. | |
4789 | */ | |
4790 | if ((thread->looper & BINDER_LOOPER_STATE_POLL) && | |
4791 | waitqueue_active(&thread->wait)) { | |
a9a08845 | 4792 | wake_up_poll(&thread->wait, EPOLLHUP | POLLFREE); |
f5cb779b MC |
4793 | } |
4794 | ||
7bd7b0e6 | 4795 | binder_inner_proc_unlock(thread->proc); |
7a4408c6 | 4796 | |
5eeb2ca0 MC |
4797 | /* |
4798 | * This is needed to avoid races between wake_up_poll() above and | |
4799 | * and ep_remove_waitqueue() called for other reasons (eg the epoll file | |
4800 | * descriptor being closed); ep_remove_waitqueue() holds an RCU read | |
4801 | * lock, so we can be sure it's done after calling synchronize_rcu(). | |
4802 | */ | |
4803 | if (thread->looper & BINDER_LOOPER_STATE_POLL) | |
4804 | synchronize_rcu(); | |
4805 | ||
355b0502 GKH |
4806 | if (send_reply) |
4807 | binder_send_failed_reply(send_reply, BR_DEAD_REPLY); | |
72196393 | 4808 | binder_release_work(proc, &thread->todo); |
7a4408c6 | 4809 | binder_thread_dec_tmpref(thread); |
355b0502 GKH |
4810 | return active_transactions; |
4811 | } | |
4812 | ||
afc9a42b | 4813 | static __poll_t binder_poll(struct file *filp, |
355b0502 GKH |
4814 | struct poll_table_struct *wait) |
4815 | { | |
4816 | struct binder_proc *proc = filp->private_data; | |
4817 | struct binder_thread *thread = NULL; | |
1b77e9dc | 4818 | bool wait_for_proc_work; |
355b0502 | 4819 | |
355b0502 | 4820 | thread = binder_get_thread(proc); |
f8898267 EB |
4821 | if (!thread) |
4822 | return POLLERR; | |
355b0502 | 4823 | |
0b89d69a | 4824 | binder_inner_proc_lock(thread->proc); |
1b77e9dc MC |
4825 | thread->looper |= BINDER_LOOPER_STATE_POLL; |
4826 | wait_for_proc_work = binder_available_for_proc_work_ilocked(thread); | |
4827 | ||
0b89d69a | 4828 | binder_inner_proc_unlock(thread->proc); |
975a1ac9 | 4829 | |
1b77e9dc MC |
4830 | poll_wait(filp, &thread->wait, wait); |
4831 | ||
66b83a4c | 4832 | if (binder_has_work(thread, wait_for_proc_work)) |
a9a08845 | 4833 | return EPOLLIN; |
1b77e9dc | 4834 | |
355b0502 GKH |
4835 | return 0; |
4836 | } | |
4837 | ||
78260ac6 TR |
4838 | static int binder_ioctl_write_read(struct file *filp, |
4839 | unsigned int cmd, unsigned long arg, | |
4840 | struct binder_thread *thread) | |
4841 | { | |
4842 | int ret = 0; | |
4843 | struct binder_proc *proc = filp->private_data; | |
4844 | unsigned int size = _IOC_SIZE(cmd); | |
4845 | void __user *ubuf = (void __user *)arg; | |
4846 | struct binder_write_read bwr; | |
4847 | ||
4848 | if (size != sizeof(struct binder_write_read)) { | |
4849 | ret = -EINVAL; | |
4850 | goto out; | |
4851 | } | |
4852 | if (copy_from_user(&bwr, ubuf, sizeof(bwr))) { | |
4853 | ret = -EFAULT; | |
4854 | goto out; | |
4855 | } | |
4856 | binder_debug(BINDER_DEBUG_READ_WRITE, | |
4857 | "%d:%d write %lld at %016llx, read %lld at %016llx\n", | |
4858 | proc->pid, thread->pid, | |
4859 | (u64)bwr.write_size, (u64)bwr.write_buffer, | |
4860 | (u64)bwr.read_size, (u64)bwr.read_buffer); | |
4861 | ||
4862 | if (bwr.write_size > 0) { | |
4863 | ret = binder_thread_write(proc, thread, | |
4864 | bwr.write_buffer, | |
4865 | bwr.write_size, | |
4866 | &bwr.write_consumed); | |
4867 | trace_binder_write_done(ret); | |
4868 | if (ret < 0) { | |
4869 | bwr.read_consumed = 0; | |
4870 | if (copy_to_user(ubuf, &bwr, sizeof(bwr))) | |
4871 | ret = -EFAULT; | |
4872 | goto out; | |
4873 | } | |
4874 | } | |
4875 | if (bwr.read_size > 0) { | |
4876 | ret = binder_thread_read(proc, thread, bwr.read_buffer, | |
4877 | bwr.read_size, | |
4878 | &bwr.read_consumed, | |
4879 | filp->f_flags & O_NONBLOCK); | |
4880 | trace_binder_read_done(ret); | |
1b77e9dc MC |
4881 | binder_inner_proc_lock(proc); |
4882 | if (!binder_worklist_empty_ilocked(&proc->todo)) | |
408c68b1 | 4883 | binder_wakeup_proc_ilocked(proc); |
1b77e9dc | 4884 | binder_inner_proc_unlock(proc); |
78260ac6 TR |
4885 | if (ret < 0) { |
4886 | if (copy_to_user(ubuf, &bwr, sizeof(bwr))) | |
4887 | ret = -EFAULT; | |
4888 | goto out; | |
4889 | } | |
4890 | } | |
4891 | binder_debug(BINDER_DEBUG_READ_WRITE, | |
4892 | "%d:%d wrote %lld of %lld, read return %lld of %lld\n", | |
4893 | proc->pid, thread->pid, | |
4894 | (u64)bwr.write_consumed, (u64)bwr.write_size, | |
4895 | (u64)bwr.read_consumed, (u64)bwr.read_size); | |
4896 | if (copy_to_user(ubuf, &bwr, sizeof(bwr))) { | |
4897 | ret = -EFAULT; | |
4898 | goto out; | |
4899 | } | |
4900 | out: | |
4901 | return ret; | |
4902 | } | |
4903 | ||
ec74136d TK |
4904 | static int binder_ioctl_set_ctx_mgr(struct file *filp, |
4905 | struct flat_binder_object *fbo) | |
78260ac6 TR |
4906 | { |
4907 | int ret = 0; | |
4908 | struct binder_proc *proc = filp->private_data; | |
342e5c90 | 4909 | struct binder_context *context = proc->context; |
c44b1231 | 4910 | struct binder_node *new_node; |
78260ac6 TR |
4911 | kuid_t curr_euid = current_euid(); |
4912 | ||
c44b1231 | 4913 | mutex_lock(&context->context_mgr_node_lock); |
342e5c90 | 4914 | if (context->binder_context_mgr_node) { |
78260ac6 TR |
4915 | pr_err("BINDER_SET_CONTEXT_MGR already set\n"); |
4916 | ret = -EBUSY; | |
4917 | goto out; | |
4918 | } | |
79af7307 SS |
4919 | ret = security_binder_set_context_mgr(proc->tsk); |
4920 | if (ret < 0) | |
4921 | goto out; | |
342e5c90 MC |
4922 | if (uid_valid(context->binder_context_mgr_uid)) { |
4923 | if (!uid_eq(context->binder_context_mgr_uid, curr_euid)) { | |
78260ac6 TR |
4924 | pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n", |
4925 | from_kuid(&init_user_ns, curr_euid), | |
4926 | from_kuid(&init_user_ns, | |
342e5c90 | 4927 | context->binder_context_mgr_uid)); |
78260ac6 TR |
4928 | ret = -EPERM; |
4929 | goto out; | |
4930 | } | |
4931 | } else { | |
342e5c90 | 4932 | context->binder_context_mgr_uid = curr_euid; |
78260ac6 | 4933 | } |
ec74136d | 4934 | new_node = binder_new_node(proc, fbo); |
c44b1231 | 4935 | if (!new_node) { |
78260ac6 TR |
4936 | ret = -ENOMEM; |
4937 | goto out; | |
4938 | } | |
673068ee | 4939 | binder_node_lock(new_node); |
c44b1231 TK |
4940 | new_node->local_weak_refs++; |
4941 | new_node->local_strong_refs++; | |
4942 | new_node->has_strong_ref = 1; | |
4943 | new_node->has_weak_ref = 1; | |
4944 | context->binder_context_mgr_node = new_node; | |
673068ee | 4945 | binder_node_unlock(new_node); |
adc18842 | 4946 | binder_put_node(new_node); |
78260ac6 | 4947 | out: |
c44b1231 | 4948 | mutex_unlock(&context->context_mgr_node_lock); |
78260ac6 TR |
4949 | return ret; |
4950 | } | |
4951 | ||
b7e6a896 MC |
4952 | static int binder_ioctl_get_node_info_for_ref(struct binder_proc *proc, |
4953 | struct binder_node_info_for_ref *info) | |
4954 | { | |
4955 | struct binder_node *node; | |
4956 | struct binder_context *context = proc->context; | |
4957 | __u32 handle = info->handle; | |
4958 | ||
4959 | if (info->strong_count || info->weak_count || info->reserved1 || | |
4960 | info->reserved2 || info->reserved3) { | |
4961 | binder_user_error("%d BINDER_GET_NODE_INFO_FOR_REF: only handle may be non-zero.", | |
4962 | proc->pid); | |
4963 | return -EINVAL; | |
4964 | } | |
4965 | ||
4966 | /* This ioctl may only be used by the context manager */ | |
4967 | mutex_lock(&context->context_mgr_node_lock); | |
4968 | if (!context->binder_context_mgr_node || | |
4969 | context->binder_context_mgr_node->proc != proc) { | |
4970 | mutex_unlock(&context->context_mgr_node_lock); | |
4971 | return -EPERM; | |
4972 | } | |
4973 | mutex_unlock(&context->context_mgr_node_lock); | |
4974 | ||
4975 | node = binder_get_node_from_ref(proc, handle, true, NULL); | |
4976 | if (!node) | |
4977 | return -EINVAL; | |
4978 | ||
4979 | info->strong_count = node->local_strong_refs + | |
4980 | node->internal_strong_refs; | |
4981 | info->weak_count = node->local_weak_refs; | |
4982 | ||
4983 | binder_put_node(node); | |
4984 | ||
4985 | return 0; | |
4986 | } | |
4987 | ||
abcc6153 CC |
4988 | static int binder_ioctl_get_node_debug_info(struct binder_proc *proc, |
4989 | struct binder_node_debug_info *info) | |
4990 | { | |
4991 | struct rb_node *n; | |
4992 | binder_uintptr_t ptr = info->ptr; | |
4993 | ||
4994 | memset(info, 0, sizeof(*info)); | |
4995 | ||
4996 | binder_inner_proc_lock(proc); | |
4997 | for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) { | |
4998 | struct binder_node *node = rb_entry(n, struct binder_node, | |
4999 | rb_node); | |
5000 | if (node->ptr > ptr) { | |
5001 | info->ptr = node->ptr; | |
5002 | info->cookie = node->cookie; | |
5003 | info->has_strong_ref = node->has_strong_ref; | |
5004 | info->has_weak_ref = node->has_weak_ref; | |
5005 | break; | |
5006 | } | |
5007 | } | |
5008 | binder_inner_proc_unlock(proc); | |
5009 | ||
5010 | return 0; | |
5011 | } | |
5012 | ||
355b0502 GKH |
5013 | static long binder_ioctl(struct file *filp, unsigned int cmd, unsigned long arg) |
5014 | { | |
5015 | int ret; | |
5016 | struct binder_proc *proc = filp->private_data; | |
5017 | struct binder_thread *thread; | |
5018 | unsigned int size = _IOC_SIZE(cmd); | |
5019 | void __user *ubuf = (void __user *)arg; | |
5020 | ||
78260ac6 TR |
5021 | /*pr_info("binder_ioctl: %d:%d %x %lx\n", |
5022 | proc->pid, current->pid, cmd, arg);*/ | |
355b0502 | 5023 | |
4175e2b4 SY |
5024 | binder_selftest_alloc(&proc->alloc); |
5025 | ||
975a1ac9 AH |
5026 | trace_binder_ioctl(cmd, arg); |
5027 | ||
355b0502 GKH |
5028 | ret = wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2); |
5029 | if (ret) | |
975a1ac9 | 5030 | goto err_unlocked; |
355b0502 | 5031 | |
355b0502 GKH |
5032 | thread = binder_get_thread(proc); |
5033 | if (thread == NULL) { | |
5034 | ret = -ENOMEM; | |
5035 | goto err; | |
5036 | } | |
5037 | ||
5038 | switch (cmd) { | |
78260ac6 TR |
5039 | case BINDER_WRITE_READ: |
5040 | ret = binder_ioctl_write_read(filp, cmd, arg, thread); | |
5041 | if (ret) | |
355b0502 | 5042 | goto err; |
355b0502 | 5043 | break; |
b3e68612 TK |
5044 | case BINDER_SET_MAX_THREADS: { |
5045 | int max_threads; | |
5046 | ||
5047 | if (copy_from_user(&max_threads, ubuf, | |
5048 | sizeof(max_threads))) { | |
355b0502 GKH |
5049 | ret = -EINVAL; |
5050 | goto err; | |
5051 | } | |
b3e68612 TK |
5052 | binder_inner_proc_lock(proc); |
5053 | proc->max_threads = max_threads; | |
5054 | binder_inner_proc_unlock(proc); | |
355b0502 | 5055 | break; |
b3e68612 | 5056 | } |
ec74136d TK |
5057 | case BINDER_SET_CONTEXT_MGR_EXT: { |
5058 | struct flat_binder_object fbo; | |
5059 | ||
5060 | if (copy_from_user(&fbo, ubuf, sizeof(fbo))) { | |
5061 | ret = -EINVAL; | |
5062 | goto err; | |
5063 | } | |
5064 | ret = binder_ioctl_set_ctx_mgr(filp, &fbo); | |
5065 | if (ret) | |
5066 | goto err; | |
5067 | break; | |
5068 | } | |
355b0502 | 5069 | case BINDER_SET_CONTEXT_MGR: |
ec74136d | 5070 | ret = binder_ioctl_set_ctx_mgr(filp, NULL); |
78260ac6 | 5071 | if (ret) |
355b0502 | 5072 | goto err; |
355b0502 GKH |
5073 | break; |
5074 | case BINDER_THREAD_EXIT: | |
56b468fc | 5075 | binder_debug(BINDER_DEBUG_THREADS, "%d:%d exit\n", |
355b0502 | 5076 | proc->pid, thread->pid); |
7a4408c6 | 5077 | binder_thread_release(proc, thread); |
355b0502 GKH |
5078 | thread = NULL; |
5079 | break; | |
36c89c0a MM |
5080 | case BINDER_VERSION: { |
5081 | struct binder_version __user *ver = ubuf; | |
5082 | ||
355b0502 GKH |
5083 | if (size != sizeof(struct binder_version)) { |
5084 | ret = -EINVAL; | |
5085 | goto err; | |
5086 | } | |
36c89c0a MM |
5087 | if (put_user(BINDER_CURRENT_PROTOCOL_VERSION, |
5088 | &ver->protocol_version)) { | |
355b0502 GKH |
5089 | ret = -EINVAL; |
5090 | goto err; | |
5091 | } | |
5092 | break; | |
36c89c0a | 5093 | } |
b7e6a896 MC |
5094 | case BINDER_GET_NODE_INFO_FOR_REF: { |
5095 | struct binder_node_info_for_ref info; | |
5096 | ||
5097 | if (copy_from_user(&info, ubuf, sizeof(info))) { | |
5098 | ret = -EFAULT; | |
5099 | goto err; | |
5100 | } | |
5101 | ||
5102 | ret = binder_ioctl_get_node_info_for_ref(proc, &info); | |
5103 | if (ret < 0) | |
5104 | goto err; | |
5105 | ||
5106 | if (copy_to_user(ubuf, &info, sizeof(info))) { | |
5107 | ret = -EFAULT; | |
5108 | goto err; | |
5109 | } | |
5110 | ||
5111 | break; | |
5112 | } | |
abcc6153 CC |
5113 | case BINDER_GET_NODE_DEBUG_INFO: { |
5114 | struct binder_node_debug_info info; | |
5115 | ||
5116 | if (copy_from_user(&info, ubuf, sizeof(info))) { | |
5117 | ret = -EFAULT; | |
5118 | goto err; | |
5119 | } | |
5120 | ||
5121 | ret = binder_ioctl_get_node_debug_info(proc, &info); | |
5122 | if (ret < 0) | |
5123 | goto err; | |
5124 | ||
5125 | if (copy_to_user(ubuf, &info, sizeof(info))) { | |
5126 | ret = -EFAULT; | |
5127 | goto err; | |
5128 | } | |
5129 | break; | |
5130 | } | |
355b0502 GKH |
5131 | default: |
5132 | ret = -EINVAL; | |
5133 | goto err; | |
5134 | } | |
5135 | ret = 0; | |
5136 | err: | |
5137 | if (thread) | |
08dabcee | 5138 | thread->looper_need_return = false; |
355b0502 GKH |
5139 | wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2); |
5140 | if (ret && ret != -ERESTARTSYS) | |
56b468fc | 5141 | pr_info("%d:%d ioctl %x %lx returned %d\n", proc->pid, current->pid, cmd, arg, ret); |
975a1ac9 AH |
5142 | err_unlocked: |
5143 | trace_binder_ioctl_done(ret); | |
355b0502 GKH |
5144 | return ret; |
5145 | } | |
5146 | ||
5147 | static void binder_vma_open(struct vm_area_struct *vma) | |
5148 | { | |
5149 | struct binder_proc *proc = vma->vm_private_data; | |
10f62861 | 5150 | |
355b0502 | 5151 | binder_debug(BINDER_DEBUG_OPEN_CLOSE, |
56b468fc | 5152 | "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n", |
355b0502 GKH |
5153 | proc->pid, vma->vm_start, vma->vm_end, |
5154 | (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags, | |
5155 | (unsigned long)pgprot_val(vma->vm_page_prot)); | |
355b0502 GKH |
5156 | } |
5157 | ||
5158 | static void binder_vma_close(struct vm_area_struct *vma) | |
5159 | { | |
5160 | struct binder_proc *proc = vma->vm_private_data; | |
10f62861 | 5161 | |
355b0502 | 5162 | binder_debug(BINDER_DEBUG_OPEN_CLOSE, |
56b468fc | 5163 | "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n", |
355b0502 GKH |
5164 | proc->pid, vma->vm_start, vma->vm_end, |
5165 | (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags, | |
5166 | (unsigned long)pgprot_val(vma->vm_page_prot)); | |
19c98724 | 5167 | binder_alloc_vma_close(&proc->alloc); |
355b0502 GKH |
5168 | } |
5169 | ||
e19f70aa | 5170 | static vm_fault_t binder_vm_fault(struct vm_fault *vmf) |
ddac7d5f VM |
5171 | { |
5172 | return VM_FAULT_SIGBUS; | |
5173 | } | |
5174 | ||
7cbea8dc | 5175 | static const struct vm_operations_struct binder_vm_ops = { |
355b0502 GKH |
5176 | .open = binder_vma_open, |
5177 | .close = binder_vma_close, | |
ddac7d5f | 5178 | .fault = binder_vm_fault, |
355b0502 GKH |
5179 | }; |
5180 | ||
19c98724 TK |
5181 | static int binder_mmap(struct file *filp, struct vm_area_struct *vma) |
5182 | { | |
5183 | int ret; | |
5184 | struct binder_proc *proc = filp->private_data; | |
5185 | const char *failure_string; | |
5186 | ||
5187 | if (proc->tsk != current->group_leader) | |
5188 | return -EINVAL; | |
5189 | ||
19c98724 TK |
5190 | binder_debug(BINDER_DEBUG_OPEN_CLOSE, |
5191 | "%s: %d %lx-%lx (%ld K) vma %lx pagep %lx\n", | |
5192 | __func__, proc->pid, vma->vm_start, vma->vm_end, | |
5193 | (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags, | |
5194 | (unsigned long)pgprot_val(vma->vm_page_prot)); | |
5195 | ||
5196 | if (vma->vm_flags & FORBIDDEN_MMAP_FLAGS) { | |
5197 | ret = -EPERM; | |
5198 | failure_string = "bad vm_flags"; | |
5199 | goto err_bad_arg; | |
5200 | } | |
720c2419 MK |
5201 | vma->vm_flags |= VM_DONTCOPY | VM_MIXEDMAP; |
5202 | vma->vm_flags &= ~VM_MAYWRITE; | |
5203 | ||
19c98724 TK |
5204 | vma->vm_ops = &binder_vm_ops; |
5205 | vma->vm_private_data = proc; | |
5206 | ||
5207 | ret = binder_alloc_mmap_handler(&proc->alloc, vma); | |
5208 | if (ret) | |
5209 | return ret; | |
19c98724 TK |
5210 | return 0; |
5211 | ||
355b0502 | 5212 | err_bad_arg: |
00c41cdd | 5213 | pr_err("%s: %d %lx-%lx %s failed %d\n", __func__, |
355b0502 GKH |
5214 | proc->pid, vma->vm_start, vma->vm_end, failure_string, ret); |
5215 | return ret; | |
5216 | } | |
5217 | ||
5218 | static int binder_open(struct inode *nodp, struct file *filp) | |
5219 | { | |
eb143f87 | 5220 | struct binder_proc *proc, *itr; |
ac4812c5 | 5221 | struct binder_device *binder_dev; |
4feb80fa HV |
5222 | struct binderfs_info *info; |
5223 | struct dentry *binder_binderfs_dir_entry_proc = NULL; | |
eb143f87 | 5224 | bool existing_pid = false; |
355b0502 | 5225 | |
00c41cdd | 5226 | binder_debug(BINDER_DEBUG_OPEN_CLOSE, "%s: %d:%d\n", __func__, |
355b0502 GKH |
5227 | current->group_leader->pid, current->pid); |
5228 | ||
5229 | proc = kzalloc(sizeof(*proc), GFP_KERNEL); | |
5230 | if (proc == NULL) | |
5231 | return -ENOMEM; | |
9630fe88 TK |
5232 | spin_lock_init(&proc->inner_lock); |
5233 | spin_lock_init(&proc->outer_lock); | |
c4ea41ba TK |
5234 | get_task_struct(current->group_leader); |
5235 | proc->tsk = current->group_leader; | |
355b0502 | 5236 | INIT_LIST_HEAD(&proc->todo); |
355b0502 | 5237 | proc->default_priority = task_nice(current); |
3ad20fe3 | 5238 | /* binderfs stashes devices in i_private */ |
4feb80fa | 5239 | if (is_binderfs_device(nodp)) { |
f0fe2c0f | 5240 | binder_dev = nodp->i_private; |
4feb80fa HV |
5241 | info = nodp->i_sb->s_fs_info; |
5242 | binder_binderfs_dir_entry_proc = info->proc_log_dir; | |
5243 | } else { | |
3ad20fe3 CB |
5244 | binder_dev = container_of(filp->private_data, |
5245 | struct binder_device, miscdev); | |
4feb80fa | 5246 | } |
f0fe2c0f | 5247 | refcount_inc(&binder_dev->ref); |
ac4812c5 | 5248 | proc->context = &binder_dev->context; |
19c98724 | 5249 | binder_alloc_init(&proc->alloc); |
975a1ac9 | 5250 | |
355b0502 | 5251 | binder_stats_created(BINDER_STAT_PROC); |
355b0502 GKH |
5252 | proc->pid = current->group_leader->pid; |
5253 | INIT_LIST_HEAD(&proc->delivered_death); | |
1b77e9dc | 5254 | INIT_LIST_HEAD(&proc->waiting_threads); |
355b0502 | 5255 | filp->private_data = proc; |
975a1ac9 | 5256 | |
c44b1231 | 5257 | mutex_lock(&binder_procs_lock); |
eb143f87 MF |
5258 | hlist_for_each_entry(itr, &binder_procs, proc_node) { |
5259 | if (itr->pid == proc->pid) { | |
5260 | existing_pid = true; | |
5261 | break; | |
5262 | } | |
5263 | } | |
c44b1231 TK |
5264 | hlist_add_head(&proc->proc_node, &binder_procs); |
5265 | mutex_unlock(&binder_procs_lock); | |
5266 | ||
eb143f87 | 5267 | if (binder_debugfs_dir_entry_proc && !existing_pid) { |
355b0502 | 5268 | char strbuf[11]; |
10f62861 | 5269 | |
355b0502 | 5270 | snprintf(strbuf, sizeof(strbuf), "%u", proc->pid); |
14db3181 | 5271 | /* |
eb143f87 MF |
5272 | * proc debug entries are shared between contexts. |
5273 | * Only create for the first PID to avoid debugfs log spamming | |
5274 | * The printing code will anyway print all contexts for a given | |
5275 | * PID so this is not a problem. | |
14db3181 | 5276 | */ |
21d02ddf | 5277 | proc->debugfs_entry = debugfs_create_file(strbuf, 0444, |
14db3181 MC |
5278 | binder_debugfs_dir_entry_proc, |
5279 | (void *)(unsigned long)proc->pid, | |
c13e0a52 | 5280 | &proc_fops); |
355b0502 GKH |
5281 | } |
5282 | ||
eb143f87 | 5283 | if (binder_binderfs_dir_entry_proc && !existing_pid) { |
4feb80fa HV |
5284 | char strbuf[11]; |
5285 | struct dentry *binderfs_entry; | |
5286 | ||
5287 | snprintf(strbuf, sizeof(strbuf), "%u", proc->pid); | |
5288 | /* | |
5289 | * Similar to debugfs, the process specific log file is shared | |
eb143f87 MF |
5290 | * between contexts. Only create for the first PID. |
5291 | * This is ok since same as debugfs, the log file will contain | |
5292 | * information on all contexts of a given PID. | |
4feb80fa HV |
5293 | */ |
5294 | binderfs_entry = binderfs_create_file(binder_binderfs_dir_entry_proc, | |
5295 | strbuf, &proc_fops, (void *)(unsigned long)proc->pid); | |
5296 | if (!IS_ERR(binderfs_entry)) { | |
5297 | proc->binderfs_entry = binderfs_entry; | |
5298 | } else { | |
5299 | int error; | |
5300 | ||
5301 | error = PTR_ERR(binderfs_entry); | |
eb143f87 MF |
5302 | pr_warn("Unable to create file %s in binderfs (error %d)\n", |
5303 | strbuf, error); | |
4feb80fa HV |
5304 | } |
5305 | } | |
5306 | ||
355b0502 GKH |
5307 | return 0; |
5308 | } | |
5309 | ||
5310 | static int binder_flush(struct file *filp, fl_owner_t id) | |
5311 | { | |
5312 | struct binder_proc *proc = filp->private_data; | |
5313 | ||
5314 | binder_defer_work(proc, BINDER_DEFERRED_FLUSH); | |
5315 | ||
5316 | return 0; | |
5317 | } | |
5318 | ||
5319 | static void binder_deferred_flush(struct binder_proc *proc) | |
5320 | { | |
5321 | struct rb_node *n; | |
5322 | int wake_count = 0; | |
10f62861 | 5323 | |
7bd7b0e6 | 5324 | binder_inner_proc_lock(proc); |
355b0502 GKH |
5325 | for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) { |
5326 | struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node); | |
10f62861 | 5327 | |
08dabcee | 5328 | thread->looper_need_return = true; |
355b0502 GKH |
5329 | if (thread->looper & BINDER_LOOPER_STATE_WAITING) { |
5330 | wake_up_interruptible(&thread->wait); | |
5331 | wake_count++; | |
5332 | } | |
5333 | } | |
7bd7b0e6 | 5334 | binder_inner_proc_unlock(proc); |
355b0502 GKH |
5335 | |
5336 | binder_debug(BINDER_DEBUG_OPEN_CLOSE, | |
5337 | "binder_flush: %d woke %d threads\n", proc->pid, | |
5338 | wake_count); | |
5339 | } | |
5340 | ||
5341 | static int binder_release(struct inode *nodp, struct file *filp) | |
5342 | { | |
5343 | struct binder_proc *proc = filp->private_data; | |
10f62861 | 5344 | |
16b66554 | 5345 | debugfs_remove(proc->debugfs_entry); |
4feb80fa HV |
5346 | |
5347 | if (proc->binderfs_entry) { | |
5348 | binderfs_remove_file(proc->binderfs_entry); | |
5349 | proc->binderfs_entry = NULL; | |
5350 | } | |
5351 | ||
355b0502 GKH |
5352 | binder_defer_work(proc, BINDER_DEFERRED_RELEASE); |
5353 | ||
5354 | return 0; | |
5355 | } | |
5356 | ||
008fa749 ME |
5357 | static int binder_node_release(struct binder_node *node, int refs) |
5358 | { | |
5359 | struct binder_ref *ref; | |
5360 | int death = 0; | |
ed29721e | 5361 | struct binder_proc *proc = node->proc; |
008fa749 | 5362 | |
72196393 | 5363 | binder_release_work(proc, &node->async_todo); |
ed29721e | 5364 | |
673068ee | 5365 | binder_node_lock(node); |
ed29721e | 5366 | binder_inner_proc_lock(proc); |
72196393 | 5367 | binder_dequeue_work_ilocked(&node->work); |
adc18842 TK |
5368 | /* |
5369 | * The caller must have taken a temporary ref on the node, | |
5370 | */ | |
5371 | BUG_ON(!node->tmp_refs); | |
5372 | if (hlist_empty(&node->refs) && node->tmp_refs == 1) { | |
ed29721e | 5373 | binder_inner_proc_unlock(proc); |
673068ee | 5374 | binder_node_unlock(node); |
ed29721e | 5375 | binder_free_node(node); |
008fa749 ME |
5376 | |
5377 | return refs; | |
5378 | } | |
5379 | ||
5380 | node->proc = NULL; | |
5381 | node->local_strong_refs = 0; | |
5382 | node->local_weak_refs = 0; | |
ed29721e | 5383 | binder_inner_proc_unlock(proc); |
c44b1231 TK |
5384 | |
5385 | spin_lock(&binder_dead_nodes_lock); | |
008fa749 | 5386 | hlist_add_head(&node->dead_node, &binder_dead_nodes); |
c44b1231 | 5387 | spin_unlock(&binder_dead_nodes_lock); |
008fa749 ME |
5388 | |
5389 | hlist_for_each_entry(ref, &node->refs, node_entry) { | |
5390 | refs++; | |
ab51ec6b MC |
5391 | /* |
5392 | * Need the node lock to synchronize | |
5393 | * with new notification requests and the | |
5394 | * inner lock to synchronize with queued | |
5395 | * death notifications. | |
5396 | */ | |
5397 | binder_inner_proc_lock(ref->proc); | |
5398 | if (!ref->death) { | |
5399 | binder_inner_proc_unlock(ref->proc); | |
e194fd8a | 5400 | continue; |
ab51ec6b | 5401 | } |
008fa749 ME |
5402 | |
5403 | death++; | |
5404 | ||
ab51ec6b MC |
5405 | BUG_ON(!list_empty(&ref->death->work.entry)); |
5406 | ref->death->work.type = BINDER_WORK_DEAD_BINDER; | |
5407 | binder_enqueue_work_ilocked(&ref->death->work, | |
5408 | &ref->proc->todo); | |
408c68b1 | 5409 | binder_wakeup_proc_ilocked(ref->proc); |
72196393 | 5410 | binder_inner_proc_unlock(ref->proc); |
008fa749 ME |
5411 | } |
5412 | ||
008fa749 ME |
5413 | binder_debug(BINDER_DEBUG_DEAD_BINDER, |
5414 | "node %d now dead, refs %d, death %d\n", | |
5415 | node->debug_id, refs, death); | |
673068ee | 5416 | binder_node_unlock(node); |
adc18842 | 5417 | binder_put_node(node); |
008fa749 ME |
5418 | |
5419 | return refs; | |
5420 | } | |
5421 | ||
355b0502 GKH |
5422 | static void binder_deferred_release(struct binder_proc *proc) |
5423 | { | |
342e5c90 | 5424 | struct binder_context *context = proc->context; |
355b0502 | 5425 | struct rb_node *n; |
19c98724 | 5426 | int threads, nodes, incoming_refs, outgoing_refs, active_transactions; |
355b0502 | 5427 | |
c44b1231 | 5428 | mutex_lock(&binder_procs_lock); |
355b0502 | 5429 | hlist_del(&proc->proc_node); |
c44b1231 | 5430 | mutex_unlock(&binder_procs_lock); |
53413e7d | 5431 | |
c44b1231 | 5432 | mutex_lock(&context->context_mgr_node_lock); |
342e5c90 MC |
5433 | if (context->binder_context_mgr_node && |
5434 | context->binder_context_mgr_node->proc == proc) { | |
355b0502 | 5435 | binder_debug(BINDER_DEBUG_DEAD_BINDER, |
c07c933f ME |
5436 | "%s: %d context_mgr_node gone\n", |
5437 | __func__, proc->pid); | |
342e5c90 | 5438 | context->binder_context_mgr_node = NULL; |
355b0502 | 5439 | } |
c44b1231 | 5440 | mutex_unlock(&context->context_mgr_node_lock); |
7bd7b0e6 | 5441 | binder_inner_proc_lock(proc); |
7a4408c6 TK |
5442 | /* |
5443 | * Make sure proc stays alive after we | |
5444 | * remove all the threads | |
5445 | */ | |
5446 | proc->tmp_ref++; | |
355b0502 | 5447 | |
7a4408c6 | 5448 | proc->is_dead = true; |
355b0502 GKH |
5449 | threads = 0; |
5450 | active_transactions = 0; | |
5451 | while ((n = rb_first(&proc->threads))) { | |
53413e7d ME |
5452 | struct binder_thread *thread; |
5453 | ||
5454 | thread = rb_entry(n, struct binder_thread, rb_node); | |
7bd7b0e6 | 5455 | binder_inner_proc_unlock(proc); |
355b0502 | 5456 | threads++; |
7a4408c6 | 5457 | active_transactions += binder_thread_release(proc, thread); |
7bd7b0e6 | 5458 | binder_inner_proc_lock(proc); |
355b0502 | 5459 | } |
53413e7d | 5460 | |
355b0502 GKH |
5461 | nodes = 0; |
5462 | incoming_refs = 0; | |
5463 | while ((n = rb_first(&proc->nodes))) { | |
53413e7d | 5464 | struct binder_node *node; |
355b0502 | 5465 | |
53413e7d | 5466 | node = rb_entry(n, struct binder_node, rb_node); |
355b0502 | 5467 | nodes++; |
adc18842 TK |
5468 | /* |
5469 | * take a temporary ref on the node before | |
5470 | * calling binder_node_release() which will either | |
5471 | * kfree() the node or call binder_put_node() | |
5472 | */ | |
da0fa9e4 | 5473 | binder_inc_node_tmpref_ilocked(node); |
355b0502 | 5474 | rb_erase(&node->rb_node, &proc->nodes); |
da0fa9e4 | 5475 | binder_inner_proc_unlock(proc); |
008fa749 | 5476 | incoming_refs = binder_node_release(node, incoming_refs); |
da0fa9e4 | 5477 | binder_inner_proc_lock(proc); |
355b0502 | 5478 | } |
da0fa9e4 | 5479 | binder_inner_proc_unlock(proc); |
53413e7d | 5480 | |
355b0502 | 5481 | outgoing_refs = 0; |
2c1838dc | 5482 | binder_proc_lock(proc); |
355b0502 | 5483 | while ((n = rb_first(&proc->refs_by_desc))) { |
53413e7d ME |
5484 | struct binder_ref *ref; |
5485 | ||
5486 | ref = rb_entry(n, struct binder_ref, rb_node_desc); | |
355b0502 | 5487 | outgoing_refs++; |
2c1838dc TK |
5488 | binder_cleanup_ref_olocked(ref); |
5489 | binder_proc_unlock(proc); | |
372e3147 | 5490 | binder_free_ref(ref); |
2c1838dc | 5491 | binder_proc_lock(proc); |
355b0502 | 5492 | } |
2c1838dc | 5493 | binder_proc_unlock(proc); |
53413e7d | 5494 | |
72196393 TK |
5495 | binder_release_work(proc, &proc->todo); |
5496 | binder_release_work(proc, &proc->delivered_death); | |
355b0502 | 5497 | |
355b0502 | 5498 | binder_debug(BINDER_DEBUG_OPEN_CLOSE, |
19c98724 | 5499 | "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d\n", |
c07c933f | 5500 | __func__, proc->pid, threads, nodes, incoming_refs, |
19c98724 | 5501 | outgoing_refs, active_transactions); |
355b0502 | 5502 | |
7a4408c6 | 5503 | binder_proc_dec_tmpref(proc); |
355b0502 GKH |
5504 | } |
5505 | ||
5506 | static void binder_deferred_func(struct work_struct *work) | |
5507 | { | |
5508 | struct binder_proc *proc; | |
355b0502 GKH |
5509 | |
5510 | int defer; | |
10f62861 | 5511 | |
355b0502 | 5512 | do { |
355b0502 GKH |
5513 | mutex_lock(&binder_deferred_lock); |
5514 | if (!hlist_empty(&binder_deferred_list)) { | |
5515 | proc = hlist_entry(binder_deferred_list.first, | |
5516 | struct binder_proc, deferred_work_node); | |
5517 | hlist_del_init(&proc->deferred_work_node); | |
5518 | defer = proc->deferred_work; | |
5519 | proc->deferred_work = 0; | |
5520 | } else { | |
5521 | proc = NULL; | |
5522 | defer = 0; | |
5523 | } | |
5524 | mutex_unlock(&binder_deferred_lock); | |
5525 | ||
355b0502 GKH |
5526 | if (defer & BINDER_DEFERRED_FLUSH) |
5527 | binder_deferred_flush(proc); | |
5528 | ||
5529 | if (defer & BINDER_DEFERRED_RELEASE) | |
5530 | binder_deferred_release(proc); /* frees proc */ | |
355b0502 GKH |
5531 | } while (proc); |
5532 | } | |
5533 | static DECLARE_WORK(binder_deferred_work, binder_deferred_func); | |
5534 | ||
5535 | static void | |
5536 | binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer) | |
5537 | { | |
5538 | mutex_lock(&binder_deferred_lock); | |
5539 | proc->deferred_work |= defer; | |
5540 | if (hlist_unhashed(&proc->deferred_work_node)) { | |
5541 | hlist_add_head(&proc->deferred_work_node, | |
5542 | &binder_deferred_list); | |
1beba52d | 5543 | schedule_work(&binder_deferred_work); |
355b0502 GKH |
5544 | } |
5545 | mutex_unlock(&binder_deferred_lock); | |
5546 | } | |
5547 | ||
5f2f6369 TK |
5548 | static void print_binder_transaction_ilocked(struct seq_file *m, |
5549 | struct binder_proc *proc, | |
5550 | const char *prefix, | |
5551 | struct binder_transaction *t) | |
5249f488 | 5552 | { |
5f2f6369 TK |
5553 | struct binder_proc *to_proc; |
5554 | struct binder_buffer *buffer = t->buffer; | |
5555 | ||
7a4408c6 | 5556 | spin_lock(&t->lock); |
5f2f6369 | 5557 | to_proc = t->to_proc; |
5249f488 | 5558 | seq_printf(m, |
8ca86f16 | 5559 | "%s %d: %pK from %d:%d to %d:%d code %x flags %x pri %ld r%d", |
5249f488 AH |
5560 | prefix, t->debug_id, t, |
5561 | t->from ? t->from->proc->pid : 0, | |
5562 | t->from ? t->from->pid : 0, | |
5f2f6369 | 5563 | to_proc ? to_proc->pid : 0, |
5249f488 AH |
5564 | t->to_thread ? t->to_thread->pid : 0, |
5565 | t->code, t->flags, t->priority, t->need_reply); | |
7a4408c6 TK |
5566 | spin_unlock(&t->lock); |
5567 | ||
5f2f6369 TK |
5568 | if (proc != to_proc) { |
5569 | /* | |
5570 | * Can only safely deref buffer if we are holding the | |
5571 | * correct proc inner lock for this node | |
5572 | */ | |
5573 | seq_puts(m, "\n"); | |
5574 | return; | |
5575 | } | |
5576 | ||
5577 | if (buffer == NULL) { | |
5249f488 AH |
5578 | seq_puts(m, " buffer free\n"); |
5579 | return; | |
355b0502 | 5580 | } |
5f2f6369 TK |
5581 | if (buffer->target_node) |
5582 | seq_printf(m, " node %d", buffer->target_node->debug_id); | |
8ca86f16 | 5583 | seq_printf(m, " size %zd:%zd data %pK\n", |
5f2f6369 | 5584 | buffer->data_size, buffer->offsets_size, |
bde4a19f | 5585 | buffer->user_data); |
355b0502 GKH |
5586 | } |
5587 | ||
5f2f6369 TK |
5588 | static void print_binder_work_ilocked(struct seq_file *m, |
5589 | struct binder_proc *proc, | |
5590 | const char *prefix, | |
5591 | const char *transaction_prefix, | |
5592 | struct binder_work *w) | |
355b0502 GKH |
5593 | { |
5594 | struct binder_node *node; | |
5595 | struct binder_transaction *t; | |
5596 | ||
5597 | switch (w->type) { | |
5598 | case BINDER_WORK_TRANSACTION: | |
5599 | t = container_of(w, struct binder_transaction, work); | |
5f2f6369 TK |
5600 | print_binder_transaction_ilocked( |
5601 | m, proc, transaction_prefix, t); | |
355b0502 | 5602 | break; |
26549d17 TK |
5603 | case BINDER_WORK_RETURN_ERROR: { |
5604 | struct binder_error *e = container_of( | |
5605 | w, struct binder_error, work); | |
5606 | ||
5607 | seq_printf(m, "%stransaction error: %u\n", | |
5608 | prefix, e->cmd); | |
5609 | } break; | |
355b0502 | 5610 | case BINDER_WORK_TRANSACTION_COMPLETE: |
5249f488 | 5611 | seq_printf(m, "%stransaction complete\n", prefix); |
355b0502 GKH |
5612 | break; |
5613 | case BINDER_WORK_NODE: | |
5614 | node = container_of(w, struct binder_node, work); | |
da49889d AH |
5615 | seq_printf(m, "%snode work %d: u%016llx c%016llx\n", |
5616 | prefix, node->debug_id, | |
5617 | (u64)node->ptr, (u64)node->cookie); | |
355b0502 GKH |
5618 | break; |
5619 | case BINDER_WORK_DEAD_BINDER: | |
5249f488 | 5620 | seq_printf(m, "%shas dead binder\n", prefix); |
355b0502 GKH |
5621 | break; |
5622 | case BINDER_WORK_DEAD_BINDER_AND_CLEAR: | |
5249f488 | 5623 | seq_printf(m, "%shas cleared dead binder\n", prefix); |
355b0502 GKH |
5624 | break; |
5625 | case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: | |
5249f488 | 5626 | seq_printf(m, "%shas cleared death notification\n", prefix); |
355b0502 GKH |
5627 | break; |
5628 | default: | |
5249f488 | 5629 | seq_printf(m, "%sunknown work: type %d\n", prefix, w->type); |
355b0502 GKH |
5630 | break; |
5631 | } | |
355b0502 GKH |
5632 | } |
5633 | ||
72196393 TK |
5634 | static void print_binder_thread_ilocked(struct seq_file *m, |
5635 | struct binder_thread *thread, | |
5636 | int print_always) | |
355b0502 GKH |
5637 | { |
5638 | struct binder_transaction *t; | |
5639 | struct binder_work *w; | |
5249f488 AH |
5640 | size_t start_pos = m->count; |
5641 | size_t header_pos; | |
355b0502 | 5642 | |
7a4408c6 | 5643 | seq_printf(m, " thread %d: l %02x need_return %d tr %d\n", |
08dabcee | 5644 | thread->pid, thread->looper, |
7a4408c6 TK |
5645 | thread->looper_need_return, |
5646 | atomic_read(&thread->tmp_ref)); | |
5249f488 | 5647 | header_pos = m->count; |
355b0502 GKH |
5648 | t = thread->transaction_stack; |
5649 | while (t) { | |
355b0502 | 5650 | if (t->from == thread) { |
5f2f6369 TK |
5651 | print_binder_transaction_ilocked(m, thread->proc, |
5652 | " outgoing transaction", t); | |
355b0502 GKH |
5653 | t = t->from_parent; |
5654 | } else if (t->to_thread == thread) { | |
5f2f6369 | 5655 | print_binder_transaction_ilocked(m, thread->proc, |
5249f488 | 5656 | " incoming transaction", t); |
355b0502 GKH |
5657 | t = t->to_parent; |
5658 | } else { | |
5f2f6369 TK |
5659 | print_binder_transaction_ilocked(m, thread->proc, |
5660 | " bad transaction", t); | |
355b0502 GKH |
5661 | t = NULL; |
5662 | } | |
5663 | } | |
5664 | list_for_each_entry(w, &thread->todo, entry) { | |
5f2f6369 | 5665 | print_binder_work_ilocked(m, thread->proc, " ", |
72196393 | 5666 | " pending transaction", w); |
355b0502 | 5667 | } |
5249f488 AH |
5668 | if (!print_always && m->count == header_pos) |
5669 | m->count = start_pos; | |
355b0502 GKH |
5670 | } |
5671 | ||
da0fa9e4 TK |
5672 | static void print_binder_node_nilocked(struct seq_file *m, |
5673 | struct binder_node *node) | |
355b0502 GKH |
5674 | { |
5675 | struct binder_ref *ref; | |
355b0502 GKH |
5676 | struct binder_work *w; |
5677 | int count; | |
5678 | ||
5679 | count = 0; | |
b67bfe0d | 5680 | hlist_for_each_entry(ref, &node->refs, node_entry) |
355b0502 GKH |
5681 | count++; |
5682 | ||
adc18842 | 5683 | seq_printf(m, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d tr %d", |
da49889d | 5684 | node->debug_id, (u64)node->ptr, (u64)node->cookie, |
5249f488 AH |
5685 | node->has_strong_ref, node->has_weak_ref, |
5686 | node->local_strong_refs, node->local_weak_refs, | |
adc18842 | 5687 | node->internal_strong_refs, count, node->tmp_refs); |
355b0502 | 5688 | if (count) { |
5249f488 | 5689 | seq_puts(m, " proc"); |
b67bfe0d | 5690 | hlist_for_each_entry(ref, &node->refs, node_entry) |
5249f488 | 5691 | seq_printf(m, " %d", ref->proc->pid); |
355b0502 | 5692 | } |
5249f488 | 5693 | seq_puts(m, "\n"); |
72196393 | 5694 | if (node->proc) { |
72196393 | 5695 | list_for_each_entry(w, &node->async_todo, entry) |
5f2f6369 | 5696 | print_binder_work_ilocked(m, node->proc, " ", |
72196393 | 5697 | " pending async transaction", w); |
72196393 | 5698 | } |
355b0502 GKH |
5699 | } |
5700 | ||
2c1838dc TK |
5701 | static void print_binder_ref_olocked(struct seq_file *m, |
5702 | struct binder_ref *ref) | |
355b0502 | 5703 | { |
673068ee | 5704 | binder_node_lock(ref->node); |
372e3147 TK |
5705 | seq_printf(m, " ref %d: desc %d %snode %d s %d w %d d %pK\n", |
5706 | ref->data.debug_id, ref->data.desc, | |
5707 | ref->node->proc ? "" : "dead ", | |
5708 | ref->node->debug_id, ref->data.strong, | |
5709 | ref->data.weak, ref->death); | |
673068ee | 5710 | binder_node_unlock(ref->node); |
355b0502 GKH |
5711 | } |
5712 | ||
5249f488 AH |
5713 | static void print_binder_proc(struct seq_file *m, |
5714 | struct binder_proc *proc, int print_all) | |
355b0502 GKH |
5715 | { |
5716 | struct binder_work *w; | |
5717 | struct rb_node *n; | |
5249f488 AH |
5718 | size_t start_pos = m->count; |
5719 | size_t header_pos; | |
da0fa9e4 | 5720 | struct binder_node *last_node = NULL; |
5249f488 AH |
5721 | |
5722 | seq_printf(m, "proc %d\n", proc->pid); | |
14db3181 | 5723 | seq_printf(m, "context %s\n", proc->context->name); |
5249f488 AH |
5724 | header_pos = m->count; |
5725 | ||
72196393 | 5726 | binder_inner_proc_lock(proc); |
5249f488 | 5727 | for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) |
72196393 | 5728 | print_binder_thread_ilocked(m, rb_entry(n, struct binder_thread, |
5249f488 | 5729 | rb_node), print_all); |
da0fa9e4 | 5730 | |
5249f488 | 5731 | for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) { |
355b0502 GKH |
5732 | struct binder_node *node = rb_entry(n, struct binder_node, |
5733 | rb_node); | |
ecd589d8 TK |
5734 | if (!print_all && !node->has_async_transaction) |
5735 | continue; | |
5736 | ||
da0fa9e4 TK |
5737 | /* |
5738 | * take a temporary reference on the node so it | |
5739 | * survives and isn't removed from the tree | |
5740 | * while we print it. | |
5741 | */ | |
5742 | binder_inc_node_tmpref_ilocked(node); | |
5743 | /* Need to drop inner lock to take node lock */ | |
5744 | binder_inner_proc_unlock(proc); | |
5745 | if (last_node) | |
5746 | binder_put_node(last_node); | |
5747 | binder_node_inner_lock(node); | |
5748 | print_binder_node_nilocked(m, node); | |
5749 | binder_node_inner_unlock(node); | |
5750 | last_node = node; | |
5751 | binder_inner_proc_lock(proc); | |
355b0502 | 5752 | } |
da0fa9e4 TK |
5753 | binder_inner_proc_unlock(proc); |
5754 | if (last_node) | |
5755 | binder_put_node(last_node); | |
5756 | ||
355b0502 | 5757 | if (print_all) { |
2c1838dc | 5758 | binder_proc_lock(proc); |
355b0502 | 5759 | for (n = rb_first(&proc->refs_by_desc); |
5249f488 | 5760 | n != NULL; |
355b0502 | 5761 | n = rb_next(n)) |
2c1838dc TK |
5762 | print_binder_ref_olocked(m, rb_entry(n, |
5763 | struct binder_ref, | |
5764 | rb_node_desc)); | |
5765 | binder_proc_unlock(proc); | |
355b0502 | 5766 | } |
19c98724 | 5767 | binder_alloc_print_allocated(m, &proc->alloc); |
72196393 | 5768 | binder_inner_proc_lock(proc); |
5249f488 | 5769 | list_for_each_entry(w, &proc->todo, entry) |
5f2f6369 TK |
5770 | print_binder_work_ilocked(m, proc, " ", |
5771 | " pending transaction", w); | |
355b0502 | 5772 | list_for_each_entry(w, &proc->delivered_death, entry) { |
5249f488 | 5773 | seq_puts(m, " has delivered dead binder\n"); |
355b0502 GKH |
5774 | break; |
5775 | } | |
72196393 | 5776 | binder_inner_proc_unlock(proc); |
5249f488 AH |
5777 | if (!print_all && m->count == header_pos) |
5778 | m->count = start_pos; | |
355b0502 GKH |
5779 | } |
5780 | ||
167bccbd | 5781 | static const char * const binder_return_strings[] = { |
355b0502 GKH |
5782 | "BR_ERROR", |
5783 | "BR_OK", | |
5784 | "BR_TRANSACTION", | |
5785 | "BR_REPLY", | |
5786 | "BR_ACQUIRE_RESULT", | |
5787 | "BR_DEAD_REPLY", | |
5788 | "BR_TRANSACTION_COMPLETE", | |
5789 | "BR_INCREFS", | |
5790 | "BR_ACQUIRE", | |
5791 | "BR_RELEASE", | |
5792 | "BR_DECREFS", | |
5793 | "BR_ATTEMPT_ACQUIRE", | |
5794 | "BR_NOOP", | |
5795 | "BR_SPAWN_LOOPER", | |
5796 | "BR_FINISHED", | |
5797 | "BR_DEAD_BINDER", | |
5798 | "BR_CLEAR_DEATH_NOTIFICATION_DONE", | |
5799 | "BR_FAILED_REPLY" | |
5800 | }; | |
5801 | ||
167bccbd | 5802 | static const char * const binder_command_strings[] = { |
355b0502 GKH |
5803 | "BC_TRANSACTION", |
5804 | "BC_REPLY", | |
5805 | "BC_ACQUIRE_RESULT", | |
5806 | "BC_FREE_BUFFER", | |
5807 | "BC_INCREFS", | |
5808 | "BC_ACQUIRE", | |
5809 | "BC_RELEASE", | |
5810 | "BC_DECREFS", | |
5811 | "BC_INCREFS_DONE", | |
5812 | "BC_ACQUIRE_DONE", | |
5813 | "BC_ATTEMPT_ACQUIRE", | |
5814 | "BC_REGISTER_LOOPER", | |
5815 | "BC_ENTER_LOOPER", | |
5816 | "BC_EXIT_LOOPER", | |
5817 | "BC_REQUEST_DEATH_NOTIFICATION", | |
5818 | "BC_CLEAR_DEATH_NOTIFICATION", | |
7980240b MC |
5819 | "BC_DEAD_BINDER_DONE", |
5820 | "BC_TRANSACTION_SG", | |
5821 | "BC_REPLY_SG", | |
355b0502 GKH |
5822 | }; |
5823 | ||
167bccbd | 5824 | static const char * const binder_objstat_strings[] = { |
355b0502 GKH |
5825 | "proc", |
5826 | "thread", | |
5827 | "node", | |
5828 | "ref", | |
5829 | "death", | |
5830 | "transaction", | |
5831 | "transaction_complete" | |
5832 | }; | |
5833 | ||
5249f488 AH |
5834 | static void print_binder_stats(struct seq_file *m, const char *prefix, |
5835 | struct binder_stats *stats) | |
355b0502 GKH |
5836 | { |
5837 | int i; | |
5838 | ||
5839 | BUILD_BUG_ON(ARRAY_SIZE(stats->bc) != | |
5249f488 | 5840 | ARRAY_SIZE(binder_command_strings)); |
355b0502 | 5841 | for (i = 0; i < ARRAY_SIZE(stats->bc); i++) { |
0953c797 BJS |
5842 | int temp = atomic_read(&stats->bc[i]); |
5843 | ||
5844 | if (temp) | |
5249f488 | 5845 | seq_printf(m, "%s%s: %d\n", prefix, |
0953c797 | 5846 | binder_command_strings[i], temp); |
355b0502 GKH |
5847 | } |
5848 | ||
5849 | BUILD_BUG_ON(ARRAY_SIZE(stats->br) != | |
5249f488 | 5850 | ARRAY_SIZE(binder_return_strings)); |
355b0502 | 5851 | for (i = 0; i < ARRAY_SIZE(stats->br); i++) { |
0953c797 BJS |
5852 | int temp = atomic_read(&stats->br[i]); |
5853 | ||
5854 | if (temp) | |
5249f488 | 5855 | seq_printf(m, "%s%s: %d\n", prefix, |
0953c797 | 5856 | binder_return_strings[i], temp); |
355b0502 GKH |
5857 | } |
5858 | ||
5859 | BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) != | |
5249f488 | 5860 | ARRAY_SIZE(binder_objstat_strings)); |
355b0502 | 5861 | BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) != |
5249f488 | 5862 | ARRAY_SIZE(stats->obj_deleted)); |
355b0502 | 5863 | for (i = 0; i < ARRAY_SIZE(stats->obj_created); i++) { |
0953c797 BJS |
5864 | int created = atomic_read(&stats->obj_created[i]); |
5865 | int deleted = atomic_read(&stats->obj_deleted[i]); | |
5866 | ||
5867 | if (created || deleted) | |
5868 | seq_printf(m, "%s%s: active %d total %d\n", | |
5869 | prefix, | |
5249f488 | 5870 | binder_objstat_strings[i], |
0953c797 BJS |
5871 | created - deleted, |
5872 | created); | |
355b0502 | 5873 | } |
355b0502 GKH |
5874 | } |
5875 | ||
5249f488 AH |
5876 | static void print_binder_proc_stats(struct seq_file *m, |
5877 | struct binder_proc *proc) | |
355b0502 GKH |
5878 | { |
5879 | struct binder_work *w; | |
1b77e9dc | 5880 | struct binder_thread *thread; |
355b0502 | 5881 | struct rb_node *n; |
1b77e9dc | 5882 | int count, strong, weak, ready_threads; |
7bd7b0e6 TK |
5883 | size_t free_async_space = |
5884 | binder_alloc_get_free_async_space(&proc->alloc); | |
355b0502 | 5885 | |
5249f488 | 5886 | seq_printf(m, "proc %d\n", proc->pid); |
14db3181 | 5887 | seq_printf(m, "context %s\n", proc->context->name); |
355b0502 | 5888 | count = 0; |
1b77e9dc | 5889 | ready_threads = 0; |
7bd7b0e6 | 5890 | binder_inner_proc_lock(proc); |
355b0502 GKH |
5891 | for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) |
5892 | count++; | |
1b77e9dc MC |
5893 | |
5894 | list_for_each_entry(thread, &proc->waiting_threads, waiting_thread_node) | |
5895 | ready_threads++; | |
5896 | ||
5249f488 AH |
5897 | seq_printf(m, " threads: %d\n", count); |
5898 | seq_printf(m, " requested threads: %d+%d/%d\n" | |
355b0502 GKH |
5899 | " ready threads %d\n" |
5900 | " free async space %zd\n", proc->requested_threads, | |
5901 | proc->requested_threads_started, proc->max_threads, | |
1b77e9dc | 5902 | ready_threads, |
7bd7b0e6 | 5903 | free_async_space); |
355b0502 GKH |
5904 | count = 0; |
5905 | for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) | |
5906 | count++; | |
da0fa9e4 | 5907 | binder_inner_proc_unlock(proc); |
5249f488 | 5908 | seq_printf(m, " nodes: %d\n", count); |
355b0502 GKH |
5909 | count = 0; |
5910 | strong = 0; | |
5911 | weak = 0; | |
2c1838dc | 5912 | binder_proc_lock(proc); |
355b0502 GKH |
5913 | for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) { |
5914 | struct binder_ref *ref = rb_entry(n, struct binder_ref, | |
5915 | rb_node_desc); | |
5916 | count++; | |
372e3147 TK |
5917 | strong += ref->data.strong; |
5918 | weak += ref->data.weak; | |
355b0502 | 5919 | } |
2c1838dc | 5920 | binder_proc_unlock(proc); |
5249f488 | 5921 | seq_printf(m, " refs: %d s %d w %d\n", count, strong, weak); |
355b0502 | 5922 | |
19c98724 | 5923 | count = binder_alloc_get_allocated_count(&proc->alloc); |
5249f488 | 5924 | seq_printf(m, " buffers: %d\n", count); |
355b0502 | 5925 | |
8ef4665a SY |
5926 | binder_alloc_print_pages(m, &proc->alloc); |
5927 | ||
355b0502 | 5928 | count = 0; |
72196393 | 5929 | binder_inner_proc_lock(proc); |
355b0502 | 5930 | list_for_each_entry(w, &proc->todo, entry) { |
72196393 | 5931 | if (w->type == BINDER_WORK_TRANSACTION) |
355b0502 | 5932 | count++; |
355b0502 | 5933 | } |
72196393 | 5934 | binder_inner_proc_unlock(proc); |
5249f488 | 5935 | seq_printf(m, " pending transactions: %d\n", count); |
355b0502 | 5936 | |
5249f488 | 5937 | print_binder_stats(m, " ", &proc->stats); |
355b0502 GKH |
5938 | } |
5939 | ||
5940 | ||
0e13e452 | 5941 | int binder_state_show(struct seq_file *m, void *unused) |
355b0502 GKH |
5942 | { |
5943 | struct binder_proc *proc; | |
355b0502 | 5944 | struct binder_node *node; |
673068ee | 5945 | struct binder_node *last_node = NULL; |
355b0502 | 5946 | |
5249f488 | 5947 | seq_puts(m, "binder state:\n"); |
355b0502 | 5948 | |
c44b1231 | 5949 | spin_lock(&binder_dead_nodes_lock); |
355b0502 | 5950 | if (!hlist_empty(&binder_dead_nodes)) |
5249f488 | 5951 | seq_puts(m, "dead nodes:\n"); |
673068ee TK |
5952 | hlist_for_each_entry(node, &binder_dead_nodes, dead_node) { |
5953 | /* | |
5954 | * take a temporary reference on the node so it | |
5955 | * survives and isn't removed from the list | |
5956 | * while we print it. | |
5957 | */ | |
5958 | node->tmp_refs++; | |
5959 | spin_unlock(&binder_dead_nodes_lock); | |
5960 | if (last_node) | |
5961 | binder_put_node(last_node); | |
5962 | binder_node_lock(node); | |
da0fa9e4 | 5963 | print_binder_node_nilocked(m, node); |
673068ee TK |
5964 | binder_node_unlock(node); |
5965 | last_node = node; | |
5966 | spin_lock(&binder_dead_nodes_lock); | |
5967 | } | |
c44b1231 | 5968 | spin_unlock(&binder_dead_nodes_lock); |
673068ee TK |
5969 | if (last_node) |
5970 | binder_put_node(last_node); | |
355b0502 | 5971 | |
c44b1231 | 5972 | mutex_lock(&binder_procs_lock); |
b67bfe0d | 5973 | hlist_for_each_entry(proc, &binder_procs, proc_node) |
5249f488 | 5974 | print_binder_proc(m, proc, 1); |
c44b1231 | 5975 | mutex_unlock(&binder_procs_lock); |
a60b890f | 5976 | |
5249f488 | 5977 | return 0; |
355b0502 GKH |
5978 | } |
5979 | ||
0e13e452 | 5980 | int binder_stats_show(struct seq_file *m, void *unused) |
355b0502 GKH |
5981 | { |
5982 | struct binder_proc *proc; | |
355b0502 | 5983 | |
5249f488 | 5984 | seq_puts(m, "binder stats:\n"); |
355b0502 | 5985 | |
5249f488 | 5986 | print_binder_stats(m, "", &binder_stats); |
355b0502 | 5987 | |
c44b1231 | 5988 | mutex_lock(&binder_procs_lock); |
b67bfe0d | 5989 | hlist_for_each_entry(proc, &binder_procs, proc_node) |
5249f488 | 5990 | print_binder_proc_stats(m, proc); |
c44b1231 | 5991 | mutex_unlock(&binder_procs_lock); |
a60b890f | 5992 | |
5249f488 | 5993 | return 0; |
355b0502 GKH |
5994 | } |
5995 | ||
0e13e452 | 5996 | int binder_transactions_show(struct seq_file *m, void *unused) |
355b0502 GKH |
5997 | { |
5998 | struct binder_proc *proc; | |
355b0502 | 5999 | |
5249f488 | 6000 | seq_puts(m, "binder transactions:\n"); |
c44b1231 | 6001 | mutex_lock(&binder_procs_lock); |
b67bfe0d | 6002 | hlist_for_each_entry(proc, &binder_procs, proc_node) |
5249f488 | 6003 | print_binder_proc(m, proc, 0); |
c44b1231 | 6004 | mutex_unlock(&binder_procs_lock); |
a60b890f | 6005 | |
5249f488 | 6006 | return 0; |
355b0502 GKH |
6007 | } |
6008 | ||
c13e0a52 | 6009 | static int proc_show(struct seq_file *m, void *unused) |
355b0502 | 6010 | { |
83050a4e | 6011 | struct binder_proc *itr; |
14db3181 | 6012 | int pid = (unsigned long)m->private; |
355b0502 | 6013 | |
c44b1231 | 6014 | mutex_lock(&binder_procs_lock); |
83050a4e | 6015 | hlist_for_each_entry(itr, &binder_procs, proc_node) { |
14db3181 MC |
6016 | if (itr->pid == pid) { |
6017 | seq_puts(m, "binder proc state:\n"); | |
6018 | print_binder_proc(m, itr, 1); | |
83050a4e RA |
6019 | } |
6020 | } | |
c44b1231 TK |
6021 | mutex_unlock(&binder_procs_lock); |
6022 | ||
5249f488 | 6023 | return 0; |
355b0502 GKH |
6024 | } |
6025 | ||
5249f488 | 6026 | static void print_binder_transaction_log_entry(struct seq_file *m, |
355b0502 GKH |
6027 | struct binder_transaction_log_entry *e) |
6028 | { | |
d99c7333 TK |
6029 | int debug_id = READ_ONCE(e->debug_id_done); |
6030 | /* | |
6031 | * read barrier to guarantee debug_id_done read before | |
6032 | * we print the log values | |
6033 | */ | |
6034 | smp_rmb(); | |
5249f488 | 6035 | seq_printf(m, |
d99c7333 | 6036 | "%d: %s from %d:%d to %d:%d context %s node %d handle %d size %d:%d ret %d/%d l=%d", |
5249f488 AH |
6037 | e->debug_id, (e->call_type == 2) ? "reply" : |
6038 | ((e->call_type == 1) ? "async" : "call "), e->from_proc, | |
14db3181 | 6039 | e->from_thread, e->to_proc, e->to_thread, e->context_name, |
57ada2fb TK |
6040 | e->to_node, e->target_handle, e->data_size, e->offsets_size, |
6041 | e->return_error, e->return_error_param, | |
6042 | e->return_error_line); | |
d99c7333 TK |
6043 | /* |
6044 | * read-barrier to guarantee read of debug_id_done after | |
6045 | * done printing the fields of the entry | |
6046 | */ | |
6047 | smp_rmb(); | |
6048 | seq_printf(m, debug_id && debug_id == READ_ONCE(e->debug_id_done) ? | |
6049 | "\n" : " (incomplete)\n"); | |
355b0502 GKH |
6050 | } |
6051 | ||
03e2e07e | 6052 | int binder_transaction_log_show(struct seq_file *m, void *unused) |
355b0502 | 6053 | { |
5249f488 | 6054 | struct binder_transaction_log *log = m->private; |
d99c7333 TK |
6055 | unsigned int log_cur = atomic_read(&log->cur); |
6056 | unsigned int count; | |
6057 | unsigned int cur; | |
355b0502 | 6058 | int i; |
355b0502 | 6059 | |
d99c7333 TK |
6060 | count = log_cur + 1; |
6061 | cur = count < ARRAY_SIZE(log->entry) && !log->full ? | |
6062 | 0 : count % ARRAY_SIZE(log->entry); | |
6063 | if (count > ARRAY_SIZE(log->entry) || log->full) | |
6064 | count = ARRAY_SIZE(log->entry); | |
6065 | for (i = 0; i < count; i++) { | |
6066 | unsigned int index = cur++ % ARRAY_SIZE(log->entry); | |
6067 | ||
6068 | print_binder_transaction_log_entry(m, &log->entry[index]); | |
355b0502 | 6069 | } |
5249f488 | 6070 | return 0; |
355b0502 GKH |
6071 | } |
6072 | ||
3ad20fe3 | 6073 | const struct file_operations binder_fops = { |
355b0502 GKH |
6074 | .owner = THIS_MODULE, |
6075 | .poll = binder_poll, | |
6076 | .unlocked_ioctl = binder_ioctl, | |
1832f2d8 | 6077 | .compat_ioctl = compat_ptr_ioctl, |
355b0502 GKH |
6078 | .mmap = binder_mmap, |
6079 | .open = binder_open, | |
6080 | .flush = binder_flush, | |
6081 | .release = binder_release, | |
6082 | }; | |
6083 | ||
ac4812c5 MC |
6084 | static int __init init_binder_device(const char *name) |
6085 | { | |
6086 | int ret; | |
6087 | struct binder_device *binder_device; | |
6088 | ||
6089 | binder_device = kzalloc(sizeof(*binder_device), GFP_KERNEL); | |
6090 | if (!binder_device) | |
6091 | return -ENOMEM; | |
6092 | ||
6093 | binder_device->miscdev.fops = &binder_fops; | |
6094 | binder_device->miscdev.minor = MISC_DYNAMIC_MINOR; | |
6095 | binder_device->miscdev.name = name; | |
6096 | ||
f0fe2c0f | 6097 | refcount_set(&binder_device->ref, 1); |
ac4812c5 MC |
6098 | binder_device->context.binder_context_mgr_uid = INVALID_UID; |
6099 | binder_device->context.name = name; | |
c44b1231 | 6100 | mutex_init(&binder_device->context.context_mgr_node_lock); |
ac4812c5 MC |
6101 | |
6102 | ret = misc_register(&binder_device->miscdev); | |
6103 | if (ret < 0) { | |
6104 | kfree(binder_device); | |
6105 | return ret; | |
6106 | } | |
6107 | ||
6108 | hlist_add_head(&binder_device->hlist, &binder_devices); | |
6109 | ||
6110 | return ret; | |
6111 | } | |
6112 | ||
355b0502 GKH |
6113 | static int __init binder_init(void) |
6114 | { | |
6115 | int ret; | |
5b9633af | 6116 | char *device_name, *device_tmp; |
ac4812c5 MC |
6117 | struct binder_device *device; |
6118 | struct hlist_node *tmp; | |
5b9633af | 6119 | char *device_names = NULL; |
355b0502 | 6120 | |
533dfb25 TH |
6121 | ret = binder_alloc_shrinker_init(); |
6122 | if (ret) | |
6123 | return ret; | |
f2517eb7 | 6124 | |
d99c7333 TK |
6125 | atomic_set(&binder_transaction_log.cur, ~0U); |
6126 | atomic_set(&binder_transaction_log_failed.cur, ~0U); | |
6127 | ||
16b66554 AH |
6128 | binder_debugfs_dir_entry_root = debugfs_create_dir("binder", NULL); |
6129 | if (binder_debugfs_dir_entry_root) | |
6130 | binder_debugfs_dir_entry_proc = debugfs_create_dir("proc", | |
6131 | binder_debugfs_dir_entry_root); | |
ac4812c5 | 6132 | |
16b66554 AH |
6133 | if (binder_debugfs_dir_entry_root) { |
6134 | debugfs_create_file("state", | |
21d02ddf | 6135 | 0444, |
16b66554 AH |
6136 | binder_debugfs_dir_entry_root, |
6137 | NULL, | |
0e13e452 | 6138 | &binder_state_fops); |
16b66554 | 6139 | debugfs_create_file("stats", |
21d02ddf | 6140 | 0444, |
16b66554 AH |
6141 | binder_debugfs_dir_entry_root, |
6142 | NULL, | |
0e13e452 | 6143 | &binder_stats_fops); |
16b66554 | 6144 | debugfs_create_file("transactions", |
21d02ddf | 6145 | 0444, |
16b66554 AH |
6146 | binder_debugfs_dir_entry_root, |
6147 | NULL, | |
0e13e452 | 6148 | &binder_transactions_fops); |
16b66554 | 6149 | debugfs_create_file("transaction_log", |
21d02ddf | 6150 | 0444, |
16b66554 AH |
6151 | binder_debugfs_dir_entry_root, |
6152 | &binder_transaction_log, | |
03e2e07e | 6153 | &binder_transaction_log_fops); |
16b66554 | 6154 | debugfs_create_file("failed_transaction_log", |
21d02ddf | 6155 | 0444, |
16b66554 AH |
6156 | binder_debugfs_dir_entry_root, |
6157 | &binder_transaction_log_failed, | |
03e2e07e | 6158 | &binder_transaction_log_fops); |
355b0502 | 6159 | } |
ac4812c5 | 6160 | |
ca2864c6 HV |
6161 | if (!IS_ENABLED(CONFIG_ANDROID_BINDERFS) && |
6162 | strcmp(binder_devices_param, "") != 0) { | |
793c8232 CB |
6163 | /* |
6164 | * Copy the module_parameter string, because we don't want to | |
6165 | * tokenize it in-place. | |
6166 | */ | |
6167 | device_names = kstrdup(binder_devices_param, GFP_KERNEL); | |
6168 | if (!device_names) { | |
6169 | ret = -ENOMEM; | |
6170 | goto err_alloc_device_names_failed; | |
6171 | } | |
ac4812c5 | 6172 | |
793c8232 CB |
6173 | device_tmp = device_names; |
6174 | while ((device_name = strsep(&device_tmp, ","))) { | |
6175 | ret = init_binder_device(device_name); | |
6176 | if (ret) | |
6177 | goto err_init_binder_device_failed; | |
6178 | } | |
ac4812c5 MC |
6179 | } |
6180 | ||
5b9633af CB |
6181 | ret = init_binderfs(); |
6182 | if (ret) | |
6183 | goto err_init_binder_device_failed; | |
6184 | ||
ac4812c5 MC |
6185 | return ret; |
6186 | ||
6187 | err_init_binder_device_failed: | |
6188 | hlist_for_each_entry_safe(device, tmp, &binder_devices, hlist) { | |
6189 | misc_deregister(&device->miscdev); | |
6190 | hlist_del(&device->hlist); | |
6191 | kfree(device); | |
6192 | } | |
22eb9476 CB |
6193 | |
6194 | kfree(device_names); | |
6195 | ||
ac4812c5 MC |
6196 | err_alloc_device_names_failed: |
6197 | debugfs_remove_recursive(binder_debugfs_dir_entry_root); | |
6198 | ||
355b0502 GKH |
6199 | return ret; |
6200 | } | |
6201 | ||
6202 | device_initcall(binder_init); | |
6203 | ||
975a1ac9 AH |
6204 | #define CREATE_TRACE_POINTS |
6205 | #include "binder_trace.h" | |
6206 | ||
355b0502 | 6207 | MODULE_LICENSE("GPL v2"); |