2 * transition.c - Kernel Live Patching transition functions
4 * Copyright (C) 2015-2016 Josh Poimboeuf <jpoimboe@redhat.com>
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version 2
9 * of the License, or (at your option) any later version.
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.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, see <http://www.gnu.org/licenses/>.
20 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
22 #include <linux/cpu.h>
23 #include <linux/stacktrace.h>
26 #include "transition.h"
27 #include "../sched/sched.h"
29 #define MAX_STACK_ENTRIES 100
30 #define STACK_ERR_BUF_SIZE 128
32 struct klp_patch
*klp_transition_patch
;
34 static int klp_target_state
= KLP_UNDEFINED
;
36 static bool klp_forced
= false;
39 * This work can be performed periodically to finish patching or unpatching any
40 * "straggler" tasks which failed to transition in the first attempt.
42 static void klp_transition_work_fn(struct work_struct
*work
)
44 mutex_lock(&klp_mutex
);
46 if (klp_transition_patch
)
47 klp_try_complete_transition();
49 mutex_unlock(&klp_mutex
);
51 static DECLARE_DELAYED_WORK(klp_transition_work
, klp_transition_work_fn
);
54 * This function is just a stub to implement a hard force
55 * of synchronize_sched(). This requires synchronizing
56 * tasks even in userspace and idle.
58 static void klp_sync(struct work_struct
*work
)
63 * We allow to patch also functions where RCU is not watching,
64 * e.g. before user_exit(). We can not rely on the RCU infrastructure
65 * to do the synchronization. Instead hard force the sched synchronization.
67 * This approach allows to use RCU functions for manipulating func_stack
70 static void klp_synchronize_transition(void)
72 schedule_on_each_cpu(klp_sync
);
76 * The transition to the target patch state is complete. Clean up the data
79 static void klp_complete_transition(void)
81 struct klp_object
*obj
;
82 struct klp_func
*func
;
83 struct task_struct
*g
, *task
;
86 pr_debug("'%s': completing %s transition\n",
87 klp_transition_patch
->mod
->name
,
88 klp_target_state
== KLP_PATCHED
? "patching" : "unpatching");
90 if (klp_target_state
== KLP_UNPATCHED
) {
92 * All tasks have transitioned to KLP_UNPATCHED so we can now
93 * remove the new functions from the func_stack.
95 klp_unpatch_objects(klp_transition_patch
);
98 * Make sure klp_ftrace_handler() can no longer see functions
99 * from this patch on the ops->func_stack. Otherwise, after
100 * func->transition gets cleared, the handler may choose a
103 klp_synchronize_transition();
106 klp_for_each_object(klp_transition_patch
, obj
)
107 klp_for_each_func(obj
, func
)
108 func
->transition
= false;
110 /* Prevent klp_ftrace_handler() from seeing KLP_UNDEFINED state */
111 if (klp_target_state
== KLP_PATCHED
)
112 klp_synchronize_transition();
114 read_lock(&tasklist_lock
);
115 for_each_process_thread(g
, task
) {
116 WARN_ON_ONCE(test_tsk_thread_flag(task
, TIF_PATCH_PENDING
));
117 task
->patch_state
= KLP_UNDEFINED
;
119 read_unlock(&tasklist_lock
);
121 for_each_possible_cpu(cpu
) {
122 task
= idle_task(cpu
);
123 WARN_ON_ONCE(test_tsk_thread_flag(task
, TIF_PATCH_PENDING
));
124 task
->patch_state
= KLP_UNDEFINED
;
127 klp_for_each_object(klp_transition_patch
, obj
) {
128 if (!klp_is_object_loaded(obj
))
130 if (klp_target_state
== KLP_PATCHED
)
131 klp_post_patch_callback(obj
);
132 else if (klp_target_state
== KLP_UNPATCHED
)
133 klp_post_unpatch_callback(obj
);
136 pr_notice("'%s': %s complete\n", klp_transition_patch
->mod
->name
,
137 klp_target_state
== KLP_PATCHED
? "patching" : "unpatching");
140 * klp_forced set implies unbounded increase of module's ref count if
141 * the module is disabled/enabled in a loop.
143 if (!klp_forced
&& klp_target_state
== KLP_UNPATCHED
)
144 module_put(klp_transition_patch
->mod
);
146 klp_target_state
= KLP_UNDEFINED
;
147 klp_transition_patch
= NULL
;
151 * This is called in the error path, to cancel a transition before it has
152 * started, i.e. klp_init_transition() has been called but
153 * klp_start_transition() hasn't. If the transition *has* been started,
154 * klp_reverse_transition() should be used instead.
156 void klp_cancel_transition(void)
158 if (WARN_ON_ONCE(klp_target_state
!= KLP_PATCHED
))
161 pr_debug("'%s': canceling patching transition, going to unpatch\n",
162 klp_transition_patch
->mod
->name
);
164 klp_target_state
= KLP_UNPATCHED
;
165 klp_complete_transition();
169 * Switch the patched state of the task to the set of functions in the target
172 * NOTE: If task is not 'current', the caller must ensure the task is inactive.
173 * Otherwise klp_ftrace_handler() might read the wrong 'patch_state' value.
175 void klp_update_patch_state(struct task_struct
*task
)
178 * A variant of synchronize_sched() is used to allow patching functions
179 * where RCU is not watching, see klp_synchronize_transition().
181 preempt_disable_notrace();
184 * This test_and_clear_tsk_thread_flag() call also serves as a read
185 * barrier (smp_rmb) for two cases:
187 * 1) Enforce the order of the TIF_PATCH_PENDING read and the
188 * klp_target_state read. The corresponding write barrier is in
189 * klp_init_transition().
191 * 2) Enforce the order of the TIF_PATCH_PENDING read and a future read
192 * of func->transition, if klp_ftrace_handler() is called later on
193 * the same CPU. See __klp_disable_patch().
195 if (test_and_clear_tsk_thread_flag(task
, TIF_PATCH_PENDING
))
196 task
->patch_state
= READ_ONCE(klp_target_state
);
198 preempt_enable_notrace();
202 * Determine whether the given stack trace includes any references to a
203 * to-be-patched or to-be-unpatched function.
205 static int klp_check_stack_func(struct klp_func
*func
,
206 struct stack_trace
*trace
)
208 unsigned long func_addr
, func_size
, address
;
212 for (i
= 0; i
< trace
->nr_entries
; i
++) {
213 address
= trace
->entries
[i
];
215 if (klp_target_state
== KLP_UNPATCHED
) {
217 * Check for the to-be-unpatched function
220 func_addr
= (unsigned long)func
->new_func
;
221 func_size
= func
->new_size
;
224 * Check for the to-be-patched function
225 * (the previous func).
227 ops
= klp_find_ops(func
->old_addr
);
229 if (list_is_singular(&ops
->func_stack
)) {
230 /* original function */
231 func_addr
= func
->old_addr
;
232 func_size
= func
->old_size
;
234 /* previously patched function */
235 struct klp_func
*prev
;
237 prev
= list_next_entry(func
, stack_node
);
238 func_addr
= (unsigned long)prev
->new_func
;
239 func_size
= prev
->new_size
;
243 if (address
>= func_addr
&& address
< func_addr
+ func_size
)
251 * Determine whether it's safe to transition the task to the target patch state
252 * by looking for any to-be-patched or to-be-unpatched functions on its stack.
254 static int klp_check_stack(struct task_struct
*task
, char *err_buf
)
256 static unsigned long entries
[MAX_STACK_ENTRIES
];
257 struct stack_trace trace
;
258 struct klp_object
*obj
;
259 struct klp_func
*func
;
263 trace
.nr_entries
= 0;
264 trace
.max_entries
= MAX_STACK_ENTRIES
;
265 trace
.entries
= entries
;
266 ret
= save_stack_trace_tsk_reliable(task
, &trace
);
267 WARN_ON_ONCE(ret
== -ENOSYS
);
269 snprintf(err_buf
, STACK_ERR_BUF_SIZE
,
270 "%s: %s:%d has an unreliable stack\n",
271 __func__
, task
->comm
, task
->pid
);
275 klp_for_each_object(klp_transition_patch
, obj
) {
278 klp_for_each_func(obj
, func
) {
279 ret
= klp_check_stack_func(func
, &trace
);
281 snprintf(err_buf
, STACK_ERR_BUF_SIZE
,
282 "%s: %s:%d is sleeping on function %s\n",
283 __func__
, task
->comm
, task
->pid
,
294 * Try to safely switch a task to the target patch state. If it's currently
295 * running, or it's sleeping on a to-be-patched or to-be-unpatched function, or
296 * if the stack is unreliable, return false.
298 static bool klp_try_switch_task(struct task_struct
*task
)
301 struct rq_flags flags
;
303 bool success
= false;
304 char err_buf
[STACK_ERR_BUF_SIZE
];
308 /* check if this task has already switched over */
309 if (task
->patch_state
== klp_target_state
)
313 * For arches which don't have reliable stack traces, we have to rely
314 * on other methods (e.g., switching tasks at kernel exit).
316 if (!klp_have_reliable_stack())
320 * Now try to check the stack for any to-be-patched or to-be-unpatched
321 * functions. If all goes well, switch the task to the target patch
324 rq
= task_rq_lock(task
, &flags
);
326 if (task_running(rq
, task
) && task
!= current
) {
327 snprintf(err_buf
, STACK_ERR_BUF_SIZE
,
328 "%s: %s:%d is running\n", __func__
, task
->comm
,
333 ret
= klp_check_stack(task
, err_buf
);
339 clear_tsk_thread_flag(task
, TIF_PATCH_PENDING
);
340 task
->patch_state
= klp_target_state
;
343 task_rq_unlock(rq
, task
, &flags
);
346 * Due to console deadlock issues, pr_debug() can't be used while
347 * holding the task rq lock. Instead we have to use a temporary buffer
348 * and print the debug message after releasing the lock.
350 if (err_buf
[0] != '\0')
351 pr_debug("%s", err_buf
);
358 * Try to switch all remaining tasks to the target patch state by walking the
359 * stacks of sleeping tasks and looking for any to-be-patched or
360 * to-be-unpatched functions. If such functions are found, the task can't be
363 * If any tasks are still stuck in the initial patch state, schedule a retry.
365 void klp_try_complete_transition(void)
368 struct task_struct
*g
, *task
;
369 bool complete
= true;
371 WARN_ON_ONCE(klp_target_state
== KLP_UNDEFINED
);
374 * Try to switch the tasks to the target patch state by walking their
375 * stacks and looking for any to-be-patched or to-be-unpatched
376 * functions. If such functions are found on a stack, or if the stack
377 * is deemed unreliable, the task can't be switched yet.
379 * Usually this will transition most (or all) of the tasks on a system
380 * unless the patch includes changes to a very common function.
382 read_lock(&tasklist_lock
);
383 for_each_process_thread(g
, task
)
384 if (!klp_try_switch_task(task
))
386 read_unlock(&tasklist_lock
);
389 * Ditto for the idle "swapper" tasks.
392 for_each_possible_cpu(cpu
) {
393 task
= idle_task(cpu
);
394 if (cpu_online(cpu
)) {
395 if (!klp_try_switch_task(task
))
397 } else if (task
->patch_state
!= klp_target_state
) {
398 /* offline idle tasks can be switched immediately */
399 clear_tsk_thread_flag(task
, TIF_PATCH_PENDING
);
400 task
->patch_state
= klp_target_state
;
407 * Some tasks weren't able to be switched over. Try again
408 * later and/or wait for other methods like kernel exit
411 schedule_delayed_work(&klp_transition_work
,
412 round_jiffies_relative(HZ
));
416 /* we're done, now cleanup the data structures */
417 klp_complete_transition();
421 * Start the transition to the specified target patch state so tasks can begin
424 void klp_start_transition(void)
426 struct task_struct
*g
, *task
;
429 WARN_ON_ONCE(klp_target_state
== KLP_UNDEFINED
);
431 pr_notice("'%s': starting %s transition\n",
432 klp_transition_patch
->mod
->name
,
433 klp_target_state
== KLP_PATCHED
? "patching" : "unpatching");
436 * Mark all normal tasks as needing a patch state update. They'll
437 * switch either in klp_try_complete_transition() or as they exit the
440 read_lock(&tasklist_lock
);
441 for_each_process_thread(g
, task
)
442 if (task
->patch_state
!= klp_target_state
)
443 set_tsk_thread_flag(task
, TIF_PATCH_PENDING
);
444 read_unlock(&tasklist_lock
);
447 * Mark all idle tasks as needing a patch state update. They'll switch
448 * either in klp_try_complete_transition() or at the idle loop switch
451 for_each_possible_cpu(cpu
) {
452 task
= idle_task(cpu
);
453 if (task
->patch_state
!= klp_target_state
)
454 set_tsk_thread_flag(task
, TIF_PATCH_PENDING
);
459 * Initialize the global target patch state and all tasks to the initial patch
460 * state, and initialize all function transition states to true in preparation
461 * for patching or unpatching.
463 void klp_init_transition(struct klp_patch
*patch
, int state
)
465 struct task_struct
*g
, *task
;
467 struct klp_object
*obj
;
468 struct klp_func
*func
;
469 int initial_state
= !state
;
471 WARN_ON_ONCE(klp_target_state
!= KLP_UNDEFINED
);
473 klp_transition_patch
= patch
;
476 * Set the global target patch state which tasks will switch to. This
477 * has no effect until the TIF_PATCH_PENDING flags get set later.
479 klp_target_state
= state
;
481 pr_debug("'%s': initializing %s transition\n", patch
->mod
->name
,
482 klp_target_state
== KLP_PATCHED
? "patching" : "unpatching");
485 * Initialize all tasks to the initial patch state to prepare them for
486 * switching to the target state.
488 read_lock(&tasklist_lock
);
489 for_each_process_thread(g
, task
) {
490 WARN_ON_ONCE(task
->patch_state
!= KLP_UNDEFINED
);
491 task
->patch_state
= initial_state
;
493 read_unlock(&tasklist_lock
);
496 * Ditto for the idle "swapper" tasks.
498 for_each_possible_cpu(cpu
) {
499 task
= idle_task(cpu
);
500 WARN_ON_ONCE(task
->patch_state
!= KLP_UNDEFINED
);
501 task
->patch_state
= initial_state
;
505 * Enforce the order of the task->patch_state initializations and the
506 * func->transition updates to ensure that klp_ftrace_handler() doesn't
507 * see a func in transition with a task->patch_state of KLP_UNDEFINED.
509 * Also enforce the order of the klp_target_state write and future
510 * TIF_PATCH_PENDING writes to ensure klp_update_patch_state() doesn't
511 * set a task->patch_state to KLP_UNDEFINED.
516 * Set the func transition states so klp_ftrace_handler() will know to
517 * switch to the transition logic.
519 * When patching, the funcs aren't yet in the func_stack and will be
520 * made visible to the ftrace handler shortly by the calls to
521 * klp_patch_object().
523 * When unpatching, the funcs are already in the func_stack and so are
524 * already visible to the ftrace handler.
526 klp_for_each_object(patch
, obj
)
527 klp_for_each_func(obj
, func
)
528 func
->transition
= true;
532 * This function can be called in the middle of an existing transition to
533 * reverse the direction of the target patch state. This can be done to
534 * effectively cancel an existing enable or disable operation if there are any
535 * tasks which are stuck in the initial patch state.
537 void klp_reverse_transition(void)
540 struct task_struct
*g
, *task
;
542 pr_debug("'%s': reversing transition from %s\n",
543 klp_transition_patch
->mod
->name
,
544 klp_target_state
== KLP_PATCHED
? "patching to unpatching" :
545 "unpatching to patching");
547 klp_transition_patch
->enabled
= !klp_transition_patch
->enabled
;
549 klp_target_state
= !klp_target_state
;
552 * Clear all TIF_PATCH_PENDING flags to prevent races caused by
553 * klp_update_patch_state() running in parallel with
554 * klp_start_transition().
556 read_lock(&tasklist_lock
);
557 for_each_process_thread(g
, task
)
558 clear_tsk_thread_flag(task
, TIF_PATCH_PENDING
);
559 read_unlock(&tasklist_lock
);
561 for_each_possible_cpu(cpu
)
562 clear_tsk_thread_flag(idle_task(cpu
), TIF_PATCH_PENDING
);
564 /* Let any remaining calls to klp_update_patch_state() complete */
565 klp_synchronize_transition();
567 klp_start_transition();
570 /* Called from copy_process() during fork */
571 void klp_copy_process(struct task_struct
*child
)
573 child
->patch_state
= current
->patch_state
;
575 /* TIF_PATCH_PENDING gets copied in setup_thread_stack() */
579 * Sends a fake signal to all non-kthread tasks with TIF_PATCH_PENDING set.
580 * Kthreads with TIF_PATCH_PENDING set are woken up. Only admin can request this
583 void klp_send_signals(void)
585 struct task_struct
*g
, *task
;
587 pr_notice("signaling remaining tasks\n");
589 read_lock(&tasklist_lock
);
590 for_each_process_thread(g
, task
) {
591 if (!klp_patch_pending(task
))
595 * There is a small race here. We could see TIF_PATCH_PENDING
596 * set and decide to wake up a kthread or send a fake signal.
597 * Meanwhile the task could migrate itself and the action
598 * would be meaningless. It is not serious though.
600 if (task
->flags
& PF_KTHREAD
) {
602 * Wake up a kthread which sleeps interruptedly and
603 * still has not been migrated.
605 wake_up_state(task
, TASK_INTERRUPTIBLE
);
608 * Send fake signal to all non-kthread tasks which are
609 * still not migrated.
611 spin_lock_irq(&task
->sighand
->siglock
);
612 signal_wake_up(task
, 0);
613 spin_unlock_irq(&task
->sighand
->siglock
);
616 read_unlock(&tasklist_lock
);
620 * Drop TIF_PATCH_PENDING of all tasks on admin's request. This forces an
621 * existing transition to finish.
623 * NOTE: klp_update_patch_state(task) requires the task to be inactive or
624 * 'current'. This is not the case here and the consistency model could be
625 * broken. Administrator, who is the only one to execute the
626 * klp_force_transitions(), has to be aware of this.
628 void klp_force_transition(void)
630 struct task_struct
*g
, *task
;
633 pr_warn("forcing remaining tasks to the patched state\n");
635 read_lock(&tasklist_lock
);
636 for_each_process_thread(g
, task
)
637 klp_update_patch_state(task
);
638 read_unlock(&tasklist_lock
);
640 for_each_possible_cpu(cpu
)
641 klp_update_patch_state(idle_task(cpu
));