Function report |
Source Code:kernel\locking\rtmutex.c |
Create Date:2022-07-28 09:52:01 |
Last Modify:2020-03-17 14:26:38 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:rt_mutex_dequeue_pi
Proto:static void rt_mutex_dequeue_pi(struct task_struct *task, struct rt_mutex_waiter *waiter)
Type:void
Parameter:
Type | Parameter | Name |
---|---|---|
struct task_struct * | task | |
struct rt_mutex_waiter * | waiter |
331 | If 'empty' nodes are nodes that are known not to be inserted in an rbtree ( & pi_tree_entry) Then Return |
334 | rb_erase_cached( & pi_tree_entry, & pi_waiters) |
335 | RB_CLEAR_NODE( & pi_tree_entry) |
Name | Describe |
---|---|
rt_mutex_adjust_prio_chain | Adjust the priority chain |
task_blocks_on_rt_mutex | Task blocks on lock.* Prepare waiter and propagate pi chain* This must be called with lock->wait_lock held and interrupts disabled |
mark_wakeup_next_waiter | Remove the top waiter from the current tasks pi waiter tree and* queue it up.* Called with lock->wait_lock held and interrupts disabled. |
remove_waiter | Remove a waiter from a lock and give up* Must be called with lock->wait_lock held and interrupts disabled. I must* have just failed to try_to_take_rt_mutex(). |
Source code conversion tool public plug-in interface | X |
---|---|
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |