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