drivers/android/binder.c

49 #include <linux/list.h>
404 static bool binder_worklist_empty_ilocked(struct list_head *list)
406 	return list_empty(list);
410  * binder_worklist_empty() - Check if no items on the work list
411  * @proc:       binder_proc associated with list
412  * @list:	list to check
414  * Return: true if there are no items on list, else false
417 				  struct list_head *list)
422 	ret = binder_worklist_empty_ilocked(list);
428  * binder_enqueue_work_ilocked() - Add an item to the work list
429  * @work:         struct binder_work to add to list
430  * @target_list:  list to add work to
432  * Adds the work to the specified list. Asserts that work
433  * is not already on a list.
449  * @work:         struct binder_work to add to list
451  * Adds the work to the todo list of the thread. Doesn't set the process_todo
466  * binder_enqueue_thread_work_ilocked() - Add an item to the thread work list
468  * @work:         struct binder_work to add to list
470  * Adds the work to the todo list of the thread, and enables processing
495  * binder_enqueue_thread_work() - Add an item to the thread work list
497  * @work:         struct binder_work to add to list
499  * Adds the work to the todo list of the thread, and enables processing
518  * binder_dequeue_work() - Removes an item from the work list
519  * @proc:         binder_proc associated with list
520  * @work:         struct binder_work to remove from list
522  * Removes the specified work item from whatever list it is on.
523  * Can safely be called if work is not on any list.
534 					struct list_head *list)
538 	w = list_first_entry_or_null(list, struct binder_work, entry);
601  * list, so it can only be woken up by the caller of this function, or a
969  * lock cannot be acquired (eg traversing the dead node list to
1058  * into the given proc rb_trees and node refs list.
1178  * @target_list: list to queue node work on
1550  * processed -- in that case, the list will be empty.
1900  * binder_do_fd_close() - close list of file descriptors
2335  * @node	list node
2337  * This is used for the pointer fixup list (pf) which is created and consumed
2341  * The list is ordered by @offset.
2355  * @node		list node
2357  * This is used for the sg copy list (sgc) which is created and consumed
2361  * The list is ordered by @offset.
2374  * @sgc_head:	list_head of scatter-gather copy list
2375  * @pf_head:	list_head of pointer fixup list
2379  * buffer to the target's buffer. It is expected that the list creation
2459  * @sgc_head:	list_head of scatter-gather copy list
2460  * @pf_head:	list_head of pointer fixup list
2483  * @sgc_head:		list_head of scatter-gather copy list
2494  * monotonically increasing @offset values so the list will naturally
2523  * @pf_head:	list_head of binder ptr fixup list
2528  * Add the specified fixup to a list ordered by @offset. When copying
2538  * the list.
2557 	 * exceptions. Look backwards through list for insertion point.
2717  * @target_list: list to find outdated transaction
3096 			 * its todo list. Only need to check the head
3100 			 * todo list while the thread is on waiting_threads.
4334  * @t:	binder transaction with list of fd fixups
4338  * list of fds to translate and fixup the buffer with the
4441 		struct list_head *list = NULL;
4448 			list = &thread->todo;
4451 			list = &proc->todo;
4465 		w = binder_dequeue_work_head_ilocked(list);
4796 				struct list_head *list)
4803 		w = binder_dequeue_work_head_ilocked(list);
6367 		 * survives and isn't removed from the list