History

rseq: Switch to fast path processing on exit to user

Now that all bits and pieces are in place, hook the RSEQ handling fast path function into exit_to_user_mode_prepare() after the TIF work bits have been handled. If case of fast path failure, TIF_NOTIFY_RESUME has been raised and the caller needs to take another turn through the TIF handling slow path. This only works for architectures which use the generic entry code. Architectures who still have their own incomplete hacks are not supported and won't be. This results in the following improvements: Kernel build Before After Reduction exit to user 80692981 80514451 signal checks: 32581 121 99% slowpath runs: 1201408 1.49% 198 0.00% 100% fastpath runs: 675941 0.84% N/A id updates: 1233989 1.53% 50541 0.06% 96% cs checks: 1125366 1.39% 0 0.00% 100% cs cleared: 1125366 100% 0 100% cs fixup: 0 0% 0 RSEQ selftests Before After Reduction exit to user: 386281778 387373750 signal checks: 35661203 0 100% slowpath runs: 140542396 36.38% 100 0.00% 100% fastpath runs: 9509789 2.51% N/A id updates: 176203599 45.62% 9087994 2.35% 95% cs checks: 175587856 45.46% 4728394 1.22% 98% cs cleared: 172359544 98.16% 1319307 27.90% 99% cs fixup: 3228312 1.84% 3409087 72.10% The 'cs cleared' and 'cs fixup' percentages are not relative to the exit to user invocations, they are relative to the actual 'cs check' invocations. While some of this could have been avoided in the original code, like the obvious clearing of CS when it's already clear, the main problem of going through TIF_NOTIFY_RESUME cannot be solved. In some workloads the RSEQ notify handler is invoked more than once before going out to user space. Doing this once when everything has stabilized is the only solution to avoid this. The initial attempt to completely decouple it from the TIF work turned out to be suboptimal for workloads, which do a lot of quick and short system calls. Even if the fast path decision is only 4 instructions (including a conditional branch), this adds up quickly and becomes measurable when the rate for actually having to handle rseq is in the low single digit percentage range of user/kernel transitions.

Thomas Gleixner committed 1 year ago

Commit 3db6b381 parent 05b44ae6 files · +41 −22Browse files

Showing the changes to kernel/entry (1 of 6 files). Show all

Unified · Split

kernel/entry/common.c+19−7
@@ -11,13 +11,8 @@ · 10 unmodified lines
11/* Workaround to allow gradual conversion of architecture code */11/* Workaround to allow gradual conversion of architecture code */
12void __weak arch_do_signal_or_restart(struct pt_regs *regs) { }12void __weak arch_do_signal_or_restart(struct pt_regs *regs) { }
13 13
14/**14static __always_inline unsigned long __exit_to_user_mode_loop(struct pt_regs *regs,
15 * exit_to_user_mode_loop - do any pending work before leaving to user space15 unsigned long ti_work)
16 * @regs: Pointer to pt_regs on entry stack
17 * @ti_work: TIF work flags as read by the caller
18 */
19__always_inline unsigned long exit_to_user_mode_loop(struct pt_regs *regs,
20 unsigned long ti_work)
21{16{
22 /*17 /*
23 * Before returning to user space ensure that all pending work18 * Before returning to user space ensure that all pending work
@@ -62,6 +57,23 @@ __always_inline unsigned long exit_to_user_mode_loop(struct pt_regs *regs, · 38 unmodified lines
62 return ti_work;57 return ti_work;
63}58}
64 59
60/**
61 * exit_to_user_mode_loop - do any pending work before leaving to user space
62 * @regs: Pointer to pt_regs on entry stack
63 * @ti_work: TIF work flags as read by the caller
64 */
65__always_inline unsigned long exit_to_user_mode_loop(struct pt_regs *regs,
66 unsigned long ti_work)
67{
68 for (;;) {
69 ti_work = __exit_to_user_mode_loop(regs, ti_work);
70
71 if (likely(!rseq_exit_to_user_mode_restart(regs)))
72 return ti_work;
73 ti_work = read_thread_flags();
74 }
75}
76
65noinstr irqentry_state_t irqentry_enter(struct pt_regs *regs)77noinstr irqentry_state_t irqentry_enter(struct pt_regs *regs)
66{78{
67 irqentry_state_t ret = {79 irqentry_state_t ret = {