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