2011-11-30 19:18:14 +08:00
|
|
|
/* binder.c
|
|
|
|
*
|
|
|
|
* Android IPC Subsystem
|
|
|
|
*
|
|
|
|
* Copyright (C) 2007-2008 Google, Inc.
|
|
|
|
*
|
|
|
|
* This software is licensed under the terms of the GNU General Public
|
|
|
|
* License version 2, as published by the Free Software Foundation, and
|
|
|
|
* may be copied, distributed, and modified under those terms.
|
|
|
|
*
|
|
|
|
* This program is distributed in the hope that it will be useful,
|
|
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
* GNU General Public License for more details.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2012-10-31 01:05:43 +08:00
|
|
|
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
#include <asm/cacheflush.h>
|
|
|
|
#include <linux/fdtable.h>
|
|
|
|
#include <linux/file.h>
|
2013-05-07 07:50:15 +08:00
|
|
|
#include <linux/freezer.h>
|
2011-11-30 19:18:14 +08:00
|
|
|
#include <linux/fs.h>
|
|
|
|
#include <linux/list.h>
|
|
|
|
#include <linux/miscdevice.h>
|
|
|
|
#include <linux/mm.h>
|
|
|
|
#include <linux/module.h>
|
|
|
|
#include <linux/mutex.h>
|
|
|
|
#include <linux/nsproxy.h>
|
|
|
|
#include <linux/poll.h>
|
2009-04-29 11:57:50 +08:00
|
|
|
#include <linux/debugfs.h>
|
2011-11-30 19:18:14 +08:00
|
|
|
#include <linux/rbtree.h>
|
2017-02-09 01:51:30 +08:00
|
|
|
#include <linux/sched/signal.h>
|
2017-02-09 01:51:29 +08:00
|
|
|
#include <linux/sched/mm.h>
|
2009-04-29 11:57:50 +08:00
|
|
|
#include <linux/seq_file.h>
|
2011-11-30 19:18:14 +08:00
|
|
|
#include <linux/uaccess.h>
|
|
|
|
#include <linux/vmalloc.h>
|
2010-04-16 06:21:51 +08:00
|
|
|
#include <linux/slab.h>
|
2010-03-03 06:51:53 +08:00
|
|
|
#include <linux/pid_namespace.h>
|
2015-01-21 23:54:10 +08:00
|
|
|
#include <linux/security.h>
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2014-10-16 21:26:51 +08:00
|
|
|
#ifdef CONFIG_ANDROID_BINDER_IPC_32BIT
|
|
|
|
#define BINDER_IPC_32BIT 1
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include <uapi/linux/android/binder.h>
|
2012-10-17 06:29:53 +08:00
|
|
|
#include "binder_trace.h"
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2012-10-17 06:29:53 +08:00
|
|
|
static DEFINE_MUTEX(binder_main_lock);
|
2011-11-30 19:18:14 +08:00
|
|
|
static DEFINE_MUTEX(binder_deferred_lock);
|
2012-02-02 07:29:13 +08:00
|
|
|
static DEFINE_MUTEX(binder_mmap_lock);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2017-02-04 06:40:48 +08:00
|
|
|
static HLIST_HEAD(binder_devices);
|
2011-11-30 19:18:14 +08:00
|
|
|
static HLIST_HEAD(binder_procs);
|
|
|
|
static HLIST_HEAD(binder_deferred_list);
|
|
|
|
static HLIST_HEAD(binder_dead_nodes);
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static struct dentry *binder_debugfs_dir_entry_root;
|
|
|
|
static struct dentry *binder_debugfs_dir_entry_proc;
|
2011-11-30 19:18:14 +08:00
|
|
|
static int binder_last_id;
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
#define BINDER_DEBUG_ENTRY(name) \
|
|
|
|
static int binder_##name##_open(struct inode *inode, struct file *file) \
|
|
|
|
{ \
|
2009-04-29 11:57:50 +08:00
|
|
|
return single_open(file, binder_##name##_show, inode->i_private); \
|
2009-04-29 11:57:50 +08:00
|
|
|
} \
|
|
|
|
\
|
|
|
|
static const struct file_operations binder_##name##_fops = { \
|
|
|
|
.owner = THIS_MODULE, \
|
|
|
|
.open = binder_##name##_open, \
|
|
|
|
.read = seq_read, \
|
|
|
|
.llseek = seq_lseek, \
|
|
|
|
.release = single_release, \
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_proc_show(struct seq_file *m, void *unused);
|
|
|
|
BINDER_DEBUG_ENTRY(proc);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
/* This is only defined in include/asm-arm/sizes.h */
|
|
|
|
#ifndef SZ_1K
|
|
|
|
#define SZ_1K 0x400
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifndef SZ_4M
|
|
|
|
#define SZ_4M 0x400000
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#define FORBIDDEN_MMAP_FLAGS (VM_WRITE)
|
|
|
|
|
|
|
|
#define BINDER_SMALL_BUF_SIZE (PAGE_SIZE * 64)
|
|
|
|
|
|
|
|
enum {
|
|
|
|
BINDER_DEBUG_USER_ERROR = 1U << 0,
|
|
|
|
BINDER_DEBUG_FAILED_TRANSACTION = 1U << 1,
|
|
|
|
BINDER_DEBUG_DEAD_TRANSACTION = 1U << 2,
|
|
|
|
BINDER_DEBUG_OPEN_CLOSE = 1U << 3,
|
|
|
|
BINDER_DEBUG_DEAD_BINDER = 1U << 4,
|
|
|
|
BINDER_DEBUG_DEATH_NOTIFICATION = 1U << 5,
|
|
|
|
BINDER_DEBUG_READ_WRITE = 1U << 6,
|
|
|
|
BINDER_DEBUG_USER_REFS = 1U << 7,
|
|
|
|
BINDER_DEBUG_THREADS = 1U << 8,
|
|
|
|
BINDER_DEBUG_TRANSACTION = 1U << 9,
|
|
|
|
BINDER_DEBUG_TRANSACTION_COMPLETE = 1U << 10,
|
|
|
|
BINDER_DEBUG_FREE_BUFFER = 1U << 11,
|
|
|
|
BINDER_DEBUG_INTERNAL_REFS = 1U << 12,
|
|
|
|
BINDER_DEBUG_BUFFER_ALLOC = 1U << 13,
|
|
|
|
BINDER_DEBUG_PRIORITY_CAP = 1U << 14,
|
|
|
|
BINDER_DEBUG_BUFFER_ALLOC_ASYNC = 1U << 15,
|
|
|
|
};
|
|
|
|
static uint32_t binder_debug_mask = BINDER_DEBUG_USER_ERROR |
|
|
|
|
BINDER_DEBUG_FAILED_TRANSACTION | BINDER_DEBUG_DEAD_TRANSACTION;
|
|
|
|
module_param_named(debug_mask, binder_debug_mask, uint, S_IWUSR | S_IRUGO);
|
|
|
|
|
2012-03-07 10:36:57 +08:00
|
|
|
static bool binder_debug_no_lock;
|
2011-11-30 19:18:14 +08:00
|
|
|
module_param_named(proc_no_lock, binder_debug_no_lock, bool, S_IWUSR | S_IRUGO);
|
|
|
|
|
2017-02-04 06:40:48 +08:00
|
|
|
static char *binder_devices_param = CONFIG_ANDROID_BINDER_DEVICES;
|
|
|
|
module_param_named(devices, binder_devices_param, charp, 0444);
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait);
|
|
|
|
static int binder_stop_on_user_error;
|
|
|
|
|
|
|
|
static int binder_set_stop_on_user_error(const char *val,
|
|
|
|
struct kernel_param *kp)
|
|
|
|
{
|
|
|
|
int ret;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
ret = param_set_int(val, kp);
|
|
|
|
if (binder_stop_on_user_error < 2)
|
|
|
|
wake_up(&binder_user_error_wait);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
module_param_call(stop_on_user_error, binder_set_stop_on_user_error,
|
|
|
|
param_get_int, &binder_stop_on_user_error, S_IWUSR | S_IRUGO);
|
|
|
|
|
|
|
|
#define binder_debug(mask, x...) \
|
|
|
|
do { \
|
|
|
|
if (binder_debug_mask & mask) \
|
2012-06-26 14:00:30 +08:00
|
|
|
pr_info(x); \
|
2011-11-30 19:18:14 +08:00
|
|
|
} while (0)
|
|
|
|
|
|
|
|
#define binder_user_error(x...) \
|
|
|
|
do { \
|
|
|
|
if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) \
|
2012-06-26 14:00:30 +08:00
|
|
|
pr_info(x); \
|
2011-11-30 19:18:14 +08:00
|
|
|
if (binder_stop_on_user_error) \
|
|
|
|
binder_stop_on_user_error = 2; \
|
|
|
|
} while (0)
|
|
|
|
|
2017-02-04 06:40:45 +08:00
|
|
|
#define to_flat_binder_object(hdr) \
|
|
|
|
container_of(hdr, struct flat_binder_object, hdr)
|
|
|
|
|
|
|
|
#define to_binder_fd_object(hdr) container_of(hdr, struct binder_fd_object, hdr)
|
|
|
|
|
2017-02-04 06:40:51 +08:00
|
|
|
#define to_binder_buffer_object(hdr) \
|
|
|
|
container_of(hdr, struct binder_buffer_object, hdr)
|
|
|
|
|
2017-02-04 06:40:52 +08:00
|
|
|
#define to_binder_fd_array_object(hdr) \
|
|
|
|
container_of(hdr, struct binder_fd_array_object, hdr)
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
enum binder_stat_types {
|
|
|
|
BINDER_STAT_PROC,
|
|
|
|
BINDER_STAT_THREAD,
|
|
|
|
BINDER_STAT_NODE,
|
|
|
|
BINDER_STAT_REF,
|
|
|
|
BINDER_STAT_DEATH,
|
|
|
|
BINDER_STAT_TRANSACTION,
|
|
|
|
BINDER_STAT_TRANSACTION_COMPLETE,
|
|
|
|
BINDER_STAT_COUNT
|
|
|
|
};
|
|
|
|
|
|
|
|
struct binder_stats {
|
|
|
|
int br[_IOC_NR(BR_FAILED_REPLY) + 1];
|
2017-02-04 06:40:51 +08:00
|
|
|
int bc[_IOC_NR(BC_REPLY_SG) + 1];
|
2011-11-30 19:18:14 +08:00
|
|
|
int obj_created[BINDER_STAT_COUNT];
|
|
|
|
int obj_deleted[BINDER_STAT_COUNT];
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct binder_stats binder_stats;
|
|
|
|
|
|
|
|
static inline void binder_stats_deleted(enum binder_stat_types type)
|
|
|
|
{
|
|
|
|
binder_stats.obj_deleted[type]++;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void binder_stats_created(enum binder_stat_types type)
|
|
|
|
{
|
|
|
|
binder_stats.obj_created[type]++;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct binder_transaction_log_entry {
|
|
|
|
int debug_id;
|
|
|
|
int call_type;
|
|
|
|
int from_proc;
|
|
|
|
int from_thread;
|
|
|
|
int target_handle;
|
|
|
|
int to_proc;
|
|
|
|
int to_thread;
|
|
|
|
int to_node;
|
|
|
|
int data_size;
|
|
|
|
int offsets_size;
|
2017-02-04 06:40:47 +08:00
|
|
|
const char *context_name;
|
2011-11-30 19:18:14 +08:00
|
|
|
};
|
|
|
|
struct binder_transaction_log {
|
|
|
|
int next;
|
|
|
|
int full;
|
|
|
|
struct binder_transaction_log_entry entry[32];
|
|
|
|
};
|
|
|
|
static struct binder_transaction_log binder_transaction_log;
|
|
|
|
static struct binder_transaction_log binder_transaction_log_failed;
|
|
|
|
|
|
|
|
static struct binder_transaction_log_entry *binder_transaction_log_add(
|
|
|
|
struct binder_transaction_log *log)
|
|
|
|
{
|
|
|
|
struct binder_transaction_log_entry *e;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
e = &log->entry[log->next];
|
|
|
|
memset(e, 0, sizeof(*e));
|
|
|
|
log->next++;
|
|
|
|
if (log->next == ARRAY_SIZE(log->entry)) {
|
|
|
|
log->next = 0;
|
|
|
|
log->full = 1;
|
|
|
|
}
|
|
|
|
return e;
|
|
|
|
}
|
|
|
|
|
2017-02-04 06:40:46 +08:00
|
|
|
struct binder_context {
|
|
|
|
struct binder_node *binder_context_mgr_node;
|
|
|
|
kuid_t binder_context_mgr_uid;
|
2017-02-04 06:40:47 +08:00
|
|
|
const char *name;
|
2017-02-04 06:40:46 +08:00
|
|
|
};
|
|
|
|
|
2017-02-04 06:40:48 +08:00
|
|
|
struct binder_device {
|
|
|
|
struct hlist_node hlist;
|
|
|
|
struct miscdevice miscdev;
|
|
|
|
struct binder_context context;
|
2017-02-04 06:40:46 +08:00
|
|
|
};
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_work {
|
|
|
|
struct list_head entry;
|
|
|
|
enum {
|
|
|
|
BINDER_WORK_TRANSACTION = 1,
|
|
|
|
BINDER_WORK_TRANSACTION_COMPLETE,
|
|
|
|
BINDER_WORK_NODE,
|
|
|
|
BINDER_WORK_DEAD_BINDER,
|
|
|
|
BINDER_WORK_DEAD_BINDER_AND_CLEAR,
|
|
|
|
BINDER_WORK_CLEAR_DEATH_NOTIFICATION,
|
|
|
|
} type;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct binder_node {
|
|
|
|
int debug_id;
|
|
|
|
struct binder_work work;
|
|
|
|
union {
|
|
|
|
struct rb_node rb_node;
|
|
|
|
struct hlist_node dead_node;
|
|
|
|
};
|
|
|
|
struct binder_proc *proc;
|
|
|
|
struct hlist_head refs;
|
|
|
|
int internal_strong_refs;
|
|
|
|
int local_weak_refs;
|
|
|
|
int local_strong_refs;
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t ptr;
|
|
|
|
binder_uintptr_t cookie;
|
2011-11-30 19:18:14 +08:00
|
|
|
unsigned has_strong_ref:1;
|
|
|
|
unsigned pending_strong_ref:1;
|
|
|
|
unsigned has_weak_ref:1;
|
|
|
|
unsigned pending_weak_ref:1;
|
|
|
|
unsigned has_async_transaction:1;
|
|
|
|
unsigned accept_fds:1;
|
|
|
|
unsigned min_priority:8;
|
|
|
|
struct list_head async_todo;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct binder_ref_death {
|
|
|
|
struct binder_work work;
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t cookie;
|
2011-11-30 19:18:14 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
struct binder_ref {
|
|
|
|
/* Lookups needed: */
|
|
|
|
/* node + proc => ref (transaction) */
|
|
|
|
/* desc + proc => ref (transaction, inc/dec ref) */
|
|
|
|
/* node => refs + procs (proc exit) */
|
|
|
|
int debug_id;
|
|
|
|
struct rb_node rb_node_desc;
|
|
|
|
struct rb_node rb_node_node;
|
|
|
|
struct hlist_node node_entry;
|
|
|
|
struct binder_proc *proc;
|
|
|
|
struct binder_node *node;
|
|
|
|
uint32_t desc;
|
|
|
|
int strong;
|
|
|
|
int weak;
|
|
|
|
struct binder_ref_death *death;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct binder_buffer {
|
2012-01-12 22:51:31 +08:00
|
|
|
struct list_head entry; /* free and allocated entries by address */
|
2011-11-30 19:18:14 +08:00
|
|
|
struct rb_node rb_node; /* free entry by size or allocated entry */
|
|
|
|
/* by address */
|
|
|
|
unsigned free:1;
|
|
|
|
unsigned allow_user_free:1;
|
|
|
|
unsigned async_transaction:1;
|
|
|
|
unsigned debug_id:29;
|
|
|
|
|
|
|
|
struct binder_transaction *transaction;
|
|
|
|
|
|
|
|
struct binder_node *target_node;
|
|
|
|
size_t data_size;
|
|
|
|
size_t offsets_size;
|
2017-02-04 06:40:50 +08:00
|
|
|
size_t extra_buffers_size;
|
2011-11-30 19:18:14 +08:00
|
|
|
uint8_t data[0];
|
|
|
|
};
|
|
|
|
|
|
|
|
enum binder_deferred_state {
|
|
|
|
BINDER_DEFERRED_PUT_FILES = 0x01,
|
|
|
|
BINDER_DEFERRED_FLUSH = 0x02,
|
|
|
|
BINDER_DEFERRED_RELEASE = 0x04,
|
|
|
|
};
|
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
/**
|
|
|
|
* struct binder_alloc - per-binder proc state for binder allocator
|
|
|
|
* @vma: vm_area_struct passed to mmap_handler
|
|
|
|
* (invarient after mmap)
|
|
|
|
* @vma_vm_mm: copy of vma->vm_mm (invarient after mmap)
|
|
|
|
* @buffer: base of per-proc address space mapped via mmap
|
|
|
|
* @user_buffer_offset: offset between user and kernel VAs for buffer
|
|
|
|
* @buffers: list of all buffers for this proc
|
|
|
|
* @free_buffers: rb tree of buffers available for allocation
|
|
|
|
* sorted by size
|
|
|
|
* @allocated_buffers: rb tree of allocated buffers sorted by address
|
|
|
|
* @free_async_space: VA space available for async buffers. This is
|
|
|
|
* initialized at mmap time to 1/2 the full VA space
|
|
|
|
* @pages: array of physical page addresses for each page of
|
|
|
|
* mmap'd space
|
|
|
|
* @buffer_size: size of address space (could be less than requested)
|
|
|
|
*
|
|
|
|
* Bookkeeping structure for per-proc address space management for binder
|
|
|
|
* buffers. It is normally initialized during binder_init() and binder_mmap()
|
|
|
|
* calls. The address space is used for both user-visible buffers and for
|
|
|
|
* struct binder_buffer objects used to track the user buffers
|
|
|
|
*/
|
|
|
|
struct binder_alloc {
|
|
|
|
struct vm_area_struct *vma;
|
|
|
|
struct mm_struct *vma_vm_mm;
|
|
|
|
void *buffer;
|
|
|
|
ptrdiff_t user_buffer_offset;
|
|
|
|
struct list_head buffers;
|
|
|
|
struct rb_root free_buffers;
|
|
|
|
struct rb_root allocated_buffers;
|
|
|
|
size_t free_async_space;
|
|
|
|
struct page **pages;
|
|
|
|
size_t buffer_size;
|
|
|
|
};
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_proc {
|
|
|
|
struct hlist_node proc_node;
|
|
|
|
struct rb_root threads;
|
|
|
|
struct rb_root nodes;
|
|
|
|
struct rb_root refs_by_desc;
|
|
|
|
struct rb_root refs_by_node;
|
|
|
|
int pid;
|
|
|
|
struct task_struct *tsk;
|
|
|
|
struct files_struct *files;
|
|
|
|
struct hlist_node deferred_work_node;
|
|
|
|
int deferred_work;
|
|
|
|
|
|
|
|
struct list_head todo;
|
|
|
|
wait_queue_head_t wait;
|
|
|
|
struct binder_stats stats;
|
|
|
|
struct list_head delivered_death;
|
|
|
|
int max_threads;
|
|
|
|
int requested_threads;
|
|
|
|
int requested_threads_started;
|
|
|
|
int ready_threads;
|
|
|
|
long default_priority;
|
2009-04-29 11:57:50 +08:00
|
|
|
struct dentry *debugfs_entry;
|
2017-06-30 03:01:38 +08:00
|
|
|
struct binder_alloc alloc;
|
2017-02-04 06:40:46 +08:00
|
|
|
struct binder_context *context;
|
2011-11-30 19:18:14 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
enum {
|
|
|
|
BINDER_LOOPER_STATE_REGISTERED = 0x01,
|
|
|
|
BINDER_LOOPER_STATE_ENTERED = 0x02,
|
|
|
|
BINDER_LOOPER_STATE_EXITED = 0x04,
|
|
|
|
BINDER_LOOPER_STATE_INVALID = 0x08,
|
|
|
|
BINDER_LOOPER_STATE_WAITING = 0x10,
|
|
|
|
BINDER_LOOPER_STATE_NEED_RETURN = 0x20
|
|
|
|
};
|
|
|
|
|
|
|
|
struct binder_thread {
|
|
|
|
struct binder_proc *proc;
|
|
|
|
struct rb_node rb_node;
|
|
|
|
int pid;
|
|
|
|
int looper;
|
|
|
|
struct binder_transaction *transaction_stack;
|
|
|
|
struct list_head todo;
|
|
|
|
uint32_t return_error; /* Write failed, return error code in read buf */
|
|
|
|
uint32_t return_error2; /* Write failed, return error code in read */
|
|
|
|
/* buffer. Used when sending a reply to a dead process that */
|
|
|
|
/* we are also waiting on */
|
|
|
|
wait_queue_head_t wait;
|
|
|
|
struct binder_stats stats;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct binder_transaction {
|
|
|
|
int debug_id;
|
|
|
|
struct binder_work work;
|
|
|
|
struct binder_thread *from;
|
|
|
|
struct binder_transaction *from_parent;
|
|
|
|
struct binder_proc *to_proc;
|
|
|
|
struct binder_thread *to_thread;
|
|
|
|
struct binder_transaction *to_parent;
|
|
|
|
unsigned need_reply:1;
|
|
|
|
/* unsigned is_dead:1; */ /* not used at the moment */
|
|
|
|
|
|
|
|
struct binder_buffer *buffer;
|
|
|
|
unsigned int code;
|
|
|
|
unsigned int flags;
|
|
|
|
long priority;
|
|
|
|
long saved_priority;
|
2012-05-26 08:34:53 +08:00
|
|
|
kuid_t sender_euid;
|
2011-11-30 19:18:14 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static void
|
|
|
|
binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer);
|
|
|
|
|
2012-08-17 19:09:36 +08:00
|
|
|
static int task_get_unused_fd_flags(struct binder_proc *proc, int flags)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct files_struct *files = proc->files;
|
|
|
|
unsigned long rlim_cur;
|
|
|
|
unsigned long irqs;
|
|
|
|
|
|
|
|
if (files == NULL)
|
|
|
|
return -ESRCH;
|
|
|
|
|
2012-08-13 05:27:30 +08:00
|
|
|
if (!lock_task_sighand(proc->tsk, &irqs))
|
|
|
|
return -EMFILE;
|
2012-08-17 19:09:37 +08:00
|
|
|
|
2012-08-13 05:27:30 +08:00
|
|
|
rlim_cur = task_rlimit(proc->tsk, RLIMIT_NOFILE);
|
|
|
|
unlock_task_sighand(proc->tsk, &irqs);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2012-08-13 05:27:30 +08:00
|
|
|
return __alloc_fd(files, 0, rlim_cur, flags);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* copied from fd_install
|
|
|
|
*/
|
|
|
|
static void task_fd_install(
|
|
|
|
struct binder_proc *proc, unsigned int fd, struct file *file)
|
|
|
|
{
|
2012-08-16 09:06:33 +08:00
|
|
|
if (proc->files)
|
|
|
|
__fd_install(proc->files, fd, file);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* copied from sys_close
|
|
|
|
*/
|
|
|
|
static long task_close_fd(struct binder_proc *proc, unsigned int fd)
|
|
|
|
{
|
|
|
|
int retval;
|
|
|
|
|
2012-08-20 00:04:24 +08:00
|
|
|
if (proc->files == NULL)
|
2011-11-30 19:18:14 +08:00
|
|
|
return -ESRCH;
|
|
|
|
|
2012-08-20 00:04:24 +08:00
|
|
|
retval = __close_fd(proc->files, fd);
|
2011-11-30 19:18:14 +08:00
|
|
|
/* can't restart close syscall because file table entry was cleared */
|
|
|
|
if (unlikely(retval == -ERESTARTSYS ||
|
|
|
|
retval == -ERESTARTNOINTR ||
|
|
|
|
retval == -ERESTARTNOHAND ||
|
|
|
|
retval == -ERESTART_RESTARTBLOCK))
|
|
|
|
retval = -EINTR;
|
|
|
|
|
|
|
|
return retval;
|
|
|
|
}
|
|
|
|
|
2012-10-17 06:29:53 +08:00
|
|
|
static inline void binder_lock(const char *tag)
|
|
|
|
{
|
|
|
|
trace_binder_lock(tag);
|
|
|
|
mutex_lock(&binder_main_lock);
|
|
|
|
trace_binder_locked(tag);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline void binder_unlock(const char *tag)
|
|
|
|
{
|
|
|
|
trace_binder_unlock(tag);
|
|
|
|
mutex_unlock(&binder_main_lock);
|
|
|
|
}
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
static void binder_set_nice(long nice)
|
|
|
|
{
|
|
|
|
long min_nice;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if (can_nice(current, nice)) {
|
|
|
|
set_user_nice(current, nice);
|
|
|
|
return;
|
|
|
|
}
|
2014-05-08 17:33:49 +08:00
|
|
|
min_nice = rlimit_to_nice(current->signal->rlim[RLIMIT_NICE].rlim_cur);
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_debug(BINDER_DEBUG_PRIORITY_CAP,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: nice value %ld not allowed use %ld instead\n",
|
|
|
|
current->pid, nice, min_nice);
|
2011-11-30 19:18:14 +08:00
|
|
|
set_user_nice(current, min_nice);
|
2014-03-11 18:09:12 +08:00
|
|
|
if (min_nice <= MAX_NICE)
|
2011-11-30 19:18:14 +08:00
|
|
|
return;
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d RLIMIT_NICE not set\n", current->pid);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static size_t binder_buffer_size(struct binder_proc *proc,
|
|
|
|
struct binder_buffer *buffer)
|
|
|
|
{
|
2017-06-30 03:01:38 +08:00
|
|
|
if (list_is_last(&buffer->entry, &proc->alloc.buffers))
|
|
|
|
return proc->alloc.buffer +
|
|
|
|
proc->alloc.buffer_size -
|
|
|
|
(void *)buffer->data;
|
2014-06-21 22:53:16 +08:00
|
|
|
return (size_t)list_entry(buffer->entry.next,
|
|
|
|
struct binder_buffer, entry) - (size_t)buffer->data;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_insert_free_buffer(struct binder_proc *proc,
|
|
|
|
struct binder_buffer *new_buffer)
|
|
|
|
{
|
2017-06-30 03:01:38 +08:00
|
|
|
struct rb_node **p = &proc->alloc.free_buffers.rb_node;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct rb_node *parent = NULL;
|
|
|
|
struct binder_buffer *buffer;
|
|
|
|
size_t buffer_size;
|
|
|
|
size_t new_buffer_size;
|
|
|
|
|
|
|
|
BUG_ON(!new_buffer->free);
|
|
|
|
|
|
|
|
new_buffer_size = binder_buffer_size(proc, new_buffer);
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: add free buffer, size %zd, at %p\n",
|
|
|
|
proc->pid, new_buffer_size, new_buffer);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
buffer = rb_entry(parent, struct binder_buffer, rb_node);
|
|
|
|
BUG_ON(!buffer->free);
|
|
|
|
|
|
|
|
buffer_size = binder_buffer_size(proc, buffer);
|
|
|
|
|
|
|
|
if (new_buffer_size < buffer_size)
|
|
|
|
p = &parent->rb_left;
|
|
|
|
else
|
|
|
|
p = &parent->rb_right;
|
|
|
|
}
|
|
|
|
rb_link_node(&new_buffer->rb_node, parent, p);
|
2017-06-30 03:01:38 +08:00
|
|
|
rb_insert_color(&new_buffer->rb_node, &proc->alloc.free_buffers);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_insert_allocated_buffer(struct binder_proc *proc,
|
|
|
|
struct binder_buffer *new_buffer)
|
|
|
|
{
|
2017-06-30 03:01:38 +08:00
|
|
|
struct rb_node **p = &proc->alloc.allocated_buffers.rb_node;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct rb_node *parent = NULL;
|
|
|
|
struct binder_buffer *buffer;
|
|
|
|
|
|
|
|
BUG_ON(new_buffer->free);
|
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
buffer = rb_entry(parent, struct binder_buffer, rb_node);
|
|
|
|
BUG_ON(buffer->free);
|
|
|
|
|
|
|
|
if (new_buffer < buffer)
|
|
|
|
p = &parent->rb_left;
|
|
|
|
else if (new_buffer > buffer)
|
|
|
|
p = &parent->rb_right;
|
|
|
|
else
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
rb_link_node(&new_buffer->rb_node, parent, p);
|
2017-06-30 03:01:38 +08:00
|
|
|
rb_insert_color(&new_buffer->rb_node, &proc->alloc.allocated_buffers);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static struct binder_buffer *binder_buffer_lookup(struct binder_proc *proc,
|
2014-02-22 06:40:26 +08:00
|
|
|
uintptr_t user_ptr)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2017-06-30 03:01:38 +08:00
|
|
|
struct rb_node *n = proc->alloc.allocated_buffers.rb_node;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_buffer *buffer;
|
|
|
|
struct binder_buffer *kern_ptr;
|
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
kern_ptr = (struct binder_buffer *)
|
|
|
|
(user_ptr - proc->alloc.user_buffer_offset -
|
|
|
|
offsetof(struct binder_buffer, data));
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
while (n) {
|
|
|
|
buffer = rb_entry(n, struct binder_buffer, rb_node);
|
|
|
|
BUG_ON(buffer->free);
|
|
|
|
|
|
|
|
if (kern_ptr < buffer)
|
|
|
|
n = n->rb_left;
|
|
|
|
else if (kern_ptr > buffer)
|
|
|
|
n = n->rb_right;
|
|
|
|
else
|
|
|
|
return buffer;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_update_page_range(struct binder_proc *proc, int allocate,
|
|
|
|
void *start, void *end,
|
|
|
|
struct vm_area_struct *vma)
|
|
|
|
{
|
|
|
|
void *page_addr;
|
|
|
|
unsigned long user_page_addr;
|
|
|
|
struct page **page;
|
|
|
|
struct mm_struct *mm;
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: %s pages %p-%p\n", proc->pid,
|
2011-11-30 19:18:14 +08:00
|
|
|
allocate ? "allocate" : "free", start, end);
|
|
|
|
|
|
|
|
if (end <= start)
|
|
|
|
return 0;
|
|
|
|
|
2012-10-17 06:29:53 +08:00
|
|
|
trace_binder_update_page_range(proc, allocate, start, end);
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if (vma)
|
|
|
|
mm = NULL;
|
|
|
|
else
|
|
|
|
mm = get_task_mm(proc->tsk);
|
|
|
|
|
|
|
|
if (mm) {
|
|
|
|
down_write(&mm->mmap_sem);
|
2017-06-30 03:01:38 +08:00
|
|
|
vma = proc->alloc.vma;
|
|
|
|
if (vma && mm != proc->alloc.vma_vm_mm) {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("%d: vma mm and task mm mismatch\n",
|
2012-02-02 07:29:13 +08:00
|
|
|
proc->pid);
|
|
|
|
vma = NULL;
|
|
|
|
}
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
if (allocate == 0)
|
|
|
|
goto free_range;
|
|
|
|
|
|
|
|
if (vma == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("%d: binder_alloc_buf failed to map pages in userspace, no vma\n",
|
|
|
|
proc->pid);
|
2011-11-30 19:18:14 +08:00
|
|
|
goto err_no_vma;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (page_addr = start; page_addr < end; page_addr += PAGE_SIZE) {
|
|
|
|
int ret;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
page = &proc->alloc.pages[
|
|
|
|
(page_addr - proc->alloc.buffer) / PAGE_SIZE];
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
BUG_ON(*page);
|
2012-10-17 06:29:55 +08:00
|
|
|
*page = alloc_page(GFP_KERNEL | __GFP_HIGHMEM | __GFP_ZERO);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (*page == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("%d: binder_alloc_buf failed for page at %p\n",
|
|
|
|
proc->pid, page_addr);
|
2011-11-30 19:18:14 +08:00
|
|
|
goto err_alloc_page_failed;
|
|
|
|
}
|
2015-02-28 01:44:21 +08:00
|
|
|
ret = map_kernel_range_noflush((unsigned long)page_addr,
|
|
|
|
PAGE_SIZE, PAGE_KERNEL, page);
|
|
|
|
flush_cache_vmap((unsigned long)page_addr,
|
|
|
|
(unsigned long)page_addr + PAGE_SIZE);
|
|
|
|
if (ret != 1) {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("%d: binder_alloc_buf failed to map page at %p in kernel\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, page_addr);
|
|
|
|
goto err_map_kernel_failed;
|
|
|
|
}
|
|
|
|
user_page_addr =
|
2017-06-30 03:01:38 +08:00
|
|
|
(uintptr_t)page_addr + proc->alloc.user_buffer_offset;
|
2011-11-30 19:18:14 +08:00
|
|
|
ret = vm_insert_page(vma, user_page_addr, page[0]);
|
|
|
|
if (ret) {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("%d: binder_alloc_buf failed to map page at %lx in userspace\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, user_page_addr);
|
|
|
|
goto err_vm_insert_page_failed;
|
|
|
|
}
|
|
|
|
/* vm_insert_page does not seem to increment the refcount */
|
|
|
|
}
|
|
|
|
if (mm) {
|
|
|
|
up_write(&mm->mmap_sem);
|
|
|
|
mmput(mm);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
free_range:
|
|
|
|
for (page_addr = end - PAGE_SIZE; page_addr >= start;
|
|
|
|
page_addr -= PAGE_SIZE) {
|
2017-06-30 03:01:38 +08:00
|
|
|
page = &proc->alloc.pages[
|
|
|
|
(page_addr - proc->alloc.buffer) / PAGE_SIZE];
|
2011-11-30 19:18:14 +08:00
|
|
|
if (vma)
|
|
|
|
zap_page_range(vma, (uintptr_t)page_addr +
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.user_buffer_offset, PAGE_SIZE);
|
2011-11-30 19:18:14 +08:00
|
|
|
err_vm_insert_page_failed:
|
|
|
|
unmap_kernel_range((unsigned long)page_addr, PAGE_SIZE);
|
|
|
|
err_map_kernel_failed:
|
|
|
|
__free_page(*page);
|
|
|
|
*page = NULL;
|
|
|
|
err_alloc_page_failed:
|
|
|
|
;
|
|
|
|
}
|
|
|
|
err_no_vma:
|
|
|
|
if (mm) {
|
|
|
|
up_write(&mm->mmap_sem);
|
|
|
|
mmput(mm);
|
|
|
|
}
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct binder_buffer *binder_alloc_buf(struct binder_proc *proc,
|
|
|
|
size_t data_size,
|
2017-02-04 06:40:50 +08:00
|
|
|
size_t offsets_size,
|
|
|
|
size_t extra_buffers_size,
|
|
|
|
int is_async)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2017-06-30 03:01:38 +08:00
|
|
|
struct rb_node *n = proc->alloc.free_buffers.rb_node;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_buffer *buffer;
|
|
|
|
size_t buffer_size;
|
|
|
|
struct rb_node *best_fit = NULL;
|
|
|
|
void *has_page_addr;
|
|
|
|
void *end_page_addr;
|
2017-02-04 06:40:50 +08:00
|
|
|
size_t size, data_offsets_size;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
if (proc->alloc.vma == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("%d: binder_alloc_buf, no vma\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2017-02-04 06:40:50 +08:00
|
|
|
data_offsets_size = ALIGN(data_size, sizeof(void *)) +
|
2011-11-30 19:18:14 +08:00
|
|
|
ALIGN(offsets_size, sizeof(void *));
|
|
|
|
|
2017-02-04 06:40:50 +08:00
|
|
|
if (data_offsets_size < data_size || data_offsets_size < offsets_size) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d: got transaction with invalid size %zd-%zd\n",
|
|
|
|
proc->pid, data_size, offsets_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
2017-02-04 06:40:50 +08:00
|
|
|
size = data_offsets_size + ALIGN(extra_buffers_size, sizeof(void *));
|
|
|
|
if (size < data_offsets_size || size < extra_buffers_size) {
|
|
|
|
binder_user_error("%d: got transaction with invalid extra_buffers_size %zd\n",
|
|
|
|
proc->pid, extra_buffers_size);
|
|
|
|
return NULL;
|
|
|
|
}
|
2011-11-30 19:18:14 +08:00
|
|
|
if (is_async &&
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.free_async_space <
|
|
|
|
size + sizeof(struct binder_buffer)) {
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: binder_alloc_buf size %zd failed, no async space left\n",
|
|
|
|
proc->pid, size);
|
2011-11-30 19:18:14 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (n) {
|
|
|
|
buffer = rb_entry(n, struct binder_buffer, rb_node);
|
|
|
|
BUG_ON(!buffer->free);
|
|
|
|
buffer_size = binder_buffer_size(proc, buffer);
|
|
|
|
|
|
|
|
if (size < buffer_size) {
|
|
|
|
best_fit = n;
|
|
|
|
n = n->rb_left;
|
|
|
|
} else if (size > buffer_size)
|
|
|
|
n = n->rb_right;
|
|
|
|
else {
|
|
|
|
best_fit = n;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (best_fit == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("%d: binder_alloc_buf size %zd failed, no address space\n",
|
|
|
|
proc->pid, size);
|
2011-11-30 19:18:14 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
if (n == NULL) {
|
|
|
|
buffer = rb_entry(best_fit, struct binder_buffer, rb_node);
|
|
|
|
buffer_size = binder_buffer_size(proc, buffer);
|
|
|
|
}
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: binder_alloc_buf size %zd got buffer %p size %zd\n",
|
|
|
|
proc->pid, size, buffer, buffer_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
has_page_addr =
|
|
|
|
(void *)(((uintptr_t)buffer->data + buffer_size) & PAGE_MASK);
|
|
|
|
if (n == NULL) {
|
|
|
|
if (size + sizeof(struct binder_buffer) + 4 >= buffer_size)
|
|
|
|
buffer_size = size; /* no room for other buffers */
|
|
|
|
else
|
|
|
|
buffer_size = size + sizeof(struct binder_buffer);
|
|
|
|
}
|
|
|
|
end_page_addr =
|
|
|
|
(void *)PAGE_ALIGN((uintptr_t)buffer->data + buffer_size);
|
|
|
|
if (end_page_addr > has_page_addr)
|
|
|
|
end_page_addr = has_page_addr;
|
|
|
|
if (binder_update_page_range(proc, 1,
|
|
|
|
(void *)PAGE_ALIGN((uintptr_t)buffer->data), end_page_addr, NULL))
|
|
|
|
return NULL;
|
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
rb_erase(best_fit, &proc->alloc.free_buffers);
|
2011-11-30 19:18:14 +08:00
|
|
|
buffer->free = 0;
|
|
|
|
binder_insert_allocated_buffer(proc, buffer);
|
|
|
|
if (buffer_size != size) {
|
|
|
|
struct binder_buffer *new_buffer = (void *)buffer->data + size;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
list_add(&new_buffer->entry, &buffer->entry);
|
|
|
|
new_buffer->free = 1;
|
|
|
|
binder_insert_free_buffer(proc, new_buffer);
|
|
|
|
}
|
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: binder_alloc_buf size %zd got %p\n",
|
|
|
|
proc->pid, size, buffer);
|
2011-11-30 19:18:14 +08:00
|
|
|
buffer->data_size = data_size;
|
|
|
|
buffer->offsets_size = offsets_size;
|
2017-02-04 06:40:50 +08:00
|
|
|
buffer->extra_buffers_size = extra_buffers_size;
|
2011-11-30 19:18:14 +08:00
|
|
|
buffer->async_transaction = is_async;
|
|
|
|
if (is_async) {
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.free_async_space -=
|
|
|
|
size + sizeof(struct binder_buffer);
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC_ASYNC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: binder_alloc_buf size %zd async free %zd\n",
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->pid, size, proc->alloc.free_async_space);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return buffer;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *buffer_start_page(struct binder_buffer *buffer)
|
|
|
|
{
|
|
|
|
return (void *)((uintptr_t)buffer & PAGE_MASK);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *buffer_end_page(struct binder_buffer *buffer)
|
|
|
|
{
|
|
|
|
return (void *)(((uintptr_t)(buffer + 1) - 1) & PAGE_MASK);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_delete_free_buffer(struct binder_proc *proc,
|
|
|
|
struct binder_buffer *buffer)
|
|
|
|
{
|
|
|
|
struct binder_buffer *prev, *next = NULL;
|
|
|
|
int free_page_end = 1;
|
|
|
|
int free_page_start = 1;
|
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
BUG_ON(proc->alloc.buffers.next == &buffer->entry);
|
2011-11-30 19:18:14 +08:00
|
|
|
prev = list_entry(buffer->entry.prev, struct binder_buffer, entry);
|
|
|
|
BUG_ON(!prev->free);
|
|
|
|
if (buffer_end_page(prev) == buffer_start_page(buffer)) {
|
|
|
|
free_page_start = 0;
|
|
|
|
if (buffer_end_page(prev) == buffer_end_page(buffer))
|
|
|
|
free_page_end = 0;
|
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: merge free, buffer %p share page with %p\n",
|
|
|
|
proc->pid, buffer, prev);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
if (!list_is_last(&buffer->entry, &proc->alloc.buffers)) {
|
2011-11-30 19:18:14 +08:00
|
|
|
next = list_entry(buffer->entry.next,
|
|
|
|
struct binder_buffer, entry);
|
|
|
|
if (buffer_start_page(next) == buffer_end_page(buffer)) {
|
|
|
|
free_page_end = 0;
|
|
|
|
if (buffer_start_page(next) ==
|
|
|
|
buffer_start_page(buffer))
|
|
|
|
free_page_start = 0;
|
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: merge free, buffer %p share page with %p\n",
|
|
|
|
proc->pid, buffer, prev);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
list_del(&buffer->entry);
|
|
|
|
if (free_page_start || free_page_end) {
|
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2013-06-23 22:47:15 +08:00
|
|
|
"%d: merge free, buffer %p do not share page%s%s with %p or %p\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, buffer, free_page_start ? "" : " end",
|
|
|
|
free_page_end ? "" : " start", prev, next);
|
|
|
|
binder_update_page_range(proc, 0, free_page_start ?
|
|
|
|
buffer_start_page(buffer) : buffer_end_page(buffer),
|
|
|
|
(free_page_end ? buffer_end_page(buffer) :
|
|
|
|
buffer_start_page(buffer)) + PAGE_SIZE, NULL);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_free_buf(struct binder_proc *proc,
|
|
|
|
struct binder_buffer *buffer)
|
|
|
|
{
|
|
|
|
size_t size, buffer_size;
|
|
|
|
|
|
|
|
buffer_size = binder_buffer_size(proc, buffer);
|
|
|
|
|
|
|
|
size = ALIGN(buffer->data_size, sizeof(void *)) +
|
2017-02-04 06:40:50 +08:00
|
|
|
ALIGN(buffer->offsets_size, sizeof(void *)) +
|
|
|
|
ALIGN(buffer->extra_buffers_size, sizeof(void *));
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: binder_free_buf %p size %zd buffer_size %zd\n",
|
|
|
|
proc->pid, buffer, size, buffer_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
BUG_ON(buffer->free);
|
|
|
|
BUG_ON(size > buffer_size);
|
|
|
|
BUG_ON(buffer->transaction != NULL);
|
2017-06-30 03:01:38 +08:00
|
|
|
BUG_ON((void *)buffer < proc->alloc.buffer);
|
|
|
|
BUG_ON((void *)buffer > proc->alloc.buffer + proc->alloc.buffer_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
if (buffer->async_transaction) {
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.free_async_space +=
|
|
|
|
size + sizeof(struct binder_buffer);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC_ASYNC,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d: binder_free_buf size %zd async free %zd\n",
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->pid, size, proc->alloc.free_async_space);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
binder_update_page_range(proc, 0,
|
|
|
|
(void *)PAGE_ALIGN((uintptr_t)buffer->data),
|
|
|
|
(void *)(((uintptr_t)buffer->data + buffer_size) & PAGE_MASK),
|
|
|
|
NULL);
|
2017-06-30 03:01:38 +08:00
|
|
|
rb_erase(&buffer->rb_node, &proc->alloc.allocated_buffers);
|
2011-11-30 19:18:14 +08:00
|
|
|
buffer->free = 1;
|
2017-06-30 03:01:38 +08:00
|
|
|
if (!list_is_last(&buffer->entry, &proc->alloc.buffers)) {
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_buffer *next = list_entry(buffer->entry.next,
|
|
|
|
struct binder_buffer, entry);
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if (next->free) {
|
2017-06-30 03:01:38 +08:00
|
|
|
rb_erase(&next->rb_node, &proc->alloc.free_buffers);
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_delete_free_buffer(proc, next);
|
|
|
|
}
|
|
|
|
}
|
2017-06-30 03:01:38 +08:00
|
|
|
if (proc->alloc.buffers.next != &buffer->entry) {
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_buffer *prev = list_entry(buffer->entry.prev,
|
|
|
|
struct binder_buffer, entry);
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if (prev->free) {
|
|
|
|
binder_delete_free_buffer(proc, buffer);
|
2017-06-30 03:01:38 +08:00
|
|
|
rb_erase(&prev->rb_node, &proc->alloc.free_buffers);
|
2011-11-30 19:18:14 +08:00
|
|
|
buffer = prev;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
binder_insert_free_buffer(proc, buffer);
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct binder_node *binder_get_node(struct binder_proc *proc,
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t ptr)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct rb_node *n = proc->nodes.rb_node;
|
|
|
|
struct binder_node *node;
|
|
|
|
|
|
|
|
while (n) {
|
|
|
|
node = rb_entry(n, struct binder_node, rb_node);
|
|
|
|
|
|
|
|
if (ptr < node->ptr)
|
|
|
|
n = n->rb_left;
|
|
|
|
else if (ptr > node->ptr)
|
|
|
|
n = n->rb_right;
|
|
|
|
else
|
|
|
|
return node;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct binder_node *binder_new_node(struct binder_proc *proc,
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t ptr,
|
|
|
|
binder_uintptr_t cookie)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct rb_node **p = &proc->nodes.rb_node;
|
|
|
|
struct rb_node *parent = NULL;
|
|
|
|
struct binder_node *node;
|
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
node = rb_entry(parent, struct binder_node, rb_node);
|
|
|
|
|
|
|
|
if (ptr < node->ptr)
|
|
|
|
p = &(*p)->rb_left;
|
|
|
|
else if (ptr > node->ptr)
|
|
|
|
p = &(*p)->rb_right;
|
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
node = kzalloc(sizeof(*node), GFP_KERNEL);
|
|
|
|
if (node == NULL)
|
|
|
|
return NULL;
|
|
|
|
binder_stats_created(BINDER_STAT_NODE);
|
|
|
|
rb_link_node(&node->rb_node, parent, p);
|
|
|
|
rb_insert_color(&node->rb_node, &proc->nodes);
|
|
|
|
node->debug_id = ++binder_last_id;
|
|
|
|
node->proc = proc;
|
|
|
|
node->ptr = ptr;
|
|
|
|
node->cookie = cookie;
|
|
|
|
node->work.type = BINDER_WORK_NODE;
|
|
|
|
INIT_LIST_HEAD(&node->work.entry);
|
|
|
|
INIT_LIST_HEAD(&node->async_todo);
|
|
|
|
binder_debug(BINDER_DEBUG_INTERNAL_REFS,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d node %d u%016llx c%016llx created\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, current->pid, node->debug_id,
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)node->ptr, (u64)node->cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
return node;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_inc_node(struct binder_node *node, int strong, int internal,
|
|
|
|
struct list_head *target_list)
|
|
|
|
{
|
|
|
|
if (strong) {
|
|
|
|
if (internal) {
|
|
|
|
if (target_list == NULL &&
|
|
|
|
node->internal_strong_refs == 0 &&
|
2017-02-04 06:40:46 +08:00
|
|
|
!(node->proc &&
|
|
|
|
node == node->proc->context->binder_context_mgr_node &&
|
|
|
|
node->has_strong_ref)) {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("invalid inc strong node for %d\n",
|
|
|
|
node->debug_id);
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
node->internal_strong_refs++;
|
|
|
|
} else
|
|
|
|
node->local_strong_refs++;
|
|
|
|
if (!node->has_strong_ref && target_list) {
|
|
|
|
list_del_init(&node->work.entry);
|
|
|
|
list_add_tail(&node->work.entry, target_list);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (!internal)
|
|
|
|
node->local_weak_refs++;
|
|
|
|
if (!node->has_weak_ref && list_empty(&node->work.entry)) {
|
|
|
|
if (target_list == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("invalid inc weak node for %d\n",
|
|
|
|
node->debug_id);
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
list_add_tail(&node->work.entry, target_list);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_dec_node(struct binder_node *node, int strong, int internal)
|
|
|
|
{
|
|
|
|
if (strong) {
|
|
|
|
if (internal)
|
|
|
|
node->internal_strong_refs--;
|
|
|
|
else
|
|
|
|
node->local_strong_refs--;
|
|
|
|
if (node->local_strong_refs || node->internal_strong_refs)
|
|
|
|
return 0;
|
|
|
|
} else {
|
|
|
|
if (!internal)
|
|
|
|
node->local_weak_refs--;
|
|
|
|
if (node->local_weak_refs || !hlist_empty(&node->refs))
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (node->proc && (node->has_strong_ref || node->has_weak_ref)) {
|
|
|
|
if (list_empty(&node->work.entry)) {
|
|
|
|
list_add_tail(&node->work.entry, &node->proc->todo);
|
|
|
|
wake_up_interruptible(&node->proc->wait);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (hlist_empty(&node->refs) && !node->local_strong_refs &&
|
|
|
|
!node->local_weak_refs) {
|
|
|
|
list_del_init(&node->work.entry);
|
|
|
|
if (node->proc) {
|
|
|
|
rb_erase(&node->rb_node, &node->proc->nodes);
|
|
|
|
binder_debug(BINDER_DEBUG_INTERNAL_REFS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"refless node %d deleted\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
node->debug_id);
|
|
|
|
} else {
|
|
|
|
hlist_del(&node->dead_node);
|
|
|
|
binder_debug(BINDER_DEBUG_INTERNAL_REFS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"dead node %d deleted\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
node->debug_id);
|
|
|
|
}
|
|
|
|
kfree(node);
|
|
|
|
binder_stats_deleted(BINDER_STAT_NODE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static struct binder_ref *binder_get_ref(struct binder_proc *proc,
|
2016-10-24 21:20:29 +08:00
|
|
|
u32 desc, bool need_strong_ref)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct rb_node *n = proc->refs_by_desc.rb_node;
|
|
|
|
struct binder_ref *ref;
|
|
|
|
|
|
|
|
while (n) {
|
|
|
|
ref = rb_entry(n, struct binder_ref, rb_node_desc);
|
|
|
|
|
2016-10-24 21:20:29 +08:00
|
|
|
if (desc < ref->desc) {
|
2011-11-30 19:18:14 +08:00
|
|
|
n = n->rb_left;
|
2016-10-24 21:20:29 +08:00
|
|
|
} else if (desc > ref->desc) {
|
2011-11-30 19:18:14 +08:00
|
|
|
n = n->rb_right;
|
2016-10-24 21:20:29 +08:00
|
|
|
} else if (need_strong_ref && !ref->strong) {
|
|
|
|
binder_user_error("tried to use weak ref as strong ref\n");
|
|
|
|
return NULL;
|
|
|
|
} else {
|
2011-11-30 19:18:14 +08:00
|
|
|
return ref;
|
2016-10-24 21:20:29 +08:00
|
|
|
}
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct binder_ref *binder_get_ref_for_node(struct binder_proc *proc,
|
|
|
|
struct binder_node *node)
|
|
|
|
{
|
|
|
|
struct rb_node *n;
|
|
|
|
struct rb_node **p = &proc->refs_by_node.rb_node;
|
|
|
|
struct rb_node *parent = NULL;
|
|
|
|
struct binder_ref *ref, *new_ref;
|
2017-02-04 06:40:46 +08:00
|
|
|
struct binder_context *context = proc->context;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
ref = rb_entry(parent, struct binder_ref, rb_node_node);
|
|
|
|
|
|
|
|
if (node < ref->node)
|
|
|
|
p = &(*p)->rb_left;
|
|
|
|
else if (node > ref->node)
|
|
|
|
p = &(*p)->rb_right;
|
|
|
|
else
|
|
|
|
return ref;
|
|
|
|
}
|
|
|
|
new_ref = kzalloc(sizeof(*ref), GFP_KERNEL);
|
|
|
|
if (new_ref == NULL)
|
|
|
|
return NULL;
|
|
|
|
binder_stats_created(BINDER_STAT_REF);
|
|
|
|
new_ref->debug_id = ++binder_last_id;
|
|
|
|
new_ref->proc = proc;
|
|
|
|
new_ref->node = node;
|
|
|
|
rb_link_node(&new_ref->rb_node_node, parent, p);
|
|
|
|
rb_insert_color(&new_ref->rb_node_node, &proc->refs_by_node);
|
|
|
|
|
2017-02-04 06:40:46 +08:00
|
|
|
new_ref->desc = (node == context->binder_context_mgr_node) ? 0 : 1;
|
2011-11-30 19:18:14 +08:00
|
|
|
for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
|
|
|
|
ref = rb_entry(n, struct binder_ref, rb_node_desc);
|
|
|
|
if (ref->desc > new_ref->desc)
|
|
|
|
break;
|
|
|
|
new_ref->desc = ref->desc + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
p = &proc->refs_by_desc.rb_node;
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
ref = rb_entry(parent, struct binder_ref, rb_node_desc);
|
|
|
|
|
|
|
|
if (new_ref->desc < ref->desc)
|
|
|
|
p = &(*p)->rb_left;
|
|
|
|
else if (new_ref->desc > ref->desc)
|
|
|
|
p = &(*p)->rb_right;
|
|
|
|
else
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
rb_link_node(&new_ref->rb_node_desc, parent, p);
|
|
|
|
rb_insert_color(&new_ref->rb_node_desc, &proc->refs_by_desc);
|
|
|
|
if (node) {
|
|
|
|
hlist_add_head(&new_ref->node_entry, &node->refs);
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_INTERNAL_REFS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d new ref %d desc %d for node %d\n",
|
|
|
|
proc->pid, new_ref->debug_id, new_ref->desc,
|
|
|
|
node->debug_id);
|
2011-11-30 19:18:14 +08:00
|
|
|
} else {
|
|
|
|
binder_debug(BINDER_DEBUG_INTERNAL_REFS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d new ref %d desc %d for dead node\n",
|
|
|
|
proc->pid, new_ref->debug_id, new_ref->desc);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
return new_ref;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_delete_ref(struct binder_ref *ref)
|
|
|
|
{
|
|
|
|
binder_debug(BINDER_DEBUG_INTERNAL_REFS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d delete ref %d desc %d for node %d\n",
|
|
|
|
ref->proc->pid, ref->debug_id, ref->desc,
|
|
|
|
ref->node->debug_id);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
rb_erase(&ref->rb_node_desc, &ref->proc->refs_by_desc);
|
|
|
|
rb_erase(&ref->rb_node_node, &ref->proc->refs_by_node);
|
|
|
|
if (ref->strong)
|
|
|
|
binder_dec_node(ref->node, 1, 1);
|
|
|
|
hlist_del(&ref->node_entry);
|
|
|
|
binder_dec_node(ref->node, 0, 1);
|
|
|
|
if (ref->death) {
|
|
|
|
binder_debug(BINDER_DEBUG_DEAD_BINDER,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d delete ref %d desc %d has death notification\n",
|
|
|
|
ref->proc->pid, ref->debug_id, ref->desc);
|
2011-11-30 19:18:14 +08:00
|
|
|
list_del(&ref->death->work.entry);
|
|
|
|
kfree(ref->death);
|
|
|
|
binder_stats_deleted(BINDER_STAT_DEATH);
|
|
|
|
}
|
|
|
|
kfree(ref);
|
|
|
|
binder_stats_deleted(BINDER_STAT_REF);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_inc_ref(struct binder_ref *ref, int strong,
|
|
|
|
struct list_head *target_list)
|
|
|
|
{
|
|
|
|
int ret;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if (strong) {
|
|
|
|
if (ref->strong == 0) {
|
|
|
|
ret = binder_inc_node(ref->node, 1, 1, target_list);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
ref->strong++;
|
|
|
|
} else {
|
|
|
|
if (ref->weak == 0) {
|
|
|
|
ret = binder_inc_node(ref->node, 0, 1, target_list);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
ref->weak++;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static int binder_dec_ref(struct binder_ref *ref, int strong)
|
|
|
|
{
|
|
|
|
if (strong) {
|
|
|
|
if (ref->strong == 0) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
ref->proc->pid, ref->debug_id,
|
|
|
|
ref->desc, ref->strong, ref->weak);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
ref->strong--;
|
|
|
|
if (ref->strong == 0) {
|
|
|
|
int ret;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
ret = binder_dec_node(ref->node, strong, 1);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (ref->weak == 0) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
ref->proc->pid, ref->debug_id,
|
|
|
|
ref->desc, ref->strong, ref->weak);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
ref->weak--;
|
|
|
|
}
|
|
|
|
if (ref->strong == 0 && ref->weak == 0)
|
|
|
|
binder_delete_ref(ref);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_pop_transaction(struct binder_thread *target_thread,
|
|
|
|
struct binder_transaction *t)
|
|
|
|
{
|
|
|
|
if (target_thread) {
|
|
|
|
BUG_ON(target_thread->transaction_stack != t);
|
|
|
|
BUG_ON(target_thread->transaction_stack->from != target_thread);
|
|
|
|
target_thread->transaction_stack =
|
|
|
|
target_thread->transaction_stack->from_parent;
|
|
|
|
t->from = NULL;
|
|
|
|
}
|
|
|
|
t->need_reply = 0;
|
|
|
|
if (t->buffer)
|
|
|
|
t->buffer->transaction = NULL;
|
|
|
|
kfree(t);
|
|
|
|
binder_stats_deleted(BINDER_STAT_TRANSACTION);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_send_failed_reply(struct binder_transaction *t,
|
|
|
|
uint32_t error_code)
|
|
|
|
{
|
|
|
|
struct binder_thread *target_thread;
|
2014-07-14 08:31:05 +08:00
|
|
|
struct binder_transaction *next;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
BUG_ON(t->flags & TF_ONE_WAY);
|
|
|
|
while (1) {
|
|
|
|
target_thread = t->from;
|
|
|
|
if (target_thread) {
|
|
|
|
if (target_thread->return_error != BR_OK &&
|
|
|
|
target_thread->return_error2 == BR_OK) {
|
|
|
|
target_thread->return_error2 =
|
|
|
|
target_thread->return_error;
|
|
|
|
target_thread->return_error = BR_OK;
|
|
|
|
}
|
|
|
|
if (target_thread->return_error == BR_OK) {
|
|
|
|
binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
|
2012-10-31 01:05:43 +08:00
|
|
|
"send failed reply for transaction %d to %d:%d\n",
|
2014-09-04 11:44:03 +08:00
|
|
|
t->debug_id,
|
|
|
|
target_thread->proc->pid,
|
2011-11-30 19:18:14 +08:00
|
|
|
target_thread->pid);
|
|
|
|
|
|
|
|
binder_pop_transaction(target_thread, t);
|
|
|
|
target_thread->return_error = error_code;
|
|
|
|
wake_up_interruptible(&target_thread->wait);
|
|
|
|
} else {
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("reply failed, target thread, %d:%d, has error code %d already\n",
|
|
|
|
target_thread->proc->pid,
|
2011-11-30 19:18:14 +08:00
|
|
|
target_thread->pid,
|
|
|
|
target_thread->return_error);
|
|
|
|
}
|
|
|
|
return;
|
2014-07-14 08:31:05 +08:00
|
|
|
}
|
|
|
|
next = t->from_parent;
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
|
|
|
|
"send failed reply for transaction %d, target dead\n",
|
|
|
|
t->debug_id);
|
|
|
|
|
|
|
|
binder_pop_transaction(target_thread, t);
|
|
|
|
if (next == NULL) {
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_debug(BINDER_DEBUG_DEAD_BINDER,
|
2014-07-14 08:31:05 +08:00
|
|
|
"reply failed, no target thread at root\n");
|
|
|
|
return;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2014-07-14 08:31:05 +08:00
|
|
|
t = next;
|
|
|
|
binder_debug(BINDER_DEBUG_DEAD_BINDER,
|
|
|
|
"reply failed, no target thread -- retry %d\n",
|
|
|
|
t->debug_id);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-02-04 06:40:45 +08:00
|
|
|
/**
|
|
|
|
* binder_validate_object() - checks for a valid metadata object in a buffer.
|
|
|
|
* @buffer: binder_buffer that we're parsing.
|
|
|
|
* @offset: offset in the buffer at which to validate an object.
|
|
|
|
*
|
|
|
|
* Return: If there's a valid metadata object at @offset in @buffer, the
|
|
|
|
* size of that object. Otherwise, it returns zero.
|
|
|
|
*/
|
|
|
|
static size_t binder_validate_object(struct binder_buffer *buffer, u64 offset)
|
|
|
|
{
|
|
|
|
/* Check if we can read a header first */
|
|
|
|
struct binder_object_header *hdr;
|
|
|
|
size_t object_size = 0;
|
|
|
|
|
|
|
|
if (offset > buffer->data_size - sizeof(*hdr) ||
|
|
|
|
buffer->data_size < sizeof(*hdr) ||
|
|
|
|
!IS_ALIGNED(offset, sizeof(u32)))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* Ok, now see if we can read a complete object. */
|
|
|
|
hdr = (struct binder_object_header *)(buffer->data + offset);
|
|
|
|
switch (hdr->type) {
|
|
|
|
case BINDER_TYPE_BINDER:
|
|
|
|
case BINDER_TYPE_WEAK_BINDER:
|
|
|
|
case BINDER_TYPE_HANDLE:
|
|
|
|
case BINDER_TYPE_WEAK_HANDLE:
|
|
|
|
object_size = sizeof(struct flat_binder_object);
|
|
|
|
break;
|
|
|
|
case BINDER_TYPE_FD:
|
|
|
|
object_size = sizeof(struct binder_fd_object);
|
|
|
|
break;
|
2017-02-04 06:40:51 +08:00
|
|
|
case BINDER_TYPE_PTR:
|
|
|
|
object_size = sizeof(struct binder_buffer_object);
|
|
|
|
break;
|
2017-02-04 06:40:52 +08:00
|
|
|
case BINDER_TYPE_FDA:
|
|
|
|
object_size = sizeof(struct binder_fd_array_object);
|
|
|
|
break;
|
2017-02-04 06:40:45 +08:00
|
|
|
default:
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (offset <= buffer->data_size - object_size &&
|
|
|
|
buffer->data_size >= object_size)
|
|
|
|
return object_size;
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-02-04 06:40:51 +08:00
|
|
|
/**
|
|
|
|
* binder_validate_ptr() - validates binder_buffer_object in a binder_buffer.
|
|
|
|
* @b: binder_buffer containing the object
|
|
|
|
* @index: index in offset array at which the binder_buffer_object is
|
|
|
|
* located
|
|
|
|
* @start: points to the start of the offset array
|
|
|
|
* @num_valid: the number of valid offsets in the offset array
|
|
|
|
*
|
|
|
|
* Return: If @index is within the valid range of the offset array
|
|
|
|
* described by @start and @num_valid, and if there's a valid
|
|
|
|
* binder_buffer_object at the offset found in index @index
|
|
|
|
* of the offset array, that object is returned. Otherwise,
|
|
|
|
* %NULL is returned.
|
|
|
|
* Note that the offset found in index @index itself is not
|
|
|
|
* verified; this function assumes that @num_valid elements
|
|
|
|
* from @start were previously verified to have valid offsets.
|
|
|
|
*/
|
|
|
|
static struct binder_buffer_object *binder_validate_ptr(struct binder_buffer *b,
|
|
|
|
binder_size_t index,
|
|
|
|
binder_size_t *start,
|
|
|
|
binder_size_t num_valid)
|
|
|
|
{
|
|
|
|
struct binder_buffer_object *buffer_obj;
|
|
|
|
binder_size_t *offp;
|
|
|
|
|
|
|
|
if (index >= num_valid)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
offp = start + index;
|
|
|
|
buffer_obj = (struct binder_buffer_object *)(b->data + *offp);
|
|
|
|
if (buffer_obj->hdr.type != BINDER_TYPE_PTR)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
return buffer_obj;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* binder_validate_fixup() - validates pointer/fd fixups happen in order.
|
|
|
|
* @b: transaction buffer
|
|
|
|
* @objects_start start of objects buffer
|
|
|
|
* @buffer: binder_buffer_object in which to fix up
|
|
|
|
* @offset: start offset in @buffer to fix up
|
|
|
|
* @last_obj: last binder_buffer_object that we fixed up in
|
|
|
|
* @last_min_offset: minimum fixup offset in @last_obj
|
|
|
|
*
|
|
|
|
* Return: %true if a fixup in buffer @buffer at offset @offset is
|
|
|
|
* allowed.
|
|
|
|
*
|
|
|
|
* For safety reasons, we only allow fixups inside a buffer to happen
|
|
|
|
* at increasing offsets; additionally, we only allow fixup on the last
|
|
|
|
* buffer object that was verified, or one of its parents.
|
|
|
|
*
|
|
|
|
* Example of what is allowed:
|
|
|
|
*
|
|
|
|
* A
|
|
|
|
* B (parent = A, offset = 0)
|
|
|
|
* C (parent = A, offset = 16)
|
|
|
|
* D (parent = C, offset = 0)
|
|
|
|
* E (parent = A, offset = 32) // min_offset is 16 (C.parent_offset)
|
|
|
|
*
|
|
|
|
* Examples of what is not allowed:
|
|
|
|
*
|
|
|
|
* Decreasing offsets within the same parent:
|
|
|
|
* A
|
|
|
|
* C (parent = A, offset = 16)
|
|
|
|
* B (parent = A, offset = 0) // decreasing offset within A
|
|
|
|
*
|
|
|
|
* Referring to a parent that wasn't the last object or any of its parents:
|
|
|
|
* A
|
|
|
|
* B (parent = A, offset = 0)
|
|
|
|
* C (parent = A, offset = 0)
|
|
|
|
* C (parent = A, offset = 16)
|
|
|
|
* D (parent = B, offset = 0) // B is not A or any of A's parents
|
|
|
|
*/
|
|
|
|
static bool binder_validate_fixup(struct binder_buffer *b,
|
|
|
|
binder_size_t *objects_start,
|
|
|
|
struct binder_buffer_object *buffer,
|
|
|
|
binder_size_t fixup_offset,
|
|
|
|
struct binder_buffer_object *last_obj,
|
|
|
|
binder_size_t last_min_offset)
|
|
|
|
{
|
|
|
|
if (!last_obj) {
|
|
|
|
/* Nothing to fix up in */
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
while (last_obj != buffer) {
|
|
|
|
/*
|
|
|
|
* Safe to retrieve the parent of last_obj, since it
|
|
|
|
* was already previously verified by the driver.
|
|
|
|
*/
|
|
|
|
if ((last_obj->flags & BINDER_BUFFER_FLAG_HAS_PARENT) == 0)
|
|
|
|
return false;
|
|
|
|
last_min_offset = last_obj->parent_offset + sizeof(uintptr_t);
|
|
|
|
last_obj = (struct binder_buffer_object *)
|
|
|
|
(b->data + *(objects_start + last_obj->parent));
|
|
|
|
}
|
|
|
|
return (fixup_offset >= last_min_offset);
|
|
|
|
}
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
static void binder_transaction_buffer_release(struct binder_proc *proc,
|
|
|
|
struct binder_buffer *buffer,
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_size_t *failed_at)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2017-02-04 06:40:51 +08:00
|
|
|
binder_size_t *offp, *off_start, *off_end;
|
2011-11-30 19:18:14 +08:00
|
|
|
int debug_id = buffer->debug_id;
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d buffer release %d, size %zd-%zd, failed at %p\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, buffer->debug_id,
|
|
|
|
buffer->data_size, buffer->offsets_size, failed_at);
|
|
|
|
|
|
|
|
if (buffer->target_node)
|
|
|
|
binder_dec_node(buffer->target_node, 1, 0);
|
|
|
|
|
2017-02-04 06:40:51 +08:00
|
|
|
off_start = (binder_size_t *)(buffer->data +
|
|
|
|
ALIGN(buffer->data_size, sizeof(void *)));
|
2011-11-30 19:18:14 +08:00
|
|
|
if (failed_at)
|
|
|
|
off_end = failed_at;
|
|
|
|
else
|
2017-02-04 06:40:51 +08:00
|
|
|
off_end = (void *)off_start + buffer->offsets_size;
|
|
|
|
for (offp = off_start; offp < off_end; offp++) {
|
2017-02-04 06:40:45 +08:00
|
|
|
struct binder_object_header *hdr;
|
|
|
|
size_t object_size = binder_validate_object(buffer, *offp);
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2017-02-04 06:40:45 +08:00
|
|
|
if (object_size == 0) {
|
|
|
|
pr_err("transaction release %d bad object at offset %lld, size %zd\n",
|
2014-02-22 06:40:26 +08:00
|
|
|
debug_id, (u64)*offp, buffer->data_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
continue;
|
|
|
|
}
|
2017-02-04 06:40:45 +08:00
|
|
|
hdr = (struct binder_object_header *)(buffer->data + *offp);
|
|
|
|
switch (hdr->type) {
|
2011-11-30 19:18:14 +08:00
|
|
|
case BINDER_TYPE_BINDER:
|
|
|
|
case BINDER_TYPE_WEAK_BINDER: {
|
2017-02-04 06:40:45 +08:00
|
|
|
struct flat_binder_object *fp;
|
|
|
|
struct binder_node *node;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2017-02-04 06:40:45 +08:00
|
|
|
fp = to_flat_binder_object(hdr);
|
|
|
|
node = binder_get_node(proc, fp->binder);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (node == NULL) {
|
2014-02-22 06:40:26 +08:00
|
|
|
pr_err("transaction release %d bad node %016llx\n",
|
|
|
|
debug_id, (u64)fp->binder);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
2014-02-22 06:40:26 +08:00
|
|
|
" node %d u%016llx\n",
|
|
|
|
node->debug_id, (u64)node->ptr);
|
2017-02-04 06:40:45 +08:00
|
|
|
binder_dec_node(node, hdr->type == BINDER_TYPE_BINDER,
|
|
|
|
0);
|
2011-11-30 19:18:14 +08:00
|
|
|
} break;
|
|
|
|
case BINDER_TYPE_HANDLE:
|
|
|
|
case BINDER_TYPE_WEAK_HANDLE: {
|
2017-02-04 06:40:45 +08:00
|
|
|
struct flat_binder_object *fp;
|
2016-10-24 21:20:29 +08:00
|
|
|
struct binder_ref *ref;
|
|
|
|
|
2017-02-04 06:40:45 +08:00
|
|
|
fp = to_flat_binder_object(hdr);
|
2016-10-24 21:20:29 +08:00
|
|
|
ref = binder_get_ref(proc, fp->handle,
|
2017-02-04 06:40:45 +08:00
|
|
|
hdr->type == BINDER_TYPE_HANDLE);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (ref == NULL) {
|
2013-07-04 17:54:48 +08:00
|
|
|
pr_err("transaction release %d bad handle %d\n",
|
2012-10-31 01:05:43 +08:00
|
|
|
debug_id, fp->handle);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
|
|
|
" ref %d desc %d (node %d)\n",
|
|
|
|
ref->debug_id, ref->desc, ref->node->debug_id);
|
2017-02-04 06:40:45 +08:00
|
|
|
binder_dec_ref(ref, hdr->type == BINDER_TYPE_HANDLE);
|
2011-11-30 19:18:14 +08:00
|
|
|
} break;
|
|
|
|
|
2017-02-04 06:40:45 +08:00
|
|
|
case BINDER_TYPE_FD: {
|
|
|
|
struct binder_fd_object *fp = to_binder_fd_object(hdr);
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
2017-02-04 06:40:45 +08:00
|
|
|
" fd %d\n", fp->fd);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (failed_at)
|
2017-02-04 06:40:45 +08:00
|
|
|
task_close_fd(proc, fp->fd);
|
|
|
|
} break;
|
2017-02-04 06:40:51 +08:00
|
|
|
case BINDER_TYPE_PTR:
|
|
|
|
/*
|
|
|
|
* Nothing to do here, this will get cleaned up when the
|
|
|
|
* transaction buffer gets freed
|
|
|
|
*/
|
|
|
|
break;
|
2017-02-04 06:40:52 +08:00
|
|
|
case BINDER_TYPE_FDA: {
|
|
|
|
struct binder_fd_array_object *fda;
|
|
|
|
struct binder_buffer_object *parent;
|
|
|
|
uintptr_t parent_buffer;
|
|
|
|
u32 *fd_array;
|
|
|
|
size_t fd_index;
|
|
|
|
binder_size_t fd_buf_size;
|
|
|
|
|
|
|
|
fda = to_binder_fd_array_object(hdr);
|
|
|
|
parent = binder_validate_ptr(buffer, fda->parent,
|
|
|
|
off_start,
|
|
|
|
offp - off_start);
|
|
|
|
if (!parent) {
|
|
|
|
pr_err("transaction release %d bad parent offset",
|
|
|
|
debug_id);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Since the parent was already fixed up, convert it
|
|
|
|
* back to kernel address space to access it
|
|
|
|
*/
|
|
|
|
parent_buffer = parent->buffer -
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.user_buffer_offset;
|
2017-02-04 06:40:52 +08:00
|
|
|
|
|
|
|
fd_buf_size = sizeof(u32) * fda->num_fds;
|
|
|
|
if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
|
|
|
|
pr_err("transaction release %d invalid number of fds (%lld)\n",
|
|
|
|
debug_id, (u64)fda->num_fds);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (fd_buf_size > parent->length ||
|
|
|
|
fda->parent_offset > parent->length - fd_buf_size) {
|
|
|
|
/* No space for all file descriptors here. */
|
|
|
|
pr_err("transaction release %d not enough space for %lld fds in buffer\n",
|
|
|
|
debug_id, (u64)fda->num_fds);
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
fd_array = (u32 *)(parent_buffer + fda->parent_offset);
|
|
|
|
for (fd_index = 0; fd_index < fda->num_fds; fd_index++)
|
|
|
|
task_close_fd(proc, fd_array[fd_index]);
|
|
|
|
} break;
|
2011-11-30 19:18:14 +08:00
|
|
|
default:
|
2013-07-04 17:54:48 +08:00
|
|
|
pr_err("transaction release %d bad object type %x\n",
|
2017-02-04 06:40:45 +08:00
|
|
|
debug_id, hdr->type);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-02-04 06:40:49 +08:00
|
|
|
static int binder_translate_binder(struct flat_binder_object *fp,
|
|
|
|
struct binder_transaction *t,
|
|
|
|
struct binder_thread *thread)
|
|
|
|
{
|
|
|
|
struct binder_node *node;
|
|
|
|
struct binder_ref *ref;
|
|
|
|
struct binder_proc *proc = thread->proc;
|
|
|
|
struct binder_proc *target_proc = t->to_proc;
|
|
|
|
|
|
|
|
node = binder_get_node(proc, fp->binder);
|
|
|
|
if (!node) {
|
|
|
|
node = binder_new_node(proc, fp->binder, fp->cookie);
|
|
|
|
if (!node)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
node->min_priority = fp->flags & FLAT_BINDER_FLAG_PRIORITY_MASK;
|
|
|
|
node->accept_fds = !!(fp->flags & FLAT_BINDER_FLAG_ACCEPTS_FDS);
|
|
|
|
}
|
|
|
|
if (fp->cookie != node->cookie) {
|
|
|
|
binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
|
|
|
|
proc->pid, thread->pid, (u64)fp->binder,
|
|
|
|
node->debug_id, (u64)fp->cookie,
|
|
|
|
(u64)node->cookie);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
if (security_binder_transfer_binder(proc->tsk, target_proc->tsk))
|
|
|
|
return -EPERM;
|
|
|
|
|
|
|
|
ref = binder_get_ref_for_node(target_proc, node);
|
|
|
|
if (!ref)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
if (fp->hdr.type == BINDER_TYPE_BINDER)
|
|
|
|
fp->hdr.type = BINDER_TYPE_HANDLE;
|
|
|
|
else
|
|
|
|
fp->hdr.type = BINDER_TYPE_WEAK_HANDLE;
|
|
|
|
fp->binder = 0;
|
|
|
|
fp->handle = ref->desc;
|
|
|
|
fp->cookie = 0;
|
|
|
|
binder_inc_ref(ref, fp->hdr.type == BINDER_TYPE_HANDLE, &thread->todo);
|
|
|
|
|
|
|
|
trace_binder_transaction_node_to_ref(t, node, ref);
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
|
|
|
" node %d u%016llx -> ref %d desc %d\n",
|
|
|
|
node->debug_id, (u64)node->ptr,
|
|
|
|
ref->debug_id, ref->desc);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_translate_handle(struct flat_binder_object *fp,
|
|
|
|
struct binder_transaction *t,
|
|
|
|
struct binder_thread *thread)
|
|
|
|
{
|
|
|
|
struct binder_ref *ref;
|
|
|
|
struct binder_proc *proc = thread->proc;
|
|
|
|
struct binder_proc *target_proc = t->to_proc;
|
|
|
|
|
|
|
|
ref = binder_get_ref(proc, fp->handle,
|
|
|
|
fp->hdr.type == BINDER_TYPE_HANDLE);
|
|
|
|
if (!ref) {
|
|
|
|
binder_user_error("%d:%d got transaction with invalid handle, %d\n",
|
|
|
|
proc->pid, thread->pid, fp->handle);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
if (security_binder_transfer_binder(proc->tsk, target_proc->tsk))
|
|
|
|
return -EPERM;
|
|
|
|
|
|
|
|
if (ref->node->proc == target_proc) {
|
|
|
|
if (fp->hdr.type == BINDER_TYPE_HANDLE)
|
|
|
|
fp->hdr.type = BINDER_TYPE_BINDER;
|
|
|
|
else
|
|
|
|
fp->hdr.type = BINDER_TYPE_WEAK_BINDER;
|
|
|
|
fp->binder = ref->node->ptr;
|
|
|
|
fp->cookie = ref->node->cookie;
|
|
|
|
binder_inc_node(ref->node, fp->hdr.type == BINDER_TYPE_BINDER,
|
|
|
|
0, NULL);
|
|
|
|
trace_binder_transaction_ref_to_node(t, ref);
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
|
|
|
" ref %d desc %d -> node %d u%016llx\n",
|
|
|
|
ref->debug_id, ref->desc, ref->node->debug_id,
|
|
|
|
(u64)ref->node->ptr);
|
|
|
|
} else {
|
|
|
|
struct binder_ref *new_ref;
|
|
|
|
|
|
|
|
new_ref = binder_get_ref_for_node(target_proc, ref->node);
|
|
|
|
if (!new_ref)
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
fp->binder = 0;
|
|
|
|
fp->handle = new_ref->desc;
|
|
|
|
fp->cookie = 0;
|
|
|
|
binder_inc_ref(new_ref, fp->hdr.type == BINDER_TYPE_HANDLE,
|
|
|
|
NULL);
|
|
|
|
trace_binder_transaction_ref_to_ref(t, ref, new_ref);
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
|
|
|
" ref %d desc %d -> ref %d desc %d (node %d)\n",
|
|
|
|
ref->debug_id, ref->desc, new_ref->debug_id,
|
|
|
|
new_ref->desc, ref->node->debug_id);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_translate_fd(int fd,
|
|
|
|
struct binder_transaction *t,
|
|
|
|
struct binder_thread *thread,
|
|
|
|
struct binder_transaction *in_reply_to)
|
|
|
|
{
|
|
|
|
struct binder_proc *proc = thread->proc;
|
|
|
|
struct binder_proc *target_proc = t->to_proc;
|
|
|
|
int target_fd;
|
|
|
|
struct file *file;
|
|
|
|
int ret;
|
|
|
|
bool target_allows_fd;
|
|
|
|
|
|
|
|
if (in_reply_to)
|
|
|
|
target_allows_fd = !!(in_reply_to->flags & TF_ACCEPT_FDS);
|
|
|
|
else
|
|
|
|
target_allows_fd = t->buffer->target_node->accept_fds;
|
|
|
|
if (!target_allows_fd) {
|
|
|
|
binder_user_error("%d:%d got %s with fd, %d, but target does not allow fds\n",
|
|
|
|
proc->pid, thread->pid,
|
|
|
|
in_reply_to ? "reply" : "transaction",
|
|
|
|
fd);
|
|
|
|
ret = -EPERM;
|
|
|
|
goto err_fd_not_accepted;
|
|
|
|
}
|
|
|
|
|
|
|
|
file = fget(fd);
|
|
|
|
if (!file) {
|
|
|
|
binder_user_error("%d:%d got transaction with invalid fd, %d\n",
|
|
|
|
proc->pid, thread->pid, fd);
|
|
|
|
ret = -EBADF;
|
|
|
|
goto err_fget;
|
|
|
|
}
|
|
|
|
ret = security_binder_transfer_file(proc->tsk, target_proc->tsk, file);
|
|
|
|
if (ret < 0) {
|
|
|
|
ret = -EPERM;
|
|
|
|
goto err_security;
|
|
|
|
}
|
|
|
|
|
|
|
|
target_fd = task_get_unused_fd_flags(target_proc, O_CLOEXEC);
|
|
|
|
if (target_fd < 0) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto err_get_unused_fd;
|
|
|
|
}
|
|
|
|
task_fd_install(target_proc, target_fd, file);
|
|
|
|
trace_binder_transaction_fd(t, fd, target_fd);
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION, " fd %d -> %d\n",
|
|
|
|
fd, target_fd);
|
|
|
|
|
|
|
|
return target_fd;
|
|
|
|
|
|
|
|
err_get_unused_fd:
|
|
|
|
err_security:
|
|
|
|
fput(file);
|
|
|
|
err_fget:
|
|
|
|
err_fd_not_accepted:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2017-02-04 06:40:52 +08:00
|
|
|
static int binder_translate_fd_array(struct binder_fd_array_object *fda,
|
|
|
|
struct binder_buffer_object *parent,
|
|
|
|
struct binder_transaction *t,
|
|
|
|
struct binder_thread *thread,
|
|
|
|
struct binder_transaction *in_reply_to)
|
|
|
|
{
|
|
|
|
binder_size_t fdi, fd_buf_size, num_installed_fds;
|
|
|
|
int target_fd;
|
|
|
|
uintptr_t parent_buffer;
|
|
|
|
u32 *fd_array;
|
|
|
|
struct binder_proc *proc = thread->proc;
|
|
|
|
struct binder_proc *target_proc = t->to_proc;
|
|
|
|
|
|
|
|
fd_buf_size = sizeof(u32) * fda->num_fds;
|
|
|
|
if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
|
|
|
|
binder_user_error("%d:%d got transaction with invalid number of fds (%lld)\n",
|
|
|
|
proc->pid, thread->pid, (u64)fda->num_fds);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
if (fd_buf_size > parent->length ||
|
|
|
|
fda->parent_offset > parent->length - fd_buf_size) {
|
|
|
|
/* No space for all file descriptors here. */
|
|
|
|
binder_user_error("%d:%d not enough space to store %lld fds in buffer\n",
|
|
|
|
proc->pid, thread->pid, (u64)fda->num_fds);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Since the parent was already fixed up, convert it
|
|
|
|
* back to the kernel address space to access it
|
|
|
|
*/
|
2017-06-30 03:01:38 +08:00
|
|
|
parent_buffer = parent->buffer - target_proc->alloc.user_buffer_offset;
|
2017-02-04 06:40:52 +08:00
|
|
|
fd_array = (u32 *)(parent_buffer + fda->parent_offset);
|
|
|
|
if (!IS_ALIGNED((unsigned long)fd_array, sizeof(u32))) {
|
|
|
|
binder_user_error("%d:%d parent offset not aligned correctly.\n",
|
|
|
|
proc->pid, thread->pid);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
for (fdi = 0; fdi < fda->num_fds; fdi++) {
|
|
|
|
target_fd = binder_translate_fd(fd_array[fdi], t, thread,
|
|
|
|
in_reply_to);
|
|
|
|
if (target_fd < 0)
|
|
|
|
goto err_translate_fd_failed;
|
|
|
|
fd_array[fdi] = target_fd;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
err_translate_fd_failed:
|
|
|
|
/*
|
|
|
|
* Failed to allocate fd or security error, free fds
|
|
|
|
* installed so far.
|
|
|
|
*/
|
|
|
|
num_installed_fds = fdi;
|
|
|
|
for (fdi = 0; fdi < num_installed_fds; fdi++)
|
|
|
|
task_close_fd(target_proc, fd_array[fdi]);
|
|
|
|
return target_fd;
|
|
|
|
}
|
|
|
|
|
2017-02-04 06:40:51 +08:00
|
|
|
static int binder_fixup_parent(struct binder_transaction *t,
|
|
|
|
struct binder_thread *thread,
|
|
|
|
struct binder_buffer_object *bp,
|
|
|
|
binder_size_t *off_start,
|
|
|
|
binder_size_t num_valid,
|
|
|
|
struct binder_buffer_object *last_fixup_obj,
|
|
|
|
binder_size_t last_fixup_min_off)
|
|
|
|
{
|
|
|
|
struct binder_buffer_object *parent;
|
|
|
|
u8 *parent_buffer;
|
|
|
|
struct binder_buffer *b = t->buffer;
|
|
|
|
struct binder_proc *proc = thread->proc;
|
|
|
|
struct binder_proc *target_proc = t->to_proc;
|
|
|
|
|
|
|
|
if (!(bp->flags & BINDER_BUFFER_FLAG_HAS_PARENT))
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
parent = binder_validate_ptr(b, bp->parent, off_start, num_valid);
|
|
|
|
if (!parent) {
|
|
|
|
binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
|
|
|
|
proc->pid, thread->pid);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!binder_validate_fixup(b, off_start,
|
|
|
|
parent, bp->parent_offset,
|
|
|
|
last_fixup_obj,
|
|
|
|
last_fixup_min_off)) {
|
|
|
|
binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
|
|
|
|
proc->pid, thread->pid);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (parent->length < sizeof(binder_uintptr_t) ||
|
|
|
|
bp->parent_offset > parent->length - sizeof(binder_uintptr_t)) {
|
|
|
|
/* No space for a pointer here! */
|
|
|
|
binder_user_error("%d:%d got transaction with invalid parent offset\n",
|
|
|
|
proc->pid, thread->pid);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
parent_buffer = (u8 *)(parent->buffer -
|
2017-06-30 03:01:38 +08:00
|
|
|
target_proc->alloc.user_buffer_offset);
|
2017-02-04 06:40:51 +08:00
|
|
|
*(binder_uintptr_t *)(parent_buffer + bp->parent_offset) = bp->buffer;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
static void binder_transaction(struct binder_proc *proc,
|
|
|
|
struct binder_thread *thread,
|
2017-02-04 06:40:50 +08:00
|
|
|
struct binder_transaction_data *tr, int reply,
|
|
|
|
binder_size_t extra_buffers_size)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2017-02-04 06:40:49 +08:00
|
|
|
int ret;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_transaction *t;
|
|
|
|
struct binder_work *tcomplete;
|
2017-02-04 06:40:51 +08:00
|
|
|
binder_size_t *offp, *off_end, *off_start;
|
2016-02-10 13:05:32 +08:00
|
|
|
binder_size_t off_min;
|
2017-02-04 06:40:51 +08:00
|
|
|
u8 *sg_bufp, *sg_buf_end;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_proc *target_proc;
|
|
|
|
struct binder_thread *target_thread = NULL;
|
|
|
|
struct binder_node *target_node = NULL;
|
|
|
|
struct list_head *target_list;
|
|
|
|
wait_queue_head_t *target_wait;
|
|
|
|
struct binder_transaction *in_reply_to = NULL;
|
|
|
|
struct binder_transaction_log_entry *e;
|
|
|
|
uint32_t return_error;
|
2017-02-04 06:40:51 +08:00
|
|
|
struct binder_buffer_object *last_fixup_obj = NULL;
|
|
|
|
binder_size_t last_fixup_min_off = 0;
|
2017-02-04 06:40:46 +08:00
|
|
|
struct binder_context *context = proc->context;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
e = binder_transaction_log_add(&binder_transaction_log);
|
|
|
|
e->call_type = reply ? 2 : !!(tr->flags & TF_ONE_WAY);
|
|
|
|
e->from_proc = proc->pid;
|
|
|
|
e->from_thread = thread->pid;
|
|
|
|
e->target_handle = tr->target.handle;
|
|
|
|
e->data_size = tr->data_size;
|
|
|
|
e->offsets_size = tr->offsets_size;
|
2017-02-04 06:40:47 +08:00
|
|
|
e->context_name = proc->context->name;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
if (reply) {
|
|
|
|
in_reply_to = thread->transaction_stack;
|
|
|
|
if (in_reply_to == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d got reply transaction with no transaction stack\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_empty_call_stack;
|
|
|
|
}
|
|
|
|
binder_set_nice(in_reply_to->saved_priority);
|
|
|
|
if (in_reply_to->to_thread != thread) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid, in_reply_to->debug_id,
|
|
|
|
in_reply_to->to_proc ?
|
|
|
|
in_reply_to->to_proc->pid : 0,
|
|
|
|
in_reply_to->to_thread ?
|
|
|
|
in_reply_to->to_thread->pid : 0);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
in_reply_to = NULL;
|
|
|
|
goto err_bad_call_stack;
|
|
|
|
}
|
|
|
|
thread->transaction_stack = in_reply_to->to_parent;
|
|
|
|
target_thread = in_reply_to->from;
|
|
|
|
if (target_thread == NULL) {
|
|
|
|
return_error = BR_DEAD_REPLY;
|
|
|
|
goto err_dead_binder;
|
|
|
|
}
|
|
|
|
if (target_thread->transaction_stack != in_reply_to) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
target_thread->transaction_stack ?
|
|
|
|
target_thread->transaction_stack->debug_id : 0,
|
|
|
|
in_reply_to->debug_id);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
in_reply_to = NULL;
|
|
|
|
target_thread = NULL;
|
|
|
|
goto err_dead_binder;
|
|
|
|
}
|
|
|
|
target_proc = target_thread->proc;
|
|
|
|
} else {
|
|
|
|
if (tr->target.handle) {
|
|
|
|
struct binder_ref *ref;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2016-10-24 21:20:29 +08:00
|
|
|
ref = binder_get_ref(proc, tr->target.handle, true);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (ref == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d got transaction to invalid handle\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_invalid_target_handle;
|
|
|
|
}
|
|
|
|
target_node = ref->node;
|
|
|
|
} else {
|
2017-02-04 06:40:46 +08:00
|
|
|
target_node = context->binder_context_mgr_node;
|
2011-11-30 19:18:14 +08:00
|
|
|
if (target_node == NULL) {
|
|
|
|
return_error = BR_DEAD_REPLY;
|
|
|
|
goto err_no_context_mgr_node;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
e->to_node = target_node->debug_id;
|
|
|
|
target_proc = target_node->proc;
|
|
|
|
if (target_proc == NULL) {
|
|
|
|
return_error = BR_DEAD_REPLY;
|
|
|
|
goto err_dead_binder;
|
|
|
|
}
|
2015-01-21 23:54:10 +08:00
|
|
|
if (security_binder_transaction(proc->tsk,
|
|
|
|
target_proc->tsk) < 0) {
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_invalid_target_handle;
|
|
|
|
}
|
2011-11-30 19:18:14 +08:00
|
|
|
if (!(tr->flags & TF_ONE_WAY) && thread->transaction_stack) {
|
|
|
|
struct binder_transaction *tmp;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
tmp = thread->transaction_stack;
|
|
|
|
if (tmp->to_thread != thread) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid, tmp->debug_id,
|
|
|
|
tmp->to_proc ? tmp->to_proc->pid : 0,
|
|
|
|
tmp->to_thread ?
|
|
|
|
tmp->to_thread->pid : 0);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_bad_call_stack;
|
|
|
|
}
|
|
|
|
while (tmp) {
|
|
|
|
if (tmp->from && tmp->from->proc == target_proc)
|
|
|
|
target_thread = tmp->from;
|
|
|
|
tmp = tmp->from_parent;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (target_thread) {
|
|
|
|
e->to_thread = target_thread->pid;
|
|
|
|
target_list = &target_thread->todo;
|
|
|
|
target_wait = &target_thread->wait;
|
|
|
|
} else {
|
|
|
|
target_list = &target_proc->todo;
|
|
|
|
target_wait = &target_proc->wait;
|
|
|
|
}
|
|
|
|
e->to_proc = target_proc->pid;
|
|
|
|
|
|
|
|
/* TODO: reuse incoming transaction for reply */
|
|
|
|
t = kzalloc(sizeof(*t), GFP_KERNEL);
|
|
|
|
if (t == NULL) {
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_alloc_t_failed;
|
|
|
|
}
|
|
|
|
binder_stats_created(BINDER_STAT_TRANSACTION);
|
|
|
|
|
|
|
|
tcomplete = kzalloc(sizeof(*tcomplete), GFP_KERNEL);
|
|
|
|
if (tcomplete == NULL) {
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_alloc_tcomplete_failed;
|
|
|
|
}
|
|
|
|
binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE);
|
|
|
|
|
|
|
|
t->debug_id = ++binder_last_id;
|
|
|
|
e->debug_id = t->debug_id;
|
|
|
|
|
|
|
|
if (reply)
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
2017-02-04 06:40:50 +08:00
|
|
|
"%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld-%lld\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid, t->debug_id,
|
|
|
|
target_proc->pid, target_thread->pid,
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)tr->data.ptr.buffer,
|
|
|
|
(u64)tr->data.ptr.offsets,
|
2017-02-04 06:40:50 +08:00
|
|
|
(u64)tr->data_size, (u64)tr->offsets_size,
|
|
|
|
(u64)extra_buffers_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
else
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
2017-02-04 06:40:50 +08:00
|
|
|
"%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld-%lld\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid, t->debug_id,
|
|
|
|
target_proc->pid, target_node->debug_id,
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)tr->data.ptr.buffer,
|
|
|
|
(u64)tr->data.ptr.offsets,
|
2017-02-04 06:40:50 +08:00
|
|
|
(u64)tr->data_size, (u64)tr->offsets_size,
|
|
|
|
(u64)extra_buffers_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
if (!reply && !(tr->flags & TF_ONE_WAY))
|
|
|
|
t->from = thread;
|
|
|
|
else
|
|
|
|
t->from = NULL;
|
2014-06-01 03:43:34 +08:00
|
|
|
t->sender_euid = task_euid(proc->tsk);
|
2011-11-30 19:18:14 +08:00
|
|
|
t->to_proc = target_proc;
|
|
|
|
t->to_thread = target_thread;
|
|
|
|
t->code = tr->code;
|
|
|
|
t->flags = tr->flags;
|
|
|
|
t->priority = task_nice(current);
|
2012-10-17 06:29:53 +08:00
|
|
|
|
|
|
|
trace_binder_transaction(reply, t, target_node);
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
t->buffer = binder_alloc_buf(target_proc, tr->data_size,
|
2017-02-04 06:40:50 +08:00
|
|
|
tr->offsets_size, extra_buffers_size,
|
|
|
|
!reply && (t->flags & TF_ONE_WAY));
|
2011-11-30 19:18:14 +08:00
|
|
|
if (t->buffer == NULL) {
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_binder_alloc_buf_failed;
|
|
|
|
}
|
|
|
|
t->buffer->allow_user_free = 0;
|
|
|
|
t->buffer->debug_id = t->debug_id;
|
|
|
|
t->buffer->transaction = t;
|
|
|
|
t->buffer->target_node = target_node;
|
2012-10-17 06:29:53 +08:00
|
|
|
trace_binder_transaction_alloc_buf(t->buffer);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (target_node)
|
|
|
|
binder_inc_node(target_node, 1, 0, NULL);
|
|
|
|
|
2017-02-04 06:40:51 +08:00
|
|
|
off_start = (binder_size_t *)(t->buffer->data +
|
|
|
|
ALIGN(tr->data_size, sizeof(void *)));
|
|
|
|
offp = off_start;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2014-02-22 06:40:26 +08:00
|
|
|
if (copy_from_user(t->buffer->data, (const void __user *)(uintptr_t)
|
|
|
|
tr->data.ptr.buffer, tr->data_size)) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d got transaction with invalid data ptr\n",
|
|
|
|
proc->pid, thread->pid);
|
2011-11-30 19:18:14 +08:00
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_copy_data_failed;
|
|
|
|
}
|
2014-02-22 06:40:26 +08:00
|
|
|
if (copy_from_user(offp, (const void __user *)(uintptr_t)
|
|
|
|
tr->data.ptr.offsets, tr->offsets_size)) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
|
|
|
|
proc->pid, thread->pid);
|
2011-11-30 19:18:14 +08:00
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_copy_data_failed;
|
|
|
|
}
|
2014-02-22 06:40:26 +08:00
|
|
|
if (!IS_ALIGNED(tr->offsets_size, sizeof(binder_size_t))) {
|
|
|
|
binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
|
|
|
|
proc->pid, thread->pid, (u64)tr->offsets_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_bad_offset;
|
|
|
|
}
|
2017-02-04 06:40:51 +08:00
|
|
|
if (!IS_ALIGNED(extra_buffers_size, sizeof(u64))) {
|
|
|
|
binder_user_error("%d:%d got transaction with unaligned buffers size, %lld\n",
|
|
|
|
proc->pid, thread->pid,
|
|
|
|
(u64)extra_buffers_size);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_bad_offset;
|
|
|
|
}
|
|
|
|
off_end = (void *)off_start + tr->offsets_size;
|
|
|
|
sg_bufp = (u8 *)(PTR_ALIGN(off_end, sizeof(void *)));
|
|
|
|
sg_buf_end = sg_bufp + extra_buffers_size;
|
2016-02-10 13:05:32 +08:00
|
|
|
off_min = 0;
|
2011-11-30 19:18:14 +08:00
|
|
|
for (; offp < off_end; offp++) {
|
2017-02-04 06:40:45 +08:00
|
|
|
struct binder_object_header *hdr;
|
|
|
|
size_t object_size = binder_validate_object(t->buffer, *offp);
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2017-02-04 06:40:45 +08:00
|
|
|
if (object_size == 0 || *offp < off_min) {
|
|
|
|
binder_user_error("%d:%d got transaction with invalid offset (%lld, min %lld max %lld) or object.\n",
|
2016-02-10 13:05:32 +08:00
|
|
|
proc->pid, thread->pid, (u64)*offp,
|
|
|
|
(u64)off_min,
|
2017-02-04 06:40:45 +08:00
|
|
|
(u64)t->buffer->data_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_bad_offset;
|
|
|
|
}
|
2017-02-04 06:40:45 +08:00
|
|
|
|
|
|
|
hdr = (struct binder_object_header *)(t->buffer->data + *offp);
|
|
|
|
off_min = *offp + object_size;
|
|
|
|
switch (hdr->type) {
|
2011-11-30 19:18:14 +08:00
|
|
|
case BINDER_TYPE_BINDER:
|
|
|
|
case BINDER_TYPE_WEAK_BINDER: {
|
2017-02-04 06:40:45 +08:00
|
|
|
struct flat_binder_object *fp;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2017-02-04 06:40:45 +08:00
|
|
|
fp = to_flat_binder_object(hdr);
|
2017-02-04 06:40:49 +08:00
|
|
|
ret = binder_translate_binder(fp, t, thread);
|
|
|
|
if (ret < 0) {
|
2011-11-30 19:18:14 +08:00
|
|
|
return_error = BR_FAILED_REPLY;
|
2017-02-04 06:40:49 +08:00
|
|
|
goto err_translate_failed;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
} break;
|
|
|
|
case BINDER_TYPE_HANDLE:
|
|
|
|
case BINDER_TYPE_WEAK_HANDLE: {
|
2017-02-04 06:40:45 +08:00
|
|
|
struct flat_binder_object *fp;
|
2016-10-24 21:20:29 +08:00
|
|
|
|
2017-02-04 06:40:45 +08:00
|
|
|
fp = to_flat_binder_object(hdr);
|
2017-02-04 06:40:49 +08:00
|
|
|
ret = binder_translate_handle(fp, t, thread);
|
|
|
|
if (ret < 0) {
|
2015-01-21 23:54:10 +08:00
|
|
|
return_error = BR_FAILED_REPLY;
|
2017-02-04 06:40:49 +08:00
|
|
|
goto err_translate_failed;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
} break;
|
|
|
|
|
|
|
|
case BINDER_TYPE_FD: {
|
2017-02-04 06:40:45 +08:00
|
|
|
struct binder_fd_object *fp = to_binder_fd_object(hdr);
|
2017-02-04 06:40:49 +08:00
|
|
|
int target_fd = binder_translate_fd(fp->fd, t, thread,
|
|
|
|
in_reply_to);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
if (target_fd < 0) {
|
|
|
|
return_error = BR_FAILED_REPLY;
|
2017-02-04 06:40:49 +08:00
|
|
|
goto err_translate_failed;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2017-02-04 06:40:45 +08:00
|
|
|
fp->pad_binder = 0;
|
|
|
|
fp->fd = target_fd;
|
2011-11-30 19:18:14 +08:00
|
|
|
} break;
|
2017-02-04 06:40:52 +08:00
|
|
|
case BINDER_TYPE_FDA: {
|
|
|
|
struct binder_fd_array_object *fda =
|
|
|
|
to_binder_fd_array_object(hdr);
|
|
|
|
struct binder_buffer_object *parent =
|
|
|
|
binder_validate_ptr(t->buffer, fda->parent,
|
|
|
|
off_start,
|
|
|
|
offp - off_start);
|
|
|
|
if (!parent) {
|
|
|
|
binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
|
|
|
|
proc->pid, thread->pid);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_bad_parent;
|
|
|
|
}
|
|
|
|
if (!binder_validate_fixup(t->buffer, off_start,
|
|
|
|
parent, fda->parent_offset,
|
|
|
|
last_fixup_obj,
|
|
|
|
last_fixup_min_off)) {
|
|
|
|
binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
|
|
|
|
proc->pid, thread->pid);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_bad_parent;
|
|
|
|
}
|
|
|
|
ret = binder_translate_fd_array(fda, parent, t, thread,
|
|
|
|
in_reply_to);
|
|
|
|
if (ret < 0) {
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_translate_failed;
|
|
|
|
}
|
|
|
|
last_fixup_obj = parent;
|
|
|
|
last_fixup_min_off =
|
|
|
|
fda->parent_offset + sizeof(u32) * fda->num_fds;
|
|
|
|
} break;
|
2017-02-04 06:40:51 +08:00
|
|
|
case BINDER_TYPE_PTR: {
|
|
|
|
struct binder_buffer_object *bp =
|
|
|
|
to_binder_buffer_object(hdr);
|
|
|
|
size_t buf_left = sg_buf_end - sg_bufp;
|
|
|
|
|
|
|
|
if (bp->length > buf_left) {
|
|
|
|
binder_user_error("%d:%d got transaction with too large buffer\n",
|
|
|
|
proc->pid, thread->pid);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_bad_offset;
|
|
|
|
}
|
|
|
|
if (copy_from_user(sg_bufp,
|
|
|
|
(const void __user *)(uintptr_t)
|
|
|
|
bp->buffer, bp->length)) {
|
|
|
|
binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
|
|
|
|
proc->pid, thread->pid);
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_copy_data_failed;
|
|
|
|
}
|
|
|
|
/* Fixup buffer pointer to target proc address space */
|
|
|
|
bp->buffer = (uintptr_t)sg_bufp +
|
2017-06-30 03:01:38 +08:00
|
|
|
target_proc->alloc.user_buffer_offset;
|
2017-02-04 06:40:51 +08:00
|
|
|
sg_bufp += ALIGN(bp->length, sizeof(u64));
|
|
|
|
|
|
|
|
ret = binder_fixup_parent(t, thread, bp, off_start,
|
|
|
|
offp - off_start,
|
|
|
|
last_fixup_obj,
|
|
|
|
last_fixup_min_off);
|
|
|
|
if (ret < 0) {
|
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_translate_failed;
|
|
|
|
}
|
|
|
|
last_fixup_obj = bp;
|
|
|
|
last_fixup_min_off = 0;
|
|
|
|
} break;
|
2011-11-30 19:18:14 +08:00
|
|
|
default:
|
2013-07-04 17:54:48 +08:00
|
|
|
binder_user_error("%d:%d got transaction with invalid object type, %x\n",
|
2017-02-04 06:40:45 +08:00
|
|
|
proc->pid, thread->pid, hdr->type);
|
2011-11-30 19:18:14 +08:00
|
|
|
return_error = BR_FAILED_REPLY;
|
|
|
|
goto err_bad_object_type;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (reply) {
|
|
|
|
BUG_ON(t->buffer->async_transaction != 0);
|
|
|
|
binder_pop_transaction(target_thread, in_reply_to);
|
|
|
|
} else if (!(t->flags & TF_ONE_WAY)) {
|
|
|
|
BUG_ON(t->buffer->async_transaction != 0);
|
|
|
|
t->need_reply = 1;
|
|
|
|
t->from_parent = thread->transaction_stack;
|
|
|
|
thread->transaction_stack = t;
|
|
|
|
} else {
|
|
|
|
BUG_ON(target_node == NULL);
|
|
|
|
BUG_ON(t->buffer->async_transaction != 1);
|
|
|
|
if (target_node->has_async_transaction) {
|
|
|
|
target_list = &target_node->async_todo;
|
|
|
|
target_wait = NULL;
|
|
|
|
} else
|
|
|
|
target_node->has_async_transaction = 1;
|
|
|
|
}
|
|
|
|
t->work.type = BINDER_WORK_TRANSACTION;
|
|
|
|
list_add_tail(&t->work.entry, target_list);
|
|
|
|
tcomplete->type = BINDER_WORK_TRANSACTION_COMPLETE;
|
|
|
|
list_add_tail(&tcomplete->entry, &thread->todo);
|
2017-06-30 03:01:37 +08:00
|
|
|
if (target_wait) {
|
|
|
|
if (reply || !(t->flags & TF_ONE_WAY))
|
|
|
|
wake_up_interruptible_sync(target_wait);
|
|
|
|
else
|
|
|
|
wake_up_interruptible(target_wait);
|
|
|
|
}
|
2011-11-30 19:18:14 +08:00
|
|
|
return;
|
|
|
|
|
2017-02-04 06:40:49 +08:00
|
|
|
err_translate_failed:
|
2011-11-30 19:18:14 +08:00
|
|
|
err_bad_object_type:
|
|
|
|
err_bad_offset:
|
2017-02-04 06:40:52 +08:00
|
|
|
err_bad_parent:
|
2011-11-30 19:18:14 +08:00
|
|
|
err_copy_data_failed:
|
2012-10-17 06:29:53 +08:00
|
|
|
trace_binder_transaction_failed_buffer_release(t->buffer);
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_transaction_buffer_release(target_proc, t->buffer, offp);
|
|
|
|
t->buffer->transaction = NULL;
|
|
|
|
binder_free_buf(target_proc, t->buffer);
|
|
|
|
err_binder_alloc_buf_failed:
|
|
|
|
kfree(tcomplete);
|
|
|
|
binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
|
|
|
|
err_alloc_tcomplete_failed:
|
|
|
|
kfree(t);
|
|
|
|
binder_stats_deleted(BINDER_STAT_TRANSACTION);
|
|
|
|
err_alloc_t_failed:
|
|
|
|
err_bad_call_stack:
|
|
|
|
err_empty_call_stack:
|
|
|
|
err_dead_binder:
|
|
|
|
err_invalid_target_handle:
|
|
|
|
err_no_context_mgr_node:
|
|
|
|
binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d transaction failed %d, size %lld-%lld\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid, return_error,
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)tr->data_size, (u64)tr->offsets_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
{
|
|
|
|
struct binder_transaction_log_entry *fe;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
fe = binder_transaction_log_add(&binder_transaction_log_failed);
|
|
|
|
*fe = *e;
|
|
|
|
}
|
|
|
|
|
|
|
|
BUG_ON(thread->return_error != BR_OK);
|
|
|
|
if (in_reply_to) {
|
|
|
|
thread->return_error = BR_TRANSACTION_COMPLETE;
|
|
|
|
binder_send_failed_reply(in_reply_to, return_error);
|
|
|
|
} else
|
|
|
|
thread->return_error = return_error;
|
|
|
|
}
|
|
|
|
|
2013-09-02 14:18:40 +08:00
|
|
|
static int binder_thread_write(struct binder_proc *proc,
|
|
|
|
struct binder_thread *thread,
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t binder_buffer, size_t size,
|
|
|
|
binder_size_t *consumed)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
uint32_t cmd;
|
2017-02-04 06:40:46 +08:00
|
|
|
struct binder_context *context = proc->context;
|
2014-02-22 06:40:26 +08:00
|
|
|
void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
|
2011-11-30 19:18:14 +08:00
|
|
|
void __user *ptr = buffer + *consumed;
|
|
|
|
void __user *end = buffer + size;
|
|
|
|
|
|
|
|
while (ptr < end && thread->return_error == BR_OK) {
|
|
|
|
if (get_user(cmd, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
2012-10-17 06:29:53 +08:00
|
|
|
trace_binder_command(cmd);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.bc)) {
|
|
|
|
binder_stats.bc[_IOC_NR(cmd)]++;
|
|
|
|
proc->stats.bc[_IOC_NR(cmd)]++;
|
|
|
|
thread->stats.bc[_IOC_NR(cmd)]++;
|
|
|
|
}
|
|
|
|
switch (cmd) {
|
|
|
|
case BC_INCREFS:
|
|
|
|
case BC_ACQUIRE:
|
|
|
|
case BC_RELEASE:
|
|
|
|
case BC_DECREFS: {
|
|
|
|
uint32_t target;
|
|
|
|
struct binder_ref *ref;
|
|
|
|
const char *debug_string;
|
|
|
|
|
|
|
|
if (get_user(target, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
2017-02-04 06:40:46 +08:00
|
|
|
if (target == 0 && context->binder_context_mgr_node &&
|
2011-11-30 19:18:14 +08:00
|
|
|
(cmd == BC_INCREFS || cmd == BC_ACQUIRE)) {
|
|
|
|
ref = binder_get_ref_for_node(proc,
|
2017-02-04 06:40:46 +08:00
|
|
|
context->binder_context_mgr_node);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (ref->desc != target) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d tried to acquire reference to desc 0, got %d instead\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
ref->desc);
|
|
|
|
}
|
|
|
|
} else
|
2016-10-24 21:20:29 +08:00
|
|
|
ref = binder_get_ref(proc, target,
|
|
|
|
cmd == BC_ACQUIRE ||
|
|
|
|
cmd == BC_RELEASE);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (ref == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d refcount change on invalid ref %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid, target);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
switch (cmd) {
|
|
|
|
case BC_INCREFS:
|
|
|
|
debug_string = "IncRefs";
|
|
|
|
binder_inc_ref(ref, 0, NULL);
|
|
|
|
break;
|
|
|
|
case BC_ACQUIRE:
|
|
|
|
debug_string = "Acquire";
|
|
|
|
binder_inc_ref(ref, 1, NULL);
|
|
|
|
break;
|
|
|
|
case BC_RELEASE:
|
|
|
|
debug_string = "Release";
|
|
|
|
binder_dec_ref(ref, 1);
|
|
|
|
break;
|
|
|
|
case BC_DECREFS:
|
|
|
|
default:
|
|
|
|
debug_string = "DecRefs";
|
|
|
|
binder_dec_ref(ref, 0);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
binder_debug(BINDER_DEBUG_USER_REFS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d:%d %s ref %d desc %d s %d w %d for node %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid, debug_string, ref->debug_id,
|
|
|
|
ref->desc, ref->strong, ref->weak, ref->node->debug_id);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case BC_INCREFS_DONE:
|
|
|
|
case BC_ACQUIRE_DONE: {
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t node_ptr;
|
|
|
|
binder_uintptr_t cookie;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_node *node;
|
|
|
|
|
2014-02-22 06:40:26 +08:00
|
|
|
if (get_user(node_ptr, (binder_uintptr_t __user *)ptr))
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EFAULT;
|
2014-02-22 06:40:26 +08:00
|
|
|
ptr += sizeof(binder_uintptr_t);
|
|
|
|
if (get_user(cookie, (binder_uintptr_t __user *)ptr))
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EFAULT;
|
2014-02-22 06:40:26 +08:00
|
|
|
ptr += sizeof(binder_uintptr_t);
|
2011-11-30 19:18:14 +08:00
|
|
|
node = binder_get_node(proc, node_ptr);
|
|
|
|
if (node == NULL) {
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_user_error("%d:%d %s u%016llx no match\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
cmd == BC_INCREFS_DONE ?
|
|
|
|
"BC_INCREFS_DONE" :
|
|
|
|
"BC_ACQUIRE_DONE",
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)node_ptr);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (cookie != node->cookie) {
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
cmd == BC_INCREFS_DONE ?
|
|
|
|
"BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)node_ptr, node->debug_id,
|
|
|
|
(u64)cookie, (u64)node->cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (cmd == BC_ACQUIRE_DONE) {
|
|
|
|
if (node->pending_strong_ref == 0) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
node->debug_id);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
node->pending_strong_ref = 0;
|
|
|
|
} else {
|
|
|
|
if (node->pending_weak_ref == 0) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
node->debug_id);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
node->pending_weak_ref = 0;
|
|
|
|
}
|
|
|
|
binder_dec_node(node, cmd == BC_ACQUIRE_DONE, 0);
|
|
|
|
binder_debug(BINDER_DEBUG_USER_REFS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d:%d %s node %d ls %d lw %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
cmd == BC_INCREFS_DONE ? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
|
|
|
|
node->debug_id, node->local_strong_refs, node->local_weak_refs);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
case BC_ATTEMPT_ACQUIRE:
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EINVAL;
|
|
|
|
case BC_ACQUIRE_RESULT:
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("BC_ACQUIRE_RESULT not supported\n");
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
case BC_FREE_BUFFER: {
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t data_ptr;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_buffer *buffer;
|
|
|
|
|
2014-02-22 06:40:26 +08:00
|
|
|
if (get_user(data_ptr, (binder_uintptr_t __user *)ptr))
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EFAULT;
|
2014-02-22 06:40:26 +08:00
|
|
|
ptr += sizeof(binder_uintptr_t);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
buffer = binder_buffer_lookup(proc, data_ptr);
|
|
|
|
if (buffer == NULL) {
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_user_error("%d:%d BC_FREE_BUFFER u%016llx no match\n",
|
|
|
|
proc->pid, thread->pid, (u64)data_ptr);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (!buffer->allow_user_free) {
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_user_error("%d:%d BC_FREE_BUFFER u%016llx matched unreturned buffer\n",
|
|
|
|
proc->pid, thread->pid, (u64)data_ptr);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
binder_debug(BINDER_DEBUG_FREE_BUFFER,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
|
|
|
|
proc->pid, thread->pid, (u64)data_ptr,
|
|
|
|
buffer->debug_id,
|
2011-11-30 19:18:14 +08:00
|
|
|
buffer->transaction ? "active" : "finished");
|
|
|
|
|
|
|
|
if (buffer->transaction) {
|
|
|
|
buffer->transaction->buffer = NULL;
|
|
|
|
buffer->transaction = NULL;
|
|
|
|
}
|
|
|
|
if (buffer->async_transaction && buffer->target_node) {
|
|
|
|
BUG_ON(!buffer->target_node->has_async_transaction);
|
|
|
|
if (list_empty(&buffer->target_node->async_todo))
|
|
|
|
buffer->target_node->has_async_transaction = 0;
|
|
|
|
else
|
|
|
|
list_move_tail(buffer->target_node->async_todo.next, &thread->todo);
|
|
|
|
}
|
2012-10-17 06:29:53 +08:00
|
|
|
trace_binder_transaction_buffer_release(buffer);
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_transaction_buffer_release(proc, buffer, NULL);
|
|
|
|
binder_free_buf(proc, buffer);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2017-02-04 06:40:51 +08:00
|
|
|
case BC_TRANSACTION_SG:
|
|
|
|
case BC_REPLY_SG: {
|
|
|
|
struct binder_transaction_data_sg tr;
|
|
|
|
|
|
|
|
if (copy_from_user(&tr, ptr, sizeof(tr)))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(tr);
|
|
|
|
binder_transaction(proc, thread, &tr.transaction_data,
|
|
|
|
cmd == BC_REPLY_SG, tr.buffers_size);
|
|
|
|
break;
|
|
|
|
}
|
2011-11-30 19:18:14 +08:00
|
|
|
case BC_TRANSACTION:
|
|
|
|
case BC_REPLY: {
|
|
|
|
struct binder_transaction_data tr;
|
|
|
|
|
|
|
|
if (copy_from_user(&tr, ptr, sizeof(tr)))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(tr);
|
2017-02-04 06:40:50 +08:00
|
|
|
binder_transaction(proc, thread, &tr,
|
|
|
|
cmd == BC_REPLY, 0);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case BC_REGISTER_LOOPER:
|
|
|
|
binder_debug(BINDER_DEBUG_THREADS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d:%d BC_REGISTER_LOOPER\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
if (thread->looper & BINDER_LOOPER_STATE_ENTERED) {
|
|
|
|
thread->looper |= BINDER_LOOPER_STATE_INVALID;
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
} else if (proc->requested_threads == 0) {
|
|
|
|
thread->looper |= BINDER_LOOPER_STATE_INVALID;
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
} else {
|
|
|
|
proc->requested_threads--;
|
|
|
|
proc->requested_threads_started++;
|
|
|
|
}
|
|
|
|
thread->looper |= BINDER_LOOPER_STATE_REGISTERED;
|
|
|
|
break;
|
|
|
|
case BC_ENTER_LOOPER:
|
|
|
|
binder_debug(BINDER_DEBUG_THREADS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d:%d BC_ENTER_LOOPER\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
if (thread->looper & BINDER_LOOPER_STATE_REGISTERED) {
|
|
|
|
thread->looper |= BINDER_LOOPER_STATE_INVALID;
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
}
|
|
|
|
thread->looper |= BINDER_LOOPER_STATE_ENTERED;
|
|
|
|
break;
|
|
|
|
case BC_EXIT_LOOPER:
|
|
|
|
binder_debug(BINDER_DEBUG_THREADS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d:%d BC_EXIT_LOOPER\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
thread->looper |= BINDER_LOOPER_STATE_EXITED;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case BC_REQUEST_DEATH_NOTIFICATION:
|
|
|
|
case BC_CLEAR_DEATH_NOTIFICATION: {
|
|
|
|
uint32_t target;
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t cookie;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_ref *ref;
|
|
|
|
struct binder_ref_death *death;
|
|
|
|
|
|
|
|
if (get_user(target, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
2014-02-22 06:40:26 +08:00
|
|
|
if (get_user(cookie, (binder_uintptr_t __user *)ptr))
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EFAULT;
|
2014-02-22 06:40:26 +08:00
|
|
|
ptr += sizeof(binder_uintptr_t);
|
2016-10-24 21:20:29 +08:00
|
|
|
ref = binder_get_ref(proc, target, false);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (ref == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d %s invalid ref %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
cmd == BC_REQUEST_DEATH_NOTIFICATION ?
|
|
|
|
"BC_REQUEST_DEATH_NOTIFICATION" :
|
|
|
|
"BC_CLEAR_DEATH_NOTIFICATION",
|
|
|
|
target);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
cmd == BC_REQUEST_DEATH_NOTIFICATION ?
|
|
|
|
"BC_REQUEST_DEATH_NOTIFICATION" :
|
|
|
|
"BC_CLEAR_DEATH_NOTIFICATION",
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)cookie, ref->debug_id, ref->desc,
|
2011-11-30 19:18:14 +08:00
|
|
|
ref->strong, ref->weak, ref->node->debug_id);
|
|
|
|
|
|
|
|
if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
|
|
|
|
if (ref->death) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
death = kzalloc(sizeof(*death), GFP_KERNEL);
|
|
|
|
if (death == NULL) {
|
|
|
|
thread->return_error = BR_ERROR;
|
|
|
|
binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
binder_stats_created(BINDER_STAT_DEATH);
|
|
|
|
INIT_LIST_HEAD(&death->work.entry);
|
|
|
|
death->cookie = cookie;
|
|
|
|
ref->death = death;
|
|
|
|
if (ref->node->proc == NULL) {
|
|
|
|
ref->death->work.type = BINDER_WORK_DEAD_BINDER;
|
|
|
|
if (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | BINDER_LOOPER_STATE_ENTERED)) {
|
|
|
|
list_add_tail(&ref->death->work.entry, &thread->todo);
|
|
|
|
} else {
|
|
|
|
list_add_tail(&ref->death->work.entry, &proc->todo);
|
|
|
|
wake_up_interruptible(&proc->wait);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (ref->death == NULL) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
death = ref->death;
|
|
|
|
if (death->cookie != cookie) {
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)death->cookie,
|
|
|
|
(u64)cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
ref->death = NULL;
|
|
|
|
if (list_empty(&death->work.entry)) {
|
|
|
|
death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
|
|
|
|
if (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | BINDER_LOOPER_STATE_ENTERED)) {
|
|
|
|
list_add_tail(&death->work.entry, &thread->todo);
|
|
|
|
} else {
|
|
|
|
list_add_tail(&death->work.entry, &proc->todo);
|
|
|
|
wake_up_interruptible(&proc->wait);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
BUG_ON(death->work.type != BINDER_WORK_DEAD_BINDER);
|
|
|
|
death->work.type = BINDER_WORK_DEAD_BINDER_AND_CLEAR;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} break;
|
|
|
|
case BC_DEAD_BINDER_DONE: {
|
|
|
|
struct binder_work *w;
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t cookie;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_ref_death *death = NULL;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2014-02-22 06:40:26 +08:00
|
|
|
if (get_user(cookie, (binder_uintptr_t __user *)ptr))
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EFAULT;
|
|
|
|
|
2016-02-17 09:32:52 +08:00
|
|
|
ptr += sizeof(cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
list_for_each_entry(w, &proc->delivered_death, entry) {
|
|
|
|
struct binder_ref_death *tmp_death = container_of(w, struct binder_ref_death, work);
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if (tmp_death->cookie == cookie) {
|
|
|
|
death = tmp_death;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
binder_debug(BINDER_DEBUG_DEAD_BINDER,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d BC_DEAD_BINDER_DONE %016llx found %p\n",
|
|
|
|
proc->pid, thread->pid, (u64)cookie,
|
|
|
|
death);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (death == NULL) {
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
|
|
|
|
proc->pid, thread->pid, (u64)cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
list_del_init(&death->work.entry);
|
|
|
|
if (death->work.type == BINDER_WORK_DEAD_BINDER_AND_CLEAR) {
|
|
|
|
death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
|
|
|
|
if (thread->looper & (BINDER_LOOPER_STATE_REGISTERED | BINDER_LOOPER_STATE_ENTERED)) {
|
|
|
|
list_add_tail(&death->work.entry, &thread->todo);
|
|
|
|
} else {
|
|
|
|
list_add_tail(&death->work.entry, &proc->todo);
|
|
|
|
wake_up_interruptible(&proc->wait);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} break;
|
|
|
|
|
|
|
|
default:
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("%d:%d unknown command %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid, cmd);
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
*consumed = ptr - buffer;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-09-02 14:18:40 +08:00
|
|
|
static void binder_stat_br(struct binder_proc *proc,
|
|
|
|
struct binder_thread *thread, uint32_t cmd)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2012-10-17 06:29:53 +08:00
|
|
|
trace_binder_return(cmd);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.br)) {
|
|
|
|
binder_stats.br[_IOC_NR(cmd)]++;
|
|
|
|
proc->stats.br[_IOC_NR(cmd)]++;
|
|
|
|
thread->stats.br[_IOC_NR(cmd)]++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_has_proc_work(struct binder_proc *proc,
|
|
|
|
struct binder_thread *thread)
|
|
|
|
{
|
|
|
|
return !list_empty(&proc->todo) ||
|
|
|
|
(thread->looper & BINDER_LOOPER_STATE_NEED_RETURN);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_has_thread_work(struct binder_thread *thread)
|
|
|
|
{
|
|
|
|
return !list_empty(&thread->todo) || thread->return_error != BR_OK ||
|
|
|
|
(thread->looper & BINDER_LOOPER_STATE_NEED_RETURN);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_thread_read(struct binder_proc *proc,
|
|
|
|
struct binder_thread *thread,
|
2014-02-22 06:40:26 +08:00
|
|
|
binder_uintptr_t binder_buffer, size_t size,
|
|
|
|
binder_size_t *consumed, int non_block)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2014-02-22 06:40:26 +08:00
|
|
|
void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
|
2011-11-30 19:18:14 +08:00
|
|
|
void __user *ptr = buffer + *consumed;
|
|
|
|
void __user *end = buffer + size;
|
|
|
|
|
|
|
|
int ret = 0;
|
|
|
|
int wait_for_proc_work;
|
|
|
|
|
|
|
|
if (*consumed == 0) {
|
|
|
|
if (put_user(BR_NOOP, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
|
|
|
}
|
|
|
|
|
|
|
|
retry:
|
|
|
|
wait_for_proc_work = thread->transaction_stack == NULL &&
|
|
|
|
list_empty(&thread->todo);
|
|
|
|
|
|
|
|
if (thread->return_error != BR_OK && ptr < end) {
|
|
|
|
if (thread->return_error2 != BR_OK) {
|
|
|
|
if (put_user(thread->return_error2, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
2012-10-17 06:29:52 +08:00
|
|
|
binder_stat_br(proc, thread, thread->return_error2);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (ptr == end)
|
|
|
|
goto done;
|
|
|
|
thread->return_error2 = BR_OK;
|
|
|
|
}
|
|
|
|
if (put_user(thread->return_error, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
2012-10-17 06:29:52 +08:00
|
|
|
binder_stat_br(proc, thread, thread->return_error);
|
2011-11-30 19:18:14 +08:00
|
|
|
thread->return_error = BR_OK;
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
thread->looper |= BINDER_LOOPER_STATE_WAITING;
|
|
|
|
if (wait_for_proc_work)
|
|
|
|
proc->ready_threads++;
|
2012-10-17 06:29:53 +08:00
|
|
|
|
|
|
|
binder_unlock(__func__);
|
|
|
|
|
|
|
|
trace_binder_wait_for_work(wait_for_proc_work,
|
|
|
|
!!thread->transaction_stack,
|
|
|
|
!list_empty(&thread->todo));
|
2011-11-30 19:18:14 +08:00
|
|
|
if (wait_for_proc_work) {
|
|
|
|
if (!(thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
|
|
|
|
BINDER_LOOPER_STATE_ENTERED))) {
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid, thread->looper);
|
|
|
|
wait_event_interruptible(binder_user_error_wait,
|
|
|
|
binder_stop_on_user_error < 2);
|
|
|
|
}
|
|
|
|
binder_set_nice(proc->default_priority);
|
|
|
|
if (non_block) {
|
|
|
|
if (!binder_has_proc_work(proc, thread))
|
|
|
|
ret = -EAGAIN;
|
|
|
|
} else
|
2013-05-07 07:50:15 +08:00
|
|
|
ret = wait_event_freezable_exclusive(proc->wait, binder_has_proc_work(proc, thread));
|
2011-11-30 19:18:14 +08:00
|
|
|
} else {
|
|
|
|
if (non_block) {
|
|
|
|
if (!binder_has_thread_work(thread))
|
|
|
|
ret = -EAGAIN;
|
|
|
|
} else
|
2013-05-07 07:50:15 +08:00
|
|
|
ret = wait_event_freezable(thread->wait, binder_has_thread_work(thread));
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2012-10-17 06:29:53 +08:00
|
|
|
|
|
|
|
binder_lock(__func__);
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if (wait_for_proc_work)
|
|
|
|
proc->ready_threads--;
|
|
|
|
thread->looper &= ~BINDER_LOOPER_STATE_WAITING;
|
|
|
|
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
while (1) {
|
|
|
|
uint32_t cmd;
|
|
|
|
struct binder_transaction_data tr;
|
|
|
|
struct binder_work *w;
|
|
|
|
struct binder_transaction *t = NULL;
|
|
|
|
|
2014-09-08 22:16:34 +08:00
|
|
|
if (!list_empty(&thread->todo)) {
|
|
|
|
w = list_first_entry(&thread->todo, struct binder_work,
|
|
|
|
entry);
|
|
|
|
} else if (!list_empty(&proc->todo) && wait_for_proc_work) {
|
|
|
|
w = list_first_entry(&proc->todo, struct binder_work,
|
|
|
|
entry);
|
|
|
|
} else {
|
|
|
|
/* no data added */
|
|
|
|
if (ptr - buffer == 4 &&
|
|
|
|
!(thread->looper & BINDER_LOOPER_STATE_NEED_RETURN))
|
2011-11-30 19:18:14 +08:00
|
|
|
goto retry;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (end - ptr < sizeof(tr) + 4)
|
|
|
|
break;
|
|
|
|
|
|
|
|
switch (w->type) {
|
|
|
|
case BINDER_WORK_TRANSACTION: {
|
|
|
|
t = container_of(w, struct binder_transaction, work);
|
|
|
|
} break;
|
|
|
|
case BINDER_WORK_TRANSACTION_COMPLETE: {
|
|
|
|
cmd = BR_TRANSACTION_COMPLETE;
|
|
|
|
if (put_user(cmd, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
|
|
|
|
|
|
|
binder_stat_br(proc, thread, cmd);
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d:%d BR_TRANSACTION_COMPLETE\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
|
|
|
|
list_del(&w->entry);
|
|
|
|
kfree(w);
|
|
|
|
binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
|
|
|
|
} break;
|
|
|
|
case BINDER_WORK_NODE: {
|
|
|
|
struct binder_node *node = container_of(w, struct binder_node, work);
|
|
|
|
uint32_t cmd = BR_NOOP;
|
|
|
|
const char *cmd_name;
|
|
|
|
int strong = node->internal_strong_refs || node->local_strong_refs;
|
|
|
|
int weak = !hlist_empty(&node->refs) || node->local_weak_refs || strong;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if (weak && !node->has_weak_ref) {
|
|
|
|
cmd = BR_INCREFS;
|
|
|
|
cmd_name = "BR_INCREFS";
|
|
|
|
node->has_weak_ref = 1;
|
|
|
|
node->pending_weak_ref = 1;
|
|
|
|
node->local_weak_refs++;
|
|
|
|
} else if (strong && !node->has_strong_ref) {
|
|
|
|
cmd = BR_ACQUIRE;
|
|
|
|
cmd_name = "BR_ACQUIRE";
|
|
|
|
node->has_strong_ref = 1;
|
|
|
|
node->pending_strong_ref = 1;
|
|
|
|
node->local_strong_refs++;
|
|
|
|
} else if (!strong && node->has_strong_ref) {
|
|
|
|
cmd = BR_RELEASE;
|
|
|
|
cmd_name = "BR_RELEASE";
|
|
|
|
node->has_strong_ref = 0;
|
|
|
|
} else if (!weak && node->has_weak_ref) {
|
|
|
|
cmd = BR_DECREFS;
|
|
|
|
cmd_name = "BR_DECREFS";
|
|
|
|
node->has_weak_ref = 0;
|
|
|
|
}
|
|
|
|
if (cmd != BR_NOOP) {
|
|
|
|
if (put_user(cmd, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
2014-02-22 06:40:26 +08:00
|
|
|
if (put_user(node->ptr,
|
|
|
|
(binder_uintptr_t __user *)ptr))
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EFAULT;
|
2014-02-22 06:40:26 +08:00
|
|
|
ptr += sizeof(binder_uintptr_t);
|
|
|
|
if (put_user(node->cookie,
|
|
|
|
(binder_uintptr_t __user *)ptr))
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EFAULT;
|
2014-02-22 06:40:26 +08:00
|
|
|
ptr += sizeof(binder_uintptr_t);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
binder_stat_br(proc, thread, cmd);
|
|
|
|
binder_debug(BINDER_DEBUG_USER_REFS,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d %s %d u%016llx c%016llx\n",
|
|
|
|
proc->pid, thread->pid, cmd_name,
|
|
|
|
node->debug_id,
|
|
|
|
(u64)node->ptr, (u64)node->cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
} else {
|
|
|
|
list_del_init(&w->entry);
|
|
|
|
if (!weak && !strong) {
|
|
|
|
binder_debug(BINDER_DEBUG_INTERNAL_REFS,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d node %d u%016llx c%016llx deleted\n",
|
|
|
|
proc->pid, thread->pid,
|
|
|
|
node->debug_id,
|
|
|
|
(u64)node->ptr,
|
|
|
|
(u64)node->cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
rb_erase(&node->rb_node, &proc->nodes);
|
|
|
|
kfree(node);
|
|
|
|
binder_stats_deleted(BINDER_STAT_NODE);
|
|
|
|
} else {
|
|
|
|
binder_debug(BINDER_DEBUG_INTERNAL_REFS,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d node %d u%016llx c%016llx state unchanged\n",
|
|
|
|
proc->pid, thread->pid,
|
|
|
|
node->debug_id,
|
|
|
|
(u64)node->ptr,
|
|
|
|
(u64)node->cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} break;
|
|
|
|
case BINDER_WORK_DEAD_BINDER:
|
|
|
|
case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
|
|
|
|
case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
|
|
|
|
struct binder_ref_death *death;
|
|
|
|
uint32_t cmd;
|
|
|
|
|
|
|
|
death = container_of(w, struct binder_ref_death, work);
|
|
|
|
if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION)
|
|
|
|
cmd = BR_CLEAR_DEATH_NOTIFICATION_DONE;
|
|
|
|
else
|
|
|
|
cmd = BR_DEAD_BINDER;
|
|
|
|
if (put_user(cmd, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
2014-02-22 06:40:26 +08:00
|
|
|
if (put_user(death->cookie,
|
|
|
|
(binder_uintptr_t __user *)ptr))
|
2011-11-30 19:18:14 +08:00
|
|
|
return -EFAULT;
|
2014-02-22 06:40:26 +08:00
|
|
|
ptr += sizeof(binder_uintptr_t);
|
2012-10-17 06:29:52 +08:00
|
|
|
binder_stat_br(proc, thread, cmd);
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d %s %016llx\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
cmd == BR_DEAD_BINDER ?
|
|
|
|
"BR_DEAD_BINDER" :
|
|
|
|
"BR_CLEAR_DEATH_NOTIFICATION_DONE",
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)death->cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) {
|
|
|
|
list_del(&w->entry);
|
|
|
|
kfree(death);
|
|
|
|
binder_stats_deleted(BINDER_STAT_DEATH);
|
|
|
|
} else
|
|
|
|
list_move(&w->entry, &proc->delivered_death);
|
|
|
|
if (cmd == BR_DEAD_BINDER)
|
|
|
|
goto done; /* DEAD_BINDER notifications can cause transactions */
|
|
|
|
} break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!t)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
BUG_ON(t->buffer == NULL);
|
|
|
|
if (t->buffer->target_node) {
|
|
|
|
struct binder_node *target_node = t->buffer->target_node;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
tr.target.ptr = target_node->ptr;
|
|
|
|
tr.cookie = target_node->cookie;
|
|
|
|
t->saved_priority = task_nice(current);
|
|
|
|
if (t->priority < target_node->min_priority &&
|
|
|
|
!(t->flags & TF_ONE_WAY))
|
|
|
|
binder_set_nice(t->priority);
|
|
|
|
else if (!(t->flags & TF_ONE_WAY) ||
|
|
|
|
t->saved_priority > target_node->min_priority)
|
|
|
|
binder_set_nice(target_node->min_priority);
|
|
|
|
cmd = BR_TRANSACTION;
|
|
|
|
} else {
|
2014-02-22 06:40:26 +08:00
|
|
|
tr.target.ptr = 0;
|
|
|
|
tr.cookie = 0;
|
2011-11-30 19:18:14 +08:00
|
|
|
cmd = BR_REPLY;
|
|
|
|
}
|
|
|
|
tr.code = t->code;
|
|
|
|
tr.flags = t->flags;
|
2012-05-26 08:34:53 +08:00
|
|
|
tr.sender_euid = from_kuid(current_user_ns(), t->sender_euid);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
if (t->from) {
|
|
|
|
struct task_struct *sender = t->from->proc->tsk;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
tr.sender_pid = task_tgid_nr_ns(sender,
|
2010-03-03 06:51:53 +08:00
|
|
|
task_active_pid_ns(current));
|
2011-11-30 19:18:14 +08:00
|
|
|
} else {
|
|
|
|
tr.sender_pid = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
tr.data_size = t->buffer->data_size;
|
|
|
|
tr.offsets_size = t->buffer->offsets_size;
|
2014-02-22 06:40:26 +08:00
|
|
|
tr.data.ptr.buffer = (binder_uintptr_t)(
|
|
|
|
(uintptr_t)t->buffer->data +
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.user_buffer_offset);
|
2011-11-30 19:18:14 +08:00
|
|
|
tr.data.ptr.offsets = tr.data.ptr.buffer +
|
|
|
|
ALIGN(t->buffer->data_size,
|
|
|
|
sizeof(void *));
|
|
|
|
|
|
|
|
if (put_user(cmd, (uint32_t __user *)ptr))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(uint32_t);
|
|
|
|
if (copy_to_user(ptr, &tr, sizeof(tr)))
|
|
|
|
return -EFAULT;
|
|
|
|
ptr += sizeof(tr);
|
|
|
|
|
2012-10-17 06:29:53 +08:00
|
|
|
trace_binder_transaction_received(t);
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_stat_br(proc, thread, cmd);
|
|
|
|
binder_debug(BINDER_DEBUG_TRANSACTION,
|
2014-02-22 06:40:26 +08:00
|
|
|
"%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid,
|
|
|
|
(cmd == BR_TRANSACTION) ? "BR_TRANSACTION" :
|
|
|
|
"BR_REPLY",
|
|
|
|
t->debug_id, t->from ? t->from->proc->pid : 0,
|
|
|
|
t->from ? t->from->pid : 0, cmd,
|
|
|
|
t->buffer->data_size, t->buffer->offsets_size,
|
2014-02-22 06:40:26 +08:00
|
|
|
(u64)tr.data.ptr.buffer, (u64)tr.data.ptr.offsets);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
list_del(&t->work.entry);
|
|
|
|
t->buffer->allow_user_free = 1;
|
|
|
|
if (cmd == BR_TRANSACTION && !(t->flags & TF_ONE_WAY)) {
|
|
|
|
t->to_parent = thread->transaction_stack;
|
|
|
|
t->to_thread = thread;
|
|
|
|
thread->transaction_stack = t;
|
|
|
|
} else {
|
|
|
|
t->buffer->transaction = NULL;
|
|
|
|
kfree(t);
|
|
|
|
binder_stats_deleted(BINDER_STAT_TRANSACTION);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
|
|
|
|
|
|
|
*consumed = ptr - buffer;
|
|
|
|
if (proc->requested_threads + proc->ready_threads == 0 &&
|
|
|
|
proc->requested_threads_started < proc->max_threads &&
|
|
|
|
(thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
|
|
|
|
BINDER_LOOPER_STATE_ENTERED)) /* the user-space code fails to */
|
|
|
|
/*spawn a new thread if we leave this out */) {
|
|
|
|
proc->requested_threads++;
|
|
|
|
binder_debug(BINDER_DEBUG_THREADS,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d:%d BR_SPAWN_LOOPER\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
if (put_user(BR_SPAWN_LOOPER, (uint32_t __user *)buffer))
|
|
|
|
return -EFAULT;
|
2012-10-17 06:29:52 +08:00
|
|
|
binder_stat_br(proc, thread, BR_SPAWN_LOOPER);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_release_work(struct list_head *list)
|
|
|
|
{
|
|
|
|
struct binder_work *w;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
while (!list_empty(list)) {
|
|
|
|
w = list_first_entry(list, struct binder_work, entry);
|
|
|
|
list_del_init(&w->entry);
|
|
|
|
switch (w->type) {
|
|
|
|
case BINDER_WORK_TRANSACTION: {
|
|
|
|
struct binder_transaction *t;
|
|
|
|
|
|
|
|
t = container_of(w, struct binder_transaction, work);
|
2012-10-17 06:29:54 +08:00
|
|
|
if (t->buffer->target_node &&
|
|
|
|
!(t->flags & TF_ONE_WAY)) {
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_send_failed_reply(t, BR_DEAD_REPLY);
|
2012-10-17 06:29:54 +08:00
|
|
|
} else {
|
|
|
|
binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
|
2012-10-31 01:05:43 +08:00
|
|
|
"undelivered transaction %d\n",
|
2012-10-17 06:29:54 +08:00
|
|
|
t->debug_id);
|
|
|
|
t->buffer->transaction = NULL;
|
|
|
|
kfree(t);
|
|
|
|
binder_stats_deleted(BINDER_STAT_TRANSACTION);
|
|
|
|
}
|
2011-11-30 19:18:14 +08:00
|
|
|
} break;
|
|
|
|
case BINDER_WORK_TRANSACTION_COMPLETE: {
|
2012-10-17 06:29:54 +08:00
|
|
|
binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
|
2012-10-31 01:05:43 +08:00
|
|
|
"undelivered TRANSACTION_COMPLETE\n");
|
2011-11-30 19:18:14 +08:00
|
|
|
kfree(w);
|
|
|
|
binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
|
|
|
|
} break;
|
2012-10-17 06:29:54 +08:00
|
|
|
case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
|
|
|
|
case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
|
|
|
|
struct binder_ref_death *death;
|
|
|
|
|
|
|
|
death = container_of(w, struct binder_ref_death, work);
|
|
|
|
binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
|
2014-02-22 06:40:26 +08:00
|
|
|
"undelivered death notification, %016llx\n",
|
|
|
|
(u64)death->cookie);
|
2012-10-17 06:29:54 +08:00
|
|
|
kfree(death);
|
|
|
|
binder_stats_deleted(BINDER_STAT_DEATH);
|
|
|
|
} break;
|
2011-11-30 19:18:14 +08:00
|
|
|
default:
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_err("unexpected work type, %d, not freed\n",
|
2012-10-17 06:29:54 +08:00
|
|
|
w->type);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct binder_thread *binder_get_thread(struct binder_proc *proc)
|
|
|
|
{
|
|
|
|
struct binder_thread *thread = NULL;
|
|
|
|
struct rb_node *parent = NULL;
|
|
|
|
struct rb_node **p = &proc->threads.rb_node;
|
|
|
|
|
|
|
|
while (*p) {
|
|
|
|
parent = *p;
|
|
|
|
thread = rb_entry(parent, struct binder_thread, rb_node);
|
|
|
|
|
|
|
|
if (current->pid < thread->pid)
|
|
|
|
p = &(*p)->rb_left;
|
|
|
|
else if (current->pid > thread->pid)
|
|
|
|
p = &(*p)->rb_right;
|
|
|
|
else
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (*p == NULL) {
|
|
|
|
thread = kzalloc(sizeof(*thread), GFP_KERNEL);
|
|
|
|
if (thread == NULL)
|
|
|
|
return NULL;
|
|
|
|
binder_stats_created(BINDER_STAT_THREAD);
|
|
|
|
thread->proc = proc;
|
|
|
|
thread->pid = current->pid;
|
|
|
|
init_waitqueue_head(&thread->wait);
|
|
|
|
INIT_LIST_HEAD(&thread->todo);
|
|
|
|
rb_link_node(&thread->rb_node, parent, p);
|
|
|
|
rb_insert_color(&thread->rb_node, &proc->threads);
|
|
|
|
thread->looper |= BINDER_LOOPER_STATE_NEED_RETURN;
|
|
|
|
thread->return_error = BR_OK;
|
|
|
|
thread->return_error2 = BR_OK;
|
|
|
|
}
|
|
|
|
return thread;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_free_thread(struct binder_proc *proc,
|
|
|
|
struct binder_thread *thread)
|
|
|
|
{
|
|
|
|
struct binder_transaction *t;
|
|
|
|
struct binder_transaction *send_reply = NULL;
|
|
|
|
int active_transactions = 0;
|
|
|
|
|
|
|
|
rb_erase(&thread->rb_node, &proc->threads);
|
|
|
|
t = thread->transaction_stack;
|
|
|
|
if (t && t->to_thread == thread)
|
|
|
|
send_reply = t;
|
|
|
|
while (t) {
|
|
|
|
active_transactions++;
|
|
|
|
binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
|
2012-10-31 01:05:43 +08:00
|
|
|
"release %d:%d transaction %d %s, still active\n",
|
|
|
|
proc->pid, thread->pid,
|
2011-11-30 19:18:14 +08:00
|
|
|
t->debug_id,
|
|
|
|
(t->to_thread == thread) ? "in" : "out");
|
|
|
|
|
|
|
|
if (t->to_thread == thread) {
|
|
|
|
t->to_proc = NULL;
|
|
|
|
t->to_thread = NULL;
|
|
|
|
if (t->buffer) {
|
|
|
|
t->buffer->transaction = NULL;
|
|
|
|
t->buffer = NULL;
|
|
|
|
}
|
|
|
|
t = t->to_parent;
|
|
|
|
} else if (t->from == thread) {
|
|
|
|
t->from = NULL;
|
|
|
|
t = t->from_parent;
|
|
|
|
} else
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
if (send_reply)
|
|
|
|
binder_send_failed_reply(send_reply, BR_DEAD_REPLY);
|
|
|
|
binder_release_work(&thread->todo);
|
|
|
|
kfree(thread);
|
|
|
|
binder_stats_deleted(BINDER_STAT_THREAD);
|
|
|
|
return active_transactions;
|
|
|
|
}
|
|
|
|
|
|
|
|
static unsigned int binder_poll(struct file *filp,
|
|
|
|
struct poll_table_struct *wait)
|
|
|
|
{
|
|
|
|
struct binder_proc *proc = filp->private_data;
|
|
|
|
struct binder_thread *thread = NULL;
|
|
|
|
int wait_for_proc_work;
|
|
|
|
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_lock(__func__);
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
thread = binder_get_thread(proc);
|
|
|
|
|
|
|
|
wait_for_proc_work = thread->transaction_stack == NULL &&
|
|
|
|
list_empty(&thread->todo) && thread->return_error == BR_OK;
|
2012-10-17 06:29:53 +08:00
|
|
|
|
|
|
|
binder_unlock(__func__);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
if (wait_for_proc_work) {
|
|
|
|
if (binder_has_proc_work(proc, thread))
|
|
|
|
return POLLIN;
|
|
|
|
poll_wait(filp, &proc->wait, wait);
|
|
|
|
if (binder_has_proc_work(proc, thread))
|
|
|
|
return POLLIN;
|
|
|
|
} else {
|
|
|
|
if (binder_has_thread_work(thread))
|
|
|
|
return POLLIN;
|
|
|
|
poll_wait(filp, &thread->wait, wait);
|
|
|
|
if (binder_has_thread_work(thread))
|
|
|
|
return POLLIN;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-06-04 03:27:21 +08:00
|
|
|
static int binder_ioctl_write_read(struct file *filp,
|
|
|
|
unsigned int cmd, unsigned long arg,
|
|
|
|
struct binder_thread *thread)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
struct binder_proc *proc = filp->private_data;
|
|
|
|
unsigned int size = _IOC_SIZE(cmd);
|
|
|
|
void __user *ubuf = (void __user *)arg;
|
|
|
|
struct binder_write_read bwr;
|
|
|
|
|
|
|
|
if (size != sizeof(struct binder_write_read)) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
if (copy_from_user(&bwr, ubuf, sizeof(bwr))) {
|
|
|
|
ret = -EFAULT;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
binder_debug(BINDER_DEBUG_READ_WRITE,
|
|
|
|
"%d:%d write %lld at %016llx, read %lld at %016llx\n",
|
|
|
|
proc->pid, thread->pid,
|
|
|
|
(u64)bwr.write_size, (u64)bwr.write_buffer,
|
|
|
|
(u64)bwr.read_size, (u64)bwr.read_buffer);
|
|
|
|
|
|
|
|
if (bwr.write_size > 0) {
|
|
|
|
ret = binder_thread_write(proc, thread,
|
|
|
|
bwr.write_buffer,
|
|
|
|
bwr.write_size,
|
|
|
|
&bwr.write_consumed);
|
|
|
|
trace_binder_write_done(ret);
|
|
|
|
if (ret < 0) {
|
|
|
|
bwr.read_consumed = 0;
|
|
|
|
if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
|
|
|
|
ret = -EFAULT;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (bwr.read_size > 0) {
|
|
|
|
ret = binder_thread_read(proc, thread, bwr.read_buffer,
|
|
|
|
bwr.read_size,
|
|
|
|
&bwr.read_consumed,
|
|
|
|
filp->f_flags & O_NONBLOCK);
|
|
|
|
trace_binder_read_done(ret);
|
|
|
|
if (!list_empty(&proc->todo))
|
|
|
|
wake_up_interruptible(&proc->wait);
|
|
|
|
if (ret < 0) {
|
|
|
|
if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
|
|
|
|
ret = -EFAULT;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
binder_debug(BINDER_DEBUG_READ_WRITE,
|
|
|
|
"%d:%d wrote %lld of %lld, read return %lld of %lld\n",
|
|
|
|
proc->pid, thread->pid,
|
|
|
|
(u64)bwr.write_consumed, (u64)bwr.write_size,
|
|
|
|
(u64)bwr.read_consumed, (u64)bwr.read_size);
|
|
|
|
if (copy_to_user(ubuf, &bwr, sizeof(bwr))) {
|
|
|
|
ret = -EFAULT;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_ioctl_set_ctx_mgr(struct file *filp)
|
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
struct binder_proc *proc = filp->private_data;
|
2017-02-04 06:40:46 +08:00
|
|
|
struct binder_context *context = proc->context;
|
|
|
|
|
2014-06-04 03:27:21 +08:00
|
|
|
kuid_t curr_euid = current_euid();
|
|
|
|
|
2017-02-04 06:40:46 +08:00
|
|
|
if (context->binder_context_mgr_node) {
|
2014-06-04 03:27:21 +08:00
|
|
|
pr_err("BINDER_SET_CONTEXT_MGR already set\n");
|
|
|
|
ret = -EBUSY;
|
|
|
|
goto out;
|
|
|
|
}
|
2015-01-21 23:54:10 +08:00
|
|
|
ret = security_binder_set_context_mgr(proc->tsk);
|
|
|
|
if (ret < 0)
|
|
|
|
goto out;
|
2017-02-04 06:40:46 +08:00
|
|
|
if (uid_valid(context->binder_context_mgr_uid)) {
|
|
|
|
if (!uid_eq(context->binder_context_mgr_uid, curr_euid)) {
|
2014-06-04 03:27:21 +08:00
|
|
|
pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
|
|
|
|
from_kuid(&init_user_ns, curr_euid),
|
|
|
|
from_kuid(&init_user_ns,
|
2017-02-04 06:40:46 +08:00
|
|
|
context->binder_context_mgr_uid));
|
2014-06-04 03:27:21 +08:00
|
|
|
ret = -EPERM;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
} else {
|
2017-02-04 06:40:46 +08:00
|
|
|
context->binder_context_mgr_uid = curr_euid;
|
2014-06-04 03:27:21 +08:00
|
|
|
}
|
2017-02-04 06:40:46 +08:00
|
|
|
context->binder_context_mgr_node = binder_new_node(proc, 0, 0);
|
|
|
|
if (!context->binder_context_mgr_node) {
|
2014-06-04 03:27:21 +08:00
|
|
|
ret = -ENOMEM;
|
|
|
|
goto out;
|
|
|
|
}
|
2017-02-04 06:40:46 +08:00
|
|
|
context->binder_context_mgr_node->local_weak_refs++;
|
|
|
|
context->binder_context_mgr_node->local_strong_refs++;
|
|
|
|
context->binder_context_mgr_node->has_strong_ref = 1;
|
|
|
|
context->binder_context_mgr_node->has_weak_ref = 1;
|
2014-06-04 03:27:21 +08:00
|
|
|
out:
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
static long binder_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct binder_proc *proc = filp->private_data;
|
|
|
|
struct binder_thread *thread;
|
|
|
|
unsigned int size = _IOC_SIZE(cmd);
|
|
|
|
void __user *ubuf = (void __user *)arg;
|
|
|
|
|
2014-06-04 03:27:21 +08:00
|
|
|
/*pr_info("binder_ioctl: %d:%d %x %lx\n",
|
|
|
|
proc->pid, current->pid, cmd, arg);*/
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2012-10-17 06:29:53 +08:00
|
|
|
trace_binder_ioctl(cmd, arg);
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
ret = wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
|
|
|
|
if (ret)
|
2012-10-17 06:29:53 +08:00
|
|
|
goto err_unlocked;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_lock(__func__);
|
2011-11-30 19:18:14 +08:00
|
|
|
thread = binder_get_thread(proc);
|
|
|
|
if (thread == NULL) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (cmd) {
|
2014-06-04 03:27:21 +08:00
|
|
|
case BINDER_WRITE_READ:
|
|
|
|
ret = binder_ioctl_write_read(filp, cmd, arg, thread);
|
|
|
|
if (ret)
|
2011-11-30 19:18:14 +08:00
|
|
|
goto err;
|
|
|
|
break;
|
|
|
|
case BINDER_SET_MAX_THREADS:
|
|
|
|
if (copy_from_user(&proc->max_threads, ubuf, sizeof(proc->max_threads))) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case BINDER_SET_CONTEXT_MGR:
|
2014-06-04 03:27:21 +08:00
|
|
|
ret = binder_ioctl_set_ctx_mgr(filp);
|
|
|
|
if (ret)
|
2011-11-30 19:18:14 +08:00
|
|
|
goto err;
|
|
|
|
break;
|
|
|
|
case BINDER_THREAD_EXIT:
|
2012-10-31 01:05:43 +08:00
|
|
|
binder_debug(BINDER_DEBUG_THREADS, "%d:%d exit\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, thread->pid);
|
|
|
|
binder_free_thread(proc, thread);
|
|
|
|
thread = NULL;
|
|
|
|
break;
|
2014-04-15 18:03:05 +08:00
|
|
|
case BINDER_VERSION: {
|
|
|
|
struct binder_version __user *ver = ubuf;
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if (size != sizeof(struct binder_version)) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto err;
|
|
|
|
}
|
2014-04-15 18:03:05 +08:00
|
|
|
if (put_user(BINDER_CURRENT_PROTOCOL_VERSION,
|
|
|
|
&ver->protocol_version)) {
|
2011-11-30 19:18:14 +08:00
|
|
|
ret = -EINVAL;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
break;
|
2014-04-15 18:03:05 +08:00
|
|
|
}
|
2011-11-30 19:18:14 +08:00
|
|
|
default:
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto err;
|
|
|
|
}
|
|
|
|
ret = 0;
|
|
|
|
err:
|
|
|
|
if (thread)
|
|
|
|
thread->looper &= ~BINDER_LOOPER_STATE_NEED_RETURN;
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_unlock(__func__);
|
2011-11-30 19:18:14 +08:00
|
|
|
wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
|
|
|
|
if (ret && ret != -ERESTARTSYS)
|
2012-10-31 01:05:43 +08:00
|
|
|
pr_info("%d:%d ioctl %x %lx returned %d\n", proc->pid, current->pid, cmd, arg, ret);
|
2012-10-17 06:29:53 +08:00
|
|
|
err_unlocked:
|
|
|
|
trace_binder_ioctl_done(ret);
|
2011-11-30 19:18:14 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_vma_open(struct vm_area_struct *vma)
|
|
|
|
{
|
|
|
|
struct binder_proc *proc = vma->vm_private_data;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_debug(BINDER_DEBUG_OPEN_CLOSE,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, vma->vm_start, vma->vm_end,
|
|
|
|
(vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
|
|
|
|
(unsigned long)pgprot_val(vma->vm_page_prot));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_vma_close(struct vm_area_struct *vma)
|
|
|
|
{
|
|
|
|
struct binder_proc *proc = vma->vm_private_data;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_debug(BINDER_DEBUG_OPEN_CLOSE,
|
2012-10-31 01:05:43 +08:00
|
|
|
"%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, vma->vm_start, vma->vm_end,
|
|
|
|
(vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
|
|
|
|
(unsigned long)pgprot_val(vma->vm_page_prot));
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.vma = NULL;
|
|
|
|
proc->alloc.vma_vm_mm = NULL;
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_defer_work(proc, BINDER_DEFERRED_PUT_FILES);
|
|
|
|
}
|
|
|
|
|
2017-02-25 06:56:41 +08:00
|
|
|
static int binder_vm_fault(struct vm_fault *vmf)
|
2014-06-02 20:47:59 +08:00
|
|
|
{
|
|
|
|
return VM_FAULT_SIGBUS;
|
|
|
|
}
|
|
|
|
|
2015-09-10 06:39:26 +08:00
|
|
|
static const struct vm_operations_struct binder_vm_ops = {
|
2011-11-30 19:18:14 +08:00
|
|
|
.open = binder_vma_open,
|
|
|
|
.close = binder_vma_close,
|
2014-06-02 20:47:59 +08:00
|
|
|
.fault = binder_vm_fault,
|
2011-11-30 19:18:14 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static int binder_mmap(struct file *filp, struct vm_area_struct *vma)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct vm_struct *area;
|
|
|
|
struct binder_proc *proc = filp->private_data;
|
|
|
|
const char *failure_string;
|
|
|
|
struct binder_buffer *buffer;
|
|
|
|
|
2012-08-16 06:23:36 +08:00
|
|
|
if (proc->tsk != current)
|
|
|
|
return -EINVAL;
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
if ((vma->vm_end - vma->vm_start) > SZ_4M)
|
|
|
|
vma->vm_end = vma->vm_start + SZ_4M;
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_OPEN_CLOSE,
|
|
|
|
"binder_mmap: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
|
|
|
|
proc->pid, vma->vm_start, vma->vm_end,
|
|
|
|
(vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
|
|
|
|
(unsigned long)pgprot_val(vma->vm_page_prot));
|
|
|
|
|
|
|
|
if (vma->vm_flags & FORBIDDEN_MMAP_FLAGS) {
|
|
|
|
ret = -EPERM;
|
|
|
|
failure_string = "bad vm_flags";
|
|
|
|
goto err_bad_arg;
|
|
|
|
}
|
|
|
|
vma->vm_flags = (vma->vm_flags | VM_DONTCOPY) & ~VM_MAYWRITE;
|
|
|
|
|
2012-02-02 07:29:13 +08:00
|
|
|
mutex_lock(&binder_mmap_lock);
|
2017-06-30 03:01:38 +08:00
|
|
|
if (proc->alloc.buffer) {
|
2011-11-30 19:18:14 +08:00
|
|
|
ret = -EBUSY;
|
|
|
|
failure_string = "already mapped";
|
|
|
|
goto err_already_mapped;
|
|
|
|
}
|
|
|
|
|
|
|
|
area = get_vm_area(vma->vm_end - vma->vm_start, VM_IOREMAP);
|
|
|
|
if (area == NULL) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
failure_string = "get_vm_area";
|
|
|
|
goto err_get_vm_area_failed;
|
|
|
|
}
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.buffer = area->addr;
|
|
|
|
proc->alloc.user_buffer_offset =
|
|
|
|
vma->vm_start - (uintptr_t)proc->alloc.buffer;
|
2012-02-02 07:29:13 +08:00
|
|
|
mutex_unlock(&binder_mmap_lock);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
#ifdef CONFIG_CPU_CACHE_VIPT
|
|
|
|
if (cache_is_vipt_aliasing()) {
|
2017-06-30 03:01:38 +08:00
|
|
|
while (CACHE_COLOUR(
|
|
|
|
(vma->vm_start ^ (uint32_t)proc->alloc.buffer))) {
|
|
|
|
pr_info("%s: %d %lx-%lx maps %pK bad alignment\n",
|
|
|
|
__func__,
|
|
|
|
proc->pid, vma->vm_start,
|
|
|
|
vma->vm_end, proc->alloc.buffer);
|
2011-11-30 19:18:14 +08:00
|
|
|
vma->vm_start += PAGE_SIZE;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.pages =
|
|
|
|
kzalloc(sizeof(proc->alloc.pages[0]) *
|
|
|
|
((vma->vm_end - vma->vm_start) / PAGE_SIZE),
|
|
|
|
GFP_KERNEL);
|
|
|
|
if (proc->alloc.pages == NULL) {
|
2011-11-30 19:18:14 +08:00
|
|
|
ret = -ENOMEM;
|
|
|
|
failure_string = "alloc page array";
|
|
|
|
goto err_alloc_pages_failed;
|
|
|
|
}
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.buffer_size = vma->vm_end - vma->vm_start;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
vma->vm_ops = &binder_vm_ops;
|
|
|
|
vma->vm_private_data = proc;
|
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
if (binder_update_page_range(proc, 1, proc->alloc.buffer,
|
|
|
|
proc->alloc.buffer + PAGE_SIZE, vma)) {
|
2011-11-30 19:18:14 +08:00
|
|
|
ret = -ENOMEM;
|
|
|
|
failure_string = "alloc small buf";
|
|
|
|
goto err_alloc_small_buf_failed;
|
|
|
|
}
|
2017-06-30 03:01:38 +08:00
|
|
|
buffer = proc->alloc.buffer;
|
|
|
|
INIT_LIST_HEAD(&proc->alloc.buffers);
|
|
|
|
list_add(&buffer->entry, &proc->alloc.buffers);
|
2011-11-30 19:18:14 +08:00
|
|
|
buffer->free = 1;
|
|
|
|
binder_insert_free_buffer(proc, buffer);
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.free_async_space = proc->alloc.buffer_size / 2;
|
2011-11-30 19:18:14 +08:00
|
|
|
barrier();
|
2012-08-16 06:23:36 +08:00
|
|
|
proc->files = get_files_struct(current);
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->alloc.vma = vma;
|
|
|
|
proc->alloc.vma_vm_mm = vma->vm_mm;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
/*pr_info("binder_mmap: %d %lx-%lx maps %pK\n",
|
|
|
|
* proc->pid, vma->vm_start, vma->vm_end, proc->alloc.buffer);
|
|
|
|
*/
|
2011-11-30 19:18:14 +08:00
|
|
|
return 0;
|
|
|
|
|
|
|
|
err_alloc_small_buf_failed:
|
2017-06-30 03:01:38 +08:00
|
|
|
kfree(proc->alloc.pages);
|
|
|
|
proc->alloc.pages = NULL;
|
2011-11-30 19:18:14 +08:00
|
|
|
err_alloc_pages_failed:
|
2012-02-02 07:29:13 +08:00
|
|
|
mutex_lock(&binder_mmap_lock);
|
2017-06-30 03:01:38 +08:00
|
|
|
vfree(proc->alloc.buffer);
|
|
|
|
proc->alloc.buffer = NULL;
|
2011-11-30 19:18:14 +08:00
|
|
|
err_get_vm_area_failed:
|
|
|
|
err_already_mapped:
|
2012-02-02 07:29:13 +08:00
|
|
|
mutex_unlock(&binder_mmap_lock);
|
2011-11-30 19:18:14 +08:00
|
|
|
err_bad_arg:
|
2012-06-26 14:00:30 +08:00
|
|
|
pr_err("binder_mmap: %d %lx-%lx %s failed %d\n",
|
2011-11-30 19:18:14 +08:00
|
|
|
proc->pid, vma->vm_start, vma->vm_end, failure_string, ret);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_open(struct inode *nodp, struct file *filp)
|
|
|
|
{
|
|
|
|
struct binder_proc *proc;
|
2017-02-04 06:40:48 +08:00
|
|
|
struct binder_device *binder_dev;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_OPEN_CLOSE, "binder_open: %d:%d\n",
|
|
|
|
current->group_leader->pid, current->pid);
|
|
|
|
|
|
|
|
proc = kzalloc(sizeof(*proc), GFP_KERNEL);
|
|
|
|
if (proc == NULL)
|
|
|
|
return -ENOMEM;
|
2017-06-30 03:01:36 +08:00
|
|
|
get_task_struct(current->group_leader);
|
|
|
|
proc->tsk = current->group_leader;
|
2011-11-30 19:18:14 +08:00
|
|
|
INIT_LIST_HEAD(&proc->todo);
|
|
|
|
init_waitqueue_head(&proc->wait);
|
|
|
|
proc->default_priority = task_nice(current);
|
2017-02-04 06:40:48 +08:00
|
|
|
binder_dev = container_of(filp->private_data, struct binder_device,
|
|
|
|
miscdev);
|
|
|
|
proc->context = &binder_dev->context;
|
2012-10-17 06:29:53 +08:00
|
|
|
|
|
|
|
binder_lock(__func__);
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_stats_created(BINDER_STAT_PROC);
|
|
|
|
hlist_add_head(&proc->proc_node, &binder_procs);
|
|
|
|
proc->pid = current->group_leader->pid;
|
|
|
|
INIT_LIST_HEAD(&proc->delivered_death);
|
|
|
|
filp->private_data = proc;
|
2012-10-17 06:29:53 +08:00
|
|
|
|
|
|
|
binder_unlock(__func__);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
if (binder_debugfs_dir_entry_proc) {
|
2011-11-30 19:18:14 +08:00
|
|
|
char strbuf[11];
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
|
2017-02-04 06:40:47 +08:00
|
|
|
/*
|
|
|
|
* proc debug entries are shared between contexts, so
|
|
|
|
* this will fail if the process tries to open the driver
|
|
|
|
* again with a different context. The priting code will
|
|
|
|
* anyway print all contexts that a given PID has, so this
|
|
|
|
* is not a problem.
|
|
|
|
*/
|
2009-04-29 11:57:50 +08:00
|
|
|
proc->debugfs_entry = debugfs_create_file(strbuf, S_IRUGO,
|
2017-02-04 06:40:47 +08:00
|
|
|
binder_debugfs_dir_entry_proc,
|
|
|
|
(void *)(unsigned long)proc->pid,
|
|
|
|
&binder_proc_fops);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_flush(struct file *filp, fl_owner_t id)
|
|
|
|
{
|
|
|
|
struct binder_proc *proc = filp->private_data;
|
|
|
|
|
|
|
|
binder_defer_work(proc, BINDER_DEFERRED_FLUSH);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_deferred_flush(struct binder_proc *proc)
|
|
|
|
{
|
|
|
|
struct rb_node *n;
|
|
|
|
int wake_count = 0;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
|
|
|
|
struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node);
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
thread->looper |= BINDER_LOOPER_STATE_NEED_RETURN;
|
|
|
|
if (thread->looper & BINDER_LOOPER_STATE_WAITING) {
|
|
|
|
wake_up_interruptible(&thread->wait);
|
|
|
|
wake_count++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
wake_up_interruptible_all(&proc->wait);
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_OPEN_CLOSE,
|
|
|
|
"binder_flush: %d woke %d threads\n", proc->pid,
|
|
|
|
wake_count);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int binder_release(struct inode *nodp, struct file *filp)
|
|
|
|
{
|
|
|
|
struct binder_proc *proc = filp->private_data;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
debugfs_remove(proc->debugfs_entry);
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_defer_work(proc, BINDER_DEFERRED_RELEASE);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2013-03-12 18:41:59 +08:00
|
|
|
static int binder_node_release(struct binder_node *node, int refs)
|
|
|
|
{
|
|
|
|
struct binder_ref *ref;
|
|
|
|
int death = 0;
|
|
|
|
|
|
|
|
list_del_init(&node->work.entry);
|
|
|
|
binder_release_work(&node->async_todo);
|
|
|
|
|
|
|
|
if (hlist_empty(&node->refs)) {
|
|
|
|
kfree(node);
|
|
|
|
binder_stats_deleted(BINDER_STAT_NODE);
|
|
|
|
|
|
|
|
return refs;
|
|
|
|
}
|
|
|
|
|
|
|
|
node->proc = NULL;
|
|
|
|
node->local_strong_refs = 0;
|
|
|
|
node->local_weak_refs = 0;
|
|
|
|
hlist_add_head(&node->dead_node, &binder_dead_nodes);
|
|
|
|
|
|
|
|
hlist_for_each_entry(ref, &node->refs, node_entry) {
|
|
|
|
refs++;
|
|
|
|
|
|
|
|
if (!ref->death)
|
2014-02-18 05:58:29 +08:00
|
|
|
continue;
|
2013-03-12 18:41:59 +08:00
|
|
|
|
|
|
|
death++;
|
|
|
|
|
|
|
|
if (list_empty(&ref->death->work.entry)) {
|
|
|
|
ref->death->work.type = BINDER_WORK_DEAD_BINDER;
|
|
|
|
list_add_tail(&ref->death->work.entry,
|
|
|
|
&ref->proc->todo);
|
|
|
|
wake_up_interruptible(&ref->proc->wait);
|
|
|
|
} else
|
|
|
|
BUG();
|
|
|
|
}
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_DEAD_BINDER,
|
|
|
|
"node %d now dead, refs %d, death %d\n",
|
|
|
|
node->debug_id, refs, death);
|
|
|
|
|
|
|
|
return refs;
|
|
|
|
}
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
static void binder_deferred_release(struct binder_proc *proc)
|
|
|
|
{
|
2017-02-04 06:40:46 +08:00
|
|
|
struct binder_context *context = proc->context;
|
2011-11-30 19:18:14 +08:00
|
|
|
struct rb_node *n;
|
2013-03-12 18:42:00 +08:00
|
|
|
int threads, nodes, incoming_refs, outgoing_refs, buffers,
|
|
|
|
active_transactions, page_count;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
BUG_ON(proc->alloc.vma);
|
2011-11-30 19:18:14 +08:00
|
|
|
BUG_ON(proc->files);
|
|
|
|
|
|
|
|
hlist_del(&proc->proc_node);
|
2013-03-12 18:42:00 +08:00
|
|
|
|
2017-02-04 06:40:46 +08:00
|
|
|
if (context->binder_context_mgr_node &&
|
|
|
|
context->binder_context_mgr_node->proc == proc) {
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_debug(BINDER_DEBUG_DEAD_BINDER,
|
2013-03-12 18:42:02 +08:00
|
|
|
"%s: %d context_mgr_node gone\n",
|
|
|
|
__func__, proc->pid);
|
2017-02-04 06:40:46 +08:00
|
|
|
context->binder_context_mgr_node = NULL;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
threads = 0;
|
|
|
|
active_transactions = 0;
|
|
|
|
while ((n = rb_first(&proc->threads))) {
|
2013-03-12 18:42:00 +08:00
|
|
|
struct binder_thread *thread;
|
|
|
|
|
|
|
|
thread = rb_entry(n, struct binder_thread, rb_node);
|
2011-11-30 19:18:14 +08:00
|
|
|
threads++;
|
|
|
|
active_transactions += binder_free_thread(proc, thread);
|
|
|
|
}
|
2013-03-12 18:42:00 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
nodes = 0;
|
|
|
|
incoming_refs = 0;
|
|
|
|
while ((n = rb_first(&proc->nodes))) {
|
2013-03-12 18:42:00 +08:00
|
|
|
struct binder_node *node;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2013-03-12 18:42:00 +08:00
|
|
|
node = rb_entry(n, struct binder_node, rb_node);
|
2011-11-30 19:18:14 +08:00
|
|
|
nodes++;
|
|
|
|
rb_erase(&node->rb_node, &proc->nodes);
|
2013-03-12 18:41:59 +08:00
|
|
|
incoming_refs = binder_node_release(node, incoming_refs);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2013-03-12 18:42:00 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
outgoing_refs = 0;
|
|
|
|
while ((n = rb_first(&proc->refs_by_desc))) {
|
2013-03-12 18:42:00 +08:00
|
|
|
struct binder_ref *ref;
|
|
|
|
|
|
|
|
ref = rb_entry(n, struct binder_ref, rb_node_desc);
|
2011-11-30 19:18:14 +08:00
|
|
|
outgoing_refs++;
|
|
|
|
binder_delete_ref(ref);
|
|
|
|
}
|
2013-03-12 18:42:00 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_release_work(&proc->todo);
|
2012-10-17 06:29:54 +08:00
|
|
|
binder_release_work(&proc->delivered_death);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2013-03-12 18:42:00 +08:00
|
|
|
buffers = 0;
|
2017-06-30 03:01:38 +08:00
|
|
|
while ((n = rb_first(&proc->alloc.allocated_buffers))) {
|
2013-03-12 18:42:00 +08:00
|
|
|
struct binder_buffer *buffer;
|
|
|
|
|
|
|
|
buffer = rb_entry(n, struct binder_buffer, rb_node);
|
|
|
|
|
2017-06-30 03:01:39 +08:00
|
|
|
/* Transaction should already have been freed */
|
|
|
|
BUG_ON(buffer->transaction);
|
2013-03-12 18:42:00 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
binder_free_buf(proc, buffer);
|
|
|
|
buffers++;
|
|
|
|
}
|
|
|
|
|
|
|
|
binder_stats_deleted(BINDER_STAT_PROC);
|
|
|
|
|
|
|
|
page_count = 0;
|
2017-06-30 03:01:38 +08:00
|
|
|
if (proc->alloc.pages) {
|
2011-11-30 19:18:14 +08:00
|
|
|
int i;
|
2013-03-12 18:42:00 +08:00
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
for (i = 0; i < proc->alloc.buffer_size / PAGE_SIZE; i++) {
|
2013-03-12 18:42:01 +08:00
|
|
|
void *page_addr;
|
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
if (!proc->alloc.pages[i])
|
2013-03-12 18:42:01 +08:00
|
|
|
continue;
|
|
|
|
|
2017-06-30 03:01:38 +08:00
|
|
|
page_addr = proc->alloc.buffer + i * PAGE_SIZE;
|
2013-03-12 18:42:01 +08:00
|
|
|
binder_debug(BINDER_DEBUG_BUFFER_ALLOC,
|
2013-03-12 18:42:02 +08:00
|
|
|
"%s: %d: page %d at %p not freed\n",
|
|
|
|
__func__, proc->pid, i, page_addr);
|
2013-03-12 18:42:01 +08:00
|
|
|
unmap_kernel_range((unsigned long)page_addr, PAGE_SIZE);
|
2017-06-30 03:01:38 +08:00
|
|
|
__free_page(proc->alloc.pages[i]);
|
2013-03-12 18:42:01 +08:00
|
|
|
page_count++;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2017-06-30 03:01:38 +08:00
|
|
|
kfree(proc->alloc.pages);
|
|
|
|
vfree(proc->alloc.buffer);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
put_task_struct(proc->tsk);
|
|
|
|
|
|
|
|
binder_debug(BINDER_DEBUG_OPEN_CLOSE,
|
2013-03-12 18:42:02 +08:00
|
|
|
"%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d, buffers %d, pages %d\n",
|
|
|
|
__func__, proc->pid, threads, nodes, incoming_refs,
|
|
|
|
outgoing_refs, active_transactions, buffers, page_count);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
kfree(proc);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void binder_deferred_func(struct work_struct *work)
|
|
|
|
{
|
|
|
|
struct binder_proc *proc;
|
|
|
|
struct files_struct *files;
|
|
|
|
|
|
|
|
int defer;
|
2014-05-01 00:30:23 +08:00
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
do {
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_lock(__func__);
|
2011-11-30 19:18:14 +08:00
|
|
|
mutex_lock(&binder_deferred_lock);
|
|
|
|
if (!hlist_empty(&binder_deferred_list)) {
|
|
|
|
proc = hlist_entry(binder_deferred_list.first,
|
|
|
|
struct binder_proc, deferred_work_node);
|
|
|
|
hlist_del_init(&proc->deferred_work_node);
|
|
|
|
defer = proc->deferred_work;
|
|
|
|
proc->deferred_work = 0;
|
|
|
|
} else {
|
|
|
|
proc = NULL;
|
|
|
|
defer = 0;
|
|
|
|
}
|
|
|
|
mutex_unlock(&binder_deferred_lock);
|
|
|
|
|
|
|
|
files = NULL;
|
|
|
|
if (defer & BINDER_DEFERRED_PUT_FILES) {
|
|
|
|
files = proc->files;
|
|
|
|
if (files)
|
|
|
|
proc->files = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (defer & BINDER_DEFERRED_FLUSH)
|
|
|
|
binder_deferred_flush(proc);
|
|
|
|
|
|
|
|
if (defer & BINDER_DEFERRED_RELEASE)
|
|
|
|
binder_deferred_release(proc); /* frees proc */
|
|
|
|
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_unlock(__func__);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (files)
|
|
|
|
put_files_struct(files);
|
|
|
|
} while (proc);
|
|
|
|
}
|
|
|
|
static DECLARE_WORK(binder_deferred_work, binder_deferred_func);
|
|
|
|
|
|
|
|
static void
|
|
|
|
binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer)
|
|
|
|
{
|
|
|
|
mutex_lock(&binder_deferred_lock);
|
|
|
|
proc->deferred_work |= defer;
|
|
|
|
if (hlist_unhashed(&proc->deferred_work_node)) {
|
|
|
|
hlist_add_head(&proc->deferred_work_node,
|
|
|
|
&binder_deferred_list);
|
2016-08-14 00:46:24 +08:00
|
|
|
schedule_work(&binder_deferred_work);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
mutex_unlock(&binder_deferred_lock);
|
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_transaction(struct seq_file *m, const char *prefix,
|
|
|
|
struct binder_transaction *t)
|
|
|
|
{
|
|
|
|
seq_printf(m,
|
|
|
|
"%s %d: %p from %d:%d to %d:%d code %x flags %x pri %ld r%d",
|
|
|
|
prefix, t->debug_id, t,
|
|
|
|
t->from ? t->from->proc->pid : 0,
|
|
|
|
t->from ? t->from->pid : 0,
|
|
|
|
t->to_proc ? t->to_proc->pid : 0,
|
|
|
|
t->to_thread ? t->to_thread->pid : 0,
|
|
|
|
t->code, t->flags, t->priority, t->need_reply);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (t->buffer == NULL) {
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_puts(m, " buffer free\n");
|
|
|
|
return;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2009-04-29 11:57:50 +08:00
|
|
|
if (t->buffer->target_node)
|
|
|
|
seq_printf(m, " node %d",
|
|
|
|
t->buffer->target_node->debug_id);
|
|
|
|
seq_printf(m, " size %zd:%zd data %p\n",
|
|
|
|
t->buffer->data_size, t->buffer->offsets_size,
|
|
|
|
t->buffer->data);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_buffer(struct seq_file *m, const char *prefix,
|
|
|
|
struct binder_buffer *buffer)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "%s %d: %p size %zd:%zd %s\n",
|
|
|
|
prefix, buffer->debug_id, buffer->data,
|
|
|
|
buffer->data_size, buffer->offsets_size,
|
|
|
|
buffer->transaction ? "active" : "delivered");
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_work(struct seq_file *m, const char *prefix,
|
|
|
|
const char *transaction_prefix,
|
|
|
|
struct binder_work *w)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct binder_node *node;
|
|
|
|
struct binder_transaction *t;
|
|
|
|
|
|
|
|
switch (w->type) {
|
|
|
|
case BINDER_WORK_TRANSACTION:
|
|
|
|
t = container_of(w, struct binder_transaction, work);
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_transaction(m, transaction_prefix, t);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
case BINDER_WORK_TRANSACTION_COMPLETE:
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "%stransaction complete\n", prefix);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
case BINDER_WORK_NODE:
|
|
|
|
node = container_of(w, struct binder_node, work);
|
2014-02-22 06:40:26 +08:00
|
|
|
seq_printf(m, "%snode work %d: u%016llx c%016llx\n",
|
|
|
|
prefix, node->debug_id,
|
|
|
|
(u64)node->ptr, (u64)node->cookie);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
case BINDER_WORK_DEAD_BINDER:
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "%shas dead binder\n", prefix);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "%shas cleared dead binder\n", prefix);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
case BINDER_WORK_CLEAR_DEATH_NOTIFICATION:
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "%shas cleared death notification\n", prefix);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
default:
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "%sunknown work: type %d\n", prefix, w->type);
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_thread(struct seq_file *m,
|
|
|
|
struct binder_thread *thread,
|
|
|
|
int print_always)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct binder_transaction *t;
|
|
|
|
struct binder_work *w;
|
2009-04-29 11:57:50 +08:00
|
|
|
size_t start_pos = m->count;
|
|
|
|
size_t header_pos;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, " thread %d: l %02x\n", thread->pid, thread->looper);
|
|
|
|
header_pos = m->count;
|
2011-11-30 19:18:14 +08:00
|
|
|
t = thread->transaction_stack;
|
|
|
|
while (t) {
|
|
|
|
if (t->from == thread) {
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_transaction(m,
|
|
|
|
" outgoing transaction", t);
|
2011-11-30 19:18:14 +08:00
|
|
|
t = t->from_parent;
|
|
|
|
} else if (t->to_thread == thread) {
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_transaction(m,
|
|
|
|
" incoming transaction", t);
|
2011-11-30 19:18:14 +08:00
|
|
|
t = t->to_parent;
|
|
|
|
} else {
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_transaction(m, " bad transaction", t);
|
2011-11-30 19:18:14 +08:00
|
|
|
t = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
list_for_each_entry(w, &thread->todo, entry) {
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_work(m, " ", " pending transaction", w);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2009-04-29 11:57:50 +08:00
|
|
|
if (!print_always && m->count == header_pos)
|
|
|
|
m->count = start_pos;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_node(struct seq_file *m, struct binder_node *node)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct binder_ref *ref;
|
|
|
|
struct binder_work *w;
|
|
|
|
int count;
|
|
|
|
|
|
|
|
count = 0;
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 09:06:00 +08:00
|
|
|
hlist_for_each_entry(ref, &node->refs, node_entry)
|
2011-11-30 19:18:14 +08:00
|
|
|
count++;
|
|
|
|
|
2014-02-22 06:40:26 +08:00
|
|
|
seq_printf(m, " node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d",
|
|
|
|
node->debug_id, (u64)node->ptr, (u64)node->cookie,
|
2009-04-29 11:57:50 +08:00
|
|
|
node->has_strong_ref, node->has_weak_ref,
|
|
|
|
node->local_strong_refs, node->local_weak_refs,
|
|
|
|
node->internal_strong_refs, count);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (count) {
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_puts(m, " proc");
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 09:06:00 +08:00
|
|
|
hlist_for_each_entry(ref, &node->refs, node_entry)
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, " %d", ref->proc->pid);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_puts(m, "\n");
|
|
|
|
list_for_each_entry(w, &node->async_todo, entry)
|
|
|
|
print_binder_work(m, " ",
|
|
|
|
" pending async transaction", w);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_ref(struct seq_file *m, struct binder_ref *ref)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, " ref %d: desc %d %snode %d s %d w %d d %p\n",
|
|
|
|
ref->debug_id, ref->desc, ref->node->proc ? "" : "dead ",
|
|
|
|
ref->node->debug_id, ref->strong, ref->weak, ref->death);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_proc(struct seq_file *m,
|
|
|
|
struct binder_proc *proc, int print_all)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct binder_work *w;
|
|
|
|
struct rb_node *n;
|
2009-04-29 11:57:50 +08:00
|
|
|
size_t start_pos = m->count;
|
|
|
|
size_t header_pos;
|
|
|
|
|
|
|
|
seq_printf(m, "proc %d\n", proc->pid);
|
2017-02-04 06:40:47 +08:00
|
|
|
seq_printf(m, "context %s\n", proc->context->name);
|
2009-04-29 11:57:50 +08:00
|
|
|
header_pos = m->count;
|
|
|
|
|
|
|
|
for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
|
|
|
|
print_binder_thread(m, rb_entry(n, struct binder_thread,
|
|
|
|
rb_node), print_all);
|
|
|
|
for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_node *node = rb_entry(n, struct binder_node,
|
|
|
|
rb_node);
|
|
|
|
if (print_all || node->has_async_transaction)
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_node(m, node);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
if (print_all) {
|
|
|
|
for (n = rb_first(&proc->refs_by_desc);
|
2009-04-29 11:57:50 +08:00
|
|
|
n != NULL;
|
2011-11-30 19:18:14 +08:00
|
|
|
n = rb_next(n))
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_ref(m, rb_entry(n, struct binder_ref,
|
|
|
|
rb_node_desc));
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2017-06-30 03:01:38 +08:00
|
|
|
for (n = rb_first(&proc->alloc.allocated_buffers);
|
|
|
|
n != NULL; n = rb_next(n))
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_buffer(m, " buffer",
|
|
|
|
rb_entry(n, struct binder_buffer, rb_node));
|
|
|
|
list_for_each_entry(w, &proc->todo, entry)
|
|
|
|
print_binder_work(m, " ", " pending transaction", w);
|
2011-11-30 19:18:14 +08:00
|
|
|
list_for_each_entry(w, &proc->delivered_death, entry) {
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_puts(m, " has delivered dead binder\n");
|
2011-11-30 19:18:14 +08:00
|
|
|
break;
|
|
|
|
}
|
2009-04-29 11:57:50 +08:00
|
|
|
if (!print_all && m->count == header_pos)
|
|
|
|
m->count = start_pos;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2012-12-22 07:00:45 +08:00
|
|
|
static const char * const binder_return_strings[] = {
|
2011-11-30 19:18:14 +08:00
|
|
|
"BR_ERROR",
|
|
|
|
"BR_OK",
|
|
|
|
"BR_TRANSACTION",
|
|
|
|
"BR_REPLY",
|
|
|
|
"BR_ACQUIRE_RESULT",
|
|
|
|
"BR_DEAD_REPLY",
|
|
|
|
"BR_TRANSACTION_COMPLETE",
|
|
|
|
"BR_INCREFS",
|
|
|
|
"BR_ACQUIRE",
|
|
|
|
"BR_RELEASE",
|
|
|
|
"BR_DECREFS",
|
|
|
|
"BR_ATTEMPT_ACQUIRE",
|
|
|
|
"BR_NOOP",
|
|
|
|
"BR_SPAWN_LOOPER",
|
|
|
|
"BR_FINISHED",
|
|
|
|
"BR_DEAD_BINDER",
|
|
|
|
"BR_CLEAR_DEATH_NOTIFICATION_DONE",
|
|
|
|
"BR_FAILED_REPLY"
|
|
|
|
};
|
|
|
|
|
2012-12-22 07:00:45 +08:00
|
|
|
static const char * const binder_command_strings[] = {
|
2011-11-30 19:18:14 +08:00
|
|
|
"BC_TRANSACTION",
|
|
|
|
"BC_REPLY",
|
|
|
|
"BC_ACQUIRE_RESULT",
|
|
|
|
"BC_FREE_BUFFER",
|
|
|
|
"BC_INCREFS",
|
|
|
|
"BC_ACQUIRE",
|
|
|
|
"BC_RELEASE",
|
|
|
|
"BC_DECREFS",
|
|
|
|
"BC_INCREFS_DONE",
|
|
|
|
"BC_ACQUIRE_DONE",
|
|
|
|
"BC_ATTEMPT_ACQUIRE",
|
|
|
|
"BC_REGISTER_LOOPER",
|
|
|
|
"BC_ENTER_LOOPER",
|
|
|
|
"BC_EXIT_LOOPER",
|
|
|
|
"BC_REQUEST_DEATH_NOTIFICATION",
|
|
|
|
"BC_CLEAR_DEATH_NOTIFICATION",
|
2017-02-04 06:40:51 +08:00
|
|
|
"BC_DEAD_BINDER_DONE",
|
|
|
|
"BC_TRANSACTION_SG",
|
|
|
|
"BC_REPLY_SG",
|
2011-11-30 19:18:14 +08:00
|
|
|
};
|
|
|
|
|
2012-12-22 07:00:45 +08:00
|
|
|
static const char * const binder_objstat_strings[] = {
|
2011-11-30 19:18:14 +08:00
|
|
|
"proc",
|
|
|
|
"thread",
|
|
|
|
"node",
|
|
|
|
"ref",
|
|
|
|
"death",
|
|
|
|
"transaction",
|
|
|
|
"transaction_complete"
|
|
|
|
};
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_stats(struct seq_file *m, const char *prefix,
|
|
|
|
struct binder_stats *stats)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
BUILD_BUG_ON(ARRAY_SIZE(stats->bc) !=
|
2009-04-29 11:57:50 +08:00
|
|
|
ARRAY_SIZE(binder_command_strings));
|
2011-11-30 19:18:14 +08:00
|
|
|
for (i = 0; i < ARRAY_SIZE(stats->bc); i++) {
|
|
|
|
if (stats->bc[i])
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "%s%s: %d\n", prefix,
|
|
|
|
binder_command_strings[i], stats->bc[i]);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
BUILD_BUG_ON(ARRAY_SIZE(stats->br) !=
|
2009-04-29 11:57:50 +08:00
|
|
|
ARRAY_SIZE(binder_return_strings));
|
2011-11-30 19:18:14 +08:00
|
|
|
for (i = 0; i < ARRAY_SIZE(stats->br); i++) {
|
|
|
|
if (stats->br[i])
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "%s%s: %d\n", prefix,
|
|
|
|
binder_return_strings[i], stats->br[i]);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
|
2009-04-29 11:57:50 +08:00
|
|
|
ARRAY_SIZE(binder_objstat_strings));
|
2011-11-30 19:18:14 +08:00
|
|
|
BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
|
2009-04-29 11:57:50 +08:00
|
|
|
ARRAY_SIZE(stats->obj_deleted));
|
2011-11-30 19:18:14 +08:00
|
|
|
for (i = 0; i < ARRAY_SIZE(stats->obj_created); i++) {
|
|
|
|
if (stats->obj_created[i] || stats->obj_deleted[i])
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "%s%s: active %d total %d\n", prefix,
|
|
|
|
binder_objstat_strings[i],
|
|
|
|
stats->obj_created[i] - stats->obj_deleted[i],
|
|
|
|
stats->obj_created[i]);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_proc_stats(struct seq_file *m,
|
|
|
|
struct binder_proc *proc)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct binder_work *w;
|
|
|
|
struct rb_node *n;
|
|
|
|
int count, strong, weak;
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, "proc %d\n", proc->pid);
|
2017-02-04 06:40:47 +08:00
|
|
|
seq_printf(m, "context %s\n", proc->context->name);
|
2011-11-30 19:18:14 +08:00
|
|
|
count = 0;
|
|
|
|
for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
|
|
|
|
count++;
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, " threads: %d\n", count);
|
|
|
|
seq_printf(m, " requested threads: %d+%d/%d\n"
|
2011-11-30 19:18:14 +08:00
|
|
|
" ready threads %d\n"
|
|
|
|
" free async space %zd\n", proc->requested_threads,
|
|
|
|
proc->requested_threads_started, proc->max_threads,
|
2017-06-30 03:01:38 +08:00
|
|
|
proc->ready_threads, proc->alloc.free_async_space);
|
2011-11-30 19:18:14 +08:00
|
|
|
count = 0;
|
|
|
|
for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n))
|
|
|
|
count++;
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, " nodes: %d\n", count);
|
2011-11-30 19:18:14 +08:00
|
|
|
count = 0;
|
|
|
|
strong = 0;
|
|
|
|
weak = 0;
|
|
|
|
for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
|
|
|
|
struct binder_ref *ref = rb_entry(n, struct binder_ref,
|
|
|
|
rb_node_desc);
|
|
|
|
count++;
|
|
|
|
strong += ref->strong;
|
|
|
|
weak += ref->weak;
|
|
|
|
}
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, " refs: %d s %d w %d\n", count, strong, weak);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
count = 0;
|
2017-06-30 03:01:38 +08:00
|
|
|
for (n = rb_first(&proc->alloc.allocated_buffers);
|
|
|
|
n != NULL; n = rb_next(n))
|
2011-11-30 19:18:14 +08:00
|
|
|
count++;
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, " buffers: %d\n", count);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
count = 0;
|
|
|
|
list_for_each_entry(w, &proc->todo, entry) {
|
|
|
|
switch (w->type) {
|
|
|
|
case BINDER_WORK_TRANSACTION:
|
|
|
|
count++;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m, " pending transactions: %d\n", count);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_stats(m, " ", &proc->stats);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static int binder_state_show(struct seq_file *m, void *unused)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct binder_proc *proc;
|
|
|
|
struct binder_node *node;
|
|
|
|
int do_lock = !binder_debug_no_lock;
|
|
|
|
|
|
|
|
if (do_lock)
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_lock(__func__);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_puts(m, "binder state:\n");
|
2011-11-30 19:18:14 +08:00
|
|
|
|
|
|
|
if (!hlist_empty(&binder_dead_nodes))
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_puts(m, "dead nodes:\n");
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 09:06:00 +08:00
|
|
|
hlist_for_each_entry(node, &binder_dead_nodes, dead_node)
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_node(m, node);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 09:06:00 +08:00
|
|
|
hlist_for_each_entry(proc, &binder_procs, proc_node)
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_proc(m, proc, 1);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (do_lock)
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_unlock(__func__);
|
2009-04-29 11:57:50 +08:00
|
|
|
return 0;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static int binder_stats_show(struct seq_file *m, void *unused)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct binder_proc *proc;
|
|
|
|
int do_lock = !binder_debug_no_lock;
|
|
|
|
|
|
|
|
if (do_lock)
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_lock(__func__);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_puts(m, "binder stats:\n");
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_stats(m, "", &binder_stats);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 09:06:00 +08:00
|
|
|
hlist_for_each_entry(proc, &binder_procs, proc_node)
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_proc_stats(m, proc);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (do_lock)
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_unlock(__func__);
|
2009-04-29 11:57:50 +08:00
|
|
|
return 0;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static int binder_transactions_show(struct seq_file *m, void *unused)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
|
|
|
struct binder_proc *proc;
|
|
|
|
int do_lock = !binder_debug_no_lock;
|
|
|
|
|
|
|
|
if (do_lock)
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_lock(__func__);
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_puts(m, "binder transactions:\n");
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 09:06:00 +08:00
|
|
|
hlist_for_each_entry(proc, &binder_procs, proc_node)
|
2009-04-29 11:57:50 +08:00
|
|
|
print_binder_proc(m, proc, 0);
|
2011-11-30 19:18:14 +08:00
|
|
|
if (do_lock)
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_unlock(__func__);
|
2009-04-29 11:57:50 +08:00
|
|
|
return 0;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static int binder_proc_show(struct seq_file *m, void *unused)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2016-02-10 13:05:33 +08:00
|
|
|
struct binder_proc *itr;
|
2017-02-04 06:40:47 +08:00
|
|
|
int pid = (unsigned long)m->private;
|
2011-11-30 19:18:14 +08:00
|
|
|
int do_lock = !binder_debug_no_lock;
|
|
|
|
|
|
|
|
if (do_lock)
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_lock(__func__);
|
2016-02-10 13:05:33 +08:00
|
|
|
|
|
|
|
hlist_for_each_entry(itr, &binder_procs, proc_node) {
|
2017-02-04 06:40:47 +08:00
|
|
|
if (itr->pid == pid) {
|
|
|
|
seq_puts(m, "binder proc state:\n");
|
|
|
|
print_binder_proc(m, itr, 1);
|
2016-02-10 13:05:33 +08:00
|
|
|
}
|
|
|
|
}
|
2011-11-30 19:18:14 +08:00
|
|
|
if (do_lock)
|
2012-10-17 06:29:53 +08:00
|
|
|
binder_unlock(__func__);
|
2009-04-29 11:57:50 +08:00
|
|
|
return 0;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static void print_binder_transaction_log_entry(struct seq_file *m,
|
2011-11-30 19:18:14 +08:00
|
|
|
struct binder_transaction_log_entry *e)
|
|
|
|
{
|
2009-04-29 11:57:50 +08:00
|
|
|
seq_printf(m,
|
2017-02-04 06:40:47 +08:00
|
|
|
"%d: %s from %d:%d to %d:%d context %s node %d handle %d size %d:%d\n",
|
2009-04-29 11:57:50 +08:00
|
|
|
e->debug_id, (e->call_type == 2) ? "reply" :
|
|
|
|
((e->call_type == 1) ? "async" : "call "), e->from_proc,
|
2017-02-04 06:40:47 +08:00
|
|
|
e->from_thread, e->to_proc, e->to_thread, e->context_name,
|
|
|
|
e->to_node, e->target_handle, e->data_size, e->offsets_size);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
static int binder_transaction_log_show(struct seq_file *m, void *unused)
|
2011-11-30 19:18:14 +08:00
|
|
|
{
|
2009-04-29 11:57:50 +08:00
|
|
|
struct binder_transaction_log *log = m->private;
|
2011-11-30 19:18:14 +08:00
|
|
|
int i;
|
|
|
|
|
|
|
|
if (log->full) {
|
2009-04-29 11:57:50 +08:00
|
|
|
for (i = log->next; i < ARRAY_SIZE(log->entry); i++)
|
|
|
|
print_binder_transaction_log_entry(m, &log->entry[i]);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2009-04-29 11:57:50 +08:00
|
|
|
for (i = 0; i < log->next; i++)
|
|
|
|
print_binder_transaction_log_entry(m, &log->entry[i]);
|
|
|
|
return 0;
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static const struct file_operations binder_fops = {
|
|
|
|
.owner = THIS_MODULE,
|
|
|
|
.poll = binder_poll,
|
|
|
|
.unlocked_ioctl = binder_ioctl,
|
2014-02-22 06:40:26 +08:00
|
|
|
.compat_ioctl = binder_ioctl,
|
2011-11-30 19:18:14 +08:00
|
|
|
.mmap = binder_mmap,
|
|
|
|
.open = binder_open,
|
|
|
|
.flush = binder_flush,
|
|
|
|
.release = binder_release,
|
|
|
|
};
|
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
BINDER_DEBUG_ENTRY(state);
|
|
|
|
BINDER_DEBUG_ENTRY(stats);
|
|
|
|
BINDER_DEBUG_ENTRY(transactions);
|
|
|
|
BINDER_DEBUG_ENTRY(transaction_log);
|
|
|
|
|
2017-02-04 06:40:48 +08:00
|
|
|
static int __init init_binder_device(const char *name)
|
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct binder_device *binder_device;
|
|
|
|
|
|
|
|
binder_device = kzalloc(sizeof(*binder_device), GFP_KERNEL);
|
|
|
|
if (!binder_device)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
|
|
|
binder_device->miscdev.fops = &binder_fops;
|
|
|
|
binder_device->miscdev.minor = MISC_DYNAMIC_MINOR;
|
|
|
|
binder_device->miscdev.name = name;
|
|
|
|
|
|
|
|
binder_device->context.binder_context_mgr_uid = INVALID_UID;
|
|
|
|
binder_device->context.name = name;
|
|
|
|
|
|
|
|
ret = misc_register(&binder_device->miscdev);
|
|
|
|
if (ret < 0) {
|
|
|
|
kfree(binder_device);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
hlist_add_head(&binder_device->hlist, &binder_devices);
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
static int __init binder_init(void)
|
|
|
|
{
|
|
|
|
int ret;
|
2017-02-04 06:40:48 +08:00
|
|
|
char *device_name, *device_names;
|
|
|
|
struct binder_device *device;
|
|
|
|
struct hlist_node *tmp;
|
2011-11-30 19:18:14 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
binder_debugfs_dir_entry_root = debugfs_create_dir("binder", NULL);
|
|
|
|
if (binder_debugfs_dir_entry_root)
|
|
|
|
binder_debugfs_dir_entry_proc = debugfs_create_dir("proc",
|
|
|
|
binder_debugfs_dir_entry_root);
|
2017-02-04 06:40:48 +08:00
|
|
|
|
2009-04-29 11:57:50 +08:00
|
|
|
if (binder_debugfs_dir_entry_root) {
|
|
|
|
debugfs_create_file("state",
|
|
|
|
S_IRUGO,
|
|
|
|
binder_debugfs_dir_entry_root,
|
|
|
|
NULL,
|
|
|
|
&binder_state_fops);
|
|
|
|
debugfs_create_file("stats",
|
|
|
|
S_IRUGO,
|
|
|
|
binder_debugfs_dir_entry_root,
|
|
|
|
NULL,
|
|
|
|
&binder_stats_fops);
|
|
|
|
debugfs_create_file("transactions",
|
|
|
|
S_IRUGO,
|
|
|
|
binder_debugfs_dir_entry_root,
|
|
|
|
NULL,
|
|
|
|
&binder_transactions_fops);
|
|
|
|
debugfs_create_file("transaction_log",
|
|
|
|
S_IRUGO,
|
|
|
|
binder_debugfs_dir_entry_root,
|
|
|
|
&binder_transaction_log,
|
|
|
|
&binder_transaction_log_fops);
|
|
|
|
debugfs_create_file("failed_transaction_log",
|
|
|
|
S_IRUGO,
|
|
|
|
binder_debugfs_dir_entry_root,
|
|
|
|
&binder_transaction_log_failed,
|
|
|
|
&binder_transaction_log_fops);
|
2011-11-30 19:18:14 +08:00
|
|
|
}
|
2017-02-04 06:40:48 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy the module_parameter string, because we don't want to
|
|
|
|
* tokenize it in-place.
|
|
|
|
*/
|
|
|
|
device_names = kzalloc(strlen(binder_devices_param) + 1, GFP_KERNEL);
|
|
|
|
if (!device_names) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto err_alloc_device_names_failed;
|
|
|
|
}
|
|
|
|
strcpy(device_names, binder_devices_param);
|
|
|
|
|
|
|
|
while ((device_name = strsep(&device_names, ","))) {
|
|
|
|
ret = init_binder_device(device_name);
|
|
|
|
if (ret)
|
|
|
|
goto err_init_binder_device_failed;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
err_init_binder_device_failed:
|
|
|
|
hlist_for_each_entry_safe(device, tmp, &binder_devices, hlist) {
|
|
|
|
misc_deregister(&device->miscdev);
|
|
|
|
hlist_del(&device->hlist);
|
|
|
|
kfree(device);
|
|
|
|
}
|
|
|
|
err_alloc_device_names_failed:
|
|
|
|
debugfs_remove_recursive(binder_debugfs_dir_entry_root);
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
device_initcall(binder_init);
|
|
|
|
|
2012-10-17 06:29:53 +08:00
|
|
|
#define CREATE_TRACE_POINTS
|
|
|
|
#include "binder_trace.h"
|
|
|
|
|
2011-11-30 19:18:14 +08:00
|
|
|
MODULE_LICENSE("GPL v2");
|