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