3 * Android IPC Subsystem
5 * Copyright (C) 2007-2008 Google, Inc.
7 * This software is licensed under the terms of the GNU General Public
8 * License version 2, as published by the Free Software Foundation, and
9 * may be copied, distributed, and modified under those terms.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
21 * There are 3 main spinlocks which must be acquired in the
24 * 1) proc->outer_lock : protects binder_ref
25 * binder_proc_lock() and binder_proc_unlock() are
27 * 2) node->lock : protects most fields of binder_node.
28 * binder_node_lock() and binder_node_unlock() are
30 * 3) proc->inner_lock : protects the thread and node lists
31 * (proc->threads, proc->waiting_threads, proc->nodes)
32 * and all todo lists associated with the binder_proc
33 * (proc->todo, thread->todo, proc->delivered_death and
34 * node->async_todo), as well as thread->transaction_stack
35 * binder_inner_proc_lock() and binder_inner_proc_unlock()
38 * Any lock under procA must never be nested under any lock at the same
39 * level or below on procB.
41 * Functions that require a lock held on entry indicate which lock
42 * in the suffix of the function name:
44 * foo_olocked() : requires node->outer_lock
45 * foo_nlocked() : requires node->lock
46 * foo_ilocked() : requires proc->inner_lock
47 * foo_oilocked(): requires proc->outer_lock and proc->inner_lock
48 * foo_nilocked(): requires node->lock and proc->inner_lock
52 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
54 #include <linux/fdtable.h>
55 #include <linux/file.h>
56 #include <linux/freezer.h>
58 #include <linux/list.h>
59 #include <linux/miscdevice.h>
60 #include <linux/module.h>
61 #include <linux/mutex.h>
62 #include <linux/nsproxy.h>
63 #include <linux/poll.h>
64 #include <linux/debugfs.h>
65 #include <linux/rbtree.h>
66 #include <linux/sched/signal.h>
67 #include <linux/sched/mm.h>
68 #include <linux/seq_file.h>
69 #include <linux/uaccess.h>
70 #include <linux/pid_namespace.h>
71 #include <linux/security.h>
72 #include <linux/spinlock.h>
73 #include <linux/ratelimit.h>
75 #include <uapi/linux/android/binder.h>
77 #include <asm/cacheflush.h>
79 #include "binder_alloc.h"
80 #include "binder_trace.h"
82 static HLIST_HEAD(binder_deferred_list
);
83 static DEFINE_MUTEX(binder_deferred_lock
);
85 static HLIST_HEAD(binder_devices
);
86 static HLIST_HEAD(binder_procs
);
87 static DEFINE_MUTEX(binder_procs_lock
);
89 static HLIST_HEAD(binder_dead_nodes
);
90 static DEFINE_SPINLOCK(binder_dead_nodes_lock
);
92 static struct dentry
*binder_debugfs_dir_entry_root
;
93 static struct dentry
*binder_debugfs_dir_entry_proc
;
94 static atomic_t binder_last_id
;
96 #define BINDER_DEBUG_ENTRY(name) \
97 static int binder_##name##_open(struct inode *inode, struct file *file) \
99 return single_open(file, binder_##name##_show, inode->i_private); \
102 static const struct file_operations binder_##name##_fops = { \
103 .owner = THIS_MODULE, \
104 .open = binder_##name##_open, \
106 .llseek = seq_lseek, \
107 .release = single_release, \
110 static int binder_proc_show(struct seq_file
*m
, void *unused
);
111 BINDER_DEBUG_ENTRY(proc
);
113 /* This is only defined in include/asm-arm/sizes.h */
119 #define SZ_4M 0x400000
122 #define FORBIDDEN_MMAP_FLAGS (VM_WRITE)
125 BINDER_DEBUG_USER_ERROR
= 1U << 0,
126 BINDER_DEBUG_FAILED_TRANSACTION
= 1U << 1,
127 BINDER_DEBUG_DEAD_TRANSACTION
= 1U << 2,
128 BINDER_DEBUG_OPEN_CLOSE
= 1U << 3,
129 BINDER_DEBUG_DEAD_BINDER
= 1U << 4,
130 BINDER_DEBUG_DEATH_NOTIFICATION
= 1U << 5,
131 BINDER_DEBUG_READ_WRITE
= 1U << 6,
132 BINDER_DEBUG_USER_REFS
= 1U << 7,
133 BINDER_DEBUG_THREADS
= 1U << 8,
134 BINDER_DEBUG_TRANSACTION
= 1U << 9,
135 BINDER_DEBUG_TRANSACTION_COMPLETE
= 1U << 10,
136 BINDER_DEBUG_FREE_BUFFER
= 1U << 11,
137 BINDER_DEBUG_INTERNAL_REFS
= 1U << 12,
138 BINDER_DEBUG_PRIORITY_CAP
= 1U << 13,
139 BINDER_DEBUG_SPINLOCKS
= 1U << 14,
141 static uint32_t binder_debug_mask
= BINDER_DEBUG_USER_ERROR
|
142 BINDER_DEBUG_FAILED_TRANSACTION
| BINDER_DEBUG_DEAD_TRANSACTION
;
143 module_param_named(debug_mask
, binder_debug_mask
, uint
, 0644);
145 static char *binder_devices_param
= CONFIG_ANDROID_BINDER_DEVICES
;
146 module_param_named(devices
, binder_devices_param
, charp
, 0444);
148 static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait
);
149 static int binder_stop_on_user_error
;
151 static int binder_set_stop_on_user_error(const char *val
,
152 const struct kernel_param
*kp
)
156 ret
= param_set_int(val
, kp
);
157 if (binder_stop_on_user_error
< 2)
158 wake_up(&binder_user_error_wait
);
161 module_param_call(stop_on_user_error
, binder_set_stop_on_user_error
,
162 param_get_int
, &binder_stop_on_user_error
, 0644);
164 #define binder_debug(mask, x...) \
166 if (binder_debug_mask & mask) \
167 pr_info_ratelimited(x); \
170 #define binder_user_error(x...) \
172 if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) \
173 pr_info_ratelimited(x); \
174 if (binder_stop_on_user_error) \
175 binder_stop_on_user_error = 2; \
178 #define to_flat_binder_object(hdr) \
179 container_of(hdr, struct flat_binder_object, hdr)
181 #define to_binder_fd_object(hdr) container_of(hdr, struct binder_fd_object, hdr)
183 #define to_binder_buffer_object(hdr) \
184 container_of(hdr, struct binder_buffer_object, hdr)
186 #define to_binder_fd_array_object(hdr) \
187 container_of(hdr, struct binder_fd_array_object, hdr)
189 enum binder_stat_types
{
195 BINDER_STAT_TRANSACTION
,
196 BINDER_STAT_TRANSACTION_COMPLETE
,
200 struct binder_stats
{
201 atomic_t br
[_IOC_NR(BR_FAILED_REPLY
) + 1];
202 atomic_t bc
[_IOC_NR(BC_REPLY_SG
) + 1];
203 atomic_t obj_created
[BINDER_STAT_COUNT
];
204 atomic_t obj_deleted
[BINDER_STAT_COUNT
];
207 static struct binder_stats binder_stats
;
209 static inline void binder_stats_deleted(enum binder_stat_types type
)
211 atomic_inc(&binder_stats
.obj_deleted
[type
]);
214 static inline void binder_stats_created(enum binder_stat_types type
)
216 atomic_inc(&binder_stats
.obj_created
[type
]);
219 struct binder_transaction_log_entry
{
231 int return_error_line
;
232 uint32_t return_error
;
233 uint32_t return_error_param
;
234 const char *context_name
;
236 struct binder_transaction_log
{
239 struct binder_transaction_log_entry entry
[32];
241 static struct binder_transaction_log binder_transaction_log
;
242 static struct binder_transaction_log binder_transaction_log_failed
;
244 static struct binder_transaction_log_entry
*binder_transaction_log_add(
245 struct binder_transaction_log
*log
)
247 struct binder_transaction_log_entry
*e
;
248 unsigned int cur
= atomic_inc_return(&log
->cur
);
250 if (cur
>= ARRAY_SIZE(log
->entry
))
252 e
= &log
->entry
[cur
% ARRAY_SIZE(log
->entry
)];
253 WRITE_ONCE(e
->debug_id_done
, 0);
255 * write-barrier to synchronize access to e->debug_id_done.
256 * We make sure the initialized 0 value is seen before
257 * memset() other fields are zeroed by memset.
260 memset(e
, 0, sizeof(*e
));
264 struct binder_context
{
265 struct binder_node
*binder_context_mgr_node
;
266 struct mutex context_mgr_node_lock
;
268 kuid_t binder_context_mgr_uid
;
272 struct binder_device
{
273 struct hlist_node hlist
;
274 struct miscdevice miscdev
;
275 struct binder_context context
;
279 * struct binder_work - work enqueued on a worklist
280 * @entry: node enqueued on list
281 * @type: type of work to be performed
283 * There are separate work lists for proc, thread, and node (async).
286 struct list_head entry
;
289 BINDER_WORK_TRANSACTION
= 1,
290 BINDER_WORK_TRANSACTION_COMPLETE
,
291 BINDER_WORK_RETURN_ERROR
,
293 BINDER_WORK_DEAD_BINDER
,
294 BINDER_WORK_DEAD_BINDER_AND_CLEAR
,
295 BINDER_WORK_CLEAR_DEATH_NOTIFICATION
,
299 struct binder_error
{
300 struct binder_work work
;
305 * struct binder_node - binder node bookkeeping
306 * @debug_id: unique ID for debugging
307 * (invariant after initialized)
308 * @lock: lock for node fields
309 * @work: worklist element for node work
310 * (protected by @proc->inner_lock)
311 * @rb_node: element for proc->nodes tree
312 * (protected by @proc->inner_lock)
313 * @dead_node: element for binder_dead_nodes list
314 * (protected by binder_dead_nodes_lock)
315 * @proc: binder_proc that owns this node
316 * (invariant after initialized)
317 * @refs: list of references on this node
318 * (protected by @lock)
319 * @internal_strong_refs: used to take strong references when
320 * initiating a transaction
321 * (protected by @proc->inner_lock if @proc
323 * @local_weak_refs: weak user refs from local process
324 * (protected by @proc->inner_lock if @proc
326 * @local_strong_refs: strong user refs from local process
327 * (protected by @proc->inner_lock if @proc
329 * @tmp_refs: temporary kernel refs
330 * (protected by @proc->inner_lock while @proc
331 * is valid, and by binder_dead_nodes_lock
332 * if @proc is NULL. During inc/dec and node release
333 * it is also protected by @lock to provide safety
334 * as the node dies and @proc becomes NULL)
335 * @ptr: userspace pointer for node
336 * (invariant, no lock needed)
337 * @cookie: userspace cookie for node
338 * (invariant, no lock needed)
339 * @has_strong_ref: userspace notified of strong ref
340 * (protected by @proc->inner_lock if @proc
342 * @pending_strong_ref: userspace has acked notification of strong ref
343 * (protected by @proc->inner_lock if @proc
345 * @has_weak_ref: userspace notified of weak ref
346 * (protected by @proc->inner_lock if @proc
348 * @pending_weak_ref: userspace has acked notification of weak ref
349 * (protected by @proc->inner_lock if @proc
351 * @has_async_transaction: async transaction to node in progress
352 * (protected by @lock)
353 * @accept_fds: file descriptor operations supported for node
354 * (invariant after initialized)
355 * @min_priority: minimum scheduling priority
356 * (invariant after initialized)
357 * @async_todo: list of async work items
358 * (protected by @proc->inner_lock)
360 * Bookkeeping structure for binder nodes.
365 struct binder_work work
;
367 struct rb_node rb_node
;
368 struct hlist_node dead_node
;
370 struct binder_proc
*proc
;
371 struct hlist_head refs
;
372 int internal_strong_refs
;
374 int local_strong_refs
;
376 binder_uintptr_t ptr
;
377 binder_uintptr_t cookie
;
380 * bitfield elements protected by
384 u8 pending_strong_ref
:1;
386 u8 pending_weak_ref
:1;
390 * invariant after initialization
395 bool has_async_transaction
;
396 struct list_head async_todo
;
399 struct binder_ref_death
{
401 * @work: worklist element for death notifications
402 * (protected by inner_lock of the proc that
403 * this ref belongs to)
405 struct binder_work work
;
406 binder_uintptr_t cookie
;
410 * struct binder_ref_data - binder_ref counts and id
411 * @debug_id: unique ID for the ref
412 * @desc: unique userspace handle for ref
413 * @strong: strong ref count (debugging only if not locked)
414 * @weak: weak ref count (debugging only if not locked)
416 * Structure to hold ref count and ref id information. Since
417 * the actual ref can only be accessed with a lock, this structure
418 * is used to return information about the ref to callers of
419 * ref inc/dec functions.
421 struct binder_ref_data
{
429 * struct binder_ref - struct to track references on nodes
430 * @data: binder_ref_data containing id, handle, and current refcounts
431 * @rb_node_desc: node for lookup by @data.desc in proc's rb_tree
432 * @rb_node_node: node for lookup by @node in proc's rb_tree
433 * @node_entry: list entry for node->refs list in target node
434 * (protected by @node->lock)
435 * @proc: binder_proc containing ref
436 * @node: binder_node of target node. When cleaning up a
437 * ref for deletion in binder_cleanup_ref, a non-NULL
438 * @node indicates the node must be freed
439 * @death: pointer to death notification (ref_death) if requested
440 * (protected by @node->lock)
442 * Structure to track references from procA to target node (on procB). This
443 * structure is unsafe to access without holding @proc->outer_lock.
446 /* Lookups needed: */
447 /* node + proc => ref (transaction) */
448 /* desc + proc => ref (transaction, inc/dec ref) */
449 /* node => refs + procs (proc exit) */
450 struct binder_ref_data data
;
451 struct rb_node rb_node_desc
;
452 struct rb_node rb_node_node
;
453 struct hlist_node node_entry
;
454 struct binder_proc
*proc
;
455 struct binder_node
*node
;
456 struct binder_ref_death
*death
;
459 enum binder_deferred_state
{
460 BINDER_DEFERRED_PUT_FILES
= 0x01,
461 BINDER_DEFERRED_FLUSH
= 0x02,
462 BINDER_DEFERRED_RELEASE
= 0x04,
466 * struct binder_proc - binder process bookkeeping
467 * @proc_node: element for binder_procs list
468 * @threads: rbtree of binder_threads in this proc
469 * (protected by @inner_lock)
470 * @nodes: rbtree of binder nodes associated with
471 * this proc ordered by node->ptr
472 * (protected by @inner_lock)
473 * @refs_by_desc: rbtree of refs ordered by ref->desc
474 * (protected by @outer_lock)
475 * @refs_by_node: rbtree of refs ordered by ref->node
476 * (protected by @outer_lock)
477 * @waiting_threads: threads currently waiting for proc work
478 * (protected by @inner_lock)
479 * @pid PID of group_leader of process
480 * (invariant after initialized)
481 * @tsk task_struct for group_leader of process
482 * (invariant after initialized)
483 * @files files_struct for process
484 * (protected by @files_lock)
485 * @files_lock mutex to protect @files
486 * @deferred_work_node: element for binder_deferred_list
487 * (protected by binder_deferred_lock)
488 * @deferred_work: bitmap of deferred work to perform
489 * (protected by binder_deferred_lock)
490 * @is_dead: process is dead and awaiting free
491 * when outstanding transactions are cleaned up
492 * (protected by @inner_lock)
493 * @todo: list of work for this process
494 * (protected by @inner_lock)
495 * @stats: per-process binder statistics
496 * (atomics, no lock needed)
497 * @delivered_death: list of delivered death notification
498 * (protected by @inner_lock)
499 * @max_threads: cap on number of binder threads
500 * (protected by @inner_lock)
501 * @requested_threads: number of binder threads requested but not
502 * yet started. In current implementation, can
504 * (protected by @inner_lock)
505 * @requested_threads_started: number binder threads started
506 * (protected by @inner_lock)
507 * @tmp_ref: temporary reference to indicate proc is in use
508 * (protected by @inner_lock)
509 * @default_priority: default scheduler priority
510 * (invariant after initialized)
511 * @debugfs_entry: debugfs node
512 * @alloc: binder allocator bookkeeping
513 * @context: binder_context for this proc
514 * (invariant after initialized)
515 * @inner_lock: can nest under outer_lock and/or node lock
516 * @outer_lock: no nesting under innor or node lock
517 * Lock order: 1) outer, 2) node, 3) inner
519 * Bookkeeping structure for binder processes
522 struct hlist_node proc_node
;
523 struct rb_root threads
;
524 struct rb_root nodes
;
525 struct rb_root refs_by_desc
;
526 struct rb_root refs_by_node
;
527 struct list_head waiting_threads
;
529 struct task_struct
*tsk
;
530 struct files_struct
*files
;
531 struct mutex files_lock
;
532 struct hlist_node deferred_work_node
;
536 struct list_head todo
;
537 struct binder_stats stats
;
538 struct list_head delivered_death
;
540 int requested_threads
;
541 int requested_threads_started
;
543 long default_priority
;
544 struct dentry
*debugfs_entry
;
545 struct binder_alloc alloc
;
546 struct binder_context
*context
;
547 spinlock_t inner_lock
;
548 spinlock_t outer_lock
;
552 BINDER_LOOPER_STATE_REGISTERED
= 0x01,
553 BINDER_LOOPER_STATE_ENTERED
= 0x02,
554 BINDER_LOOPER_STATE_EXITED
= 0x04,
555 BINDER_LOOPER_STATE_INVALID
= 0x08,
556 BINDER_LOOPER_STATE_WAITING
= 0x10,
557 BINDER_LOOPER_STATE_POLL
= 0x20,
561 * struct binder_thread - binder thread bookkeeping
562 * @proc: binder process for this thread
563 * (invariant after initialization)
564 * @rb_node: element for proc->threads rbtree
565 * (protected by @proc->inner_lock)
566 * @waiting_thread_node: element for @proc->waiting_threads list
567 * (protected by @proc->inner_lock)
568 * @pid: PID for this thread
569 * (invariant after initialization)
570 * @looper: bitmap of looping state
571 * (only accessed by this thread)
572 * @looper_needs_return: looping thread needs to exit driver
574 * @transaction_stack: stack of in-progress transactions for this thread
575 * (protected by @proc->inner_lock)
576 * @todo: list of work to do for this thread
577 * (protected by @proc->inner_lock)
578 * @process_todo: whether work in @todo should be processed
579 * (protected by @proc->inner_lock)
580 * @return_error: transaction errors reported by this thread
581 * (only accessed by this thread)
582 * @reply_error: transaction errors reported by target thread
583 * (protected by @proc->inner_lock)
584 * @wait: wait queue for thread work
585 * @stats: per-thread statistics
586 * (atomics, no lock needed)
587 * @tmp_ref: temporary reference to indicate thread is in use
588 * (atomic since @proc->inner_lock cannot
589 * always be acquired)
590 * @is_dead: thread is dead and awaiting free
591 * when outstanding transactions are cleaned up
592 * (protected by @proc->inner_lock)
594 * Bookkeeping structure for binder threads.
596 struct binder_thread
{
597 struct binder_proc
*proc
;
598 struct rb_node rb_node
;
599 struct list_head waiting_thread_node
;
601 int looper
; /* only modified by this thread */
602 bool looper_need_return
; /* can be written by other thread */
603 struct binder_transaction
*transaction_stack
;
604 struct list_head todo
;
606 struct binder_error return_error
;
607 struct binder_error reply_error
;
608 wait_queue_head_t wait
;
609 struct binder_stats stats
;
614 struct binder_transaction
{
616 struct binder_work work
;
617 struct binder_thread
*from
;
618 struct binder_transaction
*from_parent
;
619 struct binder_proc
*to_proc
;
620 struct binder_thread
*to_thread
;
621 struct binder_transaction
*to_parent
;
622 unsigned need_reply
:1;
623 /* unsigned is_dead:1; */ /* not used at the moment */
625 struct binder_buffer
*buffer
;
632 * @lock: protects @from, @to_proc, and @to_thread
634 * @from, @to_proc, and @to_thread can be set to NULL
635 * during thread teardown
641 * binder_proc_lock() - Acquire outer lock for given binder_proc
642 * @proc: struct binder_proc to acquire
644 * Acquires proc->outer_lock. Used to protect binder_ref
645 * structures associated with the given proc.
647 #define binder_proc_lock(proc) _binder_proc_lock(proc, __LINE__)
649 _binder_proc_lock(struct binder_proc
*proc
, int line
)
651 binder_debug(BINDER_DEBUG_SPINLOCKS
,
652 "%s: line=%d\n", __func__
, line
);
653 spin_lock(&proc
->outer_lock
);
657 * binder_proc_unlock() - Release spinlock for given binder_proc
658 * @proc: struct binder_proc to acquire
660 * Release lock acquired via binder_proc_lock()
662 #define binder_proc_unlock(_proc) _binder_proc_unlock(_proc, __LINE__)
664 _binder_proc_unlock(struct binder_proc
*proc
, int line
)
666 binder_debug(BINDER_DEBUG_SPINLOCKS
,
667 "%s: line=%d\n", __func__
, line
);
668 spin_unlock(&proc
->outer_lock
);
672 * binder_inner_proc_lock() - Acquire inner lock for given binder_proc
673 * @proc: struct binder_proc to acquire
675 * Acquires proc->inner_lock. Used to protect todo lists
677 #define binder_inner_proc_lock(proc) _binder_inner_proc_lock(proc, __LINE__)
679 _binder_inner_proc_lock(struct binder_proc
*proc
, int line
)
681 binder_debug(BINDER_DEBUG_SPINLOCKS
,
682 "%s: line=%d\n", __func__
, line
);
683 spin_lock(&proc
->inner_lock
);
687 * binder_inner_proc_unlock() - Release inner lock for given binder_proc
688 * @proc: struct binder_proc to acquire
690 * Release lock acquired via binder_inner_proc_lock()
692 #define binder_inner_proc_unlock(proc) _binder_inner_proc_unlock(proc, __LINE__)
694 _binder_inner_proc_unlock(struct binder_proc
*proc
, int line
)
696 binder_debug(BINDER_DEBUG_SPINLOCKS
,
697 "%s: line=%d\n", __func__
, line
);
698 spin_unlock(&proc
->inner_lock
);
702 * binder_node_lock() - Acquire spinlock for given binder_node
703 * @node: struct binder_node to acquire
705 * Acquires node->lock. Used to protect binder_node fields
707 #define binder_node_lock(node) _binder_node_lock(node, __LINE__)
709 _binder_node_lock(struct binder_node
*node
, int line
)
711 binder_debug(BINDER_DEBUG_SPINLOCKS
,
712 "%s: line=%d\n", __func__
, line
);
713 spin_lock(&node
->lock
);
717 * binder_node_unlock() - Release spinlock for given binder_proc
718 * @node: struct binder_node to acquire
720 * Release lock acquired via binder_node_lock()
722 #define binder_node_unlock(node) _binder_node_unlock(node, __LINE__)
724 _binder_node_unlock(struct binder_node
*node
, int line
)
726 binder_debug(BINDER_DEBUG_SPINLOCKS
,
727 "%s: line=%d\n", __func__
, line
);
728 spin_unlock(&node
->lock
);
732 * binder_node_inner_lock() - Acquire node and inner locks
733 * @node: struct binder_node to acquire
735 * Acquires node->lock. If node->proc also acquires
736 * proc->inner_lock. Used to protect binder_node fields
738 #define binder_node_inner_lock(node) _binder_node_inner_lock(node, __LINE__)
740 _binder_node_inner_lock(struct binder_node
*node
, int line
)
742 binder_debug(BINDER_DEBUG_SPINLOCKS
,
743 "%s: line=%d\n", __func__
, line
);
744 spin_lock(&node
->lock
);
746 binder_inner_proc_lock(node
->proc
);
750 * binder_node_unlock() - Release node and inner locks
751 * @node: struct binder_node to acquire
753 * Release lock acquired via binder_node_lock()
755 #define binder_node_inner_unlock(node) _binder_node_inner_unlock(node, __LINE__)
757 _binder_node_inner_unlock(struct binder_node
*node
, int line
)
759 struct binder_proc
*proc
= node
->proc
;
761 binder_debug(BINDER_DEBUG_SPINLOCKS
,
762 "%s: line=%d\n", __func__
, line
);
764 binder_inner_proc_unlock(proc
);
765 spin_unlock(&node
->lock
);
768 static bool binder_worklist_empty_ilocked(struct list_head
*list
)
770 return list_empty(list
);
774 * binder_worklist_empty() - Check if no items on the work list
775 * @proc: binder_proc associated with list
776 * @list: list to check
778 * Return: true if there are no items on list, else false
780 static bool binder_worklist_empty(struct binder_proc
*proc
,
781 struct list_head
*list
)
785 binder_inner_proc_lock(proc
);
786 ret
= binder_worklist_empty_ilocked(list
);
787 binder_inner_proc_unlock(proc
);
792 * binder_enqueue_work_ilocked() - Add an item to the work list
793 * @work: struct binder_work to add to list
794 * @target_list: list to add work to
796 * Adds the work to the specified list. Asserts that work
797 * is not already on a list.
799 * Requires the proc->inner_lock to be held.
802 binder_enqueue_work_ilocked(struct binder_work
*work
,
803 struct list_head
*target_list
)
805 BUG_ON(target_list
== NULL
);
806 BUG_ON(work
->entry
.next
&& !list_empty(&work
->entry
));
807 list_add_tail(&work
->entry
, target_list
);
811 * binder_enqueue_deferred_thread_work_ilocked() - Add deferred thread work
812 * @thread: thread to queue work to
813 * @work: struct binder_work to add to list
815 * Adds the work to the todo list of the thread. Doesn't set the process_todo
816 * flag, which means that (if it wasn't already set) the thread will go to
817 * sleep without handling this work when it calls read.
819 * Requires the proc->inner_lock to be held.
822 binder_enqueue_deferred_thread_work_ilocked(struct binder_thread
*thread
,
823 struct binder_work
*work
)
825 binder_enqueue_work_ilocked(work
, &thread
->todo
);
829 * binder_enqueue_thread_work_ilocked() - Add an item to the thread work list
830 * @thread: thread to queue work to
831 * @work: struct binder_work to add to list
833 * Adds the work to the todo list of the thread, and enables processing
836 * Requires the proc->inner_lock to be held.
839 binder_enqueue_thread_work_ilocked(struct binder_thread
*thread
,
840 struct binder_work
*work
)
842 binder_enqueue_work_ilocked(work
, &thread
->todo
);
843 thread
->process_todo
= true;
847 * binder_enqueue_thread_work() - Add an item to the thread work list
848 * @thread: thread to queue work to
849 * @work: struct binder_work to add to list
851 * Adds the work to the todo list of the thread, and enables processing
855 binder_enqueue_thread_work(struct binder_thread
*thread
,
856 struct binder_work
*work
)
858 binder_inner_proc_lock(thread
->proc
);
859 binder_enqueue_thread_work_ilocked(thread
, work
);
860 binder_inner_proc_unlock(thread
->proc
);
864 binder_dequeue_work_ilocked(struct binder_work
*work
)
866 list_del_init(&work
->entry
);
870 * binder_dequeue_work() - Removes an item from the work list
871 * @proc: binder_proc associated with list
872 * @work: struct binder_work to remove from list
874 * Removes the specified work item from whatever list it is on.
875 * Can safely be called if work is not on any list.
878 binder_dequeue_work(struct binder_proc
*proc
, struct binder_work
*work
)
880 binder_inner_proc_lock(proc
);
881 binder_dequeue_work_ilocked(work
);
882 binder_inner_proc_unlock(proc
);
885 static struct binder_work
*binder_dequeue_work_head_ilocked(
886 struct list_head
*list
)
888 struct binder_work
*w
;
890 w
= list_first_entry_or_null(list
, struct binder_work
, entry
);
892 list_del_init(&w
->entry
);
897 * binder_dequeue_work_head() - Dequeues the item at head of list
898 * @proc: binder_proc associated with list
899 * @list: list to dequeue head
901 * Removes the head of the list if there are items on the list
903 * Return: pointer dequeued binder_work, NULL if list was empty
905 static struct binder_work
*binder_dequeue_work_head(
906 struct binder_proc
*proc
,
907 struct list_head
*list
)
909 struct binder_work
*w
;
911 binder_inner_proc_lock(proc
);
912 w
= binder_dequeue_work_head_ilocked(list
);
913 binder_inner_proc_unlock(proc
);
918 binder_defer_work(struct binder_proc
*proc
, enum binder_deferred_state defer
);
919 static void binder_free_thread(struct binder_thread
*thread
);
920 static void binder_free_proc(struct binder_proc
*proc
);
921 static void binder_inc_node_tmpref_ilocked(struct binder_node
*node
);
923 static int task_get_unused_fd_flags(struct binder_proc
*proc
, int flags
)
925 unsigned long rlim_cur
;
929 mutex_lock(&proc
->files_lock
);
930 if (proc
->files
== NULL
) {
934 if (!lock_task_sighand(proc
->tsk
, &irqs
)) {
938 rlim_cur
= task_rlimit(proc
->tsk
, RLIMIT_NOFILE
);
939 unlock_task_sighand(proc
->tsk
, &irqs
);
941 ret
= __alloc_fd(proc
->files
, 0, rlim_cur
, flags
);
943 mutex_unlock(&proc
->files_lock
);
948 * copied from fd_install
950 static void task_fd_install(
951 struct binder_proc
*proc
, unsigned int fd
, struct file
*file
)
953 mutex_lock(&proc
->files_lock
);
955 __fd_install(proc
->files
, fd
, file
);
956 mutex_unlock(&proc
->files_lock
);
960 * copied from sys_close
962 static long task_close_fd(struct binder_proc
*proc
, unsigned int fd
)
966 mutex_lock(&proc
->files_lock
);
967 if (proc
->files
== NULL
) {
971 retval
= __close_fd(proc
->files
, fd
);
972 /* can't restart close syscall because file table entry was cleared */
973 if (unlikely(retval
== -ERESTARTSYS
||
974 retval
== -ERESTARTNOINTR
||
975 retval
== -ERESTARTNOHAND
||
976 retval
== -ERESTART_RESTARTBLOCK
))
979 mutex_unlock(&proc
->files_lock
);
983 static bool binder_has_work_ilocked(struct binder_thread
*thread
,
986 return thread
->process_todo
||
987 thread
->looper_need_return
||
989 !binder_worklist_empty_ilocked(&thread
->proc
->todo
));
992 static bool binder_has_work(struct binder_thread
*thread
, bool do_proc_work
)
996 binder_inner_proc_lock(thread
->proc
);
997 has_work
= binder_has_work_ilocked(thread
, do_proc_work
);
998 binder_inner_proc_unlock(thread
->proc
);
1003 static bool binder_available_for_proc_work_ilocked(struct binder_thread
*thread
)
1005 return !thread
->transaction_stack
&&
1006 binder_worklist_empty_ilocked(&thread
->todo
) &&
1007 (thread
->looper
& (BINDER_LOOPER_STATE_ENTERED
|
1008 BINDER_LOOPER_STATE_REGISTERED
));
1011 static void binder_wakeup_poll_threads_ilocked(struct binder_proc
*proc
,
1015 struct binder_thread
*thread
;
1017 for (n
= rb_first(&proc
->threads
); n
!= NULL
; n
= rb_next(n
)) {
1018 thread
= rb_entry(n
, struct binder_thread
, rb_node
);
1019 if (thread
->looper
& BINDER_LOOPER_STATE_POLL
&&
1020 binder_available_for_proc_work_ilocked(thread
)) {
1022 wake_up_interruptible_sync(&thread
->wait
);
1024 wake_up_interruptible(&thread
->wait
);
1030 * binder_select_thread_ilocked() - selects a thread for doing proc work.
1031 * @proc: process to select a thread from
1033 * Note that calling this function moves the thread off the waiting_threads
1034 * list, so it can only be woken up by the caller of this function, or a
1035 * signal. Therefore, callers *should* always wake up the thread this function
1038 * Return: If there's a thread currently waiting for process work,
1039 * returns that thread. Otherwise returns NULL.
1041 static struct binder_thread
*
1042 binder_select_thread_ilocked(struct binder_proc
*proc
)
1044 struct binder_thread
*thread
;
1046 assert_spin_locked(&proc
->inner_lock
);
1047 thread
= list_first_entry_or_null(&proc
->waiting_threads
,
1048 struct binder_thread
,
1049 waiting_thread_node
);
1052 list_del_init(&thread
->waiting_thread_node
);
1058 * binder_wakeup_thread_ilocked() - wakes up a thread for doing proc work.
1059 * @proc: process to wake up a thread in
1060 * @thread: specific thread to wake-up (may be NULL)
1061 * @sync: whether to do a synchronous wake-up
1063 * This function wakes up a thread in the @proc process.
1064 * The caller may provide a specific thread to wake-up in
1065 * the @thread parameter. If @thread is NULL, this function
1066 * will wake up threads that have called poll().
1068 * Note that for this function to work as expected, callers
1069 * should first call binder_select_thread() to find a thread
1070 * to handle the work (if they don't have a thread already),
1071 * and pass the result into the @thread parameter.
1073 static void binder_wakeup_thread_ilocked(struct binder_proc
*proc
,
1074 struct binder_thread
*thread
,
1077 assert_spin_locked(&proc
->inner_lock
);
1081 wake_up_interruptible_sync(&thread
->wait
);
1083 wake_up_interruptible(&thread
->wait
);
1087 /* Didn't find a thread waiting for proc work; this can happen
1089 * 1. All threads are busy handling transactions
1090 * In that case, one of those threads should call back into
1091 * the kernel driver soon and pick up this work.
1092 * 2. Threads are using the (e)poll interface, in which case
1093 * they may be blocked on the waitqueue without having been
1094 * added to waiting_threads. For this case, we just iterate
1095 * over all threads not handling transaction work, and
1096 * wake them all up. We wake all because we don't know whether
1097 * a thread that called into (e)poll is handling non-binder
1100 binder_wakeup_poll_threads_ilocked(proc
, sync
);
1103 static void binder_wakeup_proc_ilocked(struct binder_proc
*proc
)
1105 struct binder_thread
*thread
= binder_select_thread_ilocked(proc
);
1107 binder_wakeup_thread_ilocked(proc
, thread
, /* sync = */false);
1110 static void binder_set_nice(long nice
)
1114 if (can_nice(current
, nice
)) {
1115 set_user_nice(current
, nice
);
1118 min_nice
= rlimit_to_nice(rlimit(RLIMIT_NICE
));
1119 binder_debug(BINDER_DEBUG_PRIORITY_CAP
,
1120 "%d: nice value %ld not allowed use %ld instead\n",
1121 current
->pid
, nice
, min_nice
);
1122 set_user_nice(current
, min_nice
);
1123 if (min_nice
<= MAX_NICE
)
1125 binder_user_error("%d RLIMIT_NICE not set\n", current
->pid
);
1128 static struct binder_node
*binder_get_node_ilocked(struct binder_proc
*proc
,
1129 binder_uintptr_t ptr
)
1131 struct rb_node
*n
= proc
->nodes
.rb_node
;
1132 struct binder_node
*node
;
1134 assert_spin_locked(&proc
->inner_lock
);
1137 node
= rb_entry(n
, struct binder_node
, rb_node
);
1139 if (ptr
< node
->ptr
)
1141 else if (ptr
> node
->ptr
)
1145 * take an implicit weak reference
1146 * to ensure node stays alive until
1147 * call to binder_put_node()
1149 binder_inc_node_tmpref_ilocked(node
);
1156 static struct binder_node
*binder_get_node(struct binder_proc
*proc
,
1157 binder_uintptr_t ptr
)
1159 struct binder_node
*node
;
1161 binder_inner_proc_lock(proc
);
1162 node
= binder_get_node_ilocked(proc
, ptr
);
1163 binder_inner_proc_unlock(proc
);
1167 static struct binder_node
*binder_init_node_ilocked(
1168 struct binder_proc
*proc
,
1169 struct binder_node
*new_node
,
1170 struct flat_binder_object
*fp
)
1172 struct rb_node
**p
= &proc
->nodes
.rb_node
;
1173 struct rb_node
*parent
= NULL
;
1174 struct binder_node
*node
;
1175 binder_uintptr_t ptr
= fp
? fp
->binder
: 0;
1176 binder_uintptr_t cookie
= fp
? fp
->cookie
: 0;
1177 __u32 flags
= fp
? fp
->flags
: 0;
1179 assert_spin_locked(&proc
->inner_lock
);
1184 node
= rb_entry(parent
, struct binder_node
, rb_node
);
1186 if (ptr
< node
->ptr
)
1188 else if (ptr
> node
->ptr
)
1189 p
= &(*p
)->rb_right
;
1192 * A matching node is already in
1193 * the rb tree. Abandon the init
1196 binder_inc_node_tmpref_ilocked(node
);
1201 binder_stats_created(BINDER_STAT_NODE
);
1203 rb_link_node(&node
->rb_node
, parent
, p
);
1204 rb_insert_color(&node
->rb_node
, &proc
->nodes
);
1205 node
->debug_id
= atomic_inc_return(&binder_last_id
);
1208 node
->cookie
= cookie
;
1209 node
->work
.type
= BINDER_WORK_NODE
;
1210 node
->min_priority
= flags
& FLAT_BINDER_FLAG_PRIORITY_MASK
;
1211 node
->accept_fds
= !!(flags
& FLAT_BINDER_FLAG_ACCEPTS_FDS
);
1212 spin_lock_init(&node
->lock
);
1213 INIT_LIST_HEAD(&node
->work
.entry
);
1214 INIT_LIST_HEAD(&node
->async_todo
);
1215 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
1216 "%d:%d node %d u%016llx c%016llx created\n",
1217 proc
->pid
, current
->pid
, node
->debug_id
,
1218 (u64
)node
->ptr
, (u64
)node
->cookie
);
1223 static struct binder_node
*binder_new_node(struct binder_proc
*proc
,
1224 struct flat_binder_object
*fp
)
1226 struct binder_node
*node
;
1227 struct binder_node
*new_node
= kzalloc(sizeof(*node
), GFP_KERNEL
);
1231 binder_inner_proc_lock(proc
);
1232 node
= binder_init_node_ilocked(proc
, new_node
, fp
);
1233 binder_inner_proc_unlock(proc
);
1234 if (node
!= new_node
)
1236 * The node was already added by another thread
1243 static void binder_free_node(struct binder_node
*node
)
1246 binder_stats_deleted(BINDER_STAT_NODE
);
1249 static int binder_inc_node_nilocked(struct binder_node
*node
, int strong
,
1251 struct list_head
*target_list
)
1253 struct binder_proc
*proc
= node
->proc
;
1255 assert_spin_locked(&node
->lock
);
1257 assert_spin_locked(&proc
->inner_lock
);
1260 if (target_list
== NULL
&&
1261 node
->internal_strong_refs
== 0 &&
1263 node
== node
->proc
->context
->binder_context_mgr_node
&&
1264 node
->has_strong_ref
)) {
1265 pr_err("invalid inc strong node for %d\n",
1269 node
->internal_strong_refs
++;
1271 node
->local_strong_refs
++;
1272 if (!node
->has_strong_ref
&& target_list
) {
1273 binder_dequeue_work_ilocked(&node
->work
);
1275 * Note: this function is the only place where we queue
1276 * directly to a thread->todo without using the
1277 * corresponding binder_enqueue_thread_work() helper
1278 * functions; in this case it's ok to not set the
1279 * process_todo flag, since we know this node work will
1280 * always be followed by other work that starts queue
1281 * processing: in case of synchronous transactions, a
1282 * BR_REPLY or BR_ERROR; in case of oneway
1283 * transactions, a BR_TRANSACTION_COMPLETE.
1285 binder_enqueue_work_ilocked(&node
->work
, target_list
);
1289 node
->local_weak_refs
++;
1290 if (!node
->has_weak_ref
&& list_empty(&node
->work
.entry
)) {
1291 if (target_list
== NULL
) {
1292 pr_err("invalid inc weak node for %d\n",
1299 binder_enqueue_work_ilocked(&node
->work
, target_list
);
1305 static int binder_inc_node(struct binder_node
*node
, int strong
, int internal
,
1306 struct list_head
*target_list
)
1310 binder_node_inner_lock(node
);
1311 ret
= binder_inc_node_nilocked(node
, strong
, internal
, target_list
);
1312 binder_node_inner_unlock(node
);
1317 static bool binder_dec_node_nilocked(struct binder_node
*node
,
1318 int strong
, int internal
)
1320 struct binder_proc
*proc
= node
->proc
;
1322 assert_spin_locked(&node
->lock
);
1324 assert_spin_locked(&proc
->inner_lock
);
1327 node
->internal_strong_refs
--;
1329 node
->local_strong_refs
--;
1330 if (node
->local_strong_refs
|| node
->internal_strong_refs
)
1334 node
->local_weak_refs
--;
1335 if (node
->local_weak_refs
|| node
->tmp_refs
||
1336 !hlist_empty(&node
->refs
))
1340 if (proc
&& (node
->has_strong_ref
|| node
->has_weak_ref
)) {
1341 if (list_empty(&node
->work
.entry
)) {
1342 binder_enqueue_work_ilocked(&node
->work
, &proc
->todo
);
1343 binder_wakeup_proc_ilocked(proc
);
1346 if (hlist_empty(&node
->refs
) && !node
->local_strong_refs
&&
1347 !node
->local_weak_refs
&& !node
->tmp_refs
) {
1349 binder_dequeue_work_ilocked(&node
->work
);
1350 rb_erase(&node
->rb_node
, &proc
->nodes
);
1351 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
1352 "refless node %d deleted\n",
1355 BUG_ON(!list_empty(&node
->work
.entry
));
1356 spin_lock(&binder_dead_nodes_lock
);
1358 * tmp_refs could have changed so
1361 if (node
->tmp_refs
) {
1362 spin_unlock(&binder_dead_nodes_lock
);
1365 hlist_del(&node
->dead_node
);
1366 spin_unlock(&binder_dead_nodes_lock
);
1367 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
1368 "dead node %d deleted\n",
1377 static void binder_dec_node(struct binder_node
*node
, int strong
, int internal
)
1381 binder_node_inner_lock(node
);
1382 free_node
= binder_dec_node_nilocked(node
, strong
, internal
);
1383 binder_node_inner_unlock(node
);
1385 binder_free_node(node
);
1388 static void binder_inc_node_tmpref_ilocked(struct binder_node
*node
)
1391 * No call to binder_inc_node() is needed since we
1392 * don't need to inform userspace of any changes to
1399 * binder_inc_node_tmpref() - take a temporary reference on node
1400 * @node: node to reference
1402 * Take reference on node to prevent the node from being freed
1403 * while referenced only by a local variable. The inner lock is
1404 * needed to serialize with the node work on the queue (which
1405 * isn't needed after the node is dead). If the node is dead
1406 * (node->proc is NULL), use binder_dead_nodes_lock to protect
1407 * node->tmp_refs against dead-node-only cases where the node
1408 * lock cannot be acquired (eg traversing the dead node list to
1411 static void binder_inc_node_tmpref(struct binder_node
*node
)
1413 binder_node_lock(node
);
1415 binder_inner_proc_lock(node
->proc
);
1417 spin_lock(&binder_dead_nodes_lock
);
1418 binder_inc_node_tmpref_ilocked(node
);
1420 binder_inner_proc_unlock(node
->proc
);
1422 spin_unlock(&binder_dead_nodes_lock
);
1423 binder_node_unlock(node
);
1427 * binder_dec_node_tmpref() - remove a temporary reference on node
1428 * @node: node to reference
1430 * Release temporary reference on node taken via binder_inc_node_tmpref()
1432 static void binder_dec_node_tmpref(struct binder_node
*node
)
1436 binder_node_inner_lock(node
);
1438 spin_lock(&binder_dead_nodes_lock
);
1440 BUG_ON(node
->tmp_refs
< 0);
1442 spin_unlock(&binder_dead_nodes_lock
);
1444 * Call binder_dec_node() to check if all refcounts are 0
1445 * and cleanup is needed. Calling with strong=0 and internal=1
1446 * causes no actual reference to be released in binder_dec_node().
1447 * If that changes, a change is needed here too.
1449 free_node
= binder_dec_node_nilocked(node
, 0, 1);
1450 binder_node_inner_unlock(node
);
1452 binder_free_node(node
);
1455 static void binder_put_node(struct binder_node
*node
)
1457 binder_dec_node_tmpref(node
);
1460 static struct binder_ref
*binder_get_ref_olocked(struct binder_proc
*proc
,
1461 u32 desc
, bool need_strong_ref
)
1463 struct rb_node
*n
= proc
->refs_by_desc
.rb_node
;
1464 struct binder_ref
*ref
;
1467 ref
= rb_entry(n
, struct binder_ref
, rb_node_desc
);
1469 if (desc
< ref
->data
.desc
) {
1471 } else if (desc
> ref
->data
.desc
) {
1473 } else if (need_strong_ref
&& !ref
->data
.strong
) {
1474 binder_user_error("tried to use weak ref as strong ref\n");
1484 * binder_get_ref_for_node_olocked() - get the ref associated with given node
1485 * @proc: binder_proc that owns the ref
1486 * @node: binder_node of target
1487 * @new_ref: newly allocated binder_ref to be initialized or %NULL
1489 * Look up the ref for the given node and return it if it exists
1491 * If it doesn't exist and the caller provides a newly allocated
1492 * ref, initialize the fields of the newly allocated ref and insert
1493 * into the given proc rb_trees and node refs list.
1495 * Return: the ref for node. It is possible that another thread
1496 * allocated/initialized the ref first in which case the
1497 * returned ref would be different than the passed-in
1498 * new_ref. new_ref must be kfree'd by the caller in
1501 static struct binder_ref
*binder_get_ref_for_node_olocked(
1502 struct binder_proc
*proc
,
1503 struct binder_node
*node
,
1504 struct binder_ref
*new_ref
)
1506 struct binder_context
*context
= proc
->context
;
1507 struct rb_node
**p
= &proc
->refs_by_node
.rb_node
;
1508 struct rb_node
*parent
= NULL
;
1509 struct binder_ref
*ref
;
1514 ref
= rb_entry(parent
, struct binder_ref
, rb_node_node
);
1516 if (node
< ref
->node
)
1518 else if (node
> ref
->node
)
1519 p
= &(*p
)->rb_right
;
1526 binder_stats_created(BINDER_STAT_REF
);
1527 new_ref
->data
.debug_id
= atomic_inc_return(&binder_last_id
);
1528 new_ref
->proc
= proc
;
1529 new_ref
->node
= node
;
1530 rb_link_node(&new_ref
->rb_node_node
, parent
, p
);
1531 rb_insert_color(&new_ref
->rb_node_node
, &proc
->refs_by_node
);
1533 new_ref
->data
.desc
= (node
== context
->binder_context_mgr_node
) ? 0 : 1;
1534 for (n
= rb_first(&proc
->refs_by_desc
); n
!= NULL
; n
= rb_next(n
)) {
1535 ref
= rb_entry(n
, struct binder_ref
, rb_node_desc
);
1536 if (ref
->data
.desc
> new_ref
->data
.desc
)
1538 new_ref
->data
.desc
= ref
->data
.desc
+ 1;
1541 p
= &proc
->refs_by_desc
.rb_node
;
1544 ref
= rb_entry(parent
, struct binder_ref
, rb_node_desc
);
1546 if (new_ref
->data
.desc
< ref
->data
.desc
)
1548 else if (new_ref
->data
.desc
> ref
->data
.desc
)
1549 p
= &(*p
)->rb_right
;
1553 rb_link_node(&new_ref
->rb_node_desc
, parent
, p
);
1554 rb_insert_color(&new_ref
->rb_node_desc
, &proc
->refs_by_desc
);
1556 binder_node_lock(node
);
1557 hlist_add_head(&new_ref
->node_entry
, &node
->refs
);
1559 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
1560 "%d new ref %d desc %d for node %d\n",
1561 proc
->pid
, new_ref
->data
.debug_id
, new_ref
->data
.desc
,
1563 binder_node_unlock(node
);
1567 static void binder_cleanup_ref_olocked(struct binder_ref
*ref
)
1569 bool delete_node
= false;
1571 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
1572 "%d delete ref %d desc %d for node %d\n",
1573 ref
->proc
->pid
, ref
->data
.debug_id
, ref
->data
.desc
,
1574 ref
->node
->debug_id
);
1576 rb_erase(&ref
->rb_node_desc
, &ref
->proc
->refs_by_desc
);
1577 rb_erase(&ref
->rb_node_node
, &ref
->proc
->refs_by_node
);
1579 binder_node_inner_lock(ref
->node
);
1580 if (ref
->data
.strong
)
1581 binder_dec_node_nilocked(ref
->node
, 1, 1);
1583 hlist_del(&ref
->node_entry
);
1584 delete_node
= binder_dec_node_nilocked(ref
->node
, 0, 1);
1585 binder_node_inner_unlock(ref
->node
);
1587 * Clear ref->node unless we want the caller to free the node
1591 * The caller uses ref->node to determine
1592 * whether the node needs to be freed. Clear
1593 * it since the node is still alive.
1599 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
1600 "%d delete ref %d desc %d has death notification\n",
1601 ref
->proc
->pid
, ref
->data
.debug_id
,
1603 binder_dequeue_work(ref
->proc
, &ref
->death
->work
);
1604 binder_stats_deleted(BINDER_STAT_DEATH
);
1606 binder_stats_deleted(BINDER_STAT_REF
);
1610 * binder_inc_ref_olocked() - increment the ref for given handle
1611 * @ref: ref to be incremented
1612 * @strong: if true, strong increment, else weak
1613 * @target_list: list to queue node work on
1615 * Increment the ref. @ref->proc->outer_lock must be held on entry
1617 * Return: 0, if successful, else errno
1619 static int binder_inc_ref_olocked(struct binder_ref
*ref
, int strong
,
1620 struct list_head
*target_list
)
1625 if (ref
->data
.strong
== 0) {
1626 ret
= binder_inc_node(ref
->node
, 1, 1, target_list
);
1632 if (ref
->data
.weak
== 0) {
1633 ret
= binder_inc_node(ref
->node
, 0, 1, target_list
);
1643 * binder_dec_ref() - dec the ref for given handle
1644 * @ref: ref to be decremented
1645 * @strong: if true, strong decrement, else weak
1647 * Decrement the ref.
1649 * Return: true if ref is cleaned up and ready to be freed
1651 static bool binder_dec_ref_olocked(struct binder_ref
*ref
, int strong
)
1654 if (ref
->data
.strong
== 0) {
1655 binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n",
1656 ref
->proc
->pid
, ref
->data
.debug_id
,
1657 ref
->data
.desc
, ref
->data
.strong
,
1662 if (ref
->data
.strong
== 0)
1663 binder_dec_node(ref
->node
, strong
, 1);
1665 if (ref
->data
.weak
== 0) {
1666 binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n",
1667 ref
->proc
->pid
, ref
->data
.debug_id
,
1668 ref
->data
.desc
, ref
->data
.strong
,
1674 if (ref
->data
.strong
== 0 && ref
->data
.weak
== 0) {
1675 binder_cleanup_ref_olocked(ref
);
1682 * binder_get_node_from_ref() - get the node from the given proc/desc
1683 * @proc: proc containing the ref
1684 * @desc: the handle associated with the ref
1685 * @need_strong_ref: if true, only return node if ref is strong
1686 * @rdata: the id/refcount data for the ref
1688 * Given a proc and ref handle, return the associated binder_node
1690 * Return: a binder_node or NULL if not found or not strong when strong required
1692 static struct binder_node
*binder_get_node_from_ref(
1693 struct binder_proc
*proc
,
1694 u32 desc
, bool need_strong_ref
,
1695 struct binder_ref_data
*rdata
)
1697 struct binder_node
*node
;
1698 struct binder_ref
*ref
;
1700 binder_proc_lock(proc
);
1701 ref
= binder_get_ref_olocked(proc
, desc
, need_strong_ref
);
1706 * Take an implicit reference on the node to ensure
1707 * it stays alive until the call to binder_put_node()
1709 binder_inc_node_tmpref(node
);
1712 binder_proc_unlock(proc
);
1717 binder_proc_unlock(proc
);
1722 * binder_free_ref() - free the binder_ref
1725 * Free the binder_ref. Free the binder_node indicated by ref->node
1726 * (if non-NULL) and the binder_ref_death indicated by ref->death.
1728 static void binder_free_ref(struct binder_ref
*ref
)
1731 binder_free_node(ref
->node
);
1737 * binder_update_ref_for_handle() - inc/dec the ref for given handle
1738 * @proc: proc containing the ref
1739 * @desc: the handle associated with the ref
1740 * @increment: true=inc reference, false=dec reference
1741 * @strong: true=strong reference, false=weak reference
1742 * @rdata: the id/refcount data for the ref
1744 * Given a proc and ref handle, increment or decrement the ref
1745 * according to "increment" arg.
1747 * Return: 0 if successful, else errno
1749 static int binder_update_ref_for_handle(struct binder_proc
*proc
,
1750 uint32_t desc
, bool increment
, bool strong
,
1751 struct binder_ref_data
*rdata
)
1754 struct binder_ref
*ref
;
1755 bool delete_ref
= false;
1757 binder_proc_lock(proc
);
1758 ref
= binder_get_ref_olocked(proc
, desc
, strong
);
1764 ret
= binder_inc_ref_olocked(ref
, strong
, NULL
);
1766 delete_ref
= binder_dec_ref_olocked(ref
, strong
);
1770 binder_proc_unlock(proc
);
1773 binder_free_ref(ref
);
1777 binder_proc_unlock(proc
);
1782 * binder_dec_ref_for_handle() - dec the ref for given handle
1783 * @proc: proc containing the ref
1784 * @desc: the handle associated with the ref
1785 * @strong: true=strong reference, false=weak reference
1786 * @rdata: the id/refcount data for the ref
1788 * Just calls binder_update_ref_for_handle() to decrement the ref.
1790 * Return: 0 if successful, else errno
1792 static int binder_dec_ref_for_handle(struct binder_proc
*proc
,
1793 uint32_t desc
, bool strong
, struct binder_ref_data
*rdata
)
1795 return binder_update_ref_for_handle(proc
, desc
, false, strong
, rdata
);
1800 * binder_inc_ref_for_node() - increment the ref for given proc/node
1801 * @proc: proc containing the ref
1802 * @node: target node
1803 * @strong: true=strong reference, false=weak reference
1804 * @target_list: worklist to use if node is incremented
1805 * @rdata: the id/refcount data for the ref
1807 * Given a proc and node, increment the ref. Create the ref if it
1808 * doesn't already exist
1810 * Return: 0 if successful, else errno
1812 static int binder_inc_ref_for_node(struct binder_proc
*proc
,
1813 struct binder_node
*node
,
1815 struct list_head
*target_list
,
1816 struct binder_ref_data
*rdata
)
1818 struct binder_ref
*ref
;
1819 struct binder_ref
*new_ref
= NULL
;
1822 binder_proc_lock(proc
);
1823 ref
= binder_get_ref_for_node_olocked(proc
, node
, NULL
);
1825 binder_proc_unlock(proc
);
1826 new_ref
= kzalloc(sizeof(*ref
), GFP_KERNEL
);
1829 binder_proc_lock(proc
);
1830 ref
= binder_get_ref_for_node_olocked(proc
, node
, new_ref
);
1832 ret
= binder_inc_ref_olocked(ref
, strong
, target_list
);
1834 binder_proc_unlock(proc
);
1835 if (new_ref
&& ref
!= new_ref
)
1837 * Another thread created the ref first so
1838 * free the one we allocated
1844 static void binder_pop_transaction_ilocked(struct binder_thread
*target_thread
,
1845 struct binder_transaction
*t
)
1847 BUG_ON(!target_thread
);
1848 assert_spin_locked(&target_thread
->proc
->inner_lock
);
1849 BUG_ON(target_thread
->transaction_stack
!= t
);
1850 BUG_ON(target_thread
->transaction_stack
->from
!= target_thread
);
1851 target_thread
->transaction_stack
=
1852 target_thread
->transaction_stack
->from_parent
;
1857 * binder_thread_dec_tmpref() - decrement thread->tmp_ref
1858 * @thread: thread to decrement
1860 * A thread needs to be kept alive while being used to create or
1861 * handle a transaction. binder_get_txn_from() is used to safely
1862 * extract t->from from a binder_transaction and keep the thread
1863 * indicated by t->from from being freed. When done with that
1864 * binder_thread, this function is called to decrement the
1865 * tmp_ref and free if appropriate (thread has been released
1866 * and no transaction being processed by the driver)
1868 static void binder_thread_dec_tmpref(struct binder_thread
*thread
)
1871 * atomic is used to protect the counter value while
1872 * it cannot reach zero or thread->is_dead is false
1874 binder_inner_proc_lock(thread
->proc
);
1875 atomic_dec(&thread
->tmp_ref
);
1876 if (thread
->is_dead
&& !atomic_read(&thread
->tmp_ref
)) {
1877 binder_inner_proc_unlock(thread
->proc
);
1878 binder_free_thread(thread
);
1881 binder_inner_proc_unlock(thread
->proc
);
1885 * binder_proc_dec_tmpref() - decrement proc->tmp_ref
1886 * @proc: proc to decrement
1888 * A binder_proc needs to be kept alive while being used to create or
1889 * handle a transaction. proc->tmp_ref is incremented when
1890 * creating a new transaction or the binder_proc is currently in-use
1891 * by threads that are being released. When done with the binder_proc,
1892 * this function is called to decrement the counter and free the
1893 * proc if appropriate (proc has been released, all threads have
1894 * been released and not currenly in-use to process a transaction).
1896 static void binder_proc_dec_tmpref(struct binder_proc
*proc
)
1898 binder_inner_proc_lock(proc
);
1900 if (proc
->is_dead
&& RB_EMPTY_ROOT(&proc
->threads
) &&
1902 binder_inner_proc_unlock(proc
);
1903 binder_free_proc(proc
);
1906 binder_inner_proc_unlock(proc
);
1910 * binder_get_txn_from() - safely extract the "from" thread in transaction
1911 * @t: binder transaction for t->from
1913 * Atomically return the "from" thread and increment the tmp_ref
1914 * count for the thread to ensure it stays alive until
1915 * binder_thread_dec_tmpref() is called.
1917 * Return: the value of t->from
1919 static struct binder_thread
*binder_get_txn_from(
1920 struct binder_transaction
*t
)
1922 struct binder_thread
*from
;
1924 spin_lock(&t
->lock
);
1927 atomic_inc(&from
->tmp_ref
);
1928 spin_unlock(&t
->lock
);
1933 * binder_get_txn_from_and_acq_inner() - get t->from and acquire inner lock
1934 * @t: binder transaction for t->from
1936 * Same as binder_get_txn_from() except it also acquires the proc->inner_lock
1937 * to guarantee that the thread cannot be released while operating on it.
1938 * The caller must call binder_inner_proc_unlock() to release the inner lock
1939 * as well as call binder_dec_thread_txn() to release the reference.
1941 * Return: the value of t->from
1943 static struct binder_thread
*binder_get_txn_from_and_acq_inner(
1944 struct binder_transaction
*t
)
1946 struct binder_thread
*from
;
1948 from
= binder_get_txn_from(t
);
1951 binder_inner_proc_lock(from
->proc
);
1953 BUG_ON(from
!= t
->from
);
1956 binder_inner_proc_unlock(from
->proc
);
1957 binder_thread_dec_tmpref(from
);
1961 static void binder_free_transaction(struct binder_transaction
*t
)
1964 t
->buffer
->transaction
= NULL
;
1966 binder_stats_deleted(BINDER_STAT_TRANSACTION
);
1969 static void binder_send_failed_reply(struct binder_transaction
*t
,
1970 uint32_t error_code
)
1972 struct binder_thread
*target_thread
;
1973 struct binder_transaction
*next
;
1975 BUG_ON(t
->flags
& TF_ONE_WAY
);
1977 target_thread
= binder_get_txn_from_and_acq_inner(t
);
1978 if (target_thread
) {
1979 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION
,
1980 "send failed reply for transaction %d to %d:%d\n",
1982 target_thread
->proc
->pid
,
1983 target_thread
->pid
);
1985 binder_pop_transaction_ilocked(target_thread
, t
);
1986 if (target_thread
->reply_error
.cmd
== BR_OK
) {
1987 target_thread
->reply_error
.cmd
= error_code
;
1988 binder_enqueue_thread_work_ilocked(
1990 &target_thread
->reply_error
.work
);
1991 wake_up_interruptible(&target_thread
->wait
);
1994 * Cannot get here for normal operation, but
1995 * we can if multiple synchronous transactions
1996 * are sent without blocking for responses.
1997 * Just ignore the 2nd error in this case.
1999 pr_warn("Unexpected reply error: %u\n",
2000 target_thread
->reply_error
.cmd
);
2002 binder_inner_proc_unlock(target_thread
->proc
);
2003 binder_thread_dec_tmpref(target_thread
);
2004 binder_free_transaction(t
);
2007 next
= t
->from_parent
;
2009 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION
,
2010 "send failed reply for transaction %d, target dead\n",
2013 binder_free_transaction(t
);
2015 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
2016 "reply failed, no target thread at root\n");
2020 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
2021 "reply failed, no target thread -- retry %d\n",
2027 * binder_cleanup_transaction() - cleans up undelivered transaction
2028 * @t: transaction that needs to be cleaned up
2029 * @reason: reason the transaction wasn't delivered
2030 * @error_code: error to return to caller (if synchronous call)
2032 static void binder_cleanup_transaction(struct binder_transaction
*t
,
2034 uint32_t error_code
)
2036 if (t
->buffer
->target_node
&& !(t
->flags
& TF_ONE_WAY
)) {
2037 binder_send_failed_reply(t
, error_code
);
2039 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
2040 "undelivered transaction %d, %s\n",
2041 t
->debug_id
, reason
);
2042 binder_free_transaction(t
);
2047 * binder_validate_object() - checks for a valid metadata object in a buffer.
2048 * @buffer: binder_buffer that we're parsing.
2049 * @offset: offset in the buffer at which to validate an object.
2051 * Return: If there's a valid metadata object at @offset in @buffer, the
2052 * size of that object. Otherwise, it returns zero.
2054 static size_t binder_validate_object(struct binder_buffer
*buffer
, u64 offset
)
2056 /* Check if we can read a header first */
2057 struct binder_object_header
*hdr
;
2058 size_t object_size
= 0;
2060 if (buffer
->data_size
< sizeof(*hdr
) ||
2061 offset
> buffer
->data_size
- sizeof(*hdr
) ||
2062 !IS_ALIGNED(offset
, sizeof(u32
)))
2065 /* Ok, now see if we can read a complete object. */
2066 hdr
= (struct binder_object_header
*)(buffer
->data
+ offset
);
2067 switch (hdr
->type
) {
2068 case BINDER_TYPE_BINDER
:
2069 case BINDER_TYPE_WEAK_BINDER
:
2070 case BINDER_TYPE_HANDLE
:
2071 case BINDER_TYPE_WEAK_HANDLE
:
2072 object_size
= sizeof(struct flat_binder_object
);
2074 case BINDER_TYPE_FD
:
2075 object_size
= sizeof(struct binder_fd_object
);
2077 case BINDER_TYPE_PTR
:
2078 object_size
= sizeof(struct binder_buffer_object
);
2080 case BINDER_TYPE_FDA
:
2081 object_size
= sizeof(struct binder_fd_array_object
);
2086 if (offset
<= buffer
->data_size
- object_size
&&
2087 buffer
->data_size
>= object_size
)
2094 * binder_validate_ptr() - validates binder_buffer_object in a binder_buffer.
2095 * @b: binder_buffer containing the object
2096 * @index: index in offset array at which the binder_buffer_object is
2098 * @start: points to the start of the offset array
2099 * @num_valid: the number of valid offsets in the offset array
2101 * Return: If @index is within the valid range of the offset array
2102 * described by @start and @num_valid, and if there's a valid
2103 * binder_buffer_object at the offset found in index @index
2104 * of the offset array, that object is returned. Otherwise,
2105 * %NULL is returned.
2106 * Note that the offset found in index @index itself is not
2107 * verified; this function assumes that @num_valid elements
2108 * from @start were previously verified to have valid offsets.
2110 static struct binder_buffer_object
*binder_validate_ptr(struct binder_buffer
*b
,
2111 binder_size_t index
,
2112 binder_size_t
*start
,
2113 binder_size_t num_valid
)
2115 struct binder_buffer_object
*buffer_obj
;
2116 binder_size_t
*offp
;
2118 if (index
>= num_valid
)
2121 offp
= start
+ index
;
2122 buffer_obj
= (struct binder_buffer_object
*)(b
->data
+ *offp
);
2123 if (buffer_obj
->hdr
.type
!= BINDER_TYPE_PTR
)
2130 * binder_validate_fixup() - validates pointer/fd fixups happen in order.
2131 * @b: transaction buffer
2132 * @objects_start start of objects buffer
2133 * @buffer: binder_buffer_object in which to fix up
2134 * @offset: start offset in @buffer to fix up
2135 * @last_obj: last binder_buffer_object that we fixed up in
2136 * @last_min_offset: minimum fixup offset in @last_obj
2138 * Return: %true if a fixup in buffer @buffer at offset @offset is
2141 * For safety reasons, we only allow fixups inside a buffer to happen
2142 * at increasing offsets; additionally, we only allow fixup on the last
2143 * buffer object that was verified, or one of its parents.
2145 * Example of what is allowed:
2148 * B (parent = A, offset = 0)
2149 * C (parent = A, offset = 16)
2150 * D (parent = C, offset = 0)
2151 * E (parent = A, offset = 32) // min_offset is 16 (C.parent_offset)
2153 * Examples of what is not allowed:
2155 * Decreasing offsets within the same parent:
2157 * C (parent = A, offset = 16)
2158 * B (parent = A, offset = 0) // decreasing offset within A
2160 * Referring to a parent that wasn't the last object or any of its parents:
2162 * B (parent = A, offset = 0)
2163 * C (parent = A, offset = 0)
2164 * C (parent = A, offset = 16)
2165 * D (parent = B, offset = 0) // B is not A or any of A's parents
2167 static bool binder_validate_fixup(struct binder_buffer
*b
,
2168 binder_size_t
*objects_start
,
2169 struct binder_buffer_object
*buffer
,
2170 binder_size_t fixup_offset
,
2171 struct binder_buffer_object
*last_obj
,
2172 binder_size_t last_min_offset
)
2175 /* Nothing to fix up in */
2179 while (last_obj
!= buffer
) {
2181 * Safe to retrieve the parent of last_obj, since it
2182 * was already previously verified by the driver.
2184 if ((last_obj
->flags
& BINDER_BUFFER_FLAG_HAS_PARENT
) == 0)
2186 last_min_offset
= last_obj
->parent_offset
+ sizeof(uintptr_t);
2187 last_obj
= (struct binder_buffer_object
*)
2188 (b
->data
+ *(objects_start
+ last_obj
->parent
));
2190 return (fixup_offset
>= last_min_offset
);
2193 static void binder_transaction_buffer_release(struct binder_proc
*proc
,
2194 struct binder_buffer
*buffer
,
2195 binder_size_t
*failed_at
)
2197 binder_size_t
*offp
, *off_start
, *off_end
;
2198 int debug_id
= buffer
->debug_id
;
2200 binder_debug(BINDER_DEBUG_TRANSACTION
,
2201 "%d buffer release %d, size %zd-%zd, failed at %pK\n",
2202 proc
->pid
, buffer
->debug_id
,
2203 buffer
->data_size
, buffer
->offsets_size
, failed_at
);
2205 if (buffer
->target_node
)
2206 binder_dec_node(buffer
->target_node
, 1, 0);
2208 off_start
= (binder_size_t
*)(buffer
->data
+
2209 ALIGN(buffer
->data_size
, sizeof(void *)));
2211 off_end
= failed_at
;
2213 off_end
= (void *)off_start
+ buffer
->offsets_size
;
2214 for (offp
= off_start
; offp
< off_end
; offp
++) {
2215 struct binder_object_header
*hdr
;
2216 size_t object_size
= binder_validate_object(buffer
, *offp
);
2218 if (object_size
== 0) {
2219 pr_err("transaction release %d bad object at offset %lld, size %zd\n",
2220 debug_id
, (u64
)*offp
, buffer
->data_size
);
2223 hdr
= (struct binder_object_header
*)(buffer
->data
+ *offp
);
2224 switch (hdr
->type
) {
2225 case BINDER_TYPE_BINDER
:
2226 case BINDER_TYPE_WEAK_BINDER
: {
2227 struct flat_binder_object
*fp
;
2228 struct binder_node
*node
;
2230 fp
= to_flat_binder_object(hdr
);
2231 node
= binder_get_node(proc
, fp
->binder
);
2233 pr_err("transaction release %d bad node %016llx\n",
2234 debug_id
, (u64
)fp
->binder
);
2237 binder_debug(BINDER_DEBUG_TRANSACTION
,
2238 " node %d u%016llx\n",
2239 node
->debug_id
, (u64
)node
->ptr
);
2240 binder_dec_node(node
, hdr
->type
== BINDER_TYPE_BINDER
,
2242 binder_put_node(node
);
2244 case BINDER_TYPE_HANDLE
:
2245 case BINDER_TYPE_WEAK_HANDLE
: {
2246 struct flat_binder_object
*fp
;
2247 struct binder_ref_data rdata
;
2250 fp
= to_flat_binder_object(hdr
);
2251 ret
= binder_dec_ref_for_handle(proc
, fp
->handle
,
2252 hdr
->type
== BINDER_TYPE_HANDLE
, &rdata
);
2255 pr_err("transaction release %d bad handle %d, ret = %d\n",
2256 debug_id
, fp
->handle
, ret
);
2259 binder_debug(BINDER_DEBUG_TRANSACTION
,
2260 " ref %d desc %d\n",
2261 rdata
.debug_id
, rdata
.desc
);
2264 case BINDER_TYPE_FD
: {
2265 struct binder_fd_object
*fp
= to_binder_fd_object(hdr
);
2267 binder_debug(BINDER_DEBUG_TRANSACTION
,
2268 " fd %d\n", fp
->fd
);
2270 task_close_fd(proc
, fp
->fd
);
2272 case BINDER_TYPE_PTR
:
2274 * Nothing to do here, this will get cleaned up when the
2275 * transaction buffer gets freed
2278 case BINDER_TYPE_FDA
: {
2279 struct binder_fd_array_object
*fda
;
2280 struct binder_buffer_object
*parent
;
2281 uintptr_t parent_buffer
;
2284 binder_size_t fd_buf_size
;
2286 fda
= to_binder_fd_array_object(hdr
);
2287 parent
= binder_validate_ptr(buffer
, fda
->parent
,
2291 pr_err("transaction release %d bad parent offset\n",
2296 * Since the parent was already fixed up, convert it
2297 * back to kernel address space to access it
2299 parent_buffer
= parent
->buffer
-
2300 binder_alloc_get_user_buffer_offset(
2303 fd_buf_size
= sizeof(u32
) * fda
->num_fds
;
2304 if (fda
->num_fds
>= SIZE_MAX
/ sizeof(u32
)) {
2305 pr_err("transaction release %d invalid number of fds (%lld)\n",
2306 debug_id
, (u64
)fda
->num_fds
);
2309 if (fd_buf_size
> parent
->length
||
2310 fda
->parent_offset
> parent
->length
- fd_buf_size
) {
2311 /* No space for all file descriptors here. */
2312 pr_err("transaction release %d not enough space for %lld fds in buffer\n",
2313 debug_id
, (u64
)fda
->num_fds
);
2316 fd_array
= (u32
*)(parent_buffer
+ (uintptr_t)fda
->parent_offset
);
2317 for (fd_index
= 0; fd_index
< fda
->num_fds
; fd_index
++)
2318 task_close_fd(proc
, fd_array
[fd_index
]);
2321 pr_err("transaction release %d bad object type %x\n",
2322 debug_id
, hdr
->type
);
2328 static int binder_translate_binder(struct flat_binder_object
*fp
,
2329 struct binder_transaction
*t
,
2330 struct binder_thread
*thread
)
2332 struct binder_node
*node
;
2333 struct binder_proc
*proc
= thread
->proc
;
2334 struct binder_proc
*target_proc
= t
->to_proc
;
2335 struct binder_ref_data rdata
;
2338 node
= binder_get_node(proc
, fp
->binder
);
2340 node
= binder_new_node(proc
, fp
);
2344 if (fp
->cookie
!= node
->cookie
) {
2345 binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
2346 proc
->pid
, thread
->pid
, (u64
)fp
->binder
,
2347 node
->debug_id
, (u64
)fp
->cookie
,
2352 if (security_binder_transfer_binder(proc
->tsk
, target_proc
->tsk
)) {
2357 ret
= binder_inc_ref_for_node(target_proc
, node
,
2358 fp
->hdr
.type
== BINDER_TYPE_BINDER
,
2359 &thread
->todo
, &rdata
);
2363 if (fp
->hdr
.type
== BINDER_TYPE_BINDER
)
2364 fp
->hdr
.type
= BINDER_TYPE_HANDLE
;
2366 fp
->hdr
.type
= BINDER_TYPE_WEAK_HANDLE
;
2368 fp
->handle
= rdata
.desc
;
2371 trace_binder_transaction_node_to_ref(t
, node
, &rdata
);
2372 binder_debug(BINDER_DEBUG_TRANSACTION
,
2373 " node %d u%016llx -> ref %d desc %d\n",
2374 node
->debug_id
, (u64
)node
->ptr
,
2375 rdata
.debug_id
, rdata
.desc
);
2377 binder_put_node(node
);
2381 static int binder_translate_handle(struct flat_binder_object
*fp
,
2382 struct binder_transaction
*t
,
2383 struct binder_thread
*thread
)
2385 struct binder_proc
*proc
= thread
->proc
;
2386 struct binder_proc
*target_proc
= t
->to_proc
;
2387 struct binder_node
*node
;
2388 struct binder_ref_data src_rdata
;
2391 node
= binder_get_node_from_ref(proc
, fp
->handle
,
2392 fp
->hdr
.type
== BINDER_TYPE_HANDLE
, &src_rdata
);
2394 binder_user_error("%d:%d got transaction with invalid handle, %d\n",
2395 proc
->pid
, thread
->pid
, fp
->handle
);
2398 if (security_binder_transfer_binder(proc
->tsk
, target_proc
->tsk
)) {
2403 binder_node_lock(node
);
2404 if (node
->proc
== target_proc
) {
2405 if (fp
->hdr
.type
== BINDER_TYPE_HANDLE
)
2406 fp
->hdr
.type
= BINDER_TYPE_BINDER
;
2408 fp
->hdr
.type
= BINDER_TYPE_WEAK_BINDER
;
2409 fp
->binder
= node
->ptr
;
2410 fp
->cookie
= node
->cookie
;
2412 binder_inner_proc_lock(node
->proc
);
2413 binder_inc_node_nilocked(node
,
2414 fp
->hdr
.type
== BINDER_TYPE_BINDER
,
2417 binder_inner_proc_unlock(node
->proc
);
2418 trace_binder_transaction_ref_to_node(t
, node
, &src_rdata
);
2419 binder_debug(BINDER_DEBUG_TRANSACTION
,
2420 " ref %d desc %d -> node %d u%016llx\n",
2421 src_rdata
.debug_id
, src_rdata
.desc
, node
->debug_id
,
2423 binder_node_unlock(node
);
2425 struct binder_ref_data dest_rdata
;
2427 binder_node_unlock(node
);
2428 ret
= binder_inc_ref_for_node(target_proc
, node
,
2429 fp
->hdr
.type
== BINDER_TYPE_HANDLE
,
2435 fp
->handle
= dest_rdata
.desc
;
2437 trace_binder_transaction_ref_to_ref(t
, node
, &src_rdata
,
2439 binder_debug(BINDER_DEBUG_TRANSACTION
,
2440 " ref %d desc %d -> ref %d desc %d (node %d)\n",
2441 src_rdata
.debug_id
, src_rdata
.desc
,
2442 dest_rdata
.debug_id
, dest_rdata
.desc
,
2446 binder_put_node(node
);
2450 static int binder_translate_fd(int fd
,
2451 struct binder_transaction
*t
,
2452 struct binder_thread
*thread
,
2453 struct binder_transaction
*in_reply_to
)
2455 struct binder_proc
*proc
= thread
->proc
;
2456 struct binder_proc
*target_proc
= t
->to_proc
;
2460 bool target_allows_fd
;
2463 target_allows_fd
= !!(in_reply_to
->flags
& TF_ACCEPT_FDS
);
2465 target_allows_fd
= t
->buffer
->target_node
->accept_fds
;
2466 if (!target_allows_fd
) {
2467 binder_user_error("%d:%d got %s with fd, %d, but target does not allow fds\n",
2468 proc
->pid
, thread
->pid
,
2469 in_reply_to
? "reply" : "transaction",
2472 goto err_fd_not_accepted
;
2477 binder_user_error("%d:%d got transaction with invalid fd, %d\n",
2478 proc
->pid
, thread
->pid
, fd
);
2482 ret
= security_binder_transfer_file(proc
->tsk
, target_proc
->tsk
, file
);
2488 target_fd
= task_get_unused_fd_flags(target_proc
, O_CLOEXEC
);
2489 if (target_fd
< 0) {
2491 goto err_get_unused_fd
;
2493 task_fd_install(target_proc
, target_fd
, file
);
2494 trace_binder_transaction_fd(t
, fd
, target_fd
);
2495 binder_debug(BINDER_DEBUG_TRANSACTION
, " fd %d -> %d\n",
2504 err_fd_not_accepted
:
2508 static int binder_translate_fd_array(struct binder_fd_array_object
*fda
,
2509 struct binder_buffer_object
*parent
,
2510 struct binder_transaction
*t
,
2511 struct binder_thread
*thread
,
2512 struct binder_transaction
*in_reply_to
)
2514 binder_size_t fdi
, fd_buf_size
, num_installed_fds
;
2516 uintptr_t parent_buffer
;
2518 struct binder_proc
*proc
= thread
->proc
;
2519 struct binder_proc
*target_proc
= t
->to_proc
;
2521 fd_buf_size
= sizeof(u32
) * fda
->num_fds
;
2522 if (fda
->num_fds
>= SIZE_MAX
/ sizeof(u32
)) {
2523 binder_user_error("%d:%d got transaction with invalid number of fds (%lld)\n",
2524 proc
->pid
, thread
->pid
, (u64
)fda
->num_fds
);
2527 if (fd_buf_size
> parent
->length
||
2528 fda
->parent_offset
> parent
->length
- fd_buf_size
) {
2529 /* No space for all file descriptors here. */
2530 binder_user_error("%d:%d not enough space to store %lld fds in buffer\n",
2531 proc
->pid
, thread
->pid
, (u64
)fda
->num_fds
);
2535 * Since the parent was already fixed up, convert it
2536 * back to the kernel address space to access it
2538 parent_buffer
= parent
->buffer
-
2539 binder_alloc_get_user_buffer_offset(&target_proc
->alloc
);
2540 fd_array
= (u32
*)(parent_buffer
+ (uintptr_t)fda
->parent_offset
);
2541 if (!IS_ALIGNED((unsigned long)fd_array
, sizeof(u32
))) {
2542 binder_user_error("%d:%d parent offset not aligned correctly.\n",
2543 proc
->pid
, thread
->pid
);
2546 for (fdi
= 0; fdi
< fda
->num_fds
; fdi
++) {
2547 target_fd
= binder_translate_fd(fd_array
[fdi
], t
, thread
,
2550 goto err_translate_fd_failed
;
2551 fd_array
[fdi
] = target_fd
;
2555 err_translate_fd_failed
:
2557 * Failed to allocate fd or security error, free fds
2560 num_installed_fds
= fdi
;
2561 for (fdi
= 0; fdi
< num_installed_fds
; fdi
++)
2562 task_close_fd(target_proc
, fd_array
[fdi
]);
2566 static int binder_fixup_parent(struct binder_transaction
*t
,
2567 struct binder_thread
*thread
,
2568 struct binder_buffer_object
*bp
,
2569 binder_size_t
*off_start
,
2570 binder_size_t num_valid
,
2571 struct binder_buffer_object
*last_fixup_obj
,
2572 binder_size_t last_fixup_min_off
)
2574 struct binder_buffer_object
*parent
;
2576 struct binder_buffer
*b
= t
->buffer
;
2577 struct binder_proc
*proc
= thread
->proc
;
2578 struct binder_proc
*target_proc
= t
->to_proc
;
2580 if (!(bp
->flags
& BINDER_BUFFER_FLAG_HAS_PARENT
))
2583 parent
= binder_validate_ptr(b
, bp
->parent
, off_start
, num_valid
);
2585 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2586 proc
->pid
, thread
->pid
);
2590 if (!binder_validate_fixup(b
, off_start
,
2591 parent
, bp
->parent_offset
,
2593 last_fixup_min_off
)) {
2594 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
2595 proc
->pid
, thread
->pid
);
2599 if (parent
->length
< sizeof(binder_uintptr_t
) ||
2600 bp
->parent_offset
> parent
->length
- sizeof(binder_uintptr_t
)) {
2601 /* No space for a pointer here! */
2602 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2603 proc
->pid
, thread
->pid
);
2606 parent_buffer
= (u8
*)((uintptr_t)parent
->buffer
-
2607 binder_alloc_get_user_buffer_offset(
2608 &target_proc
->alloc
));
2609 *(binder_uintptr_t
*)(parent_buffer
+ bp
->parent_offset
) = bp
->buffer
;
2615 * binder_proc_transaction() - sends a transaction to a process and wakes it up
2616 * @t: transaction to send
2617 * @proc: process to send the transaction to
2618 * @thread: thread in @proc to send the transaction to (may be NULL)
2620 * This function queues a transaction to the specified process. It will try
2621 * to find a thread in the target process to handle the transaction and
2622 * wake it up. If no thread is found, the work is queued to the proc
2625 * If the @thread parameter is not NULL, the transaction is always queued
2626 * to the waitlist of that specific thread.
2628 * Return: true if the transactions was successfully queued
2629 * false if the target process or thread is dead
2631 static bool binder_proc_transaction(struct binder_transaction
*t
,
2632 struct binder_proc
*proc
,
2633 struct binder_thread
*thread
)
2635 struct binder_node
*node
= t
->buffer
->target_node
;
2636 bool oneway
= !!(t
->flags
& TF_ONE_WAY
);
2637 bool pending_async
= false;
2640 binder_node_lock(node
);
2643 if (node
->has_async_transaction
) {
2644 pending_async
= true;
2646 node
->has_async_transaction
= true;
2650 binder_inner_proc_lock(proc
);
2652 if (proc
->is_dead
|| (thread
&& thread
->is_dead
)) {
2653 binder_inner_proc_unlock(proc
);
2654 binder_node_unlock(node
);
2658 if (!thread
&& !pending_async
)
2659 thread
= binder_select_thread_ilocked(proc
);
2662 binder_enqueue_thread_work_ilocked(thread
, &t
->work
);
2663 else if (!pending_async
)
2664 binder_enqueue_work_ilocked(&t
->work
, &proc
->todo
);
2666 binder_enqueue_work_ilocked(&t
->work
, &node
->async_todo
);
2669 binder_wakeup_thread_ilocked(proc
, thread
, !oneway
/* sync */);
2671 binder_inner_proc_unlock(proc
);
2672 binder_node_unlock(node
);
2678 * binder_get_node_refs_for_txn() - Get required refs on node for txn
2679 * @node: struct binder_node for which to get refs
2680 * @proc: returns @node->proc if valid
2681 * @error: if no @proc then returns BR_DEAD_REPLY
2683 * User-space normally keeps the node alive when creating a transaction
2684 * since it has a reference to the target. The local strong ref keeps it
2685 * alive if the sending process dies before the target process processes
2686 * the transaction. If the source process is malicious or has a reference
2687 * counting bug, relying on the local strong ref can fail.
2689 * Since user-space can cause the local strong ref to go away, we also take
2690 * a tmpref on the node to ensure it survives while we are constructing
2691 * the transaction. We also need a tmpref on the proc while we are
2692 * constructing the transaction, so we take that here as well.
2694 * Return: The target_node with refs taken or NULL if no @node->proc is NULL.
2695 * Also sets @proc if valid. If the @node->proc is NULL indicating that the
2696 * target proc has died, @error is set to BR_DEAD_REPLY
2698 static struct binder_node
*binder_get_node_refs_for_txn(
2699 struct binder_node
*node
,
2700 struct binder_proc
**procp
,
2703 struct binder_node
*target_node
= NULL
;
2705 binder_node_inner_lock(node
);
2708 binder_inc_node_nilocked(node
, 1, 0, NULL
);
2709 binder_inc_node_tmpref_ilocked(node
);
2710 node
->proc
->tmp_ref
++;
2711 *procp
= node
->proc
;
2713 *error
= BR_DEAD_REPLY
;
2714 binder_node_inner_unlock(node
);
2719 static void binder_transaction(struct binder_proc
*proc
,
2720 struct binder_thread
*thread
,
2721 struct binder_transaction_data
*tr
, int reply
,
2722 binder_size_t extra_buffers_size
)
2725 struct binder_transaction
*t
;
2726 struct binder_work
*tcomplete
;
2727 binder_size_t
*offp
, *off_end
, *off_start
;
2728 binder_size_t off_min
;
2729 u8
*sg_bufp
, *sg_buf_end
;
2730 struct binder_proc
*target_proc
= NULL
;
2731 struct binder_thread
*target_thread
= NULL
;
2732 struct binder_node
*target_node
= NULL
;
2733 struct binder_transaction
*in_reply_to
= NULL
;
2734 struct binder_transaction_log_entry
*e
;
2735 uint32_t return_error
= 0;
2736 uint32_t return_error_param
= 0;
2737 uint32_t return_error_line
= 0;
2738 struct binder_buffer_object
*last_fixup_obj
= NULL
;
2739 binder_size_t last_fixup_min_off
= 0;
2740 struct binder_context
*context
= proc
->context
;
2741 int t_debug_id
= atomic_inc_return(&binder_last_id
);
2743 e
= binder_transaction_log_add(&binder_transaction_log
);
2744 e
->debug_id
= t_debug_id
;
2745 e
->call_type
= reply
? 2 : !!(tr
->flags
& TF_ONE_WAY
);
2746 e
->from_proc
= proc
->pid
;
2747 e
->from_thread
= thread
->pid
;
2748 e
->target_handle
= tr
->target
.handle
;
2749 e
->data_size
= tr
->data_size
;
2750 e
->offsets_size
= tr
->offsets_size
;
2751 e
->context_name
= proc
->context
->name
;
2754 binder_inner_proc_lock(proc
);
2755 in_reply_to
= thread
->transaction_stack
;
2756 if (in_reply_to
== NULL
) {
2757 binder_inner_proc_unlock(proc
);
2758 binder_user_error("%d:%d got reply transaction with no transaction stack\n",
2759 proc
->pid
, thread
->pid
);
2760 return_error
= BR_FAILED_REPLY
;
2761 return_error_param
= -EPROTO
;
2762 return_error_line
= __LINE__
;
2763 goto err_empty_call_stack
;
2765 if (in_reply_to
->to_thread
!= thread
) {
2766 spin_lock(&in_reply_to
->lock
);
2767 binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
2768 proc
->pid
, thread
->pid
, in_reply_to
->debug_id
,
2769 in_reply_to
->to_proc
?
2770 in_reply_to
->to_proc
->pid
: 0,
2771 in_reply_to
->to_thread
?
2772 in_reply_to
->to_thread
->pid
: 0);
2773 spin_unlock(&in_reply_to
->lock
);
2774 binder_inner_proc_unlock(proc
);
2775 return_error
= BR_FAILED_REPLY
;
2776 return_error_param
= -EPROTO
;
2777 return_error_line
= __LINE__
;
2779 goto err_bad_call_stack
;
2781 thread
->transaction_stack
= in_reply_to
->to_parent
;
2782 binder_inner_proc_unlock(proc
);
2783 binder_set_nice(in_reply_to
->saved_priority
);
2784 target_thread
= binder_get_txn_from_and_acq_inner(in_reply_to
);
2785 if (target_thread
== NULL
) {
2786 return_error
= BR_DEAD_REPLY
;
2787 return_error_line
= __LINE__
;
2788 goto err_dead_binder
;
2790 if (target_thread
->transaction_stack
!= in_reply_to
) {
2791 binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
2792 proc
->pid
, thread
->pid
,
2793 target_thread
->transaction_stack
?
2794 target_thread
->transaction_stack
->debug_id
: 0,
2795 in_reply_to
->debug_id
);
2796 binder_inner_proc_unlock(target_thread
->proc
);
2797 return_error
= BR_FAILED_REPLY
;
2798 return_error_param
= -EPROTO
;
2799 return_error_line
= __LINE__
;
2801 target_thread
= NULL
;
2802 goto err_dead_binder
;
2804 target_proc
= target_thread
->proc
;
2805 target_proc
->tmp_ref
++;
2806 binder_inner_proc_unlock(target_thread
->proc
);
2808 if (tr
->target
.handle
) {
2809 struct binder_ref
*ref
;
2812 * There must already be a strong ref
2813 * on this node. If so, do a strong
2814 * increment on the node to ensure it
2815 * stays alive until the transaction is
2818 binder_proc_lock(proc
);
2819 ref
= binder_get_ref_olocked(proc
, tr
->target
.handle
,
2822 target_node
= binder_get_node_refs_for_txn(
2823 ref
->node
, &target_proc
,
2826 binder_user_error("%d:%d got transaction to invalid handle\n",
2827 proc
->pid
, thread
->pid
);
2828 return_error
= BR_FAILED_REPLY
;
2830 binder_proc_unlock(proc
);
2832 mutex_lock(&context
->context_mgr_node_lock
);
2833 target_node
= context
->binder_context_mgr_node
;
2835 target_node
= binder_get_node_refs_for_txn(
2836 target_node
, &target_proc
,
2839 return_error
= BR_DEAD_REPLY
;
2840 mutex_unlock(&context
->context_mgr_node_lock
);
2841 if (target_node
&& target_proc
== proc
) {
2842 binder_user_error("%d:%d got transaction to context manager from process owning it\n",
2843 proc
->pid
, thread
->pid
);
2844 return_error
= BR_FAILED_REPLY
;
2845 return_error_param
= -EINVAL
;
2846 return_error_line
= __LINE__
;
2847 goto err_invalid_target_handle
;
2852 * return_error is set above
2854 return_error_param
= -EINVAL
;
2855 return_error_line
= __LINE__
;
2856 goto err_dead_binder
;
2858 e
->to_node
= target_node
->debug_id
;
2859 if (security_binder_transaction(proc
->tsk
,
2860 target_proc
->tsk
) < 0) {
2861 return_error
= BR_FAILED_REPLY
;
2862 return_error_param
= -EPERM
;
2863 return_error_line
= __LINE__
;
2864 goto err_invalid_target_handle
;
2866 binder_inner_proc_lock(proc
);
2867 if (!(tr
->flags
& TF_ONE_WAY
) && thread
->transaction_stack
) {
2868 struct binder_transaction
*tmp
;
2870 tmp
= thread
->transaction_stack
;
2871 if (tmp
->to_thread
!= thread
) {
2872 spin_lock(&tmp
->lock
);
2873 binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
2874 proc
->pid
, thread
->pid
, tmp
->debug_id
,
2875 tmp
->to_proc
? tmp
->to_proc
->pid
: 0,
2877 tmp
->to_thread
->pid
: 0);
2878 spin_unlock(&tmp
->lock
);
2879 binder_inner_proc_unlock(proc
);
2880 return_error
= BR_FAILED_REPLY
;
2881 return_error_param
= -EPROTO
;
2882 return_error_line
= __LINE__
;
2883 goto err_bad_call_stack
;
2886 struct binder_thread
*from
;
2888 spin_lock(&tmp
->lock
);
2890 if (from
&& from
->proc
== target_proc
) {
2891 atomic_inc(&from
->tmp_ref
);
2892 target_thread
= from
;
2893 spin_unlock(&tmp
->lock
);
2896 spin_unlock(&tmp
->lock
);
2897 tmp
= tmp
->from_parent
;
2900 binder_inner_proc_unlock(proc
);
2903 e
->to_thread
= target_thread
->pid
;
2904 e
->to_proc
= target_proc
->pid
;
2906 /* TODO: reuse incoming transaction for reply */
2907 t
= kzalloc(sizeof(*t
), GFP_KERNEL
);
2909 return_error
= BR_FAILED_REPLY
;
2910 return_error_param
= -ENOMEM
;
2911 return_error_line
= __LINE__
;
2912 goto err_alloc_t_failed
;
2914 binder_stats_created(BINDER_STAT_TRANSACTION
);
2915 spin_lock_init(&t
->lock
);
2917 tcomplete
= kzalloc(sizeof(*tcomplete
), GFP_KERNEL
);
2918 if (tcomplete
== NULL
) {
2919 return_error
= BR_FAILED_REPLY
;
2920 return_error_param
= -ENOMEM
;
2921 return_error_line
= __LINE__
;
2922 goto err_alloc_tcomplete_failed
;
2924 binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE
);
2926 t
->debug_id
= t_debug_id
;
2929 binder_debug(BINDER_DEBUG_TRANSACTION
,
2930 "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld-%lld\n",
2931 proc
->pid
, thread
->pid
, t
->debug_id
,
2932 target_proc
->pid
, target_thread
->pid
,
2933 (u64
)tr
->data
.ptr
.buffer
,
2934 (u64
)tr
->data
.ptr
.offsets
,
2935 (u64
)tr
->data_size
, (u64
)tr
->offsets_size
,
2936 (u64
)extra_buffers_size
);
2938 binder_debug(BINDER_DEBUG_TRANSACTION
,
2939 "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld-%lld\n",
2940 proc
->pid
, thread
->pid
, t
->debug_id
,
2941 target_proc
->pid
, target_node
->debug_id
,
2942 (u64
)tr
->data
.ptr
.buffer
,
2943 (u64
)tr
->data
.ptr
.offsets
,
2944 (u64
)tr
->data_size
, (u64
)tr
->offsets_size
,
2945 (u64
)extra_buffers_size
);
2947 if (!reply
&& !(tr
->flags
& TF_ONE_WAY
))
2951 t
->sender_euid
= task_euid(proc
->tsk
);
2952 t
->to_proc
= target_proc
;
2953 t
->to_thread
= target_thread
;
2955 t
->flags
= tr
->flags
;
2956 t
->priority
= task_nice(current
);
2958 trace_binder_transaction(reply
, t
, target_node
);
2960 t
->buffer
= binder_alloc_new_buf(&target_proc
->alloc
, tr
->data_size
,
2961 tr
->offsets_size
, extra_buffers_size
,
2962 !reply
&& (t
->flags
& TF_ONE_WAY
));
2963 if (IS_ERR(t
->buffer
)) {
2965 * -ESRCH indicates VMA cleared. The target is dying.
2967 return_error_param
= PTR_ERR(t
->buffer
);
2968 return_error
= return_error_param
== -ESRCH
?
2969 BR_DEAD_REPLY
: BR_FAILED_REPLY
;
2970 return_error_line
= __LINE__
;
2972 goto err_binder_alloc_buf_failed
;
2974 t
->buffer
->allow_user_free
= 0;
2975 t
->buffer
->debug_id
= t
->debug_id
;
2976 t
->buffer
->transaction
= t
;
2977 t
->buffer
->target_node
= target_node
;
2978 trace_binder_transaction_alloc_buf(t
->buffer
);
2979 off_start
= (binder_size_t
*)(t
->buffer
->data
+
2980 ALIGN(tr
->data_size
, sizeof(void *)));
2983 if (copy_from_user(t
->buffer
->data
, (const void __user
*)(uintptr_t)
2984 tr
->data
.ptr
.buffer
, tr
->data_size
)) {
2985 binder_user_error("%d:%d got transaction with invalid data ptr\n",
2986 proc
->pid
, thread
->pid
);
2987 return_error
= BR_FAILED_REPLY
;
2988 return_error_param
= -EFAULT
;
2989 return_error_line
= __LINE__
;
2990 goto err_copy_data_failed
;
2992 if (copy_from_user(offp
, (const void __user
*)(uintptr_t)
2993 tr
->data
.ptr
.offsets
, tr
->offsets_size
)) {
2994 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
2995 proc
->pid
, thread
->pid
);
2996 return_error
= BR_FAILED_REPLY
;
2997 return_error_param
= -EFAULT
;
2998 return_error_line
= __LINE__
;
2999 goto err_copy_data_failed
;
3001 if (!IS_ALIGNED(tr
->offsets_size
, sizeof(binder_size_t
))) {
3002 binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
3003 proc
->pid
, thread
->pid
, (u64
)tr
->offsets_size
);
3004 return_error
= BR_FAILED_REPLY
;
3005 return_error_param
= -EINVAL
;
3006 return_error_line
= __LINE__
;
3007 goto err_bad_offset
;
3009 if (!IS_ALIGNED(extra_buffers_size
, sizeof(u64
))) {
3010 binder_user_error("%d:%d got transaction with unaligned buffers size, %lld\n",
3011 proc
->pid
, thread
->pid
,
3012 (u64
)extra_buffers_size
);
3013 return_error
= BR_FAILED_REPLY
;
3014 return_error_param
= -EINVAL
;
3015 return_error_line
= __LINE__
;
3016 goto err_bad_offset
;
3018 off_end
= (void *)off_start
+ tr
->offsets_size
;
3019 sg_bufp
= (u8
*)(PTR_ALIGN(off_end
, sizeof(void *)));
3020 sg_buf_end
= sg_bufp
+ extra_buffers_size
;
3022 for (; offp
< off_end
; offp
++) {
3023 struct binder_object_header
*hdr
;
3024 size_t object_size
= binder_validate_object(t
->buffer
, *offp
);
3026 if (object_size
== 0 || *offp
< off_min
) {
3027 binder_user_error("%d:%d got transaction with invalid offset (%lld, min %lld max %lld) or object.\n",
3028 proc
->pid
, thread
->pid
, (u64
)*offp
,
3030 (u64
)t
->buffer
->data_size
);
3031 return_error
= BR_FAILED_REPLY
;
3032 return_error_param
= -EINVAL
;
3033 return_error_line
= __LINE__
;
3034 goto err_bad_offset
;
3037 hdr
= (struct binder_object_header
*)(t
->buffer
->data
+ *offp
);
3038 off_min
= *offp
+ object_size
;
3039 switch (hdr
->type
) {
3040 case BINDER_TYPE_BINDER
:
3041 case BINDER_TYPE_WEAK_BINDER
: {
3042 struct flat_binder_object
*fp
;
3044 fp
= to_flat_binder_object(hdr
);
3045 ret
= binder_translate_binder(fp
, t
, thread
);
3047 return_error
= BR_FAILED_REPLY
;
3048 return_error_param
= ret
;
3049 return_error_line
= __LINE__
;
3050 goto err_translate_failed
;
3053 case BINDER_TYPE_HANDLE
:
3054 case BINDER_TYPE_WEAK_HANDLE
: {
3055 struct flat_binder_object
*fp
;
3057 fp
= to_flat_binder_object(hdr
);
3058 ret
= binder_translate_handle(fp
, t
, thread
);
3060 return_error
= BR_FAILED_REPLY
;
3061 return_error_param
= ret
;
3062 return_error_line
= __LINE__
;
3063 goto err_translate_failed
;
3067 case BINDER_TYPE_FD
: {
3068 struct binder_fd_object
*fp
= to_binder_fd_object(hdr
);
3069 int target_fd
= binder_translate_fd(fp
->fd
, t
, thread
,
3072 if (target_fd
< 0) {
3073 return_error
= BR_FAILED_REPLY
;
3074 return_error_param
= target_fd
;
3075 return_error_line
= __LINE__
;
3076 goto err_translate_failed
;
3081 case BINDER_TYPE_FDA
: {
3082 struct binder_fd_array_object
*fda
=
3083 to_binder_fd_array_object(hdr
);
3084 struct binder_buffer_object
*parent
=
3085 binder_validate_ptr(t
->buffer
, fda
->parent
,
3089 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
3090 proc
->pid
, thread
->pid
);
3091 return_error
= BR_FAILED_REPLY
;
3092 return_error_param
= -EINVAL
;
3093 return_error_line
= __LINE__
;
3094 goto err_bad_parent
;
3096 if (!binder_validate_fixup(t
->buffer
, off_start
,
3097 parent
, fda
->parent_offset
,
3099 last_fixup_min_off
)) {
3100 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
3101 proc
->pid
, thread
->pid
);
3102 return_error
= BR_FAILED_REPLY
;
3103 return_error_param
= -EINVAL
;
3104 return_error_line
= __LINE__
;
3105 goto err_bad_parent
;
3107 ret
= binder_translate_fd_array(fda
, parent
, t
, thread
,
3110 return_error
= BR_FAILED_REPLY
;
3111 return_error_param
= ret
;
3112 return_error_line
= __LINE__
;
3113 goto err_translate_failed
;
3115 last_fixup_obj
= parent
;
3116 last_fixup_min_off
=
3117 fda
->parent_offset
+ sizeof(u32
) * fda
->num_fds
;
3119 case BINDER_TYPE_PTR
: {
3120 struct binder_buffer_object
*bp
=
3121 to_binder_buffer_object(hdr
);
3122 size_t buf_left
= sg_buf_end
- sg_bufp
;
3124 if (bp
->length
> buf_left
) {
3125 binder_user_error("%d:%d got transaction with too large buffer\n",
3126 proc
->pid
, thread
->pid
);
3127 return_error
= BR_FAILED_REPLY
;
3128 return_error_param
= -EINVAL
;
3129 return_error_line
= __LINE__
;
3130 goto err_bad_offset
;
3132 if (copy_from_user(sg_bufp
,
3133 (const void __user
*)(uintptr_t)
3134 bp
->buffer
, bp
->length
)) {
3135 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
3136 proc
->pid
, thread
->pid
);
3137 return_error_param
= -EFAULT
;
3138 return_error
= BR_FAILED_REPLY
;
3139 return_error_line
= __LINE__
;
3140 goto err_copy_data_failed
;
3142 /* Fixup buffer pointer to target proc address space */
3143 bp
->buffer
= (uintptr_t)sg_bufp
+
3144 binder_alloc_get_user_buffer_offset(
3145 &target_proc
->alloc
);
3146 sg_bufp
+= ALIGN(bp
->length
, sizeof(u64
));
3148 ret
= binder_fixup_parent(t
, thread
, bp
, off_start
,
3151 last_fixup_min_off
);
3153 return_error
= BR_FAILED_REPLY
;
3154 return_error_param
= ret
;
3155 return_error_line
= __LINE__
;
3156 goto err_translate_failed
;
3158 last_fixup_obj
= bp
;
3159 last_fixup_min_off
= 0;
3162 binder_user_error("%d:%d got transaction with invalid object type, %x\n",
3163 proc
->pid
, thread
->pid
, hdr
->type
);
3164 return_error
= BR_FAILED_REPLY
;
3165 return_error_param
= -EINVAL
;
3166 return_error_line
= __LINE__
;
3167 goto err_bad_object_type
;
3170 tcomplete
->type
= BINDER_WORK_TRANSACTION_COMPLETE
;
3171 t
->work
.type
= BINDER_WORK_TRANSACTION
;
3174 binder_enqueue_thread_work(thread
, tcomplete
);
3175 binder_inner_proc_lock(target_proc
);
3176 if (target_thread
->is_dead
) {
3177 binder_inner_proc_unlock(target_proc
);
3178 goto err_dead_proc_or_thread
;
3180 BUG_ON(t
->buffer
->async_transaction
!= 0);
3181 binder_pop_transaction_ilocked(target_thread
, in_reply_to
);
3182 binder_enqueue_thread_work_ilocked(target_thread
, &t
->work
);
3183 binder_inner_proc_unlock(target_proc
);
3184 wake_up_interruptible_sync(&target_thread
->wait
);
3185 binder_free_transaction(in_reply_to
);
3186 } else if (!(t
->flags
& TF_ONE_WAY
)) {
3187 BUG_ON(t
->buffer
->async_transaction
!= 0);
3188 binder_inner_proc_lock(proc
);
3190 * Defer the TRANSACTION_COMPLETE, so we don't return to
3191 * userspace immediately; this allows the target process to
3192 * immediately start processing this transaction, reducing
3193 * latency. We will then return the TRANSACTION_COMPLETE when
3194 * the target replies (or there is an error).
3196 binder_enqueue_deferred_thread_work_ilocked(thread
, tcomplete
);
3198 t
->from_parent
= thread
->transaction_stack
;
3199 thread
->transaction_stack
= t
;
3200 binder_inner_proc_unlock(proc
);
3201 if (!binder_proc_transaction(t
, target_proc
, target_thread
)) {
3202 binder_inner_proc_lock(proc
);
3203 binder_pop_transaction_ilocked(thread
, t
);
3204 binder_inner_proc_unlock(proc
);
3205 goto err_dead_proc_or_thread
;
3208 BUG_ON(target_node
== NULL
);
3209 BUG_ON(t
->buffer
->async_transaction
!= 1);
3210 binder_enqueue_thread_work(thread
, tcomplete
);
3211 if (!binder_proc_transaction(t
, target_proc
, NULL
))
3212 goto err_dead_proc_or_thread
;
3215 binder_thread_dec_tmpref(target_thread
);
3216 binder_proc_dec_tmpref(target_proc
);
3218 binder_dec_node_tmpref(target_node
);
3220 * write barrier to synchronize with initialization
3224 WRITE_ONCE(e
->debug_id_done
, t_debug_id
);
3227 err_dead_proc_or_thread
:
3228 return_error
= BR_DEAD_REPLY
;
3229 return_error_line
= __LINE__
;
3230 binder_dequeue_work(proc
, tcomplete
);
3231 err_translate_failed
:
3232 err_bad_object_type
:
3235 err_copy_data_failed
:
3236 trace_binder_transaction_failed_buffer_release(t
->buffer
);
3237 binder_transaction_buffer_release(target_proc
, t
->buffer
, offp
);
3239 binder_dec_node_tmpref(target_node
);
3241 t
->buffer
->transaction
= NULL
;
3242 binder_alloc_free_buf(&target_proc
->alloc
, t
->buffer
);
3243 err_binder_alloc_buf_failed
:
3245 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE
);
3246 err_alloc_tcomplete_failed
:
3248 binder_stats_deleted(BINDER_STAT_TRANSACTION
);
3251 err_empty_call_stack
:
3253 err_invalid_target_handle
:
3255 binder_thread_dec_tmpref(target_thread
);
3257 binder_proc_dec_tmpref(target_proc
);
3259 binder_dec_node(target_node
, 1, 0);
3260 binder_dec_node_tmpref(target_node
);
3263 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION
,
3264 "%d:%d transaction failed %d/%d, size %lld-%lld line %d\n",
3265 proc
->pid
, thread
->pid
, return_error
, return_error_param
,
3266 (u64
)tr
->data_size
, (u64
)tr
->offsets_size
,
3270 struct binder_transaction_log_entry
*fe
;
3272 e
->return_error
= return_error
;
3273 e
->return_error_param
= return_error_param
;
3274 e
->return_error_line
= return_error_line
;
3275 fe
= binder_transaction_log_add(&binder_transaction_log_failed
);
3278 * write barrier to synchronize with initialization
3282 WRITE_ONCE(e
->debug_id_done
, t_debug_id
);
3283 WRITE_ONCE(fe
->debug_id_done
, t_debug_id
);
3286 BUG_ON(thread
->return_error
.cmd
!= BR_OK
);
3288 thread
->return_error
.cmd
= BR_TRANSACTION_COMPLETE
;
3289 binder_enqueue_thread_work(thread
, &thread
->return_error
.work
);
3290 binder_send_failed_reply(in_reply_to
, return_error
);
3292 thread
->return_error
.cmd
= return_error
;
3293 binder_enqueue_thread_work(thread
, &thread
->return_error
.work
);
3297 static int binder_thread_write(struct binder_proc
*proc
,
3298 struct binder_thread
*thread
,
3299 binder_uintptr_t binder_buffer
, size_t size
,
3300 binder_size_t
*consumed
)
3303 struct binder_context
*context
= proc
->context
;
3304 void __user
*buffer
= (void __user
*)(uintptr_t)binder_buffer
;
3305 void __user
*ptr
= buffer
+ *consumed
;
3306 void __user
*end
= buffer
+ size
;
3308 while (ptr
< end
&& thread
->return_error
.cmd
== BR_OK
) {
3311 if (get_user(cmd
, (uint32_t __user
*)ptr
))
3313 ptr
+= sizeof(uint32_t);
3314 trace_binder_command(cmd
);
3315 if (_IOC_NR(cmd
) < ARRAY_SIZE(binder_stats
.bc
)) {
3316 atomic_inc(&binder_stats
.bc
[_IOC_NR(cmd
)]);
3317 atomic_inc(&proc
->stats
.bc
[_IOC_NR(cmd
)]);
3318 atomic_inc(&thread
->stats
.bc
[_IOC_NR(cmd
)]);
3326 const char *debug_string
;
3327 bool strong
= cmd
== BC_ACQUIRE
|| cmd
== BC_RELEASE
;
3328 bool increment
= cmd
== BC_INCREFS
|| cmd
== BC_ACQUIRE
;
3329 struct binder_ref_data rdata
;
3331 if (get_user(target
, (uint32_t __user
*)ptr
))
3334 ptr
+= sizeof(uint32_t);
3336 if (increment
&& !target
) {
3337 struct binder_node
*ctx_mgr_node
;
3338 mutex_lock(&context
->context_mgr_node_lock
);
3339 ctx_mgr_node
= context
->binder_context_mgr_node
;
3341 ret
= binder_inc_ref_for_node(
3343 strong
, NULL
, &rdata
);
3344 mutex_unlock(&context
->context_mgr_node_lock
);
3347 ret
= binder_update_ref_for_handle(
3348 proc
, target
, increment
, strong
,
3350 if (!ret
&& rdata
.desc
!= target
) {
3351 binder_user_error("%d:%d tried to acquire reference to desc %d, got %d instead\n",
3352 proc
->pid
, thread
->pid
,
3353 target
, rdata
.desc
);
3357 debug_string
= "IncRefs";
3360 debug_string
= "Acquire";
3363 debug_string
= "Release";
3367 debug_string
= "DecRefs";
3371 binder_user_error("%d:%d %s %d refcount change on invalid ref %d ret %d\n",
3372 proc
->pid
, thread
->pid
, debug_string
,
3373 strong
, target
, ret
);
3376 binder_debug(BINDER_DEBUG_USER_REFS
,
3377 "%d:%d %s ref %d desc %d s %d w %d\n",
3378 proc
->pid
, thread
->pid
, debug_string
,
3379 rdata
.debug_id
, rdata
.desc
, rdata
.strong
,
3383 case BC_INCREFS_DONE
:
3384 case BC_ACQUIRE_DONE
: {
3385 binder_uintptr_t node_ptr
;
3386 binder_uintptr_t cookie
;
3387 struct binder_node
*node
;
3390 if (get_user(node_ptr
, (binder_uintptr_t __user
*)ptr
))
3392 ptr
+= sizeof(binder_uintptr_t
);
3393 if (get_user(cookie
, (binder_uintptr_t __user
*)ptr
))
3395 ptr
+= sizeof(binder_uintptr_t
);
3396 node
= binder_get_node(proc
, node_ptr
);
3398 binder_user_error("%d:%d %s u%016llx no match\n",
3399 proc
->pid
, thread
->pid
,
3400 cmd
== BC_INCREFS_DONE
?
3406 if (cookie
!= node
->cookie
) {
3407 binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
3408 proc
->pid
, thread
->pid
,
3409 cmd
== BC_INCREFS_DONE
?
3410 "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3411 (u64
)node_ptr
, node
->debug_id
,
3412 (u64
)cookie
, (u64
)node
->cookie
);
3413 binder_put_node(node
);
3416 binder_node_inner_lock(node
);
3417 if (cmd
== BC_ACQUIRE_DONE
) {
3418 if (node
->pending_strong_ref
== 0) {
3419 binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
3420 proc
->pid
, thread
->pid
,
3422 binder_node_inner_unlock(node
);
3423 binder_put_node(node
);
3426 node
->pending_strong_ref
= 0;
3428 if (node
->pending_weak_ref
== 0) {
3429 binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
3430 proc
->pid
, thread
->pid
,
3432 binder_node_inner_unlock(node
);
3433 binder_put_node(node
);
3436 node
->pending_weak_ref
= 0;
3438 free_node
= binder_dec_node_nilocked(node
,
3439 cmd
== BC_ACQUIRE_DONE
, 0);
3441 binder_debug(BINDER_DEBUG_USER_REFS
,
3442 "%d:%d %s node %d ls %d lw %d tr %d\n",
3443 proc
->pid
, thread
->pid
,
3444 cmd
== BC_INCREFS_DONE
? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3445 node
->debug_id
, node
->local_strong_refs
,
3446 node
->local_weak_refs
, node
->tmp_refs
);
3447 binder_node_inner_unlock(node
);
3448 binder_put_node(node
);
3451 case BC_ATTEMPT_ACQUIRE
:
3452 pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
3454 case BC_ACQUIRE_RESULT
:
3455 pr_err("BC_ACQUIRE_RESULT not supported\n");
3458 case BC_FREE_BUFFER
: {
3459 binder_uintptr_t data_ptr
;
3460 struct binder_buffer
*buffer
;
3462 if (get_user(data_ptr
, (binder_uintptr_t __user
*)ptr
))
3464 ptr
+= sizeof(binder_uintptr_t
);
3466 buffer
= binder_alloc_prepare_to_free(&proc
->alloc
,
3468 if (buffer
== NULL
) {
3469 binder_user_error("%d:%d BC_FREE_BUFFER u%016llx no match\n",
3470 proc
->pid
, thread
->pid
, (u64
)data_ptr
);
3473 if (!buffer
->allow_user_free
) {
3474 binder_user_error("%d:%d BC_FREE_BUFFER u%016llx matched unreturned buffer\n",
3475 proc
->pid
, thread
->pid
, (u64
)data_ptr
);
3478 binder_debug(BINDER_DEBUG_FREE_BUFFER
,
3479 "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
3480 proc
->pid
, thread
->pid
, (u64
)data_ptr
,
3482 buffer
->transaction
? "active" : "finished");
3484 if (buffer
->transaction
) {
3485 buffer
->transaction
->buffer
= NULL
;
3486 buffer
->transaction
= NULL
;
3488 if (buffer
->async_transaction
&& buffer
->target_node
) {
3489 struct binder_node
*buf_node
;
3490 struct binder_work
*w
;
3492 buf_node
= buffer
->target_node
;
3493 binder_node_inner_lock(buf_node
);
3494 BUG_ON(!buf_node
->has_async_transaction
);
3495 BUG_ON(buf_node
->proc
!= proc
);
3496 w
= binder_dequeue_work_head_ilocked(
3497 &buf_node
->async_todo
);
3499 buf_node
->has_async_transaction
= false;
3501 binder_enqueue_work_ilocked(
3503 binder_wakeup_proc_ilocked(proc
);
3505 binder_node_inner_unlock(buf_node
);
3507 trace_binder_transaction_buffer_release(buffer
);
3508 binder_transaction_buffer_release(proc
, buffer
, NULL
);
3509 binder_alloc_free_buf(&proc
->alloc
, buffer
);
3513 case BC_TRANSACTION_SG
:
3515 struct binder_transaction_data_sg tr
;
3517 if (copy_from_user(&tr
, ptr
, sizeof(tr
)))
3520 binder_transaction(proc
, thread
, &tr
.transaction_data
,
3521 cmd
== BC_REPLY_SG
, tr
.buffers_size
);
3524 case BC_TRANSACTION
:
3526 struct binder_transaction_data tr
;
3528 if (copy_from_user(&tr
, ptr
, sizeof(tr
)))
3531 binder_transaction(proc
, thread
, &tr
,
3532 cmd
== BC_REPLY
, 0);
3536 case BC_REGISTER_LOOPER
:
3537 binder_debug(BINDER_DEBUG_THREADS
,
3538 "%d:%d BC_REGISTER_LOOPER\n",
3539 proc
->pid
, thread
->pid
);
3540 binder_inner_proc_lock(proc
);
3541 if (thread
->looper
& BINDER_LOOPER_STATE_ENTERED
) {
3542 thread
->looper
|= BINDER_LOOPER_STATE_INVALID
;
3543 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
3544 proc
->pid
, thread
->pid
);
3545 } else if (proc
->requested_threads
== 0) {
3546 thread
->looper
|= BINDER_LOOPER_STATE_INVALID
;
3547 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
3548 proc
->pid
, thread
->pid
);
3550 proc
->requested_threads
--;
3551 proc
->requested_threads_started
++;
3553 thread
->looper
|= BINDER_LOOPER_STATE_REGISTERED
;
3554 binder_inner_proc_unlock(proc
);
3556 case BC_ENTER_LOOPER
:
3557 binder_debug(BINDER_DEBUG_THREADS
,
3558 "%d:%d BC_ENTER_LOOPER\n",
3559 proc
->pid
, thread
->pid
);
3560 if (thread
->looper
& BINDER_LOOPER_STATE_REGISTERED
) {
3561 thread
->looper
|= BINDER_LOOPER_STATE_INVALID
;
3562 binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
3563 proc
->pid
, thread
->pid
);
3565 thread
->looper
|= BINDER_LOOPER_STATE_ENTERED
;
3567 case BC_EXIT_LOOPER
:
3568 binder_debug(BINDER_DEBUG_THREADS
,
3569 "%d:%d BC_EXIT_LOOPER\n",
3570 proc
->pid
, thread
->pid
);
3571 thread
->looper
|= BINDER_LOOPER_STATE_EXITED
;
3574 case BC_REQUEST_DEATH_NOTIFICATION
:
3575 case BC_CLEAR_DEATH_NOTIFICATION
: {
3577 binder_uintptr_t cookie
;
3578 struct binder_ref
*ref
;
3579 struct binder_ref_death
*death
= NULL
;
3581 if (get_user(target
, (uint32_t __user
*)ptr
))
3583 ptr
+= sizeof(uint32_t);
3584 if (get_user(cookie
, (binder_uintptr_t __user
*)ptr
))
3586 ptr
+= sizeof(binder_uintptr_t
);
3587 if (cmd
== BC_REQUEST_DEATH_NOTIFICATION
) {
3589 * Allocate memory for death notification
3590 * before taking lock
3592 death
= kzalloc(sizeof(*death
), GFP_KERNEL
);
3593 if (death
== NULL
) {
3594 WARN_ON(thread
->return_error
.cmd
!=
3596 thread
->return_error
.cmd
= BR_ERROR
;
3597 binder_enqueue_thread_work(
3599 &thread
->return_error
.work
);
3601 BINDER_DEBUG_FAILED_TRANSACTION
,
3602 "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
3603 proc
->pid
, thread
->pid
);
3607 binder_proc_lock(proc
);
3608 ref
= binder_get_ref_olocked(proc
, target
, false);
3610 binder_user_error("%d:%d %s invalid ref %d\n",
3611 proc
->pid
, thread
->pid
,
3612 cmd
== BC_REQUEST_DEATH_NOTIFICATION
?
3613 "BC_REQUEST_DEATH_NOTIFICATION" :
3614 "BC_CLEAR_DEATH_NOTIFICATION",
3616 binder_proc_unlock(proc
);
3621 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION
,
3622 "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
3623 proc
->pid
, thread
->pid
,
3624 cmd
== BC_REQUEST_DEATH_NOTIFICATION
?
3625 "BC_REQUEST_DEATH_NOTIFICATION" :
3626 "BC_CLEAR_DEATH_NOTIFICATION",
3627 (u64
)cookie
, ref
->data
.debug_id
,
3628 ref
->data
.desc
, ref
->data
.strong
,
3629 ref
->data
.weak
, ref
->node
->debug_id
);
3631 binder_node_lock(ref
->node
);
3632 if (cmd
== BC_REQUEST_DEATH_NOTIFICATION
) {
3634 binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
3635 proc
->pid
, thread
->pid
);
3636 binder_node_unlock(ref
->node
);
3637 binder_proc_unlock(proc
);
3641 binder_stats_created(BINDER_STAT_DEATH
);
3642 INIT_LIST_HEAD(&death
->work
.entry
);
3643 death
->cookie
= cookie
;
3645 if (ref
->node
->proc
== NULL
) {
3646 ref
->death
->work
.type
= BINDER_WORK_DEAD_BINDER
;
3648 binder_inner_proc_lock(proc
);
3649 binder_enqueue_work_ilocked(
3650 &ref
->death
->work
, &proc
->todo
);
3651 binder_wakeup_proc_ilocked(proc
);
3652 binder_inner_proc_unlock(proc
);
3655 if (ref
->death
== NULL
) {
3656 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
3657 proc
->pid
, thread
->pid
);
3658 binder_node_unlock(ref
->node
);
3659 binder_proc_unlock(proc
);
3663 if (death
->cookie
!= cookie
) {
3664 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
3665 proc
->pid
, thread
->pid
,
3668 binder_node_unlock(ref
->node
);
3669 binder_proc_unlock(proc
);
3673 binder_inner_proc_lock(proc
);
3674 if (list_empty(&death
->work
.entry
)) {
3675 death
->work
.type
= BINDER_WORK_CLEAR_DEATH_NOTIFICATION
;
3676 if (thread
->looper
&
3677 (BINDER_LOOPER_STATE_REGISTERED
|
3678 BINDER_LOOPER_STATE_ENTERED
))
3679 binder_enqueue_thread_work_ilocked(
3683 binder_enqueue_work_ilocked(
3686 binder_wakeup_proc_ilocked(
3690 BUG_ON(death
->work
.type
!= BINDER_WORK_DEAD_BINDER
);
3691 death
->work
.type
= BINDER_WORK_DEAD_BINDER_AND_CLEAR
;
3693 binder_inner_proc_unlock(proc
);
3695 binder_node_unlock(ref
->node
);
3696 binder_proc_unlock(proc
);
3698 case BC_DEAD_BINDER_DONE
: {
3699 struct binder_work
*w
;
3700 binder_uintptr_t cookie
;
3701 struct binder_ref_death
*death
= NULL
;
3703 if (get_user(cookie
, (binder_uintptr_t __user
*)ptr
))
3706 ptr
+= sizeof(cookie
);
3707 binder_inner_proc_lock(proc
);
3708 list_for_each_entry(w
, &proc
->delivered_death
,
3710 struct binder_ref_death
*tmp_death
=
3712 struct binder_ref_death
,
3715 if (tmp_death
->cookie
== cookie
) {
3720 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
3721 "%d:%d BC_DEAD_BINDER_DONE %016llx found %pK\n",
3722 proc
->pid
, thread
->pid
, (u64
)cookie
,
3724 if (death
== NULL
) {
3725 binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
3726 proc
->pid
, thread
->pid
, (u64
)cookie
);
3727 binder_inner_proc_unlock(proc
);
3730 binder_dequeue_work_ilocked(&death
->work
);
3731 if (death
->work
.type
== BINDER_WORK_DEAD_BINDER_AND_CLEAR
) {
3732 death
->work
.type
= BINDER_WORK_CLEAR_DEATH_NOTIFICATION
;
3733 if (thread
->looper
&
3734 (BINDER_LOOPER_STATE_REGISTERED
|
3735 BINDER_LOOPER_STATE_ENTERED
))
3736 binder_enqueue_thread_work_ilocked(
3737 thread
, &death
->work
);
3739 binder_enqueue_work_ilocked(
3742 binder_wakeup_proc_ilocked(proc
);
3745 binder_inner_proc_unlock(proc
);
3749 pr_err("%d:%d unknown command %d\n",
3750 proc
->pid
, thread
->pid
, cmd
);
3753 *consumed
= ptr
- buffer
;
3758 static void binder_stat_br(struct binder_proc
*proc
,
3759 struct binder_thread
*thread
, uint32_t cmd
)
3761 trace_binder_return(cmd
);
3762 if (_IOC_NR(cmd
) < ARRAY_SIZE(binder_stats
.br
)) {
3763 atomic_inc(&binder_stats
.br
[_IOC_NR(cmd
)]);
3764 atomic_inc(&proc
->stats
.br
[_IOC_NR(cmd
)]);
3765 atomic_inc(&thread
->stats
.br
[_IOC_NR(cmd
)]);
3769 static int binder_put_node_cmd(struct binder_proc
*proc
,
3770 struct binder_thread
*thread
,
3772 binder_uintptr_t node_ptr
,
3773 binder_uintptr_t node_cookie
,
3775 uint32_t cmd
, const char *cmd_name
)
3777 void __user
*ptr
= *ptrp
;
3779 if (put_user(cmd
, (uint32_t __user
*)ptr
))
3781 ptr
+= sizeof(uint32_t);
3783 if (put_user(node_ptr
, (binder_uintptr_t __user
*)ptr
))
3785 ptr
+= sizeof(binder_uintptr_t
);
3787 if (put_user(node_cookie
, (binder_uintptr_t __user
*)ptr
))
3789 ptr
+= sizeof(binder_uintptr_t
);
3791 binder_stat_br(proc
, thread
, cmd
);
3792 binder_debug(BINDER_DEBUG_USER_REFS
, "%d:%d %s %d u%016llx c%016llx\n",
3793 proc
->pid
, thread
->pid
, cmd_name
, node_debug_id
,
3794 (u64
)node_ptr
, (u64
)node_cookie
);
3800 static int binder_wait_for_work(struct binder_thread
*thread
,
3804 struct binder_proc
*proc
= thread
->proc
;
3807 freezer_do_not_count();
3808 binder_inner_proc_lock(proc
);
3810 prepare_to_wait(&thread
->wait
, &wait
, TASK_INTERRUPTIBLE
);
3811 if (binder_has_work_ilocked(thread
, do_proc_work
))
3814 list_add(&thread
->waiting_thread_node
,
3815 &proc
->waiting_threads
);
3816 binder_inner_proc_unlock(proc
);
3818 binder_inner_proc_lock(proc
);
3819 list_del_init(&thread
->waiting_thread_node
);
3820 if (signal_pending(current
)) {
3825 finish_wait(&thread
->wait
, &wait
);
3826 binder_inner_proc_unlock(proc
);
3832 static int binder_thread_read(struct binder_proc
*proc
,
3833 struct binder_thread
*thread
,
3834 binder_uintptr_t binder_buffer
, size_t size
,
3835 binder_size_t
*consumed
, int non_block
)
3837 void __user
*buffer
= (void __user
*)(uintptr_t)binder_buffer
;
3838 void __user
*ptr
= buffer
+ *consumed
;
3839 void __user
*end
= buffer
+ size
;
3842 int wait_for_proc_work
;
3844 if (*consumed
== 0) {
3845 if (put_user(BR_NOOP
, (uint32_t __user
*)ptr
))
3847 ptr
+= sizeof(uint32_t);
3851 binder_inner_proc_lock(proc
);
3852 wait_for_proc_work
= binder_available_for_proc_work_ilocked(thread
);
3853 binder_inner_proc_unlock(proc
);
3855 thread
->looper
|= BINDER_LOOPER_STATE_WAITING
;
3857 trace_binder_wait_for_work(wait_for_proc_work
,
3858 !!thread
->transaction_stack
,
3859 !binder_worklist_empty(proc
, &thread
->todo
));
3860 if (wait_for_proc_work
) {
3861 if (!(thread
->looper
& (BINDER_LOOPER_STATE_REGISTERED
|
3862 BINDER_LOOPER_STATE_ENTERED
))) {
3863 binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
3864 proc
->pid
, thread
->pid
, thread
->looper
);
3865 wait_event_interruptible(binder_user_error_wait
,
3866 binder_stop_on_user_error
< 2);
3868 binder_set_nice(proc
->default_priority
);
3872 if (!binder_has_work(thread
, wait_for_proc_work
))
3875 ret
= binder_wait_for_work(thread
, wait_for_proc_work
);
3878 thread
->looper
&= ~BINDER_LOOPER_STATE_WAITING
;
3885 struct binder_transaction_data tr
;
3886 struct binder_work
*w
= NULL
;
3887 struct list_head
*list
= NULL
;
3888 struct binder_transaction
*t
= NULL
;
3889 struct binder_thread
*t_from
;
3891 binder_inner_proc_lock(proc
);
3892 if (!binder_worklist_empty_ilocked(&thread
->todo
))
3893 list
= &thread
->todo
;
3894 else if (!binder_worklist_empty_ilocked(&proc
->todo
) &&
3898 binder_inner_proc_unlock(proc
);
3901 if (ptr
- buffer
== 4 && !thread
->looper_need_return
)
3906 if (end
- ptr
< sizeof(tr
) + 4) {
3907 binder_inner_proc_unlock(proc
);
3910 w
= binder_dequeue_work_head_ilocked(list
);
3911 if (binder_worklist_empty_ilocked(&thread
->todo
))
3912 thread
->process_todo
= false;
3915 case BINDER_WORK_TRANSACTION
: {
3916 binder_inner_proc_unlock(proc
);
3917 t
= container_of(w
, struct binder_transaction
, work
);
3919 case BINDER_WORK_RETURN_ERROR
: {
3920 struct binder_error
*e
= container_of(
3921 w
, struct binder_error
, work
);
3923 WARN_ON(e
->cmd
== BR_OK
);
3924 binder_inner_proc_unlock(proc
);
3925 if (put_user(e
->cmd
, (uint32_t __user
*)ptr
))
3929 ptr
+= sizeof(uint32_t);
3931 binder_stat_br(proc
, thread
, cmd
);
3933 case BINDER_WORK_TRANSACTION_COMPLETE
: {
3934 binder_inner_proc_unlock(proc
);
3935 cmd
= BR_TRANSACTION_COMPLETE
;
3936 if (put_user(cmd
, (uint32_t __user
*)ptr
))
3938 ptr
+= sizeof(uint32_t);
3940 binder_stat_br(proc
, thread
, cmd
);
3941 binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE
,
3942 "%d:%d BR_TRANSACTION_COMPLETE\n",
3943 proc
->pid
, thread
->pid
);
3945 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE
);
3947 case BINDER_WORK_NODE
: {
3948 struct binder_node
*node
= container_of(w
, struct binder_node
, work
);
3950 binder_uintptr_t node_ptr
= node
->ptr
;
3951 binder_uintptr_t node_cookie
= node
->cookie
;
3952 int node_debug_id
= node
->debug_id
;
3955 void __user
*orig_ptr
= ptr
;
3957 BUG_ON(proc
!= node
->proc
);
3958 strong
= node
->internal_strong_refs
||
3959 node
->local_strong_refs
;
3960 weak
= !hlist_empty(&node
->refs
) ||
3961 node
->local_weak_refs
||
3962 node
->tmp_refs
|| strong
;
3963 has_strong_ref
= node
->has_strong_ref
;
3964 has_weak_ref
= node
->has_weak_ref
;
3966 if (weak
&& !has_weak_ref
) {
3967 node
->has_weak_ref
= 1;
3968 node
->pending_weak_ref
= 1;
3969 node
->local_weak_refs
++;
3971 if (strong
&& !has_strong_ref
) {
3972 node
->has_strong_ref
= 1;
3973 node
->pending_strong_ref
= 1;
3974 node
->local_strong_refs
++;
3976 if (!strong
&& has_strong_ref
)
3977 node
->has_strong_ref
= 0;
3978 if (!weak
&& has_weak_ref
)
3979 node
->has_weak_ref
= 0;
3980 if (!weak
&& !strong
) {
3981 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
3982 "%d:%d node %d u%016llx c%016llx deleted\n",
3983 proc
->pid
, thread
->pid
,
3987 rb_erase(&node
->rb_node
, &proc
->nodes
);
3988 binder_inner_proc_unlock(proc
);
3989 binder_node_lock(node
);
3991 * Acquire the node lock before freeing the
3992 * node to serialize with other threads that
3993 * may have been holding the node lock while
3994 * decrementing this node (avoids race where
3995 * this thread frees while the other thread
3996 * is unlocking the node after the final
3999 binder_node_unlock(node
);
4000 binder_free_node(node
);
4002 binder_inner_proc_unlock(proc
);
4004 if (weak
&& !has_weak_ref
)
4005 ret
= binder_put_node_cmd(
4006 proc
, thread
, &ptr
, node_ptr
,
4007 node_cookie
, node_debug_id
,
4008 BR_INCREFS
, "BR_INCREFS");
4009 if (!ret
&& strong
&& !has_strong_ref
)
4010 ret
= binder_put_node_cmd(
4011 proc
, thread
, &ptr
, node_ptr
,
4012 node_cookie
, node_debug_id
,
4013 BR_ACQUIRE
, "BR_ACQUIRE");
4014 if (!ret
&& !strong
&& has_strong_ref
)
4015 ret
= binder_put_node_cmd(
4016 proc
, thread
, &ptr
, node_ptr
,
4017 node_cookie
, node_debug_id
,
4018 BR_RELEASE
, "BR_RELEASE");
4019 if (!ret
&& !weak
&& has_weak_ref
)
4020 ret
= binder_put_node_cmd(
4021 proc
, thread
, &ptr
, node_ptr
,
4022 node_cookie
, node_debug_id
,
4023 BR_DECREFS
, "BR_DECREFS");
4024 if (orig_ptr
== ptr
)
4025 binder_debug(BINDER_DEBUG_INTERNAL_REFS
,
4026 "%d:%d node %d u%016llx c%016llx state unchanged\n",
4027 proc
->pid
, thread
->pid
,
4034 case BINDER_WORK_DEAD_BINDER
:
4035 case BINDER_WORK_DEAD_BINDER_AND_CLEAR
:
4036 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION
: {
4037 struct binder_ref_death
*death
;
4039 binder_uintptr_t cookie
;
4041 death
= container_of(w
, struct binder_ref_death
, work
);
4042 if (w
->type
== BINDER_WORK_CLEAR_DEATH_NOTIFICATION
)
4043 cmd
= BR_CLEAR_DEATH_NOTIFICATION_DONE
;
4045 cmd
= BR_DEAD_BINDER
;
4046 cookie
= death
->cookie
;
4048 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION
,
4049 "%d:%d %s %016llx\n",
4050 proc
->pid
, thread
->pid
,
4051 cmd
== BR_DEAD_BINDER
?
4053 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
4055 if (w
->type
== BINDER_WORK_CLEAR_DEATH_NOTIFICATION
) {
4056 binder_inner_proc_unlock(proc
);
4058 binder_stats_deleted(BINDER_STAT_DEATH
);
4060 binder_enqueue_work_ilocked(
4061 w
, &proc
->delivered_death
);
4062 binder_inner_proc_unlock(proc
);
4064 if (put_user(cmd
, (uint32_t __user
*)ptr
))
4066 ptr
+= sizeof(uint32_t);
4067 if (put_user(cookie
,
4068 (binder_uintptr_t __user
*)ptr
))
4070 ptr
+= sizeof(binder_uintptr_t
);
4071 binder_stat_br(proc
, thread
, cmd
);
4072 if (cmd
== BR_DEAD_BINDER
)
4073 goto done
; /* DEAD_BINDER notifications can cause transactions */
4080 BUG_ON(t
->buffer
== NULL
);
4081 if (t
->buffer
->target_node
) {
4082 struct binder_node
*target_node
= t
->buffer
->target_node
;
4084 tr
.target
.ptr
= target_node
->ptr
;
4085 tr
.cookie
= target_node
->cookie
;
4086 t
->saved_priority
= task_nice(current
);
4087 if (t
->priority
< target_node
->min_priority
&&
4088 !(t
->flags
& TF_ONE_WAY
))
4089 binder_set_nice(t
->priority
);
4090 else if (!(t
->flags
& TF_ONE_WAY
) ||
4091 t
->saved_priority
> target_node
->min_priority
)
4092 binder_set_nice(target_node
->min_priority
);
4093 cmd
= BR_TRANSACTION
;
4100 tr
.flags
= t
->flags
;
4101 tr
.sender_euid
= from_kuid(current_user_ns(), t
->sender_euid
);
4103 t_from
= binder_get_txn_from(t
);
4105 struct task_struct
*sender
= t_from
->proc
->tsk
;
4107 tr
.sender_pid
= task_tgid_nr_ns(sender
,
4108 task_active_pid_ns(current
));
4113 tr
.data_size
= t
->buffer
->data_size
;
4114 tr
.offsets_size
= t
->buffer
->offsets_size
;
4115 tr
.data
.ptr
.buffer
= (binder_uintptr_t
)
4116 ((uintptr_t)t
->buffer
->data
+
4117 binder_alloc_get_user_buffer_offset(&proc
->alloc
));
4118 tr
.data
.ptr
.offsets
= tr
.data
.ptr
.buffer
+
4119 ALIGN(t
->buffer
->data_size
,
4122 if (put_user(cmd
, (uint32_t __user
*)ptr
)) {
4124 binder_thread_dec_tmpref(t_from
);
4126 binder_cleanup_transaction(t
, "put_user failed",
4131 ptr
+= sizeof(uint32_t);
4132 if (copy_to_user(ptr
, &tr
, sizeof(tr
))) {
4134 binder_thread_dec_tmpref(t_from
);
4136 binder_cleanup_transaction(t
, "copy_to_user failed",
4143 trace_binder_transaction_received(t
);
4144 binder_stat_br(proc
, thread
, cmd
);
4145 binder_debug(BINDER_DEBUG_TRANSACTION
,
4146 "%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n",
4147 proc
->pid
, thread
->pid
,
4148 (cmd
== BR_TRANSACTION
) ? "BR_TRANSACTION" :
4150 t
->debug_id
, t_from
? t_from
->proc
->pid
: 0,
4151 t_from
? t_from
->pid
: 0, cmd
,
4152 t
->buffer
->data_size
, t
->buffer
->offsets_size
,
4153 (u64
)tr
.data
.ptr
.buffer
, (u64
)tr
.data
.ptr
.offsets
);
4156 binder_thread_dec_tmpref(t_from
);
4157 t
->buffer
->allow_user_free
= 1;
4158 if (cmd
== BR_TRANSACTION
&& !(t
->flags
& TF_ONE_WAY
)) {
4159 binder_inner_proc_lock(thread
->proc
);
4160 t
->to_parent
= thread
->transaction_stack
;
4161 t
->to_thread
= thread
;
4162 thread
->transaction_stack
= t
;
4163 binder_inner_proc_unlock(thread
->proc
);
4165 binder_free_transaction(t
);
4172 *consumed
= ptr
- buffer
;
4173 binder_inner_proc_lock(proc
);
4174 if (proc
->requested_threads
== 0 &&
4175 list_empty(&thread
->proc
->waiting_threads
) &&
4176 proc
->requested_threads_started
< proc
->max_threads
&&
4177 (thread
->looper
& (BINDER_LOOPER_STATE_REGISTERED
|
4178 BINDER_LOOPER_STATE_ENTERED
)) /* the user-space code fails to */
4179 /*spawn a new thread if we leave this out */) {
4180 proc
->requested_threads
++;
4181 binder_inner_proc_unlock(proc
);
4182 binder_debug(BINDER_DEBUG_THREADS
,
4183 "%d:%d BR_SPAWN_LOOPER\n",
4184 proc
->pid
, thread
->pid
);
4185 if (put_user(BR_SPAWN_LOOPER
, (uint32_t __user
*)buffer
))
4187 binder_stat_br(proc
, thread
, BR_SPAWN_LOOPER
);
4189 binder_inner_proc_unlock(proc
);
4193 static void binder_release_work(struct binder_proc
*proc
,
4194 struct list_head
*list
)
4196 struct binder_work
*w
;
4199 w
= binder_dequeue_work_head(proc
, list
);
4204 case BINDER_WORK_TRANSACTION
: {
4205 struct binder_transaction
*t
;
4207 t
= container_of(w
, struct binder_transaction
, work
);
4209 binder_cleanup_transaction(t
, "process died.",
4212 case BINDER_WORK_RETURN_ERROR
: {
4213 struct binder_error
*e
= container_of(
4214 w
, struct binder_error
, work
);
4216 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
4217 "undelivered TRANSACTION_ERROR: %u\n",
4220 case BINDER_WORK_TRANSACTION_COMPLETE
: {
4221 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
4222 "undelivered TRANSACTION_COMPLETE\n");
4224 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE
);
4226 case BINDER_WORK_DEAD_BINDER_AND_CLEAR
:
4227 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION
: {
4228 struct binder_ref_death
*death
;
4230 death
= container_of(w
, struct binder_ref_death
, work
);
4231 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
4232 "undelivered death notification, %016llx\n",
4233 (u64
)death
->cookie
);
4235 binder_stats_deleted(BINDER_STAT_DEATH
);
4238 pr_err("unexpected work type, %d, not freed\n",
4246 static struct binder_thread
*binder_get_thread_ilocked(
4247 struct binder_proc
*proc
, struct binder_thread
*new_thread
)
4249 struct binder_thread
*thread
= NULL
;
4250 struct rb_node
*parent
= NULL
;
4251 struct rb_node
**p
= &proc
->threads
.rb_node
;
4255 thread
= rb_entry(parent
, struct binder_thread
, rb_node
);
4257 if (current
->pid
< thread
->pid
)
4259 else if (current
->pid
> thread
->pid
)
4260 p
= &(*p
)->rb_right
;
4266 thread
= new_thread
;
4267 binder_stats_created(BINDER_STAT_THREAD
);
4268 thread
->proc
= proc
;
4269 thread
->pid
= current
->pid
;
4270 atomic_set(&thread
->tmp_ref
, 0);
4271 init_waitqueue_head(&thread
->wait
);
4272 INIT_LIST_HEAD(&thread
->todo
);
4273 rb_link_node(&thread
->rb_node
, parent
, p
);
4274 rb_insert_color(&thread
->rb_node
, &proc
->threads
);
4275 thread
->looper_need_return
= true;
4276 thread
->return_error
.work
.type
= BINDER_WORK_RETURN_ERROR
;
4277 thread
->return_error
.cmd
= BR_OK
;
4278 thread
->reply_error
.work
.type
= BINDER_WORK_RETURN_ERROR
;
4279 thread
->reply_error
.cmd
= BR_OK
;
4280 INIT_LIST_HEAD(&new_thread
->waiting_thread_node
);
4284 static struct binder_thread
*binder_get_thread(struct binder_proc
*proc
)
4286 struct binder_thread
*thread
;
4287 struct binder_thread
*new_thread
;
4289 binder_inner_proc_lock(proc
);
4290 thread
= binder_get_thread_ilocked(proc
, NULL
);
4291 binder_inner_proc_unlock(proc
);
4293 new_thread
= kzalloc(sizeof(*thread
), GFP_KERNEL
);
4294 if (new_thread
== NULL
)
4296 binder_inner_proc_lock(proc
);
4297 thread
= binder_get_thread_ilocked(proc
, new_thread
);
4298 binder_inner_proc_unlock(proc
);
4299 if (thread
!= new_thread
)
4305 static void binder_free_proc(struct binder_proc
*proc
)
4307 BUG_ON(!list_empty(&proc
->todo
));
4308 BUG_ON(!list_empty(&proc
->delivered_death
));
4309 binder_alloc_deferred_release(&proc
->alloc
);
4310 put_task_struct(proc
->tsk
);
4311 binder_stats_deleted(BINDER_STAT_PROC
);
4315 static void binder_free_thread(struct binder_thread
*thread
)
4317 BUG_ON(!list_empty(&thread
->todo
));
4318 binder_stats_deleted(BINDER_STAT_THREAD
);
4319 binder_proc_dec_tmpref(thread
->proc
);
4323 static int binder_thread_release(struct binder_proc
*proc
,
4324 struct binder_thread
*thread
)
4326 struct binder_transaction
*t
;
4327 struct binder_transaction
*send_reply
= NULL
;
4328 int active_transactions
= 0;
4329 struct binder_transaction
*last_t
= NULL
;
4331 binder_inner_proc_lock(thread
->proc
);
4333 * take a ref on the proc so it survives
4334 * after we remove this thread from proc->threads.
4335 * The corresponding dec is when we actually
4336 * free the thread in binder_free_thread()
4340 * take a ref on this thread to ensure it
4341 * survives while we are releasing it
4343 atomic_inc(&thread
->tmp_ref
);
4344 rb_erase(&thread
->rb_node
, &proc
->threads
);
4345 t
= thread
->transaction_stack
;
4347 spin_lock(&t
->lock
);
4348 if (t
->to_thread
== thread
)
4351 thread
->is_dead
= true;
4355 active_transactions
++;
4356 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION
,
4357 "release %d:%d transaction %d %s, still active\n",
4358 proc
->pid
, thread
->pid
,
4360 (t
->to_thread
== thread
) ? "in" : "out");
4362 if (t
->to_thread
== thread
) {
4364 t
->to_thread
= NULL
;
4366 t
->buffer
->transaction
= NULL
;
4370 } else if (t
->from
== thread
) {
4375 spin_unlock(&last_t
->lock
);
4377 spin_lock(&t
->lock
);
4381 * If this thread used poll, make sure we remove the waitqueue
4382 * from any epoll data structures holding it with POLLFREE.
4383 * waitqueue_active() is safe to use here because we're holding
4386 if ((thread
->looper
& BINDER_LOOPER_STATE_POLL
) &&
4387 waitqueue_active(&thread
->wait
)) {
4388 wake_up_poll(&thread
->wait
, EPOLLHUP
| POLLFREE
);
4391 binder_inner_proc_unlock(thread
->proc
);
4394 * This is needed to avoid races between wake_up_poll() above and
4395 * and ep_remove_waitqueue() called for other reasons (eg the epoll file
4396 * descriptor being closed); ep_remove_waitqueue() holds an RCU read
4397 * lock, so we can be sure it's done after calling synchronize_rcu().
4399 if (thread
->looper
& BINDER_LOOPER_STATE_POLL
)
4403 binder_send_failed_reply(send_reply
, BR_DEAD_REPLY
);
4404 binder_release_work(proc
, &thread
->todo
);
4405 binder_thread_dec_tmpref(thread
);
4406 return active_transactions
;
4409 static __poll_t
binder_poll(struct file
*filp
,
4410 struct poll_table_struct
*wait
)
4412 struct binder_proc
*proc
= filp
->private_data
;
4413 struct binder_thread
*thread
= NULL
;
4414 bool wait_for_proc_work
;
4416 thread
= binder_get_thread(proc
);
4420 binder_inner_proc_lock(thread
->proc
);
4421 thread
->looper
|= BINDER_LOOPER_STATE_POLL
;
4422 wait_for_proc_work
= binder_available_for_proc_work_ilocked(thread
);
4424 binder_inner_proc_unlock(thread
->proc
);
4426 poll_wait(filp
, &thread
->wait
, wait
);
4428 if (binder_has_work(thread
, wait_for_proc_work
))
4434 static int binder_ioctl_write_read(struct file
*filp
,
4435 unsigned int cmd
, unsigned long arg
,
4436 struct binder_thread
*thread
)
4439 struct binder_proc
*proc
= filp
->private_data
;
4440 unsigned int size
= _IOC_SIZE(cmd
);
4441 void __user
*ubuf
= (void __user
*)arg
;
4442 struct binder_write_read bwr
;
4444 if (size
!= sizeof(struct binder_write_read
)) {
4448 if (copy_from_user(&bwr
, ubuf
, sizeof(bwr
))) {
4452 binder_debug(BINDER_DEBUG_READ_WRITE
,
4453 "%d:%d write %lld at %016llx, read %lld at %016llx\n",
4454 proc
->pid
, thread
->pid
,
4455 (u64
)bwr
.write_size
, (u64
)bwr
.write_buffer
,
4456 (u64
)bwr
.read_size
, (u64
)bwr
.read_buffer
);
4458 if (bwr
.write_size
> 0) {
4459 ret
= binder_thread_write(proc
, thread
,
4462 &bwr
.write_consumed
);
4463 trace_binder_write_done(ret
);
4465 bwr
.read_consumed
= 0;
4466 if (copy_to_user(ubuf
, &bwr
, sizeof(bwr
)))
4471 if (bwr
.read_size
> 0) {
4472 ret
= binder_thread_read(proc
, thread
, bwr
.read_buffer
,
4475 filp
->f_flags
& O_NONBLOCK
);
4476 trace_binder_read_done(ret
);
4477 binder_inner_proc_lock(proc
);
4478 if (!binder_worklist_empty_ilocked(&proc
->todo
))
4479 binder_wakeup_proc_ilocked(proc
);
4480 binder_inner_proc_unlock(proc
);
4482 if (copy_to_user(ubuf
, &bwr
, sizeof(bwr
)))
4487 binder_debug(BINDER_DEBUG_READ_WRITE
,
4488 "%d:%d wrote %lld of %lld, read return %lld of %lld\n",
4489 proc
->pid
, thread
->pid
,
4490 (u64
)bwr
.write_consumed
, (u64
)bwr
.write_size
,
4491 (u64
)bwr
.read_consumed
, (u64
)bwr
.read_size
);
4492 if (copy_to_user(ubuf
, &bwr
, sizeof(bwr
))) {
4500 static int binder_ioctl_set_ctx_mgr(struct file
*filp
)
4503 struct binder_proc
*proc
= filp
->private_data
;
4504 struct binder_context
*context
= proc
->context
;
4505 struct binder_node
*new_node
;
4506 kuid_t curr_euid
= current_euid();
4508 mutex_lock(&context
->context_mgr_node_lock
);
4509 if (context
->binder_context_mgr_node
) {
4510 pr_err("BINDER_SET_CONTEXT_MGR already set\n");
4514 ret
= security_binder_set_context_mgr(proc
->tsk
);
4517 if (uid_valid(context
->binder_context_mgr_uid
)) {
4518 if (!uid_eq(context
->binder_context_mgr_uid
, curr_euid
)) {
4519 pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
4520 from_kuid(&init_user_ns
, curr_euid
),
4521 from_kuid(&init_user_ns
,
4522 context
->binder_context_mgr_uid
));
4527 context
->binder_context_mgr_uid
= curr_euid
;
4529 new_node
= binder_new_node(proc
, NULL
);
4534 binder_node_lock(new_node
);
4535 new_node
->local_weak_refs
++;
4536 new_node
->local_strong_refs
++;
4537 new_node
->has_strong_ref
= 1;
4538 new_node
->has_weak_ref
= 1;
4539 context
->binder_context_mgr_node
= new_node
;
4540 binder_node_unlock(new_node
);
4541 binder_put_node(new_node
);
4543 mutex_unlock(&context
->context_mgr_node_lock
);
4547 static int binder_ioctl_get_node_debug_info(struct binder_proc
*proc
,
4548 struct binder_node_debug_info
*info
)
4551 binder_uintptr_t ptr
= info
->ptr
;
4553 memset(info
, 0, sizeof(*info
));
4555 binder_inner_proc_lock(proc
);
4556 for (n
= rb_first(&proc
->nodes
); n
!= NULL
; n
= rb_next(n
)) {
4557 struct binder_node
*node
= rb_entry(n
, struct binder_node
,
4559 if (node
->ptr
> ptr
) {
4560 info
->ptr
= node
->ptr
;
4561 info
->cookie
= node
->cookie
;
4562 info
->has_strong_ref
= node
->has_strong_ref
;
4563 info
->has_weak_ref
= node
->has_weak_ref
;
4567 binder_inner_proc_unlock(proc
);
4572 static long binder_ioctl(struct file
*filp
, unsigned int cmd
, unsigned long arg
)
4575 struct binder_proc
*proc
= filp
->private_data
;
4576 struct binder_thread
*thread
;
4577 unsigned int size
= _IOC_SIZE(cmd
);
4578 void __user
*ubuf
= (void __user
*)arg
;
4580 /*pr_info("binder_ioctl: %d:%d %x %lx\n",
4581 proc->pid, current->pid, cmd, arg);*/
4583 binder_selftest_alloc(&proc
->alloc
);
4585 trace_binder_ioctl(cmd
, arg
);
4587 ret
= wait_event_interruptible(binder_user_error_wait
, binder_stop_on_user_error
< 2);
4591 thread
= binder_get_thread(proc
);
4592 if (thread
== NULL
) {
4598 case BINDER_WRITE_READ
:
4599 ret
= binder_ioctl_write_read(filp
, cmd
, arg
, thread
);
4603 case BINDER_SET_MAX_THREADS
: {
4606 if (copy_from_user(&max_threads
, ubuf
,
4607 sizeof(max_threads
))) {
4611 binder_inner_proc_lock(proc
);
4612 proc
->max_threads
= max_threads
;
4613 binder_inner_proc_unlock(proc
);
4616 case BINDER_SET_CONTEXT_MGR
:
4617 ret
= binder_ioctl_set_ctx_mgr(filp
);
4621 case BINDER_THREAD_EXIT
:
4622 binder_debug(BINDER_DEBUG_THREADS
, "%d:%d exit\n",
4623 proc
->pid
, thread
->pid
);
4624 binder_thread_release(proc
, thread
);
4627 case BINDER_VERSION
: {
4628 struct binder_version __user
*ver
= ubuf
;
4630 if (size
!= sizeof(struct binder_version
)) {
4634 if (put_user(BINDER_CURRENT_PROTOCOL_VERSION
,
4635 &ver
->protocol_version
)) {
4641 case BINDER_GET_NODE_DEBUG_INFO
: {
4642 struct binder_node_debug_info info
;
4644 if (copy_from_user(&info
, ubuf
, sizeof(info
))) {
4649 ret
= binder_ioctl_get_node_debug_info(proc
, &info
);
4653 if (copy_to_user(ubuf
, &info
, sizeof(info
))) {
4666 thread
->looper_need_return
= false;
4667 wait_event_interruptible(binder_user_error_wait
, binder_stop_on_user_error
< 2);
4668 if (ret
&& ret
!= -ERESTARTSYS
)
4669 pr_info("%d:%d ioctl %x %lx returned %d\n", proc
->pid
, current
->pid
, cmd
, arg
, ret
);
4671 trace_binder_ioctl_done(ret
);
4675 static void binder_vma_open(struct vm_area_struct
*vma
)
4677 struct binder_proc
*proc
= vma
->vm_private_data
;
4679 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
4680 "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
4681 proc
->pid
, vma
->vm_start
, vma
->vm_end
,
4682 (vma
->vm_end
- vma
->vm_start
) / SZ_1K
, vma
->vm_flags
,
4683 (unsigned long)pgprot_val(vma
->vm_page_prot
));
4686 static void binder_vma_close(struct vm_area_struct
*vma
)
4688 struct binder_proc
*proc
= vma
->vm_private_data
;
4690 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
4691 "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
4692 proc
->pid
, vma
->vm_start
, vma
->vm_end
,
4693 (vma
->vm_end
- vma
->vm_start
) / SZ_1K
, vma
->vm_flags
,
4694 (unsigned long)pgprot_val(vma
->vm_page_prot
));
4695 binder_alloc_vma_close(&proc
->alloc
);
4696 binder_defer_work(proc
, BINDER_DEFERRED_PUT_FILES
);
4699 static vm_fault_t
binder_vm_fault(struct vm_fault
*vmf
)
4701 return VM_FAULT_SIGBUS
;
4704 static const struct vm_operations_struct binder_vm_ops
= {
4705 .open
= binder_vma_open
,
4706 .close
= binder_vma_close
,
4707 .fault
= binder_vm_fault
,
4710 static int binder_mmap(struct file
*filp
, struct vm_area_struct
*vma
)
4713 struct binder_proc
*proc
= filp
->private_data
;
4714 const char *failure_string
;
4716 if (proc
->tsk
!= current
->group_leader
)
4719 if ((vma
->vm_end
- vma
->vm_start
) > SZ_4M
)
4720 vma
->vm_end
= vma
->vm_start
+ SZ_4M
;
4722 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
4723 "%s: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
4724 __func__
, proc
->pid
, vma
->vm_start
, vma
->vm_end
,
4725 (vma
->vm_end
- vma
->vm_start
) / SZ_1K
, vma
->vm_flags
,
4726 (unsigned long)pgprot_val(vma
->vm_page_prot
));
4728 if (vma
->vm_flags
& FORBIDDEN_MMAP_FLAGS
) {
4730 failure_string
= "bad vm_flags";
4733 vma
->vm_flags
|= VM_DONTCOPY
| VM_MIXEDMAP
;
4734 vma
->vm_flags
&= ~VM_MAYWRITE
;
4736 vma
->vm_ops
= &binder_vm_ops
;
4737 vma
->vm_private_data
= proc
;
4739 ret
= binder_alloc_mmap_handler(&proc
->alloc
, vma
);
4742 mutex_lock(&proc
->files_lock
);
4743 proc
->files
= get_files_struct(current
);
4744 mutex_unlock(&proc
->files_lock
);
4748 pr_err("%s: %d %lx-%lx %s failed %d\n", __func__
,
4749 proc
->pid
, vma
->vm_start
, vma
->vm_end
, failure_string
, ret
);
4753 static int binder_open(struct inode
*nodp
, struct file
*filp
)
4755 struct binder_proc
*proc
;
4756 struct binder_device
*binder_dev
;
4758 binder_debug(BINDER_DEBUG_OPEN_CLOSE
, "%s: %d:%d\n", __func__
,
4759 current
->group_leader
->pid
, current
->pid
);
4761 proc
= kzalloc(sizeof(*proc
), GFP_KERNEL
);
4764 spin_lock_init(&proc
->inner_lock
);
4765 spin_lock_init(&proc
->outer_lock
);
4766 get_task_struct(current
->group_leader
);
4767 proc
->tsk
= current
->group_leader
;
4768 mutex_init(&proc
->files_lock
);
4769 INIT_LIST_HEAD(&proc
->todo
);
4770 proc
->default_priority
= task_nice(current
);
4771 binder_dev
= container_of(filp
->private_data
, struct binder_device
,
4773 proc
->context
= &binder_dev
->context
;
4774 binder_alloc_init(&proc
->alloc
);
4776 binder_stats_created(BINDER_STAT_PROC
);
4777 proc
->pid
= current
->group_leader
->pid
;
4778 INIT_LIST_HEAD(&proc
->delivered_death
);
4779 INIT_LIST_HEAD(&proc
->waiting_threads
);
4780 filp
->private_data
= proc
;
4782 mutex_lock(&binder_procs_lock
);
4783 hlist_add_head(&proc
->proc_node
, &binder_procs
);
4784 mutex_unlock(&binder_procs_lock
);
4786 if (binder_debugfs_dir_entry_proc
) {
4789 snprintf(strbuf
, sizeof(strbuf
), "%u", proc
->pid
);
4791 * proc debug entries are shared between contexts, so
4792 * this will fail if the process tries to open the driver
4793 * again with a different context. The priting code will
4794 * anyway print all contexts that a given PID has, so this
4797 proc
->debugfs_entry
= debugfs_create_file(strbuf
, 0444,
4798 binder_debugfs_dir_entry_proc
,
4799 (void *)(unsigned long)proc
->pid
,
4806 static int binder_flush(struct file
*filp
, fl_owner_t id
)
4808 struct binder_proc
*proc
= filp
->private_data
;
4810 binder_defer_work(proc
, BINDER_DEFERRED_FLUSH
);
4815 static void binder_deferred_flush(struct binder_proc
*proc
)
4820 binder_inner_proc_lock(proc
);
4821 for (n
= rb_first(&proc
->threads
); n
!= NULL
; n
= rb_next(n
)) {
4822 struct binder_thread
*thread
= rb_entry(n
, struct binder_thread
, rb_node
);
4824 thread
->looper_need_return
= true;
4825 if (thread
->looper
& BINDER_LOOPER_STATE_WAITING
) {
4826 wake_up_interruptible(&thread
->wait
);
4830 binder_inner_proc_unlock(proc
);
4832 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
4833 "binder_flush: %d woke %d threads\n", proc
->pid
,
4837 static int binder_release(struct inode
*nodp
, struct file
*filp
)
4839 struct binder_proc
*proc
= filp
->private_data
;
4841 debugfs_remove(proc
->debugfs_entry
);
4842 binder_defer_work(proc
, BINDER_DEFERRED_RELEASE
);
4847 static int binder_node_release(struct binder_node
*node
, int refs
)
4849 struct binder_ref
*ref
;
4851 struct binder_proc
*proc
= node
->proc
;
4853 binder_release_work(proc
, &node
->async_todo
);
4855 binder_node_lock(node
);
4856 binder_inner_proc_lock(proc
);
4857 binder_dequeue_work_ilocked(&node
->work
);
4859 * The caller must have taken a temporary ref on the node,
4861 BUG_ON(!node
->tmp_refs
);
4862 if (hlist_empty(&node
->refs
) && node
->tmp_refs
== 1) {
4863 binder_inner_proc_unlock(proc
);
4864 binder_node_unlock(node
);
4865 binder_free_node(node
);
4871 node
->local_strong_refs
= 0;
4872 node
->local_weak_refs
= 0;
4873 binder_inner_proc_unlock(proc
);
4875 spin_lock(&binder_dead_nodes_lock
);
4876 hlist_add_head(&node
->dead_node
, &binder_dead_nodes
);
4877 spin_unlock(&binder_dead_nodes_lock
);
4879 hlist_for_each_entry(ref
, &node
->refs
, node_entry
) {
4882 * Need the node lock to synchronize
4883 * with new notification requests and the
4884 * inner lock to synchronize with queued
4885 * death notifications.
4887 binder_inner_proc_lock(ref
->proc
);
4889 binder_inner_proc_unlock(ref
->proc
);
4895 BUG_ON(!list_empty(&ref
->death
->work
.entry
));
4896 ref
->death
->work
.type
= BINDER_WORK_DEAD_BINDER
;
4897 binder_enqueue_work_ilocked(&ref
->death
->work
,
4899 binder_wakeup_proc_ilocked(ref
->proc
);
4900 binder_inner_proc_unlock(ref
->proc
);
4903 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
4904 "node %d now dead, refs %d, death %d\n",
4905 node
->debug_id
, refs
, death
);
4906 binder_node_unlock(node
);
4907 binder_put_node(node
);
4912 static void binder_deferred_release(struct binder_proc
*proc
)
4914 struct binder_context
*context
= proc
->context
;
4916 int threads
, nodes
, incoming_refs
, outgoing_refs
, active_transactions
;
4918 BUG_ON(proc
->files
);
4920 mutex_lock(&binder_procs_lock
);
4921 hlist_del(&proc
->proc_node
);
4922 mutex_unlock(&binder_procs_lock
);
4924 mutex_lock(&context
->context_mgr_node_lock
);
4925 if (context
->binder_context_mgr_node
&&
4926 context
->binder_context_mgr_node
->proc
== proc
) {
4927 binder_debug(BINDER_DEBUG_DEAD_BINDER
,
4928 "%s: %d context_mgr_node gone\n",
4929 __func__
, proc
->pid
);
4930 context
->binder_context_mgr_node
= NULL
;
4932 mutex_unlock(&context
->context_mgr_node_lock
);
4933 binder_inner_proc_lock(proc
);
4935 * Make sure proc stays alive after we
4936 * remove all the threads
4940 proc
->is_dead
= true;
4942 active_transactions
= 0;
4943 while ((n
= rb_first(&proc
->threads
))) {
4944 struct binder_thread
*thread
;
4946 thread
= rb_entry(n
, struct binder_thread
, rb_node
);
4947 binder_inner_proc_unlock(proc
);
4949 active_transactions
+= binder_thread_release(proc
, thread
);
4950 binder_inner_proc_lock(proc
);
4955 while ((n
= rb_first(&proc
->nodes
))) {
4956 struct binder_node
*node
;
4958 node
= rb_entry(n
, struct binder_node
, rb_node
);
4961 * take a temporary ref on the node before
4962 * calling binder_node_release() which will either
4963 * kfree() the node or call binder_put_node()
4965 binder_inc_node_tmpref_ilocked(node
);
4966 rb_erase(&node
->rb_node
, &proc
->nodes
);
4967 binder_inner_proc_unlock(proc
);
4968 incoming_refs
= binder_node_release(node
, incoming_refs
);
4969 binder_inner_proc_lock(proc
);
4971 binder_inner_proc_unlock(proc
);
4974 binder_proc_lock(proc
);
4975 while ((n
= rb_first(&proc
->refs_by_desc
))) {
4976 struct binder_ref
*ref
;
4978 ref
= rb_entry(n
, struct binder_ref
, rb_node_desc
);
4980 binder_cleanup_ref_olocked(ref
);
4981 binder_proc_unlock(proc
);
4982 binder_free_ref(ref
);
4983 binder_proc_lock(proc
);
4985 binder_proc_unlock(proc
);
4987 binder_release_work(proc
, &proc
->todo
);
4988 binder_release_work(proc
, &proc
->delivered_death
);
4990 binder_debug(BINDER_DEBUG_OPEN_CLOSE
,
4991 "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d\n",
4992 __func__
, proc
->pid
, threads
, nodes
, incoming_refs
,
4993 outgoing_refs
, active_transactions
);
4995 binder_proc_dec_tmpref(proc
);
4998 static void binder_deferred_func(struct work_struct
*work
)
5000 struct binder_proc
*proc
;
5001 struct files_struct
*files
;
5006 mutex_lock(&binder_deferred_lock
);
5007 if (!hlist_empty(&binder_deferred_list
)) {
5008 proc
= hlist_entry(binder_deferred_list
.first
,
5009 struct binder_proc
, deferred_work_node
);
5010 hlist_del_init(&proc
->deferred_work_node
);
5011 defer
= proc
->deferred_work
;
5012 proc
->deferred_work
= 0;
5017 mutex_unlock(&binder_deferred_lock
);
5020 if (defer
& BINDER_DEFERRED_PUT_FILES
) {
5021 mutex_lock(&proc
->files_lock
);
5022 files
= proc
->files
;
5025 mutex_unlock(&proc
->files_lock
);
5028 if (defer
& BINDER_DEFERRED_FLUSH
)
5029 binder_deferred_flush(proc
);
5031 if (defer
& BINDER_DEFERRED_RELEASE
)
5032 binder_deferred_release(proc
); /* frees proc */
5035 put_files_struct(files
);
5038 static DECLARE_WORK(binder_deferred_work
, binder_deferred_func
);
5041 binder_defer_work(struct binder_proc
*proc
, enum binder_deferred_state defer
)
5043 mutex_lock(&binder_deferred_lock
);
5044 proc
->deferred_work
|= defer
;
5045 if (hlist_unhashed(&proc
->deferred_work_node
)) {
5046 hlist_add_head(&proc
->deferred_work_node
,
5047 &binder_deferred_list
);
5048 schedule_work(&binder_deferred_work
);
5050 mutex_unlock(&binder_deferred_lock
);
5053 static void print_binder_transaction_ilocked(struct seq_file
*m
,
5054 struct binder_proc
*proc
,
5056 struct binder_transaction
*t
)
5058 struct binder_proc
*to_proc
;
5059 struct binder_buffer
*buffer
= t
->buffer
;
5061 spin_lock(&t
->lock
);
5062 to_proc
= t
->to_proc
;
5064 "%s %d: %pK from %d:%d to %d:%d code %x flags %x pri %ld r%d",
5065 prefix
, t
->debug_id
, t
,
5066 t
->from
? t
->from
->proc
->pid
: 0,
5067 t
->from
? t
->from
->pid
: 0,
5068 to_proc
? to_proc
->pid
: 0,
5069 t
->to_thread
? t
->to_thread
->pid
: 0,
5070 t
->code
, t
->flags
, t
->priority
, t
->need_reply
);
5071 spin_unlock(&t
->lock
);
5073 if (proc
!= to_proc
) {
5075 * Can only safely deref buffer if we are holding the
5076 * correct proc inner lock for this node
5082 if (buffer
== NULL
) {
5083 seq_puts(m
, " buffer free\n");
5086 if (buffer
->target_node
)
5087 seq_printf(m
, " node %d", buffer
->target_node
->debug_id
);
5088 seq_printf(m
, " size %zd:%zd data %pK\n",
5089 buffer
->data_size
, buffer
->offsets_size
,
5093 static void print_binder_work_ilocked(struct seq_file
*m
,
5094 struct binder_proc
*proc
,
5096 const char *transaction_prefix
,
5097 struct binder_work
*w
)
5099 struct binder_node
*node
;
5100 struct binder_transaction
*t
;
5103 case BINDER_WORK_TRANSACTION
:
5104 t
= container_of(w
, struct binder_transaction
, work
);
5105 print_binder_transaction_ilocked(
5106 m
, proc
, transaction_prefix
, t
);
5108 case BINDER_WORK_RETURN_ERROR
: {
5109 struct binder_error
*e
= container_of(
5110 w
, struct binder_error
, work
);
5112 seq_printf(m
, "%stransaction error: %u\n",
5115 case BINDER_WORK_TRANSACTION_COMPLETE
:
5116 seq_printf(m
, "%stransaction complete\n", prefix
);
5118 case BINDER_WORK_NODE
:
5119 node
= container_of(w
, struct binder_node
, work
);
5120 seq_printf(m
, "%snode work %d: u%016llx c%016llx\n",
5121 prefix
, node
->debug_id
,
5122 (u64
)node
->ptr
, (u64
)node
->cookie
);
5124 case BINDER_WORK_DEAD_BINDER
:
5125 seq_printf(m
, "%shas dead binder\n", prefix
);
5127 case BINDER_WORK_DEAD_BINDER_AND_CLEAR
:
5128 seq_printf(m
, "%shas cleared dead binder\n", prefix
);
5130 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION
:
5131 seq_printf(m
, "%shas cleared death notification\n", prefix
);
5134 seq_printf(m
, "%sunknown work: type %d\n", prefix
, w
->type
);
5139 static void print_binder_thread_ilocked(struct seq_file
*m
,
5140 struct binder_thread
*thread
,
5143 struct binder_transaction
*t
;
5144 struct binder_work
*w
;
5145 size_t start_pos
= m
->count
;
5148 seq_printf(m
, " thread %d: l %02x need_return %d tr %d\n",
5149 thread
->pid
, thread
->looper
,
5150 thread
->looper_need_return
,
5151 atomic_read(&thread
->tmp_ref
));
5152 header_pos
= m
->count
;
5153 t
= thread
->transaction_stack
;
5155 if (t
->from
== thread
) {
5156 print_binder_transaction_ilocked(m
, thread
->proc
,
5157 " outgoing transaction", t
);
5159 } else if (t
->to_thread
== thread
) {
5160 print_binder_transaction_ilocked(m
, thread
->proc
,
5161 " incoming transaction", t
);
5164 print_binder_transaction_ilocked(m
, thread
->proc
,
5165 " bad transaction", t
);
5169 list_for_each_entry(w
, &thread
->todo
, entry
) {
5170 print_binder_work_ilocked(m
, thread
->proc
, " ",
5171 " pending transaction", w
);
5173 if (!print_always
&& m
->count
== header_pos
)
5174 m
->count
= start_pos
;
5177 static void print_binder_node_nilocked(struct seq_file
*m
,
5178 struct binder_node
*node
)
5180 struct binder_ref
*ref
;
5181 struct binder_work
*w
;
5185 hlist_for_each_entry(ref
, &node
->refs
, node_entry
)
5188 seq_printf(m
, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d tr %d",
5189 node
->debug_id
, (u64
)node
->ptr
, (u64
)node
->cookie
,
5190 node
->has_strong_ref
, node
->has_weak_ref
,
5191 node
->local_strong_refs
, node
->local_weak_refs
,
5192 node
->internal_strong_refs
, count
, node
->tmp_refs
);
5194 seq_puts(m
, " proc");
5195 hlist_for_each_entry(ref
, &node
->refs
, node_entry
)
5196 seq_printf(m
, " %d", ref
->proc
->pid
);
5200 list_for_each_entry(w
, &node
->async_todo
, entry
)
5201 print_binder_work_ilocked(m
, node
->proc
, " ",
5202 " pending async transaction", w
);
5206 static void print_binder_ref_olocked(struct seq_file
*m
,
5207 struct binder_ref
*ref
)
5209 binder_node_lock(ref
->node
);
5210 seq_printf(m
, " ref %d: desc %d %snode %d s %d w %d d %pK\n",
5211 ref
->data
.debug_id
, ref
->data
.desc
,
5212 ref
->node
->proc
? "" : "dead ",
5213 ref
->node
->debug_id
, ref
->data
.strong
,
5214 ref
->data
.weak
, ref
->death
);
5215 binder_node_unlock(ref
->node
);
5218 static void print_binder_proc(struct seq_file
*m
,
5219 struct binder_proc
*proc
, int print_all
)
5221 struct binder_work
*w
;
5223 size_t start_pos
= m
->count
;
5225 struct binder_node
*last_node
= NULL
;
5227 seq_printf(m
, "proc %d\n", proc
->pid
);
5228 seq_printf(m
, "context %s\n", proc
->context
->name
);
5229 header_pos
= m
->count
;
5231 binder_inner_proc_lock(proc
);
5232 for (n
= rb_first(&proc
->threads
); n
!= NULL
; n
= rb_next(n
))
5233 print_binder_thread_ilocked(m
, rb_entry(n
, struct binder_thread
,
5234 rb_node
), print_all
);
5236 for (n
= rb_first(&proc
->nodes
); n
!= NULL
; n
= rb_next(n
)) {
5237 struct binder_node
*node
= rb_entry(n
, struct binder_node
,
5240 * take a temporary reference on the node so it
5241 * survives and isn't removed from the tree
5242 * while we print it.
5244 binder_inc_node_tmpref_ilocked(node
);
5245 /* Need to drop inner lock to take node lock */
5246 binder_inner_proc_unlock(proc
);
5248 binder_put_node(last_node
);
5249 binder_node_inner_lock(node
);
5250 print_binder_node_nilocked(m
, node
);
5251 binder_node_inner_unlock(node
);
5253 binder_inner_proc_lock(proc
);
5255 binder_inner_proc_unlock(proc
);
5257 binder_put_node(last_node
);
5260 binder_proc_lock(proc
);
5261 for (n
= rb_first(&proc
->refs_by_desc
);
5264 print_binder_ref_olocked(m
, rb_entry(n
,
5267 binder_proc_unlock(proc
);
5269 binder_alloc_print_allocated(m
, &proc
->alloc
);
5270 binder_inner_proc_lock(proc
);
5271 list_for_each_entry(w
, &proc
->todo
, entry
)
5272 print_binder_work_ilocked(m
, proc
, " ",
5273 " pending transaction", w
);
5274 list_for_each_entry(w
, &proc
->delivered_death
, entry
) {
5275 seq_puts(m
, " has delivered dead binder\n");
5278 binder_inner_proc_unlock(proc
);
5279 if (!print_all
&& m
->count
== header_pos
)
5280 m
->count
= start_pos
;
5283 static const char * const binder_return_strings
[] = {
5288 "BR_ACQUIRE_RESULT",
5290 "BR_TRANSACTION_COMPLETE",
5295 "BR_ATTEMPT_ACQUIRE",
5300 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
5304 static const char * const binder_command_strings
[] = {
5307 "BC_ACQUIRE_RESULT",
5315 "BC_ATTEMPT_ACQUIRE",
5316 "BC_REGISTER_LOOPER",
5319 "BC_REQUEST_DEATH_NOTIFICATION",
5320 "BC_CLEAR_DEATH_NOTIFICATION",
5321 "BC_DEAD_BINDER_DONE",
5322 "BC_TRANSACTION_SG",
5326 static const char * const binder_objstat_strings
[] = {
5333 "transaction_complete"
5336 static void print_binder_stats(struct seq_file
*m
, const char *prefix
,
5337 struct binder_stats
*stats
)
5341 BUILD_BUG_ON(ARRAY_SIZE(stats
->bc
) !=
5342 ARRAY_SIZE(binder_command_strings
));
5343 for (i
= 0; i
< ARRAY_SIZE(stats
->bc
); i
++) {
5344 int temp
= atomic_read(&stats
->bc
[i
]);
5347 seq_printf(m
, "%s%s: %d\n", prefix
,
5348 binder_command_strings
[i
], temp
);
5351 BUILD_BUG_ON(ARRAY_SIZE(stats
->br
) !=
5352 ARRAY_SIZE(binder_return_strings
));
5353 for (i
= 0; i
< ARRAY_SIZE(stats
->br
); i
++) {
5354 int temp
= atomic_read(&stats
->br
[i
]);
5357 seq_printf(m
, "%s%s: %d\n", prefix
,
5358 binder_return_strings
[i
], temp
);
5361 BUILD_BUG_ON(ARRAY_SIZE(stats
->obj_created
) !=
5362 ARRAY_SIZE(binder_objstat_strings
));
5363 BUILD_BUG_ON(ARRAY_SIZE(stats
->obj_created
) !=
5364 ARRAY_SIZE(stats
->obj_deleted
));
5365 for (i
= 0; i
< ARRAY_SIZE(stats
->obj_created
); i
++) {
5366 int created
= atomic_read(&stats
->obj_created
[i
]);
5367 int deleted
= atomic_read(&stats
->obj_deleted
[i
]);
5369 if (created
|| deleted
)
5370 seq_printf(m
, "%s%s: active %d total %d\n",
5372 binder_objstat_strings
[i
],
5378 static void print_binder_proc_stats(struct seq_file
*m
,
5379 struct binder_proc
*proc
)
5381 struct binder_work
*w
;
5382 struct binder_thread
*thread
;
5384 int count
, strong
, weak
, ready_threads
;
5385 size_t free_async_space
=
5386 binder_alloc_get_free_async_space(&proc
->alloc
);
5388 seq_printf(m
, "proc %d\n", proc
->pid
);
5389 seq_printf(m
, "context %s\n", proc
->context
->name
);
5392 binder_inner_proc_lock(proc
);
5393 for (n
= rb_first(&proc
->threads
); n
!= NULL
; n
= rb_next(n
))
5396 list_for_each_entry(thread
, &proc
->waiting_threads
, waiting_thread_node
)
5399 seq_printf(m
, " threads: %d\n", count
);
5400 seq_printf(m
, " requested threads: %d+%d/%d\n"
5401 " ready threads %d\n"
5402 " free async space %zd\n", proc
->requested_threads
,
5403 proc
->requested_threads_started
, proc
->max_threads
,
5407 for (n
= rb_first(&proc
->nodes
); n
!= NULL
; n
= rb_next(n
))
5409 binder_inner_proc_unlock(proc
);
5410 seq_printf(m
, " nodes: %d\n", count
);
5414 binder_proc_lock(proc
);
5415 for (n
= rb_first(&proc
->refs_by_desc
); n
!= NULL
; n
= rb_next(n
)) {
5416 struct binder_ref
*ref
= rb_entry(n
, struct binder_ref
,
5419 strong
+= ref
->data
.strong
;
5420 weak
+= ref
->data
.weak
;
5422 binder_proc_unlock(proc
);
5423 seq_printf(m
, " refs: %d s %d w %d\n", count
, strong
, weak
);
5425 count
= binder_alloc_get_allocated_count(&proc
->alloc
);
5426 seq_printf(m
, " buffers: %d\n", count
);
5428 binder_alloc_print_pages(m
, &proc
->alloc
);
5431 binder_inner_proc_lock(proc
);
5432 list_for_each_entry(w
, &proc
->todo
, entry
) {
5433 if (w
->type
== BINDER_WORK_TRANSACTION
)
5436 binder_inner_proc_unlock(proc
);
5437 seq_printf(m
, " pending transactions: %d\n", count
);
5439 print_binder_stats(m
, " ", &proc
->stats
);
5443 static int binder_state_show(struct seq_file
*m
, void *unused
)
5445 struct binder_proc
*proc
;
5446 struct binder_node
*node
;
5447 struct binder_node
*last_node
= NULL
;
5449 seq_puts(m
, "binder state:\n");
5451 spin_lock(&binder_dead_nodes_lock
);
5452 if (!hlist_empty(&binder_dead_nodes
))
5453 seq_puts(m
, "dead nodes:\n");
5454 hlist_for_each_entry(node
, &binder_dead_nodes
, dead_node
) {
5456 * take a temporary reference on the node so it
5457 * survives and isn't removed from the list
5458 * while we print it.
5461 spin_unlock(&binder_dead_nodes_lock
);
5463 binder_put_node(last_node
);
5464 binder_node_lock(node
);
5465 print_binder_node_nilocked(m
, node
);
5466 binder_node_unlock(node
);
5468 spin_lock(&binder_dead_nodes_lock
);
5470 spin_unlock(&binder_dead_nodes_lock
);
5472 binder_put_node(last_node
);
5474 mutex_lock(&binder_procs_lock
);
5475 hlist_for_each_entry(proc
, &binder_procs
, proc_node
)
5476 print_binder_proc(m
, proc
, 1);
5477 mutex_unlock(&binder_procs_lock
);
5482 static int binder_stats_show(struct seq_file
*m
, void *unused
)
5484 struct binder_proc
*proc
;
5486 seq_puts(m
, "binder stats:\n");
5488 print_binder_stats(m
, "", &binder_stats
);
5490 mutex_lock(&binder_procs_lock
);
5491 hlist_for_each_entry(proc
, &binder_procs
, proc_node
)
5492 print_binder_proc_stats(m
, proc
);
5493 mutex_unlock(&binder_procs_lock
);
5498 static int binder_transactions_show(struct seq_file
*m
, void *unused
)
5500 struct binder_proc
*proc
;
5502 seq_puts(m
, "binder transactions:\n");
5503 mutex_lock(&binder_procs_lock
);
5504 hlist_for_each_entry(proc
, &binder_procs
, proc_node
)
5505 print_binder_proc(m
, proc
, 0);
5506 mutex_unlock(&binder_procs_lock
);
5511 static int binder_proc_show(struct seq_file
*m
, void *unused
)
5513 struct binder_proc
*itr
;
5514 int pid
= (unsigned long)m
->private;
5516 mutex_lock(&binder_procs_lock
);
5517 hlist_for_each_entry(itr
, &binder_procs
, proc_node
) {
5518 if (itr
->pid
== pid
) {
5519 seq_puts(m
, "binder proc state:\n");
5520 print_binder_proc(m
, itr
, 1);
5523 mutex_unlock(&binder_procs_lock
);
5528 static void print_binder_transaction_log_entry(struct seq_file
*m
,
5529 struct binder_transaction_log_entry
*e
)
5531 int debug_id
= READ_ONCE(e
->debug_id_done
);
5533 * read barrier to guarantee debug_id_done read before
5534 * we print the log values
5538 "%d: %s from %d:%d to %d:%d context %s node %d handle %d size %d:%d ret %d/%d l=%d",
5539 e
->debug_id
, (e
->call_type
== 2) ? "reply" :
5540 ((e
->call_type
== 1) ? "async" : "call "), e
->from_proc
,
5541 e
->from_thread
, e
->to_proc
, e
->to_thread
, e
->context_name
,
5542 e
->to_node
, e
->target_handle
, e
->data_size
, e
->offsets_size
,
5543 e
->return_error
, e
->return_error_param
,
5544 e
->return_error_line
);
5546 * read-barrier to guarantee read of debug_id_done after
5547 * done printing the fields of the entry
5550 seq_printf(m
, debug_id
&& debug_id
== READ_ONCE(e
->debug_id_done
) ?
5551 "\n" : " (incomplete)\n");
5554 static int binder_transaction_log_show(struct seq_file
*m
, void *unused
)
5556 struct binder_transaction_log
*log
= m
->private;
5557 unsigned int log_cur
= atomic_read(&log
->cur
);
5562 count
= log_cur
+ 1;
5563 cur
= count
< ARRAY_SIZE(log
->entry
) && !log
->full
?
5564 0 : count
% ARRAY_SIZE(log
->entry
);
5565 if (count
> ARRAY_SIZE(log
->entry
) || log
->full
)
5566 count
= ARRAY_SIZE(log
->entry
);
5567 for (i
= 0; i
< count
; i
++) {
5568 unsigned int index
= cur
++ % ARRAY_SIZE(log
->entry
);
5570 print_binder_transaction_log_entry(m
, &log
->entry
[index
]);
5575 static const struct file_operations binder_fops
= {
5576 .owner
= THIS_MODULE
,
5577 .poll
= binder_poll
,
5578 .unlocked_ioctl
= binder_ioctl
,
5579 .compat_ioctl
= binder_ioctl
,
5580 .mmap
= binder_mmap
,
5581 .open
= binder_open
,
5582 .flush
= binder_flush
,
5583 .release
= binder_release
,
5586 BINDER_DEBUG_ENTRY(state
);
5587 BINDER_DEBUG_ENTRY(stats
);
5588 BINDER_DEBUG_ENTRY(transactions
);
5589 BINDER_DEBUG_ENTRY(transaction_log
);
5591 static int __init
init_binder_device(const char *name
)
5594 struct binder_device
*binder_device
;
5596 binder_device
= kzalloc(sizeof(*binder_device
), GFP_KERNEL
);
5600 binder_device
->miscdev
.fops
= &binder_fops
;
5601 binder_device
->miscdev
.minor
= MISC_DYNAMIC_MINOR
;
5602 binder_device
->miscdev
.name
= name
;
5604 binder_device
->context
.binder_context_mgr_uid
= INVALID_UID
;
5605 binder_device
->context
.name
= name
;
5606 mutex_init(&binder_device
->context
.context_mgr_node_lock
);
5608 ret
= misc_register(&binder_device
->miscdev
);
5610 kfree(binder_device
);
5614 hlist_add_head(&binder_device
->hlist
, &binder_devices
);
5619 static int __init
binder_init(void)
5622 char *device_name
, *device_names
, *device_tmp
;
5623 struct binder_device
*device
;
5624 struct hlist_node
*tmp
;
5626 ret
= binder_alloc_shrinker_init();
5630 atomic_set(&binder_transaction_log
.cur
, ~0U);
5631 atomic_set(&binder_transaction_log_failed
.cur
, ~0U);
5633 binder_debugfs_dir_entry_root
= debugfs_create_dir("binder", NULL
);
5634 if (binder_debugfs_dir_entry_root
)
5635 binder_debugfs_dir_entry_proc
= debugfs_create_dir("proc",
5636 binder_debugfs_dir_entry_root
);
5638 if (binder_debugfs_dir_entry_root
) {
5639 debugfs_create_file("state",
5641 binder_debugfs_dir_entry_root
,
5643 &binder_state_fops
);
5644 debugfs_create_file("stats",
5646 binder_debugfs_dir_entry_root
,
5648 &binder_stats_fops
);
5649 debugfs_create_file("transactions",
5651 binder_debugfs_dir_entry_root
,
5653 &binder_transactions_fops
);
5654 debugfs_create_file("transaction_log",
5656 binder_debugfs_dir_entry_root
,
5657 &binder_transaction_log
,
5658 &binder_transaction_log_fops
);
5659 debugfs_create_file("failed_transaction_log",
5661 binder_debugfs_dir_entry_root
,
5662 &binder_transaction_log_failed
,
5663 &binder_transaction_log_fops
);
5667 * Copy the module_parameter string, because we don't want to
5668 * tokenize it in-place.
5670 device_names
= kzalloc(strlen(binder_devices_param
) + 1, GFP_KERNEL
);
5671 if (!device_names
) {
5673 goto err_alloc_device_names_failed
;
5675 strcpy(device_names
, binder_devices_param
);
5677 device_tmp
= device_names
;
5678 while ((device_name
= strsep(&device_tmp
, ","))) {
5679 ret
= init_binder_device(device_name
);
5681 goto err_init_binder_device_failed
;
5686 err_init_binder_device_failed
:
5687 hlist_for_each_entry_safe(device
, tmp
, &binder_devices
, hlist
) {
5688 misc_deregister(&device
->miscdev
);
5689 hlist_del(&device
->hlist
);
5693 kfree(device_names
);
5695 err_alloc_device_names_failed
:
5696 debugfs_remove_recursive(binder_debugfs_dir_entry_root
);
5701 device_initcall(binder_init
);
5703 #define CREATE_TRACE_POINTS
5704 #include "binder_trace.h"
5706 MODULE_LICENSE("GPL v2");