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 <asm/cacheflush.h>
55 #include <linux/fdtable.h>
56 #include <linux/file.h>
57 #include <linux/freezer.h>
59 #include <linux/list.h>
60 #include <linux/miscdevice.h>
61 #include <linux/module.h>
62 #include <linux/mutex.h>
63 #include <linux/nsproxy.h>
64 #include <linux/poll.h>
65 #include <linux/debugfs.h>
66 #include <linux/rbtree.h>
67 #include <linux/sched/signal.h>
68 #include <linux/sched/mm.h>
69 #include <linux/seq_file.h>
70 #include <linux/uaccess.h>
71 #include <linux/pid_namespace.h>
72 #include <linux/security.h>
73 #include <linux/spinlock.h>
75 #ifdef CONFIG_ANDROID_BINDER_IPC_32BIT
76 #define BINDER_IPC_32BIT 1
79 #include <uapi/linux/android/binder.h>
80 #include "binder_alloc.h"
81 #include "binder_trace.h"
83 static HLIST_HEAD(binder_deferred_list);
84 static DEFINE_MUTEX(binder_deferred_lock);
86 static HLIST_HEAD(binder_devices);
87 static HLIST_HEAD(binder_procs);
88 static DEFINE_MUTEX(binder_procs_lock);
90 static HLIST_HEAD(binder_dead_nodes);
91 static DEFINE_SPINLOCK(binder_dead_nodes_lock);
93 static struct dentry *binder_debugfs_dir_entry_root;
94 static struct dentry *binder_debugfs_dir_entry_proc;
95 static atomic_t binder_last_id;
97 #define BINDER_DEBUG_ENTRY(name) \
98 static int binder_##name##_open(struct inode *inode, struct file *file) \
100 return single_open(file, binder_##name##_show, inode->i_private); \
103 static const struct file_operations binder_##name##_fops = { \
104 .owner = THIS_MODULE, \
105 .open = binder_##name##_open, \
107 .llseek = seq_lseek, \
108 .release = single_release, \
111 static int binder_proc_show(struct seq_file *m, void *unused);
112 BINDER_DEBUG_ENTRY(proc);
114 /* This is only defined in include/asm-arm/sizes.h */
120 #define SZ_4M 0x400000
123 #define FORBIDDEN_MMAP_FLAGS (VM_WRITE)
126 BINDER_DEBUG_USER_ERROR = 1U << 0,
127 BINDER_DEBUG_FAILED_TRANSACTION = 1U << 1,
128 BINDER_DEBUG_DEAD_TRANSACTION = 1U << 2,
129 BINDER_DEBUG_OPEN_CLOSE = 1U << 3,
130 BINDER_DEBUG_DEAD_BINDER = 1U << 4,
131 BINDER_DEBUG_DEATH_NOTIFICATION = 1U << 5,
132 BINDER_DEBUG_READ_WRITE = 1U << 6,
133 BINDER_DEBUG_USER_REFS = 1U << 7,
134 BINDER_DEBUG_THREADS = 1U << 8,
135 BINDER_DEBUG_TRANSACTION = 1U << 9,
136 BINDER_DEBUG_TRANSACTION_COMPLETE = 1U << 10,
137 BINDER_DEBUG_FREE_BUFFER = 1U << 11,
138 BINDER_DEBUG_INTERNAL_REFS = 1U << 12,
139 BINDER_DEBUG_PRIORITY_CAP = 1U << 13,
140 BINDER_DEBUG_SPINLOCKS = 1U << 14,
142 static uint32_t binder_debug_mask = BINDER_DEBUG_USER_ERROR |
143 BINDER_DEBUG_FAILED_TRANSACTION | BINDER_DEBUG_DEAD_TRANSACTION;
144 module_param_named(debug_mask, binder_debug_mask, uint, S_IWUSR | S_IRUGO);
146 static char *binder_devices_param = CONFIG_ANDROID_BINDER_DEVICES;
147 module_param_named(devices, binder_devices_param, charp, 0444);
149 static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait);
150 static int binder_stop_on_user_error;
152 static int binder_set_stop_on_user_error(const char *val,
153 const struct kernel_param *kp)
157 ret = param_set_int(val, kp);
158 if (binder_stop_on_user_error < 2)
159 wake_up(&binder_user_error_wait);
162 module_param_call(stop_on_user_error, binder_set_stop_on_user_error,
163 param_get_int, &binder_stop_on_user_error, S_IWUSR | S_IRUGO);
165 #define binder_debug(mask, x...) \
167 if (binder_debug_mask & mask) \
171 #define binder_user_error(x...) \
173 if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) \
175 if (binder_stop_on_user_error) \
176 binder_stop_on_user_error = 2; \
179 #define to_flat_binder_object(hdr) \
180 container_of(hdr, struct flat_binder_object, hdr)
182 #define to_binder_fd_object(hdr) container_of(hdr, struct binder_fd_object, hdr)
184 #define to_binder_buffer_object(hdr) \
185 container_of(hdr, struct binder_buffer_object, hdr)
187 #define to_binder_fd_array_object(hdr) \
188 container_of(hdr, struct binder_fd_array_object, hdr)
190 enum binder_stat_types {
196 BINDER_STAT_TRANSACTION,
197 BINDER_STAT_TRANSACTION_COMPLETE,
201 struct binder_stats {
202 atomic_t br[_IOC_NR(BR_FAILED_REPLY) + 1];
203 atomic_t bc[_IOC_NR(BC_REPLY_SG) + 1];
204 atomic_t obj_created[BINDER_STAT_COUNT];
205 atomic_t obj_deleted[BINDER_STAT_COUNT];
208 static struct binder_stats binder_stats;
210 static inline void binder_stats_deleted(enum binder_stat_types type)
212 atomic_inc(&binder_stats.obj_deleted[type]);
215 static inline void binder_stats_created(enum binder_stat_types type)
217 atomic_inc(&binder_stats.obj_created[type]);
220 struct binder_transaction_log_entry {
232 int return_error_line;
233 uint32_t return_error;
234 uint32_t return_error_param;
235 const char *context_name;
237 struct binder_transaction_log {
240 struct binder_transaction_log_entry entry[32];
242 static struct binder_transaction_log binder_transaction_log;
243 static struct binder_transaction_log binder_transaction_log_failed;
245 static struct binder_transaction_log_entry *binder_transaction_log_add(
246 struct binder_transaction_log *log)
248 struct binder_transaction_log_entry *e;
249 unsigned int cur = atomic_inc_return(&log->cur);
251 if (cur >= ARRAY_SIZE(log->entry))
253 e = &log->entry[cur % ARRAY_SIZE(log->entry)];
254 WRITE_ONCE(e->debug_id_done, 0);
256 * write-barrier to synchronize access to e->debug_id_done.
257 * We make sure the initialized 0 value is seen before
258 * memset() other fields are zeroed by memset.
261 memset(e, 0, sizeof(*e));
265 struct binder_context {
266 struct binder_node *binder_context_mgr_node;
267 struct mutex context_mgr_node_lock;
269 kuid_t binder_context_mgr_uid;
273 struct binder_device {
274 struct hlist_node hlist;
275 struct miscdevice miscdev;
276 struct binder_context context;
280 * struct binder_work - work enqueued on a worklist
281 * @entry: node enqueued on list
282 * @type: type of work to be performed
284 * There are separate work lists for proc, thread, and node (async).
287 struct list_head entry;
290 BINDER_WORK_TRANSACTION = 1,
291 BINDER_WORK_TRANSACTION_COMPLETE,
292 BINDER_WORK_RETURN_ERROR,
294 BINDER_WORK_DEAD_BINDER,
295 BINDER_WORK_DEAD_BINDER_AND_CLEAR,
296 BINDER_WORK_CLEAR_DEATH_NOTIFICATION,
300 struct binder_error {
301 struct binder_work work;
306 * struct binder_node - binder node bookkeeping
307 * @debug_id: unique ID for debugging
308 * (invariant after initialized)
309 * @lock: lock for node fields
310 * @work: worklist element for node work
311 * (protected by @proc->inner_lock)
312 * @rb_node: element for proc->nodes tree
313 * (protected by @proc->inner_lock)
314 * @dead_node: element for binder_dead_nodes list
315 * (protected by binder_dead_nodes_lock)
316 * @proc: binder_proc that owns this node
317 * (invariant after initialized)
318 * @refs: list of references on this node
319 * (protected by @lock)
320 * @internal_strong_refs: used to take strong references when
321 * initiating a transaction
322 * (protected by @proc->inner_lock if @proc
324 * @local_weak_refs: weak user refs from local process
325 * (protected by @proc->inner_lock if @proc
327 * @local_strong_refs: strong user refs from local process
328 * (protected by @proc->inner_lock if @proc
330 * @tmp_refs: temporary kernel refs
331 * (protected by @proc->inner_lock while @proc
332 * is valid, and by binder_dead_nodes_lock
333 * if @proc is NULL. During inc/dec and node release
334 * it is also protected by @lock to provide safety
335 * as the node dies and @proc becomes NULL)
336 * @ptr: userspace pointer for node
337 * (invariant, no lock needed)
338 * @cookie: userspace cookie for node
339 * (invariant, no lock needed)
340 * @has_strong_ref: userspace notified of strong ref
341 * (protected by @proc->inner_lock if @proc
343 * @pending_strong_ref: userspace has acked notification of strong ref
344 * (protected by @proc->inner_lock if @proc
346 * @has_weak_ref: userspace notified of weak ref
347 * (protected by @proc->inner_lock if @proc
349 * @pending_weak_ref: userspace has acked notification of weak ref
350 * (protected by @proc->inner_lock if @proc
352 * @has_async_transaction: async transaction to node in progress
353 * (protected by @lock)
354 * @accept_fds: file descriptor operations supported for node
355 * (invariant after initialized)
356 * @min_priority: minimum scheduling priority
357 * (invariant after initialized)
358 * @async_todo: list of async work items
359 * (protected by @proc->inner_lock)
361 * Bookkeeping structure for binder nodes.
366 struct binder_work work;
368 struct rb_node rb_node;
369 struct hlist_node dead_node;
371 struct binder_proc *proc;
372 struct hlist_head refs;
373 int internal_strong_refs;
375 int local_strong_refs;
377 binder_uintptr_t ptr;
378 binder_uintptr_t cookie;
381 * bitfield elements protected by
385 u8 pending_strong_ref:1;
387 u8 pending_weak_ref:1;
391 * invariant after initialization
396 bool has_async_transaction;
397 struct list_head async_todo;
400 struct binder_ref_death {
402 * @work: worklist element for death notifications
403 * (protected by inner_lock of the proc that
404 * this ref belongs to)
406 struct binder_work work;
407 binder_uintptr_t cookie;
411 * struct binder_ref_data - binder_ref counts and id
412 * @debug_id: unique ID for the ref
413 * @desc: unique userspace handle for ref
414 * @strong: strong ref count (debugging only if not locked)
415 * @weak: weak ref count (debugging only if not locked)
417 * Structure to hold ref count and ref id information. Since
418 * the actual ref can only be accessed with a lock, this structure
419 * is used to return information about the ref to callers of
420 * ref inc/dec functions.
422 struct binder_ref_data {
430 * struct binder_ref - struct to track references on nodes
431 * @data: binder_ref_data containing id, handle, and current refcounts
432 * @rb_node_desc: node for lookup by @data.desc in proc's rb_tree
433 * @rb_node_node: node for lookup by @node in proc's rb_tree
434 * @node_entry: list entry for node->refs list in target node
435 * (protected by @node->lock)
436 * @proc: binder_proc containing ref
437 * @node: binder_node of target node. When cleaning up a
438 * ref for deletion in binder_cleanup_ref, a non-NULL
439 * @node indicates the node must be freed
440 * @death: pointer to death notification (ref_death) if requested
441 * (protected by @node->lock)
443 * Structure to track references from procA to target node (on procB). This
444 * structure is unsafe to access without holding @proc->outer_lock.
447 /* Lookups needed: */
448 /* node + proc => ref (transaction) */
449 /* desc + proc => ref (transaction, inc/dec ref) */
450 /* node => refs + procs (proc exit) */
451 struct binder_ref_data data;
452 struct rb_node rb_node_desc;
453 struct rb_node rb_node_node;
454 struct hlist_node node_entry;
455 struct binder_proc *proc;
456 struct binder_node *node;
457 struct binder_ref_death *death;
460 enum binder_deferred_state {
461 BINDER_DEFERRED_PUT_FILES = 0x01,
462 BINDER_DEFERRED_FLUSH = 0x02,
463 BINDER_DEFERRED_RELEASE = 0x04,
467 * struct binder_proc - binder process bookkeeping
468 * @proc_node: element for binder_procs list
469 * @threads: rbtree of binder_threads in this proc
470 * (protected by @inner_lock)
471 * @nodes: rbtree of binder nodes associated with
472 * this proc ordered by node->ptr
473 * (protected by @inner_lock)
474 * @refs_by_desc: rbtree of refs ordered by ref->desc
475 * (protected by @outer_lock)
476 * @refs_by_node: rbtree of refs ordered by ref->node
477 * (protected by @outer_lock)
478 * @waiting_threads: threads currently waiting for proc work
479 * (protected by @inner_lock)
480 * @pid PID of group_leader of process
481 * (invariant after initialized)
482 * @tsk task_struct for group_leader of process
483 * (invariant after initialized)
484 * @files files_struct for process
485 * (invariant after initialized)
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 * @wait: wait queue head to wait for proc work
496 * (invariant after initialized)
497 * @stats: per-process binder statistics
498 * (atomics, no lock needed)
499 * @delivered_death: list of delivered death notification
500 * (protected by @inner_lock)
501 * @max_threads: cap on number of binder threads
502 * (protected by @inner_lock)
503 * @requested_threads: number of binder threads requested but not
504 * yet started. In current implementation, can
506 * (protected by @inner_lock)
507 * @requested_threads_started: number binder threads started
508 * (protected by @inner_lock)
509 * @tmp_ref: temporary reference to indicate proc is in use
510 * (protected by @inner_lock)
511 * @default_priority: default scheduler priority
512 * (invariant after initialized)
513 * @debugfs_entry: debugfs node
514 * @alloc: binder allocator bookkeeping
515 * @context: binder_context for this proc
516 * (invariant after initialized)
517 * @inner_lock: can nest under outer_lock and/or node lock
518 * @outer_lock: no nesting under innor or node lock
519 * Lock order: 1) outer, 2) node, 3) inner
521 * Bookkeeping structure for binder processes
524 struct hlist_node proc_node;
525 struct rb_root threads;
526 struct rb_root nodes;
527 struct rb_root refs_by_desc;
528 struct rb_root refs_by_node;
529 struct list_head waiting_threads;
531 struct task_struct *tsk;
532 struct files_struct *files;
533 struct hlist_node deferred_work_node;
537 struct list_head todo;
538 wait_queue_head_t wait;
539 struct binder_stats stats;
540 struct list_head delivered_death;
542 int requested_threads;
543 int requested_threads_started;
545 long default_priority;
546 struct dentry *debugfs_entry;
547 struct binder_alloc alloc;
548 struct binder_context *context;
549 spinlock_t inner_lock;
550 spinlock_t outer_lock;
554 BINDER_LOOPER_STATE_REGISTERED = 0x01,
555 BINDER_LOOPER_STATE_ENTERED = 0x02,
556 BINDER_LOOPER_STATE_EXITED = 0x04,
557 BINDER_LOOPER_STATE_INVALID = 0x08,
558 BINDER_LOOPER_STATE_WAITING = 0x10,
559 BINDER_LOOPER_STATE_POLL = 0x20,
563 * struct binder_thread - binder thread bookkeeping
564 * @proc: binder process for this thread
565 * (invariant after initialization)
566 * @rb_node: element for proc->threads rbtree
567 * (protected by @proc->inner_lock)
568 * @waiting_thread_node: element for @proc->waiting_threads list
569 * (protected by @proc->inner_lock)
570 * @pid: PID for this thread
571 * (invariant after initialization)
572 * @looper: bitmap of looping state
573 * (only accessed by this thread)
574 * @looper_needs_return: looping thread needs to exit driver
576 * @transaction_stack: stack of in-progress transactions for this thread
577 * (protected by @proc->inner_lock)
578 * @todo: list of work to do for this thread
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;
605 struct binder_error return_error;
606 struct binder_error reply_error;
607 wait_queue_head_t wait;
608 struct binder_stats stats;
613 struct binder_transaction {
615 struct binder_work work;
616 struct binder_thread *from;
617 struct binder_transaction *from_parent;
618 struct binder_proc *to_proc;
619 struct binder_thread *to_thread;
620 struct binder_transaction *to_parent;
621 unsigned need_reply:1;
622 /* unsigned is_dead:1; */ /* not used at the moment */
624 struct binder_buffer *buffer;
631 * @lock: protects @from, @to_proc, and @to_thread
633 * @from, @to_proc, and @to_thread can be set to NULL
634 * during thread teardown
640 * binder_proc_lock() - Acquire outer lock for given binder_proc
641 * @proc: struct binder_proc to acquire
643 * Acquires proc->outer_lock. Used to protect binder_ref
644 * structures associated with the given proc.
646 #define binder_proc_lock(proc) _binder_proc_lock(proc, __LINE__)
648 _binder_proc_lock(struct binder_proc *proc, int line)
650 binder_debug(BINDER_DEBUG_SPINLOCKS,
651 "%s: line=%d\n", __func__, line);
652 spin_lock(&proc->outer_lock);
656 * binder_proc_unlock() - Release spinlock for given binder_proc
657 * @proc: struct binder_proc to acquire
659 * Release lock acquired via binder_proc_lock()
661 #define binder_proc_unlock(_proc) _binder_proc_unlock(_proc, __LINE__)
663 _binder_proc_unlock(struct binder_proc *proc, int line)
665 binder_debug(BINDER_DEBUG_SPINLOCKS,
666 "%s: line=%d\n", __func__, line);
667 spin_unlock(&proc->outer_lock);
671 * binder_inner_proc_lock() - Acquire inner lock for given binder_proc
672 * @proc: struct binder_proc to acquire
674 * Acquires proc->inner_lock. Used to protect todo lists
676 #define binder_inner_proc_lock(proc) _binder_inner_proc_lock(proc, __LINE__)
678 _binder_inner_proc_lock(struct binder_proc *proc, int line)
680 binder_debug(BINDER_DEBUG_SPINLOCKS,
681 "%s: line=%d\n", __func__, line);
682 spin_lock(&proc->inner_lock);
686 * binder_inner_proc_unlock() - Release inner lock for given binder_proc
687 * @proc: struct binder_proc to acquire
689 * Release lock acquired via binder_inner_proc_lock()
691 #define binder_inner_proc_unlock(proc) _binder_inner_proc_unlock(proc, __LINE__)
693 _binder_inner_proc_unlock(struct binder_proc *proc, int line)
695 binder_debug(BINDER_DEBUG_SPINLOCKS,
696 "%s: line=%d\n", __func__, line);
697 spin_unlock(&proc->inner_lock);
701 * binder_node_lock() - Acquire spinlock for given binder_node
702 * @node: struct binder_node to acquire
704 * Acquires node->lock. Used to protect binder_node fields
706 #define binder_node_lock(node) _binder_node_lock(node, __LINE__)
708 _binder_node_lock(struct binder_node *node, int line)
710 binder_debug(BINDER_DEBUG_SPINLOCKS,
711 "%s: line=%d\n", __func__, line);
712 spin_lock(&node->lock);
716 * binder_node_unlock() - Release spinlock for given binder_proc
717 * @node: struct binder_node to acquire
719 * Release lock acquired via binder_node_lock()
721 #define binder_node_unlock(node) _binder_node_unlock(node, __LINE__)
723 _binder_node_unlock(struct binder_node *node, int line)
725 binder_debug(BINDER_DEBUG_SPINLOCKS,
726 "%s: line=%d\n", __func__, line);
727 spin_unlock(&node->lock);
731 * binder_node_inner_lock() - Acquire node and inner locks
732 * @node: struct binder_node to acquire
734 * Acquires node->lock. If node->proc also acquires
735 * proc->inner_lock. Used to protect binder_node fields
737 #define binder_node_inner_lock(node) _binder_node_inner_lock(node, __LINE__)
739 _binder_node_inner_lock(struct binder_node *node, int line)
741 binder_debug(BINDER_DEBUG_SPINLOCKS,
742 "%s: line=%d\n", __func__, line);
743 spin_lock(&node->lock);
745 binder_inner_proc_lock(node->proc);
749 * binder_node_unlock() - Release node and inner locks
750 * @node: struct binder_node to acquire
752 * Release lock acquired via binder_node_lock()
754 #define binder_node_inner_unlock(node) _binder_node_inner_unlock(node, __LINE__)
756 _binder_node_inner_unlock(struct binder_node *node, int line)
758 struct binder_proc *proc = node->proc;
760 binder_debug(BINDER_DEBUG_SPINLOCKS,
761 "%s: line=%d\n", __func__, line);
763 binder_inner_proc_unlock(proc);
764 spin_unlock(&node->lock);
767 static bool binder_worklist_empty_ilocked(struct list_head *list)
769 return list_empty(list);
773 * binder_worklist_empty() - Check if no items on the work list
774 * @proc: binder_proc associated with list
775 * @list: list to check
777 * Return: true if there are no items on list, else false
779 static bool binder_worklist_empty(struct binder_proc *proc,
780 struct list_head *list)
784 binder_inner_proc_lock(proc);
785 ret = binder_worklist_empty_ilocked(list);
786 binder_inner_proc_unlock(proc);
791 binder_enqueue_work_ilocked(struct binder_work *work,
792 struct list_head *target_list)
794 BUG_ON(target_list == NULL);
795 BUG_ON(work->entry.next && !list_empty(&work->entry));
796 list_add_tail(&work->entry, target_list);
800 * binder_enqueue_work() - Add an item to the work list
801 * @proc: binder_proc associated with list
802 * @work: struct binder_work to add to list
803 * @target_list: list to add work to
805 * Adds the work to the specified list. Asserts that work
806 * is not already on a list.
809 binder_enqueue_work(struct binder_proc *proc,
810 struct binder_work *work,
811 struct list_head *target_list)
813 binder_inner_proc_lock(proc);
814 binder_enqueue_work_ilocked(work, target_list);
815 binder_inner_proc_unlock(proc);
819 binder_dequeue_work_ilocked(struct binder_work *work)
821 list_del_init(&work->entry);
825 * binder_dequeue_work() - Removes an item from the work list
826 * @proc: binder_proc associated with list
827 * @work: struct binder_work to remove from list
829 * Removes the specified work item from whatever list it is on.
830 * Can safely be called if work is not on any list.
833 binder_dequeue_work(struct binder_proc *proc, struct binder_work *work)
835 binder_inner_proc_lock(proc);
836 binder_dequeue_work_ilocked(work);
837 binder_inner_proc_unlock(proc);
840 static struct binder_work *binder_dequeue_work_head_ilocked(
841 struct list_head *list)
843 struct binder_work *w;
845 w = list_first_entry_or_null(list, struct binder_work, entry);
847 list_del_init(&w->entry);
852 * binder_dequeue_work_head() - Dequeues the item at head of list
853 * @proc: binder_proc associated with list
854 * @list: list to dequeue head
856 * Removes the head of the list if there are items on the list
858 * Return: pointer dequeued binder_work, NULL if list was empty
860 static struct binder_work *binder_dequeue_work_head(
861 struct binder_proc *proc,
862 struct list_head *list)
864 struct binder_work *w;
866 binder_inner_proc_lock(proc);
867 w = binder_dequeue_work_head_ilocked(list);
868 binder_inner_proc_unlock(proc);
873 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer);
874 static void binder_free_thread(struct binder_thread *thread);
875 static void binder_free_proc(struct binder_proc *proc);
876 static void binder_inc_node_tmpref_ilocked(struct binder_node *node);
878 static int task_get_unused_fd_flags(struct binder_proc *proc, int flags)
880 struct files_struct *files = proc->files;
881 unsigned long rlim_cur;
887 if (!lock_task_sighand(proc->tsk, &irqs))
890 rlim_cur = task_rlimit(proc->tsk, RLIMIT_NOFILE);
891 unlock_task_sighand(proc->tsk, &irqs);
893 return __alloc_fd(files, 0, rlim_cur, flags);
897 * copied from fd_install
899 static void task_fd_install(
900 struct binder_proc *proc, unsigned int fd, struct file *file)
903 __fd_install(proc->files, fd, file);
907 * copied from sys_close
909 static long task_close_fd(struct binder_proc *proc, unsigned int fd)
913 if (proc->files == NULL)
916 retval = __close_fd(proc->files, fd);
917 /* can't restart close syscall because file table entry was cleared */
918 if (unlikely(retval == -ERESTARTSYS ||
919 retval == -ERESTARTNOINTR ||
920 retval == -ERESTARTNOHAND ||
921 retval == -ERESTART_RESTARTBLOCK))
927 static bool binder_has_work_ilocked(struct binder_thread *thread,
930 return !binder_worklist_empty_ilocked(&thread->todo) ||
931 thread->looper_need_return ||
933 !binder_worklist_empty_ilocked(&thread->proc->todo));
936 static bool binder_has_work(struct binder_thread *thread, bool do_proc_work)
940 binder_inner_proc_lock(thread->proc);
941 has_work = binder_has_work_ilocked(thread, do_proc_work);
942 binder_inner_proc_unlock(thread->proc);
947 static bool binder_available_for_proc_work_ilocked(struct binder_thread *thread)
949 return !thread->transaction_stack &&
950 binder_worklist_empty_ilocked(&thread->todo) &&
951 (thread->looper & (BINDER_LOOPER_STATE_ENTERED |
952 BINDER_LOOPER_STATE_REGISTERED));
955 static void binder_wakeup_poll_threads_ilocked(struct binder_proc *proc,
959 struct binder_thread *thread;
961 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
962 thread = rb_entry(n, struct binder_thread, rb_node);
963 if (thread->looper & BINDER_LOOPER_STATE_POLL &&
964 binder_available_for_proc_work_ilocked(thread)) {
966 wake_up_interruptible_sync(&thread->wait);
968 wake_up_interruptible(&thread->wait);
974 * binder_select_thread_ilocked() - selects a thread for doing proc work.
975 * @proc: process to select a thread from
977 * Note that calling this function moves the thread off the waiting_threads
978 * list, so it can only be woken up by the caller of this function, or a
979 * signal. Therefore, callers *should* always wake up the thread this function
982 * Return: If there's a thread currently waiting for process work,
983 * returns that thread. Otherwise returns NULL.
985 static struct binder_thread *
986 binder_select_thread_ilocked(struct binder_proc *proc)
988 struct binder_thread *thread;
990 assert_spin_locked(&proc->inner_lock);
991 thread = list_first_entry_or_null(&proc->waiting_threads,
992 struct binder_thread,
993 waiting_thread_node);
996 list_del_init(&thread->waiting_thread_node);
1002 * binder_wakeup_thread_ilocked() - wakes up a thread for doing proc work.
1003 * @proc: process to wake up a thread in
1004 * @thread: specific thread to wake-up (may be NULL)
1005 * @sync: whether to do a synchronous wake-up
1007 * This function wakes up a thread in the @proc process.
1008 * The caller may provide a specific thread to wake-up in
1009 * the @thread parameter. If @thread is NULL, this function
1010 * will wake up threads that have called poll().
1012 * Note that for this function to work as expected, callers
1013 * should first call binder_select_thread() to find a thread
1014 * to handle the work (if they don't have a thread already),
1015 * and pass the result into the @thread parameter.
1017 static void binder_wakeup_thread_ilocked(struct binder_proc *proc,
1018 struct binder_thread *thread,
1021 assert_spin_locked(&proc->inner_lock);
1025 wake_up_interruptible_sync(&thread->wait);
1027 wake_up_interruptible(&thread->wait);
1031 /* Didn't find a thread waiting for proc work; this can happen
1033 * 1. All threads are busy handling transactions
1034 * In that case, one of those threads should call back into
1035 * the kernel driver soon and pick up this work.
1036 * 2. Threads are using the (e)poll interface, in which case
1037 * they may be blocked on the waitqueue without having been
1038 * added to waiting_threads. For this case, we just iterate
1039 * over all threads not handling transaction work, and
1040 * wake them all up. We wake all because we don't know whether
1041 * a thread that called into (e)poll is handling non-binder
1044 binder_wakeup_poll_threads_ilocked(proc, sync);
1047 static void binder_wakeup_proc_ilocked(struct binder_proc *proc)
1049 struct binder_thread *thread = binder_select_thread_ilocked(proc);
1051 binder_wakeup_thread_ilocked(proc, thread, /* sync = */false);
1054 static void binder_set_nice(long nice)
1058 if (can_nice(current, nice)) {
1059 set_user_nice(current, nice);
1062 min_nice = rlimit_to_nice(rlimit(RLIMIT_NICE));
1063 binder_debug(BINDER_DEBUG_PRIORITY_CAP,
1064 "%d: nice value %ld not allowed use %ld instead\n",
1065 current->pid, nice, min_nice);
1066 set_user_nice(current, min_nice);
1067 if (min_nice <= MAX_NICE)
1069 binder_user_error("%d RLIMIT_NICE not set\n", current->pid);
1072 static struct binder_node *binder_get_node_ilocked(struct binder_proc *proc,
1073 binder_uintptr_t ptr)
1075 struct rb_node *n = proc->nodes.rb_node;
1076 struct binder_node *node;
1078 assert_spin_locked(&proc->inner_lock);
1081 node = rb_entry(n, struct binder_node, rb_node);
1083 if (ptr < node->ptr)
1085 else if (ptr > node->ptr)
1089 * take an implicit weak reference
1090 * to ensure node stays alive until
1091 * call to binder_put_node()
1093 binder_inc_node_tmpref_ilocked(node);
1100 static struct binder_node *binder_get_node(struct binder_proc *proc,
1101 binder_uintptr_t ptr)
1103 struct binder_node *node;
1105 binder_inner_proc_lock(proc);
1106 node = binder_get_node_ilocked(proc, ptr);
1107 binder_inner_proc_unlock(proc);
1111 static struct binder_node *binder_init_node_ilocked(
1112 struct binder_proc *proc,
1113 struct binder_node *new_node,
1114 struct flat_binder_object *fp)
1116 struct rb_node **p = &proc->nodes.rb_node;
1117 struct rb_node *parent = NULL;
1118 struct binder_node *node;
1119 binder_uintptr_t ptr = fp ? fp->binder : 0;
1120 binder_uintptr_t cookie = fp ? fp->cookie : 0;
1121 __u32 flags = fp ? fp->flags : 0;
1123 assert_spin_locked(&proc->inner_lock);
1128 node = rb_entry(parent, struct binder_node, rb_node);
1130 if (ptr < node->ptr)
1132 else if (ptr > node->ptr)
1133 p = &(*p)->rb_right;
1136 * A matching node is already in
1137 * the rb tree. Abandon the init
1140 binder_inc_node_tmpref_ilocked(node);
1145 binder_stats_created(BINDER_STAT_NODE);
1147 rb_link_node(&node->rb_node, parent, p);
1148 rb_insert_color(&node->rb_node, &proc->nodes);
1149 node->debug_id = atomic_inc_return(&binder_last_id);
1152 node->cookie = cookie;
1153 node->work.type = BINDER_WORK_NODE;
1154 node->min_priority = flags & FLAT_BINDER_FLAG_PRIORITY_MASK;
1155 node->accept_fds = !!(flags & FLAT_BINDER_FLAG_ACCEPTS_FDS);
1156 spin_lock_init(&node->lock);
1157 INIT_LIST_HEAD(&node->work.entry);
1158 INIT_LIST_HEAD(&node->async_todo);
1159 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1160 "%d:%d node %d u%016llx c%016llx created\n",
1161 proc->pid, current->pid, node->debug_id,
1162 (u64)node->ptr, (u64)node->cookie);
1167 static struct binder_node *binder_new_node(struct binder_proc *proc,
1168 struct flat_binder_object *fp)
1170 struct binder_node *node;
1171 struct binder_node *new_node = kzalloc(sizeof(*node), GFP_KERNEL);
1175 binder_inner_proc_lock(proc);
1176 node = binder_init_node_ilocked(proc, new_node, fp);
1177 binder_inner_proc_unlock(proc);
1178 if (node != new_node)
1180 * The node was already added by another thread
1187 static void binder_free_node(struct binder_node *node)
1190 binder_stats_deleted(BINDER_STAT_NODE);
1193 static int binder_inc_node_nilocked(struct binder_node *node, int strong,
1195 struct list_head *target_list)
1197 struct binder_proc *proc = node->proc;
1199 assert_spin_locked(&node->lock);
1201 assert_spin_locked(&proc->inner_lock);
1204 if (target_list == NULL &&
1205 node->internal_strong_refs == 0 &&
1207 node == node->proc->context->binder_context_mgr_node &&
1208 node->has_strong_ref)) {
1209 pr_err("invalid inc strong node for %d\n",
1213 node->internal_strong_refs++;
1215 node->local_strong_refs++;
1216 if (!node->has_strong_ref && target_list) {
1217 binder_dequeue_work_ilocked(&node->work);
1218 binder_enqueue_work_ilocked(&node->work, target_list);
1222 node->local_weak_refs++;
1223 if (!node->has_weak_ref && list_empty(&node->work.entry)) {
1224 if (target_list == NULL) {
1225 pr_err("invalid inc weak node for %d\n",
1229 binder_enqueue_work_ilocked(&node->work, target_list);
1235 static int binder_inc_node(struct binder_node *node, int strong, int internal,
1236 struct list_head *target_list)
1240 binder_node_inner_lock(node);
1241 ret = binder_inc_node_nilocked(node, strong, internal, target_list);
1242 binder_node_inner_unlock(node);
1247 static bool binder_dec_node_nilocked(struct binder_node *node,
1248 int strong, int internal)
1250 struct binder_proc *proc = node->proc;
1252 assert_spin_locked(&node->lock);
1254 assert_spin_locked(&proc->inner_lock);
1257 node->internal_strong_refs--;
1259 node->local_strong_refs--;
1260 if (node->local_strong_refs || node->internal_strong_refs)
1264 node->local_weak_refs--;
1265 if (node->local_weak_refs || node->tmp_refs ||
1266 !hlist_empty(&node->refs))
1270 if (proc && (node->has_strong_ref || node->has_weak_ref)) {
1271 if (list_empty(&node->work.entry)) {
1272 binder_enqueue_work_ilocked(&node->work, &proc->todo);
1273 binder_wakeup_proc_ilocked(proc);
1276 if (hlist_empty(&node->refs) && !node->local_strong_refs &&
1277 !node->local_weak_refs && !node->tmp_refs) {
1279 binder_dequeue_work_ilocked(&node->work);
1280 rb_erase(&node->rb_node, &proc->nodes);
1281 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1282 "refless node %d deleted\n",
1285 BUG_ON(!list_empty(&node->work.entry));
1286 spin_lock(&binder_dead_nodes_lock);
1288 * tmp_refs could have changed so
1291 if (node->tmp_refs) {
1292 spin_unlock(&binder_dead_nodes_lock);
1295 hlist_del(&node->dead_node);
1296 spin_unlock(&binder_dead_nodes_lock);
1297 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1298 "dead node %d deleted\n",
1307 static void binder_dec_node(struct binder_node *node, int strong, int internal)
1311 binder_node_inner_lock(node);
1312 free_node = binder_dec_node_nilocked(node, strong, internal);
1313 binder_node_inner_unlock(node);
1315 binder_free_node(node);
1318 static void binder_inc_node_tmpref_ilocked(struct binder_node *node)
1321 * No call to binder_inc_node() is needed since we
1322 * don't need to inform userspace of any changes to
1329 * binder_inc_node_tmpref() - take a temporary reference on node
1330 * @node: node to reference
1332 * Take reference on node to prevent the node from being freed
1333 * while referenced only by a local variable. The inner lock is
1334 * needed to serialize with the node work on the queue (which
1335 * isn't needed after the node is dead). If the node is dead
1336 * (node->proc is NULL), use binder_dead_nodes_lock to protect
1337 * node->tmp_refs against dead-node-only cases where the node
1338 * lock cannot be acquired (eg traversing the dead node list to
1341 static void binder_inc_node_tmpref(struct binder_node *node)
1343 binder_node_lock(node);
1345 binder_inner_proc_lock(node->proc);
1347 spin_lock(&binder_dead_nodes_lock);
1348 binder_inc_node_tmpref_ilocked(node);
1350 binder_inner_proc_unlock(node->proc);
1352 spin_unlock(&binder_dead_nodes_lock);
1353 binder_node_unlock(node);
1357 * binder_dec_node_tmpref() - remove a temporary reference on node
1358 * @node: node to reference
1360 * Release temporary reference on node taken via binder_inc_node_tmpref()
1362 static void binder_dec_node_tmpref(struct binder_node *node)
1366 binder_node_inner_lock(node);
1368 spin_lock(&binder_dead_nodes_lock);
1370 BUG_ON(node->tmp_refs < 0);
1372 spin_unlock(&binder_dead_nodes_lock);
1374 * Call binder_dec_node() to check if all refcounts are 0
1375 * and cleanup is needed. Calling with strong=0 and internal=1
1376 * causes no actual reference to be released in binder_dec_node().
1377 * If that changes, a change is needed here too.
1379 free_node = binder_dec_node_nilocked(node, 0, 1);
1380 binder_node_inner_unlock(node);
1382 binder_free_node(node);
1385 static void binder_put_node(struct binder_node *node)
1387 binder_dec_node_tmpref(node);
1390 static struct binder_ref *binder_get_ref_olocked(struct binder_proc *proc,
1391 u32 desc, bool need_strong_ref)
1393 struct rb_node *n = proc->refs_by_desc.rb_node;
1394 struct binder_ref *ref;
1397 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1399 if (desc < ref->data.desc) {
1401 } else if (desc > ref->data.desc) {
1403 } else if (need_strong_ref && !ref->data.strong) {
1404 binder_user_error("tried to use weak ref as strong ref\n");
1414 * binder_get_ref_for_node_olocked() - get the ref associated with given node
1415 * @proc: binder_proc that owns the ref
1416 * @node: binder_node of target
1417 * @new_ref: newly allocated binder_ref to be initialized or %NULL
1419 * Look up the ref for the given node and return it if it exists
1421 * If it doesn't exist and the caller provides a newly allocated
1422 * ref, initialize the fields of the newly allocated ref and insert
1423 * into the given proc rb_trees and node refs list.
1425 * Return: the ref for node. It is possible that another thread
1426 * allocated/initialized the ref first in which case the
1427 * returned ref would be different than the passed-in
1428 * new_ref. new_ref must be kfree'd by the caller in
1431 static struct binder_ref *binder_get_ref_for_node_olocked(
1432 struct binder_proc *proc,
1433 struct binder_node *node,
1434 struct binder_ref *new_ref)
1436 struct binder_context *context = proc->context;
1437 struct rb_node **p = &proc->refs_by_node.rb_node;
1438 struct rb_node *parent = NULL;
1439 struct binder_ref *ref;
1444 ref = rb_entry(parent, struct binder_ref, rb_node_node);
1446 if (node < ref->node)
1448 else if (node > ref->node)
1449 p = &(*p)->rb_right;
1456 binder_stats_created(BINDER_STAT_REF);
1457 new_ref->data.debug_id = atomic_inc_return(&binder_last_id);
1458 new_ref->proc = proc;
1459 new_ref->node = node;
1460 rb_link_node(&new_ref->rb_node_node, parent, p);
1461 rb_insert_color(&new_ref->rb_node_node, &proc->refs_by_node);
1463 new_ref->data.desc = (node == context->binder_context_mgr_node) ? 0 : 1;
1464 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
1465 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1466 if (ref->data.desc > new_ref->data.desc)
1468 new_ref->data.desc = ref->data.desc + 1;
1471 p = &proc->refs_by_desc.rb_node;
1474 ref = rb_entry(parent, struct binder_ref, rb_node_desc);
1476 if (new_ref->data.desc < ref->data.desc)
1478 else if (new_ref->data.desc > ref->data.desc)
1479 p = &(*p)->rb_right;
1483 rb_link_node(&new_ref->rb_node_desc, parent, p);
1484 rb_insert_color(&new_ref->rb_node_desc, &proc->refs_by_desc);
1486 binder_node_lock(node);
1487 hlist_add_head(&new_ref->node_entry, &node->refs);
1489 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1490 "%d new ref %d desc %d for node %d\n",
1491 proc->pid, new_ref->data.debug_id, new_ref->data.desc,
1493 binder_node_unlock(node);
1497 static void binder_cleanup_ref_olocked(struct binder_ref *ref)
1499 bool delete_node = false;
1501 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1502 "%d delete ref %d desc %d for node %d\n",
1503 ref->proc->pid, ref->data.debug_id, ref->data.desc,
1504 ref->node->debug_id);
1506 rb_erase(&ref->rb_node_desc, &ref->proc->refs_by_desc);
1507 rb_erase(&ref->rb_node_node, &ref->proc->refs_by_node);
1509 binder_node_inner_lock(ref->node);
1510 if (ref->data.strong)
1511 binder_dec_node_nilocked(ref->node, 1, 1);
1513 hlist_del(&ref->node_entry);
1514 delete_node = binder_dec_node_nilocked(ref->node, 0, 1);
1515 binder_node_inner_unlock(ref->node);
1517 * Clear ref->node unless we want the caller to free the node
1521 * The caller uses ref->node to determine
1522 * whether the node needs to be freed. Clear
1523 * it since the node is still alive.
1529 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1530 "%d delete ref %d desc %d has death notification\n",
1531 ref->proc->pid, ref->data.debug_id,
1533 binder_dequeue_work(ref->proc, &ref->death->work);
1534 binder_stats_deleted(BINDER_STAT_DEATH);
1536 binder_stats_deleted(BINDER_STAT_REF);
1540 * binder_inc_ref_olocked() - increment the ref for given handle
1541 * @ref: ref to be incremented
1542 * @strong: if true, strong increment, else weak
1543 * @target_list: list to queue node work on
1545 * Increment the ref. @ref->proc->outer_lock must be held on entry
1547 * Return: 0, if successful, else errno
1549 static int binder_inc_ref_olocked(struct binder_ref *ref, int strong,
1550 struct list_head *target_list)
1555 if (ref->data.strong == 0) {
1556 ret = binder_inc_node(ref->node, 1, 1, target_list);
1562 if (ref->data.weak == 0) {
1563 ret = binder_inc_node(ref->node, 0, 1, target_list);
1573 * binder_dec_ref() - dec the ref for given handle
1574 * @ref: ref to be decremented
1575 * @strong: if true, strong decrement, else weak
1577 * Decrement the ref.
1579 * Return: true if ref is cleaned up and ready to be freed
1581 static bool binder_dec_ref_olocked(struct binder_ref *ref, int strong)
1584 if (ref->data.strong == 0) {
1585 binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n",
1586 ref->proc->pid, ref->data.debug_id,
1587 ref->data.desc, ref->data.strong,
1592 if (ref->data.strong == 0)
1593 binder_dec_node(ref->node, strong, 1);
1595 if (ref->data.weak == 0) {
1596 binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n",
1597 ref->proc->pid, ref->data.debug_id,
1598 ref->data.desc, ref->data.strong,
1604 if (ref->data.strong == 0 && ref->data.weak == 0) {
1605 binder_cleanup_ref_olocked(ref);
1612 * binder_get_node_from_ref() - get the node from the given proc/desc
1613 * @proc: proc containing the ref
1614 * @desc: the handle associated with the ref
1615 * @need_strong_ref: if true, only return node if ref is strong
1616 * @rdata: the id/refcount data for the ref
1618 * Given a proc and ref handle, return the associated binder_node
1620 * Return: a binder_node or NULL if not found or not strong when strong required
1622 static struct binder_node *binder_get_node_from_ref(
1623 struct binder_proc *proc,
1624 u32 desc, bool need_strong_ref,
1625 struct binder_ref_data *rdata)
1627 struct binder_node *node;
1628 struct binder_ref *ref;
1630 binder_proc_lock(proc);
1631 ref = binder_get_ref_olocked(proc, desc, need_strong_ref);
1636 * Take an implicit reference on the node to ensure
1637 * it stays alive until the call to binder_put_node()
1639 binder_inc_node_tmpref(node);
1642 binder_proc_unlock(proc);
1647 binder_proc_unlock(proc);
1652 * binder_free_ref() - free the binder_ref
1655 * Free the binder_ref. Free the binder_node indicated by ref->node
1656 * (if non-NULL) and the binder_ref_death indicated by ref->death.
1658 static void binder_free_ref(struct binder_ref *ref)
1661 binder_free_node(ref->node);
1667 * binder_update_ref_for_handle() - inc/dec the ref for given handle
1668 * @proc: proc containing the ref
1669 * @desc: the handle associated with the ref
1670 * @increment: true=inc reference, false=dec reference
1671 * @strong: true=strong reference, false=weak reference
1672 * @rdata: the id/refcount data for the ref
1674 * Given a proc and ref handle, increment or decrement the ref
1675 * according to "increment" arg.
1677 * Return: 0 if successful, else errno
1679 static int binder_update_ref_for_handle(struct binder_proc *proc,
1680 uint32_t desc, bool increment, bool strong,
1681 struct binder_ref_data *rdata)
1684 struct binder_ref *ref;
1685 bool delete_ref = false;
1687 binder_proc_lock(proc);
1688 ref = binder_get_ref_olocked(proc, desc, strong);
1694 ret = binder_inc_ref_olocked(ref, strong, NULL);
1696 delete_ref = binder_dec_ref_olocked(ref, strong);
1700 binder_proc_unlock(proc);
1703 binder_free_ref(ref);
1707 binder_proc_unlock(proc);
1712 * binder_dec_ref_for_handle() - dec the ref for given handle
1713 * @proc: proc containing the ref
1714 * @desc: the handle associated with the ref
1715 * @strong: true=strong reference, false=weak reference
1716 * @rdata: the id/refcount data for the ref
1718 * Just calls binder_update_ref_for_handle() to decrement the ref.
1720 * Return: 0 if successful, else errno
1722 static int binder_dec_ref_for_handle(struct binder_proc *proc,
1723 uint32_t desc, bool strong, struct binder_ref_data *rdata)
1725 return binder_update_ref_for_handle(proc, desc, false, strong, rdata);
1730 * binder_inc_ref_for_node() - increment the ref for given proc/node
1731 * @proc: proc containing the ref
1732 * @node: target node
1733 * @strong: true=strong reference, false=weak reference
1734 * @target_list: worklist to use if node is incremented
1735 * @rdata: the id/refcount data for the ref
1737 * Given a proc and node, increment the ref. Create the ref if it
1738 * doesn't already exist
1740 * Return: 0 if successful, else errno
1742 static int binder_inc_ref_for_node(struct binder_proc *proc,
1743 struct binder_node *node,
1745 struct list_head *target_list,
1746 struct binder_ref_data *rdata)
1748 struct binder_ref *ref;
1749 struct binder_ref *new_ref = NULL;
1752 binder_proc_lock(proc);
1753 ref = binder_get_ref_for_node_olocked(proc, node, NULL);
1755 binder_proc_unlock(proc);
1756 new_ref = kzalloc(sizeof(*ref), GFP_KERNEL);
1759 binder_proc_lock(proc);
1760 ref = binder_get_ref_for_node_olocked(proc, node, new_ref);
1762 ret = binder_inc_ref_olocked(ref, strong, target_list);
1764 binder_proc_unlock(proc);
1765 if (new_ref && ref != new_ref)
1767 * Another thread created the ref first so
1768 * free the one we allocated
1774 static void binder_pop_transaction_ilocked(struct binder_thread *target_thread,
1775 struct binder_transaction *t)
1777 BUG_ON(!target_thread);
1778 assert_spin_locked(&target_thread->proc->inner_lock);
1779 BUG_ON(target_thread->transaction_stack != t);
1780 BUG_ON(target_thread->transaction_stack->from != target_thread);
1781 target_thread->transaction_stack =
1782 target_thread->transaction_stack->from_parent;
1787 * binder_thread_dec_tmpref() - decrement thread->tmp_ref
1788 * @thread: thread to decrement
1790 * A thread needs to be kept alive while being used to create or
1791 * handle a transaction. binder_get_txn_from() is used to safely
1792 * extract t->from from a binder_transaction and keep the thread
1793 * indicated by t->from from being freed. When done with that
1794 * binder_thread, this function is called to decrement the
1795 * tmp_ref and free if appropriate (thread has been released
1796 * and no transaction being processed by the driver)
1798 static void binder_thread_dec_tmpref(struct binder_thread *thread)
1801 * atomic is used to protect the counter value while
1802 * it cannot reach zero or thread->is_dead is false
1804 binder_inner_proc_lock(thread->proc);
1805 atomic_dec(&thread->tmp_ref);
1806 if (thread->is_dead && !atomic_read(&thread->tmp_ref)) {
1807 binder_inner_proc_unlock(thread->proc);
1808 binder_free_thread(thread);
1811 binder_inner_proc_unlock(thread->proc);
1815 * binder_proc_dec_tmpref() - decrement proc->tmp_ref
1816 * @proc: proc to decrement
1818 * A binder_proc needs to be kept alive while being used to create or
1819 * handle a transaction. proc->tmp_ref is incremented when
1820 * creating a new transaction or the binder_proc is currently in-use
1821 * by threads that are being released. When done with the binder_proc,
1822 * this function is called to decrement the counter and free the
1823 * proc if appropriate (proc has been released, all threads have
1824 * been released and not currenly in-use to process a transaction).
1826 static void binder_proc_dec_tmpref(struct binder_proc *proc)
1828 binder_inner_proc_lock(proc);
1830 if (proc->is_dead && RB_EMPTY_ROOT(&proc->threads) &&
1832 binder_inner_proc_unlock(proc);
1833 binder_free_proc(proc);
1836 binder_inner_proc_unlock(proc);
1840 * binder_get_txn_from() - safely extract the "from" thread in transaction
1841 * @t: binder transaction for t->from
1843 * Atomically return the "from" thread and increment the tmp_ref
1844 * count for the thread to ensure it stays alive until
1845 * binder_thread_dec_tmpref() is called.
1847 * Return: the value of t->from
1849 static struct binder_thread *binder_get_txn_from(
1850 struct binder_transaction *t)
1852 struct binder_thread *from;
1854 spin_lock(&t->lock);
1857 atomic_inc(&from->tmp_ref);
1858 spin_unlock(&t->lock);
1863 * binder_get_txn_from_and_acq_inner() - get t->from and acquire inner lock
1864 * @t: binder transaction for t->from
1866 * Same as binder_get_txn_from() except it also acquires the proc->inner_lock
1867 * to guarantee that the thread cannot be released while operating on it.
1868 * The caller must call binder_inner_proc_unlock() to release the inner lock
1869 * as well as call binder_dec_thread_txn() to release the reference.
1871 * Return: the value of t->from
1873 static struct binder_thread *binder_get_txn_from_and_acq_inner(
1874 struct binder_transaction *t)
1876 struct binder_thread *from;
1878 from = binder_get_txn_from(t);
1881 binder_inner_proc_lock(from->proc);
1883 BUG_ON(from != t->from);
1886 binder_inner_proc_unlock(from->proc);
1887 binder_thread_dec_tmpref(from);
1891 static void binder_free_transaction(struct binder_transaction *t)
1894 t->buffer->transaction = NULL;
1896 binder_stats_deleted(BINDER_STAT_TRANSACTION);
1899 static void binder_send_failed_reply(struct binder_transaction *t,
1900 uint32_t error_code)
1902 struct binder_thread *target_thread;
1903 struct binder_transaction *next;
1905 BUG_ON(t->flags & TF_ONE_WAY);
1907 target_thread = binder_get_txn_from_and_acq_inner(t);
1908 if (target_thread) {
1909 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1910 "send failed reply for transaction %d to %d:%d\n",
1912 target_thread->proc->pid,
1913 target_thread->pid);
1915 binder_pop_transaction_ilocked(target_thread, t);
1916 if (target_thread->reply_error.cmd == BR_OK) {
1917 target_thread->reply_error.cmd = error_code;
1918 binder_enqueue_work_ilocked(
1919 &target_thread->reply_error.work,
1920 &target_thread->todo);
1921 wake_up_interruptible(&target_thread->wait);
1923 WARN(1, "Unexpected reply error: %u\n",
1924 target_thread->reply_error.cmd);
1926 binder_inner_proc_unlock(target_thread->proc);
1927 binder_thread_dec_tmpref(target_thread);
1928 binder_free_transaction(t);
1931 next = t->from_parent;
1933 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1934 "send failed reply for transaction %d, target dead\n",
1937 binder_free_transaction(t);
1939 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1940 "reply failed, no target thread at root\n");
1944 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1945 "reply failed, no target thread -- retry %d\n",
1951 * binder_validate_object() - checks for a valid metadata object in a buffer.
1952 * @buffer: binder_buffer that we're parsing.
1953 * @offset: offset in the buffer at which to validate an object.
1955 * Return: If there's a valid metadata object at @offset in @buffer, the
1956 * size of that object. Otherwise, it returns zero.
1958 static size_t binder_validate_object(struct binder_buffer *buffer, u64 offset)
1960 /* Check if we can read a header first */
1961 struct binder_object_header *hdr;
1962 size_t object_size = 0;
1964 if (offset > buffer->data_size - sizeof(*hdr) ||
1965 buffer->data_size < sizeof(*hdr) ||
1966 !IS_ALIGNED(offset, sizeof(u32)))
1969 /* Ok, now see if we can read a complete object. */
1970 hdr = (struct binder_object_header *)(buffer->data + offset);
1971 switch (hdr->type) {
1972 case BINDER_TYPE_BINDER:
1973 case BINDER_TYPE_WEAK_BINDER:
1974 case BINDER_TYPE_HANDLE:
1975 case BINDER_TYPE_WEAK_HANDLE:
1976 object_size = sizeof(struct flat_binder_object);
1978 case BINDER_TYPE_FD:
1979 object_size = sizeof(struct binder_fd_object);
1981 case BINDER_TYPE_PTR:
1982 object_size = sizeof(struct binder_buffer_object);
1984 case BINDER_TYPE_FDA:
1985 object_size = sizeof(struct binder_fd_array_object);
1990 if (offset <= buffer->data_size - object_size &&
1991 buffer->data_size >= object_size)
1998 * binder_validate_ptr() - validates binder_buffer_object in a binder_buffer.
1999 * @b: binder_buffer containing the object
2000 * @index: index in offset array at which the binder_buffer_object is
2002 * @start: points to the start of the offset array
2003 * @num_valid: the number of valid offsets in the offset array
2005 * Return: If @index is within the valid range of the offset array
2006 * described by @start and @num_valid, and if there's a valid
2007 * binder_buffer_object at the offset found in index @index
2008 * of the offset array, that object is returned. Otherwise,
2009 * %NULL is returned.
2010 * Note that the offset found in index @index itself is not
2011 * verified; this function assumes that @num_valid elements
2012 * from @start were previously verified to have valid offsets.
2014 static struct binder_buffer_object *binder_validate_ptr(struct binder_buffer *b,
2015 binder_size_t index,
2016 binder_size_t *start,
2017 binder_size_t num_valid)
2019 struct binder_buffer_object *buffer_obj;
2020 binder_size_t *offp;
2022 if (index >= num_valid)
2025 offp = start + index;
2026 buffer_obj = (struct binder_buffer_object *)(b->data + *offp);
2027 if (buffer_obj->hdr.type != BINDER_TYPE_PTR)
2034 * binder_validate_fixup() - validates pointer/fd fixups happen in order.
2035 * @b: transaction buffer
2036 * @objects_start start of objects buffer
2037 * @buffer: binder_buffer_object in which to fix up
2038 * @offset: start offset in @buffer to fix up
2039 * @last_obj: last binder_buffer_object that we fixed up in
2040 * @last_min_offset: minimum fixup offset in @last_obj
2042 * Return: %true if a fixup in buffer @buffer at offset @offset is
2045 * For safety reasons, we only allow fixups inside a buffer to happen
2046 * at increasing offsets; additionally, we only allow fixup on the last
2047 * buffer object that was verified, or one of its parents.
2049 * Example of what is allowed:
2052 * B (parent = A, offset = 0)
2053 * C (parent = A, offset = 16)
2054 * D (parent = C, offset = 0)
2055 * E (parent = A, offset = 32) // min_offset is 16 (C.parent_offset)
2057 * Examples of what is not allowed:
2059 * Decreasing offsets within the same parent:
2061 * C (parent = A, offset = 16)
2062 * B (parent = A, offset = 0) // decreasing offset within A
2064 * Referring to a parent that wasn't the last object or any of its parents:
2066 * B (parent = A, offset = 0)
2067 * C (parent = A, offset = 0)
2068 * C (parent = A, offset = 16)
2069 * D (parent = B, offset = 0) // B is not A or any of A's parents
2071 static bool binder_validate_fixup(struct binder_buffer *b,
2072 binder_size_t *objects_start,
2073 struct binder_buffer_object *buffer,
2074 binder_size_t fixup_offset,
2075 struct binder_buffer_object *last_obj,
2076 binder_size_t last_min_offset)
2079 /* Nothing to fix up in */
2083 while (last_obj != buffer) {
2085 * Safe to retrieve the parent of last_obj, since it
2086 * was already previously verified by the driver.
2088 if ((last_obj->flags & BINDER_BUFFER_FLAG_HAS_PARENT) == 0)
2090 last_min_offset = last_obj->parent_offset + sizeof(uintptr_t);
2091 last_obj = (struct binder_buffer_object *)
2092 (b->data + *(objects_start + last_obj->parent));
2094 return (fixup_offset >= last_min_offset);
2097 static void binder_transaction_buffer_release(struct binder_proc *proc,
2098 struct binder_buffer *buffer,
2099 binder_size_t *failed_at)
2101 binder_size_t *offp, *off_start, *off_end;
2102 int debug_id = buffer->debug_id;
2104 binder_debug(BINDER_DEBUG_TRANSACTION,
2105 "%d buffer release %d, size %zd-%zd, failed at %p\n",
2106 proc->pid, buffer->debug_id,
2107 buffer->data_size, buffer->offsets_size, failed_at);
2109 if (buffer->target_node)
2110 binder_dec_node(buffer->target_node, 1, 0);
2112 off_start = (binder_size_t *)(buffer->data +
2113 ALIGN(buffer->data_size, sizeof(void *)));
2115 off_end = failed_at;
2117 off_end = (void *)off_start + buffer->offsets_size;
2118 for (offp = off_start; offp < off_end; offp++) {
2119 struct binder_object_header *hdr;
2120 size_t object_size = binder_validate_object(buffer, *offp);
2122 if (object_size == 0) {
2123 pr_err("transaction release %d bad object at offset %lld, size %zd\n",
2124 debug_id, (u64)*offp, buffer->data_size);
2127 hdr = (struct binder_object_header *)(buffer->data + *offp);
2128 switch (hdr->type) {
2129 case BINDER_TYPE_BINDER:
2130 case BINDER_TYPE_WEAK_BINDER: {
2131 struct flat_binder_object *fp;
2132 struct binder_node *node;
2134 fp = to_flat_binder_object(hdr);
2135 node = binder_get_node(proc, fp->binder);
2137 pr_err("transaction release %d bad node %016llx\n",
2138 debug_id, (u64)fp->binder);
2141 binder_debug(BINDER_DEBUG_TRANSACTION,
2142 " node %d u%016llx\n",
2143 node->debug_id, (u64)node->ptr);
2144 binder_dec_node(node, hdr->type == BINDER_TYPE_BINDER,
2146 binder_put_node(node);
2148 case BINDER_TYPE_HANDLE:
2149 case BINDER_TYPE_WEAK_HANDLE: {
2150 struct flat_binder_object *fp;
2151 struct binder_ref_data rdata;
2154 fp = to_flat_binder_object(hdr);
2155 ret = binder_dec_ref_for_handle(proc, fp->handle,
2156 hdr->type == BINDER_TYPE_HANDLE, &rdata);
2159 pr_err("transaction release %d bad handle %d, ret = %d\n",
2160 debug_id, fp->handle, ret);
2163 binder_debug(BINDER_DEBUG_TRANSACTION,
2164 " ref %d desc %d\n",
2165 rdata.debug_id, rdata.desc);
2168 case BINDER_TYPE_FD: {
2169 struct binder_fd_object *fp = to_binder_fd_object(hdr);
2171 binder_debug(BINDER_DEBUG_TRANSACTION,
2172 " fd %d\n", fp->fd);
2174 task_close_fd(proc, fp->fd);
2176 case BINDER_TYPE_PTR:
2178 * Nothing to do here, this will get cleaned up when the
2179 * transaction buffer gets freed
2182 case BINDER_TYPE_FDA: {
2183 struct binder_fd_array_object *fda;
2184 struct binder_buffer_object *parent;
2185 uintptr_t parent_buffer;
2188 binder_size_t fd_buf_size;
2190 fda = to_binder_fd_array_object(hdr);
2191 parent = binder_validate_ptr(buffer, fda->parent,
2195 pr_err("transaction release %d bad parent offset\n",
2200 * Since the parent was already fixed up, convert it
2201 * back to kernel address space to access it
2203 parent_buffer = parent->buffer -
2204 binder_alloc_get_user_buffer_offset(
2207 fd_buf_size = sizeof(u32) * fda->num_fds;
2208 if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
2209 pr_err("transaction release %d invalid number of fds (%lld)\n",
2210 debug_id, (u64)fda->num_fds);
2213 if (fd_buf_size > parent->length ||
2214 fda->parent_offset > parent->length - fd_buf_size) {
2215 /* No space for all file descriptors here. */
2216 pr_err("transaction release %d not enough space for %lld fds in buffer\n",
2217 debug_id, (u64)fda->num_fds);
2220 fd_array = (u32 *)(parent_buffer + (uintptr_t)fda->parent_offset);
2221 for (fd_index = 0; fd_index < fda->num_fds; fd_index++)
2222 task_close_fd(proc, fd_array[fd_index]);
2225 pr_err("transaction release %d bad object type %x\n",
2226 debug_id, hdr->type);
2232 static int binder_translate_binder(struct flat_binder_object *fp,
2233 struct binder_transaction *t,
2234 struct binder_thread *thread)
2236 struct binder_node *node;
2237 struct binder_proc *proc = thread->proc;
2238 struct binder_proc *target_proc = t->to_proc;
2239 struct binder_ref_data rdata;
2242 node = binder_get_node(proc, fp->binder);
2244 node = binder_new_node(proc, fp);
2248 if (fp->cookie != node->cookie) {
2249 binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
2250 proc->pid, thread->pid, (u64)fp->binder,
2251 node->debug_id, (u64)fp->cookie,
2256 if (security_binder_transfer_binder(proc->tsk, target_proc->tsk)) {
2261 ret = binder_inc_ref_for_node(target_proc, node,
2262 fp->hdr.type == BINDER_TYPE_BINDER,
2263 &thread->todo, &rdata);
2267 if (fp->hdr.type == BINDER_TYPE_BINDER)
2268 fp->hdr.type = BINDER_TYPE_HANDLE;
2270 fp->hdr.type = BINDER_TYPE_WEAK_HANDLE;
2272 fp->handle = rdata.desc;
2275 trace_binder_transaction_node_to_ref(t, node, &rdata);
2276 binder_debug(BINDER_DEBUG_TRANSACTION,
2277 " node %d u%016llx -> ref %d desc %d\n",
2278 node->debug_id, (u64)node->ptr,
2279 rdata.debug_id, rdata.desc);
2281 binder_put_node(node);
2285 static int binder_translate_handle(struct flat_binder_object *fp,
2286 struct binder_transaction *t,
2287 struct binder_thread *thread)
2289 struct binder_proc *proc = thread->proc;
2290 struct binder_proc *target_proc = t->to_proc;
2291 struct binder_node *node;
2292 struct binder_ref_data src_rdata;
2295 node = binder_get_node_from_ref(proc, fp->handle,
2296 fp->hdr.type == BINDER_TYPE_HANDLE, &src_rdata);
2298 binder_user_error("%d:%d got transaction with invalid handle, %d\n",
2299 proc->pid, thread->pid, fp->handle);
2302 if (security_binder_transfer_binder(proc->tsk, target_proc->tsk)) {
2307 binder_node_lock(node);
2308 if (node->proc == target_proc) {
2309 if (fp->hdr.type == BINDER_TYPE_HANDLE)
2310 fp->hdr.type = BINDER_TYPE_BINDER;
2312 fp->hdr.type = BINDER_TYPE_WEAK_BINDER;
2313 fp->binder = node->ptr;
2314 fp->cookie = node->cookie;
2316 binder_inner_proc_lock(node->proc);
2317 binder_inc_node_nilocked(node,
2318 fp->hdr.type == BINDER_TYPE_BINDER,
2321 binder_inner_proc_unlock(node->proc);
2322 trace_binder_transaction_ref_to_node(t, node, &src_rdata);
2323 binder_debug(BINDER_DEBUG_TRANSACTION,
2324 " ref %d desc %d -> node %d u%016llx\n",
2325 src_rdata.debug_id, src_rdata.desc, node->debug_id,
2327 binder_node_unlock(node);
2329 struct binder_ref_data dest_rdata;
2331 binder_node_unlock(node);
2332 ret = binder_inc_ref_for_node(target_proc, node,
2333 fp->hdr.type == BINDER_TYPE_HANDLE,
2339 fp->handle = dest_rdata.desc;
2341 trace_binder_transaction_ref_to_ref(t, node, &src_rdata,
2343 binder_debug(BINDER_DEBUG_TRANSACTION,
2344 " ref %d desc %d -> ref %d desc %d (node %d)\n",
2345 src_rdata.debug_id, src_rdata.desc,
2346 dest_rdata.debug_id, dest_rdata.desc,
2350 binder_put_node(node);
2354 static int binder_translate_fd(int fd,
2355 struct binder_transaction *t,
2356 struct binder_thread *thread,
2357 struct binder_transaction *in_reply_to)
2359 struct binder_proc *proc = thread->proc;
2360 struct binder_proc *target_proc = t->to_proc;
2364 bool target_allows_fd;
2367 target_allows_fd = !!(in_reply_to->flags & TF_ACCEPT_FDS);
2369 target_allows_fd = t->buffer->target_node->accept_fds;
2370 if (!target_allows_fd) {
2371 binder_user_error("%d:%d got %s with fd, %d, but target does not allow fds\n",
2372 proc->pid, thread->pid,
2373 in_reply_to ? "reply" : "transaction",
2376 goto err_fd_not_accepted;
2381 binder_user_error("%d:%d got transaction with invalid fd, %d\n",
2382 proc->pid, thread->pid, fd);
2386 ret = security_binder_transfer_file(proc->tsk, target_proc->tsk, file);
2392 target_fd = task_get_unused_fd_flags(target_proc, O_CLOEXEC);
2393 if (target_fd < 0) {
2395 goto err_get_unused_fd;
2397 task_fd_install(target_proc, target_fd, file);
2398 trace_binder_transaction_fd(t, fd, target_fd);
2399 binder_debug(BINDER_DEBUG_TRANSACTION, " fd %d -> %d\n",
2408 err_fd_not_accepted:
2412 static int binder_translate_fd_array(struct binder_fd_array_object *fda,
2413 struct binder_buffer_object *parent,
2414 struct binder_transaction *t,
2415 struct binder_thread *thread,
2416 struct binder_transaction *in_reply_to)
2418 binder_size_t fdi, fd_buf_size, num_installed_fds;
2420 uintptr_t parent_buffer;
2422 struct binder_proc *proc = thread->proc;
2423 struct binder_proc *target_proc = t->to_proc;
2425 fd_buf_size = sizeof(u32) * fda->num_fds;
2426 if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
2427 binder_user_error("%d:%d got transaction with invalid number of fds (%lld)\n",
2428 proc->pid, thread->pid, (u64)fda->num_fds);
2431 if (fd_buf_size > parent->length ||
2432 fda->parent_offset > parent->length - fd_buf_size) {
2433 /* No space for all file descriptors here. */
2434 binder_user_error("%d:%d not enough space to store %lld fds in buffer\n",
2435 proc->pid, thread->pid, (u64)fda->num_fds);
2439 * Since the parent was already fixed up, convert it
2440 * back to the kernel address space to access it
2442 parent_buffer = parent->buffer -
2443 binder_alloc_get_user_buffer_offset(&target_proc->alloc);
2444 fd_array = (u32 *)(parent_buffer + (uintptr_t)fda->parent_offset);
2445 if (!IS_ALIGNED((unsigned long)fd_array, sizeof(u32))) {
2446 binder_user_error("%d:%d parent offset not aligned correctly.\n",
2447 proc->pid, thread->pid);
2450 for (fdi = 0; fdi < fda->num_fds; fdi++) {
2451 target_fd = binder_translate_fd(fd_array[fdi], t, thread,
2454 goto err_translate_fd_failed;
2455 fd_array[fdi] = target_fd;
2459 err_translate_fd_failed:
2461 * Failed to allocate fd or security error, free fds
2464 num_installed_fds = fdi;
2465 for (fdi = 0; fdi < num_installed_fds; fdi++)
2466 task_close_fd(target_proc, fd_array[fdi]);
2470 static int binder_fixup_parent(struct binder_transaction *t,
2471 struct binder_thread *thread,
2472 struct binder_buffer_object *bp,
2473 binder_size_t *off_start,
2474 binder_size_t num_valid,
2475 struct binder_buffer_object *last_fixup_obj,
2476 binder_size_t last_fixup_min_off)
2478 struct binder_buffer_object *parent;
2480 struct binder_buffer *b = t->buffer;
2481 struct binder_proc *proc = thread->proc;
2482 struct binder_proc *target_proc = t->to_proc;
2484 if (!(bp->flags & BINDER_BUFFER_FLAG_HAS_PARENT))
2487 parent = binder_validate_ptr(b, bp->parent, off_start, num_valid);
2489 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2490 proc->pid, thread->pid);
2494 if (!binder_validate_fixup(b, off_start,
2495 parent, bp->parent_offset,
2497 last_fixup_min_off)) {
2498 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
2499 proc->pid, thread->pid);
2503 if (parent->length < sizeof(binder_uintptr_t) ||
2504 bp->parent_offset > parent->length - sizeof(binder_uintptr_t)) {
2505 /* No space for a pointer here! */
2506 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2507 proc->pid, thread->pid);
2510 parent_buffer = (u8 *)((uintptr_t)parent->buffer -
2511 binder_alloc_get_user_buffer_offset(
2512 &target_proc->alloc));
2513 *(binder_uintptr_t *)(parent_buffer + bp->parent_offset) = bp->buffer;
2519 * binder_proc_transaction() - sends a transaction to a process and wakes it up
2520 * @t: transaction to send
2521 * @proc: process to send the transaction to
2522 * @thread: thread in @proc to send the transaction to (may be NULL)
2524 * This function queues a transaction to the specified process. It will try
2525 * to find a thread in the target process to handle the transaction and
2526 * wake it up. If no thread is found, the work is queued to the proc
2529 * If the @thread parameter is not NULL, the transaction is always queued
2530 * to the waitlist of that specific thread.
2532 * Return: true if the transactions was successfully queued
2533 * false if the target process or thread is dead
2535 static bool binder_proc_transaction(struct binder_transaction *t,
2536 struct binder_proc *proc,
2537 struct binder_thread *thread)
2539 struct list_head *target_list = NULL;
2540 struct binder_node *node = t->buffer->target_node;
2541 bool oneway = !!(t->flags & TF_ONE_WAY);
2545 binder_node_lock(node);
2548 if (node->has_async_transaction) {
2549 target_list = &node->async_todo;
2552 node->has_async_transaction = 1;
2556 binder_inner_proc_lock(proc);
2558 if (proc->is_dead || (thread && thread->is_dead)) {
2559 binder_inner_proc_unlock(proc);
2560 binder_node_unlock(node);
2564 if (!thread && !target_list)
2565 thread = binder_select_thread_ilocked(proc);
2568 target_list = &thread->todo;
2569 else if (!target_list)
2570 target_list = &proc->todo;
2572 BUG_ON(target_list != &node->async_todo);
2574 binder_enqueue_work_ilocked(&t->work, target_list);
2577 binder_wakeup_thread_ilocked(proc, thread, !oneway /* sync */);
2579 binder_inner_proc_unlock(proc);
2580 binder_node_unlock(node);
2586 * binder_get_node_refs_for_txn() - Get required refs on node for txn
2587 * @node: struct binder_node for which to get refs
2588 * @proc: returns @node->proc if valid
2589 * @error: if no @proc then returns BR_DEAD_REPLY
2591 * User-space normally keeps the node alive when creating a transaction
2592 * since it has a reference to the target. The local strong ref keeps it
2593 * alive if the sending process dies before the target process processes
2594 * the transaction. If the source process is malicious or has a reference
2595 * counting bug, relying on the local strong ref can fail.
2597 * Since user-space can cause the local strong ref to go away, we also take
2598 * a tmpref on the node to ensure it survives while we are constructing
2599 * the transaction. We also need a tmpref on the proc while we are
2600 * constructing the transaction, so we take that here as well.
2602 * Return: The target_node with refs taken or NULL if no @node->proc is NULL.
2603 * Also sets @proc if valid. If the @node->proc is NULL indicating that the
2604 * target proc has died, @error is set to BR_DEAD_REPLY
2606 static struct binder_node *binder_get_node_refs_for_txn(
2607 struct binder_node *node,
2608 struct binder_proc **procp,
2611 struct binder_node *target_node = NULL;
2613 binder_node_inner_lock(node);
2616 binder_inc_node_nilocked(node, 1, 0, NULL);
2617 binder_inc_node_tmpref_ilocked(node);
2618 node->proc->tmp_ref++;
2619 *procp = node->proc;
2621 *error = BR_DEAD_REPLY;
2622 binder_node_inner_unlock(node);
2627 static void binder_transaction(struct binder_proc *proc,
2628 struct binder_thread *thread,
2629 struct binder_transaction_data *tr, int reply,
2630 binder_size_t extra_buffers_size)
2633 struct binder_transaction *t;
2634 struct binder_work *tcomplete;
2635 binder_size_t *offp, *off_end, *off_start;
2636 binder_size_t off_min;
2637 u8 *sg_bufp, *sg_buf_end;
2638 struct binder_proc *target_proc = NULL;
2639 struct binder_thread *target_thread = NULL;
2640 struct binder_node *target_node = NULL;
2641 struct binder_transaction *in_reply_to = NULL;
2642 struct binder_transaction_log_entry *e;
2643 uint32_t return_error = 0;
2644 uint32_t return_error_param = 0;
2645 uint32_t return_error_line = 0;
2646 struct binder_buffer_object *last_fixup_obj = NULL;
2647 binder_size_t last_fixup_min_off = 0;
2648 struct binder_context *context = proc->context;
2649 int t_debug_id = atomic_inc_return(&binder_last_id);
2651 e = binder_transaction_log_add(&binder_transaction_log);
2652 e->debug_id = t_debug_id;
2653 e->call_type = reply ? 2 : !!(tr->flags & TF_ONE_WAY);
2654 e->from_proc = proc->pid;
2655 e->from_thread = thread->pid;
2656 e->target_handle = tr->target.handle;
2657 e->data_size = tr->data_size;
2658 e->offsets_size = tr->offsets_size;
2659 e->context_name = proc->context->name;
2662 binder_inner_proc_lock(proc);
2663 in_reply_to = thread->transaction_stack;
2664 if (in_reply_to == NULL) {
2665 binder_inner_proc_unlock(proc);
2666 binder_user_error("%d:%d got reply transaction with no transaction stack\n",
2667 proc->pid, thread->pid);
2668 return_error = BR_FAILED_REPLY;
2669 return_error_param = -EPROTO;
2670 return_error_line = __LINE__;
2671 goto err_empty_call_stack;
2673 if (in_reply_to->to_thread != thread) {
2674 spin_lock(&in_reply_to->lock);
2675 binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
2676 proc->pid, thread->pid, in_reply_to->debug_id,
2677 in_reply_to->to_proc ?
2678 in_reply_to->to_proc->pid : 0,
2679 in_reply_to->to_thread ?
2680 in_reply_to->to_thread->pid : 0);
2681 spin_unlock(&in_reply_to->lock);
2682 binder_inner_proc_unlock(proc);
2683 return_error = BR_FAILED_REPLY;
2684 return_error_param = -EPROTO;
2685 return_error_line = __LINE__;
2687 goto err_bad_call_stack;
2689 thread->transaction_stack = in_reply_to->to_parent;
2690 binder_inner_proc_unlock(proc);
2691 binder_set_nice(in_reply_to->saved_priority);
2692 target_thread = binder_get_txn_from_and_acq_inner(in_reply_to);
2693 if (target_thread == NULL) {
2694 return_error = BR_DEAD_REPLY;
2695 return_error_line = __LINE__;
2696 goto err_dead_binder;
2698 if (target_thread->transaction_stack != in_reply_to) {
2699 binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
2700 proc->pid, thread->pid,
2701 target_thread->transaction_stack ?
2702 target_thread->transaction_stack->debug_id : 0,
2703 in_reply_to->debug_id);
2704 binder_inner_proc_unlock(target_thread->proc);
2705 return_error = BR_FAILED_REPLY;
2706 return_error_param = -EPROTO;
2707 return_error_line = __LINE__;
2709 target_thread = NULL;
2710 goto err_dead_binder;
2712 target_proc = target_thread->proc;
2713 target_proc->tmp_ref++;
2714 binder_inner_proc_unlock(target_thread->proc);
2716 if (tr->target.handle) {
2717 struct binder_ref *ref;
2720 * There must already be a strong ref
2721 * on this node. If so, do a strong
2722 * increment on the node to ensure it
2723 * stays alive until the transaction is
2726 binder_proc_lock(proc);
2727 ref = binder_get_ref_olocked(proc, tr->target.handle,
2730 target_node = binder_get_node_refs_for_txn(
2731 ref->node, &target_proc,
2734 binder_user_error("%d:%d got transaction to invalid handle\n",
2735 proc->pid, thread->pid);
2736 return_error = BR_FAILED_REPLY;
2738 binder_proc_unlock(proc);
2740 mutex_lock(&context->context_mgr_node_lock);
2741 target_node = context->binder_context_mgr_node;
2743 target_node = binder_get_node_refs_for_txn(
2744 target_node, &target_proc,
2747 return_error = BR_DEAD_REPLY;
2748 mutex_unlock(&context->context_mgr_node_lock);
2752 * return_error is set above
2754 return_error_param = -EINVAL;
2755 return_error_line = __LINE__;
2756 goto err_dead_binder;
2758 e->to_node = target_node->debug_id;
2759 if (security_binder_transaction(proc->tsk,
2760 target_proc->tsk) < 0) {
2761 return_error = BR_FAILED_REPLY;
2762 return_error_param = -EPERM;
2763 return_error_line = __LINE__;
2764 goto err_invalid_target_handle;
2766 binder_inner_proc_lock(proc);
2767 if (!(tr->flags & TF_ONE_WAY) && thread->transaction_stack) {
2768 struct binder_transaction *tmp;
2770 tmp = thread->transaction_stack;
2771 if (tmp->to_thread != thread) {
2772 spin_lock(&tmp->lock);
2773 binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
2774 proc->pid, thread->pid, tmp->debug_id,
2775 tmp->to_proc ? tmp->to_proc->pid : 0,
2777 tmp->to_thread->pid : 0);
2778 spin_unlock(&tmp->lock);
2779 binder_inner_proc_unlock(proc);
2780 return_error = BR_FAILED_REPLY;
2781 return_error_param = -EPROTO;
2782 return_error_line = __LINE__;
2783 goto err_bad_call_stack;
2786 struct binder_thread *from;
2788 spin_lock(&tmp->lock);
2790 if (from && from->proc == target_proc) {
2791 atomic_inc(&from->tmp_ref);
2792 target_thread = from;
2793 spin_unlock(&tmp->lock);
2796 spin_unlock(&tmp->lock);
2797 tmp = tmp->from_parent;
2800 binder_inner_proc_unlock(proc);
2803 e->to_thread = target_thread->pid;
2804 e->to_proc = target_proc->pid;
2806 /* TODO: reuse incoming transaction for reply */
2807 t = kzalloc(sizeof(*t), GFP_KERNEL);
2809 return_error = BR_FAILED_REPLY;
2810 return_error_param = -ENOMEM;
2811 return_error_line = __LINE__;
2812 goto err_alloc_t_failed;
2814 binder_stats_created(BINDER_STAT_TRANSACTION);
2815 spin_lock_init(&t->lock);
2817 tcomplete = kzalloc(sizeof(*tcomplete), GFP_KERNEL);
2818 if (tcomplete == NULL) {
2819 return_error = BR_FAILED_REPLY;
2820 return_error_param = -ENOMEM;
2821 return_error_line = __LINE__;
2822 goto err_alloc_tcomplete_failed;
2824 binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE);
2826 t->debug_id = t_debug_id;
2829 binder_debug(BINDER_DEBUG_TRANSACTION,
2830 "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld-%lld\n",
2831 proc->pid, thread->pid, t->debug_id,
2832 target_proc->pid, target_thread->pid,
2833 (u64)tr->data.ptr.buffer,
2834 (u64)tr->data.ptr.offsets,
2835 (u64)tr->data_size, (u64)tr->offsets_size,
2836 (u64)extra_buffers_size);
2838 binder_debug(BINDER_DEBUG_TRANSACTION,
2839 "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld-%lld\n",
2840 proc->pid, thread->pid, t->debug_id,
2841 target_proc->pid, target_node->debug_id,
2842 (u64)tr->data.ptr.buffer,
2843 (u64)tr->data.ptr.offsets,
2844 (u64)tr->data_size, (u64)tr->offsets_size,
2845 (u64)extra_buffers_size);
2847 if (!reply && !(tr->flags & TF_ONE_WAY))
2851 t->sender_euid = task_euid(proc->tsk);
2852 t->to_proc = target_proc;
2853 t->to_thread = target_thread;
2855 t->flags = tr->flags;
2856 t->priority = task_nice(current);
2858 trace_binder_transaction(reply, t, target_node);
2860 t->buffer = binder_alloc_new_buf(&target_proc->alloc, tr->data_size,
2861 tr->offsets_size, extra_buffers_size,
2862 !reply && (t->flags & TF_ONE_WAY));
2863 if (IS_ERR(t->buffer)) {
2865 * -ESRCH indicates VMA cleared. The target is dying.
2867 return_error_param = PTR_ERR(t->buffer);
2868 return_error = return_error_param == -ESRCH ?
2869 BR_DEAD_REPLY : BR_FAILED_REPLY;
2870 return_error_line = __LINE__;
2872 goto err_binder_alloc_buf_failed;
2874 t->buffer->allow_user_free = 0;
2875 t->buffer->debug_id = t->debug_id;
2876 t->buffer->transaction = t;
2877 t->buffer->target_node = target_node;
2878 trace_binder_transaction_alloc_buf(t->buffer);
2879 off_start = (binder_size_t *)(t->buffer->data +
2880 ALIGN(tr->data_size, sizeof(void *)));
2883 if (copy_from_user(t->buffer->data, (const void __user *)(uintptr_t)
2884 tr->data.ptr.buffer, tr->data_size)) {
2885 binder_user_error("%d:%d got transaction with invalid data ptr\n",
2886 proc->pid, thread->pid);
2887 return_error = BR_FAILED_REPLY;
2888 return_error_param = -EFAULT;
2889 return_error_line = __LINE__;
2890 goto err_copy_data_failed;
2892 if (copy_from_user(offp, (const void __user *)(uintptr_t)
2893 tr->data.ptr.offsets, tr->offsets_size)) {
2894 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
2895 proc->pid, thread->pid);
2896 return_error = BR_FAILED_REPLY;
2897 return_error_param = -EFAULT;
2898 return_error_line = __LINE__;
2899 goto err_copy_data_failed;
2901 if (!IS_ALIGNED(tr->offsets_size, sizeof(binder_size_t))) {
2902 binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
2903 proc->pid, thread->pid, (u64)tr->offsets_size);
2904 return_error = BR_FAILED_REPLY;
2905 return_error_param = -EINVAL;
2906 return_error_line = __LINE__;
2907 goto err_bad_offset;
2909 if (!IS_ALIGNED(extra_buffers_size, sizeof(u64))) {
2910 binder_user_error("%d:%d got transaction with unaligned buffers size, %lld\n",
2911 proc->pid, thread->pid,
2912 (u64)extra_buffers_size);
2913 return_error = BR_FAILED_REPLY;
2914 return_error_param = -EINVAL;
2915 return_error_line = __LINE__;
2916 goto err_bad_offset;
2918 off_end = (void *)off_start + tr->offsets_size;
2919 sg_bufp = (u8 *)(PTR_ALIGN(off_end, sizeof(void *)));
2920 sg_buf_end = sg_bufp + extra_buffers_size;
2922 for (; offp < off_end; offp++) {
2923 struct binder_object_header *hdr;
2924 size_t object_size = binder_validate_object(t->buffer, *offp);
2926 if (object_size == 0 || *offp < off_min) {
2927 binder_user_error("%d:%d got transaction with invalid offset (%lld, min %lld max %lld) or object.\n",
2928 proc->pid, thread->pid, (u64)*offp,
2930 (u64)t->buffer->data_size);
2931 return_error = BR_FAILED_REPLY;
2932 return_error_param = -EINVAL;
2933 return_error_line = __LINE__;
2934 goto err_bad_offset;
2937 hdr = (struct binder_object_header *)(t->buffer->data + *offp);
2938 off_min = *offp + object_size;
2939 switch (hdr->type) {
2940 case BINDER_TYPE_BINDER:
2941 case BINDER_TYPE_WEAK_BINDER: {
2942 struct flat_binder_object *fp;
2944 fp = to_flat_binder_object(hdr);
2945 ret = binder_translate_binder(fp, t, thread);
2947 return_error = BR_FAILED_REPLY;
2948 return_error_param = ret;
2949 return_error_line = __LINE__;
2950 goto err_translate_failed;
2953 case BINDER_TYPE_HANDLE:
2954 case BINDER_TYPE_WEAK_HANDLE: {
2955 struct flat_binder_object *fp;
2957 fp = to_flat_binder_object(hdr);
2958 ret = binder_translate_handle(fp, t, thread);
2960 return_error = BR_FAILED_REPLY;
2961 return_error_param = ret;
2962 return_error_line = __LINE__;
2963 goto err_translate_failed;
2967 case BINDER_TYPE_FD: {
2968 struct binder_fd_object *fp = to_binder_fd_object(hdr);
2969 int target_fd = binder_translate_fd(fp->fd, t, thread,
2972 if (target_fd < 0) {
2973 return_error = BR_FAILED_REPLY;
2974 return_error_param = target_fd;
2975 return_error_line = __LINE__;
2976 goto err_translate_failed;
2981 case BINDER_TYPE_FDA: {
2982 struct binder_fd_array_object *fda =
2983 to_binder_fd_array_object(hdr);
2984 struct binder_buffer_object *parent =
2985 binder_validate_ptr(t->buffer, fda->parent,
2989 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2990 proc->pid, thread->pid);
2991 return_error = BR_FAILED_REPLY;
2992 return_error_param = -EINVAL;
2993 return_error_line = __LINE__;
2994 goto err_bad_parent;
2996 if (!binder_validate_fixup(t->buffer, off_start,
2997 parent, fda->parent_offset,
2999 last_fixup_min_off)) {
3000 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
3001 proc->pid, thread->pid);
3002 return_error = BR_FAILED_REPLY;
3003 return_error_param = -EINVAL;
3004 return_error_line = __LINE__;
3005 goto err_bad_parent;
3007 ret = binder_translate_fd_array(fda, parent, t, thread,
3010 return_error = BR_FAILED_REPLY;
3011 return_error_param = ret;
3012 return_error_line = __LINE__;
3013 goto err_translate_failed;
3015 last_fixup_obj = parent;
3016 last_fixup_min_off =
3017 fda->parent_offset + sizeof(u32) * fda->num_fds;
3019 case BINDER_TYPE_PTR: {
3020 struct binder_buffer_object *bp =
3021 to_binder_buffer_object(hdr);
3022 size_t buf_left = sg_buf_end - sg_bufp;
3024 if (bp->length > buf_left) {
3025 binder_user_error("%d:%d got transaction with too large buffer\n",
3026 proc->pid, thread->pid);
3027 return_error = BR_FAILED_REPLY;
3028 return_error_param = -EINVAL;
3029 return_error_line = __LINE__;
3030 goto err_bad_offset;
3032 if (copy_from_user(sg_bufp,
3033 (const void __user *)(uintptr_t)
3034 bp->buffer, bp->length)) {
3035 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
3036 proc->pid, thread->pid);
3037 return_error_param = -EFAULT;
3038 return_error = BR_FAILED_REPLY;
3039 return_error_line = __LINE__;
3040 goto err_copy_data_failed;
3042 /* Fixup buffer pointer to target proc address space */
3043 bp->buffer = (uintptr_t)sg_bufp +
3044 binder_alloc_get_user_buffer_offset(
3045 &target_proc->alloc);
3046 sg_bufp += ALIGN(bp->length, sizeof(u64));
3048 ret = binder_fixup_parent(t, thread, bp, off_start,
3051 last_fixup_min_off);
3053 return_error = BR_FAILED_REPLY;
3054 return_error_param = ret;
3055 return_error_line = __LINE__;
3056 goto err_translate_failed;
3058 last_fixup_obj = bp;
3059 last_fixup_min_off = 0;
3062 binder_user_error("%d:%d got transaction with invalid object type, %x\n",
3063 proc->pid, thread->pid, hdr->type);
3064 return_error = BR_FAILED_REPLY;
3065 return_error_param = -EINVAL;
3066 return_error_line = __LINE__;
3067 goto err_bad_object_type;
3070 tcomplete->type = BINDER_WORK_TRANSACTION_COMPLETE;
3071 binder_enqueue_work(proc, tcomplete, &thread->todo);
3072 t->work.type = BINDER_WORK_TRANSACTION;
3075 binder_inner_proc_lock(target_proc);
3076 if (target_thread->is_dead) {
3077 binder_inner_proc_unlock(target_proc);
3078 goto err_dead_proc_or_thread;
3080 BUG_ON(t->buffer->async_transaction != 0);
3081 binder_pop_transaction_ilocked(target_thread, in_reply_to);
3082 binder_enqueue_work_ilocked(&t->work, &target_thread->todo);
3083 binder_inner_proc_unlock(target_proc);
3084 wake_up_interruptible_sync(&target_thread->wait);
3085 binder_free_transaction(in_reply_to);
3086 } else if (!(t->flags & TF_ONE_WAY)) {
3087 BUG_ON(t->buffer->async_transaction != 0);
3088 binder_inner_proc_lock(proc);
3090 t->from_parent = thread->transaction_stack;
3091 thread->transaction_stack = t;
3092 binder_inner_proc_unlock(proc);
3093 if (!binder_proc_transaction(t, target_proc, target_thread)) {
3094 binder_inner_proc_lock(proc);
3095 binder_pop_transaction_ilocked(thread, t);
3096 binder_inner_proc_unlock(proc);
3097 goto err_dead_proc_or_thread;
3100 BUG_ON(target_node == NULL);
3101 BUG_ON(t->buffer->async_transaction != 1);
3102 if (!binder_proc_transaction(t, target_proc, NULL))
3103 goto err_dead_proc_or_thread;
3106 binder_thread_dec_tmpref(target_thread);
3107 binder_proc_dec_tmpref(target_proc);
3109 binder_dec_node_tmpref(target_node);
3111 * write barrier to synchronize with initialization
3115 WRITE_ONCE(e->debug_id_done, t_debug_id);
3118 err_dead_proc_or_thread:
3119 return_error = BR_DEAD_REPLY;
3120 return_error_line = __LINE__;
3121 binder_dequeue_work(proc, tcomplete);
3122 err_translate_failed:
3123 err_bad_object_type:
3126 err_copy_data_failed:
3127 trace_binder_transaction_failed_buffer_release(t->buffer);
3128 binder_transaction_buffer_release(target_proc, t->buffer, offp);
3130 binder_dec_node_tmpref(target_node);
3132 t->buffer->transaction = NULL;
3133 binder_alloc_free_buf(&target_proc->alloc, t->buffer);
3134 err_binder_alloc_buf_failed:
3136 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
3137 err_alloc_tcomplete_failed:
3139 binder_stats_deleted(BINDER_STAT_TRANSACTION);
3142 err_empty_call_stack:
3144 err_invalid_target_handle:
3146 binder_thread_dec_tmpref(target_thread);
3148 binder_proc_dec_tmpref(target_proc);
3150 binder_dec_node(target_node, 1, 0);
3151 binder_dec_node_tmpref(target_node);
3154 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
3155 "%d:%d transaction failed %d/%d, size %lld-%lld line %d\n",
3156 proc->pid, thread->pid, return_error, return_error_param,
3157 (u64)tr->data_size, (u64)tr->offsets_size,
3161 struct binder_transaction_log_entry *fe;
3163 e->return_error = return_error;
3164 e->return_error_param = return_error_param;
3165 e->return_error_line = return_error_line;
3166 fe = binder_transaction_log_add(&binder_transaction_log_failed);
3169 * write barrier to synchronize with initialization
3173 WRITE_ONCE(e->debug_id_done, t_debug_id);
3174 WRITE_ONCE(fe->debug_id_done, t_debug_id);
3177 BUG_ON(thread->return_error.cmd != BR_OK);
3179 thread->return_error.cmd = BR_TRANSACTION_COMPLETE;
3180 binder_enqueue_work(thread->proc,
3181 &thread->return_error.work,
3183 binder_send_failed_reply(in_reply_to, return_error);
3185 thread->return_error.cmd = return_error;
3186 binder_enqueue_work(thread->proc,
3187 &thread->return_error.work,
3192 static int binder_thread_write(struct binder_proc *proc,
3193 struct binder_thread *thread,
3194 binder_uintptr_t binder_buffer, size_t size,
3195 binder_size_t *consumed)
3198 struct binder_context *context = proc->context;
3199 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
3200 void __user *ptr = buffer + *consumed;
3201 void __user *end = buffer + size;
3203 while (ptr < end && thread->return_error.cmd == BR_OK) {
3206 if (get_user(cmd, (uint32_t __user *)ptr))
3208 ptr += sizeof(uint32_t);
3209 trace_binder_command(cmd);
3210 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.bc)) {
3211 atomic_inc(&binder_stats.bc[_IOC_NR(cmd)]);
3212 atomic_inc(&proc->stats.bc[_IOC_NR(cmd)]);
3213 atomic_inc(&thread->stats.bc[_IOC_NR(cmd)]);
3221 const char *debug_string;
3222 bool strong = cmd == BC_ACQUIRE || cmd == BC_RELEASE;
3223 bool increment = cmd == BC_INCREFS || cmd == BC_ACQUIRE;
3224 struct binder_ref_data rdata;
3226 if (get_user(target, (uint32_t __user *)ptr))
3229 ptr += sizeof(uint32_t);
3231 if (increment && !target) {
3232 struct binder_node *ctx_mgr_node;
3233 mutex_lock(&context->context_mgr_node_lock);
3234 ctx_mgr_node = context->binder_context_mgr_node;
3236 ret = binder_inc_ref_for_node(
3238 strong, NULL, &rdata);
3239 mutex_unlock(&context->context_mgr_node_lock);
3242 ret = binder_update_ref_for_handle(
3243 proc, target, increment, strong,
3245 if (!ret && rdata.desc != target) {
3246 binder_user_error("%d:%d tried to acquire reference to desc %d, got %d instead\n",
3247 proc->pid, thread->pid,
3248 target, rdata.desc);
3252 debug_string = "IncRefs";
3255 debug_string = "Acquire";
3258 debug_string = "Release";
3262 debug_string = "DecRefs";
3266 binder_user_error("%d:%d %s %d refcount change on invalid ref %d ret %d\n",
3267 proc->pid, thread->pid, debug_string,
3268 strong, target, ret);
3271 binder_debug(BINDER_DEBUG_USER_REFS,
3272 "%d:%d %s ref %d desc %d s %d w %d\n",
3273 proc->pid, thread->pid, debug_string,
3274 rdata.debug_id, rdata.desc, rdata.strong,
3278 case BC_INCREFS_DONE:
3279 case BC_ACQUIRE_DONE: {
3280 binder_uintptr_t node_ptr;
3281 binder_uintptr_t cookie;
3282 struct binder_node *node;
3285 if (get_user(node_ptr, (binder_uintptr_t __user *)ptr))
3287 ptr += sizeof(binder_uintptr_t);
3288 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3290 ptr += sizeof(binder_uintptr_t);
3291 node = binder_get_node(proc, node_ptr);
3293 binder_user_error("%d:%d %s u%016llx no match\n",
3294 proc->pid, thread->pid,
3295 cmd == BC_INCREFS_DONE ?
3301 if (cookie != node->cookie) {
3302 binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
3303 proc->pid, thread->pid,
3304 cmd == BC_INCREFS_DONE ?
3305 "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3306 (u64)node_ptr, node->debug_id,
3307 (u64)cookie, (u64)node->cookie);
3308 binder_put_node(node);
3311 binder_node_inner_lock(node);
3312 if (cmd == BC_ACQUIRE_DONE) {
3313 if (node->pending_strong_ref == 0) {
3314 binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
3315 proc->pid, thread->pid,
3317 binder_node_inner_unlock(node);
3318 binder_put_node(node);
3321 node->pending_strong_ref = 0;
3323 if (node->pending_weak_ref == 0) {
3324 binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
3325 proc->pid, thread->pid,
3327 binder_node_inner_unlock(node);
3328 binder_put_node(node);
3331 node->pending_weak_ref = 0;
3333 free_node = binder_dec_node_nilocked(node,
3334 cmd == BC_ACQUIRE_DONE, 0);
3336 binder_debug(BINDER_DEBUG_USER_REFS,
3337 "%d:%d %s node %d ls %d lw %d tr %d\n",
3338 proc->pid, thread->pid,
3339 cmd == BC_INCREFS_DONE ? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3340 node->debug_id, node->local_strong_refs,
3341 node->local_weak_refs, node->tmp_refs);
3342 binder_node_inner_unlock(node);
3343 binder_put_node(node);
3346 case BC_ATTEMPT_ACQUIRE:
3347 pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
3349 case BC_ACQUIRE_RESULT:
3350 pr_err("BC_ACQUIRE_RESULT not supported\n");
3353 case BC_FREE_BUFFER: {
3354 binder_uintptr_t data_ptr;
3355 struct binder_buffer *buffer;
3357 if (get_user(data_ptr, (binder_uintptr_t __user *)ptr))
3359 ptr += sizeof(binder_uintptr_t);
3361 buffer = binder_alloc_prepare_to_free(&proc->alloc,
3363 if (buffer == NULL) {
3364 binder_user_error("%d:%d BC_FREE_BUFFER u%016llx no match\n",
3365 proc->pid, thread->pid, (u64)data_ptr);
3368 if (!buffer->allow_user_free) {
3369 binder_user_error("%d:%d BC_FREE_BUFFER u%016llx matched unreturned buffer\n",
3370 proc->pid, thread->pid, (u64)data_ptr);
3373 binder_debug(BINDER_DEBUG_FREE_BUFFER,
3374 "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
3375 proc->pid, thread->pid, (u64)data_ptr,
3377 buffer->transaction ? "active" : "finished");
3379 if (buffer->transaction) {
3380 buffer->transaction->buffer = NULL;
3381 buffer->transaction = NULL;
3383 if (buffer->async_transaction && buffer->target_node) {
3384 struct binder_node *buf_node;
3385 struct binder_work *w;
3387 buf_node = buffer->target_node;
3388 binder_node_inner_lock(buf_node);
3389 BUG_ON(!buf_node->has_async_transaction);
3390 BUG_ON(buf_node->proc != proc);
3391 w = binder_dequeue_work_head_ilocked(
3392 &buf_node->async_todo);
3394 buf_node->has_async_transaction = 0;
3396 binder_enqueue_work_ilocked(
3398 binder_wakeup_proc_ilocked(proc);
3400 binder_node_inner_unlock(buf_node);
3402 trace_binder_transaction_buffer_release(buffer);
3403 binder_transaction_buffer_release(proc, buffer, NULL);
3404 binder_alloc_free_buf(&proc->alloc, buffer);
3408 case BC_TRANSACTION_SG:
3410 struct binder_transaction_data_sg tr;
3412 if (copy_from_user(&tr, ptr, sizeof(tr)))
3415 binder_transaction(proc, thread, &tr.transaction_data,
3416 cmd == BC_REPLY_SG, tr.buffers_size);
3419 case BC_TRANSACTION:
3421 struct binder_transaction_data tr;
3423 if (copy_from_user(&tr, ptr, sizeof(tr)))
3426 binder_transaction(proc, thread, &tr,
3427 cmd == BC_REPLY, 0);
3431 case BC_REGISTER_LOOPER:
3432 binder_debug(BINDER_DEBUG_THREADS,
3433 "%d:%d BC_REGISTER_LOOPER\n",
3434 proc->pid, thread->pid);
3435 binder_inner_proc_lock(proc);
3436 if (thread->looper & BINDER_LOOPER_STATE_ENTERED) {
3437 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3438 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
3439 proc->pid, thread->pid);
3440 } else if (proc->requested_threads == 0) {
3441 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3442 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
3443 proc->pid, thread->pid);
3445 proc->requested_threads--;
3446 proc->requested_threads_started++;
3448 thread->looper |= BINDER_LOOPER_STATE_REGISTERED;
3449 binder_inner_proc_unlock(proc);
3451 case BC_ENTER_LOOPER:
3452 binder_debug(BINDER_DEBUG_THREADS,
3453 "%d:%d BC_ENTER_LOOPER\n",
3454 proc->pid, thread->pid);
3455 if (thread->looper & BINDER_LOOPER_STATE_REGISTERED) {
3456 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3457 binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
3458 proc->pid, thread->pid);
3460 thread->looper |= BINDER_LOOPER_STATE_ENTERED;
3462 case BC_EXIT_LOOPER:
3463 binder_debug(BINDER_DEBUG_THREADS,
3464 "%d:%d BC_EXIT_LOOPER\n",
3465 proc->pid, thread->pid);
3466 thread->looper |= BINDER_LOOPER_STATE_EXITED;
3469 case BC_REQUEST_DEATH_NOTIFICATION:
3470 case BC_CLEAR_DEATH_NOTIFICATION: {
3472 binder_uintptr_t cookie;
3473 struct binder_ref *ref;
3474 struct binder_ref_death *death = NULL;
3476 if (get_user(target, (uint32_t __user *)ptr))
3478 ptr += sizeof(uint32_t);
3479 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3481 ptr += sizeof(binder_uintptr_t);
3482 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
3484 * Allocate memory for death notification
3485 * before taking lock
3487 death = kzalloc(sizeof(*death), GFP_KERNEL);
3488 if (death == NULL) {
3489 WARN_ON(thread->return_error.cmd !=
3491 thread->return_error.cmd = BR_ERROR;
3492 binder_enqueue_work(
3494 &thread->return_error.work,
3497 BINDER_DEBUG_FAILED_TRANSACTION,
3498 "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
3499 proc->pid, thread->pid);
3503 binder_proc_lock(proc);
3504 ref = binder_get_ref_olocked(proc, target, false);
3506 binder_user_error("%d:%d %s invalid ref %d\n",
3507 proc->pid, thread->pid,
3508 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
3509 "BC_REQUEST_DEATH_NOTIFICATION" :
3510 "BC_CLEAR_DEATH_NOTIFICATION",
3512 binder_proc_unlock(proc);
3517 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
3518 "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
3519 proc->pid, thread->pid,
3520 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
3521 "BC_REQUEST_DEATH_NOTIFICATION" :
3522 "BC_CLEAR_DEATH_NOTIFICATION",
3523 (u64)cookie, ref->data.debug_id,
3524 ref->data.desc, ref->data.strong,
3525 ref->data.weak, ref->node->debug_id);
3527 binder_node_lock(ref->node);
3528 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
3530 binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
3531 proc->pid, thread->pid);
3532 binder_node_unlock(ref->node);
3533 binder_proc_unlock(proc);
3537 binder_stats_created(BINDER_STAT_DEATH);
3538 INIT_LIST_HEAD(&death->work.entry);
3539 death->cookie = cookie;
3541 if (ref->node->proc == NULL) {
3542 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
3544 binder_inner_proc_lock(proc);
3545 binder_enqueue_work_ilocked(
3546 &ref->death->work, &proc->todo);
3547 binder_wakeup_proc_ilocked(proc);
3548 binder_inner_proc_unlock(proc);
3551 if (ref->death == NULL) {
3552 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
3553 proc->pid, thread->pid);
3554 binder_node_unlock(ref->node);
3555 binder_proc_unlock(proc);
3559 if (death->cookie != cookie) {
3560 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
3561 proc->pid, thread->pid,
3564 binder_node_unlock(ref->node);
3565 binder_proc_unlock(proc);
3569 binder_inner_proc_lock(proc);
3570 if (list_empty(&death->work.entry)) {
3571 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
3572 if (thread->looper &
3573 (BINDER_LOOPER_STATE_REGISTERED |
3574 BINDER_LOOPER_STATE_ENTERED))
3575 binder_enqueue_work_ilocked(
3579 binder_enqueue_work_ilocked(
3582 binder_wakeup_proc_ilocked(
3586 BUG_ON(death->work.type != BINDER_WORK_DEAD_BINDER);
3587 death->work.type = BINDER_WORK_DEAD_BINDER_AND_CLEAR;
3589 binder_inner_proc_unlock(proc);
3591 binder_node_unlock(ref->node);
3592 binder_proc_unlock(proc);
3594 case BC_DEAD_BINDER_DONE: {
3595 struct binder_work *w;
3596 binder_uintptr_t cookie;
3597 struct binder_ref_death *death = NULL;
3599 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3602 ptr += sizeof(cookie);
3603 binder_inner_proc_lock(proc);
3604 list_for_each_entry(w, &proc->delivered_death,
3606 struct binder_ref_death *tmp_death =
3608 struct binder_ref_death,
3611 if (tmp_death->cookie == cookie) {
3616 binder_debug(BINDER_DEBUG_DEAD_BINDER,
3617 "%d:%d BC_DEAD_BINDER_DONE %016llx found %p\n",
3618 proc->pid, thread->pid, (u64)cookie,
3620 if (death == NULL) {
3621 binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
3622 proc->pid, thread->pid, (u64)cookie);
3623 binder_inner_proc_unlock(proc);
3626 binder_dequeue_work_ilocked(&death->work);
3627 if (death->work.type == BINDER_WORK_DEAD_BINDER_AND_CLEAR) {
3628 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
3629 if (thread->looper &
3630 (BINDER_LOOPER_STATE_REGISTERED |
3631 BINDER_LOOPER_STATE_ENTERED))
3632 binder_enqueue_work_ilocked(
3633 &death->work, &thread->todo);
3635 binder_enqueue_work_ilocked(
3638 binder_wakeup_proc_ilocked(proc);
3641 binder_inner_proc_unlock(proc);
3645 pr_err("%d:%d unknown command %d\n",
3646 proc->pid, thread->pid, cmd);
3649 *consumed = ptr - buffer;
3654 static void binder_stat_br(struct binder_proc *proc,
3655 struct binder_thread *thread, uint32_t cmd)
3657 trace_binder_return(cmd);
3658 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.br)) {
3659 atomic_inc(&binder_stats.br[_IOC_NR(cmd)]);
3660 atomic_inc(&proc->stats.br[_IOC_NR(cmd)]);
3661 atomic_inc(&thread->stats.br[_IOC_NR(cmd)]);
3665 static int binder_put_node_cmd(struct binder_proc *proc,
3666 struct binder_thread *thread,
3668 binder_uintptr_t node_ptr,
3669 binder_uintptr_t node_cookie,
3671 uint32_t cmd, const char *cmd_name)
3673 void __user *ptr = *ptrp;
3675 if (put_user(cmd, (uint32_t __user *)ptr))
3677 ptr += sizeof(uint32_t);
3679 if (put_user(node_ptr, (binder_uintptr_t __user *)ptr))
3681 ptr += sizeof(binder_uintptr_t);
3683 if (put_user(node_cookie, (binder_uintptr_t __user *)ptr))
3685 ptr += sizeof(binder_uintptr_t);
3687 binder_stat_br(proc, thread, cmd);
3688 binder_debug(BINDER_DEBUG_USER_REFS, "%d:%d %s %d u%016llx c%016llx\n",
3689 proc->pid, thread->pid, cmd_name, node_debug_id,
3690 (u64)node_ptr, (u64)node_cookie);
3696 static int binder_wait_for_work(struct binder_thread *thread,
3700 struct binder_proc *proc = thread->proc;
3703 freezer_do_not_count();
3704 binder_inner_proc_lock(proc);
3706 prepare_to_wait(&thread->wait, &wait, TASK_INTERRUPTIBLE);
3707 if (binder_has_work_ilocked(thread, do_proc_work))
3710 list_add(&thread->waiting_thread_node,
3711 &proc->waiting_threads);
3712 binder_inner_proc_unlock(proc);
3714 binder_inner_proc_lock(proc);
3715 list_del_init(&thread->waiting_thread_node);
3716 if (signal_pending(current)) {
3721 finish_wait(&thread->wait, &wait);
3722 binder_inner_proc_unlock(proc);
3728 static int binder_thread_read(struct binder_proc *proc,
3729 struct binder_thread *thread,
3730 binder_uintptr_t binder_buffer, size_t size,
3731 binder_size_t *consumed, int non_block)
3733 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
3734 void __user *ptr = buffer + *consumed;
3735 void __user *end = buffer + size;
3738 int wait_for_proc_work;
3740 if (*consumed == 0) {
3741 if (put_user(BR_NOOP, (uint32_t __user *)ptr))
3743 ptr += sizeof(uint32_t);
3747 binder_inner_proc_lock(proc);
3748 wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
3749 binder_inner_proc_unlock(proc);
3751 thread->looper |= BINDER_LOOPER_STATE_WAITING;
3753 trace_binder_wait_for_work(wait_for_proc_work,
3754 !!thread->transaction_stack,
3755 !binder_worklist_empty(proc, &thread->todo));
3756 if (wait_for_proc_work) {
3757 if (!(thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
3758 BINDER_LOOPER_STATE_ENTERED))) {
3759 binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
3760 proc->pid, thread->pid, thread->looper);
3761 wait_event_interruptible(binder_user_error_wait,
3762 binder_stop_on_user_error < 2);
3764 binder_set_nice(proc->default_priority);
3768 if (!binder_has_work(thread, wait_for_proc_work))
3771 ret = binder_wait_for_work(thread, wait_for_proc_work);
3774 thread->looper &= ~BINDER_LOOPER_STATE_WAITING;
3781 struct binder_transaction_data tr;
3782 struct binder_work *w = NULL;
3783 struct list_head *list = NULL;
3784 struct binder_transaction *t = NULL;
3785 struct binder_thread *t_from;
3787 binder_inner_proc_lock(proc);
3788 if (!binder_worklist_empty_ilocked(&thread->todo))
3789 list = &thread->todo;
3790 else if (!binder_worklist_empty_ilocked(&proc->todo) &&
3794 binder_inner_proc_unlock(proc);
3797 if (ptr - buffer == 4 && !thread->looper_need_return)
3802 if (end - ptr < sizeof(tr) + 4) {
3803 binder_inner_proc_unlock(proc);
3806 w = binder_dequeue_work_head_ilocked(list);
3809 case BINDER_WORK_TRANSACTION: {
3810 binder_inner_proc_unlock(proc);
3811 t = container_of(w, struct binder_transaction, work);
3813 case BINDER_WORK_RETURN_ERROR: {
3814 struct binder_error *e = container_of(
3815 w, struct binder_error, work);
3817 WARN_ON(e->cmd == BR_OK);
3818 binder_inner_proc_unlock(proc);
3819 if (put_user(e->cmd, (uint32_t __user *)ptr))
3822 ptr += sizeof(uint32_t);
3824 binder_stat_br(proc, thread, e->cmd);
3826 case BINDER_WORK_TRANSACTION_COMPLETE: {
3827 binder_inner_proc_unlock(proc);
3828 cmd = BR_TRANSACTION_COMPLETE;
3829 if (put_user(cmd, (uint32_t __user *)ptr))
3831 ptr += sizeof(uint32_t);
3833 binder_stat_br(proc, thread, cmd);
3834 binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE,
3835 "%d:%d BR_TRANSACTION_COMPLETE\n",
3836 proc->pid, thread->pid);
3838 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
3840 case BINDER_WORK_NODE: {
3841 struct binder_node *node = container_of(w, struct binder_node, work);
3843 binder_uintptr_t node_ptr = node->ptr;
3844 binder_uintptr_t node_cookie = node->cookie;
3845 int node_debug_id = node->debug_id;
3848 void __user *orig_ptr = ptr;
3850 BUG_ON(proc != node->proc);
3851 strong = node->internal_strong_refs ||
3852 node->local_strong_refs;
3853 weak = !hlist_empty(&node->refs) ||
3854 node->local_weak_refs ||
3855 node->tmp_refs || strong;
3856 has_strong_ref = node->has_strong_ref;
3857 has_weak_ref = node->has_weak_ref;
3859 if (weak && !has_weak_ref) {
3860 node->has_weak_ref = 1;
3861 node->pending_weak_ref = 1;
3862 node->local_weak_refs++;
3864 if (strong && !has_strong_ref) {
3865 node->has_strong_ref = 1;
3866 node->pending_strong_ref = 1;
3867 node->local_strong_refs++;
3869 if (!strong && has_strong_ref)
3870 node->has_strong_ref = 0;
3871 if (!weak && has_weak_ref)
3872 node->has_weak_ref = 0;
3873 if (!weak && !strong) {
3874 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
3875 "%d:%d node %d u%016llx c%016llx deleted\n",
3876 proc->pid, thread->pid,
3880 rb_erase(&node->rb_node, &proc->nodes);
3881 binder_inner_proc_unlock(proc);
3882 binder_node_lock(node);
3884 * Acquire the node lock before freeing the
3885 * node to serialize with other threads that
3886 * may have been holding the node lock while
3887 * decrementing this node (avoids race where
3888 * this thread frees while the other thread
3889 * is unlocking the node after the final
3892 binder_node_unlock(node);
3893 binder_free_node(node);
3895 binder_inner_proc_unlock(proc);
3897 if (weak && !has_weak_ref)
3898 ret = binder_put_node_cmd(
3899 proc, thread, &ptr, node_ptr,
3900 node_cookie, node_debug_id,
3901 BR_INCREFS, "BR_INCREFS");
3902 if (!ret && strong && !has_strong_ref)
3903 ret = binder_put_node_cmd(
3904 proc, thread, &ptr, node_ptr,
3905 node_cookie, node_debug_id,
3906 BR_ACQUIRE, "BR_ACQUIRE");
3907 if (!ret && !strong && has_strong_ref)
3908 ret = binder_put_node_cmd(
3909 proc, thread, &ptr, node_ptr,
3910 node_cookie, node_debug_id,
3911 BR_RELEASE, "BR_RELEASE");
3912 if (!ret && !weak && has_weak_ref)
3913 ret = binder_put_node_cmd(
3914 proc, thread, &ptr, node_ptr,
3915 node_cookie, node_debug_id,
3916 BR_DECREFS, "BR_DECREFS");
3917 if (orig_ptr == ptr)
3918 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
3919 "%d:%d node %d u%016llx c%016llx state unchanged\n",
3920 proc->pid, thread->pid,
3927 case BINDER_WORK_DEAD_BINDER:
3928 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
3929 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
3930 struct binder_ref_death *death;
3932 binder_uintptr_t cookie;
3934 death = container_of(w, struct binder_ref_death, work);
3935 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION)
3936 cmd = BR_CLEAR_DEATH_NOTIFICATION_DONE;
3938 cmd = BR_DEAD_BINDER;
3939 cookie = death->cookie;
3941 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
3942 "%d:%d %s %016llx\n",
3943 proc->pid, thread->pid,
3944 cmd == BR_DEAD_BINDER ?
3946 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
3948 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) {
3949 binder_inner_proc_unlock(proc);
3951 binder_stats_deleted(BINDER_STAT_DEATH);
3953 binder_enqueue_work_ilocked(
3954 w, &proc->delivered_death);
3955 binder_inner_proc_unlock(proc);
3957 if (put_user(cmd, (uint32_t __user *)ptr))
3959 ptr += sizeof(uint32_t);
3960 if (put_user(cookie,
3961 (binder_uintptr_t __user *)ptr))
3963 ptr += sizeof(binder_uintptr_t);
3964 binder_stat_br(proc, thread, cmd);
3965 if (cmd == BR_DEAD_BINDER)
3966 goto done; /* DEAD_BINDER notifications can cause transactions */
3973 BUG_ON(t->buffer == NULL);
3974 if (t->buffer->target_node) {
3975 struct binder_node *target_node = t->buffer->target_node;
3977 tr.target.ptr = target_node->ptr;
3978 tr.cookie = target_node->cookie;
3979 t->saved_priority = task_nice(current);
3980 if (t->priority < target_node->min_priority &&
3981 !(t->flags & TF_ONE_WAY))
3982 binder_set_nice(t->priority);
3983 else if (!(t->flags & TF_ONE_WAY) ||
3984 t->saved_priority > target_node->min_priority)
3985 binder_set_nice(target_node->min_priority);
3986 cmd = BR_TRANSACTION;
3993 tr.flags = t->flags;
3994 tr.sender_euid = from_kuid(current_user_ns(), t->sender_euid);
3996 t_from = binder_get_txn_from(t);
3998 struct task_struct *sender = t_from->proc->tsk;
4000 tr.sender_pid = task_tgid_nr_ns(sender,
4001 task_active_pid_ns(current));
4006 tr.data_size = t->buffer->data_size;
4007 tr.offsets_size = t->buffer->offsets_size;
4008 tr.data.ptr.buffer = (binder_uintptr_t)
4009 ((uintptr_t)t->buffer->data +
4010 binder_alloc_get_user_buffer_offset(&proc->alloc));
4011 tr.data.ptr.offsets = tr.data.ptr.buffer +
4012 ALIGN(t->buffer->data_size,
4015 if (put_user(cmd, (uint32_t __user *)ptr)) {
4017 binder_thread_dec_tmpref(t_from);
4020 ptr += sizeof(uint32_t);
4021 if (copy_to_user(ptr, &tr, sizeof(tr))) {
4023 binder_thread_dec_tmpref(t_from);
4028 trace_binder_transaction_received(t);
4029 binder_stat_br(proc, thread, cmd);
4030 binder_debug(BINDER_DEBUG_TRANSACTION,
4031 "%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n",
4032 proc->pid, thread->pid,
4033 (cmd == BR_TRANSACTION) ? "BR_TRANSACTION" :
4035 t->debug_id, t_from ? t_from->proc->pid : 0,
4036 t_from ? t_from->pid : 0, cmd,
4037 t->buffer->data_size, t->buffer->offsets_size,
4038 (u64)tr.data.ptr.buffer, (u64)tr.data.ptr.offsets);
4041 binder_thread_dec_tmpref(t_from);
4042 t->buffer->allow_user_free = 1;
4043 if (cmd == BR_TRANSACTION && !(t->flags & TF_ONE_WAY)) {
4044 binder_inner_proc_lock(thread->proc);
4045 t->to_parent = thread->transaction_stack;
4046 t->to_thread = thread;
4047 thread->transaction_stack = t;
4048 binder_inner_proc_unlock(thread->proc);
4050 binder_free_transaction(t);
4057 *consumed = ptr - buffer;
4058 binder_inner_proc_lock(proc);
4059 if (proc->requested_threads == 0 &&
4060 list_empty(&thread->proc->waiting_threads) &&
4061 proc->requested_threads_started < proc->max_threads &&
4062 (thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
4063 BINDER_LOOPER_STATE_ENTERED)) /* the user-space code fails to */
4064 /*spawn a new thread if we leave this out */) {
4065 proc->requested_threads++;
4066 binder_inner_proc_unlock(proc);
4067 binder_debug(BINDER_DEBUG_THREADS,
4068 "%d:%d BR_SPAWN_LOOPER\n",
4069 proc->pid, thread->pid);
4070 if (put_user(BR_SPAWN_LOOPER, (uint32_t __user *)buffer))
4072 binder_stat_br(proc, thread, BR_SPAWN_LOOPER);
4074 binder_inner_proc_unlock(proc);
4078 static void binder_release_work(struct binder_proc *proc,
4079 struct list_head *list)
4081 struct binder_work *w;
4084 w = binder_dequeue_work_head(proc, list);
4089 case BINDER_WORK_TRANSACTION: {
4090 struct binder_transaction *t;
4092 t = container_of(w, struct binder_transaction, work);
4093 if (t->buffer->target_node &&
4094 !(t->flags & TF_ONE_WAY)) {
4095 binder_send_failed_reply(t, BR_DEAD_REPLY);
4097 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4098 "undelivered transaction %d\n",
4100 binder_free_transaction(t);
4103 case BINDER_WORK_RETURN_ERROR: {
4104 struct binder_error *e = container_of(
4105 w, struct binder_error, work);
4107 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4108 "undelivered TRANSACTION_ERROR: %u\n",
4111 case BINDER_WORK_TRANSACTION_COMPLETE: {
4112 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4113 "undelivered TRANSACTION_COMPLETE\n");
4115 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
4117 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4118 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
4119 struct binder_ref_death *death;
4121 death = container_of(w, struct binder_ref_death, work);
4122 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4123 "undelivered death notification, %016llx\n",
4124 (u64)death->cookie);
4126 binder_stats_deleted(BINDER_STAT_DEATH);
4129 pr_err("unexpected work type, %d, not freed\n",
4137 static struct binder_thread *binder_get_thread_ilocked(
4138 struct binder_proc *proc, struct binder_thread *new_thread)
4140 struct binder_thread *thread = NULL;
4141 struct rb_node *parent = NULL;
4142 struct rb_node **p = &proc->threads.rb_node;
4146 thread = rb_entry(parent, struct binder_thread, rb_node);
4148 if (current->pid < thread->pid)
4150 else if (current->pid > thread->pid)
4151 p = &(*p)->rb_right;
4157 thread = new_thread;
4158 binder_stats_created(BINDER_STAT_THREAD);
4159 thread->proc = proc;
4160 thread->pid = current->pid;
4161 atomic_set(&thread->tmp_ref, 0);
4162 init_waitqueue_head(&thread->wait);
4163 INIT_LIST_HEAD(&thread->todo);
4164 rb_link_node(&thread->rb_node, parent, p);
4165 rb_insert_color(&thread->rb_node, &proc->threads);
4166 thread->looper_need_return = true;
4167 thread->return_error.work.type = BINDER_WORK_RETURN_ERROR;
4168 thread->return_error.cmd = BR_OK;
4169 thread->reply_error.work.type = BINDER_WORK_RETURN_ERROR;
4170 thread->reply_error.cmd = BR_OK;
4171 INIT_LIST_HEAD(&new_thread->waiting_thread_node);
4175 static struct binder_thread *binder_get_thread(struct binder_proc *proc)
4177 struct binder_thread *thread;
4178 struct binder_thread *new_thread;
4180 binder_inner_proc_lock(proc);
4181 thread = binder_get_thread_ilocked(proc, NULL);
4182 binder_inner_proc_unlock(proc);
4184 new_thread = kzalloc(sizeof(*thread), GFP_KERNEL);
4185 if (new_thread == NULL)
4187 binder_inner_proc_lock(proc);
4188 thread = binder_get_thread_ilocked(proc, new_thread);
4189 binder_inner_proc_unlock(proc);
4190 if (thread != new_thread)
4196 static void binder_free_proc(struct binder_proc *proc)
4198 BUG_ON(!list_empty(&proc->todo));
4199 BUG_ON(!list_empty(&proc->delivered_death));
4200 binder_alloc_deferred_release(&proc->alloc);
4201 put_task_struct(proc->tsk);
4202 binder_stats_deleted(BINDER_STAT_PROC);
4206 static void binder_free_thread(struct binder_thread *thread)
4208 BUG_ON(!list_empty(&thread->todo));
4209 binder_stats_deleted(BINDER_STAT_THREAD);
4210 binder_proc_dec_tmpref(thread->proc);
4214 static int binder_thread_release(struct binder_proc *proc,
4215 struct binder_thread *thread)
4217 struct binder_transaction *t;
4218 struct binder_transaction *send_reply = NULL;
4219 int active_transactions = 0;
4220 struct binder_transaction *last_t = NULL;
4222 binder_inner_proc_lock(thread->proc);
4224 * take a ref on the proc so it survives
4225 * after we remove this thread from proc->threads.
4226 * The corresponding dec is when we actually
4227 * free the thread in binder_free_thread()
4231 * take a ref on this thread to ensure it
4232 * survives while we are releasing it
4234 atomic_inc(&thread->tmp_ref);
4235 rb_erase(&thread->rb_node, &proc->threads);
4236 t = thread->transaction_stack;
4238 spin_lock(&t->lock);
4239 if (t->to_thread == thread)
4242 thread->is_dead = true;
4246 active_transactions++;
4247 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4248 "release %d:%d transaction %d %s, still active\n",
4249 proc->pid, thread->pid,
4251 (t->to_thread == thread) ? "in" : "out");
4253 if (t->to_thread == thread) {
4255 t->to_thread = NULL;
4257 t->buffer->transaction = NULL;
4261 } else if (t->from == thread) {
4266 spin_unlock(&last_t->lock);
4268 spin_lock(&t->lock);
4270 binder_inner_proc_unlock(thread->proc);
4273 binder_send_failed_reply(send_reply, BR_DEAD_REPLY);
4274 binder_release_work(proc, &thread->todo);
4275 binder_thread_dec_tmpref(thread);
4276 return active_transactions;
4279 static unsigned int binder_poll(struct file *filp,
4280 struct poll_table_struct *wait)
4282 struct binder_proc *proc = filp->private_data;
4283 struct binder_thread *thread = NULL;
4284 bool wait_for_proc_work;
4286 thread = binder_get_thread(proc);
4288 binder_inner_proc_lock(thread->proc);
4289 thread->looper |= BINDER_LOOPER_STATE_POLL;
4290 wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
4292 binder_inner_proc_unlock(thread->proc);
4294 poll_wait(filp, &thread->wait, wait);
4296 if (binder_has_work(thread, wait_for_proc_work))
4302 static int binder_ioctl_write_read(struct file *filp,
4303 unsigned int cmd, unsigned long arg,
4304 struct binder_thread *thread)
4307 struct binder_proc *proc = filp->private_data;
4308 unsigned int size = _IOC_SIZE(cmd);
4309 void __user *ubuf = (void __user *)arg;
4310 struct binder_write_read bwr;
4312 if (size != sizeof(struct binder_write_read)) {
4316 if (copy_from_user(&bwr, ubuf, sizeof(bwr))) {
4320 binder_debug(BINDER_DEBUG_READ_WRITE,
4321 "%d:%d write %lld at %016llx, read %lld at %016llx\n",
4322 proc->pid, thread->pid,
4323 (u64)bwr.write_size, (u64)bwr.write_buffer,
4324 (u64)bwr.read_size, (u64)bwr.read_buffer);
4326 if (bwr.write_size > 0) {
4327 ret = binder_thread_write(proc, thread,
4330 &bwr.write_consumed);
4331 trace_binder_write_done(ret);
4333 bwr.read_consumed = 0;
4334 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
4339 if (bwr.read_size > 0) {
4340 ret = binder_thread_read(proc, thread, bwr.read_buffer,
4343 filp->f_flags & O_NONBLOCK);
4344 trace_binder_read_done(ret);
4345 binder_inner_proc_lock(proc);
4346 if (!binder_worklist_empty_ilocked(&proc->todo))
4347 binder_wakeup_proc_ilocked(proc);
4348 binder_inner_proc_unlock(proc);
4350 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
4355 binder_debug(BINDER_DEBUG_READ_WRITE,
4356 "%d:%d wrote %lld of %lld, read return %lld of %lld\n",
4357 proc->pid, thread->pid,
4358 (u64)bwr.write_consumed, (u64)bwr.write_size,
4359 (u64)bwr.read_consumed, (u64)bwr.read_size);
4360 if (copy_to_user(ubuf, &bwr, sizeof(bwr))) {
4368 static int binder_ioctl_set_ctx_mgr(struct file *filp)
4371 struct binder_proc *proc = filp->private_data;
4372 struct binder_context *context = proc->context;
4373 struct binder_node *new_node;
4374 kuid_t curr_euid = current_euid();
4376 mutex_lock(&context->context_mgr_node_lock);
4377 if (context->binder_context_mgr_node) {
4378 pr_err("BINDER_SET_CONTEXT_MGR already set\n");
4382 ret = security_binder_set_context_mgr(proc->tsk);
4385 if (uid_valid(context->binder_context_mgr_uid)) {
4386 if (!uid_eq(context->binder_context_mgr_uid, curr_euid)) {
4387 pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
4388 from_kuid(&init_user_ns, curr_euid),
4389 from_kuid(&init_user_ns,
4390 context->binder_context_mgr_uid));
4395 context->binder_context_mgr_uid = curr_euid;
4397 new_node = binder_new_node(proc, NULL);
4402 binder_node_lock(new_node);
4403 new_node->local_weak_refs++;
4404 new_node->local_strong_refs++;
4405 new_node->has_strong_ref = 1;
4406 new_node->has_weak_ref = 1;
4407 context->binder_context_mgr_node = new_node;
4408 binder_node_unlock(new_node);
4409 binder_put_node(new_node);
4411 mutex_unlock(&context->context_mgr_node_lock);
4415 static int binder_ioctl_get_node_debug_info(struct binder_proc *proc,
4416 struct binder_node_debug_info *info)
4419 binder_uintptr_t ptr = info->ptr;
4421 memset(info, 0, sizeof(*info));
4423 binder_inner_proc_lock(proc);
4424 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
4425 struct binder_node *node = rb_entry(n, struct binder_node,
4427 if (node->ptr > ptr) {
4428 info->ptr = node->ptr;
4429 info->cookie = node->cookie;
4430 info->has_strong_ref = node->has_strong_ref;
4431 info->has_weak_ref = node->has_weak_ref;
4435 binder_inner_proc_unlock(proc);
4440 static long binder_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
4443 struct binder_proc *proc = filp->private_data;
4444 struct binder_thread *thread;
4445 unsigned int size = _IOC_SIZE(cmd);
4446 void __user *ubuf = (void __user *)arg;
4448 /*pr_info("binder_ioctl: %d:%d %x %lx\n",
4449 proc->pid, current->pid, cmd, arg);*/
4451 binder_selftest_alloc(&proc->alloc);
4453 trace_binder_ioctl(cmd, arg);
4455 ret = wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
4459 thread = binder_get_thread(proc);
4460 if (thread == NULL) {
4466 case BINDER_WRITE_READ:
4467 ret = binder_ioctl_write_read(filp, cmd, arg, thread);
4471 case BINDER_SET_MAX_THREADS: {
4474 if (copy_from_user(&max_threads, ubuf,
4475 sizeof(max_threads))) {
4479 binder_inner_proc_lock(proc);
4480 proc->max_threads = max_threads;
4481 binder_inner_proc_unlock(proc);
4484 case BINDER_SET_CONTEXT_MGR:
4485 ret = binder_ioctl_set_ctx_mgr(filp);
4489 case BINDER_THREAD_EXIT:
4490 binder_debug(BINDER_DEBUG_THREADS, "%d:%d exit\n",
4491 proc->pid, thread->pid);
4492 binder_thread_release(proc, thread);
4495 case BINDER_VERSION: {
4496 struct binder_version __user *ver = ubuf;
4498 if (size != sizeof(struct binder_version)) {
4502 if (put_user(BINDER_CURRENT_PROTOCOL_VERSION,
4503 &ver->protocol_version)) {
4509 case BINDER_GET_NODE_DEBUG_INFO: {
4510 struct binder_node_debug_info info;
4512 if (copy_from_user(&info, ubuf, sizeof(info))) {
4517 ret = binder_ioctl_get_node_debug_info(proc, &info);
4521 if (copy_to_user(ubuf, &info, sizeof(info))) {
4534 thread->looper_need_return = false;
4535 wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
4536 if (ret && ret != -ERESTARTSYS)
4537 pr_info("%d:%d ioctl %x %lx returned %d\n", proc->pid, current->pid, cmd, arg, ret);
4539 trace_binder_ioctl_done(ret);
4543 static void binder_vma_open(struct vm_area_struct *vma)
4545 struct binder_proc *proc = vma->vm_private_data;
4547 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
4548 "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
4549 proc->pid, vma->vm_start, vma->vm_end,
4550 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
4551 (unsigned long)pgprot_val(vma->vm_page_prot));
4554 static void binder_vma_close(struct vm_area_struct *vma)
4556 struct binder_proc *proc = vma->vm_private_data;
4558 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
4559 "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
4560 proc->pid, vma->vm_start, vma->vm_end,
4561 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
4562 (unsigned long)pgprot_val(vma->vm_page_prot));
4563 binder_alloc_vma_close(&proc->alloc);
4564 binder_defer_work(proc, BINDER_DEFERRED_PUT_FILES);
4567 static int binder_vm_fault(struct vm_fault *vmf)
4569 return VM_FAULT_SIGBUS;
4572 static const struct vm_operations_struct binder_vm_ops = {
4573 .open = binder_vma_open,
4574 .close = binder_vma_close,
4575 .fault = binder_vm_fault,
4578 static int binder_mmap(struct file *filp, struct vm_area_struct *vma)
4581 struct binder_proc *proc = filp->private_data;
4582 const char *failure_string;
4584 if (proc->tsk != current->group_leader)
4587 if ((vma->vm_end - vma->vm_start) > SZ_4M)
4588 vma->vm_end = vma->vm_start + SZ_4M;
4590 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
4591 "%s: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
4592 __func__, proc->pid, vma->vm_start, vma->vm_end,
4593 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
4594 (unsigned long)pgprot_val(vma->vm_page_prot));
4596 if (vma->vm_flags & FORBIDDEN_MMAP_FLAGS) {
4598 failure_string = "bad vm_flags";
4601 vma->vm_flags = (vma->vm_flags | VM_DONTCOPY) & ~VM_MAYWRITE;
4602 vma->vm_ops = &binder_vm_ops;
4603 vma->vm_private_data = proc;
4605 ret = binder_alloc_mmap_handler(&proc->alloc, vma);
4608 proc->files = get_files_struct(current);
4612 pr_err("binder_mmap: %d %lx-%lx %s failed %d\n",
4613 proc->pid, vma->vm_start, vma->vm_end, failure_string, ret);
4617 static int binder_open(struct inode *nodp, struct file *filp)
4619 struct binder_proc *proc;
4620 struct binder_device *binder_dev;
4622 binder_debug(BINDER_DEBUG_OPEN_CLOSE, "binder_open: %d:%d\n",
4623 current->group_leader->pid, current->pid);
4625 proc = kzalloc(sizeof(*proc), GFP_KERNEL);
4628 spin_lock_init(&proc->inner_lock);
4629 spin_lock_init(&proc->outer_lock);
4630 get_task_struct(current->group_leader);
4631 proc->tsk = current->group_leader;
4632 INIT_LIST_HEAD(&proc->todo);
4633 proc->default_priority = task_nice(current);
4634 binder_dev = container_of(filp->private_data, struct binder_device,
4636 proc->context = &binder_dev->context;
4637 binder_alloc_init(&proc->alloc);
4639 binder_stats_created(BINDER_STAT_PROC);
4640 proc->pid = current->group_leader->pid;
4641 INIT_LIST_HEAD(&proc->delivered_death);
4642 INIT_LIST_HEAD(&proc->waiting_threads);
4643 filp->private_data = proc;
4645 mutex_lock(&binder_procs_lock);
4646 hlist_add_head(&proc->proc_node, &binder_procs);
4647 mutex_unlock(&binder_procs_lock);
4649 if (binder_debugfs_dir_entry_proc) {
4652 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
4654 * proc debug entries are shared between contexts, so
4655 * this will fail if the process tries to open the driver
4656 * again with a different context. The priting code will
4657 * anyway print all contexts that a given PID has, so this
4660 proc->debugfs_entry = debugfs_create_file(strbuf, S_IRUGO,
4661 binder_debugfs_dir_entry_proc,
4662 (void *)(unsigned long)proc->pid,
4669 static int binder_flush(struct file *filp, fl_owner_t id)
4671 struct binder_proc *proc = filp->private_data;
4673 binder_defer_work(proc, BINDER_DEFERRED_FLUSH);
4678 static void binder_deferred_flush(struct binder_proc *proc)
4683 binder_inner_proc_lock(proc);
4684 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
4685 struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node);
4687 thread->looper_need_return = true;
4688 if (thread->looper & BINDER_LOOPER_STATE_WAITING) {
4689 wake_up_interruptible(&thread->wait);
4693 binder_inner_proc_unlock(proc);
4695 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
4696 "binder_flush: %d woke %d threads\n", proc->pid,
4700 static int binder_release(struct inode *nodp, struct file *filp)
4702 struct binder_proc *proc = filp->private_data;
4704 debugfs_remove(proc->debugfs_entry);
4705 binder_defer_work(proc, BINDER_DEFERRED_RELEASE);
4710 static int binder_node_release(struct binder_node *node, int refs)
4712 struct binder_ref *ref;
4714 struct binder_proc *proc = node->proc;
4716 binder_release_work(proc, &node->async_todo);
4718 binder_node_lock(node);
4719 binder_inner_proc_lock(proc);
4720 binder_dequeue_work_ilocked(&node->work);
4722 * The caller must have taken a temporary ref on the node,
4724 BUG_ON(!node->tmp_refs);
4725 if (hlist_empty(&node->refs) && node->tmp_refs == 1) {
4726 binder_inner_proc_unlock(proc);
4727 binder_node_unlock(node);
4728 binder_free_node(node);
4734 node->local_strong_refs = 0;
4735 node->local_weak_refs = 0;
4736 binder_inner_proc_unlock(proc);
4738 spin_lock(&binder_dead_nodes_lock);
4739 hlist_add_head(&node->dead_node, &binder_dead_nodes);
4740 spin_unlock(&binder_dead_nodes_lock);
4742 hlist_for_each_entry(ref, &node->refs, node_entry) {
4745 * Need the node lock to synchronize
4746 * with new notification requests and the
4747 * inner lock to synchronize with queued
4748 * death notifications.
4750 binder_inner_proc_lock(ref->proc);
4752 binder_inner_proc_unlock(ref->proc);
4758 BUG_ON(!list_empty(&ref->death->work.entry));
4759 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
4760 binder_enqueue_work_ilocked(&ref->death->work,
4762 binder_wakeup_proc_ilocked(ref->proc);
4763 binder_inner_proc_unlock(ref->proc);
4766 binder_debug(BINDER_DEBUG_DEAD_BINDER,
4767 "node %d now dead, refs %d, death %d\n",
4768 node->debug_id, refs, death);
4769 binder_node_unlock(node);
4770 binder_put_node(node);
4775 static void binder_deferred_release(struct binder_proc *proc)
4777 struct binder_context *context = proc->context;
4779 int threads, nodes, incoming_refs, outgoing_refs, active_transactions;
4781 BUG_ON(proc->files);
4783 mutex_lock(&binder_procs_lock);
4784 hlist_del(&proc->proc_node);
4785 mutex_unlock(&binder_procs_lock);
4787 mutex_lock(&context->context_mgr_node_lock);
4788 if (context->binder_context_mgr_node &&
4789 context->binder_context_mgr_node->proc == proc) {
4790 binder_debug(BINDER_DEBUG_DEAD_BINDER,
4791 "%s: %d context_mgr_node gone\n",
4792 __func__, proc->pid);
4793 context->binder_context_mgr_node = NULL;
4795 mutex_unlock(&context->context_mgr_node_lock);
4796 binder_inner_proc_lock(proc);
4798 * Make sure proc stays alive after we
4799 * remove all the threads
4803 proc->is_dead = true;
4805 active_transactions = 0;
4806 while ((n = rb_first(&proc->threads))) {
4807 struct binder_thread *thread;
4809 thread = rb_entry(n, struct binder_thread, rb_node);
4810 binder_inner_proc_unlock(proc);
4812 active_transactions += binder_thread_release(proc, thread);
4813 binder_inner_proc_lock(proc);
4818 while ((n = rb_first(&proc->nodes))) {
4819 struct binder_node *node;
4821 node = rb_entry(n, struct binder_node, rb_node);
4824 * take a temporary ref on the node before
4825 * calling binder_node_release() which will either
4826 * kfree() the node or call binder_put_node()
4828 binder_inc_node_tmpref_ilocked(node);
4829 rb_erase(&node->rb_node, &proc->nodes);
4830 binder_inner_proc_unlock(proc);
4831 incoming_refs = binder_node_release(node, incoming_refs);
4832 binder_inner_proc_lock(proc);
4834 binder_inner_proc_unlock(proc);
4837 binder_proc_lock(proc);
4838 while ((n = rb_first(&proc->refs_by_desc))) {
4839 struct binder_ref *ref;
4841 ref = rb_entry(n, struct binder_ref, rb_node_desc);
4843 binder_cleanup_ref_olocked(ref);
4844 binder_proc_unlock(proc);
4845 binder_free_ref(ref);
4846 binder_proc_lock(proc);
4848 binder_proc_unlock(proc);
4850 binder_release_work(proc, &proc->todo);
4851 binder_release_work(proc, &proc->delivered_death);
4853 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
4854 "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d\n",
4855 __func__, proc->pid, threads, nodes, incoming_refs,
4856 outgoing_refs, active_transactions);
4858 binder_proc_dec_tmpref(proc);
4861 static void binder_deferred_func(struct work_struct *work)
4863 struct binder_proc *proc;
4864 struct files_struct *files;
4869 mutex_lock(&binder_deferred_lock);
4870 if (!hlist_empty(&binder_deferred_list)) {
4871 proc = hlist_entry(binder_deferred_list.first,
4872 struct binder_proc, deferred_work_node);
4873 hlist_del_init(&proc->deferred_work_node);
4874 defer = proc->deferred_work;
4875 proc->deferred_work = 0;
4880 mutex_unlock(&binder_deferred_lock);
4883 if (defer & BINDER_DEFERRED_PUT_FILES) {
4884 files = proc->files;
4889 if (defer & BINDER_DEFERRED_FLUSH)
4890 binder_deferred_flush(proc);
4892 if (defer & BINDER_DEFERRED_RELEASE)
4893 binder_deferred_release(proc); /* frees proc */
4896 put_files_struct(files);
4899 static DECLARE_WORK(binder_deferred_work, binder_deferred_func);
4902 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer)
4904 mutex_lock(&binder_deferred_lock);
4905 proc->deferred_work |= defer;
4906 if (hlist_unhashed(&proc->deferred_work_node)) {
4907 hlist_add_head(&proc->deferred_work_node,
4908 &binder_deferred_list);
4909 schedule_work(&binder_deferred_work);
4911 mutex_unlock(&binder_deferred_lock);
4914 static void print_binder_transaction_ilocked(struct seq_file *m,
4915 struct binder_proc *proc,
4917 struct binder_transaction *t)
4919 struct binder_proc *to_proc;
4920 struct binder_buffer *buffer = t->buffer;
4922 spin_lock(&t->lock);
4923 to_proc = t->to_proc;
4925 "%s %d: %p from %d:%d to %d:%d code %x flags %x pri %ld r%d",
4926 prefix, t->debug_id, t,
4927 t->from ? t->from->proc->pid : 0,
4928 t->from ? t->from->pid : 0,
4929 to_proc ? to_proc->pid : 0,
4930 t->to_thread ? t->to_thread->pid : 0,
4931 t->code, t->flags, t->priority, t->need_reply);
4932 spin_unlock(&t->lock);
4934 if (proc != to_proc) {
4936 * Can only safely deref buffer if we are holding the
4937 * correct proc inner lock for this node
4943 if (buffer == NULL) {
4944 seq_puts(m, " buffer free\n");
4947 if (buffer->target_node)
4948 seq_printf(m, " node %d", buffer->target_node->debug_id);
4949 seq_printf(m, " size %zd:%zd data %p\n",
4950 buffer->data_size, buffer->offsets_size,
4954 static void print_binder_work_ilocked(struct seq_file *m,
4955 struct binder_proc *proc,
4957 const char *transaction_prefix,
4958 struct binder_work *w)
4960 struct binder_node *node;
4961 struct binder_transaction *t;
4964 case BINDER_WORK_TRANSACTION:
4965 t = container_of(w, struct binder_transaction, work);
4966 print_binder_transaction_ilocked(
4967 m, proc, transaction_prefix, t);
4969 case BINDER_WORK_RETURN_ERROR: {
4970 struct binder_error *e = container_of(
4971 w, struct binder_error, work);
4973 seq_printf(m, "%stransaction error: %u\n",
4976 case BINDER_WORK_TRANSACTION_COMPLETE:
4977 seq_printf(m, "%stransaction complete\n", prefix);
4979 case BINDER_WORK_NODE:
4980 node = container_of(w, struct binder_node, work);
4981 seq_printf(m, "%snode work %d: u%016llx c%016llx\n",
4982 prefix, node->debug_id,
4983 (u64)node->ptr, (u64)node->cookie);
4985 case BINDER_WORK_DEAD_BINDER:
4986 seq_printf(m, "%shas dead binder\n", prefix);
4988 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4989 seq_printf(m, "%shas cleared dead binder\n", prefix);
4991 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION:
4992 seq_printf(m, "%shas cleared death notification\n", prefix);
4995 seq_printf(m, "%sunknown work: type %d\n", prefix, w->type);
5000 static void print_binder_thread_ilocked(struct seq_file *m,
5001 struct binder_thread *thread,
5004 struct binder_transaction *t;
5005 struct binder_work *w;
5006 size_t start_pos = m->count;
5009 seq_printf(m, " thread %d: l %02x need_return %d tr %d\n",
5010 thread->pid, thread->looper,
5011 thread->looper_need_return,
5012 atomic_read(&thread->tmp_ref));
5013 header_pos = m->count;
5014 t = thread->transaction_stack;
5016 if (t->from == thread) {
5017 print_binder_transaction_ilocked(m, thread->proc,
5018 " outgoing transaction", t);
5020 } else if (t->to_thread == thread) {
5021 print_binder_transaction_ilocked(m, thread->proc,
5022 " incoming transaction", t);
5025 print_binder_transaction_ilocked(m, thread->proc,
5026 " bad transaction", t);
5030 list_for_each_entry(w, &thread->todo, entry) {
5031 print_binder_work_ilocked(m, thread->proc, " ",
5032 " pending transaction", w);
5034 if (!print_always && m->count == header_pos)
5035 m->count = start_pos;
5038 static void print_binder_node_nilocked(struct seq_file *m,
5039 struct binder_node *node)
5041 struct binder_ref *ref;
5042 struct binder_work *w;
5046 hlist_for_each_entry(ref, &node->refs, node_entry)
5049 seq_printf(m, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d tr %d",
5050 node->debug_id, (u64)node->ptr, (u64)node->cookie,
5051 node->has_strong_ref, node->has_weak_ref,
5052 node->local_strong_refs, node->local_weak_refs,
5053 node->internal_strong_refs, count, node->tmp_refs);
5055 seq_puts(m, " proc");
5056 hlist_for_each_entry(ref, &node->refs, node_entry)
5057 seq_printf(m, " %d", ref->proc->pid);
5061 list_for_each_entry(w, &node->async_todo, entry)
5062 print_binder_work_ilocked(m, node->proc, " ",
5063 " pending async transaction", w);
5067 static void print_binder_ref_olocked(struct seq_file *m,
5068 struct binder_ref *ref)
5070 binder_node_lock(ref->node);
5071 seq_printf(m, " ref %d: desc %d %snode %d s %d w %d d %pK\n",
5072 ref->data.debug_id, ref->data.desc,
5073 ref->node->proc ? "" : "dead ",
5074 ref->node->debug_id, ref->data.strong,
5075 ref->data.weak, ref->death);
5076 binder_node_unlock(ref->node);
5079 static void print_binder_proc(struct seq_file *m,
5080 struct binder_proc *proc, int print_all)
5082 struct binder_work *w;
5084 size_t start_pos = m->count;
5086 struct binder_node *last_node = NULL;
5088 seq_printf(m, "proc %d\n", proc->pid);
5089 seq_printf(m, "context %s\n", proc->context->name);
5090 header_pos = m->count;
5092 binder_inner_proc_lock(proc);
5093 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
5094 print_binder_thread_ilocked(m, rb_entry(n, struct binder_thread,
5095 rb_node), print_all);
5097 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
5098 struct binder_node *node = rb_entry(n, struct binder_node,
5101 * take a temporary reference on the node so it
5102 * survives and isn't removed from the tree
5103 * while we print it.
5105 binder_inc_node_tmpref_ilocked(node);
5106 /* Need to drop inner lock to take node lock */
5107 binder_inner_proc_unlock(proc);
5109 binder_put_node(last_node);
5110 binder_node_inner_lock(node);
5111 print_binder_node_nilocked(m, node);
5112 binder_node_inner_unlock(node);
5114 binder_inner_proc_lock(proc);
5116 binder_inner_proc_unlock(proc);
5118 binder_put_node(last_node);
5121 binder_proc_lock(proc);
5122 for (n = rb_first(&proc->refs_by_desc);
5125 print_binder_ref_olocked(m, rb_entry(n,
5128 binder_proc_unlock(proc);
5130 binder_alloc_print_allocated(m, &proc->alloc);
5131 binder_inner_proc_lock(proc);
5132 list_for_each_entry(w, &proc->todo, entry)
5133 print_binder_work_ilocked(m, proc, " ",
5134 " pending transaction", w);
5135 list_for_each_entry(w, &proc->delivered_death, entry) {
5136 seq_puts(m, " has delivered dead binder\n");
5139 binder_inner_proc_unlock(proc);
5140 if (!print_all && m->count == header_pos)
5141 m->count = start_pos;
5144 static const char * const binder_return_strings[] = {
5149 "BR_ACQUIRE_RESULT",
5151 "BR_TRANSACTION_COMPLETE",
5156 "BR_ATTEMPT_ACQUIRE",
5161 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
5165 static const char * const binder_command_strings[] = {
5168 "BC_ACQUIRE_RESULT",
5176 "BC_ATTEMPT_ACQUIRE",
5177 "BC_REGISTER_LOOPER",
5180 "BC_REQUEST_DEATH_NOTIFICATION",
5181 "BC_CLEAR_DEATH_NOTIFICATION",
5182 "BC_DEAD_BINDER_DONE",
5183 "BC_TRANSACTION_SG",
5187 static const char * const binder_objstat_strings[] = {
5194 "transaction_complete"
5197 static void print_binder_stats(struct seq_file *m, const char *prefix,
5198 struct binder_stats *stats)
5202 BUILD_BUG_ON(ARRAY_SIZE(stats->bc) !=
5203 ARRAY_SIZE(binder_command_strings));
5204 for (i = 0; i < ARRAY_SIZE(stats->bc); i++) {
5205 int temp = atomic_read(&stats->bc[i]);
5208 seq_printf(m, "%s%s: %d\n", prefix,
5209 binder_command_strings[i], temp);
5212 BUILD_BUG_ON(ARRAY_SIZE(stats->br) !=
5213 ARRAY_SIZE(binder_return_strings));
5214 for (i = 0; i < ARRAY_SIZE(stats->br); i++) {
5215 int temp = atomic_read(&stats->br[i]);
5218 seq_printf(m, "%s%s: %d\n", prefix,
5219 binder_return_strings[i], temp);
5222 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
5223 ARRAY_SIZE(binder_objstat_strings));
5224 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
5225 ARRAY_SIZE(stats->obj_deleted));
5226 for (i = 0; i < ARRAY_SIZE(stats->obj_created); i++) {
5227 int created = atomic_read(&stats->obj_created[i]);
5228 int deleted = atomic_read(&stats->obj_deleted[i]);
5230 if (created || deleted)
5231 seq_printf(m, "%s%s: active %d total %d\n",
5233 binder_objstat_strings[i],
5239 static void print_binder_proc_stats(struct seq_file *m,
5240 struct binder_proc *proc)
5242 struct binder_work *w;
5243 struct binder_thread *thread;
5245 int count, strong, weak, ready_threads;
5246 size_t free_async_space =
5247 binder_alloc_get_free_async_space(&proc->alloc);
5249 seq_printf(m, "proc %d\n", proc->pid);
5250 seq_printf(m, "context %s\n", proc->context->name);
5253 binder_inner_proc_lock(proc);
5254 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
5257 list_for_each_entry(thread, &proc->waiting_threads, waiting_thread_node)
5260 seq_printf(m, " threads: %d\n", count);
5261 seq_printf(m, " requested threads: %d+%d/%d\n"
5262 " ready threads %d\n"
5263 " free async space %zd\n", proc->requested_threads,
5264 proc->requested_threads_started, proc->max_threads,
5268 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n))
5270 binder_inner_proc_unlock(proc);
5271 seq_printf(m, " nodes: %d\n", count);
5275 binder_proc_lock(proc);
5276 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
5277 struct binder_ref *ref = rb_entry(n, struct binder_ref,
5280 strong += ref->data.strong;
5281 weak += ref->data.weak;
5283 binder_proc_unlock(proc);
5284 seq_printf(m, " refs: %d s %d w %d\n", count, strong, weak);
5286 count = binder_alloc_get_allocated_count(&proc->alloc);
5287 seq_printf(m, " buffers: %d\n", count);
5289 binder_alloc_print_pages(m, &proc->alloc);
5292 binder_inner_proc_lock(proc);
5293 list_for_each_entry(w, &proc->todo, entry) {
5294 if (w->type == BINDER_WORK_TRANSACTION)
5297 binder_inner_proc_unlock(proc);
5298 seq_printf(m, " pending transactions: %d\n", count);
5300 print_binder_stats(m, " ", &proc->stats);
5304 static int binder_state_show(struct seq_file *m, void *unused)
5306 struct binder_proc *proc;
5307 struct binder_node *node;
5308 struct binder_node *last_node = NULL;
5310 seq_puts(m, "binder state:\n");
5312 spin_lock(&binder_dead_nodes_lock);
5313 if (!hlist_empty(&binder_dead_nodes))
5314 seq_puts(m, "dead nodes:\n");
5315 hlist_for_each_entry(node, &binder_dead_nodes, dead_node) {
5317 * take a temporary reference on the node so it
5318 * survives and isn't removed from the list
5319 * while we print it.
5322 spin_unlock(&binder_dead_nodes_lock);
5324 binder_put_node(last_node);
5325 binder_node_lock(node);
5326 print_binder_node_nilocked(m, node);
5327 binder_node_unlock(node);
5329 spin_lock(&binder_dead_nodes_lock);
5331 spin_unlock(&binder_dead_nodes_lock);
5333 binder_put_node(last_node);
5335 mutex_lock(&binder_procs_lock);
5336 hlist_for_each_entry(proc, &binder_procs, proc_node)
5337 print_binder_proc(m, proc, 1);
5338 mutex_unlock(&binder_procs_lock);
5343 static int binder_stats_show(struct seq_file *m, void *unused)
5345 struct binder_proc *proc;
5347 seq_puts(m, "binder stats:\n");
5349 print_binder_stats(m, "", &binder_stats);
5351 mutex_lock(&binder_procs_lock);
5352 hlist_for_each_entry(proc, &binder_procs, proc_node)
5353 print_binder_proc_stats(m, proc);
5354 mutex_unlock(&binder_procs_lock);
5359 static int binder_transactions_show(struct seq_file *m, void *unused)
5361 struct binder_proc *proc;
5363 seq_puts(m, "binder transactions:\n");
5364 mutex_lock(&binder_procs_lock);
5365 hlist_for_each_entry(proc, &binder_procs, proc_node)
5366 print_binder_proc(m, proc, 0);
5367 mutex_unlock(&binder_procs_lock);
5372 static int binder_proc_show(struct seq_file *m, void *unused)
5374 struct binder_proc *itr;
5375 int pid = (unsigned long)m->private;
5377 mutex_lock(&binder_procs_lock);
5378 hlist_for_each_entry(itr, &binder_procs, proc_node) {
5379 if (itr->pid == pid) {
5380 seq_puts(m, "binder proc state:\n");
5381 print_binder_proc(m, itr, 1);
5384 mutex_unlock(&binder_procs_lock);
5389 static void print_binder_transaction_log_entry(struct seq_file *m,
5390 struct binder_transaction_log_entry *e)
5392 int debug_id = READ_ONCE(e->debug_id_done);
5394 * read barrier to guarantee debug_id_done read before
5395 * we print the log values
5399 "%d: %s from %d:%d to %d:%d context %s node %d handle %d size %d:%d ret %d/%d l=%d",
5400 e->debug_id, (e->call_type == 2) ? "reply" :
5401 ((e->call_type == 1) ? "async" : "call "), e->from_proc,
5402 e->from_thread, e->to_proc, e->to_thread, e->context_name,
5403 e->to_node, e->target_handle, e->data_size, e->offsets_size,
5404 e->return_error, e->return_error_param,
5405 e->return_error_line);
5407 * read-barrier to guarantee read of debug_id_done after
5408 * done printing the fields of the entry
5411 seq_printf(m, debug_id && debug_id == READ_ONCE(e->debug_id_done) ?
5412 "\n" : " (incomplete)\n");
5415 static int binder_transaction_log_show(struct seq_file *m, void *unused)
5417 struct binder_transaction_log *log = m->private;
5418 unsigned int log_cur = atomic_read(&log->cur);
5423 count = log_cur + 1;
5424 cur = count < ARRAY_SIZE(log->entry) && !log->full ?
5425 0 : count % ARRAY_SIZE(log->entry);
5426 if (count > ARRAY_SIZE(log->entry) || log->full)
5427 count = ARRAY_SIZE(log->entry);
5428 for (i = 0; i < count; i++) {
5429 unsigned int index = cur++ % ARRAY_SIZE(log->entry);
5431 print_binder_transaction_log_entry(m, &log->entry[index]);
5436 static const struct file_operations binder_fops = {
5437 .owner = THIS_MODULE,
5438 .poll = binder_poll,
5439 .unlocked_ioctl = binder_ioctl,
5440 .compat_ioctl = binder_ioctl,
5441 .mmap = binder_mmap,
5442 .open = binder_open,
5443 .flush = binder_flush,
5444 .release = binder_release,
5447 BINDER_DEBUG_ENTRY(state);
5448 BINDER_DEBUG_ENTRY(stats);
5449 BINDER_DEBUG_ENTRY(transactions);
5450 BINDER_DEBUG_ENTRY(transaction_log);
5452 static int __init init_binder_device(const char *name)
5455 struct binder_device *binder_device;
5457 binder_device = kzalloc(sizeof(*binder_device), GFP_KERNEL);
5461 binder_device->miscdev.fops = &binder_fops;
5462 binder_device->miscdev.minor = MISC_DYNAMIC_MINOR;
5463 binder_device->miscdev.name = name;
5465 binder_device->context.binder_context_mgr_uid = INVALID_UID;
5466 binder_device->context.name = name;
5467 mutex_init(&binder_device->context.context_mgr_node_lock);
5469 ret = misc_register(&binder_device->miscdev);
5471 kfree(binder_device);
5475 hlist_add_head(&binder_device->hlist, &binder_devices);
5480 static int __init binder_init(void)
5483 char *device_name, *device_names, *device_tmp;
5484 struct binder_device *device;
5485 struct hlist_node *tmp;
5487 binder_alloc_shrinker_init();
5489 atomic_set(&binder_transaction_log.cur, ~0U);
5490 atomic_set(&binder_transaction_log_failed.cur, ~0U);
5492 binder_debugfs_dir_entry_root = debugfs_create_dir("binder", NULL);
5493 if (binder_debugfs_dir_entry_root)
5494 binder_debugfs_dir_entry_proc = debugfs_create_dir("proc",
5495 binder_debugfs_dir_entry_root);
5497 if (binder_debugfs_dir_entry_root) {
5498 debugfs_create_file("state",
5500 binder_debugfs_dir_entry_root,
5502 &binder_state_fops);
5503 debugfs_create_file("stats",
5505 binder_debugfs_dir_entry_root,
5507 &binder_stats_fops);
5508 debugfs_create_file("transactions",
5510 binder_debugfs_dir_entry_root,
5512 &binder_transactions_fops);
5513 debugfs_create_file("transaction_log",
5515 binder_debugfs_dir_entry_root,
5516 &binder_transaction_log,
5517 &binder_transaction_log_fops);
5518 debugfs_create_file("failed_transaction_log",
5520 binder_debugfs_dir_entry_root,
5521 &binder_transaction_log_failed,
5522 &binder_transaction_log_fops);
5526 * Copy the module_parameter string, because we don't want to
5527 * tokenize it in-place.
5529 device_names = kzalloc(strlen(binder_devices_param) + 1, GFP_KERNEL);
5530 if (!device_names) {
5532 goto err_alloc_device_names_failed;
5534 strcpy(device_names, binder_devices_param);
5536 device_tmp = device_names;
5537 while ((device_name = strsep(&device_tmp, ","))) {
5538 ret = init_binder_device(device_name);
5540 goto err_init_binder_device_failed;
5545 err_init_binder_device_failed:
5546 hlist_for_each_entry_safe(device, tmp, &binder_devices, hlist) {
5547 misc_deregister(&device->miscdev);
5548 hlist_del(&device->hlist);
5552 kfree(device_names);
5554 err_alloc_device_names_failed:
5555 debugfs_remove_recursive(binder_debugfs_dir_entry_root);
5560 device_initcall(binder_init);
5562 #define CREATE_TRACE_POINTS
5563 #include "binder_trace.h"
5565 MODULE_LICENSE("GPL v2");