Lines Matching full:tasks

98 transition state where tasks are converging to the patched state.
100 sequence occurs when a patch is disabled, except the tasks converge from
104 interrupts.  The same is true for forked tasks: the child inherits the
108 safe to patch tasks:
111    tasks.  If no affected functions are on the stack of a given task,
113    the tasks on the first try.  Otherwise it'll keep trying
121    a) Patching I/O-bound user tasks which are sleeping on an affected
124    b) Patching CPU-bound user tasks.  If the task is highly CPU-bound
128 3. For idle "swapper" tasks, since they don't ever exit the kernel, they
135 the second approach. It's highly likely that some tasks may still be
137 returns. In this case you would have to signal the tasks. This
147 time.  A patch can remain in transition indefinitely, if any of the tasks
152 the transition is in progress.  Then all the tasks will attempt to
156 determine which tasks are blocking completion of a patching operation.
159 transition, it shows -1.  Any tasks which are blocking the transition
162 to all remaining blocking tasks is a better alternative. No proper signal is
163 actually delivered (there is no data in signal pending structures). Tasks are
169 TIF_PATCH_PENDING flag of all tasks and thus forces the tasks to the patched
173 tasks) and request a clearance from a patch distributor to force the transition.
175 patch, which functions are (un)patched, and which functions the blocking tasks
213    a) patching user tasks when they cross the kernel/user space
216    b) patching kthreads and idle tasks at their designated patch points.
219    user tasks and waking kthreads to patch them.  But it could still be
337 Second, livepatch enters into a transition state where tasks are converging
344 Finally, once all tasks have been patched, the 'transition' value changes
382 First, livepatch enters into a transition state where tasks are converging
389 Second, once all tasks have been unpatched, the 'transition' value changes