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