1 // SPDX-License-Identifier: GPL-2.0-only
4 * Android IPC Subsystem
6 * Copyright (C) 2007-2008 Google, Inc.
12 * There are 3 main spinlocks which must be acquired in the
15 * 1) proc->outer_lock : protects binder_ref
16 * binder_proc_lock() and binder_proc_unlock() are
18 * 2) node->lock : protects most fields of binder_node.
19 * binder_node_lock() and binder_node_unlock() are
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()
29 * Any lock under procA must never be nested under any lock at the same
30 * level or below on procB.
32 * Functions that require a lock held on entry indicate which lock
33 * in the suffix of the function name:
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
43 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
45 #include <linux/fdtable.h>
46 #include <linux/file.h>
47 #include <linux/freezer.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>
70 #include <uapi/linux/android/binder.h>
72 #include <linux/cacheflush.h>
74 #include "binder_internal.h"
75 #include "binder_trace.h"
77 static HLIST_HEAD(binder_deferred_list);
78 static DEFINE_MUTEX(binder_deferred_lock);
80 static HLIST_HEAD(binder_devices);
81 static HLIST_HEAD(binder_procs);
82 static DEFINE_MUTEX(binder_procs_lock);
84 static HLIST_HEAD(binder_dead_nodes);
85 static DEFINE_SPINLOCK(binder_dead_nodes_lock);
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;
91 static int proc_show(struct seq_file *m, void *unused);
92 DEFINE_SHOW_ATTRIBUTE(proc);
94 #define FORBIDDEN_MMAP_FLAGS (VM_WRITE)
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,
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);
117 char *binder_devices_param = CONFIG_ANDROID_BINDER_DEVICES;
118 module_param_named(devices, binder_devices_param, charp, 0444);
120 static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait);
121 static int binder_stop_on_user_error;
123 static int binder_set_stop_on_user_error(const char *val,
124 const struct kernel_param *kp)
128 ret = param_set_int(val, kp);
129 if (binder_stop_on_user_error < 2)
130 wake_up(&binder_user_error_wait);
133 module_param_call(stop_on_user_error, binder_set_stop_on_user_error,
134 param_get_int, &binder_stop_on_user_error, 0644);
136 static __printf(2, 3) void binder_debug(int mask, const char *format, ...)
138 struct va_format vaf;
141 if (binder_debug_mask & mask) {
142 va_start(args, format);
145 pr_info_ratelimited("%pV", &vaf);
150 #define binder_txn_error(x...) \
151 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION, x)
153 static __printf(1, 2) void binder_user_error(const char *format, ...)
155 struct va_format vaf;
158 if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) {
159 va_start(args, format);
162 pr_info_ratelimited("%pV", &vaf);
166 if (binder_stop_on_user_error)
167 binder_stop_on_user_error = 2;
170 #define binder_set_extended_error(ee, _id, _command, _param) \
173 (ee)->command = _command; \
174 (ee)->param = _param; \
177 #define to_flat_binder_object(hdr) \
178 container_of(hdr, struct flat_binder_object, hdr)
180 #define to_binder_fd_object(hdr) container_of(hdr, struct binder_fd_object, hdr)
182 #define to_binder_buffer_object(hdr) \
183 container_of(hdr, struct binder_buffer_object, hdr)
185 #define to_binder_fd_array_object(hdr) \
186 container_of(hdr, struct binder_fd_array_object, hdr)
188 static struct binder_stats binder_stats;
190 static inline void binder_stats_deleted(enum binder_stat_types type)
192 atomic_inc(&binder_stats.obj_deleted[type]);
195 static inline void binder_stats_created(enum binder_stat_types type)
197 atomic_inc(&binder_stats.obj_created[type]);
200 struct binder_transaction_log_entry {
212 int return_error_line;
213 uint32_t return_error;
214 uint32_t return_error_param;
215 char context_name[BINDERFS_MAX_NAME + 1];
218 struct binder_transaction_log {
221 struct binder_transaction_log_entry entry[32];
224 static struct binder_transaction_log binder_transaction_log;
225 static struct binder_transaction_log binder_transaction_log_failed;
227 static struct binder_transaction_log_entry *binder_transaction_log_add(
228 struct binder_transaction_log *log)
230 struct binder_transaction_log_entry *e;
231 unsigned int cur = atomic_inc_return(&log->cur);
233 if (cur >= ARRAY_SIZE(log->entry))
235 e = &log->entry[cur % ARRAY_SIZE(log->entry)];
236 WRITE_ONCE(e->debug_id_done, 0);
238 * write-barrier to synchronize access to e->debug_id_done.
239 * We make sure the initialized 0 value is seen before
240 * memset() other fields are zeroed by memset.
243 memset(e, 0, sizeof(*e));
247 enum binder_deferred_state {
248 BINDER_DEFERRED_FLUSH = 0x01,
249 BINDER_DEFERRED_RELEASE = 0x02,
253 BINDER_LOOPER_STATE_REGISTERED = 0x01,
254 BINDER_LOOPER_STATE_ENTERED = 0x02,
255 BINDER_LOOPER_STATE_EXITED = 0x04,
256 BINDER_LOOPER_STATE_INVALID = 0x08,
257 BINDER_LOOPER_STATE_WAITING = 0x10,
258 BINDER_LOOPER_STATE_POLL = 0x20,
262 * binder_proc_lock() - Acquire outer lock for given binder_proc
263 * @proc: struct binder_proc to acquire
265 * Acquires proc->outer_lock. Used to protect binder_ref
266 * structures associated with the given proc.
268 #define binder_proc_lock(proc) _binder_proc_lock(proc, __LINE__)
270 _binder_proc_lock(struct binder_proc *proc, int line)
271 __acquires(&proc->outer_lock)
273 binder_debug(BINDER_DEBUG_SPINLOCKS,
274 "%s: line=%d\n", __func__, line);
275 spin_lock(&proc->outer_lock);
279 * binder_proc_unlock() - Release spinlock for given binder_proc
280 * @proc: struct binder_proc to acquire
282 * Release lock acquired via binder_proc_lock()
284 #define binder_proc_unlock(_proc) _binder_proc_unlock(_proc, __LINE__)
286 _binder_proc_unlock(struct binder_proc *proc, int line)
287 __releases(&proc->outer_lock)
289 binder_debug(BINDER_DEBUG_SPINLOCKS,
290 "%s: line=%d\n", __func__, line);
291 spin_unlock(&proc->outer_lock);
295 * binder_inner_proc_lock() - Acquire inner lock for given binder_proc
296 * @proc: struct binder_proc to acquire
298 * Acquires proc->inner_lock. Used to protect todo lists
300 #define binder_inner_proc_lock(proc) _binder_inner_proc_lock(proc, __LINE__)
302 _binder_inner_proc_lock(struct binder_proc *proc, int line)
303 __acquires(&proc->inner_lock)
305 binder_debug(BINDER_DEBUG_SPINLOCKS,
306 "%s: line=%d\n", __func__, line);
307 spin_lock(&proc->inner_lock);
311 * binder_inner_proc_unlock() - Release inner lock for given binder_proc
312 * @proc: struct binder_proc to acquire
314 * Release lock acquired via binder_inner_proc_lock()
316 #define binder_inner_proc_unlock(proc) _binder_inner_proc_unlock(proc, __LINE__)
318 _binder_inner_proc_unlock(struct binder_proc *proc, int line)
319 __releases(&proc->inner_lock)
321 binder_debug(BINDER_DEBUG_SPINLOCKS,
322 "%s: line=%d\n", __func__, line);
323 spin_unlock(&proc->inner_lock);
327 * binder_node_lock() - Acquire spinlock for given binder_node
328 * @node: struct binder_node to acquire
330 * Acquires node->lock. Used to protect binder_node fields
332 #define binder_node_lock(node) _binder_node_lock(node, __LINE__)
334 _binder_node_lock(struct binder_node *node, int line)
335 __acquires(&node->lock)
337 binder_debug(BINDER_DEBUG_SPINLOCKS,
338 "%s: line=%d\n", __func__, line);
339 spin_lock(&node->lock);
343 * binder_node_unlock() - Release spinlock for given binder_proc
344 * @node: struct binder_node to acquire
346 * Release lock acquired via binder_node_lock()
348 #define binder_node_unlock(node) _binder_node_unlock(node, __LINE__)
350 _binder_node_unlock(struct binder_node *node, int line)
351 __releases(&node->lock)
353 binder_debug(BINDER_DEBUG_SPINLOCKS,
354 "%s: line=%d\n", __func__, line);
355 spin_unlock(&node->lock);
359 * binder_node_inner_lock() - Acquire node and inner locks
360 * @node: struct binder_node to acquire
362 * Acquires node->lock. If node->proc also acquires
363 * proc->inner_lock. Used to protect binder_node fields
365 #define binder_node_inner_lock(node) _binder_node_inner_lock(node, __LINE__)
367 _binder_node_inner_lock(struct binder_node *node, int line)
368 __acquires(&node->lock) __acquires(&node->proc->inner_lock)
370 binder_debug(BINDER_DEBUG_SPINLOCKS,
371 "%s: line=%d\n", __func__, line);
372 spin_lock(&node->lock);
374 binder_inner_proc_lock(node->proc);
376 /* annotation for sparse */
377 __acquire(&node->proc->inner_lock);
381 * binder_node_unlock() - Release node and inner locks
382 * @node: struct binder_node to acquire
384 * Release lock acquired via binder_node_lock()
386 #define binder_node_inner_unlock(node) _binder_node_inner_unlock(node, __LINE__)
388 _binder_node_inner_unlock(struct binder_node *node, int line)
389 __releases(&node->lock) __releases(&node->proc->inner_lock)
391 struct binder_proc *proc = node->proc;
393 binder_debug(BINDER_DEBUG_SPINLOCKS,
394 "%s: line=%d\n", __func__, line);
396 binder_inner_proc_unlock(proc);
398 /* annotation for sparse */
399 __release(&node->proc->inner_lock);
400 spin_unlock(&node->lock);
403 static bool binder_worklist_empty_ilocked(struct list_head *list)
405 return list_empty(list);
409 * binder_worklist_empty() - Check if no items on the work list
410 * @proc: binder_proc associated with list
411 * @list: list to check
413 * Return: true if there are no items on list, else false
415 static bool binder_worklist_empty(struct binder_proc *proc,
416 struct list_head *list)
420 binder_inner_proc_lock(proc);
421 ret = binder_worklist_empty_ilocked(list);
422 binder_inner_proc_unlock(proc);
427 * binder_enqueue_work_ilocked() - Add an item to the work list
428 * @work: struct binder_work to add to list
429 * @target_list: list to add work to
431 * Adds the work to the specified list. Asserts that work
432 * is not already on a list.
434 * Requires the proc->inner_lock to be held.
437 binder_enqueue_work_ilocked(struct binder_work *work,
438 struct list_head *target_list)
440 BUG_ON(target_list == NULL);
441 BUG_ON(work->entry.next && !list_empty(&work->entry));
442 list_add_tail(&work->entry, target_list);
446 * binder_enqueue_deferred_thread_work_ilocked() - Add deferred thread work
447 * @thread: thread to queue work to
448 * @work: struct binder_work to add to list
450 * Adds the work to the todo list of the thread. Doesn't set the process_todo
451 * flag, which means that (if it wasn't already set) the thread will go to
452 * sleep without handling this work when it calls read.
454 * Requires the proc->inner_lock to be held.
457 binder_enqueue_deferred_thread_work_ilocked(struct binder_thread *thread,
458 struct binder_work *work)
460 WARN_ON(!list_empty(&thread->waiting_thread_node));
461 binder_enqueue_work_ilocked(work, &thread->todo);
465 * binder_enqueue_thread_work_ilocked() - Add an item to the thread work list
466 * @thread: thread to queue work to
467 * @work: struct binder_work to add to list
469 * Adds the work to the todo list of the thread, and enables processing
472 * Requires the proc->inner_lock to be held.
475 binder_enqueue_thread_work_ilocked(struct binder_thread *thread,
476 struct binder_work *work)
478 WARN_ON(!list_empty(&thread->waiting_thread_node));
479 binder_enqueue_work_ilocked(work, &thread->todo);
480 thread->process_todo = true;
484 * binder_enqueue_thread_work() - Add an item to the thread work list
485 * @thread: thread to queue work to
486 * @work: struct binder_work to add to list
488 * Adds the work to the todo list of the thread, and enables processing
492 binder_enqueue_thread_work(struct binder_thread *thread,
493 struct binder_work *work)
495 binder_inner_proc_lock(thread->proc);
496 binder_enqueue_thread_work_ilocked(thread, work);
497 binder_inner_proc_unlock(thread->proc);
501 binder_dequeue_work_ilocked(struct binder_work *work)
503 list_del_init(&work->entry);
507 * binder_dequeue_work() - Removes an item from the work list
508 * @proc: binder_proc associated with list
509 * @work: struct binder_work to remove from list
511 * Removes the specified work item from whatever list it is on.
512 * Can safely be called if work is not on any list.
515 binder_dequeue_work(struct binder_proc *proc, struct binder_work *work)
517 binder_inner_proc_lock(proc);
518 binder_dequeue_work_ilocked(work);
519 binder_inner_proc_unlock(proc);
522 static struct binder_work *binder_dequeue_work_head_ilocked(
523 struct list_head *list)
525 struct binder_work *w;
527 w = list_first_entry_or_null(list, struct binder_work, entry);
529 list_del_init(&w->entry);
534 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer);
535 static void binder_free_thread(struct binder_thread *thread);
536 static void binder_free_proc(struct binder_proc *proc);
537 static void binder_inc_node_tmpref_ilocked(struct binder_node *node);
539 static bool binder_has_work_ilocked(struct binder_thread *thread,
542 return thread->process_todo ||
543 thread->looper_need_return ||
545 !binder_worklist_empty_ilocked(&thread->proc->todo));
548 static bool binder_has_work(struct binder_thread *thread, bool do_proc_work)
552 binder_inner_proc_lock(thread->proc);
553 has_work = binder_has_work_ilocked(thread, do_proc_work);
554 binder_inner_proc_unlock(thread->proc);
559 static bool binder_available_for_proc_work_ilocked(struct binder_thread *thread)
561 return !thread->transaction_stack &&
562 binder_worklist_empty_ilocked(&thread->todo) &&
563 (thread->looper & (BINDER_LOOPER_STATE_ENTERED |
564 BINDER_LOOPER_STATE_REGISTERED));
567 static void binder_wakeup_poll_threads_ilocked(struct binder_proc *proc,
571 struct binder_thread *thread;
573 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
574 thread = rb_entry(n, struct binder_thread, rb_node);
575 if (thread->looper & BINDER_LOOPER_STATE_POLL &&
576 binder_available_for_proc_work_ilocked(thread)) {
578 wake_up_interruptible_sync(&thread->wait);
580 wake_up_interruptible(&thread->wait);
586 * binder_select_thread_ilocked() - selects a thread for doing proc work.
587 * @proc: process to select a thread from
589 * Note that calling this function moves the thread off the waiting_threads
590 * list, so it can only be woken up by the caller of this function, or a
591 * signal. Therefore, callers *should* always wake up the thread this function
594 * Return: If there's a thread currently waiting for process work,
595 * returns that thread. Otherwise returns NULL.
597 static struct binder_thread *
598 binder_select_thread_ilocked(struct binder_proc *proc)
600 struct binder_thread *thread;
602 assert_spin_locked(&proc->inner_lock);
603 thread = list_first_entry_or_null(&proc->waiting_threads,
604 struct binder_thread,
605 waiting_thread_node);
608 list_del_init(&thread->waiting_thread_node);
614 * binder_wakeup_thread_ilocked() - wakes up a thread for doing proc work.
615 * @proc: process to wake up a thread in
616 * @thread: specific thread to wake-up (may be NULL)
617 * @sync: whether to do a synchronous wake-up
619 * This function wakes up a thread in the @proc process.
620 * The caller may provide a specific thread to wake-up in
621 * the @thread parameter. If @thread is NULL, this function
622 * will wake up threads that have called poll().
624 * Note that for this function to work as expected, callers
625 * should first call binder_select_thread() to find a thread
626 * to handle the work (if they don't have a thread already),
627 * and pass the result into the @thread parameter.
629 static void binder_wakeup_thread_ilocked(struct binder_proc *proc,
630 struct binder_thread *thread,
633 assert_spin_locked(&proc->inner_lock);
637 wake_up_interruptible_sync(&thread->wait);
639 wake_up_interruptible(&thread->wait);
643 /* Didn't find a thread waiting for proc work; this can happen
645 * 1. All threads are busy handling transactions
646 * In that case, one of those threads should call back into
647 * the kernel driver soon and pick up this work.
648 * 2. Threads are using the (e)poll interface, in which case
649 * they may be blocked on the waitqueue without having been
650 * added to waiting_threads. For this case, we just iterate
651 * over all threads not handling transaction work, and
652 * wake them all up. We wake all because we don't know whether
653 * a thread that called into (e)poll is handling non-binder
656 binder_wakeup_poll_threads_ilocked(proc, sync);
659 static void binder_wakeup_proc_ilocked(struct binder_proc *proc)
661 struct binder_thread *thread = binder_select_thread_ilocked(proc);
663 binder_wakeup_thread_ilocked(proc, thread, /* sync = */false);
666 static void binder_set_nice(long nice)
670 if (can_nice(current, nice)) {
671 set_user_nice(current, nice);
674 min_nice = rlimit_to_nice(rlimit(RLIMIT_NICE));
675 binder_debug(BINDER_DEBUG_PRIORITY_CAP,
676 "%d: nice value %ld not allowed use %ld instead\n",
677 current->pid, nice, min_nice);
678 set_user_nice(current, min_nice);
679 if (min_nice <= MAX_NICE)
681 binder_user_error("%d RLIMIT_NICE not set\n", current->pid);
684 static struct binder_node *binder_get_node_ilocked(struct binder_proc *proc,
685 binder_uintptr_t ptr)
687 struct rb_node *n = proc->nodes.rb_node;
688 struct binder_node *node;
690 assert_spin_locked(&proc->inner_lock);
693 node = rb_entry(n, struct binder_node, rb_node);
697 else if (ptr > node->ptr)
701 * take an implicit weak reference
702 * to ensure node stays alive until
703 * call to binder_put_node()
705 binder_inc_node_tmpref_ilocked(node);
712 static struct binder_node *binder_get_node(struct binder_proc *proc,
713 binder_uintptr_t ptr)
715 struct binder_node *node;
717 binder_inner_proc_lock(proc);
718 node = binder_get_node_ilocked(proc, ptr);
719 binder_inner_proc_unlock(proc);
723 static struct binder_node *binder_init_node_ilocked(
724 struct binder_proc *proc,
725 struct binder_node *new_node,
726 struct flat_binder_object *fp)
728 struct rb_node **p = &proc->nodes.rb_node;
729 struct rb_node *parent = NULL;
730 struct binder_node *node;
731 binder_uintptr_t ptr = fp ? fp->binder : 0;
732 binder_uintptr_t cookie = fp ? fp->cookie : 0;
733 __u32 flags = fp ? fp->flags : 0;
735 assert_spin_locked(&proc->inner_lock);
740 node = rb_entry(parent, struct binder_node, rb_node);
744 else if (ptr > node->ptr)
748 * A matching node is already in
749 * the rb tree. Abandon the init
752 binder_inc_node_tmpref_ilocked(node);
757 binder_stats_created(BINDER_STAT_NODE);
759 rb_link_node(&node->rb_node, parent, p);
760 rb_insert_color(&node->rb_node, &proc->nodes);
761 node->debug_id = atomic_inc_return(&binder_last_id);
764 node->cookie = cookie;
765 node->work.type = BINDER_WORK_NODE;
766 node->min_priority = flags & FLAT_BINDER_FLAG_PRIORITY_MASK;
767 node->accept_fds = !!(flags & FLAT_BINDER_FLAG_ACCEPTS_FDS);
768 node->txn_security_ctx = !!(flags & FLAT_BINDER_FLAG_TXN_SECURITY_CTX);
769 spin_lock_init(&node->lock);
770 INIT_LIST_HEAD(&node->work.entry);
771 INIT_LIST_HEAD(&node->async_todo);
772 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
773 "%d:%d node %d u%016llx c%016llx created\n",
774 proc->pid, current->pid, node->debug_id,
775 (u64)node->ptr, (u64)node->cookie);
780 static struct binder_node *binder_new_node(struct binder_proc *proc,
781 struct flat_binder_object *fp)
783 struct binder_node *node;
784 struct binder_node *new_node = kzalloc(sizeof(*node), GFP_KERNEL);
788 binder_inner_proc_lock(proc);
789 node = binder_init_node_ilocked(proc, new_node, fp);
790 binder_inner_proc_unlock(proc);
791 if (node != new_node)
793 * The node was already added by another thread
800 static void binder_free_node(struct binder_node *node)
803 binder_stats_deleted(BINDER_STAT_NODE);
806 static int binder_inc_node_nilocked(struct binder_node *node, int strong,
808 struct list_head *target_list)
810 struct binder_proc *proc = node->proc;
812 assert_spin_locked(&node->lock);
814 assert_spin_locked(&proc->inner_lock);
817 if (target_list == NULL &&
818 node->internal_strong_refs == 0 &&
820 node == node->proc->context->binder_context_mgr_node &&
821 node->has_strong_ref)) {
822 pr_err("invalid inc strong node for %d\n",
826 node->internal_strong_refs++;
828 node->local_strong_refs++;
829 if (!node->has_strong_ref && target_list) {
830 struct binder_thread *thread = container_of(target_list,
831 struct binder_thread, todo);
832 binder_dequeue_work_ilocked(&node->work);
833 BUG_ON(&thread->todo != target_list);
834 binder_enqueue_deferred_thread_work_ilocked(thread,
839 node->local_weak_refs++;
840 if (!node->has_weak_ref && list_empty(&node->work.entry)) {
841 if (target_list == NULL) {
842 pr_err("invalid inc weak node for %d\n",
849 binder_enqueue_work_ilocked(&node->work, target_list);
855 static int binder_inc_node(struct binder_node *node, int strong, int internal,
856 struct list_head *target_list)
860 binder_node_inner_lock(node);
861 ret = binder_inc_node_nilocked(node, strong, internal, target_list);
862 binder_node_inner_unlock(node);
867 static bool binder_dec_node_nilocked(struct binder_node *node,
868 int strong, int internal)
870 struct binder_proc *proc = node->proc;
872 assert_spin_locked(&node->lock);
874 assert_spin_locked(&proc->inner_lock);
877 node->internal_strong_refs--;
879 node->local_strong_refs--;
880 if (node->local_strong_refs || node->internal_strong_refs)
884 node->local_weak_refs--;
885 if (node->local_weak_refs || node->tmp_refs ||
886 !hlist_empty(&node->refs))
890 if (proc && (node->has_strong_ref || node->has_weak_ref)) {
891 if (list_empty(&node->work.entry)) {
892 binder_enqueue_work_ilocked(&node->work, &proc->todo);
893 binder_wakeup_proc_ilocked(proc);
896 if (hlist_empty(&node->refs) && !node->local_strong_refs &&
897 !node->local_weak_refs && !node->tmp_refs) {
899 binder_dequeue_work_ilocked(&node->work);
900 rb_erase(&node->rb_node, &proc->nodes);
901 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
902 "refless node %d deleted\n",
905 BUG_ON(!list_empty(&node->work.entry));
906 spin_lock(&binder_dead_nodes_lock);
908 * tmp_refs could have changed so
911 if (node->tmp_refs) {
912 spin_unlock(&binder_dead_nodes_lock);
915 hlist_del(&node->dead_node);
916 spin_unlock(&binder_dead_nodes_lock);
917 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
918 "dead node %d deleted\n",
927 static void binder_dec_node(struct binder_node *node, int strong, int internal)
931 binder_node_inner_lock(node);
932 free_node = binder_dec_node_nilocked(node, strong, internal);
933 binder_node_inner_unlock(node);
935 binder_free_node(node);
938 static void binder_inc_node_tmpref_ilocked(struct binder_node *node)
941 * No call to binder_inc_node() is needed since we
942 * don't need to inform userspace of any changes to
949 * binder_inc_node_tmpref() - take a temporary reference on node
950 * @node: node to reference
952 * Take reference on node to prevent the node from being freed
953 * while referenced only by a local variable. The inner lock is
954 * needed to serialize with the node work on the queue (which
955 * isn't needed after the node is dead). If the node is dead
956 * (node->proc is NULL), use binder_dead_nodes_lock to protect
957 * node->tmp_refs against dead-node-only cases where the node
958 * lock cannot be acquired (eg traversing the dead node list to
961 static void binder_inc_node_tmpref(struct binder_node *node)
963 binder_node_lock(node);
965 binder_inner_proc_lock(node->proc);
967 spin_lock(&binder_dead_nodes_lock);
968 binder_inc_node_tmpref_ilocked(node);
970 binder_inner_proc_unlock(node->proc);
972 spin_unlock(&binder_dead_nodes_lock);
973 binder_node_unlock(node);
977 * binder_dec_node_tmpref() - remove a temporary reference on node
978 * @node: node to reference
980 * Release temporary reference on node taken via binder_inc_node_tmpref()
982 static void binder_dec_node_tmpref(struct binder_node *node)
986 binder_node_inner_lock(node);
988 spin_lock(&binder_dead_nodes_lock);
990 __acquire(&binder_dead_nodes_lock);
992 BUG_ON(node->tmp_refs < 0);
994 spin_unlock(&binder_dead_nodes_lock);
996 __release(&binder_dead_nodes_lock);
998 * Call binder_dec_node() to check if all refcounts are 0
999 * and cleanup is needed. Calling with strong=0 and internal=1
1000 * causes no actual reference to be released in binder_dec_node().
1001 * If that changes, a change is needed here too.
1003 free_node = binder_dec_node_nilocked(node, 0, 1);
1004 binder_node_inner_unlock(node);
1006 binder_free_node(node);
1009 static void binder_put_node(struct binder_node *node)
1011 binder_dec_node_tmpref(node);
1014 static struct binder_ref *binder_get_ref_olocked(struct binder_proc *proc,
1015 u32 desc, bool need_strong_ref)
1017 struct rb_node *n = proc->refs_by_desc.rb_node;
1018 struct binder_ref *ref;
1021 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1023 if (desc < ref->data.desc) {
1025 } else if (desc > ref->data.desc) {
1027 } else if (need_strong_ref && !ref->data.strong) {
1028 binder_user_error("tried to use weak ref as strong ref\n");
1038 * binder_get_ref_for_node_olocked() - get the ref associated with given node
1039 * @proc: binder_proc that owns the ref
1040 * @node: binder_node of target
1041 * @new_ref: newly allocated binder_ref to be initialized or %NULL
1043 * Look up the ref for the given node and return it if it exists
1045 * If it doesn't exist and the caller provides a newly allocated
1046 * ref, initialize the fields of the newly allocated ref and insert
1047 * into the given proc rb_trees and node refs list.
1049 * Return: the ref for node. It is possible that another thread
1050 * allocated/initialized the ref first in which case the
1051 * returned ref would be different than the passed-in
1052 * new_ref. new_ref must be kfree'd by the caller in
1055 static struct binder_ref *binder_get_ref_for_node_olocked(
1056 struct binder_proc *proc,
1057 struct binder_node *node,
1058 struct binder_ref *new_ref)
1060 struct binder_context *context = proc->context;
1061 struct rb_node **p = &proc->refs_by_node.rb_node;
1062 struct rb_node *parent = NULL;
1063 struct binder_ref *ref;
1068 ref = rb_entry(parent, struct binder_ref, rb_node_node);
1070 if (node < ref->node)
1072 else if (node > ref->node)
1073 p = &(*p)->rb_right;
1080 binder_stats_created(BINDER_STAT_REF);
1081 new_ref->data.debug_id = atomic_inc_return(&binder_last_id);
1082 new_ref->proc = proc;
1083 new_ref->node = node;
1084 rb_link_node(&new_ref->rb_node_node, parent, p);
1085 rb_insert_color(&new_ref->rb_node_node, &proc->refs_by_node);
1087 new_ref->data.desc = (node == context->binder_context_mgr_node) ? 0 : 1;
1088 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
1089 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1090 if (ref->data.desc > new_ref->data.desc)
1092 new_ref->data.desc = ref->data.desc + 1;
1095 p = &proc->refs_by_desc.rb_node;
1098 ref = rb_entry(parent, struct binder_ref, rb_node_desc);
1100 if (new_ref->data.desc < ref->data.desc)
1102 else if (new_ref->data.desc > ref->data.desc)
1103 p = &(*p)->rb_right;
1107 rb_link_node(&new_ref->rb_node_desc, parent, p);
1108 rb_insert_color(&new_ref->rb_node_desc, &proc->refs_by_desc);
1110 binder_node_lock(node);
1111 hlist_add_head(&new_ref->node_entry, &node->refs);
1113 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1114 "%d new ref %d desc %d for node %d\n",
1115 proc->pid, new_ref->data.debug_id, new_ref->data.desc,
1117 binder_node_unlock(node);
1121 static void binder_cleanup_ref_olocked(struct binder_ref *ref)
1123 bool delete_node = false;
1125 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1126 "%d delete ref %d desc %d for node %d\n",
1127 ref->proc->pid, ref->data.debug_id, ref->data.desc,
1128 ref->node->debug_id);
1130 rb_erase(&ref->rb_node_desc, &ref->proc->refs_by_desc);
1131 rb_erase(&ref->rb_node_node, &ref->proc->refs_by_node);
1133 binder_node_inner_lock(ref->node);
1134 if (ref->data.strong)
1135 binder_dec_node_nilocked(ref->node, 1, 1);
1137 hlist_del(&ref->node_entry);
1138 delete_node = binder_dec_node_nilocked(ref->node, 0, 1);
1139 binder_node_inner_unlock(ref->node);
1141 * Clear ref->node unless we want the caller to free the node
1145 * The caller uses ref->node to determine
1146 * whether the node needs to be freed. Clear
1147 * it since the node is still alive.
1153 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1154 "%d delete ref %d desc %d has death notification\n",
1155 ref->proc->pid, ref->data.debug_id,
1157 binder_dequeue_work(ref->proc, &ref->death->work);
1158 binder_stats_deleted(BINDER_STAT_DEATH);
1160 binder_stats_deleted(BINDER_STAT_REF);
1164 * binder_inc_ref_olocked() - increment the ref for given handle
1165 * @ref: ref to be incremented
1166 * @strong: if true, strong increment, else weak
1167 * @target_list: list to queue node work on
1169 * Increment the ref. @ref->proc->outer_lock must be held on entry
1171 * Return: 0, if successful, else errno
1173 static int binder_inc_ref_olocked(struct binder_ref *ref, int strong,
1174 struct list_head *target_list)
1179 if (ref->data.strong == 0) {
1180 ret = binder_inc_node(ref->node, 1, 1, target_list);
1186 if (ref->data.weak == 0) {
1187 ret = binder_inc_node(ref->node, 0, 1, target_list);
1197 * binder_dec_ref() - dec the ref for given handle
1198 * @ref: ref to be decremented
1199 * @strong: if true, strong decrement, else weak
1201 * Decrement the ref.
1203 * Return: true if ref is cleaned up and ready to be freed
1205 static bool binder_dec_ref_olocked(struct binder_ref *ref, int strong)
1208 if (ref->data.strong == 0) {
1209 binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n",
1210 ref->proc->pid, ref->data.debug_id,
1211 ref->data.desc, ref->data.strong,
1216 if (ref->data.strong == 0)
1217 binder_dec_node(ref->node, strong, 1);
1219 if (ref->data.weak == 0) {
1220 binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n",
1221 ref->proc->pid, ref->data.debug_id,
1222 ref->data.desc, ref->data.strong,
1228 if (ref->data.strong == 0 && ref->data.weak == 0) {
1229 binder_cleanup_ref_olocked(ref);
1236 * binder_get_node_from_ref() - get the node from the given proc/desc
1237 * @proc: proc containing the ref
1238 * @desc: the handle associated with the ref
1239 * @need_strong_ref: if true, only return node if ref is strong
1240 * @rdata: the id/refcount data for the ref
1242 * Given a proc and ref handle, return the associated binder_node
1244 * Return: a binder_node or NULL if not found or not strong when strong required
1246 static struct binder_node *binder_get_node_from_ref(
1247 struct binder_proc *proc,
1248 u32 desc, bool need_strong_ref,
1249 struct binder_ref_data *rdata)
1251 struct binder_node *node;
1252 struct binder_ref *ref;
1254 binder_proc_lock(proc);
1255 ref = binder_get_ref_olocked(proc, desc, need_strong_ref);
1260 * Take an implicit reference on the node to ensure
1261 * it stays alive until the call to binder_put_node()
1263 binder_inc_node_tmpref(node);
1266 binder_proc_unlock(proc);
1271 binder_proc_unlock(proc);
1276 * binder_free_ref() - free the binder_ref
1279 * Free the binder_ref. Free the binder_node indicated by ref->node
1280 * (if non-NULL) and the binder_ref_death indicated by ref->death.
1282 static void binder_free_ref(struct binder_ref *ref)
1285 binder_free_node(ref->node);
1291 * binder_update_ref_for_handle() - inc/dec the ref for given handle
1292 * @proc: proc containing the ref
1293 * @desc: the handle associated with the ref
1294 * @increment: true=inc reference, false=dec reference
1295 * @strong: true=strong reference, false=weak reference
1296 * @rdata: the id/refcount data for the ref
1298 * Given a proc and ref handle, increment or decrement the ref
1299 * according to "increment" arg.
1301 * Return: 0 if successful, else errno
1303 static int binder_update_ref_for_handle(struct binder_proc *proc,
1304 uint32_t desc, bool increment, bool strong,
1305 struct binder_ref_data *rdata)
1308 struct binder_ref *ref;
1309 bool delete_ref = false;
1311 binder_proc_lock(proc);
1312 ref = binder_get_ref_olocked(proc, desc, strong);
1318 ret = binder_inc_ref_olocked(ref, strong, NULL);
1320 delete_ref = binder_dec_ref_olocked(ref, strong);
1324 binder_proc_unlock(proc);
1327 binder_free_ref(ref);
1331 binder_proc_unlock(proc);
1336 * binder_dec_ref_for_handle() - dec the ref for given handle
1337 * @proc: proc containing the ref
1338 * @desc: the handle associated with the ref
1339 * @strong: true=strong reference, false=weak reference
1340 * @rdata: the id/refcount data for the ref
1342 * Just calls binder_update_ref_for_handle() to decrement the ref.
1344 * Return: 0 if successful, else errno
1346 static int binder_dec_ref_for_handle(struct binder_proc *proc,
1347 uint32_t desc, bool strong, struct binder_ref_data *rdata)
1349 return binder_update_ref_for_handle(proc, desc, false, strong, rdata);
1354 * binder_inc_ref_for_node() - increment the ref for given proc/node
1355 * @proc: proc containing the ref
1356 * @node: target node
1357 * @strong: true=strong reference, false=weak reference
1358 * @target_list: worklist to use if node is incremented
1359 * @rdata: the id/refcount data for the ref
1361 * Given a proc and node, increment the ref. Create the ref if it
1362 * doesn't already exist
1364 * Return: 0 if successful, else errno
1366 static int binder_inc_ref_for_node(struct binder_proc *proc,
1367 struct binder_node *node,
1369 struct list_head *target_list,
1370 struct binder_ref_data *rdata)
1372 struct binder_ref *ref;
1373 struct binder_ref *new_ref = NULL;
1376 binder_proc_lock(proc);
1377 ref = binder_get_ref_for_node_olocked(proc, node, NULL);
1379 binder_proc_unlock(proc);
1380 new_ref = kzalloc(sizeof(*ref), GFP_KERNEL);
1383 binder_proc_lock(proc);
1384 ref = binder_get_ref_for_node_olocked(proc, node, new_ref);
1386 ret = binder_inc_ref_olocked(ref, strong, target_list);
1388 binder_proc_unlock(proc);
1389 if (new_ref && ref != new_ref)
1391 * Another thread created the ref first so
1392 * free the one we allocated
1398 static void binder_pop_transaction_ilocked(struct binder_thread *target_thread,
1399 struct binder_transaction *t)
1401 BUG_ON(!target_thread);
1402 assert_spin_locked(&target_thread->proc->inner_lock);
1403 BUG_ON(target_thread->transaction_stack != t);
1404 BUG_ON(target_thread->transaction_stack->from != target_thread);
1405 target_thread->transaction_stack =
1406 target_thread->transaction_stack->from_parent;
1411 * binder_thread_dec_tmpref() - decrement thread->tmp_ref
1412 * @thread: thread to decrement
1414 * A thread needs to be kept alive while being used to create or
1415 * handle a transaction. binder_get_txn_from() is used to safely
1416 * extract t->from from a binder_transaction and keep the thread
1417 * indicated by t->from from being freed. When done with that
1418 * binder_thread, this function is called to decrement the
1419 * tmp_ref and free if appropriate (thread has been released
1420 * and no transaction being processed by the driver)
1422 static void binder_thread_dec_tmpref(struct binder_thread *thread)
1425 * atomic is used to protect the counter value while
1426 * it cannot reach zero or thread->is_dead is false
1428 binder_inner_proc_lock(thread->proc);
1429 atomic_dec(&thread->tmp_ref);
1430 if (thread->is_dead && !atomic_read(&thread->tmp_ref)) {
1431 binder_inner_proc_unlock(thread->proc);
1432 binder_free_thread(thread);
1435 binder_inner_proc_unlock(thread->proc);
1439 * binder_proc_dec_tmpref() - decrement proc->tmp_ref
1440 * @proc: proc to decrement
1442 * A binder_proc needs to be kept alive while being used to create or
1443 * handle a transaction. proc->tmp_ref is incremented when
1444 * creating a new transaction or the binder_proc is currently in-use
1445 * by threads that are being released. When done with the binder_proc,
1446 * this function is called to decrement the counter and free the
1447 * proc if appropriate (proc has been released, all threads have
1448 * been released and not currenly in-use to process a transaction).
1450 static void binder_proc_dec_tmpref(struct binder_proc *proc)
1452 binder_inner_proc_lock(proc);
1454 if (proc->is_dead && RB_EMPTY_ROOT(&proc->threads) &&
1456 binder_inner_proc_unlock(proc);
1457 binder_free_proc(proc);
1460 binder_inner_proc_unlock(proc);
1464 * binder_get_txn_from() - safely extract the "from" thread in transaction
1465 * @t: binder transaction for t->from
1467 * Atomically return the "from" thread and increment the tmp_ref
1468 * count for the thread to ensure it stays alive until
1469 * binder_thread_dec_tmpref() is called.
1471 * Return: the value of t->from
1473 static struct binder_thread *binder_get_txn_from(
1474 struct binder_transaction *t)
1476 struct binder_thread *from;
1478 spin_lock(&t->lock);
1481 atomic_inc(&from->tmp_ref);
1482 spin_unlock(&t->lock);
1487 * binder_get_txn_from_and_acq_inner() - get t->from and acquire inner lock
1488 * @t: binder transaction for t->from
1490 * Same as binder_get_txn_from() except it also acquires the proc->inner_lock
1491 * to guarantee that the thread cannot be released while operating on it.
1492 * The caller must call binder_inner_proc_unlock() to release the inner lock
1493 * as well as call binder_dec_thread_txn() to release the reference.
1495 * Return: the value of t->from
1497 static struct binder_thread *binder_get_txn_from_and_acq_inner(
1498 struct binder_transaction *t)
1499 __acquires(&t->from->proc->inner_lock)
1501 struct binder_thread *from;
1503 from = binder_get_txn_from(t);
1505 __acquire(&from->proc->inner_lock);
1508 binder_inner_proc_lock(from->proc);
1510 BUG_ON(from != t->from);
1513 binder_inner_proc_unlock(from->proc);
1514 __acquire(&from->proc->inner_lock);
1515 binder_thread_dec_tmpref(from);
1520 * binder_free_txn_fixups() - free unprocessed fd fixups
1521 * @t: binder transaction for t->from
1523 * If the transaction is being torn down prior to being
1524 * processed by the target process, free all of the
1525 * fd fixups and fput the file structs. It is safe to
1526 * call this function after the fixups have been
1527 * processed -- in that case, the list will be empty.
1529 static void binder_free_txn_fixups(struct binder_transaction *t)
1531 struct binder_txn_fd_fixup *fixup, *tmp;
1533 list_for_each_entry_safe(fixup, tmp, &t->fd_fixups, fixup_entry) {
1535 if (fixup->target_fd >= 0)
1536 put_unused_fd(fixup->target_fd);
1537 list_del(&fixup->fixup_entry);
1542 static void binder_txn_latency_free(struct binder_transaction *t)
1544 int from_proc, from_thread, to_proc, to_thread;
1546 spin_lock(&t->lock);
1547 from_proc = t->from ? t->from->proc->pid : 0;
1548 from_thread = t->from ? t->from->pid : 0;
1549 to_proc = t->to_proc ? t->to_proc->pid : 0;
1550 to_thread = t->to_thread ? t->to_thread->pid : 0;
1551 spin_unlock(&t->lock);
1553 trace_binder_txn_latency_free(t, from_proc, from_thread, to_proc, to_thread);
1556 static void binder_free_transaction(struct binder_transaction *t)
1558 struct binder_proc *target_proc = t->to_proc;
1561 binder_inner_proc_lock(target_proc);
1562 target_proc->outstanding_txns--;
1563 if (target_proc->outstanding_txns < 0)
1564 pr_warn("%s: Unexpected outstanding_txns %d\n",
1565 __func__, target_proc->outstanding_txns);
1566 if (!target_proc->outstanding_txns && target_proc->is_frozen)
1567 wake_up_interruptible_all(&target_proc->freeze_wait);
1569 t->buffer->transaction = NULL;
1570 binder_inner_proc_unlock(target_proc);
1572 if (trace_binder_txn_latency_free_enabled())
1573 binder_txn_latency_free(t);
1575 * If the transaction has no target_proc, then
1576 * t->buffer->transaction has already been cleared.
1578 binder_free_txn_fixups(t);
1580 binder_stats_deleted(BINDER_STAT_TRANSACTION);
1583 static void binder_send_failed_reply(struct binder_transaction *t,
1584 uint32_t error_code)
1586 struct binder_thread *target_thread;
1587 struct binder_transaction *next;
1589 BUG_ON(t->flags & TF_ONE_WAY);
1591 target_thread = binder_get_txn_from_and_acq_inner(t);
1592 if (target_thread) {
1593 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1594 "send failed reply for transaction %d to %d:%d\n",
1596 target_thread->proc->pid,
1597 target_thread->pid);
1599 binder_pop_transaction_ilocked(target_thread, t);
1600 if (target_thread->reply_error.cmd == BR_OK) {
1601 target_thread->reply_error.cmd = error_code;
1602 binder_enqueue_thread_work_ilocked(
1604 &target_thread->reply_error.work);
1605 wake_up_interruptible(&target_thread->wait);
1608 * Cannot get here for normal operation, but
1609 * we can if multiple synchronous transactions
1610 * are sent without blocking for responses.
1611 * Just ignore the 2nd error in this case.
1613 pr_warn("Unexpected reply error: %u\n",
1614 target_thread->reply_error.cmd);
1616 binder_inner_proc_unlock(target_thread->proc);
1617 binder_thread_dec_tmpref(target_thread);
1618 binder_free_transaction(t);
1621 __release(&target_thread->proc->inner_lock);
1622 next = t->from_parent;
1624 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1625 "send failed reply for transaction %d, target dead\n",
1628 binder_free_transaction(t);
1630 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1631 "reply failed, no target thread at root\n");
1635 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1636 "reply failed, no target thread -- retry %d\n",
1642 * binder_cleanup_transaction() - cleans up undelivered transaction
1643 * @t: transaction that needs to be cleaned up
1644 * @reason: reason the transaction wasn't delivered
1645 * @error_code: error to return to caller (if synchronous call)
1647 static void binder_cleanup_transaction(struct binder_transaction *t,
1649 uint32_t error_code)
1651 if (t->buffer->target_node && !(t->flags & TF_ONE_WAY)) {
1652 binder_send_failed_reply(t, error_code);
1654 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
1655 "undelivered transaction %d, %s\n",
1656 t->debug_id, reason);
1657 binder_free_transaction(t);
1662 * binder_get_object() - gets object and checks for valid metadata
1663 * @proc: binder_proc owning the buffer
1664 * @u: sender's user pointer to base of buffer
1665 * @buffer: binder_buffer that we're parsing.
1666 * @offset: offset in the @buffer at which to validate an object.
1667 * @object: struct binder_object to read into
1669 * Copy the binder object at the given offset into @object. If @u is
1670 * provided then the copy is from the sender's buffer. If not, then
1671 * it is copied from the target's @buffer.
1673 * Return: If there's a valid metadata object at @offset, the
1674 * size of that object. Otherwise, it returns zero. The object
1675 * is read into the struct binder_object pointed to by @object.
1677 static size_t binder_get_object(struct binder_proc *proc,
1678 const void __user *u,
1679 struct binder_buffer *buffer,
1680 unsigned long offset,
1681 struct binder_object *object)
1684 struct binder_object_header *hdr;
1685 size_t object_size = 0;
1687 read_size = min_t(size_t, sizeof(*object), buffer->data_size - offset);
1688 if (offset > buffer->data_size || read_size < sizeof(*hdr))
1691 if (copy_from_user(object, u + offset, read_size))
1694 if (binder_alloc_copy_from_buffer(&proc->alloc, object, buffer,
1699 /* Ok, now see if we read a complete object. */
1701 switch (hdr->type) {
1702 case BINDER_TYPE_BINDER:
1703 case BINDER_TYPE_WEAK_BINDER:
1704 case BINDER_TYPE_HANDLE:
1705 case BINDER_TYPE_WEAK_HANDLE:
1706 object_size = sizeof(struct flat_binder_object);
1708 case BINDER_TYPE_FD:
1709 object_size = sizeof(struct binder_fd_object);
1711 case BINDER_TYPE_PTR:
1712 object_size = sizeof(struct binder_buffer_object);
1714 case BINDER_TYPE_FDA:
1715 object_size = sizeof(struct binder_fd_array_object);
1720 if (offset <= buffer->data_size - object_size &&
1721 buffer->data_size >= object_size)
1728 * binder_validate_ptr() - validates binder_buffer_object in a binder_buffer.
1729 * @proc: binder_proc owning the buffer
1730 * @b: binder_buffer containing the object
1731 * @object: struct binder_object to read into
1732 * @index: index in offset array at which the binder_buffer_object is
1734 * @start_offset: points to the start of the offset array
1735 * @object_offsetp: offset of @object read from @b
1736 * @num_valid: the number of valid offsets in the offset array
1738 * Return: If @index is within the valid range of the offset array
1739 * described by @start and @num_valid, and if there's a valid
1740 * binder_buffer_object at the offset found in index @index
1741 * of the offset array, that object is returned. Otherwise,
1742 * %NULL is returned.
1743 * Note that the offset found in index @index itself is not
1744 * verified; this function assumes that @num_valid elements
1745 * from @start were previously verified to have valid offsets.
1746 * If @object_offsetp is non-NULL, then the offset within
1747 * @b is written to it.
1749 static struct binder_buffer_object *binder_validate_ptr(
1750 struct binder_proc *proc,
1751 struct binder_buffer *b,
1752 struct binder_object *object,
1753 binder_size_t index,
1754 binder_size_t start_offset,
1755 binder_size_t *object_offsetp,
1756 binder_size_t num_valid)
1759 binder_size_t object_offset;
1760 unsigned long buffer_offset;
1762 if (index >= num_valid)
1765 buffer_offset = start_offset + sizeof(binder_size_t) * index;
1766 if (binder_alloc_copy_from_buffer(&proc->alloc, &object_offset,
1768 sizeof(object_offset)))
1770 object_size = binder_get_object(proc, NULL, b, object_offset, object);
1771 if (!object_size || object->hdr.type != BINDER_TYPE_PTR)
1774 *object_offsetp = object_offset;
1776 return &object->bbo;
1780 * binder_validate_fixup() - validates pointer/fd fixups happen in order.
1781 * @proc: binder_proc owning the buffer
1782 * @b: transaction buffer
1783 * @objects_start_offset: offset to start of objects buffer
1784 * @buffer_obj_offset: offset to binder_buffer_object in which to fix up
1785 * @fixup_offset: start offset in @buffer to fix up
1786 * @last_obj_offset: offset to last binder_buffer_object that we fixed
1787 * @last_min_offset: minimum fixup offset in object at @last_obj_offset
1789 * Return: %true if a fixup in buffer @buffer at offset @offset is
1792 * For safety reasons, we only allow fixups inside a buffer to happen
1793 * at increasing offsets; additionally, we only allow fixup on the last
1794 * buffer object that was verified, or one of its parents.
1796 * Example of what is allowed:
1799 * B (parent = A, offset = 0)
1800 * C (parent = A, offset = 16)
1801 * D (parent = C, offset = 0)
1802 * E (parent = A, offset = 32) // min_offset is 16 (C.parent_offset)
1804 * Examples of what is not allowed:
1806 * Decreasing offsets within the same parent:
1808 * C (parent = A, offset = 16)
1809 * B (parent = A, offset = 0) // decreasing offset within A
1811 * Referring to a parent that wasn't the last object or any of its parents:
1813 * B (parent = A, offset = 0)
1814 * C (parent = A, offset = 0)
1815 * C (parent = A, offset = 16)
1816 * D (parent = B, offset = 0) // B is not A or any of A's parents
1818 static bool binder_validate_fixup(struct binder_proc *proc,
1819 struct binder_buffer *b,
1820 binder_size_t objects_start_offset,
1821 binder_size_t buffer_obj_offset,
1822 binder_size_t fixup_offset,
1823 binder_size_t last_obj_offset,
1824 binder_size_t last_min_offset)
1826 if (!last_obj_offset) {
1827 /* Nothing to fix up in */
1831 while (last_obj_offset != buffer_obj_offset) {
1832 unsigned long buffer_offset;
1833 struct binder_object last_object;
1834 struct binder_buffer_object *last_bbo;
1835 size_t object_size = binder_get_object(proc, NULL, b,
1838 if (object_size != sizeof(*last_bbo))
1841 last_bbo = &last_object.bbo;
1843 * Safe to retrieve the parent of last_obj, since it
1844 * was already previously verified by the driver.
1846 if ((last_bbo->flags & BINDER_BUFFER_FLAG_HAS_PARENT) == 0)
1848 last_min_offset = last_bbo->parent_offset + sizeof(uintptr_t);
1849 buffer_offset = objects_start_offset +
1850 sizeof(binder_size_t) * last_bbo->parent;
1851 if (binder_alloc_copy_from_buffer(&proc->alloc,
1854 sizeof(last_obj_offset)))
1857 return (fixup_offset >= last_min_offset);
1861 * struct binder_task_work_cb - for deferred close
1863 * @twork: callback_head for task work
1866 * Structure to pass task work to be handled after
1867 * returning from binder_ioctl() via task_work_add().
1869 struct binder_task_work_cb {
1870 struct callback_head twork;
1875 * binder_do_fd_close() - close list of file descriptors
1876 * @twork: callback head for task work
1878 * It is not safe to call ksys_close() during the binder_ioctl()
1879 * function if there is a chance that binder's own file descriptor
1880 * might be closed. This is to meet the requirements for using
1881 * fdget() (see comments for __fget_light()). Therefore use
1882 * task_work_add() to schedule the close operation once we have
1883 * returned from binder_ioctl(). This function is a callback
1884 * for that mechanism and does the actual ksys_close() on the
1885 * given file descriptor.
1887 static void binder_do_fd_close(struct callback_head *twork)
1889 struct binder_task_work_cb *twcb = container_of(twork,
1890 struct binder_task_work_cb, twork);
1897 * binder_deferred_fd_close() - schedule a close for the given file-descriptor
1898 * @fd: file-descriptor to close
1900 * See comments in binder_do_fd_close(). This function is used to schedule
1901 * a file-descriptor to be closed after returning from binder_ioctl().
1903 static void binder_deferred_fd_close(int fd)
1905 struct binder_task_work_cb *twcb;
1907 twcb = kzalloc(sizeof(*twcb), GFP_KERNEL);
1910 init_task_work(&twcb->twork, binder_do_fd_close);
1911 twcb->file = close_fd_get_file(fd);
1913 // pin it until binder_do_fd_close(); see comments there
1914 get_file(twcb->file);
1915 filp_close(twcb->file, current->files);
1916 task_work_add(current, &twcb->twork, TWA_RESUME);
1922 static void binder_transaction_buffer_release(struct binder_proc *proc,
1923 struct binder_thread *thread,
1924 struct binder_buffer *buffer,
1925 binder_size_t failed_at,
1928 int debug_id = buffer->debug_id;
1929 binder_size_t off_start_offset, buffer_offset, off_end_offset;
1931 binder_debug(BINDER_DEBUG_TRANSACTION,
1932 "%d buffer release %d, size %zd-%zd, failed at %llx\n",
1933 proc->pid, buffer->debug_id,
1934 buffer->data_size, buffer->offsets_size,
1935 (unsigned long long)failed_at);
1937 if (buffer->target_node)
1938 binder_dec_node(buffer->target_node, 1, 0);
1940 off_start_offset = ALIGN(buffer->data_size, sizeof(void *));
1941 off_end_offset = is_failure && failed_at ? failed_at :
1942 off_start_offset + buffer->offsets_size;
1943 for (buffer_offset = off_start_offset; buffer_offset < off_end_offset;
1944 buffer_offset += sizeof(binder_size_t)) {
1945 struct binder_object_header *hdr;
1946 size_t object_size = 0;
1947 struct binder_object object;
1948 binder_size_t object_offset;
1950 if (!binder_alloc_copy_from_buffer(&proc->alloc, &object_offset,
1951 buffer, buffer_offset,
1952 sizeof(object_offset)))
1953 object_size = binder_get_object(proc, NULL, buffer,
1954 object_offset, &object);
1955 if (object_size == 0) {
1956 pr_err("transaction release %d bad object at offset %lld, size %zd\n",
1957 debug_id, (u64)object_offset, buffer->data_size);
1961 switch (hdr->type) {
1962 case BINDER_TYPE_BINDER:
1963 case BINDER_TYPE_WEAK_BINDER: {
1964 struct flat_binder_object *fp;
1965 struct binder_node *node;
1967 fp = to_flat_binder_object(hdr);
1968 node = binder_get_node(proc, fp->binder);
1970 pr_err("transaction release %d bad node %016llx\n",
1971 debug_id, (u64)fp->binder);
1974 binder_debug(BINDER_DEBUG_TRANSACTION,
1975 " node %d u%016llx\n",
1976 node->debug_id, (u64)node->ptr);
1977 binder_dec_node(node, hdr->type == BINDER_TYPE_BINDER,
1979 binder_put_node(node);
1981 case BINDER_TYPE_HANDLE:
1982 case BINDER_TYPE_WEAK_HANDLE: {
1983 struct flat_binder_object *fp;
1984 struct binder_ref_data rdata;
1987 fp = to_flat_binder_object(hdr);
1988 ret = binder_dec_ref_for_handle(proc, fp->handle,
1989 hdr->type == BINDER_TYPE_HANDLE, &rdata);
1992 pr_err("transaction release %d bad handle %d, ret = %d\n",
1993 debug_id, fp->handle, ret);
1996 binder_debug(BINDER_DEBUG_TRANSACTION,
1997 " ref %d desc %d\n",
1998 rdata.debug_id, rdata.desc);
2001 case BINDER_TYPE_FD: {
2003 * No need to close the file here since user-space
2004 * closes it for successfully delivered
2005 * transactions. For transactions that weren't
2006 * delivered, the new fd was never allocated so
2007 * there is no need to close and the fput on the
2008 * file is done when the transaction is torn
2012 case BINDER_TYPE_PTR:
2014 * Nothing to do here, this will get cleaned up when the
2015 * transaction buffer gets freed
2018 case BINDER_TYPE_FDA: {
2019 struct binder_fd_array_object *fda;
2020 struct binder_buffer_object *parent;
2021 struct binder_object ptr_object;
2022 binder_size_t fda_offset;
2024 binder_size_t fd_buf_size;
2025 binder_size_t num_valid;
2029 * The fd fixups have not been applied so no
2030 * fds need to be closed.
2035 num_valid = (buffer_offset - off_start_offset) /
2036 sizeof(binder_size_t);
2037 fda = to_binder_fd_array_object(hdr);
2038 parent = binder_validate_ptr(proc, buffer, &ptr_object,
2044 pr_err("transaction release %d bad parent offset\n",
2048 fd_buf_size = sizeof(u32) * fda->num_fds;
2049 if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
2050 pr_err("transaction release %d invalid number of fds (%lld)\n",
2051 debug_id, (u64)fda->num_fds);
2054 if (fd_buf_size > parent->length ||
2055 fda->parent_offset > parent->length - fd_buf_size) {
2056 /* No space for all file descriptors here. */
2057 pr_err("transaction release %d not enough space for %lld fds in buffer\n",
2058 debug_id, (u64)fda->num_fds);
2062 * the source data for binder_buffer_object is visible
2063 * to user-space and the @buffer element is the user
2064 * pointer to the buffer_object containing the fd_array.
2065 * Convert the address to an offset relative to
2066 * the base of the transaction buffer.
2069 (parent->buffer - (uintptr_t)buffer->user_data) +
2071 for (fd_index = 0; fd_index < fda->num_fds;
2075 binder_size_t offset = fda_offset +
2076 fd_index * sizeof(fd);
2078 err = binder_alloc_copy_from_buffer(
2079 &proc->alloc, &fd, buffer,
2080 offset, sizeof(fd));
2083 binder_deferred_fd_close(fd);
2085 * Need to make sure the thread goes
2086 * back to userspace to complete the
2090 thread->looper_need_return = true;
2095 pr_err("transaction release %d bad object type %x\n",
2096 debug_id, hdr->type);
2102 static int binder_translate_binder(struct flat_binder_object *fp,
2103 struct binder_transaction *t,
2104 struct binder_thread *thread)
2106 struct binder_node *node;
2107 struct binder_proc *proc = thread->proc;
2108 struct binder_proc *target_proc = t->to_proc;
2109 struct binder_ref_data rdata;
2112 node = binder_get_node(proc, fp->binder);
2114 node = binder_new_node(proc, fp);
2118 if (fp->cookie != node->cookie) {
2119 binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
2120 proc->pid, thread->pid, (u64)fp->binder,
2121 node->debug_id, (u64)fp->cookie,
2126 if (security_binder_transfer_binder(proc->cred, target_proc->cred)) {
2131 ret = binder_inc_ref_for_node(target_proc, node,
2132 fp->hdr.type == BINDER_TYPE_BINDER,
2133 &thread->todo, &rdata);
2137 if (fp->hdr.type == BINDER_TYPE_BINDER)
2138 fp->hdr.type = BINDER_TYPE_HANDLE;
2140 fp->hdr.type = BINDER_TYPE_WEAK_HANDLE;
2142 fp->handle = rdata.desc;
2145 trace_binder_transaction_node_to_ref(t, node, &rdata);
2146 binder_debug(BINDER_DEBUG_TRANSACTION,
2147 " node %d u%016llx -> ref %d desc %d\n",
2148 node->debug_id, (u64)node->ptr,
2149 rdata.debug_id, rdata.desc);
2151 binder_put_node(node);
2155 static int binder_translate_handle(struct flat_binder_object *fp,
2156 struct binder_transaction *t,
2157 struct binder_thread *thread)
2159 struct binder_proc *proc = thread->proc;
2160 struct binder_proc *target_proc = t->to_proc;
2161 struct binder_node *node;
2162 struct binder_ref_data src_rdata;
2165 node = binder_get_node_from_ref(proc, fp->handle,
2166 fp->hdr.type == BINDER_TYPE_HANDLE, &src_rdata);
2168 binder_user_error("%d:%d got transaction with invalid handle, %d\n",
2169 proc->pid, thread->pid, fp->handle);
2172 if (security_binder_transfer_binder(proc->cred, target_proc->cred)) {
2177 binder_node_lock(node);
2178 if (node->proc == target_proc) {
2179 if (fp->hdr.type == BINDER_TYPE_HANDLE)
2180 fp->hdr.type = BINDER_TYPE_BINDER;
2182 fp->hdr.type = BINDER_TYPE_WEAK_BINDER;
2183 fp->binder = node->ptr;
2184 fp->cookie = node->cookie;
2186 binder_inner_proc_lock(node->proc);
2188 __acquire(&node->proc->inner_lock);
2189 binder_inc_node_nilocked(node,
2190 fp->hdr.type == BINDER_TYPE_BINDER,
2193 binder_inner_proc_unlock(node->proc);
2195 __release(&node->proc->inner_lock);
2196 trace_binder_transaction_ref_to_node(t, node, &src_rdata);
2197 binder_debug(BINDER_DEBUG_TRANSACTION,
2198 " ref %d desc %d -> node %d u%016llx\n",
2199 src_rdata.debug_id, src_rdata.desc, node->debug_id,
2201 binder_node_unlock(node);
2203 struct binder_ref_data dest_rdata;
2205 binder_node_unlock(node);
2206 ret = binder_inc_ref_for_node(target_proc, node,
2207 fp->hdr.type == BINDER_TYPE_HANDLE,
2213 fp->handle = dest_rdata.desc;
2215 trace_binder_transaction_ref_to_ref(t, node, &src_rdata,
2217 binder_debug(BINDER_DEBUG_TRANSACTION,
2218 " ref %d desc %d -> ref %d desc %d (node %d)\n",
2219 src_rdata.debug_id, src_rdata.desc,
2220 dest_rdata.debug_id, dest_rdata.desc,
2224 binder_put_node(node);
2228 static int binder_translate_fd(u32 fd, binder_size_t fd_offset,
2229 struct binder_transaction *t,
2230 struct binder_thread *thread,
2231 struct binder_transaction *in_reply_to)
2233 struct binder_proc *proc = thread->proc;
2234 struct binder_proc *target_proc = t->to_proc;
2235 struct binder_txn_fd_fixup *fixup;
2238 bool target_allows_fd;
2241 target_allows_fd = !!(in_reply_to->flags & TF_ACCEPT_FDS);
2243 target_allows_fd = t->buffer->target_node->accept_fds;
2244 if (!target_allows_fd) {
2245 binder_user_error("%d:%d got %s with fd, %d, but target does not allow fds\n",
2246 proc->pid, thread->pid,
2247 in_reply_to ? "reply" : "transaction",
2250 goto err_fd_not_accepted;
2255 binder_user_error("%d:%d got transaction with invalid fd, %d\n",
2256 proc->pid, thread->pid, fd);
2260 ret = security_binder_transfer_file(proc->cred, target_proc->cred, file);
2267 * Add fixup record for this transaction. The allocation
2268 * of the fd in the target needs to be done from a
2271 fixup = kzalloc(sizeof(*fixup), GFP_KERNEL);
2277 fixup->offset = fd_offset;
2278 fixup->target_fd = -1;
2279 trace_binder_transaction_fd_send(t, fd, fixup->offset);
2280 list_add_tail(&fixup->fixup_entry, &t->fd_fixups);
2288 err_fd_not_accepted:
2293 * struct binder_ptr_fixup - data to be fixed-up in target buffer
2294 * @offset offset in target buffer to fixup
2295 * @skip_size bytes to skip in copy (fixup will be written later)
2296 * @fixup_data data to write at fixup offset
2299 * This is used for the pointer fixup list (pf) which is created and consumed
2300 * during binder_transaction() and is only accessed locally. No
2301 * locking is necessary.
2303 * The list is ordered by @offset.
2305 struct binder_ptr_fixup {
2306 binder_size_t offset;
2308 binder_uintptr_t fixup_data;
2309 struct list_head node;
2313 * struct binder_sg_copy - scatter-gather data to be copied
2314 * @offset offset in target buffer
2315 * @sender_uaddr user address in source buffer
2316 * @length bytes to copy
2319 * This is used for the sg copy list (sgc) which is created and consumed
2320 * during binder_transaction() and is only accessed locally. No
2321 * locking is necessary.
2323 * The list is ordered by @offset.
2325 struct binder_sg_copy {
2326 binder_size_t offset;
2327 const void __user *sender_uaddr;
2329 struct list_head node;
2333 * binder_do_deferred_txn_copies() - copy and fixup scatter-gather data
2334 * @alloc: binder_alloc associated with @buffer
2335 * @buffer: binder buffer in target process
2336 * @sgc_head: list_head of scatter-gather copy list
2337 * @pf_head: list_head of pointer fixup list
2339 * Processes all elements of @sgc_head, applying fixups from @pf_head
2340 * and copying the scatter-gather data from the source process' user
2341 * buffer to the target's buffer. It is expected that the list creation
2342 * and processing all occurs during binder_transaction() so these lists
2343 * are only accessed in local context.
2345 * Return: 0=success, else -errno
2347 static int binder_do_deferred_txn_copies(struct binder_alloc *alloc,
2348 struct binder_buffer *buffer,
2349 struct list_head *sgc_head,
2350 struct list_head *pf_head)
2353 struct binder_sg_copy *sgc, *tmpsgc;
2354 struct binder_ptr_fixup *tmppf;
2355 struct binder_ptr_fixup *pf =
2356 list_first_entry_or_null(pf_head, struct binder_ptr_fixup,
2359 list_for_each_entry_safe(sgc, tmpsgc, sgc_head, node) {
2360 size_t bytes_copied = 0;
2362 while (bytes_copied < sgc->length) {
2364 size_t bytes_left = sgc->length - bytes_copied;
2365 size_t offset = sgc->offset + bytes_copied;
2368 * We copy up to the fixup (pointed to by pf)
2370 copy_size = pf ? min(bytes_left, (size_t)pf->offset - offset)
2372 if (!ret && copy_size)
2373 ret = binder_alloc_copy_user_to_buffer(
2376 sgc->sender_uaddr + bytes_copied,
2378 bytes_copied += copy_size;
2379 if (copy_size != bytes_left) {
2381 /* we stopped at a fixup offset */
2382 if (pf->skip_size) {
2384 * we are just skipping. This is for
2385 * BINDER_TYPE_FDA where the translated
2386 * fds will be fixed up when we get
2387 * to target context.
2389 bytes_copied += pf->skip_size;
2391 /* apply the fixup indicated by pf */
2393 ret = binder_alloc_copy_to_buffer(
2397 sizeof(pf->fixup_data));
2398 bytes_copied += sizeof(pf->fixup_data);
2400 list_del(&pf->node);
2402 pf = list_first_entry_or_null(pf_head,
2403 struct binder_ptr_fixup, node);
2406 list_del(&sgc->node);
2409 list_for_each_entry_safe(pf, tmppf, pf_head, node) {
2410 BUG_ON(pf->skip_size == 0);
2411 list_del(&pf->node);
2414 BUG_ON(!list_empty(sgc_head));
2416 return ret > 0 ? -EINVAL : ret;
2420 * binder_cleanup_deferred_txn_lists() - free specified lists
2421 * @sgc_head: list_head of scatter-gather copy list
2422 * @pf_head: list_head of pointer fixup list
2424 * Called to clean up @sgc_head and @pf_head if there is an
2427 static void binder_cleanup_deferred_txn_lists(struct list_head *sgc_head,
2428 struct list_head *pf_head)
2430 struct binder_sg_copy *sgc, *tmpsgc;
2431 struct binder_ptr_fixup *pf, *tmppf;
2433 list_for_each_entry_safe(sgc, tmpsgc, sgc_head, node) {
2434 list_del(&sgc->node);
2437 list_for_each_entry_safe(pf, tmppf, pf_head, node) {
2438 list_del(&pf->node);
2444 * binder_defer_copy() - queue a scatter-gather buffer for copy
2445 * @sgc_head: list_head of scatter-gather copy list
2446 * @offset: binder buffer offset in target process
2447 * @sender_uaddr: user address in source process
2448 * @length: bytes to copy
2450 * Specify a scatter-gather block to be copied. The actual copy must
2451 * be deferred until all the needed fixups are identified and queued.
2452 * Then the copy and fixups are done together so un-translated values
2453 * from the source are never visible in the target buffer.
2455 * We are guaranteed that repeated calls to this function will have
2456 * monotonically increasing @offset values so the list will naturally
2459 * Return: 0=success, else -errno
2461 static int binder_defer_copy(struct list_head *sgc_head, binder_size_t offset,
2462 const void __user *sender_uaddr, size_t length)
2464 struct binder_sg_copy *bc = kzalloc(sizeof(*bc), GFP_KERNEL);
2469 bc->offset = offset;
2470 bc->sender_uaddr = sender_uaddr;
2471 bc->length = length;
2472 INIT_LIST_HEAD(&bc->node);
2475 * We are guaranteed that the deferred copies are in-order
2476 * so just add to the tail.
2478 list_add_tail(&bc->node, sgc_head);
2484 * binder_add_fixup() - queue a fixup to be applied to sg copy
2485 * @pf_head: list_head of binder ptr fixup list
2486 * @offset: binder buffer offset in target process
2487 * @fixup: bytes to be copied for fixup
2488 * @skip_size: bytes to skip when copying (fixup will be applied later)
2490 * Add the specified fixup to a list ordered by @offset. When copying
2491 * the scatter-gather buffers, the fixup will be copied instead of
2492 * data from the source buffer. For BINDER_TYPE_FDA fixups, the fixup
2493 * will be applied later (in target process context), so we just skip
2494 * the bytes specified by @skip_size. If @skip_size is 0, we copy the
2497 * This function is called *mostly* in @offset order, but there are
2498 * exceptions. Since out-of-order inserts are relatively uncommon,
2499 * we insert the new element by searching backward from the tail of
2502 * Return: 0=success, else -errno
2504 static int binder_add_fixup(struct list_head *pf_head, binder_size_t offset,
2505 binder_uintptr_t fixup, size_t skip_size)
2507 struct binder_ptr_fixup *pf = kzalloc(sizeof(*pf), GFP_KERNEL);
2508 struct binder_ptr_fixup *tmppf;
2513 pf->offset = offset;
2514 pf->fixup_data = fixup;
2515 pf->skip_size = skip_size;
2516 INIT_LIST_HEAD(&pf->node);
2518 /* Fixups are *mostly* added in-order, but there are some
2519 * exceptions. Look backwards through list for insertion point.
2521 list_for_each_entry_reverse(tmppf, pf_head, node) {
2522 if (tmppf->offset < pf->offset) {
2523 list_add(&pf->node, &tmppf->node);
2528 * if we get here, then the new offset is the lowest so
2529 * insert at the head
2531 list_add(&pf->node, pf_head);
2535 static int binder_translate_fd_array(struct list_head *pf_head,
2536 struct binder_fd_array_object *fda,
2537 const void __user *sender_ubuffer,
2538 struct binder_buffer_object *parent,
2539 struct binder_buffer_object *sender_uparent,
2540 struct binder_transaction *t,
2541 struct binder_thread *thread,
2542 struct binder_transaction *in_reply_to)
2544 binder_size_t fdi, fd_buf_size;
2545 binder_size_t fda_offset;
2546 const void __user *sender_ufda_base;
2547 struct binder_proc *proc = thread->proc;
2550 if (fda->num_fds == 0)
2553 fd_buf_size = sizeof(u32) * fda->num_fds;
2554 if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
2555 binder_user_error("%d:%d got transaction with invalid number of fds (%lld)\n",
2556 proc->pid, thread->pid, (u64)fda->num_fds);
2559 if (fd_buf_size > parent->length ||
2560 fda->parent_offset > parent->length - fd_buf_size) {
2561 /* No space for all file descriptors here. */
2562 binder_user_error("%d:%d not enough space to store %lld fds in buffer\n",
2563 proc->pid, thread->pid, (u64)fda->num_fds);
2567 * the source data for binder_buffer_object is visible
2568 * to user-space and the @buffer element is the user
2569 * pointer to the buffer_object containing the fd_array.
2570 * Convert the address to an offset relative to
2571 * the base of the transaction buffer.
2573 fda_offset = (parent->buffer - (uintptr_t)t->buffer->user_data) +
2575 sender_ufda_base = (void __user *)(uintptr_t)sender_uparent->buffer +
2578 if (!IS_ALIGNED((unsigned long)fda_offset, sizeof(u32)) ||
2579 !IS_ALIGNED((unsigned long)sender_ufda_base, sizeof(u32))) {
2580 binder_user_error("%d:%d parent offset not aligned correctly.\n",
2581 proc->pid, thread->pid);
2584 ret = binder_add_fixup(pf_head, fda_offset, 0, fda->num_fds * sizeof(u32));
2588 for (fdi = 0; fdi < fda->num_fds; fdi++) {
2590 binder_size_t offset = fda_offset + fdi * sizeof(fd);
2591 binder_size_t sender_uoffset = fdi * sizeof(fd);
2593 ret = copy_from_user(&fd, sender_ufda_base + sender_uoffset, sizeof(fd));
2595 ret = binder_translate_fd(fd, offset, t, thread,
2598 return ret > 0 ? -EINVAL : ret;
2603 static int binder_fixup_parent(struct list_head *pf_head,
2604 struct binder_transaction *t,
2605 struct binder_thread *thread,
2606 struct binder_buffer_object *bp,
2607 binder_size_t off_start_offset,
2608 binder_size_t num_valid,
2609 binder_size_t last_fixup_obj_off,
2610 binder_size_t last_fixup_min_off)
2612 struct binder_buffer_object *parent;
2613 struct binder_buffer *b = t->buffer;
2614 struct binder_proc *proc = thread->proc;
2615 struct binder_proc *target_proc = t->to_proc;
2616 struct binder_object object;
2617 binder_size_t buffer_offset;
2618 binder_size_t parent_offset;
2620 if (!(bp->flags & BINDER_BUFFER_FLAG_HAS_PARENT))
2623 parent = binder_validate_ptr(target_proc, b, &object, bp->parent,
2624 off_start_offset, &parent_offset,
2627 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2628 proc->pid, thread->pid);
2632 if (!binder_validate_fixup(target_proc, b, off_start_offset,
2633 parent_offset, bp->parent_offset,
2635 last_fixup_min_off)) {
2636 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
2637 proc->pid, thread->pid);
2641 if (parent->length < sizeof(binder_uintptr_t) ||
2642 bp->parent_offset > parent->length - sizeof(binder_uintptr_t)) {
2643 /* No space for a pointer here! */
2644 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2645 proc->pid, thread->pid);
2648 buffer_offset = bp->parent_offset +
2649 (uintptr_t)parent->buffer - (uintptr_t)b->user_data;
2650 return binder_add_fixup(pf_head, buffer_offset, bp->buffer, 0);
2654 * binder_can_update_transaction() - Can a txn be superseded by an updated one?
2655 * @t1: the pending async txn in the frozen process
2656 * @t2: the new async txn to supersede the outdated pending one
2658 * Return: true if t2 can supersede t1
2659 * false if t2 can not supersede t1
2661 static bool binder_can_update_transaction(struct binder_transaction *t1,
2662 struct binder_transaction *t2)
2664 if ((t1->flags & t2->flags & (TF_ONE_WAY | TF_UPDATE_TXN)) !=
2665 (TF_ONE_WAY | TF_UPDATE_TXN) || !t1->to_proc || !t2->to_proc)
2667 if (t1->to_proc->tsk == t2->to_proc->tsk && t1->code == t2->code &&
2668 t1->flags == t2->flags && t1->buffer->pid == t2->buffer->pid &&
2669 t1->buffer->target_node->ptr == t2->buffer->target_node->ptr &&
2670 t1->buffer->target_node->cookie == t2->buffer->target_node->cookie)
2676 * binder_find_outdated_transaction_ilocked() - Find the outdated transaction
2677 * @t: new async transaction
2678 * @target_list: list to find outdated transaction
2680 * Return: the outdated transaction if found
2681 * NULL if no outdated transacton can be found
2683 * Requires the proc->inner_lock to be held.
2685 static struct binder_transaction *
2686 binder_find_outdated_transaction_ilocked(struct binder_transaction *t,
2687 struct list_head *target_list)
2689 struct binder_work *w;
2691 list_for_each_entry(w, target_list, entry) {
2692 struct binder_transaction *t_queued;
2694 if (w->type != BINDER_WORK_TRANSACTION)
2696 t_queued = container_of(w, struct binder_transaction, work);
2697 if (binder_can_update_transaction(t_queued, t))
2704 * binder_proc_transaction() - sends a transaction to a process and wakes it up
2705 * @t: transaction to send
2706 * @proc: process to send the transaction to
2707 * @thread: thread in @proc to send the transaction to (may be NULL)
2709 * This function queues a transaction to the specified process. It will try
2710 * to find a thread in the target process to handle the transaction and
2711 * wake it up. If no thread is found, the work is queued to the proc
2714 * If the @thread parameter is not NULL, the transaction is always queued
2715 * to the waitlist of that specific thread.
2717 * Return: 0 if the transaction was successfully queued
2718 * BR_DEAD_REPLY if the target process or thread is dead
2719 * BR_FROZEN_REPLY if the target process or thread is frozen
2721 static int binder_proc_transaction(struct binder_transaction *t,
2722 struct binder_proc *proc,
2723 struct binder_thread *thread)
2725 struct binder_node *node = t->buffer->target_node;
2726 bool oneway = !!(t->flags & TF_ONE_WAY);
2727 bool pending_async = false;
2728 struct binder_transaction *t_outdated = NULL;
2731 binder_node_lock(node);
2734 if (node->has_async_transaction)
2735 pending_async = true;
2737 node->has_async_transaction = true;
2740 binder_inner_proc_lock(proc);
2741 if (proc->is_frozen) {
2742 proc->sync_recv |= !oneway;
2743 proc->async_recv |= oneway;
2746 if ((proc->is_frozen && !oneway) || proc->is_dead ||
2747 (thread && thread->is_dead)) {
2748 binder_inner_proc_unlock(proc);
2749 binder_node_unlock(node);
2750 return proc->is_frozen ? BR_FROZEN_REPLY : BR_DEAD_REPLY;
2753 if (!thread && !pending_async)
2754 thread = binder_select_thread_ilocked(proc);
2757 binder_enqueue_thread_work_ilocked(thread, &t->work);
2758 } else if (!pending_async) {
2759 binder_enqueue_work_ilocked(&t->work, &proc->todo);
2761 if ((t->flags & TF_UPDATE_TXN) && proc->is_frozen) {
2762 t_outdated = binder_find_outdated_transaction_ilocked(t,
2765 binder_debug(BINDER_DEBUG_TRANSACTION,
2766 "txn %d supersedes %d\n",
2767 t->debug_id, t_outdated->debug_id);
2768 list_del_init(&t_outdated->work.entry);
2769 proc->outstanding_txns--;
2772 binder_enqueue_work_ilocked(&t->work, &node->async_todo);
2776 binder_wakeup_thread_ilocked(proc, thread, !oneway /* sync */);
2778 proc->outstanding_txns++;
2779 binder_inner_proc_unlock(proc);
2780 binder_node_unlock(node);
2783 * To reduce potential contention, free the outdated transaction and
2784 * buffer after releasing the locks.
2787 struct binder_buffer *buffer = t_outdated->buffer;
2789 t_outdated->buffer = NULL;
2790 buffer->transaction = NULL;
2791 trace_binder_transaction_update_buffer_release(buffer);
2792 binder_transaction_buffer_release(proc, NULL, buffer, 0, 0);
2793 binder_alloc_free_buf(&proc->alloc, buffer);
2795 binder_stats_deleted(BINDER_STAT_TRANSACTION);
2802 * binder_get_node_refs_for_txn() - Get required refs on node for txn
2803 * @node: struct binder_node for which to get refs
2804 * @proc: returns @node->proc if valid
2805 * @error: if no @proc then returns BR_DEAD_REPLY
2807 * User-space normally keeps the node alive when creating a transaction
2808 * since it has a reference to the target. The local strong ref keeps it
2809 * alive if the sending process dies before the target process processes
2810 * the transaction. If the source process is malicious or has a reference
2811 * counting bug, relying on the local strong ref can fail.
2813 * Since user-space can cause the local strong ref to go away, we also take
2814 * a tmpref on the node to ensure it survives while we are constructing
2815 * the transaction. We also need a tmpref on the proc while we are
2816 * constructing the transaction, so we take that here as well.
2818 * Return: The target_node with refs taken or NULL if no @node->proc is NULL.
2819 * Also sets @proc if valid. If the @node->proc is NULL indicating that the
2820 * target proc has died, @error is set to BR_DEAD_REPLY
2822 static struct binder_node *binder_get_node_refs_for_txn(
2823 struct binder_node *node,
2824 struct binder_proc **procp,
2827 struct binder_node *target_node = NULL;
2829 binder_node_inner_lock(node);
2832 binder_inc_node_nilocked(node, 1, 0, NULL);
2833 binder_inc_node_tmpref_ilocked(node);
2834 node->proc->tmp_ref++;
2835 *procp = node->proc;
2837 *error = BR_DEAD_REPLY;
2838 binder_node_inner_unlock(node);
2843 static void binder_set_txn_from_error(struct binder_transaction *t, int id,
2844 uint32_t command, int32_t param)
2846 struct binder_thread *from = binder_get_txn_from_and_acq_inner(t);
2849 /* annotation for sparse */
2850 __release(&from->proc->inner_lock);
2854 /* don't override existing errors */
2855 if (from->ee.command == BR_OK)
2856 binder_set_extended_error(&from->ee, id, command, param);
2857 binder_inner_proc_unlock(from->proc);
2858 binder_thread_dec_tmpref(from);
2861 static void binder_transaction(struct binder_proc *proc,
2862 struct binder_thread *thread,
2863 struct binder_transaction_data *tr, int reply,
2864 binder_size_t extra_buffers_size)
2867 struct binder_transaction *t;
2868 struct binder_work *w;
2869 struct binder_work *tcomplete;
2870 binder_size_t buffer_offset = 0;
2871 binder_size_t off_start_offset, off_end_offset;
2872 binder_size_t off_min;
2873 binder_size_t sg_buf_offset, sg_buf_end_offset;
2874 binder_size_t user_offset = 0;
2875 struct binder_proc *target_proc = NULL;
2876 struct binder_thread *target_thread = NULL;
2877 struct binder_node *target_node = NULL;
2878 struct binder_transaction *in_reply_to = NULL;
2879 struct binder_transaction_log_entry *e;
2880 uint32_t return_error = 0;
2881 uint32_t return_error_param = 0;
2882 uint32_t return_error_line = 0;
2883 binder_size_t last_fixup_obj_off = 0;
2884 binder_size_t last_fixup_min_off = 0;
2885 struct binder_context *context = proc->context;
2886 int t_debug_id = atomic_inc_return(&binder_last_id);
2887 char *secctx = NULL;
2889 struct list_head sgc_head;
2890 struct list_head pf_head;
2891 const void __user *user_buffer = (const void __user *)
2892 (uintptr_t)tr->data.ptr.buffer;
2893 INIT_LIST_HEAD(&sgc_head);
2894 INIT_LIST_HEAD(&pf_head);
2896 e = binder_transaction_log_add(&binder_transaction_log);
2897 e->debug_id = t_debug_id;
2898 e->call_type = reply ? 2 : !!(tr->flags & TF_ONE_WAY);
2899 e->from_proc = proc->pid;
2900 e->from_thread = thread->pid;
2901 e->target_handle = tr->target.handle;
2902 e->data_size = tr->data_size;
2903 e->offsets_size = tr->offsets_size;
2904 strscpy(e->context_name, proc->context->name, BINDERFS_MAX_NAME);
2906 binder_inner_proc_lock(proc);
2907 binder_set_extended_error(&thread->ee, t_debug_id, BR_OK, 0);
2908 binder_inner_proc_unlock(proc);
2911 binder_inner_proc_lock(proc);
2912 in_reply_to = thread->transaction_stack;
2913 if (in_reply_to == NULL) {
2914 binder_inner_proc_unlock(proc);
2915 binder_user_error("%d:%d got reply transaction with no transaction stack\n",
2916 proc->pid, thread->pid);
2917 return_error = BR_FAILED_REPLY;
2918 return_error_param = -EPROTO;
2919 return_error_line = __LINE__;
2920 goto err_empty_call_stack;
2922 if (in_reply_to->to_thread != thread) {
2923 spin_lock(&in_reply_to->lock);
2924 binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
2925 proc->pid, thread->pid, in_reply_to->debug_id,
2926 in_reply_to->to_proc ?
2927 in_reply_to->to_proc->pid : 0,
2928 in_reply_to->to_thread ?
2929 in_reply_to->to_thread->pid : 0);
2930 spin_unlock(&in_reply_to->lock);
2931 binder_inner_proc_unlock(proc);
2932 return_error = BR_FAILED_REPLY;
2933 return_error_param = -EPROTO;
2934 return_error_line = __LINE__;
2936 goto err_bad_call_stack;
2938 thread->transaction_stack = in_reply_to->to_parent;
2939 binder_inner_proc_unlock(proc);
2940 binder_set_nice(in_reply_to->saved_priority);
2941 target_thread = binder_get_txn_from_and_acq_inner(in_reply_to);
2942 if (target_thread == NULL) {
2943 /* annotation for sparse */
2944 __release(&target_thread->proc->inner_lock);
2945 binder_txn_error("%d:%d reply target not found\n",
2946 thread->pid, proc->pid);
2947 return_error = BR_DEAD_REPLY;
2948 return_error_line = __LINE__;
2949 goto err_dead_binder;
2951 if (target_thread->transaction_stack != in_reply_to) {
2952 binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
2953 proc->pid, thread->pid,
2954 target_thread->transaction_stack ?
2955 target_thread->transaction_stack->debug_id : 0,
2956 in_reply_to->debug_id);
2957 binder_inner_proc_unlock(target_thread->proc);
2958 return_error = BR_FAILED_REPLY;
2959 return_error_param = -EPROTO;
2960 return_error_line = __LINE__;
2962 target_thread = NULL;
2963 goto err_dead_binder;
2965 target_proc = target_thread->proc;
2966 target_proc->tmp_ref++;
2967 binder_inner_proc_unlock(target_thread->proc);
2969 if (tr->target.handle) {
2970 struct binder_ref *ref;
2973 * There must already be a strong ref
2974 * on this node. If so, do a strong
2975 * increment on the node to ensure it
2976 * stays alive until the transaction is
2979 binder_proc_lock(proc);
2980 ref = binder_get_ref_olocked(proc, tr->target.handle,
2983 target_node = binder_get_node_refs_for_txn(
2984 ref->node, &target_proc,
2987 binder_user_error("%d:%d got transaction to invalid handle, %u\n",
2988 proc->pid, thread->pid, tr->target.handle);
2989 return_error = BR_FAILED_REPLY;
2991 binder_proc_unlock(proc);
2993 mutex_lock(&context->context_mgr_node_lock);
2994 target_node = context->binder_context_mgr_node;
2996 target_node = binder_get_node_refs_for_txn(
2997 target_node, &target_proc,
3000 return_error = BR_DEAD_REPLY;
3001 mutex_unlock(&context->context_mgr_node_lock);
3002 if (target_node && target_proc->pid == proc->pid) {
3003 binder_user_error("%d:%d got transaction to context manager from process owning it\n",
3004 proc->pid, thread->pid);
3005 return_error = BR_FAILED_REPLY;
3006 return_error_param = -EINVAL;
3007 return_error_line = __LINE__;
3008 goto err_invalid_target_handle;
3012 binder_txn_error("%d:%d cannot find target node\n",
3013 thread->pid, proc->pid);
3015 * return_error is set above
3017 return_error_param = -EINVAL;
3018 return_error_line = __LINE__;
3019 goto err_dead_binder;
3021 e->to_node = target_node->debug_id;
3022 if (WARN_ON(proc == target_proc)) {
3023 binder_txn_error("%d:%d self transactions not allowed\n",
3024 thread->pid, proc->pid);
3025 return_error = BR_FAILED_REPLY;
3026 return_error_param = -EINVAL;
3027 return_error_line = __LINE__;
3028 goto err_invalid_target_handle;
3030 if (security_binder_transaction(proc->cred,
3031 target_proc->cred) < 0) {
3032 binder_txn_error("%d:%d transaction credentials failed\n",
3033 thread->pid, proc->pid);
3034 return_error = BR_FAILED_REPLY;
3035 return_error_param = -EPERM;
3036 return_error_line = __LINE__;
3037 goto err_invalid_target_handle;
3039 binder_inner_proc_lock(proc);
3041 w = list_first_entry_or_null(&thread->todo,
3042 struct binder_work, entry);
3043 if (!(tr->flags & TF_ONE_WAY) && w &&
3044 w->type == BINDER_WORK_TRANSACTION) {
3046 * Do not allow new outgoing transaction from a
3047 * thread that has a transaction at the head of
3048 * its todo list. Only need to check the head
3049 * because binder_select_thread_ilocked picks a
3050 * thread from proc->waiting_threads to enqueue
3051 * the transaction, and nothing is queued to the
3052 * todo list while the thread is on waiting_threads.
3054 binder_user_error("%d:%d new transaction not allowed when there is a transaction on thread todo\n",
3055 proc->pid, thread->pid);
3056 binder_inner_proc_unlock(proc);
3057 return_error = BR_FAILED_REPLY;
3058 return_error_param = -EPROTO;
3059 return_error_line = __LINE__;
3060 goto err_bad_todo_list;
3063 if (!(tr->flags & TF_ONE_WAY) && thread->transaction_stack) {
3064 struct binder_transaction *tmp;
3066 tmp = thread->transaction_stack;
3067 if (tmp->to_thread != thread) {
3068 spin_lock(&tmp->lock);
3069 binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
3070 proc->pid, thread->pid, tmp->debug_id,
3071 tmp->to_proc ? tmp->to_proc->pid : 0,
3073 tmp->to_thread->pid : 0);
3074 spin_unlock(&tmp->lock);
3075 binder_inner_proc_unlock(proc);
3076 return_error = BR_FAILED_REPLY;
3077 return_error_param = -EPROTO;
3078 return_error_line = __LINE__;
3079 goto err_bad_call_stack;
3082 struct binder_thread *from;
3084 spin_lock(&tmp->lock);
3086 if (from && from->proc == target_proc) {
3087 atomic_inc(&from->tmp_ref);
3088 target_thread = from;
3089 spin_unlock(&tmp->lock);
3092 spin_unlock(&tmp->lock);
3093 tmp = tmp->from_parent;
3096 binder_inner_proc_unlock(proc);
3099 e->to_thread = target_thread->pid;
3100 e->to_proc = target_proc->pid;
3102 /* TODO: reuse incoming transaction for reply */
3103 t = kzalloc(sizeof(*t), GFP_KERNEL);
3105 binder_txn_error("%d:%d cannot allocate transaction\n",
3106 thread->pid, proc->pid);
3107 return_error = BR_FAILED_REPLY;
3108 return_error_param = -ENOMEM;
3109 return_error_line = __LINE__;
3110 goto err_alloc_t_failed;
3112 INIT_LIST_HEAD(&t->fd_fixups);
3113 binder_stats_created(BINDER_STAT_TRANSACTION);
3114 spin_lock_init(&t->lock);
3116 tcomplete = kzalloc(sizeof(*tcomplete), GFP_KERNEL);
3117 if (tcomplete == NULL) {
3118 binder_txn_error("%d:%d cannot allocate work for transaction\n",
3119 thread->pid, proc->pid);
3120 return_error = BR_FAILED_REPLY;
3121 return_error_param = -ENOMEM;
3122 return_error_line = __LINE__;
3123 goto err_alloc_tcomplete_failed;
3125 binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE);
3127 t->debug_id = t_debug_id;
3130 binder_debug(BINDER_DEBUG_TRANSACTION,
3131 "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld-%lld\n",
3132 proc->pid, thread->pid, t->debug_id,
3133 target_proc->pid, target_thread->pid,
3134 (u64)tr->data.ptr.buffer,
3135 (u64)tr->data.ptr.offsets,
3136 (u64)tr->data_size, (u64)tr->offsets_size,
3137 (u64)extra_buffers_size);
3139 binder_debug(BINDER_DEBUG_TRANSACTION,
3140 "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld-%lld\n",
3141 proc->pid, thread->pid, t->debug_id,
3142 target_proc->pid, target_node->debug_id,
3143 (u64)tr->data.ptr.buffer,
3144 (u64)tr->data.ptr.offsets,
3145 (u64)tr->data_size, (u64)tr->offsets_size,
3146 (u64)extra_buffers_size);
3148 if (!reply && !(tr->flags & TF_ONE_WAY))
3152 t->sender_euid = task_euid(proc->tsk);
3153 t->to_proc = target_proc;
3154 t->to_thread = target_thread;
3156 t->flags = tr->flags;
3157 t->priority = task_nice(current);
3159 if (target_node && target_node->txn_security_ctx) {
3163 security_cred_getsecid(proc->cred, &secid);
3164 ret = security_secid_to_secctx(secid, &secctx, &secctx_sz);
3166 binder_txn_error("%d:%d failed to get security context\n",
3167 thread->pid, proc->pid);
3168 return_error = BR_FAILED_REPLY;
3169 return_error_param = ret;
3170 return_error_line = __LINE__;
3171 goto err_get_secctx_failed;
3173 added_size = ALIGN(secctx_sz, sizeof(u64));
3174 extra_buffers_size += added_size;
3175 if (extra_buffers_size < added_size) {
3176 binder_txn_error("%d:%d integer overflow of extra_buffers_size\n",
3177 thread->pid, proc->pid);
3178 return_error = BR_FAILED_REPLY;
3179 return_error_param = -EINVAL;
3180 return_error_line = __LINE__;
3181 goto err_bad_extra_size;
3185 trace_binder_transaction(reply, t, target_node);
3187 t->buffer = binder_alloc_new_buf(&target_proc->alloc, tr->data_size,
3188 tr->offsets_size, extra_buffers_size,
3189 !reply && (t->flags & TF_ONE_WAY), current->tgid);
3190 if (IS_ERR(t->buffer)) {
3193 ret = PTR_ERR(t->buffer);
3194 s = (ret == -ESRCH) ? ": vma cleared, target dead or dying"
3195 : (ret == -ENOSPC) ? ": no space left"
3196 : (ret == -ENOMEM) ? ": memory allocation failed"
3198 binder_txn_error("cannot allocate buffer%s", s);
3200 return_error_param = PTR_ERR(t->buffer);
3201 return_error = return_error_param == -ESRCH ?
3202 BR_DEAD_REPLY : BR_FAILED_REPLY;
3203 return_error_line = __LINE__;
3205 goto err_binder_alloc_buf_failed;
3209 size_t buf_offset = ALIGN(tr->data_size, sizeof(void *)) +
3210 ALIGN(tr->offsets_size, sizeof(void *)) +
3211 ALIGN(extra_buffers_size, sizeof(void *)) -
3212 ALIGN(secctx_sz, sizeof(u64));
3214 t->security_ctx = (uintptr_t)t->buffer->user_data + buf_offset;
3215 err = binder_alloc_copy_to_buffer(&target_proc->alloc,
3216 t->buffer, buf_offset,
3219 t->security_ctx = 0;
3222 security_release_secctx(secctx, secctx_sz);
3225 t->buffer->debug_id = t->debug_id;
3226 t->buffer->transaction = t;
3227 t->buffer->target_node = target_node;
3228 t->buffer->clear_on_free = !!(t->flags & TF_CLEAR_BUF);
3229 trace_binder_transaction_alloc_buf(t->buffer);
3231 if (binder_alloc_copy_user_to_buffer(
3232 &target_proc->alloc,
3234 ALIGN(tr->data_size, sizeof(void *)),
3235 (const void __user *)
3236 (uintptr_t)tr->data.ptr.offsets,
3237 tr->offsets_size)) {
3238 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
3239 proc->pid, thread->pid);
3240 return_error = BR_FAILED_REPLY;
3241 return_error_param = -EFAULT;
3242 return_error_line = __LINE__;
3243 goto err_copy_data_failed;
3245 if (!IS_ALIGNED(tr->offsets_size, sizeof(binder_size_t))) {
3246 binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
3247 proc->pid, thread->pid, (u64)tr->offsets_size);
3248 return_error = BR_FAILED_REPLY;
3249 return_error_param = -EINVAL;
3250 return_error_line = __LINE__;
3251 goto err_bad_offset;
3253 if (!IS_ALIGNED(extra_buffers_size, sizeof(u64))) {
3254 binder_user_error("%d:%d got transaction with unaligned buffers size, %lld\n",
3255 proc->pid, thread->pid,
3256 (u64)extra_buffers_size);
3257 return_error = BR_FAILED_REPLY;
3258 return_error_param = -EINVAL;
3259 return_error_line = __LINE__;
3260 goto err_bad_offset;
3262 off_start_offset = ALIGN(tr->data_size, sizeof(void *));
3263 buffer_offset = off_start_offset;
3264 off_end_offset = off_start_offset + tr->offsets_size;
3265 sg_buf_offset = ALIGN(off_end_offset, sizeof(void *));
3266 sg_buf_end_offset = sg_buf_offset + extra_buffers_size -
3267 ALIGN(secctx_sz, sizeof(u64));
3269 for (buffer_offset = off_start_offset; buffer_offset < off_end_offset;
3270 buffer_offset += sizeof(binder_size_t)) {
3271 struct binder_object_header *hdr;
3273 struct binder_object object;
3274 binder_size_t object_offset;
3275 binder_size_t copy_size;
3277 if (binder_alloc_copy_from_buffer(&target_proc->alloc,
3281 sizeof(object_offset))) {
3282 binder_txn_error("%d:%d copy offset from buffer failed\n",
3283 thread->pid, proc->pid);
3284 return_error = BR_FAILED_REPLY;
3285 return_error_param = -EINVAL;
3286 return_error_line = __LINE__;
3287 goto err_bad_offset;
3291 * Copy the source user buffer up to the next object
3292 * that will be processed.
3294 copy_size = object_offset - user_offset;
3295 if (copy_size && (user_offset > object_offset ||
3296 binder_alloc_copy_user_to_buffer(
3297 &target_proc->alloc,
3298 t->buffer, user_offset,
3299 user_buffer + user_offset,
3301 binder_user_error("%d:%d got transaction with invalid data ptr\n",
3302 proc->pid, thread->pid);
3303 return_error = BR_FAILED_REPLY;
3304 return_error_param = -EFAULT;
3305 return_error_line = __LINE__;
3306 goto err_copy_data_failed;
3308 object_size = binder_get_object(target_proc, user_buffer,
3309 t->buffer, object_offset, &object);
3310 if (object_size == 0 || object_offset < off_min) {
3311 binder_user_error("%d:%d got transaction with invalid offset (%lld, min %lld max %lld) or object.\n",
3312 proc->pid, thread->pid,
3315 (u64)t->buffer->data_size);
3316 return_error = BR_FAILED_REPLY;
3317 return_error_param = -EINVAL;
3318 return_error_line = __LINE__;
3319 goto err_bad_offset;
3322 * Set offset to the next buffer fragment to be
3325 user_offset = object_offset + object_size;
3328 off_min = object_offset + object_size;
3329 switch (hdr->type) {
3330 case BINDER_TYPE_BINDER:
3331 case BINDER_TYPE_WEAK_BINDER: {
3332 struct flat_binder_object *fp;
3334 fp = to_flat_binder_object(hdr);
3335 ret = binder_translate_binder(fp, t, thread);
3338 binder_alloc_copy_to_buffer(&target_proc->alloc,
3342 binder_txn_error("%d:%d translate binder failed\n",
3343 thread->pid, proc->pid);
3344 return_error = BR_FAILED_REPLY;
3345 return_error_param = ret;
3346 return_error_line = __LINE__;
3347 goto err_translate_failed;
3350 case BINDER_TYPE_HANDLE:
3351 case BINDER_TYPE_WEAK_HANDLE: {
3352 struct flat_binder_object *fp;
3354 fp = to_flat_binder_object(hdr);
3355 ret = binder_translate_handle(fp, t, thread);
3357 binder_alloc_copy_to_buffer(&target_proc->alloc,
3361 binder_txn_error("%d:%d translate handle failed\n",
3362 thread->pid, proc->pid);
3363 return_error = BR_FAILED_REPLY;
3364 return_error_param = ret;
3365 return_error_line = __LINE__;
3366 goto err_translate_failed;
3370 case BINDER_TYPE_FD: {
3371 struct binder_fd_object *fp = to_binder_fd_object(hdr);
3372 binder_size_t fd_offset = object_offset +
3373 (uintptr_t)&fp->fd - (uintptr_t)fp;
3374 int ret = binder_translate_fd(fp->fd, fd_offset, t,
3375 thread, in_reply_to);
3379 binder_alloc_copy_to_buffer(&target_proc->alloc,
3383 binder_txn_error("%d:%d translate fd failed\n",
3384 thread->pid, proc->pid);
3385 return_error = BR_FAILED_REPLY;
3386 return_error_param = ret;
3387 return_error_line = __LINE__;
3388 goto err_translate_failed;
3391 case BINDER_TYPE_FDA: {
3392 struct binder_object ptr_object;
3393 binder_size_t parent_offset;
3394 struct binder_object user_object;
3395 size_t user_parent_size;
3396 struct binder_fd_array_object *fda =
3397 to_binder_fd_array_object(hdr);
3398 size_t num_valid = (buffer_offset - off_start_offset) /
3399 sizeof(binder_size_t);
3400 struct binder_buffer_object *parent =
3401 binder_validate_ptr(target_proc, t->buffer,
3402 &ptr_object, fda->parent,
3407 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
3408 proc->pid, thread->pid);
3409 return_error = BR_FAILED_REPLY;
3410 return_error_param = -EINVAL;
3411 return_error_line = __LINE__;
3412 goto err_bad_parent;
3414 if (!binder_validate_fixup(target_proc, t->buffer,
3419 last_fixup_min_off)) {
3420 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
3421 proc->pid, thread->pid);
3422 return_error = BR_FAILED_REPLY;
3423 return_error_param = -EINVAL;
3424 return_error_line = __LINE__;
3425 goto err_bad_parent;
3428 * We need to read the user version of the parent
3429 * object to get the original user offset
3432 binder_get_object(proc, user_buffer, t->buffer,
3433 parent_offset, &user_object);
3434 if (user_parent_size != sizeof(user_object.bbo)) {
3435 binder_user_error("%d:%d invalid ptr object size: %zd vs %zd\n",
3436 proc->pid, thread->pid,
3438 sizeof(user_object.bbo));
3439 return_error = BR_FAILED_REPLY;
3440 return_error_param = -EINVAL;
3441 return_error_line = __LINE__;
3442 goto err_bad_parent;
3444 ret = binder_translate_fd_array(&pf_head, fda,
3445 user_buffer, parent,
3446 &user_object.bbo, t,
3447 thread, in_reply_to);
3449 ret = binder_alloc_copy_to_buffer(&target_proc->alloc,
3454 binder_txn_error("%d:%d translate fd array failed\n",
3455 thread->pid, proc->pid);
3456 return_error = BR_FAILED_REPLY;
3457 return_error_param = ret > 0 ? -EINVAL : ret;
3458 return_error_line = __LINE__;
3459 goto err_translate_failed;
3461 last_fixup_obj_off = parent_offset;
3462 last_fixup_min_off =
3463 fda->parent_offset + sizeof(u32) * fda->num_fds;
3465 case BINDER_TYPE_PTR: {
3466 struct binder_buffer_object *bp =
3467 to_binder_buffer_object(hdr);
3468 size_t buf_left = sg_buf_end_offset - sg_buf_offset;
3471 if (bp->length > buf_left) {
3472 binder_user_error("%d:%d got transaction with too large buffer\n",
3473 proc->pid, thread->pid);
3474 return_error = BR_FAILED_REPLY;
3475 return_error_param = -EINVAL;
3476 return_error_line = __LINE__;
3477 goto err_bad_offset;
3479 ret = binder_defer_copy(&sgc_head, sg_buf_offset,
3480 (const void __user *)(uintptr_t)bp->buffer,
3483 binder_txn_error("%d:%d deferred copy failed\n",
3484 thread->pid, proc->pid);
3485 return_error = BR_FAILED_REPLY;
3486 return_error_param = ret;
3487 return_error_line = __LINE__;
3488 goto err_translate_failed;
3490 /* Fixup buffer pointer to target proc address space */
3491 bp->buffer = (uintptr_t)
3492 t->buffer->user_data + sg_buf_offset;
3493 sg_buf_offset += ALIGN(bp->length, sizeof(u64));
3495 num_valid = (buffer_offset - off_start_offset) /
3496 sizeof(binder_size_t);
3497 ret = binder_fixup_parent(&pf_head, t,
3502 last_fixup_min_off);
3504 binder_alloc_copy_to_buffer(&target_proc->alloc,
3508 binder_txn_error("%d:%d failed to fixup parent\n",
3509 thread->pid, proc->pid);
3510 return_error = BR_FAILED_REPLY;
3511 return_error_param = ret;
3512 return_error_line = __LINE__;
3513 goto err_translate_failed;
3515 last_fixup_obj_off = object_offset;
3516 last_fixup_min_off = 0;
3519 binder_user_error("%d:%d got transaction with invalid object type, %x\n",
3520 proc->pid, thread->pid, hdr->type);
3521 return_error = BR_FAILED_REPLY;
3522 return_error_param = -EINVAL;
3523 return_error_line = __LINE__;
3524 goto err_bad_object_type;
3527 /* Done processing objects, copy the rest of the buffer */
3528 if (binder_alloc_copy_user_to_buffer(
3529 &target_proc->alloc,
3530 t->buffer, user_offset,
3531 user_buffer + user_offset,
3532 tr->data_size - user_offset)) {
3533 binder_user_error("%d:%d got transaction with invalid data ptr\n",
3534 proc->pid, thread->pid);
3535 return_error = BR_FAILED_REPLY;
3536 return_error_param = -EFAULT;
3537 return_error_line = __LINE__;
3538 goto err_copy_data_failed;
3541 ret = binder_do_deferred_txn_copies(&target_proc->alloc, t->buffer,
3542 &sgc_head, &pf_head);
3544 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
3545 proc->pid, thread->pid);
3546 return_error = BR_FAILED_REPLY;
3547 return_error_param = ret;
3548 return_error_line = __LINE__;
3549 goto err_copy_data_failed;
3551 if (t->buffer->oneway_spam_suspect)
3552 tcomplete->type = BINDER_WORK_TRANSACTION_ONEWAY_SPAM_SUSPECT;
3554 tcomplete->type = BINDER_WORK_TRANSACTION_COMPLETE;
3555 t->work.type = BINDER_WORK_TRANSACTION;
3558 binder_enqueue_thread_work(thread, tcomplete);
3559 binder_inner_proc_lock(target_proc);
3560 if (target_thread->is_dead) {
3561 return_error = BR_DEAD_REPLY;
3562 binder_inner_proc_unlock(target_proc);
3563 goto err_dead_proc_or_thread;
3565 BUG_ON(t->buffer->async_transaction != 0);
3566 binder_pop_transaction_ilocked(target_thread, in_reply_to);
3567 binder_enqueue_thread_work_ilocked(target_thread, &t->work);
3568 target_proc->outstanding_txns++;
3569 binder_inner_proc_unlock(target_proc);
3570 wake_up_interruptible_sync(&target_thread->wait);
3571 binder_free_transaction(in_reply_to);
3572 } else if (!(t->flags & TF_ONE_WAY)) {
3573 BUG_ON(t->buffer->async_transaction != 0);
3574 binder_inner_proc_lock(proc);
3576 * Defer the TRANSACTION_COMPLETE, so we don't return to
3577 * userspace immediately; this allows the target process to
3578 * immediately start processing this transaction, reducing
3579 * latency. We will then return the TRANSACTION_COMPLETE when
3580 * the target replies (or there is an error).
3582 binder_enqueue_deferred_thread_work_ilocked(thread, tcomplete);
3584 t->from_parent = thread->transaction_stack;
3585 thread->transaction_stack = t;
3586 binder_inner_proc_unlock(proc);
3587 return_error = binder_proc_transaction(t,
3588 target_proc, target_thread);
3590 binder_inner_proc_lock(proc);
3591 binder_pop_transaction_ilocked(thread, t);
3592 binder_inner_proc_unlock(proc);
3593 goto err_dead_proc_or_thread;
3596 BUG_ON(target_node == NULL);
3597 BUG_ON(t->buffer->async_transaction != 1);
3598 binder_enqueue_thread_work(thread, tcomplete);
3599 return_error = binder_proc_transaction(t, target_proc, NULL);
3601 goto err_dead_proc_or_thread;
3604 binder_thread_dec_tmpref(target_thread);
3605 binder_proc_dec_tmpref(target_proc);
3607 binder_dec_node_tmpref(target_node);
3609 * write barrier to synchronize with initialization
3613 WRITE_ONCE(e->debug_id_done, t_debug_id);
3616 err_dead_proc_or_thread:
3617 binder_txn_error("%d:%d dead process or thread\n",
3618 thread->pid, proc->pid);
3619 return_error_line = __LINE__;
3620 binder_dequeue_work(proc, tcomplete);
3621 err_translate_failed:
3622 err_bad_object_type:
3625 err_copy_data_failed:
3626 binder_cleanup_deferred_txn_lists(&sgc_head, &pf_head);
3627 binder_free_txn_fixups(t);
3628 trace_binder_transaction_failed_buffer_release(t->buffer);
3629 binder_transaction_buffer_release(target_proc, NULL, t->buffer,
3630 buffer_offset, true);
3632 binder_dec_node_tmpref(target_node);
3634 t->buffer->transaction = NULL;
3635 binder_alloc_free_buf(&target_proc->alloc, t->buffer);
3636 err_binder_alloc_buf_failed:
3639 security_release_secctx(secctx, secctx_sz);
3640 err_get_secctx_failed:
3642 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
3643 err_alloc_tcomplete_failed:
3644 if (trace_binder_txn_latency_free_enabled())
3645 binder_txn_latency_free(t);
3647 binder_stats_deleted(BINDER_STAT_TRANSACTION);
3651 err_empty_call_stack:
3653 err_invalid_target_handle:
3655 binder_dec_node(target_node, 1, 0);
3656 binder_dec_node_tmpref(target_node);
3659 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
3660 "%d:%d transaction %s to %d:%d failed %d/%d/%d, size %lld-%lld line %d\n",
3661 proc->pid, thread->pid, reply ? "reply" :
3662 (tr->flags & TF_ONE_WAY ? "async" : "call"),
3663 target_proc ? target_proc->pid : 0,
3664 target_thread ? target_thread->pid : 0,
3665 t_debug_id, return_error, return_error_param,
3666 (u64)tr->data_size, (u64)tr->offsets_size,
3670 binder_thread_dec_tmpref(target_thread);
3672 binder_proc_dec_tmpref(target_proc);
3675 struct binder_transaction_log_entry *fe;
3677 e->return_error = return_error;
3678 e->return_error_param = return_error_param;
3679 e->return_error_line = return_error_line;
3680 fe = binder_transaction_log_add(&binder_transaction_log_failed);
3683 * write barrier to synchronize with initialization
3687 WRITE_ONCE(e->debug_id_done, t_debug_id);
3688 WRITE_ONCE(fe->debug_id_done, t_debug_id);
3691 BUG_ON(thread->return_error.cmd != BR_OK);
3693 binder_set_txn_from_error(in_reply_to, t_debug_id,
3694 return_error, return_error_param);
3695 thread->return_error.cmd = BR_TRANSACTION_COMPLETE;
3696 binder_enqueue_thread_work(thread, &thread->return_error.work);
3697 binder_send_failed_reply(in_reply_to, return_error);
3699 binder_inner_proc_lock(proc);
3700 binder_set_extended_error(&thread->ee, t_debug_id,
3701 return_error, return_error_param);
3702 binder_inner_proc_unlock(proc);
3703 thread->return_error.cmd = return_error;
3704 binder_enqueue_thread_work(thread, &thread->return_error.work);
3709 * binder_free_buf() - free the specified buffer
3710 * @proc: binder proc that owns buffer
3711 * @buffer: buffer to be freed
3712 * @is_failure: failed to send transaction
3714 * If buffer for an async transaction, enqueue the next async
3715 * transaction from the node.
3717 * Cleanup buffer and free it.
3720 binder_free_buf(struct binder_proc *proc,
3721 struct binder_thread *thread,
3722 struct binder_buffer *buffer, bool is_failure)
3724 binder_inner_proc_lock(proc);
3725 if (buffer->transaction) {
3726 buffer->transaction->buffer = NULL;
3727 buffer->transaction = NULL;
3729 binder_inner_proc_unlock(proc);
3730 if (buffer->async_transaction && buffer->target_node) {
3731 struct binder_node *buf_node;
3732 struct binder_work *w;
3734 buf_node = buffer->target_node;
3735 binder_node_inner_lock(buf_node);
3736 BUG_ON(!buf_node->has_async_transaction);
3737 BUG_ON(buf_node->proc != proc);
3738 w = binder_dequeue_work_head_ilocked(
3739 &buf_node->async_todo);
3741 buf_node->has_async_transaction = false;
3743 binder_enqueue_work_ilocked(
3745 binder_wakeup_proc_ilocked(proc);
3747 binder_node_inner_unlock(buf_node);
3749 trace_binder_transaction_buffer_release(buffer);
3750 binder_transaction_buffer_release(proc, thread, buffer, 0, is_failure);
3751 binder_alloc_free_buf(&proc->alloc, buffer);
3754 static int binder_thread_write(struct binder_proc *proc,
3755 struct binder_thread *thread,
3756 binder_uintptr_t binder_buffer, size_t size,
3757 binder_size_t *consumed)
3760 struct binder_context *context = proc->context;
3761 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
3762 void __user *ptr = buffer + *consumed;
3763 void __user *end = buffer + size;
3765 while (ptr < end && thread->return_error.cmd == BR_OK) {
3768 if (get_user(cmd, (uint32_t __user *)ptr))
3770 ptr += sizeof(uint32_t);
3771 trace_binder_command(cmd);
3772 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.bc)) {
3773 atomic_inc(&binder_stats.bc[_IOC_NR(cmd)]);
3774 atomic_inc(&proc->stats.bc[_IOC_NR(cmd)]);
3775 atomic_inc(&thread->stats.bc[_IOC_NR(cmd)]);
3783 const char *debug_string;
3784 bool strong = cmd == BC_ACQUIRE || cmd == BC_RELEASE;
3785 bool increment = cmd == BC_INCREFS || cmd == BC_ACQUIRE;
3786 struct binder_ref_data rdata;
3788 if (get_user(target, (uint32_t __user *)ptr))
3791 ptr += sizeof(uint32_t);
3793 if (increment && !target) {
3794 struct binder_node *ctx_mgr_node;
3796 mutex_lock(&context->context_mgr_node_lock);
3797 ctx_mgr_node = context->binder_context_mgr_node;
3799 if (ctx_mgr_node->proc == proc) {
3800 binder_user_error("%d:%d context manager tried to acquire desc 0\n",
3801 proc->pid, thread->pid);
3802 mutex_unlock(&context->context_mgr_node_lock);
3805 ret = binder_inc_ref_for_node(
3807 strong, NULL, &rdata);
3809 mutex_unlock(&context->context_mgr_node_lock);
3812 ret = binder_update_ref_for_handle(
3813 proc, target, increment, strong,
3815 if (!ret && rdata.desc != target) {
3816 binder_user_error("%d:%d tried to acquire reference to desc %d, got %d instead\n",
3817 proc->pid, thread->pid,
3818 target, rdata.desc);
3822 debug_string = "IncRefs";
3825 debug_string = "Acquire";
3828 debug_string = "Release";
3832 debug_string = "DecRefs";
3836 binder_user_error("%d:%d %s %d refcount change on invalid ref %d ret %d\n",
3837 proc->pid, thread->pid, debug_string,
3838 strong, target, ret);
3841 binder_debug(BINDER_DEBUG_USER_REFS,
3842 "%d:%d %s ref %d desc %d s %d w %d\n",
3843 proc->pid, thread->pid, debug_string,
3844 rdata.debug_id, rdata.desc, rdata.strong,
3848 case BC_INCREFS_DONE:
3849 case BC_ACQUIRE_DONE: {
3850 binder_uintptr_t node_ptr;
3851 binder_uintptr_t cookie;
3852 struct binder_node *node;
3855 if (get_user(node_ptr, (binder_uintptr_t __user *)ptr))
3857 ptr += sizeof(binder_uintptr_t);
3858 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3860 ptr += sizeof(binder_uintptr_t);
3861 node = binder_get_node(proc, node_ptr);
3863 binder_user_error("%d:%d %s u%016llx no match\n",
3864 proc->pid, thread->pid,
3865 cmd == BC_INCREFS_DONE ?
3871 if (cookie != node->cookie) {
3872 binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
3873 proc->pid, thread->pid,
3874 cmd == BC_INCREFS_DONE ?
3875 "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3876 (u64)node_ptr, node->debug_id,
3877 (u64)cookie, (u64)node->cookie);
3878 binder_put_node(node);
3881 binder_node_inner_lock(node);
3882 if (cmd == BC_ACQUIRE_DONE) {
3883 if (node->pending_strong_ref == 0) {
3884 binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
3885 proc->pid, thread->pid,
3887 binder_node_inner_unlock(node);
3888 binder_put_node(node);
3891 node->pending_strong_ref = 0;
3893 if (node->pending_weak_ref == 0) {
3894 binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
3895 proc->pid, thread->pid,
3897 binder_node_inner_unlock(node);
3898 binder_put_node(node);
3901 node->pending_weak_ref = 0;
3903 free_node = binder_dec_node_nilocked(node,
3904 cmd == BC_ACQUIRE_DONE, 0);
3906 binder_debug(BINDER_DEBUG_USER_REFS,
3907 "%d:%d %s node %d ls %d lw %d tr %d\n",
3908 proc->pid, thread->pid,
3909 cmd == BC_INCREFS_DONE ? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3910 node->debug_id, node->local_strong_refs,
3911 node->local_weak_refs, node->tmp_refs);
3912 binder_node_inner_unlock(node);
3913 binder_put_node(node);
3916 case BC_ATTEMPT_ACQUIRE:
3917 pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
3919 case BC_ACQUIRE_RESULT:
3920 pr_err("BC_ACQUIRE_RESULT not supported\n");
3923 case BC_FREE_BUFFER: {
3924 binder_uintptr_t data_ptr;
3925 struct binder_buffer *buffer;
3927 if (get_user(data_ptr, (binder_uintptr_t __user *)ptr))
3929 ptr += sizeof(binder_uintptr_t);
3931 buffer = binder_alloc_prepare_to_free(&proc->alloc,
3933 if (IS_ERR_OR_NULL(buffer)) {
3934 if (PTR_ERR(buffer) == -EPERM) {
3936 "%d:%d BC_FREE_BUFFER u%016llx matched unreturned or currently freeing buffer\n",
3937 proc->pid, thread->pid,
3941 "%d:%d BC_FREE_BUFFER u%016llx no match\n",
3942 proc->pid, thread->pid,
3947 binder_debug(BINDER_DEBUG_FREE_BUFFER,
3948 "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
3949 proc->pid, thread->pid, (u64)data_ptr,
3951 buffer->transaction ? "active" : "finished");
3952 binder_free_buf(proc, thread, buffer, false);
3956 case BC_TRANSACTION_SG:
3958 struct binder_transaction_data_sg tr;
3960 if (copy_from_user(&tr, ptr, sizeof(tr)))
3963 binder_transaction(proc, thread, &tr.transaction_data,
3964 cmd == BC_REPLY_SG, tr.buffers_size);
3967 case BC_TRANSACTION:
3969 struct binder_transaction_data tr;
3971 if (copy_from_user(&tr, ptr, sizeof(tr)))
3974 binder_transaction(proc, thread, &tr,
3975 cmd == BC_REPLY, 0);
3979 case BC_REGISTER_LOOPER:
3980 binder_debug(BINDER_DEBUG_THREADS,
3981 "%d:%d BC_REGISTER_LOOPER\n",
3982 proc->pid, thread->pid);
3983 binder_inner_proc_lock(proc);
3984 if (thread->looper & BINDER_LOOPER_STATE_ENTERED) {
3985 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3986 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
3987 proc->pid, thread->pid);
3988 } else if (proc->requested_threads == 0) {
3989 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3990 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
3991 proc->pid, thread->pid);
3993 proc->requested_threads--;
3994 proc->requested_threads_started++;
3996 thread->looper |= BINDER_LOOPER_STATE_REGISTERED;
3997 binder_inner_proc_unlock(proc);
3999 case BC_ENTER_LOOPER:
4000 binder_debug(BINDER_DEBUG_THREADS,
4001 "%d:%d BC_ENTER_LOOPER\n",
4002 proc->pid, thread->pid);
4003 if (thread->looper & BINDER_LOOPER_STATE_REGISTERED) {
4004 thread->looper |= BINDER_LOOPER_STATE_INVALID;
4005 binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
4006 proc->pid, thread->pid);
4008 thread->looper |= BINDER_LOOPER_STATE_ENTERED;
4010 case BC_EXIT_LOOPER:
4011 binder_debug(BINDER_DEBUG_THREADS,
4012 "%d:%d BC_EXIT_LOOPER\n",
4013 proc->pid, thread->pid);
4014 thread->looper |= BINDER_LOOPER_STATE_EXITED;
4017 case BC_REQUEST_DEATH_NOTIFICATION:
4018 case BC_CLEAR_DEATH_NOTIFICATION: {
4020 binder_uintptr_t cookie;
4021 struct binder_ref *ref;
4022 struct binder_ref_death *death = NULL;
4024 if (get_user(target, (uint32_t __user *)ptr))
4026 ptr += sizeof(uint32_t);
4027 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
4029 ptr += sizeof(binder_uintptr_t);
4030 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
4032 * Allocate memory for death notification
4033 * before taking lock
4035 death = kzalloc(sizeof(*death), GFP_KERNEL);
4036 if (death == NULL) {
4037 WARN_ON(thread->return_error.cmd !=
4039 thread->return_error.cmd = BR_ERROR;
4040 binder_enqueue_thread_work(
4042 &thread->return_error.work);
4044 BINDER_DEBUG_FAILED_TRANSACTION,
4045 "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
4046 proc->pid, thread->pid);
4050 binder_proc_lock(proc);
4051 ref = binder_get_ref_olocked(proc, target, false);
4053 binder_user_error("%d:%d %s invalid ref %d\n",
4054 proc->pid, thread->pid,
4055 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
4056 "BC_REQUEST_DEATH_NOTIFICATION" :
4057 "BC_CLEAR_DEATH_NOTIFICATION",
4059 binder_proc_unlock(proc);
4064 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
4065 "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
4066 proc->pid, thread->pid,
4067 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
4068 "BC_REQUEST_DEATH_NOTIFICATION" :
4069 "BC_CLEAR_DEATH_NOTIFICATION",
4070 (u64)cookie, ref->data.debug_id,
4071 ref->data.desc, ref->data.strong,
4072 ref->data.weak, ref->node->debug_id);
4074 binder_node_lock(ref->node);
4075 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
4077 binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
4078 proc->pid, thread->pid);
4079 binder_node_unlock(ref->node);
4080 binder_proc_unlock(proc);
4084 binder_stats_created(BINDER_STAT_DEATH);
4085 INIT_LIST_HEAD(&death->work.entry);
4086 death->cookie = cookie;
4088 if (ref->node->proc == NULL) {
4089 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
4091 binder_inner_proc_lock(proc);
4092 binder_enqueue_work_ilocked(
4093 &ref->death->work, &proc->todo);
4094 binder_wakeup_proc_ilocked(proc);
4095 binder_inner_proc_unlock(proc);
4098 if (ref->death == NULL) {
4099 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
4100 proc->pid, thread->pid);
4101 binder_node_unlock(ref->node);
4102 binder_proc_unlock(proc);
4106 if (death->cookie != cookie) {
4107 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
4108 proc->pid, thread->pid,
4111 binder_node_unlock(ref->node);
4112 binder_proc_unlock(proc);
4116 binder_inner_proc_lock(proc);
4117 if (list_empty(&death->work.entry)) {
4118 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
4119 if (thread->looper &
4120 (BINDER_LOOPER_STATE_REGISTERED |
4121 BINDER_LOOPER_STATE_ENTERED))
4122 binder_enqueue_thread_work_ilocked(
4126 binder_enqueue_work_ilocked(
4129 binder_wakeup_proc_ilocked(
4133 BUG_ON(death->work.type != BINDER_WORK_DEAD_BINDER);
4134 death->work.type = BINDER_WORK_DEAD_BINDER_AND_CLEAR;
4136 binder_inner_proc_unlock(proc);
4138 binder_node_unlock(ref->node);
4139 binder_proc_unlock(proc);
4141 case BC_DEAD_BINDER_DONE: {
4142 struct binder_work *w;
4143 binder_uintptr_t cookie;
4144 struct binder_ref_death *death = NULL;
4146 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
4149 ptr += sizeof(cookie);
4150 binder_inner_proc_lock(proc);
4151 list_for_each_entry(w, &proc->delivered_death,
4153 struct binder_ref_death *tmp_death =
4155 struct binder_ref_death,
4158 if (tmp_death->cookie == cookie) {
4163 binder_debug(BINDER_DEBUG_DEAD_BINDER,
4164 "%d:%d BC_DEAD_BINDER_DONE %016llx found %pK\n",
4165 proc->pid, thread->pid, (u64)cookie,
4167 if (death == NULL) {
4168 binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
4169 proc->pid, thread->pid, (u64)cookie);
4170 binder_inner_proc_unlock(proc);
4173 binder_dequeue_work_ilocked(&death->work);
4174 if (death->work.type == BINDER_WORK_DEAD_BINDER_AND_CLEAR) {
4175 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
4176 if (thread->looper &
4177 (BINDER_LOOPER_STATE_REGISTERED |
4178 BINDER_LOOPER_STATE_ENTERED))
4179 binder_enqueue_thread_work_ilocked(
4180 thread, &death->work);
4182 binder_enqueue_work_ilocked(
4185 binder_wakeup_proc_ilocked(proc);
4188 binder_inner_proc_unlock(proc);
4192 pr_err("%d:%d unknown command %u\n",
4193 proc->pid, thread->pid, cmd);
4196 *consumed = ptr - buffer;
4201 static void binder_stat_br(struct binder_proc *proc,
4202 struct binder_thread *thread, uint32_t cmd)
4204 trace_binder_return(cmd);
4205 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.br)) {
4206 atomic_inc(&binder_stats.br[_IOC_NR(cmd)]);
4207 atomic_inc(&proc->stats.br[_IOC_NR(cmd)]);
4208 atomic_inc(&thread->stats.br[_IOC_NR(cmd)]);
4212 static int binder_put_node_cmd(struct binder_proc *proc,
4213 struct binder_thread *thread,
4215 binder_uintptr_t node_ptr,
4216 binder_uintptr_t node_cookie,
4218 uint32_t cmd, const char *cmd_name)
4220 void __user *ptr = *ptrp;
4222 if (put_user(cmd, (uint32_t __user *)ptr))
4224 ptr += sizeof(uint32_t);
4226 if (put_user(node_ptr, (binder_uintptr_t __user *)ptr))
4228 ptr += sizeof(binder_uintptr_t);
4230 if (put_user(node_cookie, (binder_uintptr_t __user *)ptr))
4232 ptr += sizeof(binder_uintptr_t);
4234 binder_stat_br(proc, thread, cmd);
4235 binder_debug(BINDER_DEBUG_USER_REFS, "%d:%d %s %d u%016llx c%016llx\n",
4236 proc->pid, thread->pid, cmd_name, node_debug_id,
4237 (u64)node_ptr, (u64)node_cookie);
4243 static int binder_wait_for_work(struct binder_thread *thread,
4247 struct binder_proc *proc = thread->proc;
4250 freezer_do_not_count();
4251 binder_inner_proc_lock(proc);
4253 prepare_to_wait(&thread->wait, &wait, TASK_INTERRUPTIBLE);
4254 if (binder_has_work_ilocked(thread, do_proc_work))
4257 list_add(&thread->waiting_thread_node,
4258 &proc->waiting_threads);
4259 binder_inner_proc_unlock(proc);
4261 binder_inner_proc_lock(proc);
4262 list_del_init(&thread->waiting_thread_node);
4263 if (signal_pending(current)) {
4268 finish_wait(&thread->wait, &wait);
4269 binder_inner_proc_unlock(proc);
4276 * binder_apply_fd_fixups() - finish fd translation
4277 * @proc: binder_proc associated @t->buffer
4278 * @t: binder transaction with list of fd fixups
4280 * Now that we are in the context of the transaction target
4281 * process, we can allocate and install fds. Process the
4282 * list of fds to translate and fixup the buffer with the
4283 * new fds first and only then install the files.
4285 * If we fail to allocate an fd, skip the install and release
4286 * any fds that have already been allocated.
4288 static int binder_apply_fd_fixups(struct binder_proc *proc,
4289 struct binder_transaction *t)
4291 struct binder_txn_fd_fixup *fixup, *tmp;
4294 list_for_each_entry(fixup, &t->fd_fixups, fixup_entry) {
4295 int fd = get_unused_fd_flags(O_CLOEXEC);
4298 binder_debug(BINDER_DEBUG_TRANSACTION,
4299 "failed fd fixup txn %d fd %d\n",
4304 binder_debug(BINDER_DEBUG_TRANSACTION,
4305 "fd fixup txn %d fd %d\n",
4307 trace_binder_transaction_fd_recv(t, fd, fixup->offset);
4308 fixup->target_fd = fd;
4309 if (binder_alloc_copy_to_buffer(&proc->alloc, t->buffer,
4316 list_for_each_entry_safe(fixup, tmp, &t->fd_fixups, fixup_entry) {
4317 fd_install(fixup->target_fd, fixup->file);
4318 list_del(&fixup->fixup_entry);
4325 binder_free_txn_fixups(t);
4329 static int binder_thread_read(struct binder_proc *proc,
4330 struct binder_thread *thread,
4331 binder_uintptr_t binder_buffer, size_t size,
4332 binder_size_t *consumed, int non_block)
4334 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
4335 void __user *ptr = buffer + *consumed;
4336 void __user *end = buffer + size;
4339 int wait_for_proc_work;
4341 if (*consumed == 0) {
4342 if (put_user(BR_NOOP, (uint32_t __user *)ptr))
4344 ptr += sizeof(uint32_t);
4348 binder_inner_proc_lock(proc);
4349 wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
4350 binder_inner_proc_unlock(proc);
4352 thread->looper |= BINDER_LOOPER_STATE_WAITING;
4354 trace_binder_wait_for_work(wait_for_proc_work,
4355 !!thread->transaction_stack,
4356 !binder_worklist_empty(proc, &thread->todo));
4357 if (wait_for_proc_work) {
4358 if (!(thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
4359 BINDER_LOOPER_STATE_ENTERED))) {
4360 binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
4361 proc->pid, thread->pid, thread->looper);
4362 wait_event_interruptible(binder_user_error_wait,
4363 binder_stop_on_user_error < 2);
4365 binder_set_nice(proc->default_priority);
4369 if (!binder_has_work(thread, wait_for_proc_work))
4372 ret = binder_wait_for_work(thread, wait_for_proc_work);
4375 thread->looper &= ~BINDER_LOOPER_STATE_WAITING;
4382 struct binder_transaction_data_secctx tr;
4383 struct binder_transaction_data *trd = &tr.transaction_data;
4384 struct binder_work *w = NULL;
4385 struct list_head *list = NULL;
4386 struct binder_transaction *t = NULL;
4387 struct binder_thread *t_from;
4388 size_t trsize = sizeof(*trd);
4390 binder_inner_proc_lock(proc);
4391 if (!binder_worklist_empty_ilocked(&thread->todo))
4392 list = &thread->todo;
4393 else if (!binder_worklist_empty_ilocked(&proc->todo) &&
4397 binder_inner_proc_unlock(proc);
4400 if (ptr - buffer == 4 && !thread->looper_need_return)
4405 if (end - ptr < sizeof(tr) + 4) {
4406 binder_inner_proc_unlock(proc);
4409 w = binder_dequeue_work_head_ilocked(list);
4410 if (binder_worklist_empty_ilocked(&thread->todo))
4411 thread->process_todo = false;
4414 case BINDER_WORK_TRANSACTION: {
4415 binder_inner_proc_unlock(proc);
4416 t = container_of(w, struct binder_transaction, work);
4418 case BINDER_WORK_RETURN_ERROR: {
4419 struct binder_error *e = container_of(
4420 w, struct binder_error, work);
4422 WARN_ON(e->cmd == BR_OK);
4423 binder_inner_proc_unlock(proc);
4424 if (put_user(e->cmd, (uint32_t __user *)ptr))
4428 ptr += sizeof(uint32_t);
4430 binder_stat_br(proc, thread, cmd);
4432 case BINDER_WORK_TRANSACTION_COMPLETE:
4433 case BINDER_WORK_TRANSACTION_ONEWAY_SPAM_SUSPECT: {
4434 if (proc->oneway_spam_detection_enabled &&
4435 w->type == BINDER_WORK_TRANSACTION_ONEWAY_SPAM_SUSPECT)
4436 cmd = BR_ONEWAY_SPAM_SUSPECT;
4438 cmd = BR_TRANSACTION_COMPLETE;
4439 binder_inner_proc_unlock(proc);
4441 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
4442 if (put_user(cmd, (uint32_t __user *)ptr))
4444 ptr += sizeof(uint32_t);
4446 binder_stat_br(proc, thread, cmd);
4447 binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE,
4448 "%d:%d BR_TRANSACTION_COMPLETE\n",
4449 proc->pid, thread->pid);
4451 case BINDER_WORK_NODE: {
4452 struct binder_node *node = container_of(w, struct binder_node, work);
4454 binder_uintptr_t node_ptr = node->ptr;
4455 binder_uintptr_t node_cookie = node->cookie;
4456 int node_debug_id = node->debug_id;
4459 void __user *orig_ptr = ptr;
4461 BUG_ON(proc != node->proc);
4462 strong = node->internal_strong_refs ||
4463 node->local_strong_refs;
4464 weak = !hlist_empty(&node->refs) ||
4465 node->local_weak_refs ||
4466 node->tmp_refs || strong;
4467 has_strong_ref = node->has_strong_ref;
4468 has_weak_ref = node->has_weak_ref;
4470 if (weak && !has_weak_ref) {
4471 node->has_weak_ref = 1;
4472 node->pending_weak_ref = 1;
4473 node->local_weak_refs++;
4475 if (strong && !has_strong_ref) {
4476 node->has_strong_ref = 1;
4477 node->pending_strong_ref = 1;
4478 node->local_strong_refs++;
4480 if (!strong && has_strong_ref)
4481 node->has_strong_ref = 0;
4482 if (!weak && has_weak_ref)
4483 node->has_weak_ref = 0;
4484 if (!weak && !strong) {
4485 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
4486 "%d:%d node %d u%016llx c%016llx deleted\n",
4487 proc->pid, thread->pid,
4491 rb_erase(&node->rb_node, &proc->nodes);
4492 binder_inner_proc_unlock(proc);
4493 binder_node_lock(node);
4495 * Acquire the node lock before freeing the
4496 * node to serialize with other threads that
4497 * may have been holding the node lock while
4498 * decrementing this node (avoids race where
4499 * this thread frees while the other thread
4500 * is unlocking the node after the final
4503 binder_node_unlock(node);
4504 binder_free_node(node);
4506 binder_inner_proc_unlock(proc);
4508 if (weak && !has_weak_ref)
4509 ret = binder_put_node_cmd(
4510 proc, thread, &ptr, node_ptr,
4511 node_cookie, node_debug_id,
4512 BR_INCREFS, "BR_INCREFS");
4513 if (!ret && strong && !has_strong_ref)
4514 ret = binder_put_node_cmd(
4515 proc, thread, &ptr, node_ptr,
4516 node_cookie, node_debug_id,
4517 BR_ACQUIRE, "BR_ACQUIRE");
4518 if (!ret && !strong && has_strong_ref)
4519 ret = binder_put_node_cmd(
4520 proc, thread, &ptr, node_ptr,
4521 node_cookie, node_debug_id,
4522 BR_RELEASE, "BR_RELEASE");
4523 if (!ret && !weak && has_weak_ref)
4524 ret = binder_put_node_cmd(
4525 proc, thread, &ptr, node_ptr,
4526 node_cookie, node_debug_id,
4527 BR_DECREFS, "BR_DECREFS");
4528 if (orig_ptr == ptr)
4529 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
4530 "%d:%d node %d u%016llx c%016llx state unchanged\n",
4531 proc->pid, thread->pid,
4538 case BINDER_WORK_DEAD_BINDER:
4539 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4540 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
4541 struct binder_ref_death *death;
4543 binder_uintptr_t cookie;
4545 death = container_of(w, struct binder_ref_death, work);
4546 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION)
4547 cmd = BR_CLEAR_DEATH_NOTIFICATION_DONE;
4549 cmd = BR_DEAD_BINDER;
4550 cookie = death->cookie;
4552 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
4553 "%d:%d %s %016llx\n",
4554 proc->pid, thread->pid,
4555 cmd == BR_DEAD_BINDER ?
4557 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
4559 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) {
4560 binder_inner_proc_unlock(proc);
4562 binder_stats_deleted(BINDER_STAT_DEATH);
4564 binder_enqueue_work_ilocked(
4565 w, &proc->delivered_death);
4566 binder_inner_proc_unlock(proc);
4568 if (put_user(cmd, (uint32_t __user *)ptr))
4570 ptr += sizeof(uint32_t);
4571 if (put_user(cookie,
4572 (binder_uintptr_t __user *)ptr))
4574 ptr += sizeof(binder_uintptr_t);
4575 binder_stat_br(proc, thread, cmd);
4576 if (cmd == BR_DEAD_BINDER)
4577 goto done; /* DEAD_BINDER notifications can cause transactions */
4580 binder_inner_proc_unlock(proc);
4581 pr_err("%d:%d: bad work type %d\n",
4582 proc->pid, thread->pid, w->type);
4589 BUG_ON(t->buffer == NULL);
4590 if (t->buffer->target_node) {
4591 struct binder_node *target_node = t->buffer->target_node;
4593 trd->target.ptr = target_node->ptr;
4594 trd->cookie = target_node->cookie;
4595 t->saved_priority = task_nice(current);
4596 if (t->priority < target_node->min_priority &&
4597 !(t->flags & TF_ONE_WAY))
4598 binder_set_nice(t->priority);
4599 else if (!(t->flags & TF_ONE_WAY) ||
4600 t->saved_priority > target_node->min_priority)
4601 binder_set_nice(target_node->min_priority);
4602 cmd = BR_TRANSACTION;
4604 trd->target.ptr = 0;
4608 trd->code = t->code;
4609 trd->flags = t->flags;
4610 trd->sender_euid = from_kuid(current_user_ns(), t->sender_euid);
4612 t_from = binder_get_txn_from(t);
4614 struct task_struct *sender = t_from->proc->tsk;
4617 task_tgid_nr_ns(sender,
4618 task_active_pid_ns(current));
4620 trd->sender_pid = 0;
4623 ret = binder_apply_fd_fixups(proc, t);
4625 struct binder_buffer *buffer = t->buffer;
4626 bool oneway = !!(t->flags & TF_ONE_WAY);
4627 int tid = t->debug_id;
4630 binder_thread_dec_tmpref(t_from);
4631 buffer->transaction = NULL;
4632 binder_cleanup_transaction(t, "fd fixups failed",
4634 binder_free_buf(proc, thread, buffer, true);
4635 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
4636 "%d:%d %stransaction %d fd fixups failed %d/%d, line %d\n",
4637 proc->pid, thread->pid,
4639 (cmd == BR_REPLY ? "reply " : ""),
4640 tid, BR_FAILED_REPLY, ret, __LINE__);
4641 if (cmd == BR_REPLY) {
4642 cmd = BR_FAILED_REPLY;
4643 if (put_user(cmd, (uint32_t __user *)ptr))
4645 ptr += sizeof(uint32_t);
4646 binder_stat_br(proc, thread, cmd);
4651 trd->data_size = t->buffer->data_size;
4652 trd->offsets_size = t->buffer->offsets_size;
4653 trd->data.ptr.buffer = (uintptr_t)t->buffer->user_data;
4654 trd->data.ptr.offsets = trd->data.ptr.buffer +
4655 ALIGN(t->buffer->data_size,
4658 tr.secctx = t->security_ctx;
4659 if (t->security_ctx) {
4660 cmd = BR_TRANSACTION_SEC_CTX;
4661 trsize = sizeof(tr);
4663 if (put_user(cmd, (uint32_t __user *)ptr)) {
4665 binder_thread_dec_tmpref(t_from);
4667 binder_cleanup_transaction(t, "put_user failed",
4672 ptr += sizeof(uint32_t);
4673 if (copy_to_user(ptr, &tr, trsize)) {
4675 binder_thread_dec_tmpref(t_from);
4677 binder_cleanup_transaction(t, "copy_to_user failed",
4684 trace_binder_transaction_received(t);
4685 binder_stat_br(proc, thread, cmd);
4686 binder_debug(BINDER_DEBUG_TRANSACTION,
4687 "%d:%d %s %d %d:%d, cmd %u size %zd-%zd ptr %016llx-%016llx\n",
4688 proc->pid, thread->pid,
4689 (cmd == BR_TRANSACTION) ? "BR_TRANSACTION" :
4690 (cmd == BR_TRANSACTION_SEC_CTX) ?
4691 "BR_TRANSACTION_SEC_CTX" : "BR_REPLY",
4692 t->debug_id, t_from ? t_from->proc->pid : 0,
4693 t_from ? t_from->pid : 0, cmd,
4694 t->buffer->data_size, t->buffer->offsets_size,
4695 (u64)trd->data.ptr.buffer,
4696 (u64)trd->data.ptr.offsets);
4699 binder_thread_dec_tmpref(t_from);
4700 t->buffer->allow_user_free = 1;
4701 if (cmd != BR_REPLY && !(t->flags & TF_ONE_WAY)) {
4702 binder_inner_proc_lock(thread->proc);
4703 t->to_parent = thread->transaction_stack;
4704 t->to_thread = thread;
4705 thread->transaction_stack = t;
4706 binder_inner_proc_unlock(thread->proc);
4708 binder_free_transaction(t);
4715 *consumed = ptr - buffer;
4716 binder_inner_proc_lock(proc);
4717 if (proc->requested_threads == 0 &&
4718 list_empty(&thread->proc->waiting_threads) &&
4719 proc->requested_threads_started < proc->max_threads &&
4720 (thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
4721 BINDER_LOOPER_STATE_ENTERED)) /* the user-space code fails to */
4722 /*spawn a new thread if we leave this out */) {
4723 proc->requested_threads++;
4724 binder_inner_proc_unlock(proc);
4725 binder_debug(BINDER_DEBUG_THREADS,
4726 "%d:%d BR_SPAWN_LOOPER\n",
4727 proc->pid, thread->pid);
4728 if (put_user(BR_SPAWN_LOOPER, (uint32_t __user *)buffer))
4730 binder_stat_br(proc, thread, BR_SPAWN_LOOPER);
4732 binder_inner_proc_unlock(proc);
4736 static void binder_release_work(struct binder_proc *proc,
4737 struct list_head *list)
4739 struct binder_work *w;
4740 enum binder_work_type wtype;
4743 binder_inner_proc_lock(proc);
4744 w = binder_dequeue_work_head_ilocked(list);
4745 wtype = w ? w->type : 0;
4746 binder_inner_proc_unlock(proc);
4751 case BINDER_WORK_TRANSACTION: {
4752 struct binder_transaction *t;
4754 t = container_of(w, struct binder_transaction, work);
4756 binder_cleanup_transaction(t, "process died.",
4759 case BINDER_WORK_RETURN_ERROR: {
4760 struct binder_error *e = container_of(
4761 w, struct binder_error, work);
4763 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4764 "undelivered TRANSACTION_ERROR: %u\n",
4767 case BINDER_WORK_TRANSACTION_COMPLETE: {
4768 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4769 "undelivered TRANSACTION_COMPLETE\n");
4771 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
4773 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4774 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
4775 struct binder_ref_death *death;
4777 death = container_of(w, struct binder_ref_death, work);
4778 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4779 "undelivered death notification, %016llx\n",
4780 (u64)death->cookie);
4782 binder_stats_deleted(BINDER_STAT_DEATH);
4784 case BINDER_WORK_NODE:
4787 pr_err("unexpected work type, %d, not freed\n",
4795 static struct binder_thread *binder_get_thread_ilocked(
4796 struct binder_proc *proc, struct binder_thread *new_thread)
4798 struct binder_thread *thread = NULL;
4799 struct rb_node *parent = NULL;
4800 struct rb_node **p = &proc->threads.rb_node;
4804 thread = rb_entry(parent, struct binder_thread, rb_node);
4806 if (current->pid < thread->pid)
4808 else if (current->pid > thread->pid)
4809 p = &(*p)->rb_right;
4815 thread = new_thread;
4816 binder_stats_created(BINDER_STAT_THREAD);
4817 thread->proc = proc;
4818 thread->pid = current->pid;
4819 atomic_set(&thread->tmp_ref, 0);
4820 init_waitqueue_head(&thread->wait);
4821 INIT_LIST_HEAD(&thread->todo);
4822 rb_link_node(&thread->rb_node, parent, p);
4823 rb_insert_color(&thread->rb_node, &proc->threads);
4824 thread->looper_need_return = true;
4825 thread->return_error.work.type = BINDER_WORK_RETURN_ERROR;
4826 thread->return_error.cmd = BR_OK;
4827 thread->reply_error.work.type = BINDER_WORK_RETURN_ERROR;
4828 thread->reply_error.cmd = BR_OK;
4829 thread->ee.command = BR_OK;
4830 INIT_LIST_HEAD(&new_thread->waiting_thread_node);
4834 static struct binder_thread *binder_get_thread(struct binder_proc *proc)
4836 struct binder_thread *thread;
4837 struct binder_thread *new_thread;
4839 binder_inner_proc_lock(proc);
4840 thread = binder_get_thread_ilocked(proc, NULL);
4841 binder_inner_proc_unlock(proc);
4843 new_thread = kzalloc(sizeof(*thread), GFP_KERNEL);
4844 if (new_thread == NULL)
4846 binder_inner_proc_lock(proc);
4847 thread = binder_get_thread_ilocked(proc, new_thread);
4848 binder_inner_proc_unlock(proc);
4849 if (thread != new_thread)
4855 static void binder_free_proc(struct binder_proc *proc)
4857 struct binder_device *device;
4859 BUG_ON(!list_empty(&proc->todo));
4860 BUG_ON(!list_empty(&proc->delivered_death));
4861 if (proc->outstanding_txns)
4862 pr_warn("%s: Unexpected outstanding_txns %d\n",
4863 __func__, proc->outstanding_txns);
4864 device = container_of(proc->context, struct binder_device, context);
4865 if (refcount_dec_and_test(&device->ref)) {
4866 kfree(proc->context->name);
4869 binder_alloc_deferred_release(&proc->alloc);
4870 put_task_struct(proc->tsk);
4871 put_cred(proc->cred);
4872 binder_stats_deleted(BINDER_STAT_PROC);
4876 static void binder_free_thread(struct binder_thread *thread)
4878 BUG_ON(!list_empty(&thread->todo));
4879 binder_stats_deleted(BINDER_STAT_THREAD);
4880 binder_proc_dec_tmpref(thread->proc);
4884 static int binder_thread_release(struct binder_proc *proc,
4885 struct binder_thread *thread)
4887 struct binder_transaction *t;
4888 struct binder_transaction *send_reply = NULL;
4889 int active_transactions = 0;
4890 struct binder_transaction *last_t = NULL;
4892 binder_inner_proc_lock(thread->proc);
4894 * take a ref on the proc so it survives
4895 * after we remove this thread from proc->threads.
4896 * The corresponding dec is when we actually
4897 * free the thread in binder_free_thread()
4901 * take a ref on this thread to ensure it
4902 * survives while we are releasing it
4904 atomic_inc(&thread->tmp_ref);
4905 rb_erase(&thread->rb_node, &proc->threads);
4906 t = thread->transaction_stack;
4908 spin_lock(&t->lock);
4909 if (t->to_thread == thread)
4912 __acquire(&t->lock);
4914 thread->is_dead = true;
4918 active_transactions++;
4919 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4920 "release %d:%d transaction %d %s, still active\n",
4921 proc->pid, thread->pid,
4923 (t->to_thread == thread) ? "in" : "out");
4925 if (t->to_thread == thread) {
4926 thread->proc->outstanding_txns--;
4928 t->to_thread = NULL;
4930 t->buffer->transaction = NULL;
4934 } else if (t->from == thread) {
4939 spin_unlock(&last_t->lock);
4941 spin_lock(&t->lock);
4943 __acquire(&t->lock);
4945 /* annotation for sparse, lock not acquired in last iteration above */
4946 __release(&t->lock);
4949 * If this thread used poll, make sure we remove the waitqueue from any
4950 * poll data structures holding it.
4952 if (thread->looper & BINDER_LOOPER_STATE_POLL)
4953 wake_up_pollfree(&thread->wait);
4955 binder_inner_proc_unlock(thread->proc);
4958 * This is needed to avoid races between wake_up_pollfree() above and
4959 * someone else removing the last entry from the queue for other reasons
4960 * (e.g. ep_remove_wait_queue() being called due to an epoll file
4961 * descriptor being closed). Such other users hold an RCU read lock, so
4962 * we can be sure they're done after we call synchronize_rcu().
4964 if (thread->looper & BINDER_LOOPER_STATE_POLL)
4968 binder_send_failed_reply(send_reply, BR_DEAD_REPLY);
4969 binder_release_work(proc, &thread->todo);
4970 binder_thread_dec_tmpref(thread);
4971 return active_transactions;
4974 static __poll_t binder_poll(struct file *filp,
4975 struct poll_table_struct *wait)
4977 struct binder_proc *proc = filp->private_data;
4978 struct binder_thread *thread = NULL;
4979 bool wait_for_proc_work;
4981 thread = binder_get_thread(proc);
4985 binder_inner_proc_lock(thread->proc);
4986 thread->looper |= BINDER_LOOPER_STATE_POLL;
4987 wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
4989 binder_inner_proc_unlock(thread->proc);
4991 poll_wait(filp, &thread->wait, wait);
4993 if (binder_has_work(thread, wait_for_proc_work))
4999 static int binder_ioctl_write_read(struct file *filp,
5000 unsigned int cmd, unsigned long arg,
5001 struct binder_thread *thread)
5004 struct binder_proc *proc = filp->private_data;
5005 unsigned int size = _IOC_SIZE(cmd);
5006 void __user *ubuf = (void __user *)arg;
5007 struct binder_write_read bwr;
5009 if (size != sizeof(struct binder_write_read)) {
5013 if (copy_from_user(&bwr, ubuf, sizeof(bwr))) {
5017 binder_debug(BINDER_DEBUG_READ_WRITE,
5018 "%d:%d write %lld at %016llx, read %lld at %016llx\n",
5019 proc->pid, thread->pid,
5020 (u64)bwr.write_size, (u64)bwr.write_buffer,
5021 (u64)bwr.read_size, (u64)bwr.read_buffer);
5023 if (bwr.write_size > 0) {
5024 ret = binder_thread_write(proc, thread,
5027 &bwr.write_consumed);
5028 trace_binder_write_done(ret);
5030 bwr.read_consumed = 0;
5031 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
5036 if (bwr.read_size > 0) {
5037 ret = binder_thread_read(proc, thread, bwr.read_buffer,
5040 filp->f_flags & O_NONBLOCK);
5041 trace_binder_read_done(ret);
5042 binder_inner_proc_lock(proc);
5043 if (!binder_worklist_empty_ilocked(&proc->todo))
5044 binder_wakeup_proc_ilocked(proc);
5045 binder_inner_proc_unlock(proc);
5047 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
5052 binder_debug(BINDER_DEBUG_READ_WRITE,
5053 "%d:%d wrote %lld of %lld, read return %lld of %lld\n",
5054 proc->pid, thread->pid,
5055 (u64)bwr.write_consumed, (u64)bwr.write_size,
5056 (u64)bwr.read_consumed, (u64)bwr.read_size);
5057 if (copy_to_user(ubuf, &bwr, sizeof(bwr))) {
5065 static int binder_ioctl_set_ctx_mgr(struct file *filp,
5066 struct flat_binder_object *fbo)
5069 struct binder_proc *proc = filp->private_data;
5070 struct binder_context *context = proc->context;
5071 struct binder_node *new_node;
5072 kuid_t curr_euid = current_euid();
5074 mutex_lock(&context->context_mgr_node_lock);
5075 if (context->binder_context_mgr_node) {
5076 pr_err("BINDER_SET_CONTEXT_MGR already set\n");
5080 ret = security_binder_set_context_mgr(proc->cred);
5083 if (uid_valid(context->binder_context_mgr_uid)) {
5084 if (!uid_eq(context->binder_context_mgr_uid, curr_euid)) {
5085 pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
5086 from_kuid(&init_user_ns, curr_euid),
5087 from_kuid(&init_user_ns,
5088 context->binder_context_mgr_uid));
5093 context->binder_context_mgr_uid = curr_euid;
5095 new_node = binder_new_node(proc, fbo);
5100 binder_node_lock(new_node);
5101 new_node->local_weak_refs++;
5102 new_node->local_strong_refs++;
5103 new_node->has_strong_ref = 1;
5104 new_node->has_weak_ref = 1;
5105 context->binder_context_mgr_node = new_node;
5106 binder_node_unlock(new_node);
5107 binder_put_node(new_node);
5109 mutex_unlock(&context->context_mgr_node_lock);
5113 static int binder_ioctl_get_node_info_for_ref(struct binder_proc *proc,
5114 struct binder_node_info_for_ref *info)
5116 struct binder_node *node;
5117 struct binder_context *context = proc->context;
5118 __u32 handle = info->handle;
5120 if (info->strong_count || info->weak_count || info->reserved1 ||
5121 info->reserved2 || info->reserved3) {
5122 binder_user_error("%d BINDER_GET_NODE_INFO_FOR_REF: only handle may be non-zero.",
5127 /* This ioctl may only be used by the context manager */
5128 mutex_lock(&context->context_mgr_node_lock);
5129 if (!context->binder_context_mgr_node ||
5130 context->binder_context_mgr_node->proc != proc) {
5131 mutex_unlock(&context->context_mgr_node_lock);
5134 mutex_unlock(&context->context_mgr_node_lock);
5136 node = binder_get_node_from_ref(proc, handle, true, NULL);
5140 info->strong_count = node->local_strong_refs +
5141 node->internal_strong_refs;
5142 info->weak_count = node->local_weak_refs;
5144 binder_put_node(node);
5149 static int binder_ioctl_get_node_debug_info(struct binder_proc *proc,
5150 struct binder_node_debug_info *info)
5153 binder_uintptr_t ptr = info->ptr;
5155 memset(info, 0, sizeof(*info));
5157 binder_inner_proc_lock(proc);
5158 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
5159 struct binder_node *node = rb_entry(n, struct binder_node,
5161 if (node->ptr > ptr) {
5162 info->ptr = node->ptr;
5163 info->cookie = node->cookie;
5164 info->has_strong_ref = node->has_strong_ref;
5165 info->has_weak_ref = node->has_weak_ref;
5169 binder_inner_proc_unlock(proc);
5174 static bool binder_txns_pending_ilocked(struct binder_proc *proc)
5177 struct binder_thread *thread;
5179 if (proc->outstanding_txns > 0)
5182 for (n = rb_first(&proc->threads); n; n = rb_next(n)) {
5183 thread = rb_entry(n, struct binder_thread, rb_node);
5184 if (thread->transaction_stack)
5190 static int binder_ioctl_freeze(struct binder_freeze_info *info,
5191 struct binder_proc *target_proc)
5195 if (!info->enable) {
5196 binder_inner_proc_lock(target_proc);
5197 target_proc->sync_recv = false;
5198 target_proc->async_recv = false;
5199 target_proc->is_frozen = false;
5200 binder_inner_proc_unlock(target_proc);
5205 * Freezing the target. Prevent new transactions by
5206 * setting frozen state. If timeout specified, wait
5207 * for transactions to drain.
5209 binder_inner_proc_lock(target_proc);
5210 target_proc->sync_recv = false;
5211 target_proc->async_recv = false;
5212 target_proc->is_frozen = true;
5213 binder_inner_proc_unlock(target_proc);
5215 if (info->timeout_ms > 0)
5216 ret = wait_event_interruptible_timeout(
5217 target_proc->freeze_wait,
5218 (!target_proc->outstanding_txns),
5219 msecs_to_jiffies(info->timeout_ms));
5221 /* Check pending transactions that wait for reply */
5223 binder_inner_proc_lock(target_proc);
5224 if (binder_txns_pending_ilocked(target_proc))
5226 binder_inner_proc_unlock(target_proc);
5230 binder_inner_proc_lock(target_proc);
5231 target_proc->is_frozen = false;
5232 binder_inner_proc_unlock(target_proc);
5238 static int binder_ioctl_get_freezer_info(
5239 struct binder_frozen_status_info *info)
5241 struct binder_proc *target_proc;
5245 info->sync_recv = 0;
5246 info->async_recv = 0;
5248 mutex_lock(&binder_procs_lock);
5249 hlist_for_each_entry(target_proc, &binder_procs, proc_node) {
5250 if (target_proc->pid == info->pid) {
5252 binder_inner_proc_lock(target_proc);
5253 txns_pending = binder_txns_pending_ilocked(target_proc);
5254 info->sync_recv |= target_proc->sync_recv |
5255 (txns_pending << 1);
5256 info->async_recv |= target_proc->async_recv;
5257 binder_inner_proc_unlock(target_proc);
5260 mutex_unlock(&binder_procs_lock);
5268 static int binder_ioctl_get_extended_error(struct binder_thread *thread,
5271 struct binder_extended_error ee;
5273 binder_inner_proc_lock(thread->proc);
5275 binder_set_extended_error(&thread->ee, 0, BR_OK, 0);
5276 binder_inner_proc_unlock(thread->proc);
5278 if (copy_to_user(ubuf, &ee, sizeof(ee)))
5284 static long binder_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
5287 struct binder_proc *proc = filp->private_data;
5288 struct binder_thread *thread;
5289 unsigned int size = _IOC_SIZE(cmd);
5290 void __user *ubuf = (void __user *)arg;
5292 /*pr_info("binder_ioctl: %d:%d %x %lx\n",
5293 proc->pid, current->pid, cmd, arg);*/
5295 binder_selftest_alloc(&proc->alloc);
5297 trace_binder_ioctl(cmd, arg);
5299 ret = wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
5303 thread = binder_get_thread(proc);
5304 if (thread == NULL) {
5310 case BINDER_WRITE_READ:
5311 ret = binder_ioctl_write_read(filp, cmd, arg, thread);
5315 case BINDER_SET_MAX_THREADS: {
5318 if (copy_from_user(&max_threads, ubuf,
5319 sizeof(max_threads))) {
5323 binder_inner_proc_lock(proc);
5324 proc->max_threads = max_threads;
5325 binder_inner_proc_unlock(proc);
5328 case BINDER_SET_CONTEXT_MGR_EXT: {
5329 struct flat_binder_object fbo;
5331 if (copy_from_user(&fbo, ubuf, sizeof(fbo))) {
5335 ret = binder_ioctl_set_ctx_mgr(filp, &fbo);
5340 case BINDER_SET_CONTEXT_MGR:
5341 ret = binder_ioctl_set_ctx_mgr(filp, NULL);
5345 case BINDER_THREAD_EXIT:
5346 binder_debug(BINDER_DEBUG_THREADS, "%d:%d exit\n",
5347 proc->pid, thread->pid);
5348 binder_thread_release(proc, thread);
5351 case BINDER_VERSION: {
5352 struct binder_version __user *ver = ubuf;
5354 if (size != sizeof(struct binder_version)) {
5358 if (put_user(BINDER_CURRENT_PROTOCOL_VERSION,
5359 &ver->protocol_version)) {
5365 case BINDER_GET_NODE_INFO_FOR_REF: {
5366 struct binder_node_info_for_ref info;
5368 if (copy_from_user(&info, ubuf, sizeof(info))) {
5373 ret = binder_ioctl_get_node_info_for_ref(proc, &info);
5377 if (copy_to_user(ubuf, &info, sizeof(info))) {
5384 case BINDER_GET_NODE_DEBUG_INFO: {
5385 struct binder_node_debug_info info;
5387 if (copy_from_user(&info, ubuf, sizeof(info))) {
5392 ret = binder_ioctl_get_node_debug_info(proc, &info);
5396 if (copy_to_user(ubuf, &info, sizeof(info))) {
5402 case BINDER_FREEZE: {
5403 struct binder_freeze_info info;
5404 struct binder_proc **target_procs = NULL, *target_proc;
5405 int target_procs_count = 0, i = 0;
5409 if (copy_from_user(&info, ubuf, sizeof(info))) {
5414 mutex_lock(&binder_procs_lock);
5415 hlist_for_each_entry(target_proc, &binder_procs, proc_node) {
5416 if (target_proc->pid == info.pid)
5417 target_procs_count++;
5420 if (target_procs_count == 0) {
5421 mutex_unlock(&binder_procs_lock);
5426 target_procs = kcalloc(target_procs_count,
5427 sizeof(struct binder_proc *),
5430 if (!target_procs) {
5431 mutex_unlock(&binder_procs_lock);
5436 hlist_for_each_entry(target_proc, &binder_procs, proc_node) {
5437 if (target_proc->pid != info.pid)
5440 binder_inner_proc_lock(target_proc);
5441 target_proc->tmp_ref++;
5442 binder_inner_proc_unlock(target_proc);
5444 target_procs[i++] = target_proc;
5446 mutex_unlock(&binder_procs_lock);
5448 for (i = 0; i < target_procs_count; i++) {
5450 ret = binder_ioctl_freeze(&info,
5453 binder_proc_dec_tmpref(target_procs[i]);
5456 kfree(target_procs);
5462 case BINDER_GET_FROZEN_INFO: {
5463 struct binder_frozen_status_info info;
5465 if (copy_from_user(&info, ubuf, sizeof(info))) {
5470 ret = binder_ioctl_get_freezer_info(&info);
5474 if (copy_to_user(ubuf, &info, sizeof(info))) {
5480 case BINDER_ENABLE_ONEWAY_SPAM_DETECTION: {
5483 if (copy_from_user(&enable, ubuf, sizeof(enable))) {
5487 binder_inner_proc_lock(proc);
5488 proc->oneway_spam_detection_enabled = (bool)enable;
5489 binder_inner_proc_unlock(proc);
5492 case BINDER_GET_EXTENDED_ERROR:
5493 ret = binder_ioctl_get_extended_error(thread, ubuf);
5504 thread->looper_need_return = false;
5505 wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
5506 if (ret && ret != -EINTR)
5507 pr_info("%d:%d ioctl %x %lx returned %d\n", proc->pid, current->pid, cmd, arg, ret);
5509 trace_binder_ioctl_done(ret);
5513 static void binder_vma_open(struct vm_area_struct *vma)
5515 struct binder_proc *proc = vma->vm_private_data;
5517 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5518 "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
5519 proc->pid, vma->vm_start, vma->vm_end,
5520 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
5521 (unsigned long)pgprot_val(vma->vm_page_prot));
5524 static void binder_vma_close(struct vm_area_struct *vma)
5526 struct binder_proc *proc = vma->vm_private_data;
5528 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5529 "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
5530 proc->pid, vma->vm_start, vma->vm_end,
5531 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
5532 (unsigned long)pgprot_val(vma->vm_page_prot));
5533 binder_alloc_vma_close(&proc->alloc);
5536 static vm_fault_t binder_vm_fault(struct vm_fault *vmf)
5538 return VM_FAULT_SIGBUS;
5541 static const struct vm_operations_struct binder_vm_ops = {
5542 .open = binder_vma_open,
5543 .close = binder_vma_close,
5544 .fault = binder_vm_fault,
5547 static int binder_mmap(struct file *filp, struct vm_area_struct *vma)
5549 struct binder_proc *proc = filp->private_data;
5551 if (proc->tsk != current->group_leader)
5554 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5555 "%s: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
5556 __func__, proc->pid, vma->vm_start, vma->vm_end,
5557 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
5558 (unsigned long)pgprot_val(vma->vm_page_prot));
5560 if (vma->vm_flags & FORBIDDEN_MMAP_FLAGS) {
5561 pr_err("%s: %d %lx-%lx %s failed %d\n", __func__,
5562 proc->pid, vma->vm_start, vma->vm_end, "bad vm_flags", -EPERM);
5565 vma->vm_flags |= VM_DONTCOPY | VM_MIXEDMAP;
5566 vma->vm_flags &= ~VM_MAYWRITE;
5568 vma->vm_ops = &binder_vm_ops;
5569 vma->vm_private_data = proc;
5571 return binder_alloc_mmap_handler(&proc->alloc, vma);
5574 static int binder_open(struct inode *nodp, struct file *filp)
5576 struct binder_proc *proc, *itr;
5577 struct binder_device *binder_dev;
5578 struct binderfs_info *info;
5579 struct dentry *binder_binderfs_dir_entry_proc = NULL;
5580 bool existing_pid = false;
5582 binder_debug(BINDER_DEBUG_OPEN_CLOSE, "%s: %d:%d\n", __func__,
5583 current->group_leader->pid, current->pid);
5585 proc = kzalloc(sizeof(*proc), GFP_KERNEL);
5588 spin_lock_init(&proc->inner_lock);
5589 spin_lock_init(&proc->outer_lock);
5590 get_task_struct(current->group_leader);
5591 proc->tsk = current->group_leader;
5592 proc->cred = get_cred(filp->f_cred);
5593 INIT_LIST_HEAD(&proc->todo);
5594 init_waitqueue_head(&proc->freeze_wait);
5595 proc->default_priority = task_nice(current);
5596 /* binderfs stashes devices in i_private */
5597 if (is_binderfs_device(nodp)) {
5598 binder_dev = nodp->i_private;
5599 info = nodp->i_sb->s_fs_info;
5600 binder_binderfs_dir_entry_proc = info->proc_log_dir;
5602 binder_dev = container_of(filp->private_data,
5603 struct binder_device, miscdev);
5605 refcount_inc(&binder_dev->ref);
5606 proc->context = &binder_dev->context;
5607 binder_alloc_init(&proc->alloc);
5609 binder_stats_created(BINDER_STAT_PROC);
5610 proc->pid = current->group_leader->pid;
5611 INIT_LIST_HEAD(&proc->delivered_death);
5612 INIT_LIST_HEAD(&proc->waiting_threads);
5613 filp->private_data = proc;
5615 mutex_lock(&binder_procs_lock);
5616 hlist_for_each_entry(itr, &binder_procs, proc_node) {
5617 if (itr->pid == proc->pid) {
5618 existing_pid = true;
5622 hlist_add_head(&proc->proc_node, &binder_procs);
5623 mutex_unlock(&binder_procs_lock);
5625 if (binder_debugfs_dir_entry_proc && !existing_pid) {
5628 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
5630 * proc debug entries are shared between contexts.
5631 * Only create for the first PID to avoid debugfs log spamming
5632 * The printing code will anyway print all contexts for a given
5633 * PID so this is not a problem.
5635 proc->debugfs_entry = debugfs_create_file(strbuf, 0444,
5636 binder_debugfs_dir_entry_proc,
5637 (void *)(unsigned long)proc->pid,
5641 if (binder_binderfs_dir_entry_proc && !existing_pid) {
5643 struct dentry *binderfs_entry;
5645 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
5647 * Similar to debugfs, the process specific log file is shared
5648 * between contexts. Only create for the first PID.
5649 * This is ok since same as debugfs, the log file will contain
5650 * information on all contexts of a given PID.
5652 binderfs_entry = binderfs_create_file(binder_binderfs_dir_entry_proc,
5653 strbuf, &proc_fops, (void *)(unsigned long)proc->pid);
5654 if (!IS_ERR(binderfs_entry)) {
5655 proc->binderfs_entry = binderfs_entry;
5659 error = PTR_ERR(binderfs_entry);
5660 pr_warn("Unable to create file %s in binderfs (error %d)\n",
5668 static int binder_flush(struct file *filp, fl_owner_t id)
5670 struct binder_proc *proc = filp->private_data;
5672 binder_defer_work(proc, BINDER_DEFERRED_FLUSH);
5677 static void binder_deferred_flush(struct binder_proc *proc)
5682 binder_inner_proc_lock(proc);
5683 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
5684 struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node);
5686 thread->looper_need_return = true;
5687 if (thread->looper & BINDER_LOOPER_STATE_WAITING) {
5688 wake_up_interruptible(&thread->wait);
5692 binder_inner_proc_unlock(proc);
5694 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5695 "binder_flush: %d woke %d threads\n", proc->pid,
5699 static int binder_release(struct inode *nodp, struct file *filp)
5701 struct binder_proc *proc = filp->private_data;
5703 debugfs_remove(proc->debugfs_entry);
5705 if (proc->binderfs_entry) {
5706 binderfs_remove_file(proc->binderfs_entry);
5707 proc->binderfs_entry = NULL;
5710 binder_defer_work(proc, BINDER_DEFERRED_RELEASE);
5715 static int binder_node_release(struct binder_node *node, int refs)
5717 struct binder_ref *ref;
5719 struct binder_proc *proc = node->proc;
5721 binder_release_work(proc, &node->async_todo);
5723 binder_node_lock(node);
5724 binder_inner_proc_lock(proc);
5725 binder_dequeue_work_ilocked(&node->work);
5727 * The caller must have taken a temporary ref on the node,
5729 BUG_ON(!node->tmp_refs);
5730 if (hlist_empty(&node->refs) && node->tmp_refs == 1) {
5731 binder_inner_proc_unlock(proc);
5732 binder_node_unlock(node);
5733 binder_free_node(node);
5739 node->local_strong_refs = 0;
5740 node->local_weak_refs = 0;
5741 binder_inner_proc_unlock(proc);
5743 spin_lock(&binder_dead_nodes_lock);
5744 hlist_add_head(&node->dead_node, &binder_dead_nodes);
5745 spin_unlock(&binder_dead_nodes_lock);
5747 hlist_for_each_entry(ref, &node->refs, node_entry) {
5750 * Need the node lock to synchronize
5751 * with new notification requests and the
5752 * inner lock to synchronize with queued
5753 * death notifications.
5755 binder_inner_proc_lock(ref->proc);
5757 binder_inner_proc_unlock(ref->proc);
5763 BUG_ON(!list_empty(&ref->death->work.entry));
5764 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
5765 binder_enqueue_work_ilocked(&ref->death->work,
5767 binder_wakeup_proc_ilocked(ref->proc);
5768 binder_inner_proc_unlock(ref->proc);
5771 binder_debug(BINDER_DEBUG_DEAD_BINDER,
5772 "node %d now dead, refs %d, death %d\n",
5773 node->debug_id, refs, death);
5774 binder_node_unlock(node);
5775 binder_put_node(node);
5780 static void binder_deferred_release(struct binder_proc *proc)
5782 struct binder_context *context = proc->context;
5784 int threads, nodes, incoming_refs, outgoing_refs, active_transactions;
5786 mutex_lock(&binder_procs_lock);
5787 hlist_del(&proc->proc_node);
5788 mutex_unlock(&binder_procs_lock);
5790 mutex_lock(&context->context_mgr_node_lock);
5791 if (context->binder_context_mgr_node &&
5792 context->binder_context_mgr_node->proc == proc) {
5793 binder_debug(BINDER_DEBUG_DEAD_BINDER,
5794 "%s: %d context_mgr_node gone\n",
5795 __func__, proc->pid);
5796 context->binder_context_mgr_node = NULL;
5798 mutex_unlock(&context->context_mgr_node_lock);
5799 binder_inner_proc_lock(proc);
5801 * Make sure proc stays alive after we
5802 * remove all the threads
5806 proc->is_dead = true;
5807 proc->is_frozen = false;
5808 proc->sync_recv = false;
5809 proc->async_recv = false;
5811 active_transactions = 0;
5812 while ((n = rb_first(&proc->threads))) {
5813 struct binder_thread *thread;
5815 thread = rb_entry(n, struct binder_thread, rb_node);
5816 binder_inner_proc_unlock(proc);
5818 active_transactions += binder_thread_release(proc, thread);
5819 binder_inner_proc_lock(proc);
5824 while ((n = rb_first(&proc->nodes))) {
5825 struct binder_node *node;
5827 node = rb_entry(n, struct binder_node, rb_node);
5830 * take a temporary ref on the node before
5831 * calling binder_node_release() which will either
5832 * kfree() the node or call binder_put_node()
5834 binder_inc_node_tmpref_ilocked(node);
5835 rb_erase(&node->rb_node, &proc->nodes);
5836 binder_inner_proc_unlock(proc);
5837 incoming_refs = binder_node_release(node, incoming_refs);
5838 binder_inner_proc_lock(proc);
5840 binder_inner_proc_unlock(proc);
5843 binder_proc_lock(proc);
5844 while ((n = rb_first(&proc->refs_by_desc))) {
5845 struct binder_ref *ref;
5847 ref = rb_entry(n, struct binder_ref, rb_node_desc);
5849 binder_cleanup_ref_olocked(ref);
5850 binder_proc_unlock(proc);
5851 binder_free_ref(ref);
5852 binder_proc_lock(proc);
5854 binder_proc_unlock(proc);
5856 binder_release_work(proc, &proc->todo);
5857 binder_release_work(proc, &proc->delivered_death);
5859 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5860 "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d\n",
5861 __func__, proc->pid, threads, nodes, incoming_refs,
5862 outgoing_refs, active_transactions);
5864 binder_proc_dec_tmpref(proc);
5867 static void binder_deferred_func(struct work_struct *work)
5869 struct binder_proc *proc;
5874 mutex_lock(&binder_deferred_lock);
5875 if (!hlist_empty(&binder_deferred_list)) {
5876 proc = hlist_entry(binder_deferred_list.first,
5877 struct binder_proc, deferred_work_node);
5878 hlist_del_init(&proc->deferred_work_node);
5879 defer = proc->deferred_work;
5880 proc->deferred_work = 0;
5885 mutex_unlock(&binder_deferred_lock);
5887 if (defer & BINDER_DEFERRED_FLUSH)
5888 binder_deferred_flush(proc);
5890 if (defer & BINDER_DEFERRED_RELEASE)
5891 binder_deferred_release(proc); /* frees proc */
5894 static DECLARE_WORK(binder_deferred_work, binder_deferred_func);
5897 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer)
5899 mutex_lock(&binder_deferred_lock);
5900 proc->deferred_work |= defer;
5901 if (hlist_unhashed(&proc->deferred_work_node)) {
5902 hlist_add_head(&proc->deferred_work_node,
5903 &binder_deferred_list);
5904 schedule_work(&binder_deferred_work);
5906 mutex_unlock(&binder_deferred_lock);
5909 static void print_binder_transaction_ilocked(struct seq_file *m,
5910 struct binder_proc *proc,
5912 struct binder_transaction *t)
5914 struct binder_proc *to_proc;
5915 struct binder_buffer *buffer = t->buffer;
5917 spin_lock(&t->lock);
5918 to_proc = t->to_proc;
5920 "%s %d: %pK from %d:%d to %d:%d code %x flags %x pri %ld r%d",
5921 prefix, t->debug_id, t,
5922 t->from ? t->from->proc->pid : 0,
5923 t->from ? t->from->pid : 0,
5924 to_proc ? to_proc->pid : 0,
5925 t->to_thread ? t->to_thread->pid : 0,
5926 t->code, t->flags, t->priority, t->need_reply);
5927 spin_unlock(&t->lock);
5929 if (proc != to_proc) {
5931 * Can only safely deref buffer if we are holding the
5932 * correct proc inner lock for this node
5938 if (buffer == NULL) {
5939 seq_puts(m, " buffer free\n");
5942 if (buffer->target_node)
5943 seq_printf(m, " node %d", buffer->target_node->debug_id);
5944 seq_printf(m, " size %zd:%zd data %pK\n",
5945 buffer->data_size, buffer->offsets_size,
5949 static void print_binder_work_ilocked(struct seq_file *m,
5950 struct binder_proc *proc,
5952 const char *transaction_prefix,
5953 struct binder_work *w)
5955 struct binder_node *node;
5956 struct binder_transaction *t;
5959 case BINDER_WORK_TRANSACTION:
5960 t = container_of(w, struct binder_transaction, work);
5961 print_binder_transaction_ilocked(
5962 m, proc, transaction_prefix, t);
5964 case BINDER_WORK_RETURN_ERROR: {
5965 struct binder_error *e = container_of(
5966 w, struct binder_error, work);
5968 seq_printf(m, "%stransaction error: %u\n",
5971 case BINDER_WORK_TRANSACTION_COMPLETE:
5972 seq_printf(m, "%stransaction complete\n", prefix);
5974 case BINDER_WORK_NODE:
5975 node = container_of(w, struct binder_node, work);
5976 seq_printf(m, "%snode work %d: u%016llx c%016llx\n",
5977 prefix, node->debug_id,
5978 (u64)node->ptr, (u64)node->cookie);
5980 case BINDER_WORK_DEAD_BINDER:
5981 seq_printf(m, "%shas dead binder\n", prefix);
5983 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
5984 seq_printf(m, "%shas cleared dead binder\n", prefix);
5986 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION:
5987 seq_printf(m, "%shas cleared death notification\n", prefix);
5990 seq_printf(m, "%sunknown work: type %d\n", prefix, w->type);
5995 static void print_binder_thread_ilocked(struct seq_file *m,
5996 struct binder_thread *thread,
5999 struct binder_transaction *t;
6000 struct binder_work *w;
6001 size_t start_pos = m->count;
6004 seq_printf(m, " thread %d: l %02x need_return %d tr %d\n",
6005 thread->pid, thread->looper,
6006 thread->looper_need_return,
6007 atomic_read(&thread->tmp_ref));
6008 header_pos = m->count;
6009 t = thread->transaction_stack;
6011 if (t->from == thread) {
6012 print_binder_transaction_ilocked(m, thread->proc,
6013 " outgoing transaction", t);
6015 } else if (t->to_thread == thread) {
6016 print_binder_transaction_ilocked(m, thread->proc,
6017 " incoming transaction", t);
6020 print_binder_transaction_ilocked(m, thread->proc,
6021 " bad transaction", t);
6025 list_for_each_entry(w, &thread->todo, entry) {
6026 print_binder_work_ilocked(m, thread->proc, " ",
6027 " pending transaction", w);
6029 if (!print_always && m->count == header_pos)
6030 m->count = start_pos;
6033 static void print_binder_node_nilocked(struct seq_file *m,
6034 struct binder_node *node)
6036 struct binder_ref *ref;
6037 struct binder_work *w;
6041 hlist_for_each_entry(ref, &node->refs, node_entry)
6044 seq_printf(m, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d tr %d",
6045 node->debug_id, (u64)node->ptr, (u64)node->cookie,
6046 node->has_strong_ref, node->has_weak_ref,
6047 node->local_strong_refs, node->local_weak_refs,
6048 node->internal_strong_refs, count, node->tmp_refs);
6050 seq_puts(m, " proc");
6051 hlist_for_each_entry(ref, &node->refs, node_entry)
6052 seq_printf(m, " %d", ref->proc->pid);
6056 list_for_each_entry(w, &node->async_todo, entry)
6057 print_binder_work_ilocked(m, node->proc, " ",
6058 " pending async transaction", w);
6062 static void print_binder_ref_olocked(struct seq_file *m,
6063 struct binder_ref *ref)
6065 binder_node_lock(ref->node);
6066 seq_printf(m, " ref %d: desc %d %snode %d s %d w %d d %pK\n",
6067 ref->data.debug_id, ref->data.desc,
6068 ref->node->proc ? "" : "dead ",
6069 ref->node->debug_id, ref->data.strong,
6070 ref->data.weak, ref->death);
6071 binder_node_unlock(ref->node);
6074 static void print_binder_proc(struct seq_file *m,
6075 struct binder_proc *proc, int print_all)
6077 struct binder_work *w;
6079 size_t start_pos = m->count;
6081 struct binder_node *last_node = NULL;
6083 seq_printf(m, "proc %d\n", proc->pid);
6084 seq_printf(m, "context %s\n", proc->context->name);
6085 header_pos = m->count;
6087 binder_inner_proc_lock(proc);
6088 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
6089 print_binder_thread_ilocked(m, rb_entry(n, struct binder_thread,
6090 rb_node), print_all);
6092 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
6093 struct binder_node *node = rb_entry(n, struct binder_node,
6095 if (!print_all && !node->has_async_transaction)
6099 * take a temporary reference on the node so it
6100 * survives and isn't removed from the tree
6101 * while we print it.
6103 binder_inc_node_tmpref_ilocked(node);
6104 /* Need to drop inner lock to take node lock */
6105 binder_inner_proc_unlock(proc);
6107 binder_put_node(last_node);
6108 binder_node_inner_lock(node);
6109 print_binder_node_nilocked(m, node);
6110 binder_node_inner_unlock(node);
6112 binder_inner_proc_lock(proc);
6114 binder_inner_proc_unlock(proc);
6116 binder_put_node(last_node);
6119 binder_proc_lock(proc);
6120 for (n = rb_first(&proc->refs_by_desc);
6123 print_binder_ref_olocked(m, rb_entry(n,
6126 binder_proc_unlock(proc);
6128 binder_alloc_print_allocated(m, &proc->alloc);
6129 binder_inner_proc_lock(proc);
6130 list_for_each_entry(w, &proc->todo, entry)
6131 print_binder_work_ilocked(m, proc, " ",
6132 " pending transaction", w);
6133 list_for_each_entry(w, &proc->delivered_death, entry) {
6134 seq_puts(m, " has delivered dead binder\n");
6137 binder_inner_proc_unlock(proc);
6138 if (!print_all && m->count == header_pos)
6139 m->count = start_pos;
6142 static const char * const binder_return_strings[] = {
6147 "BR_ACQUIRE_RESULT",
6149 "BR_TRANSACTION_COMPLETE",
6154 "BR_ATTEMPT_ACQUIRE",
6159 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
6162 "BR_ONEWAY_SPAM_SUSPECT",
6165 static const char * const binder_command_strings[] = {
6168 "BC_ACQUIRE_RESULT",
6176 "BC_ATTEMPT_ACQUIRE",
6177 "BC_REGISTER_LOOPER",
6180 "BC_REQUEST_DEATH_NOTIFICATION",
6181 "BC_CLEAR_DEATH_NOTIFICATION",
6182 "BC_DEAD_BINDER_DONE",
6183 "BC_TRANSACTION_SG",
6187 static const char * const binder_objstat_strings[] = {
6194 "transaction_complete"
6197 static void print_binder_stats(struct seq_file *m, const char *prefix,
6198 struct binder_stats *stats)
6202 BUILD_BUG_ON(ARRAY_SIZE(stats->bc) !=
6203 ARRAY_SIZE(binder_command_strings));
6204 for (i = 0; i < ARRAY_SIZE(stats->bc); i++) {
6205 int temp = atomic_read(&stats->bc[i]);
6208 seq_printf(m, "%s%s: %d\n", prefix,
6209 binder_command_strings[i], temp);
6212 BUILD_BUG_ON(ARRAY_SIZE(stats->br) !=
6213 ARRAY_SIZE(binder_return_strings));
6214 for (i = 0; i < ARRAY_SIZE(stats->br); i++) {
6215 int temp = atomic_read(&stats->br[i]);
6218 seq_printf(m, "%s%s: %d\n", prefix,
6219 binder_return_strings[i], temp);
6222 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
6223 ARRAY_SIZE(binder_objstat_strings));
6224 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
6225 ARRAY_SIZE(stats->obj_deleted));
6226 for (i = 0; i < ARRAY_SIZE(stats->obj_created); i++) {
6227 int created = atomic_read(&stats->obj_created[i]);
6228 int deleted = atomic_read(&stats->obj_deleted[i]);
6230 if (created || deleted)
6231 seq_printf(m, "%s%s: active %d total %d\n",
6233 binder_objstat_strings[i],
6239 static void print_binder_proc_stats(struct seq_file *m,
6240 struct binder_proc *proc)
6242 struct binder_work *w;
6243 struct binder_thread *thread;
6245 int count, strong, weak, ready_threads;
6246 size_t free_async_space =
6247 binder_alloc_get_free_async_space(&proc->alloc);
6249 seq_printf(m, "proc %d\n", proc->pid);
6250 seq_printf(m, "context %s\n", proc->context->name);
6253 binder_inner_proc_lock(proc);
6254 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
6257 list_for_each_entry(thread, &proc->waiting_threads, waiting_thread_node)
6260 seq_printf(m, " threads: %d\n", count);
6261 seq_printf(m, " requested threads: %d+%d/%d\n"
6262 " ready threads %d\n"
6263 " free async space %zd\n", proc->requested_threads,
6264 proc->requested_threads_started, proc->max_threads,
6268 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n))
6270 binder_inner_proc_unlock(proc);
6271 seq_printf(m, " nodes: %d\n", count);
6275 binder_proc_lock(proc);
6276 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
6277 struct binder_ref *ref = rb_entry(n, struct binder_ref,
6280 strong += ref->data.strong;
6281 weak += ref->data.weak;
6283 binder_proc_unlock(proc);
6284 seq_printf(m, " refs: %d s %d w %d\n", count, strong, weak);
6286 count = binder_alloc_get_allocated_count(&proc->alloc);
6287 seq_printf(m, " buffers: %d\n", count);
6289 binder_alloc_print_pages(m, &proc->alloc);
6292 binder_inner_proc_lock(proc);
6293 list_for_each_entry(w, &proc->todo, entry) {
6294 if (w->type == BINDER_WORK_TRANSACTION)
6297 binder_inner_proc_unlock(proc);
6298 seq_printf(m, " pending transactions: %d\n", count);
6300 print_binder_stats(m, " ", &proc->stats);
6303 static int state_show(struct seq_file *m, void *unused)
6305 struct binder_proc *proc;
6306 struct binder_node *node;
6307 struct binder_node *last_node = NULL;
6309 seq_puts(m, "binder state:\n");
6311 spin_lock(&binder_dead_nodes_lock);
6312 if (!hlist_empty(&binder_dead_nodes))
6313 seq_puts(m, "dead nodes:\n");
6314 hlist_for_each_entry(node, &binder_dead_nodes, dead_node) {
6316 * take a temporary reference on the node so it
6317 * survives and isn't removed from the list
6318 * while we print it.
6321 spin_unlock(&binder_dead_nodes_lock);
6323 binder_put_node(last_node);
6324 binder_node_lock(node);
6325 print_binder_node_nilocked(m, node);
6326 binder_node_unlock(node);
6328 spin_lock(&binder_dead_nodes_lock);
6330 spin_unlock(&binder_dead_nodes_lock);
6332 binder_put_node(last_node);
6334 mutex_lock(&binder_procs_lock);
6335 hlist_for_each_entry(proc, &binder_procs, proc_node)
6336 print_binder_proc(m, proc, 1);
6337 mutex_unlock(&binder_procs_lock);
6342 static int stats_show(struct seq_file *m, void *unused)
6344 struct binder_proc *proc;
6346 seq_puts(m, "binder stats:\n");
6348 print_binder_stats(m, "", &binder_stats);
6350 mutex_lock(&binder_procs_lock);
6351 hlist_for_each_entry(proc, &binder_procs, proc_node)
6352 print_binder_proc_stats(m, proc);
6353 mutex_unlock(&binder_procs_lock);
6358 static int transactions_show(struct seq_file *m, void *unused)
6360 struct binder_proc *proc;
6362 seq_puts(m, "binder transactions:\n");
6363 mutex_lock(&binder_procs_lock);
6364 hlist_for_each_entry(proc, &binder_procs, proc_node)
6365 print_binder_proc(m, proc, 0);
6366 mutex_unlock(&binder_procs_lock);
6371 static int proc_show(struct seq_file *m, void *unused)
6373 struct binder_proc *itr;
6374 int pid = (unsigned long)m->private;
6376 mutex_lock(&binder_procs_lock);
6377 hlist_for_each_entry(itr, &binder_procs, proc_node) {
6378 if (itr->pid == pid) {
6379 seq_puts(m, "binder proc state:\n");
6380 print_binder_proc(m, itr, 1);
6383 mutex_unlock(&binder_procs_lock);
6388 static void print_binder_transaction_log_entry(struct seq_file *m,
6389 struct binder_transaction_log_entry *e)
6391 int debug_id = READ_ONCE(e->debug_id_done);
6393 * read barrier to guarantee debug_id_done read before
6394 * we print the log values
6398 "%d: %s from %d:%d to %d:%d context %s node %d handle %d size %d:%d ret %d/%d l=%d",
6399 e->debug_id, (e->call_type == 2) ? "reply" :
6400 ((e->call_type == 1) ? "async" : "call "), e->from_proc,
6401 e->from_thread, e->to_proc, e->to_thread, e->context_name,
6402 e->to_node, e->target_handle, e->data_size, e->offsets_size,
6403 e->return_error, e->return_error_param,
6404 e->return_error_line);
6406 * read-barrier to guarantee read of debug_id_done after
6407 * done printing the fields of the entry
6410 seq_printf(m, debug_id && debug_id == READ_ONCE(e->debug_id_done) ?
6411 "\n" : " (incomplete)\n");
6414 static int transaction_log_show(struct seq_file *m, void *unused)
6416 struct binder_transaction_log *log = m->private;
6417 unsigned int log_cur = atomic_read(&log->cur);
6422 count = log_cur + 1;
6423 cur = count < ARRAY_SIZE(log->entry) && !log->full ?
6424 0 : count % ARRAY_SIZE(log->entry);
6425 if (count > ARRAY_SIZE(log->entry) || log->full)
6426 count = ARRAY_SIZE(log->entry);
6427 for (i = 0; i < count; i++) {
6428 unsigned int index = cur++ % ARRAY_SIZE(log->entry);
6430 print_binder_transaction_log_entry(m, &log->entry[index]);
6435 const struct file_operations binder_fops = {
6436 .owner = THIS_MODULE,
6437 .poll = binder_poll,
6438 .unlocked_ioctl = binder_ioctl,
6439 .compat_ioctl = compat_ptr_ioctl,
6440 .mmap = binder_mmap,
6441 .open = binder_open,
6442 .flush = binder_flush,
6443 .release = binder_release,
6446 DEFINE_SHOW_ATTRIBUTE(state);
6447 DEFINE_SHOW_ATTRIBUTE(stats);
6448 DEFINE_SHOW_ATTRIBUTE(transactions);
6449 DEFINE_SHOW_ATTRIBUTE(transaction_log);
6451 const struct binder_debugfs_entry binder_debugfs_entries[] = {
6455 .fops = &state_fops,
6461 .fops = &stats_fops,
6465 .name = "transactions",
6467 .fops = &transactions_fops,
6471 .name = "transaction_log",
6473 .fops = &transaction_log_fops,
6474 .data = &binder_transaction_log,
6477 .name = "failed_transaction_log",
6479 .fops = &transaction_log_fops,
6480 .data = &binder_transaction_log_failed,
6485 static int __init init_binder_device(const char *name)
6488 struct binder_device *binder_device;
6490 binder_device = kzalloc(sizeof(*binder_device), GFP_KERNEL);
6494 binder_device->miscdev.fops = &binder_fops;
6495 binder_device->miscdev.minor = MISC_DYNAMIC_MINOR;
6496 binder_device->miscdev.name = name;
6498 refcount_set(&binder_device->ref, 1);
6499 binder_device->context.binder_context_mgr_uid = INVALID_UID;
6500 binder_device->context.name = name;
6501 mutex_init(&binder_device->context.context_mgr_node_lock);
6503 ret = misc_register(&binder_device->miscdev);
6505 kfree(binder_device);
6509 hlist_add_head(&binder_device->hlist, &binder_devices);
6514 static int __init binder_init(void)
6517 char *device_name, *device_tmp;
6518 struct binder_device *device;
6519 struct hlist_node *tmp;
6520 char *device_names = NULL;
6522 ret = binder_alloc_shrinker_init();
6526 atomic_set(&binder_transaction_log.cur, ~0U);
6527 atomic_set(&binder_transaction_log_failed.cur, ~0U);
6529 binder_debugfs_dir_entry_root = debugfs_create_dir("binder", NULL);
6530 if (binder_debugfs_dir_entry_root) {
6531 const struct binder_debugfs_entry *db_entry;
6533 binder_for_each_debugfs_entry(db_entry)
6534 debugfs_create_file(db_entry->name,
6536 binder_debugfs_dir_entry_root,
6540 binder_debugfs_dir_entry_proc = debugfs_create_dir("proc",
6541 binder_debugfs_dir_entry_root);
6544 if (!IS_ENABLED(CONFIG_ANDROID_BINDERFS) &&
6545 strcmp(binder_devices_param, "") != 0) {
6547 * Copy the module_parameter string, because we don't want to
6548 * tokenize it in-place.
6550 device_names = kstrdup(binder_devices_param, GFP_KERNEL);
6551 if (!device_names) {
6553 goto err_alloc_device_names_failed;
6556 device_tmp = device_names;
6557 while ((device_name = strsep(&device_tmp, ","))) {
6558 ret = init_binder_device(device_name);
6560 goto err_init_binder_device_failed;
6564 ret = init_binderfs();
6566 goto err_init_binder_device_failed;
6570 err_init_binder_device_failed:
6571 hlist_for_each_entry_safe(device, tmp, &binder_devices, hlist) {
6572 misc_deregister(&device->miscdev);
6573 hlist_del(&device->hlist);
6577 kfree(device_names);
6579 err_alloc_device_names_failed:
6580 debugfs_remove_recursive(binder_debugfs_dir_entry_root);
6585 device_initcall(binder_init);
6587 #define CREATE_TRACE_POINTS
6588 #include "binder_trace.h"
6590 MODULE_LICENSE("GPL v2");