Lines Matching refs:Task

307 The next diagram shows the situation after the arrival of Task A and
308 Task B at the leftmost and rightmost leaf ``rcu_node`` structures,
317 Suppose that Task A wins, recording its desired grace-period sequence
322 Task A now advances to initiate a new grace period, while Task B moves
351 Task A now acquires the ``rcu_state`` structure's ``->exp_mutex`` and
359 Task F blocking on the root ``rcu_node`` structure and Task E wait for
360 Task A to finish so that it can start the next grace period. The
365 Once the grace period completes, Task A starts waking up the tasks
372 Task E can then acquire ``->exp_mutex`` and increment
380 occupied. However, at some point, Task A will wake up the tasks blocked
391 | What happens if Task A takes so long to do its wakeups that Task E's  |
396 | Then Task E will block on the ``->exp_wake_mutex``, which will also   |