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