?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
clk: shmobile: Add r8a7740, sh73a0 SoCs to MSTP bindings
[linux-2.6/btrfs-unstable.git] / drivers / staging / android / binder.c
blob4f34dc0095b579fef086508ab27d634d9f410660
1 /* binder.c
2 *
3 * Android IPC Subsystem
4 *
5 * Copyright (C) 2007-2008 Google, Inc.
6 *
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.
10 *
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.
15 *
16 */
17
18 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
19
20 #include <asm/cacheflush.h>
21 #include <linux/fdtable.h>
22 #include <linux/file.h>
23 #include <linux/freezer.h>
24 #include <linux/fs.h>
25 #include <linux/list.h>
26 #include <linux/miscdevice.h>
27 #include <linux/mm.h>
28 #include <linux/module.h>
29 #include <linux/mutex.h>
30 #include <linux/nsproxy.h>
31 #include <linux/poll.h>
32 #include <linux/debugfs.h>
33 #include <linux/rbtree.h>
34 #include <linux/sched.h>
35 #include <linux/seq_file.h>
36 #include <linux/uaccess.h>
37 #include <linux/vmalloc.h>
38 #include <linux/slab.h>
39 #include <linux/pid_namespace.h>
40
41 #include "binder.h"
42 #include "binder_trace.h"
43
44 static DEFINE_MUTEX(binder_main_lock);
45 static DEFINE_MUTEX(binder_deferred_lock);
46 static DEFINE_MUTEX(binder_mmap_lock);
47
48 static HLIST_HEAD(binder_procs);
49 static HLIST_HEAD(binder_deferred_list);
50 static HLIST_HEAD(binder_dead_nodes);
51
52 static struct dentry *binder_debugfs_dir_entry_root;
53 static struct dentry *binder_debugfs_dir_entry_proc;
54 static struct binder_node *binder_context_mgr_node;
55 static kuid_t binder_context_mgr_uid = INVALID_UID;
56 static int binder_last_id;
57 static struct workqueue_struct *binder_deferred_workqueue;
58
59 #define BINDER_DEBUG_ENTRY(name) \
60 static int binder_##name##_open(struct inode *inode, struct file *file) \
61 { \
62 return single_open(file, binder_##name##_show, inode->i_private); \
63 } \
64 \
65 static const struct file_operations binder_##name##_fops = { \
66 .owner = THIS_MODULE, \
67 .open = binder_##name##_open, \
68 .read = seq_read, \
69 .llseek = seq_lseek, \
70 .release = single_release, \
71 }
72
73 static int binder_proc_show(struct seq_file *m, void *unused);
74 BINDER_DEBUG_ENTRY(proc);
75
76 /* This is only defined in include/asm-arm/sizes.h */
77 #ifndef SZ_1K
78 #define SZ_1K 0x400
79 #endif
80
81 #ifndef SZ_4M
82 #define SZ_4M 0x400000
83 #endif
84
85 #define FORBIDDEN_MMAP_FLAGS (VM_WRITE)
86
87 #define BINDER_SMALL_BUF_SIZE (PAGE_SIZE * 64)
88
89 enum {
90 BINDER_DEBUG_USER_ERROR = 1U << 0,
91 BINDER_DEBUG_FAILED_TRANSACTION = 1U << 1,
92 BINDER_DEBUG_DEAD_TRANSACTION = 1U << 2,
93 BINDER_DEBUG_OPEN_CLOSE = 1U << 3,
94 BINDER_DEBUG_DEAD_BINDER = 1U << 4,
95 BINDER_DEBUG_DEATH_NOTIFICATION = 1U << 5,
96 BINDER_DEBUG_READ_WRITE = 1U << 6,
97 BINDER_DEBUG_USER_REFS = 1U << 7,
98 BINDER_DEBUG_THREADS = 1U << 8,
99 BINDER_DEBUG_TRANSACTION = 1U << 9,
100 BINDER_DEBUG_TRANSACTION_COMPLETE = 1U << 10,
101 BINDER_DEBUG_FREE_BUFFER = 1U << 11,
102 BINDER_DEBUG_INTERNAL_REFS = 1U << 12,
103 BINDER_DEBUG_BUFFER_ALLOC = 1U << 13,
104 BINDER_DEBUG_PRIORITY_CAP = 1U << 14,
105 BINDER_DEBUG_BUFFER_ALLOC_ASYNC = 1U << 15,
106 };
107 static uint32_t binder_debug_mask = BINDER_DEBUG_USER_ERROR |
108 BINDER_DEBUG_FAILED_TRANSACTION | BINDER_DEBUG_DEAD_TRANSACTION;
109 module_param_named(debug_mask, binder_debug_mask, uint, S_IWUSR | S_IRUGO);
110
111 static bool binder_debug_no_lock;
112 module_param_named(proc_no_lock, binder_debug_no_lock, bool, S_IWUSR | S_IRUGO);
113
114 static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait);
115 static int binder_stop_on_user_error;
116
117 static int binder_set_stop_on_user_error(const char *val,
118 struct kernel_param *kp)
119 {
120 int ret;
121
122 ret = param_set_int(val, kp);
123 if (binder_stop_on_user_error < 2)
124 wake_up(&binder_user_error_wait);
125 return ret;
126 }
127 module_param_call(stop_on_user_error, binder_set_stop_on_user_error,
128 param_get_int, &binder_stop_on_user_error, S_IWUSR | S_IRUGO);
129
130 #define binder_debug(mask, x...) \
131 do { \
132 if (binder_debug_mask & mask) \
133 pr_info(x); \
134 } while (0)
135
136 #define binder_user_error(x...) \
137 do { \
138 if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) \
139 pr_info(x); \
140 if (binder_stop_on_user_error) \
141 binder_stop_on_user_error = 2; \
142 } while (0)
143
144 enum binder_stat_types {
145 BINDER_STAT_PROC,
146 BINDER_STAT_THREAD,
147 BINDER_STAT_NODE,
148 BINDER_STAT_REF,
149 BINDER_STAT_DEATH,
150 BINDER_STAT_TRANSACTION,
151 BINDER_STAT_TRANSACTION_COMPLETE,
152 BINDER_STAT_COUNT
153 };
154
155 struct binder_stats {
156 int br[_IOC_NR(BR_FAILED_REPLY) + 1];
157 int bc[_IOC_NR(BC_DEAD_BINDER_DONE) + 1];
158 int obj_created[BINDER_STAT_COUNT];
159 int obj_deleted[BINDER_STAT_COUNT];
160 };
161
162 static struct binder_stats binder_stats;
163
164 static inline void binder_stats_deleted(enum binder_stat_types type)
165 {
166 binder_stats.obj_deleted[type]++;
167 }
168
169 static inline void binder_stats_created(enum binder_stat_types type)
170 {
171 binder_stats.obj_created[type]++;
172 }
173
174 struct binder_transaction_log_entry {
175 int debug_id;
176 int call_type;
177 int from_proc;
178 int from_thread;
179 int target_handle;
180 int to_proc;
181 int to_thread;
182 int to_node;
183 int data_size;
184 int offsets_size;
185 };
186 struct binder_transaction_log {
187 int next;
188 int full;
189 struct binder_transaction_log_entry entry[32];
190 };
191 static struct binder_transaction_log binder_transaction_log;
192 static struct binder_transaction_log binder_transaction_log_failed;
193
194 static struct binder_transaction_log_entry *binder_transaction_log_add(
195 struct binder_transaction_log *log)
196 {
197 struct binder_transaction_log_entry *e;
198
199 e = &log->entry[log->next];
200 memset(e, 0, sizeof(*e));
201 log->next++;
202 if (log->next == ARRAY_SIZE(log->entry)) {
203 log->next = 0;
204 log->full = 1;
205 }
206 return e;
207 }
208
209 struct binder_work {
210 struct list_head entry;
211 enum {
212 BINDER_WORK_TRANSACTION = 1,
213 BINDER_WORK_TRANSACTION_COMPLETE,
214 BINDER_WORK_NODE,
215 BINDER_WORK_DEAD_BINDER,
216 BINDER_WORK_DEAD_BINDER_AND_CLEAR,
217 BINDER_WORK_CLEAR_DEATH_NOTIFICATION,
218 } type;
219 };
220
221 struct binder_node {
222 int debug_id;
223 struct binder_work work;
224 union {
225 struct rb_node rb_node;
226 struct hlist_node dead_node;
227 };
228 struct binder_proc *proc;
229 struct hlist_head refs;
230 int internal_strong_refs;
231 int local_weak_refs;
232 int local_strong_refs;
233 binder_uintptr_t ptr;
234 binder_uintptr_t cookie;
235 unsigned has_strong_ref:1;
236 unsigned pending_strong_ref:1;
237 unsigned has_weak_ref:1;
238 unsigned pending_weak_ref:1;
239 unsigned has_async_transaction:1;
240 unsigned accept_fds:1;
241 unsigned min_priority:8;
242 struct list_head async_todo;
243 };
244
245 struct binder_ref_death {
246 struct binder_work work;
247 binder_uintptr_t cookie;
248 };
249
250 struct binder_ref {
251 /* Lookups needed: */
252 /* node + proc => ref (transaction) */
253 /* desc + proc => ref (transaction, inc/dec ref) */
254 /* node => refs + procs (proc exit) */
255 int debug_id;
256 struct rb_node rb_node_desc;
257 struct rb_node rb_node_node;
258 struct hlist_node node_entry;
259 struct binder_proc *proc;
260 struct binder_node *node;
261 uint32_t desc;
262 int strong;
263 int weak;
264 struct binder_ref_death *death;
265 };
266
267 struct binder_buffer {
268 struct list_head entry; /* free and allocated entries by address */
269 struct rb_node rb_node; /* free entry by size or allocated entry */
270 /* by address */
271 unsigned free:1;
272 unsigned allow_user_free:1;
273 unsigned async_transaction:1;
274 unsigned debug_id:29;
275
276 struct binder_transaction *transaction;
277
278 struct binder_node *target_node;
279 size_t data_size;
280 size_t offsets_size;
281 uint8_t data[0];
282 };
283
284 enum binder_deferred_state {
285 BINDER_DEFERRED_PUT_FILES = 0x01,
286 BINDER_DEFERRED_FLUSH = 0x02,
287 BINDER_DEFERRED_RELEASE = 0x04,
288 };
289
290 struct binder_proc {
291 struct hlist_node proc_node;
292 struct rb_root threads;
293 struct rb_root nodes;
294 struct rb_root refs_by_desc;
295 struct rb_root refs_by_node;
296 int pid;
297 struct vm_area_struct *vma;
298 struct mm_struct *vma_vm_mm;
299 struct task_struct *tsk;
300 struct files_struct *files;
301 struct hlist_node deferred_work_node;
302 int deferred_work;
303 void *buffer;
304 ptrdiff_t user_buffer_offset;
305
306 struct list_head buffers;
307 struct rb_root free_buffers;
308 struct rb_root allocated_buffers;
309 size_t free_async_space;
310
311 struct page **pages;
312 size_t buffer_size;
313 uint32_t buffer_free;
314 struct list_head todo;
315 wait_queue_head_t wait;
316 struct binder_stats stats;
317 struct list_head delivered_death;
318 int max_threads;
319 int requested_threads;
320 int requested_threads_started;
321 int ready_threads;
322 long default_priority;
323 struct dentry *debugfs_entry;
324 };
325
326 enum {
327 BINDER_LOOPER_STATE_REGISTERED = 0x01,
328 BINDER_LOOPER_STATE_ENTERED = 0x02,
329 BINDER_LOOPER_STATE_EXITED = 0x04,
330 BINDER_LOOPER_STATE_INVALID = 0x08,
331 BINDER_LOOPER_STATE_WAITING = 0x10,
332 BINDER_LOOPER_STATE_NEED_RETURN = 0x20
333 };
334
335 struct binder_thread {
336 struct binder_proc *proc;
337 struct rb_node rb_node;
338 int pid;
339 int looper;
340 struct binder_transaction *transaction_stack;
341 struct list_head todo;
342 uint32_t return_error; /* Write failed, return error code in read buf */
343 uint32_t return_error2; /* Write failed, return error code in read */
344 /* buffer. Used when sending a reply to a dead process that */
345 /* we are also waiting on */
346 wait_queue_head_t wait;
347 struct binder_stats stats;
348 };
349
350 struct binder_transaction {
351 int debug_id;
352 struct binder_work work;
353 struct binder_thread *from;
354 struct binder_transaction *from_parent;
355 struct binder_proc *to_proc;
356 struct binder_thread *to_thread;
357 struct binder_transaction *to_parent;
358 unsigned need_reply:1;
359 /* unsigned is_dead:1; */ /* not used at the moment */
360
361 struct binder_buffer *buffer;
362 unsigned int code;
363 unsigned int flags;
364 long priority;
365 long saved_priority;
366 kuid_t sender_euid;
367 };
368
369 static void
370 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer);
371
372 static int task_get_unused_fd_flags(struct binder_proc *proc, int flags)
373 {
374 struct files_struct *files = proc->files;
375 unsigned long rlim_cur;
376 unsigned long irqs;
377
378 if (files == NULL)
379 return -ESRCH;
380
381 if (!lock_task_sighand(proc->tsk, &irqs))
382 return -EMFILE;
383
384 rlim_cur = task_rlimit(proc->tsk, RLIMIT_NOFILE);
385 unlock_task_sighand(proc->tsk, &irqs);
386
387 return __alloc_fd(files, 0, rlim_cur, flags);
388 }
389
390 /*
391 * copied from fd_install
392 */
393 static void task_fd_install(
394 struct binder_proc *proc, unsigned int fd, struct file *file)
395 {
396 if (proc->files)
397 __fd_install(proc->files, fd, file);
398 }
399
400 /*
401 * copied from sys_close
402 */
403 static long task_close_fd(struct binder_proc *proc, unsigned int fd)
404 {
405 int retval;
406
407 if (proc->files == NULL)
408 return -ESRCH;
409
410 retval = __close_fd(proc->files, fd);
411 /* can't restart close syscall because file table entry was cleared */
412 if (unlikely(retval == -ERESTARTSYS ||
413 retval == -ERESTARTNOINTR ||
414 retval == -ERESTARTNOHAND ||
415 retval == -ERESTART_RESTARTBLOCK))
416 retval = -EINTR;
417
418 return retval;
419 }
420
421 static inline void binder_lock(const char *tag)
422 {
423 trace_binder_lock(tag);
424 mutex_lock(&binder_main_lock);
425 trace_binder_locked(tag);
426 }
427
428 static inline void binder_unlock(const char *tag)
429 {
430 trace_binder_unlock(tag);
431 mutex_unlock(&binder_main_lock);
432 }
433
434 static void binder_set_nice(long nice)
435 {
436 long min_nice;
437
438 if (can_nice(current, nice)) {
439 set_user_nice(current, nice);
440 return;
441 }
442 min_nice = rlimit_to_nice(current->signal->rlim[RLIMIT_NICE].rlim_cur);
443 binder_debug(BINDER_DEBUG_PRIORITY_CAP,
444 "%d: nice value %ld not allowed use %ld instead\n",
445 current->pid, nice, min_nice);
446 set_user_nice(current, min_nice);
447 if (min_nice <= MAX_NICE)
448 return;
449 binder_user_error("%d RLIMIT_NICE not set\n", current->pid);
450 }
451
452 static size_t binder_buffer_size(struct binder_proc *proc,
453 struct binder_buffer *buffer)
454 {
455 if (list_is_last(&buffer->entry, &proc->buffers))
456 return proc->buffer + proc->buffer_size - (void *)buffer->data;
457 return (size_t)list_entry(buffer->entry.next,
458 struct binder_buffer, entry) - (size_t)buffer->data;
459 }
460
461 static void binder_insert_free_buffer(struct binder_proc *proc,
462 struct binder_buffer *new_buffer)
463 {
464 struct rb_node **p = &proc->free_buffers.rb_node;
465 struct rb_node *parent = NULL;
466 struct binder_buffer *buffer;
467 size_t buffer_size;
468 size_t new_buffer_size;
469
470 BUG_ON(!new_buffer->free);
471
472 new_buffer_size = binder_buffer_size(proc, new_buffer);
473
474 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
475 "%d: add free buffer, size %zd, at %p\n",
476 proc->pid, new_buffer_size, new_buffer);
477
478 while (*p) {
479 parent = *p;
480 buffer = rb_entry(parent, struct binder_buffer, rb_node);
481 BUG_ON(!buffer->free);
482
483 buffer_size = binder_buffer_size(proc, buffer);
484
485 if (new_buffer_size < buffer_size)
486 p = &parent->rb_left;
487 else
488 p = &parent->rb_right;
489 }
490 rb_link_node(&new_buffer->rb_node, parent, p);
491 rb_insert_color(&new_buffer->rb_node, &proc->free_buffers);
492 }
493
494 static void binder_insert_allocated_buffer(struct binder_proc *proc,
495 struct binder_buffer *new_buffer)
496 {
497 struct rb_node **p = &proc->allocated_buffers.rb_node;
498 struct rb_node *parent = NULL;
499 struct binder_buffer *buffer;
500
501 BUG_ON(new_buffer->free);
502
503 while (*p) {
504 parent = *p;
505 buffer = rb_entry(parent, struct binder_buffer, rb_node);
506 BUG_ON(buffer->free);
507
508 if (new_buffer < buffer)
509 p = &parent->rb_left;
510 else if (new_buffer > buffer)
511 p = &parent->rb_right;
512 else
513 BUG();
514 }
515 rb_link_node(&new_buffer->rb_node, parent, p);
516 rb_insert_color(&new_buffer->rb_node, &proc->allocated_buffers);
517 }
518
519 static struct binder_buffer *binder_buffer_lookup(struct binder_proc *proc,
520 uintptr_t user_ptr)
521 {
522 struct rb_node *n = proc->allocated_buffers.rb_node;
523 struct binder_buffer *buffer;
524 struct binder_buffer *kern_ptr;
525
526 kern_ptr = (struct binder_buffer *)(user_ptr - proc->user_buffer_offset
527 - offsetof(struct binder_buffer, data));
528
529 while (n) {
530 buffer = rb_entry(n, struct binder_buffer, rb_node);
531 BUG_ON(buffer->free);
532
533 if (kern_ptr < buffer)
534 n = n->rb_left;
535 else if (kern_ptr > buffer)
536 n = n->rb_right;
537 else
538 return buffer;
539 }
540 return NULL;
541 }
542
543 static int binder_update_page_range(struct binder_proc *proc, int allocate,
544 void *start, void *end,
545 struct vm_area_struct *vma)
546 {
547 void *page_addr;
548 unsigned long user_page_addr;
549 struct vm_struct tmp_area;
550 struct page **page;
551 struct mm_struct *mm;
552
553 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
554 "%d: %s pages %p-%p\n", proc->pid,
555 allocate ? "allocate" : "free", start, end);
556
557 if (end <= start)
558 return 0;
559
560 trace_binder_update_page_range(proc, allocate, start, end);
561
562 if (vma)
563 mm = NULL;
564 else
565 mm = get_task_mm(proc->tsk);
566
567 if (mm) {
568 down_write(&mm->mmap_sem);
569 vma = proc->vma;
570 if (vma && mm != proc->vma_vm_mm) {
571 pr_err("%d: vma mm and task mm mismatch\n",
572 proc->pid);
573 vma = NULL;
574 }
575 }
576
577 if (allocate == 0)
578 goto free_range;
579
580 if (vma == NULL) {
581 pr_err("%d: binder_alloc_buf failed to map pages in userspace, no vma\n",
582 proc->pid);
583 goto err_no_vma;
584 }
585
586 for (page_addr = start; page_addr < end; page_addr += PAGE_SIZE) {
587 int ret;
588
589 page = &proc->pages[(page_addr - proc->buffer) / PAGE_SIZE];
590
591 BUG_ON(*page);
592 *page = alloc_page(GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO);
593 if (*page == NULL) {
594 pr_err("%d: binder_alloc_buf failed for page at %p\n",
595 proc->pid, page_addr);
596 goto err_alloc_page_failed;
597 }
598 tmp_area.addr = page_addr;
599 tmp_area.size = PAGE_SIZE + PAGE_SIZE /* guard page? */;
600 ret = map_vm_area(&tmp_area, PAGE_KERNEL, page);
601 if (ret) {
602 pr_err("%d: binder_alloc_buf failed to map page at %p in kernel\n",
603 proc->pid, page_addr);
604 goto err_map_kernel_failed;
605 }
606 user_page_addr =
607 (uintptr_t)page_addr + proc->user_buffer_offset;
608 ret = vm_insert_page(vma, user_page_addr, page[0]);
609 if (ret) {
610 pr_err("%d: binder_alloc_buf failed to map page at %lx in userspace\n",
611 proc->pid, user_page_addr);
612 goto err_vm_insert_page_failed;
613 }
614 /* vm_insert_page does not seem to increment the refcount */
615 }
616 if (mm) {
617 up_write(&mm->mmap_sem);
618 mmput(mm);
619 }
620 return 0;
621
622 free_range:
623 for (page_addr = end - PAGE_SIZE; page_addr >= start;
624 page_addr -= PAGE_SIZE) {
625 page = &proc->pages[(page_addr - proc->buffer) / PAGE_SIZE];
626 if (vma)
627 zap_page_range(vma, (uintptr_t)page_addr +
628 proc->user_buffer_offset, PAGE_SIZE, NULL);
629 err_vm_insert_page_failed:
630 unmap_kernel_range((unsigned long)page_addr, PAGE_SIZE);
631 err_map_kernel_failed:
632 __free_page(*page);
633 *page = NULL;
634 err_alloc_page_failed:
635 ;
636 }
637 err_no_vma:
638 if (mm) {
639 up_write(&mm->mmap_sem);
640 mmput(mm);
641 }
642 return -ENOMEM;
643 }
644
645 static struct binder_buffer *binder_alloc_buf(struct binder_proc *proc,
646 size_t data_size,
647 size_t offsets_size, int is_async)
648 {
649 struct rb_node *n = proc->free_buffers.rb_node;
650 struct binder_buffer *buffer;
651 size_t buffer_size;
652 struct rb_node *best_fit = NULL;
653 void *has_page_addr;
654 void *end_page_addr;
655 size_t size;
656
657 if (proc->vma == NULL) {
658 pr_err("%d: binder_alloc_buf, no vma\n",
659 proc->pid);
660 return NULL;
661 }
662
663 size = ALIGN(data_size, sizeof(void *)) +
664 ALIGN(offsets_size, sizeof(void *));
665
666 if (size < data_size || size < offsets_size) {
667 binder_user_error("%d: got transaction with invalid size %zd-%zd\n",
668 proc->pid, data_size, offsets_size);
669 return NULL;
670 }
671
672 if (is_async &&
673 proc->free_async_space < size + sizeof(struct binder_buffer)) {
674 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
675 "%d: binder_alloc_buf size %zd failed, no async space left\n",
676 proc->pid, size);
677 return NULL;
678 }
679
680 while (n) {
681 buffer = rb_entry(n, struct binder_buffer, rb_node);
682 BUG_ON(!buffer->free);
683 buffer_size = binder_buffer_size(proc, buffer);
684
685 if (size < buffer_size) {
686 best_fit = n;
687 n = n->rb_left;
688 } else if (size > buffer_size)
689 n = n->rb_right;
690 else {
691 best_fit = n;
692 break;
693 }
694 }
695 if (best_fit == NULL) {
696 pr_err("%d: binder_alloc_buf size %zd failed, no address space\n",
697 proc->pid, size);
698 return NULL;
699 }
700 if (n == NULL) {
701 buffer = rb_entry(best_fit, struct binder_buffer, rb_node);
702 buffer_size = binder_buffer_size(proc, buffer);
703 }
704
705 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
706 "%d: binder_alloc_buf size %zd got buffer %p size %zd\n",
707 proc->pid, size, buffer, buffer_size);
708
709 has_page_addr =
710 (void *)(((uintptr_t)buffer->data + buffer_size) & PAGE_MASK);
711 if (n == NULL) {
712 if (size + sizeof(struct binder_buffer) + 4 >= buffer_size)
713 buffer_size = size; /* no room for other buffers */
714 else
715 buffer_size = size + sizeof(struct binder_buffer);
716 }
717 end_page_addr =
718 (void *)PAGE_ALIGN((uintptr_t)buffer->data + buffer_size);
719 if (end_page_addr > has_page_addr)
720 end_page_addr = has_page_addr;
721 if (binder_update_page_range(proc, 1,
722 (void *)PAGE_ALIGN((uintptr_t)buffer->data), end_page_addr, NULL))
723 return NULL;
724
725 rb_erase(best_fit, &proc->free_buffers);
726 buffer->free = 0;
727 binder_insert_allocated_buffer(proc, buffer);
728 if (buffer_size != size) {
729 struct binder_buffer *new_buffer = (void *)buffer->data + size;
730
731 list_add(&new_buffer->entry, &buffer->entry);
732 new_buffer->free = 1;
733 binder_insert_free_buffer(proc, new_buffer);
734 }
735 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
736 "%d: binder_alloc_buf size %zd got %p\n",
737 proc->pid, size, buffer);
738 buffer->data_size = data_size;
739 buffer->offsets_size = offsets_size;
740 buffer->async_transaction = is_async;
741 if (is_async) {
742 proc->free_async_space -= size + sizeof(struct binder_buffer);
743 binder_debug(BINDER_DEBUG_BUFFER_ALLOC_ASYNC,
744 "%d: binder_alloc_buf size %zd async free %zd\n",
745 proc->pid, size, proc->free_async_space);
746 }
747
748 return buffer;
749 }
750
751 static void *buffer_start_page(struct binder_buffer *buffer)
752 {
753 return (void *)((uintptr_t)buffer & PAGE_MASK);
754 }
755
756 static void *buffer_end_page(struct binder_buffer *buffer)
757 {
758 return (void *)(((uintptr_t)(buffer + 1) - 1) & PAGE_MASK);
759 }
760
761 static void binder_delete_free_buffer(struct binder_proc *proc,
762 struct binder_buffer *buffer)
763 {
764 struct binder_buffer *prev, *next = NULL;
765 int free_page_end = 1;
766 int free_page_start = 1;
767
768 BUG_ON(proc->buffers.next == &buffer->entry);
769 prev = list_entry(buffer->entry.prev, struct binder_buffer, entry);
770 BUG_ON(!prev->free);
771 if (buffer_end_page(prev) == buffer_start_page(buffer)) {
772 free_page_start = 0;
773 if (buffer_end_page(prev) == buffer_end_page(buffer))
774 free_page_end = 0;
775 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
776 "%d: merge free, buffer %p share page with %p\n",
777 proc->pid, buffer, prev);
778 }
779
780 if (!list_is_last(&buffer->entry, &proc->buffers)) {
781 next = list_entry(buffer->entry.next,
782 struct binder_buffer, entry);
783 if (buffer_start_page(next) == buffer_end_page(buffer)) {
784 free_page_end = 0;
785 if (buffer_start_page(next) ==
786 buffer_start_page(buffer))
787 free_page_start = 0;
788 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
789 "%d: merge free, buffer %p share page with %p\n",
790 proc->pid, buffer, prev);
791 }
792 }
793 list_del(&buffer->entry);
794 if (free_page_start || free_page_end) {
795 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
796 "%d: merge free, buffer %p do not share page%s%s with %p or %p\n",
797 proc->pid, buffer, free_page_start ? "" : " end",
798 free_page_end ? "" : " start", prev, next);
799 binder_update_page_range(proc, 0, free_page_start ?
800 buffer_start_page(buffer) : buffer_end_page(buffer),
801 (free_page_end ? buffer_end_page(buffer) :
802 buffer_start_page(buffer)) + PAGE_SIZE, NULL);
803 }
804 }
805
806 static void binder_free_buf(struct binder_proc *proc,
807 struct binder_buffer *buffer)
808 {
809 size_t size, buffer_size;
810
811 buffer_size = binder_buffer_size(proc, buffer);
812
813 size = ALIGN(buffer->data_size, sizeof(void *)) +
814 ALIGN(buffer->offsets_size, sizeof(void *));
815
816 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
817 "%d: binder_free_buf %p size %zd buffer_size %zd\n",
818 proc->pid, buffer, size, buffer_size);
819
820 BUG_ON(buffer->free);
821 BUG_ON(size > buffer_size);
822 BUG_ON(buffer->transaction != NULL);
823 BUG_ON((void *)buffer < proc->buffer);
824 BUG_ON((void *)buffer > proc->buffer + proc->buffer_size);
825
826 if (buffer->async_transaction) {
827 proc->free_async_space += size + sizeof(struct binder_buffer);
828
829 binder_debug(BINDER_DEBUG_BUFFER_ALLOC_ASYNC,
830 "%d: binder_free_buf size %zd async free %zd\n",
831 proc->pid, size, proc->free_async_space);
832 }
833
834 binder_update_page_range(proc, 0,
835 (void *)PAGE_ALIGN((uintptr_t)buffer->data),
836 (void *)(((uintptr_t)buffer->data + buffer_size) & PAGE_MASK),
837 NULL);
838 rb_erase(&buffer->rb_node, &proc->allocated_buffers);
839 buffer->free = 1;
840 if (!list_is_last(&buffer->entry, &proc->buffers)) {
841 struct binder_buffer *next = list_entry(buffer->entry.next,
842 struct binder_buffer, entry);
843
844 if (next->free) {
845 rb_erase(&next->rb_node, &proc->free_buffers);
846 binder_delete_free_buffer(proc, next);
847 }
848 }
849 if (proc->buffers.next != &buffer->entry) {
850 struct binder_buffer *prev = list_entry(buffer->entry.prev,
851 struct binder_buffer, entry);
852
853 if (prev->free) {
854 binder_delete_free_buffer(proc, buffer);
855 rb_erase(&prev->rb_node, &proc->free_buffers);
856 buffer = prev;
857 }
858 }
859 binder_insert_free_buffer(proc, buffer);
860 }
861
862 static struct binder_node *binder_get_node(struct binder_proc *proc,
863 binder_uintptr_t ptr)
864 {
865 struct rb_node *n = proc->nodes.rb_node;
866 struct binder_node *node;
867
868 while (n) {
869 node = rb_entry(n, struct binder_node, rb_node);
870
871 if (ptr < node->ptr)
872 n = n->rb_left;
873 else if (ptr > node->ptr)
874 n = n->rb_right;
875 else
876 return node;
877 }
878 return NULL;
879 }
880
881 static struct binder_node *binder_new_node(struct binder_proc *proc,
882 binder_uintptr_t ptr,
883 binder_uintptr_t cookie)
884 {
885 struct rb_node **p = &proc->nodes.rb_node;
886 struct rb_node *parent = NULL;
887 struct binder_node *node;
888
889 while (*p) {
890 parent = *p;
891 node = rb_entry(parent, struct binder_node, rb_node);
892
893 if (ptr < node->ptr)
894 p = &(*p)->rb_left;
895 else if (ptr > node->ptr)
896 p = &(*p)->rb_right;
897 else
898 return NULL;
899 }
900
901 node = kzalloc(sizeof(*node), GFP_KERNEL);
902 if (node == NULL)
903 return NULL;
904 binder_stats_created(BINDER_STAT_NODE);
905 rb_link_node(&node->rb_node, parent, p);
906 rb_insert_color(&node->rb_node, &proc->nodes);
907 node->debug_id = ++binder_last_id;
908 node->proc = proc;
909 node->ptr = ptr;
910 node->cookie = cookie;
911 node->work.type = BINDER_WORK_NODE;
912 INIT_LIST_HEAD(&node->work.entry);
913 INIT_LIST_HEAD(&node->async_todo);
914 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
915 "%d:%d node %d u%016llx c%016llx created\n",
916 proc->pid, current->pid, node->debug_id,
917 (u64)node->ptr, (u64)node->cookie);
918 return node;
919 }
920
921 static int binder_inc_node(struct binder_node *node, int strong, int internal,
922 struct list_head *target_list)
923 {
924 if (strong) {
925 if (internal) {
926 if (target_list == NULL &&
927 node->internal_strong_refs == 0 &&
928 !(node == binder_context_mgr_node &&
929 node->has_strong_ref)) {
930 pr_err("invalid inc strong node for %d\n",
931 node->debug_id);
932 return -EINVAL;
933 }
934 node->internal_strong_refs++;
935 } else
936 node->local_strong_refs++;
937 if (!node->has_strong_ref && target_list) {
938 list_del_init(&node->work.entry);
939 list_add_tail(&node->work.entry, target_list);
940 }
941 } else {
942 if (!internal)
943 node->local_weak_refs++;
944 if (!node->has_weak_ref && list_empty(&node->work.entry)) {
945 if (target_list == NULL) {
946 pr_err("invalid inc weak node for %d\n",
947 node->debug_id);
948 return -EINVAL;
949 }
950 list_add_tail(&node->work.entry, target_list);
951 }
952 }
953 return 0;
954 }
955
956 static int binder_dec_node(struct binder_node *node, int strong, int internal)
957 {
958 if (strong) {
959 if (internal)
960 node->internal_strong_refs--;
961 else
962 node->local_strong_refs--;
963 if (node->local_strong_refs || node->internal_strong_refs)
964 return 0;
965 } else {
966 if (!internal)
967 node->local_weak_refs--;
968 if (node->local_weak_refs || !hlist_empty(&node->refs))
969 return 0;
970 }
971 if (node->proc && (node->has_strong_ref || node->has_weak_ref)) {
972 if (list_empty(&node->work.entry)) {
973 list_add_tail(&node->work.entry, &node->proc->todo);
974 wake_up_interruptible(&node->proc->wait);
975 }
976 } else {
977 if (hlist_empty(&node->refs) && !node->local_strong_refs &&
978 !node->local_weak_refs) {
979 list_del_init(&node->work.entry);
980 if (node->proc) {
981 rb_erase(&node->rb_node, &node->proc->nodes);
982 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
983 "refless node %d deleted\n",
984 node->debug_id);
985 } else {
986 hlist_del(&node->dead_node);
987 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
988 "dead node %d deleted\n",
989 node->debug_id);
990 }
991 kfree(node);
992 binder_stats_deleted(BINDER_STAT_NODE);
993 }
994 }
995
996 return 0;
997 }
998
999
1000 static struct binder_ref *binder_get_ref(struct binder_proc *proc,
1001 uint32_t desc)
1002 {
1003 struct rb_node *n = proc->refs_by_desc.rb_node;
1004 struct binder_ref *ref;
1005
1006 while (n) {
1007 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1008
1009 if (desc < ref->desc)
1010 n = n->rb_left;
1011 else if (desc > ref->desc)
1012 n = n->rb_right;
1013 else
1014 return ref;
1015 }
1016 return NULL;
1017 }
1018
1019 static struct binder_ref *binder_get_ref_for_node(struct binder_proc *proc,
1020 struct binder_node *node)
1021 {
1022 struct rb_node *n;
1023 struct rb_node **p = &proc->refs_by_node.rb_node;
1024 struct rb_node *parent = NULL;
1025 struct binder_ref *ref, *new_ref;
1026
1027 while (*p) {
1028 parent = *p;
1029 ref = rb_entry(parent, struct binder_ref, rb_node_node);
1030
1031 if (node < ref->node)
1032 p = &(*p)->rb_left;
1033 else if (node > ref->node)
1034 p = &(*p)->rb_right;
1035 else
1036 return ref;
1037 }
1038 new_ref = kzalloc(sizeof(*ref), GFP_KERNEL);
1039 if (new_ref == NULL)
1040 return NULL;
1041 binder_stats_created(BINDER_STAT_REF);
1042 new_ref->debug_id = ++binder_last_id;
1043 new_ref->proc = proc;
1044 new_ref->node = node;
1045 rb_link_node(&new_ref->rb_node_node, parent, p);
1046 rb_insert_color(&new_ref->rb_node_node, &proc->refs_by_node);
1047
1048 new_ref->desc = (node == binder_context_mgr_node) ? 0 : 1;
1049 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
1050 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1051 if (ref->desc > new_ref->desc)
1052 break;
1053 new_ref->desc = ref->desc + 1;
1054 }
1055
1056 p = &proc->refs_by_desc.rb_node;
1057 while (*p) {
1058 parent = *p;
1059 ref = rb_entry(parent, struct binder_ref, rb_node_desc);
1060
1061 if (new_ref->desc < ref->desc)
1062 p = &(*p)->rb_left;
1063 else if (new_ref->desc > ref->desc)
1064 p = &(*p)->rb_right;
1065 else
1066 BUG();
1067 }
1068 rb_link_node(&new_ref->rb_node_desc, parent, p);
1069 rb_insert_color(&new_ref->rb_node_desc, &proc->refs_by_desc);
1070 if (node) {
1071 hlist_add_head(&new_ref->node_entry, &node->refs);
1072
1073 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1074 "%d new ref %d desc %d for node %d\n",
1075 proc->pid, new_ref->debug_id, new_ref->desc,
1076 node->debug_id);
1077 } else {
1078 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1079 "%d new ref %d desc %d for dead node\n",
1080 proc->pid, new_ref->debug_id, new_ref->desc);
1081 }
1082 return new_ref;
1083 }
1084
1085 static void binder_delete_ref(struct binder_ref *ref)
1086 {
1087 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1088 "%d delete ref %d desc %d for node %d\n",
1089 ref->proc->pid, ref->debug_id, ref->desc,
1090 ref->node->debug_id);
1091
1092 rb_erase(&ref->rb_node_desc, &ref->proc->refs_by_desc);
1093 rb_erase(&ref->rb_node_node, &ref->proc->refs_by_node);
1094 if (ref->strong)
1095 binder_dec_node(ref->node, 1, 1);
1096 hlist_del(&ref->node_entry);
1097 binder_dec_node(ref->node, 0, 1);
1098 if (ref->death) {
1099 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1100 "%d delete ref %d desc %d has death notification\n",
1101 ref->proc->pid, ref->debug_id, ref->desc);
1102 list_del(&ref->death->work.entry);
1103 kfree(ref->death);
1104 binder_stats_deleted(BINDER_STAT_DEATH);
1105 }
1106 kfree(ref);
1107 binder_stats_deleted(BINDER_STAT_REF);
1108 }
1109
1110 static int binder_inc_ref(struct binder_ref *ref, int strong,
1111 struct list_head *target_list)
1112 {
1113 int ret;
1114
1115 if (strong) {
1116 if (ref->strong == 0) {
1117 ret = binder_inc_node(ref->node, 1, 1, target_list);
1118 if (ret)
1119 return ret;
1120 }
1121 ref->strong++;
1122 } else {
1123 if (ref->weak == 0) {
1124 ret = binder_inc_node(ref->node, 0, 1, target_list);
1125 if (ret)
1126 return ret;
1127 }
1128 ref->weak++;
1129 }
1130 return 0;
1131 }
1132
1133
1134 static int binder_dec_ref(struct binder_ref *ref, int strong)
1135 {
1136 if (strong) {
1137 if (ref->strong == 0) {
1138 binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n",
1139 ref->proc->pid, ref->debug_id,
1140 ref->desc, ref->strong, ref->weak);
1141 return -EINVAL;
1142 }
1143 ref->strong--;
1144 if (ref->strong == 0) {
1145 int ret;
1146
1147 ret = binder_dec_node(ref->node, strong, 1);
1148 if (ret)
1149 return ret;
1150 }
1151 } else {
1152 if (ref->weak == 0) {
1153 binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n",
1154 ref->proc->pid, ref->debug_id,
1155 ref->desc, ref->strong, ref->weak);
1156 return -EINVAL;
1157 }
1158 ref->weak--;
1159 }
1160 if (ref->strong == 0 && ref->weak == 0)
1161 binder_delete_ref(ref);
1162 return 0;
1163 }
1164
1165 static void binder_pop_transaction(struct binder_thread *target_thread,
1166 struct binder_transaction *t)
1167 {
1168 if (target_thread) {
1169 BUG_ON(target_thread->transaction_stack != t);
1170 BUG_ON(target_thread->transaction_stack->from != target_thread);
1171 target_thread->transaction_stack =
1172 target_thread->transaction_stack->from_parent;
1173 t->from = NULL;
1174 }
1175 t->need_reply = 0;
1176 if (t->buffer)
1177 t->buffer->transaction = NULL;
1178 kfree(t);
1179 binder_stats_deleted(BINDER_STAT_TRANSACTION);
1180 }
1181
1182 static void binder_send_failed_reply(struct binder_transaction *t,
1183 uint32_t error_code)
1184 {
1185 struct binder_thread *target_thread;
1186 struct binder_transaction *next;
1187
1188 BUG_ON(t->flags & TF_ONE_WAY);
1189 while (1) {
1190 target_thread = t->from;
1191 if (target_thread) {
1192 if (target_thread->return_error != BR_OK &&
1193 target_thread->return_error2 == BR_OK) {
1194 target_thread->return_error2 =
1195 target_thread->return_error;
1196 target_thread->return_error = BR_OK;
1197 }
1198 if (target_thread->return_error == BR_OK) {
1199 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1200 "send failed reply for transaction %d to %d:%d\n",
1201 t->debug_id, target_thread->proc->pid,
1202 target_thread->pid);
1203
1204 binder_pop_transaction(target_thread, t);
1205 target_thread->return_error = error_code;
1206 wake_up_interruptible(&target_thread->wait);
1207 } else {
1208 pr_err("reply failed, target thread, %d:%d, has error code %d already\n",
1209 target_thread->proc->pid,
1210 target_thread->pid,
1211 target_thread->return_error);
1212 }
1213 return;
1214 }
1215 next = t->from_parent;
1216
1217 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1218 "send failed reply for transaction %d, target dead\n",
1219 t->debug_id);
1220
1221 binder_pop_transaction(target_thread, t);
1222 if (next == NULL) {
1223 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1224 "reply failed, no target thread at root\n");
1225 return;
1226 }
1227 t = next;
1228 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1229 "reply failed, no target thread -- retry %d\n",
1230 t->debug_id);
1231 }
1232 }
1233
1234 static void binder_transaction_buffer_release(struct binder_proc *proc,
1235 struct binder_buffer *buffer,
1236 binder_size_t *failed_at)
1237 {
1238 binder_size_t *offp, *off_end;
1239 int debug_id = buffer->debug_id;
1240
1241 binder_debug(BINDER_DEBUG_TRANSACTION,
1242 "%d buffer release %d, size %zd-%zd, failed at %p\n",
1243 proc->pid, buffer->debug_id,
1244 buffer->data_size, buffer->offsets_size, failed_at);
1245
1246 if (buffer->target_node)
1247 binder_dec_node(buffer->target_node, 1, 0);
1248
1249 offp = (binder_size_t *)(buffer->data +
1250 ALIGN(buffer->data_size, sizeof(void *)));
1251 if (failed_at)
1252 off_end = failed_at;
1253 else
1254 off_end = (void *)offp + buffer->offsets_size;
1255 for (; offp < off_end; offp++) {
1256 struct flat_binder_object *fp;
1257
1258 if (*offp > buffer->data_size - sizeof(*fp) ||
1259 buffer->data_size < sizeof(*fp) ||
1260 !IS_ALIGNED(*offp, sizeof(u32))) {
1261 pr_err("transaction release %d bad offset %lld, size %zd\n",
1262 debug_id, (u64)*offp, buffer->data_size);
1263 continue;
1264 }
1265 fp = (struct flat_binder_object *)(buffer->data + *offp);
1266 switch (fp->type) {
1267 case BINDER_TYPE_BINDER:
1268 case BINDER_TYPE_WEAK_BINDER: {
1269 struct binder_node *node = binder_get_node(proc, fp->binder);
1270
1271 if (node == NULL) {
1272 pr_err("transaction release %d bad node %016llx\n",
1273 debug_id, (u64)fp->binder);
1274 break;
1275 }
1276 binder_debug(BINDER_DEBUG_TRANSACTION,
1277 " node %d u%016llx\n",
1278 node->debug_id, (u64)node->ptr);
1279 binder_dec_node(node, fp->type == BINDER_TYPE_BINDER, 0);
1280 } break;
1281 case BINDER_TYPE_HANDLE:
1282 case BINDER_TYPE_WEAK_HANDLE: {
1283 struct binder_ref *ref = binder_get_ref(proc, fp->handle);
1284
1285 if (ref == NULL) {
1286 pr_err("transaction release %d bad handle %d\n",
1287 debug_id, fp->handle);
1288 break;
1289 }
1290 binder_debug(BINDER_DEBUG_TRANSACTION,
1291 " ref %d desc %d (node %d)\n",
1292 ref->debug_id, ref->desc, ref->node->debug_id);
1293 binder_dec_ref(ref, fp->type == BINDER_TYPE_HANDLE);
1294 } break;
1295
1296 case BINDER_TYPE_FD:
1297 binder_debug(BINDER_DEBUG_TRANSACTION,
1298 " fd %d\n", fp->handle);
1299 if (failed_at)
1300 task_close_fd(proc, fp->handle);
1301 break;
1302
1303 default:
1304 pr_err("transaction release %d bad object type %x\n",
1305 debug_id, fp->type);
1306 break;
1307 }
1308 }
1309 }
1310
1311 static void binder_transaction(struct binder_proc *proc,
1312 struct binder_thread *thread,
1313 struct binder_transaction_data *tr, int reply)
1314 {
1315 struct binder_transaction *t;
1316 struct binder_work *tcomplete;
1317 binder_size_t *offp, *off_end;
1318 struct binder_proc *target_proc;
1319 struct binder_thread *target_thread = NULL;
1320 struct binder_node *target_node = NULL;
1321 struct list_head *target_list;
1322 wait_queue_head_t *target_wait;
1323 struct binder_transaction *in_reply_to = NULL;
1324 struct binder_transaction_log_entry *e;
1325 uint32_t return_error;
1326
1327 e = binder_transaction_log_add(&binder_transaction_log);
1328 e->call_type = reply ? 2 : !!(tr->flags & TF_ONE_WAY);
1329 e->from_proc = proc->pid;
1330 e->from_thread = thread->pid;
1331 e->target_handle = tr->target.handle;
1332 e->data_size = tr->data_size;
1333 e->offsets_size = tr->offsets_size;
1334
1335 if (reply) {
1336 in_reply_to = thread->transaction_stack;
1337 if (in_reply_to == NULL) {
1338 binder_user_error("%d:%d got reply transaction with no transaction stack\n",
1339 proc->pid, thread->pid);
1340 return_error = BR_FAILED_REPLY;
1341 goto err_empty_call_stack;
1342 }
1343 binder_set_nice(in_reply_to->saved_priority);
1344 if (in_reply_to->to_thread != thread) {
1345 binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
1346 proc->pid, thread->pid, in_reply_to->debug_id,
1347 in_reply_to->to_proc ?
1348 in_reply_to->to_proc->pid : 0,
1349 in_reply_to->to_thread ?
1350 in_reply_to->to_thread->pid : 0);
1351 return_error = BR_FAILED_REPLY;
1352 in_reply_to = NULL;
1353 goto err_bad_call_stack;
1354 }
1355 thread->transaction_stack = in_reply_to->to_parent;
1356 target_thread = in_reply_to->from;
1357 if (target_thread == NULL) {
1358 return_error = BR_DEAD_REPLY;
1359 goto err_dead_binder;
1360 }
1361 if (target_thread->transaction_stack != in_reply_to) {
1362 binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
1363 proc->pid, thread->pid,
1364 target_thread->transaction_stack ?
1365 target_thread->transaction_stack->debug_id : 0,
1366 in_reply_to->debug_id);
1367 return_error = BR_FAILED_REPLY;
1368 in_reply_to = NULL;
1369 target_thread = NULL;
1370 goto err_dead_binder;
1371 }
1372 target_proc = target_thread->proc;
1373 } else {
1374 if (tr->target.handle) {
1375 struct binder_ref *ref;
1376
1377 ref = binder_get_ref(proc, tr->target.handle);
1378 if (ref == NULL) {
1379 binder_user_error("%d:%d got transaction to invalid handle\n",
1380 proc->pid, thread->pid);
1381 return_error = BR_FAILED_REPLY;
1382 goto err_invalid_target_handle;
1383 }
1384 target_node = ref->node;
1385 } else {
1386 target_node = binder_context_mgr_node;
1387 if (target_node == NULL) {
1388 return_error = BR_DEAD_REPLY;
1389 goto err_no_context_mgr_node;
1390 }
1391 }
1392 e->to_node = target_node->debug_id;
1393 target_proc = target_node->proc;
1394 if (target_proc == NULL) {
1395 return_error = BR_DEAD_REPLY;
1396 goto err_dead_binder;
1397 }
1398 if (!(tr->flags & TF_ONE_WAY) && thread->transaction_stack) {
1399 struct binder_transaction *tmp;
1400
1401 tmp = thread->transaction_stack;
1402 if (tmp->to_thread != thread) {
1403 binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
1404 proc->pid, thread->pid, tmp->debug_id,
1405 tmp->to_proc ? tmp->to_proc->pid : 0,
1406 tmp->to_thread ?
1407 tmp->to_thread->pid : 0);
1408 return_error = BR_FAILED_REPLY;
1409 goto err_bad_call_stack;
1410 }
1411 while (tmp) {
1412 if (tmp->from && tmp->from->proc == target_proc)
1413 target_thread = tmp->from;
1414 tmp = tmp->from_parent;
1415 }
1416 }
1417 }
1418 if (target_thread) {
1419 e->to_thread = target_thread->pid;
1420 target_list = &target_thread->todo;
1421 target_wait = &target_thread->wait;
1422 } else {
1423 target_list = &target_proc->todo;
1424 target_wait = &target_proc->wait;
1425 }
1426 e->to_proc = target_proc->pid;
1427
1428 /* TODO: reuse incoming transaction for reply */
1429 t = kzalloc(sizeof(*t), GFP_KERNEL);
1430 if (t == NULL) {
1431 return_error = BR_FAILED_REPLY;
1432 goto err_alloc_t_failed;
1433 }
1434 binder_stats_created(BINDER_STAT_TRANSACTION);
1435
1436 tcomplete = kzalloc(sizeof(*tcomplete), GFP_KERNEL);
1437 if (tcomplete == NULL) {
1438 return_error = BR_FAILED_REPLY;
1439 goto err_alloc_tcomplete_failed;
1440 }
1441 binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE);
1442
1443 t->debug_id = ++binder_last_id;
1444 e->debug_id = t->debug_id;
1445
1446 if (reply)
1447 binder_debug(BINDER_DEBUG_TRANSACTION,
1448 "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld\n",
1449 proc->pid, thread->pid, t->debug_id,
1450 target_proc->pid, target_thread->pid,
1451 (u64)tr->data.ptr.buffer,
1452 (u64)tr->data.ptr.offsets,
1453 (u64)tr->data_size, (u64)tr->offsets_size);
1454 else
1455 binder_debug(BINDER_DEBUG_TRANSACTION,
1456 "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld\n",
1457 proc->pid, thread->pid, t->debug_id,
1458 target_proc->pid, target_node->debug_id,
1459 (u64)tr->data.ptr.buffer,
1460 (u64)tr->data.ptr.offsets,
1461 (u64)tr->data_size, (u64)tr->offsets_size);
1462
1463 if (!reply && !(tr->flags & TF_ONE_WAY))
1464 t->from = thread;
1465 else
1466 t->from = NULL;
1467 t->sender_euid = task_euid(proc->tsk);
1468 t->to_proc = target_proc;
1469 t->to_thread = target_thread;
1470 t->code = tr->code;
1471 t->flags = tr->flags;
1472 t->priority = task_nice(current);
1473
1474 trace_binder_transaction(reply, t, target_node);
1475
1476 t->buffer = binder_alloc_buf(target_proc, tr->data_size,
1477 tr->offsets_size, !reply && (t->flags & TF_ONE_WAY));
1478 if (t->buffer == NULL) {
1479 return_error = BR_FAILED_REPLY;
1480 goto err_binder_alloc_buf_failed;
1481 }
1482 t->buffer->allow_user_free = 0;
1483 t->buffer->debug_id = t->debug_id;
1484 t->buffer->transaction = t;
1485 t->buffer->target_node = target_node;
1486 trace_binder_transaction_alloc_buf(t->buffer);
1487 if (target_node)
1488 binder_inc_node(target_node, 1, 0, NULL);
1489
1490 offp = (binder_size_t *)(t->buffer->data +
1491 ALIGN(tr->data_size, sizeof(void *)));
1492
1493 if (copy_from_user(t->buffer->data, (const void __user *)(uintptr_t)
1494 tr->data.ptr.buffer, tr->data_size)) {
1495 binder_user_error("%d:%d got transaction with invalid data ptr\n",
1496 proc->pid, thread->pid);
1497 return_error = BR_FAILED_REPLY;
1498 goto err_copy_data_failed;
1499 }
1500 if (copy_from_user(offp, (const void __user *)(uintptr_t)
1501 tr->data.ptr.offsets, tr->offsets_size)) {
1502 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
1503 proc->pid, thread->pid);
1504 return_error = BR_FAILED_REPLY;
1505 goto err_copy_data_failed;
1506 }
1507 if (!IS_ALIGNED(tr->offsets_size, sizeof(binder_size_t))) {
1508 binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
1509 proc->pid, thread->pid, (u64)tr->offsets_size);
1510 return_error = BR_FAILED_REPLY;
1511 goto err_bad_offset;
1512 }
1513 off_end = (void *)offp + tr->offsets_size;
1514 for (; offp < off_end; offp++) {
1515 struct flat_binder_object *fp;
1516
1517 if (*offp > t->buffer->data_size - sizeof(*fp) ||
1518 t->buffer->data_size < sizeof(*fp) ||
1519 !IS_ALIGNED(*offp, sizeof(u32))) {
1520 binder_user_error("%d:%d got transaction with invalid offset, %lld\n",
1521 proc->pid, thread->pid, (u64)*offp);
1522 return_error = BR_FAILED_REPLY;
1523 goto err_bad_offset;
1524 }
1525 fp = (struct flat_binder_object *)(t->buffer->data + *offp);
1526 switch (fp->type) {
1527 case BINDER_TYPE_BINDER:
1528 case BINDER_TYPE_WEAK_BINDER: {
1529 struct binder_ref *ref;
1530 struct binder_node *node = binder_get_node(proc, fp->binder);
1531
1532 if (node == NULL) {
1533 node = binder_new_node(proc, fp->binder, fp->cookie);
1534 if (node == NULL) {
1535 return_error = BR_FAILED_REPLY;
1536 goto err_binder_new_node_failed;
1537 }
1538 node->min_priority = fp->flags & FLAT_BINDER_FLAG_PRIORITY_MASK;
1539 node->accept_fds = !!(fp->flags & FLAT_BINDER_FLAG_ACCEPTS_FDS);
1540 }
1541 if (fp->cookie != node->cookie) {
1542 binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
1543 proc->pid, thread->pid,
1544 (u64)fp->binder, node->debug_id,
1545 (u64)fp->cookie, (u64)node->cookie);
1546 return_error = BR_FAILED_REPLY;
1547 goto err_binder_get_ref_for_node_failed;
1548 }
1549 ref = binder_get_ref_for_node(target_proc, node);
1550 if (ref == NULL) {
1551 return_error = BR_FAILED_REPLY;
1552 goto err_binder_get_ref_for_node_failed;
1553 }
1554 if (fp->type == BINDER_TYPE_BINDER)
1555 fp->type = BINDER_TYPE_HANDLE;
1556 else
1557 fp->type = BINDER_TYPE_WEAK_HANDLE;
1558 fp->handle = ref->desc;
1559 binder_inc_ref(ref, fp->type == BINDER_TYPE_HANDLE,
1560 &thread->todo);
1561
1562 trace_binder_transaction_node_to_ref(t, node, ref);
1563 binder_debug(BINDER_DEBUG_TRANSACTION,
1564 " node %d u%016llx -> ref %d desc %d\n",
1565 node->debug_id, (u64)node->ptr,
1566 ref->debug_id, ref->desc);
1567 } break;
1568 case BINDER_TYPE_HANDLE:
1569 case BINDER_TYPE_WEAK_HANDLE: {
1570 struct binder_ref *ref = binder_get_ref(proc, fp->handle);
1571
1572 if (ref == NULL) {
1573 binder_user_error("%d:%d got transaction with invalid handle, %d\n",
1574 proc->pid,
1575 thread->pid, fp->handle);
1576 return_error = BR_FAILED_REPLY;
1577 goto err_binder_get_ref_failed;
1578 }
1579 if (ref->node->proc == target_proc) {
1580 if (fp->type == BINDER_TYPE_HANDLE)
1581 fp->type = BINDER_TYPE_BINDER;
1582 else
1583 fp->type = BINDER_TYPE_WEAK_BINDER;
1584 fp->binder = ref->node->ptr;
1585 fp->cookie = ref->node->cookie;
1586 binder_inc_node(ref->node, fp->type == BINDER_TYPE_BINDER, 0, NULL);
1587 trace_binder_transaction_ref_to_node(t, ref);
1588 binder_debug(BINDER_DEBUG_TRANSACTION,
1589 " ref %d desc %d -> node %d u%016llx\n",
1590 ref->debug_id, ref->desc, ref->node->debug_id,
1591 (u64)ref->node->ptr);
1592 } else {
1593 struct binder_ref *new_ref;
1594
1595 new_ref = binder_get_ref_for_node(target_proc, ref->node);
1596 if (new_ref == NULL) {
1597 return_error = BR_FAILED_REPLY;
1598 goto err_binder_get_ref_for_node_failed;
1599 }
1600 fp->handle = new_ref->desc;
1601 binder_inc_ref(new_ref, fp->type == BINDER_TYPE_HANDLE, NULL);
1602 trace_binder_transaction_ref_to_ref(t, ref,
1603 new_ref);
1604 binder_debug(BINDER_DEBUG_TRANSACTION,
1605 " ref %d desc %d -> ref %d desc %d (node %d)\n",
1606 ref->debug_id, ref->desc, new_ref->debug_id,
1607 new_ref->desc, ref->node->debug_id);
1608 }
1609 } break;
1610
1611 case BINDER_TYPE_FD: {
1612 int target_fd;
1613 struct file *file;
1614
1615 if (reply) {
1616 if (!(in_reply_to->flags & TF_ACCEPT_FDS)) {
1617 binder_user_error("%d:%d got reply with fd, %d, but target does not allow fds\n",
1618 proc->pid, thread->pid, fp->handle);
1619 return_error = BR_FAILED_REPLY;
1620 goto err_fd_not_allowed;
1621 }
1622 } else if (!target_node->accept_fds) {
1623 binder_user_error("%d:%d got transaction with fd, %d, but target does not allow fds\n",
1624 proc->pid, thread->pid, fp->handle);
1625 return_error = BR_FAILED_REPLY;
1626 goto err_fd_not_allowed;
1627 }
1628
1629 file = fget(fp->handle);
1630 if (file == NULL) {
1631 binder_user_error("%d:%d got transaction with invalid fd, %d\n",
1632 proc->pid, thread->pid, fp->handle);
1633 return_error = BR_FAILED_REPLY;
1634 goto err_fget_failed;
1635 }
1636 target_fd = task_get_unused_fd_flags(target_proc, O_CLOEXEC);
1637 if (target_fd < 0) {
1638 fput(file);
1639 return_error = BR_FAILED_REPLY;
1640 goto err_get_unused_fd_failed;
1641 }
1642 task_fd_install(target_proc, target_fd, file);
1643 trace_binder_transaction_fd(t, fp->handle, target_fd);
1644 binder_debug(BINDER_DEBUG_TRANSACTION,
1645 " fd %d -> %d\n", fp->handle, target_fd);
1646 /* TODO: fput? */
1647 fp->handle = target_fd;
1648 } break;
1649
1650 default:
1651 binder_user_error("%d:%d got transaction with invalid object type, %x\n",
1652 proc->pid, thread->pid, fp->type);
1653 return_error = BR_FAILED_REPLY;
1654 goto err_bad_object_type;
1655 }
1656 }
1657 if (reply) {
1658 BUG_ON(t->buffer->async_transaction != 0);
1659 binder_pop_transaction(target_thread, in_reply_to);
1660 } else if (!(t->flags & TF_ONE_WAY)) {
1661 BUG_ON(t->buffer->async_transaction != 0);
1662 t->need_reply = 1;
1663 t->from_parent = thread->transaction_stack;
1664 thread->transaction_stack = t;
1665 } else {
1666 BUG_ON(target_node == NULL);
1667 BUG_ON(t->buffer->async_transaction != 1);
1668 if (target_node->has_async_transaction) {
1669 target_list = &target_node->async_todo;
1670 target_wait = NULL;
1671 } else
1672 target_node->has_async_transaction = 1;
1673 }
1674 t->work.type = BINDER_WORK_TRANSACTION;
1675 list_add_tail(&t->work.entry, target_list);
1676 tcomplete->type = BINDER_WORK_TRANSACTION_COMPLETE;
1677 list_add_tail(&tcomplete->entry, &thread->todo);
1678 if (target_wait)
1679 wake_up_interruptible(target_wait);
1680 return;
1681
1682 err_get_unused_fd_failed:
1683 err_fget_failed:
1684 err_fd_not_allowed:
1685 err_binder_get_ref_for_node_failed:
1686 err_binder_get_ref_failed:
1687 err_binder_new_node_failed:
1688 err_bad_object_type:
1689 err_bad_offset:
1690 err_copy_data_failed:
1691 trace_binder_transaction_failed_buffer_release(t->buffer);
1692 binder_transaction_buffer_release(target_proc, t->buffer, offp);
1693 t->buffer->transaction = NULL;
1694 binder_free_buf(target_proc, t->buffer);
1695 err_binder_alloc_buf_failed:
1696 kfree(tcomplete);
1697 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
1698 err_alloc_tcomplete_failed:
1699 kfree(t);
1700 binder_stats_deleted(BINDER_STAT_TRANSACTION);
1701 err_alloc_t_failed:
1702 err_bad_call_stack:
1703 err_empty_call_stack:
1704 err_dead_binder:
1705 err_invalid_target_handle:
1706 err_no_context_mgr_node:
1707 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1708 "%d:%d transaction failed %d, size %lld-%lld\n",
1709 proc->pid, thread->pid, return_error,
1710 (u64)tr->data_size, (u64)tr->offsets_size);
1711
1712 {
1713 struct binder_transaction_log_entry *fe;
1714
1715 fe = binder_transaction_log_add(&binder_transaction_log_failed);
1716 *fe = *e;
1717 }
1718
1719 BUG_ON(thread->return_error != BR_OK);
1720 if (in_reply_to) {
1721 thread->return_error = BR_TRANSACTION_COMPLETE;
1722 binder_send_failed_reply(in_reply_to, return_error);
1723 } else
1724 thread->return_error = return_error;
1725 }
1726
1727 static int binder_thread_write(struct binder_proc *proc,
1728 struct binder_thread *thread,
1729 binder_uintptr_t binder_buffer, size_t size,
1730 binder_size_t *consumed)
1731 {
1732 uint32_t cmd;
1733 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
1734 void __user *ptr = buffer + *consumed;
1735 void __user *end = buffer + size;
1736
1737 while (ptr < end && thread->return_error == BR_OK) {
1738 if (get_user(cmd, (uint32_t __user *)ptr))
1739 return -EFAULT;
1740 ptr += sizeof(uint32_t);
1741 trace_binder_command(cmd);
1742 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.bc)) {
1743 binder_stats.bc[_IOC_NR(cmd)]++;
1744 proc->stats.bc[_IOC_NR(cmd)]++;
1745 thread->stats.bc[_IOC_NR(cmd)]++;
1746 }
1747 switch (cmd) {
1748 case BC_INCREFS:
1749 case BC_ACQUIRE:
1750 case BC_RELEASE:
1751 case BC_DECREFS: {
1752 uint32_t target;
1753 struct binder_ref *ref;
1754 const char *debug_string;
1755
1756 if (get_user(target, (uint32_t __user *)ptr))
1757 return -EFAULT;
1758 ptr += sizeof(uint32_t);
1759 if (target == 0 && binder_context_mgr_node &&
1760 (cmd == BC_INCREFS || cmd == BC_ACQUIRE)) {
1761 ref = binder_get_ref_for_node(proc,
1762 binder_context_mgr_node);
1763 if (ref->desc != target) {
1764 binder_user_error("%d:%d tried to acquire reference to desc 0, got %d instead\n",
1765 proc->pid, thread->pid,
1766 ref->desc);
1767 }
1768 } else
1769 ref = binder_get_ref(proc, target);
1770 if (ref == NULL) {
1771 binder_user_error("%d:%d refcount change on invalid ref %d\n",
1772 proc->pid, thread->pid, target);
1773 break;
1774 }
1775 switch (cmd) {
1776 case BC_INCREFS:
1777 debug_string = "IncRefs";
1778 binder_inc_ref(ref, 0, NULL);
1779 break;
1780 case BC_ACQUIRE:
1781 debug_string = "Acquire";
1782 binder_inc_ref(ref, 1, NULL);
1783 break;
1784 case BC_RELEASE:
1785 debug_string = "Release";
1786 binder_dec_ref(ref, 1);
1787 break;
1788 case BC_DECREFS:
1789 default:
1790 debug_string = "DecRefs";
1791 binder_dec_ref(ref, 0);
1792 break;
1793 }
1794 binder_debug(BINDER_DEBUG_USER_REFS,
1795 "%d:%d %s ref %d desc %d s %d w %d for node %d\n",
1796 proc->pid, thread->pid, debug_string, ref->debug_id,
1797 ref->desc, ref->strong, ref->weak, ref->node->debug_id);
1798 break;
1799 }
1800 case BC_INCREFS_DONE:
1801 case BC_ACQUIRE_DONE: {
1802 binder_uintptr_t node_ptr;
1803 binder_uintptr_t cookie;
1804 struct binder_node *node;
1805
1806 if (get_user(node_ptr, (binder_uintptr_t __user *)ptr))
1807 return -EFAULT;
1808 ptr += sizeof(binder_uintptr_t);
1809 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
1810 return -EFAULT;
1811 ptr += sizeof(binder_uintptr_t);
1812 node = binder_get_node(proc, node_ptr);
1813 if (node == NULL) {
1814 binder_user_error("%d:%d %s u%016llx no match\n",
1815 proc->pid, thread->pid,
1816 cmd == BC_INCREFS_DONE ?
1817 "BC_INCREFS_DONE" :
1818 "BC_ACQUIRE_DONE",
1819 (u64)node_ptr);
1820 break;
1821 }
1822 if (cookie != node->cookie) {
1823 binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
1824 proc->pid, thread->pid,
1825 cmd == BC_INCREFS_DONE ?
1826 "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
1827 (u64)node_ptr, node->debug_id,
1828 (u64)cookie, (u64)node->cookie);
1829 break;
1830 }
1831 if (cmd == BC_ACQUIRE_DONE) {
1832 if (node->pending_strong_ref == 0) {
1833 binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
1834 proc->pid, thread->pid,
1835 node->debug_id);
1836 break;
1837 }
1838 node->pending_strong_ref = 0;
1839 } else {
1840 if (node->pending_weak_ref == 0) {
1841 binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
1842 proc->pid, thread->pid,
1843 node->debug_id);
1844 break;
1845 }
1846 node->pending_weak_ref = 0;
1847 }
1848 binder_dec_node(node, cmd == BC_ACQUIRE_DONE, 0);
1849 binder_debug(BINDER_DEBUG_USER_REFS,
1850 "%d:%d %s node %d ls %d lw %d\n",
1851 proc->pid, thread->pid,
1852 cmd == BC_INCREFS_DONE ? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
1853 node->debug_id, node->local_strong_refs, node->local_weak_refs);
1854 break;
1855 }
1856 case BC_ATTEMPT_ACQUIRE:
1857 pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
1858 return -EINVAL;
1859 case BC_ACQUIRE_RESULT:
1860 pr_err("BC_ACQUIRE_RESULT not supported\n");
1861 return -EINVAL;
1862
1863 case BC_FREE_BUFFER: {
1864 binder_uintptr_t data_ptr;
1865 struct binder_buffer *buffer;
1866
1867 if (get_user(data_ptr, (binder_uintptr_t __user *)ptr))
1868 return -EFAULT;
1869 ptr += sizeof(binder_uintptr_t);
1870
1871 buffer = binder_buffer_lookup(proc, data_ptr);
1872 if (buffer == NULL) {
1873 binder_user_error("%d:%d BC_FREE_BUFFER u%016llx no match\n",
1874 proc->pid, thread->pid, (u64)data_ptr);
1875 break;
1876 }
1877 if (!buffer->allow_user_free) {
1878 binder_user_error("%d:%d BC_FREE_BUFFER u%016llx matched unreturned buffer\n",
1879 proc->pid, thread->pid, (u64)data_ptr);
1880 break;
1881 }
1882 binder_debug(BINDER_DEBUG_FREE_BUFFER,
1883 "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
1884 proc->pid, thread->pid, (u64)data_ptr,
1885 buffer->debug_id,
1886 buffer->transaction ? "active" : "finished");
1887
1888 if (buffer->transaction) {
1889 buffer->transaction->buffer = NULL;
1890 buffer->transaction = NULL;
1891 }
1892 if (buffer->async_transaction && buffer->target_node) {
1893 BUG_ON(!buffer->target_node->has_async_transaction);
1894 if (list_empty(&buffer->target_node->async_todo))
1895 buffer->target_node->has_async_transaction = 0;
1896 else
1897 list_move_tail(buffer->target_node->async_todo.next, &thread->todo);
1898 }
1899 trace_binder_transaction_buffer_release(buffer);
1900 binder_transaction_buffer_release(proc, buffer, NULL);
1901 binder_free_buf(proc, buffer);
1902 break;
1903 }
1904
1905 case BC_TRANSACTION:
1906 case BC_REPLY: {
1907 struct binder_transaction_data tr;
1908
1909 if (copy_from_user(&tr, ptr, sizeof(tr)))
1910 return -EFAULT;
1911 ptr += sizeof(tr);
1912 binder_transaction(proc, thread, &tr, cmd == BC_REPLY);
1913 break;
1914 }
1915
1916 case BC_REGISTER_LOOPER:
1917 binder_debug(BINDER_DEBUG_THREADS,
1918 "%d:%d BC_REGISTER_LOOPER\n",
1919 proc->pid, thread->pid);
1920 if (thread->looper & BINDER_LOOPER_STATE_ENTERED) {
1921 thread->looper |= BINDER_LOOPER_STATE_INVALID;
1922 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
1923 proc->pid, thread->pid);
1924 } else if (proc->requested_threads == 0) {
1925 thread->looper |= BINDER_LOOPER_STATE_INVALID;
1926 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
1927 proc->pid, thread->pid);
1928 } else {
1929 proc->requested_threads--;
1930 proc->requested_threads_started++;
1931 }
1932 thread->looper |= BINDER_LOOPER_STATE_REGISTERED;
1933 break;
1934 case BC_ENTER_LOOPER:
1935 binder_debug(BINDER_DEBUG_THREADS,
1936 "%d:%d BC_ENTER_LOOPER\n",
1937 proc->pid, thread->pid);
1938 if (thread->looper & BINDER_LOOPER_STATE_REGISTERED) {
1939 thread->looper |= BINDER_LOOPER_STATE_INVALID;
1940 binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
1941 proc->pid, thread->pid);
1942 }
1943 thread->looper |= BINDER_LOOPER_STATE_ENTERED;
1944 break;
1945 case BC_EXIT_LOOPER:
1946 binder_debug(BINDER_DEBUG_THREADS,
1947 "%d:%d BC_EXIT_LOOPER\n",
1948 proc->pid, thread->pid);
1949 thread->looper |= BINDER_LOOPER_STATE_EXITED;
1950 break;
1951
1952 case BC_REQUEST_DEATH_NOTIFICATION:
1953 case BC_CLEAR_DEATH_NOTIFICATION: {
1954 uint32_t target;
1955 binder_uintptr_t cookie;
1956 struct binder_ref *ref;
1957 struct binder_ref_death *death;
1958
1959 if (get_user(target, (uint32_t __user *)ptr))
1960 return -EFAULT;
1961 ptr += sizeof(uint32_t);
1962 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
1963 return -EFAULT;
1964 ptr += sizeof(binder_uintptr_t);
1965 ref = binder_get_ref(proc, target);
1966 if (ref == NULL) {
1967 binder_user_error("%d:%d %s invalid ref %d\n",
1968 proc->pid, thread->pid,
1969 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
1970 "BC_REQUEST_DEATH_NOTIFICATION" :
1971 "BC_CLEAR_DEATH_NOTIFICATION",
1972 target);
1973 break;
1974 }
1975
1976 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
1977 "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
1978 proc->pid, thread->pid,
1979 cmd == BC_REQUEST_DEATH_NOTIFICATION ?
1980 "BC_REQUEST_DEATH_NOTIFICATION" :
1981 "BC_CLEAR_DEATH_NOTIFICATION",
1982 (u64)cookie, ref->debug_id, ref->desc,
1983 ref->strong, ref->weak, ref->node->debug_id);
1984
1985 if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
1986 if (ref->death) {
1987 binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
1988 proc->pid, thread->pid);
1989 break;
1990 }
1991 death = kzalloc(sizeof(*death), GFP_KERNEL);
1992 if (death == NULL) {
1993 thread->return_error = BR_ERROR;
1994 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1995 "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
1996 proc->pid, thread->pid);
1997 break;
1998 }
1999 binder_stats_created(BINDER_STAT_DEATH);
2000 INIT_LIST_HEAD(&death->work.entry);
2001 death->cookie = cookie;
2002 ref->death = death;
2003 if (ref->node->proc == NULL) {
2004 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
2005 if (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | BINDER_LOOPER_STATE_ENTERED)) {
2006 list_add_tail(&ref->death->work.entry, &thread->todo);
2007 } else {
2008 list_add_tail(&ref->death->work.entry, &proc->todo);
2009 wake_up_interruptible(&proc->wait);
2010 }
2011 }
2012 } else {
2013 if (ref->death == NULL) {
2014 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
2015 proc->pid, thread->pid);
2016 break;
2017 }
2018 death = ref->death;
2019 if (death->cookie != cookie) {
2020 binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
2021 proc->pid, thread->pid,
2022 (u64)death->cookie,
2023 (u64)cookie);
2024 break;
2025 }
2026 ref->death = NULL;
2027 if (list_empty(&death->work.entry)) {
2028 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
2029 if (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | BINDER_LOOPER_STATE_ENTERED)) {
2030 list_add_tail(&death->work.entry, &thread->todo);
2031 } else {
2032 list_add_tail(&death->work.entry, &proc->todo);
2033 wake_up_interruptible(&proc->wait);
2034 }
2035 } else {
2036 BUG_ON(death->work.type != BINDER_WORK_DEAD_BINDER);
2037 death->work.type = BINDER_WORK_DEAD_BINDER_AND_CLEAR;
2038 }
2039 }
2040 } break;
2041 case BC_DEAD_BINDER_DONE: {
2042 struct binder_work *w;
2043 binder_uintptr_t cookie;
2044 struct binder_ref_death *death = NULL;
2045
2046 if (get_user(cookie, (binder_uintptr_t __user *)ptr))
2047 return -EFAULT;
2048
2049 ptr += sizeof(void *);
2050 list_for_each_entry(w, &proc->delivered_death, entry) {
2051 struct binder_ref_death *tmp_death = container_of(w, struct binder_ref_death, work);
2052
2053 if (tmp_death->cookie == cookie) {
2054 death = tmp_death;
2055 break;
2056 }
2057 }
2058 binder_debug(BINDER_DEBUG_DEAD_BINDER,
2059 "%d:%d BC_DEAD_BINDER_DONE %016llx found %p\n",
2060 proc->pid, thread->pid, (u64)cookie,
2061 death);
2062 if (death == NULL) {
2063 binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
2064 proc->pid, thread->pid, (u64)cookie);
2065 break;
2066 }
2067
2068 list_del_init(&death->work.entry);
2069 if (death->work.type == BINDER_WORK_DEAD_BINDER_AND_CLEAR) {
2070 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
2071 if (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | BINDER_LOOPER_STATE_ENTERED)) {
2072 list_add_tail(&death->work.entry, &thread->todo);
2073 } else {
2074 list_add_tail(&death->work.entry, &proc->todo);
2075 wake_up_interruptible(&proc->wait);
2076 }
2077 }
2078 } break;
2079
2080 default:
2081 pr_err("%d:%d unknown command %d\n",
2082 proc->pid, thread->pid, cmd);
2083 return -EINVAL;
2084 }
2085 *consumed = ptr - buffer;
2086 }
2087 return 0;
2088 }
2089
2090 static void binder_stat_br(struct binder_proc *proc,
2091 struct binder_thread *thread, uint32_t cmd)
2092 {
2093 trace_binder_return(cmd);
2094 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.br)) {
2095 binder_stats.br[_IOC_NR(cmd)]++;
2096 proc->stats.br[_IOC_NR(cmd)]++;
2097 thread->stats.br[_IOC_NR(cmd)]++;
2098 }
2099 }
2100
2101 static int binder_has_proc_work(struct binder_proc *proc,
2102 struct binder_thread *thread)
2103 {
2104 return !list_empty(&proc->todo) ||
2105 (thread->looper & BINDER_LOOPER_STATE_NEED_RETURN);
2106 }
2107
2108 static int binder_has_thread_work(struct binder_thread *thread)
2109 {
2110 return !list_empty(&thread->todo) || thread->return_error != BR_OK ||
2111 (thread->looper & BINDER_LOOPER_STATE_NEED_RETURN);
2112 }
2113
2114 static int binder_thread_read(struct binder_proc *proc,
2115 struct binder_thread *thread,
2116 binder_uintptr_t binder_buffer, size_t size,
2117 binder_size_t *consumed, int non_block)
2118 {
2119 void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
2120 void __user *ptr = buffer + *consumed;
2121 void __user *end = buffer + size;
2122
2123 int ret = 0;
2124 int wait_for_proc_work;
2125
2126 if (*consumed == 0) {
2127 if (put_user(BR_NOOP, (uint32_t __user *)ptr))
2128 return -EFAULT;
2129 ptr += sizeof(uint32_t);
2130 }
2131
2132 retry:
2133 wait_for_proc_work = thread->transaction_stack == NULL &&
2134 list_empty(&thread->todo);
2135
2136 if (thread->return_error != BR_OK && ptr < end) {
2137 if (thread->return_error2 != BR_OK) {
2138 if (put_user(thread->return_error2, (uint32_t __user *)ptr))
2139 return -EFAULT;
2140 ptr += sizeof(uint32_t);
2141 binder_stat_br(proc, thread, thread->return_error2);
2142 if (ptr == end)
2143 goto done;
2144 thread->return_error2 = BR_OK;
2145 }
2146 if (put_user(thread->return_error, (uint32_t __user *)ptr))
2147 return -EFAULT;
2148 ptr += sizeof(uint32_t);
2149 binder_stat_br(proc, thread, thread->return_error);
2150 thread->return_error = BR_OK;
2151 goto done;
2152 }
2153
2154
2155 thread->looper |= BINDER_LOOPER_STATE_WAITING;
2156 if (wait_for_proc_work)
2157 proc->ready_threads++;
2158
2159 binder_unlock(__func__);
2160
2161 trace_binder_wait_for_work(wait_for_proc_work,
2162 !!thread->transaction_stack,
2163 !list_empty(&thread->todo));
2164 if (wait_for_proc_work) {
2165 if (!(thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
2166 BINDER_LOOPER_STATE_ENTERED))) {
2167 binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
2168 proc->pid, thread->pid, thread->looper);
2169 wait_event_interruptible(binder_user_error_wait,
2170 binder_stop_on_user_error < 2);
2171 }
2172 binder_set_nice(proc->default_priority);
2173 if (non_block) {
2174 if (!binder_has_proc_work(proc, thread))
2175 ret = -EAGAIN;
2176 } else
2177 ret = wait_event_freezable_exclusive(proc->wait, binder_has_proc_work(proc, thread));
2178 } else {
2179 if (non_block) {
2180 if (!binder_has_thread_work(thread))
2181 ret = -EAGAIN;
2182 } else
2183 ret = wait_event_freezable(thread->wait, binder_has_thread_work(thread));
2184 }
2185
2186 binder_lock(__func__);
2187
2188 if (wait_for_proc_work)
2189 proc->ready_threads--;
2190 thread->looper &= ~BINDER_LOOPER_STATE_WAITING;
2191
2192 if (ret)
2193 return ret;
2194
2195 while (1) {
2196 uint32_t cmd;
2197 struct binder_transaction_data tr;
2198 struct binder_work *w;
2199 struct binder_transaction *t = NULL;
2200
2201 if (!list_empty(&thread->todo))
2202 w = list_first_entry(&thread->todo, struct binder_work, entry);
2203 else if (!list_empty(&proc->todo) && wait_for_proc_work)
2204 w = list_first_entry(&proc->todo, struct binder_work, entry);
2205 else {
2206 if (ptr - buffer == 4 && !(thread->looper & BINDER_LOOPER_STATE_NEED_RETURN)) /* no data added */
2207 goto retry;
2208 break;
2209 }
2210
2211 if (end - ptr < sizeof(tr) + 4)
2212 break;
2213
2214 switch (w->type) {
2215 case BINDER_WORK_TRANSACTION: {
2216 t = container_of(w, struct binder_transaction, work);
2217 } break;
2218 case BINDER_WORK_TRANSACTION_COMPLETE: {
2219 cmd = BR_TRANSACTION_COMPLETE;
2220 if (put_user(cmd, (uint32_t __user *)ptr))
2221 return -EFAULT;
2222 ptr += sizeof(uint32_t);
2223
2224 binder_stat_br(proc, thread, cmd);
2225 binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE,
2226 "%d:%d BR_TRANSACTION_COMPLETE\n",
2227 proc->pid, thread->pid);
2228
2229 list_del(&w->entry);
2230 kfree(w);
2231 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
2232 } break;
2233 case BINDER_WORK_NODE: {
2234 struct binder_node *node = container_of(w, struct binder_node, work);
2235 uint32_t cmd = BR_NOOP;
2236 const char *cmd_name;
2237 int strong = node->internal_strong_refs || node->local_strong_refs;
2238 int weak = !hlist_empty(&node->refs) || node->local_weak_refs || strong;
2239
2240 if (weak && !node->has_weak_ref) {
2241 cmd = BR_INCREFS;
2242 cmd_name = "BR_INCREFS";
2243 node->has_weak_ref = 1;
2244 node->pending_weak_ref = 1;
2245 node->local_weak_refs++;
2246 } else if (strong && !node->has_strong_ref) {
2247 cmd = BR_ACQUIRE;
2248 cmd_name = "BR_ACQUIRE";
2249 node->has_strong_ref = 1;
2250 node->pending_strong_ref = 1;
2251 node->local_strong_refs++;
2252 } else if (!strong && node->has_strong_ref) {
2253 cmd = BR_RELEASE;
2254 cmd_name = "BR_RELEASE";
2255 node->has_strong_ref = 0;
2256 } else if (!weak && node->has_weak_ref) {
2257 cmd = BR_DECREFS;
2258 cmd_name = "BR_DECREFS";
2259 node->has_weak_ref = 0;
2260 }
2261 if (cmd != BR_NOOP) {
2262 if (put_user(cmd, (uint32_t __user *)ptr))
2263 return -EFAULT;
2264 ptr += sizeof(uint32_t);
2265 if (put_user(node->ptr,
2266 (binder_uintptr_t __user *)ptr))
2267 return -EFAULT;
2268 ptr += sizeof(binder_uintptr_t);
2269 if (put_user(node->cookie,
2270 (binder_uintptr_t __user *)ptr))
2271 return -EFAULT;
2272 ptr += sizeof(binder_uintptr_t);
2273
2274 binder_stat_br(proc, thread, cmd);
2275 binder_debug(BINDER_DEBUG_USER_REFS,
2276 "%d:%d %s %d u%016llx c%016llx\n",
2277 proc->pid, thread->pid, cmd_name,
2278 node->debug_id,
2279 (u64)node->ptr, (u64)node->cookie);
2280 } else {
2281 list_del_init(&w->entry);
2282 if (!weak && !strong) {
2283 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
2284 "%d:%d node %d u%016llx c%016llx deleted\n",
2285 proc->pid, thread->pid,
2286 node->debug_id,
2287 (u64)node->ptr,
2288 (u64)node->cookie);
2289 rb_erase(&node->rb_node, &proc->nodes);
2290 kfree(node);
2291 binder_stats_deleted(BINDER_STAT_NODE);
2292 } else {
2293 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
2294 "%d:%d node %d u%016llx c%016llx state unchanged\n",
2295 proc->pid, thread->pid,
2296 node->debug_id,
2297 (u64)node->ptr,
2298 (u64)node->cookie);
2299 }
2300 }
2301 } break;
2302 case BINDER_WORK_DEAD_BINDER:
2303 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
2304 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
2305 struct binder_ref_death *death;
2306 uint32_t cmd;
2307
2308 death = container_of(w, struct binder_ref_death, work);
2309 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION)
2310 cmd = BR_CLEAR_DEATH_NOTIFICATION_DONE;
2311 else
2312 cmd = BR_DEAD_BINDER;
2313 if (put_user(cmd, (uint32_t __user *)ptr))
2314 return -EFAULT;
2315 ptr += sizeof(uint32_t);
2316 if (put_user(death->cookie,
2317 (binder_uintptr_t __user *)ptr))
2318 return -EFAULT;
2319 ptr += sizeof(binder_uintptr_t);
2320 binder_stat_br(proc, thread, cmd);
2321 binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
2322 "%d:%d %s %016llx\n",
2323 proc->pid, thread->pid,
2324 cmd == BR_DEAD_BINDER ?
2325 "BR_DEAD_BINDER" :
2326 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
2327 (u64)death->cookie);
2328
2329 if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) {
2330 list_del(&w->entry);
2331 kfree(death);
2332 binder_stats_deleted(BINDER_STAT_DEATH);
2333 } else
2334 list_move(&w->entry, &proc->delivered_death);
2335 if (cmd == BR_DEAD_BINDER)
2336 goto done; /* DEAD_BINDER notifications can cause transactions */
2337 } break;
2338 }
2339
2340 if (!t)
2341 continue;
2342
2343 BUG_ON(t->buffer == NULL);
2344 if (t->buffer->target_node) {
2345 struct binder_node *target_node = t->buffer->target_node;
2346
2347 tr.target.ptr = target_node->ptr;
2348 tr.cookie = target_node->cookie;
2349 t->saved_priority = task_nice(current);
2350 if (t->priority < target_node->min_priority &&
2351 !(t->flags & TF_ONE_WAY))
2352 binder_set_nice(t->priority);
2353 else if (!(t->flags & TF_ONE_WAY) ||
2354 t->saved_priority > target_node->min_priority)
2355 binder_set_nice(target_node->min_priority);
2356 cmd = BR_TRANSACTION;
2357 } else {
2358 tr.target.ptr = 0;
2359 tr.cookie = 0;
2360 cmd = BR_REPLY;
2361 }
2362 tr.code = t->code;
2363 tr.flags = t->flags;
2364 tr.sender_euid = from_kuid(current_user_ns(), t->sender_euid);
2365
2366 if (t->from) {
2367 struct task_struct *sender = t->from->proc->tsk;
2368
2369 tr.sender_pid = task_tgid_nr_ns(sender,
2370 task_active_pid_ns(current));
2371 } else {
2372 tr.sender_pid = 0;
2373 }
2374
2375 tr.data_size = t->buffer->data_size;
2376 tr.offsets_size = t->buffer->offsets_size;
2377 tr.data.ptr.buffer = (binder_uintptr_t)(
2378 (uintptr_t)t->buffer->data +
2379 proc->user_buffer_offset);
2380 tr.data.ptr.offsets = tr.data.ptr.buffer +
2381 ALIGN(t->buffer->data_size,
2382 sizeof(void *));
2383
2384 if (put_user(cmd, (uint32_t __user *)ptr))
2385 return -EFAULT;
2386 ptr += sizeof(uint32_t);
2387 if (copy_to_user(ptr, &tr, sizeof(tr)))
2388 return -EFAULT;
2389 ptr += sizeof(tr);
2390
2391 trace_binder_transaction_received(t);
2392 binder_stat_br(proc, thread, cmd);
2393 binder_debug(BINDER_DEBUG_TRANSACTION,
2394 "%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n",
2395 proc->pid, thread->pid,
2396 (cmd == BR_TRANSACTION) ? "BR_TRANSACTION" :
2397 "BR_REPLY",
2398 t->debug_id, t->from ? t->from->proc->pid : 0,
2399 t->from ? t->from->pid : 0, cmd,
2400 t->buffer->data_size, t->buffer->offsets_size,
2401 (u64)tr.data.ptr.buffer, (u64)tr.data.ptr.offsets);
2402
2403 list_del(&t->work.entry);
2404 t->buffer->allow_user_free = 1;
2405 if (cmd == BR_TRANSACTION && !(t->flags & TF_ONE_WAY)) {
2406 t->to_parent = thread->transaction_stack;
2407 t->to_thread = thread;
2408 thread->transaction_stack = t;
2409 } else {
2410 t->buffer->transaction = NULL;
2411 kfree(t);
2412 binder_stats_deleted(BINDER_STAT_TRANSACTION);
2413 }
2414 break;
2415 }
2416
2417 done:
2418
2419 *consumed = ptr - buffer;
2420 if (proc->requested_threads + proc->ready_threads == 0 &&
2421 proc->requested_threads_started < proc->max_threads &&
2422 (thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
2423 BINDER_LOOPER_STATE_ENTERED)) /* the user-space code fails to */
2424 /*spawn a new thread if we leave this out */) {
2425 proc->requested_threads++;
2426 binder_debug(BINDER_DEBUG_THREADS,
2427 "%d:%d BR_SPAWN_LOOPER\n",
2428 proc->pid, thread->pid);
2429 if (put_user(BR_SPAWN_LOOPER, (uint32_t __user *)buffer))
2430 return -EFAULT;
2431 binder_stat_br(proc, thread, BR_SPAWN_LOOPER);
2432 }
2433 return 0;
2434 }
2435
2436 static void binder_release_work(struct list_head *list)
2437 {
2438 struct binder_work *w;
2439
2440 while (!list_empty(list)) {
2441 w = list_first_entry(list, struct binder_work, entry);
2442 list_del_init(&w->entry);
2443 switch (w->type) {
2444 case BINDER_WORK_TRANSACTION: {
2445 struct binder_transaction *t;
2446
2447 t = container_of(w, struct binder_transaction, work);
2448 if (t->buffer->target_node &&
2449 !(t->flags & TF_ONE_WAY)) {
2450 binder_send_failed_reply(t, BR_DEAD_REPLY);
2451 } else {
2452 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
2453 "undelivered transaction %d\n",
2454 t->debug_id);
2455 t->buffer->transaction = NULL;
2456 kfree(t);
2457 binder_stats_deleted(BINDER_STAT_TRANSACTION);
2458 }
2459 } break;
2460 case BINDER_WORK_TRANSACTION_COMPLETE: {
2461 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
2462 "undelivered TRANSACTION_COMPLETE\n");
2463 kfree(w);
2464 binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
2465 } break;
2466 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
2467 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
2468 struct binder_ref_death *death;
2469
2470 death = container_of(w, struct binder_ref_death, work);
2471 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
2472 "undelivered death notification, %016llx\n",
2473 (u64)death->cookie);
2474 kfree(death);
2475 binder_stats_deleted(BINDER_STAT_DEATH);
2476 } break;
2477 default:
2478 pr_err("unexpected work type, %d, not freed\n",
2479 w->type);
2480 break;
2481 }
2482 }
2483
2484 }
2485
2486 static struct binder_thread *binder_get_thread(struct binder_proc *proc)
2487 {
2488 struct binder_thread *thread = NULL;
2489 struct rb_node *parent = NULL;
2490 struct rb_node **p = &proc->threads.rb_node;
2491
2492 while (*p) {
2493 parent = *p;
2494 thread = rb_entry(parent, struct binder_thread, rb_node);
2495
2496 if (current->pid < thread->pid)
2497 p = &(*p)->rb_left;
2498 else if (current->pid > thread->pid)
2499 p = &(*p)->rb_right;
2500 else
2501 break;
2502 }
2503 if (*p == NULL) {
2504 thread = kzalloc(sizeof(*thread), GFP_KERNEL);
2505 if (thread == NULL)
2506 return NULL;
2507 binder_stats_created(BINDER_STAT_THREAD);
2508 thread->proc = proc;
2509 thread->pid = current->pid;
2510 init_waitqueue_head(&thread->wait);
2511 INIT_LIST_HEAD(&thread->todo);
2512 rb_link_node(&thread->rb_node, parent, p);
2513 rb_insert_color(&thread->rb_node, &proc->threads);
2514 thread->looper |= BINDER_LOOPER_STATE_NEED_RETURN;
2515 thread->return_error = BR_OK;
2516 thread->return_error2 = BR_OK;
2517 }
2518 return thread;
2519 }
2520
2521 static int binder_free_thread(struct binder_proc *proc,
2522 struct binder_thread *thread)
2523 {
2524 struct binder_transaction *t;
2525 struct binder_transaction *send_reply = NULL;
2526 int active_transactions = 0;
2527
2528 rb_erase(&thread->rb_node, &proc->threads);
2529 t = thread->transaction_stack;
2530 if (t && t->to_thread == thread)
2531 send_reply = t;
2532 while (t) {
2533 active_transactions++;
2534 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
2535 "release %d:%d transaction %d %s, still active\n",
2536 proc->pid, thread->pid,
2537 t->debug_id,
2538 (t->to_thread == thread) ? "in" : "out");
2539
2540 if (t->to_thread == thread) {
2541 t->to_proc = NULL;
2542 t->to_thread = NULL;
2543 if (t->buffer) {
2544 t->buffer->transaction = NULL;
2545 t->buffer = NULL;
2546 }
2547 t = t->to_parent;
2548 } else if (t->from == thread) {
2549 t->from = NULL;
2550 t = t->from_parent;
2551 } else
2552 BUG();
2553 }
2554 if (send_reply)
2555 binder_send_failed_reply(send_reply, BR_DEAD_REPLY);
2556 binder_release_work(&thread->todo);
2557 kfree(thread);
2558 binder_stats_deleted(BINDER_STAT_THREAD);
2559 return active_transactions;
2560 }
2561
2562 static unsigned int binder_poll(struct file *filp,
2563 struct poll_table_struct *wait)
2564 {
2565 struct binder_proc *proc = filp->private_data;
2566 struct binder_thread *thread = NULL;
2567 int wait_for_proc_work;
2568
2569 binder_lock(__func__);
2570
2571 thread = binder_get_thread(proc);
2572
2573 wait_for_proc_work = thread->transaction_stack == NULL &&
2574 list_empty(&thread->todo) && thread->return_error == BR_OK;
2575
2576 binder_unlock(__func__);
2577
2578 if (wait_for_proc_work) {
2579 if (binder_has_proc_work(proc, thread))
2580 return POLLIN;
2581 poll_wait(filp, &proc->wait, wait);
2582 if (binder_has_proc_work(proc, thread))
2583 return POLLIN;
2584 } else {
2585 if (binder_has_thread_work(thread))
2586 return POLLIN;
2587 poll_wait(filp, &thread->wait, wait);
2588 if (binder_has_thread_work(thread))
2589 return POLLIN;
2590 }
2591 return 0;
2592 }
2593
2594 static int binder_ioctl_write_read(struct file *filp,
2595 unsigned int cmd, unsigned long arg,
2596 struct binder_thread *thread)
2597 {
2598 int ret = 0;
2599 struct binder_proc *proc = filp->private_data;
2600 unsigned int size = _IOC_SIZE(cmd);
2601 void __user *ubuf = (void __user *)arg;
2602 struct binder_write_read bwr;
2603
2604 if (size != sizeof(struct binder_write_read)) {
2605 ret = -EINVAL;
2606 goto out;
2607 }
2608 if (copy_from_user(&bwr, ubuf, sizeof(bwr))) {
2609 ret = -EFAULT;
2610 goto out;
2611 }
2612 binder_debug(BINDER_DEBUG_READ_WRITE,
2613 "%d:%d write %lld at %016llx, read %lld at %016llx\n",
2614 proc->pid, thread->pid,
2615 (u64)bwr.write_size, (u64)bwr.write_buffer,
2616 (u64)bwr.read_size, (u64)bwr.read_buffer);
2617
2618 if (bwr.write_size > 0) {
2619 ret = binder_thread_write(proc, thread,
2620 bwr.write_buffer,
2621 bwr.write_size,
2622 &bwr.write_consumed);
2623 trace_binder_write_done(ret);
2624 if (ret < 0) {
2625 bwr.read_consumed = 0;
2626 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
2627 ret = -EFAULT;
2628 goto out;
2629 }
2630 }
2631 if (bwr.read_size > 0) {
2632 ret = binder_thread_read(proc, thread, bwr.read_buffer,
2633 bwr.read_size,
2634 &bwr.read_consumed,
2635 filp->f_flags & O_NONBLOCK);
2636 trace_binder_read_done(ret);
2637 if (!list_empty(&proc->todo))
2638 wake_up_interruptible(&proc->wait);
2639 if (ret < 0) {
2640 if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
2641 ret = -EFAULT;
2642 goto out;
2643 }
2644 }
2645 binder_debug(BINDER_DEBUG_READ_WRITE,
2646 "%d:%d wrote %lld of %lld, read return %lld of %lld\n",
2647 proc->pid, thread->pid,
2648 (u64)bwr.write_consumed, (u64)bwr.write_size,
2649 (u64)bwr.read_consumed, (u64)bwr.read_size);
2650 if (copy_to_user(ubuf, &bwr, sizeof(bwr))) {
2651 ret = -EFAULT;
2652 goto out;
2653 }
2654 out:
2655 return ret;
2656 }
2657
2658 static int binder_ioctl_set_ctx_mgr(struct file *filp)
2659 {
2660 int ret = 0;
2661 struct binder_proc *proc = filp->private_data;
2662 kuid_t curr_euid = current_euid();
2663
2664 if (binder_context_mgr_node != NULL) {
2665 pr_err("BINDER_SET_CONTEXT_MGR already set\n");
2666 ret = -EBUSY;
2667 goto out;
2668 }
2669 if (uid_valid(binder_context_mgr_uid)) {
2670 if (!uid_eq(binder_context_mgr_uid, curr_euid)) {
2671 pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
2672 from_kuid(&init_user_ns, curr_euid),
2673 from_kuid(&init_user_ns,
2674 binder_context_mgr_uid));
2675 ret = -EPERM;
2676 goto out;
2677 }
2678 } else {
2679 binder_context_mgr_uid = curr_euid;
2680 }
2681 binder_context_mgr_node = binder_new_node(proc, 0, 0);
2682 if (binder_context_mgr_node == NULL) {
2683 ret = -ENOMEM;
2684 goto out;
2685 }
2686 binder_context_mgr_node->local_weak_refs++;
2687 binder_context_mgr_node->local_strong_refs++;
2688 binder_context_mgr_node->has_strong_ref = 1;
2689 binder_context_mgr_node->has_weak_ref = 1;
2690 out:
2691 return ret;
2692 }
2693
2694 static long binder_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
2695 {
2696 int ret;
2697 struct binder_proc *proc = filp->private_data;
2698 struct binder_thread *thread;
2699 unsigned int size = _IOC_SIZE(cmd);
2700 void __user *ubuf = (void __user *)arg;
2701
2702 /*pr_info("binder_ioctl: %d:%d %x %lx\n",
2703 proc->pid, current->pid, cmd, arg);*/
2704
2705 trace_binder_ioctl(cmd, arg);
2706
2707 ret = wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
2708 if (ret)
2709 goto err_unlocked;
2710
2711 binder_lock(__func__);
2712 thread = binder_get_thread(proc);
2713 if (thread == NULL) {
2714 ret = -ENOMEM;
2715 goto err;
2716 }
2717
2718 switch (cmd) {
2719 case BINDER_WRITE_READ:
2720 ret = binder_ioctl_write_read(filp, cmd, arg, thread);
2721 if (ret)
2722 goto err;
2723 break;
2724 case BINDER_SET_MAX_THREADS:
2725 if (copy_from_user(&proc->max_threads, ubuf, sizeof(proc->max_threads))) {
2726 ret = -EINVAL;
2727 goto err;
2728 }
2729 break;
2730 case BINDER_SET_CONTEXT_MGR:
2731 ret = binder_ioctl_set_ctx_mgr(filp);
2732 if (ret)
2733 goto err;
2734 break;
2735 case BINDER_THREAD_EXIT:
2736 binder_debug(BINDER_DEBUG_THREADS, "%d:%d exit\n",
2737 proc->pid, thread->pid);
2738 binder_free_thread(proc, thread);
2739 thread = NULL;
2740 break;
2741 case BINDER_VERSION: {
2742 struct binder_version __user *ver = ubuf;
2743
2744 if (size != sizeof(struct binder_version)) {
2745 ret = -EINVAL;
2746 goto err;
2747 }
2748 if (put_user(BINDER_CURRENT_PROTOCOL_VERSION,
2749 &ver->protocol_version)) {
2750 ret = -EINVAL;
2751 goto err;
2752 }
2753 break;
2754 }
2755 default:
2756 ret = -EINVAL;
2757 goto err;
2758 }
2759 ret = 0;
2760 err:
2761 if (thread)
2762 thread->looper &= ~BINDER_LOOPER_STATE_NEED_RETURN;
2763 binder_unlock(__func__);
2764 wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
2765 if (ret && ret != -ERESTARTSYS)
2766 pr_info("%d:%d ioctl %x %lx returned %d\n", proc->pid, current->pid, cmd, arg, ret);
2767 err_unlocked:
2768 trace_binder_ioctl_done(ret);
2769 return ret;
2770 }
2771
2772 static void binder_vma_open(struct vm_area_struct *vma)
2773 {
2774 struct binder_proc *proc = vma->vm_private_data;
2775
2776 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
2777 "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
2778 proc->pid, vma->vm_start, vma->vm_end,
2779 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
2780 (unsigned long)pgprot_val(vma->vm_page_prot));
2781 }
2782
2783 static void binder_vma_close(struct vm_area_struct *vma)
2784 {
2785 struct binder_proc *proc = vma->vm_private_data;
2786
2787 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
2788 "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
2789 proc->pid, vma->vm_start, vma->vm_end,
2790 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
2791 (unsigned long)pgprot_val(vma->vm_page_prot));
2792 proc->vma = NULL;
2793 proc->vma_vm_mm = NULL;
2794 binder_defer_work(proc, BINDER_DEFERRED_PUT_FILES);
2795 }
2796
2797 static int binder_vm_fault(struct vm_area_struct *vma, struct vm_fault *vmf)
2798 {
2799 return VM_FAULT_SIGBUS;
2800 }
2801
2802 static struct vm_operations_struct binder_vm_ops = {
2803 .open = binder_vma_open,
2804 .close = binder_vma_close,
2805 .fault = binder_vm_fault,
2806 };
2807
2808 static int binder_mmap(struct file *filp, struct vm_area_struct *vma)
2809 {
2810 int ret;
2811 struct vm_struct *area;
2812 struct binder_proc *proc = filp->private_data;
2813 const char *failure_string;
2814 struct binder_buffer *buffer;
2815
2816 if (proc->tsk != current)
2817 return -EINVAL;
2818
2819 if ((vma->vm_end - vma->vm_start) > SZ_4M)
2820 vma->vm_end = vma->vm_start + SZ_4M;
2821
2822 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
2823 "binder_mmap: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
2824 proc->pid, vma->vm_start, vma->vm_end,
2825 (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
2826 (unsigned long)pgprot_val(vma->vm_page_prot));
2827
2828 if (vma->vm_flags & FORBIDDEN_MMAP_FLAGS) {
2829 ret = -EPERM;
2830 failure_string = "bad vm_flags";
2831 goto err_bad_arg;
2832 }
2833 vma->vm_flags = (vma->vm_flags | VM_DONTCOPY) & ~VM_MAYWRITE;
2834
2835 mutex_lock(&binder_mmap_lock);
2836 if (proc->buffer) {
2837 ret = -EBUSY;
2838 failure_string = "already mapped";
2839 goto err_already_mapped;
2840 }
2841
2842 area = get_vm_area(vma->vm_end - vma->vm_start, VM_IOREMAP);
2843 if (area == NULL) {
2844 ret = -ENOMEM;
2845 failure_string = "get_vm_area";
2846 goto err_get_vm_area_failed;
2847 }
2848 proc->buffer = area->addr;
2849 proc->user_buffer_offset = vma->vm_start - (uintptr_t)proc->buffer;
2850 mutex_unlock(&binder_mmap_lock);
2851
2852 #ifdef CONFIG_CPU_CACHE_VIPT
2853 if (cache_is_vipt_aliasing()) {
2854 while (CACHE_COLOUR((vma->vm_start ^ (uint32_t)proc->buffer))) {
2855 pr_info("binder_mmap: %d %lx-%lx maps %p bad alignment\n", proc->pid, vma->vm_start, vma->vm_end, proc->buffer);
2856 vma->vm_start += PAGE_SIZE;
2857 }
2858 }
2859 #endif
2860 proc->pages = kzalloc(sizeof(proc->pages[0]) * ((vma->vm_end - vma->vm_start) / PAGE_SIZE), GFP_KERNEL);
2861 if (proc->pages == NULL) {
2862 ret = -ENOMEM;
2863 failure_string = "alloc page array";
2864 goto err_alloc_pages_failed;
2865 }
2866 proc->buffer_size = vma->vm_end - vma->vm_start;
2867
2868 vma->vm_ops = &binder_vm_ops;
2869 vma->vm_private_data = proc;
2870
2871 if (binder_update_page_range(proc, 1, proc->buffer, proc->buffer + PAGE_SIZE, vma)) {
2872 ret = -ENOMEM;
2873 failure_string = "alloc small buf";
2874 goto err_alloc_small_buf_failed;
2875 }
2876 buffer = proc->buffer;
2877 INIT_LIST_HEAD(&proc->buffers);
2878 list_add(&buffer->entry, &proc->buffers);
2879 buffer->free = 1;
2880 binder_insert_free_buffer(proc, buffer);
2881 proc->free_async_space = proc->buffer_size / 2;
2882 barrier();
2883 proc->files = get_files_struct(current);
2884 proc->vma = vma;
2885 proc->vma_vm_mm = vma->vm_mm;
2886
2887 /*pr_info("binder_mmap: %d %lx-%lx maps %p\n",
2888 proc->pid, vma->vm_start, vma->vm_end, proc->buffer);*/
2889 return 0;
2890
2891 err_alloc_small_buf_failed:
2892 kfree(proc->pages);
2893 proc->pages = NULL;
2894 err_alloc_pages_failed:
2895 mutex_lock(&binder_mmap_lock);
2896 vfree(proc->buffer);
2897 proc->buffer = NULL;
2898 err_get_vm_area_failed:
2899 err_already_mapped:
2900 mutex_unlock(&binder_mmap_lock);
2901 err_bad_arg:
2902 pr_err("binder_mmap: %d %lx-%lx %s failed %d\n",
2903 proc->pid, vma->vm_start, vma->vm_end, failure_string, ret);
2904 return ret;
2905 }
2906
2907 static int binder_open(struct inode *nodp, struct file *filp)
2908 {
2909 struct binder_proc *proc;
2910
2911 binder_debug(BINDER_DEBUG_OPEN_CLOSE, "binder_open: %d:%d\n",
2912 current->group_leader->pid, current->pid);
2913
2914 proc = kzalloc(sizeof(*proc), GFP_KERNEL);
2915 if (proc == NULL)
2916 return -ENOMEM;
2917 get_task_struct(current);
2918 proc->tsk = current;
2919 INIT_LIST_HEAD(&proc->todo);
2920 init_waitqueue_head(&proc->wait);
2921 proc->default_priority = task_nice(current);
2922
2923 binder_lock(__func__);
2924
2925 binder_stats_created(BINDER_STAT_PROC);
2926 hlist_add_head(&proc->proc_node, &binder_procs);
2927 proc->pid = current->group_leader->pid;
2928 INIT_LIST_HEAD(&proc->delivered_death);
2929 filp->private_data = proc;
2930
2931 binder_unlock(__func__);
2932
2933 if (binder_debugfs_dir_entry_proc) {
2934 char strbuf[11];
2935
2936 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
2937 proc->debugfs_entry = debugfs_create_file(strbuf, S_IRUGO,
2938 binder_debugfs_dir_entry_proc, proc, &binder_proc_fops);
2939 }
2940
2941 return 0;
2942 }
2943
2944 static int binder_flush(struct file *filp, fl_owner_t id)
2945 {
2946 struct binder_proc *proc = filp->private_data;
2947
2948 binder_defer_work(proc, BINDER_DEFERRED_FLUSH);
2949
2950 return 0;
2951 }
2952
2953 static void binder_deferred_flush(struct binder_proc *proc)
2954 {
2955 struct rb_node *n;
2956 int wake_count = 0;
2957
2958 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
2959 struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node);
2960
2961 thread->looper |= BINDER_LOOPER_STATE_NEED_RETURN;
2962 if (thread->looper & BINDER_LOOPER_STATE_WAITING) {
2963 wake_up_interruptible(&thread->wait);
2964 wake_count++;
2965 }
2966 }
2967 wake_up_interruptible_all(&proc->wait);
2968
2969 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
2970 "binder_flush: %d woke %d threads\n", proc->pid,
2971 wake_count);
2972 }
2973
2974 static int binder_release(struct inode *nodp, struct file *filp)
2975 {
2976 struct binder_proc *proc = filp->private_data;
2977
2978 debugfs_remove(proc->debugfs_entry);
2979 binder_defer_work(proc, BINDER_DEFERRED_RELEASE);
2980
2981 return 0;
2982 }
2983
2984 static int binder_node_release(struct binder_node *node, int refs)
2985 {
2986 struct binder_ref *ref;
2987 int death = 0;
2988
2989 list_del_init(&node->work.entry);
2990 binder_release_work(&node->async_todo);
2991
2992 if (hlist_empty(&node->refs)) {
2993 kfree(node);
2994 binder_stats_deleted(BINDER_STAT_NODE);
2995
2996 return refs;
2997 }
2998
2999 node->proc = NULL;
3000 node->local_strong_refs = 0;
3001 node->local_weak_refs = 0;
3002 hlist_add_head(&node->dead_node, &binder_dead_nodes);
3003
3004 hlist_for_each_entry(ref, &node->refs, node_entry) {
3005 refs++;
3006
3007 if (!ref->death)
3008 continue;
3009
3010 death++;
3011
3012 if (list_empty(&ref->death->work.entry)) {
3013 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
3014 list_add_tail(&ref->death->work.entry,
3015 &ref->proc->todo);
3016 wake_up_interruptible(&ref->proc->wait);
3017 } else
3018 BUG();
3019 }
3020
3021 binder_debug(BINDER_DEBUG_DEAD_BINDER,
3022 "node %d now dead, refs %d, death %d\n",
3023 node->debug_id, refs, death);
3024
3025 return refs;
3026 }
3027
3028 static void binder_deferred_release(struct binder_proc *proc)
3029 {
3030 struct binder_transaction *t;
3031 struct rb_node *n;
3032 int threads, nodes, incoming_refs, outgoing_refs, buffers,
3033 active_transactions, page_count;
3034
3035 BUG_ON(proc->vma);
3036 BUG_ON(proc->files);
3037
3038 hlist_del(&proc->proc_node);
3039
3040 if (binder_context_mgr_node && binder_context_mgr_node->proc == proc) {
3041 binder_debug(BINDER_DEBUG_DEAD_BINDER,
3042 "%s: %d context_mgr_node gone\n",
3043 __func__, proc->pid);
3044 binder_context_mgr_node = NULL;
3045 }
3046
3047 threads = 0;
3048 active_transactions = 0;
3049 while ((n = rb_first(&proc->threads))) {
3050 struct binder_thread *thread;
3051
3052 thread = rb_entry(n, struct binder_thread, rb_node);
3053 threads++;
3054 active_transactions += binder_free_thread(proc, thread);
3055 }
3056
3057 nodes = 0;
3058 incoming_refs = 0;
3059 while ((n = rb_first(&proc->nodes))) {
3060 struct binder_node *node;
3061
3062 node = rb_entry(n, struct binder_node, rb_node);
3063 nodes++;
3064 rb_erase(&node->rb_node, &proc->nodes);
3065 incoming_refs = binder_node_release(node, incoming_refs);
3066 }
3067
3068 outgoing_refs = 0;
3069 while ((n = rb_first(&proc->refs_by_desc))) {
3070 struct binder_ref *ref;
3071
3072 ref = rb_entry(n, struct binder_ref, rb_node_desc);
3073 outgoing_refs++;
3074 binder_delete_ref(ref);
3075 }
3076
3077 binder_release_work(&proc->todo);
3078 binder_release_work(&proc->delivered_death);
3079
3080 buffers = 0;
3081 while ((n = rb_first(&proc->allocated_buffers))) {
3082 struct binder_buffer *buffer;
3083
3084 buffer = rb_entry(n, struct binder_buffer, rb_node);
3085
3086 t = buffer->transaction;
3087 if (t) {
3088 t->buffer = NULL;
3089 buffer->transaction = NULL;
3090 pr_err("release proc %d, transaction %d, not freed\n",
3091 proc->pid, t->debug_id);
3092 /*BUG();*/
3093 }
3094
3095 binder_free_buf(proc, buffer);
3096 buffers++;
3097 }
3098
3099 binder_stats_deleted(BINDER_STAT_PROC);
3100
3101 page_count = 0;
3102 if (proc->pages) {
3103 int i;
3104
3105 for (i = 0; i < proc->buffer_size / PAGE_SIZE; i++) {
3106 void *page_addr;
3107
3108 if (!proc->pages[i])
3109 continue;
3110
3111 page_addr = proc->buffer + i * PAGE_SIZE;
3112 binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
3113 "%s: %d: page %d at %p not freed\n",
3114 __func__, proc->pid, i, page_addr);
3115 unmap_kernel_range((unsigned long)page_addr, PAGE_SIZE);
3116 __free_page(proc->pages[i]);
3117 page_count++;
3118 }
3119 kfree(proc->pages);
3120 vfree(proc->buffer);
3121 }
3122
3123 put_task_struct(proc->tsk);
3124
3125 binder_debug(BINDER_DEBUG_OPEN_CLOSE,
3126 "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d, buffers %d, pages %d\n",
3127 __func__, proc->pid, threads, nodes, incoming_refs,
3128 outgoing_refs, active_transactions, buffers, page_count);
3129
3130 kfree(proc);
3131 }
3132
3133 static void binder_deferred_func(struct work_struct *work)
3134 {
3135 struct binder_proc *proc;
3136 struct files_struct *files;
3137
3138 int defer;
3139
3140 do {
3141 binder_lock(__func__);
3142 mutex_lock(&binder_deferred_lock);
3143 if (!hlist_empty(&binder_deferred_list)) {
3144 proc = hlist_entry(binder_deferred_list.first,
3145 struct binder_proc, deferred_work_node);
3146 hlist_del_init(&proc->deferred_work_node);
3147 defer = proc->deferred_work;
3148 proc->deferred_work = 0;
3149 } else {
3150 proc = NULL;
3151 defer = 0;
3152 }
3153 mutex_unlock(&binder_deferred_lock);
3154
3155 files = NULL;
3156 if (defer & BINDER_DEFERRED_PUT_FILES) {
3157 files = proc->files;
3158 if (files)
3159 proc->files = NULL;
3160 }
3161
3162 if (defer & BINDER_DEFERRED_FLUSH)
3163 binder_deferred_flush(proc);
3164
3165 if (defer & BINDER_DEFERRED_RELEASE)
3166 binder_deferred_release(proc); /* frees proc */
3167
3168 binder_unlock(__func__);
3169 if (files)
3170 put_files_struct(files);
3171 } while (proc);
3172 }
3173 static DECLARE_WORK(binder_deferred_work, binder_deferred_func);
3174
3175 static void
3176 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer)
3177 {
3178 mutex_lock(&binder_deferred_lock);
3179 proc->deferred_work |= defer;
3180 if (hlist_unhashed(&proc->deferred_work_node)) {
3181 hlist_add_head(&proc->deferred_work_node,
3182 &binder_deferred_list);
3183 queue_work(binder_deferred_workqueue, &binder_deferred_work);
3184 }
3185 mutex_unlock(&binder_deferred_lock);
3186 }
3187
3188 static void print_binder_transaction(struct seq_file *m, const char *prefix,
3189 struct binder_transaction *t)
3190 {
3191 seq_printf(m,
3192 "%s %d: %p from %d:%d to %d:%d code %x flags %x pri %ld r%d",
3193 prefix, t->debug_id, t,
3194 t->from ? t->from->proc->pid : 0,
3195 t->from ? t->from->pid : 0,
3196 t->to_proc ? t->to_proc->pid : 0,
3197 t->to_thread ? t->to_thread->pid : 0,
3198 t->code, t->flags, t->priority, t->need_reply);
3199 if (t->buffer == NULL) {
3200 seq_puts(m, " buffer free\n");
3201 return;
3202 }
3203 if (t->buffer->target_node)
3204 seq_printf(m, " node %d",
3205 t->buffer->target_node->debug_id);
3206 seq_printf(m, " size %zd:%zd data %p\n",
3207 t->buffer->data_size, t->buffer->offsets_size,
3208 t->buffer->data);
3209 }
3210
3211 static void print_binder_buffer(struct seq_file *m, const char *prefix,
3212 struct binder_buffer *buffer)
3213 {
3214 seq_printf(m, "%s %d: %p size %zd:%zd %s\n",
3215 prefix, buffer->debug_id, buffer->data,
3216 buffer->data_size, buffer->offsets_size,
3217 buffer->transaction ? "active" : "delivered");
3218 }
3219
3220 static void print_binder_work(struct seq_file *m, const char *prefix,
3221 const char *transaction_prefix,
3222 struct binder_work *w)
3223 {
3224 struct binder_node *node;
3225 struct binder_transaction *t;
3226
3227 switch (w->type) {
3228 case BINDER_WORK_TRANSACTION:
3229 t = container_of(w, struct binder_transaction, work);
3230 print_binder_transaction(m, transaction_prefix, t);
3231 break;
3232 case BINDER_WORK_TRANSACTION_COMPLETE:
3233 seq_printf(m, "%stransaction complete\n", prefix);
3234 break;
3235 case BINDER_WORK_NODE:
3236 node = container_of(w, struct binder_node, work);
3237 seq_printf(m, "%snode work %d: u%016llx c%016llx\n",
3238 prefix, node->debug_id,
3239 (u64)node->ptr, (u64)node->cookie);
3240 break;
3241 case BINDER_WORK_DEAD_BINDER:
3242 seq_printf(m, "%shas dead binder\n", prefix);
3243 break;
3244 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
3245 seq_printf(m, "%shas cleared dead binder\n", prefix);
3246 break;
3247 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION:
3248 seq_printf(m, "%shas cleared death notification\n", prefix);
3249 break;
3250 default:
3251 seq_printf(m, "%sunknown work: type %d\n", prefix, w->type);
3252 break;
3253 }
3254 }
3255
3256 static void print_binder_thread(struct seq_file *m,
3257 struct binder_thread *thread,
3258 int print_always)
3259 {
3260 struct binder_transaction *t;
3261 struct binder_work *w;
3262 size_t start_pos = m->count;
3263 size_t header_pos;
3264
3265 seq_printf(m, " thread %d: l %02x\n", thread->pid, thread->looper);
3266 header_pos = m->count;
3267 t = thread->transaction_stack;
3268 while (t) {
3269 if (t->from == thread) {
3270 print_binder_transaction(m,
3271 " outgoing transaction", t);
3272 t = t->from_parent;
3273 } else if (t->to_thread == thread) {
3274 print_binder_transaction(m,
3275 " incoming transaction", t);
3276 t = t->to_parent;
3277 } else {
3278 print_binder_transaction(m, " bad transaction", t);
3279 t = NULL;
3280 }
3281 }
3282 list_for_each_entry(w, &thread->todo, entry) {
3283 print_binder_work(m, " ", " pending transaction", w);
3284 }
3285 if (!print_always && m->count == header_pos)
3286 m->count = start_pos;
3287 }
3288
3289 static void print_binder_node(struct seq_file *m, struct binder_node *node)
3290 {
3291 struct binder_ref *ref;
3292 struct binder_work *w;
3293 int count;
3294
3295 count = 0;
3296 hlist_for_each_entry(ref, &node->refs, node_entry)
3297 count++;
3298
3299 seq_printf(m, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d",
3300 node->debug_id, (u64)node->ptr, (u64)node->cookie,
3301 node->has_strong_ref, node->has_weak_ref,
3302 node->local_strong_refs, node->local_weak_refs,
3303 node->internal_strong_refs, count);
3304 if (count) {
3305 seq_puts(m, " proc");
3306 hlist_for_each_entry(ref, &node->refs, node_entry)
3307 seq_printf(m, " %d", ref->proc->pid);
3308 }
3309 seq_puts(m, "\n");
3310 list_for_each_entry(w, &node->async_todo, entry)
3311 print_binder_work(m, " ",
3312 " pending async transaction", w);
3313 }
3314
3315 static void print_binder_ref(struct seq_file *m, struct binder_ref *ref)
3316 {
3317 seq_printf(m, " ref %d: desc %d %snode %d s %d w %d d %p\n",
3318 ref->debug_id, ref->desc, ref->node->proc ? "" : "dead ",
3319 ref->node->debug_id, ref->strong, ref->weak, ref->death);
3320 }
3321
3322 static void print_binder_proc(struct seq_file *m,
3323 struct binder_proc *proc, int print_all)
3324 {
3325 struct binder_work *w;
3326 struct rb_node *n;
3327 size_t start_pos = m->count;
3328 size_t header_pos;
3329
3330 seq_printf(m, "proc %d\n", proc->pid);
3331 header_pos = m->count;
3332
3333 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
3334 print_binder_thread(m, rb_entry(n, struct binder_thread,
3335 rb_node), print_all);
3336 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
3337 struct binder_node *node = rb_entry(n, struct binder_node,
3338 rb_node);
3339 if (print_all || node->has_async_transaction)
3340 print_binder_node(m, node);
3341 }
3342 if (print_all) {
3343 for (n = rb_first(&proc->refs_by_desc);
3344 n != NULL;
3345 n = rb_next(n))
3346 print_binder_ref(m, rb_entry(n, struct binder_ref,
3347 rb_node_desc));
3348 }
3349 for (n = rb_first(&proc->allocated_buffers); n != NULL; n = rb_next(n))
3350 print_binder_buffer(m, " buffer",
3351 rb_entry(n, struct binder_buffer, rb_node));
3352 list_for_each_entry(w, &proc->todo, entry)
3353 print_binder_work(m, " ", " pending transaction", w);
3354 list_for_each_entry(w, &proc->delivered_death, entry) {
3355 seq_puts(m, " has delivered dead binder\n");
3356 break;
3357 }
3358 if (!print_all && m->count == header_pos)
3359 m->count = start_pos;
3360 }
3361
3362 static const char * const binder_return_strings[] = {
3363 "BR_ERROR",
3364 "BR_OK",
3365 "BR_TRANSACTION",
3366 "BR_REPLY",
3367 "BR_ACQUIRE_RESULT",
3368 "BR_DEAD_REPLY",
3369 "BR_TRANSACTION_COMPLETE",
3370 "BR_INCREFS",
3371 "BR_ACQUIRE",
3372 "BR_RELEASE",
3373 "BR_DECREFS",
3374 "BR_ATTEMPT_ACQUIRE",
3375 "BR_NOOP",
3376 "BR_SPAWN_LOOPER",
3377 "BR_FINISHED",
3378 "BR_DEAD_BINDER",
3379 "BR_CLEAR_DEATH_NOTIFICATION_DONE",
3380 "BR_FAILED_REPLY"
3381 };
3382
3383 static const char * const binder_command_strings[] = {
3384 "BC_TRANSACTION",
3385 "BC_REPLY",
3386 "BC_ACQUIRE_RESULT",
3387 "BC_FREE_BUFFER",
3388 "BC_INCREFS",
3389 "BC_ACQUIRE",
3390 "BC_RELEASE",
3391 "BC_DECREFS",
3392 "BC_INCREFS_DONE",
3393 "BC_ACQUIRE_DONE",
3394 "BC_ATTEMPT_ACQUIRE",
3395 "BC_REGISTER_LOOPER",
3396 "BC_ENTER_LOOPER",
3397 "BC_EXIT_LOOPER",
3398 "BC_REQUEST_DEATH_NOTIFICATION",
3399 "BC_CLEAR_DEATH_NOTIFICATION",
3400 "BC_DEAD_BINDER_DONE"
3401 };
3402
3403 static const char * const binder_objstat_strings[] = {
3404 "proc",
3405 "thread",
3406 "node",
3407 "ref",
3408 "death",
3409 "transaction",
3410 "transaction_complete"
3411 };
3412
3413 static void print_binder_stats(struct seq_file *m, const char *prefix,
3414 struct binder_stats *stats)
3415 {
3416 int i;
3417
3418 BUILD_BUG_ON(ARRAY_SIZE(stats->bc) !=
3419 ARRAY_SIZE(binder_command_strings));
3420 for (i = 0; i < ARRAY_SIZE(stats->bc); i++) {
3421 if (stats->bc[i])
3422 seq_printf(m, "%s%s: %d\n", prefix,
3423 binder_command_strings[i], stats->bc[i]);
3424 }
3425
3426 BUILD_BUG_ON(ARRAY_SIZE(stats->br) !=
3427 ARRAY_SIZE(binder_return_strings));
3428 for (i = 0; i < ARRAY_SIZE(stats->br); i++) {
3429 if (stats->br[i])
3430 seq_printf(m, "%s%s: %d\n", prefix,
3431 binder_return_strings[i], stats->br[i]);
3432 }
3433
3434 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
3435 ARRAY_SIZE(binder_objstat_strings));
3436 BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
3437 ARRAY_SIZE(stats->obj_deleted));
3438 for (i = 0; i < ARRAY_SIZE(stats->obj_created); i++) {
3439 if (stats->obj_created[i] || stats->obj_deleted[i])
3440 seq_printf(m, "%s%s: active %d total %d\n", prefix,
3441 binder_objstat_strings[i],
3442 stats->obj_created[i] - stats->obj_deleted[i],
3443 stats->obj_created[i]);
3444 }
3445 }
3446
3447 static void print_binder_proc_stats(struct seq_file *m,
3448 struct binder_proc *proc)
3449 {
3450 struct binder_work *w;
3451 struct rb_node *n;
3452 int count, strong, weak;
3453
3454 seq_printf(m, "proc %d\n", proc->pid);
3455 count = 0;
3456 for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
3457 count++;
3458 seq_printf(m, " threads: %d\n", count);
3459 seq_printf(m, " requested threads: %d+%d/%d\n"
3460 " ready threads %d\n"
3461 " free async space %zd\n", proc->requested_threads,
3462 proc->requested_threads_started, proc->max_threads,
3463 proc->ready_threads, proc->free_async_space);
3464 count = 0;
3465 for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n))
3466 count++;
3467 seq_printf(m, " nodes: %d\n", count);
3468 count = 0;
3469 strong = 0;
3470 weak = 0;
3471 for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
3472 struct binder_ref *ref = rb_entry(n, struct binder_ref,
3473 rb_node_desc);
3474 count++;
3475 strong += ref->strong;
3476 weak += ref->weak;
3477 }
3478 seq_printf(m, " refs: %d s %d w %d\n", count, strong, weak);
3479
3480 count = 0;
3481 for (n = rb_first(&proc->allocated_buffers); n != NULL; n = rb_next(n))
3482 count++;
3483 seq_printf(m, " buffers: %d\n", count);
3484
3485 count = 0;
3486 list_for_each_entry(w, &proc->todo, entry) {
3487 switch (w->type) {
3488 case BINDER_WORK_TRANSACTION:
3489 count++;
3490 break;
3491 default:
3492 break;
3493 }
3494 }
3495 seq_printf(m, " pending transactions: %d\n", count);
3496
3497 print_binder_stats(m, " ", &proc->stats);
3498 }
3499
3500
3501 static int binder_state_show(struct seq_file *m, void *unused)
3502 {
3503 struct binder_proc *proc;
3504 struct binder_node *node;
3505 int do_lock = !binder_debug_no_lock;
3506
3507 if (do_lock)
3508 binder_lock(__func__);
3509
3510 seq_puts(m, "binder state:\n");
3511
3512 if (!hlist_empty(&binder_dead_nodes))
3513 seq_puts(m, "dead nodes:\n");
3514 hlist_for_each_entry(node, &binder_dead_nodes, dead_node)
3515 print_binder_node(m, node);
3516
3517 hlist_for_each_entry(proc, &binder_procs, proc_node)
3518 print_binder_proc(m, proc, 1);
3519 if (do_lock)
3520 binder_unlock(__func__);
3521 return 0;
3522 }
3523
3524 static int binder_stats_show(struct seq_file *m, void *unused)
3525 {
3526 struct binder_proc *proc;
3527 int do_lock = !binder_debug_no_lock;
3528
3529 if (do_lock)
3530 binder_lock(__func__);
3531
3532 seq_puts(m, "binder stats:\n");
3533
3534 print_binder_stats(m, "", &binder_stats);
3535
3536 hlist_for_each_entry(proc, &binder_procs, proc_node)
3537 print_binder_proc_stats(m, proc);
3538 if (do_lock)
3539 binder_unlock(__func__);
3540 return 0;
3541 }
3542
3543 static int binder_transactions_show(struct seq_file *m, void *unused)
3544 {
3545 struct binder_proc *proc;
3546 int do_lock = !binder_debug_no_lock;
3547
3548 if (do_lock)
3549 binder_lock(__func__);
3550
3551 seq_puts(m, "binder transactions:\n");
3552 hlist_for_each_entry(proc, &binder_procs, proc_node)
3553 print_binder_proc(m, proc, 0);
3554 if (do_lock)
3555 binder_unlock(__func__);
3556 return 0;
3557 }
3558
3559 static int binder_proc_show(struct seq_file *m, void *unused)
3560 {
3561 struct binder_proc *proc = m->private;
3562 int do_lock = !binder_debug_no_lock;
3563
3564 if (do_lock)
3565 binder_lock(__func__);
3566 seq_puts(m, "binder proc state:\n");
3567 print_binder_proc(m, proc, 1);
3568 if (do_lock)
3569 binder_unlock(__func__);
3570 return 0;
3571 }
3572
3573 static void print_binder_transaction_log_entry(struct seq_file *m,
3574 struct binder_transaction_log_entry *e)
3575 {
3576 seq_printf(m,
3577 "%d: %s from %d:%d to %d:%d node %d handle %d size %d:%d\n",
3578 e->debug_id, (e->call_type == 2) ? "reply" :
3579 ((e->call_type == 1) ? "async" : "call "), e->from_proc,
3580 e->from_thread, e->to_proc, e->to_thread, e->to_node,
3581 e->target_handle, e->data_size, e->offsets_size);
3582 }
3583
3584 static int binder_transaction_log_show(struct seq_file *m, void *unused)
3585 {
3586 struct binder_transaction_log *log = m->private;
3587 int i;
3588
3589 if (log->full) {
3590 for (i = log->next; i < ARRAY_SIZE(log->entry); i++)
3591 print_binder_transaction_log_entry(m, &log->entry[i]);
3592 }
3593 for (i = 0; i < log->next; i++)
3594 print_binder_transaction_log_entry(m, &log->entry[i]);
3595 return 0;
3596 }
3597
3598 static const struct file_operations binder_fops = {
3599 .owner = THIS_MODULE,
3600 .poll = binder_poll,
3601 .unlocked_ioctl = binder_ioctl,
3602 .compat_ioctl = binder_ioctl,
3603 .mmap = binder_mmap,
3604 .open = binder_open,
3605 .flush = binder_flush,
3606 .release = binder_release,
3607 };
3608
3609 static struct miscdevice binder_miscdev = {
3610 .minor = MISC_DYNAMIC_MINOR,
3611 .name = "binder",
3612 .fops = &binder_fops
3613 };
3614
3615 BINDER_DEBUG_ENTRY(state);
3616 BINDER_DEBUG_ENTRY(stats);
3617 BINDER_DEBUG_ENTRY(transactions);
3618 BINDER_DEBUG_ENTRY(transaction_log);
3619
3620 static int __init binder_init(void)
3621 {
3622 int ret;
3623
3624 binder_deferred_workqueue = create_singlethread_workqueue("binder");
3625 if (!binder_deferred_workqueue)
3626 return -ENOMEM;
3627
3628 binder_debugfs_dir_entry_root = debugfs_create_dir("binder", NULL);
3629 if (binder_debugfs_dir_entry_root)
3630 binder_debugfs_dir_entry_proc = debugfs_create_dir("proc",
3631 binder_debugfs_dir_entry_root);
3632 ret = misc_register(&binder_miscdev);
3633 if (binder_debugfs_dir_entry_root) {
3634 debugfs_create_file("state",
3635 S_IRUGO,
3636 binder_debugfs_dir_entry_root,
3637 NULL,
3638 &binder_state_fops);
3639 debugfs_create_file("stats",
3640 S_IRUGO,
3641 binder_debugfs_dir_entry_root,
3642 NULL,
3643 &binder_stats_fops);
3644 debugfs_create_file("transactions",
3645 S_IRUGO,
3646 binder_debugfs_dir_entry_root,
3647 NULL,
3648 &binder_transactions_fops);
3649 debugfs_create_file("transaction_log",
3650 S_IRUGO,
3651 binder_debugfs_dir_entry_root,
3652 &binder_transaction_log,
3653 &binder_transaction_log_fops);
3654 debugfs_create_file("failed_transaction_log",
3655 S_IRUGO,
3656 binder_debugfs_dir_entry_root,
3657 &binder_transaction_log_failed,
3658 &binder_transaction_log_fops);
3659 }
3660 return ret;
3661 }
3662
3663 device_initcall(binder_init);
3664
3665 #define CREATE_TRACE_POINTS
3666 #include "binder_trace.h"
3667
3668 MODULE_LICENSE("GPL v2");
(deprecated) Btrfs devel tree