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 <asm/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 #define binder_debug(mask, x...) \
138 if (binder_debug_mask & mask) \
139 pr_info_ratelimited(x); \
142 #define binder_user_error(x...) \
144 if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) \
145 pr_info_ratelimited(x); \
146 if (binder_stop_on_user_error) \
147 binder_stop_on_user_error = 2; \
150 #define to_flat_binder_object(hdr) \
151 container_of(hdr, struct flat_binder_object, hdr)
153 #define to_binder_fd_object(hdr) container_of(hdr, struct binder_fd_object, hdr)
155 #define to_binder_buffer_object(hdr) \
156 container_of(hdr, struct binder_buffer_object, hdr)
158 #define to_binder_fd_array_object(hdr) \
159 container_of(hdr, struct binder_fd_array_object, hdr)
161 static struct binder_stats binder_stats;
163 static inline void binder_stats_deleted(enum binder_stat_types type)
165 atomic_inc(&binder_stats.obj_deleted[type]);
168 static inline void binder_stats_created(enum binder_stat_types type)
170 atomic_inc(&binder_stats.obj_created[type]);
173 struct binder_transaction_log binder_transaction_log;
174 struct binder_transaction_log binder_transaction_log_failed;
176 static struct binder_transaction_log_entry *binder_transaction_log_add(
177 struct binder_transaction_log *log)
179 struct binder_transaction_log_entry *e;
180 unsigned int cur = atomic_inc_return(&log->cur);
182 if (cur >= ARRAY_SIZE(log->entry))
184 e = &log->entry[cur % ARRAY_SIZE(log->entry)];
185 WRITE_ONCE(e->debug_id_done, 0);
187 * write-barrier to synchronize access to e->debug_id_done.
188 * We make sure the initialized 0 value is seen before
189 * memset() other fields are zeroed by memset.
192 memset(e, 0, sizeof(*e));
196 enum binder_deferred_state {
197 BINDER_DEFERRED_FLUSH = 0x01,
198 BINDER_DEFERRED_RELEASE = 0x02,
202 BINDER_LOOPER_STATE_REGISTERED = 0x01,
203 BINDER_LOOPER_STATE_ENTERED = 0x02,
204 BINDER_LOOPER_STATE_EXITED = 0x04,
205 BINDER_LOOPER_STATE_INVALID = 0x08,
206 BINDER_LOOPER_STATE_WAITING = 0x10,
207 BINDER_LOOPER_STATE_POLL = 0x20,
211 * binder_proc_lock() - Acquire outer lock for given binder_proc
212 * @proc: struct binder_proc to acquire
214 * Acquires proc->outer_lock. Used to protect binder_ref
215 * structures associated with the given proc.
217 #define binder_proc_lock(proc) _binder_proc_lock(proc, __LINE__)
219 _binder_proc_lock(struct binder_proc *proc, int line)
220 __acquires(&proc->outer_lock)
222 binder_debug(BINDER_DEBUG_SPINLOCKS,
223 "%s: line=%d\n", __func__, line);
224 spin_lock(&proc->outer_lock);
228 * binder_proc_unlock() - Release spinlock for given binder_proc
229 * @proc: struct binder_proc to acquire
231 * Release lock acquired via binder_proc_lock()
233 #define binder_proc_unlock(_proc) _binder_proc_unlock(_proc, __LINE__)
235 _binder_proc_unlock(struct binder_proc *proc, int line)
236 __releases(&proc->outer_lock)
238 binder_debug(BINDER_DEBUG_SPINLOCKS,
239 "%s: line=%d\n", __func__, line);
240 spin_unlock(&proc->outer_lock);
244 * binder_inner_proc_lock() - Acquire inner lock for given binder_proc
245 * @proc: struct binder_proc to acquire
247 * Acquires proc->inner_lock. Used to protect todo lists
249 #define binder_inner_proc_lock(proc) _binder_inner_proc_lock(proc, __LINE__)
251 _binder_inner_proc_lock(struct binder_proc *proc, int line)
252 __acquires(&proc->inner_lock)
254 binder_debug(BINDER_DEBUG_SPINLOCKS,
255 "%s: line=%d\n", __func__, line);
256 spin_lock(&proc->inner_lock);
260 * binder_inner_proc_unlock() - Release inner lock for given binder_proc
261 * @proc: struct binder_proc to acquire
263 * Release lock acquired via binder_inner_proc_lock()
265 #define binder_inner_proc_unlock(proc) _binder_inner_proc_unlock(proc, __LINE__)
267 _binder_inner_proc_unlock(struct binder_proc *proc, int line)
268 __releases(&proc->inner_lock)
270 binder_debug(BINDER_DEBUG_SPINLOCKS,
271 "%s: line=%d\n", __func__, line);
272 spin_unlock(&proc->inner_lock);
276 * binder_node_lock() - Acquire spinlock for given binder_node
277 * @node: struct binder_node to acquire
279 * Acquires node->lock. Used to protect binder_node fields
281 #define binder_node_lock(node) _binder_node_lock(node, __LINE__)
283 _binder_node_lock(struct binder_node *node, int line)
284 __acquires(&node->lock)
286 binder_debug(BINDER_DEBUG_SPINLOCKS,
287 "%s: line=%d\n", __func__, line);
288 spin_lock(&node->lock);
292 * binder_node_unlock() - Release spinlock for given binder_proc
293 * @node: struct binder_node to acquire
295 * Release lock acquired via binder_node_lock()
297 #define binder_node_unlock(node) _binder_node_unlock(node, __LINE__)
299 _binder_node_unlock(struct binder_node *node, int line)
300 __releases(&node->lock)
302 binder_debug(BINDER_DEBUG_SPINLOCKS,
303 "%s: line=%d\n", __func__, line);
304 spin_unlock(&node->lock);
308 * binder_node_inner_lock() - Acquire node and inner locks
309 * @node: struct binder_node to acquire
311 * Acquires node->lock. If node->proc also acquires
312 * proc->inner_lock. Used to protect binder_node fields
314 #define binder_node_inner_lock(node) _binder_node_inner_lock(node, __LINE__)
316 _binder_node_inner_lock(struct binder_node *node, int line)
317 __acquires(&node->lock) __acquires(&node->proc->inner_lock)
319 binder_debug(BINDER_DEBUG_SPINLOCKS,
320 "%s: line=%d\n", __func__, line);
321 spin_lock(&node->lock);
323 binder_inner_proc_lock(node->proc);
325 /* annotation for sparse */
326 __acquire(&node->proc->inner_lock);
330 * binder_node_unlock() - Release node and inner locks
331 * @node: struct binder_node to acquire
333 * Release lock acquired via binder_node_lock()
335 #define binder_node_inner_unlock(node) _binder_node_inner_unlock(node, __LINE__)
337 _binder_node_inner_unlock(struct binder_node *node, int line)
338 __releases(&node->lock) __releases(&node->proc->inner_lock)
340 struct binder_proc *proc = node->proc;
342 binder_debug(BINDER_DEBUG_SPINLOCKS,
343 "%s: line=%d\n", __func__, line);
345 binder_inner_proc_unlock(proc);
347 /* annotation for sparse */
348 __release(&node->proc->inner_lock);
349 spin_unlock(&node->lock);
352 static bool binder_worklist_empty_ilocked(struct list_head *list)
354 return list_empty(list);
358 * binder_worklist_empty() - Check if no items on the work list
359 * @proc: binder_proc associated with list
360 * @list: list to check
362 * Return: true if there are no items on list, else false
364 static bool binder_worklist_empty(struct binder_proc *proc,
365 struct list_head *list)
369 binder_inner_proc_lock(proc);
370 ret = binder_worklist_empty_ilocked(list);
371 binder_inner_proc_unlock(proc);
376 * binder_enqueue_work_ilocked() - Add an item to the work list
377 * @work: struct binder_work to add to list
378 * @target_list: list to add work to
380 * Adds the work to the specified list. Asserts that work
381 * is not already on a list.
383 * Requires the proc->inner_lock to be held.
386 binder_enqueue_work_ilocked(struct binder_work *work,
387 struct list_head *target_list)
389 BUG_ON(target_list == NULL);
390 BUG_ON(work->entry.next && !list_empty(&work->entry));
391 list_add_tail(&work->entry, target_list);
395 * binder_enqueue_deferred_thread_work_ilocked() - Add deferred thread work
396 * @thread: thread to queue work to
397 * @work: struct binder_work to add to list
399 * Adds the work to the todo list of the thread. Doesn't set the process_todo
400 * flag, which means that (if it wasn't already set) the thread will go to
401 * sleep without handling this work when it calls read.
403 * Requires the proc->inner_lock to be held.
406 binder_enqueue_deferred_thread_work_ilocked(struct binder_thread *thread,
407 struct binder_work *work)
409 WARN_ON(!list_empty(&thread->waiting_thread_node));
410 binder_enqueue_work_ilocked(work, &thread->todo);
414 * binder_enqueue_thread_work_ilocked() - Add an item to the thread work list
415 * @thread: thread to queue work to
416 * @work: struct binder_work to add to list
418 * Adds the work to the todo list of the thread, and enables processing
421 * Requires the proc->inner_lock to be held.
424 binder_enqueue_thread_work_ilocked(struct binder_thread *thread,
425 struct binder_work *work)
427 WARN_ON(!list_empty(&thread->waiting_thread_node));
428 binder_enqueue_work_ilocked(work, &thread->todo);
429 thread->process_todo = true;
433 * binder_enqueue_thread_work() - Add an item to the thread work list
434 * @thread: thread to queue work to
435 * @work: struct binder_work to add to list
437 * Adds the work to the todo list of the thread, and enables processing
441 binder_enqueue_thread_work(struct binder_thread *thread,
442 struct binder_work *work)
444 binder_inner_proc_lock(thread->proc);
445 binder_enqueue_thread_work_ilocked(thread, work);
446 binder_inner_proc_unlock(thread->proc);
450 binder_dequeue_work_ilocked(struct binder_work *work)
452 list_del_init(&work->entry);
456 * binder_dequeue_work() - Removes an item from the work list
457 * @proc: binder_proc associated with list
458 * @work: struct binder_work to remove from list
460 * Removes the specified work item from whatever list it is on.
461 * Can safely be called if work is not on any list.
464 binder_dequeue_work(struct binder_proc *proc, struct binder_work *work)
466 binder_inner_proc_lock(proc);
467 binder_dequeue_work_ilocked(work);
468 binder_inner_proc_unlock(proc);
471 static struct binder_work *binder_dequeue_work_head_ilocked(
472 struct list_head *list)
474 struct binder_work *w;
476 w = list_first_entry_or_null(list, struct binder_work, entry);
478 list_del_init(&w->entry);
483 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer);
484 static void binder_free_thread(struct binder_thread *thread);
485 static void binder_free_proc(struct binder_proc *proc);
486 static void binder_inc_node_tmpref_ilocked(struct binder_node *node);
488 static bool binder_has_work_ilocked(struct binder_thread *thread,
491 return thread->process_todo ||
492 thread->looper_need_return ||
494 !binder_worklist_empty_ilocked(&thread->proc->todo));
497 static bool binder_has_work(struct binder_thread *thread, bool do_proc_work)
501 binder_inner_proc_lock(thread->proc);
502 has_work = binder_has_work_ilocked(thread, do_proc_work);
503 binder_inner_proc_unlock(thread->proc);
508 static bool binder_available_for_proc_work_ilocked(struct binder_thread *thread)
510 return !thread->transaction_stack &&
511 binder_worklist_empty_ilocked(&thread->todo) &&
512 (thread->looper & (BINDER_LOOPER_STATE_ENTERED |
513 BINDER_LOOPER_STATE_REGISTERED));
516 static void binder_wakeup_poll_threads_ilocked(struct binder_proc *proc,
520 struct binder_thread *thread;
522 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
523 thread = rb_entry(n, struct binder_thread, rb_node);
524 if (thread->looper & BINDER_LOOPER_STATE_POLL &&
525 binder_available_for_proc_work_ilocked(thread)) {
527 wake_up_interruptible_sync(&thread->wait);
529 wake_up_interruptible(&thread->wait);
535 * binder_select_thread_ilocked() - selects a thread for doing proc work.
536 * @proc: process to select a thread from
538 * Note that calling this function moves the thread off the waiting_threads
539 * list, so it can only be woken up by the caller of this function, or a
540 * signal. Therefore, callers *should* always wake up the thread this function
543 * Return: If there's a thread currently waiting for process work,
544 * returns that thread. Otherwise returns NULL.
546 static struct binder_thread *
547 binder_select_thread_ilocked(struct binder_proc *proc)
549 struct binder_thread *thread;
551 assert_spin_locked(&proc->inner_lock);
552 thread = list_first_entry_or_null(&proc->waiting_threads,
553 struct binder_thread,
554 waiting_thread_node);
557 list_del_init(&thread->waiting_thread_node);
563 * binder_wakeup_thread_ilocked() - wakes up a thread for doing proc work.
564 * @proc: process to wake up a thread in
565 * @thread: specific thread to wake-up (may be NULL)
566 * @sync: whether to do a synchronous wake-up
568 * This function wakes up a thread in the @proc process.
569 * The caller may provide a specific thread to wake-up in
570 * the @thread parameter. If @thread is NULL, this function
571 * will wake up threads that have called poll().
573 * Note that for this function to work as expected, callers
574 * should first call binder_select_thread() to find a thread
575 * to handle the work (if they don't have a thread already),
576 * and pass the result into the @thread parameter.
578 static void binder_wakeup_thread_ilocked(struct binder_proc *proc,
579 struct binder_thread *thread,
582 assert_spin_locked(&proc->inner_lock);
586 wake_up_interruptible_sync(&thread->wait);
588 wake_up_interruptible(&thread->wait);
592 /* Didn't find a thread waiting for proc work; this can happen
594 * 1. All threads are busy handling transactions
595 * In that case, one of those threads should call back into
596 * the kernel driver soon and pick up this work.
597 * 2. Threads are using the (e)poll interface, in which case
598 * they may be blocked on the waitqueue without having been
599 * added to waiting_threads. For this case, we just iterate
600 * over all threads not handling transaction work, and
601 * wake them all up. We wake all because we don't know whether
602 * a thread that called into (e)poll is handling non-binder
605 binder_wakeup_poll_threads_ilocked(proc, sync);
608 static void binder_wakeup_proc_ilocked(struct binder_proc *proc)
610 struct binder_thread *thread = binder_select_thread_ilocked(proc);
612 binder_wakeup_thread_ilocked(proc, thread, /* sync = */false);
615 static void binder_set_nice(long nice)
619 if (can_nice(current, nice)) {
620 set_user_nice(current, nice);
623 min_nice = rlimit_to_nice(rlimit(RLIMIT_NICE));
624 binder_debug(BINDER_DEBUG_PRIORITY_CAP,
625 "%d: nice value %ld not allowed use %ld instead\n",
626 current->pid, nice, min_nice);
627 set_user_nice(current, min_nice);
628 if (min_nice <= MAX_NICE)
630 binder_user_error("%d RLIMIT_NICE not set\n", current->pid);
633 static struct binder_node *binder_get_node_ilocked(struct binder_proc *proc,
634 binder_uintptr_t ptr)
636 struct rb_node *n = proc->nodes.rb_node;
637 struct binder_node *node;
639 assert_spin_locked(&proc->inner_lock);
642 node = rb_entry(n, struct binder_node, rb_node);
646 else if (ptr > node->ptr)
650 * take an implicit weak reference
651 * to ensure node stays alive until
652 * call to binder_put_node()
654 binder_inc_node_tmpref_ilocked(node);
661 static struct binder_node *binder_get_node(struct binder_proc *proc,
662 binder_uintptr_t ptr)
664 struct binder_node *node;
666 binder_inner_proc_lock(proc);
667 node = binder_get_node_ilocked(proc, ptr);
668 binder_inner_proc_unlock(proc);
672 static struct binder_node *binder_init_node_ilocked(
673 struct binder_proc *proc,
674 struct binder_node *new_node,
675 struct flat_binder_object *fp)
677 struct rb_node **p = &proc->nodes.rb_node;
678 struct rb_node *parent = NULL;
679 struct binder_node *node;
680 binder_uintptr_t ptr = fp ? fp->binder : 0;
681 binder_uintptr_t cookie = fp ? fp->cookie : 0;
682 __u32 flags = fp ? fp->flags : 0;
684 assert_spin_locked(&proc->inner_lock);
689 node = rb_entry(parent, struct binder_node, rb_node);
693 else if (ptr > node->ptr)
697 * A matching node is already in
698 * the rb tree. Abandon the init
701 binder_inc_node_tmpref_ilocked(node);
706 binder_stats_created(BINDER_STAT_NODE);
708 rb_link_node(&node->rb_node, parent, p);
709 rb_insert_color(&node->rb_node, &proc->nodes);
710 node->debug_id = atomic_inc_return(&binder_last_id);
713 node->cookie = cookie;
714 node->work.type = BINDER_WORK_NODE;
715 node->min_priority = flags & FLAT_BINDER_FLAG_PRIORITY_MASK;
716 node->accept_fds = !!(flags & FLAT_BINDER_FLAG_ACCEPTS_FDS);
717 node->txn_security_ctx = !!(flags & FLAT_BINDER_FLAG_TXN_SECURITY_CTX);
718 spin_lock_init(&node->lock);
719 INIT_LIST_HEAD(&node->work.entry);
720 INIT_LIST_HEAD(&node->async_todo);
721 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
722 "%d:%d node %d u%016llx c%016llx created\n",
723 proc->pid, current->pid, node->debug_id,
724 (u64)node->ptr, (u64)node->cookie);
729 static struct binder_node *binder_new_node(struct binder_proc *proc,
730 struct flat_binder_object *fp)
732 struct binder_node *node;
733 struct binder_node *new_node = kzalloc(sizeof(*node), GFP_KERNEL);
737 binder_inner_proc_lock(proc);
738 node = binder_init_node_ilocked(proc, new_node, fp);
739 binder_inner_proc_unlock(proc);
740 if (node != new_node)
742 * The node was already added by another thread
749 static void binder_free_node(struct binder_node *node)
752 binder_stats_deleted(BINDER_STAT_NODE);
755 static int binder_inc_node_nilocked(struct binder_node *node, int strong,
757 struct list_head *target_list)
759 struct binder_proc *proc = node->proc;
761 assert_spin_locked(&node->lock);
763 assert_spin_locked(&proc->inner_lock);
766 if (target_list == NULL &&
767 node->internal_strong_refs == 0 &&
769 node == node->proc->context->binder_context_mgr_node &&
770 node->has_strong_ref)) {
771 pr_err("invalid inc strong node for %d\n",
775 node->internal_strong_refs++;
777 node->local_strong_refs++;
778 if (!node->has_strong_ref && target_list) {
779 struct binder_thread *thread = container_of(target_list,
780 struct binder_thread, todo);
781 binder_dequeue_work_ilocked(&node->work);
782 BUG_ON(&thread->todo != target_list);
783 binder_enqueue_deferred_thread_work_ilocked(thread,
788 node->local_weak_refs++;
789 if (!node->has_weak_ref && list_empty(&node->work.entry)) {
790 if (target_list == NULL) {
791 pr_err("invalid inc weak node for %d\n",
798 binder_enqueue_work_ilocked(&node->work, target_list);
804 static int binder_inc_node(struct binder_node *node, int strong, int internal,
805 struct list_head *target_list)
809 binder_node_inner_lock(node);
810 ret = binder_inc_node_nilocked(node, strong, internal, target_list);
811 binder_node_inner_unlock(node);
816 static bool binder_dec_node_nilocked(struct binder_node *node,
817 int strong, int internal)
819 struct binder_proc *proc = node->proc;
821 assert_spin_locked(&node->lock);
823 assert_spin_locked(&proc->inner_lock);
826 node->internal_strong_refs--;
828 node->local_strong_refs--;
829 if (node->local_strong_refs || node->internal_strong_refs)
833 node->local_weak_refs--;
834 if (node->local_weak_refs || node->tmp_refs ||
835 !hlist_empty(&node->refs))
839 if (proc && (node->has_strong_ref || node->has_weak_ref)) {
840 if (list_empty(&node->work.entry)) {
841 binder_enqueue_work_ilocked(&node->work, &proc->todo);
842 binder_wakeup_proc_ilocked(proc);
845 if (hlist_empty(&node->refs) && !node->local_strong_refs &&
846 !node->local_weak_refs && !node->tmp_refs) {
848 binder_dequeue_work_ilocked(&node->work);
849 rb_erase(&node->rb_node, &proc->nodes);
850 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
851 "refless node %d deleted\n",
854 BUG_ON(!list_empty(&node->work.entry));
855 spin_lock(&binder_dead_nodes_lock);
857 * tmp_refs could have changed so
860 if (node->tmp_refs) {
861 spin_unlock(&binder_dead_nodes_lock);
864 hlist_del(&node->dead_node);
865 spin_unlock(&binder_dead_nodes_lock);
866 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
867 "dead node %d deleted\n",
876 static void binder_dec_node(struct binder_node *node, int strong, int internal)
880 binder_node_inner_lock(node);
881 free_node = binder_dec_node_nilocked(node, strong, internal);
882 binder_node_inner_unlock(node);
884 binder_free_node(node);
887 static void binder_inc_node_tmpref_ilocked(struct binder_node *node)
890 * No call to binder_inc_node() is needed since we
891 * don't need to inform userspace of any changes to
898 * binder_inc_node_tmpref() - take a temporary reference on node
899 * @node: node to reference
901 * Take reference on node to prevent the node from being freed
902 * while referenced only by a local variable. The inner lock is
903 * needed to serialize with the node work on the queue (which
904 * isn't needed after the node is dead). If the node is dead
905 * (node->proc is NULL), use binder_dead_nodes_lock to protect
906 * node->tmp_refs against dead-node-only cases where the node
907 * lock cannot be acquired (eg traversing the dead node list to
910 static void binder_inc_node_tmpref(struct binder_node *node)
912 binder_node_lock(node);
914 binder_inner_proc_lock(node->proc);
916 spin_lock(&binder_dead_nodes_lock);
917 binder_inc_node_tmpref_ilocked(node);
919 binder_inner_proc_unlock(node->proc);
921 spin_unlock(&binder_dead_nodes_lock);
922 binder_node_unlock(node);
926 * binder_dec_node_tmpref() - remove a temporary reference on node
927 * @node: node to reference
929 * Release temporary reference on node taken via binder_inc_node_tmpref()
931 static void binder_dec_node_tmpref(struct binder_node *node)
935 binder_node_inner_lock(node);
937 spin_lock(&binder_dead_nodes_lock);
939 __acquire(&binder_dead_nodes_lock);
941 BUG_ON(node->tmp_refs < 0);
943 spin_unlock(&binder_dead_nodes_lock);
945 __release(&binder_dead_nodes_lock);
947 * Call binder_dec_node() to check if all refcounts are 0
948 * and cleanup is needed. Calling with strong=0 and internal=1
949 * causes no actual reference to be released in binder_dec_node().
950 * If that changes, a change is needed here too.
952 free_node = binder_dec_node_nilocked(node, 0, 1);
953 binder_node_inner_unlock(node);
955 binder_free_node(node);
958 static void binder_put_node(struct binder_node *node)
960 binder_dec_node_tmpref(node);
963 static struct binder_ref *binder_get_ref_olocked(struct binder_proc *proc,
964 u32 desc, bool need_strong_ref)
966 struct rb_node *n = proc->refs_by_desc.rb_node;
967 struct binder_ref *ref;
970 ref = rb_entry(n, struct binder_ref, rb_node_desc);
972 if (desc < ref->data.desc) {
974 } else if (desc > ref->data.desc) {
976 } else if (need_strong_ref && !ref->data.strong) {
977 binder_user_error("tried to use weak ref as strong ref\n");
987 * binder_get_ref_for_node_olocked() - get the ref associated with given node
988 * @proc: binder_proc that owns the ref
989 * @node: binder_node of target
990 * @new_ref: newly allocated binder_ref to be initialized or %NULL
992 * Look up the ref for the given node and return it if it exists
994 * If it doesn't exist and the caller provides a newly allocated
995 * ref, initialize the fields of the newly allocated ref and insert
996 * into the given proc rb_trees and node refs list.
998 * Return: the ref for node. It is possible that another thread
999 * allocated/initialized the ref first in which case the
1000 * returned ref would be different than the passed-in
1001 * new_ref. new_ref must be kfree'd by the caller in
1004 static struct binder_ref *binder_get_ref_for_node_olocked(
1005 struct binder_proc *proc,
1006 struct binder_node *node,
1007 struct binder_ref *new_ref)
1009 struct binder_context *context = proc->context;
1010 struct rb_node **p = &proc->refs_by_node.rb_node;
1011 struct rb_node *parent = NULL;
1012 struct binder_ref *ref;
1017 ref = rb_entry(parent, struct binder_ref, rb_node_node);
1019 if (node < ref->node)
1021 else if (node > ref->node)
1022 p = &(*p)->rb_right;
1029 binder_stats_created(BINDER_STAT_REF);
1030 new_ref->data.debug_id = atomic_inc_return(&binder_last_id);
1031 new_ref->proc = proc;
1032 new_ref->node = node;
1033 rb_link_node(&new_ref->rb_node_node, parent, p);
1034 rb_insert_color(&new_ref->rb_node_node, &proc->refs_by_node);
1036 new_ref->data.desc = (node == context->binder_context_mgr_node) ? 0 : 1;
1037 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
1038 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1039 if (ref->data.desc > new_ref->data.desc)
1041 new_ref->data.desc = ref->data.desc + 1;
1044 p = &proc->refs_by_desc.rb_node;
1047 ref = rb_entry(parent, struct binder_ref, rb_node_desc);
1049 if (new_ref->data.desc < ref->data.desc)
1051 else if (new_ref->data.desc > ref->data.desc)
1052 p = &(*p)->rb_right;
1056 rb_link_node(&new_ref->rb_node_desc, parent, p);
1057 rb_insert_color(&new_ref->rb_node_desc, &proc->refs_by_desc);
1059 binder_node_lock(node);
1060 hlist_add_head(&new_ref->node_entry, &node->refs);
1062 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1063 "%d new ref %d desc %d for node %d\n",
1064 proc->pid, new_ref->data.debug_id, new_ref->data.desc,
1066 binder_node_unlock(node);
1070 static void binder_cleanup_ref_olocked(struct binder_ref *ref)
1072 bool delete_node = false;
1074 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1075 "%d delete ref %d desc %d for node %d\n",
1076 ref->proc->pid, ref->data.debug_id, ref->data.desc,
1077 ref->node->debug_id);
1079 rb_erase(&ref->rb_node_desc, &ref->proc->refs_by_desc);
1080 rb_erase(&ref->rb_node_node, &ref->proc->refs_by_node);
1082 binder_node_inner_lock(ref->node);
1083 if (ref->data.strong)
1084 binder_dec_node_nilocked(ref->node, 1, 1);
1086 hlist_del(&ref->node_entry);
1087 delete_node = binder_dec_node_nilocked(ref->node, 0, 1);
1088 binder_node_inner_unlock(ref->node);
1090 * Clear ref->node unless we want the caller to free the node
1094 * The caller uses ref->node to determine
1095 * whether the node needs to be freed. Clear
1096 * it since the node is still alive.
1102 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1103 "%d delete ref %d desc %d has death notification\n",
1104 ref->proc->pid, ref->data.debug_id,
1106 binder_dequeue_work(ref->proc, &ref->death->work);
1107 binder_stats_deleted(BINDER_STAT_DEATH);
1109 binder_stats_deleted(BINDER_STAT_REF);
1113 * binder_inc_ref_olocked() - increment the ref for given handle
1114 * @ref: ref to be incremented
1115 * @strong: if true, strong increment, else weak
1116 * @target_list: list to queue node work on
1118 * Increment the ref. @ref->proc->outer_lock must be held on entry
1120 * Return: 0, if successful, else errno
1122 static int binder_inc_ref_olocked(struct binder_ref *ref, int strong,
1123 struct list_head *target_list)
1128 if (ref->data.strong == 0) {
1129 ret = binder_inc_node(ref->node, 1, 1, target_list);
1135 if (ref->data.weak == 0) {
1136 ret = binder_inc_node(ref->node, 0, 1, target_list);
1146 * binder_dec_ref() - dec the ref for given handle
1147 * @ref: ref to be decremented
1148 * @strong: if true, strong decrement, else weak
1150 * Decrement the ref.
1152 * Return: true if ref is cleaned up and ready to be freed
1154 static bool binder_dec_ref_olocked(struct binder_ref *ref, int strong)
1157 if (ref->data.strong == 0) {
1158 binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n",
1159 ref->proc->pid, ref->data.debug_id,
1160 ref->data.desc, ref->data.strong,
1165 if (ref->data.strong == 0)
1166 binder_dec_node(ref->node, strong, 1);
1168 if (ref->data.weak == 0) {
1169 binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n",
1170 ref->proc->pid, ref->data.debug_id,
1171 ref->data.desc, ref->data.strong,
1177 if (ref->data.strong == 0 && ref->data.weak == 0) {
1178 binder_cleanup_ref_olocked(ref);
1185 * binder_get_node_from_ref() - get the node from the given proc/desc
1186 * @proc: proc containing the ref
1187 * @desc: the handle associated with the ref
1188 * @need_strong_ref: if true, only return node if ref is strong
1189 * @rdata: the id/refcount data for the ref
1191 * Given a proc and ref handle, return the associated binder_node
1193 * Return: a binder_node or NULL if not found or not strong when strong required
1195 static struct binder_node *binder_get_node_from_ref(
1196 struct binder_proc *proc,
1197 u32 desc, bool need_strong_ref,
1198 struct binder_ref_data *rdata)
1200 struct binder_node *node;
1201 struct binder_ref *ref;
1203 binder_proc_lock(proc);
1204 ref = binder_get_ref_olocked(proc, desc, need_strong_ref);
1209 * Take an implicit reference on the node to ensure
1210 * it stays alive until the call to binder_put_node()
1212 binder_inc_node_tmpref(node);
1215 binder_proc_unlock(proc);
1220 binder_proc_unlock(proc);
1225 * binder_free_ref() - free the binder_ref
1228 * Free the binder_ref. Free the binder_node indicated by ref->node
1229 * (if non-NULL) and the binder_ref_death indicated by ref->death.
1231 static void binder_free_ref(struct binder_ref *ref)
1234 binder_free_node(ref->node);
1240 * binder_update_ref_for_handle() - inc/dec the ref for given handle
1241 * @proc: proc containing the ref
1242 * @desc: the handle associated with the ref
1243 * @increment: true=inc reference, false=dec reference
1244 * @strong: true=strong reference, false=weak reference
1245 * @rdata: the id/refcount data for the ref
1247 * Given a proc and ref handle, increment or decrement the ref
1248 * according to "increment" arg.
1250 * Return: 0 if successful, else errno
1252 static int binder_update_ref_for_handle(struct binder_proc *proc,
1253 uint32_t desc, bool increment, bool strong,
1254 struct binder_ref_data *rdata)
1257 struct binder_ref *ref;
1258 bool delete_ref = false;
1260 binder_proc_lock(proc);
1261 ref = binder_get_ref_olocked(proc, desc, strong);
1267 ret = binder_inc_ref_olocked(ref, strong, NULL);
1269 delete_ref = binder_dec_ref_olocked(ref, strong);
1273 binder_proc_unlock(proc);
1276 binder_free_ref(ref);
1280 binder_proc_unlock(proc);
1285 * binder_dec_ref_for_handle() - dec the ref for given handle
1286 * @proc: proc containing the ref
1287 * @desc: the handle associated with the ref
1288 * @strong: true=strong reference, false=weak reference
1289 * @rdata: the id/refcount data for the ref
1291 * Just calls binder_update_ref_for_handle() to decrement the ref.
1293 * Return: 0 if successful, else errno
1295 static int binder_dec_ref_for_handle(struct binder_proc *proc,
1296 uint32_t desc, bool strong, struct binder_ref_data *rdata)
1298 return binder_update_ref_for_handle(proc, desc, false, strong, rdata);
1303 * binder_inc_ref_for_node() - increment the ref for given proc/node
1304 * @proc: proc containing the ref
1305 * @node: target node
1306 * @strong: true=strong reference, false=weak reference
1307 * @target_list: worklist to use if node is incremented
1308 * @rdata: the id/refcount data for the ref
1310 * Given a proc and node, increment the ref. Create the ref if it
1311 * doesn't already exist
1313 * Return: 0 if successful, else errno
1315 static int binder_inc_ref_for_node(struct binder_proc *proc,
1316 struct binder_node *node,
1318 struct list_head *target_list,
1319 struct binder_ref_data *rdata)
1321 struct binder_ref *ref;
1322 struct binder_ref *new_ref = NULL;
1325 binder_proc_lock(proc);
1326 ref = binder_get_ref_for_node_olocked(proc, node, NULL);
1328 binder_proc_unlock(proc);
1329 new_ref = kzalloc(sizeof(*ref), GFP_KERNEL);
1332 binder_proc_lock(proc);
1333 ref = binder_get_ref_for_node_olocked(proc, node, new_ref);
1335 ret = binder_inc_ref_olocked(ref, strong, target_list);
1337 binder_proc_unlock(proc);
1338 if (new_ref && ref != new_ref)
1340 * Another thread created the ref first so
1341 * free the one we allocated
1347 static void binder_pop_transaction_ilocked(struct binder_thread *target_thread,
1348 struct binder_transaction *t)
1350 BUG_ON(!target_thread);
1351 assert_spin_locked(&target_thread->proc->inner_lock);
1352 BUG_ON(target_thread->transaction_stack != t);
1353 BUG_ON(target_thread->transaction_stack->from != target_thread);
1354 target_thread->transaction_stack =
1355 target_thread->transaction_stack->from_parent;
1360 * binder_thread_dec_tmpref() - decrement thread->tmp_ref
1361 * @thread: thread to decrement
1363 * A thread needs to be kept alive while being used to create or
1364 * handle a transaction. binder_get_txn_from() is used to safely
1365 * extract t->from from a binder_transaction and keep the thread
1366 * indicated by t->from from being freed. When done with that
1367 * binder_thread, this function is called to decrement the
1368 * tmp_ref and free if appropriate (thread has been released
1369 * and no transaction being processed by the driver)
1371 static void binder_thread_dec_tmpref(struct binder_thread *thread)
1374 * atomic is used to protect the counter value while
1375 * it cannot reach zero or thread->is_dead is false
1377 binder_inner_proc_lock(thread->proc);
1378 atomic_dec(&thread->tmp_ref);
1379 if (thread->is_dead && !atomic_read(&thread->tmp_ref)) {
1380 binder_inner_proc_unlock(thread->proc);
1381 binder_free_thread(thread);
1384 binder_inner_proc_unlock(thread->proc);
1388 * binder_proc_dec_tmpref() - decrement proc->tmp_ref
1389 * @proc: proc to decrement
1391 * A binder_proc needs to be kept alive while being used to create or
1392 * handle a transaction. proc->tmp_ref is incremented when
1393 * creating a new transaction or the binder_proc is currently in-use
1394 * by threads that are being released. When done with the binder_proc,
1395 * this function is called to decrement the counter and free the
1396 * proc if appropriate (proc has been released, all threads have
1397 * been released and not currenly in-use to process a transaction).
1399 static void binder_proc_dec_tmpref(struct binder_proc *proc)
1401 binder_inner_proc_lock(proc);
1403 if (proc->is_dead && RB_EMPTY_ROOT(&proc->threads) &&
1405 binder_inner_proc_unlock(proc);
1406 binder_free_proc(proc);
1409 binder_inner_proc_unlock(proc);
1413 * binder_get_txn_from() - safely extract the "from" thread in transaction
1414 * @t: binder transaction for t->from
1416 * Atomically return the "from" thread and increment the tmp_ref
1417 * count for the thread to ensure it stays alive until
1418 * binder_thread_dec_tmpref() is called.
1420 * Return: the value of t->from
1422 static struct binder_thread *binder_get_txn_from(
1423 struct binder_transaction *t)
1425 struct binder_thread *from;
1427 spin_lock(&t->lock);
1430 atomic_inc(&from->tmp_ref);
1431 spin_unlock(&t->lock);
1436 * binder_get_txn_from_and_acq_inner() - get t->from and acquire inner lock
1437 * @t: binder transaction for t->from
1439 * Same as binder_get_txn_from() except it also acquires the proc->inner_lock
1440 * to guarantee that the thread cannot be released while operating on it.
1441 * The caller must call binder_inner_proc_unlock() to release the inner lock
1442 * as well as call binder_dec_thread_txn() to release the reference.
1444 * Return: the value of t->from
1446 static struct binder_thread *binder_get_txn_from_and_acq_inner(
1447 struct binder_transaction *t)
1448 __acquires(&t->from->proc->inner_lock)
1450 struct binder_thread *from;
1452 from = binder_get_txn_from(t);
1454 __acquire(&from->proc->inner_lock);
1457 binder_inner_proc_lock(from->proc);
1459 BUG_ON(from != t->from);
1462 binder_inner_proc_unlock(from->proc);
1463 __acquire(&from->proc->inner_lock);
1464 binder_thread_dec_tmpref(from);
1469 * binder_free_txn_fixups() - free unprocessed fd fixups
1470 * @t: binder transaction for t->from
1472 * If the transaction is being torn down prior to being
1473 * processed by the target process, free all of the
1474 * fd fixups and fput the file structs. It is safe to
1475 * call this function after the fixups have been
1476 * processed -- in that case, the list will be empty.
1478 static void binder_free_txn_fixups(struct binder_transaction *t)
1480 struct binder_txn_fd_fixup *fixup, *tmp;
1482 list_for_each_entry_safe(fixup, tmp, &t->fd_fixups, fixup_entry) {
1484 list_del(&fixup->fixup_entry);
1489 static void binder_txn_latency_free(struct binder_transaction *t)
1491 int from_proc, from_thread, to_proc, to_thread;
1493 spin_lock(&t->lock);
1494 from_proc = t->from ? t->from->proc->pid : 0;
1495 from_thread = t->from ? t->from->pid : 0;
1496 to_proc = t->to_proc ? t->to_proc->pid : 0;
1497 to_thread = t->to_thread ? t->to_thread->pid : 0;
1498 spin_unlock(&t->lock);
1500 trace_binder_txn_latency_free(t, from_proc, from_thread, to_proc, to_thread);
1503 static void binder_free_transaction(struct binder_transaction *t)
1505 struct binder_proc *target_proc = t->to_proc;
1508 binder_inner_proc_lock(target_proc);
1509 target_proc->outstanding_txns--;
1510 if (target_proc->outstanding_txns < 0)
1511 pr_warn("%s: Unexpected outstanding_txns %d\n",
1512 __func__, target_proc->outstanding_txns);
1513 if (!target_proc->outstanding_txns && target_proc->is_frozen)
1514 wake_up_interruptible_all(&target_proc->freeze_wait);
1516 t->buffer->transaction = NULL;
1517 binder_inner_proc_unlock(target_proc);
1519 if (trace_binder_txn_latency_free_enabled())
1520 binder_txn_latency_free(t);
1522 * If the transaction has no target_proc, then
1523 * t->buffer->transaction has already been cleared.
1525 binder_free_txn_fixups(t);
1527 binder_stats_deleted(BINDER_STAT_TRANSACTION);
1530 static void binder_send_failed_reply(struct binder_transaction *t,
1531 uint32_t error_code)
1533 struct binder_thread *target_thread;
1534 struct binder_transaction *next;
1536 BUG_ON(t->flags & TF_ONE_WAY);
1538 target_thread = binder_get_txn_from_and_acq_inner(t);
1539 if (target_thread) {
1540 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1541 "send failed reply for transaction %d to %d:%d\n",
1543 target_thread->proc->pid,
1544 target_thread->pid);
1546 binder_pop_transaction_ilocked(target_thread, t);
1547 if (target_thread->reply_error.cmd == BR_OK) {
1548 target_thread->reply_error.cmd = error_code;
1549 binder_enqueue_thread_work_ilocked(
1551 &target_thread->reply_error.work);
1552 wake_up_interruptible(&target_thread->wait);
1555 * Cannot get here for normal operation, but
1556 * we can if multiple synchronous transactions
1557 * are sent without blocking for responses.
1558 * Just ignore the 2nd error in this case.
1560 pr_warn("Unexpected reply error: %u\n",
1561 target_thread->reply_error.cmd);
1563 binder_inner_proc_unlock(target_thread->proc);
1564 binder_thread_dec_tmpref(target_thread);
1565 binder_free_transaction(t);
1568 __release(&target_thread->proc->inner_lock);
1569 next = t->from_parent;
1571 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1572 "send failed reply for transaction %d, target dead\n",
1575 binder_free_transaction(t);
1577 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1578 "reply failed, no target thread at root\n");
1582 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1583 "reply failed, no target thread -- retry %d\n",
1589 * binder_cleanup_transaction() - cleans up undelivered transaction
1590 * @t: transaction that needs to be cleaned up
1591 * @reason: reason the transaction wasn't delivered
1592 * @error_code: error to return to caller (if synchronous call)
1594 static void binder_cleanup_transaction(struct binder_transaction *t,
1596 uint32_t error_code)
1598 if (t->buffer->target_node && !(t->flags & TF_ONE_WAY)) {
1599 binder_send_failed_reply(t, error_code);
1601 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
1602 "undelivered transaction %d, %s\n",
1603 t->debug_id, reason);
1604 binder_free_transaction(t);
1609 * binder_get_object() - gets object and checks for valid metadata
1610 * @proc: binder_proc owning the buffer
1611 * @buffer: binder_buffer that we're parsing.
1612 * @offset: offset in the @buffer at which to validate an object.
1613 * @object: struct binder_object to read into
1615 * Return: If there's a valid metadata object at @offset in @buffer, the
1616 * size of that object. Otherwise, it returns zero. The object
1617 * is read into the struct binder_object pointed to by @object.
1619 static size_t binder_get_object(struct binder_proc *proc,
1620 struct binder_buffer *buffer,
1621 unsigned long offset,
1622 struct binder_object *object)
1625 struct binder_object_header *hdr;
1626 size_t object_size = 0;
1628 read_size = min_t(size_t, sizeof(*object), buffer->data_size - offset);
1629 if (offset > buffer->data_size || read_size < sizeof(*hdr) ||
1630 binder_alloc_copy_from_buffer(&proc->alloc, object, buffer,
1634 /* Ok, now see if we read a complete object. */
1636 switch (hdr->type) {
1637 case BINDER_TYPE_BINDER:
1638 case BINDER_TYPE_WEAK_BINDER:
1639 case BINDER_TYPE_HANDLE:
1640 case BINDER_TYPE_WEAK_HANDLE:
1641 object_size = sizeof(struct flat_binder_object);
1643 case BINDER_TYPE_FD:
1644 object_size = sizeof(struct binder_fd_object);
1646 case BINDER_TYPE_PTR:
1647 object_size = sizeof(struct binder_buffer_object);
1649 case BINDER_TYPE_FDA:
1650 object_size = sizeof(struct binder_fd_array_object);
1655 if (offset <= buffer->data_size - object_size &&
1656 buffer->data_size >= object_size)
1663 * binder_validate_ptr() - validates binder_buffer_object in a binder_buffer.
1664 * @proc: binder_proc owning the buffer
1665 * @b: binder_buffer containing the object
1666 * @object: struct binder_object to read into
1667 * @index: index in offset array at which the binder_buffer_object is
1669 * @start_offset: points to the start of the offset array
1670 * @object_offsetp: offset of @object read from @b
1671 * @num_valid: the number of valid offsets in the offset array
1673 * Return: If @index is within the valid range of the offset array
1674 * described by @start and @num_valid, and if there's a valid
1675 * binder_buffer_object at the offset found in index @index
1676 * of the offset array, that object is returned. Otherwise,
1677 * %NULL is returned.
1678 * Note that the offset found in index @index itself is not
1679 * verified; this function assumes that @num_valid elements
1680 * from @start were previously verified to have valid offsets.
1681 * If @object_offsetp is non-NULL, then the offset within
1682 * @b is written to it.
1684 static struct binder_buffer_object *binder_validate_ptr(
1685 struct binder_proc *proc,
1686 struct binder_buffer *b,
1687 struct binder_object *object,
1688 binder_size_t index,
1689 binder_size_t start_offset,
1690 binder_size_t *object_offsetp,
1691 binder_size_t num_valid)
1694 binder_size_t object_offset;
1695 unsigned long buffer_offset;
1697 if (index >= num_valid)
1700 buffer_offset = start_offset + sizeof(binder_size_t) * index;
1701 if (binder_alloc_copy_from_buffer(&proc->alloc, &object_offset,
1703 sizeof(object_offset)))
1705 object_size = binder_get_object(proc, b, object_offset, object);
1706 if (!object_size || object->hdr.type != BINDER_TYPE_PTR)
1709 *object_offsetp = object_offset;
1711 return &object->bbo;
1715 * binder_validate_fixup() - validates pointer/fd fixups happen in order.
1716 * @proc: binder_proc owning the buffer
1717 * @b: transaction buffer
1718 * @objects_start_offset: offset to start of objects buffer
1719 * @buffer_obj_offset: offset to binder_buffer_object in which to fix up
1720 * @fixup_offset: start offset in @buffer to fix up
1721 * @last_obj_offset: offset to last binder_buffer_object that we fixed
1722 * @last_min_offset: minimum fixup offset in object at @last_obj_offset
1724 * Return: %true if a fixup in buffer @buffer at offset @offset is
1727 * For safety reasons, we only allow fixups inside a buffer to happen
1728 * at increasing offsets; additionally, we only allow fixup on the last
1729 * buffer object that was verified, or one of its parents.
1731 * Example of what is allowed:
1734 * B (parent = A, offset = 0)
1735 * C (parent = A, offset = 16)
1736 * D (parent = C, offset = 0)
1737 * E (parent = A, offset = 32) // min_offset is 16 (C.parent_offset)
1739 * Examples of what is not allowed:
1741 * Decreasing offsets within the same parent:
1743 * C (parent = A, offset = 16)
1744 * B (parent = A, offset = 0) // decreasing offset within A
1746 * Referring to a parent that wasn't the last object or any of its parents:
1748 * B (parent = A, offset = 0)
1749 * C (parent = A, offset = 0)
1750 * C (parent = A, offset = 16)
1751 * D (parent = B, offset = 0) // B is not A or any of A's parents
1753 static bool binder_validate_fixup(struct binder_proc *proc,
1754 struct binder_buffer *b,
1755 binder_size_t objects_start_offset,
1756 binder_size_t buffer_obj_offset,
1757 binder_size_t fixup_offset,
1758 binder_size_t last_obj_offset,
1759 binder_size_t last_min_offset)
1761 if (!last_obj_offset) {
1762 /* Nothing to fix up in */
1766 while (last_obj_offset != buffer_obj_offset) {
1767 unsigned long buffer_offset;
1768 struct binder_object last_object;
1769 struct binder_buffer_object *last_bbo;
1770 size_t object_size = binder_get_object(proc, b, last_obj_offset,
1772 if (object_size != sizeof(*last_bbo))
1775 last_bbo = &last_object.bbo;
1777 * Safe to retrieve the parent of last_obj, since it
1778 * was already previously verified by the driver.
1780 if ((last_bbo->flags & BINDER_BUFFER_FLAG_HAS_PARENT) == 0)
1782 last_min_offset = last_bbo->parent_offset + sizeof(uintptr_t);
1783 buffer_offset = objects_start_offset +
1784 sizeof(binder_size_t) * last_bbo->parent;
1785 if (binder_alloc_copy_from_buffer(&proc->alloc,
1788 sizeof(last_obj_offset)))
1791 return (fixup_offset >= last_min_offset);
1795 * struct binder_task_work_cb - for deferred close
1797 * @twork: callback_head for task work
1800 * Structure to pass task work to be handled after
1801 * returning from binder_ioctl() via task_work_add().
1803 struct binder_task_work_cb {
1804 struct callback_head twork;
1809 * binder_do_fd_close() - close list of file descriptors
1810 * @twork: callback head for task work
1812 * It is not safe to call ksys_close() during the binder_ioctl()
1813 * function if there is a chance that binder's own file descriptor
1814 * might be closed. This is to meet the requirements for using
1815 * fdget() (see comments for __fget_light()). Therefore use
1816 * task_work_add() to schedule the close operation once we have
1817 * returned from binder_ioctl(). This function is a callback
1818 * for that mechanism and does the actual ksys_close() on the
1819 * given file descriptor.
1821 static void binder_do_fd_close(struct callback_head *twork)
1823 struct binder_task_work_cb *twcb = container_of(twork,
1824 struct binder_task_work_cb, twork);
1831 * binder_deferred_fd_close() - schedule a close for the given file-descriptor
1832 * @fd: file-descriptor to close
1834 * See comments in binder_do_fd_close(). This function is used to schedule
1835 * a file-descriptor to be closed after returning from binder_ioctl().
1837 static void binder_deferred_fd_close(int fd)
1839 struct binder_task_work_cb *twcb;
1841 twcb = kzalloc(sizeof(*twcb), GFP_KERNEL);
1844 init_task_work(&twcb->twork, binder_do_fd_close);
1845 close_fd_get_file(fd, &twcb->file);
1847 filp_close(twcb->file, current->files);
1848 task_work_add(current, &twcb->twork, TWA_RESUME);
1854 static void binder_transaction_buffer_release(struct binder_proc *proc,
1855 struct binder_buffer *buffer,
1856 binder_size_t failed_at,
1859 int debug_id = buffer->debug_id;
1860 binder_size_t off_start_offset, buffer_offset, off_end_offset;
1862 binder_debug(BINDER_DEBUG_TRANSACTION,
1863 "%d buffer release %d, size %zd-%zd, failed at %llx\n",
1864 proc->pid, buffer->debug_id,
1865 buffer->data_size, buffer->offsets_size,
1866 (unsigned long long)failed_at);
1868 if (buffer->target_node)
1869 binder_dec_node(buffer->target_node, 1, 0);
1871 off_start_offset = ALIGN(buffer->data_size, sizeof(void *));
1872 off_end_offset = is_failure ? failed_at :
1873 off_start_offset + buffer->offsets_size;
1874 for (buffer_offset = off_start_offset; buffer_offset < off_end_offset;
1875 buffer_offset += sizeof(binder_size_t)) {
1876 struct binder_object_header *hdr;
1877 size_t object_size = 0;
1878 struct binder_object object;
1879 binder_size_t object_offset;
1881 if (!binder_alloc_copy_from_buffer(&proc->alloc, &object_offset,
1882 buffer, buffer_offset,
1883 sizeof(object_offset)))
1884 object_size = binder_get_object(proc, buffer,
1885 object_offset, &object);
1886 if (object_size == 0) {
1887 pr_err("transaction release %d bad object at offset %lld, size %zd\n",
1888 debug_id, (u64)object_offset, buffer->data_size);
1892 switch (hdr->type) {
1893 case BINDER_TYPE_BINDER:
1894 case BINDER_TYPE_WEAK_BINDER: {
1895 struct flat_binder_object *fp;
1896 struct binder_node *node;
1898 fp = to_flat_binder_object(hdr);
1899 node = binder_get_node(proc, fp->binder);
1901 pr_err("transaction release %d bad node %016llx\n",
1902 debug_id, (u64)fp->binder);
1905 binder_debug(BINDER_DEBUG_TRANSACTION,
1906 " node %d u%016llx\n",
1907 node->debug_id, (u64)node->ptr);
1908 binder_dec_node(node, hdr->type == BINDER_TYPE_BINDER,
1910 binder_put_node(node);
1912 case BINDER_TYPE_HANDLE:
1913 case BINDER_TYPE_WEAK_HANDLE: {
1914 struct flat_binder_object *fp;
1915 struct binder_ref_data rdata;
1918 fp = to_flat_binder_object(hdr);
1919 ret = binder_dec_ref_for_handle(proc, fp->handle,
1920 hdr->type == BINDER_TYPE_HANDLE, &rdata);
1923 pr_err("transaction release %d bad handle %d, ret = %d\n",
1924 debug_id, fp->handle, ret);
1927 binder_debug(BINDER_DEBUG_TRANSACTION,
1928 " ref %d desc %d\n",
1929 rdata.debug_id, rdata.desc);
1932 case BINDER_TYPE_FD: {
1934 * No need to close the file here since user-space
1935 * closes it for for successfully delivered
1936 * transactions. For transactions that weren't
1937 * delivered, the new fd was never allocated so
1938 * there is no need to close and the fput on the
1939 * file is done when the transaction is torn
1943 case BINDER_TYPE_PTR:
1945 * Nothing to do here, this will get cleaned up when the
1946 * transaction buffer gets freed
1949 case BINDER_TYPE_FDA: {
1950 struct binder_fd_array_object *fda;
1951 struct binder_buffer_object *parent;
1952 struct binder_object ptr_object;
1953 binder_size_t fda_offset;
1955 binder_size_t fd_buf_size;
1956 binder_size_t num_valid;
1958 if (proc->tsk != current->group_leader) {
1960 * Nothing to do if running in sender context
1961 * The fd fixups have not been applied so no
1962 * fds need to be closed.
1967 num_valid = (buffer_offset - off_start_offset) /
1968 sizeof(binder_size_t);
1969 fda = to_binder_fd_array_object(hdr);
1970 parent = binder_validate_ptr(proc, buffer, &ptr_object,
1976 pr_err("transaction release %d bad parent offset\n",
1980 fd_buf_size = sizeof(u32) * fda->num_fds;
1981 if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
1982 pr_err("transaction release %d invalid number of fds (%lld)\n",
1983 debug_id, (u64)fda->num_fds);
1986 if (fd_buf_size > parent->length ||
1987 fda->parent_offset > parent->length - fd_buf_size) {
1988 /* No space for all file descriptors here. */
1989 pr_err("transaction release %d not enough space for %lld fds in buffer\n",
1990 debug_id, (u64)fda->num_fds);
1994 * the source data for binder_buffer_object is visible
1995 * to user-space and the @buffer element is the user
1996 * pointer to the buffer_object containing the fd_array.
1997 * Convert the address to an offset relative to
1998 * the base of the transaction buffer.
2001 (parent->buffer - (uintptr_t)buffer->user_data) +
2003 for (fd_index = 0; fd_index < fda->num_fds;
2007 binder_size_t offset = fda_offset +
2008 fd_index * sizeof(fd);
2010 err = binder_alloc_copy_from_buffer(
2011 &proc->alloc, &fd, buffer,
2012 offset, sizeof(fd));
2015 binder_deferred_fd_close(fd);
2019 pr_err("transaction release %d bad object type %x\n",
2020 debug_id, hdr->type);
2026 static int binder_translate_binder(struct flat_binder_object *fp,
2027 struct binder_transaction *t,
2028 struct binder_thread *thread)
2030 struct binder_node *node;
2031 struct binder_proc *proc = thread->proc;
2032 struct binder_proc *target_proc = t->to_proc;
2033 struct binder_ref_data rdata;
2036 node = binder_get_node(proc, fp->binder);
2038 node = binder_new_node(proc, fp);
2042 if (fp->cookie != node->cookie) {
2043 binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
2044 proc->pid, thread->pid, (u64)fp->binder,
2045 node->debug_id, (u64)fp->cookie,
2050 if (security_binder_transfer_binder(proc->tsk, target_proc->tsk)) {
2055 ret = binder_inc_ref_for_node(target_proc, node,
2056 fp->hdr.type == BINDER_TYPE_BINDER,
2057 &thread->todo, &rdata);
2061 if (fp->hdr.type == BINDER_TYPE_BINDER)
2062 fp->hdr.type = BINDER_TYPE_HANDLE;
2064 fp->hdr.type = BINDER_TYPE_WEAK_HANDLE;
2066 fp->handle = rdata.desc;
2069 trace_binder_transaction_node_to_ref(t, node, &rdata);
2070 binder_debug(BINDER_DEBUG_TRANSACTION,
2071 " node %d u%016llx -> ref %d desc %d\n",
2072 node->debug_id, (u64)node->ptr,
2073 rdata.debug_id, rdata.desc);
2075 binder_put_node(node);
2079 static int binder_translate_handle(struct flat_binder_object *fp,
2080 struct binder_transaction *t,
2081 struct binder_thread *thread)
2083 struct binder_proc *proc = thread->proc;
2084 struct binder_proc *target_proc = t->to_proc;
2085 struct binder_node *node;
2086 struct binder_ref_data src_rdata;
2089 node = binder_get_node_from_ref(proc, fp->handle,
2090 fp->hdr.type == BINDER_TYPE_HANDLE, &src_rdata);
2092 binder_user_error("%d:%d got transaction with invalid handle, %d\n",
2093 proc->pid, thread->pid, fp->handle);
2096 if (security_binder_transfer_binder(proc->tsk, target_proc->tsk)) {
2101 binder_node_lock(node);
2102 if (node->proc == target_proc) {
2103 if (fp->hdr.type == BINDER_TYPE_HANDLE)
2104 fp->hdr.type = BINDER_TYPE_BINDER;
2106 fp->hdr.type = BINDER_TYPE_WEAK_BINDER;
2107 fp->binder = node->ptr;
2108 fp->cookie = node->cookie;
2110 binder_inner_proc_lock(node->proc);
2112 __acquire(&node->proc->inner_lock);
2113 binder_inc_node_nilocked(node,
2114 fp->hdr.type == BINDER_TYPE_BINDER,
2117 binder_inner_proc_unlock(node->proc);
2119 __release(&node->proc->inner_lock);
2120 trace_binder_transaction_ref_to_node(t, node, &src_rdata);
2121 binder_debug(BINDER_DEBUG_TRANSACTION,
2122 " ref %d desc %d -> node %d u%016llx\n",
2123 src_rdata.debug_id, src_rdata.desc, node->debug_id,
2125 binder_node_unlock(node);
2127 struct binder_ref_data dest_rdata;
2129 binder_node_unlock(node);
2130 ret = binder_inc_ref_for_node(target_proc, node,
2131 fp->hdr.type == BINDER_TYPE_HANDLE,
2137 fp->handle = dest_rdata.desc;
2139 trace_binder_transaction_ref_to_ref(t, node, &src_rdata,
2141 binder_debug(BINDER_DEBUG_TRANSACTION,
2142 " ref %d desc %d -> ref %d desc %d (node %d)\n",
2143 src_rdata.debug_id, src_rdata.desc,
2144 dest_rdata.debug_id, dest_rdata.desc,
2148 binder_put_node(node);
2152 static int binder_translate_fd(u32 fd, binder_size_t fd_offset,
2153 struct binder_transaction *t,
2154 struct binder_thread *thread,
2155 struct binder_transaction *in_reply_to)
2157 struct binder_proc *proc = thread->proc;
2158 struct binder_proc *target_proc = t->to_proc;
2159 struct binder_txn_fd_fixup *fixup;
2162 bool target_allows_fd;
2165 target_allows_fd = !!(in_reply_to->flags & TF_ACCEPT_FDS);
2167 target_allows_fd = t->buffer->target_node->accept_fds;
2168 if (!target_allows_fd) {
2169 binder_user_error("%d:%d got %s with fd, %d, but target does not allow fds\n",
2170 proc->pid, thread->pid,
2171 in_reply_to ? "reply" : "transaction",
2174 goto err_fd_not_accepted;
2179 binder_user_error("%d:%d got transaction with invalid fd, %d\n",
2180 proc->pid, thread->pid, fd);
2184 ret = security_binder_transfer_file(proc->tsk, target_proc->tsk, file);
2191 * Add fixup record for this transaction. The allocation
2192 * of the fd in the target needs to be done from a
2195 fixup = kzalloc(sizeof(*fixup), GFP_KERNEL);
2201 fixup->offset = fd_offset;
2202 trace_binder_transaction_fd_send(t, fd, fixup->offset);
2203 list_add_tail(&fixup->fixup_entry, &t->fd_fixups);
2211 err_fd_not_accepted:
2215 static int binder_translate_fd_array(struct binder_fd_array_object *fda,
2216 struct binder_buffer_object *parent,
2217 struct binder_transaction *t,
2218 struct binder_thread *thread,
2219 struct binder_transaction *in_reply_to)
2221 binder_size_t fdi, fd_buf_size;
2222 binder_size_t fda_offset;
2223 struct binder_proc *proc = thread->proc;
2224 struct binder_proc *target_proc = t->to_proc;
2226 fd_buf_size = sizeof(u32) * fda->num_fds;
2227 if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
2228 binder_user_error("%d:%d got transaction with invalid number of fds (%lld)\n",
2229 proc->pid, thread->pid, (u64)fda->num_fds);
2232 if (fd_buf_size > parent->length ||
2233 fda->parent_offset > parent->length - fd_buf_size) {
2234 /* No space for all file descriptors here. */
2235 binder_user_error("%d:%d not enough space to store %lld fds in buffer\n",
2236 proc->pid, thread->pid, (u64)fda->num_fds);
2240 * the source data for binder_buffer_object is visible
2241 * to user-space and the @buffer element is the user
2242 * pointer to the buffer_object containing the fd_array.
2243 * Convert the address to an offset relative to
2244 * the base of the transaction buffer.
2246 fda_offset = (parent->buffer - (uintptr_t)t->buffer->user_data) +
2248 if (!IS_ALIGNED((unsigned long)fda_offset, sizeof(u32))) {
2249 binder_user_error("%d:%d parent offset not aligned correctly.\n",
2250 proc->pid, thread->pid);
2253 for (fdi = 0; fdi < fda->num_fds; fdi++) {
2256 binder_size_t offset = fda_offset + fdi * sizeof(fd);
2258 ret = binder_alloc_copy_from_buffer(&target_proc->alloc,
2260 offset, sizeof(fd));
2262 ret = binder_translate_fd(fd, offset, t, thread,
2270 static int binder_fixup_parent(struct binder_transaction *t,
2271 struct binder_thread *thread,
2272 struct binder_buffer_object *bp,
2273 binder_size_t off_start_offset,
2274 binder_size_t num_valid,
2275 binder_size_t last_fixup_obj_off,
2276 binder_size_t last_fixup_min_off)
2278 struct binder_buffer_object *parent;
2279 struct binder_buffer *b = t->buffer;
2280 struct binder_proc *proc = thread->proc;
2281 struct binder_proc *target_proc = t->to_proc;
2282 struct binder_object object;
2283 binder_size_t buffer_offset;
2284 binder_size_t parent_offset;
2286 if (!(bp->flags & BINDER_BUFFER_FLAG_HAS_PARENT))
2289 parent = binder_validate_ptr(target_proc, b, &object, bp->parent,
2290 off_start_offset, &parent_offset,
2293 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2294 proc->pid, thread->pid);
2298 if (!binder_validate_fixup(target_proc, b, off_start_offset,
2299 parent_offset, bp->parent_offset,
2301 last_fixup_min_off)) {
2302 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
2303 proc->pid, thread->pid);
2307 if (parent->length < sizeof(binder_uintptr_t) ||
2308 bp->parent_offset > parent->length - sizeof(binder_uintptr_t)) {
2309 /* No space for a pointer here! */
2310 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2311 proc->pid, thread->pid);
2314 buffer_offset = bp->parent_offset +
2315 (uintptr_t)parent->buffer - (uintptr_t)b->user_data;
2316 if (binder_alloc_copy_to_buffer(&target_proc->alloc, b, buffer_offset,
2317 &bp->buffer, sizeof(bp->buffer))) {
2318 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2319 proc->pid, thread->pid);
2327 * binder_proc_transaction() - sends a transaction to a process and wakes it up
2328 * @t: transaction to send
2329 * @proc: process to send the transaction to
2330 * @thread: thread in @proc to send the transaction to (may be NULL)
2332 * This function queues a transaction to the specified process. It will try
2333 * to find a thread in the target process to handle the transaction and
2334 * wake it up. If no thread is found, the work is queued to the proc
2337 * If the @thread parameter is not NULL, the transaction is always queued
2338 * to the waitlist of that specific thread.
2340 * Return: 0 if the transaction was successfully queued
2341 * BR_DEAD_REPLY if the target process or thread is dead
2342 * BR_FROZEN_REPLY if the target process or thread is frozen
2344 static int binder_proc_transaction(struct binder_transaction *t,
2345 struct binder_proc *proc,
2346 struct binder_thread *thread)
2348 struct binder_node *node = t->buffer->target_node;
2349 bool oneway = !!(t->flags & TF_ONE_WAY);
2350 bool pending_async = false;
2353 binder_node_lock(node);
2356 if (node->has_async_transaction)
2357 pending_async = true;
2359 node->has_async_transaction = true;
2362 binder_inner_proc_lock(proc);
2363 if (proc->is_frozen) {
2364 proc->sync_recv |= !oneway;
2365 proc->async_recv |= oneway;
2368 if ((proc->is_frozen && !oneway) || proc->is_dead ||
2369 (thread && thread->is_dead)) {
2370 binder_inner_proc_unlock(proc);
2371 binder_node_unlock(node);
2372 return proc->is_frozen ? BR_FROZEN_REPLY : BR_DEAD_REPLY;
2375 if (!thread && !pending_async)
2376 thread = binder_select_thread_ilocked(proc);
2379 binder_enqueue_thread_work_ilocked(thread, &t->work);
2380 else if (!pending_async)
2381 binder_enqueue_work_ilocked(&t->work, &proc->todo);
2383 binder_enqueue_work_ilocked(&t->work, &node->async_todo);
2386 binder_wakeup_thread_ilocked(proc, thread, !oneway /* sync */);
2388 proc->outstanding_txns++;
2389 binder_inner_proc_unlock(proc);
2390 binder_node_unlock(node);
2396 * binder_get_node_refs_for_txn() - Get required refs on node for txn
2397 * @node: struct binder_node for which to get refs
2398 * @proc: returns @node->proc if valid
2399 * @error: if no @proc then returns BR_DEAD_REPLY
2401 * User-space normally keeps the node alive when creating a transaction
2402 * since it has a reference to the target. The local strong ref keeps it
2403 * alive if the sending process dies before the target process processes
2404 * the transaction. If the source process is malicious or has a reference
2405 * counting bug, relying on the local strong ref can fail.
2407 * Since user-space can cause the local strong ref to go away, we also take
2408 * a tmpref on the node to ensure it survives while we are constructing
2409 * the transaction. We also need a tmpref on the proc while we are
2410 * constructing the transaction, so we take that here as well.
2412 * Return: The target_node with refs taken or NULL if no @node->proc is NULL.
2413 * Also sets @proc if valid. If the @node->proc is NULL indicating that the
2414 * target proc has died, @error is set to BR_DEAD_REPLY
2416 static struct binder_node *binder_get_node_refs_for_txn(
2417 struct binder_node *node,
2418 struct binder_proc **procp,
2421 struct binder_node *target_node = NULL;
2423 binder_node_inner_lock(node);
2426 binder_inc_node_nilocked(node, 1, 0, NULL);
2427 binder_inc_node_tmpref_ilocked(node);
2428 node->proc->tmp_ref++;
2429 *procp = node->proc;
2431 *error = BR_DEAD_REPLY;
2432 binder_node_inner_unlock(node);
2437 static void binder_transaction(struct binder_proc *proc,
2438 struct binder_thread *thread,
2439 struct binder_transaction_data *tr, int reply,
2440 binder_size_t extra_buffers_size)
2443 struct binder_transaction *t;
2444 struct binder_work *w;
2445 struct binder_work *tcomplete;
2446 binder_size_t buffer_offset = 0;
2447 binder_size_t off_start_offset, off_end_offset;
2448 binder_size_t off_min;
2449 binder_size_t sg_buf_offset, sg_buf_end_offset;
2450 struct binder_proc *target_proc = NULL;
2451 struct binder_thread *target_thread = NULL;
2452 struct binder_node *target_node = NULL;
2453 struct binder_transaction *in_reply_to = NULL;
2454 struct binder_transaction_log_entry *e;
2455 uint32_t return_error = 0;
2456 uint32_t return_error_param = 0;
2457 uint32_t return_error_line = 0;
2458 binder_size_t last_fixup_obj_off = 0;
2459 binder_size_t last_fixup_min_off = 0;
2460 struct binder_context *context = proc->context;
2461 int t_debug_id = atomic_inc_return(&binder_last_id);
2462 char *secctx = NULL;
2465 e = binder_transaction_log_add(&binder_transaction_log);
2466 e->debug_id = t_debug_id;
2467 e->call_type = reply ? 2 : !!(tr->flags & TF_ONE_WAY);
2468 e->from_proc = proc->pid;
2469 e->from_thread = thread->pid;
2470 e->target_handle = tr->target.handle;
2471 e->data_size = tr->data_size;
2472 e->offsets_size = tr->offsets_size;
2473 strscpy(e->context_name, proc->context->name, BINDERFS_MAX_NAME);
2476 binder_inner_proc_lock(proc);
2477 in_reply_to = thread->transaction_stack;
2478 if (in_reply_to == NULL) {
2479 binder_inner_proc_unlock(proc);
2480 binder_user_error("%d:%d got reply transaction with no transaction stack\n",
2481 proc->pid, thread->pid);
2482 return_error = BR_FAILED_REPLY;
2483 return_error_param = -EPROTO;
2484 return_error_line = __LINE__;
2485 goto err_empty_call_stack;
2487 if (in_reply_to->to_thread != thread) {
2488 spin_lock(&in_reply_to->lock);
2489 binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
2490 proc->pid, thread->pid, in_reply_to->debug_id,
2491 in_reply_to->to_proc ?
2492 in_reply_to->to_proc->pid : 0,
2493 in_reply_to->to_thread ?
2494 in_reply_to->to_thread->pid : 0);
2495 spin_unlock(&in_reply_to->lock);
2496 binder_inner_proc_unlock(proc);
2497 return_error = BR_FAILED_REPLY;
2498 return_error_param = -EPROTO;
2499 return_error_line = __LINE__;
2501 goto err_bad_call_stack;
2503 thread->transaction_stack = in_reply_to->to_parent;
2504 binder_inner_proc_unlock(proc);
2505 binder_set_nice(in_reply_to->saved_priority);
2506 target_thread = binder_get_txn_from_and_acq_inner(in_reply_to);
2507 if (target_thread == NULL) {
2508 /* annotation for sparse */
2509 __release(&target_thread->proc->inner_lock);
2510 return_error = BR_DEAD_REPLY;
2511 return_error_line = __LINE__;
2512 goto err_dead_binder;
2514 if (target_thread->transaction_stack != in_reply_to) {
2515 binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
2516 proc->pid, thread->pid,
2517 target_thread->transaction_stack ?
2518 target_thread->transaction_stack->debug_id : 0,
2519 in_reply_to->debug_id);
2520 binder_inner_proc_unlock(target_thread->proc);
2521 return_error = BR_FAILED_REPLY;
2522 return_error_param = -EPROTO;
2523 return_error_line = __LINE__;
2525 target_thread = NULL;
2526 goto err_dead_binder;
2528 target_proc = target_thread->proc;
2529 target_proc->tmp_ref++;
2530 binder_inner_proc_unlock(target_thread->proc);
2532 if (tr->target.handle) {
2533 struct binder_ref *ref;
2536 * There must already be a strong ref
2537 * on this node. If so, do a strong
2538 * increment on the node to ensure it
2539 * stays alive until the transaction is
2542 binder_proc_lock(proc);
2543 ref = binder_get_ref_olocked(proc, tr->target.handle,
2546 target_node = binder_get_node_refs_for_txn(
2547 ref->node, &target_proc,
2550 binder_user_error("%d:%d got transaction to invalid handle\n",
2551 proc->pid, thread->pid);
2552 return_error = BR_FAILED_REPLY;
2554 binder_proc_unlock(proc);
2556 mutex_lock(&context->context_mgr_node_lock);
2557 target_node = context->binder_context_mgr_node;
2559 target_node = binder_get_node_refs_for_txn(
2560 target_node, &target_proc,
2563 return_error = BR_DEAD_REPLY;
2564 mutex_unlock(&context->context_mgr_node_lock);
2565 if (target_node && target_proc->pid == proc->pid) {
2566 binder_user_error("%d:%d got transaction to context manager from process owning it\n",
2567 proc->pid, thread->pid);
2568 return_error = BR_FAILED_REPLY;
2569 return_error_param = -EINVAL;
2570 return_error_line = __LINE__;
2571 goto err_invalid_target_handle;
2576 * return_error is set above
2578 return_error_param = -EINVAL;
2579 return_error_line = __LINE__;
2580 goto err_dead_binder;
2582 e->to_node = target_node->debug_id;
2583 if (WARN_ON(proc == target_proc)) {
2584 return_error = BR_FAILED_REPLY;
2585 return_error_param = -EINVAL;
2586 return_error_line = __LINE__;
2587 goto err_invalid_target_handle;
2589 if (security_binder_transaction(proc->tsk,
2590 target_proc->tsk) < 0) {
2591 return_error = BR_FAILED_REPLY;
2592 return_error_param = -EPERM;
2593 return_error_line = __LINE__;
2594 goto err_invalid_target_handle;
2596 binder_inner_proc_lock(proc);
2598 w = list_first_entry_or_null(&thread->todo,
2599 struct binder_work, entry);
2600 if (!(tr->flags & TF_ONE_WAY) && w &&
2601 w->type == BINDER_WORK_TRANSACTION) {
2603 * Do not allow new outgoing transaction from a
2604 * thread that has a transaction at the head of
2605 * its todo list. Only need to check the head
2606 * because binder_select_thread_ilocked picks a
2607 * thread from proc->waiting_threads to enqueue
2608 * the transaction, and nothing is queued to the
2609 * todo list while the thread is on waiting_threads.
2611 binder_user_error("%d:%d new transaction not allowed when there is a transaction on thread todo\n",
2612 proc->pid, thread->pid);
2613 binder_inner_proc_unlock(proc);
2614 return_error = BR_FAILED_REPLY;
2615 return_error_param = -EPROTO;
2616 return_error_line = __LINE__;
2617 goto err_bad_todo_list;
2620 if (!(tr->flags & TF_ONE_WAY) && thread->transaction_stack) {
2621 struct binder_transaction *tmp;
2623 tmp = thread->transaction_stack;
2624 if (tmp->to_thread != thread) {
2625 spin_lock(&tmp->lock);
2626 binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
2627 proc->pid, thread->pid, tmp->debug_id,
2628 tmp->to_proc ? tmp->to_proc->pid : 0,
2630 tmp->to_thread->pid : 0);
2631 spin_unlock(&tmp->lock);
2632 binder_inner_proc_unlock(proc);
2633 return_error = BR_FAILED_REPLY;
2634 return_error_param = -EPROTO;
2635 return_error_line = __LINE__;
2636 goto err_bad_call_stack;
2639 struct binder_thread *from;
2641 spin_lock(&tmp->lock);
2643 if (from && from->proc == target_proc) {
2644 atomic_inc(&from->tmp_ref);
2645 target_thread = from;
2646 spin_unlock(&tmp->lock);
2649 spin_unlock(&tmp->lock);
2650 tmp = tmp->from_parent;
2653 binder_inner_proc_unlock(proc);
2656 e->to_thread = target_thread->pid;
2657 e->to_proc = target_proc->pid;
2659 /* TODO: reuse incoming transaction for reply */
2660 t = kzalloc(sizeof(*t), GFP_KERNEL);
2662 return_error = BR_FAILED_REPLY;
2663 return_error_param = -ENOMEM;
2664 return_error_line = __LINE__;
2665 goto err_alloc_t_failed;
2667 INIT_LIST_HEAD(&t->fd_fixups);
2668 binder_stats_created(BINDER_STAT_TRANSACTION);
2669 spin_lock_init(&t->lock);
2671 tcomplete = kzalloc(sizeof(*tcomplete), GFP_KERNEL);
2672 if (tcomplete == NULL) {
2673 return_error = BR_FAILED_REPLY;
2674 return_error_param = -ENOMEM;
2675 return_error_line = __LINE__;
2676 goto err_alloc_tcomplete_failed;
2678 binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE);
2680 t->debug_id = t_debug_id;
2683 binder_debug(BINDER_DEBUG_TRANSACTION,
2684 "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld-%lld\n",
2685 proc->pid, thread->pid, t->debug_id,
2686 target_proc->pid, target_thread->pid,
2687 (u64)tr->data.ptr.buffer,
2688 (u64)tr->data.ptr.offsets,
2689 (u64)tr->data_size, (u64)tr->offsets_size,
2690 (u64)extra_buffers_size);
2692 binder_debug(BINDER_DEBUG_TRANSACTION,
2693 "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld-%lld\n",
2694 proc->pid, thread->pid, t->debug_id,
2695 target_proc->pid, target_node->debug_id,
2696 (u64)tr->data.ptr.buffer,
2697 (u64)tr->data.ptr.offsets,
2698 (u64)tr->data_size, (u64)tr->offsets_size,
2699 (u64)extra_buffers_size);
2701 if (!reply && !(tr->flags & TF_ONE_WAY))
2705 t->sender_euid = task_euid(proc->tsk);
2706 t->to_proc = target_proc;
2707 t->to_thread = target_thread;
2709 t->flags = tr->flags;
2710 t->priority = task_nice(current);
2712 if (target_node && target_node->txn_security_ctx) {
2716 security_task_getsecid(proc->tsk, &secid);
2717 ret = security_secid_to_secctx(secid, &secctx, &secctx_sz);
2719 return_error = BR_FAILED_REPLY;
2720 return_error_param = ret;
2721 return_error_line = __LINE__;
2722 goto err_get_secctx_failed;
2724 added_size = ALIGN(secctx_sz, sizeof(u64));
2725 extra_buffers_size += added_size;
2726 if (extra_buffers_size < added_size) {
2727 /* integer overflow of extra_buffers_size */
2728 return_error = BR_FAILED_REPLY;
2729 return_error_param = -EINVAL;
2730 return_error_line = __LINE__;
2731 goto err_bad_extra_size;
2735 trace_binder_transaction(reply, t, target_node);
2737 t->buffer = binder_alloc_new_buf(&target_proc->alloc, tr->data_size,
2738 tr->offsets_size, extra_buffers_size,
2739 !reply && (t->flags & TF_ONE_WAY), current->tgid);
2740 if (IS_ERR(t->buffer)) {
2742 * -ESRCH indicates VMA cleared. The target is dying.
2744 return_error_param = PTR_ERR(t->buffer);
2745 return_error = return_error_param == -ESRCH ?
2746 BR_DEAD_REPLY : BR_FAILED_REPLY;
2747 return_error_line = __LINE__;
2749 goto err_binder_alloc_buf_failed;
2753 size_t buf_offset = ALIGN(tr->data_size, sizeof(void *)) +
2754 ALIGN(tr->offsets_size, sizeof(void *)) +
2755 ALIGN(extra_buffers_size, sizeof(void *)) -
2756 ALIGN(secctx_sz, sizeof(u64));
2758 t->security_ctx = (uintptr_t)t->buffer->user_data + buf_offset;
2759 err = binder_alloc_copy_to_buffer(&target_proc->alloc,
2760 t->buffer, buf_offset,
2763 t->security_ctx = 0;
2766 security_release_secctx(secctx, secctx_sz);
2769 t->buffer->debug_id = t->debug_id;
2770 t->buffer->transaction = t;
2771 t->buffer->target_node = target_node;
2772 t->buffer->clear_on_free = !!(t->flags & TF_CLEAR_BUF);
2773 trace_binder_transaction_alloc_buf(t->buffer);
2775 if (binder_alloc_copy_user_to_buffer(
2776 &target_proc->alloc,
2778 (const void __user *)
2779 (uintptr_t)tr->data.ptr.buffer,
2781 binder_user_error("%d:%d got transaction with invalid data ptr\n",
2782 proc->pid, thread->pid);
2783 return_error = BR_FAILED_REPLY;
2784 return_error_param = -EFAULT;
2785 return_error_line = __LINE__;
2786 goto err_copy_data_failed;
2788 if (binder_alloc_copy_user_to_buffer(
2789 &target_proc->alloc,
2791 ALIGN(tr->data_size, sizeof(void *)),
2792 (const void __user *)
2793 (uintptr_t)tr->data.ptr.offsets,
2794 tr->offsets_size)) {
2795 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
2796 proc->pid, thread->pid);
2797 return_error = BR_FAILED_REPLY;
2798 return_error_param = -EFAULT;
2799 return_error_line = __LINE__;
2800 goto err_copy_data_failed;
2802 if (!IS_ALIGNED(tr->offsets_size, sizeof(binder_size_t))) {
2803 binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
2804 proc->pid, thread->pid, (u64)tr->offsets_size);
2805 return_error = BR_FAILED_REPLY;
2806 return_error_param = -EINVAL;
2807 return_error_line = __LINE__;
2808 goto err_bad_offset;
2810 if (!IS_ALIGNED(extra_buffers_size, sizeof(u64))) {
2811 binder_user_error("%d:%d got transaction with unaligned buffers size, %lld\n",
2812 proc->pid, thread->pid,
2813 (u64)extra_buffers_size);
2814 return_error = BR_FAILED_REPLY;
2815 return_error_param = -EINVAL;
2816 return_error_line = __LINE__;
2817 goto err_bad_offset;
2819 off_start_offset = ALIGN(tr->data_size, sizeof(void *));
2820 buffer_offset = off_start_offset;
2821 off_end_offset = off_start_offset + tr->offsets_size;
2822 sg_buf_offset = ALIGN(off_end_offset, sizeof(void *));
2823 sg_buf_end_offset = sg_buf_offset + extra_buffers_size -
2824 ALIGN(secctx_sz, sizeof(u64));
2826 for (buffer_offset = off_start_offset; buffer_offset < off_end_offset;
2827 buffer_offset += sizeof(binder_size_t)) {
2828 struct binder_object_header *hdr;
2830 struct binder_object object;
2831 binder_size_t object_offset;
2833 if (binder_alloc_copy_from_buffer(&target_proc->alloc,
2837 sizeof(object_offset))) {
2838 return_error = BR_FAILED_REPLY;
2839 return_error_param = -EINVAL;
2840 return_error_line = __LINE__;
2841 goto err_bad_offset;
2843 object_size = binder_get_object(target_proc, t->buffer,
2844 object_offset, &object);
2845 if (object_size == 0 || object_offset < off_min) {
2846 binder_user_error("%d:%d got transaction with invalid offset (%lld, min %lld max %lld) or object.\n",
2847 proc->pid, thread->pid,
2850 (u64)t->buffer->data_size);
2851 return_error = BR_FAILED_REPLY;
2852 return_error_param = -EINVAL;
2853 return_error_line = __LINE__;
2854 goto err_bad_offset;
2858 off_min = object_offset + object_size;
2859 switch (hdr->type) {
2860 case BINDER_TYPE_BINDER:
2861 case BINDER_TYPE_WEAK_BINDER: {
2862 struct flat_binder_object *fp;
2864 fp = to_flat_binder_object(hdr);
2865 ret = binder_translate_binder(fp, t, thread);
2868 binder_alloc_copy_to_buffer(&target_proc->alloc,
2872 return_error = BR_FAILED_REPLY;
2873 return_error_param = ret;
2874 return_error_line = __LINE__;
2875 goto err_translate_failed;
2878 case BINDER_TYPE_HANDLE:
2879 case BINDER_TYPE_WEAK_HANDLE: {
2880 struct flat_binder_object *fp;
2882 fp = to_flat_binder_object(hdr);
2883 ret = binder_translate_handle(fp, t, thread);
2885 binder_alloc_copy_to_buffer(&target_proc->alloc,
2889 return_error = BR_FAILED_REPLY;
2890 return_error_param = ret;
2891 return_error_line = __LINE__;
2892 goto err_translate_failed;
2896 case BINDER_TYPE_FD: {
2897 struct binder_fd_object *fp = to_binder_fd_object(hdr);
2898 binder_size_t fd_offset = object_offset +
2899 (uintptr_t)&fp->fd - (uintptr_t)fp;
2900 int ret = binder_translate_fd(fp->fd, fd_offset, t,
2901 thread, in_reply_to);
2905 binder_alloc_copy_to_buffer(&target_proc->alloc,
2909 return_error = BR_FAILED_REPLY;
2910 return_error_param = ret;
2911 return_error_line = __LINE__;
2912 goto err_translate_failed;
2915 case BINDER_TYPE_FDA: {
2916 struct binder_object ptr_object;
2917 binder_size_t parent_offset;
2918 struct binder_fd_array_object *fda =
2919 to_binder_fd_array_object(hdr);
2920 size_t num_valid = (buffer_offset - off_start_offset) /
2921 sizeof(binder_size_t);
2922 struct binder_buffer_object *parent =
2923 binder_validate_ptr(target_proc, t->buffer,
2924 &ptr_object, fda->parent,
2929 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2930 proc->pid, thread->pid);
2931 return_error = BR_FAILED_REPLY;
2932 return_error_param = -EINVAL;
2933 return_error_line = __LINE__;
2934 goto err_bad_parent;
2936 if (!binder_validate_fixup(target_proc, t->buffer,
2941 last_fixup_min_off)) {
2942 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
2943 proc->pid, thread->pid);
2944 return_error = BR_FAILED_REPLY;
2945 return_error_param = -EINVAL;
2946 return_error_line = __LINE__;
2947 goto err_bad_parent;
2949 ret = binder_translate_fd_array(fda, parent, t, thread,
2952 return_error = BR_FAILED_REPLY;
2953 return_error_param = ret;
2954 return_error_line = __LINE__;
2955 goto err_translate_failed;
2957 last_fixup_obj_off = parent_offset;
2958 last_fixup_min_off =
2959 fda->parent_offset + sizeof(u32) * fda->num_fds;
2961 case BINDER_TYPE_PTR: {
2962 struct binder_buffer_object *bp =
2963 to_binder_buffer_object(hdr);
2964 size_t buf_left = sg_buf_end_offset - sg_buf_offset;
2967 if (bp->length > buf_left) {
2968 binder_user_error("%d:%d got transaction with too large buffer\n",
2969 proc->pid, thread->pid);
2970 return_error = BR_FAILED_REPLY;
2971 return_error_param = -EINVAL;
2972 return_error_line = __LINE__;
2973 goto err_bad_offset;
2975 if (binder_alloc_copy_user_to_buffer(
2976 &target_proc->alloc,
2979 (const void __user *)
2980 (uintptr_t)bp->buffer,
2982 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
2983 proc->pid, thread->pid);
2984 return_error_param = -EFAULT;
2985 return_error = BR_FAILED_REPLY;
2986 return_error_line = __LINE__;
2987 goto err_copy_data_failed;
2989 /* Fixup buffer pointer to target proc address space */
2990 bp->buffer = (uintptr_t)
2991 t->buffer->user_data + sg_buf_offset;
2992 sg_buf_offset += ALIGN(bp->length, sizeof(u64));
2994 num_valid = (buffer_offset - off_start_offset) /
2995 sizeof(binder_size_t);
2996 ret = binder_fixup_parent(t, thread, bp,
3000 last_fixup_min_off);
3002 binder_alloc_copy_to_buffer(&target_proc->alloc,
3006 return_error = BR_FAILED_REPLY;
3007 return_error_param = ret;
3008 return_error_line = __LINE__;
3009 goto err_translate_failed;
3011 last_fixup_obj_off = object_offset;
3012 last_fixup_min_off = 0;
3015 binder_user_error("%d:%d got transaction with invalid object type, %x\n",
3016 proc->pid, thread->pid, hdr->type);
3017 return_error = BR_FAILED_REPLY;
3018 return_error_param = -EINVAL;
3019 return_error_line = __LINE__;
3020 goto err_bad_object_type;
3023 if (t->buffer->oneway_spam_suspect)
3024 tcomplete->type = BINDER_WORK_TRANSACTION_ONEWAY_SPAM_SUSPECT;
3026 tcomplete->type = BINDER_WORK_TRANSACTION_COMPLETE;
3027 t->work.type = BINDER_WORK_TRANSACTION;
3030 binder_enqueue_thread_work(thread, tcomplete);
3031 binder_inner_proc_lock(target_proc);
3032 if (target_thread->is_dead || target_proc->is_frozen) {
3033 return_error = target_thread->is_dead ?
3034 BR_DEAD_REPLY : BR_FROZEN_REPLY;
3035 binder_inner_proc_unlock(target_proc);
3036 goto err_dead_proc_or_thread;
3038 BUG_ON(t->buffer->async_transaction != 0);
3039 binder_pop_transaction_ilocked(target_thread, in_reply_to);
3040 binder_enqueue_thread_work_ilocked(target_thread, &t->work);
3041 target_proc->outstanding_txns++;
3042 binder_inner_proc_unlock(target_proc);
3043 wake_up_interruptible_sync(&target_thread->wait);
3044 binder_free_transaction(in_reply_to);
3045 } else if (!(t->flags & TF_ONE_WAY)) {
3046 BUG_ON(t->buffer->async_transaction != 0);
3047 binder_inner_proc_lock(proc);
3049 * Defer the TRANSACTION_COMPLETE, so we don't return to
3050 * userspace immediately; this allows the target process to
3051 * immediately start processing this transaction, reducing
3052 * latency. We will then return the TRANSACTION_COMPLETE when
3053 * the target replies (or there is an error).
3055 binder_enqueue_deferred_thread_work_ilocked(thread, tcomplete);
3057 t->from_parent = thread->transaction_stack;
3058 thread->transaction_stack = t;
3059 binder_inner_proc_unlock(proc);
3060 return_error = binder_proc_transaction(t,
3061 target_proc, target_thread);
3063 binder_inner_proc_lock(proc);
3064 binder_pop_transaction_ilocked(thread, t);
3065 binder_inner_proc_unlock(proc);
3066 goto err_dead_proc_or_thread;
3069 BUG_ON(target_node == NULL);
3070 BUG_ON(t->buffer->async_transaction != 1);
3071 binder_enqueue_thread_work(thread, tcomplete);
3072 return_error = binder_proc_transaction(t, target_proc, NULL);
3074 goto err_dead_proc_or_thread;
3077 binder_thread_dec_tmpref(target_thread);
3078 binder_proc_dec_tmpref(target_proc);
3080 binder_dec_node_tmpref(target_node);
3082 * write barrier to synchronize with initialization
3086 WRITE_ONCE(e->debug_id_done, t_debug_id);
3089 err_dead_proc_or_thread:
3090 return_error_line = __LINE__;
3091 binder_dequeue_work(proc, tcomplete);
3092 err_translate_failed:
3093 err_bad_object_type:
3096 err_copy_data_failed:
3097 binder_free_txn_fixups(t);
3098 trace_binder_transaction_failed_buffer_release(t->buffer);
3099 binder_transaction_buffer_release(target_proc, t->buffer,
3100 buffer_offset, true);
3102 binder_dec_node_tmpref(target_node);
3104 t->buffer->transaction = NULL;
3105 binder_alloc_free_buf(&target_proc->alloc, t->buffer);
3106 err_binder_alloc_buf_failed:
3109 security_release_secctx(secctx, secctx_sz);
3110 err_get_secctx_failed:
3112 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
3113 err_alloc_tcomplete_failed:
3114 if (trace_binder_txn_latency_free_enabled())
3115 binder_txn_latency_free(t);
3117 binder_stats_deleted(BINDER_STAT_TRANSACTION);
3121 err_empty_call_stack:
3123 err_invalid_target_handle:
3125 binder_thread_dec_tmpref(target_thread);
3127 binder_proc_dec_tmpref(target_proc);
3129 binder_dec_node(target_node, 1, 0);
3130 binder_dec_node_tmpref(target_node);
3133 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
3134 "%d:%d transaction failed %d/%d, size %lld-%lld line %d\n",
3135 proc->pid, thread->pid, return_error, return_error_param,
3136 (u64)tr->data_size, (u64)tr->offsets_size,
3140 struct binder_transaction_log_entry *fe;
3142 e->return_error = return_error;
3143 e->return_error_param = return_error_param;
3144 e->return_error_line = return_error_line;
3145 fe = binder_transaction_log_add(&binder_transaction_log_failed);
3148 * write barrier to synchronize with initialization
3152 WRITE_ONCE(e->debug_id_done, t_debug_id);
3153 WRITE_ONCE(fe->debug_id_done, t_debug_id);
3156 BUG_ON(thread->return_error.cmd != BR_OK);
3158 thread->return_error.cmd = BR_TRANSACTION_COMPLETE;
3159 binder_enqueue_thread_work(thread, &thread->return_error.work);
3160 binder_send_failed_reply(in_reply_to, return_error);
3162 thread->return_error.cmd = return_error;
3163 binder_enqueue_thread_work(thread, &thread->return_error.work);
3168 * binder_free_buf() - free the specified buffer
3169 * @proc: binder proc that owns buffer
3170 * @buffer: buffer to be freed
3172 * If buffer for an async transaction, enqueue the next async
3173 * transaction from the node.
3175 * Cleanup buffer and free it.
3178 binder_free_buf(struct binder_proc *proc, struct binder_buffer *buffer)
3180 binder_inner_proc_lock(proc);
3181 if (buffer->transaction) {
3182 buffer->transaction->buffer = NULL;
3183 buffer->transaction = NULL;
3185 binder_inner_proc_unlock(proc);
3186 if (buffer->async_transaction && buffer->target_node) {
3187 struct binder_node *buf_node;
3188 struct binder_work *w;
3190 buf_node = buffer->target_node;
3191 binder_node_inner_lock(buf_node);
3192 BUG_ON(!buf_node->has_async_transaction);
3193 BUG_ON(buf_node->proc != proc);
3194 w = binder_dequeue_work_head_ilocked(
3195 &buf_node->async_todo);
3197 buf_node->has_async_transaction = false;
3199 binder_enqueue_work_ilocked(
3201 binder_wakeup_proc_ilocked(proc);
3203 binder_node_inner_unlock(buf_node);
3205 trace_binder_transaction_buffer_release(buffer);
3206 binder_transaction_buffer_release(proc, buffer, 0, false);
3207 binder_alloc_free_buf(&proc->alloc, buffer);
3210 static int binder_thread_write(struct binder_proc *proc,
3211 struct binder_thread *thread,
3212 binder_uintptr_t binder_buffer, size_t size,
3213 binder_size_t *consumed)
3216 struct binder_context *context = proc->context;
3217 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
3218 void __user *ptr = buffer + *consumed;
3219 void __user *end = buffer + size;
3221 while (ptr < end && thread->return_error.cmd == BR_OK) {
3224 if (get_user(cmd, (uint32_t __user *)ptr))
3226 ptr += sizeof(uint32_t);
3227 trace_binder_command(cmd);
3228 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.bc)) {
3229 atomic_inc(&binder_stats.bc[_IOC_NR(cmd)]);
3230 atomic_inc(&proc->stats.bc[_IOC_NR(cmd)]);
3231 atomic_inc(&thread->stats.bc[_IOC_NR(cmd)]);
3239 const char *debug_string;
3240 bool strong = cmd == BC_ACQUIRE || cmd == BC_RELEASE;
3241 bool increment = cmd == BC_INCREFS || cmd == BC_ACQUIRE;
3242 struct binder_ref_data rdata;
3244 if (get_user(target, (uint32_t __user *)ptr))
3247 ptr += sizeof(uint32_t);
3249 if (increment && !target) {
3250 struct binder_node *ctx_mgr_node;
3252 mutex_lock(&context->context_mgr_node_lock);
3253 ctx_mgr_node = context->binder_context_mgr_node;
3255 if (ctx_mgr_node->proc == proc) {
3256 binder_user_error("%d:%d context manager tried to acquire desc 0\n",
3257 proc->pid, thread->pid);
3258 mutex_unlock(&context->context_mgr_node_lock);
3261 ret = binder_inc_ref_for_node(
3263 strong, NULL, &rdata);
3265 mutex_unlock(&context->context_mgr_node_lock);
3268 ret = binder_update_ref_for_handle(
3269 proc, target, increment, strong,
3271 if (!ret && rdata.desc != target) {
3272 binder_user_error("%d:%d tried to acquire reference to desc %d, got %d instead\n",
3273 proc->pid, thread->pid,
3274 target, rdata.desc);
3278 debug_string = "IncRefs";
3281 debug_string = "Acquire";
3284 debug_string = "Release";
3288 debug_string = "DecRefs";
3292 binder_user_error("%d:%d %s %d refcount change on invalid ref %d ret %d\n",
3293 proc->pid, thread->pid, debug_string,
3294 strong, target, ret);
3297 binder_debug(BINDER_DEBUG_USER_REFS,
3298 "%d:%d %s ref %d desc %d s %d w %d\n",
3299 proc->pid, thread->pid, debug_string,
3300 rdata.debug_id, rdata.desc, rdata.strong,
3304 case BC_INCREFS_DONE:
3305 case BC_ACQUIRE_DONE: {
3306 binder_uintptr_t node_ptr;
3307 binder_uintptr_t cookie;
3308 struct binder_node *node;
3311 if (get_user(node_ptr, (binder_uintptr_t __user *)ptr))
3313 ptr += sizeof(binder_uintptr_t);
3314 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3316 ptr += sizeof(binder_uintptr_t);
3317 node = binder_get_node(proc, node_ptr);
3319 binder_user_error("%d:%d %s u%016llx no match\n",
3320 proc->pid, thread->pid,
3321 cmd == BC_INCREFS_DONE ?
3327 if (cookie != node->cookie) {
3328 binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
3329 proc->pid, thread->pid,
3330 cmd == BC_INCREFS_DONE ?
3331 "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3332 (u64)node_ptr, node->debug_id,
3333 (u64)cookie, (u64)node->cookie);
3334 binder_put_node(node);
3337 binder_node_inner_lock(node);
3338 if (cmd == BC_ACQUIRE_DONE) {
3339 if (node->pending_strong_ref == 0) {
3340 binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
3341 proc->pid, thread->pid,
3343 binder_node_inner_unlock(node);
3344 binder_put_node(node);
3347 node->pending_strong_ref = 0;
3349 if (node->pending_weak_ref == 0) {
3350 binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
3351 proc->pid, thread->pid,
3353 binder_node_inner_unlock(node);
3354 binder_put_node(node);
3357 node->pending_weak_ref = 0;
3359 free_node = binder_dec_node_nilocked(node,
3360 cmd == BC_ACQUIRE_DONE, 0);
3362 binder_debug(BINDER_DEBUG_USER_REFS,
3363 "%d:%d %s node %d ls %d lw %d tr %d\n",
3364 proc->pid, thread->pid,
3365 cmd == BC_INCREFS_DONE ? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3366 node->debug_id, node->local_strong_refs,
3367 node->local_weak_refs, node->tmp_refs);
3368 binder_node_inner_unlock(node);
3369 binder_put_node(node);
3372 case BC_ATTEMPT_ACQUIRE:
3373 pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
3375 case BC_ACQUIRE_RESULT:
3376 pr_err("BC_ACQUIRE_RESULT not supported\n");
3379 case BC_FREE_BUFFER: {
3380 binder_uintptr_t data_ptr;
3381 struct binder_buffer *buffer;
3383 if (get_user(data_ptr, (binder_uintptr_t __user *)ptr))
3385 ptr += sizeof(binder_uintptr_t);
3387 buffer = binder_alloc_prepare_to_free(&proc->alloc,
3389 if (IS_ERR_OR_NULL(buffer)) {
3390 if (PTR_ERR(buffer) == -EPERM) {
3392 "%d:%d BC_FREE_BUFFER u%016llx matched unreturned or currently freeing buffer\n",
3393 proc->pid, thread->pid,
3397 "%d:%d BC_FREE_BUFFER u%016llx no match\n",
3398 proc->pid, thread->pid,
3403 binder_debug(BINDER_DEBUG_FREE_BUFFER,
3404 "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
3405 proc->pid, thread->pid, (u64)data_ptr,
3407 buffer->transaction ? "active" : "finished");
3408 binder_free_buf(proc, buffer);
3412 case BC_TRANSACTION_SG:
3414 struct binder_transaction_data_sg tr;
3416 if (copy_from_user(&tr, ptr, sizeof(tr)))
3419 binder_transaction(proc, thread, &tr.transaction_data,
3420 cmd == BC_REPLY_SG, tr.buffers_size);
3423 case BC_TRANSACTION:
3425 struct binder_transaction_data tr;
3427 if (copy_from_user(&tr, ptr, sizeof(tr)))
3430 binder_transaction(proc, thread, &tr,
3431 cmd == BC_REPLY, 0);
3435 case BC_REGISTER_LOOPER:
3436 binder_debug(BINDER_DEBUG_THREADS,
3437 "%d:%d BC_REGISTER_LOOPER\n",
3438 proc->pid, thread->pid);
3439 binder_inner_proc_lock(proc);
3440 if (thread->looper & BINDER_LOOPER_STATE_ENTERED) {
3441 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3442 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
3443 proc->pid, thread->pid);
3444 } else if (proc->requested_threads == 0) {
3445 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3446 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
3447 proc->pid, thread->pid);
3449 proc->requested_threads--;
3450 proc->requested_threads_started++;
3452 thread->looper |= BINDER_LOOPER_STATE_REGISTERED;
3453 binder_inner_proc_unlock(proc);
3455 case BC_ENTER_LOOPER:
3456 binder_debug(BINDER_DEBUG_THREADS,
3457 "%d:%d BC_ENTER_LOOPER\n",
3458 proc->pid, thread->pid);
3459 if (thread->looper & BINDER_LOOPER_STATE_REGISTERED) {
3460 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3461 binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
3462 proc->pid, thread->pid);
3464 thread->looper |= BINDER_LOOPER_STATE_ENTERED;
3466 case BC_EXIT_LOOPER:
3467 binder_debug(BINDER_DEBUG_THREADS,
3468 "%d:%d BC_EXIT_LOOPER\n",
3469 proc->pid, thread->pid);
3470 thread->looper |= BINDER_LOOPER_STATE_EXITED;
3473 case BC_REQUEST_DEATH_NOTIFICATION:
3474 case BC_CLEAR_DEATH_NOTIFICATION: {
3476 binder_uintptr_t cookie;
3477 struct binder_ref *ref;
3478 struct binder_ref_death *death = NULL;
3480 if (get_user(target, (uint32_t __user *)ptr))
3482 ptr += sizeof(uint32_t);
3483 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3485 ptr += sizeof(binder_uintptr_t);
3486 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
3488 * Allocate memory for death notification
3489 * before taking lock
3491 death = kzalloc(sizeof(*death), GFP_KERNEL);
3492 if (death == NULL) {
3493 WARN_ON(thread->return_error.cmd !=
3495 thread->return_error.cmd = BR_ERROR;
3496 binder_enqueue_thread_work(
3498 &thread->return_error.work);
3500 BINDER_DEBUG_FAILED_TRANSACTION,
3501 "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
3502 proc->pid, thread->pid);
3506 binder_proc_lock(proc);
3507 ref = binder_get_ref_olocked(proc, target, false);
3509 binder_user_error("%d:%d %s invalid ref %d\n",
3510 proc->pid, thread->pid,
3511 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
3512 "BC_REQUEST_DEATH_NOTIFICATION" :
3513 "BC_CLEAR_DEATH_NOTIFICATION",
3515 binder_proc_unlock(proc);
3520 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
3521 "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
3522 proc->pid, thread->pid,
3523 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
3524 "BC_REQUEST_DEATH_NOTIFICATION" :
3525 "BC_CLEAR_DEATH_NOTIFICATION",
3526 (u64)cookie, ref->data.debug_id,
3527 ref->data.desc, ref->data.strong,
3528 ref->data.weak, ref->node->debug_id);
3530 binder_node_lock(ref->node);
3531 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
3533 binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
3534 proc->pid, thread->pid);
3535 binder_node_unlock(ref->node);
3536 binder_proc_unlock(proc);
3540 binder_stats_created(BINDER_STAT_DEATH);
3541 INIT_LIST_HEAD(&death->work.entry);
3542 death->cookie = cookie;
3544 if (ref->node->proc == NULL) {
3545 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
3547 binder_inner_proc_lock(proc);
3548 binder_enqueue_work_ilocked(
3549 &ref->death->work, &proc->todo);
3550 binder_wakeup_proc_ilocked(proc);
3551 binder_inner_proc_unlock(proc);
3554 if (ref->death == NULL) {
3555 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
3556 proc->pid, thread->pid);
3557 binder_node_unlock(ref->node);
3558 binder_proc_unlock(proc);
3562 if (death->cookie != cookie) {
3563 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
3564 proc->pid, thread->pid,
3567 binder_node_unlock(ref->node);
3568 binder_proc_unlock(proc);
3572 binder_inner_proc_lock(proc);
3573 if (list_empty(&death->work.entry)) {
3574 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
3575 if (thread->looper &
3576 (BINDER_LOOPER_STATE_REGISTERED |
3577 BINDER_LOOPER_STATE_ENTERED))
3578 binder_enqueue_thread_work_ilocked(
3582 binder_enqueue_work_ilocked(
3585 binder_wakeup_proc_ilocked(
3589 BUG_ON(death->work.type != BINDER_WORK_DEAD_BINDER);
3590 death->work.type = BINDER_WORK_DEAD_BINDER_AND_CLEAR;
3592 binder_inner_proc_unlock(proc);
3594 binder_node_unlock(ref->node);
3595 binder_proc_unlock(proc);
3597 case BC_DEAD_BINDER_DONE: {
3598 struct binder_work *w;
3599 binder_uintptr_t cookie;
3600 struct binder_ref_death *death = NULL;
3602 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3605 ptr += sizeof(cookie);
3606 binder_inner_proc_lock(proc);
3607 list_for_each_entry(w, &proc->delivered_death,
3609 struct binder_ref_death *tmp_death =
3611 struct binder_ref_death,
3614 if (tmp_death->cookie == cookie) {
3619 binder_debug(BINDER_DEBUG_DEAD_BINDER,
3620 "%d:%d BC_DEAD_BINDER_DONE %016llx found %pK\n",
3621 proc->pid, thread->pid, (u64)cookie,
3623 if (death == NULL) {
3624 binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
3625 proc->pid, thread->pid, (u64)cookie);
3626 binder_inner_proc_unlock(proc);
3629 binder_dequeue_work_ilocked(&death->work);
3630 if (death->work.type == BINDER_WORK_DEAD_BINDER_AND_CLEAR) {
3631 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
3632 if (thread->looper &
3633 (BINDER_LOOPER_STATE_REGISTERED |
3634 BINDER_LOOPER_STATE_ENTERED))
3635 binder_enqueue_thread_work_ilocked(
3636 thread, &death->work);
3638 binder_enqueue_work_ilocked(
3641 binder_wakeup_proc_ilocked(proc);
3644 binder_inner_proc_unlock(proc);
3648 pr_err("%d:%d unknown command %d\n",
3649 proc->pid, thread->pid, cmd);
3652 *consumed = ptr - buffer;
3657 static void binder_stat_br(struct binder_proc *proc,
3658 struct binder_thread *thread, uint32_t cmd)
3660 trace_binder_return(cmd);
3661 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.br)) {
3662 atomic_inc(&binder_stats.br[_IOC_NR(cmd)]);
3663 atomic_inc(&proc->stats.br[_IOC_NR(cmd)]);
3664 atomic_inc(&thread->stats.br[_IOC_NR(cmd)]);
3668 static int binder_put_node_cmd(struct binder_proc *proc,
3669 struct binder_thread *thread,
3671 binder_uintptr_t node_ptr,
3672 binder_uintptr_t node_cookie,
3674 uint32_t cmd, const char *cmd_name)
3676 void __user *ptr = *ptrp;
3678 if (put_user(cmd, (uint32_t __user *)ptr))
3680 ptr += sizeof(uint32_t);
3682 if (put_user(node_ptr, (binder_uintptr_t __user *)ptr))
3684 ptr += sizeof(binder_uintptr_t);
3686 if (put_user(node_cookie, (binder_uintptr_t __user *)ptr))
3688 ptr += sizeof(binder_uintptr_t);
3690 binder_stat_br(proc, thread, cmd);
3691 binder_debug(BINDER_DEBUG_USER_REFS, "%d:%d %s %d u%016llx c%016llx\n",
3692 proc->pid, thread->pid, cmd_name, node_debug_id,
3693 (u64)node_ptr, (u64)node_cookie);
3699 static int binder_wait_for_work(struct binder_thread *thread,
3703 struct binder_proc *proc = thread->proc;
3706 freezer_do_not_count();
3707 binder_inner_proc_lock(proc);
3709 prepare_to_wait(&thread->wait, &wait, TASK_INTERRUPTIBLE);
3710 if (binder_has_work_ilocked(thread, do_proc_work))
3713 list_add(&thread->waiting_thread_node,
3714 &proc->waiting_threads);
3715 binder_inner_proc_unlock(proc);
3717 binder_inner_proc_lock(proc);
3718 list_del_init(&thread->waiting_thread_node);
3719 if (signal_pending(current)) {
3724 finish_wait(&thread->wait, &wait);
3725 binder_inner_proc_unlock(proc);
3732 * binder_apply_fd_fixups() - finish fd translation
3733 * @proc: binder_proc associated @t->buffer
3734 * @t: binder transaction with list of fd fixups
3736 * Now that we are in the context of the transaction target
3737 * process, we can allocate and install fds. Process the
3738 * list of fds to translate and fixup the buffer with the
3741 * If we fail to allocate an fd, then free the resources by
3742 * fput'ing files that have not been processed and ksys_close'ing
3743 * any fds that have already been allocated.
3745 static int binder_apply_fd_fixups(struct binder_proc *proc,
3746 struct binder_transaction *t)
3748 struct binder_txn_fd_fixup *fixup, *tmp;
3751 list_for_each_entry(fixup, &t->fd_fixups, fixup_entry) {
3752 int fd = get_unused_fd_flags(O_CLOEXEC);
3755 binder_debug(BINDER_DEBUG_TRANSACTION,
3756 "failed fd fixup txn %d fd %d\n",
3761 binder_debug(BINDER_DEBUG_TRANSACTION,
3762 "fd fixup txn %d fd %d\n",
3764 trace_binder_transaction_fd_recv(t, fd, fixup->offset);
3765 fd_install(fd, fixup->file);
3767 if (binder_alloc_copy_to_buffer(&proc->alloc, t->buffer,
3774 list_for_each_entry_safe(fixup, tmp, &t->fd_fixups, fixup_entry) {
3781 err = binder_alloc_copy_from_buffer(&proc->alloc, &fd,
3787 binder_deferred_fd_close(fd);
3789 list_del(&fixup->fixup_entry);
3796 static int binder_thread_read(struct binder_proc *proc,
3797 struct binder_thread *thread,
3798 binder_uintptr_t binder_buffer, size_t size,
3799 binder_size_t *consumed, int non_block)
3801 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
3802 void __user *ptr = buffer + *consumed;
3803 void __user *end = buffer + size;
3806 int wait_for_proc_work;
3808 if (*consumed == 0) {
3809 if (put_user(BR_NOOP, (uint32_t __user *)ptr))
3811 ptr += sizeof(uint32_t);
3815 binder_inner_proc_lock(proc);
3816 wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
3817 binder_inner_proc_unlock(proc);
3819 thread->looper |= BINDER_LOOPER_STATE_WAITING;
3821 trace_binder_wait_for_work(wait_for_proc_work,
3822 !!thread->transaction_stack,
3823 !binder_worklist_empty(proc, &thread->todo));
3824 if (wait_for_proc_work) {
3825 if (!(thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
3826 BINDER_LOOPER_STATE_ENTERED))) {
3827 binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
3828 proc->pid, thread->pid, thread->looper);
3829 wait_event_interruptible(binder_user_error_wait,
3830 binder_stop_on_user_error < 2);
3832 binder_set_nice(proc->default_priority);
3836 if (!binder_has_work(thread, wait_for_proc_work))
3839 ret = binder_wait_for_work(thread, wait_for_proc_work);
3842 thread->looper &= ~BINDER_LOOPER_STATE_WAITING;
3849 struct binder_transaction_data_secctx tr;
3850 struct binder_transaction_data *trd = &tr.transaction_data;
3851 struct binder_work *w = NULL;
3852 struct list_head *list = NULL;
3853 struct binder_transaction *t = NULL;
3854 struct binder_thread *t_from;
3855 size_t trsize = sizeof(*trd);
3857 binder_inner_proc_lock(proc);
3858 if (!binder_worklist_empty_ilocked(&thread->todo))
3859 list = &thread->todo;
3860 else if (!binder_worklist_empty_ilocked(&proc->todo) &&
3864 binder_inner_proc_unlock(proc);
3867 if (ptr - buffer == 4 && !thread->looper_need_return)
3872 if (end - ptr < sizeof(tr) + 4) {
3873 binder_inner_proc_unlock(proc);
3876 w = binder_dequeue_work_head_ilocked(list);
3877 if (binder_worklist_empty_ilocked(&thread->todo))
3878 thread->process_todo = false;
3881 case BINDER_WORK_TRANSACTION: {
3882 binder_inner_proc_unlock(proc);
3883 t = container_of(w, struct binder_transaction, work);
3885 case BINDER_WORK_RETURN_ERROR: {
3886 struct binder_error *e = container_of(
3887 w, struct binder_error, work);
3889 WARN_ON(e->cmd == BR_OK);
3890 binder_inner_proc_unlock(proc);
3891 if (put_user(e->cmd, (uint32_t __user *)ptr))
3895 ptr += sizeof(uint32_t);
3897 binder_stat_br(proc, thread, cmd);
3899 case BINDER_WORK_TRANSACTION_COMPLETE:
3900 case BINDER_WORK_TRANSACTION_ONEWAY_SPAM_SUSPECT: {
3901 if (proc->oneway_spam_detection_enabled &&
3902 w->type == BINDER_WORK_TRANSACTION_ONEWAY_SPAM_SUSPECT)
3903 cmd = BR_ONEWAY_SPAM_SUSPECT;
3905 cmd = BR_TRANSACTION_COMPLETE;
3906 binder_inner_proc_unlock(proc);
3908 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
3909 if (put_user(cmd, (uint32_t __user *)ptr))
3911 ptr += sizeof(uint32_t);
3913 binder_stat_br(proc, thread, cmd);
3914 binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE,
3915 "%d:%d BR_TRANSACTION_COMPLETE\n",
3916 proc->pid, thread->pid);
3918 case BINDER_WORK_NODE: {
3919 struct binder_node *node = container_of(w, struct binder_node, work);
3921 binder_uintptr_t node_ptr = node->ptr;
3922 binder_uintptr_t node_cookie = node->cookie;
3923 int node_debug_id = node->debug_id;
3926 void __user *orig_ptr = ptr;
3928 BUG_ON(proc != node->proc);
3929 strong = node->internal_strong_refs ||
3930 node->local_strong_refs;
3931 weak = !hlist_empty(&node->refs) ||
3932 node->local_weak_refs ||
3933 node->tmp_refs || strong;
3934 has_strong_ref = node->has_strong_ref;
3935 has_weak_ref = node->has_weak_ref;
3937 if (weak && !has_weak_ref) {
3938 node->has_weak_ref = 1;
3939 node->pending_weak_ref = 1;
3940 node->local_weak_refs++;
3942 if (strong && !has_strong_ref) {
3943 node->has_strong_ref = 1;
3944 node->pending_strong_ref = 1;
3945 node->local_strong_refs++;
3947 if (!strong && has_strong_ref)
3948 node->has_strong_ref = 0;
3949 if (!weak && has_weak_ref)
3950 node->has_weak_ref = 0;
3951 if (!weak && !strong) {
3952 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
3953 "%d:%d node %d u%016llx c%016llx deleted\n",
3954 proc->pid, thread->pid,
3958 rb_erase(&node->rb_node, &proc->nodes);
3959 binder_inner_proc_unlock(proc);
3960 binder_node_lock(node);
3962 * Acquire the node lock before freeing the
3963 * node to serialize with other threads that
3964 * may have been holding the node lock while
3965 * decrementing this node (avoids race where
3966 * this thread frees while the other thread
3967 * is unlocking the node after the final
3970 binder_node_unlock(node);
3971 binder_free_node(node);
3973 binder_inner_proc_unlock(proc);
3975 if (weak && !has_weak_ref)
3976 ret = binder_put_node_cmd(
3977 proc, thread, &ptr, node_ptr,
3978 node_cookie, node_debug_id,
3979 BR_INCREFS, "BR_INCREFS");
3980 if (!ret && strong && !has_strong_ref)
3981 ret = binder_put_node_cmd(
3982 proc, thread, &ptr, node_ptr,
3983 node_cookie, node_debug_id,
3984 BR_ACQUIRE, "BR_ACQUIRE");
3985 if (!ret && !strong && has_strong_ref)
3986 ret = binder_put_node_cmd(
3987 proc, thread, &ptr, node_ptr,
3988 node_cookie, node_debug_id,
3989 BR_RELEASE, "BR_RELEASE");
3990 if (!ret && !weak && has_weak_ref)
3991 ret = binder_put_node_cmd(
3992 proc, thread, &ptr, node_ptr,
3993 node_cookie, node_debug_id,
3994 BR_DECREFS, "BR_DECREFS");
3995 if (orig_ptr == ptr)
3996 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
3997 "%d:%d node %d u%016llx c%016llx state unchanged\n",
3998 proc->pid, thread->pid,
4005 case BINDER_WORK_DEAD_BINDER:
4006 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4007 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
4008 struct binder_ref_death *death;
4010 binder_uintptr_t cookie;
4012 death = container_of(w, struct binder_ref_death, work);
4013 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION)
4014 cmd = BR_CLEAR_DEATH_NOTIFICATION_DONE;
4016 cmd = BR_DEAD_BINDER;
4017 cookie = death->cookie;
4019 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
4020 "%d:%d %s %016llx\n",
4021 proc->pid, thread->pid,
4022 cmd == BR_DEAD_BINDER ?
4024 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
4026 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) {
4027 binder_inner_proc_unlock(proc);
4029 binder_stats_deleted(BINDER_STAT_DEATH);
4031 binder_enqueue_work_ilocked(
4032 w, &proc->delivered_death);
4033 binder_inner_proc_unlock(proc);
4035 if (put_user(cmd, (uint32_t __user *)ptr))
4037 ptr += sizeof(uint32_t);
4038 if (put_user(cookie,
4039 (binder_uintptr_t __user *)ptr))
4041 ptr += sizeof(binder_uintptr_t);
4042 binder_stat_br(proc, thread, cmd);
4043 if (cmd == BR_DEAD_BINDER)
4044 goto done; /* DEAD_BINDER notifications can cause transactions */
4047 binder_inner_proc_unlock(proc);
4048 pr_err("%d:%d: bad work type %d\n",
4049 proc->pid, thread->pid, w->type);
4056 BUG_ON(t->buffer == NULL);
4057 if (t->buffer->target_node) {
4058 struct binder_node *target_node = t->buffer->target_node;
4060 trd->target.ptr = target_node->ptr;
4061 trd->cookie = target_node->cookie;
4062 t->saved_priority = task_nice(current);
4063 if (t->priority < target_node->min_priority &&
4064 !(t->flags & TF_ONE_WAY))
4065 binder_set_nice(t->priority);
4066 else if (!(t->flags & TF_ONE_WAY) ||
4067 t->saved_priority > target_node->min_priority)
4068 binder_set_nice(target_node->min_priority);
4069 cmd = BR_TRANSACTION;
4071 trd->target.ptr = 0;
4075 trd->code = t->code;
4076 trd->flags = t->flags;
4077 trd->sender_euid = from_kuid(current_user_ns(), t->sender_euid);
4079 t_from = binder_get_txn_from(t);
4081 struct task_struct *sender = t_from->proc->tsk;
4084 task_tgid_nr_ns(sender,
4085 task_active_pid_ns(current));
4087 trd->sender_pid = 0;
4090 ret = binder_apply_fd_fixups(proc, t);
4092 struct binder_buffer *buffer = t->buffer;
4093 bool oneway = !!(t->flags & TF_ONE_WAY);
4094 int tid = t->debug_id;
4097 binder_thread_dec_tmpref(t_from);
4098 buffer->transaction = NULL;
4099 binder_cleanup_transaction(t, "fd fixups failed",
4101 binder_free_buf(proc, buffer);
4102 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
4103 "%d:%d %stransaction %d fd fixups failed %d/%d, line %d\n",
4104 proc->pid, thread->pid,
4106 (cmd == BR_REPLY ? "reply " : ""),
4107 tid, BR_FAILED_REPLY, ret, __LINE__);
4108 if (cmd == BR_REPLY) {
4109 cmd = BR_FAILED_REPLY;
4110 if (put_user(cmd, (uint32_t __user *)ptr))
4112 ptr += sizeof(uint32_t);
4113 binder_stat_br(proc, thread, cmd);
4118 trd->data_size = t->buffer->data_size;
4119 trd->offsets_size = t->buffer->offsets_size;
4120 trd->data.ptr.buffer = (uintptr_t)t->buffer->user_data;
4121 trd->data.ptr.offsets = trd->data.ptr.buffer +
4122 ALIGN(t->buffer->data_size,
4125 tr.secctx = t->security_ctx;
4126 if (t->security_ctx) {
4127 cmd = BR_TRANSACTION_SEC_CTX;
4128 trsize = sizeof(tr);
4130 if (put_user(cmd, (uint32_t __user *)ptr)) {
4132 binder_thread_dec_tmpref(t_from);
4134 binder_cleanup_transaction(t, "put_user failed",
4139 ptr += sizeof(uint32_t);
4140 if (copy_to_user(ptr, &tr, trsize)) {
4142 binder_thread_dec_tmpref(t_from);
4144 binder_cleanup_transaction(t, "copy_to_user failed",
4151 trace_binder_transaction_received(t);
4152 binder_stat_br(proc, thread, cmd);
4153 binder_debug(BINDER_DEBUG_TRANSACTION,
4154 "%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n",
4155 proc->pid, thread->pid,
4156 (cmd == BR_TRANSACTION) ? "BR_TRANSACTION" :
4157 (cmd == BR_TRANSACTION_SEC_CTX) ?
4158 "BR_TRANSACTION_SEC_CTX" : "BR_REPLY",
4159 t->debug_id, t_from ? t_from->proc->pid : 0,
4160 t_from ? t_from->pid : 0, cmd,
4161 t->buffer->data_size, t->buffer->offsets_size,
4162 (u64)trd->data.ptr.buffer,
4163 (u64)trd->data.ptr.offsets);
4166 binder_thread_dec_tmpref(t_from);
4167 t->buffer->allow_user_free = 1;
4168 if (cmd != BR_REPLY && !(t->flags & TF_ONE_WAY)) {
4169 binder_inner_proc_lock(thread->proc);
4170 t->to_parent = thread->transaction_stack;
4171 t->to_thread = thread;
4172 thread->transaction_stack = t;
4173 binder_inner_proc_unlock(thread->proc);
4175 binder_free_transaction(t);
4182 *consumed = ptr - buffer;
4183 binder_inner_proc_lock(proc);
4184 if (proc->requested_threads == 0 &&
4185 list_empty(&thread->proc->waiting_threads) &&
4186 proc->requested_threads_started < proc->max_threads &&
4187 (thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
4188 BINDER_LOOPER_STATE_ENTERED)) /* the user-space code fails to */
4189 /*spawn a new thread if we leave this out */) {
4190 proc->requested_threads++;
4191 binder_inner_proc_unlock(proc);
4192 binder_debug(BINDER_DEBUG_THREADS,
4193 "%d:%d BR_SPAWN_LOOPER\n",
4194 proc->pid, thread->pid);
4195 if (put_user(BR_SPAWN_LOOPER, (uint32_t __user *)buffer))
4197 binder_stat_br(proc, thread, BR_SPAWN_LOOPER);
4199 binder_inner_proc_unlock(proc);
4203 static void binder_release_work(struct binder_proc *proc,
4204 struct list_head *list)
4206 struct binder_work *w;
4207 enum binder_work_type wtype;
4210 binder_inner_proc_lock(proc);
4211 w = binder_dequeue_work_head_ilocked(list);
4212 wtype = w ? w->type : 0;
4213 binder_inner_proc_unlock(proc);
4218 case BINDER_WORK_TRANSACTION: {
4219 struct binder_transaction *t;
4221 t = container_of(w, struct binder_transaction, work);
4223 binder_cleanup_transaction(t, "process died.",
4226 case BINDER_WORK_RETURN_ERROR: {
4227 struct binder_error *e = container_of(
4228 w, struct binder_error, work);
4230 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4231 "undelivered TRANSACTION_ERROR: %u\n",
4234 case BINDER_WORK_TRANSACTION_COMPLETE: {
4235 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4236 "undelivered TRANSACTION_COMPLETE\n");
4238 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
4240 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4241 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
4242 struct binder_ref_death *death;
4244 death = container_of(w, struct binder_ref_death, work);
4245 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4246 "undelivered death notification, %016llx\n",
4247 (u64)death->cookie);
4249 binder_stats_deleted(BINDER_STAT_DEATH);
4251 case BINDER_WORK_NODE:
4254 pr_err("unexpected work type, %d, not freed\n",
4262 static struct binder_thread *binder_get_thread_ilocked(
4263 struct binder_proc *proc, struct binder_thread *new_thread)
4265 struct binder_thread *thread = NULL;
4266 struct rb_node *parent = NULL;
4267 struct rb_node **p = &proc->threads.rb_node;
4271 thread = rb_entry(parent, struct binder_thread, rb_node);
4273 if (current->pid < thread->pid)
4275 else if (current->pid > thread->pid)
4276 p = &(*p)->rb_right;
4282 thread = new_thread;
4283 binder_stats_created(BINDER_STAT_THREAD);
4284 thread->proc = proc;
4285 thread->pid = current->pid;
4286 atomic_set(&thread->tmp_ref, 0);
4287 init_waitqueue_head(&thread->wait);
4288 INIT_LIST_HEAD(&thread->todo);
4289 rb_link_node(&thread->rb_node, parent, p);
4290 rb_insert_color(&thread->rb_node, &proc->threads);
4291 thread->looper_need_return = true;
4292 thread->return_error.work.type = BINDER_WORK_RETURN_ERROR;
4293 thread->return_error.cmd = BR_OK;
4294 thread->reply_error.work.type = BINDER_WORK_RETURN_ERROR;
4295 thread->reply_error.cmd = BR_OK;
4296 INIT_LIST_HEAD(&new_thread->waiting_thread_node);
4300 static struct binder_thread *binder_get_thread(struct binder_proc *proc)
4302 struct binder_thread *thread;
4303 struct binder_thread *new_thread;
4305 binder_inner_proc_lock(proc);
4306 thread = binder_get_thread_ilocked(proc, NULL);
4307 binder_inner_proc_unlock(proc);
4309 new_thread = kzalloc(sizeof(*thread), GFP_KERNEL);
4310 if (new_thread == NULL)
4312 binder_inner_proc_lock(proc);
4313 thread = binder_get_thread_ilocked(proc, new_thread);
4314 binder_inner_proc_unlock(proc);
4315 if (thread != new_thread)
4321 static void binder_free_proc(struct binder_proc *proc)
4323 struct binder_device *device;
4325 BUG_ON(!list_empty(&proc->todo));
4326 BUG_ON(!list_empty(&proc->delivered_death));
4327 if (proc->outstanding_txns)
4328 pr_warn("%s: Unexpected outstanding_txns %d\n",
4329 __func__, proc->outstanding_txns);
4330 device = container_of(proc->context, struct binder_device, context);
4331 if (refcount_dec_and_test(&device->ref)) {
4332 kfree(proc->context->name);
4335 binder_alloc_deferred_release(&proc->alloc);
4336 put_task_struct(proc->tsk);
4337 binder_stats_deleted(BINDER_STAT_PROC);
4341 static void binder_free_thread(struct binder_thread *thread)
4343 BUG_ON(!list_empty(&thread->todo));
4344 binder_stats_deleted(BINDER_STAT_THREAD);
4345 binder_proc_dec_tmpref(thread->proc);
4349 static int binder_thread_release(struct binder_proc *proc,
4350 struct binder_thread *thread)
4352 struct binder_transaction *t;
4353 struct binder_transaction *send_reply = NULL;
4354 int active_transactions = 0;
4355 struct binder_transaction *last_t = NULL;
4357 binder_inner_proc_lock(thread->proc);
4359 * take a ref on the proc so it survives
4360 * after we remove this thread from proc->threads.
4361 * The corresponding dec is when we actually
4362 * free the thread in binder_free_thread()
4366 * take a ref on this thread to ensure it
4367 * survives while we are releasing it
4369 atomic_inc(&thread->tmp_ref);
4370 rb_erase(&thread->rb_node, &proc->threads);
4371 t = thread->transaction_stack;
4373 spin_lock(&t->lock);
4374 if (t->to_thread == thread)
4377 __acquire(&t->lock);
4379 thread->is_dead = true;
4383 active_transactions++;
4384 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4385 "release %d:%d transaction %d %s, still active\n",
4386 proc->pid, thread->pid,
4388 (t->to_thread == thread) ? "in" : "out");
4390 if (t->to_thread == thread) {
4391 thread->proc->outstanding_txns--;
4393 t->to_thread = NULL;
4395 t->buffer->transaction = NULL;
4399 } else if (t->from == thread) {
4404 spin_unlock(&last_t->lock);
4406 spin_lock(&t->lock);
4408 __acquire(&t->lock);
4410 /* annotation for sparse, lock not acquired in last iteration above */
4411 __release(&t->lock);
4414 * If this thread used poll, make sure we remove the waitqueue
4415 * from any epoll data structures holding it with POLLFREE.
4416 * waitqueue_active() is safe to use here because we're holding
4419 if ((thread->looper & BINDER_LOOPER_STATE_POLL) &&
4420 waitqueue_active(&thread->wait)) {
4421 wake_up_poll(&thread->wait, EPOLLHUP | POLLFREE);
4424 binder_inner_proc_unlock(thread->proc);
4427 * This is needed to avoid races between wake_up_poll() above and
4428 * and ep_remove_waitqueue() called for other reasons (eg the epoll file
4429 * descriptor being closed); ep_remove_waitqueue() holds an RCU read
4430 * lock, so we can be sure it's done after calling synchronize_rcu().
4432 if (thread->looper & BINDER_LOOPER_STATE_POLL)
4436 binder_send_failed_reply(send_reply, BR_DEAD_REPLY);
4437 binder_release_work(proc, &thread->todo);
4438 binder_thread_dec_tmpref(thread);
4439 return active_transactions;
4442 static __poll_t binder_poll(struct file *filp,
4443 struct poll_table_struct *wait)
4445 struct binder_proc *proc = filp->private_data;
4446 struct binder_thread *thread = NULL;
4447 bool wait_for_proc_work;
4449 thread = binder_get_thread(proc);
4453 binder_inner_proc_lock(thread->proc);
4454 thread->looper |= BINDER_LOOPER_STATE_POLL;
4455 wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
4457 binder_inner_proc_unlock(thread->proc);
4459 poll_wait(filp, &thread->wait, wait);
4461 if (binder_has_work(thread, wait_for_proc_work))
4467 static int binder_ioctl_write_read(struct file *filp,
4468 unsigned int cmd, unsigned long arg,
4469 struct binder_thread *thread)
4472 struct binder_proc *proc = filp->private_data;
4473 unsigned int size = _IOC_SIZE(cmd);
4474 void __user *ubuf = (void __user *)arg;
4475 struct binder_write_read bwr;
4477 if (size != sizeof(struct binder_write_read)) {
4481 if (copy_from_user(&bwr, ubuf, sizeof(bwr))) {
4485 binder_debug(BINDER_DEBUG_READ_WRITE,
4486 "%d:%d write %lld at %016llx, read %lld at %016llx\n",
4487 proc->pid, thread->pid,
4488 (u64)bwr.write_size, (u64)bwr.write_buffer,
4489 (u64)bwr.read_size, (u64)bwr.read_buffer);
4491 if (bwr.write_size > 0) {
4492 ret = binder_thread_write(proc, thread,
4495 &bwr.write_consumed);
4496 trace_binder_write_done(ret);
4498 bwr.read_consumed = 0;
4499 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
4504 if (bwr.read_size > 0) {
4505 ret = binder_thread_read(proc, thread, bwr.read_buffer,
4508 filp->f_flags & O_NONBLOCK);
4509 trace_binder_read_done(ret);
4510 binder_inner_proc_lock(proc);
4511 if (!binder_worklist_empty_ilocked(&proc->todo))
4512 binder_wakeup_proc_ilocked(proc);
4513 binder_inner_proc_unlock(proc);
4515 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
4520 binder_debug(BINDER_DEBUG_READ_WRITE,
4521 "%d:%d wrote %lld of %lld, read return %lld of %lld\n",
4522 proc->pid, thread->pid,
4523 (u64)bwr.write_consumed, (u64)bwr.write_size,
4524 (u64)bwr.read_consumed, (u64)bwr.read_size);
4525 if (copy_to_user(ubuf, &bwr, sizeof(bwr))) {
4533 static int binder_ioctl_set_ctx_mgr(struct file *filp,
4534 struct flat_binder_object *fbo)
4537 struct binder_proc *proc = filp->private_data;
4538 struct binder_context *context = proc->context;
4539 struct binder_node *new_node;
4540 kuid_t curr_euid = current_euid();
4542 mutex_lock(&context->context_mgr_node_lock);
4543 if (context->binder_context_mgr_node) {
4544 pr_err("BINDER_SET_CONTEXT_MGR already set\n");
4548 ret = security_binder_set_context_mgr(proc->tsk);
4551 if (uid_valid(context->binder_context_mgr_uid)) {
4552 if (!uid_eq(context->binder_context_mgr_uid, curr_euid)) {
4553 pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
4554 from_kuid(&init_user_ns, curr_euid),
4555 from_kuid(&init_user_ns,
4556 context->binder_context_mgr_uid));
4561 context->binder_context_mgr_uid = curr_euid;
4563 new_node = binder_new_node(proc, fbo);
4568 binder_node_lock(new_node);
4569 new_node->local_weak_refs++;
4570 new_node->local_strong_refs++;
4571 new_node->has_strong_ref = 1;
4572 new_node->has_weak_ref = 1;
4573 context->binder_context_mgr_node = new_node;
4574 binder_node_unlock(new_node);
4575 binder_put_node(new_node);
4577 mutex_unlock(&context->context_mgr_node_lock);
4581 static int binder_ioctl_get_node_info_for_ref(struct binder_proc *proc,
4582 struct binder_node_info_for_ref *info)
4584 struct binder_node *node;
4585 struct binder_context *context = proc->context;
4586 __u32 handle = info->handle;
4588 if (info->strong_count || info->weak_count || info->reserved1 ||
4589 info->reserved2 || info->reserved3) {
4590 binder_user_error("%d BINDER_GET_NODE_INFO_FOR_REF: only handle may be non-zero.",
4595 /* This ioctl may only be used by the context manager */
4596 mutex_lock(&context->context_mgr_node_lock);
4597 if (!context->binder_context_mgr_node ||
4598 context->binder_context_mgr_node->proc != proc) {
4599 mutex_unlock(&context->context_mgr_node_lock);
4602 mutex_unlock(&context->context_mgr_node_lock);
4604 node = binder_get_node_from_ref(proc, handle, true, NULL);
4608 info->strong_count = node->local_strong_refs +
4609 node->internal_strong_refs;
4610 info->weak_count = node->local_weak_refs;
4612 binder_put_node(node);
4617 static int binder_ioctl_get_node_debug_info(struct binder_proc *proc,
4618 struct binder_node_debug_info *info)
4621 binder_uintptr_t ptr = info->ptr;
4623 memset(info, 0, sizeof(*info));
4625 binder_inner_proc_lock(proc);
4626 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
4627 struct binder_node *node = rb_entry(n, struct binder_node,
4629 if (node->ptr > ptr) {
4630 info->ptr = node->ptr;
4631 info->cookie = node->cookie;
4632 info->has_strong_ref = node->has_strong_ref;
4633 info->has_weak_ref = node->has_weak_ref;
4637 binder_inner_proc_unlock(proc);
4642 static int binder_ioctl_freeze(struct binder_freeze_info *info,
4643 struct binder_proc *target_proc)
4647 if (!info->enable) {
4648 binder_inner_proc_lock(target_proc);
4649 target_proc->sync_recv = false;
4650 target_proc->async_recv = false;
4651 target_proc->is_frozen = false;
4652 binder_inner_proc_unlock(target_proc);
4657 * Freezing the target. Prevent new transactions by
4658 * setting frozen state. If timeout specified, wait
4659 * for transactions to drain.
4661 binder_inner_proc_lock(target_proc);
4662 target_proc->sync_recv = false;
4663 target_proc->async_recv = false;
4664 target_proc->is_frozen = true;
4665 binder_inner_proc_unlock(target_proc);
4667 if (info->timeout_ms > 0)
4668 ret = wait_event_interruptible_timeout(
4669 target_proc->freeze_wait,
4670 (!target_proc->outstanding_txns),
4671 msecs_to_jiffies(info->timeout_ms));
4673 if (!ret && target_proc->outstanding_txns)
4677 binder_inner_proc_lock(target_proc);
4678 target_proc->is_frozen = false;
4679 binder_inner_proc_unlock(target_proc);
4685 static int binder_ioctl_get_freezer_info(
4686 struct binder_frozen_status_info *info)
4688 struct binder_proc *target_proc;
4691 info->sync_recv = 0;
4692 info->async_recv = 0;
4694 mutex_lock(&binder_procs_lock);
4695 hlist_for_each_entry(target_proc, &binder_procs, proc_node) {
4696 if (target_proc->pid == info->pid) {
4698 binder_inner_proc_lock(target_proc);
4699 info->sync_recv |= target_proc->sync_recv;
4700 info->async_recv |= target_proc->async_recv;
4701 binder_inner_proc_unlock(target_proc);
4704 mutex_unlock(&binder_procs_lock);
4712 static long binder_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
4715 struct binder_proc *proc = filp->private_data;
4716 struct binder_thread *thread;
4717 unsigned int size = _IOC_SIZE(cmd);
4718 void __user *ubuf = (void __user *)arg;
4720 /*pr_info("binder_ioctl: %d:%d %x %lx\n",
4721 proc->pid, current->pid, cmd, arg);*/
4723 binder_selftest_alloc(&proc->alloc);
4725 trace_binder_ioctl(cmd, arg);
4727 ret = wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
4731 thread = binder_get_thread(proc);
4732 if (thread == NULL) {
4738 case BINDER_WRITE_READ:
4739 ret = binder_ioctl_write_read(filp, cmd, arg, thread);
4743 case BINDER_SET_MAX_THREADS: {
4746 if (copy_from_user(&max_threads, ubuf,
4747 sizeof(max_threads))) {
4751 binder_inner_proc_lock(proc);
4752 proc->max_threads = max_threads;
4753 binder_inner_proc_unlock(proc);
4756 case BINDER_SET_CONTEXT_MGR_EXT: {
4757 struct flat_binder_object fbo;
4759 if (copy_from_user(&fbo, ubuf, sizeof(fbo))) {
4763 ret = binder_ioctl_set_ctx_mgr(filp, &fbo);
4768 case BINDER_SET_CONTEXT_MGR:
4769 ret = binder_ioctl_set_ctx_mgr(filp, NULL);
4773 case BINDER_THREAD_EXIT:
4774 binder_debug(BINDER_DEBUG_THREADS, "%d:%d exit\n",
4775 proc->pid, thread->pid);
4776 binder_thread_release(proc, thread);
4779 case BINDER_VERSION: {
4780 struct binder_version __user *ver = ubuf;
4782 if (size != sizeof(struct binder_version)) {
4786 if (put_user(BINDER_CURRENT_PROTOCOL_VERSION,
4787 &ver->protocol_version)) {
4793 case BINDER_GET_NODE_INFO_FOR_REF: {
4794 struct binder_node_info_for_ref info;
4796 if (copy_from_user(&info, ubuf, sizeof(info))) {
4801 ret = binder_ioctl_get_node_info_for_ref(proc, &info);
4805 if (copy_to_user(ubuf, &info, sizeof(info))) {
4812 case BINDER_GET_NODE_DEBUG_INFO: {
4813 struct binder_node_debug_info info;
4815 if (copy_from_user(&info, ubuf, sizeof(info))) {
4820 ret = binder_ioctl_get_node_debug_info(proc, &info);
4824 if (copy_to_user(ubuf, &info, sizeof(info))) {
4830 case BINDER_FREEZE: {
4831 struct binder_freeze_info info;
4832 struct binder_proc **target_procs = NULL, *target_proc;
4833 int target_procs_count = 0, i = 0;
4837 if (copy_from_user(&info, ubuf, sizeof(info))) {
4842 mutex_lock(&binder_procs_lock);
4843 hlist_for_each_entry(target_proc, &binder_procs, proc_node) {
4844 if (target_proc->pid == info.pid)
4845 target_procs_count++;
4848 if (target_procs_count == 0) {
4849 mutex_unlock(&binder_procs_lock);
4854 target_procs = kcalloc(target_procs_count,
4855 sizeof(struct binder_proc *),
4858 if (!target_procs) {
4859 mutex_unlock(&binder_procs_lock);
4864 hlist_for_each_entry(target_proc, &binder_procs, proc_node) {
4865 if (target_proc->pid != info.pid)
4868 binder_inner_proc_lock(target_proc);
4869 target_proc->tmp_ref++;
4870 binder_inner_proc_unlock(target_proc);
4872 target_procs[i++] = target_proc;
4874 mutex_unlock(&binder_procs_lock);
4876 for (i = 0; i < target_procs_count; i++) {
4878 ret = binder_ioctl_freeze(&info,
4881 binder_proc_dec_tmpref(target_procs[i]);
4884 kfree(target_procs);
4890 case BINDER_GET_FROZEN_INFO: {
4891 struct binder_frozen_status_info info;
4893 if (copy_from_user(&info, ubuf, sizeof(info))) {
4898 ret = binder_ioctl_get_freezer_info(&info);
4902 if (copy_to_user(ubuf, &info, sizeof(info))) {
4908 case BINDER_ENABLE_ONEWAY_SPAM_DETECTION: {
4911 if (copy_from_user(&enable, ubuf, sizeof(enable))) {
4915 binder_inner_proc_lock(proc);
4916 proc->oneway_spam_detection_enabled = (bool)enable;
4917 binder_inner_proc_unlock(proc);
4927 thread->looper_need_return = false;
4928 wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
4929 if (ret && ret != -EINTR)
4930 pr_info("%d:%d ioctl %x %lx returned %d\n", proc->pid, current->pid, cmd, arg, ret);
4932 trace_binder_ioctl_done(ret);
4936 static void binder_vma_open(struct vm_area_struct *vma)
4938 struct binder_proc *proc = vma->vm_private_data;
4940 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
4941 "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
4942 proc->pid, vma->vm_start, vma->vm_end,
4943 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
4944 (unsigned long)pgprot_val(vma->vm_page_prot));
4947 static void binder_vma_close(struct vm_area_struct *vma)
4949 struct binder_proc *proc = vma->vm_private_data;
4951 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
4952 "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
4953 proc->pid, vma->vm_start, vma->vm_end,
4954 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
4955 (unsigned long)pgprot_val(vma->vm_page_prot));
4956 binder_alloc_vma_close(&proc->alloc);
4959 static vm_fault_t binder_vm_fault(struct vm_fault *vmf)
4961 return VM_FAULT_SIGBUS;
4964 static const struct vm_operations_struct binder_vm_ops = {
4965 .open = binder_vma_open,
4966 .close = binder_vma_close,
4967 .fault = binder_vm_fault,
4970 static int binder_mmap(struct file *filp, struct vm_area_struct *vma)
4972 struct binder_proc *proc = filp->private_data;
4974 if (proc->tsk != current->group_leader)
4977 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
4978 "%s: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
4979 __func__, proc->pid, vma->vm_start, vma->vm_end,
4980 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
4981 (unsigned long)pgprot_val(vma->vm_page_prot));
4983 if (vma->vm_flags & FORBIDDEN_MMAP_FLAGS) {
4984 pr_err("%s: %d %lx-%lx %s failed %d\n", __func__,
4985 proc->pid, vma->vm_start, vma->vm_end, "bad vm_flags", -EPERM);
4988 vma->vm_flags |= VM_DONTCOPY | VM_MIXEDMAP;
4989 vma->vm_flags &= ~VM_MAYWRITE;
4991 vma->vm_ops = &binder_vm_ops;
4992 vma->vm_private_data = proc;
4994 return binder_alloc_mmap_handler(&proc->alloc, vma);
4997 static int binder_open(struct inode *nodp, struct file *filp)
4999 struct binder_proc *proc, *itr;
5000 struct binder_device *binder_dev;
5001 struct binderfs_info *info;
5002 struct dentry *binder_binderfs_dir_entry_proc = NULL;
5003 bool existing_pid = false;
5005 binder_debug(BINDER_DEBUG_OPEN_CLOSE, "%s: %d:%d\n", __func__,
5006 current->group_leader->pid, current->pid);
5008 proc = kzalloc(sizeof(*proc), GFP_KERNEL);
5011 spin_lock_init(&proc->inner_lock);
5012 spin_lock_init(&proc->outer_lock);
5013 get_task_struct(current->group_leader);
5014 proc->tsk = current->group_leader;
5015 INIT_LIST_HEAD(&proc->todo);
5016 init_waitqueue_head(&proc->freeze_wait);
5017 proc->default_priority = task_nice(current);
5018 /* binderfs stashes devices in i_private */
5019 if (is_binderfs_device(nodp)) {
5020 binder_dev = nodp->i_private;
5021 info = nodp->i_sb->s_fs_info;
5022 binder_binderfs_dir_entry_proc = info->proc_log_dir;
5024 binder_dev = container_of(filp->private_data,
5025 struct binder_device, miscdev);
5027 refcount_inc(&binder_dev->ref);
5028 proc->context = &binder_dev->context;
5029 binder_alloc_init(&proc->alloc);
5031 binder_stats_created(BINDER_STAT_PROC);
5032 proc->pid = current->group_leader->pid;
5033 INIT_LIST_HEAD(&proc->delivered_death);
5034 INIT_LIST_HEAD(&proc->waiting_threads);
5035 filp->private_data = proc;
5037 mutex_lock(&binder_procs_lock);
5038 hlist_for_each_entry(itr, &binder_procs, proc_node) {
5039 if (itr->pid == proc->pid) {
5040 existing_pid = true;
5044 hlist_add_head(&proc->proc_node, &binder_procs);
5045 mutex_unlock(&binder_procs_lock);
5047 if (binder_debugfs_dir_entry_proc && !existing_pid) {
5050 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
5052 * proc debug entries are shared between contexts.
5053 * Only create for the first PID to avoid debugfs log spamming
5054 * The printing code will anyway print all contexts for a given
5055 * PID so this is not a problem.
5057 proc->debugfs_entry = debugfs_create_file(strbuf, 0444,
5058 binder_debugfs_dir_entry_proc,
5059 (void *)(unsigned long)proc->pid,
5063 if (binder_binderfs_dir_entry_proc && !existing_pid) {
5065 struct dentry *binderfs_entry;
5067 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
5069 * Similar to debugfs, the process specific log file is shared
5070 * between contexts. Only create for the first PID.
5071 * This is ok since same as debugfs, the log file will contain
5072 * information on all contexts of a given PID.
5074 binderfs_entry = binderfs_create_file(binder_binderfs_dir_entry_proc,
5075 strbuf, &proc_fops, (void *)(unsigned long)proc->pid);
5076 if (!IS_ERR(binderfs_entry)) {
5077 proc->binderfs_entry = binderfs_entry;
5081 error = PTR_ERR(binderfs_entry);
5082 pr_warn("Unable to create file %s in binderfs (error %d)\n",
5090 static int binder_flush(struct file *filp, fl_owner_t id)
5092 struct binder_proc *proc = filp->private_data;
5094 binder_defer_work(proc, BINDER_DEFERRED_FLUSH);
5099 static void binder_deferred_flush(struct binder_proc *proc)
5104 binder_inner_proc_lock(proc);
5105 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
5106 struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node);
5108 thread->looper_need_return = true;
5109 if (thread->looper & BINDER_LOOPER_STATE_WAITING) {
5110 wake_up_interruptible(&thread->wait);
5114 binder_inner_proc_unlock(proc);
5116 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5117 "binder_flush: %d woke %d threads\n", proc->pid,
5121 static int binder_release(struct inode *nodp, struct file *filp)
5123 struct binder_proc *proc = filp->private_data;
5125 debugfs_remove(proc->debugfs_entry);
5127 if (proc->binderfs_entry) {
5128 binderfs_remove_file(proc->binderfs_entry);
5129 proc->binderfs_entry = NULL;
5132 binder_defer_work(proc, BINDER_DEFERRED_RELEASE);
5137 static int binder_node_release(struct binder_node *node, int refs)
5139 struct binder_ref *ref;
5141 struct binder_proc *proc = node->proc;
5143 binder_release_work(proc, &node->async_todo);
5145 binder_node_lock(node);
5146 binder_inner_proc_lock(proc);
5147 binder_dequeue_work_ilocked(&node->work);
5149 * The caller must have taken a temporary ref on the node,
5151 BUG_ON(!node->tmp_refs);
5152 if (hlist_empty(&node->refs) && node->tmp_refs == 1) {
5153 binder_inner_proc_unlock(proc);
5154 binder_node_unlock(node);
5155 binder_free_node(node);
5161 node->local_strong_refs = 0;
5162 node->local_weak_refs = 0;
5163 binder_inner_proc_unlock(proc);
5165 spin_lock(&binder_dead_nodes_lock);
5166 hlist_add_head(&node->dead_node, &binder_dead_nodes);
5167 spin_unlock(&binder_dead_nodes_lock);
5169 hlist_for_each_entry(ref, &node->refs, node_entry) {
5172 * Need the node lock to synchronize
5173 * with new notification requests and the
5174 * inner lock to synchronize with queued
5175 * death notifications.
5177 binder_inner_proc_lock(ref->proc);
5179 binder_inner_proc_unlock(ref->proc);
5185 BUG_ON(!list_empty(&ref->death->work.entry));
5186 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
5187 binder_enqueue_work_ilocked(&ref->death->work,
5189 binder_wakeup_proc_ilocked(ref->proc);
5190 binder_inner_proc_unlock(ref->proc);
5193 binder_debug(BINDER_DEBUG_DEAD_BINDER,
5194 "node %d now dead, refs %d, death %d\n",
5195 node->debug_id, refs, death);
5196 binder_node_unlock(node);
5197 binder_put_node(node);
5202 static void binder_deferred_release(struct binder_proc *proc)
5204 struct binder_context *context = proc->context;
5206 int threads, nodes, incoming_refs, outgoing_refs, active_transactions;
5208 mutex_lock(&binder_procs_lock);
5209 hlist_del(&proc->proc_node);
5210 mutex_unlock(&binder_procs_lock);
5212 mutex_lock(&context->context_mgr_node_lock);
5213 if (context->binder_context_mgr_node &&
5214 context->binder_context_mgr_node->proc == proc) {
5215 binder_debug(BINDER_DEBUG_DEAD_BINDER,
5216 "%s: %d context_mgr_node gone\n",
5217 __func__, proc->pid);
5218 context->binder_context_mgr_node = NULL;
5220 mutex_unlock(&context->context_mgr_node_lock);
5221 binder_inner_proc_lock(proc);
5223 * Make sure proc stays alive after we
5224 * remove all the threads
5228 proc->is_dead = true;
5229 proc->is_frozen = false;
5230 proc->sync_recv = false;
5231 proc->async_recv = false;
5233 active_transactions = 0;
5234 while ((n = rb_first(&proc->threads))) {
5235 struct binder_thread *thread;
5237 thread = rb_entry(n, struct binder_thread, rb_node);
5238 binder_inner_proc_unlock(proc);
5240 active_transactions += binder_thread_release(proc, thread);
5241 binder_inner_proc_lock(proc);
5246 while ((n = rb_first(&proc->nodes))) {
5247 struct binder_node *node;
5249 node = rb_entry(n, struct binder_node, rb_node);
5252 * take a temporary ref on the node before
5253 * calling binder_node_release() which will either
5254 * kfree() the node or call binder_put_node()
5256 binder_inc_node_tmpref_ilocked(node);
5257 rb_erase(&node->rb_node, &proc->nodes);
5258 binder_inner_proc_unlock(proc);
5259 incoming_refs = binder_node_release(node, incoming_refs);
5260 binder_inner_proc_lock(proc);
5262 binder_inner_proc_unlock(proc);
5265 binder_proc_lock(proc);
5266 while ((n = rb_first(&proc->refs_by_desc))) {
5267 struct binder_ref *ref;
5269 ref = rb_entry(n, struct binder_ref, rb_node_desc);
5271 binder_cleanup_ref_olocked(ref);
5272 binder_proc_unlock(proc);
5273 binder_free_ref(ref);
5274 binder_proc_lock(proc);
5276 binder_proc_unlock(proc);
5278 binder_release_work(proc, &proc->todo);
5279 binder_release_work(proc, &proc->delivered_death);
5281 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5282 "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d\n",
5283 __func__, proc->pid, threads, nodes, incoming_refs,
5284 outgoing_refs, active_transactions);
5286 binder_proc_dec_tmpref(proc);
5289 static void binder_deferred_func(struct work_struct *work)
5291 struct binder_proc *proc;
5296 mutex_lock(&binder_deferred_lock);
5297 if (!hlist_empty(&binder_deferred_list)) {
5298 proc = hlist_entry(binder_deferred_list.first,
5299 struct binder_proc, deferred_work_node);
5300 hlist_del_init(&proc->deferred_work_node);
5301 defer = proc->deferred_work;
5302 proc->deferred_work = 0;
5307 mutex_unlock(&binder_deferred_lock);
5309 if (defer & BINDER_DEFERRED_FLUSH)
5310 binder_deferred_flush(proc);
5312 if (defer & BINDER_DEFERRED_RELEASE)
5313 binder_deferred_release(proc); /* frees proc */
5316 static DECLARE_WORK(binder_deferred_work, binder_deferred_func);
5319 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer)
5321 mutex_lock(&binder_deferred_lock);
5322 proc->deferred_work |= defer;
5323 if (hlist_unhashed(&proc->deferred_work_node)) {
5324 hlist_add_head(&proc->deferred_work_node,
5325 &binder_deferred_list);
5326 schedule_work(&binder_deferred_work);
5328 mutex_unlock(&binder_deferred_lock);
5331 static void print_binder_transaction_ilocked(struct seq_file *m,
5332 struct binder_proc *proc,
5334 struct binder_transaction *t)
5336 struct binder_proc *to_proc;
5337 struct binder_buffer *buffer = t->buffer;
5339 spin_lock(&t->lock);
5340 to_proc = t->to_proc;
5342 "%s %d: %pK from %d:%d to %d:%d code %x flags %x pri %ld r%d",
5343 prefix, t->debug_id, t,
5344 t->from ? t->from->proc->pid : 0,
5345 t->from ? t->from->pid : 0,
5346 to_proc ? to_proc->pid : 0,
5347 t->to_thread ? t->to_thread->pid : 0,
5348 t->code, t->flags, t->priority, t->need_reply);
5349 spin_unlock(&t->lock);
5351 if (proc != to_proc) {
5353 * Can only safely deref buffer if we are holding the
5354 * correct proc inner lock for this node
5360 if (buffer == NULL) {
5361 seq_puts(m, " buffer free\n");
5364 if (buffer->target_node)
5365 seq_printf(m, " node %d", buffer->target_node->debug_id);
5366 seq_printf(m, " size %zd:%zd data %pK\n",
5367 buffer->data_size, buffer->offsets_size,
5371 static void print_binder_work_ilocked(struct seq_file *m,
5372 struct binder_proc *proc,
5374 const char *transaction_prefix,
5375 struct binder_work *w)
5377 struct binder_node *node;
5378 struct binder_transaction *t;
5381 case BINDER_WORK_TRANSACTION:
5382 t = container_of(w, struct binder_transaction, work);
5383 print_binder_transaction_ilocked(
5384 m, proc, transaction_prefix, t);
5386 case BINDER_WORK_RETURN_ERROR: {
5387 struct binder_error *e = container_of(
5388 w, struct binder_error, work);
5390 seq_printf(m, "%stransaction error: %u\n",
5393 case BINDER_WORK_TRANSACTION_COMPLETE:
5394 seq_printf(m, "%stransaction complete\n", prefix);
5396 case BINDER_WORK_NODE:
5397 node = container_of(w, struct binder_node, work);
5398 seq_printf(m, "%snode work %d: u%016llx c%016llx\n",
5399 prefix, node->debug_id,
5400 (u64)node->ptr, (u64)node->cookie);
5402 case BINDER_WORK_DEAD_BINDER:
5403 seq_printf(m, "%shas dead binder\n", prefix);
5405 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
5406 seq_printf(m, "%shas cleared dead binder\n", prefix);
5408 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION:
5409 seq_printf(m, "%shas cleared death notification\n", prefix);
5412 seq_printf(m, "%sunknown work: type %d\n", prefix, w->type);
5417 static void print_binder_thread_ilocked(struct seq_file *m,
5418 struct binder_thread *thread,
5421 struct binder_transaction *t;
5422 struct binder_work *w;
5423 size_t start_pos = m->count;
5426 seq_printf(m, " thread %d: l %02x need_return %d tr %d\n",
5427 thread->pid, thread->looper,
5428 thread->looper_need_return,
5429 atomic_read(&thread->tmp_ref));
5430 header_pos = m->count;
5431 t = thread->transaction_stack;
5433 if (t->from == thread) {
5434 print_binder_transaction_ilocked(m, thread->proc,
5435 " outgoing transaction", t);
5437 } else if (t->to_thread == thread) {
5438 print_binder_transaction_ilocked(m, thread->proc,
5439 " incoming transaction", t);
5442 print_binder_transaction_ilocked(m, thread->proc,
5443 " bad transaction", t);
5447 list_for_each_entry(w, &thread->todo, entry) {
5448 print_binder_work_ilocked(m, thread->proc, " ",
5449 " pending transaction", w);
5451 if (!print_always && m->count == header_pos)
5452 m->count = start_pos;
5455 static void print_binder_node_nilocked(struct seq_file *m,
5456 struct binder_node *node)
5458 struct binder_ref *ref;
5459 struct binder_work *w;
5463 hlist_for_each_entry(ref, &node->refs, node_entry)
5466 seq_printf(m, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d tr %d",
5467 node->debug_id, (u64)node->ptr, (u64)node->cookie,
5468 node->has_strong_ref, node->has_weak_ref,
5469 node->local_strong_refs, node->local_weak_refs,
5470 node->internal_strong_refs, count, node->tmp_refs);
5472 seq_puts(m, " proc");
5473 hlist_for_each_entry(ref, &node->refs, node_entry)
5474 seq_printf(m, " %d", ref->proc->pid);
5478 list_for_each_entry(w, &node->async_todo, entry)
5479 print_binder_work_ilocked(m, node->proc, " ",
5480 " pending async transaction", w);
5484 static void print_binder_ref_olocked(struct seq_file *m,
5485 struct binder_ref *ref)
5487 binder_node_lock(ref->node);
5488 seq_printf(m, " ref %d: desc %d %snode %d s %d w %d d %pK\n",
5489 ref->data.debug_id, ref->data.desc,
5490 ref->node->proc ? "" : "dead ",
5491 ref->node->debug_id, ref->data.strong,
5492 ref->data.weak, ref->death);
5493 binder_node_unlock(ref->node);
5496 static void print_binder_proc(struct seq_file *m,
5497 struct binder_proc *proc, int print_all)
5499 struct binder_work *w;
5501 size_t start_pos = m->count;
5503 struct binder_node *last_node = NULL;
5505 seq_printf(m, "proc %d\n", proc->pid);
5506 seq_printf(m, "context %s\n", proc->context->name);
5507 header_pos = m->count;
5509 binder_inner_proc_lock(proc);
5510 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
5511 print_binder_thread_ilocked(m, rb_entry(n, struct binder_thread,
5512 rb_node), print_all);
5514 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
5515 struct binder_node *node = rb_entry(n, struct binder_node,
5517 if (!print_all && !node->has_async_transaction)
5521 * take a temporary reference on the node so it
5522 * survives and isn't removed from the tree
5523 * while we print it.
5525 binder_inc_node_tmpref_ilocked(node);
5526 /* Need to drop inner lock to take node lock */
5527 binder_inner_proc_unlock(proc);
5529 binder_put_node(last_node);
5530 binder_node_inner_lock(node);
5531 print_binder_node_nilocked(m, node);
5532 binder_node_inner_unlock(node);
5534 binder_inner_proc_lock(proc);
5536 binder_inner_proc_unlock(proc);
5538 binder_put_node(last_node);
5541 binder_proc_lock(proc);
5542 for (n = rb_first(&proc->refs_by_desc);
5545 print_binder_ref_olocked(m, rb_entry(n,
5548 binder_proc_unlock(proc);
5550 binder_alloc_print_allocated(m, &proc->alloc);
5551 binder_inner_proc_lock(proc);
5552 list_for_each_entry(w, &proc->todo, entry)
5553 print_binder_work_ilocked(m, proc, " ",
5554 " pending transaction", w);
5555 list_for_each_entry(w, &proc->delivered_death, entry) {
5556 seq_puts(m, " has delivered dead binder\n");
5559 binder_inner_proc_unlock(proc);
5560 if (!print_all && m->count == header_pos)
5561 m->count = start_pos;
5564 static const char * const binder_return_strings[] = {
5569 "BR_ACQUIRE_RESULT",
5571 "BR_TRANSACTION_COMPLETE",
5576 "BR_ATTEMPT_ACQUIRE",
5581 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
5584 "BR_ONEWAY_SPAM_SUSPECT",
5587 static const char * const binder_command_strings[] = {
5590 "BC_ACQUIRE_RESULT",
5598 "BC_ATTEMPT_ACQUIRE",
5599 "BC_REGISTER_LOOPER",
5602 "BC_REQUEST_DEATH_NOTIFICATION",
5603 "BC_CLEAR_DEATH_NOTIFICATION",
5604 "BC_DEAD_BINDER_DONE",
5605 "BC_TRANSACTION_SG",
5609 static const char * const binder_objstat_strings[] = {
5616 "transaction_complete"
5619 static void print_binder_stats(struct seq_file *m, const char *prefix,
5620 struct binder_stats *stats)
5624 BUILD_BUG_ON(ARRAY_SIZE(stats->bc) !=
5625 ARRAY_SIZE(binder_command_strings));
5626 for (i = 0; i < ARRAY_SIZE(stats->bc); i++) {
5627 int temp = atomic_read(&stats->bc[i]);
5630 seq_printf(m, "%s%s: %d\n", prefix,
5631 binder_command_strings[i], temp);
5634 BUILD_BUG_ON(ARRAY_SIZE(stats->br) !=
5635 ARRAY_SIZE(binder_return_strings));
5636 for (i = 0; i < ARRAY_SIZE(stats->br); i++) {
5637 int temp = atomic_read(&stats->br[i]);
5640 seq_printf(m, "%s%s: %d\n", prefix,
5641 binder_return_strings[i], temp);
5644 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
5645 ARRAY_SIZE(binder_objstat_strings));
5646 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
5647 ARRAY_SIZE(stats->obj_deleted));
5648 for (i = 0; i < ARRAY_SIZE(stats->obj_created); i++) {
5649 int created = atomic_read(&stats->obj_created[i]);
5650 int deleted = atomic_read(&stats->obj_deleted[i]);
5652 if (created || deleted)
5653 seq_printf(m, "%s%s: active %d total %d\n",
5655 binder_objstat_strings[i],
5661 static void print_binder_proc_stats(struct seq_file *m,
5662 struct binder_proc *proc)
5664 struct binder_work *w;
5665 struct binder_thread *thread;
5667 int count, strong, weak, ready_threads;
5668 size_t free_async_space =
5669 binder_alloc_get_free_async_space(&proc->alloc);
5671 seq_printf(m, "proc %d\n", proc->pid);
5672 seq_printf(m, "context %s\n", proc->context->name);
5675 binder_inner_proc_lock(proc);
5676 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
5679 list_for_each_entry(thread, &proc->waiting_threads, waiting_thread_node)
5682 seq_printf(m, " threads: %d\n", count);
5683 seq_printf(m, " requested threads: %d+%d/%d\n"
5684 " ready threads %d\n"
5685 " free async space %zd\n", proc->requested_threads,
5686 proc->requested_threads_started, proc->max_threads,
5690 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n))
5692 binder_inner_proc_unlock(proc);
5693 seq_printf(m, " nodes: %d\n", count);
5697 binder_proc_lock(proc);
5698 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
5699 struct binder_ref *ref = rb_entry(n, struct binder_ref,
5702 strong += ref->data.strong;
5703 weak += ref->data.weak;
5705 binder_proc_unlock(proc);
5706 seq_printf(m, " refs: %d s %d w %d\n", count, strong, weak);
5708 count = binder_alloc_get_allocated_count(&proc->alloc);
5709 seq_printf(m, " buffers: %d\n", count);
5711 binder_alloc_print_pages(m, &proc->alloc);
5714 binder_inner_proc_lock(proc);
5715 list_for_each_entry(w, &proc->todo, entry) {
5716 if (w->type == BINDER_WORK_TRANSACTION)
5719 binder_inner_proc_unlock(proc);
5720 seq_printf(m, " pending transactions: %d\n", count);
5722 print_binder_stats(m, " ", &proc->stats);
5726 int binder_state_show(struct seq_file *m, void *unused)
5728 struct binder_proc *proc;
5729 struct binder_node *node;
5730 struct binder_node *last_node = NULL;
5732 seq_puts(m, "binder state:\n");
5734 spin_lock(&binder_dead_nodes_lock);
5735 if (!hlist_empty(&binder_dead_nodes))
5736 seq_puts(m, "dead nodes:\n");
5737 hlist_for_each_entry(node, &binder_dead_nodes, dead_node) {
5739 * take a temporary reference on the node so it
5740 * survives and isn't removed from the list
5741 * while we print it.
5744 spin_unlock(&binder_dead_nodes_lock);
5746 binder_put_node(last_node);
5747 binder_node_lock(node);
5748 print_binder_node_nilocked(m, node);
5749 binder_node_unlock(node);
5751 spin_lock(&binder_dead_nodes_lock);
5753 spin_unlock(&binder_dead_nodes_lock);
5755 binder_put_node(last_node);
5757 mutex_lock(&binder_procs_lock);
5758 hlist_for_each_entry(proc, &binder_procs, proc_node)
5759 print_binder_proc(m, proc, 1);
5760 mutex_unlock(&binder_procs_lock);
5765 int binder_stats_show(struct seq_file *m, void *unused)
5767 struct binder_proc *proc;
5769 seq_puts(m, "binder stats:\n");
5771 print_binder_stats(m, "", &binder_stats);
5773 mutex_lock(&binder_procs_lock);
5774 hlist_for_each_entry(proc, &binder_procs, proc_node)
5775 print_binder_proc_stats(m, proc);
5776 mutex_unlock(&binder_procs_lock);
5781 int binder_transactions_show(struct seq_file *m, void *unused)
5783 struct binder_proc *proc;
5785 seq_puts(m, "binder transactions:\n");
5786 mutex_lock(&binder_procs_lock);
5787 hlist_for_each_entry(proc, &binder_procs, proc_node)
5788 print_binder_proc(m, proc, 0);
5789 mutex_unlock(&binder_procs_lock);
5794 static int proc_show(struct seq_file *m, void *unused)
5796 struct binder_proc *itr;
5797 int pid = (unsigned long)m->private;
5799 mutex_lock(&binder_procs_lock);
5800 hlist_for_each_entry(itr, &binder_procs, proc_node) {
5801 if (itr->pid == pid) {
5802 seq_puts(m, "binder proc state:\n");
5803 print_binder_proc(m, itr, 1);
5806 mutex_unlock(&binder_procs_lock);
5811 static void print_binder_transaction_log_entry(struct seq_file *m,
5812 struct binder_transaction_log_entry *e)
5814 int debug_id = READ_ONCE(e->debug_id_done);
5816 * read barrier to guarantee debug_id_done read before
5817 * we print the log values
5821 "%d: %s from %d:%d to %d:%d context %s node %d handle %d size %d:%d ret %d/%d l=%d",
5822 e->debug_id, (e->call_type == 2) ? "reply" :
5823 ((e->call_type == 1) ? "async" : "call "), e->from_proc,
5824 e->from_thread, e->to_proc, e->to_thread, e->context_name,
5825 e->to_node, e->target_handle, e->data_size, e->offsets_size,
5826 e->return_error, e->return_error_param,
5827 e->return_error_line);
5829 * read-barrier to guarantee read of debug_id_done after
5830 * done printing the fields of the entry
5833 seq_printf(m, debug_id && debug_id == READ_ONCE(e->debug_id_done) ?
5834 "\n" : " (incomplete)\n");
5837 int binder_transaction_log_show(struct seq_file *m, void *unused)
5839 struct binder_transaction_log *log = m->private;
5840 unsigned int log_cur = atomic_read(&log->cur);
5845 count = log_cur + 1;
5846 cur = count < ARRAY_SIZE(log->entry) && !log->full ?
5847 0 : count % ARRAY_SIZE(log->entry);
5848 if (count > ARRAY_SIZE(log->entry) || log->full)
5849 count = ARRAY_SIZE(log->entry);
5850 for (i = 0; i < count; i++) {
5851 unsigned int index = cur++ % ARRAY_SIZE(log->entry);
5853 print_binder_transaction_log_entry(m, &log->entry[index]);
5858 const struct file_operations binder_fops = {
5859 .owner = THIS_MODULE,
5860 .poll = binder_poll,
5861 .unlocked_ioctl = binder_ioctl,
5862 .compat_ioctl = compat_ptr_ioctl,
5863 .mmap = binder_mmap,
5864 .open = binder_open,
5865 .flush = binder_flush,
5866 .release = binder_release,
5869 static int __init init_binder_device(const char *name)
5872 struct binder_device *binder_device;
5874 binder_device = kzalloc(sizeof(*binder_device), GFP_KERNEL);
5878 binder_device->miscdev.fops = &binder_fops;
5879 binder_device->miscdev.minor = MISC_DYNAMIC_MINOR;
5880 binder_device->miscdev.name = name;
5882 refcount_set(&binder_device->ref, 1);
5883 binder_device->context.binder_context_mgr_uid = INVALID_UID;
5884 binder_device->context.name = name;
5885 mutex_init(&binder_device->context.context_mgr_node_lock);
5887 ret = misc_register(&binder_device->miscdev);
5889 kfree(binder_device);
5893 hlist_add_head(&binder_device->hlist, &binder_devices);
5898 static int __init binder_init(void)
5901 char *device_name, *device_tmp;
5902 struct binder_device *device;
5903 struct hlist_node *tmp;
5904 char *device_names = NULL;
5906 ret = binder_alloc_shrinker_init();
5910 atomic_set(&binder_transaction_log.cur, ~0U);
5911 atomic_set(&binder_transaction_log_failed.cur, ~0U);
5913 binder_debugfs_dir_entry_root = debugfs_create_dir("binder", NULL);
5914 if (binder_debugfs_dir_entry_root)
5915 binder_debugfs_dir_entry_proc = debugfs_create_dir("proc",
5916 binder_debugfs_dir_entry_root);
5918 if (binder_debugfs_dir_entry_root) {
5919 debugfs_create_file("state",
5921 binder_debugfs_dir_entry_root,
5923 &binder_state_fops);
5924 debugfs_create_file("stats",
5926 binder_debugfs_dir_entry_root,
5928 &binder_stats_fops);
5929 debugfs_create_file("transactions",
5931 binder_debugfs_dir_entry_root,
5933 &binder_transactions_fops);
5934 debugfs_create_file("transaction_log",
5936 binder_debugfs_dir_entry_root,
5937 &binder_transaction_log,
5938 &binder_transaction_log_fops);
5939 debugfs_create_file("failed_transaction_log",
5941 binder_debugfs_dir_entry_root,
5942 &binder_transaction_log_failed,
5943 &binder_transaction_log_fops);
5946 if (!IS_ENABLED(CONFIG_ANDROID_BINDERFS) &&
5947 strcmp(binder_devices_param, "") != 0) {
5949 * Copy the module_parameter string, because we don't want to
5950 * tokenize it in-place.
5952 device_names = kstrdup(binder_devices_param, GFP_KERNEL);
5953 if (!device_names) {
5955 goto err_alloc_device_names_failed;
5958 device_tmp = device_names;
5959 while ((device_name = strsep(&device_tmp, ","))) {
5960 ret = init_binder_device(device_name);
5962 goto err_init_binder_device_failed;
5966 ret = init_binderfs();
5968 goto err_init_binder_device_failed;
5972 err_init_binder_device_failed:
5973 hlist_for_each_entry_safe(device, tmp, &binder_devices, hlist) {
5974 misc_deregister(&device->miscdev);
5975 hlist_del(&device->hlist);
5979 kfree(device_names);
5981 err_alloc_device_names_failed:
5982 debugfs_remove_recursive(binder_debugfs_dir_entry_root);
5987 device_initcall(binder_init);
5989 #define CREATE_TRACE_POINTS
5990 #include "binder_trace.h"
5992 MODULE_LICENSE("GPL v2");