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