1 // SPDX-License-Identifier: GPL-2.0-only
4 * Android IPC Subsystem
6 * Copyright (C) 2007-2008 Google, Inc.
12 * There are 3 main spinlocks which must be acquired in the
15 * 1) proc->outer_lock : protects binder_ref
16 * binder_proc_lock() and binder_proc_unlock() are
18 * 2) node->lock : protects most fields of binder_node.
19 * binder_node_lock() and binder_node_unlock() are
21 * 3) proc->inner_lock : protects the thread and node lists
22 * (proc->threads, proc->waiting_threads, proc->nodes)
23 * and all todo lists associated with the binder_proc
24 * (proc->todo, thread->todo, proc->delivered_death and
25 * node->async_todo), as well as thread->transaction_stack
26 * binder_inner_proc_lock() and binder_inner_proc_unlock()
29 * Any lock under procA must never be nested under any lock at the same
30 * level or below on procB.
32 * Functions that require a lock held on entry indicate which lock
33 * in the suffix of the function name:
35 * foo_olocked() : requires node->outer_lock
36 * foo_nlocked() : requires node->lock
37 * foo_ilocked() : requires proc->inner_lock
38 * foo_oilocked(): requires proc->outer_lock and proc->inner_lock
39 * foo_nilocked(): requires node->lock and proc->inner_lock
43 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
45 #include <linux/fdtable.h>
46 #include <linux/file.h>
47 #include <linux/freezer.h>
49 #include <linux/list.h>
50 #include <linux/miscdevice.h>
51 #include <linux/module.h>
52 #include <linux/mutex.h>
53 #include <linux/nsproxy.h>
54 #include <linux/poll.h>
55 #include <linux/debugfs.h>
56 #include <linux/rbtree.h>
57 #include <linux/sched/signal.h>
58 #include <linux/sched/mm.h>
59 #include <linux/seq_file.h>
60 #include <linux/string.h>
61 #include <linux/uaccess.h>
62 #include <linux/pid_namespace.h>
63 #include <linux/security.h>
64 #include <linux/spinlock.h>
65 #include <linux/ratelimit.h>
66 #include <linux/syscalls.h>
67 #include <linux/task_work.h>
68 #include <linux/sizes.h>
70 #include <uapi/linux/android/binder.h>
72 #include <asm/cacheflush.h>
74 #include "binder_internal.h"
75 #include "binder_trace.h"
77 static HLIST_HEAD(binder_deferred_list
);
78 static DEFINE_MUTEX(binder_deferred_lock
);
80 static HLIST_HEAD(binder_devices
);
81 static HLIST_HEAD(binder_procs
);
82 static DEFINE_MUTEX(binder_procs_lock
);
84 static HLIST_HEAD(binder_dead_nodes
);
85 static DEFINE_SPINLOCK(binder_dead_nodes_lock
);
87 static struct dentry
*binder_debugfs_dir_entry_root
;
88 static struct dentry
*binder_debugfs_dir_entry_proc
;
89 static atomic_t binder_last_id
;
91 static int proc_show(struct seq_file
*m
, void *unused
);
92 DEFINE_SHOW_ATTRIBUTE(proc
);
94 #define FORBIDDEN_MMAP_FLAGS (VM_WRITE)
97 BINDER_DEBUG_USER_ERROR
= 1U << 0,
98 BINDER_DEBUG_FAILED_TRANSACTION
= 1U << 1,
99 BINDER_DEBUG_DEAD_TRANSACTION
= 1U << 2,
100 BINDER_DEBUG_OPEN_CLOSE
= 1U << 3,
101 BINDER_DEBUG_DEAD_BINDER
= 1U << 4,
102 BINDER_DEBUG_DEATH_NOTIFICATION
= 1U << 5,
103 BINDER_DEBUG_READ_WRITE
= 1U << 6,
104 BINDER_DEBUG_USER_REFS
= 1U << 7,
105 BINDER_DEBUG_THREADS
= 1U << 8,
106 BINDER_DEBUG_TRANSACTION
= 1U << 9,
107 BINDER_DEBUG_TRANSACTION_COMPLETE
= 1U << 10,
108 BINDER_DEBUG_FREE_BUFFER
= 1U << 11,
109 BINDER_DEBUG_INTERNAL_REFS
= 1U << 12,
110 BINDER_DEBUG_PRIORITY_CAP
= 1U << 13,
111 BINDER_DEBUG_SPINLOCKS
= 1U << 14,
113 static uint32_t binder_debug_mask
= BINDER_DEBUG_USER_ERROR
|
114 BINDER_DEBUG_FAILED_TRANSACTION
| BINDER_DEBUG_DEAD_TRANSACTION
;
115 module_param_named(debug_mask
, binder_debug_mask
, uint
, 0644);
117 char *binder_devices_param
= CONFIG_ANDROID_BINDER_DEVICES
;
118 module_param_named(devices
, binder_devices_param
, charp
, 0444);
120 static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait
);
121 static int binder_stop_on_user_error
;
123 static int binder_set_stop_on_user_error(const char *val
,
124 const struct kernel_param
*kp
)
128 ret
= param_set_int(val
, kp
);
129 if (binder_stop_on_user_error
< 2)
130 wake_up(&binder_user_error_wait
);
133 module_param_call(stop_on_user_error
, binder_set_stop_on_user_error
,
134 param_get_int
, &binder_stop_on_user_error
, 0644);
136 #define binder_debug(mask, x...) \
138 if (binder_debug_mask & mask) \
139 pr_info_ratelimited(x); \
142 #define binder_user_error(x...) \
144 if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) \
145 pr_info_ratelimited(x); \
146 if (binder_stop_on_user_error) \
147 binder_stop_on_user_error = 2; \
150 #define to_flat_binder_object(hdr) \
151 container_of(hdr, struct flat_binder_object, hdr)
153 #define to_binder_fd_object(hdr) container_of(hdr, struct binder_fd_object, hdr)
155 #define to_binder_buffer_object(hdr) \
156 container_of(hdr, struct binder_buffer_object, hdr)
158 #define to_binder_fd_array_object(hdr) \
159 container_of(hdr, struct binder_fd_array_object, hdr)
161 static struct binder_stats binder_stats
;
163 static inline void binder_stats_deleted(enum binder_stat_types type
)
165 atomic_inc(&binder_stats
.obj_deleted
[type
]);
168 static inline void binder_stats_created(enum binder_stat_types type
)
170 atomic_inc(&binder_stats
.obj_created
[type
]);
173 struct binder_transaction_log binder_transaction_log
;
174 struct binder_transaction_log binder_transaction_log_failed
;
176 static struct binder_transaction_log_entry
*binder_transaction_log_add(
177 struct binder_transaction_log
*log
)
179 struct binder_transaction_log_entry
*e
;
180 unsigned int cur
= atomic_inc_return(&log
->cur
);
182 if (cur
>= ARRAY_SIZE(log
->entry
))
184 e
= &log
->entry
[cur
% ARRAY_SIZE(log
->entry
)];
185 WRITE_ONCE(e
->debug_id_done
, 0);
187 * write-barrier to synchronize access to e->debug_id_done.
188 * We make sure the initialized 0 value is seen before
189 * memset() other fields are zeroed by memset.
192 memset(e
, 0, sizeof(*e
));
196 enum binder_deferred_state
{
197 BINDER_DEFERRED_FLUSH
= 0x01,
198 BINDER_DEFERRED_RELEASE
= 0x02,
202 BINDER_LOOPER_STATE_REGISTERED
= 0x01,
203 BINDER_LOOPER_STATE_ENTERED
= 0x02,
204 BINDER_LOOPER_STATE_EXITED
= 0x04,
205 BINDER_LOOPER_STATE_INVALID
= 0x08,
206 BINDER_LOOPER_STATE_WAITING
= 0x10,
207 BINDER_LOOPER_STATE_POLL
= 0x20,
211 * binder_proc_lock() - Acquire outer lock for given binder_proc
212 * @proc: struct binder_proc to acquire
214 * Acquires proc->outer_lock. Used to protect binder_ref
215 * structures associated with the given proc.
217 #define binder_proc_lock(proc) _binder_proc_lock(proc, __LINE__)
219 _binder_proc_lock(struct binder_proc
*proc
, int line
)
220 __acquires(&proc
->outer_lock
)
222 binder_debug(BINDER_DEBUG_SPINLOCKS
,
223 "%s: line=%d\n", __func__
, line
);
224 spin_lock(&proc
->outer_lock
);
228 * binder_proc_unlock() - Release spinlock for given binder_proc
229 * @proc: struct binder_proc to acquire
231 * Release lock acquired via binder_proc_lock()
233 #define binder_proc_unlock(_proc) _binder_proc_unlock(_proc, __LINE__)
235 _binder_proc_unlock(struct binder_proc
*proc
, int line
)
236 __releases(&proc
->outer_lock
)
238 binder_debug(BINDER_DEBUG_SPINLOCKS
,
239 "%s: line=%d\n", __func__
, line
);
240 spin_unlock(&proc
->outer_lock
);
244 * binder_inner_proc_lock() - Acquire inner lock for given binder_proc
245 * @proc: struct binder_proc to acquire
247 * Acquires proc->inner_lock. Used to protect todo lists
249 #define binder_inner_proc_lock(proc) _binder_inner_proc_lock(proc, __LINE__)
251 _binder_inner_proc_lock(struct binder_proc
*proc
, int line
)
252 __acquires(&proc
->inner_lock
)
254 binder_debug(BINDER_DEBUG_SPINLOCKS
,
255 "%s: line=%d\n", __func__
, line
);
256 spin_lock(&proc
->inner_lock
);
260 * binder_inner_proc_unlock() - Release inner lock for given binder_proc
261 * @proc: struct binder_proc to acquire
263 * Release lock acquired via binder_inner_proc_lock()
265 #define binder_inner_proc_unlock(proc) _binder_inner_proc_unlock(proc, __LINE__)
267 _binder_inner_proc_unlock(struct binder_proc
*proc
, int line
)
268 __releases(&proc
->inner_lock
)
270 binder_debug(BINDER_DEBUG_SPINLOCKS
,
271 "%s: line=%d\n", __func__
, line
);
272 spin_unlock(&proc
->inner_lock
);
276 * binder_node_lock() - Acquire spinlock for given binder_node
277 * @node: struct binder_node to acquire
279 * Acquires node->lock. Used to protect binder_node fields
281 #define binder_node_lock(node) _binder_node_lock(node, __LINE__)
283 _binder_node_lock(struct binder_node
*node
, int line
)
284 __acquires(&node
->lock
)
286 binder_debug(BINDER_DEBUG_SPINLOCKS
,
287 "%s: line=%d\n", __func__
, line
);
288 spin_lock(&node
->lock
);
292 * binder_node_unlock() - Release spinlock for given binder_proc
293 * @node: struct binder_node to acquire
295 * Release lock acquired via binder_node_lock()
297 #define binder_node_unlock(node) _binder_node_unlock(node, __LINE__)
299 _binder_node_unlock(struct binder_node
*node
, int line
)
300 __releases(&node
->lock
)
302 binder_debug(BINDER_DEBUG_SPINLOCKS
,
303 "%s: line=%d\n", __func__
, line
);
304 spin_unlock(&node
->lock
);
308 * binder_node_inner_lock() - Acquire node and inner locks
309 * @node: struct binder_node to acquire
311 * Acquires node->lock. If node->proc also acquires
312 * proc->inner_lock. Used to protect binder_node fields
314 #define binder_node_inner_lock(node) _binder_node_inner_lock(node, __LINE__)
316 _binder_node_inner_lock(struct binder_node
*node
, int line
)
317 __acquires(&node
->lock
) __acquires(&node
->proc
->inner_lock
)
319 binder_debug(BINDER_DEBUG_SPINLOCKS
,
320 "%s: line=%d\n", __func__
, line
);
321 spin_lock(&node
->lock
);
323 binder_inner_proc_lock(node
->proc
);
325 /* annotation for sparse */
326 __acquire(&node
->proc
->inner_lock
);
330 * binder_node_unlock() - Release node and inner locks
331 * @node: struct binder_node to acquire
333 * Release lock acquired via binder_node_lock()
335 #define binder_node_inner_unlock(node) _binder_node_inner_unlock(node, __LINE__)
337 _binder_node_inner_unlock(struct binder_node
*node
, int line
)
338 __releases(&node
->lock
) __releases(&node
->proc
->inner_lock
)
340 struct binder_proc
*proc
= node
->proc
;
342 binder_debug(BINDER_DEBUG_SPINLOCKS
,
343 "%s: line=%d\n", __func__
, line
);
345 binder_inner_proc_unlock(proc
);
347 /* annotation for sparse */
348 __release(&node
->proc
->inner_lock
);
349 spin_unlock(&node
->lock
);
352 static bool binder_worklist_empty_ilocked(struct list_head
*list
)
354 return list_empty(list
);
358 * binder_worklist_empty() - Check if no items on the work list
359 * @proc: binder_proc associated with list
360 * @list: list to check
362 * Return: true if there are no items on list, else false
364 static bool binder_worklist_empty(struct binder_proc
*proc
,
365 struct list_head
*list
)
369 binder_inner_proc_lock(proc
);
370 ret
= binder_worklist_empty_ilocked(list
);
371 binder_inner_proc_unlock(proc
);
376 * binder_enqueue_work_ilocked() - Add an item to the work list
377 * @work: struct binder_work to add to list
378 * @target_list: list to add work to
380 * Adds the work to the specified list. Asserts that work
381 * is not already on a list.
383 * Requires the proc->inner_lock to be held.
386 binder_enqueue_work_ilocked(struct binder_work
*work
,
387 struct list_head
*target_list
)
389 BUG_ON(target_list
== NULL
);
390 BUG_ON(work
->entry
.next
&& !list_empty(&work
->entry
));
391 list_add_tail(&work
->entry
, target_list
);
395 * binder_enqueue_deferred_thread_work_ilocked() - Add deferred thread work
396 * @thread: thread to queue work to
397 * @work: struct binder_work to add to list
399 * Adds the work to the todo list of the thread. Doesn't set the process_todo
400 * flag, which means that (if it wasn't already set) the thread will go to
401 * sleep without handling this work when it calls read.
403 * Requires the proc->inner_lock to be held.
406 binder_enqueue_deferred_thread_work_ilocked(struct binder_thread
*thread
,
407 struct binder_work
*work
)
409 WARN_ON(!list_empty(&thread
->waiting_thread_node
));
410 binder_enqueue_work_ilocked(work
, &thread
->todo
);
414 * binder_enqueue_thread_work_ilocked() - Add an item to the thread work list
415 * @thread: thread to queue work to
416 * @work: struct binder_work to add to list
418 * Adds the work to the todo list of the thread, and enables processing
421 * Requires the proc->inner_lock to be held.
424 binder_enqueue_thread_work_ilocked(struct binder_thread
*thread
,
425 struct binder_work
*work
)
427 WARN_ON(!list_empty(&thread
->waiting_thread_node
));
428 binder_enqueue_work_ilocked(work
, &thread
->todo
);
429 thread
->process_todo
= true;
433 * binder_enqueue_thread_work() - Add an item to the thread work list
434 * @thread: thread to queue work to
435 * @work: struct binder_work to add to list
437 * Adds the work to the todo list of the thread, and enables processing
441 binder_enqueue_thread_work(struct binder_thread
*thread
,
442 struct binder_work
*work
)
444 binder_inner_proc_lock(thread
->proc
);
445 binder_enqueue_thread_work_ilocked(thread
, work
);
446 binder_inner_proc_unlock(thread
->proc
);
450 binder_dequeue_work_ilocked(struct binder_work
*work
)
452 list_del_init(&work
->entry
);
456 * binder_dequeue_work() - Removes an item from the work list
457 * @proc: binder_proc associated with list
458 * @work: struct binder_work to remove from list
460 * Removes the specified work item from whatever list it is on.
461 * Can safely be called if work is not on any list.
464 binder_dequeue_work(struct binder_proc
*proc
, struct binder_work
*work
)
466 binder_inner_proc_lock(proc
);
467 binder_dequeue_work_ilocked(work
);
468 binder_inner_proc_unlock(proc
);
471 static struct binder_work
*binder_dequeue_work_head_ilocked(
472 struct list_head
*list
)
474 struct binder_work
*w
;
476 w
= list_first_entry_or_null(list
, struct binder_work
, entry
);
478 list_del_init(&w
->entry
);
483 binder_defer_work(struct binder_proc
*proc
, enum binder_deferred_state defer
);
484 static void binder_free_thread(struct binder_thread
*thread
);
485 static void binder_free_proc(struct binder_proc
*proc
);
486 static void binder_inc_node_tmpref_ilocked(struct binder_node
*node
);
488 static bool binder_has_work_ilocked(struct binder_thread
*thread
,
491 return thread
->process_todo
||
492 thread
->looper_need_return
||
494 !binder_worklist_empty_ilocked(&thread
->proc
->todo
));
497 static bool binder_has_work(struct binder_thread
*thread
, bool do_proc_work
)
501 binder_inner_proc_lock(thread
->proc
);
502 has_work
= binder_has_work_ilocked(thread
, do_proc_work
);
503 binder_inner_proc_unlock(thread
->proc
);
508 static bool binder_available_for_proc_work_ilocked(struct binder_thread
*thread
)
510 return !thread
->transaction_stack
&&
511 binder_worklist_empty_ilocked(&thread
->todo
) &&
512 (thread
->looper
& (BINDER_LOOPER_STATE_ENTERED
|
513 BINDER_LOOPER_STATE_REGISTERED
));
516 static void binder_wakeup_poll_threads_ilocked(struct binder_proc
*proc
,
520 struct binder_thread
*thread
;
522 for (n
= rb_first(&proc
->threads
); n
!= NULL
; n
= rb_next(n
)) {
523 thread
= rb_entry(n
, struct binder_thread
, rb_node
);
524 if (thread
->looper
& BINDER_LOOPER_STATE_POLL
&&
525 binder_available_for_proc_work_ilocked(thread
)) {
527 wake_up_interruptible_sync(&thread
->wait
);
529 wake_up_interruptible(&thread
->wait
);
535 * binder_select_thread_ilocked() - selects a thread for doing proc work.
536 * @proc: process to select a thread from
538 * Note that calling this function moves the thread off the waiting_threads
539 * list, so it can only be woken up by the caller of this function, or a
540 * signal. Therefore, callers *should* always wake up the thread this function
543 * Return: If there's a thread currently waiting for process work,
544 * returns that thread. Otherwise returns NULL.
546 static struct binder_thread
*
547 binder_select_thread_ilocked(struct binder_proc
*proc
)
549 struct binder_thread
*thread
;
551 assert_spin_locked(&proc
->inner_lock
);
552 thread
= list_first_entry_or_null(&proc
->waiting_threads
,
553 struct binder_thread
,
554 waiting_thread_node
);
557 list_del_init(&thread
->waiting_thread_node
);
563 * binder_wakeup_thread_ilocked() - wakes up a thread for doing proc work.
564 * @proc: process to wake up a thread in
565 * @thread: specific thread to wake-up (may be NULL)
566 * @sync: whether to do a synchronous wake-up
568 * This function wakes up a thread in the @proc process.
569 * The caller may provide a specific thread to wake-up in
570 * the @thread parameter. If @thread is NULL, this function
571 * will wake up threads that have called poll().
573 * Note that for this function to work as expected, callers
574 * should first call binder_select_thread() to find a thread
575 * to handle the work (if they don't have a thread already),
576 * and pass the result into the @thread parameter.
578 static void binder_wakeup_thread_ilocked(struct binder_proc
*proc
,
579 struct binder_thread
*thread
,
582 assert_spin_locked(&proc
->inner_lock
);
586 wake_up_interruptible_sync(&thread
->wait
);
588 wake_up_interruptible(&thread
->wait
);
592 /* Didn't find a thread waiting for proc work; this can happen
594 * 1. All threads are busy handling transactions
595 * In that case, one of those threads should call back into
596 * the kernel driver soon and pick up this work.
597 * 2. Threads are using the (e)poll interface, in which case
598 * they may be blocked on the waitqueue without having been
599 * added to waiting_threads. For this case, we just iterate
600 * over all threads not handling transaction work, and
601 * wake them all up. We wake all because we don't know whether
602 * a thread that called into (e)poll is handling non-binder
605 binder_wakeup_poll_threads_ilocked(proc
, sync
);
608 static void binder_wakeup_proc_ilocked(struct binder_proc
*proc
)
610 struct binder_thread
*thread
= binder_select_thread_ilocked(proc
);
612 binder_wakeup_thread_ilocked(proc
, thread
, /* sync = */false);
615 static void binder_set_nice(long nice
)
619 if (can_nice(current
, nice
)) {
620 set_user_nice(current
, nice
);
623 min_nice
= rlimit_to_nice(rlimit(RLIMIT_NICE
));
624 binder_debug(BINDER_DEBUG_PRIORITY_CAP
,
625 "%d: nice value %ld not allowed use %ld instead\n",
626 current
->pid
, nice
, min_nice
);
627 set_user_nice(current
, min_nice
);
628 if (min_nice
<= MAX_NICE
)
630 binder_user_error("%d RLIMIT_NICE not set\n", current
->pid
);
633 static struct binder_node
*binder_get_node_ilocked(struct binder_proc
*proc
,
634 binder_uintptr_t ptr
)
636 struct rb_node
*n
= proc
->nodes
.rb_node
;
637 struct binder_node
*node
;
639 assert_spin_locked(&proc
->inner_lock
);
642 node
= rb_entry(n
, struct binder_node
, rb_node
);
646 else if (ptr
> node
->ptr
)
650 * take an implicit weak reference
651 * to ensure node stays alive until
652 * call to binder_put_node()
654 binder_inc_node_tmpref_ilocked(node
);
661 static struct binder_node
*binder_get_node(struct binder_proc
*proc
,
662 binder_uintptr_t ptr
)
664 struct binder_node
*node
;
666 binder_inner_proc_lock(proc
);
667 node
= binder_get_node_ilocked(proc
, ptr
);
668 binder_inner_proc_unlock(proc
);
672 static struct binder_node
*binder_init_node_ilocked(
673 struct binder_proc
*proc
,
674 struct binder_node
*new_node
,
675 struct flat_binder_object
*fp
)
677 struct rb_node
**p
= &proc
->nodes
.rb_node
;
678 struct rb_node
*parent
= NULL
;
679 struct binder_node
*node
;
680 binder_uintptr_t ptr
= fp
? fp
->binder
: 0;
681 binder_uintptr_t cookie
= fp
? fp
->cookie
: 0;
682 __u32 flags
= fp
? fp
->flags
: 0;
684 assert_spin_locked(&proc
->inner_lock
);
689 node
= rb_entry(parent
, struct binder_node
, rb_node
);
693 else if (ptr
> node
->ptr
)
697 * A matching node is already in
698 * the rb tree. Abandon the init
701 binder_inc_node_tmpref_ilocked(node
);
706 binder_stats_created(BINDER_STAT_NODE
);
708 rb_link_node(&node
->rb_node
, parent
, p
);
709 rb_insert_color(&node
->rb_node
, &proc
->nodes
);
710 node
->debug_id
= atomic_inc_return(&binder_last_id
);
713 node
->cookie
= cookie
;
714 node
->work
.type
= BINDER_WORK_NODE
;
715 node
->min_priority
= flags
& FLAT_BINDER_FLAG_PRIORITY_MASK
;
716 node
->accept_fds
= !!(flags
& FLAT_BINDER_FLAG_ACCEPTS_FDS
);
717 node
->txn_security_ctx
= !!(flags
& FLAT_BINDER_FLAG_TXN_SECURITY_CTX
);
718 spin_lock_init(&node
->lock
);
719 INIT_LIST_HEAD(&node
->work
.entry
);
720 INIT_LIST_HEAD(&node
->async_todo
);
721 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
722 "%d:%d node %d u%016llx c%016llx created\n",
723 proc
->pid
, current
->pid
, node
->debug_id
,
724 (u64
)node
->ptr
, (u64
)node
->cookie
);
729 static struct binder_node
*binder_new_node(struct binder_proc
*proc
,
730 struct flat_binder_object
*fp
)
732 struct binder_node
*node
;
733 struct binder_node
*new_node
= kzalloc(sizeof(*node
), GFP_KERNEL
);
737 binder_inner_proc_lock(proc
);
738 node
= binder_init_node_ilocked(proc
, new_node
, fp
);
739 binder_inner_proc_unlock(proc
);
740 if (node
!= new_node
)
742 * The node was already added by another thread
749 static void binder_free_node(struct binder_node
*node
)
752 binder_stats_deleted(BINDER_STAT_NODE
);
755 static int binder_inc_node_nilocked(struct binder_node
*node
, int strong
,
757 struct list_head
*target_list
)
759 struct binder_proc
*proc
= node
->proc
;
761 assert_spin_locked(&node
->lock
);
763 assert_spin_locked(&proc
->inner_lock
);
766 if (target_list
== NULL
&&
767 node
->internal_strong_refs
== 0 &&
769 node
== node
->proc
->context
->binder_context_mgr_node
&&
770 node
->has_strong_ref
)) {
771 pr_err("invalid inc strong node for %d\n",
775 node
->internal_strong_refs
++;
777 node
->local_strong_refs
++;
778 if (!node
->has_strong_ref
&& target_list
) {
779 struct binder_thread
*thread
= container_of(target_list
,
780 struct binder_thread
, todo
);
781 binder_dequeue_work_ilocked(&node
->work
);
782 BUG_ON(&thread
->todo
!= target_list
);
783 binder_enqueue_deferred_thread_work_ilocked(thread
,
788 node
->local_weak_refs
++;
789 if (!node
->has_weak_ref
&& list_empty(&node
->work
.entry
)) {
790 if (target_list
== NULL
) {
791 pr_err("invalid inc weak node for %d\n",
798 binder_enqueue_work_ilocked(&node
->work
, target_list
);
804 static int binder_inc_node(struct binder_node
*node
, int strong
, int internal
,
805 struct list_head
*target_list
)
809 binder_node_inner_lock(node
);
810 ret
= binder_inc_node_nilocked(node
, strong
, internal
, target_list
);
811 binder_node_inner_unlock(node
);
816 static bool binder_dec_node_nilocked(struct binder_node
*node
,
817 int strong
, int internal
)
819 struct binder_proc
*proc
= node
->proc
;
821 assert_spin_locked(&node
->lock
);
823 assert_spin_locked(&proc
->inner_lock
);
826 node
->internal_strong_refs
--;
828 node
->local_strong_refs
--;
829 if (node
->local_strong_refs
|| node
->internal_strong_refs
)
833 node
->local_weak_refs
--;
834 if (node
->local_weak_refs
|| node
->tmp_refs
||
835 !hlist_empty(&node
->refs
))
839 if (proc
&& (node
->has_strong_ref
|| node
->has_weak_ref
)) {
840 if (list_empty(&node
->work
.entry
)) {
841 binder_enqueue_work_ilocked(&node
->work
, &proc
->todo
);
842 binder_wakeup_proc_ilocked(proc
);
845 if (hlist_empty(&node
->refs
) && !node
->local_strong_refs
&&
846 !node
->local_weak_refs
&& !node
->tmp_refs
) {
848 binder_dequeue_work_ilocked(&node
->work
);
849 rb_erase(&node
->rb_node
, &proc
->nodes
);
850 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
851 "refless node %d deleted\n",
854 BUG_ON(!list_empty(&node
->work
.entry
));
855 spin_lock(&binder_dead_nodes_lock
);
857 * tmp_refs could have changed so
860 if (node
->tmp_refs
) {
861 spin_unlock(&binder_dead_nodes_lock
);
864 hlist_del(&node
->dead_node
);
865 spin_unlock(&binder_dead_nodes_lock
);
866 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
867 "dead node %d deleted\n",
876 static void binder_dec_node(struct binder_node
*node
, int strong
, int internal
)
880 binder_node_inner_lock(node
);
881 free_node
= binder_dec_node_nilocked(node
, strong
, internal
);
882 binder_node_inner_unlock(node
);
884 binder_free_node(node
);
887 static void binder_inc_node_tmpref_ilocked(struct binder_node
*node
)
890 * No call to binder_inc_node() is needed since we
891 * don't need to inform userspace of any changes to
898 * binder_inc_node_tmpref() - take a temporary reference on node
899 * @node: node to reference
901 * Take reference on node to prevent the node from being freed
902 * while referenced only by a local variable. The inner lock is
903 * needed to serialize with the node work on the queue (which
904 * isn't needed after the node is dead). If the node is dead
905 * (node->proc is NULL), use binder_dead_nodes_lock to protect
906 * node->tmp_refs against dead-node-only cases where the node
907 * lock cannot be acquired (eg traversing the dead node list to
910 static void binder_inc_node_tmpref(struct binder_node
*node
)
912 binder_node_lock(node
);
914 binder_inner_proc_lock(node
->proc
);
916 spin_lock(&binder_dead_nodes_lock
);
917 binder_inc_node_tmpref_ilocked(node
);
919 binder_inner_proc_unlock(node
->proc
);
921 spin_unlock(&binder_dead_nodes_lock
);
922 binder_node_unlock(node
);
926 * binder_dec_node_tmpref() - remove a temporary reference on node
927 * @node: node to reference
929 * Release temporary reference on node taken via binder_inc_node_tmpref()
931 static void binder_dec_node_tmpref(struct binder_node
*node
)
935 binder_node_inner_lock(node
);
937 spin_lock(&binder_dead_nodes_lock
);
939 __acquire(&binder_dead_nodes_lock
);
941 BUG_ON(node
->tmp_refs
< 0);
943 spin_unlock(&binder_dead_nodes_lock
);
945 __release(&binder_dead_nodes_lock
);
947 * Call binder_dec_node() to check if all refcounts are 0
948 * and cleanup is needed. Calling with strong=0 and internal=1
949 * causes no actual reference to be released in binder_dec_node().
950 * If that changes, a change is needed here too.
952 free_node
= binder_dec_node_nilocked(node
, 0, 1);
953 binder_node_inner_unlock(node
);
955 binder_free_node(node
);
958 static void binder_put_node(struct binder_node
*node
)
960 binder_dec_node_tmpref(node
);
963 static struct binder_ref
*binder_get_ref_olocked(struct binder_proc
*proc
,
964 u32 desc
, bool need_strong_ref
)
966 struct rb_node
*n
= proc
->refs_by_desc
.rb_node
;
967 struct binder_ref
*ref
;
970 ref
= rb_entry(n
, struct binder_ref
, rb_node_desc
);
972 if (desc
< ref
->data
.desc
) {
974 } else if (desc
> ref
->data
.desc
) {
976 } else if (need_strong_ref
&& !ref
->data
.strong
) {
977 binder_user_error("tried to use weak ref as strong ref\n");
987 * binder_get_ref_for_node_olocked() - get the ref associated with given node
988 * @proc: binder_proc that owns the ref
989 * @node: binder_node of target
990 * @new_ref: newly allocated binder_ref to be initialized or %NULL
992 * Look up the ref for the given node and return it if it exists
994 * If it doesn't exist and the caller provides a newly allocated
995 * ref, initialize the fields of the newly allocated ref and insert
996 * into the given proc rb_trees and node refs list.
998 * Return: the ref for node. It is possible that another thread
999 * allocated/initialized the ref first in which case the
1000 * returned ref would be different than the passed-in
1001 * new_ref. new_ref must be kfree'd by the caller in
1004 static struct binder_ref
*binder_get_ref_for_node_olocked(
1005 struct binder_proc
*proc
,
1006 struct binder_node
*node
,
1007 struct binder_ref
*new_ref
)
1009 struct binder_context
*context
= proc
->context
;
1010 struct rb_node
**p
= &proc
->refs_by_node
.rb_node
;
1011 struct rb_node
*parent
= NULL
;
1012 struct binder_ref
*ref
;
1017 ref
= rb_entry(parent
, struct binder_ref
, rb_node_node
);
1019 if (node
< ref
->node
)
1021 else if (node
> ref
->node
)
1022 p
= &(*p
)->rb_right
;
1029 binder_stats_created(BINDER_STAT_REF
);
1030 new_ref
->data
.debug_id
= atomic_inc_return(&binder_last_id
);
1031 new_ref
->proc
= proc
;
1032 new_ref
->node
= node
;
1033 rb_link_node(&new_ref
->rb_node_node
, parent
, p
);
1034 rb_insert_color(&new_ref
->rb_node_node
, &proc
->refs_by_node
);
1036 new_ref
->data
.desc
= (node
== context
->binder_context_mgr_node
) ? 0 : 1;
1037 for (n
= rb_first(&proc
->refs_by_desc
); n
!= NULL
; n
= rb_next(n
)) {
1038 ref
= rb_entry(n
, struct binder_ref
, rb_node_desc
);
1039 if (ref
->data
.desc
> new_ref
->data
.desc
)
1041 new_ref
->data
.desc
= ref
->data
.desc
+ 1;
1044 p
= &proc
->refs_by_desc
.rb_node
;
1047 ref
= rb_entry(parent
, struct binder_ref
, rb_node_desc
);
1049 if (new_ref
->data
.desc
< ref
->data
.desc
)
1051 else if (new_ref
->data
.desc
> ref
->data
.desc
)
1052 p
= &(*p
)->rb_right
;
1056 rb_link_node(&new_ref
->rb_node_desc
, parent
, p
);
1057 rb_insert_color(&new_ref
->rb_node_desc
, &proc
->refs_by_desc
);
1059 binder_node_lock(node
);
1060 hlist_add_head(&new_ref
->node_entry
, &node
->refs
);
1062 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
1063 "%d new ref %d desc %d for node %d\n",
1064 proc
->pid
, new_ref
->data
.debug_id
, new_ref
->data
.desc
,
1066 binder_node_unlock(node
);
1070 static void binder_cleanup_ref_olocked(struct binder_ref
*ref
)
1072 bool delete_node
= false;
1074 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
1075 "%d delete ref %d desc %d for node %d\n",
1076 ref
->proc
->pid
, ref
->data
.debug_id
, ref
->data
.desc
,
1077 ref
->node
->debug_id
);
1079 rb_erase(&ref
->rb_node_desc
, &ref
->proc
->refs_by_desc
);
1080 rb_erase(&ref
->rb_node_node
, &ref
->proc
->refs_by_node
);
1082 binder_node_inner_lock(ref
->node
);
1083 if (ref
->data
.strong
)
1084 binder_dec_node_nilocked(ref
->node
, 1, 1);
1086 hlist_del(&ref
->node_entry
);
1087 delete_node
= binder_dec_node_nilocked(ref
->node
, 0, 1);
1088 binder_node_inner_unlock(ref
->node
);
1090 * Clear ref->node unless we want the caller to free the node
1094 * The caller uses ref->node to determine
1095 * whether the node needs to be freed. Clear
1096 * it since the node is still alive.
1102 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
1103 "%d delete ref %d desc %d has death notification\n",
1104 ref
->proc
->pid
, ref
->data
.debug_id
,
1106 binder_dequeue_work(ref
->proc
, &ref
->death
->work
);
1107 binder_stats_deleted(BINDER_STAT_DEATH
);
1109 binder_stats_deleted(BINDER_STAT_REF
);
1113 * binder_inc_ref_olocked() - increment the ref for given handle
1114 * @ref: ref to be incremented
1115 * @strong: if true, strong increment, else weak
1116 * @target_list: list to queue node work on
1118 * Increment the ref. @ref->proc->outer_lock must be held on entry
1120 * Return: 0, if successful, else errno
1122 static int binder_inc_ref_olocked(struct binder_ref
*ref
, int strong
,
1123 struct list_head
*target_list
)
1128 if (ref
->data
.strong
== 0) {
1129 ret
= binder_inc_node(ref
->node
, 1, 1, target_list
);
1135 if (ref
->data
.weak
== 0) {
1136 ret
= binder_inc_node(ref
->node
, 0, 1, target_list
);
1146 * binder_dec_ref() - dec the ref for given handle
1147 * @ref: ref to be decremented
1148 * @strong: if true, strong decrement, else weak
1150 * Decrement the ref.
1152 * Return: true if ref is cleaned up and ready to be freed
1154 static bool binder_dec_ref_olocked(struct binder_ref
*ref
, int strong
)
1157 if (ref
->data
.strong
== 0) {
1158 binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n",
1159 ref
->proc
->pid
, ref
->data
.debug_id
,
1160 ref
->data
.desc
, ref
->data
.strong
,
1165 if (ref
->data
.strong
== 0)
1166 binder_dec_node(ref
->node
, strong
, 1);
1168 if (ref
->data
.weak
== 0) {
1169 binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n",
1170 ref
->proc
->pid
, ref
->data
.debug_id
,
1171 ref
->data
.desc
, ref
->data
.strong
,
1177 if (ref
->data
.strong
== 0 && ref
->data
.weak
== 0) {
1178 binder_cleanup_ref_olocked(ref
);
1185 * binder_get_node_from_ref() - get the node from the given proc/desc
1186 * @proc: proc containing the ref
1187 * @desc: the handle associated with the ref
1188 * @need_strong_ref: if true, only return node if ref is strong
1189 * @rdata: the id/refcount data for the ref
1191 * Given a proc and ref handle, return the associated binder_node
1193 * Return: a binder_node or NULL if not found or not strong when strong required
1195 static struct binder_node
*binder_get_node_from_ref(
1196 struct binder_proc
*proc
,
1197 u32 desc
, bool need_strong_ref
,
1198 struct binder_ref_data
*rdata
)
1200 struct binder_node
*node
;
1201 struct binder_ref
*ref
;
1203 binder_proc_lock(proc
);
1204 ref
= binder_get_ref_olocked(proc
, desc
, need_strong_ref
);
1209 * Take an implicit reference on the node to ensure
1210 * it stays alive until the call to binder_put_node()
1212 binder_inc_node_tmpref(node
);
1215 binder_proc_unlock(proc
);
1220 binder_proc_unlock(proc
);
1225 * binder_free_ref() - free the binder_ref
1228 * Free the binder_ref. Free the binder_node indicated by ref->node
1229 * (if non-NULL) and the binder_ref_death indicated by ref->death.
1231 static void binder_free_ref(struct binder_ref
*ref
)
1234 binder_free_node(ref
->node
);
1240 * binder_update_ref_for_handle() - inc/dec the ref for given handle
1241 * @proc: proc containing the ref
1242 * @desc: the handle associated with the ref
1243 * @increment: true=inc reference, false=dec reference
1244 * @strong: true=strong reference, false=weak reference
1245 * @rdata: the id/refcount data for the ref
1247 * Given a proc and ref handle, increment or decrement the ref
1248 * according to "increment" arg.
1250 * Return: 0 if successful, else errno
1252 static int binder_update_ref_for_handle(struct binder_proc
*proc
,
1253 uint32_t desc
, bool increment
, bool strong
,
1254 struct binder_ref_data
*rdata
)
1257 struct binder_ref
*ref
;
1258 bool delete_ref
= false;
1260 binder_proc_lock(proc
);
1261 ref
= binder_get_ref_olocked(proc
, desc
, strong
);
1267 ret
= binder_inc_ref_olocked(ref
, strong
, NULL
);
1269 delete_ref
= binder_dec_ref_olocked(ref
, strong
);
1273 binder_proc_unlock(proc
);
1276 binder_free_ref(ref
);
1280 binder_proc_unlock(proc
);
1285 * binder_dec_ref_for_handle() - dec the ref for given handle
1286 * @proc: proc containing the ref
1287 * @desc: the handle associated with the ref
1288 * @strong: true=strong reference, false=weak reference
1289 * @rdata: the id/refcount data for the ref
1291 * Just calls binder_update_ref_for_handle() to decrement the ref.
1293 * Return: 0 if successful, else errno
1295 static int binder_dec_ref_for_handle(struct binder_proc
*proc
,
1296 uint32_t desc
, bool strong
, struct binder_ref_data
*rdata
)
1298 return binder_update_ref_for_handle(proc
, desc
, false, strong
, rdata
);
1303 * binder_inc_ref_for_node() - increment the ref for given proc/node
1304 * @proc: proc containing the ref
1305 * @node: target node
1306 * @strong: true=strong reference, false=weak reference
1307 * @target_list: worklist to use if node is incremented
1308 * @rdata: the id/refcount data for the ref
1310 * Given a proc and node, increment the ref. Create the ref if it
1311 * doesn't already exist
1313 * Return: 0 if successful, else errno
1315 static int binder_inc_ref_for_node(struct binder_proc
*proc
,
1316 struct binder_node
*node
,
1318 struct list_head
*target_list
,
1319 struct binder_ref_data
*rdata
)
1321 struct binder_ref
*ref
;
1322 struct binder_ref
*new_ref
= NULL
;
1325 binder_proc_lock(proc
);
1326 ref
= binder_get_ref_for_node_olocked(proc
, node
, NULL
);
1328 binder_proc_unlock(proc
);
1329 new_ref
= kzalloc(sizeof(*ref
), GFP_KERNEL
);
1332 binder_proc_lock(proc
);
1333 ref
= binder_get_ref_for_node_olocked(proc
, node
, new_ref
);
1335 ret
= binder_inc_ref_olocked(ref
, strong
, target_list
);
1337 binder_proc_unlock(proc
);
1338 if (new_ref
&& ref
!= new_ref
)
1340 * Another thread created the ref first so
1341 * free the one we allocated
1347 static void binder_pop_transaction_ilocked(struct binder_thread
*target_thread
,
1348 struct binder_transaction
*t
)
1350 BUG_ON(!target_thread
);
1351 assert_spin_locked(&target_thread
->proc
->inner_lock
);
1352 BUG_ON(target_thread
->transaction_stack
!= t
);
1353 BUG_ON(target_thread
->transaction_stack
->from
!= target_thread
);
1354 target_thread
->transaction_stack
=
1355 target_thread
->transaction_stack
->from_parent
;
1360 * binder_thread_dec_tmpref() - decrement thread->tmp_ref
1361 * @thread: thread to decrement
1363 * A thread needs to be kept alive while being used to create or
1364 * handle a transaction. binder_get_txn_from() is used to safely
1365 * extract t->from from a binder_transaction and keep the thread
1366 * indicated by t->from from being freed. When done with that
1367 * binder_thread, this function is called to decrement the
1368 * tmp_ref and free if appropriate (thread has been released
1369 * and no transaction being processed by the driver)
1371 static void binder_thread_dec_tmpref(struct binder_thread
*thread
)
1374 * atomic is used to protect the counter value while
1375 * it cannot reach zero or thread->is_dead is false
1377 binder_inner_proc_lock(thread
->proc
);
1378 atomic_dec(&thread
->tmp_ref
);
1379 if (thread
->is_dead
&& !atomic_read(&thread
->tmp_ref
)) {
1380 binder_inner_proc_unlock(thread
->proc
);
1381 binder_free_thread(thread
);
1384 binder_inner_proc_unlock(thread
->proc
);
1388 * binder_proc_dec_tmpref() - decrement proc->tmp_ref
1389 * @proc: proc to decrement
1391 * A binder_proc needs to be kept alive while being used to create or
1392 * handle a transaction. proc->tmp_ref is incremented when
1393 * creating a new transaction or the binder_proc is currently in-use
1394 * by threads that are being released. When done with the binder_proc,
1395 * this function is called to decrement the counter and free the
1396 * proc if appropriate (proc has been released, all threads have
1397 * been released and not currenly in-use to process a transaction).
1399 static void binder_proc_dec_tmpref(struct binder_proc
*proc
)
1401 binder_inner_proc_lock(proc
);
1403 if (proc
->is_dead
&& RB_EMPTY_ROOT(&proc
->threads
) &&
1405 binder_inner_proc_unlock(proc
);
1406 binder_free_proc(proc
);
1409 binder_inner_proc_unlock(proc
);
1413 * binder_get_txn_from() - safely extract the "from" thread in transaction
1414 * @t: binder transaction for t->from
1416 * Atomically return the "from" thread and increment the tmp_ref
1417 * count for the thread to ensure it stays alive until
1418 * binder_thread_dec_tmpref() is called.
1420 * Return: the value of t->from
1422 static struct binder_thread
*binder_get_txn_from(
1423 struct binder_transaction
*t
)
1425 struct binder_thread
*from
;
1427 spin_lock(&t
->lock
);
1430 atomic_inc(&from
->tmp_ref
);
1431 spin_unlock(&t
->lock
);
1436 * binder_get_txn_from_and_acq_inner() - get t->from and acquire inner lock
1437 * @t: binder transaction for t->from
1439 * Same as binder_get_txn_from() except it also acquires the proc->inner_lock
1440 * to guarantee that the thread cannot be released while operating on it.
1441 * The caller must call binder_inner_proc_unlock() to release the inner lock
1442 * as well as call binder_dec_thread_txn() to release the reference.
1444 * Return: the value of t->from
1446 static struct binder_thread
*binder_get_txn_from_and_acq_inner(
1447 struct binder_transaction
*t
)
1448 __acquires(&t
->from
->proc
->inner_lock
)
1450 struct binder_thread
*from
;
1452 from
= binder_get_txn_from(t
);
1454 __acquire(&from
->proc
->inner_lock
);
1457 binder_inner_proc_lock(from
->proc
);
1459 BUG_ON(from
!= t
->from
);
1462 binder_inner_proc_unlock(from
->proc
);
1463 __acquire(&from
->proc
->inner_lock
);
1464 binder_thread_dec_tmpref(from
);
1469 * binder_free_txn_fixups() - free unprocessed fd fixups
1470 * @t: binder transaction for t->from
1472 * If the transaction is being torn down prior to being
1473 * processed by the target process, free all of the
1474 * fd fixups and fput the file structs. It is safe to
1475 * call this function after the fixups have been
1476 * processed -- in that case, the list will be empty.
1478 static void binder_free_txn_fixups(struct binder_transaction
*t
)
1480 struct binder_txn_fd_fixup
*fixup
, *tmp
;
1482 list_for_each_entry_safe(fixup
, tmp
, &t
->fd_fixups
, fixup_entry
) {
1484 list_del(&fixup
->fixup_entry
);
1489 static void binder_txn_latency_free(struct binder_transaction
*t
)
1491 int from_proc
, from_thread
, to_proc
, to_thread
;
1493 spin_lock(&t
->lock
);
1494 from_proc
= t
->from
? t
->from
->proc
->pid
: 0;
1495 from_thread
= t
->from
? t
->from
->pid
: 0;
1496 to_proc
= t
->to_proc
? t
->to_proc
->pid
: 0;
1497 to_thread
= t
->to_thread
? t
->to_thread
->pid
: 0;
1498 spin_unlock(&t
->lock
);
1500 trace_binder_txn_latency_free(t
, from_proc
, from_thread
, to_proc
, to_thread
);
1503 static void binder_free_transaction(struct binder_transaction
*t
)
1505 struct binder_proc
*target_proc
= t
->to_proc
;
1508 binder_inner_proc_lock(target_proc
);
1510 t
->buffer
->transaction
= NULL
;
1511 binder_inner_proc_unlock(target_proc
);
1513 if (trace_binder_txn_latency_free_enabled())
1514 binder_txn_latency_free(t
);
1516 * If the transaction has no target_proc, then
1517 * t->buffer->transaction has already been cleared.
1519 binder_free_txn_fixups(t
);
1521 binder_stats_deleted(BINDER_STAT_TRANSACTION
);
1524 static void binder_send_failed_reply(struct binder_transaction
*t
,
1525 uint32_t error_code
)
1527 struct binder_thread
*target_thread
;
1528 struct binder_transaction
*next
;
1530 BUG_ON(t
->flags
& TF_ONE_WAY
);
1532 target_thread
= binder_get_txn_from_and_acq_inner(t
);
1533 if (target_thread
) {
1534 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION
,
1535 "send failed reply for transaction %d to %d:%d\n",
1537 target_thread
->proc
->pid
,
1538 target_thread
->pid
);
1540 binder_pop_transaction_ilocked(target_thread
, t
);
1541 if (target_thread
->reply_error
.cmd
== BR_OK
) {
1542 target_thread
->reply_error
.cmd
= error_code
;
1543 binder_enqueue_thread_work_ilocked(
1545 &target_thread
->reply_error
.work
);
1546 wake_up_interruptible(&target_thread
->wait
);
1549 * Cannot get here for normal operation, but
1550 * we can if multiple synchronous transactions
1551 * are sent without blocking for responses.
1552 * Just ignore the 2nd error in this case.
1554 pr_warn("Unexpected reply error: %u\n",
1555 target_thread
->reply_error
.cmd
);
1557 binder_inner_proc_unlock(target_thread
->proc
);
1558 binder_thread_dec_tmpref(target_thread
);
1559 binder_free_transaction(t
);
1562 __release(&target_thread
->proc
->inner_lock
);
1563 next
= t
->from_parent
;
1565 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION
,
1566 "send failed reply for transaction %d, target dead\n",
1569 binder_free_transaction(t
);
1571 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
1572 "reply failed, no target thread at root\n");
1576 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
1577 "reply failed, no target thread -- retry %d\n",
1583 * binder_cleanup_transaction() - cleans up undelivered transaction
1584 * @t: transaction that needs to be cleaned up
1585 * @reason: reason the transaction wasn't delivered
1586 * @error_code: error to return to caller (if synchronous call)
1588 static void binder_cleanup_transaction(struct binder_transaction
*t
,
1590 uint32_t error_code
)
1592 if (t
->buffer
->target_node
&& !(t
->flags
& TF_ONE_WAY
)) {
1593 binder_send_failed_reply(t
, error_code
);
1595 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
1596 "undelivered transaction %d, %s\n",
1597 t
->debug_id
, reason
);
1598 binder_free_transaction(t
);
1603 * binder_get_object() - gets object and checks for valid metadata
1604 * @proc: binder_proc owning the buffer
1605 * @buffer: binder_buffer that we're parsing.
1606 * @offset: offset in the @buffer at which to validate an object.
1607 * @object: struct binder_object to read into
1609 * Return: If there's a valid metadata object at @offset in @buffer, the
1610 * size of that object. Otherwise, it returns zero. The object
1611 * is read into the struct binder_object pointed to by @object.
1613 static size_t binder_get_object(struct binder_proc
*proc
,
1614 struct binder_buffer
*buffer
,
1615 unsigned long offset
,
1616 struct binder_object
*object
)
1619 struct binder_object_header
*hdr
;
1620 size_t object_size
= 0;
1622 read_size
= min_t(size_t, sizeof(*object
), buffer
->data_size
- offset
);
1623 if (offset
> buffer
->data_size
|| read_size
< sizeof(*hdr
) ||
1624 binder_alloc_copy_from_buffer(&proc
->alloc
, object
, buffer
,
1628 /* Ok, now see if we read a complete object. */
1630 switch (hdr
->type
) {
1631 case BINDER_TYPE_BINDER
:
1632 case BINDER_TYPE_WEAK_BINDER
:
1633 case BINDER_TYPE_HANDLE
:
1634 case BINDER_TYPE_WEAK_HANDLE
:
1635 object_size
= sizeof(struct flat_binder_object
);
1637 case BINDER_TYPE_FD
:
1638 object_size
= sizeof(struct binder_fd_object
);
1640 case BINDER_TYPE_PTR
:
1641 object_size
= sizeof(struct binder_buffer_object
);
1643 case BINDER_TYPE_FDA
:
1644 object_size
= sizeof(struct binder_fd_array_object
);
1649 if (offset
<= buffer
->data_size
- object_size
&&
1650 buffer
->data_size
>= object_size
)
1657 * binder_validate_ptr() - validates binder_buffer_object in a binder_buffer.
1658 * @proc: binder_proc owning the buffer
1659 * @b: binder_buffer containing the object
1660 * @object: struct binder_object to read into
1661 * @index: index in offset array at which the binder_buffer_object is
1663 * @start_offset: points to the start of the offset array
1664 * @object_offsetp: offset of @object read from @b
1665 * @num_valid: the number of valid offsets in the offset array
1667 * Return: If @index is within the valid range of the offset array
1668 * described by @start and @num_valid, and if there's a valid
1669 * binder_buffer_object at the offset found in index @index
1670 * of the offset array, that object is returned. Otherwise,
1671 * %NULL is returned.
1672 * Note that the offset found in index @index itself is not
1673 * verified; this function assumes that @num_valid elements
1674 * from @start were previously verified to have valid offsets.
1675 * If @object_offsetp is non-NULL, then the offset within
1676 * @b is written to it.
1678 static struct binder_buffer_object
*binder_validate_ptr(
1679 struct binder_proc
*proc
,
1680 struct binder_buffer
*b
,
1681 struct binder_object
*object
,
1682 binder_size_t index
,
1683 binder_size_t start_offset
,
1684 binder_size_t
*object_offsetp
,
1685 binder_size_t num_valid
)
1688 binder_size_t object_offset
;
1689 unsigned long buffer_offset
;
1691 if (index
>= num_valid
)
1694 buffer_offset
= start_offset
+ sizeof(binder_size_t
) * index
;
1695 if (binder_alloc_copy_from_buffer(&proc
->alloc
, &object_offset
,
1697 sizeof(object_offset
)))
1699 object_size
= binder_get_object(proc
, b
, object_offset
, object
);
1700 if (!object_size
|| object
->hdr
.type
!= BINDER_TYPE_PTR
)
1703 *object_offsetp
= object_offset
;
1705 return &object
->bbo
;
1709 * binder_validate_fixup() - validates pointer/fd fixups happen in order.
1710 * @proc: binder_proc owning the buffer
1711 * @b: transaction buffer
1712 * @objects_start_offset: offset to start of objects buffer
1713 * @buffer_obj_offset: offset to binder_buffer_object in which to fix up
1714 * @fixup_offset: start offset in @buffer to fix up
1715 * @last_obj_offset: offset to last binder_buffer_object that we fixed
1716 * @last_min_offset: minimum fixup offset in object at @last_obj_offset
1718 * Return: %true if a fixup in buffer @buffer at offset @offset is
1721 * For safety reasons, we only allow fixups inside a buffer to happen
1722 * at increasing offsets; additionally, we only allow fixup on the last
1723 * buffer object that was verified, or one of its parents.
1725 * Example of what is allowed:
1728 * B (parent = A, offset = 0)
1729 * C (parent = A, offset = 16)
1730 * D (parent = C, offset = 0)
1731 * E (parent = A, offset = 32) // min_offset is 16 (C.parent_offset)
1733 * Examples of what is not allowed:
1735 * Decreasing offsets within the same parent:
1737 * C (parent = A, offset = 16)
1738 * B (parent = A, offset = 0) // decreasing offset within A
1740 * Referring to a parent that wasn't the last object or any of its parents:
1742 * B (parent = A, offset = 0)
1743 * C (parent = A, offset = 0)
1744 * C (parent = A, offset = 16)
1745 * D (parent = B, offset = 0) // B is not A or any of A's parents
1747 static bool binder_validate_fixup(struct binder_proc
*proc
,
1748 struct binder_buffer
*b
,
1749 binder_size_t objects_start_offset
,
1750 binder_size_t buffer_obj_offset
,
1751 binder_size_t fixup_offset
,
1752 binder_size_t last_obj_offset
,
1753 binder_size_t last_min_offset
)
1755 if (!last_obj_offset
) {
1756 /* Nothing to fix up in */
1760 while (last_obj_offset
!= buffer_obj_offset
) {
1761 unsigned long buffer_offset
;
1762 struct binder_object last_object
;
1763 struct binder_buffer_object
*last_bbo
;
1764 size_t object_size
= binder_get_object(proc
, b
, last_obj_offset
,
1766 if (object_size
!= sizeof(*last_bbo
))
1769 last_bbo
= &last_object
.bbo
;
1771 * Safe to retrieve the parent of last_obj, since it
1772 * was already previously verified by the driver.
1774 if ((last_bbo
->flags
& BINDER_BUFFER_FLAG_HAS_PARENT
) == 0)
1776 last_min_offset
= last_bbo
->parent_offset
+ sizeof(uintptr_t);
1777 buffer_offset
= objects_start_offset
+
1778 sizeof(binder_size_t
) * last_bbo
->parent
;
1779 if (binder_alloc_copy_from_buffer(&proc
->alloc
,
1782 sizeof(last_obj_offset
)))
1785 return (fixup_offset
>= last_min_offset
);
1789 * struct binder_task_work_cb - for deferred close
1791 * @twork: callback_head for task work
1794 * Structure to pass task work to be handled after
1795 * returning from binder_ioctl() via task_work_add().
1797 struct binder_task_work_cb
{
1798 struct callback_head twork
;
1803 * binder_do_fd_close() - close list of file descriptors
1804 * @twork: callback head for task work
1806 * It is not safe to call ksys_close() during the binder_ioctl()
1807 * function if there is a chance that binder's own file descriptor
1808 * might be closed. This is to meet the requirements for using
1809 * fdget() (see comments for __fget_light()). Therefore use
1810 * task_work_add() to schedule the close operation once we have
1811 * returned from binder_ioctl(). This function is a callback
1812 * for that mechanism and does the actual ksys_close() on the
1813 * given file descriptor.
1815 static void binder_do_fd_close(struct callback_head
*twork
)
1817 struct binder_task_work_cb
*twcb
= container_of(twork
,
1818 struct binder_task_work_cb
, twork
);
1825 * binder_deferred_fd_close() - schedule a close for the given file-descriptor
1826 * @fd: file-descriptor to close
1828 * See comments in binder_do_fd_close(). This function is used to schedule
1829 * a file-descriptor to be closed after returning from binder_ioctl().
1831 static void binder_deferred_fd_close(int fd
)
1833 struct binder_task_work_cb
*twcb
;
1835 twcb
= kzalloc(sizeof(*twcb
), GFP_KERNEL
);
1838 init_task_work(&twcb
->twork
, binder_do_fd_close
);
1839 close_fd_get_file(fd
, &twcb
->file
);
1841 filp_close(twcb
->file
, current
->files
);
1842 task_work_add(current
, &twcb
->twork
, TWA_RESUME
);
1848 static void binder_transaction_buffer_release(struct binder_proc
*proc
,
1849 struct binder_buffer
*buffer
,
1850 binder_size_t failed_at
,
1853 int debug_id
= buffer
->debug_id
;
1854 binder_size_t off_start_offset
, buffer_offset
, off_end_offset
;
1856 binder_debug(BINDER_DEBUG_TRANSACTION
,
1857 "%d buffer release %d, size %zd-%zd, failed at %llx\n",
1858 proc
->pid
, buffer
->debug_id
,
1859 buffer
->data_size
, buffer
->offsets_size
,
1860 (unsigned long long)failed_at
);
1862 if (buffer
->target_node
)
1863 binder_dec_node(buffer
->target_node
, 1, 0);
1865 off_start_offset
= ALIGN(buffer
->data_size
, sizeof(void *));
1866 off_end_offset
= is_failure
? failed_at
:
1867 off_start_offset
+ buffer
->offsets_size
;
1868 for (buffer_offset
= off_start_offset
; buffer_offset
< off_end_offset
;
1869 buffer_offset
+= sizeof(binder_size_t
)) {
1870 struct binder_object_header
*hdr
;
1871 size_t object_size
= 0;
1872 struct binder_object object
;
1873 binder_size_t object_offset
;
1875 if (!binder_alloc_copy_from_buffer(&proc
->alloc
, &object_offset
,
1876 buffer
, buffer_offset
,
1877 sizeof(object_offset
)))
1878 object_size
= binder_get_object(proc
, buffer
,
1879 object_offset
, &object
);
1880 if (object_size
== 0) {
1881 pr_err("transaction release %d bad object at offset %lld, size %zd\n",
1882 debug_id
, (u64
)object_offset
, buffer
->data_size
);
1886 switch (hdr
->type
) {
1887 case BINDER_TYPE_BINDER
:
1888 case BINDER_TYPE_WEAK_BINDER
: {
1889 struct flat_binder_object
*fp
;
1890 struct binder_node
*node
;
1892 fp
= to_flat_binder_object(hdr
);
1893 node
= binder_get_node(proc
, fp
->binder
);
1895 pr_err("transaction release %d bad node %016llx\n",
1896 debug_id
, (u64
)fp
->binder
);
1899 binder_debug(BINDER_DEBUG_TRANSACTION
,
1900 " node %d u%016llx\n",
1901 node
->debug_id
, (u64
)node
->ptr
);
1902 binder_dec_node(node
, hdr
->type
== BINDER_TYPE_BINDER
,
1904 binder_put_node(node
);
1906 case BINDER_TYPE_HANDLE
:
1907 case BINDER_TYPE_WEAK_HANDLE
: {
1908 struct flat_binder_object
*fp
;
1909 struct binder_ref_data rdata
;
1912 fp
= to_flat_binder_object(hdr
);
1913 ret
= binder_dec_ref_for_handle(proc
, fp
->handle
,
1914 hdr
->type
== BINDER_TYPE_HANDLE
, &rdata
);
1917 pr_err("transaction release %d bad handle %d, ret = %d\n",
1918 debug_id
, fp
->handle
, ret
);
1921 binder_debug(BINDER_DEBUG_TRANSACTION
,
1922 " ref %d desc %d\n",
1923 rdata
.debug_id
, rdata
.desc
);
1926 case BINDER_TYPE_FD
: {
1928 * No need to close the file here since user-space
1929 * closes it for for successfully delivered
1930 * transactions. For transactions that weren't
1931 * delivered, the new fd was never allocated so
1932 * there is no need to close and the fput on the
1933 * file is done when the transaction is torn
1937 case BINDER_TYPE_PTR
:
1939 * Nothing to do here, this will get cleaned up when the
1940 * transaction buffer gets freed
1943 case BINDER_TYPE_FDA
: {
1944 struct binder_fd_array_object
*fda
;
1945 struct binder_buffer_object
*parent
;
1946 struct binder_object ptr_object
;
1947 binder_size_t fda_offset
;
1949 binder_size_t fd_buf_size
;
1950 binder_size_t num_valid
;
1952 if (proc
->tsk
!= current
->group_leader
) {
1954 * Nothing to do if running in sender context
1955 * The fd fixups have not been applied so no
1956 * fds need to be closed.
1961 num_valid
= (buffer_offset
- off_start_offset
) /
1962 sizeof(binder_size_t
);
1963 fda
= to_binder_fd_array_object(hdr
);
1964 parent
= binder_validate_ptr(proc
, buffer
, &ptr_object
,
1970 pr_err("transaction release %d bad parent offset\n",
1974 fd_buf_size
= sizeof(u32
) * fda
->num_fds
;
1975 if (fda
->num_fds
>= SIZE_MAX
/ sizeof(u32
)) {
1976 pr_err("transaction release %d invalid number of fds (%lld)\n",
1977 debug_id
, (u64
)fda
->num_fds
);
1980 if (fd_buf_size
> parent
->length
||
1981 fda
->parent_offset
> parent
->length
- fd_buf_size
) {
1982 /* No space for all file descriptors here. */
1983 pr_err("transaction release %d not enough space for %lld fds in buffer\n",
1984 debug_id
, (u64
)fda
->num_fds
);
1988 * the source data for binder_buffer_object is visible
1989 * to user-space and the @buffer element is the user
1990 * pointer to the buffer_object containing the fd_array.
1991 * Convert the address to an offset relative to
1992 * the base of the transaction buffer.
1995 (parent
->buffer
- (uintptr_t)buffer
->user_data
) +
1997 for (fd_index
= 0; fd_index
< fda
->num_fds
;
2001 binder_size_t offset
= fda_offset
+
2002 fd_index
* sizeof(fd
);
2004 err
= binder_alloc_copy_from_buffer(
2005 &proc
->alloc
, &fd
, buffer
,
2006 offset
, sizeof(fd
));
2009 binder_deferred_fd_close(fd
);
2013 pr_err("transaction release %d bad object type %x\n",
2014 debug_id
, hdr
->type
);
2020 static int binder_translate_binder(struct flat_binder_object
*fp
,
2021 struct binder_transaction
*t
,
2022 struct binder_thread
*thread
)
2024 struct binder_node
*node
;
2025 struct binder_proc
*proc
= thread
->proc
;
2026 struct binder_proc
*target_proc
= t
->to_proc
;
2027 struct binder_ref_data rdata
;
2030 node
= binder_get_node(proc
, fp
->binder
);
2032 node
= binder_new_node(proc
, fp
);
2036 if (fp
->cookie
!= node
->cookie
) {
2037 binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
2038 proc
->pid
, thread
->pid
, (u64
)fp
->binder
,
2039 node
->debug_id
, (u64
)fp
->cookie
,
2044 if (security_binder_transfer_binder(proc
->tsk
, target_proc
->tsk
)) {
2049 ret
= binder_inc_ref_for_node(target_proc
, node
,
2050 fp
->hdr
.type
== BINDER_TYPE_BINDER
,
2051 &thread
->todo
, &rdata
);
2055 if (fp
->hdr
.type
== BINDER_TYPE_BINDER
)
2056 fp
->hdr
.type
= BINDER_TYPE_HANDLE
;
2058 fp
->hdr
.type
= BINDER_TYPE_WEAK_HANDLE
;
2060 fp
->handle
= rdata
.desc
;
2063 trace_binder_transaction_node_to_ref(t
, node
, &rdata
);
2064 binder_debug(BINDER_DEBUG_TRANSACTION
,
2065 " node %d u%016llx -> ref %d desc %d\n",
2066 node
->debug_id
, (u64
)node
->ptr
,
2067 rdata
.debug_id
, rdata
.desc
);
2069 binder_put_node(node
);
2073 static int binder_translate_handle(struct flat_binder_object
*fp
,
2074 struct binder_transaction
*t
,
2075 struct binder_thread
*thread
)
2077 struct binder_proc
*proc
= thread
->proc
;
2078 struct binder_proc
*target_proc
= t
->to_proc
;
2079 struct binder_node
*node
;
2080 struct binder_ref_data src_rdata
;
2083 node
= binder_get_node_from_ref(proc
, fp
->handle
,
2084 fp
->hdr
.type
== BINDER_TYPE_HANDLE
, &src_rdata
);
2086 binder_user_error("%d:%d got transaction with invalid handle, %d\n",
2087 proc
->pid
, thread
->pid
, fp
->handle
);
2090 if (security_binder_transfer_binder(proc
->tsk
, target_proc
->tsk
)) {
2095 binder_node_lock(node
);
2096 if (node
->proc
== target_proc
) {
2097 if (fp
->hdr
.type
== BINDER_TYPE_HANDLE
)
2098 fp
->hdr
.type
= BINDER_TYPE_BINDER
;
2100 fp
->hdr
.type
= BINDER_TYPE_WEAK_BINDER
;
2101 fp
->binder
= node
->ptr
;
2102 fp
->cookie
= node
->cookie
;
2104 binder_inner_proc_lock(node
->proc
);
2106 __acquire(&node
->proc
->inner_lock
);
2107 binder_inc_node_nilocked(node
,
2108 fp
->hdr
.type
== BINDER_TYPE_BINDER
,
2111 binder_inner_proc_unlock(node
->proc
);
2113 __release(&node
->proc
->inner_lock
);
2114 trace_binder_transaction_ref_to_node(t
, node
, &src_rdata
);
2115 binder_debug(BINDER_DEBUG_TRANSACTION
,
2116 " ref %d desc %d -> node %d u%016llx\n",
2117 src_rdata
.debug_id
, src_rdata
.desc
, node
->debug_id
,
2119 binder_node_unlock(node
);
2121 struct binder_ref_data dest_rdata
;
2123 binder_node_unlock(node
);
2124 ret
= binder_inc_ref_for_node(target_proc
, node
,
2125 fp
->hdr
.type
== BINDER_TYPE_HANDLE
,
2131 fp
->handle
= dest_rdata
.desc
;
2133 trace_binder_transaction_ref_to_ref(t
, node
, &src_rdata
,
2135 binder_debug(BINDER_DEBUG_TRANSACTION
,
2136 " ref %d desc %d -> ref %d desc %d (node %d)\n",
2137 src_rdata
.debug_id
, src_rdata
.desc
,
2138 dest_rdata
.debug_id
, dest_rdata
.desc
,
2142 binder_put_node(node
);
2146 static int binder_translate_fd(u32 fd
, binder_size_t fd_offset
,
2147 struct binder_transaction
*t
,
2148 struct binder_thread
*thread
,
2149 struct binder_transaction
*in_reply_to
)
2151 struct binder_proc
*proc
= thread
->proc
;
2152 struct binder_proc
*target_proc
= t
->to_proc
;
2153 struct binder_txn_fd_fixup
*fixup
;
2156 bool target_allows_fd
;
2159 target_allows_fd
= !!(in_reply_to
->flags
& TF_ACCEPT_FDS
);
2161 target_allows_fd
= t
->buffer
->target_node
->accept_fds
;
2162 if (!target_allows_fd
) {
2163 binder_user_error("%d:%d got %s with fd, %d, but target does not allow fds\n",
2164 proc
->pid
, thread
->pid
,
2165 in_reply_to
? "reply" : "transaction",
2168 goto err_fd_not_accepted
;
2173 binder_user_error("%d:%d got transaction with invalid fd, %d\n",
2174 proc
->pid
, thread
->pid
, fd
);
2178 ret
= security_binder_transfer_file(proc
->tsk
, target_proc
->tsk
, file
);
2185 * Add fixup record for this transaction. The allocation
2186 * of the fd in the target needs to be done from a
2189 fixup
= kzalloc(sizeof(*fixup
), GFP_KERNEL
);
2195 fixup
->offset
= fd_offset
;
2196 trace_binder_transaction_fd_send(t
, fd
, fixup
->offset
);
2197 list_add_tail(&fixup
->fixup_entry
, &t
->fd_fixups
);
2205 err_fd_not_accepted
:
2209 static int binder_translate_fd_array(struct binder_fd_array_object
*fda
,
2210 struct binder_buffer_object
*parent
,
2211 struct binder_transaction
*t
,
2212 struct binder_thread
*thread
,
2213 struct binder_transaction
*in_reply_to
)
2215 binder_size_t fdi
, fd_buf_size
;
2216 binder_size_t fda_offset
;
2217 struct binder_proc
*proc
= thread
->proc
;
2218 struct binder_proc
*target_proc
= t
->to_proc
;
2220 fd_buf_size
= sizeof(u32
) * fda
->num_fds
;
2221 if (fda
->num_fds
>= SIZE_MAX
/ sizeof(u32
)) {
2222 binder_user_error("%d:%d got transaction with invalid number of fds (%lld)\n",
2223 proc
->pid
, thread
->pid
, (u64
)fda
->num_fds
);
2226 if (fd_buf_size
> parent
->length
||
2227 fda
->parent_offset
> parent
->length
- fd_buf_size
) {
2228 /* No space for all file descriptors here. */
2229 binder_user_error("%d:%d not enough space to store %lld fds in buffer\n",
2230 proc
->pid
, thread
->pid
, (u64
)fda
->num_fds
);
2234 * the source data for binder_buffer_object is visible
2235 * to user-space and the @buffer element is the user
2236 * pointer to the buffer_object containing the fd_array.
2237 * Convert the address to an offset relative to
2238 * the base of the transaction buffer.
2240 fda_offset
= (parent
->buffer
- (uintptr_t)t
->buffer
->user_data
) +
2242 if (!IS_ALIGNED((unsigned long)fda_offset
, sizeof(u32
))) {
2243 binder_user_error("%d:%d parent offset not aligned correctly.\n",
2244 proc
->pid
, thread
->pid
);
2247 for (fdi
= 0; fdi
< fda
->num_fds
; fdi
++) {
2250 binder_size_t offset
= fda_offset
+ fdi
* sizeof(fd
);
2252 ret
= binder_alloc_copy_from_buffer(&target_proc
->alloc
,
2254 offset
, sizeof(fd
));
2256 ret
= binder_translate_fd(fd
, offset
, t
, thread
,
2264 static int binder_fixup_parent(struct binder_transaction
*t
,
2265 struct binder_thread
*thread
,
2266 struct binder_buffer_object
*bp
,
2267 binder_size_t off_start_offset
,
2268 binder_size_t num_valid
,
2269 binder_size_t last_fixup_obj_off
,
2270 binder_size_t last_fixup_min_off
)
2272 struct binder_buffer_object
*parent
;
2273 struct binder_buffer
*b
= t
->buffer
;
2274 struct binder_proc
*proc
= thread
->proc
;
2275 struct binder_proc
*target_proc
= t
->to_proc
;
2276 struct binder_object object
;
2277 binder_size_t buffer_offset
;
2278 binder_size_t parent_offset
;
2280 if (!(bp
->flags
& BINDER_BUFFER_FLAG_HAS_PARENT
))
2283 parent
= binder_validate_ptr(target_proc
, b
, &object
, bp
->parent
,
2284 off_start_offset
, &parent_offset
,
2287 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2288 proc
->pid
, thread
->pid
);
2292 if (!binder_validate_fixup(target_proc
, b
, off_start_offset
,
2293 parent_offset
, bp
->parent_offset
,
2295 last_fixup_min_off
)) {
2296 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
2297 proc
->pid
, thread
->pid
);
2301 if (parent
->length
< sizeof(binder_uintptr_t
) ||
2302 bp
->parent_offset
> parent
->length
- sizeof(binder_uintptr_t
)) {
2303 /* No space for a pointer here! */
2304 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2305 proc
->pid
, thread
->pid
);
2308 buffer_offset
= bp
->parent_offset
+
2309 (uintptr_t)parent
->buffer
- (uintptr_t)b
->user_data
;
2310 if (binder_alloc_copy_to_buffer(&target_proc
->alloc
, b
, buffer_offset
,
2311 &bp
->buffer
, sizeof(bp
->buffer
))) {
2312 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2313 proc
->pid
, thread
->pid
);
2321 * binder_proc_transaction() - sends a transaction to a process and wakes it up
2322 * @t: transaction to send
2323 * @proc: process to send the transaction to
2324 * @thread: thread in @proc to send the transaction to (may be NULL)
2326 * This function queues a transaction to the specified process. It will try
2327 * to find a thread in the target process to handle the transaction and
2328 * wake it up. If no thread is found, the work is queued to the proc
2331 * If the @thread parameter is not NULL, the transaction is always queued
2332 * to the waitlist of that specific thread.
2334 * Return: true if the transactions was successfully queued
2335 * false if the target process or thread is dead
2337 static bool binder_proc_transaction(struct binder_transaction
*t
,
2338 struct binder_proc
*proc
,
2339 struct binder_thread
*thread
)
2341 struct binder_node
*node
= t
->buffer
->target_node
;
2342 bool oneway
= !!(t
->flags
& TF_ONE_WAY
);
2343 bool pending_async
= false;
2346 binder_node_lock(node
);
2349 if (node
->has_async_transaction
)
2350 pending_async
= true;
2352 node
->has_async_transaction
= true;
2355 binder_inner_proc_lock(proc
);
2357 if (proc
->is_dead
|| (thread
&& thread
->is_dead
)) {
2358 binder_inner_proc_unlock(proc
);
2359 binder_node_unlock(node
);
2363 if (!thread
&& !pending_async
)
2364 thread
= binder_select_thread_ilocked(proc
);
2367 binder_enqueue_thread_work_ilocked(thread
, &t
->work
);
2368 else if (!pending_async
)
2369 binder_enqueue_work_ilocked(&t
->work
, &proc
->todo
);
2371 binder_enqueue_work_ilocked(&t
->work
, &node
->async_todo
);
2374 binder_wakeup_thread_ilocked(proc
, thread
, !oneway
/* sync */);
2376 binder_inner_proc_unlock(proc
);
2377 binder_node_unlock(node
);
2383 * binder_get_node_refs_for_txn() - Get required refs on node for txn
2384 * @node: struct binder_node for which to get refs
2385 * @proc: returns @node->proc if valid
2386 * @error: if no @proc then returns BR_DEAD_REPLY
2388 * User-space normally keeps the node alive when creating a transaction
2389 * since it has a reference to the target. The local strong ref keeps it
2390 * alive if the sending process dies before the target process processes
2391 * the transaction. If the source process is malicious or has a reference
2392 * counting bug, relying on the local strong ref can fail.
2394 * Since user-space can cause the local strong ref to go away, we also take
2395 * a tmpref on the node to ensure it survives while we are constructing
2396 * the transaction. We also need a tmpref on the proc while we are
2397 * constructing the transaction, so we take that here as well.
2399 * Return: The target_node with refs taken or NULL if no @node->proc is NULL.
2400 * Also sets @proc if valid. If the @node->proc is NULL indicating that the
2401 * target proc has died, @error is set to BR_DEAD_REPLY
2403 static struct binder_node
*binder_get_node_refs_for_txn(
2404 struct binder_node
*node
,
2405 struct binder_proc
**procp
,
2408 struct binder_node
*target_node
= NULL
;
2410 binder_node_inner_lock(node
);
2413 binder_inc_node_nilocked(node
, 1, 0, NULL
);
2414 binder_inc_node_tmpref_ilocked(node
);
2415 node
->proc
->tmp_ref
++;
2416 *procp
= node
->proc
;
2418 *error
= BR_DEAD_REPLY
;
2419 binder_node_inner_unlock(node
);
2424 static void binder_transaction(struct binder_proc
*proc
,
2425 struct binder_thread
*thread
,
2426 struct binder_transaction_data
*tr
, int reply
,
2427 binder_size_t extra_buffers_size
)
2430 struct binder_transaction
*t
;
2431 struct binder_work
*w
;
2432 struct binder_work
*tcomplete
;
2433 binder_size_t buffer_offset
= 0;
2434 binder_size_t off_start_offset
, off_end_offset
;
2435 binder_size_t off_min
;
2436 binder_size_t sg_buf_offset
, sg_buf_end_offset
;
2437 struct binder_proc
*target_proc
= NULL
;
2438 struct binder_thread
*target_thread
= NULL
;
2439 struct binder_node
*target_node
= NULL
;
2440 struct binder_transaction
*in_reply_to
= NULL
;
2441 struct binder_transaction_log_entry
*e
;
2442 uint32_t return_error
= 0;
2443 uint32_t return_error_param
= 0;
2444 uint32_t return_error_line
= 0;
2445 binder_size_t last_fixup_obj_off
= 0;
2446 binder_size_t last_fixup_min_off
= 0;
2447 struct binder_context
*context
= proc
->context
;
2448 int t_debug_id
= atomic_inc_return(&binder_last_id
);
2449 char *secctx
= NULL
;
2452 e
= binder_transaction_log_add(&binder_transaction_log
);
2453 e
->debug_id
= t_debug_id
;
2454 e
->call_type
= reply
? 2 : !!(tr
->flags
& TF_ONE_WAY
);
2455 e
->from_proc
= proc
->pid
;
2456 e
->from_thread
= thread
->pid
;
2457 e
->target_handle
= tr
->target
.handle
;
2458 e
->data_size
= tr
->data_size
;
2459 e
->offsets_size
= tr
->offsets_size
;
2460 strscpy(e
->context_name
, proc
->context
->name
, BINDERFS_MAX_NAME
);
2463 binder_inner_proc_lock(proc
);
2464 in_reply_to
= thread
->transaction_stack
;
2465 if (in_reply_to
== NULL
) {
2466 binder_inner_proc_unlock(proc
);
2467 binder_user_error("%d:%d got reply transaction with no transaction stack\n",
2468 proc
->pid
, thread
->pid
);
2469 return_error
= BR_FAILED_REPLY
;
2470 return_error_param
= -EPROTO
;
2471 return_error_line
= __LINE__
;
2472 goto err_empty_call_stack
;
2474 if (in_reply_to
->to_thread
!= thread
) {
2475 spin_lock(&in_reply_to
->lock
);
2476 binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
2477 proc
->pid
, thread
->pid
, in_reply_to
->debug_id
,
2478 in_reply_to
->to_proc
?
2479 in_reply_to
->to_proc
->pid
: 0,
2480 in_reply_to
->to_thread
?
2481 in_reply_to
->to_thread
->pid
: 0);
2482 spin_unlock(&in_reply_to
->lock
);
2483 binder_inner_proc_unlock(proc
);
2484 return_error
= BR_FAILED_REPLY
;
2485 return_error_param
= -EPROTO
;
2486 return_error_line
= __LINE__
;
2488 goto err_bad_call_stack
;
2490 thread
->transaction_stack
= in_reply_to
->to_parent
;
2491 binder_inner_proc_unlock(proc
);
2492 binder_set_nice(in_reply_to
->saved_priority
);
2493 target_thread
= binder_get_txn_from_and_acq_inner(in_reply_to
);
2494 if (target_thread
== NULL
) {
2495 /* annotation for sparse */
2496 __release(&target_thread
->proc
->inner_lock
);
2497 return_error
= BR_DEAD_REPLY
;
2498 return_error_line
= __LINE__
;
2499 goto err_dead_binder
;
2501 if (target_thread
->transaction_stack
!= in_reply_to
) {
2502 binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
2503 proc
->pid
, thread
->pid
,
2504 target_thread
->transaction_stack
?
2505 target_thread
->transaction_stack
->debug_id
: 0,
2506 in_reply_to
->debug_id
);
2507 binder_inner_proc_unlock(target_thread
->proc
);
2508 return_error
= BR_FAILED_REPLY
;
2509 return_error_param
= -EPROTO
;
2510 return_error_line
= __LINE__
;
2512 target_thread
= NULL
;
2513 goto err_dead_binder
;
2515 target_proc
= target_thread
->proc
;
2516 target_proc
->tmp_ref
++;
2517 binder_inner_proc_unlock(target_thread
->proc
);
2519 if (tr
->target
.handle
) {
2520 struct binder_ref
*ref
;
2523 * There must already be a strong ref
2524 * on this node. If so, do a strong
2525 * increment on the node to ensure it
2526 * stays alive until the transaction is
2529 binder_proc_lock(proc
);
2530 ref
= binder_get_ref_olocked(proc
, tr
->target
.handle
,
2533 target_node
= binder_get_node_refs_for_txn(
2534 ref
->node
, &target_proc
,
2537 binder_user_error("%d:%d got transaction to invalid handle\n",
2538 proc
->pid
, thread
->pid
);
2539 return_error
= BR_FAILED_REPLY
;
2541 binder_proc_unlock(proc
);
2543 mutex_lock(&context
->context_mgr_node_lock
);
2544 target_node
= context
->binder_context_mgr_node
;
2546 target_node
= binder_get_node_refs_for_txn(
2547 target_node
, &target_proc
,
2550 return_error
= BR_DEAD_REPLY
;
2551 mutex_unlock(&context
->context_mgr_node_lock
);
2552 if (target_node
&& target_proc
->pid
== proc
->pid
) {
2553 binder_user_error("%d:%d got transaction to context manager from process owning it\n",
2554 proc
->pid
, thread
->pid
);
2555 return_error
= BR_FAILED_REPLY
;
2556 return_error_param
= -EINVAL
;
2557 return_error_line
= __LINE__
;
2558 goto err_invalid_target_handle
;
2563 * return_error is set above
2565 return_error_param
= -EINVAL
;
2566 return_error_line
= __LINE__
;
2567 goto err_dead_binder
;
2569 e
->to_node
= target_node
->debug_id
;
2570 if (WARN_ON(proc
== target_proc
)) {
2571 return_error
= BR_FAILED_REPLY
;
2572 return_error_param
= -EINVAL
;
2573 return_error_line
= __LINE__
;
2574 goto err_invalid_target_handle
;
2576 if (security_binder_transaction(proc
->tsk
,
2577 target_proc
->tsk
) < 0) {
2578 return_error
= BR_FAILED_REPLY
;
2579 return_error_param
= -EPERM
;
2580 return_error_line
= __LINE__
;
2581 goto err_invalid_target_handle
;
2583 binder_inner_proc_lock(proc
);
2585 w
= list_first_entry_or_null(&thread
->todo
,
2586 struct binder_work
, entry
);
2587 if (!(tr
->flags
& TF_ONE_WAY
) && w
&&
2588 w
->type
== BINDER_WORK_TRANSACTION
) {
2590 * Do not allow new outgoing transaction from a
2591 * thread that has a transaction at the head of
2592 * its todo list. Only need to check the head
2593 * because binder_select_thread_ilocked picks a
2594 * thread from proc->waiting_threads to enqueue
2595 * the transaction, and nothing is queued to the
2596 * todo list while the thread is on waiting_threads.
2598 binder_user_error("%d:%d new transaction not allowed when there is a transaction on thread todo\n",
2599 proc
->pid
, thread
->pid
);
2600 binder_inner_proc_unlock(proc
);
2601 return_error
= BR_FAILED_REPLY
;
2602 return_error_param
= -EPROTO
;
2603 return_error_line
= __LINE__
;
2604 goto err_bad_todo_list
;
2607 if (!(tr
->flags
& TF_ONE_WAY
) && thread
->transaction_stack
) {
2608 struct binder_transaction
*tmp
;
2610 tmp
= thread
->transaction_stack
;
2611 if (tmp
->to_thread
!= thread
) {
2612 spin_lock(&tmp
->lock
);
2613 binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
2614 proc
->pid
, thread
->pid
, tmp
->debug_id
,
2615 tmp
->to_proc
? tmp
->to_proc
->pid
: 0,
2617 tmp
->to_thread
->pid
: 0);
2618 spin_unlock(&tmp
->lock
);
2619 binder_inner_proc_unlock(proc
);
2620 return_error
= BR_FAILED_REPLY
;
2621 return_error_param
= -EPROTO
;
2622 return_error_line
= __LINE__
;
2623 goto err_bad_call_stack
;
2626 struct binder_thread
*from
;
2628 spin_lock(&tmp
->lock
);
2630 if (from
&& from
->proc
== target_proc
) {
2631 atomic_inc(&from
->tmp_ref
);
2632 target_thread
= from
;
2633 spin_unlock(&tmp
->lock
);
2636 spin_unlock(&tmp
->lock
);
2637 tmp
= tmp
->from_parent
;
2640 binder_inner_proc_unlock(proc
);
2643 e
->to_thread
= target_thread
->pid
;
2644 e
->to_proc
= target_proc
->pid
;
2646 /* TODO: reuse incoming transaction for reply */
2647 t
= kzalloc(sizeof(*t
), GFP_KERNEL
);
2649 return_error
= BR_FAILED_REPLY
;
2650 return_error_param
= -ENOMEM
;
2651 return_error_line
= __LINE__
;
2652 goto err_alloc_t_failed
;
2654 INIT_LIST_HEAD(&t
->fd_fixups
);
2655 binder_stats_created(BINDER_STAT_TRANSACTION
);
2656 spin_lock_init(&t
->lock
);
2658 tcomplete
= kzalloc(sizeof(*tcomplete
), GFP_KERNEL
);
2659 if (tcomplete
== NULL
) {
2660 return_error
= BR_FAILED_REPLY
;
2661 return_error_param
= -ENOMEM
;
2662 return_error_line
= __LINE__
;
2663 goto err_alloc_tcomplete_failed
;
2665 binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE
);
2667 t
->debug_id
= t_debug_id
;
2670 binder_debug(BINDER_DEBUG_TRANSACTION
,
2671 "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld-%lld\n",
2672 proc
->pid
, thread
->pid
, t
->debug_id
,
2673 target_proc
->pid
, target_thread
->pid
,
2674 (u64
)tr
->data
.ptr
.buffer
,
2675 (u64
)tr
->data
.ptr
.offsets
,
2676 (u64
)tr
->data_size
, (u64
)tr
->offsets_size
,
2677 (u64
)extra_buffers_size
);
2679 binder_debug(BINDER_DEBUG_TRANSACTION
,
2680 "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld-%lld\n",
2681 proc
->pid
, thread
->pid
, t
->debug_id
,
2682 target_proc
->pid
, target_node
->debug_id
,
2683 (u64
)tr
->data
.ptr
.buffer
,
2684 (u64
)tr
->data
.ptr
.offsets
,
2685 (u64
)tr
->data_size
, (u64
)tr
->offsets_size
,
2686 (u64
)extra_buffers_size
);
2688 if (!reply
&& !(tr
->flags
& TF_ONE_WAY
))
2692 t
->sender_euid
= task_euid(proc
->tsk
);
2693 t
->to_proc
= target_proc
;
2694 t
->to_thread
= target_thread
;
2696 t
->flags
= tr
->flags
;
2697 t
->priority
= task_nice(current
);
2699 if (target_node
&& target_node
->txn_security_ctx
) {
2703 security_task_getsecid(proc
->tsk
, &secid
);
2704 ret
= security_secid_to_secctx(secid
, &secctx
, &secctx_sz
);
2706 return_error
= BR_FAILED_REPLY
;
2707 return_error_param
= ret
;
2708 return_error_line
= __LINE__
;
2709 goto err_get_secctx_failed
;
2711 added_size
= ALIGN(secctx_sz
, sizeof(u64
));
2712 extra_buffers_size
+= added_size
;
2713 if (extra_buffers_size
< added_size
) {
2714 /* integer overflow of extra_buffers_size */
2715 return_error
= BR_FAILED_REPLY
;
2716 return_error_param
= -EINVAL
;
2717 return_error_line
= __LINE__
;
2718 goto err_bad_extra_size
;
2722 trace_binder_transaction(reply
, t
, target_node
);
2724 t
->buffer
= binder_alloc_new_buf(&target_proc
->alloc
, tr
->data_size
,
2725 tr
->offsets_size
, extra_buffers_size
,
2726 !reply
&& (t
->flags
& TF_ONE_WAY
), current
->tgid
);
2727 if (IS_ERR(t
->buffer
)) {
2729 * -ESRCH indicates VMA cleared. The target is dying.
2731 return_error_param
= PTR_ERR(t
->buffer
);
2732 return_error
= return_error_param
== -ESRCH
?
2733 BR_DEAD_REPLY
: BR_FAILED_REPLY
;
2734 return_error_line
= __LINE__
;
2736 goto err_binder_alloc_buf_failed
;
2740 size_t buf_offset
= ALIGN(tr
->data_size
, sizeof(void *)) +
2741 ALIGN(tr
->offsets_size
, sizeof(void *)) +
2742 ALIGN(extra_buffers_size
, sizeof(void *)) -
2743 ALIGN(secctx_sz
, sizeof(u64
));
2745 t
->security_ctx
= (uintptr_t)t
->buffer
->user_data
+ buf_offset
;
2746 err
= binder_alloc_copy_to_buffer(&target_proc
->alloc
,
2747 t
->buffer
, buf_offset
,
2750 t
->security_ctx
= 0;
2753 security_release_secctx(secctx
, secctx_sz
);
2756 t
->buffer
->debug_id
= t
->debug_id
;
2757 t
->buffer
->transaction
= t
;
2758 t
->buffer
->target_node
= target_node
;
2759 t
->buffer
->clear_on_free
= !!(t
->flags
& TF_CLEAR_BUF
);
2760 trace_binder_transaction_alloc_buf(t
->buffer
);
2762 if (binder_alloc_copy_user_to_buffer(
2763 &target_proc
->alloc
,
2765 (const void __user
*)
2766 (uintptr_t)tr
->data
.ptr
.buffer
,
2768 binder_user_error("%d:%d got transaction with invalid data ptr\n",
2769 proc
->pid
, thread
->pid
);
2770 return_error
= BR_FAILED_REPLY
;
2771 return_error_param
= -EFAULT
;
2772 return_error_line
= __LINE__
;
2773 goto err_copy_data_failed
;
2775 if (binder_alloc_copy_user_to_buffer(
2776 &target_proc
->alloc
,
2778 ALIGN(tr
->data_size
, sizeof(void *)),
2779 (const void __user
*)
2780 (uintptr_t)tr
->data
.ptr
.offsets
,
2781 tr
->offsets_size
)) {
2782 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
2783 proc
->pid
, thread
->pid
);
2784 return_error
= BR_FAILED_REPLY
;
2785 return_error_param
= -EFAULT
;
2786 return_error_line
= __LINE__
;
2787 goto err_copy_data_failed
;
2789 if (!IS_ALIGNED(tr
->offsets_size
, sizeof(binder_size_t
))) {
2790 binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
2791 proc
->pid
, thread
->pid
, (u64
)tr
->offsets_size
);
2792 return_error
= BR_FAILED_REPLY
;
2793 return_error_param
= -EINVAL
;
2794 return_error_line
= __LINE__
;
2795 goto err_bad_offset
;
2797 if (!IS_ALIGNED(extra_buffers_size
, sizeof(u64
))) {
2798 binder_user_error("%d:%d got transaction with unaligned buffers size, %lld\n",
2799 proc
->pid
, thread
->pid
,
2800 (u64
)extra_buffers_size
);
2801 return_error
= BR_FAILED_REPLY
;
2802 return_error_param
= -EINVAL
;
2803 return_error_line
= __LINE__
;
2804 goto err_bad_offset
;
2806 off_start_offset
= ALIGN(tr
->data_size
, sizeof(void *));
2807 buffer_offset
= off_start_offset
;
2808 off_end_offset
= off_start_offset
+ tr
->offsets_size
;
2809 sg_buf_offset
= ALIGN(off_end_offset
, sizeof(void *));
2810 sg_buf_end_offset
= sg_buf_offset
+ extra_buffers_size
-
2811 ALIGN(secctx_sz
, sizeof(u64
));
2813 for (buffer_offset
= off_start_offset
; buffer_offset
< off_end_offset
;
2814 buffer_offset
+= sizeof(binder_size_t
)) {
2815 struct binder_object_header
*hdr
;
2817 struct binder_object object
;
2818 binder_size_t object_offset
;
2820 if (binder_alloc_copy_from_buffer(&target_proc
->alloc
,
2824 sizeof(object_offset
))) {
2825 return_error
= BR_FAILED_REPLY
;
2826 return_error_param
= -EINVAL
;
2827 return_error_line
= __LINE__
;
2828 goto err_bad_offset
;
2830 object_size
= binder_get_object(target_proc
, t
->buffer
,
2831 object_offset
, &object
);
2832 if (object_size
== 0 || object_offset
< off_min
) {
2833 binder_user_error("%d:%d got transaction with invalid offset (%lld, min %lld max %lld) or object.\n",
2834 proc
->pid
, thread
->pid
,
2837 (u64
)t
->buffer
->data_size
);
2838 return_error
= BR_FAILED_REPLY
;
2839 return_error_param
= -EINVAL
;
2840 return_error_line
= __LINE__
;
2841 goto err_bad_offset
;
2845 off_min
= object_offset
+ object_size
;
2846 switch (hdr
->type
) {
2847 case BINDER_TYPE_BINDER
:
2848 case BINDER_TYPE_WEAK_BINDER
: {
2849 struct flat_binder_object
*fp
;
2851 fp
= to_flat_binder_object(hdr
);
2852 ret
= binder_translate_binder(fp
, t
, thread
);
2855 binder_alloc_copy_to_buffer(&target_proc
->alloc
,
2859 return_error
= BR_FAILED_REPLY
;
2860 return_error_param
= ret
;
2861 return_error_line
= __LINE__
;
2862 goto err_translate_failed
;
2865 case BINDER_TYPE_HANDLE
:
2866 case BINDER_TYPE_WEAK_HANDLE
: {
2867 struct flat_binder_object
*fp
;
2869 fp
= to_flat_binder_object(hdr
);
2870 ret
= binder_translate_handle(fp
, t
, thread
);
2872 binder_alloc_copy_to_buffer(&target_proc
->alloc
,
2876 return_error
= BR_FAILED_REPLY
;
2877 return_error_param
= ret
;
2878 return_error_line
= __LINE__
;
2879 goto err_translate_failed
;
2883 case BINDER_TYPE_FD
: {
2884 struct binder_fd_object
*fp
= to_binder_fd_object(hdr
);
2885 binder_size_t fd_offset
= object_offset
+
2886 (uintptr_t)&fp
->fd
- (uintptr_t)fp
;
2887 int ret
= binder_translate_fd(fp
->fd
, fd_offset
, t
,
2888 thread
, in_reply_to
);
2892 binder_alloc_copy_to_buffer(&target_proc
->alloc
,
2896 return_error
= BR_FAILED_REPLY
;
2897 return_error_param
= ret
;
2898 return_error_line
= __LINE__
;
2899 goto err_translate_failed
;
2902 case BINDER_TYPE_FDA
: {
2903 struct binder_object ptr_object
;
2904 binder_size_t parent_offset
;
2905 struct binder_fd_array_object
*fda
=
2906 to_binder_fd_array_object(hdr
);
2907 size_t num_valid
= (buffer_offset
- off_start_offset
) /
2908 sizeof(binder_size_t
);
2909 struct binder_buffer_object
*parent
=
2910 binder_validate_ptr(target_proc
, t
->buffer
,
2911 &ptr_object
, fda
->parent
,
2916 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2917 proc
->pid
, thread
->pid
);
2918 return_error
= BR_FAILED_REPLY
;
2919 return_error_param
= -EINVAL
;
2920 return_error_line
= __LINE__
;
2921 goto err_bad_parent
;
2923 if (!binder_validate_fixup(target_proc
, t
->buffer
,
2928 last_fixup_min_off
)) {
2929 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
2930 proc
->pid
, thread
->pid
);
2931 return_error
= BR_FAILED_REPLY
;
2932 return_error_param
= -EINVAL
;
2933 return_error_line
= __LINE__
;
2934 goto err_bad_parent
;
2936 ret
= binder_translate_fd_array(fda
, parent
, t
, thread
,
2939 return_error
= BR_FAILED_REPLY
;
2940 return_error_param
= ret
;
2941 return_error_line
= __LINE__
;
2942 goto err_translate_failed
;
2944 last_fixup_obj_off
= parent_offset
;
2945 last_fixup_min_off
=
2946 fda
->parent_offset
+ sizeof(u32
) * fda
->num_fds
;
2948 case BINDER_TYPE_PTR
: {
2949 struct binder_buffer_object
*bp
=
2950 to_binder_buffer_object(hdr
);
2951 size_t buf_left
= sg_buf_end_offset
- sg_buf_offset
;
2954 if (bp
->length
> buf_left
) {
2955 binder_user_error("%d:%d got transaction with too large buffer\n",
2956 proc
->pid
, thread
->pid
);
2957 return_error
= BR_FAILED_REPLY
;
2958 return_error_param
= -EINVAL
;
2959 return_error_line
= __LINE__
;
2960 goto err_bad_offset
;
2962 if (binder_alloc_copy_user_to_buffer(
2963 &target_proc
->alloc
,
2966 (const void __user
*)
2967 (uintptr_t)bp
->buffer
,
2969 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
2970 proc
->pid
, thread
->pid
);
2971 return_error_param
= -EFAULT
;
2972 return_error
= BR_FAILED_REPLY
;
2973 return_error_line
= __LINE__
;
2974 goto err_copy_data_failed
;
2976 /* Fixup buffer pointer to target proc address space */
2977 bp
->buffer
= (uintptr_t)
2978 t
->buffer
->user_data
+ sg_buf_offset
;
2979 sg_buf_offset
+= ALIGN(bp
->length
, sizeof(u64
));
2981 num_valid
= (buffer_offset
- off_start_offset
) /
2982 sizeof(binder_size_t
);
2983 ret
= binder_fixup_parent(t
, thread
, bp
,
2987 last_fixup_min_off
);
2989 binder_alloc_copy_to_buffer(&target_proc
->alloc
,
2993 return_error
= BR_FAILED_REPLY
;
2994 return_error_param
= ret
;
2995 return_error_line
= __LINE__
;
2996 goto err_translate_failed
;
2998 last_fixup_obj_off
= object_offset
;
2999 last_fixup_min_off
= 0;
3002 binder_user_error("%d:%d got transaction with invalid object type, %x\n",
3003 proc
->pid
, thread
->pid
, hdr
->type
);
3004 return_error
= BR_FAILED_REPLY
;
3005 return_error_param
= -EINVAL
;
3006 return_error_line
= __LINE__
;
3007 goto err_bad_object_type
;
3010 tcomplete
->type
= BINDER_WORK_TRANSACTION_COMPLETE
;
3011 t
->work
.type
= BINDER_WORK_TRANSACTION
;
3014 binder_enqueue_thread_work(thread
, tcomplete
);
3015 binder_inner_proc_lock(target_proc
);
3016 if (target_thread
->is_dead
) {
3017 binder_inner_proc_unlock(target_proc
);
3018 goto err_dead_proc_or_thread
;
3020 BUG_ON(t
->buffer
->async_transaction
!= 0);
3021 binder_pop_transaction_ilocked(target_thread
, in_reply_to
);
3022 binder_enqueue_thread_work_ilocked(target_thread
, &t
->work
);
3023 binder_inner_proc_unlock(target_proc
);
3024 wake_up_interruptible_sync(&target_thread
->wait
);
3025 binder_free_transaction(in_reply_to
);
3026 } else if (!(t
->flags
& TF_ONE_WAY
)) {
3027 BUG_ON(t
->buffer
->async_transaction
!= 0);
3028 binder_inner_proc_lock(proc
);
3030 * Defer the TRANSACTION_COMPLETE, so we don't return to
3031 * userspace immediately; this allows the target process to
3032 * immediately start processing this transaction, reducing
3033 * latency. We will then return the TRANSACTION_COMPLETE when
3034 * the target replies (or there is an error).
3036 binder_enqueue_deferred_thread_work_ilocked(thread
, tcomplete
);
3038 t
->from_parent
= thread
->transaction_stack
;
3039 thread
->transaction_stack
= t
;
3040 binder_inner_proc_unlock(proc
);
3041 if (!binder_proc_transaction(t
, target_proc
, target_thread
)) {
3042 binder_inner_proc_lock(proc
);
3043 binder_pop_transaction_ilocked(thread
, t
);
3044 binder_inner_proc_unlock(proc
);
3045 goto err_dead_proc_or_thread
;
3048 BUG_ON(target_node
== NULL
);
3049 BUG_ON(t
->buffer
->async_transaction
!= 1);
3050 binder_enqueue_thread_work(thread
, tcomplete
);
3051 if (!binder_proc_transaction(t
, target_proc
, NULL
))
3052 goto err_dead_proc_or_thread
;
3055 binder_thread_dec_tmpref(target_thread
);
3056 binder_proc_dec_tmpref(target_proc
);
3058 binder_dec_node_tmpref(target_node
);
3060 * write barrier to synchronize with initialization
3064 WRITE_ONCE(e
->debug_id_done
, t_debug_id
);
3067 err_dead_proc_or_thread
:
3068 return_error
= BR_DEAD_REPLY
;
3069 return_error_line
= __LINE__
;
3070 binder_dequeue_work(proc
, tcomplete
);
3071 err_translate_failed
:
3072 err_bad_object_type
:
3075 err_copy_data_failed
:
3076 binder_free_txn_fixups(t
);
3077 trace_binder_transaction_failed_buffer_release(t
->buffer
);
3078 binder_transaction_buffer_release(target_proc
, t
->buffer
,
3079 buffer_offset
, true);
3081 binder_dec_node_tmpref(target_node
);
3083 t
->buffer
->transaction
= NULL
;
3084 binder_alloc_free_buf(&target_proc
->alloc
, t
->buffer
);
3085 err_binder_alloc_buf_failed
:
3088 security_release_secctx(secctx
, secctx_sz
);
3089 err_get_secctx_failed
:
3091 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE
);
3092 err_alloc_tcomplete_failed
:
3093 if (trace_binder_txn_latency_free_enabled())
3094 binder_txn_latency_free(t
);
3096 binder_stats_deleted(BINDER_STAT_TRANSACTION
);
3100 err_empty_call_stack
:
3102 err_invalid_target_handle
:
3104 binder_thread_dec_tmpref(target_thread
);
3106 binder_proc_dec_tmpref(target_proc
);
3108 binder_dec_node(target_node
, 1, 0);
3109 binder_dec_node_tmpref(target_node
);
3112 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION
,
3113 "%d:%d transaction failed %d/%d, size %lld-%lld line %d\n",
3114 proc
->pid
, thread
->pid
, return_error
, return_error_param
,
3115 (u64
)tr
->data_size
, (u64
)tr
->offsets_size
,
3119 struct binder_transaction_log_entry
*fe
;
3121 e
->return_error
= return_error
;
3122 e
->return_error_param
= return_error_param
;
3123 e
->return_error_line
= return_error_line
;
3124 fe
= binder_transaction_log_add(&binder_transaction_log_failed
);
3127 * write barrier to synchronize with initialization
3131 WRITE_ONCE(e
->debug_id_done
, t_debug_id
);
3132 WRITE_ONCE(fe
->debug_id_done
, t_debug_id
);
3135 BUG_ON(thread
->return_error
.cmd
!= BR_OK
);
3137 thread
->return_error
.cmd
= BR_TRANSACTION_COMPLETE
;
3138 binder_enqueue_thread_work(thread
, &thread
->return_error
.work
);
3139 binder_send_failed_reply(in_reply_to
, return_error
);
3141 thread
->return_error
.cmd
= return_error
;
3142 binder_enqueue_thread_work(thread
, &thread
->return_error
.work
);
3147 * binder_free_buf() - free the specified buffer
3148 * @proc: binder proc that owns buffer
3149 * @buffer: buffer to be freed
3151 * If buffer for an async transaction, enqueue the next async
3152 * transaction from the node.
3154 * Cleanup buffer and free it.
3157 binder_free_buf(struct binder_proc
*proc
, struct binder_buffer
*buffer
)
3159 binder_inner_proc_lock(proc
);
3160 if (buffer
->transaction
) {
3161 buffer
->transaction
->buffer
= NULL
;
3162 buffer
->transaction
= NULL
;
3164 binder_inner_proc_unlock(proc
);
3165 if (buffer
->async_transaction
&& buffer
->target_node
) {
3166 struct binder_node
*buf_node
;
3167 struct binder_work
*w
;
3169 buf_node
= buffer
->target_node
;
3170 binder_node_inner_lock(buf_node
);
3171 BUG_ON(!buf_node
->has_async_transaction
);
3172 BUG_ON(buf_node
->proc
!= proc
);
3173 w
= binder_dequeue_work_head_ilocked(
3174 &buf_node
->async_todo
);
3176 buf_node
->has_async_transaction
= false;
3178 binder_enqueue_work_ilocked(
3180 binder_wakeup_proc_ilocked(proc
);
3182 binder_node_inner_unlock(buf_node
);
3184 trace_binder_transaction_buffer_release(buffer
);
3185 binder_transaction_buffer_release(proc
, buffer
, 0, false);
3186 binder_alloc_free_buf(&proc
->alloc
, buffer
);
3189 static int binder_thread_write(struct binder_proc
*proc
,
3190 struct binder_thread
*thread
,
3191 binder_uintptr_t binder_buffer
, size_t size
,
3192 binder_size_t
*consumed
)
3195 struct binder_context
*context
= proc
->context
;
3196 void __user
*buffer
= (void __user
*)(uintptr_t)binder_buffer
;
3197 void __user
*ptr
= buffer
+ *consumed
;
3198 void __user
*end
= buffer
+ size
;
3200 while (ptr
< end
&& thread
->return_error
.cmd
== BR_OK
) {
3203 if (get_user(cmd
, (uint32_t __user
*)ptr
))
3205 ptr
+= sizeof(uint32_t);
3206 trace_binder_command(cmd
);
3207 if (_IOC_NR(cmd
) < ARRAY_SIZE(binder_stats
.bc
)) {
3208 atomic_inc(&binder_stats
.bc
[_IOC_NR(cmd
)]);
3209 atomic_inc(&proc
->stats
.bc
[_IOC_NR(cmd
)]);
3210 atomic_inc(&thread
->stats
.bc
[_IOC_NR(cmd
)]);
3218 const char *debug_string
;
3219 bool strong
= cmd
== BC_ACQUIRE
|| cmd
== BC_RELEASE
;
3220 bool increment
= cmd
== BC_INCREFS
|| cmd
== BC_ACQUIRE
;
3221 struct binder_ref_data rdata
;
3223 if (get_user(target
, (uint32_t __user
*)ptr
))
3226 ptr
+= sizeof(uint32_t);
3228 if (increment
&& !target
) {
3229 struct binder_node
*ctx_mgr_node
;
3231 mutex_lock(&context
->context_mgr_node_lock
);
3232 ctx_mgr_node
= context
->binder_context_mgr_node
;
3234 if (ctx_mgr_node
->proc
== proc
) {
3235 binder_user_error("%d:%d context manager tried to acquire desc 0\n",
3236 proc
->pid
, thread
->pid
);
3237 mutex_unlock(&context
->context_mgr_node_lock
);
3240 ret
= binder_inc_ref_for_node(
3242 strong
, NULL
, &rdata
);
3244 mutex_unlock(&context
->context_mgr_node_lock
);
3247 ret
= binder_update_ref_for_handle(
3248 proc
, target
, increment
, strong
,
3250 if (!ret
&& rdata
.desc
!= target
) {
3251 binder_user_error("%d:%d tried to acquire reference to desc %d, got %d instead\n",
3252 proc
->pid
, thread
->pid
,
3253 target
, rdata
.desc
);
3257 debug_string
= "IncRefs";
3260 debug_string
= "Acquire";
3263 debug_string
= "Release";
3267 debug_string
= "DecRefs";
3271 binder_user_error("%d:%d %s %d refcount change on invalid ref %d ret %d\n",
3272 proc
->pid
, thread
->pid
, debug_string
,
3273 strong
, target
, ret
);
3276 binder_debug(BINDER_DEBUG_USER_REFS
,
3277 "%d:%d %s ref %d desc %d s %d w %d\n",
3278 proc
->pid
, thread
->pid
, debug_string
,
3279 rdata
.debug_id
, rdata
.desc
, rdata
.strong
,
3283 case BC_INCREFS_DONE
:
3284 case BC_ACQUIRE_DONE
: {
3285 binder_uintptr_t node_ptr
;
3286 binder_uintptr_t cookie
;
3287 struct binder_node
*node
;
3290 if (get_user(node_ptr
, (binder_uintptr_t __user
*)ptr
))
3292 ptr
+= sizeof(binder_uintptr_t
);
3293 if (get_user(cookie
, (binder_uintptr_t __user
*)ptr
))
3295 ptr
+= sizeof(binder_uintptr_t
);
3296 node
= binder_get_node(proc
, node_ptr
);
3298 binder_user_error("%d:%d %s u%016llx no match\n",
3299 proc
->pid
, thread
->pid
,
3300 cmd
== BC_INCREFS_DONE
?
3306 if (cookie
!= node
->cookie
) {
3307 binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
3308 proc
->pid
, thread
->pid
,
3309 cmd
== BC_INCREFS_DONE
?
3310 "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3311 (u64
)node_ptr
, node
->debug_id
,
3312 (u64
)cookie
, (u64
)node
->cookie
);
3313 binder_put_node(node
);
3316 binder_node_inner_lock(node
);
3317 if (cmd
== BC_ACQUIRE_DONE
) {
3318 if (node
->pending_strong_ref
== 0) {
3319 binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
3320 proc
->pid
, thread
->pid
,
3322 binder_node_inner_unlock(node
);
3323 binder_put_node(node
);
3326 node
->pending_strong_ref
= 0;
3328 if (node
->pending_weak_ref
== 0) {
3329 binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
3330 proc
->pid
, thread
->pid
,
3332 binder_node_inner_unlock(node
);
3333 binder_put_node(node
);
3336 node
->pending_weak_ref
= 0;
3338 free_node
= binder_dec_node_nilocked(node
,
3339 cmd
== BC_ACQUIRE_DONE
, 0);
3341 binder_debug(BINDER_DEBUG_USER_REFS
,
3342 "%d:%d %s node %d ls %d lw %d tr %d\n",
3343 proc
->pid
, thread
->pid
,
3344 cmd
== BC_INCREFS_DONE
? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3345 node
->debug_id
, node
->local_strong_refs
,
3346 node
->local_weak_refs
, node
->tmp_refs
);
3347 binder_node_inner_unlock(node
);
3348 binder_put_node(node
);
3351 case BC_ATTEMPT_ACQUIRE
:
3352 pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
3354 case BC_ACQUIRE_RESULT
:
3355 pr_err("BC_ACQUIRE_RESULT not supported\n");
3358 case BC_FREE_BUFFER
: {
3359 binder_uintptr_t data_ptr
;
3360 struct binder_buffer
*buffer
;
3362 if (get_user(data_ptr
, (binder_uintptr_t __user
*)ptr
))
3364 ptr
+= sizeof(binder_uintptr_t
);
3366 buffer
= binder_alloc_prepare_to_free(&proc
->alloc
,
3368 if (IS_ERR_OR_NULL(buffer
)) {
3369 if (PTR_ERR(buffer
) == -EPERM
) {
3371 "%d:%d BC_FREE_BUFFER u%016llx matched unreturned or currently freeing buffer\n",
3372 proc
->pid
, thread
->pid
,
3376 "%d:%d BC_FREE_BUFFER u%016llx no match\n",
3377 proc
->pid
, thread
->pid
,
3382 binder_debug(BINDER_DEBUG_FREE_BUFFER
,
3383 "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
3384 proc
->pid
, thread
->pid
, (u64
)data_ptr
,
3386 buffer
->transaction
? "active" : "finished");
3387 binder_free_buf(proc
, buffer
);
3391 case BC_TRANSACTION_SG
:
3393 struct binder_transaction_data_sg tr
;
3395 if (copy_from_user(&tr
, ptr
, sizeof(tr
)))
3398 binder_transaction(proc
, thread
, &tr
.transaction_data
,
3399 cmd
== BC_REPLY_SG
, tr
.buffers_size
);
3402 case BC_TRANSACTION
:
3404 struct binder_transaction_data tr
;
3406 if (copy_from_user(&tr
, ptr
, sizeof(tr
)))
3409 binder_transaction(proc
, thread
, &tr
,
3410 cmd
== BC_REPLY
, 0);
3414 case BC_REGISTER_LOOPER
:
3415 binder_debug(BINDER_DEBUG_THREADS
,
3416 "%d:%d BC_REGISTER_LOOPER\n",
3417 proc
->pid
, thread
->pid
);
3418 binder_inner_proc_lock(proc
);
3419 if (thread
->looper
& BINDER_LOOPER_STATE_ENTERED
) {
3420 thread
->looper
|= BINDER_LOOPER_STATE_INVALID
;
3421 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
3422 proc
->pid
, thread
->pid
);
3423 } else if (proc
->requested_threads
== 0) {
3424 thread
->looper
|= BINDER_LOOPER_STATE_INVALID
;
3425 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
3426 proc
->pid
, thread
->pid
);
3428 proc
->requested_threads
--;
3429 proc
->requested_threads_started
++;
3431 thread
->looper
|= BINDER_LOOPER_STATE_REGISTERED
;
3432 binder_inner_proc_unlock(proc
);
3434 case BC_ENTER_LOOPER
:
3435 binder_debug(BINDER_DEBUG_THREADS
,
3436 "%d:%d BC_ENTER_LOOPER\n",
3437 proc
->pid
, thread
->pid
);
3438 if (thread
->looper
& BINDER_LOOPER_STATE_REGISTERED
) {
3439 thread
->looper
|= BINDER_LOOPER_STATE_INVALID
;
3440 binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
3441 proc
->pid
, thread
->pid
);
3443 thread
->looper
|= BINDER_LOOPER_STATE_ENTERED
;
3445 case BC_EXIT_LOOPER
:
3446 binder_debug(BINDER_DEBUG_THREADS
,
3447 "%d:%d BC_EXIT_LOOPER\n",
3448 proc
->pid
, thread
->pid
);
3449 thread
->looper
|= BINDER_LOOPER_STATE_EXITED
;
3452 case BC_REQUEST_DEATH_NOTIFICATION
:
3453 case BC_CLEAR_DEATH_NOTIFICATION
: {
3455 binder_uintptr_t cookie
;
3456 struct binder_ref
*ref
;
3457 struct binder_ref_death
*death
= NULL
;
3459 if (get_user(target
, (uint32_t __user
*)ptr
))
3461 ptr
+= sizeof(uint32_t);
3462 if (get_user(cookie
, (binder_uintptr_t __user
*)ptr
))
3464 ptr
+= sizeof(binder_uintptr_t
);
3465 if (cmd
== BC_REQUEST_DEATH_NOTIFICATION
) {
3467 * Allocate memory for death notification
3468 * before taking lock
3470 death
= kzalloc(sizeof(*death
), GFP_KERNEL
);
3471 if (death
== NULL
) {
3472 WARN_ON(thread
->return_error
.cmd
!=
3474 thread
->return_error
.cmd
= BR_ERROR
;
3475 binder_enqueue_thread_work(
3477 &thread
->return_error
.work
);
3479 BINDER_DEBUG_FAILED_TRANSACTION
,
3480 "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
3481 proc
->pid
, thread
->pid
);
3485 binder_proc_lock(proc
);
3486 ref
= binder_get_ref_olocked(proc
, target
, false);
3488 binder_user_error("%d:%d %s invalid ref %d\n",
3489 proc
->pid
, thread
->pid
,
3490 cmd
== BC_REQUEST_DEATH_NOTIFICATION
?
3491 "BC_REQUEST_DEATH_NOTIFICATION" :
3492 "BC_CLEAR_DEATH_NOTIFICATION",
3494 binder_proc_unlock(proc
);
3499 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION
,
3500 "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
3501 proc
->pid
, thread
->pid
,
3502 cmd
== BC_REQUEST_DEATH_NOTIFICATION
?
3503 "BC_REQUEST_DEATH_NOTIFICATION" :
3504 "BC_CLEAR_DEATH_NOTIFICATION",
3505 (u64
)cookie
, ref
->data
.debug_id
,
3506 ref
->data
.desc
, ref
->data
.strong
,
3507 ref
->data
.weak
, ref
->node
->debug_id
);
3509 binder_node_lock(ref
->node
);
3510 if (cmd
== BC_REQUEST_DEATH_NOTIFICATION
) {
3512 binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
3513 proc
->pid
, thread
->pid
);
3514 binder_node_unlock(ref
->node
);
3515 binder_proc_unlock(proc
);
3519 binder_stats_created(BINDER_STAT_DEATH
);
3520 INIT_LIST_HEAD(&death
->work
.entry
);
3521 death
->cookie
= cookie
;
3523 if (ref
->node
->proc
== NULL
) {
3524 ref
->death
->work
.type
= BINDER_WORK_DEAD_BINDER
;
3526 binder_inner_proc_lock(proc
);
3527 binder_enqueue_work_ilocked(
3528 &ref
->death
->work
, &proc
->todo
);
3529 binder_wakeup_proc_ilocked(proc
);
3530 binder_inner_proc_unlock(proc
);
3533 if (ref
->death
== NULL
) {
3534 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
3535 proc
->pid
, thread
->pid
);
3536 binder_node_unlock(ref
->node
);
3537 binder_proc_unlock(proc
);
3541 if (death
->cookie
!= cookie
) {
3542 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
3543 proc
->pid
, thread
->pid
,
3546 binder_node_unlock(ref
->node
);
3547 binder_proc_unlock(proc
);
3551 binder_inner_proc_lock(proc
);
3552 if (list_empty(&death
->work
.entry
)) {
3553 death
->work
.type
= BINDER_WORK_CLEAR_DEATH_NOTIFICATION
;
3554 if (thread
->looper
&
3555 (BINDER_LOOPER_STATE_REGISTERED
|
3556 BINDER_LOOPER_STATE_ENTERED
))
3557 binder_enqueue_thread_work_ilocked(
3561 binder_enqueue_work_ilocked(
3564 binder_wakeup_proc_ilocked(
3568 BUG_ON(death
->work
.type
!= BINDER_WORK_DEAD_BINDER
);
3569 death
->work
.type
= BINDER_WORK_DEAD_BINDER_AND_CLEAR
;
3571 binder_inner_proc_unlock(proc
);
3573 binder_node_unlock(ref
->node
);
3574 binder_proc_unlock(proc
);
3576 case BC_DEAD_BINDER_DONE
: {
3577 struct binder_work
*w
;
3578 binder_uintptr_t cookie
;
3579 struct binder_ref_death
*death
= NULL
;
3581 if (get_user(cookie
, (binder_uintptr_t __user
*)ptr
))
3584 ptr
+= sizeof(cookie
);
3585 binder_inner_proc_lock(proc
);
3586 list_for_each_entry(w
, &proc
->delivered_death
,
3588 struct binder_ref_death
*tmp_death
=
3590 struct binder_ref_death
,
3593 if (tmp_death
->cookie
== cookie
) {
3598 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
3599 "%d:%d BC_DEAD_BINDER_DONE %016llx found %pK\n",
3600 proc
->pid
, thread
->pid
, (u64
)cookie
,
3602 if (death
== NULL
) {
3603 binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
3604 proc
->pid
, thread
->pid
, (u64
)cookie
);
3605 binder_inner_proc_unlock(proc
);
3608 binder_dequeue_work_ilocked(&death
->work
);
3609 if (death
->work
.type
== BINDER_WORK_DEAD_BINDER_AND_CLEAR
) {
3610 death
->work
.type
= BINDER_WORK_CLEAR_DEATH_NOTIFICATION
;
3611 if (thread
->looper
&
3612 (BINDER_LOOPER_STATE_REGISTERED
|
3613 BINDER_LOOPER_STATE_ENTERED
))
3614 binder_enqueue_thread_work_ilocked(
3615 thread
, &death
->work
);
3617 binder_enqueue_work_ilocked(
3620 binder_wakeup_proc_ilocked(proc
);
3623 binder_inner_proc_unlock(proc
);
3627 pr_err("%d:%d unknown command %d\n",
3628 proc
->pid
, thread
->pid
, cmd
);
3631 *consumed
= ptr
- buffer
;
3636 static void binder_stat_br(struct binder_proc
*proc
,
3637 struct binder_thread
*thread
, uint32_t cmd
)
3639 trace_binder_return(cmd
);
3640 if (_IOC_NR(cmd
) < ARRAY_SIZE(binder_stats
.br
)) {
3641 atomic_inc(&binder_stats
.br
[_IOC_NR(cmd
)]);
3642 atomic_inc(&proc
->stats
.br
[_IOC_NR(cmd
)]);
3643 atomic_inc(&thread
->stats
.br
[_IOC_NR(cmd
)]);
3647 static int binder_put_node_cmd(struct binder_proc
*proc
,
3648 struct binder_thread
*thread
,
3650 binder_uintptr_t node_ptr
,
3651 binder_uintptr_t node_cookie
,
3653 uint32_t cmd
, const char *cmd_name
)
3655 void __user
*ptr
= *ptrp
;
3657 if (put_user(cmd
, (uint32_t __user
*)ptr
))
3659 ptr
+= sizeof(uint32_t);
3661 if (put_user(node_ptr
, (binder_uintptr_t __user
*)ptr
))
3663 ptr
+= sizeof(binder_uintptr_t
);
3665 if (put_user(node_cookie
, (binder_uintptr_t __user
*)ptr
))
3667 ptr
+= sizeof(binder_uintptr_t
);
3669 binder_stat_br(proc
, thread
, cmd
);
3670 binder_debug(BINDER_DEBUG_USER_REFS
, "%d:%d %s %d u%016llx c%016llx\n",
3671 proc
->pid
, thread
->pid
, cmd_name
, node_debug_id
,
3672 (u64
)node_ptr
, (u64
)node_cookie
);
3678 static int binder_wait_for_work(struct binder_thread
*thread
,
3682 struct binder_proc
*proc
= thread
->proc
;
3685 freezer_do_not_count();
3686 binder_inner_proc_lock(proc
);
3688 prepare_to_wait(&thread
->wait
, &wait
, TASK_INTERRUPTIBLE
);
3689 if (binder_has_work_ilocked(thread
, do_proc_work
))
3692 list_add(&thread
->waiting_thread_node
,
3693 &proc
->waiting_threads
);
3694 binder_inner_proc_unlock(proc
);
3696 binder_inner_proc_lock(proc
);
3697 list_del_init(&thread
->waiting_thread_node
);
3698 if (signal_pending(current
)) {
3703 finish_wait(&thread
->wait
, &wait
);
3704 binder_inner_proc_unlock(proc
);
3711 * binder_apply_fd_fixups() - finish fd translation
3712 * @proc: binder_proc associated @t->buffer
3713 * @t: binder transaction with list of fd fixups
3715 * Now that we are in the context of the transaction target
3716 * process, we can allocate and install fds. Process the
3717 * list of fds to translate and fixup the buffer with the
3720 * If we fail to allocate an fd, then free the resources by
3721 * fput'ing files that have not been processed and ksys_close'ing
3722 * any fds that have already been allocated.
3724 static int binder_apply_fd_fixups(struct binder_proc
*proc
,
3725 struct binder_transaction
*t
)
3727 struct binder_txn_fd_fixup
*fixup
, *tmp
;
3730 list_for_each_entry(fixup
, &t
->fd_fixups
, fixup_entry
) {
3731 int fd
= get_unused_fd_flags(O_CLOEXEC
);
3734 binder_debug(BINDER_DEBUG_TRANSACTION
,
3735 "failed fd fixup txn %d fd %d\n",
3740 binder_debug(BINDER_DEBUG_TRANSACTION
,
3741 "fd fixup txn %d fd %d\n",
3743 trace_binder_transaction_fd_recv(t
, fd
, fixup
->offset
);
3744 fd_install(fd
, fixup
->file
);
3746 if (binder_alloc_copy_to_buffer(&proc
->alloc
, t
->buffer
,
3753 list_for_each_entry_safe(fixup
, tmp
, &t
->fd_fixups
, fixup_entry
) {
3760 err
= binder_alloc_copy_from_buffer(&proc
->alloc
, &fd
,
3766 binder_deferred_fd_close(fd
);
3768 list_del(&fixup
->fixup_entry
);
3775 static int binder_thread_read(struct binder_proc
*proc
,
3776 struct binder_thread
*thread
,
3777 binder_uintptr_t binder_buffer
, size_t size
,
3778 binder_size_t
*consumed
, int non_block
)
3780 void __user
*buffer
= (void __user
*)(uintptr_t)binder_buffer
;
3781 void __user
*ptr
= buffer
+ *consumed
;
3782 void __user
*end
= buffer
+ size
;
3785 int wait_for_proc_work
;
3787 if (*consumed
== 0) {
3788 if (put_user(BR_NOOP
, (uint32_t __user
*)ptr
))
3790 ptr
+= sizeof(uint32_t);
3794 binder_inner_proc_lock(proc
);
3795 wait_for_proc_work
= binder_available_for_proc_work_ilocked(thread
);
3796 binder_inner_proc_unlock(proc
);
3798 thread
->looper
|= BINDER_LOOPER_STATE_WAITING
;
3800 trace_binder_wait_for_work(wait_for_proc_work
,
3801 !!thread
->transaction_stack
,
3802 !binder_worklist_empty(proc
, &thread
->todo
));
3803 if (wait_for_proc_work
) {
3804 if (!(thread
->looper
& (BINDER_LOOPER_STATE_REGISTERED
|
3805 BINDER_LOOPER_STATE_ENTERED
))) {
3806 binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
3807 proc
->pid
, thread
->pid
, thread
->looper
);
3808 wait_event_interruptible(binder_user_error_wait
,
3809 binder_stop_on_user_error
< 2);
3811 binder_set_nice(proc
->default_priority
);
3815 if (!binder_has_work(thread
, wait_for_proc_work
))
3818 ret
= binder_wait_for_work(thread
, wait_for_proc_work
);
3821 thread
->looper
&= ~BINDER_LOOPER_STATE_WAITING
;
3828 struct binder_transaction_data_secctx tr
;
3829 struct binder_transaction_data
*trd
= &tr
.transaction_data
;
3830 struct binder_work
*w
= NULL
;
3831 struct list_head
*list
= NULL
;
3832 struct binder_transaction
*t
= NULL
;
3833 struct binder_thread
*t_from
;
3834 size_t trsize
= sizeof(*trd
);
3836 binder_inner_proc_lock(proc
);
3837 if (!binder_worklist_empty_ilocked(&thread
->todo
))
3838 list
= &thread
->todo
;
3839 else if (!binder_worklist_empty_ilocked(&proc
->todo
) &&
3843 binder_inner_proc_unlock(proc
);
3846 if (ptr
- buffer
== 4 && !thread
->looper_need_return
)
3851 if (end
- ptr
< sizeof(tr
) + 4) {
3852 binder_inner_proc_unlock(proc
);
3855 w
= binder_dequeue_work_head_ilocked(list
);
3856 if (binder_worklist_empty_ilocked(&thread
->todo
))
3857 thread
->process_todo
= false;
3860 case BINDER_WORK_TRANSACTION
: {
3861 binder_inner_proc_unlock(proc
);
3862 t
= container_of(w
, struct binder_transaction
, work
);
3864 case BINDER_WORK_RETURN_ERROR
: {
3865 struct binder_error
*e
= container_of(
3866 w
, struct binder_error
, work
);
3868 WARN_ON(e
->cmd
== BR_OK
);
3869 binder_inner_proc_unlock(proc
);
3870 if (put_user(e
->cmd
, (uint32_t __user
*)ptr
))
3874 ptr
+= sizeof(uint32_t);
3876 binder_stat_br(proc
, thread
, cmd
);
3878 case BINDER_WORK_TRANSACTION_COMPLETE
: {
3879 binder_inner_proc_unlock(proc
);
3880 cmd
= BR_TRANSACTION_COMPLETE
;
3882 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE
);
3883 if (put_user(cmd
, (uint32_t __user
*)ptr
))
3885 ptr
+= sizeof(uint32_t);
3887 binder_stat_br(proc
, thread
, cmd
);
3888 binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE
,
3889 "%d:%d BR_TRANSACTION_COMPLETE\n",
3890 proc
->pid
, thread
->pid
);
3892 case BINDER_WORK_NODE
: {
3893 struct binder_node
*node
= container_of(w
, struct binder_node
, work
);
3895 binder_uintptr_t node_ptr
= node
->ptr
;
3896 binder_uintptr_t node_cookie
= node
->cookie
;
3897 int node_debug_id
= node
->debug_id
;
3900 void __user
*orig_ptr
= ptr
;
3902 BUG_ON(proc
!= node
->proc
);
3903 strong
= node
->internal_strong_refs
||
3904 node
->local_strong_refs
;
3905 weak
= !hlist_empty(&node
->refs
) ||
3906 node
->local_weak_refs
||
3907 node
->tmp_refs
|| strong
;
3908 has_strong_ref
= node
->has_strong_ref
;
3909 has_weak_ref
= node
->has_weak_ref
;
3911 if (weak
&& !has_weak_ref
) {
3912 node
->has_weak_ref
= 1;
3913 node
->pending_weak_ref
= 1;
3914 node
->local_weak_refs
++;
3916 if (strong
&& !has_strong_ref
) {
3917 node
->has_strong_ref
= 1;
3918 node
->pending_strong_ref
= 1;
3919 node
->local_strong_refs
++;
3921 if (!strong
&& has_strong_ref
)
3922 node
->has_strong_ref
= 0;
3923 if (!weak
&& has_weak_ref
)
3924 node
->has_weak_ref
= 0;
3925 if (!weak
&& !strong
) {
3926 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
3927 "%d:%d node %d u%016llx c%016llx deleted\n",
3928 proc
->pid
, thread
->pid
,
3932 rb_erase(&node
->rb_node
, &proc
->nodes
);
3933 binder_inner_proc_unlock(proc
);
3934 binder_node_lock(node
);
3936 * Acquire the node lock before freeing the
3937 * node to serialize with other threads that
3938 * may have been holding the node lock while
3939 * decrementing this node (avoids race where
3940 * this thread frees while the other thread
3941 * is unlocking the node after the final
3944 binder_node_unlock(node
);
3945 binder_free_node(node
);
3947 binder_inner_proc_unlock(proc
);
3949 if (weak
&& !has_weak_ref
)
3950 ret
= binder_put_node_cmd(
3951 proc
, thread
, &ptr
, node_ptr
,
3952 node_cookie
, node_debug_id
,
3953 BR_INCREFS
, "BR_INCREFS");
3954 if (!ret
&& strong
&& !has_strong_ref
)
3955 ret
= binder_put_node_cmd(
3956 proc
, thread
, &ptr
, node_ptr
,
3957 node_cookie
, node_debug_id
,
3958 BR_ACQUIRE
, "BR_ACQUIRE");
3959 if (!ret
&& !strong
&& has_strong_ref
)
3960 ret
= binder_put_node_cmd(
3961 proc
, thread
, &ptr
, node_ptr
,
3962 node_cookie
, node_debug_id
,
3963 BR_RELEASE
, "BR_RELEASE");
3964 if (!ret
&& !weak
&& has_weak_ref
)
3965 ret
= binder_put_node_cmd(
3966 proc
, thread
, &ptr
, node_ptr
,
3967 node_cookie
, node_debug_id
,
3968 BR_DECREFS
, "BR_DECREFS");
3969 if (orig_ptr
== ptr
)
3970 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
3971 "%d:%d node %d u%016llx c%016llx state unchanged\n",
3972 proc
->pid
, thread
->pid
,
3979 case BINDER_WORK_DEAD_BINDER
:
3980 case BINDER_WORK_DEAD_BINDER_AND_CLEAR
:
3981 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION
: {
3982 struct binder_ref_death
*death
;
3984 binder_uintptr_t cookie
;
3986 death
= container_of(w
, struct binder_ref_death
, work
);
3987 if (w
->type
== BINDER_WORK_CLEAR_DEATH_NOTIFICATION
)
3988 cmd
= BR_CLEAR_DEATH_NOTIFICATION_DONE
;
3990 cmd
= BR_DEAD_BINDER
;
3991 cookie
= death
->cookie
;
3993 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION
,
3994 "%d:%d %s %016llx\n",
3995 proc
->pid
, thread
->pid
,
3996 cmd
== BR_DEAD_BINDER
?
3998 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
4000 if (w
->type
== BINDER_WORK_CLEAR_DEATH_NOTIFICATION
) {
4001 binder_inner_proc_unlock(proc
);
4003 binder_stats_deleted(BINDER_STAT_DEATH
);
4005 binder_enqueue_work_ilocked(
4006 w
, &proc
->delivered_death
);
4007 binder_inner_proc_unlock(proc
);
4009 if (put_user(cmd
, (uint32_t __user
*)ptr
))
4011 ptr
+= sizeof(uint32_t);
4012 if (put_user(cookie
,
4013 (binder_uintptr_t __user
*)ptr
))
4015 ptr
+= sizeof(binder_uintptr_t
);
4016 binder_stat_br(proc
, thread
, cmd
);
4017 if (cmd
== BR_DEAD_BINDER
)
4018 goto done
; /* DEAD_BINDER notifications can cause transactions */
4021 binder_inner_proc_unlock(proc
);
4022 pr_err("%d:%d: bad work type %d\n",
4023 proc
->pid
, thread
->pid
, w
->type
);
4030 BUG_ON(t
->buffer
== NULL
);
4031 if (t
->buffer
->target_node
) {
4032 struct binder_node
*target_node
= t
->buffer
->target_node
;
4034 trd
->target
.ptr
= target_node
->ptr
;
4035 trd
->cookie
= target_node
->cookie
;
4036 t
->saved_priority
= task_nice(current
);
4037 if (t
->priority
< target_node
->min_priority
&&
4038 !(t
->flags
& TF_ONE_WAY
))
4039 binder_set_nice(t
->priority
);
4040 else if (!(t
->flags
& TF_ONE_WAY
) ||
4041 t
->saved_priority
> target_node
->min_priority
)
4042 binder_set_nice(target_node
->min_priority
);
4043 cmd
= BR_TRANSACTION
;
4045 trd
->target
.ptr
= 0;
4049 trd
->code
= t
->code
;
4050 trd
->flags
= t
->flags
;
4051 trd
->sender_euid
= from_kuid(current_user_ns(), t
->sender_euid
);
4053 t_from
= binder_get_txn_from(t
);
4055 struct task_struct
*sender
= t_from
->proc
->tsk
;
4058 task_tgid_nr_ns(sender
,
4059 task_active_pid_ns(current
));
4061 trd
->sender_pid
= 0;
4064 ret
= binder_apply_fd_fixups(proc
, t
);
4066 struct binder_buffer
*buffer
= t
->buffer
;
4067 bool oneway
= !!(t
->flags
& TF_ONE_WAY
);
4068 int tid
= t
->debug_id
;
4071 binder_thread_dec_tmpref(t_from
);
4072 buffer
->transaction
= NULL
;
4073 binder_cleanup_transaction(t
, "fd fixups failed",
4075 binder_free_buf(proc
, buffer
);
4076 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION
,
4077 "%d:%d %stransaction %d fd fixups failed %d/%d, line %d\n",
4078 proc
->pid
, thread
->pid
,
4080 (cmd
== BR_REPLY
? "reply " : ""),
4081 tid
, BR_FAILED_REPLY
, ret
, __LINE__
);
4082 if (cmd
== BR_REPLY
) {
4083 cmd
= BR_FAILED_REPLY
;
4084 if (put_user(cmd
, (uint32_t __user
*)ptr
))
4086 ptr
+= sizeof(uint32_t);
4087 binder_stat_br(proc
, thread
, cmd
);
4092 trd
->data_size
= t
->buffer
->data_size
;
4093 trd
->offsets_size
= t
->buffer
->offsets_size
;
4094 trd
->data
.ptr
.buffer
= (uintptr_t)t
->buffer
->user_data
;
4095 trd
->data
.ptr
.offsets
= trd
->data
.ptr
.buffer
+
4096 ALIGN(t
->buffer
->data_size
,
4099 tr
.secctx
= t
->security_ctx
;
4100 if (t
->security_ctx
) {
4101 cmd
= BR_TRANSACTION_SEC_CTX
;
4102 trsize
= sizeof(tr
);
4104 if (put_user(cmd
, (uint32_t __user
*)ptr
)) {
4106 binder_thread_dec_tmpref(t_from
);
4108 binder_cleanup_transaction(t
, "put_user failed",
4113 ptr
+= sizeof(uint32_t);
4114 if (copy_to_user(ptr
, &tr
, trsize
)) {
4116 binder_thread_dec_tmpref(t_from
);
4118 binder_cleanup_transaction(t
, "copy_to_user failed",
4125 trace_binder_transaction_received(t
);
4126 binder_stat_br(proc
, thread
, cmd
);
4127 binder_debug(BINDER_DEBUG_TRANSACTION
,
4128 "%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n",
4129 proc
->pid
, thread
->pid
,
4130 (cmd
== BR_TRANSACTION
) ? "BR_TRANSACTION" :
4131 (cmd
== BR_TRANSACTION_SEC_CTX
) ?
4132 "BR_TRANSACTION_SEC_CTX" : "BR_REPLY",
4133 t
->debug_id
, t_from
? t_from
->proc
->pid
: 0,
4134 t_from
? t_from
->pid
: 0, cmd
,
4135 t
->buffer
->data_size
, t
->buffer
->offsets_size
,
4136 (u64
)trd
->data
.ptr
.buffer
,
4137 (u64
)trd
->data
.ptr
.offsets
);
4140 binder_thread_dec_tmpref(t_from
);
4141 t
->buffer
->allow_user_free
= 1;
4142 if (cmd
!= BR_REPLY
&& !(t
->flags
& TF_ONE_WAY
)) {
4143 binder_inner_proc_lock(thread
->proc
);
4144 t
->to_parent
= thread
->transaction_stack
;
4145 t
->to_thread
= thread
;
4146 thread
->transaction_stack
= t
;
4147 binder_inner_proc_unlock(thread
->proc
);
4149 binder_free_transaction(t
);
4156 *consumed
= ptr
- buffer
;
4157 binder_inner_proc_lock(proc
);
4158 if (proc
->requested_threads
== 0 &&
4159 list_empty(&thread
->proc
->waiting_threads
) &&
4160 proc
->requested_threads_started
< proc
->max_threads
&&
4161 (thread
->looper
& (BINDER_LOOPER_STATE_REGISTERED
|
4162 BINDER_LOOPER_STATE_ENTERED
)) /* the user-space code fails to */
4163 /*spawn a new thread if we leave this out */) {
4164 proc
->requested_threads
++;
4165 binder_inner_proc_unlock(proc
);
4166 binder_debug(BINDER_DEBUG_THREADS
,
4167 "%d:%d BR_SPAWN_LOOPER\n",
4168 proc
->pid
, thread
->pid
);
4169 if (put_user(BR_SPAWN_LOOPER
, (uint32_t __user
*)buffer
))
4171 binder_stat_br(proc
, thread
, BR_SPAWN_LOOPER
);
4173 binder_inner_proc_unlock(proc
);
4177 static void binder_release_work(struct binder_proc
*proc
,
4178 struct list_head
*list
)
4180 struct binder_work
*w
;
4181 enum binder_work_type wtype
;
4184 binder_inner_proc_lock(proc
);
4185 w
= binder_dequeue_work_head_ilocked(list
);
4186 wtype
= w
? w
->type
: 0;
4187 binder_inner_proc_unlock(proc
);
4192 case BINDER_WORK_TRANSACTION
: {
4193 struct binder_transaction
*t
;
4195 t
= container_of(w
, struct binder_transaction
, work
);
4197 binder_cleanup_transaction(t
, "process died.",
4200 case BINDER_WORK_RETURN_ERROR
: {
4201 struct binder_error
*e
= container_of(
4202 w
, struct binder_error
, work
);
4204 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
4205 "undelivered TRANSACTION_ERROR: %u\n",
4208 case BINDER_WORK_TRANSACTION_COMPLETE
: {
4209 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
4210 "undelivered TRANSACTION_COMPLETE\n");
4212 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE
);
4214 case BINDER_WORK_DEAD_BINDER_AND_CLEAR
:
4215 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION
: {
4216 struct binder_ref_death
*death
;
4218 death
= container_of(w
, struct binder_ref_death
, work
);
4219 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
4220 "undelivered death notification, %016llx\n",
4221 (u64
)death
->cookie
);
4223 binder_stats_deleted(BINDER_STAT_DEATH
);
4225 case BINDER_WORK_NODE
:
4228 pr_err("unexpected work type, %d, not freed\n",
4236 static struct binder_thread
*binder_get_thread_ilocked(
4237 struct binder_proc
*proc
, struct binder_thread
*new_thread
)
4239 struct binder_thread
*thread
= NULL
;
4240 struct rb_node
*parent
= NULL
;
4241 struct rb_node
**p
= &proc
->threads
.rb_node
;
4245 thread
= rb_entry(parent
, struct binder_thread
, rb_node
);
4247 if (current
->pid
< thread
->pid
)
4249 else if (current
->pid
> thread
->pid
)
4250 p
= &(*p
)->rb_right
;
4256 thread
= new_thread
;
4257 binder_stats_created(BINDER_STAT_THREAD
);
4258 thread
->proc
= proc
;
4259 thread
->pid
= current
->pid
;
4260 atomic_set(&thread
->tmp_ref
, 0);
4261 init_waitqueue_head(&thread
->wait
);
4262 INIT_LIST_HEAD(&thread
->todo
);
4263 rb_link_node(&thread
->rb_node
, parent
, p
);
4264 rb_insert_color(&thread
->rb_node
, &proc
->threads
);
4265 thread
->looper_need_return
= true;
4266 thread
->return_error
.work
.type
= BINDER_WORK_RETURN_ERROR
;
4267 thread
->return_error
.cmd
= BR_OK
;
4268 thread
->reply_error
.work
.type
= BINDER_WORK_RETURN_ERROR
;
4269 thread
->reply_error
.cmd
= BR_OK
;
4270 INIT_LIST_HEAD(&new_thread
->waiting_thread_node
);
4274 static struct binder_thread
*binder_get_thread(struct binder_proc
*proc
)
4276 struct binder_thread
*thread
;
4277 struct binder_thread
*new_thread
;
4279 binder_inner_proc_lock(proc
);
4280 thread
= binder_get_thread_ilocked(proc
, NULL
);
4281 binder_inner_proc_unlock(proc
);
4283 new_thread
= kzalloc(sizeof(*thread
), GFP_KERNEL
);
4284 if (new_thread
== NULL
)
4286 binder_inner_proc_lock(proc
);
4287 thread
= binder_get_thread_ilocked(proc
, new_thread
);
4288 binder_inner_proc_unlock(proc
);
4289 if (thread
!= new_thread
)
4295 static void binder_free_proc(struct binder_proc
*proc
)
4297 struct binder_device
*device
;
4299 BUG_ON(!list_empty(&proc
->todo
));
4300 BUG_ON(!list_empty(&proc
->delivered_death
));
4301 device
= container_of(proc
->context
, struct binder_device
, context
);
4302 if (refcount_dec_and_test(&device
->ref
)) {
4303 kfree(proc
->context
->name
);
4306 binder_alloc_deferred_release(&proc
->alloc
);
4307 put_task_struct(proc
->tsk
);
4308 binder_stats_deleted(BINDER_STAT_PROC
);
4312 static void binder_free_thread(struct binder_thread
*thread
)
4314 BUG_ON(!list_empty(&thread
->todo
));
4315 binder_stats_deleted(BINDER_STAT_THREAD
);
4316 binder_proc_dec_tmpref(thread
->proc
);
4320 static int binder_thread_release(struct binder_proc
*proc
,
4321 struct binder_thread
*thread
)
4323 struct binder_transaction
*t
;
4324 struct binder_transaction
*send_reply
= NULL
;
4325 int active_transactions
= 0;
4326 struct binder_transaction
*last_t
= NULL
;
4328 binder_inner_proc_lock(thread
->proc
);
4330 * take a ref on the proc so it survives
4331 * after we remove this thread from proc->threads.
4332 * The corresponding dec is when we actually
4333 * free the thread in binder_free_thread()
4337 * take a ref on this thread to ensure it
4338 * survives while we are releasing it
4340 atomic_inc(&thread
->tmp_ref
);
4341 rb_erase(&thread
->rb_node
, &proc
->threads
);
4342 t
= thread
->transaction_stack
;
4344 spin_lock(&t
->lock
);
4345 if (t
->to_thread
== thread
)
4348 __acquire(&t
->lock
);
4350 thread
->is_dead
= true;
4354 active_transactions
++;
4355 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
4356 "release %d:%d transaction %d %s, still active\n",
4357 proc
->pid
, thread
->pid
,
4359 (t
->to_thread
== thread
) ? "in" : "out");
4361 if (t
->to_thread
== thread
) {
4363 t
->to_thread
= NULL
;
4365 t
->buffer
->transaction
= NULL
;
4369 } else if (t
->from
== thread
) {
4374 spin_unlock(&last_t
->lock
);
4376 spin_lock(&t
->lock
);
4378 __acquire(&t
->lock
);
4380 /* annotation for sparse, lock not acquired in last iteration above */
4381 __release(&t
->lock
);
4384 * If this thread used poll, make sure we remove the waitqueue
4385 * from any epoll data structures holding it with POLLFREE.
4386 * waitqueue_active() is safe to use here because we're holding
4389 if ((thread
->looper
& BINDER_LOOPER_STATE_POLL
) &&
4390 waitqueue_active(&thread
->wait
)) {
4391 wake_up_poll(&thread
->wait
, EPOLLHUP
| POLLFREE
);
4394 binder_inner_proc_unlock(thread
->proc
);
4397 * This is needed to avoid races between wake_up_poll() above and
4398 * and ep_remove_waitqueue() called for other reasons (eg the epoll file
4399 * descriptor being closed); ep_remove_waitqueue() holds an RCU read
4400 * lock, so we can be sure it's done after calling synchronize_rcu().
4402 if (thread
->looper
& BINDER_LOOPER_STATE_POLL
)
4406 binder_send_failed_reply(send_reply
, BR_DEAD_REPLY
);
4407 binder_release_work(proc
, &thread
->todo
);
4408 binder_thread_dec_tmpref(thread
);
4409 return active_transactions
;
4412 static __poll_t
binder_poll(struct file
*filp
,
4413 struct poll_table_struct
*wait
)
4415 struct binder_proc
*proc
= filp
->private_data
;
4416 struct binder_thread
*thread
= NULL
;
4417 bool wait_for_proc_work
;
4419 thread
= binder_get_thread(proc
);
4423 binder_inner_proc_lock(thread
->proc
);
4424 thread
->looper
|= BINDER_LOOPER_STATE_POLL
;
4425 wait_for_proc_work
= binder_available_for_proc_work_ilocked(thread
);
4427 binder_inner_proc_unlock(thread
->proc
);
4429 poll_wait(filp
, &thread
->wait
, wait
);
4431 if (binder_has_work(thread
, wait_for_proc_work
))
4437 static int binder_ioctl_write_read(struct file
*filp
,
4438 unsigned int cmd
, unsigned long arg
,
4439 struct binder_thread
*thread
)
4442 struct binder_proc
*proc
= filp
->private_data
;
4443 unsigned int size
= _IOC_SIZE(cmd
);
4444 void __user
*ubuf
= (void __user
*)arg
;
4445 struct binder_write_read bwr
;
4447 if (size
!= sizeof(struct binder_write_read
)) {
4451 if (copy_from_user(&bwr
, ubuf
, sizeof(bwr
))) {
4455 binder_debug(BINDER_DEBUG_READ_WRITE
,
4456 "%d:%d write %lld at %016llx, read %lld at %016llx\n",
4457 proc
->pid
, thread
->pid
,
4458 (u64
)bwr
.write_size
, (u64
)bwr
.write_buffer
,
4459 (u64
)bwr
.read_size
, (u64
)bwr
.read_buffer
);
4461 if (bwr
.write_size
> 0) {
4462 ret
= binder_thread_write(proc
, thread
,
4465 &bwr
.write_consumed
);
4466 trace_binder_write_done(ret
);
4468 bwr
.read_consumed
= 0;
4469 if (copy_to_user(ubuf
, &bwr
, sizeof(bwr
)))
4474 if (bwr
.read_size
> 0) {
4475 ret
= binder_thread_read(proc
, thread
, bwr
.read_buffer
,
4478 filp
->f_flags
& O_NONBLOCK
);
4479 trace_binder_read_done(ret
);
4480 binder_inner_proc_lock(proc
);
4481 if (!binder_worklist_empty_ilocked(&proc
->todo
))
4482 binder_wakeup_proc_ilocked(proc
);
4483 binder_inner_proc_unlock(proc
);
4485 if (copy_to_user(ubuf
, &bwr
, sizeof(bwr
)))
4490 binder_debug(BINDER_DEBUG_READ_WRITE
,
4491 "%d:%d wrote %lld of %lld, read return %lld of %lld\n",
4492 proc
->pid
, thread
->pid
,
4493 (u64
)bwr
.write_consumed
, (u64
)bwr
.write_size
,
4494 (u64
)bwr
.read_consumed
, (u64
)bwr
.read_size
);
4495 if (copy_to_user(ubuf
, &bwr
, sizeof(bwr
))) {
4503 static int binder_ioctl_set_ctx_mgr(struct file
*filp
,
4504 struct flat_binder_object
*fbo
)
4507 struct binder_proc
*proc
= filp
->private_data
;
4508 struct binder_context
*context
= proc
->context
;
4509 struct binder_node
*new_node
;
4510 kuid_t curr_euid
= current_euid();
4512 mutex_lock(&context
->context_mgr_node_lock
);
4513 if (context
->binder_context_mgr_node
) {
4514 pr_err("BINDER_SET_CONTEXT_MGR already set\n");
4518 ret
= security_binder_set_context_mgr(proc
->tsk
);
4521 if (uid_valid(context
->binder_context_mgr_uid
)) {
4522 if (!uid_eq(context
->binder_context_mgr_uid
, curr_euid
)) {
4523 pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
4524 from_kuid(&init_user_ns
, curr_euid
),
4525 from_kuid(&init_user_ns
,
4526 context
->binder_context_mgr_uid
));
4531 context
->binder_context_mgr_uid
= curr_euid
;
4533 new_node
= binder_new_node(proc
, fbo
);
4538 binder_node_lock(new_node
);
4539 new_node
->local_weak_refs
++;
4540 new_node
->local_strong_refs
++;
4541 new_node
->has_strong_ref
= 1;
4542 new_node
->has_weak_ref
= 1;
4543 context
->binder_context_mgr_node
= new_node
;
4544 binder_node_unlock(new_node
);
4545 binder_put_node(new_node
);
4547 mutex_unlock(&context
->context_mgr_node_lock
);
4551 static int binder_ioctl_get_node_info_for_ref(struct binder_proc
*proc
,
4552 struct binder_node_info_for_ref
*info
)
4554 struct binder_node
*node
;
4555 struct binder_context
*context
= proc
->context
;
4556 __u32 handle
= info
->handle
;
4558 if (info
->strong_count
|| info
->weak_count
|| info
->reserved1
||
4559 info
->reserved2
|| info
->reserved3
) {
4560 binder_user_error("%d BINDER_GET_NODE_INFO_FOR_REF: only handle may be non-zero.",
4565 /* This ioctl may only be used by the context manager */
4566 mutex_lock(&context
->context_mgr_node_lock
);
4567 if (!context
->binder_context_mgr_node
||
4568 context
->binder_context_mgr_node
->proc
!= proc
) {
4569 mutex_unlock(&context
->context_mgr_node_lock
);
4572 mutex_unlock(&context
->context_mgr_node_lock
);
4574 node
= binder_get_node_from_ref(proc
, handle
, true, NULL
);
4578 info
->strong_count
= node
->local_strong_refs
+
4579 node
->internal_strong_refs
;
4580 info
->weak_count
= node
->local_weak_refs
;
4582 binder_put_node(node
);
4587 static int binder_ioctl_get_node_debug_info(struct binder_proc
*proc
,
4588 struct binder_node_debug_info
*info
)
4591 binder_uintptr_t ptr
= info
->ptr
;
4593 memset(info
, 0, sizeof(*info
));
4595 binder_inner_proc_lock(proc
);
4596 for (n
= rb_first(&proc
->nodes
); n
!= NULL
; n
= rb_next(n
)) {
4597 struct binder_node
*node
= rb_entry(n
, struct binder_node
,
4599 if (node
->ptr
> ptr
) {
4600 info
->ptr
= node
->ptr
;
4601 info
->cookie
= node
->cookie
;
4602 info
->has_strong_ref
= node
->has_strong_ref
;
4603 info
->has_weak_ref
= node
->has_weak_ref
;
4607 binder_inner_proc_unlock(proc
);
4612 static long binder_ioctl(struct file
*filp
, unsigned int cmd
, unsigned long arg
)
4615 struct binder_proc
*proc
= filp
->private_data
;
4616 struct binder_thread
*thread
;
4617 unsigned int size
= _IOC_SIZE(cmd
);
4618 void __user
*ubuf
= (void __user
*)arg
;
4620 /*pr_info("binder_ioctl: %d:%d %x %lx\n",
4621 proc->pid, current->pid, cmd, arg);*/
4623 binder_selftest_alloc(&proc
->alloc
);
4625 trace_binder_ioctl(cmd
, arg
);
4627 ret
= wait_event_interruptible(binder_user_error_wait
, binder_stop_on_user_error
< 2);
4631 thread
= binder_get_thread(proc
);
4632 if (thread
== NULL
) {
4638 case BINDER_WRITE_READ
:
4639 ret
= binder_ioctl_write_read(filp
, cmd
, arg
, thread
);
4643 case BINDER_SET_MAX_THREADS
: {
4646 if (copy_from_user(&max_threads
, ubuf
,
4647 sizeof(max_threads
))) {
4651 binder_inner_proc_lock(proc
);
4652 proc
->max_threads
= max_threads
;
4653 binder_inner_proc_unlock(proc
);
4656 case BINDER_SET_CONTEXT_MGR_EXT
: {
4657 struct flat_binder_object fbo
;
4659 if (copy_from_user(&fbo
, ubuf
, sizeof(fbo
))) {
4663 ret
= binder_ioctl_set_ctx_mgr(filp
, &fbo
);
4668 case BINDER_SET_CONTEXT_MGR
:
4669 ret
= binder_ioctl_set_ctx_mgr(filp
, NULL
);
4673 case BINDER_THREAD_EXIT
:
4674 binder_debug(BINDER_DEBUG_THREADS
, "%d:%d exit\n",
4675 proc
->pid
, thread
->pid
);
4676 binder_thread_release(proc
, thread
);
4679 case BINDER_VERSION
: {
4680 struct binder_version __user
*ver
= ubuf
;
4682 if (size
!= sizeof(struct binder_version
)) {
4686 if (put_user(BINDER_CURRENT_PROTOCOL_VERSION
,
4687 &ver
->protocol_version
)) {
4693 case BINDER_GET_NODE_INFO_FOR_REF
: {
4694 struct binder_node_info_for_ref info
;
4696 if (copy_from_user(&info
, ubuf
, sizeof(info
))) {
4701 ret
= binder_ioctl_get_node_info_for_ref(proc
, &info
);
4705 if (copy_to_user(ubuf
, &info
, sizeof(info
))) {
4712 case BINDER_GET_NODE_DEBUG_INFO
: {
4713 struct binder_node_debug_info info
;
4715 if (copy_from_user(&info
, ubuf
, sizeof(info
))) {
4720 ret
= binder_ioctl_get_node_debug_info(proc
, &info
);
4724 if (copy_to_user(ubuf
, &info
, sizeof(info
))) {
4737 thread
->looper_need_return
= false;
4738 wait_event_interruptible(binder_user_error_wait
, binder_stop_on_user_error
< 2);
4739 if (ret
&& ret
!= -ERESTARTSYS
)
4740 pr_info("%d:%d ioctl %x %lx returned %d\n", proc
->pid
, current
->pid
, cmd
, arg
, ret
);
4742 trace_binder_ioctl_done(ret
);
4746 static void binder_vma_open(struct vm_area_struct
*vma
)
4748 struct binder_proc
*proc
= vma
->vm_private_data
;
4750 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
4751 "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
4752 proc
->pid
, vma
->vm_start
, vma
->vm_end
,
4753 (vma
->vm_end
- vma
->vm_start
) / SZ_1K
, vma
->vm_flags
,
4754 (unsigned long)pgprot_val(vma
->vm_page_prot
));
4757 static void binder_vma_close(struct vm_area_struct
*vma
)
4759 struct binder_proc
*proc
= vma
->vm_private_data
;
4761 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
4762 "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
4763 proc
->pid
, vma
->vm_start
, vma
->vm_end
,
4764 (vma
->vm_end
- vma
->vm_start
) / SZ_1K
, vma
->vm_flags
,
4765 (unsigned long)pgprot_val(vma
->vm_page_prot
));
4766 binder_alloc_vma_close(&proc
->alloc
);
4769 static vm_fault_t
binder_vm_fault(struct vm_fault
*vmf
)
4771 return VM_FAULT_SIGBUS
;
4774 static const struct vm_operations_struct binder_vm_ops
= {
4775 .open
= binder_vma_open
,
4776 .close
= binder_vma_close
,
4777 .fault
= binder_vm_fault
,
4780 static int binder_mmap(struct file
*filp
, struct vm_area_struct
*vma
)
4782 struct binder_proc
*proc
= filp
->private_data
;
4784 if (proc
->tsk
!= current
->group_leader
)
4787 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
4788 "%s: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
4789 __func__
, proc
->pid
, vma
->vm_start
, vma
->vm_end
,
4790 (vma
->vm_end
- vma
->vm_start
) / SZ_1K
, vma
->vm_flags
,
4791 (unsigned long)pgprot_val(vma
->vm_page_prot
));
4793 if (vma
->vm_flags
& FORBIDDEN_MMAP_FLAGS
) {
4794 pr_err("%s: %d %lx-%lx %s failed %d\n", __func__
,
4795 proc
->pid
, vma
->vm_start
, vma
->vm_end
, "bad vm_flags", -EPERM
);
4798 vma
->vm_flags
|= VM_DONTCOPY
| VM_MIXEDMAP
;
4799 vma
->vm_flags
&= ~VM_MAYWRITE
;
4801 vma
->vm_ops
= &binder_vm_ops
;
4802 vma
->vm_private_data
= proc
;
4804 return binder_alloc_mmap_handler(&proc
->alloc
, vma
);
4807 static int binder_open(struct inode
*nodp
, struct file
*filp
)
4809 struct binder_proc
*proc
, *itr
;
4810 struct binder_device
*binder_dev
;
4811 struct binderfs_info
*info
;
4812 struct dentry
*binder_binderfs_dir_entry_proc
= NULL
;
4813 bool existing_pid
= false;
4815 binder_debug(BINDER_DEBUG_OPEN_CLOSE
, "%s: %d:%d\n", __func__
,
4816 current
->group_leader
->pid
, current
->pid
);
4818 proc
= kzalloc(sizeof(*proc
), GFP_KERNEL
);
4821 spin_lock_init(&proc
->inner_lock
);
4822 spin_lock_init(&proc
->outer_lock
);
4823 get_task_struct(current
->group_leader
);
4824 proc
->tsk
= current
->group_leader
;
4825 INIT_LIST_HEAD(&proc
->todo
);
4826 proc
->default_priority
= task_nice(current
);
4827 /* binderfs stashes devices in i_private */
4828 if (is_binderfs_device(nodp
)) {
4829 binder_dev
= nodp
->i_private
;
4830 info
= nodp
->i_sb
->s_fs_info
;
4831 binder_binderfs_dir_entry_proc
= info
->proc_log_dir
;
4833 binder_dev
= container_of(filp
->private_data
,
4834 struct binder_device
, miscdev
);
4836 refcount_inc(&binder_dev
->ref
);
4837 proc
->context
= &binder_dev
->context
;
4838 binder_alloc_init(&proc
->alloc
);
4840 binder_stats_created(BINDER_STAT_PROC
);
4841 proc
->pid
= current
->group_leader
->pid
;
4842 INIT_LIST_HEAD(&proc
->delivered_death
);
4843 INIT_LIST_HEAD(&proc
->waiting_threads
);
4844 filp
->private_data
= proc
;
4846 mutex_lock(&binder_procs_lock
);
4847 hlist_for_each_entry(itr
, &binder_procs
, proc_node
) {
4848 if (itr
->pid
== proc
->pid
) {
4849 existing_pid
= true;
4853 hlist_add_head(&proc
->proc_node
, &binder_procs
);
4854 mutex_unlock(&binder_procs_lock
);
4856 if (binder_debugfs_dir_entry_proc
&& !existing_pid
) {
4859 snprintf(strbuf
, sizeof(strbuf
), "%u", proc
->pid
);
4861 * proc debug entries are shared between contexts.
4862 * Only create for the first PID to avoid debugfs log spamming
4863 * The printing code will anyway print all contexts for a given
4864 * PID so this is not a problem.
4866 proc
->debugfs_entry
= debugfs_create_file(strbuf
, 0444,
4867 binder_debugfs_dir_entry_proc
,
4868 (void *)(unsigned long)proc
->pid
,
4872 if (binder_binderfs_dir_entry_proc
&& !existing_pid
) {
4874 struct dentry
*binderfs_entry
;
4876 snprintf(strbuf
, sizeof(strbuf
), "%u", proc
->pid
);
4878 * Similar to debugfs, the process specific log file is shared
4879 * between contexts. Only create for the first PID.
4880 * This is ok since same as debugfs, the log file will contain
4881 * information on all contexts of a given PID.
4883 binderfs_entry
= binderfs_create_file(binder_binderfs_dir_entry_proc
,
4884 strbuf
, &proc_fops
, (void *)(unsigned long)proc
->pid
);
4885 if (!IS_ERR(binderfs_entry
)) {
4886 proc
->binderfs_entry
= binderfs_entry
;
4890 error
= PTR_ERR(binderfs_entry
);
4891 pr_warn("Unable to create file %s in binderfs (error %d)\n",
4899 static int binder_flush(struct file
*filp
, fl_owner_t id
)
4901 struct binder_proc
*proc
= filp
->private_data
;
4903 binder_defer_work(proc
, BINDER_DEFERRED_FLUSH
);
4908 static void binder_deferred_flush(struct binder_proc
*proc
)
4913 binder_inner_proc_lock(proc
);
4914 for (n
= rb_first(&proc
->threads
); n
!= NULL
; n
= rb_next(n
)) {
4915 struct binder_thread
*thread
= rb_entry(n
, struct binder_thread
, rb_node
);
4917 thread
->looper_need_return
= true;
4918 if (thread
->looper
& BINDER_LOOPER_STATE_WAITING
) {
4919 wake_up_interruptible(&thread
->wait
);
4923 binder_inner_proc_unlock(proc
);
4925 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
4926 "binder_flush: %d woke %d threads\n", proc
->pid
,
4930 static int binder_release(struct inode
*nodp
, struct file
*filp
)
4932 struct binder_proc
*proc
= filp
->private_data
;
4934 debugfs_remove(proc
->debugfs_entry
);
4936 if (proc
->binderfs_entry
) {
4937 binderfs_remove_file(proc
->binderfs_entry
);
4938 proc
->binderfs_entry
= NULL
;
4941 binder_defer_work(proc
, BINDER_DEFERRED_RELEASE
);
4946 static int binder_node_release(struct binder_node
*node
, int refs
)
4948 struct binder_ref
*ref
;
4950 struct binder_proc
*proc
= node
->proc
;
4952 binder_release_work(proc
, &node
->async_todo
);
4954 binder_node_lock(node
);
4955 binder_inner_proc_lock(proc
);
4956 binder_dequeue_work_ilocked(&node
->work
);
4958 * The caller must have taken a temporary ref on the node,
4960 BUG_ON(!node
->tmp_refs
);
4961 if (hlist_empty(&node
->refs
) && node
->tmp_refs
== 1) {
4962 binder_inner_proc_unlock(proc
);
4963 binder_node_unlock(node
);
4964 binder_free_node(node
);
4970 node
->local_strong_refs
= 0;
4971 node
->local_weak_refs
= 0;
4972 binder_inner_proc_unlock(proc
);
4974 spin_lock(&binder_dead_nodes_lock
);
4975 hlist_add_head(&node
->dead_node
, &binder_dead_nodes
);
4976 spin_unlock(&binder_dead_nodes_lock
);
4978 hlist_for_each_entry(ref
, &node
->refs
, node_entry
) {
4981 * Need the node lock to synchronize
4982 * with new notification requests and the
4983 * inner lock to synchronize with queued
4984 * death notifications.
4986 binder_inner_proc_lock(ref
->proc
);
4988 binder_inner_proc_unlock(ref
->proc
);
4994 BUG_ON(!list_empty(&ref
->death
->work
.entry
));
4995 ref
->death
->work
.type
= BINDER_WORK_DEAD_BINDER
;
4996 binder_enqueue_work_ilocked(&ref
->death
->work
,
4998 binder_wakeup_proc_ilocked(ref
->proc
);
4999 binder_inner_proc_unlock(ref
->proc
);
5002 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
5003 "node %d now dead, refs %d, death %d\n",
5004 node
->debug_id
, refs
, death
);
5005 binder_node_unlock(node
);
5006 binder_put_node(node
);
5011 static void binder_deferred_release(struct binder_proc
*proc
)
5013 struct binder_context
*context
= proc
->context
;
5015 int threads
, nodes
, incoming_refs
, outgoing_refs
, active_transactions
;
5017 mutex_lock(&binder_procs_lock
);
5018 hlist_del(&proc
->proc_node
);
5019 mutex_unlock(&binder_procs_lock
);
5021 mutex_lock(&context
->context_mgr_node_lock
);
5022 if (context
->binder_context_mgr_node
&&
5023 context
->binder_context_mgr_node
->proc
== proc
) {
5024 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
5025 "%s: %d context_mgr_node gone\n",
5026 __func__
, proc
->pid
);
5027 context
->binder_context_mgr_node
= NULL
;
5029 mutex_unlock(&context
->context_mgr_node_lock
);
5030 binder_inner_proc_lock(proc
);
5032 * Make sure proc stays alive after we
5033 * remove all the threads
5037 proc
->is_dead
= true;
5039 active_transactions
= 0;
5040 while ((n
= rb_first(&proc
->threads
))) {
5041 struct binder_thread
*thread
;
5043 thread
= rb_entry(n
, struct binder_thread
, rb_node
);
5044 binder_inner_proc_unlock(proc
);
5046 active_transactions
+= binder_thread_release(proc
, thread
);
5047 binder_inner_proc_lock(proc
);
5052 while ((n
= rb_first(&proc
->nodes
))) {
5053 struct binder_node
*node
;
5055 node
= rb_entry(n
, struct binder_node
, rb_node
);
5058 * take a temporary ref on the node before
5059 * calling binder_node_release() which will either
5060 * kfree() the node or call binder_put_node()
5062 binder_inc_node_tmpref_ilocked(node
);
5063 rb_erase(&node
->rb_node
, &proc
->nodes
);
5064 binder_inner_proc_unlock(proc
);
5065 incoming_refs
= binder_node_release(node
, incoming_refs
);
5066 binder_inner_proc_lock(proc
);
5068 binder_inner_proc_unlock(proc
);
5071 binder_proc_lock(proc
);
5072 while ((n
= rb_first(&proc
->refs_by_desc
))) {
5073 struct binder_ref
*ref
;
5075 ref
= rb_entry(n
, struct binder_ref
, rb_node_desc
);
5077 binder_cleanup_ref_olocked(ref
);
5078 binder_proc_unlock(proc
);
5079 binder_free_ref(ref
);
5080 binder_proc_lock(proc
);
5082 binder_proc_unlock(proc
);
5084 binder_release_work(proc
, &proc
->todo
);
5085 binder_release_work(proc
, &proc
->delivered_death
);
5087 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
5088 "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d\n",
5089 __func__
, proc
->pid
, threads
, nodes
, incoming_refs
,
5090 outgoing_refs
, active_transactions
);
5092 binder_proc_dec_tmpref(proc
);
5095 static void binder_deferred_func(struct work_struct
*work
)
5097 struct binder_proc
*proc
;
5102 mutex_lock(&binder_deferred_lock
);
5103 if (!hlist_empty(&binder_deferred_list
)) {
5104 proc
= hlist_entry(binder_deferred_list
.first
,
5105 struct binder_proc
, deferred_work_node
);
5106 hlist_del_init(&proc
->deferred_work_node
);
5107 defer
= proc
->deferred_work
;
5108 proc
->deferred_work
= 0;
5113 mutex_unlock(&binder_deferred_lock
);
5115 if (defer
& BINDER_DEFERRED_FLUSH
)
5116 binder_deferred_flush(proc
);
5118 if (defer
& BINDER_DEFERRED_RELEASE
)
5119 binder_deferred_release(proc
); /* frees proc */
5122 static DECLARE_WORK(binder_deferred_work
, binder_deferred_func
);
5125 binder_defer_work(struct binder_proc
*proc
, enum binder_deferred_state defer
)
5127 mutex_lock(&binder_deferred_lock
);
5128 proc
->deferred_work
|= defer
;
5129 if (hlist_unhashed(&proc
->deferred_work_node
)) {
5130 hlist_add_head(&proc
->deferred_work_node
,
5131 &binder_deferred_list
);
5132 schedule_work(&binder_deferred_work
);
5134 mutex_unlock(&binder_deferred_lock
);
5137 static void print_binder_transaction_ilocked(struct seq_file
*m
,
5138 struct binder_proc
*proc
,
5140 struct binder_transaction
*t
)
5142 struct binder_proc
*to_proc
;
5143 struct binder_buffer
*buffer
= t
->buffer
;
5145 spin_lock(&t
->lock
);
5146 to_proc
= t
->to_proc
;
5148 "%s %d: %pK from %d:%d to %d:%d code %x flags %x pri %ld r%d",
5149 prefix
, t
->debug_id
, t
,
5150 t
->from
? t
->from
->proc
->pid
: 0,
5151 t
->from
? t
->from
->pid
: 0,
5152 to_proc
? to_proc
->pid
: 0,
5153 t
->to_thread
? t
->to_thread
->pid
: 0,
5154 t
->code
, t
->flags
, t
->priority
, t
->need_reply
);
5155 spin_unlock(&t
->lock
);
5157 if (proc
!= to_proc
) {
5159 * Can only safely deref buffer if we are holding the
5160 * correct proc inner lock for this node
5166 if (buffer
== NULL
) {
5167 seq_puts(m
, " buffer free\n");
5170 if (buffer
->target_node
)
5171 seq_printf(m
, " node %d", buffer
->target_node
->debug_id
);
5172 seq_printf(m
, " size %zd:%zd data %pK\n",
5173 buffer
->data_size
, buffer
->offsets_size
,
5177 static void print_binder_work_ilocked(struct seq_file
*m
,
5178 struct binder_proc
*proc
,
5180 const char *transaction_prefix
,
5181 struct binder_work
*w
)
5183 struct binder_node
*node
;
5184 struct binder_transaction
*t
;
5187 case BINDER_WORK_TRANSACTION
:
5188 t
= container_of(w
, struct binder_transaction
, work
);
5189 print_binder_transaction_ilocked(
5190 m
, proc
, transaction_prefix
, t
);
5192 case BINDER_WORK_RETURN_ERROR
: {
5193 struct binder_error
*e
= container_of(
5194 w
, struct binder_error
, work
);
5196 seq_printf(m
, "%stransaction error: %u\n",
5199 case BINDER_WORK_TRANSACTION_COMPLETE
:
5200 seq_printf(m
, "%stransaction complete\n", prefix
);
5202 case BINDER_WORK_NODE
:
5203 node
= container_of(w
, struct binder_node
, work
);
5204 seq_printf(m
, "%snode work %d: u%016llx c%016llx\n",
5205 prefix
, node
->debug_id
,
5206 (u64
)node
->ptr
, (u64
)node
->cookie
);
5208 case BINDER_WORK_DEAD_BINDER
:
5209 seq_printf(m
, "%shas dead binder\n", prefix
);
5211 case BINDER_WORK_DEAD_BINDER_AND_CLEAR
:
5212 seq_printf(m
, "%shas cleared dead binder\n", prefix
);
5214 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION
:
5215 seq_printf(m
, "%shas cleared death notification\n", prefix
);
5218 seq_printf(m
, "%sunknown work: type %d\n", prefix
, w
->type
);
5223 static void print_binder_thread_ilocked(struct seq_file
*m
,
5224 struct binder_thread
*thread
,
5227 struct binder_transaction
*t
;
5228 struct binder_work
*w
;
5229 size_t start_pos
= m
->count
;
5232 seq_printf(m
, " thread %d: l %02x need_return %d tr %d\n",
5233 thread
->pid
, thread
->looper
,
5234 thread
->looper_need_return
,
5235 atomic_read(&thread
->tmp_ref
));
5236 header_pos
= m
->count
;
5237 t
= thread
->transaction_stack
;
5239 if (t
->from
== thread
) {
5240 print_binder_transaction_ilocked(m
, thread
->proc
,
5241 " outgoing transaction", t
);
5243 } else if (t
->to_thread
== thread
) {
5244 print_binder_transaction_ilocked(m
, thread
->proc
,
5245 " incoming transaction", t
);
5248 print_binder_transaction_ilocked(m
, thread
->proc
,
5249 " bad transaction", t
);
5253 list_for_each_entry(w
, &thread
->todo
, entry
) {
5254 print_binder_work_ilocked(m
, thread
->proc
, " ",
5255 " pending transaction", w
);
5257 if (!print_always
&& m
->count
== header_pos
)
5258 m
->count
= start_pos
;
5261 static void print_binder_node_nilocked(struct seq_file
*m
,
5262 struct binder_node
*node
)
5264 struct binder_ref
*ref
;
5265 struct binder_work
*w
;
5269 hlist_for_each_entry(ref
, &node
->refs
, node_entry
)
5272 seq_printf(m
, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d tr %d",
5273 node
->debug_id
, (u64
)node
->ptr
, (u64
)node
->cookie
,
5274 node
->has_strong_ref
, node
->has_weak_ref
,
5275 node
->local_strong_refs
, node
->local_weak_refs
,
5276 node
->internal_strong_refs
, count
, node
->tmp_refs
);
5278 seq_puts(m
, " proc");
5279 hlist_for_each_entry(ref
, &node
->refs
, node_entry
)
5280 seq_printf(m
, " %d", ref
->proc
->pid
);
5284 list_for_each_entry(w
, &node
->async_todo
, entry
)
5285 print_binder_work_ilocked(m
, node
->proc
, " ",
5286 " pending async transaction", w
);
5290 static void print_binder_ref_olocked(struct seq_file
*m
,
5291 struct binder_ref
*ref
)
5293 binder_node_lock(ref
->node
);
5294 seq_printf(m
, " ref %d: desc %d %snode %d s %d w %d d %pK\n",
5295 ref
->data
.debug_id
, ref
->data
.desc
,
5296 ref
->node
->proc
? "" : "dead ",
5297 ref
->node
->debug_id
, ref
->data
.strong
,
5298 ref
->data
.weak
, ref
->death
);
5299 binder_node_unlock(ref
->node
);
5302 static void print_binder_proc(struct seq_file
*m
,
5303 struct binder_proc
*proc
, int print_all
)
5305 struct binder_work
*w
;
5307 size_t start_pos
= m
->count
;
5309 struct binder_node
*last_node
= NULL
;
5311 seq_printf(m
, "proc %d\n", proc
->pid
);
5312 seq_printf(m
, "context %s\n", proc
->context
->name
);
5313 header_pos
= m
->count
;
5315 binder_inner_proc_lock(proc
);
5316 for (n
= rb_first(&proc
->threads
); n
!= NULL
; n
= rb_next(n
))
5317 print_binder_thread_ilocked(m
, rb_entry(n
, struct binder_thread
,
5318 rb_node
), print_all
);
5320 for (n
= rb_first(&proc
->nodes
); n
!= NULL
; n
= rb_next(n
)) {
5321 struct binder_node
*node
= rb_entry(n
, struct binder_node
,
5323 if (!print_all
&& !node
->has_async_transaction
)
5327 * take a temporary reference on the node so it
5328 * survives and isn't removed from the tree
5329 * while we print it.
5331 binder_inc_node_tmpref_ilocked(node
);
5332 /* Need to drop inner lock to take node lock */
5333 binder_inner_proc_unlock(proc
);
5335 binder_put_node(last_node
);
5336 binder_node_inner_lock(node
);
5337 print_binder_node_nilocked(m
, node
);
5338 binder_node_inner_unlock(node
);
5340 binder_inner_proc_lock(proc
);
5342 binder_inner_proc_unlock(proc
);
5344 binder_put_node(last_node
);
5347 binder_proc_lock(proc
);
5348 for (n
= rb_first(&proc
->refs_by_desc
);
5351 print_binder_ref_olocked(m
, rb_entry(n
,
5354 binder_proc_unlock(proc
);
5356 binder_alloc_print_allocated(m
, &proc
->alloc
);
5357 binder_inner_proc_lock(proc
);
5358 list_for_each_entry(w
, &proc
->todo
, entry
)
5359 print_binder_work_ilocked(m
, proc
, " ",
5360 " pending transaction", w
);
5361 list_for_each_entry(w
, &proc
->delivered_death
, entry
) {
5362 seq_puts(m
, " has delivered dead binder\n");
5365 binder_inner_proc_unlock(proc
);
5366 if (!print_all
&& m
->count
== header_pos
)
5367 m
->count
= start_pos
;
5370 static const char * const binder_return_strings
[] = {
5375 "BR_ACQUIRE_RESULT",
5377 "BR_TRANSACTION_COMPLETE",
5382 "BR_ATTEMPT_ACQUIRE",
5387 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
5391 static const char * const binder_command_strings
[] = {
5394 "BC_ACQUIRE_RESULT",
5402 "BC_ATTEMPT_ACQUIRE",
5403 "BC_REGISTER_LOOPER",
5406 "BC_REQUEST_DEATH_NOTIFICATION",
5407 "BC_CLEAR_DEATH_NOTIFICATION",
5408 "BC_DEAD_BINDER_DONE",
5409 "BC_TRANSACTION_SG",
5413 static const char * const binder_objstat_strings
[] = {
5420 "transaction_complete"
5423 static void print_binder_stats(struct seq_file
*m
, const char *prefix
,
5424 struct binder_stats
*stats
)
5428 BUILD_BUG_ON(ARRAY_SIZE(stats
->bc
) !=
5429 ARRAY_SIZE(binder_command_strings
));
5430 for (i
= 0; i
< ARRAY_SIZE(stats
->bc
); i
++) {
5431 int temp
= atomic_read(&stats
->bc
[i
]);
5434 seq_printf(m
, "%s%s: %d\n", prefix
,
5435 binder_command_strings
[i
], temp
);
5438 BUILD_BUG_ON(ARRAY_SIZE(stats
->br
) !=
5439 ARRAY_SIZE(binder_return_strings
));
5440 for (i
= 0; i
< ARRAY_SIZE(stats
->br
); i
++) {
5441 int temp
= atomic_read(&stats
->br
[i
]);
5444 seq_printf(m
, "%s%s: %d\n", prefix
,
5445 binder_return_strings
[i
], temp
);
5448 BUILD_BUG_ON(ARRAY_SIZE(stats
->obj_created
) !=
5449 ARRAY_SIZE(binder_objstat_strings
));
5450 BUILD_BUG_ON(ARRAY_SIZE(stats
->obj_created
) !=
5451 ARRAY_SIZE(stats
->obj_deleted
));
5452 for (i
= 0; i
< ARRAY_SIZE(stats
->obj_created
); i
++) {
5453 int created
= atomic_read(&stats
->obj_created
[i
]);
5454 int deleted
= atomic_read(&stats
->obj_deleted
[i
]);
5456 if (created
|| deleted
)
5457 seq_printf(m
, "%s%s: active %d total %d\n",
5459 binder_objstat_strings
[i
],
5465 static void print_binder_proc_stats(struct seq_file
*m
,
5466 struct binder_proc
*proc
)
5468 struct binder_work
*w
;
5469 struct binder_thread
*thread
;
5471 int count
, strong
, weak
, ready_threads
;
5472 size_t free_async_space
=
5473 binder_alloc_get_free_async_space(&proc
->alloc
);
5475 seq_printf(m
, "proc %d\n", proc
->pid
);
5476 seq_printf(m
, "context %s\n", proc
->context
->name
);
5479 binder_inner_proc_lock(proc
);
5480 for (n
= rb_first(&proc
->threads
); n
!= NULL
; n
= rb_next(n
))
5483 list_for_each_entry(thread
, &proc
->waiting_threads
, waiting_thread_node
)
5486 seq_printf(m
, " threads: %d\n", count
);
5487 seq_printf(m
, " requested threads: %d+%d/%d\n"
5488 " ready threads %d\n"
5489 " free async space %zd\n", proc
->requested_threads
,
5490 proc
->requested_threads_started
, proc
->max_threads
,
5494 for (n
= rb_first(&proc
->nodes
); n
!= NULL
; n
= rb_next(n
))
5496 binder_inner_proc_unlock(proc
);
5497 seq_printf(m
, " nodes: %d\n", count
);
5501 binder_proc_lock(proc
);
5502 for (n
= rb_first(&proc
->refs_by_desc
); n
!= NULL
; n
= rb_next(n
)) {
5503 struct binder_ref
*ref
= rb_entry(n
, struct binder_ref
,
5506 strong
+= ref
->data
.strong
;
5507 weak
+= ref
->data
.weak
;
5509 binder_proc_unlock(proc
);
5510 seq_printf(m
, " refs: %d s %d w %d\n", count
, strong
, weak
);
5512 count
= binder_alloc_get_allocated_count(&proc
->alloc
);
5513 seq_printf(m
, " buffers: %d\n", count
);
5515 binder_alloc_print_pages(m
, &proc
->alloc
);
5518 binder_inner_proc_lock(proc
);
5519 list_for_each_entry(w
, &proc
->todo
, entry
) {
5520 if (w
->type
== BINDER_WORK_TRANSACTION
)
5523 binder_inner_proc_unlock(proc
);
5524 seq_printf(m
, " pending transactions: %d\n", count
);
5526 print_binder_stats(m
, " ", &proc
->stats
);
5530 int binder_state_show(struct seq_file
*m
, void *unused
)
5532 struct binder_proc
*proc
;
5533 struct binder_node
*node
;
5534 struct binder_node
*last_node
= NULL
;
5536 seq_puts(m
, "binder state:\n");
5538 spin_lock(&binder_dead_nodes_lock
);
5539 if (!hlist_empty(&binder_dead_nodes
))
5540 seq_puts(m
, "dead nodes:\n");
5541 hlist_for_each_entry(node
, &binder_dead_nodes
, dead_node
) {
5543 * take a temporary reference on the node so it
5544 * survives and isn't removed from the list
5545 * while we print it.
5548 spin_unlock(&binder_dead_nodes_lock
);
5550 binder_put_node(last_node
);
5551 binder_node_lock(node
);
5552 print_binder_node_nilocked(m
, node
);
5553 binder_node_unlock(node
);
5555 spin_lock(&binder_dead_nodes_lock
);
5557 spin_unlock(&binder_dead_nodes_lock
);
5559 binder_put_node(last_node
);
5561 mutex_lock(&binder_procs_lock
);
5562 hlist_for_each_entry(proc
, &binder_procs
, proc_node
)
5563 print_binder_proc(m
, proc
, 1);
5564 mutex_unlock(&binder_procs_lock
);
5569 int binder_stats_show(struct seq_file
*m
, void *unused
)
5571 struct binder_proc
*proc
;
5573 seq_puts(m
, "binder stats:\n");
5575 print_binder_stats(m
, "", &binder_stats
);
5577 mutex_lock(&binder_procs_lock
);
5578 hlist_for_each_entry(proc
, &binder_procs
, proc_node
)
5579 print_binder_proc_stats(m
, proc
);
5580 mutex_unlock(&binder_procs_lock
);
5585 int binder_transactions_show(struct seq_file
*m
, void *unused
)
5587 struct binder_proc
*proc
;
5589 seq_puts(m
, "binder transactions:\n");
5590 mutex_lock(&binder_procs_lock
);
5591 hlist_for_each_entry(proc
, &binder_procs
, proc_node
)
5592 print_binder_proc(m
, proc
, 0);
5593 mutex_unlock(&binder_procs_lock
);
5598 static int proc_show(struct seq_file
*m
, void *unused
)
5600 struct binder_proc
*itr
;
5601 int pid
= (unsigned long)m
->private;
5603 mutex_lock(&binder_procs_lock
);
5604 hlist_for_each_entry(itr
, &binder_procs
, proc_node
) {
5605 if (itr
->pid
== pid
) {
5606 seq_puts(m
, "binder proc state:\n");
5607 print_binder_proc(m
, itr
, 1);
5610 mutex_unlock(&binder_procs_lock
);
5615 static void print_binder_transaction_log_entry(struct seq_file
*m
,
5616 struct binder_transaction_log_entry
*e
)
5618 int debug_id
= READ_ONCE(e
->debug_id_done
);
5620 * read barrier to guarantee debug_id_done read before
5621 * we print the log values
5625 "%d: %s from %d:%d to %d:%d context %s node %d handle %d size %d:%d ret %d/%d l=%d",
5626 e
->debug_id
, (e
->call_type
== 2) ? "reply" :
5627 ((e
->call_type
== 1) ? "async" : "call "), e
->from_proc
,
5628 e
->from_thread
, e
->to_proc
, e
->to_thread
, e
->context_name
,
5629 e
->to_node
, e
->target_handle
, e
->data_size
, e
->offsets_size
,
5630 e
->return_error
, e
->return_error_param
,
5631 e
->return_error_line
);
5633 * read-barrier to guarantee read of debug_id_done after
5634 * done printing the fields of the entry
5637 seq_printf(m
, debug_id
&& debug_id
== READ_ONCE(e
->debug_id_done
) ?
5638 "\n" : " (incomplete)\n");
5641 int binder_transaction_log_show(struct seq_file
*m
, void *unused
)
5643 struct binder_transaction_log
*log
= m
->private;
5644 unsigned int log_cur
= atomic_read(&log
->cur
);
5649 count
= log_cur
+ 1;
5650 cur
= count
< ARRAY_SIZE(log
->entry
) && !log
->full
?
5651 0 : count
% ARRAY_SIZE(log
->entry
);
5652 if (count
> ARRAY_SIZE(log
->entry
) || log
->full
)
5653 count
= ARRAY_SIZE(log
->entry
);
5654 for (i
= 0; i
< count
; i
++) {
5655 unsigned int index
= cur
++ % ARRAY_SIZE(log
->entry
);
5657 print_binder_transaction_log_entry(m
, &log
->entry
[index
]);
5662 const struct file_operations binder_fops
= {
5663 .owner
= THIS_MODULE
,
5664 .poll
= binder_poll
,
5665 .unlocked_ioctl
= binder_ioctl
,
5666 .compat_ioctl
= compat_ptr_ioctl
,
5667 .mmap
= binder_mmap
,
5668 .open
= binder_open
,
5669 .flush
= binder_flush
,
5670 .release
= binder_release
,
5673 static int __init
init_binder_device(const char *name
)
5676 struct binder_device
*binder_device
;
5678 binder_device
= kzalloc(sizeof(*binder_device
), GFP_KERNEL
);
5682 binder_device
->miscdev
.fops
= &binder_fops
;
5683 binder_device
->miscdev
.minor
= MISC_DYNAMIC_MINOR
;
5684 binder_device
->miscdev
.name
= name
;
5686 refcount_set(&binder_device
->ref
, 1);
5687 binder_device
->context
.binder_context_mgr_uid
= INVALID_UID
;
5688 binder_device
->context
.name
= name
;
5689 mutex_init(&binder_device
->context
.context_mgr_node_lock
);
5691 ret
= misc_register(&binder_device
->miscdev
);
5693 kfree(binder_device
);
5697 hlist_add_head(&binder_device
->hlist
, &binder_devices
);
5702 static int __init
binder_init(void)
5705 char *device_name
, *device_tmp
;
5706 struct binder_device
*device
;
5707 struct hlist_node
*tmp
;
5708 char *device_names
= NULL
;
5710 ret
= binder_alloc_shrinker_init();
5714 atomic_set(&binder_transaction_log
.cur
, ~0U);
5715 atomic_set(&binder_transaction_log_failed
.cur
, ~0U);
5717 binder_debugfs_dir_entry_root
= debugfs_create_dir("binder", NULL
);
5718 if (binder_debugfs_dir_entry_root
)
5719 binder_debugfs_dir_entry_proc
= debugfs_create_dir("proc",
5720 binder_debugfs_dir_entry_root
);
5722 if (binder_debugfs_dir_entry_root
) {
5723 debugfs_create_file("state",
5725 binder_debugfs_dir_entry_root
,
5727 &binder_state_fops
);
5728 debugfs_create_file("stats",
5730 binder_debugfs_dir_entry_root
,
5732 &binder_stats_fops
);
5733 debugfs_create_file("transactions",
5735 binder_debugfs_dir_entry_root
,
5737 &binder_transactions_fops
);
5738 debugfs_create_file("transaction_log",
5740 binder_debugfs_dir_entry_root
,
5741 &binder_transaction_log
,
5742 &binder_transaction_log_fops
);
5743 debugfs_create_file("failed_transaction_log",
5745 binder_debugfs_dir_entry_root
,
5746 &binder_transaction_log_failed
,
5747 &binder_transaction_log_fops
);
5750 if (!IS_ENABLED(CONFIG_ANDROID_BINDERFS
) &&
5751 strcmp(binder_devices_param
, "") != 0) {
5753 * Copy the module_parameter string, because we don't want to
5754 * tokenize it in-place.
5756 device_names
= kstrdup(binder_devices_param
, GFP_KERNEL
);
5757 if (!device_names
) {
5759 goto err_alloc_device_names_failed
;
5762 device_tmp
= device_names
;
5763 while ((device_name
= strsep(&device_tmp
, ","))) {
5764 ret
= init_binder_device(device_name
);
5766 goto err_init_binder_device_failed
;
5770 ret
= init_binderfs();
5772 goto err_init_binder_device_failed
;
5776 err_init_binder_device_failed
:
5777 hlist_for_each_entry_safe(device
, tmp
, &binder_devices
, hlist
) {
5778 misc_deregister(&device
->miscdev
);
5779 hlist_del(&device
->hlist
);
5783 kfree(device_names
);
5785 err_alloc_device_names_failed
:
5786 debugfs_remove_recursive(binder_debugfs_dir_entry_root
);
5791 device_initcall(binder_init
);
5793 #define CREATE_TRACE_POINTS
5794 #include "binder_trace.h"
5796 MODULE_LICENSE("GPL v2");