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.
18 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
20 #include <asm/cacheflush.h>
21 #include <linux/fdtable.h>
22 #include <linux/file.h>
23 #include <linux/freezer.h>
25 #include <linux/list.h>
26 #include <linux/miscdevice.h>
28 #include <linux/module.h>
29 #include <linux/rtmutex.h>
30 #include <linux/mutex.h>
31 #include <linux/nsproxy.h>
32 #include <linux/poll.h>
33 #include <linux/debugfs.h>
34 #include <linux/rbtree.h>
35 #include <linux/sched.h>
36 #include <linux/seq_file.h>
37 #include <linux/uaccess.h>
38 #include <linux/vmalloc.h>
39 #include <linux/slab.h>
40 #include <linux/pid_namespace.h>
42 #ifdef CONFIG_ANDROID_BINDER_IPC_32BIT
43 #define BINDER_IPC_32BIT 1
46 #include <uapi/linux/android/binder.h>
47 #include "binder_trace.h"
49 static DEFINE_RT_MUTEX(binder_main_lock);
50 static DEFINE_MUTEX(binder_deferred_lock);
51 static DEFINE_MUTEX(binder_mmap_lock);
53 static HLIST_HEAD(binder_procs);
54 static HLIST_HEAD(binder_deferred_list);
55 static HLIST_HEAD(binder_dead_nodes);
57 static struct dentry *binder_debugfs_dir_entry_root;
58 static struct dentry *binder_debugfs_dir_entry_proc;
59 static struct binder_node *binder_context_mgr_node;
60 static kuid_t binder_context_mgr_uid = INVALID_UID;
61 static int binder_last_id;
62 static struct workqueue_struct *binder_deferred_workqueue;
64 #define BINDER_DEBUG_ENTRY(name) \
65 static int binder_##name##_open(struct inode *inode, struct file *file) \
67 return single_open(file, binder_##name##_show, inode->i_private); \
70 static const struct file_operations binder_##name##_fops = { \
71 .owner = THIS_MODULE, \
72 .open = binder_##name##_open, \
74 .llseek = seq_lseek, \
75 .release = single_release, \
78 static int binder_proc_show(struct seq_file *m, void *unused);
79 BINDER_DEBUG_ENTRY(proc);
81 /* This is only defined in include/asm-arm/sizes.h */
87 #define SZ_4M 0x400000
90 #define FORBIDDEN_MMAP_FLAGS (VM_WRITE)
92 #define BINDER_SMALL_BUF_SIZE (PAGE_SIZE * 64)
95 BINDER_DEBUG_USER_ERROR = 1U << 0,
96 BINDER_DEBUG_FAILED_TRANSACTION = 1U << 1,
97 BINDER_DEBUG_DEAD_TRANSACTION = 1U << 2,
98 BINDER_DEBUG_OPEN_CLOSE = 1U << 3,
99 BINDER_DEBUG_DEAD_BINDER = 1U << 4,
100 BINDER_DEBUG_DEATH_NOTIFICATION = 1U << 5,
101 BINDER_DEBUG_READ_WRITE = 1U << 6,
102 BINDER_DEBUG_USER_REFS = 1U << 7,
103 BINDER_DEBUG_THREADS = 1U << 8,
104 BINDER_DEBUG_TRANSACTION = 1U << 9,
105 BINDER_DEBUG_TRANSACTION_COMPLETE = 1U << 10,
106 BINDER_DEBUG_FREE_BUFFER = 1U << 11,
107 BINDER_DEBUG_INTERNAL_REFS = 1U << 12,
108 BINDER_DEBUG_BUFFER_ALLOC = 1U << 13,
109 BINDER_DEBUG_PRIORITY_CAP = 1U << 14,
110 BINDER_DEBUG_BUFFER_ALLOC_ASYNC = 1U << 15,
112 static uint32_t binder_debug_mask = BINDER_DEBUG_USER_ERROR |
113 BINDER_DEBUG_FAILED_TRANSACTION | BINDER_DEBUG_DEAD_TRANSACTION;
114 module_param_named(debug_mask, binder_debug_mask, uint, S_IWUSR | S_IRUGO);
116 static bool binder_debug_no_lock;
117 module_param_named(proc_no_lock, binder_debug_no_lock, bool, S_IWUSR | S_IRUGO);
119 static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait);
120 static int binder_stop_on_user_error;
122 static int binder_set_stop_on_user_error(const char *val,
123 struct kernel_param *kp)
127 ret = param_set_int(val, kp);
128 if (binder_stop_on_user_error < 2)
129 wake_up(&binder_user_error_wait);
132 module_param_call(stop_on_user_error, binder_set_stop_on_user_error,
133 param_get_int, &binder_stop_on_user_error, S_IWUSR | S_IRUGO);
135 #define binder_debug(mask, x...) \
137 if (binder_debug_mask & mask) \
141 #define binder_user_error(x...) \
143 if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) \
145 if (binder_stop_on_user_error) \
146 binder_stop_on_user_error = 2; \
149 enum binder_stat_types {
155 BINDER_STAT_TRANSACTION,
156 BINDER_STAT_TRANSACTION_COMPLETE,
160 struct binder_stats {
161 int br[_IOC_NR(BR_FAILED_REPLY) + 1];
162 int bc[_IOC_NR(BC_DEAD_BINDER_DONE) + 1];
163 int obj_created[BINDER_STAT_COUNT];
164 int obj_deleted[BINDER_STAT_COUNT];
167 static struct binder_stats binder_stats;
169 static inline void binder_stats_deleted(enum binder_stat_types type)
171 binder_stats.obj_deleted[type]++;
174 static inline void binder_stats_created(enum binder_stat_types type)
176 binder_stats.obj_created[type]++;
179 struct binder_transaction_log_entry {
191 struct binder_transaction_log {
194 struct binder_transaction_log_entry entry[32];
196 static struct binder_transaction_log binder_transaction_log;
197 static struct binder_transaction_log binder_transaction_log_failed;
199 static struct binder_transaction_log_entry *binder_transaction_log_add(
200 struct binder_transaction_log *log)
202 struct binder_transaction_log_entry *e;
204 e = &log->entry[log->next];
205 memset(e, 0, sizeof(*e));
207 if (log->next == ARRAY_SIZE(log->entry)) {
215 struct list_head entry;
217 BINDER_WORK_TRANSACTION = 1,
218 BINDER_WORK_TRANSACTION_COMPLETE,
220 BINDER_WORK_DEAD_BINDER,
221 BINDER_WORK_DEAD_BINDER_AND_CLEAR,
222 BINDER_WORK_CLEAR_DEATH_NOTIFICATION,
228 struct binder_work work;
230 struct rb_node rb_node;
231 struct hlist_node dead_node;
233 struct binder_proc *proc;
234 struct hlist_head refs;
235 int internal_strong_refs;
237 int local_strong_refs;
238 binder_uintptr_t ptr;
239 binder_uintptr_t cookie;
240 unsigned has_strong_ref:1;
241 unsigned pending_strong_ref:1;
242 unsigned has_weak_ref:1;
243 unsigned pending_weak_ref:1;
244 unsigned has_async_transaction:1;
245 unsigned accept_fds:1;
246 unsigned min_priority:8;
247 struct list_head async_todo;
250 struct binder_ref_death {
251 struct binder_work work;
252 binder_uintptr_t cookie;
256 /* Lookups needed: */
257 /* node + proc => ref (transaction) */
258 /* desc + proc => ref (transaction, inc/dec ref) */
259 /* node => refs + procs (proc exit) */
261 struct rb_node rb_node_desc;
262 struct rb_node rb_node_node;
263 struct hlist_node node_entry;
264 struct binder_proc *proc;
265 struct binder_node *node;
269 struct binder_ref_death *death;
272 struct binder_buffer {
273 struct list_head entry; /* free and allocated entries by address */
274 struct rb_node rb_node; /* free entry by size or allocated entry */
277 unsigned allow_user_free:1;
278 unsigned async_transaction:1;
279 unsigned debug_id:29;
281 struct binder_transaction *transaction;
283 struct binder_node *target_node;
289 enum binder_deferred_state {
290 BINDER_DEFERRED_PUT_FILES = 0x01,
291 BINDER_DEFERRED_FLUSH = 0x02,
292 BINDER_DEFERRED_RELEASE = 0x04,
296 struct hlist_node proc_node;
297 struct rb_root threads;
298 struct rb_root nodes;
299 struct rb_root refs_by_desc;
300 struct rb_root refs_by_node;
302 struct vm_area_struct *vma;
303 struct mm_struct *vma_vm_mm;
304 struct task_struct *tsk;
305 struct files_struct *files;
306 struct hlist_node deferred_work_node;
309 ptrdiff_t user_buffer_offset;
311 struct list_head buffers;
312 struct rb_root free_buffers;
313 struct rb_root allocated_buffers;
314 size_t free_async_space;
318 uint32_t buffer_free;
319 struct list_head todo;
320 wait_queue_head_t wait;
321 struct binder_stats stats;
322 struct list_head delivered_death;
324 int requested_threads;
325 int requested_threads_started;
327 long default_priority;
328 struct dentry *debugfs_entry;
332 BINDER_LOOPER_STATE_REGISTERED = 0x01,
333 BINDER_LOOPER_STATE_ENTERED = 0x02,
334 BINDER_LOOPER_STATE_EXITED = 0x04,
335 BINDER_LOOPER_STATE_INVALID = 0x08,
336 BINDER_LOOPER_STATE_WAITING = 0x10,
337 BINDER_LOOPER_STATE_NEED_RETURN = 0x20
340 struct binder_thread {
341 struct binder_proc *proc;
342 struct rb_node rb_node;
345 struct binder_transaction *transaction_stack;
346 struct list_head todo;
347 uint32_t return_error; /* Write failed, return error code in read buf */
348 uint32_t return_error2; /* Write failed, return error code in read */
349 /* buffer. Used when sending a reply to a dead process that */
350 /* we are also waiting on */
351 wait_queue_head_t wait;
352 struct binder_stats stats;
355 struct binder_transaction {
357 struct binder_work work;
358 struct binder_thread *from;
359 struct binder_transaction *from_parent;
360 struct binder_proc *to_proc;
361 struct binder_thread *to_thread;
362 struct binder_transaction *to_parent;
363 unsigned need_reply:1;
364 /* unsigned is_dead:1; */ /* not used at the moment */
366 struct binder_buffer *buffer;
375 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer);
377 static int task_get_unused_fd_flags(struct binder_proc *proc, int flags)
379 struct files_struct *files = proc->files;
380 unsigned long rlim_cur;
386 if (!lock_task_sighand(proc->tsk, &irqs))
389 rlim_cur = task_rlimit(proc->tsk, RLIMIT_NOFILE);
390 unlock_task_sighand(proc->tsk, &irqs);
392 return __alloc_fd(files, 0, rlim_cur, flags);
396 * copied from fd_install
398 static void task_fd_install(
399 struct binder_proc *proc, unsigned int fd, struct file *file)
402 __fd_install(proc->files, fd, file);
406 * copied from sys_close
408 static long task_close_fd(struct binder_proc *proc, unsigned int fd)
412 if (proc->files == NULL)
415 retval = __close_fd(proc->files, fd);
416 /* can't restart close syscall because file table entry was cleared */
417 if (unlikely(retval == -ERESTARTSYS ||
418 retval == -ERESTARTNOINTR ||
419 retval == -ERESTARTNOHAND ||
420 retval == -ERESTART_RESTARTBLOCK))
426 static inline void binder_lock(const char *tag)
428 trace_binder_lock(tag);
429 rt_mutex_lock(&binder_main_lock);
430 trace_binder_locked(tag);
433 static inline void binder_unlock(const char *tag)
435 trace_binder_unlock(tag);
436 rt_mutex_unlock(&binder_main_lock);
439 static void binder_set_nice(long nice)
443 if (can_nice(current, nice)) {
444 set_user_nice(current, nice);
447 min_nice = 20 - current->signal->rlim[RLIMIT_NICE].rlim_cur;
448 binder_debug(BINDER_DEBUG_PRIORITY_CAP,
449 "%d: nice value %ld not allowed use %ld instead\n",
450 current->pid, nice, min_nice);
451 set_user_nice(current, min_nice);
454 binder_user_error("%d RLIMIT_NICE not set\n", current->pid);
457 static size_t binder_buffer_size(struct binder_proc *proc,
458 struct binder_buffer *buffer)
460 if (list_is_last(&buffer->entry, &proc->buffers))
461 return proc->buffer + proc->buffer_size - (void *)buffer->data;
462 return (size_t)list_entry(buffer->entry.next,
463 struct binder_buffer, entry) - (size_t)buffer->data;
466 static void binder_insert_free_buffer(struct binder_proc *proc,
467 struct binder_buffer *new_buffer)
469 struct rb_node **p = &proc->free_buffers.rb_node;
470 struct rb_node *parent = NULL;
471 struct binder_buffer *buffer;
473 size_t new_buffer_size;
475 BUG_ON(!new_buffer->free);
477 new_buffer_size = binder_buffer_size(proc, new_buffer);
479 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
480 "%d: add free buffer, size %zd, at %p\n",
481 proc->pid, new_buffer_size, new_buffer);
485 buffer = rb_entry(parent, struct binder_buffer, rb_node);
486 BUG_ON(!buffer->free);
488 buffer_size = binder_buffer_size(proc, buffer);
490 if (new_buffer_size < buffer_size)
491 p = &parent->rb_left;
493 p = &parent->rb_right;
495 rb_link_node(&new_buffer->rb_node, parent, p);
496 rb_insert_color(&new_buffer->rb_node, &proc->free_buffers);
499 static void binder_insert_allocated_buffer(struct binder_proc *proc,
500 struct binder_buffer *new_buffer)
502 struct rb_node **p = &proc->allocated_buffers.rb_node;
503 struct rb_node *parent = NULL;
504 struct binder_buffer *buffer;
506 BUG_ON(new_buffer->free);
510 buffer = rb_entry(parent, struct binder_buffer, rb_node);
511 BUG_ON(buffer->free);
513 if (new_buffer < buffer)
514 p = &parent->rb_left;
515 else if (new_buffer > buffer)
516 p = &parent->rb_right;
520 rb_link_node(&new_buffer->rb_node, parent, p);
521 rb_insert_color(&new_buffer->rb_node, &proc->allocated_buffers);
524 static struct binder_buffer *binder_buffer_lookup(struct binder_proc *proc,
527 struct rb_node *n = proc->allocated_buffers.rb_node;
528 struct binder_buffer *buffer;
529 struct binder_buffer *kern_ptr;
531 kern_ptr = (struct binder_buffer *)(user_ptr - proc->user_buffer_offset
532 - offsetof(struct binder_buffer, data));
535 buffer = rb_entry(n, struct binder_buffer, rb_node);
536 BUG_ON(buffer->free);
538 if (kern_ptr < buffer)
540 else if (kern_ptr > buffer)
548 static int binder_update_page_range(struct binder_proc *proc, int allocate,
549 void *start, void *end,
550 struct vm_area_struct *vma)
553 unsigned long user_page_addr;
554 struct vm_struct tmp_area;
556 struct mm_struct *mm;
558 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
559 "%d: %s pages %p-%p\n", proc->pid,
560 allocate ? "allocate" : "free", start, end);
565 trace_binder_update_page_range(proc, allocate, start, end);
570 mm = get_task_mm(proc->tsk);
573 down_write(&mm->mmap_sem);
575 if (vma && mm != proc->vma_vm_mm) {
576 pr_err("%d: vma mm and task mm mismatch\n",
586 pr_err("%d: binder_alloc_buf failed to map pages in userspace, no vma\n",
591 for (page_addr = start; page_addr < end; page_addr += PAGE_SIZE) {
593 struct page **page_array_ptr;
595 page = &proc->pages[(page_addr - proc->buffer) / PAGE_SIZE];
598 *page = alloc_page(GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO);
600 pr_err("%d: binder_alloc_buf failed for page at %p\n",
601 proc->pid, page_addr);
602 goto err_alloc_page_failed;
604 tmp_area.addr = page_addr;
605 tmp_area.size = PAGE_SIZE + PAGE_SIZE /* guard page? */;
606 page_array_ptr = page;
607 ret = map_vm_area(&tmp_area, PAGE_KERNEL, &page_array_ptr);
609 pr_err("%d: binder_alloc_buf failed to map page at %p in kernel\n",
610 proc->pid, page_addr);
611 goto err_map_kernel_failed;
614 (uintptr_t)page_addr + proc->user_buffer_offset;
615 ret = vm_insert_page(vma, user_page_addr, page[0]);
617 pr_err("%d: binder_alloc_buf failed to map page at %lx in userspace\n",
618 proc->pid, user_page_addr);
619 goto err_vm_insert_page_failed;
621 /* vm_insert_page does not seem to increment the refcount */
624 up_write(&mm->mmap_sem);
630 for (page_addr = end - PAGE_SIZE; page_addr >= start;
631 page_addr -= PAGE_SIZE) {
632 page = &proc->pages[(page_addr - proc->buffer) / PAGE_SIZE];
634 zap_page_range(vma, (uintptr_t)page_addr +
635 proc->user_buffer_offset, PAGE_SIZE, NULL);
636 err_vm_insert_page_failed:
637 unmap_kernel_range((unsigned long)page_addr, PAGE_SIZE);
638 err_map_kernel_failed:
641 err_alloc_page_failed:
646 up_write(&mm->mmap_sem);
652 static struct binder_buffer *binder_alloc_buf(struct binder_proc *proc,
654 size_t offsets_size, int is_async)
656 struct rb_node *n = proc->free_buffers.rb_node;
657 struct binder_buffer *buffer;
659 struct rb_node *best_fit = NULL;
664 if (proc->vma == NULL) {
665 pr_err("%d: binder_alloc_buf, no vma\n",
670 size = ALIGN(data_size, sizeof(void *)) +
671 ALIGN(offsets_size, sizeof(void *));
673 if (size < data_size || size < offsets_size) {
674 binder_user_error("%d: got transaction with invalid size %zd-%zd\n",
675 proc->pid, data_size, offsets_size);
680 proc->free_async_space < size + sizeof(struct binder_buffer)) {
681 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
682 "%d: binder_alloc_buf size %zd failed, no async space left\n",
688 buffer = rb_entry(n, struct binder_buffer, rb_node);
689 BUG_ON(!buffer->free);
690 buffer_size = binder_buffer_size(proc, buffer);
692 if (size < buffer_size) {
695 } else if (size > buffer_size)
702 if (best_fit == NULL) {
703 pr_err("%d: binder_alloc_buf size %zd failed, no address space\n",
708 buffer = rb_entry(best_fit, struct binder_buffer, rb_node);
709 buffer_size = binder_buffer_size(proc, buffer);
712 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
713 "%d: binder_alloc_buf size %zd got buffer %p size %zd\n",
714 proc->pid, size, buffer, buffer_size);
717 (void *)(((uintptr_t)buffer->data + buffer_size) & PAGE_MASK);
719 if (size + sizeof(struct binder_buffer) + 4 >= buffer_size)
720 buffer_size = size; /* no room for other buffers */
722 buffer_size = size + sizeof(struct binder_buffer);
725 (void *)PAGE_ALIGN((uintptr_t)buffer->data + buffer_size);
726 if (end_page_addr > has_page_addr)
727 end_page_addr = has_page_addr;
728 if (binder_update_page_range(proc, 1,
729 (void *)PAGE_ALIGN((uintptr_t)buffer->data), end_page_addr, NULL))
732 rb_erase(best_fit, &proc->free_buffers);
734 binder_insert_allocated_buffer(proc, buffer);
735 if (buffer_size != size) {
736 struct binder_buffer *new_buffer = (void *)buffer->data + size;
738 list_add(&new_buffer->entry, &buffer->entry);
739 new_buffer->free = 1;
740 binder_insert_free_buffer(proc, new_buffer);
742 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
743 "%d: binder_alloc_buf size %zd got %p\n",
744 proc->pid, size, buffer);
745 buffer->data_size = data_size;
746 buffer->offsets_size = offsets_size;
747 buffer->async_transaction = is_async;
749 proc->free_async_space -= size + sizeof(struct binder_buffer);
750 binder_debug(BINDER_DEBUG_BUFFER_ALLOC_ASYNC,
751 "%d: binder_alloc_buf size %zd async free %zd\n",
752 proc->pid, size, proc->free_async_space);
758 static void *buffer_start_page(struct binder_buffer *buffer)
760 return (void *)((uintptr_t)buffer & PAGE_MASK);
763 static void *buffer_end_page(struct binder_buffer *buffer)
765 return (void *)(((uintptr_t)(buffer + 1) - 1) & PAGE_MASK);
768 static void binder_delete_free_buffer(struct binder_proc *proc,
769 struct binder_buffer *buffer)
771 struct binder_buffer *prev, *next = NULL;
772 int free_page_end = 1;
773 int free_page_start = 1;
775 BUG_ON(proc->buffers.next == &buffer->entry);
776 prev = list_entry(buffer->entry.prev, struct binder_buffer, entry);
778 if (buffer_end_page(prev) == buffer_start_page(buffer)) {
780 if (buffer_end_page(prev) == buffer_end_page(buffer))
782 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
783 "%d: merge free, buffer %p share page with %p\n",
784 proc->pid, buffer, prev);
787 if (!list_is_last(&buffer->entry, &proc->buffers)) {
788 next = list_entry(buffer->entry.next,
789 struct binder_buffer, entry);
790 if (buffer_start_page(next) == buffer_end_page(buffer)) {
792 if (buffer_start_page(next) ==
793 buffer_start_page(buffer))
795 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
796 "%d: merge free, buffer %p share page with %p\n",
797 proc->pid, buffer, prev);
800 list_del(&buffer->entry);
801 if (free_page_start || free_page_end) {
802 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
803 "%d: merge free, buffer %p do not share page%s%s with %p or %p\n",
804 proc->pid, buffer, free_page_start ? "" : " end",
805 free_page_end ? "" : " start", prev, next);
806 binder_update_page_range(proc, 0, free_page_start ?
807 buffer_start_page(buffer) : buffer_end_page(buffer),
808 (free_page_end ? buffer_end_page(buffer) :
809 buffer_start_page(buffer)) + PAGE_SIZE, NULL);
813 static void binder_free_buf(struct binder_proc *proc,
814 struct binder_buffer *buffer)
816 size_t size, buffer_size;
818 buffer_size = binder_buffer_size(proc, buffer);
820 size = ALIGN(buffer->data_size, sizeof(void *)) +
821 ALIGN(buffer->offsets_size, sizeof(void *));
823 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
824 "%d: binder_free_buf %p size %zd buffer_size %zd\n",
825 proc->pid, buffer, size, buffer_size);
827 BUG_ON(buffer->free);
828 BUG_ON(size > buffer_size);
829 BUG_ON(buffer->transaction != NULL);
830 BUG_ON((void *)buffer < proc->buffer);
831 BUG_ON((void *)buffer > proc->buffer + proc->buffer_size);
833 if (buffer->async_transaction) {
834 proc->free_async_space += size + sizeof(struct binder_buffer);
836 binder_debug(BINDER_DEBUG_BUFFER_ALLOC_ASYNC,
837 "%d: binder_free_buf size %zd async free %zd\n",
838 proc->pid, size, proc->free_async_space);
841 binder_update_page_range(proc, 0,
842 (void *)PAGE_ALIGN((uintptr_t)buffer->data),
843 (void *)(((uintptr_t)buffer->data + buffer_size) & PAGE_MASK),
845 rb_erase(&buffer->rb_node, &proc->allocated_buffers);
847 if (!list_is_last(&buffer->entry, &proc->buffers)) {
848 struct binder_buffer *next = list_entry(buffer->entry.next,
849 struct binder_buffer, entry);
852 rb_erase(&next->rb_node, &proc->free_buffers);
853 binder_delete_free_buffer(proc, next);
856 if (proc->buffers.next != &buffer->entry) {
857 struct binder_buffer *prev = list_entry(buffer->entry.prev,
858 struct binder_buffer, entry);
861 binder_delete_free_buffer(proc, buffer);
862 rb_erase(&prev->rb_node, &proc->free_buffers);
866 binder_insert_free_buffer(proc, buffer);
869 static struct binder_node *binder_get_node(struct binder_proc *proc,
870 binder_uintptr_t ptr)
872 struct rb_node *n = proc->nodes.rb_node;
873 struct binder_node *node;
876 node = rb_entry(n, struct binder_node, rb_node);
880 else if (ptr > node->ptr)
888 static struct binder_node *binder_new_node(struct binder_proc *proc,
889 binder_uintptr_t ptr,
890 binder_uintptr_t cookie)
892 struct rb_node **p = &proc->nodes.rb_node;
893 struct rb_node *parent = NULL;
894 struct binder_node *node;
898 node = rb_entry(parent, struct binder_node, rb_node);
902 else if (ptr > node->ptr)
908 node = kzalloc(sizeof(*node), GFP_KERNEL);
911 binder_stats_created(BINDER_STAT_NODE);
912 rb_link_node(&node->rb_node, parent, p);
913 rb_insert_color(&node->rb_node, &proc->nodes);
914 node->debug_id = ++binder_last_id;
917 node->cookie = cookie;
918 node->work.type = BINDER_WORK_NODE;
919 INIT_LIST_HEAD(&node->work.entry);
920 INIT_LIST_HEAD(&node->async_todo);
921 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
922 "%d:%d node %d u%016llx c%016llx created\n",
923 proc->pid, current->pid, node->debug_id,
924 (u64)node->ptr, (u64)node->cookie);
928 static int binder_inc_node(struct binder_node *node, int strong, int internal,
929 struct list_head *target_list)
933 if (target_list == NULL &&
934 node->internal_strong_refs == 0 &&
935 !(node == binder_context_mgr_node &&
936 node->has_strong_ref)) {
937 pr_err("invalid inc strong node for %d\n",
941 node->internal_strong_refs++;
943 node->local_strong_refs++;
944 if (!node->has_strong_ref && target_list) {
945 list_del_init(&node->work.entry);
946 list_add_tail(&node->work.entry, target_list);
950 node->local_weak_refs++;
951 if (!node->has_weak_ref && list_empty(&node->work.entry)) {
952 if (target_list == NULL) {
953 pr_err("invalid inc weak node for %d\n",
957 list_add_tail(&node->work.entry, target_list);
963 static int binder_dec_node(struct binder_node *node, int strong, int internal)
967 node->internal_strong_refs--;
969 node->local_strong_refs--;
970 if (node->local_strong_refs || node->internal_strong_refs)
974 node->local_weak_refs--;
975 if (node->local_weak_refs || !hlist_empty(&node->refs))
978 if (node->proc && (node->has_strong_ref || node->has_weak_ref)) {
979 if (list_empty(&node->work.entry)) {
980 list_add_tail(&node->work.entry, &node->proc->todo);
981 wake_up_interruptible(&node->proc->wait);
984 if (hlist_empty(&node->refs) && !node->local_strong_refs &&
985 !node->local_weak_refs) {
986 list_del_init(&node->work.entry);
988 rb_erase(&node->rb_node, &node->proc->nodes);
989 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
990 "refless node %d deleted\n",
993 hlist_del(&node->dead_node);
994 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
995 "dead node %d deleted\n",
999 binder_stats_deleted(BINDER_STAT_NODE);
1007 static struct binder_ref *binder_get_ref(struct binder_proc *proc,
1010 struct rb_node *n = proc->refs_by_desc.rb_node;
1011 struct binder_ref *ref;
1014 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1016 if (desc < ref->desc)
1018 else if (desc > ref->desc)
1026 static struct binder_ref *binder_get_ref_for_node(struct binder_proc *proc,
1027 struct binder_node *node)
1030 struct rb_node **p = &proc->refs_by_node.rb_node;
1031 struct rb_node *parent = NULL;
1032 struct binder_ref *ref, *new_ref;
1036 ref = rb_entry(parent, struct binder_ref, rb_node_node);
1038 if (node < ref->node)
1040 else if (node > ref->node)
1041 p = &(*p)->rb_right;
1045 new_ref = kzalloc(sizeof(*ref), GFP_KERNEL);
1046 if (new_ref == NULL)
1048 binder_stats_created(BINDER_STAT_REF);
1049 new_ref->debug_id = ++binder_last_id;
1050 new_ref->proc = proc;
1051 new_ref->node = node;
1052 rb_link_node(&new_ref->rb_node_node, parent, p);
1053 rb_insert_color(&new_ref->rb_node_node, &proc->refs_by_node);
1055 new_ref->desc = (node == binder_context_mgr_node) ? 0 : 1;
1056 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
1057 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1058 if (ref->desc > new_ref->desc)
1060 new_ref->desc = ref->desc + 1;
1063 p = &proc->refs_by_desc.rb_node;
1066 ref = rb_entry(parent, struct binder_ref, rb_node_desc);
1068 if (new_ref->desc < ref->desc)
1070 else if (new_ref->desc > ref->desc)
1071 p = &(*p)->rb_right;
1075 rb_link_node(&new_ref->rb_node_desc, parent, p);
1076 rb_insert_color(&new_ref->rb_node_desc, &proc->refs_by_desc);
1078 hlist_add_head(&new_ref->node_entry, &node->refs);
1080 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1081 "%d new ref %d desc %d for node %d\n",
1082 proc->pid, new_ref->debug_id, new_ref->desc,
1085 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1086 "%d new ref %d desc %d for dead node\n",
1087 proc->pid, new_ref->debug_id, new_ref->desc);
1092 static void binder_delete_ref(struct binder_ref *ref)
1094 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1095 "%d delete ref %d desc %d for node %d\n",
1096 ref->proc->pid, ref->debug_id, ref->desc,
1097 ref->node->debug_id);
1099 rb_erase(&ref->rb_node_desc, &ref->proc->refs_by_desc);
1100 rb_erase(&ref->rb_node_node, &ref->proc->refs_by_node);
1102 binder_dec_node(ref->node, 1, 1);
1103 hlist_del(&ref->node_entry);
1104 binder_dec_node(ref->node, 0, 1);
1106 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1107 "%d delete ref %d desc %d has death notification\n",
1108 ref->proc->pid, ref->debug_id, ref->desc);
1109 list_del(&ref->death->work.entry);
1111 binder_stats_deleted(BINDER_STAT_DEATH);
1114 binder_stats_deleted(BINDER_STAT_REF);
1117 static int binder_inc_ref(struct binder_ref *ref, int strong,
1118 struct list_head *target_list)
1123 if (ref->strong == 0) {
1124 ret = binder_inc_node(ref->node, 1, 1, target_list);
1130 if (ref->weak == 0) {
1131 ret = binder_inc_node(ref->node, 0, 1, target_list);
1141 static int binder_dec_ref(struct binder_ref *ref, int strong)
1144 if (ref->strong == 0) {
1145 binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n",
1146 ref->proc->pid, ref->debug_id,
1147 ref->desc, ref->strong, ref->weak);
1151 if (ref->strong == 0) {
1154 ret = binder_dec_node(ref->node, strong, 1);
1159 if (ref->weak == 0) {
1160 binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n",
1161 ref->proc->pid, ref->debug_id,
1162 ref->desc, ref->strong, ref->weak);
1167 if (ref->strong == 0 && ref->weak == 0)
1168 binder_delete_ref(ref);
1172 static void binder_pop_transaction(struct binder_thread *target_thread,
1173 struct binder_transaction *t)
1175 if (target_thread) {
1176 BUG_ON(target_thread->transaction_stack != t);
1177 BUG_ON(target_thread->transaction_stack->from != target_thread);
1178 target_thread->transaction_stack =
1179 target_thread->transaction_stack->from_parent;
1184 t->buffer->transaction = NULL;
1186 binder_stats_deleted(BINDER_STAT_TRANSACTION);
1189 static void binder_send_failed_reply(struct binder_transaction *t,
1190 uint32_t error_code)
1192 struct binder_thread *target_thread;
1193 struct binder_transaction *next;
1195 BUG_ON(t->flags & TF_ONE_WAY);
1197 target_thread = t->from;
1198 if (target_thread) {
1199 if (target_thread->return_error != BR_OK &&
1200 target_thread->return_error2 == BR_OK) {
1201 target_thread->return_error2 =
1202 target_thread->return_error;
1203 target_thread->return_error = BR_OK;
1205 if (target_thread->return_error == BR_OK) {
1206 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1207 "send failed reply for transaction %d to %d:%d\n",
1209 target_thread->proc->pid,
1210 target_thread->pid);
1212 binder_pop_transaction(target_thread, t);
1213 target_thread->return_error = error_code;
1214 wake_up_interruptible(&target_thread->wait);
1216 pr_err("reply failed, target thread, %d:%d, has error code %d already\n",
1217 target_thread->proc->pid,
1219 target_thread->return_error);
1223 next = t->from_parent;
1225 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1226 "send failed reply for transaction %d, target dead\n",
1229 binder_pop_transaction(target_thread, t);
1231 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1232 "reply failed, no target thread at root\n");
1236 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1237 "reply failed, no target thread -- retry %d\n",
1242 static void binder_transaction_buffer_release(struct binder_proc *proc,
1243 struct binder_buffer *buffer,
1244 binder_size_t *failed_at)
1246 binder_size_t *offp, *off_end;
1247 int debug_id = buffer->debug_id;
1249 binder_debug(BINDER_DEBUG_TRANSACTION,
1250 "%d buffer release %d, size %zd-%zd, failed at %p\n",
1251 proc->pid, buffer->debug_id,
1252 buffer->data_size, buffer->offsets_size, failed_at);
1254 if (buffer->target_node)
1255 binder_dec_node(buffer->target_node, 1, 0);
1257 offp = (binder_size_t *)(buffer->data +
1258 ALIGN(buffer->data_size, sizeof(void *)));
1260 off_end = failed_at;
1262 off_end = (void *)offp + buffer->offsets_size;
1263 for (; offp < off_end; offp++) {
1264 struct flat_binder_object *fp;
1266 if (*offp > buffer->data_size - sizeof(*fp) ||
1267 buffer->data_size < sizeof(*fp) ||
1268 !IS_ALIGNED(*offp, sizeof(u32))) {
1269 pr_err("transaction release %d bad offset %lld, size %zd\n",
1270 debug_id, (u64)*offp, buffer->data_size);
1273 fp = (struct flat_binder_object *)(buffer->data + *offp);
1275 case BINDER_TYPE_BINDER:
1276 case BINDER_TYPE_WEAK_BINDER: {
1277 struct binder_node *node = binder_get_node(proc, fp->binder);
1280 pr_err("transaction release %d bad node %016llx\n",
1281 debug_id, (u64)fp->binder);
1284 binder_debug(BINDER_DEBUG_TRANSACTION,
1285 " node %d u%016llx\n",
1286 node->debug_id, (u64)node->ptr);
1287 binder_dec_node(node, fp->type == BINDER_TYPE_BINDER, 0);
1289 case BINDER_TYPE_HANDLE:
1290 case BINDER_TYPE_WEAK_HANDLE: {
1291 struct binder_ref *ref = binder_get_ref(proc, fp->handle);
1294 pr_err("transaction release %d bad handle %d\n",
1295 debug_id, fp->handle);
1298 binder_debug(BINDER_DEBUG_TRANSACTION,
1299 " ref %d desc %d (node %d)\n",
1300 ref->debug_id, ref->desc, ref->node->debug_id);
1301 binder_dec_ref(ref, fp->type == BINDER_TYPE_HANDLE);
1304 case BINDER_TYPE_FD:
1305 binder_debug(BINDER_DEBUG_TRANSACTION,
1306 " fd %d\n", fp->handle);
1308 task_close_fd(proc, fp->handle);
1312 pr_err("transaction release %d bad object type %x\n",
1313 debug_id, fp->type);
1319 static void binder_transaction(struct binder_proc *proc,
1320 struct binder_thread *thread,
1321 struct binder_transaction_data *tr, int reply)
1323 struct binder_transaction *t;
1324 struct binder_work *tcomplete;
1325 binder_size_t *offp, *off_end;
1326 binder_size_t off_min;
1327 struct binder_proc *target_proc;
1328 struct binder_thread *target_thread = NULL;
1329 struct binder_node *target_node = NULL;
1330 struct list_head *target_list;
1331 wait_queue_head_t *target_wait;
1332 struct binder_transaction *in_reply_to = NULL;
1333 struct binder_transaction_log_entry *e;
1334 uint32_t return_error;
1336 e = binder_transaction_log_add(&binder_transaction_log);
1337 e->call_type = reply ? 2 : !!(tr->flags & TF_ONE_WAY);
1338 e->from_proc = proc->pid;
1339 e->from_thread = thread->pid;
1340 e->target_handle = tr->target.handle;
1341 e->data_size = tr->data_size;
1342 e->offsets_size = tr->offsets_size;
1345 in_reply_to = thread->transaction_stack;
1346 if (in_reply_to == NULL) {
1347 binder_user_error("%d:%d got reply transaction with no transaction stack\n",
1348 proc->pid, thread->pid);
1349 return_error = BR_FAILED_REPLY;
1350 goto err_empty_call_stack;
1352 binder_set_nice(in_reply_to->saved_priority);
1353 if (in_reply_to->to_thread != thread) {
1354 binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
1355 proc->pid, thread->pid, in_reply_to->debug_id,
1356 in_reply_to->to_proc ?
1357 in_reply_to->to_proc->pid : 0,
1358 in_reply_to->to_thread ?
1359 in_reply_to->to_thread->pid : 0);
1360 return_error = BR_FAILED_REPLY;
1362 goto err_bad_call_stack;
1364 thread->transaction_stack = in_reply_to->to_parent;
1365 target_thread = in_reply_to->from;
1366 if (target_thread == NULL) {
1367 return_error = BR_DEAD_REPLY;
1368 goto err_dead_binder;
1370 if (target_thread->transaction_stack != in_reply_to) {
1371 binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
1372 proc->pid, thread->pid,
1373 target_thread->transaction_stack ?
1374 target_thread->transaction_stack->debug_id : 0,
1375 in_reply_to->debug_id);
1376 return_error = BR_FAILED_REPLY;
1378 target_thread = NULL;
1379 goto err_dead_binder;
1381 target_proc = target_thread->proc;
1383 if (tr->target.handle) {
1384 struct binder_ref *ref;
1386 ref = binder_get_ref(proc, tr->target.handle);
1388 binder_user_error("%d:%d got transaction to invalid handle\n",
1389 proc->pid, thread->pid);
1390 return_error = BR_FAILED_REPLY;
1391 goto err_invalid_target_handle;
1393 target_node = ref->node;
1395 target_node = binder_context_mgr_node;
1396 if (target_node == NULL) {
1397 return_error = BR_DEAD_REPLY;
1398 goto err_no_context_mgr_node;
1401 e->to_node = target_node->debug_id;
1402 target_proc = target_node->proc;
1403 if (target_proc == NULL) {
1404 return_error = BR_DEAD_REPLY;
1405 goto err_dead_binder;
1407 if (!(tr->flags & TF_ONE_WAY) && thread->transaction_stack) {
1408 struct binder_transaction *tmp;
1410 tmp = thread->transaction_stack;
1411 if (tmp->to_thread != thread) {
1412 binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
1413 proc->pid, thread->pid, tmp->debug_id,
1414 tmp->to_proc ? tmp->to_proc->pid : 0,
1416 tmp->to_thread->pid : 0);
1417 return_error = BR_FAILED_REPLY;
1418 goto err_bad_call_stack;
1421 if (tmp->from && tmp->from->proc == target_proc)
1422 target_thread = tmp->from;
1423 tmp = tmp->from_parent;
1427 if (target_thread) {
1428 e->to_thread = target_thread->pid;
1429 target_list = &target_thread->todo;
1430 target_wait = &target_thread->wait;
1432 target_list = &target_proc->todo;
1433 target_wait = &target_proc->wait;
1435 e->to_proc = target_proc->pid;
1437 /* TODO: reuse incoming transaction for reply */
1438 t = kzalloc(sizeof(*t), GFP_KERNEL);
1440 return_error = BR_FAILED_REPLY;
1441 goto err_alloc_t_failed;
1443 binder_stats_created(BINDER_STAT_TRANSACTION);
1445 tcomplete = kzalloc(sizeof(*tcomplete), GFP_KERNEL);
1446 if (tcomplete == NULL) {
1447 return_error = BR_FAILED_REPLY;
1448 goto err_alloc_tcomplete_failed;
1450 binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE);
1452 t->debug_id = ++binder_last_id;
1453 e->debug_id = t->debug_id;
1456 binder_debug(BINDER_DEBUG_TRANSACTION,
1457 "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld\n",
1458 proc->pid, thread->pid, t->debug_id,
1459 target_proc->pid, target_thread->pid,
1460 (u64)tr->data.ptr.buffer,
1461 (u64)tr->data.ptr.offsets,
1462 (u64)tr->data_size, (u64)tr->offsets_size);
1464 binder_debug(BINDER_DEBUG_TRANSACTION,
1465 "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld\n",
1466 proc->pid, thread->pid, t->debug_id,
1467 target_proc->pid, target_node->debug_id,
1468 (u64)tr->data.ptr.buffer,
1469 (u64)tr->data.ptr.offsets,
1470 (u64)tr->data_size, (u64)tr->offsets_size);
1472 if (!reply && !(tr->flags & TF_ONE_WAY))
1476 t->sender_euid = task_euid(proc->tsk);
1477 t->to_proc = target_proc;
1478 t->to_thread = target_thread;
1480 t->flags = tr->flags;
1481 t->priority = task_nice(current);
1483 trace_binder_transaction(reply, t, target_node);
1485 t->buffer = binder_alloc_buf(target_proc, tr->data_size,
1486 tr->offsets_size, !reply && (t->flags & TF_ONE_WAY));
1487 if (t->buffer == NULL) {
1488 return_error = BR_FAILED_REPLY;
1489 goto err_binder_alloc_buf_failed;
1491 t->buffer->allow_user_free = 0;
1492 t->buffer->debug_id = t->debug_id;
1493 t->buffer->transaction = t;
1494 t->buffer->target_node = target_node;
1495 trace_binder_transaction_alloc_buf(t->buffer);
1497 binder_inc_node(target_node, 1, 0, NULL);
1499 offp = (binder_size_t *)(t->buffer->data +
1500 ALIGN(tr->data_size, sizeof(void *)));
1502 if (copy_from_user(t->buffer->data, (const void __user *)(uintptr_t)
1503 tr->data.ptr.buffer, tr->data_size)) {
1504 binder_user_error("%d:%d got transaction with invalid data ptr\n",
1505 proc->pid, thread->pid);
1506 return_error = BR_FAILED_REPLY;
1507 goto err_copy_data_failed;
1509 if (copy_from_user(offp, (const void __user *)(uintptr_t)
1510 tr->data.ptr.offsets, tr->offsets_size)) {
1511 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
1512 proc->pid, thread->pid);
1513 return_error = BR_FAILED_REPLY;
1514 goto err_copy_data_failed;
1516 if (!IS_ALIGNED(tr->offsets_size, sizeof(binder_size_t))) {
1517 binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
1518 proc->pid, thread->pid, (u64)tr->offsets_size);
1519 return_error = BR_FAILED_REPLY;
1520 goto err_bad_offset;
1522 off_end = (void *)offp + tr->offsets_size;
1524 for (; offp < off_end; offp++) {
1525 struct flat_binder_object *fp;
1527 if (*offp > t->buffer->data_size - sizeof(*fp) ||
1529 t->buffer->data_size < sizeof(*fp) ||
1530 !IS_ALIGNED(*offp, sizeof(u32))) {
1531 binder_user_error("%d:%d got transaction with invalid offset, %lld (min %lld, max %lld)\n",
1532 proc->pid, thread->pid, (u64)*offp,
1534 (u64)(t->buffer->data_size -
1536 return_error = BR_FAILED_REPLY;
1537 goto err_bad_offset;
1539 fp = (struct flat_binder_object *)(t->buffer->data + *offp);
1540 off_min = *offp + sizeof(struct flat_binder_object);
1542 case BINDER_TYPE_BINDER:
1543 case BINDER_TYPE_WEAK_BINDER: {
1544 struct binder_ref *ref;
1545 struct binder_node *node = binder_get_node(proc, fp->binder);
1548 node = binder_new_node(proc, fp->binder, fp->cookie);
1550 return_error = BR_FAILED_REPLY;
1551 goto err_binder_new_node_failed;
1553 node->min_priority = fp->flags & FLAT_BINDER_FLAG_PRIORITY_MASK;
1554 node->accept_fds = !!(fp->flags & FLAT_BINDER_FLAG_ACCEPTS_FDS);
1556 if (fp->cookie != node->cookie) {
1557 binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
1558 proc->pid, thread->pid,
1559 (u64)fp->binder, node->debug_id,
1560 (u64)fp->cookie, (u64)node->cookie);
1561 return_error = BR_FAILED_REPLY;
1562 goto err_binder_get_ref_for_node_failed;
1564 ref = binder_get_ref_for_node(target_proc, node);
1566 return_error = BR_FAILED_REPLY;
1567 goto err_binder_get_ref_for_node_failed;
1569 if (fp->type == BINDER_TYPE_BINDER)
1570 fp->type = BINDER_TYPE_HANDLE;
1572 fp->type = BINDER_TYPE_WEAK_HANDLE;
1573 fp->handle = ref->desc;
1574 binder_inc_ref(ref, fp->type == BINDER_TYPE_HANDLE,
1577 trace_binder_transaction_node_to_ref(t, node, ref);
1578 binder_debug(BINDER_DEBUG_TRANSACTION,
1579 " node %d u%016llx -> ref %d desc %d\n",
1580 node->debug_id, (u64)node->ptr,
1581 ref->debug_id, ref->desc);
1583 case BINDER_TYPE_HANDLE:
1584 case BINDER_TYPE_WEAK_HANDLE: {
1585 struct binder_ref *ref = binder_get_ref(proc, fp->handle);
1588 binder_user_error("%d:%d got transaction with invalid handle, %d\n",
1590 thread->pid, fp->handle);
1591 return_error = BR_FAILED_REPLY;
1592 goto err_binder_get_ref_failed;
1594 if (ref->node->proc == target_proc) {
1595 if (fp->type == BINDER_TYPE_HANDLE)
1596 fp->type = BINDER_TYPE_BINDER;
1598 fp->type = BINDER_TYPE_WEAK_BINDER;
1599 fp->binder = ref->node->ptr;
1600 fp->cookie = ref->node->cookie;
1601 binder_inc_node(ref->node, fp->type == BINDER_TYPE_BINDER, 0, NULL);
1602 trace_binder_transaction_ref_to_node(t, ref);
1603 binder_debug(BINDER_DEBUG_TRANSACTION,
1604 " ref %d desc %d -> node %d u%016llx\n",
1605 ref->debug_id, ref->desc, ref->node->debug_id,
1606 (u64)ref->node->ptr);
1608 struct binder_ref *new_ref;
1610 new_ref = binder_get_ref_for_node(target_proc, ref->node);
1611 if (new_ref == NULL) {
1612 return_error = BR_FAILED_REPLY;
1613 goto err_binder_get_ref_for_node_failed;
1615 fp->handle = new_ref->desc;
1616 binder_inc_ref(new_ref, fp->type == BINDER_TYPE_HANDLE, NULL);
1617 trace_binder_transaction_ref_to_ref(t, ref,
1619 binder_debug(BINDER_DEBUG_TRANSACTION,
1620 " ref %d desc %d -> ref %d desc %d (node %d)\n",
1621 ref->debug_id, ref->desc, new_ref->debug_id,
1622 new_ref->desc, ref->node->debug_id);
1626 case BINDER_TYPE_FD: {
1631 if (!(in_reply_to->flags & TF_ACCEPT_FDS)) {
1632 binder_user_error("%d:%d got reply with fd, %d, but target does not allow fds\n",
1633 proc->pid, thread->pid, fp->handle);
1634 return_error = BR_FAILED_REPLY;
1635 goto err_fd_not_allowed;
1637 } else if (!target_node->accept_fds) {
1638 binder_user_error("%d:%d got transaction with fd, %d, but target does not allow fds\n",
1639 proc->pid, thread->pid, fp->handle);
1640 return_error = BR_FAILED_REPLY;
1641 goto err_fd_not_allowed;
1644 file = fget(fp->handle);
1646 binder_user_error("%d:%d got transaction with invalid fd, %d\n",
1647 proc->pid, thread->pid, fp->handle);
1648 return_error = BR_FAILED_REPLY;
1649 goto err_fget_failed;
1651 target_fd = task_get_unused_fd_flags(target_proc, O_CLOEXEC);
1652 if (target_fd < 0) {
1654 return_error = BR_FAILED_REPLY;
1655 goto err_get_unused_fd_failed;
1657 task_fd_install(target_proc, target_fd, file);
1658 trace_binder_transaction_fd(t, fp->handle, target_fd);
1659 binder_debug(BINDER_DEBUG_TRANSACTION,
1660 " fd %d -> %d\n", fp->handle, target_fd);
1662 fp->handle = target_fd;
1666 binder_user_error("%d:%d got transaction with invalid object type, %x\n",
1667 proc->pid, thread->pid, fp->type);
1668 return_error = BR_FAILED_REPLY;
1669 goto err_bad_object_type;
1673 BUG_ON(t->buffer->async_transaction != 0);
1674 binder_pop_transaction(target_thread, in_reply_to);
1675 } else if (!(t->flags & TF_ONE_WAY)) {
1676 BUG_ON(t->buffer->async_transaction != 0);
1678 t->from_parent = thread->transaction_stack;
1679 thread->transaction_stack = t;
1681 BUG_ON(target_node == NULL);
1682 BUG_ON(t->buffer->async_transaction != 1);
1683 if (target_node->has_async_transaction) {
1684 target_list = &target_node->async_todo;
1687 target_node->has_async_transaction = 1;
1689 t->work.type = BINDER_WORK_TRANSACTION;
1690 list_add_tail(&t->work.entry, target_list);
1691 tcomplete->type = BINDER_WORK_TRANSACTION_COMPLETE;
1692 list_add_tail(&tcomplete->entry, &thread->todo);
1694 wake_up_interruptible(target_wait);
1697 err_get_unused_fd_failed:
1700 err_binder_get_ref_for_node_failed:
1701 err_binder_get_ref_failed:
1702 err_binder_new_node_failed:
1703 err_bad_object_type:
1705 err_copy_data_failed:
1706 trace_binder_transaction_failed_buffer_release(t->buffer);
1707 binder_transaction_buffer_release(target_proc, t->buffer, offp);
1708 t->buffer->transaction = NULL;
1709 binder_free_buf(target_proc, t->buffer);
1710 err_binder_alloc_buf_failed:
1712 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
1713 err_alloc_tcomplete_failed:
1715 binder_stats_deleted(BINDER_STAT_TRANSACTION);
1718 err_empty_call_stack:
1720 err_invalid_target_handle:
1721 err_no_context_mgr_node:
1722 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1723 "%d:%d transaction failed %d, size %lld-%lld\n",
1724 proc->pid, thread->pid, return_error,
1725 (u64)tr->data_size, (u64)tr->offsets_size);
1728 struct binder_transaction_log_entry *fe;
1730 fe = binder_transaction_log_add(&binder_transaction_log_failed);
1734 BUG_ON(thread->return_error != BR_OK);
1736 thread->return_error = BR_TRANSACTION_COMPLETE;
1737 binder_send_failed_reply(in_reply_to, return_error);
1739 thread->return_error = return_error;
1742 static int binder_thread_write(struct binder_proc *proc,
1743 struct binder_thread *thread,
1744 binder_uintptr_t binder_buffer, size_t size,
1745 binder_size_t *consumed)
1748 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
1749 void __user *ptr = buffer + *consumed;
1750 void __user *end = buffer + size;
1752 while (ptr < end && thread->return_error == BR_OK) {
1753 if (get_user(cmd, (uint32_t __user *)ptr))
1755 ptr += sizeof(uint32_t);
1756 trace_binder_command(cmd);
1757 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.bc)) {
1758 binder_stats.bc[_IOC_NR(cmd)]++;
1759 proc->stats.bc[_IOC_NR(cmd)]++;
1760 thread->stats.bc[_IOC_NR(cmd)]++;
1768 struct binder_ref *ref;
1769 const char *debug_string;
1771 if (get_user(target, (uint32_t __user *)ptr))
1773 ptr += sizeof(uint32_t);
1774 if (target == 0 && binder_context_mgr_node &&
1775 (cmd == BC_INCREFS || cmd == BC_ACQUIRE)) {
1776 ref = binder_get_ref_for_node(proc,
1777 binder_context_mgr_node);
1778 if (ref->desc != target) {
1779 binder_user_error("%d:%d tried to acquire reference to desc 0, got %d instead\n",
1780 proc->pid, thread->pid,
1784 ref = binder_get_ref(proc, target);
1786 binder_user_error("%d:%d refcount change on invalid ref %d\n",
1787 proc->pid, thread->pid, target);
1792 debug_string = "IncRefs";
1793 binder_inc_ref(ref, 0, NULL);
1796 debug_string = "Acquire";
1797 binder_inc_ref(ref, 1, NULL);
1800 debug_string = "Release";
1801 binder_dec_ref(ref, 1);
1805 debug_string = "DecRefs";
1806 binder_dec_ref(ref, 0);
1809 binder_debug(BINDER_DEBUG_USER_REFS,
1810 "%d:%d %s ref %d desc %d s %d w %d for node %d\n",
1811 proc->pid, thread->pid, debug_string, ref->debug_id,
1812 ref->desc, ref->strong, ref->weak, ref->node->debug_id);
1815 case BC_INCREFS_DONE:
1816 case BC_ACQUIRE_DONE: {
1817 binder_uintptr_t node_ptr;
1818 binder_uintptr_t cookie;
1819 struct binder_node *node;
1821 if (get_user(node_ptr, (binder_uintptr_t __user *)ptr))
1823 ptr += sizeof(binder_uintptr_t);
1824 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
1826 ptr += sizeof(binder_uintptr_t);
1827 node = binder_get_node(proc, node_ptr);
1829 binder_user_error("%d:%d %s u%016llx no match\n",
1830 proc->pid, thread->pid,
1831 cmd == BC_INCREFS_DONE ?
1837 if (cookie != node->cookie) {
1838 binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
1839 proc->pid, thread->pid,
1840 cmd == BC_INCREFS_DONE ?
1841 "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
1842 (u64)node_ptr, node->debug_id,
1843 (u64)cookie, (u64)node->cookie);
1846 if (cmd == BC_ACQUIRE_DONE) {
1847 if (node->pending_strong_ref == 0) {
1848 binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
1849 proc->pid, thread->pid,
1853 node->pending_strong_ref = 0;
1855 if (node->pending_weak_ref == 0) {
1856 binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
1857 proc->pid, thread->pid,
1861 node->pending_weak_ref = 0;
1863 binder_dec_node(node, cmd == BC_ACQUIRE_DONE, 0);
1864 binder_debug(BINDER_DEBUG_USER_REFS,
1865 "%d:%d %s node %d ls %d lw %d\n",
1866 proc->pid, thread->pid,
1867 cmd == BC_INCREFS_DONE ? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
1868 node->debug_id, node->local_strong_refs, node->local_weak_refs);
1871 case BC_ATTEMPT_ACQUIRE:
1872 pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
1874 case BC_ACQUIRE_RESULT:
1875 pr_err("BC_ACQUIRE_RESULT not supported\n");
1878 case BC_FREE_BUFFER: {
1879 binder_uintptr_t data_ptr;
1880 struct binder_buffer *buffer;
1882 if (get_user(data_ptr, (binder_uintptr_t __user *)ptr))
1884 ptr += sizeof(binder_uintptr_t);
1886 buffer = binder_buffer_lookup(proc, data_ptr);
1887 if (buffer == NULL) {
1888 binder_user_error("%d:%d BC_FREE_BUFFER u%016llx no match\n",
1889 proc->pid, thread->pid, (u64)data_ptr);
1892 if (!buffer->allow_user_free) {
1893 binder_user_error("%d:%d BC_FREE_BUFFER u%016llx matched unreturned buffer\n",
1894 proc->pid, thread->pid, (u64)data_ptr);
1897 binder_debug(BINDER_DEBUG_FREE_BUFFER,
1898 "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
1899 proc->pid, thread->pid, (u64)data_ptr,
1901 buffer->transaction ? "active" : "finished");
1903 if (buffer->transaction) {
1904 buffer->transaction->buffer = NULL;
1905 buffer->transaction = NULL;
1907 if (buffer->async_transaction && buffer->target_node) {
1908 BUG_ON(!buffer->target_node->has_async_transaction);
1909 if (list_empty(&buffer->target_node->async_todo))
1910 buffer->target_node->has_async_transaction = 0;
1912 list_move_tail(buffer->target_node->async_todo.next, &thread->todo);
1914 trace_binder_transaction_buffer_release(buffer);
1915 binder_transaction_buffer_release(proc, buffer, NULL);
1916 binder_free_buf(proc, buffer);
1920 case BC_TRANSACTION:
1922 struct binder_transaction_data tr;
1924 if (copy_from_user(&tr, ptr, sizeof(tr)))
1927 binder_transaction(proc, thread, &tr, cmd == BC_REPLY);
1931 case BC_REGISTER_LOOPER:
1932 binder_debug(BINDER_DEBUG_THREADS,
1933 "%d:%d BC_REGISTER_LOOPER\n",
1934 proc->pid, thread->pid);
1935 if (thread->looper & BINDER_LOOPER_STATE_ENTERED) {
1936 thread->looper |= BINDER_LOOPER_STATE_INVALID;
1937 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
1938 proc->pid, thread->pid);
1939 } else if (proc->requested_threads == 0) {
1940 thread->looper |= BINDER_LOOPER_STATE_INVALID;
1941 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
1942 proc->pid, thread->pid);
1944 proc->requested_threads--;
1945 proc->requested_threads_started++;
1947 thread->looper |= BINDER_LOOPER_STATE_REGISTERED;
1949 case BC_ENTER_LOOPER:
1950 binder_debug(BINDER_DEBUG_THREADS,
1951 "%d:%d BC_ENTER_LOOPER\n",
1952 proc->pid, thread->pid);
1953 if (thread->looper & BINDER_LOOPER_STATE_REGISTERED) {
1954 thread->looper |= BINDER_LOOPER_STATE_INVALID;
1955 binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
1956 proc->pid, thread->pid);
1958 thread->looper |= BINDER_LOOPER_STATE_ENTERED;
1960 case BC_EXIT_LOOPER:
1961 binder_debug(BINDER_DEBUG_THREADS,
1962 "%d:%d BC_EXIT_LOOPER\n",
1963 proc->pid, thread->pid);
1964 thread->looper |= BINDER_LOOPER_STATE_EXITED;
1967 case BC_REQUEST_DEATH_NOTIFICATION:
1968 case BC_CLEAR_DEATH_NOTIFICATION: {
1970 binder_uintptr_t cookie;
1971 struct binder_ref *ref;
1972 struct binder_ref_death *death;
1974 if (get_user(target, (uint32_t __user *)ptr))
1976 ptr += sizeof(uint32_t);
1977 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
1979 ptr += sizeof(binder_uintptr_t);
1980 ref = binder_get_ref(proc, target);
1982 binder_user_error("%d:%d %s invalid ref %d\n",
1983 proc->pid, thread->pid,
1984 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
1985 "BC_REQUEST_DEATH_NOTIFICATION" :
1986 "BC_CLEAR_DEATH_NOTIFICATION",
1991 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
1992 "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
1993 proc->pid, thread->pid,
1994 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
1995 "BC_REQUEST_DEATH_NOTIFICATION" :
1996 "BC_CLEAR_DEATH_NOTIFICATION",
1997 (u64)cookie, ref->debug_id, ref->desc,
1998 ref->strong, ref->weak, ref->node->debug_id);
2000 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
2002 binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
2003 proc->pid, thread->pid);
2006 death = kzalloc(sizeof(*death), GFP_KERNEL);
2007 if (death == NULL) {
2008 thread->return_error = BR_ERROR;
2009 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
2010 "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
2011 proc->pid, thread->pid);
2014 binder_stats_created(BINDER_STAT_DEATH);
2015 INIT_LIST_HEAD(&death->work.entry);
2016 death->cookie = cookie;
2018 if (ref->node->proc == NULL) {
2019 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
2020 if (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | BINDER_LOOPER_STATE_ENTERED)) {
2021 list_add_tail(&ref->death->work.entry, &thread->todo);
2023 list_add_tail(&ref->death->work.entry, &proc->todo);
2024 wake_up_interruptible(&proc->wait);
2028 if (ref->death == NULL) {
2029 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
2030 proc->pid, thread->pid);
2034 if (death->cookie != cookie) {
2035 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
2036 proc->pid, thread->pid,
2042 if (list_empty(&death->work.entry)) {
2043 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
2044 if (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | BINDER_LOOPER_STATE_ENTERED)) {
2045 list_add_tail(&death->work.entry, &thread->todo);
2047 list_add_tail(&death->work.entry, &proc->todo);
2048 wake_up_interruptible(&proc->wait);
2051 BUG_ON(death->work.type != BINDER_WORK_DEAD_BINDER);
2052 death->work.type = BINDER_WORK_DEAD_BINDER_AND_CLEAR;
2056 case BC_DEAD_BINDER_DONE: {
2057 struct binder_work *w;
2058 binder_uintptr_t cookie;
2059 struct binder_ref_death *death = NULL;
2061 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
2064 ptr += sizeof(void *);
2065 list_for_each_entry(w, &proc->delivered_death, entry) {
2066 struct binder_ref_death *tmp_death = container_of(w, struct binder_ref_death, work);
2068 if (tmp_death->cookie == cookie) {
2073 binder_debug(BINDER_DEBUG_DEAD_BINDER,
2074 "%d:%d BC_DEAD_BINDER_DONE %016llx found %p\n",
2075 proc->pid, thread->pid, (u64)cookie,
2077 if (death == NULL) {
2078 binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
2079 proc->pid, thread->pid, (u64)cookie);
2083 list_del_init(&death->work.entry);
2084 if (death->work.type == BINDER_WORK_DEAD_BINDER_AND_CLEAR) {
2085 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
2086 if (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | BINDER_LOOPER_STATE_ENTERED)) {
2087 list_add_tail(&death->work.entry, &thread->todo);
2089 list_add_tail(&death->work.entry, &proc->todo);
2090 wake_up_interruptible(&proc->wait);
2096 pr_err("%d:%d unknown command %d\n",
2097 proc->pid, thread->pid, cmd);
2100 *consumed = ptr - buffer;
2105 static void binder_stat_br(struct binder_proc *proc,
2106 struct binder_thread *thread, uint32_t cmd)
2108 trace_binder_return(cmd);
2109 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.br)) {
2110 binder_stats.br[_IOC_NR(cmd)]++;
2111 proc->stats.br[_IOC_NR(cmd)]++;
2112 thread->stats.br[_IOC_NR(cmd)]++;
2116 static int binder_has_proc_work(struct binder_proc *proc,
2117 struct binder_thread *thread)
2119 return !list_empty(&proc->todo) ||
2120 (thread->looper & BINDER_LOOPER_STATE_NEED_RETURN);
2123 static int binder_has_thread_work(struct binder_thread *thread)
2125 return !list_empty(&thread->todo) || thread->return_error != BR_OK ||
2126 (thread->looper & BINDER_LOOPER_STATE_NEED_RETURN);
2129 static int binder_thread_read(struct binder_proc *proc,
2130 struct binder_thread *thread,
2131 binder_uintptr_t binder_buffer, size_t size,
2132 binder_size_t *consumed, int non_block)
2134 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
2135 void __user *ptr = buffer + *consumed;
2136 void __user *end = buffer + size;
2139 int wait_for_proc_work;
2141 if (*consumed == 0) {
2142 if (put_user(BR_NOOP, (uint32_t __user *)ptr))
2144 ptr += sizeof(uint32_t);
2148 wait_for_proc_work = thread->transaction_stack == NULL &&
2149 list_empty(&thread->todo);
2151 if (thread->return_error != BR_OK && ptr < end) {
2152 if (thread->return_error2 != BR_OK) {
2153 if (put_user(thread->return_error2, (uint32_t __user *)ptr))
2155 ptr += sizeof(uint32_t);
2156 binder_stat_br(proc, thread, thread->return_error2);
2159 thread->return_error2 = BR_OK;
2161 if (put_user(thread->return_error, (uint32_t __user *)ptr))
2163 ptr += sizeof(uint32_t);
2164 binder_stat_br(proc, thread, thread->return_error);
2165 thread->return_error = BR_OK;
2170 thread->looper |= BINDER_LOOPER_STATE_WAITING;
2171 if (wait_for_proc_work)
2172 proc->ready_threads++;
2174 binder_unlock(__func__);
2176 trace_binder_wait_for_work(wait_for_proc_work,
2177 !!thread->transaction_stack,
2178 !list_empty(&thread->todo));
2179 if (wait_for_proc_work) {
2180 if (!(thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
2181 BINDER_LOOPER_STATE_ENTERED))) {
2182 binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
2183 proc->pid, thread->pid, thread->looper);
2184 wait_event_interruptible(binder_user_error_wait,
2185 binder_stop_on_user_error < 2);
2187 binder_set_nice(proc->default_priority);
2189 if (!binder_has_proc_work(proc, thread))
2192 ret = wait_event_freezable_exclusive(proc->wait, binder_has_proc_work(proc, thread));
2195 if (!binder_has_thread_work(thread))
2198 ret = wait_event_freezable(thread->wait, binder_has_thread_work(thread));
2201 binder_lock(__func__);
2203 if (wait_for_proc_work)
2204 proc->ready_threads--;
2205 thread->looper &= ~BINDER_LOOPER_STATE_WAITING;
2212 struct binder_transaction_data tr;
2213 struct binder_work *w;
2214 struct binder_transaction *t = NULL;
2216 if (!list_empty(&thread->todo)) {
2217 w = list_first_entry(&thread->todo, struct binder_work,
2219 } else if (!list_empty(&proc->todo) && wait_for_proc_work) {
2220 w = list_first_entry(&proc->todo, struct binder_work,
2224 if (ptr - buffer == 4 &&
2225 !(thread->looper & BINDER_LOOPER_STATE_NEED_RETURN))
2230 if (end - ptr < sizeof(tr) + 4)
2234 case BINDER_WORK_TRANSACTION: {
2235 t = container_of(w, struct binder_transaction, work);
2237 case BINDER_WORK_TRANSACTION_COMPLETE: {
2238 cmd = BR_TRANSACTION_COMPLETE;
2239 if (put_user(cmd, (uint32_t __user *)ptr))
2241 ptr += sizeof(uint32_t);
2243 binder_stat_br(proc, thread, cmd);
2244 binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE,
2245 "%d:%d BR_TRANSACTION_COMPLETE\n",
2246 proc->pid, thread->pid);
2248 list_del(&w->entry);
2250 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
2252 case BINDER_WORK_NODE: {
2253 struct binder_node *node = container_of(w, struct binder_node, work);
2254 uint32_t cmd = BR_NOOP;
2255 const char *cmd_name;
2256 int strong = node->internal_strong_refs || node->local_strong_refs;
2257 int weak = !hlist_empty(&node->refs) || node->local_weak_refs || strong;
2259 if (weak && !node->has_weak_ref) {
2261 cmd_name = "BR_INCREFS";
2262 node->has_weak_ref = 1;
2263 node->pending_weak_ref = 1;
2264 node->local_weak_refs++;
2265 } else if (strong && !node->has_strong_ref) {
2267 cmd_name = "BR_ACQUIRE";
2268 node->has_strong_ref = 1;
2269 node->pending_strong_ref = 1;
2270 node->local_strong_refs++;
2271 } else if (!strong && node->has_strong_ref) {
2273 cmd_name = "BR_RELEASE";
2274 node->has_strong_ref = 0;
2275 } else if (!weak && node->has_weak_ref) {
2277 cmd_name = "BR_DECREFS";
2278 node->has_weak_ref = 0;
2280 if (cmd != BR_NOOP) {
2281 if (put_user(cmd, (uint32_t __user *)ptr))
2283 ptr += sizeof(uint32_t);
2284 if (put_user(node->ptr,
2285 (binder_uintptr_t __user *)ptr))
2287 ptr += sizeof(binder_uintptr_t);
2288 if (put_user(node->cookie,
2289 (binder_uintptr_t __user *)ptr))
2291 ptr += sizeof(binder_uintptr_t);
2293 binder_stat_br(proc, thread, cmd);
2294 binder_debug(BINDER_DEBUG_USER_REFS,
2295 "%d:%d %s %d u%016llx c%016llx\n",
2296 proc->pid, thread->pid, cmd_name,
2298 (u64)node->ptr, (u64)node->cookie);
2300 list_del_init(&w->entry);
2301 if (!weak && !strong) {
2302 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
2303 "%d:%d node %d u%016llx c%016llx deleted\n",
2304 proc->pid, thread->pid,
2308 rb_erase(&node->rb_node, &proc->nodes);
2310 binder_stats_deleted(BINDER_STAT_NODE);
2312 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
2313 "%d:%d node %d u%016llx c%016llx state unchanged\n",
2314 proc->pid, thread->pid,
2321 case BINDER_WORK_DEAD_BINDER:
2322 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
2323 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
2324 struct binder_ref_death *death;
2327 death = container_of(w, struct binder_ref_death, work);
2328 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION)
2329 cmd = BR_CLEAR_DEATH_NOTIFICATION_DONE;
2331 cmd = BR_DEAD_BINDER;
2332 if (put_user(cmd, (uint32_t __user *)ptr))
2334 ptr += sizeof(uint32_t);
2335 if (put_user(death->cookie,
2336 (binder_uintptr_t __user *)ptr))
2338 ptr += sizeof(binder_uintptr_t);
2339 binder_stat_br(proc, thread, cmd);
2340 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
2341 "%d:%d %s %016llx\n",
2342 proc->pid, thread->pid,
2343 cmd == BR_DEAD_BINDER ?
2345 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
2346 (u64)death->cookie);
2348 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) {
2349 list_del(&w->entry);
2351 binder_stats_deleted(BINDER_STAT_DEATH);
2353 list_move(&w->entry, &proc->delivered_death);
2354 if (cmd == BR_DEAD_BINDER)
2355 goto done; /* DEAD_BINDER notifications can cause transactions */
2362 BUG_ON(t->buffer == NULL);
2363 if (t->buffer->target_node) {
2364 struct binder_node *target_node = t->buffer->target_node;
2366 tr.target.ptr = target_node->ptr;
2367 tr.cookie = target_node->cookie;
2368 t->saved_priority = task_nice(current);
2369 if (t->priority < target_node->min_priority &&
2370 !(t->flags & TF_ONE_WAY))
2371 binder_set_nice(t->priority);
2372 else if (!(t->flags & TF_ONE_WAY) ||
2373 t->saved_priority > target_node->min_priority)
2374 binder_set_nice(target_node->min_priority);
2375 cmd = BR_TRANSACTION;
2382 tr.flags = t->flags;
2383 tr.sender_euid = from_kuid(current_user_ns(), t->sender_euid);
2386 struct task_struct *sender = t->from->proc->tsk;
2388 tr.sender_pid = task_tgid_nr_ns(sender,
2389 task_active_pid_ns(current));
2394 tr.data_size = t->buffer->data_size;
2395 tr.offsets_size = t->buffer->offsets_size;
2396 tr.data.ptr.buffer = (binder_uintptr_t)(
2397 (uintptr_t)t->buffer->data +
2398 proc->user_buffer_offset);
2399 tr.data.ptr.offsets = tr.data.ptr.buffer +
2400 ALIGN(t->buffer->data_size,
2403 if (put_user(cmd, (uint32_t __user *)ptr))
2405 ptr += sizeof(uint32_t);
2406 if (copy_to_user(ptr, &tr, sizeof(tr)))
2410 trace_binder_transaction_received(t);
2411 binder_stat_br(proc, thread, cmd);
2412 binder_debug(BINDER_DEBUG_TRANSACTION,
2413 "%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n",
2414 proc->pid, thread->pid,
2415 (cmd == BR_TRANSACTION) ? "BR_TRANSACTION" :
2417 t->debug_id, t->from ? t->from->proc->pid : 0,
2418 t->from ? t->from->pid : 0, cmd,
2419 t->buffer->data_size, t->buffer->offsets_size,
2420 (u64)tr.data.ptr.buffer, (u64)tr.data.ptr.offsets);
2422 list_del(&t->work.entry);
2423 t->buffer->allow_user_free = 1;
2424 if (cmd == BR_TRANSACTION && !(t->flags & TF_ONE_WAY)) {
2425 t->to_parent = thread->transaction_stack;
2426 t->to_thread = thread;
2427 thread->transaction_stack = t;
2429 t->buffer->transaction = NULL;
2431 binder_stats_deleted(BINDER_STAT_TRANSACTION);
2438 *consumed = ptr - buffer;
2439 if (proc->requested_threads + proc->ready_threads == 0 &&
2440 proc->requested_threads_started < proc->max_threads &&
2441 (thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
2442 BINDER_LOOPER_STATE_ENTERED)) /* the user-space code fails to */
2443 /*spawn a new thread if we leave this out */) {
2444 proc->requested_threads++;
2445 binder_debug(BINDER_DEBUG_THREADS,
2446 "%d:%d BR_SPAWN_LOOPER\n",
2447 proc->pid, thread->pid);
2448 if (put_user(BR_SPAWN_LOOPER, (uint32_t __user *)buffer))
2450 binder_stat_br(proc, thread, BR_SPAWN_LOOPER);
2455 static void binder_release_work(struct list_head *list)
2457 struct binder_work *w;
2459 while (!list_empty(list)) {
2460 w = list_first_entry(list, struct binder_work, entry);
2461 list_del_init(&w->entry);
2463 case BINDER_WORK_TRANSACTION: {
2464 struct binder_transaction *t;
2466 t = container_of(w, struct binder_transaction, work);
2467 if (t->buffer->target_node &&
2468 !(t->flags & TF_ONE_WAY)) {
2469 binder_send_failed_reply(t, BR_DEAD_REPLY);
2471 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
2472 "undelivered transaction %d\n",
2474 t->buffer->transaction = NULL;
2476 binder_stats_deleted(BINDER_STAT_TRANSACTION);
2479 case BINDER_WORK_TRANSACTION_COMPLETE: {
2480 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
2481 "undelivered TRANSACTION_COMPLETE\n");
2483 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
2485 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
2486 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
2487 struct binder_ref_death *death;
2489 death = container_of(w, struct binder_ref_death, work);
2490 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
2491 "undelivered death notification, %016llx\n",
2492 (u64)death->cookie);
2494 binder_stats_deleted(BINDER_STAT_DEATH);
2497 pr_err("unexpected work type, %d, not freed\n",
2505 static struct binder_thread *binder_get_thread(struct binder_proc *proc)
2507 struct binder_thread *thread = NULL;
2508 struct rb_node *parent = NULL;
2509 struct rb_node **p = &proc->threads.rb_node;
2513 thread = rb_entry(parent, struct binder_thread, rb_node);
2515 if (current->pid < thread->pid)
2517 else if (current->pid > thread->pid)
2518 p = &(*p)->rb_right;
2523 thread = kzalloc(sizeof(*thread), GFP_KERNEL);
2526 binder_stats_created(BINDER_STAT_THREAD);
2527 thread->proc = proc;
2528 thread->pid = current->pid;
2529 init_waitqueue_head(&thread->wait);
2530 INIT_LIST_HEAD(&thread->todo);
2531 rb_link_node(&thread->rb_node, parent, p);
2532 rb_insert_color(&thread->rb_node, &proc->threads);
2533 thread->looper |= BINDER_LOOPER_STATE_NEED_RETURN;
2534 thread->return_error = BR_OK;
2535 thread->return_error2 = BR_OK;
2540 static int binder_free_thread(struct binder_proc *proc,
2541 struct binder_thread *thread)
2543 struct binder_transaction *t;
2544 struct binder_transaction *send_reply = NULL;
2545 int active_transactions = 0;
2547 rb_erase(&thread->rb_node, &proc->threads);
2548 t = thread->transaction_stack;
2549 if (t && t->to_thread == thread)
2552 active_transactions++;
2553 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
2554 "release %d:%d transaction %d %s, still active\n",
2555 proc->pid, thread->pid,
2557 (t->to_thread == thread) ? "in" : "out");
2559 if (t->to_thread == thread) {
2561 t->to_thread = NULL;
2563 t->buffer->transaction = NULL;
2567 } else if (t->from == thread) {
2574 binder_send_failed_reply(send_reply, BR_DEAD_REPLY);
2575 binder_release_work(&thread->todo);
2577 binder_stats_deleted(BINDER_STAT_THREAD);
2578 return active_transactions;
2581 static unsigned int binder_poll(struct file *filp,
2582 struct poll_table_struct *wait)
2584 struct binder_proc *proc = filp->private_data;
2585 struct binder_thread *thread = NULL;
2586 int wait_for_proc_work;
2588 binder_lock(__func__);
2590 thread = binder_get_thread(proc);
2592 wait_for_proc_work = thread->transaction_stack == NULL &&
2593 list_empty(&thread->todo) && thread->return_error == BR_OK;
2595 binder_unlock(__func__);
2597 if (wait_for_proc_work) {
2598 if (binder_has_proc_work(proc, thread))
2600 poll_wait(filp, &proc->wait, wait);
2601 if (binder_has_proc_work(proc, thread))
2604 if (binder_has_thread_work(thread))
2606 poll_wait(filp, &thread->wait, wait);
2607 if (binder_has_thread_work(thread))
2613 static int binder_ioctl_write_read(struct file *filp,
2614 unsigned int cmd, unsigned long arg,
2615 struct binder_thread *thread)
2618 struct binder_proc *proc = filp->private_data;
2619 unsigned int size = _IOC_SIZE(cmd);
2620 void __user *ubuf = (void __user *)arg;
2621 struct binder_write_read bwr;
2623 if (size != sizeof(struct binder_write_read)) {
2627 if (copy_from_user(&bwr, ubuf, sizeof(bwr))) {
2631 binder_debug(BINDER_DEBUG_READ_WRITE,
2632 "%d:%d write %lld at %016llx, read %lld at %016llx\n",
2633 proc->pid, thread->pid,
2634 (u64)bwr.write_size, (u64)bwr.write_buffer,
2635 (u64)bwr.read_size, (u64)bwr.read_buffer);
2637 if (bwr.write_size > 0) {
2638 ret = binder_thread_write(proc, thread,
2641 &bwr.write_consumed);
2642 trace_binder_write_done(ret);
2644 bwr.read_consumed = 0;
2645 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
2650 if (bwr.read_size > 0) {
2651 ret = binder_thread_read(proc, thread, bwr.read_buffer,
2654 filp->f_flags & O_NONBLOCK);
2655 trace_binder_read_done(ret);
2656 if (!list_empty(&proc->todo))
2657 wake_up_interruptible(&proc->wait);
2659 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
2664 binder_debug(BINDER_DEBUG_READ_WRITE,
2665 "%d:%d wrote %lld of %lld, read return %lld of %lld\n",
2666 proc->pid, thread->pid,
2667 (u64)bwr.write_consumed, (u64)bwr.write_size,
2668 (u64)bwr.read_consumed, (u64)bwr.read_size);
2669 if (copy_to_user(ubuf, &bwr, sizeof(bwr))) {
2677 static int binder_ioctl_set_ctx_mgr(struct file *filp)
2680 struct binder_proc *proc = filp->private_data;
2681 kuid_t curr_euid = current_euid();
2683 if (binder_context_mgr_node != NULL) {
2684 pr_err("BINDER_SET_CONTEXT_MGR already set\n");
2688 if (uid_valid(binder_context_mgr_uid)) {
2689 if (!uid_eq(binder_context_mgr_uid, curr_euid)) {
2690 pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
2691 from_kuid(&init_user_ns, curr_euid),
2692 from_kuid(&init_user_ns,
2693 binder_context_mgr_uid));
2698 binder_context_mgr_uid = curr_euid;
2700 binder_context_mgr_node = binder_new_node(proc, 0, 0);
2701 if (binder_context_mgr_node == NULL) {
2705 binder_context_mgr_node->local_weak_refs++;
2706 binder_context_mgr_node->local_strong_refs++;
2707 binder_context_mgr_node->has_strong_ref = 1;
2708 binder_context_mgr_node->has_weak_ref = 1;
2713 static long binder_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
2716 struct binder_proc *proc = filp->private_data;
2717 struct binder_thread *thread;
2718 unsigned int size = _IOC_SIZE(cmd);
2719 void __user *ubuf = (void __user *)arg;
2721 /*pr_info("binder_ioctl: %d:%d %x %lx\n",
2722 proc->pid, current->pid, cmd, arg);*/
2724 trace_binder_ioctl(cmd, arg);
2726 ret = wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
2730 binder_lock(__func__);
2731 thread = binder_get_thread(proc);
2732 if (thread == NULL) {
2738 case BINDER_WRITE_READ:
2739 ret = binder_ioctl_write_read(filp, cmd, arg, thread);
2743 case BINDER_SET_MAX_THREADS:
2744 if (copy_from_user(&proc->max_threads, ubuf, sizeof(proc->max_threads))) {
2749 case BINDER_SET_CONTEXT_MGR:
2750 ret = binder_ioctl_set_ctx_mgr(filp);
2754 case BINDER_THREAD_EXIT:
2755 binder_debug(BINDER_DEBUG_THREADS, "%d:%d exit\n",
2756 proc->pid, thread->pid);
2757 binder_free_thread(proc, thread);
2760 case BINDER_VERSION: {
2761 struct binder_version __user *ver = ubuf;
2763 if (size != sizeof(struct binder_version)) {
2767 if (put_user(BINDER_CURRENT_PROTOCOL_VERSION,
2768 &ver->protocol_version)) {
2781 thread->looper &= ~BINDER_LOOPER_STATE_NEED_RETURN;
2782 binder_unlock(__func__);
2783 wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
2784 if (ret && ret != -ERESTARTSYS)
2785 pr_info("%d:%d ioctl %x %lx returned %d\n", proc->pid, current->pid, cmd, arg, ret);
2787 trace_binder_ioctl_done(ret);
2791 static void binder_vma_open(struct vm_area_struct *vma)
2793 struct binder_proc *proc = vma->vm_private_data;
2795 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
2796 "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
2797 proc->pid, vma->vm_start, vma->vm_end,
2798 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
2799 (unsigned long)pgprot_val(vma->vm_page_prot));
2802 static void binder_vma_close(struct vm_area_struct *vma)
2804 struct binder_proc *proc = vma->vm_private_data;
2806 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
2807 "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
2808 proc->pid, vma->vm_start, vma->vm_end,
2809 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
2810 (unsigned long)pgprot_val(vma->vm_page_prot));
2812 proc->vma_vm_mm = NULL;
2813 binder_defer_work(proc, BINDER_DEFERRED_PUT_FILES);
2816 static int binder_vm_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
2818 return VM_FAULT_SIGBUS;
2821 static struct vm_operations_struct binder_vm_ops = {
2822 .open = binder_vma_open,
2823 .close = binder_vma_close,
2824 .fault = binder_vm_fault,
2827 static int binder_mmap(struct file *filp, struct vm_area_struct *vma)
2830 struct vm_struct *area;
2831 struct binder_proc *proc = filp->private_data;
2832 const char *failure_string;
2833 struct binder_buffer *buffer;
2835 if (proc->tsk != current)
2838 if ((vma->vm_end - vma->vm_start) > SZ_4M)
2839 vma->vm_end = vma->vm_start + SZ_4M;
2841 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
2842 "binder_mmap: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
2843 proc->pid, vma->vm_start, vma->vm_end,
2844 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
2845 (unsigned long)pgprot_val(vma->vm_page_prot));
2847 if (vma->vm_flags & FORBIDDEN_MMAP_FLAGS) {
2849 failure_string = "bad vm_flags";
2852 vma->vm_flags = (vma->vm_flags | VM_DONTCOPY) & ~VM_MAYWRITE;
2854 mutex_lock(&binder_mmap_lock);
2857 failure_string = "already mapped";
2858 goto err_already_mapped;
2861 area = get_vm_area(vma->vm_end - vma->vm_start, VM_IOREMAP);
2864 failure_string = "get_vm_area";
2865 goto err_get_vm_area_failed;
2867 proc->buffer = area->addr;
2868 proc->user_buffer_offset = vma->vm_start - (uintptr_t)proc->buffer;
2869 mutex_unlock(&binder_mmap_lock);
2871 #ifdef CONFIG_CPU_CACHE_VIPT
2872 if (cache_is_vipt_aliasing()) {
2873 while (CACHE_COLOUR((vma->vm_start ^ (uint32_t)proc->buffer))) {
2874 pr_info("binder_mmap: %d %lx-%lx maps %p bad alignment\n", proc->pid, vma->vm_start, vma->vm_end, proc->buffer);
2875 vma->vm_start += PAGE_SIZE;
2879 proc->pages = kzalloc(sizeof(proc->pages[0]) * ((vma->vm_end - vma->vm_start) / PAGE_SIZE), GFP_KERNEL);
2880 if (proc->pages == NULL) {
2882 failure_string = "alloc page array";
2883 goto err_alloc_pages_failed;
2885 proc->buffer_size = vma->vm_end - vma->vm_start;
2887 vma->vm_ops = &binder_vm_ops;
2888 vma->vm_private_data = proc;
2890 if (binder_update_page_range(proc, 1, proc->buffer, proc->buffer + PAGE_SIZE, vma)) {
2892 failure_string = "alloc small buf";
2893 goto err_alloc_small_buf_failed;
2895 buffer = proc->buffer;
2896 INIT_LIST_HEAD(&proc->buffers);
2897 list_add(&buffer->entry, &proc->buffers);
2899 binder_insert_free_buffer(proc, buffer);
2900 proc->free_async_space = proc->buffer_size / 2;
2902 proc->files = get_files_struct(current);
2904 proc->vma_vm_mm = vma->vm_mm;
2906 /*pr_info("binder_mmap: %d %lx-%lx maps %p\n",
2907 proc->pid, vma->vm_start, vma->vm_end, proc->buffer);*/
2910 err_alloc_small_buf_failed:
2913 err_alloc_pages_failed:
2914 mutex_lock(&binder_mmap_lock);
2915 vfree(proc->buffer);
2916 proc->buffer = NULL;
2917 err_get_vm_area_failed:
2919 mutex_unlock(&binder_mmap_lock);
2921 pr_err("binder_mmap: %d %lx-%lx %s failed %d\n",
2922 proc->pid, vma->vm_start, vma->vm_end, failure_string, ret);
2926 static int binder_open(struct inode *nodp, struct file *filp)
2928 struct binder_proc *proc;
2930 binder_debug(BINDER_DEBUG_OPEN_CLOSE, "binder_open: %d:%d\n",
2931 current->group_leader->pid, current->pid);
2933 proc = kzalloc(sizeof(*proc), GFP_KERNEL);
2936 get_task_struct(current);
2937 proc->tsk = current;
2938 INIT_LIST_HEAD(&proc->todo);
2939 init_waitqueue_head(&proc->wait);
2940 proc->default_priority = task_nice(current);
2942 binder_lock(__func__);
2944 binder_stats_created(BINDER_STAT_PROC);
2945 hlist_add_head(&proc->proc_node, &binder_procs);
2946 proc->pid = current->group_leader->pid;
2947 INIT_LIST_HEAD(&proc->delivered_death);
2948 filp->private_data = proc;
2950 binder_unlock(__func__);
2952 if (binder_debugfs_dir_entry_proc) {
2955 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
2956 proc->debugfs_entry = debugfs_create_file(strbuf, S_IRUGO,
2957 binder_debugfs_dir_entry_proc, proc, &binder_proc_fops);
2963 static int binder_flush(struct file *filp, fl_owner_t id)
2965 struct binder_proc *proc = filp->private_data;
2967 binder_defer_work(proc, BINDER_DEFERRED_FLUSH);
2972 static void binder_deferred_flush(struct binder_proc *proc)
2977 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
2978 struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node);
2980 thread->looper |= BINDER_LOOPER_STATE_NEED_RETURN;
2981 if (thread->looper & BINDER_LOOPER_STATE_WAITING) {
2982 wake_up_interruptible(&thread->wait);
2986 wake_up_interruptible_all(&proc->wait);
2988 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
2989 "binder_flush: %d woke %d threads\n", proc->pid,
2993 static int binder_release(struct inode *nodp, struct file *filp)
2995 struct binder_proc *proc = filp->private_data;
2997 debugfs_remove(proc->debugfs_entry);
2998 binder_defer_work(proc, BINDER_DEFERRED_RELEASE);
3003 static int binder_node_release(struct binder_node *node, int refs)
3005 struct binder_ref *ref;
3008 list_del_init(&node->work.entry);
3009 binder_release_work(&node->async_todo);
3011 if (hlist_empty(&node->refs)) {
3013 binder_stats_deleted(BINDER_STAT_NODE);
3019 node->local_strong_refs = 0;
3020 node->local_weak_refs = 0;
3021 hlist_add_head(&node->dead_node, &binder_dead_nodes);
3023 hlist_for_each_entry(ref, &node->refs, node_entry) {
3031 if (list_empty(&ref->death->work.entry)) {
3032 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
3033 list_add_tail(&ref->death->work.entry,
3035 wake_up_interruptible(&ref->proc->wait);
3040 binder_debug(BINDER_DEBUG_DEAD_BINDER,
3041 "node %d now dead, refs %d, death %d\n",
3042 node->debug_id, refs, death);
3047 static void binder_deferred_release(struct binder_proc *proc)
3049 struct binder_transaction *t;
3051 int threads, nodes, incoming_refs, outgoing_refs, buffers,
3052 active_transactions, page_count;
3055 BUG_ON(proc->files);
3057 hlist_del(&proc->proc_node);
3059 if (binder_context_mgr_node && binder_context_mgr_node->proc == proc) {
3060 binder_debug(BINDER_DEBUG_DEAD_BINDER,
3061 "%s: %d context_mgr_node gone\n",
3062 __func__, proc->pid);
3063 binder_context_mgr_node = NULL;
3067 active_transactions = 0;
3068 while ((n = rb_first(&proc->threads))) {
3069 struct binder_thread *thread;
3071 thread = rb_entry(n, struct binder_thread, rb_node);
3073 active_transactions += binder_free_thread(proc, thread);
3078 while ((n = rb_first(&proc->nodes))) {
3079 struct binder_node *node;
3081 node = rb_entry(n, struct binder_node, rb_node);
3083 rb_erase(&node->rb_node, &proc->nodes);
3084 incoming_refs = binder_node_release(node, incoming_refs);
3088 while ((n = rb_first(&proc->refs_by_desc))) {
3089 struct binder_ref *ref;
3091 ref = rb_entry(n, struct binder_ref, rb_node_desc);
3093 binder_delete_ref(ref);
3096 binder_release_work(&proc->todo);
3097 binder_release_work(&proc->delivered_death);
3100 while ((n = rb_first(&proc->allocated_buffers))) {
3101 struct binder_buffer *buffer;
3103 buffer = rb_entry(n, struct binder_buffer, rb_node);
3105 t = buffer->transaction;
3108 buffer->transaction = NULL;
3109 pr_err("release proc %d, transaction %d, not freed\n",
3110 proc->pid, t->debug_id);
3114 binder_free_buf(proc, buffer);
3118 binder_stats_deleted(BINDER_STAT_PROC);
3124 for (i = 0; i < proc->buffer_size / PAGE_SIZE; i++) {
3127 if (!proc->pages[i])
3130 page_addr = proc->buffer + i * PAGE_SIZE;
3131 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
3132 "%s: %d: page %d at %p not freed\n",
3133 __func__, proc->pid, i, page_addr);
3134 unmap_kernel_range((unsigned long)page_addr, PAGE_SIZE);
3135 __free_page(proc->pages[i]);
3139 vfree(proc->buffer);
3142 put_task_struct(proc->tsk);
3144 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
3145 "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d, buffers %d, pages %d\n",
3146 __func__, proc->pid, threads, nodes, incoming_refs,
3147 outgoing_refs, active_transactions, buffers, page_count);
3152 static void binder_deferred_func(struct work_struct *work)
3154 struct binder_proc *proc;
3155 struct files_struct *files;
3160 binder_lock(__func__);
3161 mutex_lock(&binder_deferred_lock);
3162 if (!hlist_empty(&binder_deferred_list)) {
3163 proc = hlist_entry(binder_deferred_list.first,
3164 struct binder_proc, deferred_work_node);
3165 hlist_del_init(&proc->deferred_work_node);
3166 defer = proc->deferred_work;
3167 proc->deferred_work = 0;
3172 mutex_unlock(&binder_deferred_lock);
3175 if (defer & BINDER_DEFERRED_PUT_FILES) {
3176 files = proc->files;
3181 if (defer & BINDER_DEFERRED_FLUSH)
3182 binder_deferred_flush(proc);
3184 if (defer & BINDER_DEFERRED_RELEASE)
3185 binder_deferred_release(proc); /* frees proc */
3187 binder_unlock(__func__);
3189 put_files_struct(files);
3192 static DECLARE_WORK(binder_deferred_work, binder_deferred_func);
3195 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer)
3197 mutex_lock(&binder_deferred_lock);
3198 proc->deferred_work |= defer;
3199 if (hlist_unhashed(&proc->deferred_work_node)) {
3200 hlist_add_head(&proc->deferred_work_node,
3201 &binder_deferred_list);
3202 queue_work(binder_deferred_workqueue, &binder_deferred_work);
3204 mutex_unlock(&binder_deferred_lock);
3207 static void print_binder_transaction(struct seq_file *m, const char *prefix,
3208 struct binder_transaction *t)
3211 "%s %d: %p from %d:%d to %d:%d code %x flags %x pri %ld r%d",
3212 prefix, t->debug_id, t,
3213 t->from ? t->from->proc->pid : 0,
3214 t->from ? t->from->pid : 0,
3215 t->to_proc ? t->to_proc->pid : 0,
3216 t->to_thread ? t->to_thread->pid : 0,
3217 t->code, t->flags, t->priority, t->need_reply);
3218 if (t->buffer == NULL) {
3219 seq_puts(m, " buffer free\n");
3222 if (t->buffer->target_node)
3223 seq_printf(m, " node %d",
3224 t->buffer->target_node->debug_id);
3225 seq_printf(m, " size %zd:%zd data %p\n",
3226 t->buffer->data_size, t->buffer->offsets_size,
3230 static void print_binder_buffer(struct seq_file *m, const char *prefix,
3231 struct binder_buffer *buffer)
3233 seq_printf(m, "%s %d: %p size %zd:%zd %s\n",
3234 prefix, buffer->debug_id, buffer->data,
3235 buffer->data_size, buffer->offsets_size,
3236 buffer->transaction ? "active" : "delivered");
3239 static void print_binder_work(struct seq_file *m, const char *prefix,
3240 const char *transaction_prefix,
3241 struct binder_work *w)
3243 struct binder_node *node;
3244 struct binder_transaction *t;
3247 case BINDER_WORK_TRANSACTION:
3248 t = container_of(w, struct binder_transaction, work);
3249 print_binder_transaction(m, transaction_prefix, t);
3251 case BINDER_WORK_TRANSACTION_COMPLETE:
3252 seq_printf(m, "%stransaction complete\n", prefix);
3254 case BINDER_WORK_NODE:
3255 node = container_of(w, struct binder_node, work);
3256 seq_printf(m, "%snode work %d: u%016llx c%016llx\n",
3257 prefix, node->debug_id,
3258 (u64)node->ptr, (u64)node->cookie);
3260 case BINDER_WORK_DEAD_BINDER:
3261 seq_printf(m, "%shas dead binder\n", prefix);
3263 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
3264 seq_printf(m, "%shas cleared dead binder\n", prefix);
3266 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION:
3267 seq_printf(m, "%shas cleared death notification\n", prefix);
3270 seq_printf(m, "%sunknown work: type %d\n", prefix, w->type);
3275 static void print_binder_thread(struct seq_file *m,
3276 struct binder_thread *thread,
3279 struct binder_transaction *t;
3280 struct binder_work *w;
3281 size_t start_pos = m->count;
3284 seq_printf(m, " thread %d: l %02x\n", thread->pid, thread->looper);
3285 header_pos = m->count;
3286 t = thread->transaction_stack;
3288 if (t->from == thread) {
3289 print_binder_transaction(m,
3290 " outgoing transaction", t);
3292 } else if (t->to_thread == thread) {
3293 print_binder_transaction(m,
3294 " incoming transaction", t);
3297 print_binder_transaction(m, " bad transaction", t);
3301 list_for_each_entry(w, &thread->todo, entry) {
3302 print_binder_work(m, " ", " pending transaction", w);
3304 if (!print_always && m->count == header_pos)
3305 m->count = start_pos;
3308 static void print_binder_node(struct seq_file *m, struct binder_node *node)
3310 struct binder_ref *ref;
3311 struct binder_work *w;
3315 hlist_for_each_entry(ref, &node->refs, node_entry)
3318 seq_printf(m, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d",
3319 node->debug_id, (u64)node->ptr, (u64)node->cookie,
3320 node->has_strong_ref, node->has_weak_ref,
3321 node->local_strong_refs, node->local_weak_refs,
3322 node->internal_strong_refs, count);
3324 seq_puts(m, " proc");
3325 hlist_for_each_entry(ref, &node->refs, node_entry)
3326 seq_printf(m, " %d", ref->proc->pid);
3329 list_for_each_entry(w, &node->async_todo, entry)
3330 print_binder_work(m, " ",
3331 " pending async transaction", w);
3334 static void print_binder_ref(struct seq_file *m, struct binder_ref *ref)
3336 seq_printf(m, " ref %d: desc %d %snode %d s %d w %d d %p\n",
3337 ref->debug_id, ref->desc, ref->node->proc ? "" : "dead ",
3338 ref->node->debug_id, ref->strong, ref->weak, ref->death);
3341 static void print_binder_proc(struct seq_file *m,
3342 struct binder_proc *proc, int print_all)
3344 struct binder_work *w;
3346 size_t start_pos = m->count;
3349 seq_printf(m, "proc %d\n", proc->pid);
3350 header_pos = m->count;
3352 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
3353 print_binder_thread(m, rb_entry(n, struct binder_thread,
3354 rb_node), print_all);
3355 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
3356 struct binder_node *node = rb_entry(n, struct binder_node,
3358 if (print_all || node->has_async_transaction)
3359 print_binder_node(m, node);
3362 for (n = rb_first(&proc->refs_by_desc);
3365 print_binder_ref(m, rb_entry(n, struct binder_ref,
3368 for (n = rb_first(&proc->allocated_buffers); n != NULL; n = rb_next(n))
3369 print_binder_buffer(m, " buffer",
3370 rb_entry(n, struct binder_buffer, rb_node));
3371 list_for_each_entry(w, &proc->todo, entry)
3372 print_binder_work(m, " ", " pending transaction", w);
3373 list_for_each_entry(w, &proc->delivered_death, entry) {
3374 seq_puts(m, " has delivered dead binder\n");
3377 if (!print_all && m->count == header_pos)
3378 m->count = start_pos;
3381 static const char * const binder_return_strings[] = {
3386 "BR_ACQUIRE_RESULT",
3388 "BR_TRANSACTION_COMPLETE",
3393 "BR_ATTEMPT_ACQUIRE",
3398 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
3402 static const char * const binder_command_strings[] = {
3405 "BC_ACQUIRE_RESULT",
3413 "BC_ATTEMPT_ACQUIRE",
3414 "BC_REGISTER_LOOPER",
3417 "BC_REQUEST_DEATH_NOTIFICATION",
3418 "BC_CLEAR_DEATH_NOTIFICATION",
3419 "BC_DEAD_BINDER_DONE"
3422 static const char * const binder_objstat_strings[] = {
3429 "transaction_complete"
3432 static void print_binder_stats(struct seq_file *m, const char *prefix,
3433 struct binder_stats *stats)
3437 BUILD_BUG_ON(ARRAY_SIZE(stats->bc) !=
3438 ARRAY_SIZE(binder_command_strings));
3439 for (i = 0; i < ARRAY_SIZE(stats->bc); i++) {
3441 seq_printf(m, "%s%s: %d\n", prefix,
3442 binder_command_strings[i], stats->bc[i]);
3445 BUILD_BUG_ON(ARRAY_SIZE(stats->br) !=
3446 ARRAY_SIZE(binder_return_strings));
3447 for (i = 0; i < ARRAY_SIZE(stats->br); i++) {
3449 seq_printf(m, "%s%s: %d\n", prefix,
3450 binder_return_strings[i], stats->br[i]);
3453 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
3454 ARRAY_SIZE(binder_objstat_strings));
3455 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
3456 ARRAY_SIZE(stats->obj_deleted));
3457 for (i = 0; i < ARRAY_SIZE(stats->obj_created); i++) {
3458 if (stats->obj_created[i] || stats->obj_deleted[i])
3459 seq_printf(m, "%s%s: active %d total %d\n", prefix,
3460 binder_objstat_strings[i],
3461 stats->obj_created[i] - stats->obj_deleted[i],
3462 stats->obj_created[i]);
3466 static void print_binder_proc_stats(struct seq_file *m,
3467 struct binder_proc *proc)
3469 struct binder_work *w;
3471 int count, strong, weak;
3473 seq_printf(m, "proc %d\n", proc->pid);
3475 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
3477 seq_printf(m, " threads: %d\n", count);
3478 seq_printf(m, " requested threads: %d+%d/%d\n"
3479 " ready threads %d\n"
3480 " free async space %zd\n", proc->requested_threads,
3481 proc->requested_threads_started, proc->max_threads,
3482 proc->ready_threads, proc->free_async_space);
3484 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n))
3486 seq_printf(m, " nodes: %d\n", count);
3490 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
3491 struct binder_ref *ref = rb_entry(n, struct binder_ref,
3494 strong += ref->strong;
3497 seq_printf(m, " refs: %d s %d w %d\n", count, strong, weak);
3500 for (n = rb_first(&proc->allocated_buffers); n != NULL; n = rb_next(n))
3502 seq_printf(m, " buffers: %d\n", count);
3505 list_for_each_entry(w, &proc->todo, entry) {
3507 case BINDER_WORK_TRANSACTION:
3514 seq_printf(m, " pending transactions: %d\n", count);
3516 print_binder_stats(m, " ", &proc->stats);
3520 static int binder_state_show(struct seq_file *m, void *unused)
3522 struct binder_proc *proc;
3523 struct binder_node *node;
3524 int do_lock = !binder_debug_no_lock;
3527 binder_lock(__func__);
3529 seq_puts(m, "binder state:\n");
3531 if (!hlist_empty(&binder_dead_nodes))
3532 seq_puts(m, "dead nodes:\n");
3533 hlist_for_each_entry(node, &binder_dead_nodes, dead_node)
3534 print_binder_node(m, node);
3536 hlist_for_each_entry(proc, &binder_procs, proc_node)
3537 print_binder_proc(m, proc, 1);
3539 binder_unlock(__func__);
3543 static int binder_stats_show(struct seq_file *m, void *unused)
3545 struct binder_proc *proc;
3546 int do_lock = !binder_debug_no_lock;
3549 binder_lock(__func__);
3551 seq_puts(m, "binder stats:\n");
3553 print_binder_stats(m, "", &binder_stats);
3555 hlist_for_each_entry(proc, &binder_procs, proc_node)
3556 print_binder_proc_stats(m, proc);
3558 binder_unlock(__func__);
3562 static int binder_transactions_show(struct seq_file *m, void *unused)
3564 struct binder_proc *proc;
3565 int do_lock = !binder_debug_no_lock;
3568 binder_lock(__func__);
3570 seq_puts(m, "binder transactions:\n");
3571 hlist_for_each_entry(proc, &binder_procs, proc_node)
3572 print_binder_proc(m, proc, 0);
3574 binder_unlock(__func__);
3578 static int binder_proc_show(struct seq_file *m, void *unused)
3580 struct binder_proc *proc = m->private;
3581 int do_lock = !binder_debug_no_lock;
3584 binder_lock(__func__);
3585 seq_puts(m, "binder proc state:\n");
3586 print_binder_proc(m, proc, 1);
3588 binder_unlock(__func__);
3592 static void print_binder_transaction_log_entry(struct seq_file *m,
3593 struct binder_transaction_log_entry *e)
3596 "%d: %s from %d:%d to %d:%d node %d handle %d size %d:%d\n",
3597 e->debug_id, (e->call_type == 2) ? "reply" :
3598 ((e->call_type == 1) ? "async" : "call "), e->from_proc,
3599 e->from_thread, e->to_proc, e->to_thread, e->to_node,
3600 e->target_handle, e->data_size, e->offsets_size);
3603 static int binder_transaction_log_show(struct seq_file *m, void *unused)
3605 struct binder_transaction_log *log = m->private;
3609 for (i = log->next; i < ARRAY_SIZE(log->entry); i++)
3610 print_binder_transaction_log_entry(m, &log->entry[i]);
3612 for (i = 0; i < log->next; i++)
3613 print_binder_transaction_log_entry(m, &log->entry[i]);
3617 static const struct file_operations binder_fops = {
3618 .owner = THIS_MODULE,
3619 .poll = binder_poll,
3620 .unlocked_ioctl = binder_ioctl,
3621 .compat_ioctl = binder_ioctl,
3622 .mmap = binder_mmap,
3623 .open = binder_open,
3624 .flush = binder_flush,
3625 .release = binder_release,
3628 static struct miscdevice binder_miscdev = {
3629 .minor = MISC_DYNAMIC_MINOR,
3631 .fops = &binder_fops
3634 BINDER_DEBUG_ENTRY(state);
3635 BINDER_DEBUG_ENTRY(stats);
3636 BINDER_DEBUG_ENTRY(transactions);
3637 BINDER_DEBUG_ENTRY(transaction_log);
3639 static int __init binder_init(void)
3643 binder_deferred_workqueue = create_singlethread_workqueue("binder");
3644 if (!binder_deferred_workqueue)
3647 binder_debugfs_dir_entry_root = debugfs_create_dir("binder", NULL);
3648 if (binder_debugfs_dir_entry_root)
3649 binder_debugfs_dir_entry_proc = debugfs_create_dir("proc",
3650 binder_debugfs_dir_entry_root);
3651 ret = misc_register(&binder_miscdev);
3652 if (binder_debugfs_dir_entry_root) {
3653 debugfs_create_file("state",
3655 binder_debugfs_dir_entry_root,
3657 &binder_state_fops);
3658 debugfs_create_file("stats",
3660 binder_debugfs_dir_entry_root,
3662 &binder_stats_fops);
3663 debugfs_create_file("transactions",
3665 binder_debugfs_dir_entry_root,
3667 &binder_transactions_fops);
3668 debugfs_create_file("transaction_log",
3670 binder_debugfs_dir_entry_root,
3671 &binder_transaction_log,
3672 &binder_transaction_log_fops);
3673 debugfs_create_file("failed_transaction_log",
3675 binder_debugfs_dir_entry_root,
3676 &binder_transaction_log_failed,
3677 &binder_transaction_log_fops);
3682 device_initcall(binder_init);
3684 #define CREATE_TRACE_POINTS
3685 #include "binder_trace.h"
3687 MODULE_LICENSE("GPL v2");