]> Git Repo - linux.git/blob - drivers/android/binder.c
Merge tag 'soc-fsl-next-v5.3-2' of git://git.kernel.org/pub/scm/linux/kernel/git...
[linux.git] / drivers / android / binder.c
1 // SPDX-License-Identifier: GPL-2.0-only
2 /* binder.c
3  *
4  * Android IPC Subsystem
5  *
6  * Copyright (C) 2007-2008 Google, Inc.
7  */
8
9 /*
10  * Locking overview
11  *
12  * There are 3 main spinlocks which must be acquired in the
13  * order shown:
14  *
15  * 1) proc->outer_lock : protects binder_ref
16  *    binder_proc_lock() and binder_proc_unlock() are
17  *    used to acq/rel.
18  * 2) node->lock : protects most fields of binder_node.
19  *    binder_node_lock() and binder_node_unlock() are
20  *    used to acq/rel
21  * 3) proc->inner_lock : protects the thread and node lists
22  *    (proc->threads, proc->waiting_threads, proc->nodes)
23  *    and all todo lists associated with the binder_proc
24  *    (proc->todo, thread->todo, proc->delivered_death and
25  *    node->async_todo), as well as thread->transaction_stack
26  *    binder_inner_proc_lock() and binder_inner_proc_unlock()
27  *    are used to acq/rel
28  *
29  * Any lock under procA must never be nested under any lock at the same
30  * level or below on procB.
31  *
32  * Functions that require a lock held on entry indicate which lock
33  * in the suffix of the function name:
34  *
35  * foo_olocked() : requires node->outer_lock
36  * foo_nlocked() : requires node->lock
37  * foo_ilocked() : requires proc->inner_lock
38  * foo_oilocked(): requires proc->outer_lock and proc->inner_lock
39  * foo_nilocked(): requires node->lock and proc->inner_lock
40  * ...
41  */
42
43 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
44
45 #include <linux/fdtable.h>
46 #include <linux/file.h>
47 #include <linux/freezer.h>
48 #include <linux/fs.h>
49 #include <linux/list.h>
50 #include <linux/miscdevice.h>
51 #include <linux/module.h>
52 #include <linux/mutex.h>
53 #include <linux/nsproxy.h>
54 #include <linux/poll.h>
55 #include <linux/debugfs.h>
56 #include <linux/rbtree.h>
57 #include <linux/sched/signal.h>
58 #include <linux/sched/mm.h>
59 #include <linux/seq_file.h>
60 #include <linux/uaccess.h>
61 #include <linux/pid_namespace.h>
62 #include <linux/security.h>
63 #include <linux/spinlock.h>
64 #include <linux/ratelimit.h>
65 #include <linux/syscalls.h>
66 #include <linux/task_work.h>
67
68 #include <uapi/linux/android/binder.h>
69
70 #include <asm/cacheflush.h>
71
72 #include "binder_alloc.h"
73 #include "binder_internal.h"
74 #include "binder_trace.h"
75
76 static HLIST_HEAD(binder_deferred_list);
77 static DEFINE_MUTEX(binder_deferred_lock);
78
79 static HLIST_HEAD(binder_devices);
80 static HLIST_HEAD(binder_procs);
81 static DEFINE_MUTEX(binder_procs_lock);
82
83 static HLIST_HEAD(binder_dead_nodes);
84 static DEFINE_SPINLOCK(binder_dead_nodes_lock);
85
86 static struct dentry *binder_debugfs_dir_entry_root;
87 static struct dentry *binder_debugfs_dir_entry_proc;
88 static atomic_t binder_last_id;
89
90 static int proc_show(struct seq_file *m, void *unused);
91 DEFINE_SHOW_ATTRIBUTE(proc);
92
93 /* This is only defined in include/asm-arm/sizes.h */
94 #ifndef SZ_1K
95 #define SZ_1K                               0x400
96 #endif
97
98 #ifndef SZ_4M
99 #define SZ_4M                               0x400000
100 #endif
101
102 #define FORBIDDEN_MMAP_FLAGS                (VM_WRITE)
103
104 enum {
105         BINDER_DEBUG_USER_ERROR             = 1U << 0,
106         BINDER_DEBUG_FAILED_TRANSACTION     = 1U << 1,
107         BINDER_DEBUG_DEAD_TRANSACTION       = 1U << 2,
108         BINDER_DEBUG_OPEN_CLOSE             = 1U << 3,
109         BINDER_DEBUG_DEAD_BINDER            = 1U << 4,
110         BINDER_DEBUG_DEATH_NOTIFICATION     = 1U << 5,
111         BINDER_DEBUG_READ_WRITE             = 1U << 6,
112         BINDER_DEBUG_USER_REFS              = 1U << 7,
113         BINDER_DEBUG_THREADS                = 1U << 8,
114         BINDER_DEBUG_TRANSACTION            = 1U << 9,
115         BINDER_DEBUG_TRANSACTION_COMPLETE   = 1U << 10,
116         BINDER_DEBUG_FREE_BUFFER            = 1U << 11,
117         BINDER_DEBUG_INTERNAL_REFS          = 1U << 12,
118         BINDER_DEBUG_PRIORITY_CAP           = 1U << 13,
119         BINDER_DEBUG_SPINLOCKS              = 1U << 14,
120 };
121 static uint32_t binder_debug_mask = BINDER_DEBUG_USER_ERROR |
122         BINDER_DEBUG_FAILED_TRANSACTION | BINDER_DEBUG_DEAD_TRANSACTION;
123 module_param_named(debug_mask, binder_debug_mask, uint, 0644);
124
125 static char *binder_devices_param = CONFIG_ANDROID_BINDER_DEVICES;
126 module_param_named(devices, binder_devices_param, charp, 0444);
127
128 static DECLARE_WAIT_QUEUE_HEAD(binder_user_error_wait);
129 static int binder_stop_on_user_error;
130
131 static int binder_set_stop_on_user_error(const char *val,
132                                          const struct kernel_param *kp)
133 {
134         int ret;
135
136         ret = param_set_int(val, kp);
137         if (binder_stop_on_user_error < 2)
138                 wake_up(&binder_user_error_wait);
139         return ret;
140 }
141 module_param_call(stop_on_user_error, binder_set_stop_on_user_error,
142         param_get_int, &binder_stop_on_user_error, 0644);
143
144 #define binder_debug(mask, x...) \
145         do { \
146                 if (binder_debug_mask & mask) \
147                         pr_info_ratelimited(x); \
148         } while (0)
149
150 #define binder_user_error(x...) \
151         do { \
152                 if (binder_debug_mask & BINDER_DEBUG_USER_ERROR) \
153                         pr_info_ratelimited(x); \
154                 if (binder_stop_on_user_error) \
155                         binder_stop_on_user_error = 2; \
156         } while (0)
157
158 #define to_flat_binder_object(hdr) \
159         container_of(hdr, struct flat_binder_object, hdr)
160
161 #define to_binder_fd_object(hdr) container_of(hdr, struct binder_fd_object, hdr)
162
163 #define to_binder_buffer_object(hdr) \
164         container_of(hdr, struct binder_buffer_object, hdr)
165
166 #define to_binder_fd_array_object(hdr) \
167         container_of(hdr, struct binder_fd_array_object, hdr)
168
169 enum binder_stat_types {
170         BINDER_STAT_PROC,
171         BINDER_STAT_THREAD,
172         BINDER_STAT_NODE,
173         BINDER_STAT_REF,
174         BINDER_STAT_DEATH,
175         BINDER_STAT_TRANSACTION,
176         BINDER_STAT_TRANSACTION_COMPLETE,
177         BINDER_STAT_COUNT
178 };
179
180 struct binder_stats {
181         atomic_t br[_IOC_NR(BR_FAILED_REPLY) + 1];
182         atomic_t bc[_IOC_NR(BC_REPLY_SG) + 1];
183         atomic_t obj_created[BINDER_STAT_COUNT];
184         atomic_t obj_deleted[BINDER_STAT_COUNT];
185 };
186
187 static struct binder_stats binder_stats;
188
189 static inline void binder_stats_deleted(enum binder_stat_types type)
190 {
191         atomic_inc(&binder_stats.obj_deleted[type]);
192 }
193
194 static inline void binder_stats_created(enum binder_stat_types type)
195 {
196         atomic_inc(&binder_stats.obj_created[type]);
197 }
198
199 struct binder_transaction_log_entry {
200         int debug_id;
201         int debug_id_done;
202         int call_type;
203         int from_proc;
204         int from_thread;
205         int target_handle;
206         int to_proc;
207         int to_thread;
208         int to_node;
209         int data_size;
210         int offsets_size;
211         int return_error_line;
212         uint32_t return_error;
213         uint32_t return_error_param;
214         const char *context_name;
215 };
216 struct binder_transaction_log {
217         atomic_t cur;
218         bool full;
219         struct binder_transaction_log_entry entry[32];
220 };
221 static struct binder_transaction_log binder_transaction_log;
222 static struct binder_transaction_log binder_transaction_log_failed;
223
224 static struct binder_transaction_log_entry *binder_transaction_log_add(
225         struct binder_transaction_log *log)
226 {
227         struct binder_transaction_log_entry *e;
228         unsigned int cur = atomic_inc_return(&log->cur);
229
230         if (cur >= ARRAY_SIZE(log->entry))
231                 log->full = true;
232         e = &log->entry[cur % ARRAY_SIZE(log->entry)];
233         WRITE_ONCE(e->debug_id_done, 0);
234         /*
235          * write-barrier to synchronize access to e->debug_id_done.
236          * We make sure the initialized 0 value is seen before
237          * memset() other fields are zeroed by memset.
238          */
239         smp_wmb();
240         memset(e, 0, sizeof(*e));
241         return e;
242 }
243
244 /**
245  * struct binder_work - work enqueued on a worklist
246  * @entry:             node enqueued on list
247  * @type:              type of work to be performed
248  *
249  * There are separate work lists for proc, thread, and node (async).
250  */
251 struct binder_work {
252         struct list_head entry;
253
254         enum {
255                 BINDER_WORK_TRANSACTION = 1,
256                 BINDER_WORK_TRANSACTION_COMPLETE,
257                 BINDER_WORK_RETURN_ERROR,
258                 BINDER_WORK_NODE,
259                 BINDER_WORK_DEAD_BINDER,
260                 BINDER_WORK_DEAD_BINDER_AND_CLEAR,
261                 BINDER_WORK_CLEAR_DEATH_NOTIFICATION,
262         } type;
263 };
264
265 struct binder_error {
266         struct binder_work work;
267         uint32_t cmd;
268 };
269
270 /**
271  * struct binder_node - binder node bookkeeping
272  * @debug_id:             unique ID for debugging
273  *                        (invariant after initialized)
274  * @lock:                 lock for node fields
275  * @work:                 worklist element for node work
276  *                        (protected by @proc->inner_lock)
277  * @rb_node:              element for proc->nodes tree
278  *                        (protected by @proc->inner_lock)
279  * @dead_node:            element for binder_dead_nodes list
280  *                        (protected by binder_dead_nodes_lock)
281  * @proc:                 binder_proc that owns this node
282  *                        (invariant after initialized)
283  * @refs:                 list of references on this node
284  *                        (protected by @lock)
285  * @internal_strong_refs: used to take strong references when
286  *                        initiating a transaction
287  *                        (protected by @proc->inner_lock if @proc
288  *                        and by @lock)
289  * @local_weak_refs:      weak user refs from local process
290  *                        (protected by @proc->inner_lock if @proc
291  *                        and by @lock)
292  * @local_strong_refs:    strong user refs from local process
293  *                        (protected by @proc->inner_lock if @proc
294  *                        and by @lock)
295  * @tmp_refs:             temporary kernel refs
296  *                        (protected by @proc->inner_lock while @proc
297  *                        is valid, and by binder_dead_nodes_lock
298  *                        if @proc is NULL. During inc/dec and node release
299  *                        it is also protected by @lock to provide safety
300  *                        as the node dies and @proc becomes NULL)
301  * @ptr:                  userspace pointer for node
302  *                        (invariant, no lock needed)
303  * @cookie:               userspace cookie for node
304  *                        (invariant, no lock needed)
305  * @has_strong_ref:       userspace notified of strong ref
306  *                        (protected by @proc->inner_lock if @proc
307  *                        and by @lock)
308  * @pending_strong_ref:   userspace has acked notification of strong ref
309  *                        (protected by @proc->inner_lock if @proc
310  *                        and by @lock)
311  * @has_weak_ref:         userspace notified of weak ref
312  *                        (protected by @proc->inner_lock if @proc
313  *                        and by @lock)
314  * @pending_weak_ref:     userspace has acked notification of weak ref
315  *                        (protected by @proc->inner_lock if @proc
316  *                        and by @lock)
317  * @has_async_transaction: async transaction to node in progress
318  *                        (protected by @lock)
319  * @accept_fds:           file descriptor operations supported for node
320  *                        (invariant after initialized)
321  * @min_priority:         minimum scheduling priority
322  *                        (invariant after initialized)
323  * @txn_security_ctx:     require sender's security context
324  *                        (invariant after initialized)
325  * @async_todo:           list of async work items
326  *                        (protected by @proc->inner_lock)
327  *
328  * Bookkeeping structure for binder nodes.
329  */
330 struct binder_node {
331         int debug_id;
332         spinlock_t lock;
333         struct binder_work work;
334         union {
335                 struct rb_node rb_node;
336                 struct hlist_node dead_node;
337         };
338         struct binder_proc *proc;
339         struct hlist_head refs;
340         int internal_strong_refs;
341         int local_weak_refs;
342         int local_strong_refs;
343         int tmp_refs;
344         binder_uintptr_t ptr;
345         binder_uintptr_t cookie;
346         struct {
347                 /*
348                  * bitfield elements protected by
349                  * proc inner_lock
350                  */
351                 u8 has_strong_ref:1;
352                 u8 pending_strong_ref:1;
353                 u8 has_weak_ref:1;
354                 u8 pending_weak_ref:1;
355         };
356         struct {
357                 /*
358                  * invariant after initialization
359                  */
360                 u8 accept_fds:1;
361                 u8 txn_security_ctx:1;
362                 u8 min_priority;
363         };
364         bool has_async_transaction;
365         struct list_head async_todo;
366 };
367
368 struct binder_ref_death {
369         /**
370          * @work: worklist element for death notifications
371          *        (protected by inner_lock of the proc that
372          *        this ref belongs to)
373          */
374         struct binder_work work;
375         binder_uintptr_t cookie;
376 };
377
378 /**
379  * struct binder_ref_data - binder_ref counts and id
380  * @debug_id:        unique ID for the ref
381  * @desc:            unique userspace handle for ref
382  * @strong:          strong ref count (debugging only if not locked)
383  * @weak:            weak ref count (debugging only if not locked)
384  *
385  * Structure to hold ref count and ref id information. Since
386  * the actual ref can only be accessed with a lock, this structure
387  * is used to return information about the ref to callers of
388  * ref inc/dec functions.
389  */
390 struct binder_ref_data {
391         int debug_id;
392         uint32_t desc;
393         int strong;
394         int weak;
395 };
396
397 /**
398  * struct binder_ref - struct to track references on nodes
399  * @data:        binder_ref_data containing id, handle, and current refcounts
400  * @rb_node_desc: node for lookup by @data.desc in proc's rb_tree
401  * @rb_node_node: node for lookup by @node in proc's rb_tree
402  * @node_entry:  list entry for node->refs list in target node
403  *               (protected by @node->lock)
404  * @proc:        binder_proc containing ref
405  * @node:        binder_node of target node. When cleaning up a
406  *               ref for deletion in binder_cleanup_ref, a non-NULL
407  *               @node indicates the node must be freed
408  * @death:       pointer to death notification (ref_death) if requested
409  *               (protected by @node->lock)
410  *
411  * Structure to track references from procA to target node (on procB). This
412  * structure is unsafe to access without holding @proc->outer_lock.
413  */
414 struct binder_ref {
415         /* Lookups needed: */
416         /*   node + proc => ref (transaction) */
417         /*   desc + proc => ref (transaction, inc/dec ref) */
418         /*   node => refs + procs (proc exit) */
419         struct binder_ref_data data;
420         struct rb_node rb_node_desc;
421         struct rb_node rb_node_node;
422         struct hlist_node node_entry;
423         struct binder_proc *proc;
424         struct binder_node *node;
425         struct binder_ref_death *death;
426 };
427
428 enum binder_deferred_state {
429         BINDER_DEFERRED_FLUSH        = 0x01,
430         BINDER_DEFERRED_RELEASE      = 0x02,
431 };
432
433 /**
434  * struct binder_proc - binder process bookkeeping
435  * @proc_node:            element for binder_procs list
436  * @threads:              rbtree of binder_threads in this proc
437  *                        (protected by @inner_lock)
438  * @nodes:                rbtree of binder nodes associated with
439  *                        this proc ordered by node->ptr
440  *                        (protected by @inner_lock)
441  * @refs_by_desc:         rbtree of refs ordered by ref->desc
442  *                        (protected by @outer_lock)
443  * @refs_by_node:         rbtree of refs ordered by ref->node
444  *                        (protected by @outer_lock)
445  * @waiting_threads:      threads currently waiting for proc work
446  *                        (protected by @inner_lock)
447  * @pid                   PID of group_leader of process
448  *                        (invariant after initialized)
449  * @tsk                   task_struct for group_leader of process
450  *                        (invariant after initialized)
451  * @deferred_work_node:   element for binder_deferred_list
452  *                        (protected by binder_deferred_lock)
453  * @deferred_work:        bitmap of deferred work to perform
454  *                        (protected by binder_deferred_lock)
455  * @is_dead:              process is dead and awaiting free
456  *                        when outstanding transactions are cleaned up
457  *                        (protected by @inner_lock)
458  * @todo:                 list of work for this process
459  *                        (protected by @inner_lock)
460  * @stats:                per-process binder statistics
461  *                        (atomics, no lock needed)
462  * @delivered_death:      list of delivered death notification
463  *                        (protected by @inner_lock)
464  * @max_threads:          cap on number of binder threads
465  *                        (protected by @inner_lock)
466  * @requested_threads:    number of binder threads requested but not
467  *                        yet started. In current implementation, can
468  *                        only be 0 or 1.
469  *                        (protected by @inner_lock)
470  * @requested_threads_started: number binder threads started
471  *                        (protected by @inner_lock)
472  * @tmp_ref:              temporary reference to indicate proc is in use
473  *                        (protected by @inner_lock)
474  * @default_priority:     default scheduler priority
475  *                        (invariant after initialized)
476  * @debugfs_entry:        debugfs node
477  * @alloc:                binder allocator bookkeeping
478  * @context:              binder_context for this proc
479  *                        (invariant after initialized)
480  * @inner_lock:           can nest under outer_lock and/or node lock
481  * @outer_lock:           no nesting under innor or node lock
482  *                        Lock order: 1) outer, 2) node, 3) inner
483  *
484  * Bookkeeping structure for binder processes
485  */
486 struct binder_proc {
487         struct hlist_node proc_node;
488         struct rb_root threads;
489         struct rb_root nodes;
490         struct rb_root refs_by_desc;
491         struct rb_root refs_by_node;
492         struct list_head waiting_threads;
493         int pid;
494         struct task_struct *tsk;
495         struct hlist_node deferred_work_node;
496         int deferred_work;
497         bool is_dead;
498
499         struct list_head todo;
500         struct binder_stats stats;
501         struct list_head delivered_death;
502         int max_threads;
503         int requested_threads;
504         int requested_threads_started;
505         int tmp_ref;
506         long default_priority;
507         struct dentry *debugfs_entry;
508         struct binder_alloc alloc;
509         struct binder_context *context;
510         spinlock_t inner_lock;
511         spinlock_t outer_lock;
512 };
513
514 enum {
515         BINDER_LOOPER_STATE_REGISTERED  = 0x01,
516         BINDER_LOOPER_STATE_ENTERED     = 0x02,
517         BINDER_LOOPER_STATE_EXITED      = 0x04,
518         BINDER_LOOPER_STATE_INVALID     = 0x08,
519         BINDER_LOOPER_STATE_WAITING     = 0x10,
520         BINDER_LOOPER_STATE_POLL        = 0x20,
521 };
522
523 /**
524  * struct binder_thread - binder thread bookkeeping
525  * @proc:                 binder process for this thread
526  *                        (invariant after initialization)
527  * @rb_node:              element for proc->threads rbtree
528  *                        (protected by @proc->inner_lock)
529  * @waiting_thread_node:  element for @proc->waiting_threads list
530  *                        (protected by @proc->inner_lock)
531  * @pid:                  PID for this thread
532  *                        (invariant after initialization)
533  * @looper:               bitmap of looping state
534  *                        (only accessed by this thread)
535  * @looper_needs_return:  looping thread needs to exit driver
536  *                        (no lock needed)
537  * @transaction_stack:    stack of in-progress transactions for this thread
538  *                        (protected by @proc->inner_lock)
539  * @todo:                 list of work to do for this thread
540  *                        (protected by @proc->inner_lock)
541  * @process_todo:         whether work in @todo should be processed
542  *                        (protected by @proc->inner_lock)
543  * @return_error:         transaction errors reported by this thread
544  *                        (only accessed by this thread)
545  * @reply_error:          transaction errors reported by target thread
546  *                        (protected by @proc->inner_lock)
547  * @wait:                 wait queue for thread work
548  * @stats:                per-thread statistics
549  *                        (atomics, no lock needed)
550  * @tmp_ref:              temporary reference to indicate thread is in use
551  *                        (atomic since @proc->inner_lock cannot
552  *                        always be acquired)
553  * @is_dead:              thread is dead and awaiting free
554  *                        when outstanding transactions are cleaned up
555  *                        (protected by @proc->inner_lock)
556  *
557  * Bookkeeping structure for binder threads.
558  */
559 struct binder_thread {
560         struct binder_proc *proc;
561         struct rb_node rb_node;
562         struct list_head waiting_thread_node;
563         int pid;
564         int looper;              /* only modified by this thread */
565         bool looper_need_return; /* can be written by other thread */
566         struct binder_transaction *transaction_stack;
567         struct list_head todo;
568         bool process_todo;
569         struct binder_error return_error;
570         struct binder_error reply_error;
571         wait_queue_head_t wait;
572         struct binder_stats stats;
573         atomic_t tmp_ref;
574         bool is_dead;
575 };
576
577 /**
578  * struct binder_txn_fd_fixup - transaction fd fixup list element
579  * @fixup_entry:          list entry
580  * @file:                 struct file to be associated with new fd
581  * @offset:               offset in buffer data to this fixup
582  *
583  * List element for fd fixups in a transaction. Since file
584  * descriptors need to be allocated in the context of the
585  * target process, we pass each fd to be processed in this
586  * struct.
587  */
588 struct binder_txn_fd_fixup {
589         struct list_head fixup_entry;
590         struct file *file;
591         size_t offset;
592 };
593
594 struct binder_transaction {
595         int debug_id;
596         struct binder_work work;
597         struct binder_thread *from;
598         struct binder_transaction *from_parent;
599         struct binder_proc *to_proc;
600         struct binder_thread *to_thread;
601         struct binder_transaction *to_parent;
602         unsigned need_reply:1;
603         /* unsigned is_dead:1; */       /* not used at the moment */
604
605         struct binder_buffer *buffer;
606         unsigned int    code;
607         unsigned int    flags;
608         long    priority;
609         long    saved_priority;
610         kuid_t  sender_euid;
611         struct list_head fd_fixups;
612         binder_uintptr_t security_ctx;
613         /**
614          * @lock:  protects @from, @to_proc, and @to_thread
615          *
616          * @from, @to_proc, and @to_thread can be set to NULL
617          * during thread teardown
618          */
619         spinlock_t lock;
620 };
621
622 /**
623  * struct binder_object - union of flat binder object types
624  * @hdr:   generic object header
625  * @fbo:   binder object (nodes and refs)
626  * @fdo:   file descriptor object
627  * @bbo:   binder buffer pointer
628  * @fdao:  file descriptor array
629  *
630  * Used for type-independent object copies
631  */
632 struct binder_object {
633         union {
634                 struct binder_object_header hdr;
635                 struct flat_binder_object fbo;
636                 struct binder_fd_object fdo;
637                 struct binder_buffer_object bbo;
638                 struct binder_fd_array_object fdao;
639         };
640 };
641
642 /**
643  * binder_proc_lock() - Acquire outer lock for given binder_proc
644  * @proc:         struct binder_proc to acquire
645  *
646  * Acquires proc->outer_lock. Used to protect binder_ref
647  * structures associated with the given proc.
648  */
649 #define binder_proc_lock(proc) _binder_proc_lock(proc, __LINE__)
650 static void
651 _binder_proc_lock(struct binder_proc *proc, int line)
652         __acquires(&proc->outer_lock)
653 {
654         binder_debug(BINDER_DEBUG_SPINLOCKS,
655                      "%s: line=%d\n", __func__, line);
656         spin_lock(&proc->outer_lock);
657 }
658
659 /**
660  * binder_proc_unlock() - Release spinlock for given binder_proc
661  * @proc:         struct binder_proc to acquire
662  *
663  * Release lock acquired via binder_proc_lock()
664  */
665 #define binder_proc_unlock(_proc) _binder_proc_unlock(_proc, __LINE__)
666 static void
667 _binder_proc_unlock(struct binder_proc *proc, int line)
668         __releases(&proc->outer_lock)
669 {
670         binder_debug(BINDER_DEBUG_SPINLOCKS,
671                      "%s: line=%d\n", __func__, line);
672         spin_unlock(&proc->outer_lock);
673 }
674
675 /**
676  * binder_inner_proc_lock() - Acquire inner lock for given binder_proc
677  * @proc:         struct binder_proc to acquire
678  *
679  * Acquires proc->inner_lock. Used to protect todo lists
680  */
681 #define binder_inner_proc_lock(proc) _binder_inner_proc_lock(proc, __LINE__)
682 static void
683 _binder_inner_proc_lock(struct binder_proc *proc, int line)
684         __acquires(&proc->inner_lock)
685 {
686         binder_debug(BINDER_DEBUG_SPINLOCKS,
687                      "%s: line=%d\n", __func__, line);
688         spin_lock(&proc->inner_lock);
689 }
690
691 /**
692  * binder_inner_proc_unlock() - Release inner lock for given binder_proc
693  * @proc:         struct binder_proc to acquire
694  *
695  * Release lock acquired via binder_inner_proc_lock()
696  */
697 #define binder_inner_proc_unlock(proc) _binder_inner_proc_unlock(proc, __LINE__)
698 static void
699 _binder_inner_proc_unlock(struct binder_proc *proc, int line)
700         __releases(&proc->inner_lock)
701 {
702         binder_debug(BINDER_DEBUG_SPINLOCKS,
703                      "%s: line=%d\n", __func__, line);
704         spin_unlock(&proc->inner_lock);
705 }
706
707 /**
708  * binder_node_lock() - Acquire spinlock for given binder_node
709  * @node:         struct binder_node to acquire
710  *
711  * Acquires node->lock. Used to protect binder_node fields
712  */
713 #define binder_node_lock(node) _binder_node_lock(node, __LINE__)
714 static void
715 _binder_node_lock(struct binder_node *node, int line)
716         __acquires(&node->lock)
717 {
718         binder_debug(BINDER_DEBUG_SPINLOCKS,
719                      "%s: line=%d\n", __func__, line);
720         spin_lock(&node->lock);
721 }
722
723 /**
724  * binder_node_unlock() - Release spinlock for given binder_proc
725  * @node:         struct binder_node to acquire
726  *
727  * Release lock acquired via binder_node_lock()
728  */
729 #define binder_node_unlock(node) _binder_node_unlock(node, __LINE__)
730 static void
731 _binder_node_unlock(struct binder_node *node, int line)
732         __releases(&node->lock)
733 {
734         binder_debug(BINDER_DEBUG_SPINLOCKS,
735                      "%s: line=%d\n", __func__, line);
736         spin_unlock(&node->lock);
737 }
738
739 /**
740  * binder_node_inner_lock() - Acquire node and inner locks
741  * @node:         struct binder_node to acquire
742  *
743  * Acquires node->lock. If node->proc also acquires
744  * proc->inner_lock. Used to protect binder_node fields
745  */
746 #define binder_node_inner_lock(node) _binder_node_inner_lock(node, __LINE__)
747 static void
748 _binder_node_inner_lock(struct binder_node *node, int line)
749         __acquires(&node->lock) __acquires(&node->proc->inner_lock)
750 {
751         binder_debug(BINDER_DEBUG_SPINLOCKS,
752                      "%s: line=%d\n", __func__, line);
753         spin_lock(&node->lock);
754         if (node->proc)
755                 binder_inner_proc_lock(node->proc);
756         else
757                 /* annotation for sparse */
758                 __acquire(&node->proc->inner_lock);
759 }
760
761 /**
762  * binder_node_unlock() - Release node and inner locks
763  * @node:         struct binder_node to acquire
764  *
765  * Release lock acquired via binder_node_lock()
766  */
767 #define binder_node_inner_unlock(node) _binder_node_inner_unlock(node, __LINE__)
768 static void
769 _binder_node_inner_unlock(struct binder_node *node, int line)
770         __releases(&node->lock) __releases(&node->proc->inner_lock)
771 {
772         struct binder_proc *proc = node->proc;
773
774         binder_debug(BINDER_DEBUG_SPINLOCKS,
775                      "%s: line=%d\n", __func__, line);
776         if (proc)
777                 binder_inner_proc_unlock(proc);
778         else
779                 /* annotation for sparse */
780                 __release(&node->proc->inner_lock);
781         spin_unlock(&node->lock);
782 }
783
784 static bool binder_worklist_empty_ilocked(struct list_head *list)
785 {
786         return list_empty(list);
787 }
788
789 /**
790  * binder_worklist_empty() - Check if no items on the work list
791  * @proc:       binder_proc associated with list
792  * @list:       list to check
793  *
794  * Return: true if there are no items on list, else false
795  */
796 static bool binder_worklist_empty(struct binder_proc *proc,
797                                   struct list_head *list)
798 {
799         bool ret;
800
801         binder_inner_proc_lock(proc);
802         ret = binder_worklist_empty_ilocked(list);
803         binder_inner_proc_unlock(proc);
804         return ret;
805 }
806
807 /**
808  * binder_enqueue_work_ilocked() - Add an item to the work list
809  * @work:         struct binder_work to add to list
810  * @target_list:  list to add work to
811  *
812  * Adds the work to the specified list. Asserts that work
813  * is not already on a list.
814  *
815  * Requires the proc->inner_lock to be held.
816  */
817 static void
818 binder_enqueue_work_ilocked(struct binder_work *work,
819                            struct list_head *target_list)
820 {
821         BUG_ON(target_list == NULL);
822         BUG_ON(work->entry.next && !list_empty(&work->entry));
823         list_add_tail(&work->entry, target_list);
824 }
825
826 /**
827  * binder_enqueue_deferred_thread_work_ilocked() - Add deferred thread work
828  * @thread:       thread to queue work to
829  * @work:         struct binder_work to add to list
830  *
831  * Adds the work to the todo list of the thread. Doesn't set the process_todo
832  * flag, which means that (if it wasn't already set) the thread will go to
833  * sleep without handling this work when it calls read.
834  *
835  * Requires the proc->inner_lock to be held.
836  */
837 static void
838 binder_enqueue_deferred_thread_work_ilocked(struct binder_thread *thread,
839                                             struct binder_work *work)
840 {
841         WARN_ON(!list_empty(&thread->waiting_thread_node));
842         binder_enqueue_work_ilocked(work, &thread->todo);
843 }
844
845 /**
846  * binder_enqueue_thread_work_ilocked() - Add an item to the thread work list
847  * @thread:       thread to queue work to
848  * @work:         struct binder_work to add to list
849  *
850  * Adds the work to the todo list of the thread, and enables processing
851  * of the todo queue.
852  *
853  * Requires the proc->inner_lock to be held.
854  */
855 static void
856 binder_enqueue_thread_work_ilocked(struct binder_thread *thread,
857                                    struct binder_work *work)
858 {
859         WARN_ON(!list_empty(&thread->waiting_thread_node));
860         binder_enqueue_work_ilocked(work, &thread->todo);
861         thread->process_todo = true;
862 }
863
864 /**
865  * binder_enqueue_thread_work() - Add an item to the thread work list
866  * @thread:       thread to queue work to
867  * @work:         struct binder_work to add to list
868  *
869  * Adds the work to the todo list of the thread, and enables processing
870  * of the todo queue.
871  */
872 static void
873 binder_enqueue_thread_work(struct binder_thread *thread,
874                            struct binder_work *work)
875 {
876         binder_inner_proc_lock(thread->proc);
877         binder_enqueue_thread_work_ilocked(thread, work);
878         binder_inner_proc_unlock(thread->proc);
879 }
880
881 static void
882 binder_dequeue_work_ilocked(struct binder_work *work)
883 {
884         list_del_init(&work->entry);
885 }
886
887 /**
888  * binder_dequeue_work() - Removes an item from the work list
889  * @proc:         binder_proc associated with list
890  * @work:         struct binder_work to remove from list
891  *
892  * Removes the specified work item from whatever list it is on.
893  * Can safely be called if work is not on any list.
894  */
895 static void
896 binder_dequeue_work(struct binder_proc *proc, struct binder_work *work)
897 {
898         binder_inner_proc_lock(proc);
899         binder_dequeue_work_ilocked(work);
900         binder_inner_proc_unlock(proc);
901 }
902
903 static struct binder_work *binder_dequeue_work_head_ilocked(
904                                         struct list_head *list)
905 {
906         struct binder_work *w;
907
908         w = list_first_entry_or_null(list, struct binder_work, entry);
909         if (w)
910                 list_del_init(&w->entry);
911         return w;
912 }
913
914 /**
915  * binder_dequeue_work_head() - Dequeues the item at head of list
916  * @proc:         binder_proc associated with list
917  * @list:         list to dequeue head
918  *
919  * Removes the head of the list if there are items on the list
920  *
921  * Return: pointer dequeued binder_work, NULL if list was empty
922  */
923 static struct binder_work *binder_dequeue_work_head(
924                                         struct binder_proc *proc,
925                                         struct list_head *list)
926 {
927         struct binder_work *w;
928
929         binder_inner_proc_lock(proc);
930         w = binder_dequeue_work_head_ilocked(list);
931         binder_inner_proc_unlock(proc);
932         return w;
933 }
934
935 static void
936 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer);
937 static void binder_free_thread(struct binder_thread *thread);
938 static void binder_free_proc(struct binder_proc *proc);
939 static void binder_inc_node_tmpref_ilocked(struct binder_node *node);
940
941 static bool binder_has_work_ilocked(struct binder_thread *thread,
942                                     bool do_proc_work)
943 {
944         return thread->process_todo ||
945                 thread->looper_need_return ||
946                 (do_proc_work &&
947                  !binder_worklist_empty_ilocked(&thread->proc->todo));
948 }
949
950 static bool binder_has_work(struct binder_thread *thread, bool do_proc_work)
951 {
952         bool has_work;
953
954         binder_inner_proc_lock(thread->proc);
955         has_work = binder_has_work_ilocked(thread, do_proc_work);
956         binder_inner_proc_unlock(thread->proc);
957
958         return has_work;
959 }
960
961 static bool binder_available_for_proc_work_ilocked(struct binder_thread *thread)
962 {
963         return !thread->transaction_stack &&
964                 binder_worklist_empty_ilocked(&thread->todo) &&
965                 (thread->looper & (BINDER_LOOPER_STATE_ENTERED |
966                                    BINDER_LOOPER_STATE_REGISTERED));
967 }
968
969 static void binder_wakeup_poll_threads_ilocked(struct binder_proc *proc,
970                                                bool sync)
971 {
972         struct rb_node *n;
973         struct binder_thread *thread;
974
975         for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
976                 thread = rb_entry(n, struct binder_thread, rb_node);
977                 if (thread->looper & BINDER_LOOPER_STATE_POLL &&
978                     binder_available_for_proc_work_ilocked(thread)) {
979                         if (sync)
980                                 wake_up_interruptible_sync(&thread->wait);
981                         else
982                                 wake_up_interruptible(&thread->wait);
983                 }
984         }
985 }
986
987 /**
988  * binder_select_thread_ilocked() - selects a thread for doing proc work.
989  * @proc:       process to select a thread from
990  *
991  * Note that calling this function moves the thread off the waiting_threads
992  * list, so it can only be woken up by the caller of this function, or a
993  * signal. Therefore, callers *should* always wake up the thread this function
994  * returns.
995  *
996  * Return:      If there's a thread currently waiting for process work,
997  *              returns that thread. Otherwise returns NULL.
998  */
999 static struct binder_thread *
1000 binder_select_thread_ilocked(struct binder_proc *proc)
1001 {
1002         struct binder_thread *thread;
1003
1004         assert_spin_locked(&proc->inner_lock);
1005         thread = list_first_entry_or_null(&proc->waiting_threads,
1006                                           struct binder_thread,
1007                                           waiting_thread_node);
1008
1009         if (thread)
1010                 list_del_init(&thread->waiting_thread_node);
1011
1012         return thread;
1013 }
1014
1015 /**
1016  * binder_wakeup_thread_ilocked() - wakes up a thread for doing proc work.
1017  * @proc:       process to wake up a thread in
1018  * @thread:     specific thread to wake-up (may be NULL)
1019  * @sync:       whether to do a synchronous wake-up
1020  *
1021  * This function wakes up a thread in the @proc process.
1022  * The caller may provide a specific thread to wake-up in
1023  * the @thread parameter. If @thread is NULL, this function
1024  * will wake up threads that have called poll().
1025  *
1026  * Note that for this function to work as expected, callers
1027  * should first call binder_select_thread() to find a thread
1028  * to handle the work (if they don't have a thread already),
1029  * and pass the result into the @thread parameter.
1030  */
1031 static void binder_wakeup_thread_ilocked(struct binder_proc *proc,
1032                                          struct binder_thread *thread,
1033                                          bool sync)
1034 {
1035         assert_spin_locked(&proc->inner_lock);
1036
1037         if (thread) {
1038                 if (sync)
1039                         wake_up_interruptible_sync(&thread->wait);
1040                 else
1041                         wake_up_interruptible(&thread->wait);
1042                 return;
1043         }
1044
1045         /* Didn't find a thread waiting for proc work; this can happen
1046          * in two scenarios:
1047          * 1. All threads are busy handling transactions
1048          *    In that case, one of those threads should call back into
1049          *    the kernel driver soon and pick up this work.
1050          * 2. Threads are using the (e)poll interface, in which case
1051          *    they may be blocked on the waitqueue without having been
1052          *    added to waiting_threads. For this case, we just iterate
1053          *    over all threads not handling transaction work, and
1054          *    wake them all up. We wake all because we don't know whether
1055          *    a thread that called into (e)poll is handling non-binder
1056          *    work currently.
1057          */
1058         binder_wakeup_poll_threads_ilocked(proc, sync);
1059 }
1060
1061 static void binder_wakeup_proc_ilocked(struct binder_proc *proc)
1062 {
1063         struct binder_thread *thread = binder_select_thread_ilocked(proc);
1064
1065         binder_wakeup_thread_ilocked(proc, thread, /* sync = */false);
1066 }
1067
1068 static void binder_set_nice(long nice)
1069 {
1070         long min_nice;
1071
1072         if (can_nice(current, nice)) {
1073                 set_user_nice(current, nice);
1074                 return;
1075         }
1076         min_nice = rlimit_to_nice(rlimit(RLIMIT_NICE));
1077         binder_debug(BINDER_DEBUG_PRIORITY_CAP,
1078                      "%d: nice value %ld not allowed use %ld instead\n",
1079                       current->pid, nice, min_nice);
1080         set_user_nice(current, min_nice);
1081         if (min_nice <= MAX_NICE)
1082                 return;
1083         binder_user_error("%d RLIMIT_NICE not set\n", current->pid);
1084 }
1085
1086 static struct binder_node *binder_get_node_ilocked(struct binder_proc *proc,
1087                                                    binder_uintptr_t ptr)
1088 {
1089         struct rb_node *n = proc->nodes.rb_node;
1090         struct binder_node *node;
1091
1092         assert_spin_locked(&proc->inner_lock);
1093
1094         while (n) {
1095                 node = rb_entry(n, struct binder_node, rb_node);
1096
1097                 if (ptr < node->ptr)
1098                         n = n->rb_left;
1099                 else if (ptr > node->ptr)
1100                         n = n->rb_right;
1101                 else {
1102                         /*
1103                          * take an implicit weak reference
1104                          * to ensure node stays alive until
1105                          * call to binder_put_node()
1106                          */
1107                         binder_inc_node_tmpref_ilocked(node);
1108                         return node;
1109                 }
1110         }
1111         return NULL;
1112 }
1113
1114 static struct binder_node *binder_get_node(struct binder_proc *proc,
1115                                            binder_uintptr_t ptr)
1116 {
1117         struct binder_node *node;
1118
1119         binder_inner_proc_lock(proc);
1120         node = binder_get_node_ilocked(proc, ptr);
1121         binder_inner_proc_unlock(proc);
1122         return node;
1123 }
1124
1125 static struct binder_node *binder_init_node_ilocked(
1126                                                 struct binder_proc *proc,
1127                                                 struct binder_node *new_node,
1128                                                 struct flat_binder_object *fp)
1129 {
1130         struct rb_node **p = &proc->nodes.rb_node;
1131         struct rb_node *parent = NULL;
1132         struct binder_node *node;
1133         binder_uintptr_t ptr = fp ? fp->binder : 0;
1134         binder_uintptr_t cookie = fp ? fp->cookie : 0;
1135         __u32 flags = fp ? fp->flags : 0;
1136
1137         assert_spin_locked(&proc->inner_lock);
1138
1139         while (*p) {
1140
1141                 parent = *p;
1142                 node = rb_entry(parent, struct binder_node, rb_node);
1143
1144                 if (ptr < node->ptr)
1145                         p = &(*p)->rb_left;
1146                 else if (ptr > node->ptr)
1147                         p = &(*p)->rb_right;
1148                 else {
1149                         /*
1150                          * A matching node is already in
1151                          * the rb tree. Abandon the init
1152                          * and return it.
1153                          */
1154                         binder_inc_node_tmpref_ilocked(node);
1155                         return node;
1156                 }
1157         }
1158         node = new_node;
1159         binder_stats_created(BINDER_STAT_NODE);
1160         node->tmp_refs++;
1161         rb_link_node(&node->rb_node, parent, p);
1162         rb_insert_color(&node->rb_node, &proc->nodes);
1163         node->debug_id = atomic_inc_return(&binder_last_id);
1164         node->proc = proc;
1165         node->ptr = ptr;
1166         node->cookie = cookie;
1167         node->work.type = BINDER_WORK_NODE;
1168         node->min_priority = flags & FLAT_BINDER_FLAG_PRIORITY_MASK;
1169         node->accept_fds = !!(flags & FLAT_BINDER_FLAG_ACCEPTS_FDS);
1170         node->txn_security_ctx = !!(flags & FLAT_BINDER_FLAG_TXN_SECURITY_CTX);
1171         spin_lock_init(&node->lock);
1172         INIT_LIST_HEAD(&node->work.entry);
1173         INIT_LIST_HEAD(&node->async_todo);
1174         binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1175                      "%d:%d node %d u%016llx c%016llx created\n",
1176                      proc->pid, current->pid, node->debug_id,
1177                      (u64)node->ptr, (u64)node->cookie);
1178
1179         return node;
1180 }
1181
1182 static struct binder_node *binder_new_node(struct binder_proc *proc,
1183                                            struct flat_binder_object *fp)
1184 {
1185         struct binder_node *node;
1186         struct binder_node *new_node = kzalloc(sizeof(*node), GFP_KERNEL);
1187
1188         if (!new_node)
1189                 return NULL;
1190         binder_inner_proc_lock(proc);
1191         node = binder_init_node_ilocked(proc, new_node, fp);
1192         binder_inner_proc_unlock(proc);
1193         if (node != new_node)
1194                 /*
1195                  * The node was already added by another thread
1196                  */
1197                 kfree(new_node);
1198
1199         return node;
1200 }
1201
1202 static void binder_free_node(struct binder_node *node)
1203 {
1204         kfree(node);
1205         binder_stats_deleted(BINDER_STAT_NODE);
1206 }
1207
1208 static int binder_inc_node_nilocked(struct binder_node *node, int strong,
1209                                     int internal,
1210                                     struct list_head *target_list)
1211 {
1212         struct binder_proc *proc = node->proc;
1213
1214         assert_spin_locked(&node->lock);
1215         if (proc)
1216                 assert_spin_locked(&proc->inner_lock);
1217         if (strong) {
1218                 if (internal) {
1219                         if (target_list == NULL &&
1220                             node->internal_strong_refs == 0 &&
1221                             !(node->proc &&
1222                               node == node->proc->context->binder_context_mgr_node &&
1223                               node->has_strong_ref)) {
1224                                 pr_err("invalid inc strong node for %d\n",
1225                                         node->debug_id);
1226                                 return -EINVAL;
1227                         }
1228                         node->internal_strong_refs++;
1229                 } else
1230                         node->local_strong_refs++;
1231                 if (!node->has_strong_ref && target_list) {
1232                         struct binder_thread *thread = container_of(target_list,
1233                                                     struct binder_thread, todo);
1234                         binder_dequeue_work_ilocked(&node->work);
1235                         BUG_ON(&thread->todo != target_list);
1236                         binder_enqueue_deferred_thread_work_ilocked(thread,
1237                                                                    &node->work);
1238                 }
1239         } else {
1240                 if (!internal)
1241                         node->local_weak_refs++;
1242                 if (!node->has_weak_ref && list_empty(&node->work.entry)) {
1243                         if (target_list == NULL) {
1244                                 pr_err("invalid inc weak node for %d\n",
1245                                         node->debug_id);
1246                                 return -EINVAL;
1247                         }
1248                         /*
1249                          * See comment above
1250                          */
1251                         binder_enqueue_work_ilocked(&node->work, target_list);
1252                 }
1253         }
1254         return 0;
1255 }
1256
1257 static int binder_inc_node(struct binder_node *node, int strong, int internal,
1258                            struct list_head *target_list)
1259 {
1260         int ret;
1261
1262         binder_node_inner_lock(node);
1263         ret = binder_inc_node_nilocked(node, strong, internal, target_list);
1264         binder_node_inner_unlock(node);
1265
1266         return ret;
1267 }
1268
1269 static bool binder_dec_node_nilocked(struct binder_node *node,
1270                                      int strong, int internal)
1271 {
1272         struct binder_proc *proc = node->proc;
1273
1274         assert_spin_locked(&node->lock);
1275         if (proc)
1276                 assert_spin_locked(&proc->inner_lock);
1277         if (strong) {
1278                 if (internal)
1279                         node->internal_strong_refs--;
1280                 else
1281                         node->local_strong_refs--;
1282                 if (node->local_strong_refs || node->internal_strong_refs)
1283                         return false;
1284         } else {
1285                 if (!internal)
1286                         node->local_weak_refs--;
1287                 if (node->local_weak_refs || node->tmp_refs ||
1288                                 !hlist_empty(&node->refs))
1289                         return false;
1290         }
1291
1292         if (proc && (node->has_strong_ref || node->has_weak_ref)) {
1293                 if (list_empty(&node->work.entry)) {
1294                         binder_enqueue_work_ilocked(&node->work, &proc->todo);
1295                         binder_wakeup_proc_ilocked(proc);
1296                 }
1297         } else {
1298                 if (hlist_empty(&node->refs) && !node->local_strong_refs &&
1299                     !node->local_weak_refs && !node->tmp_refs) {
1300                         if (proc) {
1301                                 binder_dequeue_work_ilocked(&node->work);
1302                                 rb_erase(&node->rb_node, &proc->nodes);
1303                                 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1304                                              "refless node %d deleted\n",
1305                                              node->debug_id);
1306                         } else {
1307                                 BUG_ON(!list_empty(&node->work.entry));
1308                                 spin_lock(&binder_dead_nodes_lock);
1309                                 /*
1310                                  * tmp_refs could have changed so
1311                                  * check it again
1312                                  */
1313                                 if (node->tmp_refs) {
1314                                         spin_unlock(&binder_dead_nodes_lock);
1315                                         return false;
1316                                 }
1317                                 hlist_del(&node->dead_node);
1318                                 spin_unlock(&binder_dead_nodes_lock);
1319                                 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1320                                              "dead node %d deleted\n",
1321                                              node->debug_id);
1322                         }
1323                         return true;
1324                 }
1325         }
1326         return false;
1327 }
1328
1329 static void binder_dec_node(struct binder_node *node, int strong, int internal)
1330 {
1331         bool free_node;
1332
1333         binder_node_inner_lock(node);
1334         free_node = binder_dec_node_nilocked(node, strong, internal);
1335         binder_node_inner_unlock(node);
1336         if (free_node)
1337                 binder_free_node(node);
1338 }
1339
1340 static void binder_inc_node_tmpref_ilocked(struct binder_node *node)
1341 {
1342         /*
1343          * No call to binder_inc_node() is needed since we
1344          * don't need to inform userspace of any changes to
1345          * tmp_refs
1346          */
1347         node->tmp_refs++;
1348 }
1349
1350 /**
1351  * binder_inc_node_tmpref() - take a temporary reference on node
1352  * @node:       node to reference
1353  *
1354  * Take reference on node to prevent the node from being freed
1355  * while referenced only by a local variable. The inner lock is
1356  * needed to serialize with the node work on the queue (which
1357  * isn't needed after the node is dead). If the node is dead
1358  * (node->proc is NULL), use binder_dead_nodes_lock to protect
1359  * node->tmp_refs against dead-node-only cases where the node
1360  * lock cannot be acquired (eg traversing the dead node list to
1361  * print nodes)
1362  */
1363 static void binder_inc_node_tmpref(struct binder_node *node)
1364 {
1365         binder_node_lock(node);
1366         if (node->proc)
1367                 binder_inner_proc_lock(node->proc);
1368         else
1369                 spin_lock(&binder_dead_nodes_lock);
1370         binder_inc_node_tmpref_ilocked(node);
1371         if (node->proc)
1372                 binder_inner_proc_unlock(node->proc);
1373         else
1374                 spin_unlock(&binder_dead_nodes_lock);
1375         binder_node_unlock(node);
1376 }
1377
1378 /**
1379  * binder_dec_node_tmpref() - remove a temporary reference on node
1380  * @node:       node to reference
1381  *
1382  * Release temporary reference on node taken via binder_inc_node_tmpref()
1383  */
1384 static void binder_dec_node_tmpref(struct binder_node *node)
1385 {
1386         bool free_node;
1387
1388         binder_node_inner_lock(node);
1389         if (!node->proc)
1390                 spin_lock(&binder_dead_nodes_lock);
1391         else
1392                 __acquire(&binder_dead_nodes_lock);
1393         node->tmp_refs--;
1394         BUG_ON(node->tmp_refs < 0);
1395         if (!node->proc)
1396                 spin_unlock(&binder_dead_nodes_lock);
1397         else
1398                 __release(&binder_dead_nodes_lock);
1399         /*
1400          * Call binder_dec_node() to check if all refcounts are 0
1401          * and cleanup is needed. Calling with strong=0 and internal=1
1402          * causes no actual reference to be released in binder_dec_node().
1403          * If that changes, a change is needed here too.
1404          */
1405         free_node = binder_dec_node_nilocked(node, 0, 1);
1406         binder_node_inner_unlock(node);
1407         if (free_node)
1408                 binder_free_node(node);
1409 }
1410
1411 static void binder_put_node(struct binder_node *node)
1412 {
1413         binder_dec_node_tmpref(node);
1414 }
1415
1416 static struct binder_ref *binder_get_ref_olocked(struct binder_proc *proc,
1417                                                  u32 desc, bool need_strong_ref)
1418 {
1419         struct rb_node *n = proc->refs_by_desc.rb_node;
1420         struct binder_ref *ref;
1421
1422         while (n) {
1423                 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1424
1425                 if (desc < ref->data.desc) {
1426                         n = n->rb_left;
1427                 } else if (desc > ref->data.desc) {
1428                         n = n->rb_right;
1429                 } else if (need_strong_ref && !ref->data.strong) {
1430                         binder_user_error("tried to use weak ref as strong ref\n");
1431                         return NULL;
1432                 } else {
1433                         return ref;
1434                 }
1435         }
1436         return NULL;
1437 }
1438
1439 /**
1440  * binder_get_ref_for_node_olocked() - get the ref associated with given node
1441  * @proc:       binder_proc that owns the ref
1442  * @node:       binder_node of target
1443  * @new_ref:    newly allocated binder_ref to be initialized or %NULL
1444  *
1445  * Look up the ref for the given node and return it if it exists
1446  *
1447  * If it doesn't exist and the caller provides a newly allocated
1448  * ref, initialize the fields of the newly allocated ref and insert
1449  * into the given proc rb_trees and node refs list.
1450  *
1451  * Return:      the ref for node. It is possible that another thread
1452  *              allocated/initialized the ref first in which case the
1453  *              returned ref would be different than the passed-in
1454  *              new_ref. new_ref must be kfree'd by the caller in
1455  *              this case.
1456  */
1457 static struct binder_ref *binder_get_ref_for_node_olocked(
1458                                         struct binder_proc *proc,
1459                                         struct binder_node *node,
1460                                         struct binder_ref *new_ref)
1461 {
1462         struct binder_context *context = proc->context;
1463         struct rb_node **p = &proc->refs_by_node.rb_node;
1464         struct rb_node *parent = NULL;
1465         struct binder_ref *ref;
1466         struct rb_node *n;
1467
1468         while (*p) {
1469                 parent = *p;
1470                 ref = rb_entry(parent, struct binder_ref, rb_node_node);
1471
1472                 if (node < ref->node)
1473                         p = &(*p)->rb_left;
1474                 else if (node > ref->node)
1475                         p = &(*p)->rb_right;
1476                 else
1477                         return ref;
1478         }
1479         if (!new_ref)
1480                 return NULL;
1481
1482         binder_stats_created(BINDER_STAT_REF);
1483         new_ref->data.debug_id = atomic_inc_return(&binder_last_id);
1484         new_ref->proc = proc;
1485         new_ref->node = node;
1486         rb_link_node(&new_ref->rb_node_node, parent, p);
1487         rb_insert_color(&new_ref->rb_node_node, &proc->refs_by_node);
1488
1489         new_ref->data.desc = (node == context->binder_context_mgr_node) ? 0 : 1;
1490         for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
1491                 ref = rb_entry(n, struct binder_ref, rb_node_desc);
1492                 if (ref->data.desc > new_ref->data.desc)
1493                         break;
1494                 new_ref->data.desc = ref->data.desc + 1;
1495         }
1496
1497         p = &proc->refs_by_desc.rb_node;
1498         while (*p) {
1499                 parent = *p;
1500                 ref = rb_entry(parent, struct binder_ref, rb_node_desc);
1501
1502                 if (new_ref->data.desc < ref->data.desc)
1503                         p = &(*p)->rb_left;
1504                 else if (new_ref->data.desc > ref->data.desc)
1505                         p = &(*p)->rb_right;
1506                 else
1507                         BUG();
1508         }
1509         rb_link_node(&new_ref->rb_node_desc, parent, p);
1510         rb_insert_color(&new_ref->rb_node_desc, &proc->refs_by_desc);
1511
1512         binder_node_lock(node);
1513         hlist_add_head(&new_ref->node_entry, &node->refs);
1514
1515         binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1516                      "%d new ref %d desc %d for node %d\n",
1517                       proc->pid, new_ref->data.debug_id, new_ref->data.desc,
1518                       node->debug_id);
1519         binder_node_unlock(node);
1520         return new_ref;
1521 }
1522
1523 static void binder_cleanup_ref_olocked(struct binder_ref *ref)
1524 {
1525         bool delete_node = false;
1526
1527         binder_debug(BINDER_DEBUG_INTERNAL_REFS,
1528                      "%d delete ref %d desc %d for node %d\n",
1529                       ref->proc->pid, ref->data.debug_id, ref->data.desc,
1530                       ref->node->debug_id);
1531
1532         rb_erase(&ref->rb_node_desc, &ref->proc->refs_by_desc);
1533         rb_erase(&ref->rb_node_node, &ref->proc->refs_by_node);
1534
1535         binder_node_inner_lock(ref->node);
1536         if (ref->data.strong)
1537                 binder_dec_node_nilocked(ref->node, 1, 1);
1538
1539         hlist_del(&ref->node_entry);
1540         delete_node = binder_dec_node_nilocked(ref->node, 0, 1);
1541         binder_node_inner_unlock(ref->node);
1542         /*
1543          * Clear ref->node unless we want the caller to free the node
1544          */
1545         if (!delete_node) {
1546                 /*
1547                  * The caller uses ref->node to determine
1548                  * whether the node needs to be freed. Clear
1549                  * it since the node is still alive.
1550                  */
1551                 ref->node = NULL;
1552         }
1553
1554         if (ref->death) {
1555                 binder_debug(BINDER_DEBUG_DEAD_BINDER,
1556                              "%d delete ref %d desc %d has death notification\n",
1557                               ref->proc->pid, ref->data.debug_id,
1558                               ref->data.desc);
1559                 binder_dequeue_work(ref->proc, &ref->death->work);
1560                 binder_stats_deleted(BINDER_STAT_DEATH);
1561         }
1562         binder_stats_deleted(BINDER_STAT_REF);
1563 }
1564
1565 /**
1566  * binder_inc_ref_olocked() - increment the ref for given handle
1567  * @ref:         ref to be incremented
1568  * @strong:      if true, strong increment, else weak
1569  * @target_list: list to queue node work on
1570  *
1571  * Increment the ref. @ref->proc->outer_lock must be held on entry
1572  *
1573  * Return: 0, if successful, else errno
1574  */
1575 static int binder_inc_ref_olocked(struct binder_ref *ref, int strong,
1576                                   struct list_head *target_list)
1577 {
1578         int ret;
1579
1580         if (strong) {
1581                 if (ref->data.strong == 0) {
1582                         ret = binder_inc_node(ref->node, 1, 1, target_list);
1583                         if (ret)
1584                                 return ret;
1585                 }
1586                 ref->data.strong++;
1587         } else {
1588                 if (ref->data.weak == 0) {
1589                         ret = binder_inc_node(ref->node, 0, 1, target_list);
1590                         if (ret)
1591                                 return ret;
1592                 }
1593                 ref->data.weak++;
1594         }
1595         return 0;
1596 }
1597
1598 /**
1599  * binder_dec_ref() - dec the ref for given handle
1600  * @ref:        ref to be decremented
1601  * @strong:     if true, strong decrement, else weak
1602  *
1603  * Decrement the ref.
1604  *
1605  * Return: true if ref is cleaned up and ready to be freed
1606  */
1607 static bool binder_dec_ref_olocked(struct binder_ref *ref, int strong)
1608 {
1609         if (strong) {
1610                 if (ref->data.strong == 0) {
1611                         binder_user_error("%d invalid dec strong, ref %d desc %d s %d w %d\n",
1612                                           ref->proc->pid, ref->data.debug_id,
1613                                           ref->data.desc, ref->data.strong,
1614                                           ref->data.weak);
1615                         return false;
1616                 }
1617                 ref->data.strong--;
1618                 if (ref->data.strong == 0)
1619                         binder_dec_node(ref->node, strong, 1);
1620         } else {
1621                 if (ref->data.weak == 0) {
1622                         binder_user_error("%d invalid dec weak, ref %d desc %d s %d w %d\n",
1623                                           ref->proc->pid, ref->data.debug_id,
1624                                           ref->data.desc, ref->data.strong,
1625                                           ref->data.weak);
1626                         return false;
1627                 }
1628                 ref->data.weak--;
1629         }
1630         if (ref->data.strong == 0 && ref->data.weak == 0) {
1631                 binder_cleanup_ref_olocked(ref);
1632                 return true;
1633         }
1634         return false;
1635 }
1636
1637 /**
1638  * binder_get_node_from_ref() - get the node from the given proc/desc
1639  * @proc:       proc containing the ref
1640  * @desc:       the handle associated with the ref
1641  * @need_strong_ref: if true, only return node if ref is strong
1642  * @rdata:      the id/refcount data for the ref
1643  *
1644  * Given a proc and ref handle, return the associated binder_node
1645  *
1646  * Return: a binder_node or NULL if not found or not strong when strong required
1647  */
1648 static struct binder_node *binder_get_node_from_ref(
1649                 struct binder_proc *proc,
1650                 u32 desc, bool need_strong_ref,
1651                 struct binder_ref_data *rdata)
1652 {
1653         struct binder_node *node;
1654         struct binder_ref *ref;
1655
1656         binder_proc_lock(proc);
1657         ref = binder_get_ref_olocked(proc, desc, need_strong_ref);
1658         if (!ref)
1659                 goto err_no_ref;
1660         node = ref->node;
1661         /*
1662          * Take an implicit reference on the node to ensure
1663          * it stays alive until the call to binder_put_node()
1664          */
1665         binder_inc_node_tmpref(node);
1666         if (rdata)
1667                 *rdata = ref->data;
1668         binder_proc_unlock(proc);
1669
1670         return node;
1671
1672 err_no_ref:
1673         binder_proc_unlock(proc);
1674         return NULL;
1675 }
1676
1677 /**
1678  * binder_free_ref() - free the binder_ref
1679  * @ref:        ref to free
1680  *
1681  * Free the binder_ref. Free the binder_node indicated by ref->node
1682  * (if non-NULL) and the binder_ref_death indicated by ref->death.
1683  */
1684 static void binder_free_ref(struct binder_ref *ref)
1685 {
1686         if (ref->node)
1687                 binder_free_node(ref->node);
1688         kfree(ref->death);
1689         kfree(ref);
1690 }
1691
1692 /**
1693  * binder_update_ref_for_handle() - inc/dec the ref for given handle
1694  * @proc:       proc containing the ref
1695  * @desc:       the handle associated with the ref
1696  * @increment:  true=inc reference, false=dec reference
1697  * @strong:     true=strong reference, false=weak reference
1698  * @rdata:      the id/refcount data for the ref
1699  *
1700  * Given a proc and ref handle, increment or decrement the ref
1701  * according to "increment" arg.
1702  *
1703  * Return: 0 if successful, else errno
1704  */
1705 static int binder_update_ref_for_handle(struct binder_proc *proc,
1706                 uint32_t desc, bool increment, bool strong,
1707                 struct binder_ref_data *rdata)
1708 {
1709         int ret = 0;
1710         struct binder_ref *ref;
1711         bool delete_ref = false;
1712
1713         binder_proc_lock(proc);
1714         ref = binder_get_ref_olocked(proc, desc, strong);
1715         if (!ref) {
1716                 ret = -EINVAL;
1717                 goto err_no_ref;
1718         }
1719         if (increment)
1720                 ret = binder_inc_ref_olocked(ref, strong, NULL);
1721         else
1722                 delete_ref = binder_dec_ref_olocked(ref, strong);
1723
1724         if (rdata)
1725                 *rdata = ref->data;
1726         binder_proc_unlock(proc);
1727
1728         if (delete_ref)
1729                 binder_free_ref(ref);
1730         return ret;
1731
1732 err_no_ref:
1733         binder_proc_unlock(proc);
1734         return ret;
1735 }
1736
1737 /**
1738  * binder_dec_ref_for_handle() - dec the ref for given handle
1739  * @proc:       proc containing the ref
1740  * @desc:       the handle associated with the ref
1741  * @strong:     true=strong reference, false=weak reference
1742  * @rdata:      the id/refcount data for the ref
1743  *
1744  * Just calls binder_update_ref_for_handle() to decrement the ref.
1745  *
1746  * Return: 0 if successful, else errno
1747  */
1748 static int binder_dec_ref_for_handle(struct binder_proc *proc,
1749                 uint32_t desc, bool strong, struct binder_ref_data *rdata)
1750 {
1751         return binder_update_ref_for_handle(proc, desc, false, strong, rdata);
1752 }
1753
1754
1755 /**
1756  * binder_inc_ref_for_node() - increment the ref for given proc/node
1757  * @proc:        proc containing the ref
1758  * @node:        target node
1759  * @strong:      true=strong reference, false=weak reference
1760  * @target_list: worklist to use if node is incremented
1761  * @rdata:       the id/refcount data for the ref
1762  *
1763  * Given a proc and node, increment the ref. Create the ref if it
1764  * doesn't already exist
1765  *
1766  * Return: 0 if successful, else errno
1767  */
1768 static int binder_inc_ref_for_node(struct binder_proc *proc,
1769                         struct binder_node *node,
1770                         bool strong,
1771                         struct list_head *target_list,
1772                         struct binder_ref_data *rdata)
1773 {
1774         struct binder_ref *ref;
1775         struct binder_ref *new_ref = NULL;
1776         int ret = 0;
1777
1778         binder_proc_lock(proc);
1779         ref = binder_get_ref_for_node_olocked(proc, node, NULL);
1780         if (!ref) {
1781                 binder_proc_unlock(proc);
1782                 new_ref = kzalloc(sizeof(*ref), GFP_KERNEL);
1783                 if (!new_ref)
1784                         return -ENOMEM;
1785                 binder_proc_lock(proc);
1786                 ref = binder_get_ref_for_node_olocked(proc, node, new_ref);
1787         }
1788         ret = binder_inc_ref_olocked(ref, strong, target_list);
1789         *rdata = ref->data;
1790         binder_proc_unlock(proc);
1791         if (new_ref && ref != new_ref)
1792                 /*
1793                  * Another thread created the ref first so
1794                  * free the one we allocated
1795                  */
1796                 kfree(new_ref);
1797         return ret;
1798 }
1799
1800 static void binder_pop_transaction_ilocked(struct binder_thread *target_thread,
1801                                            struct binder_transaction *t)
1802 {
1803         BUG_ON(!target_thread);
1804         assert_spin_locked(&target_thread->proc->inner_lock);
1805         BUG_ON(target_thread->transaction_stack != t);
1806         BUG_ON(target_thread->transaction_stack->from != target_thread);
1807         target_thread->transaction_stack =
1808                 target_thread->transaction_stack->from_parent;
1809         t->from = NULL;
1810 }
1811
1812 /**
1813  * binder_thread_dec_tmpref() - decrement thread->tmp_ref
1814  * @thread:     thread to decrement
1815  *
1816  * A thread needs to be kept alive while being used to create or
1817  * handle a transaction. binder_get_txn_from() is used to safely
1818  * extract t->from from a binder_transaction and keep the thread
1819  * indicated by t->from from being freed. When done with that
1820  * binder_thread, this function is called to decrement the
1821  * tmp_ref and free if appropriate (thread has been released
1822  * and no transaction being processed by the driver)
1823  */
1824 static void binder_thread_dec_tmpref(struct binder_thread *thread)
1825 {
1826         /*
1827          * atomic is used to protect the counter value while
1828          * it cannot reach zero or thread->is_dead is false
1829          */
1830         binder_inner_proc_lock(thread->proc);
1831         atomic_dec(&thread->tmp_ref);
1832         if (thread->is_dead && !atomic_read(&thread->tmp_ref)) {
1833                 binder_inner_proc_unlock(thread->proc);
1834                 binder_free_thread(thread);
1835                 return;
1836         }
1837         binder_inner_proc_unlock(thread->proc);
1838 }
1839
1840 /**
1841  * binder_proc_dec_tmpref() - decrement proc->tmp_ref
1842  * @proc:       proc to decrement
1843  *
1844  * A binder_proc needs to be kept alive while being used to create or
1845  * handle a transaction. proc->tmp_ref is incremented when
1846  * creating a new transaction or the binder_proc is currently in-use
1847  * by threads that are being released. When done with the binder_proc,
1848  * this function is called to decrement the counter and free the
1849  * proc if appropriate (proc has been released, all threads have
1850  * been released and not currenly in-use to process a transaction).
1851  */
1852 static void binder_proc_dec_tmpref(struct binder_proc *proc)
1853 {
1854         binder_inner_proc_lock(proc);
1855         proc->tmp_ref--;
1856         if (proc->is_dead && RB_EMPTY_ROOT(&proc->threads) &&
1857                         !proc->tmp_ref) {
1858                 binder_inner_proc_unlock(proc);
1859                 binder_free_proc(proc);
1860                 return;
1861         }
1862         binder_inner_proc_unlock(proc);
1863 }
1864
1865 /**
1866  * binder_get_txn_from() - safely extract the "from" thread in transaction
1867  * @t:  binder transaction for t->from
1868  *
1869  * Atomically return the "from" thread and increment the tmp_ref
1870  * count for the thread to ensure it stays alive until
1871  * binder_thread_dec_tmpref() is called.
1872  *
1873  * Return: the value of t->from
1874  */
1875 static struct binder_thread *binder_get_txn_from(
1876                 struct binder_transaction *t)
1877 {
1878         struct binder_thread *from;
1879
1880         spin_lock(&t->lock);
1881         from = t->from;
1882         if (from)
1883                 atomic_inc(&from->tmp_ref);
1884         spin_unlock(&t->lock);
1885         return from;
1886 }
1887
1888 /**
1889  * binder_get_txn_from_and_acq_inner() - get t->from and acquire inner lock
1890  * @t:  binder transaction for t->from
1891  *
1892  * Same as binder_get_txn_from() except it also acquires the proc->inner_lock
1893  * to guarantee that the thread cannot be released while operating on it.
1894  * The caller must call binder_inner_proc_unlock() to release the inner lock
1895  * as well as call binder_dec_thread_txn() to release the reference.
1896  *
1897  * Return: the value of t->from
1898  */
1899 static struct binder_thread *binder_get_txn_from_and_acq_inner(
1900                 struct binder_transaction *t)
1901         __acquires(&t->from->proc->inner_lock)
1902 {
1903         struct binder_thread *from;
1904
1905         from = binder_get_txn_from(t);
1906         if (!from) {
1907                 __acquire(&from->proc->inner_lock);
1908                 return NULL;
1909         }
1910         binder_inner_proc_lock(from->proc);
1911         if (t->from) {
1912                 BUG_ON(from != t->from);
1913                 return from;
1914         }
1915         binder_inner_proc_unlock(from->proc);
1916         __acquire(&from->proc->inner_lock);
1917         binder_thread_dec_tmpref(from);
1918         return NULL;
1919 }
1920
1921 /**
1922  * binder_free_txn_fixups() - free unprocessed fd fixups
1923  * @t:  binder transaction for t->from
1924  *
1925  * If the transaction is being torn down prior to being
1926  * processed by the target process, free all of the
1927  * fd fixups and fput the file structs. It is safe to
1928  * call this function after the fixups have been
1929  * processed -- in that case, the list will be empty.
1930  */
1931 static void binder_free_txn_fixups(struct binder_transaction *t)
1932 {
1933         struct binder_txn_fd_fixup *fixup, *tmp;
1934
1935         list_for_each_entry_safe(fixup, tmp, &t->fd_fixups, fixup_entry) {
1936                 fput(fixup->file);
1937                 list_del(&fixup->fixup_entry);
1938                 kfree(fixup);
1939         }
1940 }
1941
1942 static void binder_free_transaction(struct binder_transaction *t)
1943 {
1944         struct binder_proc *target_proc = t->to_proc;
1945
1946         if (target_proc) {
1947                 binder_inner_proc_lock(target_proc);
1948                 if (t->buffer)
1949                         t->buffer->transaction = NULL;
1950                 binder_inner_proc_unlock(target_proc);
1951         }
1952         /*
1953          * If the transaction has no target_proc, then
1954          * t->buffer->transaction has already been cleared.
1955          */
1956         binder_free_txn_fixups(t);
1957         kfree(t);
1958         binder_stats_deleted(BINDER_STAT_TRANSACTION);
1959 }
1960
1961 static void binder_send_failed_reply(struct binder_transaction *t,
1962                                      uint32_t error_code)
1963 {
1964         struct binder_thread *target_thread;
1965         struct binder_transaction *next;
1966
1967         BUG_ON(t->flags & TF_ONE_WAY);
1968         while (1) {
1969                 target_thread = binder_get_txn_from_and_acq_inner(t);
1970                 if (target_thread) {
1971                         binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
1972                                      "send failed reply for transaction %d to %d:%d\n",
1973                                       t->debug_id,
1974                                       target_thread->proc->pid,
1975                                       target_thread->pid);
1976
1977                         binder_pop_transaction_ilocked(target_thread, t);
1978                         if (target_thread->reply_error.cmd == BR_OK) {
1979                                 target_thread->reply_error.cmd = error_code;
1980                                 binder_enqueue_thread_work_ilocked(
1981                                         target_thread,
1982                                         &target_thread->reply_error.work);
1983                                 wake_up_interruptible(&target_thread->wait);
1984                         } else {
1985                                 /*
1986                                  * Cannot get here for normal operation, but
1987                                  * we can if multiple synchronous transactions
1988                                  * are sent without blocking for responses.
1989                                  * Just ignore the 2nd error in this case.
1990                                  */
1991                                 pr_warn("Unexpected reply error: %u\n",
1992                                         target_thread->reply_error.cmd);
1993                         }
1994                         binder_inner_proc_unlock(target_thread->proc);
1995                         binder_thread_dec_tmpref(target_thread);
1996                         binder_free_transaction(t);
1997                         return;
1998                 } else {
1999                         __release(&target_thread->proc->inner_lock);
2000                 }
2001                 next = t->from_parent;
2002
2003                 binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
2004                              "send failed reply for transaction %d, target dead\n",
2005                              t->debug_id);
2006
2007                 binder_free_transaction(t);
2008                 if (next == NULL) {
2009                         binder_debug(BINDER_DEBUG_DEAD_BINDER,
2010                                      "reply failed, no target thread at root\n");
2011                         return;
2012                 }
2013                 t = next;
2014                 binder_debug(BINDER_DEBUG_DEAD_BINDER,
2015                              "reply failed, no target thread -- retry %d\n",
2016                               t->debug_id);
2017         }
2018 }
2019
2020 /**
2021  * binder_cleanup_transaction() - cleans up undelivered transaction
2022  * @t:          transaction that needs to be cleaned up
2023  * @reason:     reason the transaction wasn't delivered
2024  * @error_code: error to return to caller (if synchronous call)
2025  */
2026 static void binder_cleanup_transaction(struct binder_transaction *t,
2027                                        const char *reason,
2028                                        uint32_t error_code)
2029 {
2030         if (t->buffer->target_node && !(t->flags & TF_ONE_WAY)) {
2031                 binder_send_failed_reply(t, error_code);
2032         } else {
2033                 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
2034                         "undelivered transaction %d, %s\n",
2035                         t->debug_id, reason);
2036                 binder_free_transaction(t);
2037         }
2038 }
2039
2040 /**
2041  * binder_get_object() - gets object and checks for valid metadata
2042  * @proc:       binder_proc owning the buffer
2043  * @buffer:     binder_buffer that we're parsing.
2044  * @offset:     offset in the @buffer at which to validate an object.
2045  * @object:     struct binder_object to read into
2046  *
2047  * Return:      If there's a valid metadata object at @offset in @buffer, the
2048  *              size of that object. Otherwise, it returns zero. The object
2049  *              is read into the struct binder_object pointed to by @object.
2050  */
2051 static size_t binder_get_object(struct binder_proc *proc,
2052                                 struct binder_buffer *buffer,
2053                                 unsigned long offset,
2054                                 struct binder_object *object)
2055 {
2056         size_t read_size;
2057         struct binder_object_header *hdr;
2058         size_t object_size = 0;
2059
2060         read_size = min_t(size_t, sizeof(*object), buffer->data_size - offset);
2061         if (offset > buffer->data_size || read_size < sizeof(*hdr) ||
2062             binder_alloc_copy_from_buffer(&proc->alloc, object, buffer,
2063                                           offset, read_size))
2064                 return 0;
2065
2066         /* Ok, now see if we read a complete object. */
2067         hdr = &object->hdr;
2068         switch (hdr->type) {
2069         case BINDER_TYPE_BINDER:
2070         case BINDER_TYPE_WEAK_BINDER:
2071         case BINDER_TYPE_HANDLE:
2072         case BINDER_TYPE_WEAK_HANDLE:
2073                 object_size = sizeof(struct flat_binder_object);
2074                 break;
2075         case BINDER_TYPE_FD:
2076                 object_size = sizeof(struct binder_fd_object);
2077                 break;
2078         case BINDER_TYPE_PTR:
2079                 object_size = sizeof(struct binder_buffer_object);
2080                 break;
2081         case BINDER_TYPE_FDA:
2082                 object_size = sizeof(struct binder_fd_array_object);
2083                 break;
2084         default:
2085                 return 0;
2086         }
2087         if (offset <= buffer->data_size - object_size &&
2088             buffer->data_size >= object_size)
2089                 return object_size;
2090         else
2091                 return 0;
2092 }
2093
2094 /**
2095  * binder_validate_ptr() - validates binder_buffer_object in a binder_buffer.
2096  * @proc:       binder_proc owning the buffer
2097  * @b:          binder_buffer containing the object
2098  * @object:     struct binder_object to read into
2099  * @index:      index in offset array at which the binder_buffer_object is
2100  *              located
2101  * @start_offset: points to the start of the offset array
2102  * @object_offsetp: offset of @object read from @b
2103  * @num_valid:  the number of valid offsets in the offset array
2104  *
2105  * Return:      If @index is within the valid range of the offset array
2106  *              described by @start and @num_valid, and if there's a valid
2107  *              binder_buffer_object at the offset found in index @index
2108  *              of the offset array, that object is returned. Otherwise,
2109  *              %NULL is returned.
2110  *              Note that the offset found in index @index itself is not
2111  *              verified; this function assumes that @num_valid elements
2112  *              from @start were previously verified to have valid offsets.
2113  *              If @object_offsetp is non-NULL, then the offset within
2114  *              @b is written to it.
2115  */
2116 static struct binder_buffer_object *binder_validate_ptr(
2117                                                 struct binder_proc *proc,
2118                                                 struct binder_buffer *b,
2119                                                 struct binder_object *object,
2120                                                 binder_size_t index,
2121                                                 binder_size_t start_offset,
2122                                                 binder_size_t *object_offsetp,
2123                                                 binder_size_t num_valid)
2124 {
2125         size_t object_size;
2126         binder_size_t object_offset;
2127         unsigned long buffer_offset;
2128
2129         if (index >= num_valid)
2130                 return NULL;
2131
2132         buffer_offset = start_offset + sizeof(binder_size_t) * index;
2133         if (binder_alloc_copy_from_buffer(&proc->alloc, &object_offset,
2134                                           b, buffer_offset,
2135                                           sizeof(object_offset)))
2136                 return NULL;
2137         object_size = binder_get_object(proc, b, object_offset, object);
2138         if (!object_size || object->hdr.type != BINDER_TYPE_PTR)
2139                 return NULL;
2140         if (object_offsetp)
2141                 *object_offsetp = object_offset;
2142
2143         return &object->bbo;
2144 }
2145
2146 /**
2147  * binder_validate_fixup() - validates pointer/fd fixups happen in order.
2148  * @proc:               binder_proc owning the buffer
2149  * @b:                  transaction buffer
2150  * @objects_start_offset: offset to start of objects buffer
2151  * @buffer_obj_offset:  offset to binder_buffer_object in which to fix up
2152  * @fixup_offset:       start offset in @buffer to fix up
2153  * @last_obj_offset:    offset to last binder_buffer_object that we fixed
2154  * @last_min_offset:    minimum fixup offset in object at @last_obj_offset
2155  *
2156  * Return:              %true if a fixup in buffer @buffer at offset @offset is
2157  *                      allowed.
2158  *
2159  * For safety reasons, we only allow fixups inside a buffer to happen
2160  * at increasing offsets; additionally, we only allow fixup on the last
2161  * buffer object that was verified, or one of its parents.
2162  *
2163  * Example of what is allowed:
2164  *
2165  * A
2166  *   B (parent = A, offset = 0)
2167  *   C (parent = A, offset = 16)
2168  *     D (parent = C, offset = 0)
2169  *   E (parent = A, offset = 32) // min_offset is 16 (C.parent_offset)
2170  *
2171  * Examples of what is not allowed:
2172  *
2173  * Decreasing offsets within the same parent:
2174  * A
2175  *   C (parent = A, offset = 16)
2176  *   B (parent = A, offset = 0) // decreasing offset within A
2177  *
2178  * Referring to a parent that wasn't the last object or any of its parents:
2179  * A
2180  *   B (parent = A, offset = 0)
2181  *   C (parent = A, offset = 0)
2182  *   C (parent = A, offset = 16)
2183  *     D (parent = B, offset = 0) // B is not A or any of A's parents
2184  */
2185 static bool binder_validate_fixup(struct binder_proc *proc,
2186                                   struct binder_buffer *b,
2187                                   binder_size_t objects_start_offset,
2188                                   binder_size_t buffer_obj_offset,
2189                                   binder_size_t fixup_offset,
2190                                   binder_size_t last_obj_offset,
2191                                   binder_size_t last_min_offset)
2192 {
2193         if (!last_obj_offset) {
2194                 /* Nothing to fix up in */
2195                 return false;
2196         }
2197
2198         while (last_obj_offset != buffer_obj_offset) {
2199                 unsigned long buffer_offset;
2200                 struct binder_object last_object;
2201                 struct binder_buffer_object *last_bbo;
2202                 size_t object_size = binder_get_object(proc, b, last_obj_offset,
2203                                                        &last_object);
2204                 if (object_size != sizeof(*last_bbo))
2205                         return false;
2206
2207                 last_bbo = &last_object.bbo;
2208                 /*
2209                  * Safe to retrieve the parent of last_obj, since it
2210                  * was already previously verified by the driver.
2211                  */
2212                 if ((last_bbo->flags & BINDER_BUFFER_FLAG_HAS_PARENT) == 0)
2213                         return false;
2214                 last_min_offset = last_bbo->parent_offset + sizeof(uintptr_t);
2215                 buffer_offset = objects_start_offset +
2216                         sizeof(binder_size_t) * last_bbo->parent;
2217                 if (binder_alloc_copy_from_buffer(&proc->alloc,
2218                                                   &last_obj_offset,
2219                                                   b, buffer_offset,
2220                                                   sizeof(last_obj_offset)))
2221                         return false;
2222         }
2223         return (fixup_offset >= last_min_offset);
2224 }
2225
2226 /**
2227  * struct binder_task_work_cb - for deferred close
2228  *
2229  * @twork:                callback_head for task work
2230  * @fd:                   fd to close
2231  *
2232  * Structure to pass task work to be handled after
2233  * returning from binder_ioctl() via task_work_add().
2234  */
2235 struct binder_task_work_cb {
2236         struct callback_head twork;
2237         struct file *file;
2238 };
2239
2240 /**
2241  * binder_do_fd_close() - close list of file descriptors
2242  * @twork:      callback head for task work
2243  *
2244  * It is not safe to call ksys_close() during the binder_ioctl()
2245  * function if there is a chance that binder's own file descriptor
2246  * might be closed. This is to meet the requirements for using
2247  * fdget() (see comments for __fget_light()). Therefore use
2248  * task_work_add() to schedule the close operation once we have
2249  * returned from binder_ioctl(). This function is a callback
2250  * for that mechanism and does the actual ksys_close() on the
2251  * given file descriptor.
2252  */
2253 static void binder_do_fd_close(struct callback_head *twork)
2254 {
2255         struct binder_task_work_cb *twcb = container_of(twork,
2256                         struct binder_task_work_cb, twork);
2257
2258         fput(twcb->file);
2259         kfree(twcb);
2260 }
2261
2262 /**
2263  * binder_deferred_fd_close() - schedule a close for the given file-descriptor
2264  * @fd:         file-descriptor to close
2265  *
2266  * See comments in binder_do_fd_close(). This function is used to schedule
2267  * a file-descriptor to be closed after returning from binder_ioctl().
2268  */
2269 static void binder_deferred_fd_close(int fd)
2270 {
2271         struct binder_task_work_cb *twcb;
2272
2273         twcb = kzalloc(sizeof(*twcb), GFP_KERNEL);
2274         if (!twcb)
2275                 return;
2276         init_task_work(&twcb->twork, binder_do_fd_close);
2277         __close_fd_get_file(fd, &twcb->file);
2278         if (twcb->file)
2279                 task_work_add(current, &twcb->twork, true);
2280         else
2281                 kfree(twcb);
2282 }
2283
2284 static void binder_transaction_buffer_release(struct binder_proc *proc,
2285                                               struct binder_buffer *buffer,
2286                                               binder_size_t failed_at,
2287                                               bool is_failure)
2288 {
2289         int debug_id = buffer->debug_id;
2290         binder_size_t off_start_offset, buffer_offset, off_end_offset;
2291
2292         binder_debug(BINDER_DEBUG_TRANSACTION,
2293                      "%d buffer release %d, size %zd-%zd, failed at %llx\n",
2294                      proc->pid, buffer->debug_id,
2295                      buffer->data_size, buffer->offsets_size,
2296                      (unsigned long long)failed_at);
2297
2298         if (buffer->target_node)
2299                 binder_dec_node(buffer->target_node, 1, 0);
2300
2301         off_start_offset = ALIGN(buffer->data_size, sizeof(void *));
2302         off_end_offset = is_failure ? failed_at :
2303                                 off_start_offset + buffer->offsets_size;
2304         for (buffer_offset = off_start_offset; buffer_offset < off_end_offset;
2305              buffer_offset += sizeof(binder_size_t)) {
2306                 struct binder_object_header *hdr;
2307                 size_t object_size = 0;
2308                 struct binder_object object;
2309                 binder_size_t object_offset;
2310
2311                 if (!binder_alloc_copy_from_buffer(&proc->alloc, &object_offset,
2312                                                    buffer, buffer_offset,
2313                                                    sizeof(object_offset)))
2314                         object_size = binder_get_object(proc, buffer,
2315                                                         object_offset, &object);
2316                 if (object_size == 0) {
2317                         pr_err("transaction release %d bad object at offset %lld, size %zd\n",
2318                                debug_id, (u64)object_offset, buffer->data_size);
2319                         continue;
2320                 }
2321                 hdr = &object.hdr;
2322                 switch (hdr->type) {
2323                 case BINDER_TYPE_BINDER:
2324                 case BINDER_TYPE_WEAK_BINDER: {
2325                         struct flat_binder_object *fp;
2326                         struct binder_node *node;
2327
2328                         fp = to_flat_binder_object(hdr);
2329                         node = binder_get_node(proc, fp->binder);
2330                         if (node == NULL) {
2331                                 pr_err("transaction release %d bad node %016llx\n",
2332                                        debug_id, (u64)fp->binder);
2333                                 break;
2334                         }
2335                         binder_debug(BINDER_DEBUG_TRANSACTION,
2336                                      "        node %d u%016llx\n",
2337                                      node->debug_id, (u64)node->ptr);
2338                         binder_dec_node(node, hdr->type == BINDER_TYPE_BINDER,
2339                                         0);
2340                         binder_put_node(node);
2341                 } break;
2342                 case BINDER_TYPE_HANDLE:
2343                 case BINDER_TYPE_WEAK_HANDLE: {
2344                         struct flat_binder_object *fp;
2345                         struct binder_ref_data rdata;
2346                         int ret;
2347
2348                         fp = to_flat_binder_object(hdr);
2349                         ret = binder_dec_ref_for_handle(proc, fp->handle,
2350                                 hdr->type == BINDER_TYPE_HANDLE, &rdata);
2351
2352                         if (ret) {
2353                                 pr_err("transaction release %d bad handle %d, ret = %d\n",
2354                                  debug_id, fp->handle, ret);
2355                                 break;
2356                         }
2357                         binder_debug(BINDER_DEBUG_TRANSACTION,
2358                                      "        ref %d desc %d\n",
2359                                      rdata.debug_id, rdata.desc);
2360                 } break;
2361
2362                 case BINDER_TYPE_FD: {
2363                         /*
2364                          * No need to close the file here since user-space
2365                          * closes it for for successfully delivered
2366                          * transactions. For transactions that weren't
2367                          * delivered, the new fd was never allocated so
2368                          * there is no need to close and the fput on the
2369                          * file is done when the transaction is torn
2370                          * down.
2371                          */
2372                         WARN_ON(failed_at &&
2373                                 proc->tsk == current->group_leader);
2374                 } break;
2375                 case BINDER_TYPE_PTR:
2376                         /*
2377                          * Nothing to do here, this will get cleaned up when the
2378                          * transaction buffer gets freed
2379                          */
2380                         break;
2381                 case BINDER_TYPE_FDA: {
2382                         struct binder_fd_array_object *fda;
2383                         struct binder_buffer_object *parent;
2384                         struct binder_object ptr_object;
2385                         binder_size_t fda_offset;
2386                         size_t fd_index;
2387                         binder_size_t fd_buf_size;
2388                         binder_size_t num_valid;
2389
2390                         if (proc->tsk != current->group_leader) {
2391                                 /*
2392                                  * Nothing to do if running in sender context
2393                                  * The fd fixups have not been applied so no
2394                                  * fds need to be closed.
2395                                  */
2396                                 continue;
2397                         }
2398
2399                         num_valid = (buffer_offset - off_start_offset) /
2400                                                 sizeof(binder_size_t);
2401                         fda = to_binder_fd_array_object(hdr);
2402                         parent = binder_validate_ptr(proc, buffer, &ptr_object,
2403                                                      fda->parent,
2404                                                      off_start_offset,
2405                                                      NULL,
2406                                                      num_valid);
2407                         if (!parent) {
2408                                 pr_err("transaction release %d bad parent offset\n",
2409                                        debug_id);
2410                                 continue;
2411                         }
2412                         fd_buf_size = sizeof(u32) * fda->num_fds;
2413                         if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
2414                                 pr_err("transaction release %d invalid number of fds (%lld)\n",
2415                                        debug_id, (u64)fda->num_fds);
2416                                 continue;
2417                         }
2418                         if (fd_buf_size > parent->length ||
2419                             fda->parent_offset > parent->length - fd_buf_size) {
2420                                 /* No space for all file descriptors here. */
2421                                 pr_err("transaction release %d not enough space for %lld fds in buffer\n",
2422                                        debug_id, (u64)fda->num_fds);
2423                                 continue;
2424                         }
2425                         /*
2426                          * the source data for binder_buffer_object is visible
2427                          * to user-space and the @buffer element is the user
2428                          * pointer to the buffer_object containing the fd_array.
2429                          * Convert the address to an offset relative to
2430                          * the base of the transaction buffer.
2431                          */
2432                         fda_offset =
2433                             (parent->buffer - (uintptr_t)buffer->user_data) +
2434                             fda->parent_offset;
2435                         for (fd_index = 0; fd_index < fda->num_fds;
2436                              fd_index++) {
2437                                 u32 fd;
2438                                 int err;
2439                                 binder_size_t offset = fda_offset +
2440                                         fd_index * sizeof(fd);
2441
2442                                 err = binder_alloc_copy_from_buffer(
2443                                                 &proc->alloc, &fd, buffer,
2444                                                 offset, sizeof(fd));
2445                                 WARN_ON(err);
2446                                 if (!err)
2447                                         binder_deferred_fd_close(fd);
2448                         }
2449                 } break;
2450                 default:
2451                         pr_err("transaction release %d bad object type %x\n",
2452                                 debug_id, hdr->type);
2453                         break;
2454                 }
2455         }
2456 }
2457
2458 static int binder_translate_binder(struct flat_binder_object *fp,
2459                                    struct binder_transaction *t,
2460                                    struct binder_thread *thread)
2461 {
2462         struct binder_node *node;
2463         struct binder_proc *proc = thread->proc;
2464         struct binder_proc *target_proc = t->to_proc;
2465         struct binder_ref_data rdata;
2466         int ret = 0;
2467
2468         node = binder_get_node(proc, fp->binder);
2469         if (!node) {
2470                 node = binder_new_node(proc, fp);
2471                 if (!node)
2472                         return -ENOMEM;
2473         }
2474         if (fp->cookie != node->cookie) {
2475                 binder_user_error("%d:%d sending u%016llx node %d, cookie mismatch %016llx != %016llx\n",
2476                                   proc->pid, thread->pid, (u64)fp->binder,
2477                                   node->debug_id, (u64)fp->cookie,
2478                                   (u64)node->cookie);
2479                 ret = -EINVAL;
2480                 goto done;
2481         }
2482         if (security_binder_transfer_binder(proc->tsk, target_proc->tsk)) {
2483                 ret = -EPERM;
2484                 goto done;
2485         }
2486
2487         ret = binder_inc_ref_for_node(target_proc, node,
2488                         fp->hdr.type == BINDER_TYPE_BINDER,
2489                         &thread->todo, &rdata);
2490         if (ret)
2491                 goto done;
2492
2493         if (fp->hdr.type == BINDER_TYPE_BINDER)
2494                 fp->hdr.type = BINDER_TYPE_HANDLE;
2495         else
2496                 fp->hdr.type = BINDER_TYPE_WEAK_HANDLE;
2497         fp->binder = 0;
2498         fp->handle = rdata.desc;
2499         fp->cookie = 0;
2500
2501         trace_binder_transaction_node_to_ref(t, node, &rdata);
2502         binder_debug(BINDER_DEBUG_TRANSACTION,
2503                      "        node %d u%016llx -> ref %d desc %d\n",
2504                      node->debug_id, (u64)node->ptr,
2505                      rdata.debug_id, rdata.desc);
2506 done:
2507         binder_put_node(node);
2508         return ret;
2509 }
2510
2511 static int binder_translate_handle(struct flat_binder_object *fp,
2512                                    struct binder_transaction *t,
2513                                    struct binder_thread *thread)
2514 {
2515         struct binder_proc *proc = thread->proc;
2516         struct binder_proc *target_proc = t->to_proc;
2517         struct binder_node *node;
2518         struct binder_ref_data src_rdata;
2519         int ret = 0;
2520
2521         node = binder_get_node_from_ref(proc, fp->handle,
2522                         fp->hdr.type == BINDER_TYPE_HANDLE, &src_rdata);
2523         if (!node) {
2524                 binder_user_error("%d:%d got transaction with invalid handle, %d\n",
2525                                   proc->pid, thread->pid, fp->handle);
2526                 return -EINVAL;
2527         }
2528         if (security_binder_transfer_binder(proc->tsk, target_proc->tsk)) {
2529                 ret = -EPERM;
2530                 goto done;
2531         }
2532
2533         binder_node_lock(node);
2534         if (node->proc == target_proc) {
2535                 if (fp->hdr.type == BINDER_TYPE_HANDLE)
2536                         fp->hdr.type = BINDER_TYPE_BINDER;
2537                 else
2538                         fp->hdr.type = BINDER_TYPE_WEAK_BINDER;
2539                 fp->binder = node->ptr;
2540                 fp->cookie = node->cookie;
2541                 if (node->proc)
2542                         binder_inner_proc_lock(node->proc);
2543                 else
2544                         __acquire(&node->proc->inner_lock);
2545                 binder_inc_node_nilocked(node,
2546                                          fp->hdr.type == BINDER_TYPE_BINDER,
2547                                          0, NULL);
2548                 if (node->proc)
2549                         binder_inner_proc_unlock(node->proc);
2550                 else
2551                         __release(&node->proc->inner_lock);
2552                 trace_binder_transaction_ref_to_node(t, node, &src_rdata);
2553                 binder_debug(BINDER_DEBUG_TRANSACTION,
2554                              "        ref %d desc %d -> node %d u%016llx\n",
2555                              src_rdata.debug_id, src_rdata.desc, node->debug_id,
2556                              (u64)node->ptr);
2557                 binder_node_unlock(node);
2558         } else {
2559                 struct binder_ref_data dest_rdata;
2560
2561                 binder_node_unlock(node);
2562                 ret = binder_inc_ref_for_node(target_proc, node,
2563                                 fp->hdr.type == BINDER_TYPE_HANDLE,
2564                                 NULL, &dest_rdata);
2565                 if (ret)
2566                         goto done;
2567
2568                 fp->binder = 0;
2569                 fp->handle = dest_rdata.desc;
2570                 fp->cookie = 0;
2571                 trace_binder_transaction_ref_to_ref(t, node, &src_rdata,
2572                                                     &dest_rdata);
2573                 binder_debug(BINDER_DEBUG_TRANSACTION,
2574                              "        ref %d desc %d -> ref %d desc %d (node %d)\n",
2575                              src_rdata.debug_id, src_rdata.desc,
2576                              dest_rdata.debug_id, dest_rdata.desc,
2577                              node->debug_id);
2578         }
2579 done:
2580         binder_put_node(node);
2581         return ret;
2582 }
2583
2584 static int binder_translate_fd(u32 fd, binder_size_t fd_offset,
2585                                struct binder_transaction *t,
2586                                struct binder_thread *thread,
2587                                struct binder_transaction *in_reply_to)
2588 {
2589         struct binder_proc *proc = thread->proc;
2590         struct binder_proc *target_proc = t->to_proc;
2591         struct binder_txn_fd_fixup *fixup;
2592         struct file *file;
2593         int ret = 0;
2594         bool target_allows_fd;
2595
2596         if (in_reply_to)
2597                 target_allows_fd = !!(in_reply_to->flags & TF_ACCEPT_FDS);
2598         else
2599                 target_allows_fd = t->buffer->target_node->accept_fds;
2600         if (!target_allows_fd) {
2601                 binder_user_error("%d:%d got %s with fd, %d, but target does not allow fds\n",
2602                                   proc->pid, thread->pid,
2603                                   in_reply_to ? "reply" : "transaction",
2604                                   fd);
2605                 ret = -EPERM;
2606                 goto err_fd_not_accepted;
2607         }
2608
2609         file = fget(fd);
2610         if (!file) {
2611                 binder_user_error("%d:%d got transaction with invalid fd, %d\n",
2612                                   proc->pid, thread->pid, fd);
2613                 ret = -EBADF;
2614                 goto err_fget;
2615         }
2616         ret = security_binder_transfer_file(proc->tsk, target_proc->tsk, file);
2617         if (ret < 0) {
2618                 ret = -EPERM;
2619                 goto err_security;
2620         }
2621
2622         /*
2623          * Add fixup record for this transaction. The allocation
2624          * of the fd in the target needs to be done from a
2625          * target thread.
2626          */
2627         fixup = kzalloc(sizeof(*fixup), GFP_KERNEL);
2628         if (!fixup) {
2629                 ret = -ENOMEM;
2630                 goto err_alloc;
2631         }
2632         fixup->file = file;
2633         fixup->offset = fd_offset;
2634         trace_binder_transaction_fd_send(t, fd, fixup->offset);
2635         list_add_tail(&fixup->fixup_entry, &t->fd_fixups);
2636
2637         return ret;
2638
2639 err_alloc:
2640 err_security:
2641         fput(file);
2642 err_fget:
2643 err_fd_not_accepted:
2644         return ret;
2645 }
2646
2647 static int binder_translate_fd_array(struct binder_fd_array_object *fda,
2648                                      struct binder_buffer_object *parent,
2649                                      struct binder_transaction *t,
2650                                      struct binder_thread *thread,
2651                                      struct binder_transaction *in_reply_to)
2652 {
2653         binder_size_t fdi, fd_buf_size;
2654         binder_size_t fda_offset;
2655         struct binder_proc *proc = thread->proc;
2656         struct binder_proc *target_proc = t->to_proc;
2657
2658         fd_buf_size = sizeof(u32) * fda->num_fds;
2659         if (fda->num_fds >= SIZE_MAX / sizeof(u32)) {
2660                 binder_user_error("%d:%d got transaction with invalid number of fds (%lld)\n",
2661                                   proc->pid, thread->pid, (u64)fda->num_fds);
2662                 return -EINVAL;
2663         }
2664         if (fd_buf_size > parent->length ||
2665             fda->parent_offset > parent->length - fd_buf_size) {
2666                 /* No space for all file descriptors here. */
2667                 binder_user_error("%d:%d not enough space to store %lld fds in buffer\n",
2668                                   proc->pid, thread->pid, (u64)fda->num_fds);
2669                 return -EINVAL;
2670         }
2671         /*
2672          * the source data for binder_buffer_object is visible
2673          * to user-space and the @buffer element is the user
2674          * pointer to the buffer_object containing the fd_array.
2675          * Convert the address to an offset relative to
2676          * the base of the transaction buffer.
2677          */
2678         fda_offset = (parent->buffer - (uintptr_t)t->buffer->user_data) +
2679                 fda->parent_offset;
2680         if (!IS_ALIGNED((unsigned long)fda_offset, sizeof(u32))) {
2681                 binder_user_error("%d:%d parent offset not aligned correctly.\n",
2682                                   proc->pid, thread->pid);
2683                 return -EINVAL;
2684         }
2685         for (fdi = 0; fdi < fda->num_fds; fdi++) {
2686                 u32 fd;
2687                 int ret;
2688                 binder_size_t offset = fda_offset + fdi * sizeof(fd);
2689
2690                 ret = binder_alloc_copy_from_buffer(&target_proc->alloc,
2691                                                     &fd, t->buffer,
2692                                                     offset, sizeof(fd));
2693                 if (!ret)
2694                         ret = binder_translate_fd(fd, offset, t, thread,
2695                                                   in_reply_to);
2696                 if (ret < 0)
2697                         return ret;
2698         }
2699         return 0;
2700 }
2701
2702 static int binder_fixup_parent(struct binder_transaction *t,
2703                                struct binder_thread *thread,
2704                                struct binder_buffer_object *bp,
2705                                binder_size_t off_start_offset,
2706                                binder_size_t num_valid,
2707                                binder_size_t last_fixup_obj_off,
2708                                binder_size_t last_fixup_min_off)
2709 {
2710         struct binder_buffer_object *parent;
2711         struct binder_buffer *b = t->buffer;
2712         struct binder_proc *proc = thread->proc;
2713         struct binder_proc *target_proc = t->to_proc;
2714         struct binder_object object;
2715         binder_size_t buffer_offset;
2716         binder_size_t parent_offset;
2717
2718         if (!(bp->flags & BINDER_BUFFER_FLAG_HAS_PARENT))
2719                 return 0;
2720
2721         parent = binder_validate_ptr(target_proc, b, &object, bp->parent,
2722                                      off_start_offset, &parent_offset,
2723                                      num_valid);
2724         if (!parent) {
2725                 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
2726                                   proc->pid, thread->pid);
2727                 return -EINVAL;
2728         }
2729
2730         if (!binder_validate_fixup(target_proc, b, off_start_offset,
2731                                    parent_offset, bp->parent_offset,
2732                                    last_fixup_obj_off,
2733                                    last_fixup_min_off)) {
2734                 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
2735                                   proc->pid, thread->pid);
2736                 return -EINVAL;
2737         }
2738
2739         if (parent->length < sizeof(binder_uintptr_t) ||
2740             bp->parent_offset > parent->length - sizeof(binder_uintptr_t)) {
2741                 /* No space for a pointer here! */
2742                 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2743                                   proc->pid, thread->pid);
2744                 return -EINVAL;
2745         }
2746         buffer_offset = bp->parent_offset +
2747                         (uintptr_t)parent->buffer - (uintptr_t)b->user_data;
2748         if (binder_alloc_copy_to_buffer(&target_proc->alloc, b, buffer_offset,
2749                                         &bp->buffer, sizeof(bp->buffer))) {
2750                 binder_user_error("%d:%d got transaction with invalid parent offset\n",
2751                                   proc->pid, thread->pid);
2752                 return -EINVAL;
2753         }
2754
2755         return 0;
2756 }
2757
2758 /**
2759  * binder_proc_transaction() - sends a transaction to a process and wakes it up
2760  * @t:          transaction to send
2761  * @proc:       process to send the transaction to
2762  * @thread:     thread in @proc to send the transaction to (may be NULL)
2763  *
2764  * This function queues a transaction to the specified process. It will try
2765  * to find a thread in the target process to handle the transaction and
2766  * wake it up. If no thread is found, the work is queued to the proc
2767  * waitqueue.
2768  *
2769  * If the @thread parameter is not NULL, the transaction is always queued
2770  * to the waitlist of that specific thread.
2771  *
2772  * Return:      true if the transactions was successfully queued
2773  *              false if the target process or thread is dead
2774  */
2775 static bool binder_proc_transaction(struct binder_transaction *t,
2776                                     struct binder_proc *proc,
2777                                     struct binder_thread *thread)
2778 {
2779         struct binder_node *node = t->buffer->target_node;
2780         bool oneway = !!(t->flags & TF_ONE_WAY);
2781         bool pending_async = false;
2782
2783         BUG_ON(!node);
2784         binder_node_lock(node);
2785         if (oneway) {
2786                 BUG_ON(thread);
2787                 if (node->has_async_transaction) {
2788                         pending_async = true;
2789                 } else {
2790                         node->has_async_transaction = true;
2791                 }
2792         }
2793
2794         binder_inner_proc_lock(proc);
2795
2796         if (proc->is_dead || (thread && thread->is_dead)) {
2797                 binder_inner_proc_unlock(proc);
2798                 binder_node_unlock(node);
2799                 return false;
2800         }
2801
2802         if (!thread && !pending_async)
2803                 thread = binder_select_thread_ilocked(proc);
2804
2805         if (thread)
2806                 binder_enqueue_thread_work_ilocked(thread, &t->work);
2807         else if (!pending_async)
2808                 binder_enqueue_work_ilocked(&t->work, &proc->todo);
2809         else
2810                 binder_enqueue_work_ilocked(&t->work, &node->async_todo);
2811
2812         if (!pending_async)
2813                 binder_wakeup_thread_ilocked(proc, thread, !oneway /* sync */);
2814
2815         binder_inner_proc_unlock(proc);
2816         binder_node_unlock(node);
2817
2818         return true;
2819 }
2820
2821 /**
2822  * binder_get_node_refs_for_txn() - Get required refs on node for txn
2823  * @node:         struct binder_node for which to get refs
2824  * @proc:         returns @node->proc if valid
2825  * @error:        if no @proc then returns BR_DEAD_REPLY
2826  *
2827  * User-space normally keeps the node alive when creating a transaction
2828  * since it has a reference to the target. The local strong ref keeps it
2829  * alive if the sending process dies before the target process processes
2830  * the transaction. If the source process is malicious or has a reference
2831  * counting bug, relying on the local strong ref can fail.
2832  *
2833  * Since user-space can cause the local strong ref to go away, we also take
2834  * a tmpref on the node to ensure it survives while we are constructing
2835  * the transaction. We also need a tmpref on the proc while we are
2836  * constructing the transaction, so we take that here as well.
2837  *
2838  * Return: The target_node with refs taken or NULL if no @node->proc is NULL.
2839  * Also sets @proc if valid. If the @node->proc is NULL indicating that the
2840  * target proc has died, @error is set to BR_DEAD_REPLY
2841  */
2842 static struct binder_node *binder_get_node_refs_for_txn(
2843                 struct binder_node *node,
2844                 struct binder_proc **procp,
2845                 uint32_t *error)
2846 {
2847         struct binder_node *target_node = NULL;
2848
2849         binder_node_inner_lock(node);
2850         if (node->proc) {
2851                 target_node = node;
2852                 binder_inc_node_nilocked(node, 1, 0, NULL);
2853                 binder_inc_node_tmpref_ilocked(node);
2854                 node->proc->tmp_ref++;
2855                 *procp = node->proc;
2856         } else
2857                 *error = BR_DEAD_REPLY;
2858         binder_node_inner_unlock(node);
2859
2860         return target_node;
2861 }
2862
2863 static void binder_transaction(struct binder_proc *proc,
2864                                struct binder_thread *thread,
2865                                struct binder_transaction_data *tr, int reply,
2866                                binder_size_t extra_buffers_size)
2867 {
2868         int ret;
2869         struct binder_transaction *t;
2870         struct binder_work *w;
2871         struct binder_work *tcomplete;
2872         binder_size_t buffer_offset = 0;
2873         binder_size_t off_start_offset, off_end_offset;
2874         binder_size_t off_min;
2875         binder_size_t sg_buf_offset, sg_buf_end_offset;
2876         struct binder_proc *target_proc = NULL;
2877         struct binder_thread *target_thread = NULL;
2878         struct binder_node *target_node = NULL;
2879         struct binder_transaction *in_reply_to = NULL;
2880         struct binder_transaction_log_entry *e;
2881         uint32_t return_error = 0;
2882         uint32_t return_error_param = 0;
2883         uint32_t return_error_line = 0;
2884         binder_size_t last_fixup_obj_off = 0;
2885         binder_size_t last_fixup_min_off = 0;
2886         struct binder_context *context = proc->context;
2887         int t_debug_id = atomic_inc_return(&binder_last_id);
2888         char *secctx = NULL;
2889         u32 secctx_sz = 0;
2890
2891         e = binder_transaction_log_add(&binder_transaction_log);
2892         e->debug_id = t_debug_id;
2893         e->call_type = reply ? 2 : !!(tr->flags & TF_ONE_WAY);
2894         e->from_proc = proc->pid;
2895         e->from_thread = thread->pid;
2896         e->target_handle = tr->target.handle;
2897         e->data_size = tr->data_size;
2898         e->offsets_size = tr->offsets_size;
2899         e->context_name = proc->context->name;
2900
2901         if (reply) {
2902                 binder_inner_proc_lock(proc);
2903                 in_reply_to = thread->transaction_stack;
2904                 if (in_reply_to == NULL) {
2905                         binder_inner_proc_unlock(proc);
2906                         binder_user_error("%d:%d got reply transaction with no transaction stack\n",
2907                                           proc->pid, thread->pid);
2908                         return_error = BR_FAILED_REPLY;
2909                         return_error_param = -EPROTO;
2910                         return_error_line = __LINE__;
2911                         goto err_empty_call_stack;
2912                 }
2913                 if (in_reply_to->to_thread != thread) {
2914                         spin_lock(&in_reply_to->lock);
2915                         binder_user_error("%d:%d got reply transaction with bad transaction stack, transaction %d has target %d:%d\n",
2916                                 proc->pid, thread->pid, in_reply_to->debug_id,
2917                                 in_reply_to->to_proc ?
2918                                 in_reply_to->to_proc->pid : 0,
2919                                 in_reply_to->to_thread ?
2920                                 in_reply_to->to_thread->pid : 0);
2921                         spin_unlock(&in_reply_to->lock);
2922                         binder_inner_proc_unlock(proc);
2923                         return_error = BR_FAILED_REPLY;
2924                         return_error_param = -EPROTO;
2925                         return_error_line = __LINE__;
2926                         in_reply_to = NULL;
2927                         goto err_bad_call_stack;
2928                 }
2929                 thread->transaction_stack = in_reply_to->to_parent;
2930                 binder_inner_proc_unlock(proc);
2931                 binder_set_nice(in_reply_to->saved_priority);
2932                 target_thread = binder_get_txn_from_and_acq_inner(in_reply_to);
2933                 if (target_thread == NULL) {
2934                         /* annotation for sparse */
2935                         __release(&target_thread->proc->inner_lock);
2936                         return_error = BR_DEAD_REPLY;
2937                         return_error_line = __LINE__;
2938                         goto err_dead_binder;
2939                 }
2940                 if (target_thread->transaction_stack != in_reply_to) {
2941                         binder_user_error("%d:%d got reply transaction with bad target transaction stack %d, expected %d\n",
2942                                 proc->pid, thread->pid,
2943                                 target_thread->transaction_stack ?
2944                                 target_thread->transaction_stack->debug_id : 0,
2945                                 in_reply_to->debug_id);
2946                         binder_inner_proc_unlock(target_thread->proc);
2947                         return_error = BR_FAILED_REPLY;
2948                         return_error_param = -EPROTO;
2949                         return_error_line = __LINE__;
2950                         in_reply_to = NULL;
2951                         target_thread = NULL;
2952                         goto err_dead_binder;
2953                 }
2954                 target_proc = target_thread->proc;
2955                 target_proc->tmp_ref++;
2956                 binder_inner_proc_unlock(target_thread->proc);
2957         } else {
2958                 if (tr->target.handle) {
2959                         struct binder_ref *ref;
2960
2961                         /*
2962                          * There must already be a strong ref
2963                          * on this node. If so, do a strong
2964                          * increment on the node to ensure it
2965                          * stays alive until the transaction is
2966                          * done.
2967                          */
2968                         binder_proc_lock(proc);
2969                         ref = binder_get_ref_olocked(proc, tr->target.handle,
2970                                                      true);
2971                         if (ref) {
2972                                 target_node = binder_get_node_refs_for_txn(
2973                                                 ref->node, &target_proc,
2974                                                 &return_error);
2975                         } else {
2976                                 binder_user_error("%d:%d got transaction to invalid handle\n",
2977                                                   proc->pid, thread->pid);
2978                                 return_error = BR_FAILED_REPLY;
2979                         }
2980                         binder_proc_unlock(proc);
2981                 } else {
2982                         mutex_lock(&context->context_mgr_node_lock);
2983                         target_node = context->binder_context_mgr_node;
2984                         if (target_node)
2985                                 target_node = binder_get_node_refs_for_txn(
2986                                                 target_node, &target_proc,
2987                                                 &return_error);
2988                         else
2989                                 return_error = BR_DEAD_REPLY;
2990                         mutex_unlock(&context->context_mgr_node_lock);
2991                         if (target_node && target_proc == proc) {
2992                                 binder_user_error("%d:%d got transaction to context manager from process owning it\n",
2993                                                   proc->pid, thread->pid);
2994                                 return_error = BR_FAILED_REPLY;
2995                                 return_error_param = -EINVAL;
2996                                 return_error_line = __LINE__;
2997                                 goto err_invalid_target_handle;
2998                         }
2999                 }
3000                 if (!target_node) {
3001                         /*
3002                          * return_error is set above
3003                          */
3004                         return_error_param = -EINVAL;
3005                         return_error_line = __LINE__;
3006                         goto err_dead_binder;
3007                 }
3008                 e->to_node = target_node->debug_id;
3009                 if (security_binder_transaction(proc->tsk,
3010                                                 target_proc->tsk) < 0) {
3011                         return_error = BR_FAILED_REPLY;
3012                         return_error_param = -EPERM;
3013                         return_error_line = __LINE__;
3014                         goto err_invalid_target_handle;
3015                 }
3016                 binder_inner_proc_lock(proc);
3017
3018                 w = list_first_entry_or_null(&thread->todo,
3019                                              struct binder_work, entry);
3020                 if (!(tr->flags & TF_ONE_WAY) && w &&
3021                     w->type == BINDER_WORK_TRANSACTION) {
3022                         /*
3023                          * Do not allow new outgoing transaction from a
3024                          * thread that has a transaction at the head of
3025                          * its todo list. Only need to check the head
3026                          * because binder_select_thread_ilocked picks a
3027                          * thread from proc->waiting_threads to enqueue
3028                          * the transaction, and nothing is queued to the
3029                          * todo list while the thread is on waiting_threads.
3030                          */
3031                         binder_user_error("%d:%d new transaction not allowed when there is a transaction on thread todo\n",
3032                                           proc->pid, thread->pid);
3033                         binder_inner_proc_unlock(proc);
3034                         return_error = BR_FAILED_REPLY;
3035                         return_error_param = -EPROTO;
3036                         return_error_line = __LINE__;
3037                         goto err_bad_todo_list;
3038                 }
3039
3040                 if (!(tr->flags & TF_ONE_WAY) && thread->transaction_stack) {
3041                         struct binder_transaction *tmp;
3042
3043                         tmp = thread->transaction_stack;
3044                         if (tmp->to_thread != thread) {
3045                                 spin_lock(&tmp->lock);
3046                                 binder_user_error("%d:%d got new transaction with bad transaction stack, transaction %d has target %d:%d\n",
3047                                         proc->pid, thread->pid, tmp->debug_id,
3048                                         tmp->to_proc ? tmp->to_proc->pid : 0,
3049                                         tmp->to_thread ?
3050                                         tmp->to_thread->pid : 0);
3051                                 spin_unlock(&tmp->lock);
3052                                 binder_inner_proc_unlock(proc);
3053                                 return_error = BR_FAILED_REPLY;
3054                                 return_error_param = -EPROTO;
3055                                 return_error_line = __LINE__;
3056                                 goto err_bad_call_stack;
3057                         }
3058                         while (tmp) {
3059                                 struct binder_thread *from;
3060
3061                                 spin_lock(&tmp->lock);
3062                                 from = tmp->from;
3063                                 if (from && from->proc == target_proc) {
3064                                         atomic_inc(&from->tmp_ref);
3065                                         target_thread = from;
3066                                         spin_unlock(&tmp->lock);
3067                                         break;
3068                                 }
3069                                 spin_unlock(&tmp->lock);
3070                                 tmp = tmp->from_parent;
3071                         }
3072                 }
3073                 binder_inner_proc_unlock(proc);
3074         }
3075         if (target_thread)
3076                 e->to_thread = target_thread->pid;
3077         e->to_proc = target_proc->pid;
3078
3079         /* TODO: reuse incoming transaction for reply */
3080         t = kzalloc(sizeof(*t), GFP_KERNEL);
3081         if (t == NULL) {
3082                 return_error = BR_FAILED_REPLY;
3083                 return_error_param = -ENOMEM;
3084                 return_error_line = __LINE__;
3085                 goto err_alloc_t_failed;
3086         }
3087         INIT_LIST_HEAD(&t->fd_fixups);
3088         binder_stats_created(BINDER_STAT_TRANSACTION);
3089         spin_lock_init(&t->lock);
3090
3091         tcomplete = kzalloc(sizeof(*tcomplete), GFP_KERNEL);
3092         if (tcomplete == NULL) {
3093                 return_error = BR_FAILED_REPLY;
3094                 return_error_param = -ENOMEM;
3095                 return_error_line = __LINE__;
3096                 goto err_alloc_tcomplete_failed;
3097         }
3098         binder_stats_created(BINDER_STAT_TRANSACTION_COMPLETE);
3099
3100         t->debug_id = t_debug_id;
3101
3102         if (reply)
3103                 binder_debug(BINDER_DEBUG_TRANSACTION,
3104                              "%d:%d BC_REPLY %d -> %d:%d, data %016llx-%016llx size %lld-%lld-%lld\n",
3105                              proc->pid, thread->pid, t->debug_id,
3106                              target_proc->pid, target_thread->pid,
3107                              (u64)tr->data.ptr.buffer,
3108                              (u64)tr->data.ptr.offsets,
3109                              (u64)tr->data_size, (u64)tr->offsets_size,
3110                              (u64)extra_buffers_size);
3111         else
3112                 binder_debug(BINDER_DEBUG_TRANSACTION,
3113                              "%d:%d BC_TRANSACTION %d -> %d - node %d, data %016llx-%016llx size %lld-%lld-%lld\n",
3114                              proc->pid, thread->pid, t->debug_id,
3115                              target_proc->pid, target_node->debug_id,
3116                              (u64)tr->data.ptr.buffer,
3117                              (u64)tr->data.ptr.offsets,
3118                              (u64)tr->data_size, (u64)tr->offsets_size,
3119                              (u64)extra_buffers_size);
3120
3121         if (!reply && !(tr->flags & TF_ONE_WAY))
3122                 t->from = thread;
3123         else
3124                 t->from = NULL;
3125         t->sender_euid = task_euid(proc->tsk);
3126         t->to_proc = target_proc;
3127         t->to_thread = target_thread;
3128         t->code = tr->code;
3129         t->flags = tr->flags;
3130         t->priority = task_nice(current);
3131
3132         if (target_node && target_node->txn_security_ctx) {
3133                 u32 secid;
3134                 size_t added_size;
3135
3136                 security_task_getsecid(proc->tsk, &secid);
3137                 ret = security_secid_to_secctx(secid, &secctx, &secctx_sz);
3138                 if (ret) {
3139                         return_error = BR_FAILED_REPLY;
3140                         return_error_param = ret;
3141                         return_error_line = __LINE__;
3142                         goto err_get_secctx_failed;
3143                 }
3144                 added_size = ALIGN(secctx_sz, sizeof(u64));
3145                 extra_buffers_size += added_size;
3146                 if (extra_buffers_size < added_size) {
3147                         /* integer overflow of extra_buffers_size */
3148                         return_error = BR_FAILED_REPLY;
3149                         return_error_param = EINVAL;
3150                         return_error_line = __LINE__;
3151                         goto err_bad_extra_size;
3152                 }
3153         }
3154
3155         trace_binder_transaction(reply, t, target_node);
3156
3157         t->buffer = binder_alloc_new_buf(&target_proc->alloc, tr->data_size,
3158                 tr->offsets_size, extra_buffers_size,
3159                 !reply && (t->flags & TF_ONE_WAY));
3160         if (IS_ERR(t->buffer)) {
3161                 /*
3162                  * -ESRCH indicates VMA cleared. The target is dying.
3163                  */
3164                 return_error_param = PTR_ERR(t->buffer);
3165                 return_error = return_error_param == -ESRCH ?
3166                         BR_DEAD_REPLY : BR_FAILED_REPLY;
3167                 return_error_line = __LINE__;
3168                 t->buffer = NULL;
3169                 goto err_binder_alloc_buf_failed;
3170         }
3171         if (secctx) {
3172                 int err;
3173                 size_t buf_offset = ALIGN(tr->data_size, sizeof(void *)) +
3174                                     ALIGN(tr->offsets_size, sizeof(void *)) +
3175                                     ALIGN(extra_buffers_size, sizeof(void *)) -
3176                                     ALIGN(secctx_sz, sizeof(u64));
3177
3178                 t->security_ctx = (uintptr_t)t->buffer->user_data + buf_offset;
3179                 err = binder_alloc_copy_to_buffer(&target_proc->alloc,
3180                                                   t->buffer, buf_offset,
3181                                                   secctx, secctx_sz);
3182                 if (err) {
3183                         t->security_ctx = 0;
3184                         WARN_ON(1);
3185                 }
3186                 security_release_secctx(secctx, secctx_sz);
3187                 secctx = NULL;
3188         }
3189         t->buffer->debug_id = t->debug_id;
3190         t->buffer->transaction = t;
3191         t->buffer->target_node = target_node;
3192         trace_binder_transaction_alloc_buf(t->buffer);
3193
3194         if (binder_alloc_copy_user_to_buffer(
3195                                 &target_proc->alloc,
3196                                 t->buffer, 0,
3197                                 (const void __user *)
3198                                         (uintptr_t)tr->data.ptr.buffer,
3199                                 tr->data_size)) {
3200                 binder_user_error("%d:%d got transaction with invalid data ptr\n",
3201                                 proc->pid, thread->pid);
3202                 return_error = BR_FAILED_REPLY;
3203                 return_error_param = -EFAULT;
3204                 return_error_line = __LINE__;
3205                 goto err_copy_data_failed;
3206         }
3207         if (binder_alloc_copy_user_to_buffer(
3208                                 &target_proc->alloc,
3209                                 t->buffer,
3210                                 ALIGN(tr->data_size, sizeof(void *)),
3211                                 (const void __user *)
3212                                         (uintptr_t)tr->data.ptr.offsets,
3213                                 tr->offsets_size)) {
3214                 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
3215                                 proc->pid, thread->pid);
3216                 return_error = BR_FAILED_REPLY;
3217                 return_error_param = -EFAULT;
3218                 return_error_line = __LINE__;
3219                 goto err_copy_data_failed;
3220         }
3221         if (!IS_ALIGNED(tr->offsets_size, sizeof(binder_size_t))) {
3222                 binder_user_error("%d:%d got transaction with invalid offsets size, %lld\n",
3223                                 proc->pid, thread->pid, (u64)tr->offsets_size);
3224                 return_error = BR_FAILED_REPLY;
3225                 return_error_param = -EINVAL;
3226                 return_error_line = __LINE__;
3227                 goto err_bad_offset;
3228         }
3229         if (!IS_ALIGNED(extra_buffers_size, sizeof(u64))) {
3230                 binder_user_error("%d:%d got transaction with unaligned buffers size, %lld\n",
3231                                   proc->pid, thread->pid,
3232                                   (u64)extra_buffers_size);
3233                 return_error = BR_FAILED_REPLY;
3234                 return_error_param = -EINVAL;
3235                 return_error_line = __LINE__;
3236                 goto err_bad_offset;
3237         }
3238         off_start_offset = ALIGN(tr->data_size, sizeof(void *));
3239         buffer_offset = off_start_offset;
3240         off_end_offset = off_start_offset + tr->offsets_size;
3241         sg_buf_offset = ALIGN(off_end_offset, sizeof(void *));
3242         sg_buf_end_offset = sg_buf_offset + extra_buffers_size;
3243         off_min = 0;
3244         for (buffer_offset = off_start_offset; buffer_offset < off_end_offset;
3245              buffer_offset += sizeof(binder_size_t)) {
3246                 struct binder_object_header *hdr;
3247                 size_t object_size;
3248                 struct binder_object object;
3249                 binder_size_t object_offset;
3250
3251                 if (binder_alloc_copy_from_buffer(&target_proc->alloc,
3252                                                   &object_offset,
3253                                                   t->buffer,
3254                                                   buffer_offset,
3255                                                   sizeof(object_offset))) {
3256                         return_error = BR_FAILED_REPLY;
3257                         return_error_param = -EINVAL;
3258                         return_error_line = __LINE__;
3259                         goto err_bad_offset;
3260                 }
3261                 object_size = binder_get_object(target_proc, t->buffer,
3262                                                 object_offset, &object);
3263                 if (object_size == 0 || object_offset < off_min) {
3264                         binder_user_error("%d:%d got transaction with invalid offset (%lld, min %lld max %lld) or object.\n",
3265                                           proc->pid, thread->pid,
3266                                           (u64)object_offset,
3267                                           (u64)off_min,
3268                                           (u64)t->buffer->data_size);
3269                         return_error = BR_FAILED_REPLY;
3270                         return_error_param = -EINVAL;
3271                         return_error_line = __LINE__;
3272                         goto err_bad_offset;
3273                 }
3274
3275                 hdr = &object.hdr;
3276                 off_min = object_offset + object_size;
3277                 switch (hdr->type) {
3278                 case BINDER_TYPE_BINDER:
3279                 case BINDER_TYPE_WEAK_BINDER: {
3280                         struct flat_binder_object *fp;
3281
3282                         fp = to_flat_binder_object(hdr);
3283                         ret = binder_translate_binder(fp, t, thread);
3284
3285                         if (ret < 0 ||
3286                             binder_alloc_copy_to_buffer(&target_proc->alloc,
3287                                                         t->buffer,
3288                                                         object_offset,
3289                                                         fp, sizeof(*fp))) {
3290                                 return_error = BR_FAILED_REPLY;
3291                                 return_error_param = ret;
3292                                 return_error_line = __LINE__;
3293                                 goto err_translate_failed;
3294                         }
3295                 } break;
3296                 case BINDER_TYPE_HANDLE:
3297                 case BINDER_TYPE_WEAK_HANDLE: {
3298                         struct flat_binder_object *fp;
3299
3300                         fp = to_flat_binder_object(hdr);
3301                         ret = binder_translate_handle(fp, t, thread);
3302                         if (ret < 0 ||
3303                             binder_alloc_copy_to_buffer(&target_proc->alloc,
3304                                                         t->buffer,
3305                                                         object_offset,
3306                                                         fp, sizeof(*fp))) {
3307                                 return_error = BR_FAILED_REPLY;
3308                                 return_error_param = ret;
3309                                 return_error_line = __LINE__;
3310                                 goto err_translate_failed;
3311                         }
3312                 } break;
3313
3314                 case BINDER_TYPE_FD: {
3315                         struct binder_fd_object *fp = to_binder_fd_object(hdr);
3316                         binder_size_t fd_offset = object_offset +
3317                                 (uintptr_t)&fp->fd - (uintptr_t)fp;
3318                         int ret = binder_translate_fd(fp->fd, fd_offset, t,
3319                                                       thread, in_reply_to);
3320
3321                         fp->pad_binder = 0;
3322                         if (ret < 0 ||
3323                             binder_alloc_copy_to_buffer(&target_proc->alloc,
3324                                                         t->buffer,
3325                                                         object_offset,
3326                                                         fp, sizeof(*fp))) {
3327                                 return_error = BR_FAILED_REPLY;
3328                                 return_error_param = ret;
3329                                 return_error_line = __LINE__;
3330                                 goto err_translate_failed;
3331                         }
3332                 } break;
3333                 case BINDER_TYPE_FDA: {
3334                         struct binder_object ptr_object;
3335                         binder_size_t parent_offset;
3336                         struct binder_fd_array_object *fda =
3337                                 to_binder_fd_array_object(hdr);
3338                         size_t num_valid = (buffer_offset - off_start_offset) *
3339                                                 sizeof(binder_size_t);
3340                         struct binder_buffer_object *parent =
3341                                 binder_validate_ptr(target_proc, t->buffer,
3342                                                     &ptr_object, fda->parent,
3343                                                     off_start_offset,
3344                                                     &parent_offset,
3345                                                     num_valid);
3346                         if (!parent) {
3347                                 binder_user_error("%d:%d got transaction with invalid parent offset or type\n",
3348                                                   proc->pid, thread->pid);
3349                                 return_error = BR_FAILED_REPLY;
3350                                 return_error_param = -EINVAL;
3351                                 return_error_line = __LINE__;
3352                                 goto err_bad_parent;
3353                         }
3354                         if (!binder_validate_fixup(target_proc, t->buffer,
3355                                                    off_start_offset,
3356                                                    parent_offset,
3357                                                    fda->parent_offset,
3358                                                    last_fixup_obj_off,
3359                                                    last_fixup_min_off)) {
3360                                 binder_user_error("%d:%d got transaction with out-of-order buffer fixup\n",
3361                                                   proc->pid, thread->pid);
3362                                 return_error = BR_FAILED_REPLY;
3363                                 return_error_param = -EINVAL;
3364                                 return_error_line = __LINE__;
3365                                 goto err_bad_parent;
3366                         }
3367                         ret = binder_translate_fd_array(fda, parent, t, thread,
3368                                                         in_reply_to);
3369                         if (ret < 0) {
3370                                 return_error = BR_FAILED_REPLY;
3371                                 return_error_param = ret;
3372                                 return_error_line = __LINE__;
3373                                 goto err_translate_failed;
3374                         }
3375                         last_fixup_obj_off = parent_offset;
3376                         last_fixup_min_off =
3377                                 fda->parent_offset + sizeof(u32) * fda->num_fds;
3378                 } break;
3379                 case BINDER_TYPE_PTR: {
3380                         struct binder_buffer_object *bp =
3381                                 to_binder_buffer_object(hdr);
3382                         size_t buf_left = sg_buf_end_offset - sg_buf_offset;
3383                         size_t num_valid;
3384
3385                         if (bp->length > buf_left) {
3386                                 binder_user_error("%d:%d got transaction with too large buffer\n",
3387                                                   proc->pid, thread->pid);
3388                                 return_error = BR_FAILED_REPLY;
3389                                 return_error_param = -EINVAL;
3390                                 return_error_line = __LINE__;
3391                                 goto err_bad_offset;
3392                         }
3393                         if (binder_alloc_copy_user_to_buffer(
3394                                                 &target_proc->alloc,
3395                                                 t->buffer,
3396                                                 sg_buf_offset,
3397                                                 (const void __user *)
3398                                                         (uintptr_t)bp->buffer,
3399                                                 bp->length)) {
3400                                 binder_user_error("%d:%d got transaction with invalid offsets ptr\n",
3401                                                   proc->pid, thread->pid);
3402                                 return_error_param = -EFAULT;
3403                                 return_error = BR_FAILED_REPLY;
3404                                 return_error_line = __LINE__;
3405                                 goto err_copy_data_failed;
3406                         }
3407                         /* Fixup buffer pointer to target proc address space */
3408                         bp->buffer = (uintptr_t)
3409                                 t->buffer->user_data + sg_buf_offset;
3410                         sg_buf_offset += ALIGN(bp->length, sizeof(u64));
3411
3412                         num_valid = (buffer_offset - off_start_offset) *
3413                                         sizeof(binder_size_t);
3414                         ret = binder_fixup_parent(t, thread, bp,
3415                                                   off_start_offset,
3416                                                   num_valid,
3417                                                   last_fixup_obj_off,
3418                                                   last_fixup_min_off);
3419                         if (ret < 0 ||
3420                             binder_alloc_copy_to_buffer(&target_proc->alloc,
3421                                                         t->buffer,
3422                                                         object_offset,
3423                                                         bp, sizeof(*bp))) {
3424                                 return_error = BR_FAILED_REPLY;
3425                                 return_error_param = ret;
3426                                 return_error_line = __LINE__;
3427                                 goto err_translate_failed;
3428                         }
3429                         last_fixup_obj_off = object_offset;
3430                         last_fixup_min_off = 0;
3431                 } break;
3432                 default:
3433                         binder_user_error("%d:%d got transaction with invalid object type, %x\n",
3434                                 proc->pid, thread->pid, hdr->type);
3435                         return_error = BR_FAILED_REPLY;
3436                         return_error_param = -EINVAL;
3437                         return_error_line = __LINE__;
3438                         goto err_bad_object_type;
3439                 }
3440         }
3441         tcomplete->type = BINDER_WORK_TRANSACTION_COMPLETE;
3442         t->work.type = BINDER_WORK_TRANSACTION;
3443
3444         if (reply) {
3445                 binder_enqueue_thread_work(thread, tcomplete);
3446                 binder_inner_proc_lock(target_proc);
3447                 if (target_thread->is_dead) {
3448                         binder_inner_proc_unlock(target_proc);
3449                         goto err_dead_proc_or_thread;
3450                 }
3451                 BUG_ON(t->buffer->async_transaction != 0);
3452                 binder_pop_transaction_ilocked(target_thread, in_reply_to);
3453                 binder_enqueue_thread_work_ilocked(target_thread, &t->work);
3454                 binder_inner_proc_unlock(target_proc);
3455                 wake_up_interruptible_sync(&target_thread->wait);
3456                 binder_free_transaction(in_reply_to);
3457         } else if (!(t->flags & TF_ONE_WAY)) {
3458                 BUG_ON(t->buffer->async_transaction != 0);
3459                 binder_inner_proc_lock(proc);
3460                 /*
3461                  * Defer the TRANSACTION_COMPLETE, so we don't return to
3462                  * userspace immediately; this allows the target process to
3463                  * immediately start processing this transaction, reducing
3464                  * latency. We will then return the TRANSACTION_COMPLETE when
3465                  * the target replies (or there is an error).
3466                  */
3467                 binder_enqueue_deferred_thread_work_ilocked(thread, tcomplete);
3468                 t->need_reply = 1;
3469                 t->from_parent = thread->transaction_stack;
3470                 thread->transaction_stack = t;
3471                 binder_inner_proc_unlock(proc);
3472                 if (!binder_proc_transaction(t, target_proc, target_thread)) {
3473                         binder_inner_proc_lock(proc);
3474                         binder_pop_transaction_ilocked(thread, t);
3475                         binder_inner_proc_unlock(proc);
3476                         goto err_dead_proc_or_thread;
3477                 }
3478         } else {
3479                 BUG_ON(target_node == NULL);
3480                 BUG_ON(t->buffer->async_transaction != 1);
3481                 binder_enqueue_thread_work(thread, tcomplete);
3482                 if (!binder_proc_transaction(t, target_proc, NULL))
3483                         goto err_dead_proc_or_thread;
3484         }
3485         if (target_thread)
3486                 binder_thread_dec_tmpref(target_thread);
3487         binder_proc_dec_tmpref(target_proc);
3488         if (target_node)
3489                 binder_dec_node_tmpref(target_node);
3490         /*
3491          * write barrier to synchronize with initialization
3492          * of log entry
3493          */
3494         smp_wmb();
3495         WRITE_ONCE(e->debug_id_done, t_debug_id);
3496         return;
3497
3498 err_dead_proc_or_thread:
3499         return_error = BR_DEAD_REPLY;
3500         return_error_line = __LINE__;
3501         binder_dequeue_work(proc, tcomplete);
3502 err_translate_failed:
3503 err_bad_object_type:
3504 err_bad_offset:
3505 err_bad_parent:
3506 err_copy_data_failed:
3507         binder_free_txn_fixups(t);
3508         trace_binder_transaction_failed_buffer_release(t->buffer);
3509         binder_transaction_buffer_release(target_proc, t->buffer,
3510                                           buffer_offset, true);
3511         if (target_node)
3512                 binder_dec_node_tmpref(target_node);
3513         target_node = NULL;
3514         t->buffer->transaction = NULL;
3515         binder_alloc_free_buf(&target_proc->alloc, t->buffer);
3516 err_binder_alloc_buf_failed:
3517 err_bad_extra_size:
3518         if (secctx)
3519                 security_release_secctx(secctx, secctx_sz);
3520 err_get_secctx_failed:
3521         kfree(tcomplete);
3522         binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
3523 err_alloc_tcomplete_failed:
3524         kfree(t);
3525         binder_stats_deleted(BINDER_STAT_TRANSACTION);
3526 err_alloc_t_failed:
3527 err_bad_todo_list:
3528 err_bad_call_stack:
3529 err_empty_call_stack:
3530 err_dead_binder:
3531 err_invalid_target_handle:
3532         if (target_thread)
3533                 binder_thread_dec_tmpref(target_thread);
3534         if (target_proc)
3535                 binder_proc_dec_tmpref(target_proc);
3536         if (target_node) {
3537                 binder_dec_node(target_node, 1, 0);
3538                 binder_dec_node_tmpref(target_node);
3539         }
3540
3541         binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
3542                      "%d:%d transaction failed %d/%d, size %lld-%lld line %d\n",
3543                      proc->pid, thread->pid, return_error, return_error_param,
3544                      (u64)tr->data_size, (u64)tr->offsets_size,
3545                      return_error_line);
3546
3547         {
3548                 struct binder_transaction_log_entry *fe;
3549
3550                 e->return_error = return_error;
3551                 e->return_error_param = return_error_param;
3552                 e->return_error_line = return_error_line;
3553                 fe = binder_transaction_log_add(&binder_transaction_log_failed);
3554                 *fe = *e;
3555                 /*
3556                  * write barrier to synchronize with initialization
3557                  * of log entry
3558                  */
3559                 smp_wmb();
3560                 WRITE_ONCE(e->debug_id_done, t_debug_id);
3561                 WRITE_ONCE(fe->debug_id_done, t_debug_id);
3562         }
3563
3564         BUG_ON(thread->return_error.cmd != BR_OK);
3565         if (in_reply_to) {
3566                 thread->return_error.cmd = BR_TRANSACTION_COMPLETE;
3567                 binder_enqueue_thread_work(thread, &thread->return_error.work);
3568                 binder_send_failed_reply(in_reply_to, return_error);
3569         } else {
3570                 thread->return_error.cmd = return_error;
3571                 binder_enqueue_thread_work(thread, &thread->return_error.work);
3572         }
3573 }
3574
3575 /**
3576  * binder_free_buf() - free the specified buffer
3577  * @proc:       binder proc that owns buffer
3578  * @buffer:     buffer to be freed
3579  *
3580  * If buffer for an async transaction, enqueue the next async
3581  * transaction from the node.
3582  *
3583  * Cleanup buffer and free it.
3584  */
3585 static void
3586 binder_free_buf(struct binder_proc *proc, struct binder_buffer *buffer)
3587 {
3588         binder_inner_proc_lock(proc);
3589         if (buffer->transaction) {
3590                 buffer->transaction->buffer = NULL;
3591                 buffer->transaction = NULL;
3592         }
3593         binder_inner_proc_unlock(proc);
3594         if (buffer->async_transaction && buffer->target_node) {
3595                 struct binder_node *buf_node;
3596                 struct binder_work *w;
3597
3598                 buf_node = buffer->target_node;
3599                 binder_node_inner_lock(buf_node);
3600                 BUG_ON(!buf_node->has_async_transaction);
3601                 BUG_ON(buf_node->proc != proc);
3602                 w = binder_dequeue_work_head_ilocked(
3603                                 &buf_node->async_todo);
3604                 if (!w) {
3605                         buf_node->has_async_transaction = false;
3606                 } else {
3607                         binder_enqueue_work_ilocked(
3608                                         w, &proc->todo);
3609                         binder_wakeup_proc_ilocked(proc);
3610                 }
3611                 binder_node_inner_unlock(buf_node);
3612         }
3613         trace_binder_transaction_buffer_release(buffer);
3614         binder_transaction_buffer_release(proc, buffer, 0, false);
3615         binder_alloc_free_buf(&proc->alloc, buffer);
3616 }
3617
3618 static int binder_thread_write(struct binder_proc *proc,
3619                         struct binder_thread *thread,
3620                         binder_uintptr_t binder_buffer, size_t size,
3621                         binder_size_t *consumed)
3622 {
3623         uint32_t cmd;
3624         struct binder_context *context = proc->context;
3625         void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
3626         void __user *ptr = buffer + *consumed;
3627         void __user *end = buffer + size;
3628
3629         while (ptr < end && thread->return_error.cmd == BR_OK) {
3630                 int ret;
3631
3632                 if (get_user(cmd, (uint32_t __user *)ptr))
3633                         return -EFAULT;
3634                 ptr += sizeof(uint32_t);
3635                 trace_binder_command(cmd);
3636                 if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.bc)) {
3637                         atomic_inc(&binder_stats.bc[_IOC_NR(cmd)]);
3638                         atomic_inc(&proc->stats.bc[_IOC_NR(cmd)]);
3639                         atomic_inc(&thread->stats.bc[_IOC_NR(cmd)]);
3640                 }
3641                 switch (cmd) {
3642                 case BC_INCREFS:
3643                 case BC_ACQUIRE:
3644                 case BC_RELEASE:
3645                 case BC_DECREFS: {
3646                         uint32_t target;
3647                         const char *debug_string;
3648                         bool strong = cmd == BC_ACQUIRE || cmd == BC_RELEASE;
3649                         bool increment = cmd == BC_INCREFS || cmd == BC_ACQUIRE;
3650                         struct binder_ref_data rdata;
3651
3652                         if (get_user(target, (uint32_t __user *)ptr))
3653                                 return -EFAULT;
3654
3655                         ptr += sizeof(uint32_t);
3656                         ret = -1;
3657                         if (increment && !target) {
3658                                 struct binder_node *ctx_mgr_node;
3659                                 mutex_lock(&context->context_mgr_node_lock);
3660                                 ctx_mgr_node = context->binder_context_mgr_node;
3661                                 if (ctx_mgr_node)
3662                                         ret = binder_inc_ref_for_node(
3663                                                         proc, ctx_mgr_node,
3664                                                         strong, NULL, &rdata);
3665                                 mutex_unlock(&context->context_mgr_node_lock);
3666                         }
3667                         if (ret)
3668                                 ret = binder_update_ref_for_handle(
3669                                                 proc, target, increment, strong,
3670                                                 &rdata);
3671                         if (!ret && rdata.desc != target) {
3672                                 binder_user_error("%d:%d tried to acquire reference to desc %d, got %d instead\n",
3673                                         proc->pid, thread->pid,
3674                                         target, rdata.desc);
3675                         }
3676                         switch (cmd) {
3677                         case BC_INCREFS:
3678                                 debug_string = "IncRefs";
3679                                 break;
3680                         case BC_ACQUIRE:
3681                                 debug_string = "Acquire";
3682                                 break;
3683                         case BC_RELEASE:
3684                                 debug_string = "Release";
3685                                 break;
3686                         case BC_DECREFS:
3687                         default:
3688                                 debug_string = "DecRefs";
3689                                 break;
3690                         }
3691                         if (ret) {
3692                                 binder_user_error("%d:%d %s %d refcount change on invalid ref %d ret %d\n",
3693                                         proc->pid, thread->pid, debug_string,
3694                                         strong, target, ret);
3695                                 break;
3696                         }
3697                         binder_debug(BINDER_DEBUG_USER_REFS,
3698                                      "%d:%d %s ref %d desc %d s %d w %d\n",
3699                                      proc->pid, thread->pid, debug_string,
3700                                      rdata.debug_id, rdata.desc, rdata.strong,
3701                                      rdata.weak);
3702                         break;
3703                 }
3704                 case BC_INCREFS_DONE:
3705                 case BC_ACQUIRE_DONE: {
3706                         binder_uintptr_t node_ptr;
3707                         binder_uintptr_t cookie;
3708                         struct binder_node *node;
3709                         bool free_node;
3710
3711                         if (get_user(node_ptr, (binder_uintptr_t __user *)ptr))
3712                                 return -EFAULT;
3713                         ptr += sizeof(binder_uintptr_t);
3714                         if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3715                                 return -EFAULT;
3716                         ptr += sizeof(binder_uintptr_t);
3717                         node = binder_get_node(proc, node_ptr);
3718                         if (node == NULL) {
3719                                 binder_user_error("%d:%d %s u%016llx no match\n",
3720                                         proc->pid, thread->pid,
3721                                         cmd == BC_INCREFS_DONE ?
3722                                         "BC_INCREFS_DONE" :
3723                                         "BC_ACQUIRE_DONE",
3724                                         (u64)node_ptr);
3725                                 break;
3726                         }
3727                         if (cookie != node->cookie) {
3728                                 binder_user_error("%d:%d %s u%016llx node %d cookie mismatch %016llx != %016llx\n",
3729                                         proc->pid, thread->pid,
3730                                         cmd == BC_INCREFS_DONE ?
3731                                         "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3732                                         (u64)node_ptr, node->debug_id,
3733                                         (u64)cookie, (u64)node->cookie);
3734                                 binder_put_node(node);
3735                                 break;
3736                         }
3737                         binder_node_inner_lock(node);
3738                         if (cmd == BC_ACQUIRE_DONE) {
3739                                 if (node->pending_strong_ref == 0) {
3740                                         binder_user_error("%d:%d BC_ACQUIRE_DONE node %d has no pending acquire request\n",
3741                                                 proc->pid, thread->pid,
3742                                                 node->debug_id);
3743                                         binder_node_inner_unlock(node);
3744                                         binder_put_node(node);
3745                                         break;
3746                                 }
3747                                 node->pending_strong_ref = 0;
3748                         } else {
3749                                 if (node->pending_weak_ref == 0) {
3750                                         binder_user_error("%d:%d BC_INCREFS_DONE node %d has no pending increfs request\n",
3751                                                 proc->pid, thread->pid,
3752                                                 node->debug_id);
3753                                         binder_node_inner_unlock(node);
3754                                         binder_put_node(node);
3755                                         break;
3756                                 }
3757                                 node->pending_weak_ref = 0;
3758                         }
3759                         free_node = binder_dec_node_nilocked(node,
3760                                         cmd == BC_ACQUIRE_DONE, 0);
3761                         WARN_ON(free_node);
3762                         binder_debug(BINDER_DEBUG_USER_REFS,
3763                                      "%d:%d %s node %d ls %d lw %d tr %d\n",
3764                                      proc->pid, thread->pid,
3765                                      cmd == BC_INCREFS_DONE ? "BC_INCREFS_DONE" : "BC_ACQUIRE_DONE",
3766                                      node->debug_id, node->local_strong_refs,
3767                                      node->local_weak_refs, node->tmp_refs);
3768                         binder_node_inner_unlock(node);
3769                         binder_put_node(node);
3770                         break;
3771                 }
3772                 case BC_ATTEMPT_ACQUIRE:
3773                         pr_err("BC_ATTEMPT_ACQUIRE not supported\n");
3774                         return -EINVAL;
3775                 case BC_ACQUIRE_RESULT:
3776                         pr_err("BC_ACQUIRE_RESULT not supported\n");
3777                         return -EINVAL;
3778
3779                 case BC_FREE_BUFFER: {
3780                         binder_uintptr_t data_ptr;
3781                         struct binder_buffer *buffer;
3782
3783                         if (get_user(data_ptr, (binder_uintptr_t __user *)ptr))
3784                                 return -EFAULT;
3785                         ptr += sizeof(binder_uintptr_t);
3786
3787                         buffer = binder_alloc_prepare_to_free(&proc->alloc,
3788                                                               data_ptr);
3789                         if (IS_ERR_OR_NULL(buffer)) {
3790                                 if (PTR_ERR(buffer) == -EPERM) {
3791                                         binder_user_error(
3792                                                 "%d:%d BC_FREE_BUFFER u%016llx matched unreturned or currently freeing buffer\n",
3793                                                 proc->pid, thread->pid,
3794                                                 (u64)data_ptr);
3795                                 } else {
3796                                         binder_user_error(
3797                                                 "%d:%d BC_FREE_BUFFER u%016llx no match\n",
3798                                                 proc->pid, thread->pid,
3799                                                 (u64)data_ptr);
3800                                 }
3801                                 break;
3802                         }
3803                         binder_debug(BINDER_DEBUG_FREE_BUFFER,
3804                                      "%d:%d BC_FREE_BUFFER u%016llx found buffer %d for %s transaction\n",
3805                                      proc->pid, thread->pid, (u64)data_ptr,
3806                                      buffer->debug_id,
3807                                      buffer->transaction ? "active" : "finished");
3808                         binder_free_buf(proc, buffer);
3809                         break;
3810                 }
3811
3812                 case BC_TRANSACTION_SG:
3813                 case BC_REPLY_SG: {
3814                         struct binder_transaction_data_sg tr;
3815
3816                         if (copy_from_user(&tr, ptr, sizeof(tr)))
3817                                 return -EFAULT;
3818                         ptr += sizeof(tr);
3819                         binder_transaction(proc, thread, &tr.transaction_data,
3820                                            cmd == BC_REPLY_SG, tr.buffers_size);
3821                         break;
3822                 }
3823                 case BC_TRANSACTION:
3824                 case BC_REPLY: {
3825                         struct binder_transaction_data tr;
3826
3827                         if (copy_from_user(&tr, ptr, sizeof(tr)))
3828                                 return -EFAULT;
3829                         ptr += sizeof(tr);
3830                         binder_transaction(proc, thread, &tr,
3831                                            cmd == BC_REPLY, 0);
3832                         break;
3833                 }
3834
3835                 case BC_REGISTER_LOOPER:
3836                         binder_debug(BINDER_DEBUG_THREADS,
3837                                      "%d:%d BC_REGISTER_LOOPER\n",
3838                                      proc->pid, thread->pid);
3839                         binder_inner_proc_lock(proc);
3840                         if (thread->looper & BINDER_LOOPER_STATE_ENTERED) {
3841                                 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3842                                 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called after BC_ENTER_LOOPER\n",
3843                                         proc->pid, thread->pid);
3844                         } else if (proc->requested_threads == 0) {
3845                                 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3846                                 binder_user_error("%d:%d ERROR: BC_REGISTER_LOOPER called without request\n",
3847                                         proc->pid, thread->pid);
3848                         } else {
3849                                 proc->requested_threads--;
3850                                 proc->requested_threads_started++;
3851                         }
3852                         thread->looper |= BINDER_LOOPER_STATE_REGISTERED;
3853                         binder_inner_proc_unlock(proc);
3854                         break;
3855                 case BC_ENTER_LOOPER:
3856                         binder_debug(BINDER_DEBUG_THREADS,
3857                                      "%d:%d BC_ENTER_LOOPER\n",
3858                                      proc->pid, thread->pid);
3859                         if (thread->looper & BINDER_LOOPER_STATE_REGISTERED) {
3860                                 thread->looper |= BINDER_LOOPER_STATE_INVALID;
3861                                 binder_user_error("%d:%d ERROR: BC_ENTER_LOOPER called after BC_REGISTER_LOOPER\n",
3862                                         proc->pid, thread->pid);
3863                         }
3864                         thread->looper |= BINDER_LOOPER_STATE_ENTERED;
3865                         break;
3866                 case BC_EXIT_LOOPER:
3867                         binder_debug(BINDER_DEBUG_THREADS,
3868                                      "%d:%d BC_EXIT_LOOPER\n",
3869                                      proc->pid, thread->pid);
3870                         thread->looper |= BINDER_LOOPER_STATE_EXITED;
3871                         break;
3872
3873                 case BC_REQUEST_DEATH_NOTIFICATION:
3874                 case BC_CLEAR_DEATH_NOTIFICATION: {
3875                         uint32_t target;
3876                         binder_uintptr_t cookie;
3877                         struct binder_ref *ref;
3878                         struct binder_ref_death *death = NULL;
3879
3880                         if (get_user(target, (uint32_t __user *)ptr))
3881                                 return -EFAULT;
3882                         ptr += sizeof(uint32_t);
3883                         if (get_user(cookie, (binder_uintptr_t __user *)ptr))
3884                                 return -EFAULT;
3885                         ptr += sizeof(binder_uintptr_t);
3886                         if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
3887                                 /*
3888                                  * Allocate memory for death notification
3889                                  * before taking lock
3890                                  */
3891                                 death = kzalloc(sizeof(*death), GFP_KERNEL);
3892                                 if (death == NULL) {
3893                                         WARN_ON(thread->return_error.cmd !=
3894                                                 BR_OK);
3895                                         thread->return_error.cmd = BR_ERROR;
3896                                         binder_enqueue_thread_work(
3897                                                 thread,
3898                                                 &thread->return_error.work);
3899                                         binder_debug(
3900                                                 BINDER_DEBUG_FAILED_TRANSACTION,
3901                                                 "%d:%d BC_REQUEST_DEATH_NOTIFICATION failed\n",
3902                                                 proc->pid, thread->pid);
3903                                         break;
3904                                 }
3905                         }
3906                         binder_proc_lock(proc);
3907                         ref = binder_get_ref_olocked(proc, target, false);
3908                         if (ref == NULL) {
3909                                 binder_user_error("%d:%d %s invalid ref %d\n",
3910                                         proc->pid, thread->pid,
3911                                         cmd == BC_REQUEST_DEATH_NOTIFICATION ?
3912                                         "BC_REQUEST_DEATH_NOTIFICATION" :
3913                                         "BC_CLEAR_DEATH_NOTIFICATION",
3914                                         target);
3915                                 binder_proc_unlock(proc);
3916                                 kfree(death);
3917                                 break;
3918                         }
3919
3920                         binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
3921                                      "%d:%d %s %016llx ref %d desc %d s %d w %d for node %d\n",
3922                                      proc->pid, thread->pid,
3923                                      cmd == BC_REQUEST_DEATH_NOTIFICATION ?
3924                                      "BC_REQUEST_DEATH_NOTIFICATION" :
3925                                      "BC_CLEAR_DEATH_NOTIFICATION",
3926                                      (u64)cookie, ref->data.debug_id,
3927                                      ref->data.desc, ref->data.strong,
3928                                      ref->data.weak, ref->node->debug_id);
3929
3930                         binder_node_lock(ref->node);
3931                         if (cmd == BC_REQUEST_DEATH_NOTIFICATION) {
3932                                 if (ref->death) {
3933                                         binder_user_error("%d:%d BC_REQUEST_DEATH_NOTIFICATION death notification already set\n",
3934                                                 proc->pid, thread->pid);
3935                                         binder_node_unlock(ref->node);
3936                                         binder_proc_unlock(proc);
3937                                         kfree(death);
3938                                         break;
3939                                 }
3940                                 binder_stats_created(BINDER_STAT_DEATH);
3941                                 INIT_LIST_HEAD(&death->work.entry);
3942                                 death->cookie = cookie;
3943                                 ref->death = death;
3944                                 if (ref->node->proc == NULL) {
3945                                         ref->death->work.type = BINDER_WORK_DEAD_BINDER;
3946
3947                                         binder_inner_proc_lock(proc);
3948                                         binder_enqueue_work_ilocked(
3949                                                 &ref->death->work, &proc->todo);
3950                                         binder_wakeup_proc_ilocked(proc);
3951                                         binder_inner_proc_unlock(proc);
3952                                 }
3953                         } else {
3954                                 if (ref->death == NULL) {
3955                                         binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification not active\n",
3956                                                 proc->pid, thread->pid);
3957                                         binder_node_unlock(ref->node);
3958                                         binder_proc_unlock(proc);
3959                                         break;
3960                                 }
3961                                 death = ref->death;
3962                                 if (death->cookie != cookie) {
3963                                         binder_user_error("%d:%d BC_CLEAR_DEATH_NOTIFICATION death notification cookie mismatch %016llx != %016llx\n",
3964                                                 proc->pid, thread->pid,
3965                                                 (u64)death->cookie,
3966                                                 (u64)cookie);
3967                                         binder_node_unlock(ref->node);
3968                                         binder_proc_unlock(proc);
3969                                         break;
3970                                 }
3971                                 ref->death = NULL;
3972                                 binder_inner_proc_lock(proc);
3973                                 if (list_empty(&death->work.entry)) {
3974                                         death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
3975                                         if (thread->looper &
3976                                             (BINDER_LOOPER_STATE_REGISTERED |
3977                                              BINDER_LOOPER_STATE_ENTERED))
3978                                                 binder_enqueue_thread_work_ilocked(
3979                                                                 thread,
3980                                                                 &death->work);
3981                                         else {
3982                                                 binder_enqueue_work_ilocked(
3983                                                                 &death->work,
3984                                                                 &proc->todo);
3985                                                 binder_wakeup_proc_ilocked(
3986                                                                 proc);
3987                                         }
3988                                 } else {
3989                                         BUG_ON(death->work.type != BINDER_WORK_DEAD_BINDER);
3990                                         death->work.type = BINDER_WORK_DEAD_BINDER_AND_CLEAR;
3991                                 }
3992                                 binder_inner_proc_unlock(proc);
3993                         }
3994                         binder_node_unlock(ref->node);
3995                         binder_proc_unlock(proc);
3996                 } break;
3997                 case BC_DEAD_BINDER_DONE: {
3998                         struct binder_work *w;
3999                         binder_uintptr_t cookie;
4000                         struct binder_ref_death *death = NULL;
4001
4002                         if (get_user(cookie, (binder_uintptr_t __user *)ptr))
4003                                 return -EFAULT;
4004
4005                         ptr += sizeof(cookie);
4006                         binder_inner_proc_lock(proc);
4007                         list_for_each_entry(w, &proc->delivered_death,
4008                                             entry) {
4009                                 struct binder_ref_death *tmp_death =
4010                                         container_of(w,
4011                                                      struct binder_ref_death,
4012                                                      work);
4013
4014                                 if (tmp_death->cookie == cookie) {
4015                                         death = tmp_death;
4016                                         break;
4017                                 }
4018                         }
4019                         binder_debug(BINDER_DEBUG_DEAD_BINDER,
4020                                      "%d:%d BC_DEAD_BINDER_DONE %016llx found %pK\n",
4021                                      proc->pid, thread->pid, (u64)cookie,
4022                                      death);
4023                         if (death == NULL) {
4024                                 binder_user_error("%d:%d BC_DEAD_BINDER_DONE %016llx not found\n",
4025                                         proc->pid, thread->pid, (u64)cookie);
4026                                 binder_inner_proc_unlock(proc);
4027                                 break;
4028                         }
4029                         binder_dequeue_work_ilocked(&death->work);
4030                         if (death->work.type == BINDER_WORK_DEAD_BINDER_AND_CLEAR) {
4031                                 death->work.type = BINDER_WORK_CLEAR_DEATH_NOTIFICATION;
4032                                 if (thread->looper &
4033                                         (BINDER_LOOPER_STATE_REGISTERED |
4034                                          BINDER_LOOPER_STATE_ENTERED))
4035                                         binder_enqueue_thread_work_ilocked(
4036                                                 thread, &death->work);
4037                                 else {
4038                                         binder_enqueue_work_ilocked(
4039                                                         &death->work,
4040                                                         &proc->todo);
4041                                         binder_wakeup_proc_ilocked(proc);
4042                                 }
4043                         }
4044                         binder_inner_proc_unlock(proc);
4045                 } break;
4046
4047                 default:
4048                         pr_err("%d:%d unknown command %d\n",
4049                                proc->pid, thread->pid, cmd);
4050                         return -EINVAL;
4051                 }
4052                 *consumed = ptr - buffer;
4053         }
4054         return 0;
4055 }
4056
4057 static void binder_stat_br(struct binder_proc *proc,
4058                            struct binder_thread *thread, uint32_t cmd)
4059 {
4060         trace_binder_return(cmd);
4061         if (_IOC_NR(cmd) < ARRAY_SIZE(binder_stats.br)) {
4062                 atomic_inc(&binder_stats.br[_IOC_NR(cmd)]);
4063                 atomic_inc(&proc->stats.br[_IOC_NR(cmd)]);
4064                 atomic_inc(&thread->stats.br[_IOC_NR(cmd)]);
4065         }
4066 }
4067
4068 static int binder_put_node_cmd(struct binder_proc *proc,
4069                                struct binder_thread *thread,
4070                                void __user **ptrp,
4071                                binder_uintptr_t node_ptr,
4072                                binder_uintptr_t node_cookie,
4073                                int node_debug_id,
4074                                uint32_t cmd, const char *cmd_name)
4075 {
4076         void __user *ptr = *ptrp;
4077
4078         if (put_user(cmd, (uint32_t __user *)ptr))
4079                 return -EFAULT;
4080         ptr += sizeof(uint32_t);
4081
4082         if (put_user(node_ptr, (binder_uintptr_t __user *)ptr))
4083                 return -EFAULT;
4084         ptr += sizeof(binder_uintptr_t);
4085
4086         if (put_user(node_cookie, (binder_uintptr_t __user *)ptr))
4087                 return -EFAULT;
4088         ptr += sizeof(binder_uintptr_t);
4089
4090         binder_stat_br(proc, thread, cmd);
4091         binder_debug(BINDER_DEBUG_USER_REFS, "%d:%d %s %d u%016llx c%016llx\n",
4092                      proc->pid, thread->pid, cmd_name, node_debug_id,
4093                      (u64)node_ptr, (u64)node_cookie);
4094
4095         *ptrp = ptr;
4096         return 0;
4097 }
4098
4099 static int binder_wait_for_work(struct binder_thread *thread,
4100                                 bool do_proc_work)
4101 {
4102         DEFINE_WAIT(wait);
4103         struct binder_proc *proc = thread->proc;
4104         int ret = 0;
4105
4106         freezer_do_not_count();
4107         binder_inner_proc_lock(proc);
4108         for (;;) {
4109                 prepare_to_wait(&thread->wait, &wait, TASK_INTERRUPTIBLE);
4110                 if (binder_has_work_ilocked(thread, do_proc_work))
4111                         break;
4112                 if (do_proc_work)
4113                         list_add(&thread->waiting_thread_node,
4114                                  &proc->waiting_threads);
4115                 binder_inner_proc_unlock(proc);
4116                 schedule();
4117                 binder_inner_proc_lock(proc);
4118                 list_del_init(&thread->waiting_thread_node);
4119                 if (signal_pending(current)) {
4120                         ret = -ERESTARTSYS;
4121                         break;
4122                 }
4123         }
4124         finish_wait(&thread->wait, &wait);
4125         binder_inner_proc_unlock(proc);
4126         freezer_count();
4127
4128         return ret;
4129 }
4130
4131 /**
4132  * binder_apply_fd_fixups() - finish fd translation
4133  * @proc:         binder_proc associated @t->buffer
4134  * @t:  binder transaction with list of fd fixups
4135  *
4136  * Now that we are in the context of the transaction target
4137  * process, we can allocate and install fds. Process the
4138  * list of fds to translate and fixup the buffer with the
4139  * new fds.
4140  *
4141  * If we fail to allocate an fd, then free the resources by
4142  * fput'ing files that have not been processed and ksys_close'ing
4143  * any fds that have already been allocated.
4144  */
4145 static int binder_apply_fd_fixups(struct binder_proc *proc,
4146                                   struct binder_transaction *t)
4147 {
4148         struct binder_txn_fd_fixup *fixup, *tmp;
4149         int ret = 0;
4150
4151         list_for_each_entry(fixup, &t->fd_fixups, fixup_entry) {
4152                 int fd = get_unused_fd_flags(O_CLOEXEC);
4153
4154                 if (fd < 0) {
4155                         binder_debug(BINDER_DEBUG_TRANSACTION,
4156                                      "failed fd fixup txn %d fd %d\n",
4157                                      t->debug_id, fd);
4158                         ret = -ENOMEM;
4159                         break;
4160                 }
4161                 binder_debug(BINDER_DEBUG_TRANSACTION,
4162                              "fd fixup txn %d fd %d\n",
4163                              t->debug_id, fd);
4164                 trace_binder_transaction_fd_recv(t, fd, fixup->offset);
4165                 fd_install(fd, fixup->file);
4166                 fixup->file = NULL;
4167                 if (binder_alloc_copy_to_buffer(&proc->alloc, t->buffer,
4168                                                 fixup->offset, &fd,
4169                                                 sizeof(u32))) {
4170                         ret = -EINVAL;
4171                         break;
4172                 }
4173         }
4174         list_for_each_entry_safe(fixup, tmp, &t->fd_fixups, fixup_entry) {
4175                 if (fixup->file) {
4176                         fput(fixup->file);
4177                 } else if (ret) {
4178                         u32 fd;
4179                         int err;
4180
4181                         err = binder_alloc_copy_from_buffer(&proc->alloc, &fd,
4182                                                             t->buffer,
4183                                                             fixup->offset,
4184                                                             sizeof(fd));
4185                         WARN_ON(err);
4186                         if (!err)
4187                                 binder_deferred_fd_close(fd);
4188                 }
4189                 list_del(&fixup->fixup_entry);
4190                 kfree(fixup);
4191         }
4192
4193         return ret;
4194 }
4195
4196 static int binder_thread_read(struct binder_proc *proc,
4197                               struct binder_thread *thread,
4198                               binder_uintptr_t binder_buffer, size_t size,
4199                               binder_size_t *consumed, int non_block)
4200 {
4201         void __user *buffer = (void __user *)(uintptr_t)binder_buffer;
4202         void __user *ptr = buffer + *consumed;
4203         void __user *end = buffer + size;
4204
4205         int ret = 0;
4206         int wait_for_proc_work;
4207
4208         if (*consumed == 0) {
4209                 if (put_user(BR_NOOP, (uint32_t __user *)ptr))
4210                         return -EFAULT;
4211                 ptr += sizeof(uint32_t);
4212         }
4213
4214 retry:
4215         binder_inner_proc_lock(proc);
4216         wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
4217         binder_inner_proc_unlock(proc);
4218
4219         thread->looper |= BINDER_LOOPER_STATE_WAITING;
4220
4221         trace_binder_wait_for_work(wait_for_proc_work,
4222                                    !!thread->transaction_stack,
4223                                    !binder_worklist_empty(proc, &thread->todo));
4224         if (wait_for_proc_work) {
4225                 if (!(thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
4226                                         BINDER_LOOPER_STATE_ENTERED))) {
4227                         binder_user_error("%d:%d ERROR: Thread waiting for process work before calling BC_REGISTER_LOOPER or BC_ENTER_LOOPER (state %x)\n",
4228                                 proc->pid, thread->pid, thread->looper);
4229                         wait_event_interruptible(binder_user_error_wait,
4230                                                  binder_stop_on_user_error < 2);
4231                 }
4232                 binder_set_nice(proc->default_priority);
4233         }
4234
4235         if (non_block) {
4236                 if (!binder_has_work(thread, wait_for_proc_work))
4237                         ret = -EAGAIN;
4238         } else {
4239                 ret = binder_wait_for_work(thread, wait_for_proc_work);
4240         }
4241
4242         thread->looper &= ~BINDER_LOOPER_STATE_WAITING;
4243
4244         if (ret)
4245                 return ret;
4246
4247         while (1) {
4248                 uint32_t cmd;
4249                 struct binder_transaction_data_secctx tr;
4250                 struct binder_transaction_data *trd = &tr.transaction_data;
4251                 struct binder_work *w = NULL;
4252                 struct list_head *list = NULL;
4253                 struct binder_transaction *t = NULL;
4254                 struct binder_thread *t_from;
4255                 size_t trsize = sizeof(*trd);
4256
4257                 binder_inner_proc_lock(proc);
4258                 if (!binder_worklist_empty_ilocked(&thread->todo))
4259                         list = &thread->todo;
4260                 else if (!binder_worklist_empty_ilocked(&proc->todo) &&
4261                            wait_for_proc_work)
4262                         list = &proc->todo;
4263                 else {
4264                         binder_inner_proc_unlock(proc);
4265
4266                         /* no data added */
4267                         if (ptr - buffer == 4 && !thread->looper_need_return)
4268                                 goto retry;
4269                         break;
4270                 }
4271
4272                 if (end - ptr < sizeof(tr) + 4) {
4273                         binder_inner_proc_unlock(proc);
4274                         break;
4275                 }
4276                 w = binder_dequeue_work_head_ilocked(list);
4277                 if (binder_worklist_empty_ilocked(&thread->todo))
4278                         thread->process_todo = false;
4279
4280                 switch (w->type) {
4281                 case BINDER_WORK_TRANSACTION: {
4282                         binder_inner_proc_unlock(proc);
4283                         t = container_of(w, struct binder_transaction, work);
4284                 } break;
4285                 case BINDER_WORK_RETURN_ERROR: {
4286                         struct binder_error *e = container_of(
4287                                         w, struct binder_error, work);
4288
4289                         WARN_ON(e->cmd == BR_OK);
4290                         binder_inner_proc_unlock(proc);
4291                         if (put_user(e->cmd, (uint32_t __user *)ptr))
4292                                 return -EFAULT;
4293                         cmd = e->cmd;
4294                         e->cmd = BR_OK;
4295                         ptr += sizeof(uint32_t);
4296
4297                         binder_stat_br(proc, thread, cmd);
4298                 } break;
4299                 case BINDER_WORK_TRANSACTION_COMPLETE: {
4300                         binder_inner_proc_unlock(proc);
4301                         cmd = BR_TRANSACTION_COMPLETE;
4302                         kfree(w);
4303                         binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
4304                         if (put_user(cmd, (uint32_t __user *)ptr))
4305                                 return -EFAULT;
4306                         ptr += sizeof(uint32_t);
4307
4308                         binder_stat_br(proc, thread, cmd);
4309                         binder_debug(BINDER_DEBUG_TRANSACTION_COMPLETE,
4310                                      "%d:%d BR_TRANSACTION_COMPLETE\n",
4311                                      proc->pid, thread->pid);
4312                 } break;
4313                 case BINDER_WORK_NODE: {
4314                         struct binder_node *node = container_of(w, struct binder_node, work);
4315                         int strong, weak;
4316                         binder_uintptr_t node_ptr = node->ptr;
4317                         binder_uintptr_t node_cookie = node->cookie;
4318                         int node_debug_id = node->debug_id;
4319                         int has_weak_ref;
4320                         int has_strong_ref;
4321                         void __user *orig_ptr = ptr;
4322
4323                         BUG_ON(proc != node->proc);
4324                         strong = node->internal_strong_refs ||
4325                                         node->local_strong_refs;
4326                         weak = !hlist_empty(&node->refs) ||
4327                                         node->local_weak_refs ||
4328                                         node->tmp_refs || strong;
4329                         has_strong_ref = node->has_strong_ref;
4330                         has_weak_ref = node->has_weak_ref;
4331
4332                         if (weak && !has_weak_ref) {
4333                                 node->has_weak_ref = 1;
4334                                 node->pending_weak_ref = 1;
4335                                 node->local_weak_refs++;
4336                         }
4337                         if (strong && !has_strong_ref) {
4338                                 node->has_strong_ref = 1;
4339                                 node->pending_strong_ref = 1;
4340                                 node->local_strong_refs++;
4341                         }
4342                         if (!strong && has_strong_ref)
4343                                 node->has_strong_ref = 0;
4344                         if (!weak && has_weak_ref)
4345                                 node->has_weak_ref = 0;
4346                         if (!weak && !strong) {
4347                                 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
4348                                              "%d:%d node %d u%016llx c%016llx deleted\n",
4349                                              proc->pid, thread->pid,
4350                                              node_debug_id,
4351                                              (u64)node_ptr,
4352                                              (u64)node_cookie);
4353                                 rb_erase(&node->rb_node, &proc->nodes);
4354                                 binder_inner_proc_unlock(proc);
4355                                 binder_node_lock(node);
4356                                 /*
4357                                  * Acquire the node lock before freeing the
4358                                  * node to serialize with other threads that
4359                                  * may have been holding the node lock while
4360                                  * decrementing this node (avoids race where
4361                                  * this thread frees while the other thread
4362                                  * is unlocking the node after the final
4363                                  * decrement)
4364                                  */
4365                                 binder_node_unlock(node);
4366                                 binder_free_node(node);
4367                         } else
4368                                 binder_inner_proc_unlock(proc);
4369
4370                         if (weak && !has_weak_ref)
4371                                 ret = binder_put_node_cmd(
4372                                                 proc, thread, &ptr, node_ptr,
4373                                                 node_cookie, node_debug_id,
4374                                                 BR_INCREFS, "BR_INCREFS");
4375                         if (!ret && strong && !has_strong_ref)
4376                                 ret = binder_put_node_cmd(
4377                                                 proc, thread, &ptr, node_ptr,
4378                                                 node_cookie, node_debug_id,
4379                                                 BR_ACQUIRE, "BR_ACQUIRE");
4380                         if (!ret && !strong && has_strong_ref)
4381                                 ret = binder_put_node_cmd(
4382                                                 proc, thread, &ptr, node_ptr,
4383                                                 node_cookie, node_debug_id,
4384                                                 BR_RELEASE, "BR_RELEASE");
4385                         if (!ret && !weak && has_weak_ref)
4386                                 ret = binder_put_node_cmd(
4387                                                 proc, thread, &ptr, node_ptr,
4388                                                 node_cookie, node_debug_id,
4389                                                 BR_DECREFS, "BR_DECREFS");
4390                         if (orig_ptr == ptr)
4391                                 binder_debug(BINDER_DEBUG_INTERNAL_REFS,
4392                                              "%d:%d node %d u%016llx c%016llx state unchanged\n",
4393                                              proc->pid, thread->pid,
4394                                              node_debug_id,
4395                                              (u64)node_ptr,
4396                                              (u64)node_cookie);
4397                         if (ret)
4398                                 return ret;
4399                 } break;
4400                 case BINDER_WORK_DEAD_BINDER:
4401                 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4402                 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
4403                         struct binder_ref_death *death;
4404                         uint32_t cmd;
4405                         binder_uintptr_t cookie;
4406
4407                         death = container_of(w, struct binder_ref_death, work);
4408                         if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION)
4409                                 cmd = BR_CLEAR_DEATH_NOTIFICATION_DONE;
4410                         else
4411                                 cmd = BR_DEAD_BINDER;
4412                         cookie = death->cookie;
4413
4414                         binder_debug(BINDER_DEBUG_DEATH_NOTIFICATION,
4415                                      "%d:%d %s %016llx\n",
4416                                       proc->pid, thread->pid,
4417                                       cmd == BR_DEAD_BINDER ?
4418                                       "BR_DEAD_BINDER" :
4419                                       "BR_CLEAR_DEATH_NOTIFICATION_DONE",
4420                                       (u64)cookie);
4421                         if (w->type == BINDER_WORK_CLEAR_DEATH_NOTIFICATION) {
4422                                 binder_inner_proc_unlock(proc);
4423                                 kfree(death);
4424                                 binder_stats_deleted(BINDER_STAT_DEATH);
4425                         } else {
4426                                 binder_enqueue_work_ilocked(
4427                                                 w, &proc->delivered_death);
4428                                 binder_inner_proc_unlock(proc);
4429                         }
4430                         if (put_user(cmd, (uint32_t __user *)ptr))
4431                                 return -EFAULT;
4432                         ptr += sizeof(uint32_t);
4433                         if (put_user(cookie,
4434                                      (binder_uintptr_t __user *)ptr))
4435                                 return -EFAULT;
4436                         ptr += sizeof(binder_uintptr_t);
4437                         binder_stat_br(proc, thread, cmd);
4438                         if (cmd == BR_DEAD_BINDER)
4439                                 goto done; /* DEAD_BINDER notifications can cause transactions */
4440                 } break;
4441                 default:
4442                         binder_inner_proc_unlock(proc);
4443                         pr_err("%d:%d: bad work type %d\n",
4444                                proc->pid, thread->pid, w->type);
4445                         break;
4446                 }
4447
4448                 if (!t)
4449                         continue;
4450
4451                 BUG_ON(t->buffer == NULL);
4452                 if (t->buffer->target_node) {
4453                         struct binder_node *target_node = t->buffer->target_node;
4454
4455                         trd->target.ptr = target_node->ptr;
4456                         trd->cookie =  target_node->cookie;
4457                         t->saved_priority = task_nice(current);
4458                         if (t->priority < target_node->min_priority &&
4459                             !(t->flags & TF_ONE_WAY))
4460                                 binder_set_nice(t->priority);
4461                         else if (!(t->flags & TF_ONE_WAY) ||
4462                                  t->saved_priority > target_node->min_priority)
4463                                 binder_set_nice(target_node->min_priority);
4464                         cmd = BR_TRANSACTION;
4465                 } else {
4466                         trd->target.ptr = 0;
4467                         trd->cookie = 0;
4468                         cmd = BR_REPLY;
4469                 }
4470                 trd->code = t->code;
4471                 trd->flags = t->flags;
4472                 trd->sender_euid = from_kuid(current_user_ns(), t->sender_euid);
4473
4474                 t_from = binder_get_txn_from(t);
4475                 if (t_from) {
4476                         struct task_struct *sender = t_from->proc->tsk;
4477
4478                         trd->sender_pid =
4479                                 task_tgid_nr_ns(sender,
4480                                                 task_active_pid_ns(current));
4481                 } else {
4482                         trd->sender_pid = 0;
4483                 }
4484
4485                 ret = binder_apply_fd_fixups(proc, t);
4486                 if (ret) {
4487                         struct binder_buffer *buffer = t->buffer;
4488                         bool oneway = !!(t->flags & TF_ONE_WAY);
4489                         int tid = t->debug_id;
4490
4491                         if (t_from)
4492                                 binder_thread_dec_tmpref(t_from);
4493                         buffer->transaction = NULL;
4494                         binder_cleanup_transaction(t, "fd fixups failed",
4495                                                    BR_FAILED_REPLY);
4496                         binder_free_buf(proc, buffer);
4497                         binder_debug(BINDER_DEBUG_FAILED_TRANSACTION,
4498                                      "%d:%d %stransaction %d fd fixups failed %d/%d, line %d\n",
4499                                      proc->pid, thread->pid,
4500                                      oneway ? "async " :
4501                                         (cmd == BR_REPLY ? "reply " : ""),
4502                                      tid, BR_FAILED_REPLY, ret, __LINE__);
4503                         if (cmd == BR_REPLY) {
4504                                 cmd = BR_FAILED_REPLY;
4505                                 if (put_user(cmd, (uint32_t __user *)ptr))
4506                                         return -EFAULT;
4507                                 ptr += sizeof(uint32_t);
4508                                 binder_stat_br(proc, thread, cmd);
4509                                 break;
4510                         }
4511                         continue;
4512                 }
4513                 trd->data_size = t->buffer->data_size;
4514                 trd->offsets_size = t->buffer->offsets_size;
4515                 trd->data.ptr.buffer = (uintptr_t)t->buffer->user_data;
4516                 trd->data.ptr.offsets = trd->data.ptr.buffer +
4517                                         ALIGN(t->buffer->data_size,
4518                                             sizeof(void *));
4519
4520                 tr.secctx = t->security_ctx;
4521                 if (t->security_ctx) {
4522                         cmd = BR_TRANSACTION_SEC_CTX;
4523                         trsize = sizeof(tr);
4524                 }
4525                 if (put_user(cmd, (uint32_t __user *)ptr)) {
4526                         if (t_from)
4527                                 binder_thread_dec_tmpref(t_from);
4528
4529                         binder_cleanup_transaction(t, "put_user failed",
4530                                                    BR_FAILED_REPLY);
4531
4532                         return -EFAULT;
4533                 }
4534                 ptr += sizeof(uint32_t);
4535                 if (copy_to_user(ptr, &tr, trsize)) {
4536                         if (t_from)
4537                                 binder_thread_dec_tmpref(t_from);
4538
4539                         binder_cleanup_transaction(t, "copy_to_user failed",
4540                                                    BR_FAILED_REPLY);
4541
4542                         return -EFAULT;
4543                 }
4544                 ptr += trsize;
4545
4546                 trace_binder_transaction_received(t);
4547                 binder_stat_br(proc, thread, cmd);
4548                 binder_debug(BINDER_DEBUG_TRANSACTION,
4549                              "%d:%d %s %d %d:%d, cmd %d size %zd-%zd ptr %016llx-%016llx\n",
4550                              proc->pid, thread->pid,
4551                              (cmd == BR_TRANSACTION) ? "BR_TRANSACTION" :
4552                                 (cmd == BR_TRANSACTION_SEC_CTX) ?
4553                                      "BR_TRANSACTION_SEC_CTX" : "BR_REPLY",
4554                              t->debug_id, t_from ? t_from->proc->pid : 0,
4555                              t_from ? t_from->pid : 0, cmd,
4556                              t->buffer->data_size, t->buffer->offsets_size,
4557                              (u64)trd->data.ptr.buffer,
4558                              (u64)trd->data.ptr.offsets);
4559
4560                 if (t_from)
4561                         binder_thread_dec_tmpref(t_from);
4562                 t->buffer->allow_user_free = 1;
4563                 if (cmd != BR_REPLY && !(t->flags & TF_ONE_WAY)) {
4564                         binder_inner_proc_lock(thread->proc);
4565                         t->to_parent = thread->transaction_stack;
4566                         t->to_thread = thread;
4567                         thread->transaction_stack = t;
4568                         binder_inner_proc_unlock(thread->proc);
4569                 } else {
4570                         binder_free_transaction(t);
4571                 }
4572                 break;
4573         }
4574
4575 done:
4576
4577         *consumed = ptr - buffer;
4578         binder_inner_proc_lock(proc);
4579         if (proc->requested_threads == 0 &&
4580             list_empty(&thread->proc->waiting_threads) &&
4581             proc->requested_threads_started < proc->max_threads &&
4582             (thread->looper & (BINDER_LOOPER_STATE_REGISTERED |
4583              BINDER_LOOPER_STATE_ENTERED)) /* the user-space code fails to */
4584              /*spawn a new thread if we leave this out */) {
4585                 proc->requested_threads++;
4586                 binder_inner_proc_unlock(proc);
4587                 binder_debug(BINDER_DEBUG_THREADS,
4588                              "%d:%d BR_SPAWN_LOOPER\n",
4589                              proc->pid, thread->pid);
4590                 if (put_user(BR_SPAWN_LOOPER, (uint32_t __user *)buffer))
4591                         return -EFAULT;
4592                 binder_stat_br(proc, thread, BR_SPAWN_LOOPER);
4593         } else
4594                 binder_inner_proc_unlock(proc);
4595         return 0;
4596 }
4597
4598 static void binder_release_work(struct binder_proc *proc,
4599                                 struct list_head *list)
4600 {
4601         struct binder_work *w;
4602
4603         while (1) {
4604                 w = binder_dequeue_work_head(proc, list);
4605                 if (!w)
4606                         return;
4607
4608                 switch (w->type) {
4609                 case BINDER_WORK_TRANSACTION: {
4610                         struct binder_transaction *t;
4611
4612                         t = container_of(w, struct binder_transaction, work);
4613
4614                         binder_cleanup_transaction(t, "process died.",
4615                                                    BR_DEAD_REPLY);
4616                 } break;
4617                 case BINDER_WORK_RETURN_ERROR: {
4618                         struct binder_error *e = container_of(
4619                                         w, struct binder_error, work);
4620
4621                         binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4622                                 "undelivered TRANSACTION_ERROR: %u\n",
4623                                 e->cmd);
4624                 } break;
4625                 case BINDER_WORK_TRANSACTION_COMPLETE: {
4626                         binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4627                                 "undelivered TRANSACTION_COMPLETE\n");
4628                         kfree(w);
4629                         binder_stats_deleted(BINDER_STAT_TRANSACTION_COMPLETE);
4630                 } break;
4631                 case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
4632                 case BINDER_WORK_CLEAR_DEATH_NOTIFICATION: {
4633                         struct binder_ref_death *death;
4634
4635                         death = container_of(w, struct binder_ref_death, work);
4636                         binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4637                                 "undelivered death notification, %016llx\n",
4638                                 (u64)death->cookie);
4639                         kfree(death);
4640                         binder_stats_deleted(BINDER_STAT_DEATH);
4641                 } break;
4642                 default:
4643                         pr_err("unexpected work type, %d, not freed\n",
4644                                w->type);
4645                         break;
4646                 }
4647         }
4648
4649 }
4650
4651 static struct binder_thread *binder_get_thread_ilocked(
4652                 struct binder_proc *proc, struct binder_thread *new_thread)
4653 {
4654         struct binder_thread *thread = NULL;
4655         struct rb_node *parent = NULL;
4656         struct rb_node **p = &proc->threads.rb_node;
4657
4658         while (*p) {
4659                 parent = *p;
4660                 thread = rb_entry(parent, struct binder_thread, rb_node);
4661
4662                 if (current->pid < thread->pid)
4663                         p = &(*p)->rb_left;
4664                 else if (current->pid > thread->pid)
4665                         p = &(*p)->rb_right;
4666                 else
4667                         return thread;
4668         }
4669         if (!new_thread)
4670                 return NULL;
4671         thread = new_thread;
4672         binder_stats_created(BINDER_STAT_THREAD);
4673         thread->proc = proc;
4674         thread->pid = current->pid;
4675         atomic_set(&thread->tmp_ref, 0);
4676         init_waitqueue_head(&thread->wait);
4677         INIT_LIST_HEAD(&thread->todo);
4678         rb_link_node(&thread->rb_node, parent, p);
4679         rb_insert_color(&thread->rb_node, &proc->threads);
4680         thread->looper_need_return = true;
4681         thread->return_error.work.type = BINDER_WORK_RETURN_ERROR;
4682         thread->return_error.cmd = BR_OK;
4683         thread->reply_error.work.type = BINDER_WORK_RETURN_ERROR;
4684         thread->reply_error.cmd = BR_OK;
4685         INIT_LIST_HEAD(&new_thread->waiting_thread_node);
4686         return thread;
4687 }
4688
4689 static struct binder_thread *binder_get_thread(struct binder_proc *proc)
4690 {
4691         struct binder_thread *thread;
4692         struct binder_thread *new_thread;
4693
4694         binder_inner_proc_lock(proc);
4695         thread = binder_get_thread_ilocked(proc, NULL);
4696         binder_inner_proc_unlock(proc);
4697         if (!thread) {
4698                 new_thread = kzalloc(sizeof(*thread), GFP_KERNEL);
4699                 if (new_thread == NULL)
4700                         return NULL;
4701                 binder_inner_proc_lock(proc);
4702                 thread = binder_get_thread_ilocked(proc, new_thread);
4703                 binder_inner_proc_unlock(proc);
4704                 if (thread != new_thread)
4705                         kfree(new_thread);
4706         }
4707         return thread;
4708 }
4709
4710 static void binder_free_proc(struct binder_proc *proc)
4711 {
4712         BUG_ON(!list_empty(&proc->todo));
4713         BUG_ON(!list_empty(&proc->delivered_death));
4714         binder_alloc_deferred_release(&proc->alloc);
4715         put_task_struct(proc->tsk);
4716         binder_stats_deleted(BINDER_STAT_PROC);
4717         kfree(proc);
4718 }
4719
4720 static void binder_free_thread(struct binder_thread *thread)
4721 {
4722         BUG_ON(!list_empty(&thread->todo));
4723         binder_stats_deleted(BINDER_STAT_THREAD);
4724         binder_proc_dec_tmpref(thread->proc);
4725         kfree(thread);
4726 }
4727
4728 static int binder_thread_release(struct binder_proc *proc,
4729                                  struct binder_thread *thread)
4730 {
4731         struct binder_transaction *t;
4732         struct binder_transaction *send_reply = NULL;
4733         int active_transactions = 0;
4734         struct binder_transaction *last_t = NULL;
4735
4736         binder_inner_proc_lock(thread->proc);
4737         /*
4738          * take a ref on the proc so it survives
4739          * after we remove this thread from proc->threads.
4740          * The corresponding dec is when we actually
4741          * free the thread in binder_free_thread()
4742          */
4743         proc->tmp_ref++;
4744         /*
4745          * take a ref on this thread to ensure it
4746          * survives while we are releasing it
4747          */
4748         atomic_inc(&thread->tmp_ref);
4749         rb_erase(&thread->rb_node, &proc->threads);
4750         t = thread->transaction_stack;
4751         if (t) {
4752                 spin_lock(&t->lock);
4753                 if (t->to_thread == thread)
4754                         send_reply = t;
4755         } else {
4756                 __acquire(&t->lock);
4757         }
4758         thread->is_dead = true;
4759
4760         while (t) {
4761                 last_t = t;
4762                 active_transactions++;
4763                 binder_debug(BINDER_DEBUG_DEAD_TRANSACTION,
4764                              "release %d:%d transaction %d %s, still active\n",
4765                               proc->pid, thread->pid,
4766                              t->debug_id,
4767                              (t->to_thread == thread) ? "in" : "out");
4768
4769                 if (t->to_thread == thread) {
4770                         t->to_proc = NULL;
4771                         t->to_thread = NULL;
4772                         if (t->buffer) {
4773                                 t->buffer->transaction = NULL;
4774                                 t->buffer = NULL;
4775                         }
4776                         t = t->to_parent;
4777                 } else if (t->from == thread) {
4778                         t->from = NULL;
4779                         t = t->from_parent;
4780                 } else
4781                         BUG();
4782                 spin_unlock(&last_t->lock);
4783                 if (t)
4784                         spin_lock(&t->lock);
4785                 else
4786                         __acquire(&t->lock);
4787         }
4788         /* annotation for sparse, lock not acquired in last iteration above */
4789         __release(&t->lock);
4790
4791         /*
4792          * If this thread used poll, make sure we remove the waitqueue
4793          * from any epoll data structures holding it with POLLFREE.
4794          * waitqueue_active() is safe to use here because we're holding
4795          * the inner lock.
4796          */
4797         if ((thread->looper & BINDER_LOOPER_STATE_POLL) &&
4798             waitqueue_active(&thread->wait)) {
4799                 wake_up_poll(&thread->wait, EPOLLHUP | POLLFREE);
4800         }
4801
4802         binder_inner_proc_unlock(thread->proc);
4803
4804         /*
4805          * This is needed to avoid races between wake_up_poll() above and
4806          * and ep_remove_waitqueue() called for other reasons (eg the epoll file
4807          * descriptor being closed); ep_remove_waitqueue() holds an RCU read
4808          * lock, so we can be sure it's done after calling synchronize_rcu().
4809          */
4810         if (thread->looper & BINDER_LOOPER_STATE_POLL)
4811                 synchronize_rcu();
4812
4813         if (send_reply)
4814                 binder_send_failed_reply(send_reply, BR_DEAD_REPLY);
4815         binder_release_work(proc, &thread->todo);
4816         binder_thread_dec_tmpref(thread);
4817         return active_transactions;
4818 }
4819
4820 static __poll_t binder_poll(struct file *filp,
4821                                 struct poll_table_struct *wait)
4822 {
4823         struct binder_proc *proc = filp->private_data;
4824         struct binder_thread *thread = NULL;
4825         bool wait_for_proc_work;
4826
4827         thread = binder_get_thread(proc);
4828         if (!thread)
4829                 return POLLERR;
4830
4831         binder_inner_proc_lock(thread->proc);
4832         thread->looper |= BINDER_LOOPER_STATE_POLL;
4833         wait_for_proc_work = binder_available_for_proc_work_ilocked(thread);
4834
4835         binder_inner_proc_unlock(thread->proc);
4836
4837         poll_wait(filp, &thread->wait, wait);
4838
4839         if (binder_has_work(thread, wait_for_proc_work))
4840                 return EPOLLIN;
4841
4842         return 0;
4843 }
4844
4845 static int binder_ioctl_write_read(struct file *filp,
4846                                 unsigned int cmd, unsigned long arg,
4847                                 struct binder_thread *thread)
4848 {
4849         int ret = 0;
4850         struct binder_proc *proc = filp->private_data;
4851         unsigned int size = _IOC_SIZE(cmd);
4852         void __user *ubuf = (void __user *)arg;
4853         struct binder_write_read bwr;
4854
4855         if (size != sizeof(struct binder_write_read)) {
4856                 ret = -EINVAL;
4857                 goto out;
4858         }
4859         if (copy_from_user(&bwr, ubuf, sizeof(bwr))) {
4860                 ret = -EFAULT;
4861                 goto out;
4862         }
4863         binder_debug(BINDER_DEBUG_READ_WRITE,
4864                      "%d:%d write %lld at %016llx, read %lld at %016llx\n",
4865                      proc->pid, thread->pid,
4866                      (u64)bwr.write_size, (u64)bwr.write_buffer,
4867                      (u64)bwr.read_size, (u64)bwr.read_buffer);
4868
4869         if (bwr.write_size > 0) {
4870                 ret = binder_thread_write(proc, thread,
4871                                           bwr.write_buffer,
4872                                           bwr.write_size,
4873                                           &bwr.write_consumed);
4874                 trace_binder_write_done(ret);
4875                 if (ret < 0) {
4876                         bwr.read_consumed = 0;
4877                         if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
4878                                 ret = -EFAULT;
4879                         goto out;
4880                 }
4881         }
4882         if (bwr.read_size > 0) {
4883                 ret = binder_thread_read(proc, thread, bwr.read_buffer,
4884                                          bwr.read_size,
4885                                          &bwr.read_consumed,
4886                                          filp->f_flags & O_NONBLOCK);
4887                 trace_binder_read_done(ret);
4888                 binder_inner_proc_lock(proc);
4889                 if (!binder_worklist_empty_ilocked(&proc->todo))
4890                         binder_wakeup_proc_ilocked(proc);
4891                 binder_inner_proc_unlock(proc);
4892                 if (ret < 0) {
4893                         if (copy_to_user(ubuf, &bwr, sizeof(bwr)))
4894                                 ret = -EFAULT;
4895                         goto out;
4896                 }
4897         }
4898         binder_debug(BINDER_DEBUG_READ_WRITE,
4899                      "%d:%d wrote %lld of %lld, read return %lld of %lld\n",
4900                      proc->pid, thread->pid,
4901                      (u64)bwr.write_consumed, (u64)bwr.write_size,
4902                      (u64)bwr.read_consumed, (u64)bwr.read_size);
4903         if (copy_to_user(ubuf, &bwr, sizeof(bwr))) {
4904                 ret = -EFAULT;
4905                 goto out;
4906         }
4907 out:
4908         return ret;
4909 }
4910
4911 static int binder_ioctl_set_ctx_mgr(struct file *filp,
4912                                     struct flat_binder_object *fbo)
4913 {
4914         int ret = 0;
4915         struct binder_proc *proc = filp->private_data;
4916         struct binder_context *context = proc->context;
4917         struct binder_node *new_node;
4918         kuid_t curr_euid = current_euid();
4919
4920         mutex_lock(&context->context_mgr_node_lock);
4921         if (context->binder_context_mgr_node) {
4922                 pr_err("BINDER_SET_CONTEXT_MGR already set\n");
4923                 ret = -EBUSY;
4924                 goto out;
4925         }
4926         ret = security_binder_set_context_mgr(proc->tsk);
4927         if (ret < 0)
4928                 goto out;
4929         if (uid_valid(context->binder_context_mgr_uid)) {
4930                 if (!uid_eq(context->binder_context_mgr_uid, curr_euid)) {
4931                         pr_err("BINDER_SET_CONTEXT_MGR bad uid %d != %d\n",
4932                                from_kuid(&init_user_ns, curr_euid),
4933                                from_kuid(&init_user_ns,
4934                                          context->binder_context_mgr_uid));
4935                         ret = -EPERM;
4936                         goto out;
4937                 }
4938         } else {
4939                 context->binder_context_mgr_uid = curr_euid;
4940         }
4941         new_node = binder_new_node(proc, fbo);
4942         if (!new_node) {
4943                 ret = -ENOMEM;
4944                 goto out;
4945         }
4946         binder_node_lock(new_node);
4947         new_node->local_weak_refs++;
4948         new_node->local_strong_refs++;
4949         new_node->has_strong_ref = 1;
4950         new_node->has_weak_ref = 1;
4951         context->binder_context_mgr_node = new_node;
4952         binder_node_unlock(new_node);
4953         binder_put_node(new_node);
4954 out:
4955         mutex_unlock(&context->context_mgr_node_lock);
4956         return ret;
4957 }
4958
4959 static int binder_ioctl_get_node_info_for_ref(struct binder_proc *proc,
4960                 struct binder_node_info_for_ref *info)
4961 {
4962         struct binder_node *node;
4963         struct binder_context *context = proc->context;
4964         __u32 handle = info->handle;
4965
4966         if (info->strong_count || info->weak_count || info->reserved1 ||
4967             info->reserved2 || info->reserved3) {
4968                 binder_user_error("%d BINDER_GET_NODE_INFO_FOR_REF: only handle may be non-zero.",
4969                                   proc->pid);
4970                 return -EINVAL;
4971         }
4972
4973         /* This ioctl may only be used by the context manager */
4974         mutex_lock(&context->context_mgr_node_lock);
4975         if (!context->binder_context_mgr_node ||
4976                 context->binder_context_mgr_node->proc != proc) {
4977                 mutex_unlock(&context->context_mgr_node_lock);
4978                 return -EPERM;
4979         }
4980         mutex_unlock(&context->context_mgr_node_lock);
4981
4982         node = binder_get_node_from_ref(proc, handle, true, NULL);
4983         if (!node)
4984                 return -EINVAL;
4985
4986         info->strong_count = node->local_strong_refs +
4987                 node->internal_strong_refs;
4988         info->weak_count = node->local_weak_refs;
4989
4990         binder_put_node(node);
4991
4992         return 0;
4993 }
4994
4995 static int binder_ioctl_get_node_debug_info(struct binder_proc *proc,
4996                                 struct binder_node_debug_info *info)
4997 {
4998         struct rb_node *n;
4999         binder_uintptr_t ptr = info->ptr;
5000
5001         memset(info, 0, sizeof(*info));
5002
5003         binder_inner_proc_lock(proc);
5004         for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
5005                 struct binder_node *node = rb_entry(n, struct binder_node,
5006                                                     rb_node);
5007                 if (node->ptr > ptr) {
5008                         info->ptr = node->ptr;
5009                         info->cookie = node->cookie;
5010                         info->has_strong_ref = node->has_strong_ref;
5011                         info->has_weak_ref = node->has_weak_ref;
5012                         break;
5013                 }
5014         }
5015         binder_inner_proc_unlock(proc);
5016
5017         return 0;
5018 }
5019
5020 static long binder_ioctl(struct file *filp, unsigned int cmd, unsigned long arg)
5021 {
5022         int ret;
5023         struct binder_proc *proc = filp->private_data;
5024         struct binder_thread *thread;
5025         unsigned int size = _IOC_SIZE(cmd);
5026         void __user *ubuf = (void __user *)arg;
5027
5028         /*pr_info("binder_ioctl: %d:%d %x %lx\n",
5029                         proc->pid, current->pid, cmd, arg);*/
5030
5031         binder_selftest_alloc(&proc->alloc);
5032
5033         trace_binder_ioctl(cmd, arg);
5034
5035         ret = wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
5036         if (ret)
5037                 goto err_unlocked;
5038
5039         thread = binder_get_thread(proc);
5040         if (thread == NULL) {
5041                 ret = -ENOMEM;
5042                 goto err;
5043         }
5044
5045         switch (cmd) {
5046         case BINDER_WRITE_READ:
5047                 ret = binder_ioctl_write_read(filp, cmd, arg, thread);
5048                 if (ret)
5049                         goto err;
5050                 break;
5051         case BINDER_SET_MAX_THREADS: {
5052                 int max_threads;
5053
5054                 if (copy_from_user(&max_threads, ubuf,
5055                                    sizeof(max_threads))) {
5056                         ret = -EINVAL;
5057                         goto err;
5058                 }
5059                 binder_inner_proc_lock(proc);
5060                 proc->max_threads = max_threads;
5061                 binder_inner_proc_unlock(proc);
5062                 break;
5063         }
5064         case BINDER_SET_CONTEXT_MGR_EXT: {
5065                 struct flat_binder_object fbo;
5066
5067                 if (copy_from_user(&fbo, ubuf, sizeof(fbo))) {
5068                         ret = -EINVAL;
5069                         goto err;
5070                 }
5071                 ret = binder_ioctl_set_ctx_mgr(filp, &fbo);
5072                 if (ret)
5073                         goto err;
5074                 break;
5075         }
5076         case BINDER_SET_CONTEXT_MGR:
5077                 ret = binder_ioctl_set_ctx_mgr(filp, NULL);
5078                 if (ret)
5079                         goto err;
5080                 break;
5081         case BINDER_THREAD_EXIT:
5082                 binder_debug(BINDER_DEBUG_THREADS, "%d:%d exit\n",
5083                              proc->pid, thread->pid);
5084                 binder_thread_release(proc, thread);
5085                 thread = NULL;
5086                 break;
5087         case BINDER_VERSION: {
5088                 struct binder_version __user *ver = ubuf;
5089
5090                 if (size != sizeof(struct binder_version)) {
5091                         ret = -EINVAL;
5092                         goto err;
5093                 }
5094                 if (put_user(BINDER_CURRENT_PROTOCOL_VERSION,
5095                              &ver->protocol_version)) {
5096                         ret = -EINVAL;
5097                         goto err;
5098                 }
5099                 break;
5100         }
5101         case BINDER_GET_NODE_INFO_FOR_REF: {
5102                 struct binder_node_info_for_ref info;
5103
5104                 if (copy_from_user(&info, ubuf, sizeof(info))) {
5105                         ret = -EFAULT;
5106                         goto err;
5107                 }
5108
5109                 ret = binder_ioctl_get_node_info_for_ref(proc, &info);
5110                 if (ret < 0)
5111                         goto err;
5112
5113                 if (copy_to_user(ubuf, &info, sizeof(info))) {
5114                         ret = -EFAULT;
5115                         goto err;
5116                 }
5117
5118                 break;
5119         }
5120         case BINDER_GET_NODE_DEBUG_INFO: {
5121                 struct binder_node_debug_info info;
5122
5123                 if (copy_from_user(&info, ubuf, sizeof(info))) {
5124                         ret = -EFAULT;
5125                         goto err;
5126                 }
5127
5128                 ret = binder_ioctl_get_node_debug_info(proc, &info);
5129                 if (ret < 0)
5130                         goto err;
5131
5132                 if (copy_to_user(ubuf, &info, sizeof(info))) {
5133                         ret = -EFAULT;
5134                         goto err;
5135                 }
5136                 break;
5137         }
5138         default:
5139                 ret = -EINVAL;
5140                 goto err;
5141         }
5142         ret = 0;
5143 err:
5144         if (thread)
5145                 thread->looper_need_return = false;
5146         wait_event_interruptible(binder_user_error_wait, binder_stop_on_user_error < 2);
5147         if (ret && ret != -ERESTARTSYS)
5148                 pr_info("%d:%d ioctl %x %lx returned %d\n", proc->pid, current->pid, cmd, arg, ret);
5149 err_unlocked:
5150         trace_binder_ioctl_done(ret);
5151         return ret;
5152 }
5153
5154 static void binder_vma_open(struct vm_area_struct *vma)
5155 {
5156         struct binder_proc *proc = vma->vm_private_data;
5157
5158         binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5159                      "%d open vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
5160                      proc->pid, vma->vm_start, vma->vm_end,
5161                      (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
5162                      (unsigned long)pgprot_val(vma->vm_page_prot));
5163 }
5164
5165 static void binder_vma_close(struct vm_area_struct *vma)
5166 {
5167         struct binder_proc *proc = vma->vm_private_data;
5168
5169         binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5170                      "%d close vm area %lx-%lx (%ld K) vma %lx pagep %lx\n",
5171                      proc->pid, vma->vm_start, vma->vm_end,
5172                      (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
5173                      (unsigned long)pgprot_val(vma->vm_page_prot));
5174         binder_alloc_vma_close(&proc->alloc);
5175 }
5176
5177 static vm_fault_t binder_vm_fault(struct vm_fault *vmf)
5178 {
5179         return VM_FAULT_SIGBUS;
5180 }
5181
5182 static const struct vm_operations_struct binder_vm_ops = {
5183         .open = binder_vma_open,
5184         .close = binder_vma_close,
5185         .fault = binder_vm_fault,
5186 };
5187
5188 static int binder_mmap(struct file *filp, struct vm_area_struct *vma)
5189 {
5190         int ret;
5191         struct binder_proc *proc = filp->private_data;
5192         const char *failure_string;
5193
5194         if (proc->tsk != current->group_leader)
5195                 return -EINVAL;
5196
5197         if ((vma->vm_end - vma->vm_start) > SZ_4M)
5198                 vma->vm_end = vma->vm_start + SZ_4M;
5199
5200         binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5201                      "%s: %d %lx-%lx (%ld K) vma %lx pagep %lx\n",
5202                      __func__, proc->pid, vma->vm_start, vma->vm_end,
5203                      (vma->vm_end - vma->vm_start) / SZ_1K, vma->vm_flags,
5204                      (unsigned long)pgprot_val(vma->vm_page_prot));
5205
5206         if (vma->vm_flags & FORBIDDEN_MMAP_FLAGS) {
5207                 ret = -EPERM;
5208                 failure_string = "bad vm_flags";
5209                 goto err_bad_arg;
5210         }
5211         vma->vm_flags |= VM_DONTCOPY | VM_MIXEDMAP;
5212         vma->vm_flags &= ~VM_MAYWRITE;
5213
5214         vma->vm_ops = &binder_vm_ops;
5215         vma->vm_private_data = proc;
5216
5217         ret = binder_alloc_mmap_handler(&proc->alloc, vma);
5218         if (ret)
5219                 return ret;
5220         return 0;
5221
5222 err_bad_arg:
5223         pr_err("%s: %d %lx-%lx %s failed %d\n", __func__,
5224                proc->pid, vma->vm_start, vma->vm_end, failure_string, ret);
5225         return ret;
5226 }
5227
5228 static int binder_open(struct inode *nodp, struct file *filp)
5229 {
5230         struct binder_proc *proc;
5231         struct binder_device *binder_dev;
5232
5233         binder_debug(BINDER_DEBUG_OPEN_CLOSE, "%s: %d:%d\n", __func__,
5234                      current->group_leader->pid, current->pid);
5235
5236         proc = kzalloc(sizeof(*proc), GFP_KERNEL);
5237         if (proc == NULL)
5238                 return -ENOMEM;
5239         spin_lock_init(&proc->inner_lock);
5240         spin_lock_init(&proc->outer_lock);
5241         get_task_struct(current->group_leader);
5242         proc->tsk = current->group_leader;
5243         INIT_LIST_HEAD(&proc->todo);
5244         proc->default_priority = task_nice(current);
5245         /* binderfs stashes devices in i_private */
5246         if (is_binderfs_device(nodp))
5247                 binder_dev = nodp->i_private;
5248         else
5249                 binder_dev = container_of(filp->private_data,
5250                                           struct binder_device, miscdev);
5251         proc->context = &binder_dev->context;
5252         binder_alloc_init(&proc->alloc);
5253
5254         binder_stats_created(BINDER_STAT_PROC);
5255         proc->pid = current->group_leader->pid;
5256         INIT_LIST_HEAD(&proc->delivered_death);
5257         INIT_LIST_HEAD(&proc->waiting_threads);
5258         filp->private_data = proc;
5259
5260         mutex_lock(&binder_procs_lock);
5261         hlist_add_head(&proc->proc_node, &binder_procs);
5262         mutex_unlock(&binder_procs_lock);
5263
5264         if (binder_debugfs_dir_entry_proc) {
5265                 char strbuf[11];
5266
5267                 snprintf(strbuf, sizeof(strbuf), "%u", proc->pid);
5268                 /*
5269                  * proc debug entries are shared between contexts, so
5270                  * this will fail if the process tries to open the driver
5271                  * again with a different context. The priting code will
5272                  * anyway print all contexts that a given PID has, so this
5273                  * is not a problem.
5274                  */
5275                 proc->debugfs_entry = debugfs_create_file(strbuf, 0444,
5276                         binder_debugfs_dir_entry_proc,
5277                         (void *)(unsigned long)proc->pid,
5278                         &proc_fops);
5279         }
5280
5281         return 0;
5282 }
5283
5284 static int binder_flush(struct file *filp, fl_owner_t id)
5285 {
5286         struct binder_proc *proc = filp->private_data;
5287
5288         binder_defer_work(proc, BINDER_DEFERRED_FLUSH);
5289
5290         return 0;
5291 }
5292
5293 static void binder_deferred_flush(struct binder_proc *proc)
5294 {
5295         struct rb_node *n;
5296         int wake_count = 0;
5297
5298         binder_inner_proc_lock(proc);
5299         for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n)) {
5300                 struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node);
5301
5302                 thread->looper_need_return = true;
5303                 if (thread->looper & BINDER_LOOPER_STATE_WAITING) {
5304                         wake_up_interruptible(&thread->wait);
5305                         wake_count++;
5306                 }
5307         }
5308         binder_inner_proc_unlock(proc);
5309
5310         binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5311                      "binder_flush: %d woke %d threads\n", proc->pid,
5312                      wake_count);
5313 }
5314
5315 static int binder_release(struct inode *nodp, struct file *filp)
5316 {
5317         struct binder_proc *proc = filp->private_data;
5318
5319         debugfs_remove(proc->debugfs_entry);
5320         binder_defer_work(proc, BINDER_DEFERRED_RELEASE);
5321
5322         return 0;
5323 }
5324
5325 static int binder_node_release(struct binder_node *node, int refs)
5326 {
5327         struct binder_ref *ref;
5328         int death = 0;
5329         struct binder_proc *proc = node->proc;
5330
5331         binder_release_work(proc, &node->async_todo);
5332
5333         binder_node_lock(node);
5334         binder_inner_proc_lock(proc);
5335         binder_dequeue_work_ilocked(&node->work);
5336         /*
5337          * The caller must have taken a temporary ref on the node,
5338          */
5339         BUG_ON(!node->tmp_refs);
5340         if (hlist_empty(&node->refs) && node->tmp_refs == 1) {
5341                 binder_inner_proc_unlock(proc);
5342                 binder_node_unlock(node);
5343                 binder_free_node(node);
5344
5345                 return refs;
5346         }
5347
5348         node->proc = NULL;
5349         node->local_strong_refs = 0;
5350         node->local_weak_refs = 0;
5351         binder_inner_proc_unlock(proc);
5352
5353         spin_lock(&binder_dead_nodes_lock);
5354         hlist_add_head(&node->dead_node, &binder_dead_nodes);
5355         spin_unlock(&binder_dead_nodes_lock);
5356
5357         hlist_for_each_entry(ref, &node->refs, node_entry) {
5358                 refs++;
5359                 /*
5360                  * Need the node lock to synchronize
5361                  * with new notification requests and the
5362                  * inner lock to synchronize with queued
5363                  * death notifications.
5364                  */
5365                 binder_inner_proc_lock(ref->proc);
5366                 if (!ref->death) {
5367                         binder_inner_proc_unlock(ref->proc);
5368                         continue;
5369                 }
5370
5371                 death++;
5372
5373                 BUG_ON(!list_empty(&ref->death->work.entry));
5374                 ref->death->work.type = BINDER_WORK_DEAD_BINDER;
5375                 binder_enqueue_work_ilocked(&ref->death->work,
5376                                             &ref->proc->todo);
5377                 binder_wakeup_proc_ilocked(ref->proc);
5378                 binder_inner_proc_unlock(ref->proc);
5379         }
5380
5381         binder_debug(BINDER_DEBUG_DEAD_BINDER,
5382                      "node %d now dead, refs %d, death %d\n",
5383                      node->debug_id, refs, death);
5384         binder_node_unlock(node);
5385         binder_put_node(node);
5386
5387         return refs;
5388 }
5389
5390 static void binder_deferred_release(struct binder_proc *proc)
5391 {
5392         struct binder_context *context = proc->context;
5393         struct rb_node *n;
5394         int threads, nodes, incoming_refs, outgoing_refs, active_transactions;
5395
5396         mutex_lock(&binder_procs_lock);
5397         hlist_del(&proc->proc_node);
5398         mutex_unlock(&binder_procs_lock);
5399
5400         mutex_lock(&context->context_mgr_node_lock);
5401         if (context->binder_context_mgr_node &&
5402             context->binder_context_mgr_node->proc == proc) {
5403                 binder_debug(BINDER_DEBUG_DEAD_BINDER,
5404                              "%s: %d context_mgr_node gone\n",
5405                              __func__, proc->pid);
5406                 context->binder_context_mgr_node = NULL;
5407         }
5408         mutex_unlock(&context->context_mgr_node_lock);
5409         binder_inner_proc_lock(proc);
5410         /*
5411          * Make sure proc stays alive after we
5412          * remove all the threads
5413          */
5414         proc->tmp_ref++;
5415
5416         proc->is_dead = true;
5417         threads = 0;
5418         active_transactions = 0;
5419         while ((n = rb_first(&proc->threads))) {
5420                 struct binder_thread *thread;
5421
5422                 thread = rb_entry(n, struct binder_thread, rb_node);
5423                 binder_inner_proc_unlock(proc);
5424                 threads++;
5425                 active_transactions += binder_thread_release(proc, thread);
5426                 binder_inner_proc_lock(proc);
5427         }
5428
5429         nodes = 0;
5430         incoming_refs = 0;
5431         while ((n = rb_first(&proc->nodes))) {
5432                 struct binder_node *node;
5433
5434                 node = rb_entry(n, struct binder_node, rb_node);
5435                 nodes++;
5436                 /*
5437                  * take a temporary ref on the node before
5438                  * calling binder_node_release() which will either
5439                  * kfree() the node or call binder_put_node()
5440                  */
5441                 binder_inc_node_tmpref_ilocked(node);
5442                 rb_erase(&node->rb_node, &proc->nodes);
5443                 binder_inner_proc_unlock(proc);
5444                 incoming_refs = binder_node_release(node, incoming_refs);
5445                 binder_inner_proc_lock(proc);
5446         }
5447         binder_inner_proc_unlock(proc);
5448
5449         outgoing_refs = 0;
5450         binder_proc_lock(proc);
5451         while ((n = rb_first(&proc->refs_by_desc))) {
5452                 struct binder_ref *ref;
5453
5454                 ref = rb_entry(n, struct binder_ref, rb_node_desc);
5455                 outgoing_refs++;
5456                 binder_cleanup_ref_olocked(ref);
5457                 binder_proc_unlock(proc);
5458                 binder_free_ref(ref);
5459                 binder_proc_lock(proc);
5460         }
5461         binder_proc_unlock(proc);
5462
5463         binder_release_work(proc, &proc->todo);
5464         binder_release_work(proc, &proc->delivered_death);
5465
5466         binder_debug(BINDER_DEBUG_OPEN_CLOSE,
5467                      "%s: %d threads %d, nodes %d (ref %d), refs %d, active transactions %d\n",
5468                      __func__, proc->pid, threads, nodes, incoming_refs,
5469                      outgoing_refs, active_transactions);
5470
5471         binder_proc_dec_tmpref(proc);
5472 }
5473
5474 static void binder_deferred_func(struct work_struct *work)
5475 {
5476         struct binder_proc *proc;
5477
5478         int defer;
5479
5480         do {
5481                 mutex_lock(&binder_deferred_lock);
5482                 if (!hlist_empty(&binder_deferred_list)) {
5483                         proc = hlist_entry(binder_deferred_list.first,
5484                                         struct binder_proc, deferred_work_node);
5485                         hlist_del_init(&proc->deferred_work_node);
5486                         defer = proc->deferred_work;
5487                         proc->deferred_work = 0;
5488                 } else {
5489                         proc = NULL;
5490                         defer = 0;
5491                 }
5492                 mutex_unlock(&binder_deferred_lock);
5493
5494                 if (defer & BINDER_DEFERRED_FLUSH)
5495                         binder_deferred_flush(proc);
5496
5497                 if (defer & BINDER_DEFERRED_RELEASE)
5498                         binder_deferred_release(proc); /* frees proc */
5499         } while (proc);
5500 }
5501 static DECLARE_WORK(binder_deferred_work, binder_deferred_func);
5502
5503 static void
5504 binder_defer_work(struct binder_proc *proc, enum binder_deferred_state defer)
5505 {
5506         mutex_lock(&binder_deferred_lock);
5507         proc->deferred_work |= defer;
5508         if (hlist_unhashed(&proc->deferred_work_node)) {
5509                 hlist_add_head(&proc->deferred_work_node,
5510                                 &binder_deferred_list);
5511                 schedule_work(&binder_deferred_work);
5512         }
5513         mutex_unlock(&binder_deferred_lock);
5514 }
5515
5516 static void print_binder_transaction_ilocked(struct seq_file *m,
5517                                              struct binder_proc *proc,
5518                                              const char *prefix,
5519                                              struct binder_transaction *t)
5520 {
5521         struct binder_proc *to_proc;
5522         struct binder_buffer *buffer = t->buffer;
5523
5524         spin_lock(&t->lock);
5525         to_proc = t->to_proc;
5526         seq_printf(m,
5527                    "%s %d: %pK from %d:%d to %d:%d code %x flags %x pri %ld r%d",
5528                    prefix, t->debug_id, t,
5529                    t->from ? t->from->proc->pid : 0,
5530                    t->from ? t->from->pid : 0,
5531                    to_proc ? to_proc->pid : 0,
5532                    t->to_thread ? t->to_thread->pid : 0,
5533                    t->code, t->flags, t->priority, t->need_reply);
5534         spin_unlock(&t->lock);
5535
5536         if (proc != to_proc) {
5537                 /*
5538                  * Can only safely deref buffer if we are holding the
5539                  * correct proc inner lock for this node
5540                  */
5541                 seq_puts(m, "\n");
5542                 return;
5543         }
5544
5545         if (buffer == NULL) {
5546                 seq_puts(m, " buffer free\n");
5547                 return;
5548         }
5549         if (buffer->target_node)
5550                 seq_printf(m, " node %d", buffer->target_node->debug_id);
5551         seq_printf(m, " size %zd:%zd data %pK\n",
5552                    buffer->data_size, buffer->offsets_size,
5553                    buffer->user_data);
5554 }
5555
5556 static void print_binder_work_ilocked(struct seq_file *m,
5557                                      struct binder_proc *proc,
5558                                      const char *prefix,
5559                                      const char *transaction_prefix,
5560                                      struct binder_work *w)
5561 {
5562         struct binder_node *node;
5563         struct binder_transaction *t;
5564
5565         switch (w->type) {
5566         case BINDER_WORK_TRANSACTION:
5567                 t = container_of(w, struct binder_transaction, work);
5568                 print_binder_transaction_ilocked(
5569                                 m, proc, transaction_prefix, t);
5570                 break;
5571         case BINDER_WORK_RETURN_ERROR: {
5572                 struct binder_error *e = container_of(
5573                                 w, struct binder_error, work);
5574
5575                 seq_printf(m, "%stransaction error: %u\n",
5576                            prefix, e->cmd);
5577         } break;
5578         case BINDER_WORK_TRANSACTION_COMPLETE:
5579                 seq_printf(m, "%stransaction complete\n", prefix);
5580                 break;
5581         case BINDER_WORK_NODE:
5582                 node = container_of(w, struct binder_node, work);
5583                 seq_printf(m, "%snode work %d: u%016llx c%016llx\n",
5584                            prefix, node->debug_id,
5585                            (u64)node->ptr, (u64)node->cookie);
5586                 break;
5587         case BINDER_WORK_DEAD_BINDER:
5588                 seq_printf(m, "%shas dead binder\n", prefix);
5589                 break;
5590         case BINDER_WORK_DEAD_BINDER_AND_CLEAR:
5591                 seq_printf(m, "%shas cleared dead binder\n", prefix);
5592                 break;
5593         case BINDER_WORK_CLEAR_DEATH_NOTIFICATION:
5594                 seq_printf(m, "%shas cleared death notification\n", prefix);
5595                 break;
5596         default:
5597                 seq_printf(m, "%sunknown work: type %d\n", prefix, w->type);
5598                 break;
5599         }
5600 }
5601
5602 static void print_binder_thread_ilocked(struct seq_file *m,
5603                                         struct binder_thread *thread,
5604                                         int print_always)
5605 {
5606         struct binder_transaction *t;
5607         struct binder_work *w;
5608         size_t start_pos = m->count;
5609         size_t header_pos;
5610
5611         seq_printf(m, "  thread %d: l %02x need_return %d tr %d\n",
5612                         thread->pid, thread->looper,
5613                         thread->looper_need_return,
5614                         atomic_read(&thread->tmp_ref));
5615         header_pos = m->count;
5616         t = thread->transaction_stack;
5617         while (t) {
5618                 if (t->from == thread) {
5619                         print_binder_transaction_ilocked(m, thread->proc,
5620                                         "    outgoing transaction", t);
5621                         t = t->from_parent;
5622                 } else if (t->to_thread == thread) {
5623                         print_binder_transaction_ilocked(m, thread->proc,
5624                                                  "    incoming transaction", t);
5625                         t = t->to_parent;
5626                 } else {
5627                         print_binder_transaction_ilocked(m, thread->proc,
5628                                         "    bad transaction", t);
5629                         t = NULL;
5630                 }
5631         }
5632         list_for_each_entry(w, &thread->todo, entry) {
5633                 print_binder_work_ilocked(m, thread->proc, "    ",
5634                                           "    pending transaction", w);
5635         }
5636         if (!print_always && m->count == header_pos)
5637                 m->count = start_pos;
5638 }
5639
5640 static void print_binder_node_nilocked(struct seq_file *m,
5641                                        struct binder_node *node)
5642 {
5643         struct binder_ref *ref;
5644         struct binder_work *w;
5645         int count;
5646
5647         count = 0;
5648         hlist_for_each_entry(ref, &node->refs, node_entry)
5649                 count++;
5650
5651         seq_printf(m, "  node %d: u%016llx c%016llx hs %d hw %d ls %d lw %d is %d iw %d tr %d",
5652                    node->debug_id, (u64)node->ptr, (u64)node->cookie,
5653                    node->has_strong_ref, node->has_weak_ref,
5654                    node->local_strong_refs, node->local_weak_refs,
5655                    node->internal_strong_refs, count, node->tmp_refs);
5656         if (count) {
5657                 seq_puts(m, " proc");
5658                 hlist_for_each_entry(ref, &node->refs, node_entry)
5659                         seq_printf(m, " %d", ref->proc->pid);
5660         }
5661         seq_puts(m, "\n");
5662         if (node->proc) {
5663                 list_for_each_entry(w, &node->async_todo, entry)
5664                         print_binder_work_ilocked(m, node->proc, "    ",
5665                                           "    pending async transaction", w);
5666         }
5667 }
5668
5669 static void print_binder_ref_olocked(struct seq_file *m,
5670                                      struct binder_ref *ref)
5671 {
5672         binder_node_lock(ref->node);
5673         seq_printf(m, "  ref %d: desc %d %snode %d s %d w %d d %pK\n",
5674                    ref->data.debug_id, ref->data.desc,
5675                    ref->node->proc ? "" : "dead ",
5676                    ref->node->debug_id, ref->data.strong,
5677                    ref->data.weak, ref->death);
5678         binder_node_unlock(ref->node);
5679 }
5680
5681 static void print_binder_proc(struct seq_file *m,
5682                               struct binder_proc *proc, int print_all)
5683 {
5684         struct binder_work *w;
5685         struct rb_node *n;
5686         size_t start_pos = m->count;
5687         size_t header_pos;
5688         struct binder_node *last_node = NULL;
5689
5690         seq_printf(m, "proc %d\n", proc->pid);
5691         seq_printf(m, "context %s\n", proc->context->name);
5692         header_pos = m->count;
5693
5694         binder_inner_proc_lock(proc);
5695         for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
5696                 print_binder_thread_ilocked(m, rb_entry(n, struct binder_thread,
5697                                                 rb_node), print_all);
5698
5699         for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n)) {
5700                 struct binder_node *node = rb_entry(n, struct binder_node,
5701                                                     rb_node);
5702                 if (!print_all && !node->has_async_transaction)
5703                         continue;
5704
5705                 /*
5706                  * take a temporary reference on the node so it
5707                  * survives and isn't removed from the tree
5708                  * while we print it.
5709                  */
5710                 binder_inc_node_tmpref_ilocked(node);
5711                 /* Need to drop inner lock to take node lock */
5712                 binder_inner_proc_unlock(proc);
5713                 if (last_node)
5714                         binder_put_node(last_node);
5715                 binder_node_inner_lock(node);
5716                 print_binder_node_nilocked(m, node);
5717                 binder_node_inner_unlock(node);
5718                 last_node = node;
5719                 binder_inner_proc_lock(proc);
5720         }
5721         binder_inner_proc_unlock(proc);
5722         if (last_node)
5723                 binder_put_node(last_node);
5724
5725         if (print_all) {
5726                 binder_proc_lock(proc);
5727                 for (n = rb_first(&proc->refs_by_desc);
5728                      n != NULL;
5729                      n = rb_next(n))
5730                         print_binder_ref_olocked(m, rb_entry(n,
5731                                                             struct binder_ref,
5732                                                             rb_node_desc));
5733                 binder_proc_unlock(proc);
5734         }
5735         binder_alloc_print_allocated(m, &proc->alloc);
5736         binder_inner_proc_lock(proc);
5737         list_for_each_entry(w, &proc->todo, entry)
5738                 print_binder_work_ilocked(m, proc, "  ",
5739                                           "  pending transaction", w);
5740         list_for_each_entry(w, &proc->delivered_death, entry) {
5741                 seq_puts(m, "  has delivered dead binder\n");
5742                 break;
5743         }
5744         binder_inner_proc_unlock(proc);
5745         if (!print_all && m->count == header_pos)
5746                 m->count = start_pos;
5747 }
5748
5749 static const char * const binder_return_strings[] = {
5750         "BR_ERROR",
5751         "BR_OK",
5752         "BR_TRANSACTION",
5753         "BR_REPLY",
5754         "BR_ACQUIRE_RESULT",
5755         "BR_DEAD_REPLY",
5756         "BR_TRANSACTION_COMPLETE",
5757         "BR_INCREFS",
5758         "BR_ACQUIRE",
5759         "BR_RELEASE",
5760         "BR_DECREFS",
5761         "BR_ATTEMPT_ACQUIRE",
5762         "BR_NOOP",
5763         "BR_SPAWN_LOOPER",
5764         "BR_FINISHED",
5765         "BR_DEAD_BINDER",
5766         "BR_CLEAR_DEATH_NOTIFICATION_DONE",
5767         "BR_FAILED_REPLY"
5768 };
5769
5770 static const char * const binder_command_strings[] = {
5771         "BC_TRANSACTION",
5772         "BC_REPLY",
5773         "BC_ACQUIRE_RESULT",
5774         "BC_FREE_BUFFER",
5775         "BC_INCREFS",
5776         "BC_ACQUIRE",
5777         "BC_RELEASE",
5778         "BC_DECREFS",
5779         "BC_INCREFS_DONE",
5780         "BC_ACQUIRE_DONE",
5781         "BC_ATTEMPT_ACQUIRE",
5782         "BC_REGISTER_LOOPER",
5783         "BC_ENTER_LOOPER",
5784         "BC_EXIT_LOOPER",
5785         "BC_REQUEST_DEATH_NOTIFICATION",
5786         "BC_CLEAR_DEATH_NOTIFICATION",
5787         "BC_DEAD_BINDER_DONE",
5788         "BC_TRANSACTION_SG",
5789         "BC_REPLY_SG",
5790 };
5791
5792 static const char * const binder_objstat_strings[] = {
5793         "proc",
5794         "thread",
5795         "node",
5796         "ref",
5797         "death",
5798         "transaction",
5799         "transaction_complete"
5800 };
5801
5802 static void print_binder_stats(struct seq_file *m, const char *prefix,
5803                                struct binder_stats *stats)
5804 {
5805         int i;
5806
5807         BUILD_BUG_ON(ARRAY_SIZE(stats->bc) !=
5808                      ARRAY_SIZE(binder_command_strings));
5809         for (i = 0; i < ARRAY_SIZE(stats->bc); i++) {
5810                 int temp = atomic_read(&stats->bc[i]);
5811
5812                 if (temp)
5813                         seq_printf(m, "%s%s: %d\n", prefix,
5814                                    binder_command_strings[i], temp);
5815         }
5816
5817         BUILD_BUG_ON(ARRAY_SIZE(stats->br) !=
5818                      ARRAY_SIZE(binder_return_strings));
5819         for (i = 0; i < ARRAY_SIZE(stats->br); i++) {
5820                 int temp = atomic_read(&stats->br[i]);
5821
5822                 if (temp)
5823                         seq_printf(m, "%s%s: %d\n", prefix,
5824                                    binder_return_strings[i], temp);
5825         }
5826
5827         BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
5828                      ARRAY_SIZE(binder_objstat_strings));
5829         BUILD_BUG_ON(ARRAY_SIZE(stats->obj_created) !=
5830                      ARRAY_SIZE(stats->obj_deleted));
5831         for (i = 0; i < ARRAY_SIZE(stats->obj_created); i++) {
5832                 int created = atomic_read(&stats->obj_created[i]);
5833                 int deleted = atomic_read(&stats->obj_deleted[i]);
5834
5835                 if (created || deleted)
5836                         seq_printf(m, "%s%s: active %d total %d\n",
5837                                 prefix,
5838                                 binder_objstat_strings[i],
5839                                 created - deleted,
5840                                 created);
5841         }
5842 }
5843
5844 static void print_binder_proc_stats(struct seq_file *m,
5845                                     struct binder_proc *proc)
5846 {
5847         struct binder_work *w;
5848         struct binder_thread *thread;
5849         struct rb_node *n;
5850         int count, strong, weak, ready_threads;
5851         size_t free_async_space =
5852                 binder_alloc_get_free_async_space(&proc->alloc);
5853
5854         seq_printf(m, "proc %d\n", proc->pid);
5855         seq_printf(m, "context %s\n", proc->context->name);
5856         count = 0;
5857         ready_threads = 0;
5858         binder_inner_proc_lock(proc);
5859         for (n = rb_first(&proc->threads); n != NULL; n = rb_next(n))
5860                 count++;
5861
5862         list_for_each_entry(thread, &proc->waiting_threads, waiting_thread_node)
5863                 ready_threads++;
5864
5865         seq_printf(m, "  threads: %d\n", count);
5866         seq_printf(m, "  requested threads: %d+%d/%d\n"
5867                         "  ready threads %d\n"
5868                         "  free async space %zd\n", proc->requested_threads,
5869                         proc->requested_threads_started, proc->max_threads,
5870                         ready_threads,
5871                         free_async_space);
5872         count = 0;
5873         for (n = rb_first(&proc->nodes); n != NULL; n = rb_next(n))
5874                 count++;
5875         binder_inner_proc_unlock(proc);
5876         seq_printf(m, "  nodes: %d\n", count);
5877         count = 0;
5878         strong = 0;
5879         weak = 0;
5880         binder_proc_lock(proc);
5881         for (n = rb_first(&proc->refs_by_desc); n != NULL; n = rb_next(n)) {
5882                 struct binder_ref *ref = rb_entry(n, struct binder_ref,
5883                                                   rb_node_desc);
5884                 count++;
5885                 strong += ref->data.strong;
5886                 weak += ref->data.weak;
5887         }
5888         binder_proc_unlock(proc);
5889         seq_printf(m, "  refs: %d s %d w %d\n", count, strong, weak);
5890
5891         count = binder_alloc_get_allocated_count(&proc->alloc);
5892         seq_printf(m, "  buffers: %d\n", count);
5893
5894         binder_alloc_print_pages(m, &proc->alloc);
5895
5896         count = 0;
5897         binder_inner_proc_lock(proc);
5898         list_for_each_entry(w, &proc->todo, entry) {
5899                 if (w->type == BINDER_WORK_TRANSACTION)
5900                         count++;
5901         }
5902         binder_inner_proc_unlock(proc);
5903         seq_printf(m, "  pending transactions: %d\n", count);
5904
5905         print_binder_stats(m, "  ", &proc->stats);
5906 }
5907
5908
5909 static int state_show(struct seq_file *m, void *unused)
5910 {
5911         struct binder_proc *proc;
5912         struct binder_node *node;
5913         struct binder_node *last_node = NULL;
5914
5915         seq_puts(m, "binder state:\n");
5916
5917         spin_lock(&binder_dead_nodes_lock);
5918         if (!hlist_empty(&binder_dead_nodes))
5919                 seq_puts(m, "dead nodes:\n");
5920         hlist_for_each_entry(node, &binder_dead_nodes, dead_node) {
5921                 /*
5922                  * take a temporary reference on the node so it
5923                  * survives and isn't removed from the list
5924                  * while we print it.
5925                  */
5926                 node->tmp_refs++;
5927                 spin_unlock(&binder_dead_nodes_lock);
5928                 if (last_node)
5929                         binder_put_node(last_node);
5930                 binder_node_lock(node);
5931                 print_binder_node_nilocked(m, node);
5932                 binder_node_unlock(node);
5933                 last_node = node;
5934                 spin_lock(&binder_dead_nodes_lock);
5935         }
5936         spin_unlock(&binder_dead_nodes_lock);
5937         if (last_node)
5938                 binder_put_node(last_node);
5939
5940         mutex_lock(&binder_procs_lock);
5941         hlist_for_each_entry(proc, &binder_procs, proc_node)
5942                 print_binder_proc(m, proc, 1);
5943         mutex_unlock(&binder_procs_lock);
5944
5945         return 0;
5946 }
5947
5948 static int stats_show(struct seq_file *m, void *unused)
5949 {
5950         struct binder_proc *proc;
5951
5952         seq_puts(m, "binder stats:\n");
5953
5954         print_binder_stats(m, "", &binder_stats);
5955
5956         mutex_lock(&binder_procs_lock);
5957         hlist_for_each_entry(proc, &binder_procs, proc_node)
5958                 print_binder_proc_stats(m, proc);
5959         mutex_unlock(&binder_procs_lock);
5960
5961         return 0;
5962 }
5963
5964 static int transactions_show(struct seq_file *m, void *unused)
5965 {
5966         struct binder_proc *proc;
5967
5968         seq_puts(m, "binder transactions:\n");
5969         mutex_lock(&binder_procs_lock);
5970         hlist_for_each_entry(proc, &binder_procs, proc_node)
5971                 print_binder_proc(m, proc, 0);
5972         mutex_unlock(&binder_procs_lock);
5973
5974         return 0;
5975 }
5976
5977 static int proc_show(struct seq_file *m, void *unused)
5978 {
5979         struct binder_proc *itr;
5980         int pid = (unsigned long)m->private;
5981
5982         mutex_lock(&binder_procs_lock);
5983         hlist_for_each_entry(itr, &binder_procs, proc_node) {
5984                 if (itr->pid == pid) {
5985                         seq_puts(m, "binder proc state:\n");
5986                         print_binder_proc(m, itr, 1);
5987                 }
5988         }
5989         mutex_unlock(&binder_procs_lock);
5990
5991         return 0;
5992 }
5993
5994 static void print_binder_transaction_log_entry(struct seq_file *m,
5995                                         struct binder_transaction_log_entry *e)
5996 {
5997         int debug_id = READ_ONCE(e->debug_id_done);
5998         /*
5999          * read barrier to guarantee debug_id_done read before
6000          * we print the log values
6001          */
6002         smp_rmb();
6003         seq_printf(m,
6004                    "%d: %s from %d:%d to %d:%d context %s node %d handle %d size %d:%d ret %d/%d l=%d",
6005                    e->debug_id, (e->call_type == 2) ? "reply" :
6006                    ((e->call_type == 1) ? "async" : "call "), e->from_proc,
6007                    e->from_thread, e->to_proc, e->to_thread, e->context_name,
6008                    e->to_node, e->target_handle, e->data_size, e->offsets_size,
6009                    e->return_error, e->return_error_param,
6010                    e->return_error_line);
6011         /*
6012          * read-barrier to guarantee read of debug_id_done after
6013          * done printing the fields of the entry
6014          */
6015         smp_rmb();
6016         seq_printf(m, debug_id && debug_id == READ_ONCE(e->debug_id_done) ?
6017                         "\n" : " (incomplete)\n");
6018 }
6019
6020 static int transaction_log_show(struct seq_file *m, void *unused)
6021 {
6022         struct binder_transaction_log *log = m->private;
6023         unsigned int log_cur = atomic_read(&log->cur);
6024         unsigned int count;
6025         unsigned int cur;
6026         int i;
6027
6028         count = log_cur + 1;
6029         cur = count < ARRAY_SIZE(log->entry) && !log->full ?
6030                 0 : count % ARRAY_SIZE(log->entry);
6031         if (count > ARRAY_SIZE(log->entry) || log->full)
6032                 count = ARRAY_SIZE(log->entry);
6033         for (i = 0; i < count; i++) {
6034                 unsigned int index = cur++ % ARRAY_SIZE(log->entry);
6035
6036                 print_binder_transaction_log_entry(m, &log->entry[index]);
6037         }
6038         return 0;
6039 }
6040
6041 const struct file_operations binder_fops = {
6042         .owner = THIS_MODULE,
6043         .poll = binder_poll,
6044         .unlocked_ioctl = binder_ioctl,
6045         .compat_ioctl = binder_ioctl,
6046         .mmap = binder_mmap,
6047         .open = binder_open,
6048         .flush = binder_flush,
6049         .release = binder_release,
6050 };
6051
6052 DEFINE_SHOW_ATTRIBUTE(state);
6053 DEFINE_SHOW_ATTRIBUTE(stats);
6054 DEFINE_SHOW_ATTRIBUTE(transactions);
6055 DEFINE_SHOW_ATTRIBUTE(transaction_log);
6056
6057 static int __init init_binder_device(const char *name)
6058 {
6059         int ret;
6060         struct binder_device *binder_device;
6061
6062         binder_device = kzalloc(sizeof(*binder_device), GFP_KERNEL);
6063         if (!binder_device)
6064                 return -ENOMEM;
6065
6066         binder_device->miscdev.fops = &binder_fops;
6067         binder_device->miscdev.minor = MISC_DYNAMIC_MINOR;
6068         binder_device->miscdev.name = name;
6069
6070         binder_device->context.binder_context_mgr_uid = INVALID_UID;
6071         binder_device->context.name = name;
6072         mutex_init(&binder_device->context.context_mgr_node_lock);
6073
6074         ret = misc_register(&binder_device->miscdev);
6075         if (ret < 0) {
6076                 kfree(binder_device);
6077                 return ret;
6078         }
6079
6080         hlist_add_head(&binder_device->hlist, &binder_devices);
6081
6082         return ret;
6083 }
6084
6085 static int __init binder_init(void)
6086 {
6087         int ret;
6088         char *device_name, *device_tmp;
6089         struct binder_device *device;
6090         struct hlist_node *tmp;
6091         char *device_names = NULL;
6092
6093         ret = binder_alloc_shrinker_init();
6094         if (ret)
6095                 return ret;
6096
6097         atomic_set(&binder_transaction_log.cur, ~0U);
6098         atomic_set(&binder_transaction_log_failed.cur, ~0U);
6099
6100         binder_debugfs_dir_entry_root = debugfs_create_dir("binder", NULL);
6101         if (binder_debugfs_dir_entry_root)
6102                 binder_debugfs_dir_entry_proc = debugfs_create_dir("proc",
6103                                                  binder_debugfs_dir_entry_root);
6104
6105         if (binder_debugfs_dir_entry_root) {
6106                 debugfs_create_file("state",
6107                                     0444,
6108                                     binder_debugfs_dir_entry_root,
6109                                     NULL,
6110                                     &state_fops);
6111                 debugfs_create_file("stats",
6112                                     0444,
6113                                     binder_debugfs_dir_entry_root,
6114                                     NULL,
6115                                     &stats_fops);
6116                 debugfs_create_file("transactions",
6117                                     0444,
6118                                     binder_debugfs_dir_entry_root,
6119                                     NULL,
6120                                     &transactions_fops);
6121                 debugfs_create_file("transaction_log",
6122                                     0444,
6123                                     binder_debugfs_dir_entry_root,
6124                                     &binder_transaction_log,
6125                                     &transaction_log_fops);
6126                 debugfs_create_file("failed_transaction_log",
6127                                     0444,
6128                                     binder_debugfs_dir_entry_root,
6129                                     &binder_transaction_log_failed,
6130                                     &transaction_log_fops);
6131         }
6132
6133         if (strcmp(binder_devices_param, "") != 0) {
6134                 /*
6135                 * Copy the module_parameter string, because we don't want to
6136                 * tokenize it in-place.
6137                  */
6138                 device_names = kstrdup(binder_devices_param, GFP_KERNEL);
6139                 if (!device_names) {
6140                         ret = -ENOMEM;
6141                         goto err_alloc_device_names_failed;
6142                 }
6143
6144                 device_tmp = device_names;
6145                 while ((device_name = strsep(&device_tmp, ","))) {
6146                         ret = init_binder_device(device_name);
6147                         if (ret)
6148                                 goto err_init_binder_device_failed;
6149                 }
6150         }
6151
6152         ret = init_binderfs();
6153         if (ret)
6154                 goto err_init_binder_device_failed;
6155
6156         return ret;
6157
6158 err_init_binder_device_failed:
6159         hlist_for_each_entry_safe(device, tmp, &binder_devices, hlist) {
6160                 misc_deregister(&device->miscdev);
6161                 hlist_del(&device->hlist);
6162                 kfree(device);
6163         }
6164
6165         kfree(device_names);
6166
6167 err_alloc_device_names_failed:
6168         debugfs_remove_recursive(binder_debugfs_dir_entry_root);
6169
6170         return ret;
6171 }
6172
6173 device_initcall(binder_init);
6174
6175 #define CREATE_TRACE_POINTS
6176 #include "binder_trace.h"
6177
6178 MODULE_LICENSE("GPL v2");
This page took 0.413229 seconds and 4 git commands to generate.