1 // SPDX-License-Identifier: GPL-2.0-only
4 * Android IPC Subsystem
6 * Copyright (C) 2007-2008 Google, Inc.
12 * There are 3 main spinlocks which must be acquired in the
15 * 1) proc->outer_lock : protects binder_ref
16 * binder_proc_lock() and binder_proc_unlock() are
18 * 2) node->lock : protects most fields of binder_node.
19 * binder_node_lock() and binder_node_unlock() are
21 * 3) proc->inner_lock : protects the thread and node lists
22 * (proc->threads, proc->waiting_threads, proc->nodes)
23 * and all todo lists associated with the binder_proc
24 * (proc->todo, thread->todo, proc->delivered_death and
25 * node->async_todo), as well as thread->transaction_stack
26 * binder_inner_proc_lock() and binder_inner_proc_unlock()
29 * Any lock under procA must never be nested under any lock at the same
30 * level or below on procB.
32 * Functions that require a lock held on entry indicate which lock
33 * in the suffix of the function name:
35 * foo_olocked() : requires node->outer_lock
36 * foo_nlocked() : requires node->lock
37 * foo_ilocked() : requires proc->inner_lock
38 * foo_oilocked(): requires proc->outer_lock and proc->inner_lock
39 * foo_nilocked(): requires node->lock and proc->inner_lock
43 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
45 #include <linux/fdtable.h>
46 #include <linux/file.h>
47 #include <linux/freezer.h>
49 #include <linux/list.h>
50 #include <linux/miscdevice.h>
51 #include <linux/module.h>
52 #include <linux/mutex.h>
53 #include <linux/nsproxy.h>
54 #include <linux/poll.h>
55 #include <linux/debugfs.h>
56 #include <linux/rbtree.h>
57 #include <linux/sched/signal.h>
58 #include <linux/sched/mm.h>
59 #include <linux/seq_file.h>
60 #include <linux/string.h>
61 #include <linux/uaccess.h>
62 #include <linux/pid_namespace.h>
63 #include <linux/security.h>
64 #include <linux/spinlock.h>
65 #include <linux/ratelimit.h>
66 #include <linux/syscalls.h>
67 #include <linux/task_work.h>
68 #include <linux/sizes.h>
70 #include <uapi/linux/android/binder.h>
72 #include <linux/cacheflush.h>
74 #include "binder_internal.h"
75 #include "binder_trace.h"
77 static HLIST_HEAD(binder_deferred_list);
78 static DEFINE_MUTEX(binder_deferred_lock);
80 static HLIST_HEAD(binder_devices);
81 static HLIST_HEAD(binder_procs);
82 static DEFINE_MUTEX(binder_procs_lock);
84 static HLIST_HEAD(binder_dead_nodes);
85 static DEFINE_SPINLOCK(binder_dead_nodes_lock);
87 static struct dentry *binder_debugfs_dir_entry_root;
88 static struct dentry *binder_debugfs_dir_entry_proc;
89 static atomic_t binder_last_id;
91 static int proc_show(struct seq_file *m, void *unused);
92 DEFINE_SHOW_ATTRIBUTE(proc);
94 #define FORBIDDEN_MMAP_FLAGS (VM_WRITE)
97 BINDER_DEBUG_USER_ERROR = 1U << 0,
98 BINDER_DEBUG_FAILED_TRANSACTION = 1U << 1,
99 BINDER_DEBUG_DEAD_TRANSACTION = 1U << 2,
100 BINDER_DEBUG_OPEN_CLOSE = 1U << 3,
101 BINDER_DEBUG_DEAD_BINDER = 1U << 4,
102 BINDER_DEBUG_DEATH_NOTIFICATION = 1U << 5,
103 BINDER_DEBUG_READ_WRITE = 1U << 6,
104 BINDER_DEBUG_USER_REFS = 1U << 7,
105 BINDER_DEBUG_THREADS = 1U << 8,
106 BINDER_DEBUG_TRANSACTION = 1U << 9,
107 BINDER_DEBUG_TRANSACTION_COMPLETE = 1U << 10,
108 BINDER_DEBUG_FREE_BUFFER = 1U << 11,
109 BINDER_DEBUG_INTERNAL_REFS = 1U << 12,
110 BINDER_DEBUG_PRIORITY_CAP = 1U << 13,
111 BINDER_DEBUG_SPINLOCKS = 1U << 14,
113 static uint32_t binder_debug_mask = BINDER_DEBUG_USER_ERROR |
114 BINDER_DEBUG_FAILED_TRANSACTION | BINDER_DEBUG_DEAD_TRANSACTION;
115 module_param_named(debug_mask, binder_debug_mask, uint, 0644);
117 char *binder_devices_param = CONFIG_ANDROID_BINDER_DEVICES;
118 module_param_named(devices, binder_devices_param, charp, 0444);
120 static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait);
121 static int binder_stop_on_user_error;
123 static int binder_set_stop_on_user_error(const char *val,
124 const struct kernel_param *kp)
128 ret = param_set_int(val, kp);
129 if (binder_stop_on_user_error < 2)
130 wake_up(&binder_user_error_wait);
133 module_param_call(stop_on_user_error, binder_set_stop_on_user_error,
134 param_get_int, &binder_stop_on_user_error, 0644);
136 #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 * @u: sender's user pointer to base of buffer
1612 * @buffer: binder_buffer that we're parsing.
1613 * @offset: offset in the @buffer at which to validate an object.
1614 * @object: struct binder_object to read into
1616 * Copy the binder object at the given offset into @object. If @u is
1617 * provided then the copy is from the sender's buffer. If not, then
1618 * it is copied from the target's @buffer.
1620 * Return: If there's a valid metadata object at @offset, the
1621 * size of that object. Otherwise, it returns zero. The object
1622 * is read into the struct binder_object pointed to by @object.
1624 static size_t binder_get_object(struct binder_proc *proc,
1625 const void __user *u,
1626 struct binder_buffer *buffer,
1627 unsigned long offset,
1628 struct binder_object *object)
1631 struct binder_object_header *hdr;
1632 size_t object_size = 0;
1634 read_size = min_t(size_t, sizeof(*object), buffer->data_size - offset);
1635 if (offset > buffer->data_size || read_size < sizeof(*hdr))
1638 if (copy_from_user(object, u + offset, read_size))
1641 if (binder_alloc_copy_from_buffer(&proc->alloc, object, buffer,
1646 /* Ok, now see if we read a complete object. */
1648 switch (hdr->type) {
1649 case BINDER_TYPE_BINDER:
1650 case BINDER_TYPE_WEAK_BINDER:
1651 case BINDER_TYPE_HANDLE:
1652 case BINDER_TYPE_WEAK_HANDLE:
1653 object_size = sizeof(struct flat_binder_object);
1655 case BINDER_TYPE_FD:
1656 object_size = sizeof(struct binder_fd_object);
1658 case BINDER_TYPE_PTR:
1659 object_size = sizeof(struct binder_buffer_object);
1661 case BINDER_TYPE_FDA:
1662 object_size = sizeof(struct binder_fd_array_object);
1667 if (offset <= buffer->data_size - object_size &&
1668 buffer->data_size >= object_size)
1675 * binder_validate_ptr() - validates binder_buffer_object in a binder_buffer.
1676 * @proc: binder_proc owning the buffer
1677 * @b: binder_buffer containing the object
1678 * @object: struct binder_object to read into
1679 * @index: index in offset array at which the binder_buffer_object is
1681 * @start_offset: points to the start of the offset array
1682 * @object_offsetp: offset of @object read from @b
1683 * @num_valid: the number of valid offsets in the offset array
1685 * Return: If @index is within the valid range of the offset array
1686 * described by @start and @num_valid, and if there's a valid
1687 * binder_buffer_object at the offset found in index @index
1688 * of the offset array, that object is returned. Otherwise,
1689 * %NULL is returned.
1690 * Note that the offset found in index @index itself is not
1691 * verified; this function assumes that @num_valid elements
1692 * from @start were previously verified to have valid offsets.
1693 * If @object_offsetp is non-NULL, then the offset within
1694 * @b is written to it.
1696 static struct binder_buffer_object *binder_validate_ptr(
1697 struct binder_proc *proc,
1698 struct binder_buffer *b,
1699 struct binder_object *object,
1700 binder_size_t index,
1701 binder_size_t start_offset,
1702 binder_size_t *object_offsetp,
1703 binder_size_t num_valid)
1706 binder_size_t object_offset;
1707 unsigned long buffer_offset;
1709 if (index >= num_valid)
1712 buffer_offset = start_offset + sizeof(binder_size_t) * index;
1713 if (binder_alloc_copy_from_buffer(&proc->alloc, &object_offset,
1715 sizeof(object_offset)))
1717 object_size = binder_get_object(proc, NULL, b, object_offset, object);
1718 if (!object_size || object->hdr.type != BINDER_TYPE_PTR)
1721 *object_offsetp = object_offset;
1723 return &object->bbo;
1727 * binder_validate_fixup() - validates pointer/fd fixups happen in order.
1728 * @proc: binder_proc owning the buffer
1729 * @b: transaction buffer
1730 * @objects_start_offset: offset to start of objects buffer
1731 * @buffer_obj_offset: offset to binder_buffer_object in which to fix up
1732 * @fixup_offset: start offset in @buffer to fix up
1733 * @last_obj_offset: offset to last binder_buffer_object that we fixed
1734 * @last_min_offset: minimum fixup offset in object at @last_obj_offset
1736 * Return: %true if a fixup in buffer @buffer at offset @offset is
1739 * For safety reasons, we only allow fixups inside a buffer to happen
1740 * at increasing offsets; additionally, we only allow fixup on the last
1741 * buffer object that was verified, or one of its parents.
1743 * Example of what is allowed:
1746 * B (parent = A, offset = 0)
1747 * C (parent = A, offset = 16)
1748 * D (parent = C, offset = 0)
1749 * E (parent = A, offset = 32) // min_offset is 16 (C.parent_offset)
1751 * Examples of what is not allowed:
1753 * Decreasing offsets within the same parent:
1755 * C (parent = A, offset = 16)
1756 * B (parent = A, offset = 0) // decreasing offset within A
1758 * Referring to a parent that wasn't the last object or any of its parents:
1760 * B (parent = A, offset = 0)
1761 * C (parent = A, offset = 0)
1762 * C (parent = A, offset = 16)
1763 * D (parent = B, offset = 0) // B is not A or any of A's parents
1765 static bool binder_validate_fixup(struct binder_proc *proc,
1766 struct binder_buffer *b,
1767 binder_size_t objects_start_offset,
1768 binder_size_t buffer_obj_offset,
1769 binder_size_t fixup_offset,
1770 binder_size_t last_obj_offset,
1771 binder_size_t last_min_offset)
1773 if (!last_obj_offset) {
1774 /* Nothing to fix up in */
1778 while (last_obj_offset != buffer_obj_offset) {
1779 unsigned long buffer_offset;
1780 struct binder_object last_object;
1781 struct binder_buffer_object *last_bbo;
1782 size_t object_size = binder_get_object(proc, NULL, b,
1785 if (object_size != sizeof(*last_bbo))
1788 last_bbo = &last_object.bbo;
1790 * Safe to retrieve the parent of last_obj, since it
1791 * was already previously verified by the driver.
1793 if ((last_bbo->flags & BINDER_BUFFER_FLAG_HAS_PARENT) == 0)
1795 last_min_offset = last_bbo->parent_offset + sizeof(uintptr_t);
1796 buffer_offset = objects_start_offset +
1797 sizeof(binder_size_t) * last_bbo->parent;
1798 if (binder_alloc_copy_from_buffer(&proc->alloc,
1801 sizeof(last_obj_offset)))
1804 return (fixup_offset >= last_min_offset);
1808 * struct binder_task_work_cb - for deferred close
1810 * @twork: callback_head for task work
1813 * Structure to pass task work to be handled after
1814 * returning from binder_ioctl() via task_work_add().
1816 struct binder_task_work_cb {
1817 struct callback_head twork;
1822 * binder_do_fd_close() - close list of file descriptors
1823 * @twork: callback head for task work
1825 * It is not safe to call ksys_close() during the binder_ioctl()
1826 * function if there is a chance that binder's own file descriptor
1827 * might be closed. This is to meet the requirements for using
1828 * fdget() (see comments for __fget_light()). Therefore use
1829 * task_work_add() to schedule the close operation once we have
1830 * returned from binder_ioctl(). This function is a callback
1831 * for that mechanism and does the actual ksys_close() on the
1832 * given file descriptor.
1834 static void binder_do_fd_close(struct callback_head *twork)
1836 struct binder_task_work_cb *twcb = container_of(twork,
1837 struct binder_task_work_cb, twork);
1844 * binder_deferred_fd_close() - schedule a close for the given file-descriptor
1845 * @fd: file-descriptor to close
1847 * See comments in binder_do_fd_close(). This function is used to schedule
1848 * a file-descriptor to be closed after returning from binder_ioctl().
1850 static void binder_deferred_fd_close(int fd)
1852 struct binder_task_work_cb *twcb;
1854 twcb = kzalloc(sizeof(*twcb), GFP_KERNEL);
1857 init_task_work(&twcb->twork, binder_do_fd_close);
1858 close_fd_get_file(fd, &twcb->file);
1860 filp_close(twcb->file, current->files);
1861 task_work_add(current, &twcb->twork, TWA_RESUME);
1867 static void binder_transaction_buffer_release(struct binder_proc *proc,
1868 struct binder_thread *thread,
1869 struct binder_buffer *buffer,
1870 binder_size_t failed_at,
1873 int debug_id = buffer->debug_id;
1874 binder_size_t off_start_offset, buffer_offset, off_end_offset;
1876 binder_debug(BINDER_DEBUG_TRANSACTION,
1877 "%d buffer release %d, size %zd-%zd, failed at %llx\n",
1878 proc->pid, buffer->debug_id,
1879 buffer->data_size, buffer->offsets_size,
1880 (unsigned long long)failed_at);
1882 if (buffer->target_node)
1883 binder_dec_node(buffer->target_node, 1, 0);
1885 off_start_offset = ALIGN(buffer->data_size, sizeof(void *));
1886 off_end_offset = is_failure && failed_at ? failed_at :
1887 off_start_offset + buffer->offsets_size;
1888 for (buffer_offset = off_start_offset; buffer_offset < off_end_offset;
1889 buffer_offset += sizeof(binder_size_t)) {
1890 struct binder_object_header *hdr;
1891 size_t object_size = 0;
1892 struct binder_object object;
1893 binder_size_t object_offset;
1895 if (!binder_alloc_copy_from_buffer(&proc->alloc, &object_offset,
1896 buffer, buffer_offset,
1897 sizeof(object_offset)))
1898 object_size = binder_get_object(proc, NULL, buffer,
1899 object_offset, &object);
1900 if (object_size == 0) {
1901 pr_err("transaction release %d bad object at offset %lld, size %zd\n",
1902 debug_id, (u64)object_offset, buffer->data_size);
1906 switch (hdr->type) {
1907 case BINDER_TYPE_BINDER:
1908 case BINDER_TYPE_WEAK_BINDER: {
1909 struct flat_binder_object *fp;
1910 struct binder_node *node;
1912 fp = to_flat_binder_object(hdr);
1913 node = binder_get_node(proc, fp->binder);
1915 pr_err("transaction release %d bad node %016llx\n",
1916 debug_id, (u64)fp->binder);
1919 binder_debug(BINDER_DEBUG_TRANSACTION,
1920 " node %d u%016llx\n",
1921 node->debug_id, (u64)node->ptr);
1922 binder_dec_node(node, hdr->type == BINDER_TYPE_BINDER,
1924 binder_put_node(node);
1926 case BINDER_TYPE_HANDLE:
1927 case BINDER_TYPE_WEAK_HANDLE: {
1928 struct flat_binder_object *fp;
1929 struct binder_ref_data rdata;
1932 fp = to_flat_binder_object(hdr);
1933 ret = binder_dec_ref_for_handle(proc, fp->handle,
1934 hdr->type == BINDER_TYPE_HANDLE, &rdata);
1937 pr_err("transaction release %d bad handle %d, ret = %d\n",
1938 debug_id, fp->handle, ret);
1941 binder_debug(BINDER_DEBUG_TRANSACTION,
1942 " ref %d desc %d\n",
1943 rdata.debug_id, rdata.desc);
1946 case BINDER_TYPE_FD: {
1948 * No need to close the file here since user-space
1949 * closes it for successfully delivered
1950 * transactions. For transactions that weren't
1951 * delivered, the new fd was never allocated so
1952 * there is no need to close and the fput on the
1953 * file is done when the transaction is torn
1957 case BINDER_TYPE_PTR:
1959 * Nothing to do here, this will get cleaned up when the
1960 * transaction buffer gets freed
1963 case BINDER_TYPE_FDA: {
1964 struct binder_fd_array_object *fda;
1965 struct binder_buffer_object *parent;
1966 struct binder_object ptr_object;
1967 binder_size_t fda_offset;
1969 binder_size_t fd_buf_size;
1970 binder_size_t num_valid;
1974 * The fd fixups have not been applied so no
1975 * fds need to be closed.
1980 num_valid = (buffer_offset - off_start_offset) /
1981 sizeof(binder_size_t);
1982 fda = to_binder_fd_array_object(hdr);
1983 parent = binder_validate_ptr(proc, buffer, &ptr_object,
1989 pr_err("transaction release %d bad parent offset\n",
1993 fd_buf_size = sizeof(u32) * fda->num_fds;
1994 if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
1995 pr_err("transaction release %d invalid number of fds (%lld)\n",
1996 debug_id, (u64)fda->num_fds);
1999 if (fd_buf_size > parent->length ||
2000 fda->parent_offset > parent->length - fd_buf_size) {
2001 /* No space for all file descriptors here. */
2002 pr_err("transaction release %d not enough space for %lld fds in buffer\n",
2003 debug_id, (u64)fda->num_fds);
2007 * the source data for binder_buffer_object is visible
2008 * to user-space and the @buffer element is the user
2009 * pointer to the buffer_object containing the fd_array.
2010 * Convert the address to an offset relative to
2011 * the base of the transaction buffer.
2014 (parent->buffer - (uintptr_t)buffer->user_data) +
2016 for (fd_index = 0; fd_index < fda->num_fds;
2020 binder_size_t offset = fda_offset +
2021 fd_index * sizeof(fd);
2023 err = binder_alloc_copy_from_buffer(
2024 &proc->alloc, &fd, buffer,
2025 offset, sizeof(fd));
2028 binder_deferred_fd_close(fd);
2030 * Need to make sure the thread goes
2031 * back to userspace to complete the
2035 thread->looper_need_return = true;
2040 pr_err("transaction release %d bad object type %x\n",
2041 debug_id, hdr->type);
2047 static int binder_translate_binder(struct flat_binder_object *fp,
2048 struct binder_transaction *t,
2049 struct binder_thread *thread)
2051 struct binder_node *node;
2052 struct binder_proc *proc = thread->proc;
2053 struct binder_proc *target_proc = t->to_proc;
2054 struct binder_ref_data rdata;
2057 node = binder_get_node(proc, fp->binder);
2059 node = binder_new_node(proc, fp);
2063 if (fp->cookie != node->cookie) {
2064 binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
2065 proc->pid, thread->pid, (u64)fp->binder,
2066 node->debug_id, (u64)fp->cookie,
2071 if (security_binder_transfer_binder(proc->cred, target_proc->cred)) {
2076 ret = binder_inc_ref_for_node(target_proc, node,
2077 fp->hdr.type == BINDER_TYPE_BINDER,
2078 &thread->todo, &rdata);
2082 if (fp->hdr.type == BINDER_TYPE_BINDER)
2083 fp->hdr.type = BINDER_TYPE_HANDLE;
2085 fp->hdr.type = BINDER_TYPE_WEAK_HANDLE;
2087 fp->handle = rdata.desc;
2090 trace_binder_transaction_node_to_ref(t, node, &rdata);
2091 binder_debug(BINDER_DEBUG_TRANSACTION,
2092 " node %d u%016llx -> ref %d desc %d\n",
2093 node->debug_id, (u64)node->ptr,
2094 rdata.debug_id, rdata.desc);
2096 binder_put_node(node);
2100 static int binder_translate_handle(struct flat_binder_object *fp,
2101 struct binder_transaction *t,
2102 struct binder_thread *thread)
2104 struct binder_proc *proc = thread->proc;
2105 struct binder_proc *target_proc = t->to_proc;
2106 struct binder_node *node;
2107 struct binder_ref_data src_rdata;
2110 node = binder_get_node_from_ref(proc, fp->handle,
2111 fp->hdr.type == BINDER_TYPE_HANDLE, &src_rdata);
2113 binder_user_error("%d:%d got transaction with invalid handle, %d\n",
2114 proc->pid, thread->pid, fp->handle);
2117 if (security_binder_transfer_binder(proc->cred, target_proc->cred)) {
2122 binder_node_lock(node);
2123 if (node->proc == target_proc) {
2124 if (fp->hdr.type == BINDER_TYPE_HANDLE)
2125 fp->hdr.type = BINDER_TYPE_BINDER;
2127 fp->hdr.type = BINDER_TYPE_WEAK_BINDER;
2128 fp->binder = node->ptr;
2129 fp->cookie = node->cookie;
2131 binder_inner_proc_lock(node->proc);
2133 __acquire(&node->proc->inner_lock);
2134 binder_inc_node_nilocked(node,
2135 fp->hdr.type == BINDER_TYPE_BINDER,
2138 binder_inner_proc_unlock(node->proc);
2140 __release(&node->proc->inner_lock);
2141 trace_binder_transaction_ref_to_node(t, node, &src_rdata);
2142 binder_debug(BINDER_DEBUG_TRANSACTION,
2143 " ref %d desc %d -> node %d u%016llx\n",
2144 src_rdata.debug_id, src_rdata.desc, node->debug_id,
2146 binder_node_unlock(node);
2148 struct binder_ref_data dest_rdata;
2150 binder_node_unlock(node);
2151 ret = binder_inc_ref_for_node(target_proc, node,
2152 fp->hdr.type == BINDER_TYPE_HANDLE,
2158 fp->handle = dest_rdata.desc;
2160 trace_binder_transaction_ref_to_ref(t, node, &src_rdata,
2162 binder_debug(BINDER_DEBUG_TRANSACTION,
2163 " ref %d desc %d -> ref %d desc %d (node %d)\n",
2164 src_rdata.debug_id, src_rdata.desc,
2165 dest_rdata.debug_id, dest_rdata.desc,
2169 binder_put_node(node);
2173 static int binder_translate_fd(u32 fd, binder_size_t fd_offset,
2174 struct binder_transaction *t,
2175 struct binder_thread *thread,
2176 struct binder_transaction *in_reply_to)
2178 struct binder_proc *proc = thread->proc;
2179 struct binder_proc *target_proc = t->to_proc;
2180 struct binder_txn_fd_fixup *fixup;
2183 bool target_allows_fd;
2186 target_allows_fd = !!(in_reply_to->flags & TF_ACCEPT_FDS);
2188 target_allows_fd = t->buffer->target_node->accept_fds;
2189 if (!target_allows_fd) {
2190 binder_user_error("%d:%d got %s with fd, %d, but target does not allow fds\n",
2191 proc->pid, thread->pid,
2192 in_reply_to ? "reply" : "transaction",
2195 goto err_fd_not_accepted;
2200 binder_user_error("%d:%d got transaction with invalid fd, %d\n",
2201 proc->pid, thread->pid, fd);
2205 ret = security_binder_transfer_file(proc->cred, target_proc->cred, file);
2212 * Add fixup record for this transaction. The allocation
2213 * of the fd in the target needs to be done from a
2216 fixup = kzalloc(sizeof(*fixup), GFP_KERNEL);
2222 fixup->offset = fd_offset;
2223 trace_binder_transaction_fd_send(t, fd, fixup->offset);
2224 list_add_tail(&fixup->fixup_entry, &t->fd_fixups);
2232 err_fd_not_accepted:
2237 * struct binder_ptr_fixup - data to be fixed-up in target buffer
2238 * @offset offset in target buffer to fixup
2239 * @skip_size bytes to skip in copy (fixup will be written later)
2240 * @fixup_data data to write at fixup offset
2243 * This is used for the pointer fixup list (pf) which is created and consumed
2244 * during binder_transaction() and is only accessed locally. No
2245 * locking is necessary.
2247 * The list is ordered by @offset.
2249 struct binder_ptr_fixup {
2250 binder_size_t offset;
2252 binder_uintptr_t fixup_data;
2253 struct list_head node;
2257 * struct binder_sg_copy - scatter-gather data to be copied
2258 * @offset offset in target buffer
2259 * @sender_uaddr user address in source buffer
2260 * @length bytes to copy
2263 * This is used for the sg copy list (sgc) which is created and consumed
2264 * during binder_transaction() and is only accessed locally. No
2265 * locking is necessary.
2267 * The list is ordered by @offset.
2269 struct binder_sg_copy {
2270 binder_size_t offset;
2271 const void __user *sender_uaddr;
2273 struct list_head node;
2277 * binder_do_deferred_txn_copies() - copy and fixup scatter-gather data
2278 * @alloc: binder_alloc associated with @buffer
2279 * @buffer: binder buffer in target process
2280 * @sgc_head: list_head of scatter-gather copy list
2281 * @pf_head: list_head of pointer fixup list
2283 * Processes all elements of @sgc_head, applying fixups from @pf_head
2284 * and copying the scatter-gather data from the source process' user
2285 * buffer to the target's buffer. It is expected that the list creation
2286 * and processing all occurs during binder_transaction() so these lists
2287 * are only accessed in local context.
2289 * Return: 0=success, else -errno
2291 static int binder_do_deferred_txn_copies(struct binder_alloc *alloc,
2292 struct binder_buffer *buffer,
2293 struct list_head *sgc_head,
2294 struct list_head *pf_head)
2297 struct binder_sg_copy *sgc, *tmpsgc;
2298 struct binder_ptr_fixup *tmppf;
2299 struct binder_ptr_fixup *pf =
2300 list_first_entry_or_null(pf_head, struct binder_ptr_fixup,
2303 list_for_each_entry_safe(sgc, tmpsgc, sgc_head, node) {
2304 size_t bytes_copied = 0;
2306 while (bytes_copied < sgc->length) {
2308 size_t bytes_left = sgc->length - bytes_copied;
2309 size_t offset = sgc->offset + bytes_copied;
2312 * We copy up to the fixup (pointed to by pf)
2314 copy_size = pf ? min(bytes_left, (size_t)pf->offset - offset)
2316 if (!ret && copy_size)
2317 ret = binder_alloc_copy_user_to_buffer(
2320 sgc->sender_uaddr + bytes_copied,
2322 bytes_copied += copy_size;
2323 if (copy_size != bytes_left) {
2325 /* we stopped at a fixup offset */
2326 if (pf->skip_size) {
2328 * we are just skipping. This is for
2329 * BINDER_TYPE_FDA where the translated
2330 * fds will be fixed up when we get
2331 * to target context.
2333 bytes_copied += pf->skip_size;
2335 /* apply the fixup indicated by pf */
2337 ret = binder_alloc_copy_to_buffer(
2341 sizeof(pf->fixup_data));
2342 bytes_copied += sizeof(pf->fixup_data);
2344 list_del(&pf->node);
2346 pf = list_first_entry_or_null(pf_head,
2347 struct binder_ptr_fixup, node);
2350 list_del(&sgc->node);
2353 list_for_each_entry_safe(pf, tmppf, pf_head, node) {
2354 BUG_ON(pf->skip_size == 0);
2355 list_del(&pf->node);
2358 BUG_ON(!list_empty(sgc_head));
2360 return ret > 0 ? -EINVAL : ret;
2364 * binder_cleanup_deferred_txn_lists() - free specified lists
2365 * @sgc_head: list_head of scatter-gather copy list
2366 * @pf_head: list_head of pointer fixup list
2368 * Called to clean up @sgc_head and @pf_head if there is an
2371 static void binder_cleanup_deferred_txn_lists(struct list_head *sgc_head,
2372 struct list_head *pf_head)
2374 struct binder_sg_copy *sgc, *tmpsgc;
2375 struct binder_ptr_fixup *pf, *tmppf;
2377 list_for_each_entry_safe(sgc, tmpsgc, sgc_head, node) {
2378 list_del(&sgc->node);
2381 list_for_each_entry_safe(pf, tmppf, pf_head, node) {
2382 list_del(&pf->node);
2388 * binder_defer_copy() - queue a scatter-gather buffer for copy
2389 * @sgc_head: list_head of scatter-gather copy list
2390 * @offset: binder buffer offset in target process
2391 * @sender_uaddr: user address in source process
2392 * @length: bytes to copy
2394 * Specify a scatter-gather block to be copied. The actual copy must
2395 * be deferred until all the needed fixups are identified and queued.
2396 * Then the copy and fixups are done together so un-translated values
2397 * from the source are never visible in the target buffer.
2399 * We are guaranteed that repeated calls to this function will have
2400 * monotonically increasing @offset values so the list will naturally
2403 * Return: 0=success, else -errno
2405 static int binder_defer_copy(struct list_head *sgc_head, binder_size_t offset,
2406 const void __user *sender_uaddr, size_t length)
2408 struct binder_sg_copy *bc = kzalloc(sizeof(*bc), GFP_KERNEL);
2413 bc->offset = offset;
2414 bc->sender_uaddr = sender_uaddr;
2415 bc->length = length;
2416 INIT_LIST_HEAD(&bc->node);
2419 * We are guaranteed that the deferred copies are in-order
2420 * so just add to the tail.
2422 list_add_tail(&bc->node, sgc_head);
2428 * binder_add_fixup() - queue a fixup to be applied to sg copy
2429 * @pf_head: list_head of binder ptr fixup list
2430 * @offset: binder buffer offset in target process
2431 * @fixup: bytes to be copied for fixup
2432 * @skip_size: bytes to skip when copying (fixup will be applied later)
2434 * Add the specified fixup to a list ordered by @offset. When copying
2435 * the scatter-gather buffers, the fixup will be copied instead of
2436 * data from the source buffer. For BINDER_TYPE_FDA fixups, the fixup
2437 * will be applied later (in target process context), so we just skip
2438 * the bytes specified by @skip_size. If @skip_size is 0, we copy the
2441 * This function is called *mostly* in @offset order, but there are
2442 * exceptions. Since out-of-order inserts are relatively uncommon,
2443 * we insert the new element by searching backward from the tail of
2446 * Return: 0=success, else -errno
2448 static int binder_add_fixup(struct list_head *pf_head, binder_size_t offset,
2449 binder_uintptr_t fixup, size_t skip_size)
2451 struct binder_ptr_fixup *pf = kzalloc(sizeof(*pf), GFP_KERNEL);
2452 struct binder_ptr_fixup *tmppf;
2457 pf->offset = offset;
2458 pf->fixup_data = fixup;
2459 pf->skip_size = skip_size;
2460 INIT_LIST_HEAD(&pf->node);
2462 /* Fixups are *mostly* added in-order, but there are some
2463 * exceptions. Look backwards through list for insertion point.
2465 list_for_each_entry_reverse(tmppf, pf_head, node) {
2466 if (tmppf->offset < pf->offset) {
2467 list_add(&pf->node, &tmppf->node);
2472 * if we get here, then the new offset is the lowest so
2473 * insert at the head
2475 list_add(&pf->node, pf_head);
2479 static int binder_translate_fd_array(struct list_head *pf_head,
2480 struct binder_fd_array_object *fda,
2481 const void __user *sender_ubuffer,
2482 struct binder_buffer_object *parent,
2483 struct binder_buffer_object *sender_uparent,
2484 struct binder_transaction *t,
2485 struct binder_thread *thread,
2486 struct binder_transaction *in_reply_to)
2488 binder_size_t fdi, fd_buf_size;
2489 binder_size_t fda_offset;
2490 const void __user *sender_ufda_base;
2491 struct binder_proc *proc = thread->proc;
2494 if (fda->num_fds == 0)
2497 fd_buf_size = sizeof(u32) * fda->num_fds;
2498 if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
2499 binder_user_error("%d:%d got transaction with invalid number of fds (%lld)\n",
2500 proc->pid, thread->pid, (u64)fda->num_fds);
2503 if (fd_buf_size > parent->length ||
2504 fda->parent_offset > parent->length - fd_buf_size) {
2505 /* No space for all file descriptors here. */
2506 binder_user_error("%d:%d not enough space to store %lld fds in buffer\n",
2507 proc->pid, thread->pid, (u64)fda->num_fds);
2511 * the source data for binder_buffer_object is visible
2512 * to user-space and the @buffer element is the user
2513 * pointer to the buffer_object containing the fd_array.
2514 * Convert the address to an offset relative to
2515 * the base of the transaction buffer.
2517 fda_offset = (parent->buffer - (uintptr_t)t->buffer->user_data) +
2519 sender_ufda_base = (void __user *)(uintptr_t)sender_uparent->buffer +
2522 if (!IS_ALIGNED((unsigned long)fda_offset, sizeof(u32)) ||
2523 !IS_ALIGNED((unsigned long)sender_ufda_base, sizeof(u32))) {
2524 binder_user_error("%d:%d parent offset not aligned correctly.\n",
2525 proc->pid, thread->pid);
2528 ret = binder_add_fixup(pf_head, fda_offset, 0, fda->num_fds * sizeof(u32));
2532 for (fdi = 0; fdi < fda->num_fds; fdi++) {
2534 binder_size_t offset = fda_offset + fdi * sizeof(fd);
2535 binder_size_t sender_uoffset = fdi * sizeof(fd);
2537 ret = copy_from_user(&fd, sender_ufda_base + sender_uoffset, sizeof(fd));
2539 ret = binder_translate_fd(fd, offset, t, thread,
2542 return ret > 0 ? -EINVAL : ret;
2547 static int binder_fixup_parent(struct list_head *pf_head,
2548 struct binder_transaction *t,
2549 struct binder_thread *thread,
2550 struct binder_buffer_object *bp,
2551 binder_size_t off_start_offset,
2552 binder_size_t num_valid,
2553 binder_size_t last_fixup_obj_off,
2554 binder_size_t last_fixup_min_off)
2556 struct binder_buffer_object *parent;
2557 struct binder_buffer *b = t->buffer;
2558 struct binder_proc *proc = thread->proc;
2559 struct binder_proc *target_proc = t->to_proc;
2560 struct binder_object object;
2561 binder_size_t buffer_offset;
2562 binder_size_t parent_offset;
2564 if (!(bp->flags & BINDER_BUFFER_FLAG_HAS_PARENT))
2567 parent = binder_validate_ptr(target_proc, b, &object, bp->parent,
2568 off_start_offset, &parent_offset,
2571 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2572 proc->pid, thread->pid);
2576 if (!binder_validate_fixup(target_proc, b, off_start_offset,
2577 parent_offset, bp->parent_offset,
2579 last_fixup_min_off)) {
2580 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
2581 proc->pid, thread->pid);
2585 if (parent->length < sizeof(binder_uintptr_t) ||
2586 bp->parent_offset > parent->length - sizeof(binder_uintptr_t)) {
2587 /* No space for a pointer here! */
2588 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2589 proc->pid, thread->pid);
2592 buffer_offset = bp->parent_offset +
2593 (uintptr_t)parent->buffer - (uintptr_t)b->user_data;
2594 return binder_add_fixup(pf_head, buffer_offset, bp->buffer, 0);
2598 * binder_proc_transaction() - sends a transaction to a process and wakes it up
2599 * @t: transaction to send
2600 * @proc: process to send the transaction to
2601 * @thread: thread in @proc to send the transaction to (may be NULL)
2603 * This function queues a transaction to the specified process. It will try
2604 * to find a thread in the target process to handle the transaction and
2605 * wake it up. If no thread is found, the work is queued to the proc
2608 * If the @thread parameter is not NULL, the transaction is always queued
2609 * to the waitlist of that specific thread.
2611 * Return: 0 if the transaction was successfully queued
2612 * BR_DEAD_REPLY if the target process or thread is dead
2613 * BR_FROZEN_REPLY if the target process or thread is frozen
2615 static int binder_proc_transaction(struct binder_transaction *t,
2616 struct binder_proc *proc,
2617 struct binder_thread *thread)
2619 struct binder_node *node = t->buffer->target_node;
2620 bool oneway = !!(t->flags & TF_ONE_WAY);
2621 bool pending_async = false;
2624 binder_node_lock(node);
2627 if (node->has_async_transaction)
2628 pending_async = true;
2630 node->has_async_transaction = true;
2633 binder_inner_proc_lock(proc);
2634 if (proc->is_frozen) {
2635 proc->sync_recv |= !oneway;
2636 proc->async_recv |= oneway;
2639 if ((proc->is_frozen && !oneway) || proc->is_dead ||
2640 (thread && thread->is_dead)) {
2641 binder_inner_proc_unlock(proc);
2642 binder_node_unlock(node);
2643 return proc->is_frozen ? BR_FROZEN_REPLY : BR_DEAD_REPLY;
2646 if (!thread && !pending_async)
2647 thread = binder_select_thread_ilocked(proc);
2650 binder_enqueue_thread_work_ilocked(thread, &t->work);
2651 else if (!pending_async)
2652 binder_enqueue_work_ilocked(&t->work, &proc->todo);
2654 binder_enqueue_work_ilocked(&t->work, &node->async_todo);
2657 binder_wakeup_thread_ilocked(proc, thread, !oneway /* sync */);
2659 proc->outstanding_txns++;
2660 binder_inner_proc_unlock(proc);
2661 binder_node_unlock(node);
2667 * binder_get_node_refs_for_txn() - Get required refs on node for txn
2668 * @node: struct binder_node for which to get refs
2669 * @proc: returns @node->proc if valid
2670 * @error: if no @proc then returns BR_DEAD_REPLY
2672 * User-space normally keeps the node alive when creating a transaction
2673 * since it has a reference to the target. The local strong ref keeps it
2674 * alive if the sending process dies before the target process processes
2675 * the transaction. If the source process is malicious or has a reference
2676 * counting bug, relying on the local strong ref can fail.
2678 * Since user-space can cause the local strong ref to go away, we also take
2679 * a tmpref on the node to ensure it survives while we are constructing
2680 * the transaction. We also need a tmpref on the proc while we are
2681 * constructing the transaction, so we take that here as well.
2683 * Return: The target_node with refs taken or NULL if no @node->proc is NULL.
2684 * Also sets @proc if valid. If the @node->proc is NULL indicating that the
2685 * target proc has died, @error is set to BR_DEAD_REPLY
2687 static struct binder_node *binder_get_node_refs_for_txn(
2688 struct binder_node *node,
2689 struct binder_proc **procp,
2692 struct binder_node *target_node = NULL;
2694 binder_node_inner_lock(node);
2697 binder_inc_node_nilocked(node, 1, 0, NULL);
2698 binder_inc_node_tmpref_ilocked(node);
2699 node->proc->tmp_ref++;
2700 *procp = node->proc;
2702 *error = BR_DEAD_REPLY;
2703 binder_node_inner_unlock(node);
2708 static void binder_transaction(struct binder_proc *proc,
2709 struct binder_thread *thread,
2710 struct binder_transaction_data *tr, int reply,
2711 binder_size_t extra_buffers_size)
2714 struct binder_transaction *t;
2715 struct binder_work *w;
2716 struct binder_work *tcomplete;
2717 binder_size_t buffer_offset = 0;
2718 binder_size_t off_start_offset, off_end_offset;
2719 binder_size_t off_min;
2720 binder_size_t sg_buf_offset, sg_buf_end_offset;
2721 binder_size_t user_offset = 0;
2722 struct binder_proc *target_proc = NULL;
2723 struct binder_thread *target_thread = NULL;
2724 struct binder_node *target_node = NULL;
2725 struct binder_transaction *in_reply_to = NULL;
2726 struct binder_transaction_log_entry *e;
2727 uint32_t return_error = 0;
2728 uint32_t return_error_param = 0;
2729 uint32_t return_error_line = 0;
2730 binder_size_t last_fixup_obj_off = 0;
2731 binder_size_t last_fixup_min_off = 0;
2732 struct binder_context *context = proc->context;
2733 int t_debug_id = atomic_inc_return(&binder_last_id);
2734 char *secctx = NULL;
2736 struct list_head sgc_head;
2737 struct list_head pf_head;
2738 const void __user *user_buffer = (const void __user *)
2739 (uintptr_t)tr->data.ptr.buffer;
2740 INIT_LIST_HEAD(&sgc_head);
2741 INIT_LIST_HEAD(&pf_head);
2743 e = binder_transaction_log_add(&binder_transaction_log);
2744 e->debug_id = t_debug_id;
2745 e->call_type = reply ? 2 : !!(tr->flags & TF_ONE_WAY);
2746 e->from_proc = proc->pid;
2747 e->from_thread = thread->pid;
2748 e->target_handle = tr->target.handle;
2749 e->data_size = tr->data_size;
2750 e->offsets_size = tr->offsets_size;
2751 strscpy(e->context_name, proc->context->name, BINDERFS_MAX_NAME);
2754 binder_inner_proc_lock(proc);
2755 in_reply_to = thread->transaction_stack;
2756 if (in_reply_to == NULL) {
2757 binder_inner_proc_unlock(proc);
2758 binder_user_error("%d:%d got reply transaction with no transaction stack\n",
2759 proc->pid, thread->pid);
2760 return_error = BR_FAILED_REPLY;
2761 return_error_param = -EPROTO;
2762 return_error_line = __LINE__;
2763 goto err_empty_call_stack;
2765 if (in_reply_to->to_thread != thread) {
2766 spin_lock(&in_reply_to->lock);
2767 binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
2768 proc->pid, thread->pid, in_reply_to->debug_id,
2769 in_reply_to->to_proc ?
2770 in_reply_to->to_proc->pid : 0,
2771 in_reply_to->to_thread ?
2772 in_reply_to->to_thread->pid : 0);
2773 spin_unlock(&in_reply_to->lock);
2774 binder_inner_proc_unlock(proc);
2775 return_error = BR_FAILED_REPLY;
2776 return_error_param = -EPROTO;
2777 return_error_line = __LINE__;
2779 goto err_bad_call_stack;
2781 thread->transaction_stack = in_reply_to->to_parent;
2782 binder_inner_proc_unlock(proc);
2783 binder_set_nice(in_reply_to->saved_priority);
2784 target_thread = binder_get_txn_from_and_acq_inner(in_reply_to);
2785 if (target_thread == NULL) {
2786 /* annotation for sparse */
2787 __release(&target_thread->proc->inner_lock);
2788 return_error = BR_DEAD_REPLY;
2789 return_error_line = __LINE__;
2790 goto err_dead_binder;
2792 if (target_thread->transaction_stack != in_reply_to) {
2793 binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
2794 proc->pid, thread->pid,
2795 target_thread->transaction_stack ?
2796 target_thread->transaction_stack->debug_id : 0,
2797 in_reply_to->debug_id);
2798 binder_inner_proc_unlock(target_thread->proc);
2799 return_error = BR_FAILED_REPLY;
2800 return_error_param = -EPROTO;
2801 return_error_line = __LINE__;
2803 target_thread = NULL;
2804 goto err_dead_binder;
2806 target_proc = target_thread->proc;
2807 target_proc->tmp_ref++;
2808 binder_inner_proc_unlock(target_thread->proc);
2810 if (tr->target.handle) {
2811 struct binder_ref *ref;
2814 * There must already be a strong ref
2815 * on this node. If so, do a strong
2816 * increment on the node to ensure it
2817 * stays alive until the transaction is
2820 binder_proc_lock(proc);
2821 ref = binder_get_ref_olocked(proc, tr->target.handle,
2824 target_node = binder_get_node_refs_for_txn(
2825 ref->node, &target_proc,
2828 binder_user_error("%d:%d got transaction to invalid handle, %u\n",
2829 proc->pid, thread->pid, tr->target.handle);
2830 return_error = BR_FAILED_REPLY;
2832 binder_proc_unlock(proc);
2834 mutex_lock(&context->context_mgr_node_lock);
2835 target_node = context->binder_context_mgr_node;
2837 target_node = binder_get_node_refs_for_txn(
2838 target_node, &target_proc,
2841 return_error = BR_DEAD_REPLY;
2842 mutex_unlock(&context->context_mgr_node_lock);
2843 if (target_node && target_proc->pid == proc->pid) {
2844 binder_user_error("%d:%d got transaction to context manager from process owning it\n",
2845 proc->pid, thread->pid);
2846 return_error = BR_FAILED_REPLY;
2847 return_error_param = -EINVAL;
2848 return_error_line = __LINE__;
2849 goto err_invalid_target_handle;
2854 * return_error is set above
2856 return_error_param = -EINVAL;
2857 return_error_line = __LINE__;
2858 goto err_dead_binder;
2860 e->to_node = target_node->debug_id;
2861 if (WARN_ON(proc == target_proc)) {
2862 return_error = BR_FAILED_REPLY;
2863 return_error_param = -EINVAL;
2864 return_error_line = __LINE__;
2865 goto err_invalid_target_handle;
2867 if (security_binder_transaction(proc->cred,
2868 target_proc->cred) < 0) {
2869 return_error = BR_FAILED_REPLY;
2870 return_error_param = -EPERM;
2871 return_error_line = __LINE__;
2872 goto err_invalid_target_handle;
2874 binder_inner_proc_lock(proc);
2876 w = list_first_entry_or_null(&thread->todo,
2877 struct binder_work, entry);
2878 if (!(tr->flags & TF_ONE_WAY) && w &&
2879 w->type == BINDER_WORK_TRANSACTION) {
2881 * Do not allow new outgoing transaction from a
2882 * thread that has a transaction at the head of
2883 * its todo list. Only need to check the head
2884 * because binder_select_thread_ilocked picks a
2885 * thread from proc->waiting_threads to enqueue
2886 * the transaction, and nothing is queued to the
2887 * todo list while the thread is on waiting_threads.
2889 binder_user_error("%d:%d new transaction not allowed when there is a transaction on thread todo\n",
2890 proc->pid, thread->pid);
2891 binder_inner_proc_unlock(proc);
2892 return_error = BR_FAILED_REPLY;
2893 return_error_param = -EPROTO;
2894 return_error_line = __LINE__;
2895 goto err_bad_todo_list;
2898 if (!(tr->flags & TF_ONE_WAY) && thread->transaction_stack) {
2899 struct binder_transaction *tmp;
2901 tmp = thread->transaction_stack;
2902 if (tmp->to_thread != thread) {
2903 spin_lock(&tmp->lock);
2904 binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
2905 proc->pid, thread->pid, tmp->debug_id,
2906 tmp->to_proc ? tmp->to_proc->pid : 0,
2908 tmp->to_thread->pid : 0);
2909 spin_unlock(&tmp->lock);
2910 binder_inner_proc_unlock(proc);
2911 return_error = BR_FAILED_REPLY;
2912 return_error_param = -EPROTO;
2913 return_error_line = __LINE__;
2914 goto err_bad_call_stack;
2917 struct binder_thread *from;
2919 spin_lock(&tmp->lock);
2921 if (from && from->proc == target_proc) {
2922 atomic_inc(&from->tmp_ref);
2923 target_thread = from;
2924 spin_unlock(&tmp->lock);
2927 spin_unlock(&tmp->lock);
2928 tmp = tmp->from_parent;
2931 binder_inner_proc_unlock(proc);
2934 e->to_thread = target_thread->pid;
2935 e->to_proc = target_proc->pid;
2937 /* TODO: reuse incoming transaction for reply */
2938 t = kzalloc(sizeof(*t), GFP_KERNEL);
2940 return_error = BR_FAILED_REPLY;
2941 return_error_param = -ENOMEM;
2942 return_error_line = __LINE__;
2943 goto err_alloc_t_failed;
2945 INIT_LIST_HEAD(&t->fd_fixups);
2946 binder_stats_created(BINDER_STAT_TRANSACTION);
2947 spin_lock_init(&t->lock);
2949 tcomplete = kzalloc(sizeof(*tcomplete), GFP_KERNEL);
2950 if (tcomplete == NULL) {
2951 return_error = BR_FAILED_REPLY;
2952 return_error_param = -ENOMEM;
2953 return_error_line = __LINE__;
2954 goto err_alloc_tcomplete_failed;
2956 binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE);
2958 t->debug_id = t_debug_id;
2961 binder_debug(BINDER_DEBUG_TRANSACTION,
2962 "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld-%lld\n",
2963 proc->pid, thread->pid, t->debug_id,
2964 target_proc->pid, target_thread->pid,
2965 (u64)tr->data.ptr.buffer,
2966 (u64)tr->data.ptr.offsets,
2967 (u64)tr->data_size, (u64)tr->offsets_size,
2968 (u64)extra_buffers_size);
2970 binder_debug(BINDER_DEBUG_TRANSACTION,
2971 "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld-%lld\n",
2972 proc->pid, thread->pid, t->debug_id,
2973 target_proc->pid, target_node->debug_id,
2974 (u64)tr->data.ptr.buffer,
2975 (u64)tr->data.ptr.offsets,
2976 (u64)tr->data_size, (u64)tr->offsets_size,
2977 (u64)extra_buffers_size);
2979 if (!reply && !(tr->flags & TF_ONE_WAY))
2983 t->sender_euid = task_euid(proc->tsk);
2984 t->to_proc = target_proc;
2985 t->to_thread = target_thread;
2987 t->flags = tr->flags;
2988 t->priority = task_nice(current);
2990 if (target_node && target_node->txn_security_ctx) {
2994 security_cred_getsecid(proc->cred, &secid);
2995 ret = security_secid_to_secctx(secid, &secctx, &secctx_sz);
2997 return_error = BR_FAILED_REPLY;
2998 return_error_param = ret;
2999 return_error_line = __LINE__;
3000 goto err_get_secctx_failed;
3002 added_size = ALIGN(secctx_sz, sizeof(u64));
3003 extra_buffers_size += added_size;
3004 if (extra_buffers_size < added_size) {
3005 /* integer overflow of extra_buffers_size */
3006 return_error = BR_FAILED_REPLY;
3007 return_error_param = -EINVAL;
3008 return_error_line = __LINE__;
3009 goto err_bad_extra_size;
3013 trace_binder_transaction(reply, t, target_node);
3015 t->buffer = binder_alloc_new_buf(&target_proc->alloc, tr->data_size,
3016 tr->offsets_size, extra_buffers_size,
3017 !reply && (t->flags & TF_ONE_WAY), current->tgid);
3018 if (IS_ERR(t->buffer)) {
3020 * -ESRCH indicates VMA cleared. The target is dying.
3022 return_error_param = PTR_ERR(t->buffer);
3023 return_error = return_error_param == -ESRCH ?
3024 BR_DEAD_REPLY : BR_FAILED_REPLY;
3025 return_error_line = __LINE__;
3027 goto err_binder_alloc_buf_failed;
3031 size_t buf_offset = ALIGN(tr->data_size, sizeof(void *)) +
3032 ALIGN(tr->offsets_size, sizeof(void *)) +
3033 ALIGN(extra_buffers_size, sizeof(void *)) -
3034 ALIGN(secctx_sz, sizeof(u64));
3036 t->security_ctx = (uintptr_t)t->buffer->user_data + buf_offset;
3037 err = binder_alloc_copy_to_buffer(&target_proc->alloc,
3038 t->buffer, buf_offset,
3041 t->security_ctx = 0;
3044 security_release_secctx(secctx, secctx_sz);
3047 t->buffer->debug_id = t->debug_id;
3048 t->buffer->transaction = t;
3049 t->buffer->target_node = target_node;
3050 t->buffer->clear_on_free = !!(t->flags & TF_CLEAR_BUF);
3051 trace_binder_transaction_alloc_buf(t->buffer);
3053 if (binder_alloc_copy_user_to_buffer(
3054 &target_proc->alloc,
3056 ALIGN(tr->data_size, sizeof(void *)),
3057 (const void __user *)
3058 (uintptr_t)tr->data.ptr.offsets,
3059 tr->offsets_size)) {
3060 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
3061 proc->pid, thread->pid);
3062 return_error = BR_FAILED_REPLY;
3063 return_error_param = -EFAULT;
3064 return_error_line = __LINE__;
3065 goto err_copy_data_failed;
3067 if (!IS_ALIGNED(tr->offsets_size, sizeof(binder_size_t))) {
3068 binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
3069 proc->pid, thread->pid, (u64)tr->offsets_size);
3070 return_error = BR_FAILED_REPLY;
3071 return_error_param = -EINVAL;
3072 return_error_line = __LINE__;
3073 goto err_bad_offset;
3075 if (!IS_ALIGNED(extra_buffers_size, sizeof(u64))) {
3076 binder_user_error("%d:%d got transaction with unaligned buffers size, %lld\n",
3077 proc->pid, thread->pid,
3078 (u64)extra_buffers_size);
3079 return_error = BR_FAILED_REPLY;
3080 return_error_param = -EINVAL;
3081 return_error_line = __LINE__;
3082 goto err_bad_offset;
3084 off_start_offset = ALIGN(tr->data_size, sizeof(void *));
3085 buffer_offset = off_start_offset;
3086 off_end_offset = off_start_offset + tr->offsets_size;
3087 sg_buf_offset = ALIGN(off_end_offset, sizeof(void *));
3088 sg_buf_end_offset = sg_buf_offset + extra_buffers_size -
3089 ALIGN(secctx_sz, sizeof(u64));
3091 for (buffer_offset = off_start_offset; buffer_offset < off_end_offset;
3092 buffer_offset += sizeof(binder_size_t)) {
3093 struct binder_object_header *hdr;
3095 struct binder_object object;
3096 binder_size_t object_offset;
3097 binder_size_t copy_size;
3099 if (binder_alloc_copy_from_buffer(&target_proc->alloc,
3103 sizeof(object_offset))) {
3104 return_error = BR_FAILED_REPLY;
3105 return_error_param = -EINVAL;
3106 return_error_line = __LINE__;
3107 goto err_bad_offset;
3111 * Copy the source user buffer up to the next object
3112 * that will be processed.
3114 copy_size = object_offset - user_offset;
3115 if (copy_size && (user_offset > object_offset ||
3116 binder_alloc_copy_user_to_buffer(
3117 &target_proc->alloc,
3118 t->buffer, user_offset,
3119 user_buffer + user_offset,
3121 binder_user_error("%d:%d got transaction with invalid data ptr\n",
3122 proc->pid, thread->pid);
3123 return_error = BR_FAILED_REPLY;
3124 return_error_param = -EFAULT;
3125 return_error_line = __LINE__;
3126 goto err_copy_data_failed;
3128 object_size = binder_get_object(target_proc, user_buffer,
3129 t->buffer, object_offset, &object);
3130 if (object_size == 0 || object_offset < off_min) {
3131 binder_user_error("%d:%d got transaction with invalid offset (%lld, min %lld max %lld) or object.\n",
3132 proc->pid, thread->pid,
3135 (u64)t->buffer->data_size);
3136 return_error = BR_FAILED_REPLY;
3137 return_error_param = -EINVAL;
3138 return_error_line = __LINE__;
3139 goto err_bad_offset;
3142 * Set offset to the next buffer fragment to be
3145 user_offset = object_offset + object_size;
3148 off_min = object_offset + object_size;
3149 switch (hdr->type) {
3150 case BINDER_TYPE_BINDER:
3151 case BINDER_TYPE_WEAK_BINDER: {
3152 struct flat_binder_object *fp;
3154 fp = to_flat_binder_object(hdr);
3155 ret = binder_translate_binder(fp, t, thread);
3158 binder_alloc_copy_to_buffer(&target_proc->alloc,
3162 return_error = BR_FAILED_REPLY;
3163 return_error_param = ret;
3164 return_error_line = __LINE__;
3165 goto err_translate_failed;
3168 case BINDER_TYPE_HANDLE:
3169 case BINDER_TYPE_WEAK_HANDLE: {
3170 struct flat_binder_object *fp;
3172 fp = to_flat_binder_object(hdr);
3173 ret = binder_translate_handle(fp, t, thread);
3175 binder_alloc_copy_to_buffer(&target_proc->alloc,
3179 return_error = BR_FAILED_REPLY;
3180 return_error_param = ret;
3181 return_error_line = __LINE__;
3182 goto err_translate_failed;
3186 case BINDER_TYPE_FD: {
3187 struct binder_fd_object *fp = to_binder_fd_object(hdr);
3188 binder_size_t fd_offset = object_offset +
3189 (uintptr_t)&fp->fd - (uintptr_t)fp;
3190 int ret = binder_translate_fd(fp->fd, fd_offset, t,
3191 thread, in_reply_to);
3195 binder_alloc_copy_to_buffer(&target_proc->alloc,
3199 return_error = BR_FAILED_REPLY;
3200 return_error_param = ret;
3201 return_error_line = __LINE__;
3202 goto err_translate_failed;
3205 case BINDER_TYPE_FDA: {
3206 struct binder_object ptr_object;
3207 binder_size_t parent_offset;
3208 struct binder_object user_object;
3209 size_t user_parent_size;
3210 struct binder_fd_array_object *fda =
3211 to_binder_fd_array_object(hdr);
3212 size_t num_valid = (buffer_offset - off_start_offset) /
3213 sizeof(binder_size_t);
3214 struct binder_buffer_object *parent =
3215 binder_validate_ptr(target_proc, t->buffer,
3216 &ptr_object, fda->parent,
3221 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
3222 proc->pid, thread->pid);
3223 return_error = BR_FAILED_REPLY;
3224 return_error_param = -EINVAL;
3225 return_error_line = __LINE__;
3226 goto err_bad_parent;
3228 if (!binder_validate_fixup(target_proc, t->buffer,
3233 last_fixup_min_off)) {
3234 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
3235 proc->pid, thread->pid);
3236 return_error = BR_FAILED_REPLY;
3237 return_error_param = -EINVAL;
3238 return_error_line = __LINE__;
3239 goto err_bad_parent;
3242 * We need to read the user version of the parent
3243 * object to get the original user offset
3246 binder_get_object(proc, user_buffer, t->buffer,
3247 parent_offset, &user_object);
3248 if (user_parent_size != sizeof(user_object.bbo)) {
3249 binder_user_error("%d:%d invalid ptr object size: %zd vs %zd\n",
3250 proc->pid, thread->pid,
3252 sizeof(user_object.bbo));
3253 return_error = BR_FAILED_REPLY;
3254 return_error_param = -EINVAL;
3255 return_error_line = __LINE__;
3256 goto err_bad_parent;
3258 ret = binder_translate_fd_array(&pf_head, fda,
3259 user_buffer, parent,
3260 &user_object.bbo, t,
3261 thread, in_reply_to);
3263 ret = binder_alloc_copy_to_buffer(&target_proc->alloc,
3268 return_error = BR_FAILED_REPLY;
3269 return_error_param = ret > 0 ? -EINVAL : ret;
3270 return_error_line = __LINE__;
3271 goto err_translate_failed;
3273 last_fixup_obj_off = parent_offset;
3274 last_fixup_min_off =
3275 fda->parent_offset + sizeof(u32) * fda->num_fds;
3277 case BINDER_TYPE_PTR: {
3278 struct binder_buffer_object *bp =
3279 to_binder_buffer_object(hdr);
3280 size_t buf_left = sg_buf_end_offset - sg_buf_offset;
3283 if (bp->length > buf_left) {
3284 binder_user_error("%d:%d got transaction with too large buffer\n",
3285 proc->pid, thread->pid);
3286 return_error = BR_FAILED_REPLY;
3287 return_error_param = -EINVAL;
3288 return_error_line = __LINE__;
3289 goto err_bad_offset;
3291 ret = binder_defer_copy(&sgc_head, sg_buf_offset,
3292 (const void __user *)(uintptr_t)bp->buffer,
3295 return_error = BR_FAILED_REPLY;
3296 return_error_param = ret;
3297 return_error_line = __LINE__;
3298 goto err_translate_failed;
3300 /* Fixup buffer pointer to target proc address space */
3301 bp->buffer = (uintptr_t)
3302 t->buffer->user_data + sg_buf_offset;
3303 sg_buf_offset += ALIGN(bp->length, sizeof(u64));
3305 num_valid = (buffer_offset - off_start_offset) /
3306 sizeof(binder_size_t);
3307 ret = binder_fixup_parent(&pf_head, t,
3312 last_fixup_min_off);
3314 binder_alloc_copy_to_buffer(&target_proc->alloc,
3318 return_error = BR_FAILED_REPLY;
3319 return_error_param = ret;
3320 return_error_line = __LINE__;
3321 goto err_translate_failed;
3323 last_fixup_obj_off = object_offset;
3324 last_fixup_min_off = 0;
3327 binder_user_error("%d:%d got transaction with invalid object type, %x\n",
3328 proc->pid, thread->pid, hdr->type);
3329 return_error = BR_FAILED_REPLY;
3330 return_error_param = -EINVAL;
3331 return_error_line = __LINE__;
3332 goto err_bad_object_type;
3335 /* Done processing objects, copy the rest of the buffer */
3336 if (binder_alloc_copy_user_to_buffer(
3337 &target_proc->alloc,
3338 t->buffer, user_offset,
3339 user_buffer + user_offset,
3340 tr->data_size - user_offset)) {
3341 binder_user_error("%d:%d got transaction with invalid data ptr\n",
3342 proc->pid, thread->pid);
3343 return_error = BR_FAILED_REPLY;
3344 return_error_param = -EFAULT;
3345 return_error_line = __LINE__;
3346 goto err_copy_data_failed;
3349 ret = binder_do_deferred_txn_copies(&target_proc->alloc, t->buffer,
3350 &sgc_head, &pf_head);
3352 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
3353 proc->pid, thread->pid);
3354 return_error = BR_FAILED_REPLY;
3355 return_error_param = ret;
3356 return_error_line = __LINE__;
3357 goto err_copy_data_failed;
3359 if (t->buffer->oneway_spam_suspect)
3360 tcomplete->type = BINDER_WORK_TRANSACTION_ONEWAY_SPAM_SUSPECT;
3362 tcomplete->type = BINDER_WORK_TRANSACTION_COMPLETE;
3363 t->work.type = BINDER_WORK_TRANSACTION;
3366 binder_enqueue_thread_work(thread, tcomplete);
3367 binder_inner_proc_lock(target_proc);
3368 if (target_thread->is_dead) {
3369 return_error = BR_DEAD_REPLY;
3370 binder_inner_proc_unlock(target_proc);
3371 goto err_dead_proc_or_thread;
3373 BUG_ON(t->buffer->async_transaction != 0);
3374 binder_pop_transaction_ilocked(target_thread, in_reply_to);
3375 binder_enqueue_thread_work_ilocked(target_thread, &t->work);
3376 target_proc->outstanding_txns++;
3377 binder_inner_proc_unlock(target_proc);
3378 wake_up_interruptible_sync(&target_thread->wait);
3379 binder_free_transaction(in_reply_to);
3380 } else if (!(t->flags & TF_ONE_WAY)) {
3381 BUG_ON(t->buffer->async_transaction != 0);
3382 binder_inner_proc_lock(proc);
3384 * Defer the TRANSACTION_COMPLETE, so we don't return to
3385 * userspace immediately; this allows the target process to
3386 * immediately start processing this transaction, reducing
3387 * latency. We will then return the TRANSACTION_COMPLETE when
3388 * the target replies (or there is an error).
3390 binder_enqueue_deferred_thread_work_ilocked(thread, tcomplete);
3392 t->from_parent = thread->transaction_stack;
3393 thread->transaction_stack = t;
3394 binder_inner_proc_unlock(proc);
3395 return_error = binder_proc_transaction(t,
3396 target_proc, target_thread);
3398 binder_inner_proc_lock(proc);
3399 binder_pop_transaction_ilocked(thread, t);
3400 binder_inner_proc_unlock(proc);
3401 goto err_dead_proc_or_thread;
3404 BUG_ON(target_node == NULL);
3405 BUG_ON(t->buffer->async_transaction != 1);
3406 binder_enqueue_thread_work(thread, tcomplete);
3407 return_error = binder_proc_transaction(t, target_proc, NULL);
3409 goto err_dead_proc_or_thread;
3412 binder_thread_dec_tmpref(target_thread);
3413 binder_proc_dec_tmpref(target_proc);
3415 binder_dec_node_tmpref(target_node);
3417 * write barrier to synchronize with initialization
3421 WRITE_ONCE(e->debug_id_done, t_debug_id);
3424 err_dead_proc_or_thread:
3425 return_error_line = __LINE__;
3426 binder_dequeue_work(proc, tcomplete);
3427 err_translate_failed:
3428 err_bad_object_type:
3431 err_copy_data_failed:
3432 binder_cleanup_deferred_txn_lists(&sgc_head, &pf_head);
3433 binder_free_txn_fixups(t);
3434 trace_binder_transaction_failed_buffer_release(t->buffer);
3435 binder_transaction_buffer_release(target_proc, NULL, t->buffer,
3436 buffer_offset, true);
3438 binder_dec_node_tmpref(target_node);
3440 t->buffer->transaction = NULL;
3441 binder_alloc_free_buf(&target_proc->alloc, t->buffer);
3442 err_binder_alloc_buf_failed:
3445 security_release_secctx(secctx, secctx_sz);
3446 err_get_secctx_failed:
3448 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
3449 err_alloc_tcomplete_failed:
3450 if (trace_binder_txn_latency_free_enabled())
3451 binder_txn_latency_free(t);
3453 binder_stats_deleted(BINDER_STAT_TRANSACTION);
3457 err_empty_call_stack:
3459 err_invalid_target_handle:
3461 binder_thread_dec_tmpref(target_thread);
3463 binder_proc_dec_tmpref(target_proc);
3465 binder_dec_node(target_node, 1, 0);
3466 binder_dec_node_tmpref(target_node);
3469 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
3470 "%d:%d transaction failed %d/%d, size %lld-%lld line %d\n",
3471 proc->pid, thread->pid, return_error, return_error_param,
3472 (u64)tr->data_size, (u64)tr->offsets_size,
3476 struct binder_transaction_log_entry *fe;
3478 e->return_error = return_error;
3479 e->return_error_param = return_error_param;
3480 e->return_error_line = return_error_line;
3481 fe = binder_transaction_log_add(&binder_transaction_log_failed);
3484 * write barrier to synchronize with initialization
3488 WRITE_ONCE(e->debug_id_done, t_debug_id);
3489 WRITE_ONCE(fe->debug_id_done, t_debug_id);
3492 BUG_ON(thread->return_error.cmd != BR_OK);
3494 thread->return_error.cmd = BR_TRANSACTION_COMPLETE;
3495 binder_enqueue_thread_work(thread, &thread->return_error.work);
3496 binder_send_failed_reply(in_reply_to, return_error);
3498 thread->return_error.cmd = return_error;
3499 binder_enqueue_thread_work(thread, &thread->return_error.work);
3504 * binder_free_buf() - free the specified buffer
3505 * @proc: binder proc that owns buffer
3506 * @buffer: buffer to be freed
3507 * @is_failure: failed to send transaction
3509 * If buffer for an async transaction, enqueue the next async
3510 * transaction from the node.
3512 * Cleanup buffer and free it.
3515 binder_free_buf(struct binder_proc *proc,
3516 struct binder_thread *thread,
3517 struct binder_buffer *buffer, bool is_failure)
3519 binder_inner_proc_lock(proc);
3520 if (buffer->transaction) {
3521 buffer->transaction->buffer = NULL;
3522 buffer->transaction = NULL;
3524 binder_inner_proc_unlock(proc);
3525 if (buffer->async_transaction && buffer->target_node) {
3526 struct binder_node *buf_node;
3527 struct binder_work *w;
3529 buf_node = buffer->target_node;
3530 binder_node_inner_lock(buf_node);
3531 BUG_ON(!buf_node->has_async_transaction);
3532 BUG_ON(buf_node->proc != proc);
3533 w = binder_dequeue_work_head_ilocked(
3534 &buf_node->async_todo);
3536 buf_node->has_async_transaction = false;
3538 binder_enqueue_work_ilocked(
3540 binder_wakeup_proc_ilocked(proc);
3542 binder_node_inner_unlock(buf_node);
3544 trace_binder_transaction_buffer_release(buffer);
3545 binder_transaction_buffer_release(proc, thread, buffer, 0, is_failure);
3546 binder_alloc_free_buf(&proc->alloc, buffer);
3549 static int binder_thread_write(struct binder_proc *proc,
3550 struct binder_thread *thread,
3551 binder_uintptr_t binder_buffer, size_t size,
3552 binder_size_t *consumed)
3555 struct binder_context *context = proc->context;
3556 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
3557 void __user *ptr = buffer + *consumed;
3558 void __user *end = buffer + size;
3560 while (ptr < end && thread->return_error.cmd == BR_OK) {
3563 if (get_user(cmd, (uint32_t __user *)ptr))
3565 ptr += sizeof(uint32_t);
3566 trace_binder_command(cmd);
3567 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.bc)) {
3568 atomic_inc(&binder_stats.bc[_IOC_NR(cmd)]);
3569 atomic_inc(&proc->stats.bc[_IOC_NR(cmd)]);
3570 atomic_inc(&thread->stats.bc[_IOC_NR(cmd)]);
3578 const char *debug_string;
3579 bool strong = cmd == BC_ACQUIRE || cmd == BC_RELEASE;
3580 bool increment = cmd == BC_INCREFS || cmd == BC_ACQUIRE;
3581 struct binder_ref_data rdata;
3583 if (get_user(target, (uint32_t __user *)ptr))
3586 ptr += sizeof(uint32_t);
3588 if (increment && !target) {
3589 struct binder_node *ctx_mgr_node;
3591 mutex_lock(&context->context_mgr_node_lock);
3592 ctx_mgr_node = context->binder_context_mgr_node;
3594 if (ctx_mgr_node->proc == proc) {
3595 binder_user_error("%d:%d context manager tried to acquire desc 0\n",
3596 proc->pid, thread->pid);
3597 mutex_unlock(&context->context_mgr_node_lock);
3600 ret = binder_inc_ref_for_node(
3602 strong, NULL, &rdata);
3604 mutex_unlock(&context->context_mgr_node_lock);
3607 ret = binder_update_ref_for_handle(
3608 proc, target, increment, strong,
3610 if (!ret && rdata.desc != target) {
3611 binder_user_error("%d:%d tried to acquire reference to desc %d, got %d instead\n",
3612 proc->pid, thread->pid,
3613 target, rdata.desc);
3617 debug_string = "IncRefs";
3620 debug_string = "Acquire";
3623 debug_string = "Release";
3627 debug_string = "DecRefs";
3631 binder_user_error("%d:%d %s %d refcount change on invalid ref %d ret %d\n",
3632 proc->pid, thread->pid, debug_string,
3633 strong, target, ret);
3636 binder_debug(BINDER_DEBUG_USER_REFS,
3637 "%d:%d %s ref %d desc %d s %d w %d\n",
3638 proc->pid, thread->pid, debug_string,
3639 rdata.debug_id, rdata.desc, rdata.strong,
3643 case BC_INCREFS_DONE:
3644 case BC_ACQUIRE_DONE: {
3645 binder_uintptr_t node_ptr;
3646 binder_uintptr_t cookie;
3647 struct binder_node *node;
3650 if (get_user(node_ptr, (binder_uintptr_t __user *)ptr))
3652 ptr += sizeof(binder_uintptr_t);
3653 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3655 ptr += sizeof(binder_uintptr_t);
3656 node = binder_get_node(proc, node_ptr);
3658 binder_user_error("%d:%d %s u%016llx no match\n",
3659 proc->pid, thread->pid,
3660 cmd == BC_INCREFS_DONE ?
3666 if (cookie != node->cookie) {
3667 binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
3668 proc->pid, thread->pid,
3669 cmd == BC_INCREFS_DONE ?
3670 "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3671 (u64)node_ptr, node->debug_id,
3672 (u64)cookie, (u64)node->cookie);
3673 binder_put_node(node);
3676 binder_node_inner_lock(node);
3677 if (cmd == BC_ACQUIRE_DONE) {
3678 if (node->pending_strong_ref == 0) {
3679 binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
3680 proc->pid, thread->pid,
3682 binder_node_inner_unlock(node);
3683 binder_put_node(node);
3686 node->pending_strong_ref = 0;
3688 if (node->pending_weak_ref == 0) {
3689 binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
3690 proc->pid, thread->pid,
3692 binder_node_inner_unlock(node);
3693 binder_put_node(node);
3696 node->pending_weak_ref = 0;
3698 free_node = binder_dec_node_nilocked(node,
3699 cmd == BC_ACQUIRE_DONE, 0);
3701 binder_debug(BINDER_DEBUG_USER_REFS,
3702 "%d:%d %s node %d ls %d lw %d tr %d\n",
3703 proc->pid, thread->pid,
3704 cmd == BC_INCREFS_DONE ? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3705 node->debug_id, node->local_strong_refs,
3706 node->local_weak_refs, node->tmp_refs);
3707 binder_node_inner_unlock(node);
3708 binder_put_node(node);
3711 case BC_ATTEMPT_ACQUIRE:
3712 pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
3714 case BC_ACQUIRE_RESULT:
3715 pr_err("BC_ACQUIRE_RESULT not supported\n");
3718 case BC_FREE_BUFFER: {
3719 binder_uintptr_t data_ptr;
3720 struct binder_buffer *buffer;
3722 if (get_user(data_ptr, (binder_uintptr_t __user *)ptr))
3724 ptr += sizeof(binder_uintptr_t);
3726 buffer = binder_alloc_prepare_to_free(&proc->alloc,
3728 if (IS_ERR_OR_NULL(buffer)) {
3729 if (PTR_ERR(buffer) == -EPERM) {
3731 "%d:%d BC_FREE_BUFFER u%016llx matched unreturned or currently freeing buffer\n",
3732 proc->pid, thread->pid,
3736 "%d:%d BC_FREE_BUFFER u%016llx no match\n",
3737 proc->pid, thread->pid,
3742 binder_debug(BINDER_DEBUG_FREE_BUFFER,
3743 "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
3744 proc->pid, thread->pid, (u64)data_ptr,
3746 buffer->transaction ? "active" : "finished");
3747 binder_free_buf(proc, thread, buffer, false);
3751 case BC_TRANSACTION_SG:
3753 struct binder_transaction_data_sg tr;
3755 if (copy_from_user(&tr, ptr, sizeof(tr)))
3758 binder_transaction(proc, thread, &tr.transaction_data,
3759 cmd == BC_REPLY_SG, tr.buffers_size);
3762 case BC_TRANSACTION:
3764 struct binder_transaction_data tr;
3766 if (copy_from_user(&tr, ptr, sizeof(tr)))
3769 binder_transaction(proc, thread, &tr,
3770 cmd == BC_REPLY, 0);
3774 case BC_REGISTER_LOOPER:
3775 binder_debug(BINDER_DEBUG_THREADS,
3776 "%d:%d BC_REGISTER_LOOPER\n",
3777 proc->pid, thread->pid);
3778 binder_inner_proc_lock(proc);
3779 if (thread->looper & BINDER_LOOPER_STATE_ENTERED) {
3780 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3781 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
3782 proc->pid, thread->pid);
3783 } else if (proc->requested_threads == 0) {
3784 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3785 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
3786 proc->pid, thread->pid);
3788 proc->requested_threads--;
3789 proc->requested_threads_started++;
3791 thread->looper |= BINDER_LOOPER_STATE_REGISTERED;
3792 binder_inner_proc_unlock(proc);
3794 case BC_ENTER_LOOPER:
3795 binder_debug(BINDER_DEBUG_THREADS,
3796 "%d:%d BC_ENTER_LOOPER\n",
3797 proc->pid, thread->pid);
3798 if (thread->looper & BINDER_LOOPER_STATE_REGISTERED) {
3799 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3800 binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
3801 proc->pid, thread->pid);
3803 thread->looper |= BINDER_LOOPER_STATE_ENTERED;
3805 case BC_EXIT_LOOPER:
3806 binder_debug(BINDER_DEBUG_THREADS,
3807 "%d:%d BC_EXIT_LOOPER\n",
3808 proc->pid, thread->pid);
3809 thread->looper |= BINDER_LOOPER_STATE_EXITED;
3812 case BC_REQUEST_DEATH_NOTIFICATION:
3813 case BC_CLEAR_DEATH_NOTIFICATION: {
3815 binder_uintptr_t cookie;
3816 struct binder_ref *ref;
3817 struct binder_ref_death *death = NULL;
3819 if (get_user(target, (uint32_t __user *)ptr))
3821 ptr += sizeof(uint32_t);
3822 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3824 ptr += sizeof(binder_uintptr_t);
3825 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
3827 * Allocate memory for death notification
3828 * before taking lock
3830 death = kzalloc(sizeof(*death), GFP_KERNEL);
3831 if (death == NULL) {
3832 WARN_ON(thread->return_error.cmd !=
3834 thread->return_error.cmd = BR_ERROR;
3835 binder_enqueue_thread_work(
3837 &thread->return_error.work);
3839 BINDER_DEBUG_FAILED_TRANSACTION,
3840 "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
3841 proc->pid, thread->pid);
3845 binder_proc_lock(proc);
3846 ref = binder_get_ref_olocked(proc, target, false);
3848 binder_user_error("%d:%d %s invalid ref %d\n",
3849 proc->pid, thread->pid,
3850 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
3851 "BC_REQUEST_DEATH_NOTIFICATION" :
3852 "BC_CLEAR_DEATH_NOTIFICATION",
3854 binder_proc_unlock(proc);
3859 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
3860 "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
3861 proc->pid, thread->pid,
3862 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
3863 "BC_REQUEST_DEATH_NOTIFICATION" :
3864 "BC_CLEAR_DEATH_NOTIFICATION",
3865 (u64)cookie, ref->data.debug_id,
3866 ref->data.desc, ref->data.strong,
3867 ref->data.weak, ref->node->debug_id);
3869 binder_node_lock(ref->node);
3870 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
3872 binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
3873 proc->pid, thread->pid);
3874 binder_node_unlock(ref->node);
3875 binder_proc_unlock(proc);
3879 binder_stats_created(BINDER_STAT_DEATH);
3880 INIT_LIST_HEAD(&death->work.entry);
3881 death->cookie = cookie;
3883 if (ref->node->proc == NULL) {
3884 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
3886 binder_inner_proc_lock(proc);
3887 binder_enqueue_work_ilocked(
3888 &ref->death->work, &proc->todo);
3889 binder_wakeup_proc_ilocked(proc);
3890 binder_inner_proc_unlock(proc);
3893 if (ref->death == NULL) {
3894 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
3895 proc->pid, thread->pid);
3896 binder_node_unlock(ref->node);
3897 binder_proc_unlock(proc);
3901 if (death->cookie != cookie) {
3902 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
3903 proc->pid, thread->pid,
3906 binder_node_unlock(ref->node);
3907 binder_proc_unlock(proc);
3911 binder_inner_proc_lock(proc);
3912 if (list_empty(&death->work.entry)) {
3913 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
3914 if (thread->looper &
3915 (BINDER_LOOPER_STATE_REGISTERED |
3916 BINDER_LOOPER_STATE_ENTERED))
3917 binder_enqueue_thread_work_ilocked(
3921 binder_enqueue_work_ilocked(
3924 binder_wakeup_proc_ilocked(
3928 BUG_ON(death->work.type != BINDER_WORK_DEAD_BINDER);
3929 death->work.type = BINDER_WORK_DEAD_BINDER_AND_CLEAR;
3931 binder_inner_proc_unlock(proc);
3933 binder_node_unlock(ref->node);
3934 binder_proc_unlock(proc);
3936 case BC_DEAD_BINDER_DONE: {
3937 struct binder_work *w;
3938 binder_uintptr_t cookie;
3939 struct binder_ref_death *death = NULL;
3941 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3944 ptr += sizeof(cookie);
3945 binder_inner_proc_lock(proc);
3946 list_for_each_entry(w, &proc->delivered_death,
3948 struct binder_ref_death *tmp_death =
3950 struct binder_ref_death,
3953 if (tmp_death->cookie == cookie) {
3958 binder_debug(BINDER_DEBUG_DEAD_BINDER,
3959 "%d:%d BC_DEAD_BINDER_DONE %016llx found %pK\n",
3960 proc->pid, thread->pid, (u64)cookie,
3962 if (death == NULL) {
3963 binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
3964 proc->pid, thread->pid, (u64)cookie);
3965 binder_inner_proc_unlock(proc);
3968 binder_dequeue_work_ilocked(&death->work);
3969 if (death->work.type == BINDER_WORK_DEAD_BINDER_AND_CLEAR) {
3970 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
3971 if (thread->looper &
3972 (BINDER_LOOPER_STATE_REGISTERED |
3973 BINDER_LOOPER_STATE_ENTERED))
3974 binder_enqueue_thread_work_ilocked(
3975 thread, &death->work);
3977 binder_enqueue_work_ilocked(
3980 binder_wakeup_proc_ilocked(proc);
3983 binder_inner_proc_unlock(proc);
3987 pr_err("%d:%d unknown command %d\n",
3988 proc->pid, thread->pid, cmd);
3991 *consumed = ptr - buffer;
3996 static void binder_stat_br(struct binder_proc *proc,
3997 struct binder_thread *thread, uint32_t cmd)
3999 trace_binder_return(cmd);
4000 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.br)) {
4001 atomic_inc(&binder_stats.br[_IOC_NR(cmd)]);
4002 atomic_inc(&proc->stats.br[_IOC_NR(cmd)]);
4003 atomic_inc(&thread->stats.br[_IOC_NR(cmd)]);
4007 static int binder_put_node_cmd(struct binder_proc *proc,
4008 struct binder_thread *thread,
4010 binder_uintptr_t node_ptr,
4011 binder_uintptr_t node_cookie,
4013 uint32_t cmd, const char *cmd_name)
4015 void __user *ptr = *ptrp;
4017 if (put_user(cmd, (uint32_t __user *)ptr))
4019 ptr += sizeof(uint32_t);
4021 if (put_user(node_ptr, (binder_uintptr_t __user *)ptr))
4023 ptr += sizeof(binder_uintptr_t);
4025 if (put_user(node_cookie, (binder_uintptr_t __user *)ptr))
4027 ptr += sizeof(binder_uintptr_t);
4029 binder_stat_br(proc, thread, cmd);
4030 binder_debug(BINDER_DEBUG_USER_REFS, "%d:%d %s %d u%016llx c%016llx\n",
4031 proc->pid, thread->pid, cmd_name, node_debug_id,
4032 (u64)node_ptr, (u64)node_cookie);
4038 static int binder_wait_for_work(struct binder_thread *thread,
4042 struct binder_proc *proc = thread->proc;
4045 freezer_do_not_count();
4046 binder_inner_proc_lock(proc);
4048 prepare_to_wait(&thread->wait, &wait, TASK_INTERRUPTIBLE);
4049 if (binder_has_work_ilocked(thread, do_proc_work))
4052 list_add(&thread->waiting_thread_node,
4053 &proc->waiting_threads);
4054 binder_inner_proc_unlock(proc);
4056 binder_inner_proc_lock(proc);
4057 list_del_init(&thread->waiting_thread_node);
4058 if (signal_pending(current)) {
4063 finish_wait(&thread->wait, &wait);
4064 binder_inner_proc_unlock(proc);
4071 * binder_apply_fd_fixups() - finish fd translation
4072 * @proc: binder_proc associated @t->buffer
4073 * @t: binder transaction with list of fd fixups
4075 * Now that we are in the context of the transaction target
4076 * process, we can allocate and install fds. Process the
4077 * list of fds to translate and fixup the buffer with the
4080 * If we fail to allocate an fd, then free the resources by
4081 * fput'ing files that have not been processed and ksys_close'ing
4082 * any fds that have already been allocated.
4084 static int binder_apply_fd_fixups(struct binder_proc *proc,
4085 struct binder_transaction *t)
4087 struct binder_txn_fd_fixup *fixup, *tmp;
4090 list_for_each_entry(fixup, &t->fd_fixups, fixup_entry) {
4091 int fd = get_unused_fd_flags(O_CLOEXEC);
4094 binder_debug(BINDER_DEBUG_TRANSACTION,
4095 "failed fd fixup txn %d fd %d\n",
4100 binder_debug(BINDER_DEBUG_TRANSACTION,
4101 "fd fixup txn %d fd %d\n",
4103 trace_binder_transaction_fd_recv(t, fd, fixup->offset);
4104 fd_install(fd, fixup->file);
4106 if (binder_alloc_copy_to_buffer(&proc->alloc, t->buffer,
4113 list_for_each_entry_safe(fixup, tmp, &t->fd_fixups, fixup_entry) {
4120 err = binder_alloc_copy_from_buffer(&proc->alloc, &fd,
4126 binder_deferred_fd_close(fd);
4128 list_del(&fixup->fixup_entry);
4135 static int binder_thread_read(struct binder_proc *proc,
4136 struct binder_thread *thread,
4137 binder_uintptr_t binder_buffer, size_t size,
4138 binder_size_t *consumed, int non_block)
4140 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
4141 void __user *ptr = buffer + *consumed;
4142 void __user *end = buffer + size;
4145 int wait_for_proc_work;
4147 if (*consumed == 0) {
4148 if (put_user(BR_NOOP, (uint32_t __user *)ptr))
4150 ptr += sizeof(uint32_t);
4154 binder_inner_proc_lock(proc);
4155 wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
4156 binder_inner_proc_unlock(proc);
4158 thread->looper |= BINDER_LOOPER_STATE_WAITING;
4160 trace_binder_wait_for_work(wait_for_proc_work,
4161 !!thread->transaction_stack,
4162 !binder_worklist_empty(proc, &thread->todo));
4163 if (wait_for_proc_work) {
4164 if (!(thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
4165 BINDER_LOOPER_STATE_ENTERED))) {
4166 binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
4167 proc->pid, thread->pid, thread->looper);
4168 wait_event_interruptible(binder_user_error_wait,
4169 binder_stop_on_user_error < 2);
4171 binder_set_nice(proc->default_priority);
4175 if (!binder_has_work(thread, wait_for_proc_work))
4178 ret = binder_wait_for_work(thread, wait_for_proc_work);
4181 thread->looper &= ~BINDER_LOOPER_STATE_WAITING;
4188 struct binder_transaction_data_secctx tr;
4189 struct binder_transaction_data *trd = &tr.transaction_data;
4190 struct binder_work *w = NULL;
4191 struct list_head *list = NULL;
4192 struct binder_transaction *t = NULL;
4193 struct binder_thread *t_from;
4194 size_t trsize = sizeof(*trd);
4196 binder_inner_proc_lock(proc);
4197 if (!binder_worklist_empty_ilocked(&thread->todo))
4198 list = &thread->todo;
4199 else if (!binder_worklist_empty_ilocked(&proc->todo) &&
4203 binder_inner_proc_unlock(proc);
4206 if (ptr - buffer == 4 && !thread->looper_need_return)
4211 if (end - ptr < sizeof(tr) + 4) {
4212 binder_inner_proc_unlock(proc);
4215 w = binder_dequeue_work_head_ilocked(list);
4216 if (binder_worklist_empty_ilocked(&thread->todo))
4217 thread->process_todo = false;
4220 case BINDER_WORK_TRANSACTION: {
4221 binder_inner_proc_unlock(proc);
4222 t = container_of(w, struct binder_transaction, work);
4224 case BINDER_WORK_RETURN_ERROR: {
4225 struct binder_error *e = container_of(
4226 w, struct binder_error, work);
4228 WARN_ON(e->cmd == BR_OK);
4229 binder_inner_proc_unlock(proc);
4230 if (put_user(e->cmd, (uint32_t __user *)ptr))
4234 ptr += sizeof(uint32_t);
4236 binder_stat_br(proc, thread, cmd);
4238 case BINDER_WORK_TRANSACTION_COMPLETE:
4239 case BINDER_WORK_TRANSACTION_ONEWAY_SPAM_SUSPECT: {
4240 if (proc->oneway_spam_detection_enabled &&
4241 w->type == BINDER_WORK_TRANSACTION_ONEWAY_SPAM_SUSPECT)
4242 cmd = BR_ONEWAY_SPAM_SUSPECT;
4244 cmd = BR_TRANSACTION_COMPLETE;
4245 binder_inner_proc_unlock(proc);
4247 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
4248 if (put_user(cmd, (uint32_t __user *)ptr))
4250 ptr += sizeof(uint32_t);
4252 binder_stat_br(proc, thread, cmd);
4253 binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE,
4254 "%d:%d BR_TRANSACTION_COMPLETE\n",
4255 proc->pid, thread->pid);
4257 case BINDER_WORK_NODE: {
4258 struct binder_node *node = container_of(w, struct binder_node, work);
4260 binder_uintptr_t node_ptr = node->ptr;
4261 binder_uintptr_t node_cookie = node->cookie;
4262 int node_debug_id = node->debug_id;
4265 void __user *orig_ptr = ptr;
4267 BUG_ON(proc != node->proc);
4268 strong = node->internal_strong_refs ||
4269 node->local_strong_refs;
4270 weak = !hlist_empty(&node->refs) ||
4271 node->local_weak_refs ||
4272 node->tmp_refs || strong;
4273 has_strong_ref = node->has_strong_ref;
4274 has_weak_ref = node->has_weak_ref;
4276 if (weak && !has_weak_ref) {
4277 node->has_weak_ref = 1;
4278 node->pending_weak_ref = 1;
4279 node->local_weak_refs++;
4281 if (strong && !has_strong_ref) {
4282 node->has_strong_ref = 1;
4283 node->pending_strong_ref = 1;
4284 node->local_strong_refs++;
4286 if (!strong && has_strong_ref)
4287 node->has_strong_ref = 0;
4288 if (!weak && has_weak_ref)
4289 node->has_weak_ref = 0;
4290 if (!weak && !strong) {
4291 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
4292 "%d:%d node %d u%016llx c%016llx deleted\n",
4293 proc->pid, thread->pid,
4297 rb_erase(&node->rb_node, &proc->nodes);
4298 binder_inner_proc_unlock(proc);
4299 binder_node_lock(node);
4301 * Acquire the node lock before freeing the
4302 * node to serialize with other threads that
4303 * may have been holding the node lock while
4304 * decrementing this node (avoids race where
4305 * this thread frees while the other thread
4306 * is unlocking the node after the final
4309 binder_node_unlock(node);
4310 binder_free_node(node);
4312 binder_inner_proc_unlock(proc);
4314 if (weak && !has_weak_ref)
4315 ret = binder_put_node_cmd(
4316 proc, thread, &ptr, node_ptr,
4317 node_cookie, node_debug_id,
4318 BR_INCREFS, "BR_INCREFS");
4319 if (!ret && strong && !has_strong_ref)
4320 ret = binder_put_node_cmd(
4321 proc, thread, &ptr, node_ptr,
4322 node_cookie, node_debug_id,
4323 BR_ACQUIRE, "BR_ACQUIRE");
4324 if (!ret && !strong && has_strong_ref)
4325 ret = binder_put_node_cmd(
4326 proc, thread, &ptr, node_ptr,
4327 node_cookie, node_debug_id,
4328 BR_RELEASE, "BR_RELEASE");
4329 if (!ret && !weak && has_weak_ref)
4330 ret = binder_put_node_cmd(
4331 proc, thread, &ptr, node_ptr,
4332 node_cookie, node_debug_id,
4333 BR_DECREFS, "BR_DECREFS");
4334 if (orig_ptr == ptr)
4335 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
4336 "%d:%d node %d u%016llx c%016llx state unchanged\n",
4337 proc->pid, thread->pid,
4344 case BINDER_WORK_DEAD_BINDER:
4345 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4346 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
4347 struct binder_ref_death *death;
4349 binder_uintptr_t cookie;
4351 death = container_of(w, struct binder_ref_death, work);
4352 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION)
4353 cmd = BR_CLEAR_DEATH_NOTIFICATION_DONE;
4355 cmd = BR_DEAD_BINDER;
4356 cookie = death->cookie;
4358 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
4359 "%d:%d %s %016llx\n",
4360 proc->pid, thread->pid,
4361 cmd == BR_DEAD_BINDER ?
4363 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
4365 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) {
4366 binder_inner_proc_unlock(proc);
4368 binder_stats_deleted(BINDER_STAT_DEATH);
4370 binder_enqueue_work_ilocked(
4371 w, &proc->delivered_death);
4372 binder_inner_proc_unlock(proc);
4374 if (put_user(cmd, (uint32_t __user *)ptr))
4376 ptr += sizeof(uint32_t);
4377 if (put_user(cookie,
4378 (binder_uintptr_t __user *)ptr))
4380 ptr += sizeof(binder_uintptr_t);
4381 binder_stat_br(proc, thread, cmd);
4382 if (cmd == BR_DEAD_BINDER)
4383 goto done; /* DEAD_BINDER notifications can cause transactions */
4386 binder_inner_proc_unlock(proc);
4387 pr_err("%d:%d: bad work type %d\n",
4388 proc->pid, thread->pid, w->type);
4395 BUG_ON(t->buffer == NULL);
4396 if (t->buffer->target_node) {
4397 struct binder_node *target_node = t->buffer->target_node;
4399 trd->target.ptr = target_node->ptr;
4400 trd->cookie = target_node->cookie;
4401 t->saved_priority = task_nice(current);
4402 if (t->priority < target_node->min_priority &&
4403 !(t->flags & TF_ONE_WAY))
4404 binder_set_nice(t->priority);
4405 else if (!(t->flags & TF_ONE_WAY) ||
4406 t->saved_priority > target_node->min_priority)
4407 binder_set_nice(target_node->min_priority);
4408 cmd = BR_TRANSACTION;
4410 trd->target.ptr = 0;
4414 trd->code = t->code;
4415 trd->flags = t->flags;
4416 trd->sender_euid = from_kuid(current_user_ns(), t->sender_euid);
4418 t_from = binder_get_txn_from(t);
4420 struct task_struct *sender = t_from->proc->tsk;
4423 task_tgid_nr_ns(sender,
4424 task_active_pid_ns(current));
4426 trd->sender_pid = 0;
4429 ret = binder_apply_fd_fixups(proc, t);
4431 struct binder_buffer *buffer = t->buffer;
4432 bool oneway = !!(t->flags & TF_ONE_WAY);
4433 int tid = t->debug_id;
4436 binder_thread_dec_tmpref(t_from);
4437 buffer->transaction = NULL;
4438 binder_cleanup_transaction(t, "fd fixups failed",
4440 binder_free_buf(proc, thread, buffer, true);
4441 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
4442 "%d:%d %stransaction %d fd fixups failed %d/%d, line %d\n",
4443 proc->pid, thread->pid,
4445 (cmd == BR_REPLY ? "reply " : ""),
4446 tid, BR_FAILED_REPLY, ret, __LINE__);
4447 if (cmd == BR_REPLY) {
4448 cmd = BR_FAILED_REPLY;
4449 if (put_user(cmd, (uint32_t __user *)ptr))
4451 ptr += sizeof(uint32_t);
4452 binder_stat_br(proc, thread, cmd);
4457 trd->data_size = t->buffer->data_size;
4458 trd->offsets_size = t->buffer->offsets_size;
4459 trd->data.ptr.buffer = (uintptr_t)t->buffer->user_data;
4460 trd->data.ptr.offsets = trd->data.ptr.buffer +
4461 ALIGN(t->buffer->data_size,
4464 tr.secctx = t->security_ctx;
4465 if (t->security_ctx) {
4466 cmd = BR_TRANSACTION_SEC_CTX;
4467 trsize = sizeof(tr);
4469 if (put_user(cmd, (uint32_t __user *)ptr)) {
4471 binder_thread_dec_tmpref(t_from);
4473 binder_cleanup_transaction(t, "put_user failed",
4478 ptr += sizeof(uint32_t);
4479 if (copy_to_user(ptr, &tr, trsize)) {
4481 binder_thread_dec_tmpref(t_from);
4483 binder_cleanup_transaction(t, "copy_to_user failed",
4490 trace_binder_transaction_received(t);
4491 binder_stat_br(proc, thread, cmd);
4492 binder_debug(BINDER_DEBUG_TRANSACTION,
4493 "%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n",
4494 proc->pid, thread->pid,
4495 (cmd == BR_TRANSACTION) ? "BR_TRANSACTION" :
4496 (cmd == BR_TRANSACTION_SEC_CTX) ?
4497 "BR_TRANSACTION_SEC_CTX" : "BR_REPLY",
4498 t->debug_id, t_from ? t_from->proc->pid : 0,
4499 t_from ? t_from->pid : 0, cmd,
4500 t->buffer->data_size, t->buffer->offsets_size,
4501 (u64)trd->data.ptr.buffer,
4502 (u64)trd->data.ptr.offsets);
4505 binder_thread_dec_tmpref(t_from);
4506 t->buffer->allow_user_free = 1;
4507 if (cmd != BR_REPLY && !(t->flags & TF_ONE_WAY)) {
4508 binder_inner_proc_lock(thread->proc);
4509 t->to_parent = thread->transaction_stack;
4510 t->to_thread = thread;
4511 thread->transaction_stack = t;
4512 binder_inner_proc_unlock(thread->proc);
4514 binder_free_transaction(t);
4521 *consumed = ptr - buffer;
4522 binder_inner_proc_lock(proc);
4523 if (proc->requested_threads == 0 &&
4524 list_empty(&thread->proc->waiting_threads) &&
4525 proc->requested_threads_started < proc->max_threads &&
4526 (thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
4527 BINDER_LOOPER_STATE_ENTERED)) /* the user-space code fails to */
4528 /*spawn a new thread if we leave this out */) {
4529 proc->requested_threads++;
4530 binder_inner_proc_unlock(proc);
4531 binder_debug(BINDER_DEBUG_THREADS,
4532 "%d:%d BR_SPAWN_LOOPER\n",
4533 proc->pid, thread->pid);
4534 if (put_user(BR_SPAWN_LOOPER, (uint32_t __user *)buffer))
4536 binder_stat_br(proc, thread, BR_SPAWN_LOOPER);
4538 binder_inner_proc_unlock(proc);
4542 static void binder_release_work(struct binder_proc *proc,
4543 struct list_head *list)
4545 struct binder_work *w;
4546 enum binder_work_type wtype;
4549 binder_inner_proc_lock(proc);
4550 w = binder_dequeue_work_head_ilocked(list);
4551 wtype = w ? w->type : 0;
4552 binder_inner_proc_unlock(proc);
4557 case BINDER_WORK_TRANSACTION: {
4558 struct binder_transaction *t;
4560 t = container_of(w, struct binder_transaction, work);
4562 binder_cleanup_transaction(t, "process died.",
4565 case BINDER_WORK_RETURN_ERROR: {
4566 struct binder_error *e = container_of(
4567 w, struct binder_error, work);
4569 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4570 "undelivered TRANSACTION_ERROR: %u\n",
4573 case BINDER_WORK_TRANSACTION_COMPLETE: {
4574 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4575 "undelivered TRANSACTION_COMPLETE\n");
4577 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
4579 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4580 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
4581 struct binder_ref_death *death;
4583 death = container_of(w, struct binder_ref_death, work);
4584 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4585 "undelivered death notification, %016llx\n",
4586 (u64)death->cookie);
4588 binder_stats_deleted(BINDER_STAT_DEATH);
4590 case BINDER_WORK_NODE:
4593 pr_err("unexpected work type, %d, not freed\n",
4601 static struct binder_thread *binder_get_thread_ilocked(
4602 struct binder_proc *proc, struct binder_thread *new_thread)
4604 struct binder_thread *thread = NULL;
4605 struct rb_node *parent = NULL;
4606 struct rb_node **p = &proc->threads.rb_node;
4610 thread = rb_entry(parent, struct binder_thread, rb_node);
4612 if (current->pid < thread->pid)
4614 else if (current->pid > thread->pid)
4615 p = &(*p)->rb_right;
4621 thread = new_thread;
4622 binder_stats_created(BINDER_STAT_THREAD);
4623 thread->proc = proc;
4624 thread->pid = current->pid;
4625 atomic_set(&thread->tmp_ref, 0);
4626 init_waitqueue_head(&thread->wait);
4627 INIT_LIST_HEAD(&thread->todo);
4628 rb_link_node(&thread->rb_node, parent, p);
4629 rb_insert_color(&thread->rb_node, &proc->threads);
4630 thread->looper_need_return = true;
4631 thread->return_error.work.type = BINDER_WORK_RETURN_ERROR;
4632 thread->return_error.cmd = BR_OK;
4633 thread->reply_error.work.type = BINDER_WORK_RETURN_ERROR;
4634 thread->reply_error.cmd = BR_OK;
4635 INIT_LIST_HEAD(&new_thread->waiting_thread_node);
4639 static struct binder_thread *binder_get_thread(struct binder_proc *proc)
4641 struct binder_thread *thread;
4642 struct binder_thread *new_thread;
4644 binder_inner_proc_lock(proc);
4645 thread = binder_get_thread_ilocked(proc, NULL);
4646 binder_inner_proc_unlock(proc);
4648 new_thread = kzalloc(sizeof(*thread), GFP_KERNEL);
4649 if (new_thread == NULL)
4651 binder_inner_proc_lock(proc);
4652 thread = binder_get_thread_ilocked(proc, new_thread);
4653 binder_inner_proc_unlock(proc);
4654 if (thread != new_thread)
4660 static void binder_free_proc(struct binder_proc *proc)
4662 struct binder_device *device;
4664 BUG_ON(!list_empty(&proc->todo));
4665 BUG_ON(!list_empty(&proc->delivered_death));
4666 if (proc->outstanding_txns)
4667 pr_warn("%s: Unexpected outstanding_txns %d\n",
4668 __func__, proc->outstanding_txns);
4669 device = container_of(proc->context, struct binder_device, context);
4670 if (refcount_dec_and_test(&device->ref)) {
4671 kfree(proc->context->name);
4674 binder_alloc_deferred_release(&proc->alloc);
4675 put_task_struct(proc->tsk);
4676 put_cred(proc->cred);
4677 binder_stats_deleted(BINDER_STAT_PROC);
4681 static void binder_free_thread(struct binder_thread *thread)
4683 BUG_ON(!list_empty(&thread->todo));
4684 binder_stats_deleted(BINDER_STAT_THREAD);
4685 binder_proc_dec_tmpref(thread->proc);
4689 static int binder_thread_release(struct binder_proc *proc,
4690 struct binder_thread *thread)
4692 struct binder_transaction *t;
4693 struct binder_transaction *send_reply = NULL;
4694 int active_transactions = 0;
4695 struct binder_transaction *last_t = NULL;
4697 binder_inner_proc_lock(thread->proc);
4699 * take a ref on the proc so it survives
4700 * after we remove this thread from proc->threads.
4701 * The corresponding dec is when we actually
4702 * free the thread in binder_free_thread()
4706 * take a ref on this thread to ensure it
4707 * survives while we are releasing it
4709 atomic_inc(&thread->tmp_ref);
4710 rb_erase(&thread->rb_node, &proc->threads);
4711 t = thread->transaction_stack;
4713 spin_lock(&t->lock);
4714 if (t->to_thread == thread)
4717 __acquire(&t->lock);
4719 thread->is_dead = true;
4723 active_transactions++;
4724 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4725 "release %d:%d transaction %d %s, still active\n",
4726 proc->pid, thread->pid,
4728 (t->to_thread == thread) ? "in" : "out");
4730 if (t->to_thread == thread) {
4731 thread->proc->outstanding_txns--;
4733 t->to_thread = NULL;
4735 t->buffer->transaction = NULL;
4739 } else if (t->from == thread) {
4744 spin_unlock(&last_t->lock);
4746 spin_lock(&t->lock);
4748 __acquire(&t->lock);
4750 /* annotation for sparse, lock not acquired in last iteration above */
4751 __release(&t->lock);
4754 * If this thread used poll, make sure we remove the waitqueue from any
4755 * poll data structures holding it.
4757 if (thread->looper & BINDER_LOOPER_STATE_POLL)
4758 wake_up_pollfree(&thread->wait);
4760 binder_inner_proc_unlock(thread->proc);
4763 * This is needed to avoid races between wake_up_pollfree() above and
4764 * someone else removing the last entry from the queue for other reasons
4765 * (e.g. ep_remove_wait_queue() being called due to an epoll file
4766 * descriptor being closed). Such other users hold an RCU read lock, so
4767 * we can be sure they're done after we call synchronize_rcu().
4769 if (thread->looper & BINDER_LOOPER_STATE_POLL)
4773 binder_send_failed_reply(send_reply, BR_DEAD_REPLY);
4774 binder_release_work(proc, &thread->todo);
4775 binder_thread_dec_tmpref(thread);
4776 return active_transactions;
4779 static __poll_t binder_poll(struct file *filp,
4780 struct poll_table_struct *wait)
4782 struct binder_proc *proc = filp->private_data;
4783 struct binder_thread *thread = NULL;
4784 bool wait_for_proc_work;
4786 thread = binder_get_thread(proc);
4790 binder_inner_proc_lock(thread->proc);
4791 thread->looper |= BINDER_LOOPER_STATE_POLL;
4792 wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
4794 binder_inner_proc_unlock(thread->proc);
4796 poll_wait(filp, &thread->wait, wait);
4798 if (binder_has_work(thread, wait_for_proc_work))
4804 static int binder_ioctl_write_read(struct file *filp,
4805 unsigned int cmd, unsigned long arg,
4806 struct binder_thread *thread)
4809 struct binder_proc *proc = filp->private_data;
4810 unsigned int size = _IOC_SIZE(cmd);
4811 void __user *ubuf = (void __user *)arg;
4812 struct binder_write_read bwr;
4814 if (size != sizeof(struct binder_write_read)) {
4818 if (copy_from_user(&bwr, ubuf, sizeof(bwr))) {
4822 binder_debug(BINDER_DEBUG_READ_WRITE,
4823 "%d:%d write %lld at %016llx, read %lld at %016llx\n",
4824 proc->pid, thread->pid,
4825 (u64)bwr.write_size, (u64)bwr.write_buffer,
4826 (u64)bwr.read_size, (u64)bwr.read_buffer);
4828 if (bwr.write_size > 0) {
4829 ret = binder_thread_write(proc, thread,
4832 &bwr.write_consumed);
4833 trace_binder_write_done(ret);
4835 bwr.read_consumed = 0;
4836 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
4841 if (bwr.read_size > 0) {
4842 ret = binder_thread_read(proc, thread, bwr.read_buffer,
4845 filp->f_flags & O_NONBLOCK);
4846 trace_binder_read_done(ret);
4847 binder_inner_proc_lock(proc);
4848 if (!binder_worklist_empty_ilocked(&proc->todo))
4849 binder_wakeup_proc_ilocked(proc);
4850 binder_inner_proc_unlock(proc);
4852 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
4857 binder_debug(BINDER_DEBUG_READ_WRITE,
4858 "%d:%d wrote %lld of %lld, read return %lld of %lld\n",
4859 proc->pid, thread->pid,
4860 (u64)bwr.write_consumed, (u64)bwr.write_size,
4861 (u64)bwr.read_consumed, (u64)bwr.read_size);
4862 if (copy_to_user(ubuf, &bwr, sizeof(bwr))) {
4870 static int binder_ioctl_set_ctx_mgr(struct file *filp,
4871 struct flat_binder_object *fbo)
4874 struct binder_proc *proc = filp->private_data;
4875 struct binder_context *context = proc->context;
4876 struct binder_node *new_node;
4877 kuid_t curr_euid = current_euid();
4879 mutex_lock(&context->context_mgr_node_lock);
4880 if (context->binder_context_mgr_node) {
4881 pr_err("BINDER_SET_CONTEXT_MGR already set\n");
4885 ret = security_binder_set_context_mgr(proc->cred);
4888 if (uid_valid(context->binder_context_mgr_uid)) {
4889 if (!uid_eq(context->binder_context_mgr_uid, curr_euid)) {
4890 pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
4891 from_kuid(&init_user_ns, curr_euid),
4892 from_kuid(&init_user_ns,
4893 context->binder_context_mgr_uid));
4898 context->binder_context_mgr_uid = curr_euid;
4900 new_node = binder_new_node(proc, fbo);
4905 binder_node_lock(new_node);
4906 new_node->local_weak_refs++;
4907 new_node->local_strong_refs++;
4908 new_node->has_strong_ref = 1;
4909 new_node->has_weak_ref = 1;
4910 context->binder_context_mgr_node = new_node;
4911 binder_node_unlock(new_node);
4912 binder_put_node(new_node);
4914 mutex_unlock(&context->context_mgr_node_lock);
4918 static int binder_ioctl_get_node_info_for_ref(struct binder_proc *proc,
4919 struct binder_node_info_for_ref *info)
4921 struct binder_node *node;
4922 struct binder_context *context = proc->context;
4923 __u32 handle = info->handle;
4925 if (info->strong_count || info->weak_count || info->reserved1 ||
4926 info->reserved2 || info->reserved3) {
4927 binder_user_error("%d BINDER_GET_NODE_INFO_FOR_REF: only handle may be non-zero.",
4932 /* This ioctl may only be used by the context manager */
4933 mutex_lock(&context->context_mgr_node_lock);
4934 if (!context->binder_context_mgr_node ||
4935 context->binder_context_mgr_node->proc != proc) {
4936 mutex_unlock(&context->context_mgr_node_lock);
4939 mutex_unlock(&context->context_mgr_node_lock);
4941 node = binder_get_node_from_ref(proc, handle, true, NULL);
4945 info->strong_count = node->local_strong_refs +
4946 node->internal_strong_refs;
4947 info->weak_count = node->local_weak_refs;
4949 binder_put_node(node);
4954 static int binder_ioctl_get_node_debug_info(struct binder_proc *proc,
4955 struct binder_node_debug_info *info)
4958 binder_uintptr_t ptr = info->ptr;
4960 memset(info, 0, sizeof(*info));
4962 binder_inner_proc_lock(proc);
4963 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
4964 struct binder_node *node = rb_entry(n, struct binder_node,
4966 if (node->ptr > ptr) {
4967 info->ptr = node->ptr;
4968 info->cookie = node->cookie;
4969 info->has_strong_ref = node->has_strong_ref;
4970 info->has_weak_ref = node->has_weak_ref;
4974 binder_inner_proc_unlock(proc);
4979 static bool binder_txns_pending_ilocked(struct binder_proc *proc)
4982 struct binder_thread *thread;
4984 if (proc->outstanding_txns > 0)
4987 for (n = rb_first(&proc->threads); n; n = rb_next(n)) {
4988 thread = rb_entry(n, struct binder_thread, rb_node);
4989 if (thread->transaction_stack)
4995 static int binder_ioctl_freeze(struct binder_freeze_info *info,
4996 struct binder_proc *target_proc)
5000 if (!info->enable) {
5001 binder_inner_proc_lock(target_proc);
5002 target_proc->sync_recv = false;
5003 target_proc->async_recv = false;
5004 target_proc->is_frozen = false;
5005 binder_inner_proc_unlock(target_proc);
5010 * Freezing the target. Prevent new transactions by
5011 * setting frozen state. If timeout specified, wait
5012 * for transactions to drain.
5014 binder_inner_proc_lock(target_proc);
5015 target_proc->sync_recv = false;
5016 target_proc->async_recv = false;
5017 target_proc->is_frozen = true;
5018 binder_inner_proc_unlock(target_proc);
5020 if (info->timeout_ms > 0)
5021 ret = wait_event_interruptible_timeout(
5022 target_proc->freeze_wait,
5023 (!target_proc->outstanding_txns),
5024 msecs_to_jiffies(info->timeout_ms));
5026 /* Check pending transactions that wait for reply */
5028 binder_inner_proc_lock(target_proc);
5029 if (binder_txns_pending_ilocked(target_proc))
5031 binder_inner_proc_unlock(target_proc);
5035 binder_inner_proc_lock(target_proc);
5036 target_proc->is_frozen = false;
5037 binder_inner_proc_unlock(target_proc);
5043 static int binder_ioctl_get_freezer_info(
5044 struct binder_frozen_status_info *info)
5046 struct binder_proc *target_proc;
5050 info->sync_recv = 0;
5051 info->async_recv = 0;
5053 mutex_lock(&binder_procs_lock);
5054 hlist_for_each_entry(target_proc, &binder_procs, proc_node) {
5055 if (target_proc->pid == info->pid) {
5057 binder_inner_proc_lock(target_proc);
5058 txns_pending = binder_txns_pending_ilocked(target_proc);
5059 info->sync_recv |= target_proc->sync_recv |
5060 (txns_pending << 1);
5061 info->async_recv |= target_proc->async_recv;
5062 binder_inner_proc_unlock(target_proc);
5065 mutex_unlock(&binder_procs_lock);
5073 static long binder_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
5076 struct binder_proc *proc = filp->private_data;
5077 struct binder_thread *thread;
5078 unsigned int size = _IOC_SIZE(cmd);
5079 void __user *ubuf = (void __user *)arg;
5081 /*pr_info("binder_ioctl: %d:%d %x %lx\n",
5082 proc->pid, current->pid, cmd, arg);*/
5084 binder_selftest_alloc(&proc->alloc);
5086 trace_binder_ioctl(cmd, arg);
5088 ret = wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
5092 thread = binder_get_thread(proc);
5093 if (thread == NULL) {
5099 case BINDER_WRITE_READ:
5100 ret = binder_ioctl_write_read(filp, cmd, arg, thread);
5104 case BINDER_SET_MAX_THREADS: {
5107 if (copy_from_user(&max_threads, ubuf,
5108 sizeof(max_threads))) {
5112 binder_inner_proc_lock(proc);
5113 proc->max_threads = max_threads;
5114 binder_inner_proc_unlock(proc);
5117 case BINDER_SET_CONTEXT_MGR_EXT: {
5118 struct flat_binder_object fbo;
5120 if (copy_from_user(&fbo, ubuf, sizeof(fbo))) {
5124 ret = binder_ioctl_set_ctx_mgr(filp, &fbo);
5129 case BINDER_SET_CONTEXT_MGR:
5130 ret = binder_ioctl_set_ctx_mgr(filp, NULL);
5134 case BINDER_THREAD_EXIT:
5135 binder_debug(BINDER_DEBUG_THREADS, "%d:%d exit\n",
5136 proc->pid, thread->pid);
5137 binder_thread_release(proc, thread);
5140 case BINDER_VERSION: {
5141 struct binder_version __user *ver = ubuf;
5143 if (size != sizeof(struct binder_version)) {
5147 if (put_user(BINDER_CURRENT_PROTOCOL_VERSION,
5148 &ver->protocol_version)) {
5154 case BINDER_GET_NODE_INFO_FOR_REF: {
5155 struct binder_node_info_for_ref info;
5157 if (copy_from_user(&info, ubuf, sizeof(info))) {
5162 ret = binder_ioctl_get_node_info_for_ref(proc, &info);
5166 if (copy_to_user(ubuf, &info, sizeof(info))) {
5173 case BINDER_GET_NODE_DEBUG_INFO: {
5174 struct binder_node_debug_info info;
5176 if (copy_from_user(&info, ubuf, sizeof(info))) {
5181 ret = binder_ioctl_get_node_debug_info(proc, &info);
5185 if (copy_to_user(ubuf, &info, sizeof(info))) {
5191 case BINDER_FREEZE: {
5192 struct binder_freeze_info info;
5193 struct binder_proc **target_procs = NULL, *target_proc;
5194 int target_procs_count = 0, i = 0;
5198 if (copy_from_user(&info, ubuf, sizeof(info))) {
5203 mutex_lock(&binder_procs_lock);
5204 hlist_for_each_entry(target_proc, &binder_procs, proc_node) {
5205 if (target_proc->pid == info.pid)
5206 target_procs_count++;
5209 if (target_procs_count == 0) {
5210 mutex_unlock(&binder_procs_lock);
5215 target_procs = kcalloc(target_procs_count,
5216 sizeof(struct binder_proc *),
5219 if (!target_procs) {
5220 mutex_unlock(&binder_procs_lock);
5225 hlist_for_each_entry(target_proc, &binder_procs, proc_node) {
5226 if (target_proc->pid != info.pid)
5229 binder_inner_proc_lock(target_proc);
5230 target_proc->tmp_ref++;
5231 binder_inner_proc_unlock(target_proc);
5233 target_procs[i++] = target_proc;
5235 mutex_unlock(&binder_procs_lock);
5237 for (i = 0; i < target_procs_count; i++) {
5239 ret = binder_ioctl_freeze(&info,
5242 binder_proc_dec_tmpref(target_procs[i]);
5245 kfree(target_procs);
5251 case BINDER_GET_FROZEN_INFO: {
5252 struct binder_frozen_status_info info;
5254 if (copy_from_user(&info, ubuf, sizeof(info))) {
5259 ret = binder_ioctl_get_freezer_info(&info);
5263 if (copy_to_user(ubuf, &info, sizeof(info))) {
5269 case BINDER_ENABLE_ONEWAY_SPAM_DETECTION: {
5272 if (copy_from_user(&enable, ubuf, sizeof(enable))) {
5276 binder_inner_proc_lock(proc);
5277 proc->oneway_spam_detection_enabled = (bool)enable;
5278 binder_inner_proc_unlock(proc);
5288 thread->looper_need_return = false;
5289 wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
5290 if (ret && ret != -EINTR)
5291 pr_info("%d:%d ioctl %x %lx returned %d\n", proc->pid, current->pid, cmd, arg, ret);
5293 trace_binder_ioctl_done(ret);
5297 static void binder_vma_open(struct vm_area_struct *vma)
5299 struct binder_proc *proc = vma->vm_private_data;
5301 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5302 "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
5303 proc->pid, vma->vm_start, vma->vm_end,
5304 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
5305 (unsigned long)pgprot_val(vma->vm_page_prot));
5308 static void binder_vma_close(struct vm_area_struct *vma)
5310 struct binder_proc *proc = vma->vm_private_data;
5312 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5313 "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
5314 proc->pid, vma->vm_start, vma->vm_end,
5315 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
5316 (unsigned long)pgprot_val(vma->vm_page_prot));
5317 binder_alloc_vma_close(&proc->alloc);
5320 static vm_fault_t binder_vm_fault(struct vm_fault *vmf)
5322 return VM_FAULT_SIGBUS;
5325 static const struct vm_operations_struct binder_vm_ops = {
5326 .open = binder_vma_open,
5327 .close = binder_vma_close,
5328 .fault = binder_vm_fault,
5331 static int binder_mmap(struct file *filp, struct vm_area_struct *vma)
5333 struct binder_proc *proc = filp->private_data;
5335 if (proc->tsk != current->group_leader)
5338 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5339 "%s: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
5340 __func__, proc->pid, vma->vm_start, vma->vm_end,
5341 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
5342 (unsigned long)pgprot_val(vma->vm_page_prot));
5344 if (vma->vm_flags & FORBIDDEN_MMAP_FLAGS) {
5345 pr_err("%s: %d %lx-%lx %s failed %d\n", __func__,
5346 proc->pid, vma->vm_start, vma->vm_end, "bad vm_flags", -EPERM);
5349 vma->vm_flags |= VM_DONTCOPY | VM_MIXEDMAP;
5350 vma->vm_flags &= ~VM_MAYWRITE;
5352 vma->vm_ops = &binder_vm_ops;
5353 vma->vm_private_data = proc;
5355 return binder_alloc_mmap_handler(&proc->alloc, vma);
5358 static int binder_open(struct inode *nodp, struct file *filp)
5360 struct binder_proc *proc, *itr;
5361 struct binder_device *binder_dev;
5362 struct binderfs_info *info;
5363 struct dentry *binder_binderfs_dir_entry_proc = NULL;
5364 bool existing_pid = false;
5366 binder_debug(BINDER_DEBUG_OPEN_CLOSE, "%s: %d:%d\n", __func__,
5367 current->group_leader->pid, current->pid);
5369 proc = kzalloc(sizeof(*proc), GFP_KERNEL);
5372 spin_lock_init(&proc->inner_lock);
5373 spin_lock_init(&proc->outer_lock);
5374 get_task_struct(current->group_leader);
5375 proc->tsk = current->group_leader;
5376 proc->cred = get_cred(filp->f_cred);
5377 INIT_LIST_HEAD(&proc->todo);
5378 init_waitqueue_head(&proc->freeze_wait);
5379 proc->default_priority = task_nice(current);
5380 /* binderfs stashes devices in i_private */
5381 if (is_binderfs_device(nodp)) {
5382 binder_dev = nodp->i_private;
5383 info = nodp->i_sb->s_fs_info;
5384 binder_binderfs_dir_entry_proc = info->proc_log_dir;
5386 binder_dev = container_of(filp->private_data,
5387 struct binder_device, miscdev);
5389 refcount_inc(&binder_dev->ref);
5390 proc->context = &binder_dev->context;
5391 binder_alloc_init(&proc->alloc);
5393 binder_stats_created(BINDER_STAT_PROC);
5394 proc->pid = current->group_leader->pid;
5395 INIT_LIST_HEAD(&proc->delivered_death);
5396 INIT_LIST_HEAD(&proc->waiting_threads);
5397 filp->private_data = proc;
5399 mutex_lock(&binder_procs_lock);
5400 hlist_for_each_entry(itr, &binder_procs, proc_node) {
5401 if (itr->pid == proc->pid) {
5402 existing_pid = true;
5406 hlist_add_head(&proc->proc_node, &binder_procs);
5407 mutex_unlock(&binder_procs_lock);
5409 if (binder_debugfs_dir_entry_proc && !existing_pid) {
5412 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
5414 * proc debug entries are shared between contexts.
5415 * Only create for the first PID to avoid debugfs log spamming
5416 * The printing code will anyway print all contexts for a given
5417 * PID so this is not a problem.
5419 proc->debugfs_entry = debugfs_create_file(strbuf, 0444,
5420 binder_debugfs_dir_entry_proc,
5421 (void *)(unsigned long)proc->pid,
5425 if (binder_binderfs_dir_entry_proc && !existing_pid) {
5427 struct dentry *binderfs_entry;
5429 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
5431 * Similar to debugfs, the process specific log file is shared
5432 * between contexts. Only create for the first PID.
5433 * This is ok since same as debugfs, the log file will contain
5434 * information on all contexts of a given PID.
5436 binderfs_entry = binderfs_create_file(binder_binderfs_dir_entry_proc,
5437 strbuf, &proc_fops, (void *)(unsigned long)proc->pid);
5438 if (!IS_ERR(binderfs_entry)) {
5439 proc->binderfs_entry = binderfs_entry;
5443 error = PTR_ERR(binderfs_entry);
5444 pr_warn("Unable to create file %s in binderfs (error %d)\n",
5452 static int binder_flush(struct file *filp, fl_owner_t id)
5454 struct binder_proc *proc = filp->private_data;
5456 binder_defer_work(proc, BINDER_DEFERRED_FLUSH);
5461 static void binder_deferred_flush(struct binder_proc *proc)
5466 binder_inner_proc_lock(proc);
5467 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
5468 struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node);
5470 thread->looper_need_return = true;
5471 if (thread->looper & BINDER_LOOPER_STATE_WAITING) {
5472 wake_up_interruptible(&thread->wait);
5476 binder_inner_proc_unlock(proc);
5478 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5479 "binder_flush: %d woke %d threads\n", proc->pid,
5483 static int binder_release(struct inode *nodp, struct file *filp)
5485 struct binder_proc *proc = filp->private_data;
5487 debugfs_remove(proc->debugfs_entry);
5489 if (proc->binderfs_entry) {
5490 binderfs_remove_file(proc->binderfs_entry);
5491 proc->binderfs_entry = NULL;
5494 binder_defer_work(proc, BINDER_DEFERRED_RELEASE);
5499 static int binder_node_release(struct binder_node *node, int refs)
5501 struct binder_ref *ref;
5503 struct binder_proc *proc = node->proc;
5505 binder_release_work(proc, &node->async_todo);
5507 binder_node_lock(node);
5508 binder_inner_proc_lock(proc);
5509 binder_dequeue_work_ilocked(&node->work);
5511 * The caller must have taken a temporary ref on the node,
5513 BUG_ON(!node->tmp_refs);
5514 if (hlist_empty(&node->refs) && node->tmp_refs == 1) {
5515 binder_inner_proc_unlock(proc);
5516 binder_node_unlock(node);
5517 binder_free_node(node);
5523 node->local_strong_refs = 0;
5524 node->local_weak_refs = 0;
5525 binder_inner_proc_unlock(proc);
5527 spin_lock(&binder_dead_nodes_lock);
5528 hlist_add_head(&node->dead_node, &binder_dead_nodes);
5529 spin_unlock(&binder_dead_nodes_lock);
5531 hlist_for_each_entry(ref, &node->refs, node_entry) {
5534 * Need the node lock to synchronize
5535 * with new notification requests and the
5536 * inner lock to synchronize with queued
5537 * death notifications.
5539 binder_inner_proc_lock(ref->proc);
5541 binder_inner_proc_unlock(ref->proc);
5547 BUG_ON(!list_empty(&ref->death->work.entry));
5548 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
5549 binder_enqueue_work_ilocked(&ref->death->work,
5551 binder_wakeup_proc_ilocked(ref->proc);
5552 binder_inner_proc_unlock(ref->proc);
5555 binder_debug(BINDER_DEBUG_DEAD_BINDER,
5556 "node %d now dead, refs %d, death %d\n",
5557 node->debug_id, refs, death);
5558 binder_node_unlock(node);
5559 binder_put_node(node);
5564 static void binder_deferred_release(struct binder_proc *proc)
5566 struct binder_context *context = proc->context;
5568 int threads, nodes, incoming_refs, outgoing_refs, active_transactions;
5570 mutex_lock(&binder_procs_lock);
5571 hlist_del(&proc->proc_node);
5572 mutex_unlock(&binder_procs_lock);
5574 mutex_lock(&context->context_mgr_node_lock);
5575 if (context->binder_context_mgr_node &&
5576 context->binder_context_mgr_node->proc == proc) {
5577 binder_debug(BINDER_DEBUG_DEAD_BINDER,
5578 "%s: %d context_mgr_node gone\n",
5579 __func__, proc->pid);
5580 context->binder_context_mgr_node = NULL;
5582 mutex_unlock(&context->context_mgr_node_lock);
5583 binder_inner_proc_lock(proc);
5585 * Make sure proc stays alive after we
5586 * remove all the threads
5590 proc->is_dead = true;
5591 proc->is_frozen = false;
5592 proc->sync_recv = false;
5593 proc->async_recv = false;
5595 active_transactions = 0;
5596 while ((n = rb_first(&proc->threads))) {
5597 struct binder_thread *thread;
5599 thread = rb_entry(n, struct binder_thread, rb_node);
5600 binder_inner_proc_unlock(proc);
5602 active_transactions += binder_thread_release(proc, thread);
5603 binder_inner_proc_lock(proc);
5608 while ((n = rb_first(&proc->nodes))) {
5609 struct binder_node *node;
5611 node = rb_entry(n, struct binder_node, rb_node);
5614 * take a temporary ref on the node before
5615 * calling binder_node_release() which will either
5616 * kfree() the node or call binder_put_node()
5618 binder_inc_node_tmpref_ilocked(node);
5619 rb_erase(&node->rb_node, &proc->nodes);
5620 binder_inner_proc_unlock(proc);
5621 incoming_refs = binder_node_release(node, incoming_refs);
5622 binder_inner_proc_lock(proc);
5624 binder_inner_proc_unlock(proc);
5627 binder_proc_lock(proc);
5628 while ((n = rb_first(&proc->refs_by_desc))) {
5629 struct binder_ref *ref;
5631 ref = rb_entry(n, struct binder_ref, rb_node_desc);
5633 binder_cleanup_ref_olocked(ref);
5634 binder_proc_unlock(proc);
5635 binder_free_ref(ref);
5636 binder_proc_lock(proc);
5638 binder_proc_unlock(proc);
5640 binder_release_work(proc, &proc->todo);
5641 binder_release_work(proc, &proc->delivered_death);
5643 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5644 "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d\n",
5645 __func__, proc->pid, threads, nodes, incoming_refs,
5646 outgoing_refs, active_transactions);
5648 binder_proc_dec_tmpref(proc);
5651 static void binder_deferred_func(struct work_struct *work)
5653 struct binder_proc *proc;
5658 mutex_lock(&binder_deferred_lock);
5659 if (!hlist_empty(&binder_deferred_list)) {
5660 proc = hlist_entry(binder_deferred_list.first,
5661 struct binder_proc, deferred_work_node);
5662 hlist_del_init(&proc->deferred_work_node);
5663 defer = proc->deferred_work;
5664 proc->deferred_work = 0;
5669 mutex_unlock(&binder_deferred_lock);
5671 if (defer & BINDER_DEFERRED_FLUSH)
5672 binder_deferred_flush(proc);
5674 if (defer & BINDER_DEFERRED_RELEASE)
5675 binder_deferred_release(proc); /* frees proc */
5678 static DECLARE_WORK(binder_deferred_work, binder_deferred_func);
5681 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer)
5683 mutex_lock(&binder_deferred_lock);
5684 proc->deferred_work |= defer;
5685 if (hlist_unhashed(&proc->deferred_work_node)) {
5686 hlist_add_head(&proc->deferred_work_node,
5687 &binder_deferred_list);
5688 schedule_work(&binder_deferred_work);
5690 mutex_unlock(&binder_deferred_lock);
5693 static void print_binder_transaction_ilocked(struct seq_file *m,
5694 struct binder_proc *proc,
5696 struct binder_transaction *t)
5698 struct binder_proc *to_proc;
5699 struct binder_buffer *buffer = t->buffer;
5701 spin_lock(&t->lock);
5702 to_proc = t->to_proc;
5704 "%s %d: %pK from %d:%d to %d:%d code %x flags %x pri %ld r%d",
5705 prefix, t->debug_id, t,
5706 t->from ? t->from->proc->pid : 0,
5707 t->from ? t->from->pid : 0,
5708 to_proc ? to_proc->pid : 0,
5709 t->to_thread ? t->to_thread->pid : 0,
5710 t->code, t->flags, t->priority, t->need_reply);
5711 spin_unlock(&t->lock);
5713 if (proc != to_proc) {
5715 * Can only safely deref buffer if we are holding the
5716 * correct proc inner lock for this node
5722 if (buffer == NULL) {
5723 seq_puts(m, " buffer free\n");
5726 if (buffer->target_node)
5727 seq_printf(m, " node %d", buffer->target_node->debug_id);
5728 seq_printf(m, " size %zd:%zd data %pK\n",
5729 buffer->data_size, buffer->offsets_size,
5733 static void print_binder_work_ilocked(struct seq_file *m,
5734 struct binder_proc *proc,
5736 const char *transaction_prefix,
5737 struct binder_work *w)
5739 struct binder_node *node;
5740 struct binder_transaction *t;
5743 case BINDER_WORK_TRANSACTION:
5744 t = container_of(w, struct binder_transaction, work);
5745 print_binder_transaction_ilocked(
5746 m, proc, transaction_prefix, t);
5748 case BINDER_WORK_RETURN_ERROR: {
5749 struct binder_error *e = container_of(
5750 w, struct binder_error, work);
5752 seq_printf(m, "%stransaction error: %u\n",
5755 case BINDER_WORK_TRANSACTION_COMPLETE:
5756 seq_printf(m, "%stransaction complete\n", prefix);
5758 case BINDER_WORK_NODE:
5759 node = container_of(w, struct binder_node, work);
5760 seq_printf(m, "%snode work %d: u%016llx c%016llx\n",
5761 prefix, node->debug_id,
5762 (u64)node->ptr, (u64)node->cookie);
5764 case BINDER_WORK_DEAD_BINDER:
5765 seq_printf(m, "%shas dead binder\n", prefix);
5767 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
5768 seq_printf(m, "%shas cleared dead binder\n", prefix);
5770 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION:
5771 seq_printf(m, "%shas cleared death notification\n", prefix);
5774 seq_printf(m, "%sunknown work: type %d\n", prefix, w->type);
5779 static void print_binder_thread_ilocked(struct seq_file *m,
5780 struct binder_thread *thread,
5783 struct binder_transaction *t;
5784 struct binder_work *w;
5785 size_t start_pos = m->count;
5788 seq_printf(m, " thread %d: l %02x need_return %d tr %d\n",
5789 thread->pid, thread->looper,
5790 thread->looper_need_return,
5791 atomic_read(&thread->tmp_ref));
5792 header_pos = m->count;
5793 t = thread->transaction_stack;
5795 if (t->from == thread) {
5796 print_binder_transaction_ilocked(m, thread->proc,
5797 " outgoing transaction", t);
5799 } else if (t->to_thread == thread) {
5800 print_binder_transaction_ilocked(m, thread->proc,
5801 " incoming transaction", t);
5804 print_binder_transaction_ilocked(m, thread->proc,
5805 " bad transaction", t);
5809 list_for_each_entry(w, &thread->todo, entry) {
5810 print_binder_work_ilocked(m, thread->proc, " ",
5811 " pending transaction", w);
5813 if (!print_always && m->count == header_pos)
5814 m->count = start_pos;
5817 static void print_binder_node_nilocked(struct seq_file *m,
5818 struct binder_node *node)
5820 struct binder_ref *ref;
5821 struct binder_work *w;
5825 hlist_for_each_entry(ref, &node->refs, node_entry)
5828 seq_printf(m, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d tr %d",
5829 node->debug_id, (u64)node->ptr, (u64)node->cookie,
5830 node->has_strong_ref, node->has_weak_ref,
5831 node->local_strong_refs, node->local_weak_refs,
5832 node->internal_strong_refs, count, node->tmp_refs);
5834 seq_puts(m, " proc");
5835 hlist_for_each_entry(ref, &node->refs, node_entry)
5836 seq_printf(m, " %d", ref->proc->pid);
5840 list_for_each_entry(w, &node->async_todo, entry)
5841 print_binder_work_ilocked(m, node->proc, " ",
5842 " pending async transaction", w);
5846 static void print_binder_ref_olocked(struct seq_file *m,
5847 struct binder_ref *ref)
5849 binder_node_lock(ref->node);
5850 seq_printf(m, " ref %d: desc %d %snode %d s %d w %d d %pK\n",
5851 ref->data.debug_id, ref->data.desc,
5852 ref->node->proc ? "" : "dead ",
5853 ref->node->debug_id, ref->data.strong,
5854 ref->data.weak, ref->death);
5855 binder_node_unlock(ref->node);
5858 static void print_binder_proc(struct seq_file *m,
5859 struct binder_proc *proc, int print_all)
5861 struct binder_work *w;
5863 size_t start_pos = m->count;
5865 struct binder_node *last_node = NULL;
5867 seq_printf(m, "proc %d\n", proc->pid);
5868 seq_printf(m, "context %s\n", proc->context->name);
5869 header_pos = m->count;
5871 binder_inner_proc_lock(proc);
5872 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
5873 print_binder_thread_ilocked(m, rb_entry(n, struct binder_thread,
5874 rb_node), print_all);
5876 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
5877 struct binder_node *node = rb_entry(n, struct binder_node,
5879 if (!print_all && !node->has_async_transaction)
5883 * take a temporary reference on the node so it
5884 * survives and isn't removed from the tree
5885 * while we print it.
5887 binder_inc_node_tmpref_ilocked(node);
5888 /* Need to drop inner lock to take node lock */
5889 binder_inner_proc_unlock(proc);
5891 binder_put_node(last_node);
5892 binder_node_inner_lock(node);
5893 print_binder_node_nilocked(m, node);
5894 binder_node_inner_unlock(node);
5896 binder_inner_proc_lock(proc);
5898 binder_inner_proc_unlock(proc);
5900 binder_put_node(last_node);
5903 binder_proc_lock(proc);
5904 for (n = rb_first(&proc->refs_by_desc);
5907 print_binder_ref_olocked(m, rb_entry(n,
5910 binder_proc_unlock(proc);
5912 binder_alloc_print_allocated(m, &proc->alloc);
5913 binder_inner_proc_lock(proc);
5914 list_for_each_entry(w, &proc->todo, entry)
5915 print_binder_work_ilocked(m, proc, " ",
5916 " pending transaction", w);
5917 list_for_each_entry(w, &proc->delivered_death, entry) {
5918 seq_puts(m, " has delivered dead binder\n");
5921 binder_inner_proc_unlock(proc);
5922 if (!print_all && m->count == header_pos)
5923 m->count = start_pos;
5926 static const char * const binder_return_strings[] = {
5931 "BR_ACQUIRE_RESULT",
5933 "BR_TRANSACTION_COMPLETE",
5938 "BR_ATTEMPT_ACQUIRE",
5943 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
5946 "BR_ONEWAY_SPAM_SUSPECT",
5949 static const char * const binder_command_strings[] = {
5952 "BC_ACQUIRE_RESULT",
5960 "BC_ATTEMPT_ACQUIRE",
5961 "BC_REGISTER_LOOPER",
5964 "BC_REQUEST_DEATH_NOTIFICATION",
5965 "BC_CLEAR_DEATH_NOTIFICATION",
5966 "BC_DEAD_BINDER_DONE",
5967 "BC_TRANSACTION_SG",
5971 static const char * const binder_objstat_strings[] = {
5978 "transaction_complete"
5981 static void print_binder_stats(struct seq_file *m, const char *prefix,
5982 struct binder_stats *stats)
5986 BUILD_BUG_ON(ARRAY_SIZE(stats->bc) !=
5987 ARRAY_SIZE(binder_command_strings));
5988 for (i = 0; i < ARRAY_SIZE(stats->bc); i++) {
5989 int temp = atomic_read(&stats->bc[i]);
5992 seq_printf(m, "%s%s: %d\n", prefix,
5993 binder_command_strings[i], temp);
5996 BUILD_BUG_ON(ARRAY_SIZE(stats->br) !=
5997 ARRAY_SIZE(binder_return_strings));
5998 for (i = 0; i < ARRAY_SIZE(stats->br); i++) {
5999 int temp = atomic_read(&stats->br[i]);
6002 seq_printf(m, "%s%s: %d\n", prefix,
6003 binder_return_strings[i], temp);
6006 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
6007 ARRAY_SIZE(binder_objstat_strings));
6008 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
6009 ARRAY_SIZE(stats->obj_deleted));
6010 for (i = 0; i < ARRAY_SIZE(stats->obj_created); i++) {
6011 int created = atomic_read(&stats->obj_created[i]);
6012 int deleted = atomic_read(&stats->obj_deleted[i]);
6014 if (created || deleted)
6015 seq_printf(m, "%s%s: active %d total %d\n",
6017 binder_objstat_strings[i],
6023 static void print_binder_proc_stats(struct seq_file *m,
6024 struct binder_proc *proc)
6026 struct binder_work *w;
6027 struct binder_thread *thread;
6029 int count, strong, weak, ready_threads;
6030 size_t free_async_space =
6031 binder_alloc_get_free_async_space(&proc->alloc);
6033 seq_printf(m, "proc %d\n", proc->pid);
6034 seq_printf(m, "context %s\n", proc->context->name);
6037 binder_inner_proc_lock(proc);
6038 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
6041 list_for_each_entry(thread, &proc->waiting_threads, waiting_thread_node)
6044 seq_printf(m, " threads: %d\n", count);
6045 seq_printf(m, " requested threads: %d+%d/%d\n"
6046 " ready threads %d\n"
6047 " free async space %zd\n", proc->requested_threads,
6048 proc->requested_threads_started, proc->max_threads,
6052 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n))
6054 binder_inner_proc_unlock(proc);
6055 seq_printf(m, " nodes: %d\n", count);
6059 binder_proc_lock(proc);
6060 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
6061 struct binder_ref *ref = rb_entry(n, struct binder_ref,
6064 strong += ref->data.strong;
6065 weak += ref->data.weak;
6067 binder_proc_unlock(proc);
6068 seq_printf(m, " refs: %d s %d w %d\n", count, strong, weak);
6070 count = binder_alloc_get_allocated_count(&proc->alloc);
6071 seq_printf(m, " buffers: %d\n", count);
6073 binder_alloc_print_pages(m, &proc->alloc);
6076 binder_inner_proc_lock(proc);
6077 list_for_each_entry(w, &proc->todo, entry) {
6078 if (w->type == BINDER_WORK_TRANSACTION)
6081 binder_inner_proc_unlock(proc);
6082 seq_printf(m, " pending transactions: %d\n", count);
6084 print_binder_stats(m, " ", &proc->stats);
6088 int binder_state_show(struct seq_file *m, void *unused)
6090 struct binder_proc *proc;
6091 struct binder_node *node;
6092 struct binder_node *last_node = NULL;
6094 seq_puts(m, "binder state:\n");
6096 spin_lock(&binder_dead_nodes_lock);
6097 if (!hlist_empty(&binder_dead_nodes))
6098 seq_puts(m, "dead nodes:\n");
6099 hlist_for_each_entry(node, &binder_dead_nodes, dead_node) {
6101 * take a temporary reference on the node so it
6102 * survives and isn't removed from the list
6103 * while we print it.
6106 spin_unlock(&binder_dead_nodes_lock);
6108 binder_put_node(last_node);
6109 binder_node_lock(node);
6110 print_binder_node_nilocked(m, node);
6111 binder_node_unlock(node);
6113 spin_lock(&binder_dead_nodes_lock);
6115 spin_unlock(&binder_dead_nodes_lock);
6117 binder_put_node(last_node);
6119 mutex_lock(&binder_procs_lock);
6120 hlist_for_each_entry(proc, &binder_procs, proc_node)
6121 print_binder_proc(m, proc, 1);
6122 mutex_unlock(&binder_procs_lock);
6127 int binder_stats_show(struct seq_file *m, void *unused)
6129 struct binder_proc *proc;
6131 seq_puts(m, "binder stats:\n");
6133 print_binder_stats(m, "", &binder_stats);
6135 mutex_lock(&binder_procs_lock);
6136 hlist_for_each_entry(proc, &binder_procs, proc_node)
6137 print_binder_proc_stats(m, proc);
6138 mutex_unlock(&binder_procs_lock);
6143 int binder_transactions_show(struct seq_file *m, void *unused)
6145 struct binder_proc *proc;
6147 seq_puts(m, "binder transactions:\n");
6148 mutex_lock(&binder_procs_lock);
6149 hlist_for_each_entry(proc, &binder_procs, proc_node)
6150 print_binder_proc(m, proc, 0);
6151 mutex_unlock(&binder_procs_lock);
6156 static int proc_show(struct seq_file *m, void *unused)
6158 struct binder_proc *itr;
6159 int pid = (unsigned long)m->private;
6161 mutex_lock(&binder_procs_lock);
6162 hlist_for_each_entry(itr, &binder_procs, proc_node) {
6163 if (itr->pid == pid) {
6164 seq_puts(m, "binder proc state:\n");
6165 print_binder_proc(m, itr, 1);
6168 mutex_unlock(&binder_procs_lock);
6173 static void print_binder_transaction_log_entry(struct seq_file *m,
6174 struct binder_transaction_log_entry *e)
6176 int debug_id = READ_ONCE(e->debug_id_done);
6178 * read barrier to guarantee debug_id_done read before
6179 * we print the log values
6183 "%d: %s from %d:%d to %d:%d context %s node %d handle %d size %d:%d ret %d/%d l=%d",
6184 e->debug_id, (e->call_type == 2) ? "reply" :
6185 ((e->call_type == 1) ? "async" : "call "), e->from_proc,
6186 e->from_thread, e->to_proc, e->to_thread, e->context_name,
6187 e->to_node, e->target_handle, e->data_size, e->offsets_size,
6188 e->return_error, e->return_error_param,
6189 e->return_error_line);
6191 * read-barrier to guarantee read of debug_id_done after
6192 * done printing the fields of the entry
6195 seq_printf(m, debug_id && debug_id == READ_ONCE(e->debug_id_done) ?
6196 "\n" : " (incomplete)\n");
6199 int binder_transaction_log_show(struct seq_file *m, void *unused)
6201 struct binder_transaction_log *log = m->private;
6202 unsigned int log_cur = atomic_read(&log->cur);
6207 count = log_cur + 1;
6208 cur = count < ARRAY_SIZE(log->entry) && !log->full ?
6209 0 : count % ARRAY_SIZE(log->entry);
6210 if (count > ARRAY_SIZE(log->entry) || log->full)
6211 count = ARRAY_SIZE(log->entry);
6212 for (i = 0; i < count; i++) {
6213 unsigned int index = cur++ % ARRAY_SIZE(log->entry);
6215 print_binder_transaction_log_entry(m, &log->entry[index]);
6220 const struct file_operations binder_fops = {
6221 .owner = THIS_MODULE,
6222 .poll = binder_poll,
6223 .unlocked_ioctl = binder_ioctl,
6224 .compat_ioctl = compat_ptr_ioctl,
6225 .mmap = binder_mmap,
6226 .open = binder_open,
6227 .flush = binder_flush,
6228 .release = binder_release,
6231 static int __init init_binder_device(const char *name)
6234 struct binder_device *binder_device;
6236 binder_device = kzalloc(sizeof(*binder_device), GFP_KERNEL);
6240 binder_device->miscdev.fops = &binder_fops;
6241 binder_device->miscdev.minor = MISC_DYNAMIC_MINOR;
6242 binder_device->miscdev.name = name;
6244 refcount_set(&binder_device->ref, 1);
6245 binder_device->context.binder_context_mgr_uid = INVALID_UID;
6246 binder_device->context.name = name;
6247 mutex_init(&binder_device->context.context_mgr_node_lock);
6249 ret = misc_register(&binder_device->miscdev);
6251 kfree(binder_device);
6255 hlist_add_head(&binder_device->hlist, &binder_devices);
6260 static int __init binder_init(void)
6263 char *device_name, *device_tmp;
6264 struct binder_device *device;
6265 struct hlist_node *tmp;
6266 char *device_names = NULL;
6268 ret = binder_alloc_shrinker_init();
6272 atomic_set(&binder_transaction_log.cur, ~0U);
6273 atomic_set(&binder_transaction_log_failed.cur, ~0U);
6275 binder_debugfs_dir_entry_root = debugfs_create_dir("binder", NULL);
6276 if (binder_debugfs_dir_entry_root)
6277 binder_debugfs_dir_entry_proc = debugfs_create_dir("proc",
6278 binder_debugfs_dir_entry_root);
6280 if (binder_debugfs_dir_entry_root) {
6281 debugfs_create_file("state",
6283 binder_debugfs_dir_entry_root,
6285 &binder_state_fops);
6286 debugfs_create_file("stats",
6288 binder_debugfs_dir_entry_root,
6290 &binder_stats_fops);
6291 debugfs_create_file("transactions",
6293 binder_debugfs_dir_entry_root,
6295 &binder_transactions_fops);
6296 debugfs_create_file("transaction_log",
6298 binder_debugfs_dir_entry_root,
6299 &binder_transaction_log,
6300 &binder_transaction_log_fops);
6301 debugfs_create_file("failed_transaction_log",
6303 binder_debugfs_dir_entry_root,
6304 &binder_transaction_log_failed,
6305 &binder_transaction_log_fops);
6308 if (!IS_ENABLED(CONFIG_ANDROID_BINDERFS) &&
6309 strcmp(binder_devices_param, "") != 0) {
6311 * Copy the module_parameter string, because we don't want to
6312 * tokenize it in-place.
6314 device_names = kstrdup(binder_devices_param, GFP_KERNEL);
6315 if (!device_names) {
6317 goto err_alloc_device_names_failed;
6320 device_tmp = device_names;
6321 while ((device_name = strsep(&device_tmp, ","))) {
6322 ret = init_binder_device(device_name);
6324 goto err_init_binder_device_failed;
6328 ret = init_binderfs();
6330 goto err_init_binder_device_failed;
6334 err_init_binder_device_failed:
6335 hlist_for_each_entry_safe(device, tmp, &binder_devices, hlist) {
6336 misc_deregister(&device->miscdev);
6337 hlist_del(&device->hlist);
6341 kfree(device_names);
6343 err_alloc_device_names_failed:
6344 debugfs_remove_recursive(binder_debugfs_dir_entry_root);
6349 device_initcall(binder_init);
6351 #define CREATE_TRACE_POINTS
6352 #include "binder_trace.h"
6354 MODULE_LICENSE("GPL v2");